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