Module pqueue3

Description
Data Types
Function Index
Function Details

A Large Priority Queue.

This priority queue implementation depends on layered tuples, so that tuple access times can be exploited for quick in/out priority queue operations when using 64 or more total priorities.

Version: 2.0.1 Nov 26 2020 14:55:32 ------------------------------------------------------------------------

Authors: Michael Truog (mjtruog at protonmail dot com).

This priority queue implementation depends on layered tuples, so that tuple access times can be exploited for quick in/out priority queue operations when using 64 or more total priorities. This implementation was created to avoid the slowness within the priority queue used by both RabbitMQ and Riak (https://github.com/basho/riak_core/blob/master/src/priority_queue.erl).

in/2	Append an item to the tail of the 0 priority queue. O(1).
in/3	Append an item to the tail of a specific priority queue. O(1).
is_empty/1	Check if the priority queue is empty. O(1).
is_queue/1	Check if the priority queue type is as expected. O(1).
len/1	Determine the length of a priority queue. O(N).
new/0	Create a new priority queue. O(1).
new/1	Create a new priority queue with customization options. O(1).
out/1	Take an item from the head of the priority queue. O(1) amortized, O(N) worst case.
out/2	Take an item of a specific priority from the head of the queue. O(1) amortized, O(N) worst case.
pout/1	Take an item from the head of the priority queue. Includes the priority in the return value.
to_list/1	Convert the priority queue to a list. O(N).