Re: [Algorithms] memory pool algorithms

[Jon W. <jw...@gm...>]

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