2 types derived from RBNode
PresentationFramework (2)
MS\Internal\Data\LiveShapingBlock.cs (1)
10internal class LiveShapingBlock : RBNode<LiveShapingItem>
MS\Internal\Data\RBTree.cs (1)
47internal class RBTree<T> : RBNode<T>, IList<T>
2 instantiations of RBNode
PresentationFramework (2)
MS\Internal\Data\RBNode.cs (1)
813RBNode<T> node = new RBNode<T>();
MS\Internal\Data\RBTree.cs (1)
433return new RBNode<T>();
67 references to RBNode
PresentationFramework (67)
MS\Internal\Data\LiveShapingBlock.cs (2)
34protected override void Copy(RBNode<LiveShapingItem> sourceNode, int sourceOffset, RBNode<LiveShapingItem> destNode, int destOffset, int count)
MS\Internal\Data\LiveShapingTree.cs (1)
36internal override RBNode<LiveShapingItem> NewNode()
MS\Internal\Data\RBFinger.cs (1)
12public RBNode<T> Node { get; set; }
MS\Internal\Data\RBNode.cs (56)
33public RBNode<T> LeftChild { get; set; } 34public RBNode<T> RightChild { get; set; } 35public RBNode<T> Parent { get; set; } 49internal RBNode<T> GetSuccessor() 51RBNode<T> node, parent; 66internal RBNode<T> GetPredecessor() 68RBNode<T> node, parent; 154RBNode<T> leftChild = LeftChild, rightChild = RightChild; 255RBNode<T> startingNode = finger.Node; 267RBNode<T> node = startingNode, parent = node.Parent; 301protected virtual void Copy(RBNode<T> sourceNode, int sourceOffset, RBNode<T> destNode, int destOffset, int count) 309RBNode<T> oldNode = oldFinger.Node, newNode = newFinger.Node; 331RBNode<T> successor = newNode.GetSuccessor(); 348RBNode<T> succsucc = successor; 361RBNode<T> node = finger.Node; 381protected RBNode<T> InsertNodeAfter(RBNode<T> node) 388protected RBTree<T> GetRoot(RBNode<T> node) 390for (RBNode<T> parent = node.Parent; parent != null; node = parent, parent = node.Parent) 396protected RBTree<T> GetRootAndIndex(RBNode<T> node, out int index) 399for (RBNode<T> parent = node.Parent; parent != null; node = parent, parent = node.Parent) 407internal void InsertAt(int offset, T x, RBNode<T> successor = null, RBNode<T> succsucc = null) 501protected RBNode<T> InsertNode(RBTree<T> root, RBNode<T> parent, RBNode<T> node, int index, out RBNode<T> newNode) 535RBNode<T> node, parent; 543private RBNode<T> Substitute(RBNode<T> node, RBNode<T> sub, RBNode<T> parent) 559protected RBNode<T> DeleteNode(RBNode<T> parent, RBNode<T> node, int index) 581RBNode<T> temp = node; 588RBNode<T> sub; 599private RBNode<T> DeleteLeftmost(RBNode<T> node, out RBNode<T> leftmost) 615private bool IsNodeRed(RBNode<T> node) 620private RBNode<T> RotateLeft() 622RBNode<T> node = this.RightChild; 634private RBNode<T> RotateRight() 636RBNode<T> node = this.LeftChild; 655private RBNode<T> Fixup(RBNode<T> node) 666private RBNode<T> MoveRedRight(RBNode<T> node) 677private RBNode<T> MoveRedLeft(RBNode<T> node) 701protected bool Verify(RBNode<T> node, Comparison<T> comparison, int blackDepth, ref int index, ref T maxItem, out int size) 769protected void SaveTree(RBNode<T> node, StringBuilder sb) 803protected RBNode<T> LoadTree(ref string s) 813RBNode<T> node = new RBNode<T>();
MS\Internal\Data\RBTree.cs (7)
86RBNode<T> node = finger.Node; 99RBNode<T> successor = node.GetSuccessor(); 100RBNode<T> succsucc = null; 417internal RBNode<T> InsertNode(int index) 419RBNode<T> node; 431internal virtual RBNode<T> NewNode() 530RBNode<T> node = LeftChild;