Re: memory pool algorithms

> 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!

-- 



------------------------------------------------------------------------------
Crystal Reports - New Free Runtime and 30 Day Trial
Check out the new simplified licensign option that enables unlimited
royalty-free distribution of the report engine for externally facing 
server and web deployment.
http://p.sf.net/sfu/businessobjects
_______________________________________________
GDAlgorithms-list mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list