aatree

v0.1.0

aatree v0.1.0 Aatree

Link to this section Summary

Types

aatree()
iter()

Functions

balance(arg)
balance(t, s)
balance_list(l, s)
count(arg1)
delete(key, arg)
delete_any(key, t)
do_to_string(pref, arg2)
empty()
enter(key, val, t)
from_orddict(l)
get(key, arg)
insert(key, val, arg)
is_defined(key, arg)
is_empty(arg1)
iterator(arg)
iterator(t, as)
iterator_1(t)
keys(arg)
keys(arg1, l)
largest(arg)
lookup(key, arg)
map(f, arg)
merge(smaller, larger)
next(list)
size(arg)
smallest(arg)
take_largest(arg)
take_smallest(arg)
to_list(arg)
to_list(arg1, l)
to_string(arg)
update(key, val, arg)
values(arg)
values(arg1, l)

Link to this section Types

Link to this section Functions

Link to this function balance(arg) 
balance(tree1) :: tree2 when tree1: aatree, tree2: aatree
Link to this function balance_list(l, s)
Link to this function delete(key, arg) 
delete(key, tree1) :: tree2 when key: term, tree1: aatree, tree2: aatree
Link to this function delete_any(key, t) 
delete_any(key, tree1) :: tree2 when key: term, tree1: aatree, tree2: aatree
Link to this function do_to_string(pref, arg2)
Link to this function empty() 
empty() :: aatree
Link to this function enter(key, val, t) 
enter(key, val, tree1) :: tree2 when key: term, val: term, tree1: aatree, tree2: aatree
Link to this function from_orddict(l) 
from_orddict(list) :: tree when list: [{term, term}], tree: aatree
Link to this function get(key, arg) 
get(key, tree) :: val when key: term, tree: aatree, val: term
Link to this function insert(key, val, arg) 
insert(key, val, tree1) :: tree2 when key: term, val: term, tree1: aatree, tree2: aatree
Link to this function is_defined(key, arg) 
is_defined(key, tree) :: boolean when key: term, tree: aatree
Link to this function is_empty(arg1) 
is_empty(tree) :: boolean when tree: aatree
Link to this function iterator(arg) 
iterator(tree) :: iter when tree: aatree, iter: iter
Link to this function iterator(t, as)
Link to this function keys(arg) 
keys(tree) :: [key] when tree: aatree, key: term
Link to this function largest(arg) 
largest(tree) :: {key, val} when tree: aatree, key: term, val: term
Link to this function lookup(key, arg) 
lookup(key, tree) ::
  :none |
  {:value, val} when key: term, val: term, tree: aatree
Link to this function map(f, arg) 
map(function, tree1) :: tree2 when function: (term, term -> term), tree1: aatree, tree2: aatree
Link to this function merge(smaller, larger)
Link to this function next(list) 
next(iter1) ::
  :none |
  {key, val, iter2} when iter1: iter, iter2: iter, key: term, val: term
Link to this function size(arg) 
size(tree) :: non_neg_integer when tree: aatree
Link to this function smallest(arg) 
smallest(tree) :: {key, val} when tree: aatree, key: term, val: term
Link to this function take_largest(arg) 
take_largest(tree1) :: {key, val, tree2} when tree1: aatree, tree2: aatree, key: term, val: term
Link to this function take_smallest(arg) 
take_smallest(tree1) :: {key, val, tree2} when tree1: aatree, tree2: aatree, key: term, val: term
Link to this function to_list(arg) 
to_list(tree) :: [{key, val}] when tree: aatree, key: term, val: term
Link to this function to_list(arg1, l)
Link to this function to_string(arg) 
to_string(tree) :: String.t when tree: aatree
Link to this function update(key, val, arg) 
update(key, val, tree1) :: tree2 when key: term, val: term, tree1: aatree, tree2: aatree
Link to this function values(arg) 
values(tree) :: [val] when tree: aatree, val: term
Link to this function values(arg1, l)