From: Dave Love <fx@gnu.org>
Date: Sun, 5 Dec 1999 12:21:20 +0000 (+0000)
Subject: (Hash Tables): Note that alists win for small tables.
X-Git-Tag: emacs-pretest-21.0.90~5882
X-Git-Url: http://git.eshelyaron.com/gitweb/?a=commitdiff_plain;h=1107d4ca499749fbe800ecd58eba33b701b92317;p=emacs.git

(Hash Tables): Note that alists win for small tables.
---

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.