Re: memory pool algorithms

Olivier Galibert wrote:
> Could you define "retrieve by index" further?  Do you mean that if "n"
> elements are allocated they must be reachable by a number with 0 and
> n-1?  If yes, you obviously can't have constant-time deletion, since
>   

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).

Sincerely,

jw


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