Add(objType *object, keyType key) | idBTree< objType, keyType, maxChildrenPerNode > | |
AllocNode(void) | idBTree< objType, keyType, maxChildrenPerNode > | private |
CheckTree(void) const | idBTree< objType, keyType, maxChildrenPerNode > | private |
CheckTree_r(idBTreeNode< objType, keyType > *node, int &numNodes) const | idBTree< objType, keyType, maxChildrenPerNode > | private |
Find(keyType key) const | idBTree< objType, keyType, maxChildrenPerNode > | |
FindLargestSmallerEqual(keyType key) const | idBTree< objType, keyType, maxChildrenPerNode > | |
FindSmallestLargerEqual(keyType key) const | idBTree< objType, keyType, maxChildrenPerNode > | |
FreeNode(idBTreeNode< objType, keyType > *node) | idBTree< objType, keyType, maxChildrenPerNode > | private |
GetNext(idBTreeNode< objType, keyType > *node) const | idBTree< objType, keyType, maxChildrenPerNode > | |
GetNextLeaf(idBTreeNode< objType, keyType > *node) const | idBTree< objType, keyType, maxChildrenPerNode > | |
GetNodeCount(void) const | idBTree< objType, keyType, maxChildrenPerNode > | |
GetRoot(void) const | idBTree< objType, keyType, maxChildrenPerNode > | |
idBTree(void) | idBTree< objType, keyType, maxChildrenPerNode > | |
Init(void) | idBTree< objType, keyType, maxChildrenPerNode > | |
MergeNodes(idBTreeNode< objType, keyType > *node1, idBTreeNode< objType, keyType > *node2) | idBTree< objType, keyType, maxChildrenPerNode > | private |
nodeAllocator | idBTree< objType, keyType, maxChildrenPerNode > | private |
Remove(idBTreeNode< objType, keyType > *node) | idBTree< objType, keyType, maxChildrenPerNode > | |
root | idBTree< objType, keyType, maxChildrenPerNode > | private |
Shutdown(void) | idBTree< objType, keyType, maxChildrenPerNode > | |
SplitNode(idBTreeNode< objType, keyType > *node) | idBTree< objType, keyType, maxChildrenPerNode > | private |
~idBTree(void) | idBTree< objType, keyType, maxChildrenPerNode > | |