I submitted my container library to code.dlang.org

Martin Nowak via Digitalmars-d digitalmars-d at puremagic.com
Tue Mar 31 14:20:40 PDT 2015

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.

More information about the Digitalmars-d mailing list