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