2 writes to _root
System.Collections.Immutable (2)
System\Collections\Immutable\ImmutableSortedDictionary_2.cs (2)
55
_root
= Node.EmptyNode;
73
_root
= root;
20 references to _root
System.Collections.Immutable (20)
System\Collections\Immutable\ImmutableSortedDictionary_2.Builder.cs (1)
74
_root = map.
_root
;
System\Collections\Immutable\ImmutableSortedDictionary_2.cs (19)
84
return
_root
.IsEmpty ? this : Empty.WithComparers(_keyComparer, _valueComparer);
102
get { return
_root
.IsEmpty; }
118
get { return
_root
.Keys; }
126
get { return
_root
.Values; }
209
return ref
_root
.ValueRef(key, _keyComparer);
248
ImmutableSortedDictionary<TKey, TValue>.Node result =
_root
.Add(key, value, _keyComparer, _valueComparer, out _);
259
ImmutableSortedDictionary<TKey, TValue>.Node result =
_root
.SetItem(key, value, _keyComparer, _valueComparer, out replacedExistingValue, out _);
291
ImmutableSortedDictionary<TKey, TValue>.Node result =
_root
.Remove(value, _keyComparer, out _);
302
ImmutableSortedDictionary<TKey, TValue>.Node result =
_root
;
337
return new ImmutableSortedDictionary<TKey, TValue>(
_root
, _count, _keyComparer, valueComparer);
371
return
_root
.ContainsValue(value, _valueComparer);
434
return
_root
.ContainsKey(key, _keyComparer);
442
return
_root
.Contains(pair, _keyComparer, _valueComparer);
451
return
_root
.TryGetValue(key, _keyComparer, out value!);
460
return
_root
.TryGetKey(equalKey, _keyComparer, out actualKey);
655
_root
.CopyTo(array, index, this.Count);
728
return
_root
.GetEnumerator();
788
ImmutableSortedDictionary<TKey, TValue>.Node result =
_root
;
818
if (
_root
!= root)