GC-less Hash-Tables (AA)
"Nordlöw" via Digitalmars-d-learn
digitalmars-d-learn at puremagic.com
Wed Sep 17 15:26:16 PDT 2014
On Wednesday, 17 September 2014 at 19:51:06 UTC, H. S. Teoh via
Digitalmars-d-learn wrote:
> How do you implement a completely GC-free AA with no limit on
> number of
> entries stored? I mean, where would it get the memory to store
> the
> hashtable from?
I mean, GC-free not heap-free. An AA of course needs dynamic
memory management a la C++'s std::vector.
More information about the Digitalmars-d-learn
mailing list