Memory Efficient HashSet

[Steven Schveighoffer via Digitalmars-d-learn]

On 3/8/16 3:12 AM, Nordlöw wrote:
> Has anybody put together a memory-efficient D-implementation of a HashSet
>
> Something like
>
> sparse_hash_set<> contained in
>
> https://github.com/sparsehash/sparsehash
>
> but in D.

D needs a way to use allocators for hash nodes.

In Dcollections, both the performance and memory usage I was able to 
optimize by using a specialized allocator that allocates in pages and 
then divides up the pages.

-Steve