I submitted my container library to code.dlang.org

[thedeemon via Digitalmars-d]

On Tuesday, 31 March 2015 at 21:17:04 UTC, Martin Nowak wrote:

> Robin Hood sounds like a good idea, but it really isn't. Keep 
> your load factor reasonable and distribute values evenly, then 
> you don't need a LRU lookup.

Is there a D version of a hash table with open addressing and 
quadratic probing? It would be interesting to compare speeds.
I like Robin Hood for cache-friendliness, and it works quite well 
for many combinations of key-value types.