[plt-scheme] Weak hash tables

From: Matthew Flatt (mflatt at cs.utah.edu)
Date: Fri Sep 10 09:50:12 EDT 2004

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.


Posted on the users mailing list.