SRFI 250 is now in draft status.This SRFI defines an interface to hash tables, which are widely recognized as a fundamental data structure for a wide variety of applications. A hash table is a data structure that: Is disjoint from all other types. Provides a mapping from objects known as keys to corresponding objects known as values. Keys may be any Scheme objects in some kinds of hash tables, but are restricted in other kinds. Values may be any Scheme objects. Provides an equality predicate ...