| Overview |  |
bindict() = binary()
gb_tree_node(K, V) = nil | {K, V, gb_tree_node(K, V), gb_tree_node(K, V)}
key() = binary()
tree(Key, Value) = {non_neg_integer(), gb_tree_node(Key, Value)}
value() = binary()
| find/2 | |
| find_geq/2 | Find largest {K,V} where K is smaller than or equal to key. |
| first_key/1 | |
| fold_until_stop/3 | |
| foldl/3 | |
| foldr/3 | |
| from_gb_tree/1 | |
| from_orddict/1 | |
| merge/3 | |
| to_gb_tree/1 | |
| to_orddict/1 |
Find largest {K,V} where K is smaller than or equal to key. This is good for an inner node where key is the smallest key in the child node.
first_key(BinDict::bindict()) -> binary() | none
fold_until_stop(Fun::function(), Acc::term(), X3::bindict()) -> {stopped, term()} | {ok, term()}
foldl(Fun::fun((Key::key(), Value::value(), Acc::term()) -> term()), Acc::term(), X3::bindict()) -> term()
foldr(Fun::fun((Key::key(), Value::value(), Acc::term()) -> term()), Acc::term(), X3::bindict()) -> term()
from_orddict(OrdDict) -> any()
merge(Fun, BinDict1, BinDict2) -> any()
to_orddict(BinDict) -> any()
Generated by EDoc