| is_rbtree/1 | True
if Term is a valid Red-Black tree. |
| list_to_rbtree/2 | Tree
is the red-black tree corresponding to the mapping in List, which should
be a list of Key-Value pairs. |
| ord_list_to_rbtree/2 | Tree
is the red-black tree corresponding to the mapping in list List, which
should be a list of Key-Value pairs. |
| rb_apply/4 | If
the value associated with key Key is Val0 in Tree, and if
call(G,Val0,ValF) holds, then NewTree differs from Tree only in that Key
is associated with value ValF in tree NewTree. |
| rb_clone/3 | ‘Clone’the
red-back tree TreeIn into a new tree TreeOut with the same keys as the
original but with all values set to unbound values. |
| rb_del_max/4 | Delete
the largest element from the tree Tree, returning the key Key, the value
Val associated with the key and a new tree NewTree. |
| rb_del_min/4 | Delete
the least element from the tree Tree, returning the key Key, the value
Val associated with the key and a new tree NewTree. |
| rb_delete/3 | Delete
element with key Key from the tree Tree, returning the value Val
associated with the key and a new tree NewTree. |
| rb_delete/4 | Same
as rb_delete(Tree, Key, NewTree), but also unifies Val with the value
associated with Key in Tree. |
| rb_empty/1 | Succeeds
if Tree is an empty Red-Black tree. |
| rb_fold/4 | Fold
the given predicate over all the key-value pairs in Tree, starting with
initial state State0 and returning the final state State. |
| rb_in/3 | True
when Key-Value is a key-value pair in red-black tree Tree. |
| rb_insert/4 | Add
an element with key Key and Value to the tree Tree creating a new
red-black tree NewTree. |
| rb_insert_new/4 | Add
a new element with key Key and Value to the tree Tree creating a new
red-black tree NewTree. |
| rb_keys/2 | Keys
is unified with an ordered list of all keys in the Red-Black tree Tree. |
| rb_lookup/3 | True
when Value is associated with Key in the Red-Black tree Tree. |
| rb_map/2 | True
if call(Goal, Value) is true for all nodes in T. |
| rb_map/3 | For
all nodes Key in the tree Tree, if the value associated with key Key is
Val0 in tree Tree, and if call(G,Val0,ValF) holds, then the value
associated with Key in NewTree is ValF. |
| rb_max/3 | Key
is the maximal key in Tree, and is associated with Val. |
| rb_min/3 | Key
is the minimum key in Tree, and is associated with Val. |
| rb_new/1 | Create
a new Red-Black tree Tree. |
| rb_next/4 | Next
is the next element after Key in Tree, and is associated with Val. |
| rb_partial_map/4 | For
all nodes Key in Keys, if the value associated with key Key is Val0 in
tree Tree, and if call(G,Val0,ValF) holds, then the value associated
with Key in NewTree is ValF, otherwise it is the value associated with
the key in Tree. |
| rb_previous/4 | Previous
is the previous element after Key in Tree, and is associated with Val. |
| rb_size/2 | Size
is the number of elements in Tree. |
| rb_update/4 | Tree
NewTree is tree Tree, but with value for Key associated with NewVal. |
| rb_update/5 | Same
as =|rb_update(Tree, Key, NewVal, NewTree)|=
but also unifies OldVal with the value associated with Key in Tree. |
| rb_visit/2 | Pairs
is an infix visit of tree Tree, where each element of Pairs is of the
form Key-Value. |
