template<T >

void Britbot.PriorityQueue.HeapPriorityQueue< T >.OnNodeUpdated ( T node ) [inline, private]

Definition at line 244 of file HeapPriorityQueue.cs.

        {
            //Bubble the updated node up or down as appropriate
            int parentIndex = node.QueueIndex / 2;
            T parentNode = this._nodes[parentIndex];

            if (parentIndex > 0 && this.HasHigherPriority(node, parentNode))
            {
                this.CascadeUp(node);
            }
            else
            {
                //Note that CascadeDown will be called if parentNode == node (that is, node is the root)
                this.CascadeDown(node);
            }
        }