| _accessMethod | System.Data.RBTree< K > | private |
| _inUseNodeCount | System.Data.RBTree< K > | private |
| _inUsePageCount | System.Data.RBTree< K > | private |
| _inUseSatelliteTreeCount | System.Data.RBTree< K > | private |
| _nextFreePageLine | System.Data.RBTree< K > | private |
| _pageTable | System.Data.RBTree< K > | private |
| _pageTableMap | System.Data.RBTree< K > | private |
| _version | System.Data.RBTree< K > | private |
| Add(K item) | System.Data.RBTree< K > | inline |
| AllocPage(int size) | System.Data.RBTree< K > | inlineprivate |
| Clear() | System.Data.RBTree< K > | inline |
| color(int nodeId) | System.Data.RBTree< K > | inlineprivate |
| CompareNode(K record1, K record2) | System.Data.RBTree< K > | protected |
| CompareSateliteTreeNode(K record1, K record2) | System.Data.RBTree< K > | protected |
| ComputeIndexByNode(int nodeId) | System.Data.RBTree< K > | inlineprivate |
| ComputeIndexWithSatelliteByNode(int nodeId) | System.Data.RBTree< K > | inlineprivate |
| ComputeNodeByIndex(int index, out int satelliteRootId) | System.Data.RBTree< K > | inlineprivate |
| ComputeNodeByIndex(int x_id, int index) | System.Data.RBTree< K > | inlineprivate |
| CopyTo(Array array, int index) | System.Data.RBTree< K > | inline |
| CopyTo(K[] array, int index) | System.Data.RBTree< K > | inline |
| Count | System.Data.RBTree< K > | |
| DecreaseSize(int nodeId) | System.Data.RBTree< K > | inlineprivate |
| DeleteByIndex(int i) | System.Data.RBTree< K > | inline |
| FreeNode(int nodeId) | System.Data.RBTree< K > | inlineprivate |
| FreePage(TreePage page) | System.Data.RBTree< K > | inlineprivate |
| GetEnumerator() | System.Data.RBTree< K > | inline |
| GetIndexByKey(K key) | System.Data.RBTree< K > | inline |
| GetIndexByNode(int node) | System.Data.RBTree< K > | inline |
| GetIndexByNodePath(NodePath path) | System.Data.RBTree< K > | inlineprivate |
| GetIndexOfPageWithFreeSlot(bool allocatedPage) | System.Data.RBTree< K > | inlineprivate |
| GetIntValueFromBitMap(uint bitMap) | System.Data.RBTree< K > | inlineprivatestatic |
| GetNewNode(K key) | System.Data.RBTree< K > | inlineprivate |
| GetNodeByIndex(int userIndex) | System.Data.RBTree< K > | inlineprivate |
| GetNodeByKey(K key) | System.Data.RBTree< K > | inlineprivate |
| HasDuplicates | System.Data.RBTree< K > | |
| IncreaseSize(int nodeId) | System.Data.RBTree< K > | inlineprivate |
| IndexOf(int nodeId, K item) | System.Data.RBTree< K > | inline |
| InitTree() | System.Data.RBTree< K > | inlineprivate |
| Insert(K item) | System.Data.RBTree< K > | inline |
| Insert(int position, K item) | System.Data.RBTree< K > | inline |
| InsertAt(int position, K item, bool append) | System.Data.RBTree< K > | inline |
| Key(int nodeId) | System.Data.RBTree< K > | inline |
| Left(int nodeId) | System.Data.RBTree< K > | inline |
| LeftRotate(int root_id, int x_id, int mainTreeNode) | System.Data.RBTree< K > | inlineprivate |
| MarkPageFree(TreePage page) | System.Data.RBTree< K > | inlineprivate |
| MarkPageFull(TreePage page) | System.Data.RBTree< K > | inlineprivate |
| Minimum(int x_id) | System.Data.RBTree< K > | inlineprivate |
| Next(int nodeId) | System.Data.RBTree< K > | inline |
| Parent(int nodeId) | System.Data.RBTree< K > | inline |
| RBDelete(int z_id) | System.Data.RBTree< K > | inline |
| RBDeleteFixup(int root_id, int x_id, int px_id, int mainTreeNodeID) | System.Data.RBTree< K > | inlineprivate |
| RBDeleteX(int root_id, int z_id, int mainTreeNodeID) | System.Data.RBTree< K > | inlineprivate |
| RBInsert(int root_id, int x_id, int mainTreeNodeID, int position, bool append) | System.Data.RBTree< K > | inlineprivate |
| RBTree(TreeAccessMethod accessMethod) | System.Data.RBTree< K > | inlineprotected |
| RecomputeSize(int nodeId) | System.Data.RBTree< K > | inlineprivate |
| RemoveAt(int position) | System.Data.RBTree< K > | inline |
| Right(int nodeId) | System.Data.RBTree< K > | inline |
| RightRotate(int root_id, int x_id, int mainTreeNode) | System.Data.RBTree< K > | inlineprivate |
| root | System.Data.RBTree< K > | |
| Search(K key) | System.Data.RBTree< K > | inline |
| SearchSubTree(int root_id, K key) | System.Data.RBTree< K > | inlineprivate |
| SetColor(int nodeId, NodeColor color) | System.Data.RBTree< K > | inlineprivate |
| SetKey(int nodeId, K key) | System.Data.RBTree< K > | inlineprivate |
| SetLeft(int nodeId, int leftNodeId) | System.Data.RBTree< K > | inlineprivate |
| SetNext(int nodeId, int nextNodeId) | System.Data.RBTree< K > | inlineprivate |
| SetParent(int nodeId, int parentNodeId) | System.Data.RBTree< K > | inlineprivate |
| SetRight(int nodeId, int rightNodeId) | System.Data.RBTree< K > | inlineprivate |
| SetSubTreeSize(int nodeId, int size) | System.Data.RBTree< K > | inlineprivate |
| SubTreeSize(int nodeId) | System.Data.RBTree< K > | inline |
| Successor(int x_id) | System.Data.RBTree< K > | inlineprivate |
| Successor(ref int nodeId, ref int mainTreeNodeId) | System.Data.RBTree< K > | inlineprivate |
| this[int index] | System.Data.RBTree< K > | |
| UpdateNodeKey(K currentKey, K newKey) | System.Data.RBTree< K > | inline |
1.10.0