2 writes to _right
System.Collections.Immutable (2)
System\Collections\Immutable\ImmutableSortedDictionary_2.Node.cs (2)
87_right = right; 771_right = right;
23 references to _right
System.Collections.Immutable (23)
System\Collections\Immutable\ImmutableSortedDictionary_2.Node.cs (23)
121public Node? Right { get { return _right; } } 437_right!.Freeze(); 454if (tree._right!.IsEmpty) 459ImmutableSortedDictionary<TKey, TValue>.Node right = tree._right; 479return left.Mutate(right: tree.Mutate(left: left._right)); 492if (tree._right!.IsEmpty) 497Node rotatedRightChild = tree.Mutate(right: RotateRight(tree._right)); 530return tree._right!._height - tree._left!._height; 569return Balance(tree._right!) < 0 ? DoubleLeft(tree) : RotateLeft(tree); 636ImmutableSortedDictionary<TKey, TValue>.Node newRight = _right!.SetOrAdd(key, value, keyComparer, valueComparer, overwriteExistingValue, out replacedExistingValue, out mutated); 661result = new Node(key, value, _left!, _right!); 690Debug.Assert(_right != null && _left != null); 701if (_right.IsEmpty && _left.IsEmpty) 705else if (_right.IsEmpty && !_left.IsEmpty) 709else if (!_right.IsEmpty && _left.IsEmpty) 711result = _right; 717ImmutableSortedDictionary<TKey, TValue>.Node successor = _right; 723ImmutableSortedDictionary<TKey, TValue>.Node newRight = _right.Remove(successor._key, keyComparer, out _); 737ImmutableSortedDictionary<TKey, TValue>.Node newRight = _right.Remove(key, keyComparer, out mutated); 757Debug.Assert(_left != null && _right != null); 760return new Node(_key, _value, left ?? _left, right ?? _right); 774_height = checked((byte)(1 + Math.Max(_left._height, _right._height))); 801return _right!.Search(key, keyComparer);