2 writes to _right
System.Collections.Immutable (2)
System\Collections\Immutable\SortedInt32KeyNode.cs (2)
88_right = right; 552_right = right;
24 references to _right
System.Collections.Immutable (24)
System\Collections\Immutable\SortedInt32KeyNode.cs (24)
115public SortedInt32KeyNode<TValue>? Right { get { return _right; } } 198node = node._right!; 232node = node._right!; 252_right!.Freeze(freezeAction); 267if (tree._right!.IsEmpty) 272SortedInt32KeyNode<TValue> right = tree._right; 292return left.Mutate(right: tree.Mutate(left: left._right!)); 305if (tree._right!.IsEmpty) 310SortedInt32KeyNode<TValue> rotatedRightChild = tree.Mutate(right: RotateRight(tree._right)); 343return tree._right!._height - tree._left!._height; 382return Balance(tree._right!) < 0 ? DoubleLeft(tree) : RotateLeft(tree); 419SortedInt32KeyNode<TValue> newRight = _right!.SetOrAdd(key, value, valueComparer, overwriteExistingValue, out replacedExistingValue, out mutated); 444result = new SortedInt32KeyNode<TValue>(key, value, _left!, _right!); 471Debug.Assert(_right != null && _left != null); 481if (_right.IsEmpty && _left.IsEmpty) 485else if (_right.IsEmpty && !_left.IsEmpty) 489else if (!_right.IsEmpty && _left.IsEmpty) 491result = _right; 497SortedInt32KeyNode<TValue> successor = _right; 503SortedInt32KeyNode<TValue> newRight = _right.Remove(successor._key, out _); 517SortedInt32KeyNode<TValue> newRight = _right.Remove(key, out mutated); 538Debug.Assert(_right != null && _left != null); 541return new SortedInt32KeyNode<TValue>(_key, _value!, left ?? _left, right ?? _right); 555_height = checked((byte)(1 + Math.Max(_left._height, _right._height)));