Module pqueue2

Description
Data Types
Function Index
Function Details

Skew Heap Priority Queue.

Ulf Wiger suggested pursuing a skew heap as an optimal Erlang priority queue implementation.

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

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

Description

Skew Heap Priority Queue.

Ulf Wiger suggested pursuing a skew heap as an optimal Erlang priority queue implementation. Unfortunately, testing has shown this solution to be more than 2 times slower than pqueue.

Data Types

pqueue2()

pqueue2() = empty | {integer(), pqueue2(), pqueue2(), element, term()} | {integer(), pqueue2(), pqueue2(), queue, queue:queue()}

Function Index

in/2	Append an item to the tail of the 0 priority queue. .
in/3	Append an item to the tail of a specific priority queue. .
is_empty/1	Check if the priority queue is empty. .
is_queue/1	Check if the priority queue type is as expected. .
len/1	Determine the length of a priority queue. .
new/0	Create a new priority queue. .
out/1	Take an item from the head of the priority queue. .
out/2	Take an item of a specific priority from the head of the queue. .
pout/1	Take an item from the head of the priority queue. Includes the priority in the return value.
test/0	Regression test. .
to_list/1	Convert the priority queue to a list. .