hashkey() = {non_neg_integer(), any()}
treap() = {hashkey(), any(), any(), treap(), treap()} | nil
delete(Key, Tree) -> any()
delete_higher_priorities(Treap, DeletePriority) -> any()
delete_root(X1) -> any()
empty() -> any()
fold(F, Acc, X3) -> any()
from_list(List) -> any()
get_root(X1) -> any()
insert(Key, Priority, Value, Tree) -> any()
is_empty(X1) -> any()
lookup(Key, Tree) -> any()
priority_from_current_time() -> any()
priority_from_current_time(MsOffset) -> any()
priority_from_current_time(MsOffset) -> any()
to_list(Tree) -> any()
Generated by EDoc, Feb 10 2017, 19:11:53.