3 writes to Item
System (3)
compmod\system\collections\generic\sorteddictionary.cs (1)
106
node.
Item
= new KeyValuePair<TKey, TValue>( node.Item.Key, value);
compmod\system\collections\generic\sortedset.cs (2)
2138
this.
Item
= item;
2144
this.
Item
= item;
45 references to Item
System (45)
compmod\system\collections\generic\sorteddictionary.cs (12)
58
return node.
Item
.Value == null;
61
return EqualityComparer<TValue>.Default.Equals(node.
Item
.Value, keyValuePair.Value);
71
if( EqualityComparer<TValue>.Default.Equals(node.
Item
.Value, keyValuePair.Value)) {
95
return node.
Item
.Value;
106
node.Item = new KeyValuePair<TKey, TValue>( node.
Item
.Key, value);
185
if(node.
Item
.Value == null) {
196
if(valueComparer.Equals(node.
Item
.Value, value)) {
236
value = node.
Item
.Value;
483
dictionary._set.InOrderTreeWalk( delegate(TreeSet<KeyValuePair<TKey, TValue>>.Node node){ array[index++] = node.
Item
.Key; return true;});
518
dictionary._set.InOrderTreeWalk( delegate(TreeSet<KeyValuePair<TKey, TValue>>.Node node){ objects[index++] = node.
Item
.Key; return true;});
638
dictionary._set.InOrderTreeWalk( delegate(TreeSet<KeyValuePair<TKey, TValue>>.Node node){ array[index++] = node.
Item
.Value; return true;});
673
dictionary._set.InOrderTreeWalk( delegate(TreeSet<KeyValuePair<TKey, TValue>>.Node node){ objects[index++] = node.
Item
.Value; return true;});
compmod\system\collections\generic\sortedset.cs (33)
134
Node myCurrent = (theirCurrent != null ? new SortedSet<T>.Node(theirCurrent.
Item
, theirCurrent.IsRed) : null);
139
myCurrent.Left = (theirCurrent.Left != null ? new SortedSet<T>.Node(theirCurrent.Left.
Item
, theirCurrent.Left.IsRed) : null);
149
myRight = new SortedSet<T>.Node(theirRight.
Item
, theirRight.IsRed);
156
myRight.Left = (theirRight.Left != null ? new SortedSet<T>.Node(theirRight.Left.
Item
, theirRight.Left.IsRed) : null);
382
order = comparer.Compare(item, current.
Item
);
537
int order = foundMatch ? -1 : comparer.Compare(item, current.
Item
);
612
array[index++] = node.
Item
;
649
InOrderTreeWalk(delegate(Node node) { objects[index++] = node.
Item
; return true; });
784
int order = comparer.Compare(item, current.
Item
);
802
int order = comparer.Compare(item, current.
Item
);
821
if (lowerBoundActive && comparer.Compare(from, current.
Item
) > 0) {
824
if (upperBoundActive && comparer.Compare(to, current.
Item
) < 0) {
1646
if (match(n.
Item
)) {
1647
matches.Add(n.
Item
);
1672
InOrderTreeWalk(delegate(SortedSet<T>.Node n) { ret = n.
Item
; return false; });
1680
InOrderTreeWalk(delegate(SortedSet<T>.Node n) { ret = n.
Item
; return false; }, true);
1824
BreadthFirstTreeWalk(delegate(Node n) { toRemove.Add(n.
Item
); return true; });
1860
if (IsWithinRange(current.
Item
)) {
1863
} else if (lBoundActive && Comparer.Compare(min, current.
Item
) > 0) {
1878
if (IsWithinRange(node.
Item
)) {
1881
} else if (lBoundActive && Comparer.Compare(min, node.
Item
) > 0) {
1905
if (IsWithinRange(current.
Item
) && !action(current)) {
1908
if (current.Left != null && (!lBoundActive || Comparer.Compare(min, current.
Item
) < 0)) {
1911
if (current.Right != null && (!uBoundActive || Comparer.Compare(max, current.
Item
) > 0)) {
2228
info.AddValue(NodeValueName, (current == null ? dummyNode.
Item
: current.
Item
), typeof(T));
2269
if (tree.IsWithinRange(node.
Item
)) {
2272
} else if (next == null || !tree.IsWithinRange(next.
Item
)) {
2301
if (tree.IsWithinRange(node.
Item
)) {
2304
} else if (other == null || !tree.IsWithinRange(other.
Item
)) {
2319
return current.
Item
;
2331
return current.
Item
;
2384
actualValue = node.
Item
;