On Tuesday, 31 March 2015 at 21:17:04 UTC, Martin Nowak wrote:
The simplest and most efficient way to do quadratic probing is to use triangular numbers and a power of 2 sized hash table.
I'd be glad if someone implemented that for our current AA. https://issues.dlang.org/show_bug.cgi?id=14385
