[plt-scheme] hash table implementation?

From: Henk Boom (lunarc.lists at gmail.com)
Date: Thu Nov 20 22:33:10 EST 2008

2008/11/20 Matthew Flatt <mflatt at cs.utah.edu>:
> That's correct for mutable hash tables. Immutable hash tables (with
> functional updated) are implemented using a red--black tree.

Does this mean that if I am not planning to modify a hash table after
construction, that it is preferable to use mutable hash tables for
lookup speed? I've been using immutable ones simply because they have
a ready-made constructor from alists.


Posted on the users mailing list.