Re: adjustable array vs hash-table

On 2008-01-30, Joost Diepenmaat <joost@xxxxxxxxx> wrote:
b. Accessing elements via index / key.

Hash tables will never be faster than arrays, and arrays are probably a
lot easier to optimize for homogenous simple values too.

To my surprise, I found that in both ABCL and CLisp hash tables were
faster than arrays. This is probably because these implementations don't
compile array access as efficiently as the others.

(See my other post in this thread)

J.

.

Relevant Pages