2 writes to _left
System.Collections.Immutable (2)
System\Collections\Immutable\SortedInt32KeyNode.cs (2)
87_left = left; 547_left = left;
26 references to _left
System.Collections.Immutable (26)
System\Collections\Immutable\SortedInt32KeyNode.cs (26)
100public bool IsEmpty { get { return _left == null; } } 110public SortedInt32KeyNode<TValue>? Left { get { return _left; } } 202node = node._left!; 236node = node._left!; 251_left!.Freeze(freezeAction); 273return right.Mutate(left: tree.Mutate(right: right._left!)); 286if (tree._left!.IsEmpty) 291SortedInt32KeyNode<TValue> left = tree._left; 324if (tree._left!.IsEmpty) 329SortedInt32KeyNode<TValue> rotatedLeftChild = tree.Mutate(left: RotateLeft(tree._left)); 343return tree._right!._height - tree._left!._height; 387return Balance(tree._left!) > 0 ? DoubleRight(tree) : RotateRight(tree); 427SortedInt32KeyNode<TValue> newLeft = _left!.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) 487result = _left; 489else if (!_right.IsEmpty && _left.IsEmpty) 498while (!successor._left!.IsEmpty) 500successor = successor._left; 504result = successor.Mutate(left: _left, right: newRight); 509SortedInt32KeyNode<TValue> newLeft = _left.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)));