|
| dgPathOpenHeap (dgInt32 maxElements) |
|
| dgHeapBase (dgInt32 maxElements, dgMemoryAllocator *const allocator) |
|
| dgHeapBase (const void *const buffer, dgInt32 sizeInBytes) |
|
|
| dgUpHeap (dgInt32 maxElements, dgMemoryAllocator *const allocator) |
|
| dgUpHeap (const void *const buffer, dgInt32 sizeInBytes) |
|
void | Pop () |
|
void | Push (dgPathCloseList< NODEID, COST >::dgTreeNode * &obj, COST key) |
|
void | Sort () |
|
void | Remove (dgInt32 Index) |
|
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) |
|
void | Flush () |
|
COST | MaxValue () const |
|
COST | Value (dgInt32 i=0) const |
|
dgInt32 | GetCount () const |
|
dgInt32 | GetMaxCount () const |
|
const dgPathCloseList< NODEID, COST >::dgTreeNode * & | operator[] (dgInt32 i) const |
|
dgPathCloseList< NODEID, COST >::dgTreeNode * & | operator[] (dgInt32 i) |
|
dgInt32 | Find (dgPathCloseList< NODEID, COST >::dgTreeNode * &obj) |
|
dgInt32 | Find (COST key) |
|
dgInt32 | m_curCount |
|
dgInt32 | m_maxCount |
|
dgMemoryAllocator * | m_allocator |
|
RECORD * | m_pool |
|
The documentation for this class was generated from the following file: