2 writes to Item
System.Collections (2)
System\Collections\Generic\SortedDictionary.cs (1)
137
node.
Item
= new KeyValuePair<TKey, TValue>(node.Item.Key, value);
System\Collections\Generic\SortedSet.cs (1)
1598
Item
= item;
44 references to Item
System.Collections (44)
System\Collections\Generic\SortedDictionary.cs (12)
74
return node.
Item
.Value == null;
78
return EqualityComparer<TValue>.Default.Equals(node.
Item
.Value, keyValuePair.Value);
90
if (EqualityComparer<TValue>.Default.Equals(node.
Item
.Value, keyValuePair.Value))
121
return node.
Item
.Value;
137
node.Item = new KeyValuePair<TKey, TValue>(node.
Item
.Key, value);
221
if (node.
Item
.Value == null)
234
if (valueComparer.Equals(node.
Item
.Value, value))
273
value = node.
Item
.Value;
553
_dictionary._set.InOrderTreeWalk(delegate (TreeSet<KeyValuePair<TKey, TValue>>.Node node) { array[index++] = node.
Item
.Key; return true; });
586
_dictionary._set.InOrderTreeWalk(delegate (TreeSet<KeyValuePair<TKey, TValue>>.Node node) { objects[index++] = node.
Item
.Key; return true; });
714
_dictionary._set.InOrderTreeWalk(delegate (TreeSet<KeyValuePair<TKey, TValue>>.Node node) { array[index++] = node.
Item
.Value; return true; });
747
_dictionary._set.InOrderTreeWalk(delegate (TreeSet<KeyValuePair<TKey, TValue>>.Node node) { objects[index++] = node.
Item
.Value; return true; });
System\Collections\Generic\SortedSet.cs (20)
329
order = comparer.Compare(item, current.
Item
);
474
int order = foundMatch ? -1 : comparer.Compare(item, current.
Item
);
535
array[index++] = node.
Item
;
578
objects[index++] = node.
Item
;
698
int order = comparer.Compare(item, current.
Item
);
730
int order = comparer.Compare(item, current.
Item
);
750
if (lowerBoundActive && comparer.Compare(from, current.
Item
) > 0)
756
if (upperBoundActive && comparer.Compare(to, current.
Item
) < 0)
1436
if (match(n.
Item
))
1438
matches.Add(n.
Item
);
1477
return current.
Item
;
1498
return current.
Item
;
1687
public Node ShallowClone() => new Node(
Item
, Color);
1880
if (_tree.IsWithinRange(node.
Item
))
1885
else if (next == null || !_tree.IsWithinRange(next.
Item
))
1919
if (_tree.IsWithinRange(node.
Item
))
1924
else if (other == null || !_tree.IsWithinRange(other.
Item
))
1944
return _current.
Item
;
1959
return _current.
Item
;
2006
actualValue = node.
Item
;
System\Collections\Generic\SortedSet.TreeSubSet.cs (12)
100
BreadthFirstTreeWalk(n => { toRemove.Add(n.
Item
); return true; });
135
int comp = _lBoundActive ? Comparer.Compare(_min, current.
Item
) : -1;
142
result = current.
Item
;
165
int comp = _uBoundActive ? Comparer.Compare(_max, current.
Item
) : 1;
172
result = current.
Item
;
200
if (IsWithinRange(current.
Item
))
205
else if (_lBoundActive && Comparer.Compare(_min, current.
Item
) > 0)
226
if (IsWithinRange(node.
Item
))
231
else if (_lBoundActive && Comparer.Compare(_min, node.
Item
) > 0)
260
if (IsWithinRange(current.
Item
) && !action(current))
264
if (current.Left != null && (!_lBoundActive || Comparer.Compare(_min, current.
Item
) < 0))
268
if (current.Right != null && (!_uBoundActive || Comparer.Compare(_max, current.
Item
) > 0))