3 writes to _right
System.Collections.Immutable (3)
System\Collections\Immutable\ImmutableList_1.Node.cs (3)
90_right = right; 1455_right = right; 1503_right = right;
44 references to _right
System.Collections.Immutable (44)
System\Collections\Immutable\ImmutableList_1.Node.cs (44)
108Debug.Assert(!(_left == null ^ _right == null)); 126public Node? Right => _right; 153Debug.Assert(_left != null && _right != null); 162return _right[index - _left._count - 1]; 183Debug.Assert(_left != null && _right != null); 191return ref _right.ItemRefUnchecked(index - _left._count - 1); 292Node newRight = _right!.Add(key); 320Node newRight = _right!.Insert(index - _left._count - 1, key); 340Node newRight = _right!.AddRange(keys); 357Node newRight = _right!.AddRange(keys); 386Node newRight = _right!.InsertRange(index - _left._count - 1, keys); 401Debug.Assert(_left != null && _right != null); 409if (_right.IsEmpty && _left.IsEmpty) 413else if (_right.IsEmpty && !_left.IsEmpty) 417else if (!_right.IsEmpty && _left.IsEmpty) 419result = _right; 425ImmutableList<T>.Node successor = _right; 431ImmutableList<T>.Node newRight = _right.RemoveAt(0); 442ImmutableList<T>.Node newRight = _right.RemoveAt(index - _left._count - 1); 516ImmutableList<T>.Node newRight = _right!.ReplaceAt(index - _left._count - 1, value); 670int result = _right!.BinarySearch(index - thisNodeIndex - 1, count, item, comparer); 687int result = adjustedCount < 0 ? -1 : _right!.BinarySearch(0, adjustedCount, item, comparer); 1266_right!.Freeze(); 1280Debug.Assert(!_right!.IsEmpty); 1282return _right.MutateLeft(this.MutateRight(_right._left!)); 1294return _left.MutateRight(this.MutateLeft(_left._right!)); 1304Debug.Assert(!_right!.IsEmpty); 1305Debug.Assert(!_right!._left!.IsEmpty); 1308Node right = _right; 1312right: right.MutateLeft(rightLeft._right!)); 1323Debug.Assert(!_left._right!.IsEmpty); 1327Node leftRight = left._right; 1330right: this.MutateLeft(leftRight._right!)); 1344return _right!._height - _left!._height; 1399return _right!.BalanceFactor < 0 ? this.DoubleLeft() : this.RotateLeft(); 1413Debug.Assert(tree._left != null && tree._right != null); 1425Debug.Assert(tree._right != null); 1426tree.MutateRight(tree._right.BalanceMany()); 1475return new Node(_key, left, _right!); 1480_height = ParentHeight(left, _right!); 1481_count = ParentCount(left, _right!); 1539return new Node(key, _left!, _right!); 1586private static bool Contains(Node node, T value, IEqualityComparer<T> equalityComparer) => !node.IsEmpty && (equalityComparer.Equals(value, node._key) || Contains(node._left!, value, equalityComparer) || Contains(node._right!, value, equalityComparer));