From 1107d4ca499749fbe800ecd58eba33b701b92317 Mon Sep 17 00:00:00 2001 From: Dave Love Date: Sun, 5 Dec 1999 12:21:20 +0000 Subject: [PATCH] (Hash Tables): Note that alists win for small tables. --- lispref/hash.texi | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) diff --git a/lispref/hash.texi b/lispref/hash.texi index e497123b6c0..e20b67b430a 100644 --- a/lispref/hash.texi +++ b/lispref/hash.texi @@ -13,9 +13,11 @@ from an alist in these ways: @itemize @bullet @item -Lookup in a hash table is extremely fast---in fact, the time required -is essentially @emph{independent} of how many elements are stored -in the table. +Lookup in a hash table is extremely fast for large tables---in fact, the +time required is essentially @emph{independent} of how many elements are +stored in the table. For smaller tables (a few tens of elements) +alists may still be faster because hash tables have a more-or-less +constant overhead. @item The correspondences in a hash table are in no particular order. -- 2.39.5