Backtrackable Hash Tables¶

This library implements hash-tables, that associate keys with values.

It requires the hash key to be any ground term, but the value term can take any value.

. The library can be loaded as

:- use_module( library( bhash ) ).

The library's code uses backtrackable updates and an array to store the terms. Implicit keys are generated by term_hash//44 (note that we cannot guarantee there will be no collisions).

• b_key_to_list/3
• b_hash_to_list/3
• b_hash_insert_new/5
• b_hash_update/5
• b_hash_lookup/4
• b_hash_size/3
• prolog::b_hash_values_to_list/2
• prolog::b_hash_keys_to_list/2
• prolog::b_hash_to_list/2
• prolog::b_hash_insert_new/4
• prolog::b_hash_insert/4
• prolog::b_hash_update/4
• prolog::b_hash_update/3
• prolog::b_hash_lookup/3
• prolog::b_hash_size/2
• prolog::b_hash_new/4
• prolog::b_hash_new/2
• prolog::b_hash_new/1
• prolog::is_b_hash/1