|
Boost : |
Subject: Re: [boost] Proposal: Monotonic Containers
From: Christopher Jefferson (chris_at_[hidden])
Date: 2009-06-09 08:28:12
On 9 Jun 2009, at 13:19, Christian Schladetsch wrote:
> Hi Chris,
>
> Am I missing something?
>
>
> Yes. The vector allocations are done via a custom allocator.
I can see that.
The following code assertss for me, g++ 4 on Mac OS X. Notice how I
only need to do 33 iterations.
Ddo you have even a basic testing suite for this code? I couldn't find
one, and this seems like a fairly fundamental bug. Perhaps it doesn't
occur on windows?
#include "boost/monotonic/vector.h"
int main()
{
boost::monotonic::inline_storage<100*sizeof(int)> storage; //
create local storage on the stack
boost::monotonic::vector<int> deathrow(storage); // create a
std::vector that uses this storage
for(int i = 0; i < 33; ++i)
deathrow.push_back(i);
}
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk