Subject: Re: [boost] new library (space partitioning)
From: Mathias Gaunard (mathias.gaunard_at_[hidden])
Date: 2010-08-14 06:41:49
09/08/2010 17:35, Adam Wulkiewicz wrote:
> Yes, you're right. Although, there may be more than one allocators used
> in the tree building algorithm. There may be allocators for tree nodes,
> temporary objects at each recursive step and for objects in leafs.
I don't see why you'd need dynamic memory allocation other than for the
nodes, assuming you're storing values and not not trying to store
polymorphic objects through pointers.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk