2 types derived from RBNode
PresentationFramework (2)
MS\Internal\Data\LiveShapingBlock.cs (1)
11internal class LiveShapingBlock : RBNode<LiveShapingItem>
MS\Internal\Data\RBTree.cs (1)
48internal class RBTree<T> : RBNode<T>, IList<T>
2 instantiations of RBNode
PresentationFramework (2)
MS\Internal\Data\RBNode.cs (1)
814RBNode<T> node = new RBNode<T>();
MS\Internal\Data\RBTree.cs (1)
434return new RBNode<T>();
67 references to RBNode
PresentationFramework (67)
MS\Internal\Data\LiveShapingBlock.cs (2)
32protected override void Copy(RBNode<LiveShapingItem> sourceNode, int sourceOffset, RBNode<LiveShapingItem> destNode, int destOffset, int count)
MS\Internal\Data\LiveShapingTree.cs (1)
37internal override RBNode<LiveShapingItem> NewNode()
MS\Internal\Data\RBFinger.cs (1)
13public RBNode<T> Node { get; set; }
MS\Internal\Data\RBNode.cs (56)
34public RBNode<T> LeftChild { get; set; } 35public RBNode<T> RightChild { get; set; } 36public RBNode<T> Parent { get; set; } 50internal RBNode<T> GetSuccessor() 52RBNode<T> node, parent; 67internal RBNode<T> GetPredecessor() 69RBNode<T> node, parent; 155RBNode<T> leftChild = LeftChild, rightChild = RightChild; 256RBNode<T> startingNode = finger.Node; 268RBNode<T> node = startingNode, parent = node.Parent; 302protected virtual void Copy(RBNode<T> sourceNode, int sourceOffset, RBNode<T> destNode, int destOffset, int count) 310RBNode<T> oldNode = oldFinger.Node, newNode = newFinger.Node; 332RBNode<T> successor = newNode.GetSuccessor(); 349RBNode<T> succsucc = successor; 362RBNode<T> node = finger.Node; 382protected RBNode<T> InsertNodeAfter(RBNode<T> node) 389protected RBTree<T> GetRoot(RBNode<T> node) 391for (RBNode<T> parent = node.Parent; parent != null; node = parent, parent = node.Parent) 397protected RBTree<T> GetRootAndIndex(RBNode<T> node, out int index) 400for (RBNode<T> parent = node.Parent; parent != null; node = parent, parent = node.Parent) 408internal void InsertAt(int offset, T x, RBNode<T> successor = null, RBNode<T> succsucc = null) 502protected RBNode<T> InsertNode(RBTree<T> root, RBNode<T> parent, RBNode<T> node, int index, out RBNode<T> newNode) 536RBNode<T> node, parent; 544RBNode<T> Substitute(RBNode<T> node, RBNode<T> sub, RBNode<T> parent) 560protected RBNode<T> DeleteNode(RBNode<T> parent, RBNode<T> node, int index) 582RBNode<T> temp = node; 589RBNode<T> sub; 600RBNode<T> DeleteLeftmost(RBNode<T> node, out RBNode<T> leftmost) 616bool IsNodeRed(RBNode<T> node) 621RBNode<T> RotateLeft() 623RBNode<T> node = this.RightChild; 635RBNode<T> RotateRight() 637RBNode<T> node = this.LeftChild; 656RBNode<T> Fixup(RBNode<T> node) 667RBNode<T> MoveRedRight(RBNode<T> node) 678RBNode<T> MoveRedLeft(RBNode<T> node) 702protected bool Verify(RBNode<T> node, Comparison<T> comparison, int blackDepth, ref int index, ref T maxItem, out int size) 770protected void SaveTree(RBNode<T> node, StringBuilder sb) 804protected RBNode<T> LoadTree(ref string s) 814RBNode<T> node = new RBNode<T>();
MS\Internal\Data\RBTree.cs (7)
87RBNode<T> node = finger.Node; 100RBNode<T> successor = node.GetSuccessor(); 101RBNode<T> succsucc = null; 418internal RBNode<T> InsertNode(int index) 420RBNode<T> node; 432internal virtual RBNode<T> NewNode() 531RBNode<T> node = LeftChild;