Subject: Re: [boost] new library (space partitioning)
From: Adam Wulkiewicz (adam.wulkiewicz_at_[hidden])
Date: 2010-08-15 06:07:15
Mathias Gaunard wrote:
> 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.
It strongly depends on used algorithm if you need it or not. If you use
some kind of internal, temporary objects you need it.