55 struct compare_squarecost
59 return (s1->
f > s2->
f);
121 moves_to_goal.clear ();
140 return moves_to_goal.size ();
152 return moves_to_goal[nbr_moves () - (nbr + 1)];
178 vector <u_int16> moves_to_goal;
Class to write data from a Gzip compressed file.
Class to read data from a Gzip compressed file.
area_coord goal
Goal point.
#define u_int16
16 bits long unsigned integer
area_coord start
Start point.
u_int16 submap
Submap where the pathfinding will occur.
u_int16 dir
Direction to face once the goal is reached.
landmap * refmap
Landmap where the pathfinding will occur.
void clear()
Totally clears the path.
Base unit of a landsubmap, where you can place mapobjects or mapcharacters.
A* pathfinding algorithm implementation class.
Map where the world takes place.
(x, y) coordinates of a point on a submap.
Declares the mapsquare and mapsquare_area classes.
#define s_int8
8 bits long signed integer
u_int16 get_move(u_int16 nbr) const
Returns the move to perform when at position nbr.
u_int16 nbr_moves() const
Returns the number of moves between start and goal.