From: Roland Orre <orre@nada.kth.se>
Cc: guile-user@gnu.org
Subject: Re: Efficiency and flexibility of hash-tables
Date: 08 Feb 2003 14:57:58 +0100 [thread overview]
Message-ID: <1044712677.1033.143.camel@localhost> (raw)
In-Reply-To: <Pine.GSO.3.96.1030208115500.22945A-100000@anh>
On Sat, 2003-02-08 at 12:00, Joris van der Hoeven wrote:
> Hi,
>
> When declaring a hash table using
>
> (define H (make-hash-table 100))
No, the hash table is a vector of entries to lists where the actual
information is stored. A hash table in guile can therefore contain
any number of items. The number of entries is merely a choice of what
performance you need. If you declare too few entries you will get
a lot of linear search through the lists from each entry.
I myself use to estimate it so that the lists will rarely be deeper
than two or three to get a reasonable performance.
The performance is also reflected upon the hash function versus the
vector length. Usually it is advisable to use a prime number to avoid
systematic hashing to the same entries. Sometime it happened I missed
this and sloppily declared the hash table length to e.g. 1000000 if
needing about 3000000 items. The run took several hours instead of
the expected half an hour, which I got when changing the length to
1000003. If you have access to some mathematical package like maple
there is often a function nextprime which can be helpful.
Usually the built-in hash functions works fine but you may also
consider making a special hash functions for special needs if
the built-in function doesn't spread good enough.
Best regards
Roland Orre
>
> 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 <vdhoeven@texmacs.org>
> http://www.texmacs.org: GNU TeXmacs scientific text editor
> http://www.math.u-psud.fr/~vdhoeven: personal homepage
> -----------------------------------------------------------
>
>
>
> _______________________________________________
> Guile-user mailing list
> Guile-user@gnu.org
> http://mail.gnu.org/mailman/listinfo/guile-user
--
_______________________________________________
Guile-user mailing list
Guile-user@gnu.org
http://mail.gnu.org/mailman/listinfo/guile-user
next prev parent reply other threads:[~2003-02-08 13:57 UTC|newest]
Thread overview: 32+ messages / expand[flat|nested] mbox.gz Atom feed top
2003-02-08 11:00 Efficiency and flexibility of hash-tables Joris van der Hoeven
2003-02-08 13:57 ` Roland Orre [this message]
2003-02-08 14:14 ` Joris van der Hoeven
2003-02-08 14:55 ` Roland Orre
2003-02-08 15:14 ` Joris van der Hoeven
2003-02-08 15:31 ` Mikael Djurfeldt
2003-02-11 11:14 ` Joris van der Hoeven
2003-02-11 11:28 ` Joris van der Hoeven
2003-02-11 12:50 ` Mikael Djurfeldt
2003-02-08 15:44 ` Roland Orre
2003-02-10 9:55 ` Andreas Rottmann
2003-02-10 14:24 ` Greg Troxel
2003-02-10 15:00 ` Roland Orre
2003-02-10 16:52 ` Mikael Djurfeldt
2003-02-10 17:09 ` Roland Orre
2003-02-10 17:11 ` Mikael Djurfeldt
2003-02-11 13:59 ` Resizing hash tables in Guile Mikael Djurfeldt
2003-02-11 17:34 ` Roland Orre
2003-02-12 11:41 ` Marius Vollmer
2003-02-12 16:10 ` Marius Vollmer
2003-02-12 17:53 ` Mikael Djurfeldt
2003-02-12 20:17 ` Roland Orre
2003-02-13 9:35 ` Mikael Djurfeldt
2003-02-13 13:55 ` Harvey J. Stein
2003-02-13 14:24 ` Joris van der Hoeven
2003-02-13 18:30 ` Harvey J. Stein
2003-02-13 20:02 ` Paul Jarc
2003-02-13 9:52 ` Joris van der Hoeven
2003-02-12 20:55 ` Rob Browning
2003-02-13 10:43 ` Mikael Djurfeldt
2003-02-12 20:47 ` Efficiency and flexibility of hash-tables Paul Jarc
2003-02-12 21:58 ` Roland Orre
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
List information: https://www.gnu.org/software/guile/
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=1044712677.1033.143.camel@localhost \
--to=orre@nada.kth.se \
--cc=guile-user@gnu.org \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).