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

template<T > bool Britbot.PriorityQueue.HeapPriorityQueue< T >.Contains ( T  node ) [inline] Returns (in O(1)!) whether the given node is in the queue. O(1) Implements Britbot.PriorityQueue.IPriorityQueue< T >. Definition at line 81 of file HeapPriorityQueue.cs. { return (this._nodes[node.QueueIndex] == node); }