Subject: Re: [boost] [Block Pointer] benchmark
From: Phil Bouchard (philippe_at_[hidden])
Date: 2011-05-25 12:25:12
On 5/25/2011 5:15 AM, Mathias Gaunard wrote:
> On 25/05/2011 00:40, Phil Bouchard wrote:
> If you want a really useful benchmark, I'd suggest you give the max and
> average cycle count of each primitive associated with those types
> (construction, copy constructor, assignment, dereference, destructor)
Ok I understand and you're right but at least I already have an estimate.
> I don't see how such a thing would be possible, unless you can guarantee
> that all your allocations/deallocations happen in a LIFO order (in which
> case you can use the non-ordered allocation).
Just to make sure: O(n) where n is the number of objects already allocated?
> The pages are not contiguous, so you need to walk through each page at
It'll still be decently fast.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk