mirror/guile
mirror/guile
1
Fork 0
mirror of https://git.savannah.gnu.org/git/guile.git synced 2025-05-30 00:40:20 +02:00
Code Activity

doc: remove more references to hash-tables-as-vectors

Browse source 
* doc/ref/api-compound.texi (Hash Tables): Update.
This commit is contained in:
Daniel Hartwig 2012-11-30 09:40:36 +08:00 • committed by Ludovic Courtès
parent 3eaa587645
commit e6a730b22a
1 changed files with 6 additions and 19 deletions
Download patch file Download diff file Expand all files Collapse all files

25
doc/ref/api-compound.texi
View file

@ -3721,12 +3721,6 @@ search in constant time. The drawback is that hash tables require a
little bit more memory, and that you can not use the normal list little bit more memory, and that you can not use the normal list
procedures (@pxref{Lists}) for working with them. procedures (@pxref{Lists}) for working with them.
Guile provides two types of hashtables. One is an abstract data type
that can only be manipulated with the functions in this section. The
other type is concrete: it uses a normal vector with alists as
elements. The advantage of the abstract hash tables is that they will
be automatically resized when they become too full or too empty.
@menu @menu
* Hash Table Examples:: Demonstration of hash table usage. * Hash Table Examples:: Demonstration of hash table usage.
* Hash Table Reference:: Hash table procedure descriptions. * Hash Table Reference:: Hash table procedure descriptions.
@ -3831,19 +3825,12 @@ Hash tables are implemented as a vector indexed by a hash value formed
from the key, with an association list of key/value pairs for each from the key, with an association list of key/value pairs for each
bucket in case distinct keys hash together. Direct access to the bucket in case distinct keys hash together. Direct access to the
pairs in those lists is provided by the @code{-handle-} functions. pairs in those lists is provided by the @code{-handle-} functions.
The abstract kind of hash tables hide the vector in an opaque object
that represents the hash table, while for the concrete kind the vector
@emph{is} the hashtable.
When the number of table entries in an abstract hash table goes above When the number of entries in a hash table goes above a threshold, the
a threshold, the vector is made larger and the entries are rehashed, vector is made larger and the entries are rehashed, to prevent the
to prevent the bucket lists from becoming too long and slowing down bucket lists from becoming too long and slowing down accesses. When the
accesses. When the number of entries goes below a threshold, the number of entries goes below a threshold, the vector is shrunk to save
vector is shrunk to save space. space.
A abstract hash table is created with @code{make-hash-table}. To
create a vector that is suitable as a hash table, use
@code{(make-vector @var{size} '())}, for example.
For the @code{hashx-} ``extended'' routines, an application supplies a For the @code{hashx-} ``extended'' routines, an application supplies a
@var{hash} function producing an integer index like @code{hashq} etc @var{hash} function producing an integer index like @code{hashq} etc
@ -3878,7 +3865,7 @@ addition to @code{hashq} etc below, include @code{symbol-hash}
@sp 1 @sp 1
@deffn {Scheme Procedure} make-hash-table [size] @deffn {Scheme Procedure} make-hash-table [size]
Create a new abstract hash table object, with an optional minimum Create a new hash table object, with an optional minimum
vector @var{size}. vector @var{size}.
When @var{size} is given, the table vector will still grow and shrink When @var{size} is given, the table vector will still grow and shrink