Fun project - faster associative array algorithm
bearophile via Digitalmars-d
digitalmars-d at puremagic.com
Tue Apr 7 15:18:00 PDT 2015
Andrei Alexandrescu:
>> A possible cache-friendly replacement would be an array of
>> buckets with local probing to resolve collisions.
>
> Arrays would need to move data. Current hashtables rely on
> values staying put. -- Andrei
The efficiency behavour of modern CPUs+memory pyramid are rather
not linear and not intuitive. As Walter has said at the the start
of this thread, arrays come out as more efficient in a large
number of cases...
Bye,
bearophile
More information about the Digitalmars-d
mailing list