hashkey() = {non_neg_integer(), any()}
treap() = {hashkey(), any(), any(), treap(), treap()} | nil
delete/2 | |
delete_root/1 | |
empty/0 | |
fold/3 | |
from_list/1 | |
get_root/1 | |
insert/4 | |
is_empty/1 | |
lookup/2 | |
to_list/1 |
delete(Key, Tree) -> 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()
to_list(Tree) -> any()
Generated by EDoc, Dec 17 2015, 23:20:00.