Memory Efficient HashSet

Nordlöw via Digitalmars-d-learn digitalmars-d-learn at puremagic.com
Thu Mar 10 02:32:09 PST 2016


On Thursday, 10 March 2016 at 10:15:10 UTC, Martin Tschierschke 
wrote:
> With how many data sets at the end, you will have to deal?

I need something close to the memory overhead of a sorted array 
of values. That is why I'm considering converting SparseHash's 
sparse_hash_set to D.


More information about the Digitalmars-d-learn mailing list