(Available since version 1.0)
MinPriorityQueue::extractInsert — Extracts a node from top of the queue and inserts a new one
Extracts a node from top of the queue and inserts
value
with priority
priority
.
value
The value to insert.
priority
The associated priority.
The value or priority (or both) of the extracted node, depending on the extract flag.
Throws SEIDS::Heaps::ExtractException when the data-structure is empty.