ScummVM API documentation
dgPathFinder< NODEID, COST > Class Template Reference
Inheritance diagram for dgPathFinder< NODEID, COST >:
dgPathCloseList< NODEID, COST > dgTree< dgPathNode< NODEID, COST >, NODEID >

Public Member Functions

 dgPathFinder (dgInt32 maxElementsInOpenList, dgInt32 nodeMaxChildren)
 
virtual const dgPathNode< NODEID, COST > * CalCulatePath (NODEID source, NODEID goal)
 
virtual COST GetCostFromParent (const dgPathNode< NODEID, COST > &node) const
 
virtual COST GetEstimatedCostToGoal (NODEID id) const
 
virtual dgInt32 EnumerateChildren (NODEID parent, NODEID array[]) const
 
- Public Member Functions inherited from dgTree< dgPathNode< NODEID, COST >, NODEID >
void operator delete (void *const ptr, dgMemoryAllocator *const allocator)
 
void operator delete (void *const ptr)
 
void operator delete[] (void *const ptr, dgMemoryAllocator *const allocator)
 
void operator delete[] (void *const ptr)
 
void * operator new (size_t size, dgMemoryAllocator *const allocator)
 
void * operator new (size_t size)
 
void * operator new[] (size_t size, dgMemoryAllocator *const allocator)
 
void * operator new[] (size_t size)
 
 dgTree (dgMemoryAllocator *const allocator)
 
dgMemoryAllocatorGetAllocator () const
 
void SetAllocator (dgMemoryAllocator *const allocator)
 
 operator dgInt32 () const
 
dgInt32 GetCount () const
 
dgTreeNode * GetRoot () const
 
dgTreeNode * Minimum () const
 
dgTreeNode * Maximum () const
 
dgTreeNode * Find (NODEID key) const
 
dgTreeNode * FindGreater (NODEID key) const
 
dgTreeNode * FindGreaterEqual (NODEID key) const
 
dgTreeNode * FindLessEqual (NODEID key) const
 
dgTreeNode * GetNodeFromInfo (dgPathNode< NODEID, COST > &info) const
 
dgTreeNode * Insert (const dgPathNode< NODEID, COST > &element, NODEID key, bool &elementWasInTree)
 
dgTreeNode * Insert (const dgPathNode< NODEID, COST > &element, NODEID key)
 
dgTreeNode * Insert (dgTreeNode *const node, NODEID key)
 
dgTreeNode * Replace (dgPathNode< NODEID, COST > &element, NODEID key)
 
dgTreeNode * ReplaceKey (NODEID oldKey, NODEID newKey)
 
dgTreeNode * ReplaceKey (dgTreeNode *const node, NODEID key)
 
void Remove (NODEID key)
 
void Remove (dgTreeNode *const node)
 
void RemoveAll ()
 
void Unlink (dgTreeNode *const node)
 
void SwapInfo (dgTree &tree)
 
bool SanityCheck () const
 

Public Attributes

dgPathOpenHeap< NODEID, COST > m_openList
 

The documentation for this class was generated from the following file: