Association Maps¶

The following association list manipulation predicates are available once included with the use_module(library(assoc)) command.

The original library used Richard O'Keefe's implementation, on top of unbalanced binary trees. The current code utilises code from the red-black trees library and emulates the SICStus Prolog interface.

The library exports the following definitions:

• del_assoc/5
• ord_list_to_assoc/3
• list_to_assoc/3
• get_prev_assoc/5
• get_next_assoc/5
• get_assoc/6
• get_assoc/4
• gen_assoc/4
• prolog::assoc_to_keys/2
• prolog::del_max_assoc/4
• prolog::del_min_assoc/4
• prolog::del_assoc/4
• prolog::put_assoc/4
• prolog::map_assoc/3
• prolog::map_assoc/2
• prolog::ord_list_to_assoc/2
• prolog::list_to_assoc/2
• prolog::get_prev_assoc/4
• prolog::get_next_assoc/4
• prolog::get_assoc/5
• prolog::get_assoc/3
• prolog::gen_assoc/3
• prolog::max_assoc/3
• prolog::min_assoc/3
• prolog::is_assoc/1
• prolog::assoc_to_list/2
• prolog::empty_assoc/1