Newton Dynamics  4.00
ndModelLoaderCache Member List

This is the complete list of members for ndModelLoaderCache, including all inherited members.

Find(const ndInt32 &key) const (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
FindCreate(const ndInt32 &key, bool &wasFound) (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
FindGreater(const ndInt32 &key) const (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
FindGreaterEqual(const ndInt32 &key) const (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
FindLessEqual(const ndInt32 &key) const (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
FlushFreeList() (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >inlinestatic
Free(void *const ptr)ndClassAllocstatic
GetCount() const (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
GetNodeFromInfo(const ndModel * &info) const (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
GetRoot() const (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
Insert(const ndInt32 &key) (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
Insert(ndNode *const node, const ndInt32 &key) (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
Insert(const const ndModel * &element, const ndInt32 &key) (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
Insert(const const ndModel * &element, const ndInt32 &key, bool &wasFound) (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
Malloc(size_t size)ndClassAllocstatic
Maximum() const (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
Minimum() const (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
ndClassAlloc()ndClassAllocinline
ndTree() (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
operator ndInt32() const (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
Remove(const ndInt32 &key) (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
Remove(ndNode *const node) (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
RemoveAll() (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
Replace(const ndModel * &element, const ndInt32 &key) (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
ReplaceKey(const ndInt32 &oldKey, const ndInt32 &newKey) (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
ReplaceKey(ndNode *const node, const ndInt32 &key) (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
SanityCheck() const (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
SwapInfo(ndTree &tree) (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
Unlink(ndNode *const node) (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >
~ndClassAlloc()ndClassAllocinline
~ndTree() (defined in ndTree< const ndModel *, ndInt32 >)ndTree< const ndModel *, ndInt32 >