Subject: Re: [boost] [Block Pointer] benchmark
From: Phil Bouchard (philippe_at_[hidden])
Date: 2011-05-25 15:05:20
On 5/25/2011 10:09 AM, Mathias Gaunard wrote:
> The number of objects currently in the pool.
People might confuse that with the size of the object because the same
letter is used twice for two different purposes "t.ordered_malloc(n)"
On the other hand if you allocate big objects at the end of the pool and
small ones at the beginning then I'm pretty sure there is a way to sort
out free space and end up with a O(log(n)) complexity. O(n) doesn't
> It's already what it does.
Ok false alarm because I read somewhere is_from() was slow.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk