dgHeapBase(dgInt32 maxElements, dgMemoryAllocator *const allocator) (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | protected |
dgHeapBase(const void *const buffer, dgInt32 sizeInBytes) (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | protected |
dgPathOpenHeap(dgInt32 maxElements) (defined in dgPathOpenHeap< NODEID, COST >) | dgPathOpenHeap< NODEID, COST > | inlineprotected |
dgUpHeap(dgInt32 maxElements, dgMemoryAllocator *const allocator) (defined in dgUpHeap< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgUpHeap< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
dgUpHeap(const void *const buffer, dgInt32 sizeInBytes) (defined in dgUpHeap< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgUpHeap< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
Find(dgPathCloseList< NODEID, COST >::dgTreeNode * &obj) (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
Find(COST key) (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
Flush() (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
GetCount() const (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
GetMaxCount() const (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
m_allocator (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
m_curCount (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
m_maxCount (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
m_pool (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
MaxValue() const (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
operator delete(void *const ptr, dgMemoryAllocator *const allocator) (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | inline |
operator delete(void *const ptr) (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | inline |
operator delete[](void *const ptr, dgMemoryAllocator *const allocator) (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | inline |
operator delete[](void *const ptr) (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | inline |
operator new(size_t size, dgMemoryAllocator *const allocator) (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | inline |
operator new(size_t size) (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | inline |
operator new[](size_t size, dgMemoryAllocator *const allocator) (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | inline |
operator new[](size_t size) (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | inline |
operator[](dgInt32 i) const (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
operator[](dgInt32 i) (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
Pop() (defined in dgUpHeap< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgUpHeap< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
Push(dgPathCloseList< NODEID, COST >::dgTreeNode * &obj, COST key) (defined in dgUpHeap< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgUpHeap< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
Remove(dgInt32 Index) (defined in dgUpHeap< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgUpHeap< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
Sort() (defined in dgUpHeap< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgUpHeap< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
Value(dgInt32 i=0) const (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | |
~dgHeapBase() (defined in dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST >) | dgHeapBase< dgPathCloseList< NODEID, COST >::dgTreeNode *, COST > | protected |