Mercurial > emacs
changeset 26710:ed440ffea308
(Hash Tables): Note that alists win for small tables.
| author | Dave Love <fx@gnu.org> |
|---|---|
| date | Sun, 05 Dec 1999 12:21:20 +0000 |
| parents | ce6c0cf762ef |
| children | eac840d283b6 |
| files | lispref/hash.texi |
| diffstat | 1 files changed, 5 insertions(+), 3 deletions(-) [+] |
line wrap: on
line diff
--- 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.