Re: [Algorithms] memory pool algorithms

[Tom P. <ga...@fa...>]

> A hash table actually gives you all of the above, no? And, in fact, a
> hash table with chaining and a proper iterator can give you iteration of
> all the members, too (although in random (hash) order).

Hash what?  A linked list would be the same thing if you assume order is
irrelevant, but I would think the memory incoherency would be undesirable
if trivially avoidable.

-tom!

--