On Thursday, 14 August 2014 at 13:10:58 UTC, bearophile wrote:
Marc Schütz:
Isn't SuperFastHash vulnerable to collision attacks?
D AAs used to be not vulnerable to collision attacks because
they resolved collisions building a red-black tree for each
bucket. Later buckets became linked
Superfast. Though Murmur has gotten good enough that I'm tempted
to switch. At the time, Murmur didn't even have a license so it
wasn't an option.
On Thursday, 14 August 2014 at 13:10:58 UTC, bearophile wrote:
D AAs used to be not vulnerable to collision attacks because
they resolved collisions building a red-black tree for each
bucket. Later buckets became linked lists for speed,
Slight corrections:
It was a effectively a randomized
What hashing algorithm is used for the D implementation of
associative arrays? Where in the D source does the AA code live?
On 08/09/2014 11:33 AM, Gary Willoughby wrote:
What hashing algorithm is used for the D implementation of associative
arrays? Where in the D source does the AA code live?
Paul Hsieh's SuperFastHash:
http://www.azillionmonkeys.com/qed/hash.html
The source is here:
On Saturday, 9 August 2014 at 09:33:12 UTC, Gary Willoughby wrote:
What hashing algorithm is used for the D implementation of
associative arrays? Where in the D source does the AA code live?
https://github.com/D-Programming-Language/druntime/blob/master/src/rt/aaA.d
I think it uses the
On 08/09/2014 01:43 PM, Gary Willoughby wrote:
On Saturday, 9 August 2014 at 10:28:02 UTC, Mike Wey wrote:
Paul Hsieh's SuperFastHash:
http://www.azillionmonkeys.com/qed/hash.html
Where is this implemented?
https://github.com/D-Programming-Language/druntime/blob/master/src/rt/util/hash.d
On Saturday, 9 August 2014 at 10:28:02 UTC, Mike Wey wrote:
On 08/09/2014 11:33 AM, Gary Willoughby wrote:
What hashing algorithm is used for the D implementation of
associative
arrays? Where in the D source does the AA code live?
Paul Hsieh's SuperFastHash:
