mirror/emacs
1
0
Fork 0
mirror of https://git.savannah.gnu.org/git/emacs.git synced 2024-11-25 07:28:20 +00:00
Code Issues Releases Activity

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

Browse Source
This commit is contained in:
Dave Love 1999-12-05 12:21:20 +00:00
parent db0e466c89
commit 1107d4ca49
1 changed files with 5 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
lispref/hash.texi
View File

@ -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.