14.2.33  Priority_Queue

The standard library Priority_Queue api defines access to priority queue implementations.

The Priority_Queue api is implemented by the heap_priority_queue and leftist_tree_priority_queue packages.

The Priority_Queue api source code is in src/lib/src/priority-queue.api.

See also: Priority.

See also: Typelocked_Priority_Queue.

The above information is manually maintained and may contain errors.

api {    Priority_Queue X;
    exception EMPTY_PRIORITY_QUEUE;
    from_list : ((X , X) -> Bool) -> List(X ) -> Priority_Queue(X );
    make_priority_queue : ((X , X) -> Bool) -> Priority_Queue(X );
    make_priority_queue' : (((X , X) -> Bool) , Int , X) -> Priority_Queue(X );
    is_empty : Priority_Queue(X ) -> Bool;
    clear : Priority_Queue(X ) -> Void;
    min : Priority_Queue(X ) -> X;
    delete_min : Priority_Queue(X ) -> X;
    merge : (Priority_Queue(X ) , Priority_Queue(X ))
            -> Priority_Queue(X );
    set : Priority_Queue(X ) -> X -> Void;
    to_list : Priority_Queue(X ) -> List(X );
    merge_into : {dst:Priority_Queue(X ),  src:Priority_Queue(X )}
                 -> Void;
};