Fuzion • Library Modules • base • container • Binary_Heap_Queue • enqueue_dequeue

container.Binary_Heap_Queue.enqueue_dequeue

(

elem T

)

[Redefinition of container.Mutable_Priority_Queue.enqueue_dequeue]

enqueue elem and then dequeue (return and remove) the highest priority element

this is more efficient (factor 2) than an enqueue followed by a dequeue

Time complexity: amortized O(log n) or O(log n) when staying within min_size

Postcondition

post then debug 5 : check_heap_property

redefines:

container.Mutable_Priority_Queue.enqueue_dequeue

Arguments

elem

T¶

[src]

0.099dev (GIT hash bf4ead724d7f3fdab43a87b63c17477c916c8995)

last changed: 2026-11-04