[plt-scheme] Weak hash tables

From: ifconfig nslookup (configurator at gmail.com)
Date: Fri Sep 10 16:10:52 EDT 2004

It depends on the search routine? I wonder how the array
implementation decided which array element to use. Maybe that is what
caused bad performance.


On Fri, 10 Sep 2004 06:50:12 -0700, Matthew Flatt <mflatt at cs.utah.edu> wrote:
>  For list-related administrative tasks:
>  http://list.cs.brown.edu/mailman/listinfo/plt-scheme
> At Fri, 10 Sep 2004 08:16:16 -0400, Joe Marshall wrote:
> > Something weird is going on here.  Since a hash table is generally
> > *implemented* as an array, how could it be *faster*?
> My guess: one `hash-table-get' turns into three or four operations (a
> `char->integer', a subtraction, etc.) to extract from a vector, and the
> interpreter overhead dominates.
> Matthew

Posted on the users mailing list.