On Wed, Sep 17, 2014 at 10:26:16PM +0000, "Nordlöw" via Digitalmars-d-learn wrote: > 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.
So you would use malloc/free? T -- It is of the new things that men tire --- of fashions and proposals and improvements and change. It is the old things that startle and intoxicate. It is the old things that are young. -- G.K. Chesterton