Fcalva/cyclone
1
0
Fork 0
mirror of https://github.com/justinethier/cyclone.git synced 2025-05-19 05:39:17 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

Fixup description

Browse source
This commit is contained in:
Justin Ethier 2016-09-29 18:55:20 -04:00
parent 9e5ab28cba
commit daee482715
1 changed files with 6 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

7
docs/api/srfi/69.md
View file

@ -2,7 +2,12 @@
The `(srfi 69)` library defines basic hash tables.
Like an ordinary `and`, an `and-let*` special form evaluates its arguments -- expressions -- one after another in order, till the first one that yields `#f`. Unlike `and`, however, a non-#f result of one expression can be bound to a fresh variable and used in the subsequent expressions. `and-let*` is a cross-breed between `let*` and `and`.
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
See the [SRFI document](http://srfi.schemers.org/srfi-69/srfi-69.html) for more information.