Re: memory pool algorithms

Thursday, April 23, 2009, 6:32:35 PM, Mat wrote:
> Is the memory pool contiguous? If not, then it's kind of
> scary/impossible to have indexable access, but who knows?
Unless you keep a separate index table which can be contiguous. If the
objects are large and/or you cannot afford to move them around,
because someone has pointers to them, it is useful to allocate the
objects any way you fancy, and then keep a contiguous table of
index-to-pointer mappings in the ways previously described. If you are
doing random deletion, you will need to store pointer-to-index mapping
together with the object in that case.

Alen


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