RBNode

2 types derived from RBNode

PresentationFramework (2)

src\Framework\MS\Internal\Data\LiveShapingBlock.cs (1)

22internal class LiveShapingBlock : RBNode<LiveShapingItem>

src\Framework\MS\Internal\Data\RBTree.cs (1)

55internal class RBTree<T> : RBNode<T>, IList<T>

1 instantiation of RBNode

PresentationFramework (1)

src\Framework\MS\Internal\Data\RBTree.cs (1)

444return new RBNode<T>();

63 references to RBNode

PresentationFramework (63)

src\Framework\MS\Internal\Data\LiveShapingBlock.cs (2)

43protected override void Copy(RBNode<LiveShapingItem> sourceNode, int sourceOffset, RBNode<LiveShapingItem> destNode, int destOffset, int count)

src\Framework\MS\Internal\Data\LiveShapingTree.cs (1)

40internal override RBNode<LiveShapingItem> NewNode()

src\Framework\MS\Internal\Data\RBFinger.cs (1)

16public RBNode<T> Node { get; set; }

src\Framework\MS\Internal\Data\RBNode.cs (52)

41public RBNode<T> LeftChild { get; set; } 42public RBNode<T> RightChild { get; set; } 43public RBNode<T> Parent { get; set; } 57internal RBNode<T> GetSuccessor() 59RBNode<T> node, parent; 74internal RBNode<T> GetPredecessor() 76RBNode<T> node, parent; 162RBNode<T> leftChild = LeftChild, rightChild = RightChild; 263RBNode<T> startingNode = finger.Node; 275RBNode<T> node = startingNode, parent = node.Parent; 309protected virtual void Copy(RBNode<T> sourceNode, int sourceOffset, RBNode<T> destNode, int destOffset, int count) 317RBNode<T> oldNode = oldFinger.Node, newNode = newFinger.Node; 339RBNode<T> successor = newNode.GetSuccessor(); 356RBNode<T> succsucc = successor; 369RBNode<T> node = finger.Node; 389protected RBNode<T> InsertNodeAfter(RBNode<T> node) 396protected RBTree<T> GetRoot(RBNode<T> node) 398for (RBNode<T> parent = node.Parent; parent != null; node = parent, parent = node.Parent) 404protected RBTree<T> GetRootAndIndex(RBNode<T> node, out int index) 407for (RBNode<T> parent = node.Parent; parent != null; node = parent, parent = node.Parent) 415internal void InsertAt(int offset, T x, RBNode<T> successor = null, RBNode<T> succsucc = null) 509protected RBNode<T> InsertNode(RBTree<T> root, RBNode<T> parent, RBNode<T> node, int index, out RBNode<T> newNode) 543RBNode<T> node, parent; 551RBNode<T> Substitute(RBNode<T> node, RBNode<T> sub, RBNode<T> parent) 567protected RBNode<T> DeleteNode(RBNode<T> parent, RBNode<T> node, int index) 589RBNode<T> temp = node; 596RBNode<T> sub; 607RBNode<T> DeleteLeftmost(RBNode<T> node, out RBNode<T> leftmost) 623bool IsNodeRed(RBNode<T> node) 628RBNode<T> RotateLeft() 630RBNode<T> node = this.RightChild; 642RBNode<T> RotateRight() 644RBNode<T> node = this.LeftChild; 663RBNode<T> Fixup(RBNode<T> node) 674RBNode<T> MoveRedRight(RBNode<T> node) 685RBNode<T> MoveRedLeft(RBNode<T> node)

src\Framework\MS\Internal\Data\RBTree.cs (7)

94RBNode<T> node = finger.Node; 107RBNode<T> successor = node.GetSuccessor(); 108RBNode<T> succsucc = null; 428internal RBNode<T> InsertNode(int index) 430RBNode<T> node; 442internal virtual RBNode<T> NewNode() 541RBNode<T> node = LeftChild;