2 types derived from RBNode
PresentationFramework (2)
MS\Internal\Data\LiveShapingBlock.cs (1)
19internal class LiveShapingBlock : RBNode<LiveShapingItem>
MS\Internal\Data\RBTree.cs (1)
52internal class RBTree<T> : RBNode<T>, IList<T>
2 instantiations of RBNode
PresentationFramework (2)
MS\Internal\Data\RBNode.cs (1)
818RBNode<T> node = new RBNode<T>();
MS\Internal\Data\RBTree.cs (1)
438return new RBNode<T>();
67 references to RBNode
PresentationFramework (67)
MS\Internal\Data\LiveShapingBlock.cs (2)
40protected 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)
38public RBNode<T> LeftChild { get; set; } 39public RBNode<T> RightChild { get; set; } 40public RBNode<T> Parent { get; set; } 54internal RBNode<T> GetSuccessor() 56RBNode<T> node, parent; 71internal RBNode<T> GetPredecessor() 73RBNode<T> node, parent; 159RBNode<T> leftChild = LeftChild, rightChild = RightChild; 260RBNode<T> startingNode = finger.Node; 272RBNode<T> node = startingNode, parent = node.Parent; 306protected virtual void Copy(RBNode<T> sourceNode, int sourceOffset, RBNode<T> destNode, int destOffset, int count) 314RBNode<T> oldNode = oldFinger.Node, newNode = newFinger.Node; 336RBNode<T> successor = newNode.GetSuccessor(); 353RBNode<T> succsucc = successor; 366RBNode<T> node = finger.Node; 386protected RBNode<T> InsertNodeAfter(RBNode<T> node) 393protected RBTree<T> GetRoot(RBNode<T> node) 395for (RBNode<T> parent = node.Parent; parent != null; node = parent, parent = node.Parent) 401protected RBTree<T> GetRootAndIndex(RBNode<T> node, out int index) 404for (RBNode<T> parent = node.Parent; parent != null; node = parent, parent = node.Parent) 412internal void InsertAt(int offset, T x, RBNode<T> successor = null, RBNode<T> succsucc = null) 506protected RBNode<T> InsertNode(RBTree<T> root, RBNode<T> parent, RBNode<T> node, int index, out RBNode<T> newNode) 540RBNode<T> node, parent; 548RBNode<T> Substitute(RBNode<T> node, RBNode<T> sub, RBNode<T> parent) 564protected RBNode<T> DeleteNode(RBNode<T> parent, RBNode<T> node, int index) 586RBNode<T> temp = node; 593RBNode<T> sub; 604RBNode<T> DeleteLeftmost(RBNode<T> node, out RBNode<T> leftmost) 620bool IsNodeRed(RBNode<T> node) 625RBNode<T> RotateLeft() 627RBNode<T> node = this.RightChild; 639RBNode<T> RotateRight() 641RBNode<T> node = this.LeftChild; 660RBNode<T> Fixup(RBNode<T> node) 671RBNode<T> MoveRedRight(RBNode<T> node) 682RBNode<T> MoveRedLeft(RBNode<T> node) 706protected bool Verify(RBNode<T> node, Comparison<T> comparison, int blackDepth, ref int index, ref T maxItem, out int size) 774protected void SaveTree(RBNode<T> node, StringBuilder sb) 808protected RBNode<T> LoadTree(ref string s) 818RBNode<T> node = new RBNode<T>();
MS\Internal\Data\RBTree.cs (7)
91RBNode<T> node = finger.Node; 104RBNode<T> successor = node.GetSuccessor(); 105RBNode<T> succsucc = null; 422internal RBNode<T> InsertNode(int index) 424RBNode<T> node; 436internal virtual RBNode<T> NewNode() 535RBNode<T> node = LeftChild;