Fun project - faster associative array algorithm

[Jens Bauer via Digitalmars-d]

On Tuesday, 7 April 2015 at 17:25:00 UTC, Walter Bright wrote:
> The current D associative array algorithm

I did a quick-scan of the source and didn't see any Bloom filter 
there.
I wonder if it would be best to have the Bloom filters completely 
external or if they should be included in the associative array ?
-Eg. the Bloom filter does require extra memory, which is not 
always desirable.
On the other hand, a Bloom filter could be opted in, where high 
speed is required.