What hashing algorithm is used for the D implementation of associative arrays?

[bearophile via Digitalmars-d-learn]

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 lists for speed, leading to the 
current sensitivity to collision attacks. I think D is not yet in 
the stage of its development where it starts to care a lot about 
attacks. Currently D programs are able to "attack themselves" 
just fine :-) But as usual patches are (slowly) welcome.

Bye,
bearophile