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

From: Ken Anderson <kanderso_at_bbn.com>
Date: Mon, 03 May 1999 08:37:23 -0400

At 07:58 AM 5/3/99 -0400, Lars Thomas Hansen wrote:
>In Larceny, the break-even point of hash tables vs. alists is at about
>25 elements, according to Will Clinger.

This is also what it is in Allegro Common Lisp.
Received on Mon May 03 1999 - 15:40:18 CEST

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