Pol::Plib::AStarSearch< UserState > Member List

This is the complete list of members for Pol::Plib::AStarSearch< UserState >, including all inherited members.

AddSuccessor(UserState &State)	Pol::Plib::AStarSearch< UserState >	inline
AddToSolutionList(Node *theNode)	Pol::Plib::AStarSearch< UserState >	inline
AllocateNode()	Pol::Plib::AStarSearch< UserState >	inlineprivate
AStarSearch(int MaxNodes=1000)	Pol::Plib::AStarSearch< UserState >	inline
CancelSearch()	Pol::Plib::AStarSearch< UserState >	inline
FreeAllNodes()	Pol::Plib::AStarSearch< UserState >	inlineprivate
FreeNode(Node *node)	Pol::Plib::AStarSearch< UserState >	inlineprivate
FreeSolutionNodes()	Pol::Plib::AStarSearch< UserState >	inline
FreeUnusedNodes()	Pol::Plib::AStarSearch< UserState >	inlineprivate
GetClosedListNext()	Pol::Plib::AStarSearch< UserState >	inline
GetClosedListNext(float &f, float &g, float &h)	Pol::Plib::AStarSearch< UserState >	inline
GetClosedListStart()	Pol::Plib::AStarSearch< UserState >	inline
GetClosedListStart(float &f, float &g, float &h)	Pol::Plib::AStarSearch< UserState >	inline
GetOpenListNext()	Pol::Plib::AStarSearch< UserState >	inline
GetOpenListNext(float &f, float &g, float &h)	Pol::Plib::AStarSearch< UserState >	inline
GetOpenListStart()	Pol::Plib::AStarSearch< UserState >	inline
GetOpenListStart(float &f, float &g, float &h)	Pol::Plib::AStarSearch< UserState >	inline
GetSolutionEnd()	Pol::Plib::AStarSearch< UserState >	inline
GetSolutionNext()	Pol::Plib::AStarSearch< UserState >	inline
GetSolutionPrev()	Pol::Plib::AStarSearch< UserState >	inline
GetSolutionStart()	Pol::Plib::AStarSearch< UserState >	inline
GetStepCount()	Pol::Plib::AStarSearch< UserState >	inline
InClosedList(UserState &theState)	Pol::Plib::AStarSearch< UserState >	inline
InOpenList(UserState &theState)	Pol::Plib::AStarSearch< UserState >	inline
iterDbgClosed	Pol::Plib::AStarSearch< UserState >	private
iterDbgOpen	Pol::Plib::AStarSearch< UserState >	private
m_AllocateNodeCount	Pol::Plib::AStarSearch< UserState >	private
m_CancelRequest	Pol::Plib::AStarSearch< UserState >	private
m_ClosedList	Pol::Plib::AStarSearch< UserState >	private
m_CurrentSolutionNode	Pol::Plib::AStarSearch< UserState >	private
m_FixedSizeAllocator	Pol::Plib::AStarSearch< UserState >	private
m_FreeNodeCount	Pol::Plib::AStarSearch< UserState >	private
m_Goal	Pol::Plib::AStarSearch< UserState >	private
m_OpenList	Pol::Plib::AStarSearch< UserState >	private
m_SolutionList	Pol::Plib::AStarSearch< UserState >	private
m_Start	Pol::Plib::AStarSearch< UserState >	private
m_State	Pol::Plib::AStarSearch< UserState >	private
m_Steps	Pol::Plib::AStarSearch< UserState >	private
m_Successors	Pol::Plib::AStarSearch< UserState >	private
NodeVector typedef	Pol::Plib::AStarSearch< UserState >
NodeVectorIterator typedef	Pol::Plib::AStarSearch< UserState >
SEARCH_STATE_FAILED enum value	Pol::Plib::AStarSearch< UserState >
SEARCH_STATE_INVALID enum value	Pol::Plib::AStarSearch< UserState >
SEARCH_STATE_NOT_INITIALISED enum value	Pol::Plib::AStarSearch< UserState >
SEARCH_STATE_OUT_OF_MEMORY enum value	Pol::Plib::AStarSearch< UserState >
SEARCH_STATE_SEARCHING enum value	Pol::Plib::AStarSearch< UserState >
SEARCH_STATE_SOLUTION_CORRUPTED enum value	Pol::Plib::AStarSearch< UserState >
SEARCH_STATE_SUCCEEDED enum value	Pol::Plib::AStarSearch< UserState >
SearchStep(bool doors_block)	Pol::Plib::AStarSearch< UserState >	inline
SetStartAndGoalStates(UserState &Start, UserState &Goal)	Pol::Plib::AStarSearch< UserState >	inline