Efficiency and flexibility of hash-tables

[Joris van der Hoeven]

Hi,

When declaring a hash table using

        (define H (make-hash-table 100))

does this mean that the number of slots will *always* remain 100?

I am frequently dealing with hash tables where I do not
have a reasonable estimation of number of entires in advance.
In TeXmacs, I therefore implemented a hash table type which
doubles the number of slots each time that the number of entries
becomes larger than a constant times the number of slots
(and divides by two the number of slots when the number of
entries becomes smaller than a constant times the number of slots).
Has a similar system been implemented in (an extension of) guile?

Thanks for your help, Joris


-----------------------------------------------------------
Joris van der Hoeven <address@hidden>
http://www.texmacs.org: GNU TeXmacs scientific text editor
http://www.math.u-psud.fr/~vdhoeven: personal homepage
-----------------------------------------------------------