# HG changeset patch
# User Dave Love <fx@gnu.org>
# Date 944396480 0
# Node ID ed440ffea308c09c315a7cf8f2574b26200a0fb3
# Parent  ce6c0cf762efa5375755575474caea4ba250cef0
(Hash Tables): Note that alists win for small tables.

diff -r ce6c0cf762ef -r ed440ffea308 lispref/hash.texi
--- a/lispref/hash.texi	Sun Dec 05 04:05:42 1999 +0000
+++ b/lispref/hash.texi	Sun Dec 05 12:21:20 1999 +0000
@@ -13,9 +13,11 @@
 
 @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.