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

template<T > void Britbot.PriorityQueue.HeapPriorityQueue< T >.Enqueue ( T  node, double  priority  ) [inline] Enqueue a node - .Priority must be set beforehand! O(log n) Implements Britbot.PriorityQueue.IPriorityQueue< T >. Definition at line 92 of file HeapPriorityQueue.cs. { node.Priority = priority; this.Count++; this._nodes[this.Count] = node; node.QueueIndex = this.Count; node.InsertionIndex = this._numNodesEverEnqueued++; this.CascadeUp(this._nodes[this.Count]); }