Memory Efficient HashSet

[Nordlöw via Digitalmars-d-learn]

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.