Warning: This is the manual of the legacy Guile 2.0 series. You may want to read the manual of the current stable series instead.
Next: SRFI-69 Hash table algorithms, Previous: SRFI-69 Accessing table items, Up: SRFI-69 [Contents][Index]
Answer the number of associations in table. This is guaranteed to run in constant time for non-weak tables.
Answer an unordered list of the keys in table.
Answer an unordered list of the values in table.
Invoke proc once for each association in table, passing the key and value as arguments.
Invoke (proc key value previous) for
each key and value in table, where previous is
the result of the previous invocation, using init as the first
previous value. Answer the final proc result.
Answer an alist where each association in table is an association in the result.