[ Reference Manual | Alphabetic Index ]

# library(hash)

Hash table library

## Predicates

> hash_add(+Table, ++Key, +Value)
>   A synonym for hash_set/3
> hash_clone(?, ?)
>   No description available
> hash_contains(+Table, ++Key)
>   Succeeds if there is an entry stored under key Key
> hash_count(+Table, -Count)
>   Returns the number of entries in the table (in constant time)
> hash_create(-Table)
>   Creates a new hash table
> hash_delete(+Table, ++Key)
>   Remove the entry with key Key (if any)
> hash_display(?, ?)
>   No description available
> hash_entry(+Table, ?Key, -Value)
>   Succeeds if Key and Value are an entry in table
> hash_erase(+Table)
>   Remove all entries in the hash table
> hash_find(+Table, ++Key, -Value)
>   A synonym for hash_get/3
> hash_get(+Table, ++Key, -Value)
>   Find the entry stored under key Key and return its value
> hash_insert(+Table, ++Key, +Value)
>   Add an entry with key Key and value Value to the hash table. Fail if an entry for Key already exists.
> hash_insert_suspension(+Table, +Susp, -Notifications)
>   Attach a suspension to be woken on hash table modifications
> hash_iter(+Table, -Iter)
>   Create an iterator to traverse the hash table
> hash_keys(+Table, -Keys)
>   Retrieve the current hash table keys
> hash_last(+Iter)
>   Succeeds if the iterator has reached the end of the table
> hash_list(+Table, -KeyVals)
>   Retrieve the hash table contents as a list of pairs
> hash_list(+Table, -Keys, -Values)
>   Retrieve the hash table contents
> hash_next(+Iter, -Key, -Value, -Iter)
>   Get the next Key - Value pair according to the iterator
> hash_remove(+Table, ++Key, -Value)
>   Remove the entry with key Key and retrieve its value Value
> hash_set(+Table, ++Key, +Value)
>   Add an (or modify the existing) entry with key Key and value Value to the hash table
> hash_stat(+Table)
>   Prints statistics about the hash table
> hash_terminate_suspensions(+Table)
>   Wake and terminate all suspensions attached to the hash table
> hash_update(+Table, ++Key, -OldValue, +NewValue)
>   Lookup and replace the value stored under Key
> list_to_hash(+KeyPos, +ValPos, +List, ?Table)
>   Enter a list of items into a (new or existing) hash table

## Other Exports

> export portray(hash_table / 6, hash_display / 2, [])

## About

- Author: Stefano Novello, IC-Parc
- Copyright © Cisco Systems, Inc
- Date: $Date: 2016/07/24 19:34:44 $

Generated from hash.eci on 2020-02-26 22:26