On Mon, 6 Jul 2009 11:55:29 -0700 (PDT), Francogrex <······@grex.org> said:
> I read that hash tables are faster and more efficient than lists (and
> alists), especially when dealing with huge amount of data.
For sequential access, (a-)lists would not be slower than
hash-tables, whatever the size.
The margins of this post are too small to discuss the interplay with
CPU caches...
---Vassil.
P.S. What happens when the unstoppable force of newsgroup opinion
meets the unsurmountable barrier of anecdotal evidence?
--
"Even when the muse is posting on Usenet, Alexander Sergeevich?"