Re: interesting test of hash-table vs a-list

From: Lars Thomas Hansen <>
Date: Mon, 03 May 1999 07:58:05 -0400

The best compromise between performance and the distribution given by
hashing on the characters of the print name is probably obtained by
computing the hash value when the symbol is created and storing it in
the symbol for future use. Both MacScheme and Larceny use this trick.
The code for symbol-hash is then simple: a type test and a lookup.

In Larceny, the break-even point of hash tables vs. alists is at about
25 elements, according to Will Clinger.

Received on Mon May 03 1999 - 13:58:45 CEST

This archive was generated by hypermail 2.3.0 : Mon Jul 21 2014 - 19:38:59 CEST