pqueue() = squeue() | {pqueue, [{priority(), squeue()}]}
priority() = integer() | infinity
q() = pqueue()
squeue() = {queue, [any()], [any()], non_neg_integer()}
filter/2 | |
fold/3 | |
from_list/1 | |
highest/1 | |
in/2 | |
in/3 | |
is_empty/1 | |
is_queue/1 | |
join/2 | |
len/1 | |
member/2 | |
new/0 | |
out/1 | |
out_p/1 | |
to_list/1 |
fold(Fun::fun((any(), priority(), A) -> A), A, Q::pqueue()) -> A
from_list(L::[{priority(), any()}]) -> pqueue()
highest(X1::pqueue()) -> priority() | empty
in(X::any(), Priority::priority(), Q::pqueue()) -> pqueue()
is_empty(X1::pqueue()) -> boolean()
is_queue(X1::any()) -> boolean()
len(X1::pqueue()) -> non_neg_integer()
member(X::any(), Q::pqueue()) -> boolean()
new() -> pqueue()
out_p(Q::pqueue()) -> {empty | {value, any(), priority()}, pqueue()}
to_list(X1::pqueue()) -> [{priority(), any()}]
Generated by EDoc