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