Go to the documentation of this file.
23 const uint8_t
k45 = 1;
24 const uint8_t
k90 = 2;
85 void SetGround(
int x,
int y, uint8_t val);
87 bool Valid(
int x,
int y);
void DoNormal(recVec pa, recVec pb) const
bool GoalTest(const airplaneState &node, const airplaneState &goal) const
void GLDrawLine(const airplaneState &a, const airplaneState &b) const
A generic vector (essentially the same as a point, but offers normalization)
void RecurseGround(int x1, int y1, int x2, int y2)
bool GoalTest(const airplaneState &) const
Goal Test if the goal is stored.
recVec & GetNormal(int x, int y)
uint64_t GetStateHash(const airplaneState &node) const
virtual void ApplyAction(airplaneState &s, airplaneAction dir) const
std::vector< airplaneAction > internalActions
void GetSuccessors(const airplaneState &nodeID, std::vector< airplaneState > &neighbors) const
virtual void GetNextState(const airplaneState ¤ts, airplaneAction dir, airplaneState &news) const
virtual double HCost(const airplaneState &node1, const airplaneState &node2) const
Heuristic value between two arbitrary nodes.
std::vector< uint8_t > ground
void SetGround(int x, int y, uint8_t val)
recVec GetCoordinate(int x, int y, int z) const
bool operator==(const airplaneState &s1, const airplaneState &s2)
virtual void UndoAction(airplaneState &s, airplaneAction dir) const
virtual OccupancyInterface< airplaneState, airplaneAction > * GetOccupancyInfo()
void GetActions(const airplaneState &nodeID, std::vector< airplaneAction > &actions) const
virtual double HCost(const airplaneState &) const
Heuristic value between node and the stored goal.
uint8_t GetGround(int x, int y) const
virtual void OpenGLDraw() const
virtual bool InvertAction(airplaneAction &a) const
uint64_t GetActionHash(airplaneAction act) const
virtual double GCost(const airplaneState &node1, const airplaneState &node2) const
airplaneAction(int8_t t=0, int8_t s=0, int8_t h=0)
Nodes to be stored within a Graph.
std::vector< recVec > groundNormals