zl:1 - FTP

325 make-hash-table
make-hash-table takes the following keyword arguments:
:test
:size
:area
One of the values #'eq, #'eql, or #'equal; one of the
predicates eq, eqI, equal; or some arbitrary predicate
that you specify. It determines how keys are compared.
An integer representing the initial size of the table.
If :area is nil (the default), the sys:default-cons-area is
used. Otherwise, the number of the area that you wish
to use. This keyword is a Symbolics extension to Common
Lisp.
: hash-function Specifies a replacement hashing function. The default is
based on the :test predicate. This keyword is a Symbolics
extension to Common Lisp.
:rehash-before-cold
Causes a rehash whenever the hashing algorithm has
been invalidated. (This is part of the before-cold
initializations.) Thus every user of the saved band does
not have to waste the overhead of rehashing the first
time they use the table after cold booting.
For eq tables, hashing is invalidated whenever garbage
collection or band compression occurs because the hash
function is sensitive to addresses of objects, and those
operations move objects to different addresses. For
equal tables, the hash function is not sensitive to addresses
of objects that smash knows how to hash but it
is sensitive to addresses of other objects. The table
remembers whether it contains any such objects.
Normally a table is automatically rehashed "on demand"
the first time it is used after hashing has become invalidated.
This first gethash operation is therefore
much slower than normal.
The :rehash-before-cold keyword should be used on
tables that are a permanent part of your world, likely to
be saved in a band saved by zl:disk-save, and to be
touched by users of that band. This applies both to
tables in Genera and to tables in user-written subsystems
that are saved on disk bands.
This keyword is a Symbolics extension to Common Lisp.
:rehash-after-full-gc
: entry-size
Similar to :rehash-before-cold. Causes a rehash whenever
the garbage collector performs a full gc. This
keyword is a Symbolics extension to Common Lisp.
An integer that determines how large each entry is.
Especially useful for tables of type set. Currently the
I