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

diff --git a/lispref/hash.texi b/lispref/hash.texi
index e497123b6c0ff89cf6cb64eea8a55698c10c7348..e20b67b430a766cdb30af8cee5260ec8346bf558 100644 (file)
--- 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.