_nodes _numNodesEverEnqueued CascadeDown CascadeUp Clear Contains Count Dequeue Enqueue First GetEnumerator GetEnumerator HasHigherPriority HeapPriorityQueue IsValidQueue MaxSize OnNodeUpdated Remove Set Swap UpdatePriority

template<T > T Britbot.PriorityQueue.HeapPriorityQueue< T >.Dequeue ( ) [inline] Removes the head of the queue (node with highest priority; ties are broken by order of insertion), and returns it. O(log n) Implements Britbot.PriorityQueue.IPriorityQueue< T >. Definition at line 215 of file HeapPriorityQueue.cs. { T returnMe = this._nodes[1]; this.Remove(returnMe); return returnMe; }