This SRFI defines basic hash tables. Hash tables are widely
recognised as a fundamental data structure for a wide variety of
applications. A hash table is a data structure that:
- Provides a mapping from some set of keys to some set of values
associated to those keys.
- Has no intrinsic order for the (key, value) associations it contains.
- Supports in–place modification as the primary means of setting the
contents of a hash table.
- Provides key lookup and destructive update in amortised constant time,
provided that a good hash function is used.
This SRFI aims to accomplish these goals:
- To provide a consistent, generic and widely applicable API for hash
- To improve code portability by providing a standard hash table facility
with guaranteed behaviour.
- To help the programmer by defining utility routines that account for the
most common situations of using hash tables.