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