2 writes to _heap
PresentationCore (2)
Shared\MS\Internal\PriorityQueue.cs (2)
73_heap = new T[capacity > 0 ? capacity : DefaultCapacity]; 116Array.Resize<T>(ref _heap, _count * 2);
14 references to _heap
PresentationCore (14)
Shared\MS\Internal\PriorityQueue.cs (14)
104return _heap[0]; 114if (_count == _heap.Length) 129_heap[_count] = value; 163T x = _heap[_count]; // lift item x out from the last position 166_heap[_count] = default(T); // don't leak x 192(rightChild < _count && _comparer.Compare(_heap[rightChild], _heap[leftChild]) < 0) ? 196_heap[parent] = _heap[bestChild]; 213if (_comparer.Compare(_heap[parent], x) > 0) 215_heap[index] = _heap[parent]; 223_heap[index] = x; 248T x = _heap[i];