3 writes to _right
System.Collections.Immutable (3)
System\Collections\Immutable\ImmutableList_1.Node.cs (3)
90_right = right; 1475_right = right; 1523_right = right;
46 references to _right
System.Collections.Immutable (46)
System\Collections\Immutable\ImmutableList_1.Node.cs (46)
108Debug.Assert(!(_left == null ^ _right == null)); 131public Node? Right => _right; 136IBinaryTree? IBinaryTree.Right => _right; 146IBinaryTree<T>? IBinaryTree<T>.Right => _right; 173Debug.Assert(_left != null && _right != null); 182return _right[index - _left._count - 1]; 203Debug.Assert(_left != null && _right != null); 211return ref _right.ItemRefUnchecked(index - _left._count - 1); 312Node newRight = _right!.Add(key); 340Node newRight = _right!.Insert(index - _left._count - 1, key); 360Node newRight = _right!.AddRange(keys); 377Node newRight = _right!.AddRange(keys); 406Node newRight = _right!.InsertRange(index - _left._count - 1, keys); 421Debug.Assert(_left != null && _right != null); 429if (_right.IsEmpty && _left.IsEmpty) 433else if (_right.IsEmpty && !_left.IsEmpty) 437else if (!_right.IsEmpty && _left.IsEmpty) 439result = _right; 445ImmutableList<T>.Node successor = _right; 451ImmutableList<T>.Node newRight = _right.RemoveAt(0); 462ImmutableList<T>.Node newRight = _right.RemoveAt(index - _left._count - 1); 536ImmutableList<T>.Node newRight = _right!.ReplaceAt(index - _left._count - 1, value); 690int result = _right!.BinarySearch(index - thisNodeIndex - 1, count, item, comparer); 707int result = adjustedCount < 0 ? -1 : _right!.BinarySearch(0, adjustedCount, item, comparer); 1286_right!.Freeze(); 1300Debug.Assert(!_right!.IsEmpty); 1302return _right.MutateLeft(this.MutateRight(_right._left!)); 1314return _left.MutateRight(this.MutateLeft(_left._right!)); 1324Debug.Assert(!_right!.IsEmpty); 1325Debug.Assert(!_right!._left!.IsEmpty); 1328Node right = _right; 1332right: right.MutateLeft(rightLeft._right!)); 1343Debug.Assert(!_left._right!.IsEmpty); 1347Node leftRight = left._right; 1350right: this.MutateLeft(leftRight._right!)); 1364return _right!._height - _left!._height; 1419return _right!.BalanceFactor < 0 ? this.DoubleLeft() : this.RotateLeft(); 1433Debug.Assert(tree._left != null && tree._right != null); 1445Debug.Assert(tree._right != null); 1446tree.MutateRight(tree._right.BalanceMany()); 1495return new Node(_key, left, _right!); 1500_height = ParentHeight(left, _right!); 1501_count = ParentCount(left, _right!); 1559return new Node(key, _left!, _right!); 1606private 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));