2 writes to _right
System.Collections.Immutable (2)
System\Collections\Immutable\ImmutableSortedSet_1.Node.cs (2)
89_right = right; 762_right = right;
32 references to _right
System.Collections.Immutable (32)
System\Collections\Immutable\ImmutableSortedSet_1.Node.cs (32)
127get { return _right; } 165while (!n._right!.IsEmpty) 167n = n._right; 207Debug.Assert(_left != null && _right != null); 216return _right[index - _left._count - 1]; 237Debug.Assert(_left != null && _right != null); 246return ref _right.ItemRefUnchecked(index - _left._count - 1); 354ImmutableSortedSet<T>.Node newRight = _right!.Add(key, comparer, out mutated); 396Debug.Assert(_left != null && _right != null); 407if (_right.IsEmpty && _left.IsEmpty) 411else if (_right.IsEmpty && !_left.IsEmpty) 415else if (!_right.IsEmpty && _left.IsEmpty) 417result = _right; 423ImmutableSortedSet<T>.Node successor = _right; 429ImmutableSortedSet<T>.Node newRight = _right.Remove(successor._key, comparer, out _); 443ImmutableSortedSet<T>.Node newRight = _right.Remove(key, comparer, out mutated); 476Debug.Assert(_left != null && _right != null); 478_right.Freeze(); 506return _right!.Search(key, comparer); 531Debug.Assert(_left != null && _right != null); 539int result = _right.IndexOf(key, comparer); 586if (tree._right!.IsEmpty) 591ImmutableSortedSet<T>.Node right = tree._right; 611return left.Mutate(right: tree.Mutate(left: left._right!)); 624if (tree._right!.IsEmpty) 629Node rotatedRightChild = tree.Mutate(right: RotateRight(tree._right)); 662return tree._right!._height - tree._left!._height; 701return Balance(tree._right!) < 0 ? DoubleLeft(tree) : RotateLeft(tree); 748Debug.Assert(_left != null && _right != null); 751return new Node(_key, left ?? _left, right ?? _right); 765_height = checked((byte)(1 + Math.Max(_left._height, _right._height))); 766_count = 1 + _left._count + _right._count;