Package com.mmoscene.h4j.habbohotel.pathfinding

Examples of com.mmoscene.h4j.habbohotel.pathfinding.Position

22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
                    actor.getGoalPosition().setY(0);

                    actor.removeStatus("mv");
                    actor.sendRoomActorStatusMessageComposer();
                } else {
                    Position p = H4J.getHabboHotel().getPathfinder().getNextNode(
                            actor.getCurrentPosition(), actor.getGoalPosition(), actor.getCurrentRoom());

                    int rotation = actor.getCurrentPosition().calculateRotation(p.getX(), p.getY());

                    actor.addStatus("mv", p.getX() + "," + p.getY() + "," + Double.toString(0.0));

                    actor.getCurrentPosition().setRotation(rotation);
                    actor.sendRoomActorStatusMessageComposer();

                    actor.getCurrentPosition().setX(p.getX());
                    actor.getCurrentPosition().setY(p.getY());
                }
                try {
                    Thread.sleep(500);
                } catch(Exception ex) { }
            }
View Full Code Here
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
                 addAllNeighbors(end, v, room);
             } catch(Exception ignored) {}
         }

        while(v.getX()[v.getParent()[v.location]] != start.getX() || v.getY()[v.getParent()[v.location]] != start.getY()) {
            path.add(new Position(v.getX()[v.location], v.getY()[v.location], 0, 0));
            v.location = v.getParent()[v.location];
        }

        path.add(new Position(v.getX()[v.location], v.getY()[v.location], 0, 0));

        Collections.reverse(path);

        return path;
    }
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
        return path;
    }

    private void addNeighbor(Position start, Position end, Values v, Room r) {
        Position n = new Position(
                v.getX()[v.location] + start.getX(),
                v.getY()[v.location] + start.getY(), 0, 0);

        if (n.getX() < 0 || n.getY() < 0) {
            return;
        }

        short p = v.location;

        if (n.getX() >= r.getModel().getLimitX() || n.getY() >= r.getModel().getLimitY()) { //out of bounds
            return;
        }

        if (r.getModel().getSquareStates()[n.getX()][n.getY()] == 2) { //someone is there?? o.o
            return;
        }

        if (r.getModel().getSquares()[n.getX()][n.getY()] == SquareState.CLOSED ||
                (n.getY() != end.getY() && n.getX() != end.getX())) {
            return;
        }

        if (p > 0) {
            if (v.getX()[p] != n.getX() && v.getY()[p] != n.getY()) {
                if (r.getModel().getSquares()[n.getX()][v.getY()[p]] == SquareState.CLOSED ||
                        r.getModel().getSquares()[v.getX()[p]][n.getY()] == SquareState.CLOSED) {
                    //return;
                }
            }
        }

        if (v.getTiles()[n.getX()][n.getY()] == 1) {
            short i = 1;

            for (; i <= v.count; i++) {
                if  (v.getX()[i] == n.getX() && v.getY()[i] == n.getY()) {
                    break;
                }
            }

            if (v.getX()[i] == end.getX() || v.getY()[i] == end.getY()) {
                if (10 + v.getG()[p] < v.getG()[i]) {
                    v.getParent()[i] = p;
                } else if(14 + v.getG()[p] < v.getG()[i]) {
                    v.getParent()[i] = p;
                    return;
                }
            }

            v.lastID++;
            v.count++;
            v.getBinaryHeap()[v.count] = v.lastID;
            v.getX()[v.lastID] = n.getX();
            v.getY()[v.lastID] = n.getY();
            v.getH()[v.lastID] = (short) n.distanceFrom(end);
            v.getParent()[v.lastID] = p;

            if (n.getX() == v.getX()[p] || n.getY() == v.getY()[p]) {
                v.getG()[v.lastID] = (short) (10 + v.getG()[p]);
            } else {
                v.getG()[v.lastID] = (short) (14 + v.getG()[p]);
            }

            v.getF()[v.lastID] = (short) (v.getG()[v.lastID] + v.getH()[v.lastID]);

            for(short s = v.count; s != 1; s /= 2) {
                if (v.getF()[v.getBinaryHeap()[s]] > v.getF()[v.getBinaryHeap()[s / 2]]) { //what the fuk D:
                    break;
                }

                /*
                    Invert the values..
                 */
                short t = v.getBinaryHeap()[s / 2];

                v.getBinaryHeap()[s / 2] = v.getBinaryHeap()[s];
                v.getBinaryHeap()[s] = t;
            }

            v.getTiles()[n.getX()][n.getY()] = 1;
        }
    }
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
                    while(set.next()) {
                        Model m = new Model();

                        m.setName(set.getString("id"));

                        m.setDoor(new Position(
                                set.getInt("door_x"),
                                set.getInt("door_y"),
                                set.getInt("door_z"),
                                set.getInt("door_dir")));
View Full Code Here
166
167
168
169
170
171
172
173
        }
    }

    private void addAllNeighbors(Position end, Values v, Room r) {
        for(Point p : proximity) {
            addNeighbor(new Position(p.x, p.y, 0, 0), end, v, r);
        }
    }
View Full Code Here
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
        new Point(1, 1),
        new Point(-1, -1)
    };

    public Position getNextNode(Position current, Position end, Room room) {
        Position p = new Position(0, 0, 0, 0);

        double pointer = current.distanceFrom(end);

        for(Point c : proximity) {
            Position n = new Position(c.x + current.getX(), c.y + current.getY(), current.getZ(), 0);

            if (n.getX() < 0 && n.getY() < 0) { //it isn't a real tile..
                continue;
            }

            if (n.getX() > room.getModel().getLimitX() || n.getY() > room.getModel().getLimitY()) { //it's above the limits
                continue;
            }

            if (room.getModel().getSquares()[n.getX()][n.getY()] == SquareState.CLOSED) { //it's a closed tile anyways
                continue;
            }

            if (pointer > n.distanceFrom(end)) {
                pointer = n.distanceFrom(end);
                p = n;
            }
        }

        return p;
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
        LinkedList<Position> path = new LinkedList<>();

        double limit = start.distanceFrom(end);
        H4J.getLogger("a").info("Le limit: " + limit);
        double distancePointer = limit;
        Position current = start;
        Position lastCurrent = current;

        while(true) {
            for(Point p : proximity) {
                Position n = new Position(p.x + current.getX(), p.y + current.getY(), 0, 0); //TODO: Z

                if (n.getX() < 0 && n.getY() < 0) { //it isn't a real tile..
                    continue;
                }

                if (n.getX() > room.getModel().getLimitX() || n.getY() > room.getModel().getLimitY()) { //it's above the limits
                    continue;
                }

                if (room.getModel().getSquares()[n.getX()][n.getY()] == SquareState.CLOSED) { //it's a closed tile anyways
                    continue;
                }

                if (distancePointer > n.distanceFrom(end)) {  //it's out of bounds
                    distancePointer = n.distanceFrom(end);
                    H4J.getLogger("a").info(limit + " => " + n.getX() + "|" + n.getY());
                    current = n;
                }
            }

            path.add(current);
View Full Code Here
TOP

Related Classes of com.mmoscene.h4j.habbohotel.pathfinding.Position

  • com.mmoscene.h4j.database.Room
  • com.mmoscene.h4j.habbohotel.pathfinding.complex.ComplexPathfinder
  • com.mmoscene.h4j.habbohotel.pathfinding.simple.SimplePathfinder
  • com.mmoscene.h4j.habbohotel.rooms.actors.WalkTask
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.