5 writes to itemCount
System.Activities.DurableInstancing (5)
System\Activities\DurableInstancing\BinaryHeap.cs (5)
42
this.
itemCount
= 0;
53
this.items[this.
itemCount
++] = new KeyValuePair<TKey, TValue>(key, item);
72
this.
itemCount
= 0;
77
--this.
itemCount
;
123
this.
itemCount
= lastItem;
18 references to itemCount
System.Activities.DurableInstancing (18)
System\Activities\DurableInstancing\BinaryHeap.cs (18)
32
get { return this.
itemCount
; }
37
get { return this.
itemCount
== 0; }
48
if (this.
itemCount
== this.items.Length)
54
int position = this.BubbleUp(this.
itemCount
- 1);
66
Fx.Assert(this.
itemCount
> 0, "Cannot dequeue empty queue.");
70
if (this.
itemCount
== 1)
78
this.items[0] = this.items[
itemCount
];
79
this.items[
itemCount
] = this.EmptyItem;
95
Fx.Assert(this.
itemCount
> 0, "Cannot peek at empty queue.");
106
for (int position = 0; position < this.
itemCount
; position++)
108
while (func(this.items[position]) && position < this.
itemCount
)
112
int lastItem = this.
itemCount
- 1;
140
if (this.items.Length > defaultCapacity && this.
itemCount
< (this.items.Length >> 1))
143
defaultCapacity, (((this.
itemCount
/ defaultCapacity) + 1) * defaultCapacity));
168
Fx.Assert(
itemCount
< newSize, "Shrinking now will lose data.");
173
Array.Copy(this.items, 0, temp, 0, this.
itemCount
);
188
if (leftChildPosition <
itemCount
)
200
if (rightChildPosition <
itemCount
)