Module dec_trees

balance(Tree1) -> Tree2

• Tree1 = gb_tree()
• Tree2 = gb_tree()

delete(Key, Tree1) -> Tree2

• Key = term()
• Tree1 = gb_tree()
• Tree2 = gb_tree()

delete_any(Key, Tree1) -> Tree2

• Key = term()
• Tree1 = gb_tree()
• Tree2 = gb_tree()

empty() -> gb_tree()

enter(Key, Val, Tree1) -> Tree2

• Key = term()
• Val = term()
• Tree1 = gb_tree()
• Tree2 = gb_tree()

from_orddict(List) -> Tree

• List = [{Key::term(), Val::term()}]
• Tree = gb_tree()

get(Key, Tree) -> Val

• Key = term()
• Tree = gb_tree()
• Val = term()

insert(Key, Val, Tree1) -> Tree2

• Key = term()
• Val = term()
• Tree1 = gb_tree()
• Tree2 = gb_tree()

is_defined(Key, Tree) -> boolean()

• Key = term()
• Tree = gb_tree()

is_empty(Tree) -> boolean()

• Tree = gb_tree()

iterator(Tree) -> Iter

• Tree = gb_tree()
• Iter = iter()

keys(Tree) -> [Key]

• Tree = gb_tree()
• Key = term()

largest(Tree) -> {Key, Val}

• Tree = gb_tree()
• Key = term()
• Val = term()

lookup(Key, Tree) -> none | {value, Val}

• Key = term()
• Val = term()
• Tree = gb_tree()

map(Function, Tree1) -> Tree2

• Function = fun((K::term(), V1::term()) -> V2::term())
• Tree1 = gb_tree()
• Tree2 = gb_tree()

next(Iter1) -> none | {Key, Val, Iter2}

• Iter1 = iter()
• Iter2 = iter()
• Key = term()
• Val = term()

size(Tree) -> non_neg_integer()

• Tree = gb_tree()

smallest(Tree) -> {Key, Val}

• Tree = gb_tree()
• Key = term()
• Val = term()

take_largest(Tree1) -> {Key, Val, Tree2}

• Tree1 = gb_tree()
• Tree2 = gb_tree()
• Key = term()
• Val = term()

take_smallest(Tree1) -> {Key, Val, Tree2}

• Tree1 = gb_tree()
• Tree2 = gb_tree()
• Key = term()
• Val = term()

to_list(Tree) -> [{Key, Val}]

• Tree = gb_tree()
• Key = term()
• Val = term()

update(Key, Val, Tree1) -> Tree2

• Key = term()
• Val = term()
• Tree1 = gb_tree()
• Tree2 = gb_tree()

values(Tree) -> [Val]

• Tree = gb_tree()
• Val = term()