|
| NewtonDeadJoints (dgMemoryAllocator *const allocator) |
|
void | DestroyJoints (Newton &world) |
|
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) |
|
dgMemoryAllocator * | GetAllocator () const |
|
void | SetAllocator (dgMemoryAllocator *const allocator) |
|
| operator dgInt32 () const |
|
dgInt32 | GetCount () const |
|
dgTreeNode * | GetRoot () const |
|
dgTreeNode * | Minimum () const |
|
dgTreeNode * | Maximum () const |
|
dgTreeNode * | Find (void * key) const |
|
dgTreeNode * | FindGreater (void * key) const |
|
dgTreeNode * | FindGreaterEqual (void * key) const |
|
dgTreeNode * | FindLessEqual (void * key) const |
|
dgTreeNode * | GetNodeFromInfo (dgConstraint * &info) const |
|
dgTreeNode * | Insert (const dgConstraint * &element, void * key, bool &elementWasInTree) |
|
dgTreeNode * | Insert (const dgConstraint * &element, void * key) |
|
dgTreeNode * | Insert (dgTreeNode *const node, void * key) |
|
dgTreeNode * | Replace (dgConstraint * &element, void * key) |
|
dgTreeNode * | ReplaceKey (void * oldKey, void * newKey) |
|
dgTreeNode * | ReplaceKey (dgTreeNode *const node, void * key) |
|
void | Remove (void * key) |
|
void | Remove (dgTreeNode *const node) |
|
void | RemoveAll () |
|
void | Unlink (dgTreeNode *const node) |
|
void | SwapInfo (dgTree &tree) |
|
bool | SanityCheck () const |
|