protected void moveUp ( int pos ) { // if (tc.isEntryEnabled()) // SibTr.entry(tc, "moveUp", new Integer(pos)); PriorityQueueNode node = elements [ pos ] ; long priority = node . priority ; while ( ( pos > 0 ) && ( elements [ parent ( pos ) ] . priority > priority ) ) { setElement ( elements [ parent ( pos ) ] , pos ) ; pos = parent ( pos ) ; } setElement ( node , pos ) ; // if (tc.isEntryEnabled()) // SibTr.exit(tc, "moveUp"); }
Advance a node in the queue based on its priority .