4 writes to size
System.Workflow.Runtime (4)
KeyedPriorityQueue.cs (4)
51
int i = ++
size
;
82
heap[
size
--] = placeHolder;
100
heap[
size
--] = placeHolder;
157
size
= 0;
24 references to size
System.Workflow.Runtime (24)
KeyedPriorityQueue.cs (24)
50
V oldHead =
size
> 0 ? heap[1].Value : null;
71
V oldHead = (
size
< 1) ? null : DequeueImpl();
72
V newHead = (
size
< 1) ? null : heap[1].Value;
79
Debug.Assert(
size
> 0, "Queue Underflow");
81
heap[1] = heap[
size
];
90
if (
size
< 1)
94
for (int i = 1; i <=
size
; i++)
99
Swap(i,
size
);
115
return (
size
< 1) ? null : heap[1].Value;
120
get { return
size
; }
125
return
size
< 1 ? null : Search(priority, 1, match);
133
for (int i = 1; i <=
size
; i++)
146
for (int i = 1; i <=
size
; i++)
172
Debug.Assert(i >= 1 || i <=
size
, "Index out of range: i = " + i + ", size = " +
size
);
181
if (value == null && left <=
size
)
183
if (value == null && right <=
size
)
191
Debug.Assert(i >= 1 || i <=
size
, "Index out of range: i = " + i + ", size = " +
size
);
196
if (left <=
size
&& IsHigher(heap[left].Priority, heap[i].Priority))
198
if (right <=
size
&& IsHigher(heap[right].Priority, heap[highest].Priority))
210
Debug.Assert(i >= 1 || j >= 1 || i <=
size
|| j <=
size
, "Index out of range: i = " + i + ", j = " + j + ", size = " +
size
);