- Documentation
- Reference manual
- The SWI-Prolog library
- library(rbtrees): Red black trees
- rb_new/1
- rb_empty/1
- rb_lookup/3
- rb_min/3
- rb_max/3
- rb_next/4
- rb_previous/4
- rb_update/4
- rb_update/5
- rb_apply/4
- rb_in/3
- rb_insert/4
- rb_insert_new/4
- rb_delete/3
- rb_delete/4
- rb_del_min/4
- rb_del_max/4
- rb_visit/2
- rb_map/2
- rb_map/3
- rb_fold/4
- rb_clone/3
- rb_partial_map/4
- rb_keys/2
- list_to_rbtree/2
- ord_list_to_rbtree/2
- rb_size/2
- is_rbtree/1
- library(rbtrees): Red black trees
- The SWI-Prolog library
- Packages
- Reference manual
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.
Fails if Key isn't in Tree or if
call(G,Val0,ValF)
is not satisfiable for all Val0 in Keys.
Assumes keys are sorted and not repeated (fails if this is not true).