equal
deleted
inserted
replaced
508 |
508 |
509 ///Processes the next node in the priority heap |
509 ///Processes the next node in the priority heap |
510 |
510 |
511 ///Processes the next node in the priority heap. |
511 ///Processes the next node in the priority heap. |
512 /// |
512 /// |
|
513 ///\return The processed node. |
|
514 /// |
513 ///\warning The priority heap must not be empty! |
515 ///\warning The priority heap must not be empty! |
514 void processNextNode() |
516 Node processNextNode() |
515 { |
517 { |
516 Node v=_heap.top(); |
518 Node v=_heap.top(); |
517 Value oldvalue=_heap[v]; |
519 Value oldvalue=_heap[v]; |
518 _heap.pop(); |
520 _heap.pop(); |
519 finalizeNodeData(v,oldvalue); |
521 finalizeNodeData(v,oldvalue); |
535 break; |
537 break; |
536 case Heap::POST_HEAP: |
538 case Heap::POST_HEAP: |
537 break; |
539 break; |
538 } |
540 } |
539 } |
541 } |
|
542 return v; |
540 } |
543 } |
541 |
544 |
542 ///\brief Returns \c false if there are nodes |
545 ///\brief Returns \c false if there are nodes |
543 ///to be processed in the priority heap |
546 ///to be processed in the priority heap |
544 /// |
547 /// |