134Node myCurrent = (theirCurrent != null ? new SortedSet<T>.Node(theirCurrent.Item, theirCurrent.IsRed) : null); 139myCurrent.Left = (theirCurrent.Left != null ? new SortedSet<T>.Node(theirCurrent.Left.Item, theirCurrent.Left.IsRed) : null); 149myRight = new SortedSet<T>.Node(theirRight.Item, theirRight.IsRed); 156myRight.Left = (theirRight.Left != null ? new SortedSet<T>.Node(theirRight.Left.Item, theirRight.Left.IsRed) : null); 359root = new Node(item, false); 406Node node = new Node(item); 1080root = new Node(arr[startIndex], false); 1085root = new Node(arr[startIndex], false); 1086root.Right = new Node(arr[endIndex], false); 1092root = new Node(arr[startIndex + 1], false); 1093root.Left = new Node(arr[startIndex], false); 1094root.Right = new Node(arr[endIndex], false); 1101root = new Node(arr[midpt], false); 1104root.Right = ConstructRootFromSortedArray(arr, midpt + 2, endIndex, new Node(arr[midpt + 1], true)); 2162static SortedSet<T>.Node dummyNode = new SortedSet<T>.Node(default(T));

52TreeSet<KeyValuePair<TKey, TValue>>.Node node = _set.FindNode(keyValuePair); 66TreeSet<KeyValuePair<TKey, TValue>>.Node node = _set.FindNode(keyValuePair); 90TreeSet<KeyValuePair<TKey, TValue>>.Node node = _set.FindNode(new KeyValuePair<TKey, TValue>(key, default(TValue))); 102TreeSet<KeyValuePair<TKey, TValue>>.Node node = _set.FindNode(new KeyValuePair<TKey, TValue>(key, default(TValue))); 184_set.InOrderTreeWalk( delegate(TreeSet<KeyValuePair<TKey, TValue>>.Node node) { 195_set.InOrderTreeWalk( delegate(TreeSet<KeyValuePair<TKey, TValue>>.Node node) { 231TreeSet<KeyValuePair<TKey, TValue>>.Node node = _set.FindNode(new KeyValuePair<TKey, TValue>(key, default(TValue))); 483dictionary._set.InOrderTreeWalk( delegate(TreeSet<KeyValuePair<TKey, TValue>>.Node node){ array[index++] = node.Item.Key; return true;}); 518dictionary._set.InOrderTreeWalk( delegate(TreeSet<KeyValuePair<TKey, TValue>>.Node node){ objects[index++] = node.Item.Key; return true;}); 638dictionary._set.InOrderTreeWalk( delegate(TreeSet<KeyValuePair<TKey, TValue>>.Node node){ array[index++] = node.Item.Value; return true;}); 673dictionary._set.InOrderTreeWalk( delegate(TreeSet<KeyValuePair<TKey, TValue>>.Node node){ objects[index++] = node.Item.Value; return true;});

43internal delegate bool TreeWalkPredicate<T>(SortedSet<T>.Node node); 62Node root; 131Stack<Node> theirStack = new Stack<SortedSet<T>.Node>(2 * log2(baseSortedSet.Count) + 2); 132Stack<Node> myStack = new Stack<SortedSet<T>.Node>(2 * log2(baseSortedSet.Count) + 2); 133Node theirCurrent = baseSortedSet.root; 134Node myCurrent = (theirCurrent != null ? new SortedSet<T>.Node(theirCurrent.Item, theirCurrent.IsRed) : null); 146Node theirRight = theirCurrent.Right; 147Node myRight = null; 235Stack<Node> stack = new Stack<Node>(2 * (int)(SortedSet<T>.log2(Count + 1))); 236Node current = root; 247Node node = (reverse ? current.Left : current.Right); 269List<Node> processQueue = new List<Node>(); 271Node current; 370Node current = root; 371Node parent = null; 372Node grandParent = null; 373Node greatGrandParent = null; 406Node node = new Node(item); 452Node current = root; 453Node parent = null; 454Node grandParent = null; 455Node match = null; 456Node parentOfMatch = null; 463Node sibling = GetSibling(current, parent); 496Node newGrandParent = null; 608InOrderTreeWalk(delegate(Node node) { 649InOrderTreeWalk(delegate(Node node) { objects[index++] = node.Item; return true; }); 677private static Node GetSibling(Node node, Node parent) { 689private void InsertionBalance(Node current, ref Node parent, Node grandParent, Node greatGrandParent) { 694Node newChildOfGreatGrandParent; 709private static bool Is2Node(Node node) { 714private static bool Is4Node(Node node) { 718private static bool IsBlack(Node node) { 722private static bool IsNullOrBlack(Node node) { 726private static bool IsRed(Node node) { 730private static void Merge2Nodes(Node parent, Node child1, Node child2) { 740private void ReplaceChildOfNodeOrRoot(Node parent, Node child, Node newChild) { 753private void ReplaceNode(Node match, Node parentOfMatch, Node succesor, Node parentOfSuccesor) { 781internal virtual Node FindNode(T item) { 782Node current = root; 799Node current = root; 815internal Node FindRange(T from, T to) { 818internal Node FindRange(T from, T to, bool lowerBoundActive, bool upperBoundActive) { 819Node current = root; 840private static Node RotateLeft(Node node) { 841Node x = node.Right; 847private static Node RotateLeftRight(Node node) { 848Node child = node.Left; 849Node grandChild = child.Right; 858private static Node RotateRight(Node node) { 859Node x = node.Left; 865private static Node RotateRightLeft(Node node) { 866Node child = node.Right; 867Node grandChild = child.Left; 880private static TreeRotation RotationNeeded(Node parent, Node current, Node sibling) { 956private static void Split4Node(Node node) { 1049private static Node ConstructRootFromSortedArray(T[] arr, int startIndex, int endIndex, Node redNode) { 1078Node root = null; 1645BreadthFirstTreeWalk(delegate(Node n) { 1672InOrderTreeWalk(delegate(SortedSet<T>.Node n) { ret = n.Item; return false; }); 1680InOrderTreeWalk(delegate(SortedSet<T>.Node n) { ret = n.Item; return false; }, true); 1824BreadthFirstTreeWalk(delegate(Node n) { toRemove.Add(n.Item); return true; }); 1857Stack<Node> stack = new Stack<Node>(2 * (int)SortedSet<T>.log2(count + 1)); //this is not exactly right if count is out of date, but the stack can grow 1858Node current = root; 1876Node node = (reverse ? current.Left : current.Right); 1898List<Node> processQueue = new List<Node>(); 1900Node current; 1919internal override SortedSet<T>.Node FindNode(T item) { 1958InOrderTreeWalk(delegate(Node n) { count++; return true; }); 2133public Node Left; 2134public Node Right; 2160private Stack<SortedSet<T>.Node> stack; 2161private SortedSet<T>.Node current; 2162static SortedSet<T>.Node dummyNode = new SortedSet<T>.Node(default(T)); 2178stack = new Stack<SortedSet<T>.Node>(2 * (int)SortedSet<T>.log2(set.Count + 1)); 2195stack = new Stack<SortedSet<T>.Node>(2 * (int)SortedSet<T>.log2(set.Count + 1)); 2244stack = new Stack<SortedSet<T>.Node>(2 * (int)SortedSet<T>.log2(tree.Count + 1)); 2264SortedSet<T>.Node node = tree.root; 2265Node next = null, other = null; 2296SortedSet<T>.Node node = (reverse ? current.Left : current.Right); 2297Node next = null, other = null; 2382Node node = FindNode(equalValue);