Fun project - faster associative array algorithm
Andrei Alexandrescu via Digitalmars-d
digitalmars-d at puremagic.com
Tue Apr 7 15:26:45 PDT 2015
On 4/7/15 3:18 PM, bearophile wrote:
> 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...
You must have replied to the wrong post. -- Andrei
More information about the Digitalmars-d
mailing list