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