| Overview |  |
binomial_heap() = [heap_node()]
heap_node() = #node{rank = non_neg_integer(), key = term(), value = term(), children = binomial_heap()}
| delete/1 | |
| insert/2 | |
| insert/3 | |
| merge/2 | |
| new/0 | |
| size/1 | |
| take/2 | |
| to_list/1 |
delete(TS::binomial_heap()) -> {{term(), term()}, binomial_heap()}
insert(Key::term(), Value::term()) -> binomial_heap()
insert(Key::term(), Value::term(), Forest::binomial_heap()) -> binomial_heap()
merge(TS1::binomial_heap(), TS2::binomial_heap()) -> binomial_heap()
new() -> binomial_heap()
size(Forest::binomial_heap()) -> non_neg_integer()
take(N::non_neg_integer(), Trees::binomial_heap()) -> [{term(), term()}]
to_list(List::binomial_heap()) -> [{term(), term()}]
Generated by EDoc