On 2009-07-06 19:55:29 +0100, 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. But how do
> they compare to vectors and arrays regarding spead and efficiency. Are
> hash-tables more efficient than even arrays/vectors? I heard that
> arrays/vectors using the right declarations are comparable to assembly/
> C code in terms of spead of processing data.
They do different things, so a performance coomparison is not meaningful.