Re: [boost] [devector] optimum growing/insertion policy

Subject: Re: [boost] [devector] optimum growing/insertion policy
From: Thorsten Ottosen (tottosen_at_[hidden])
Date: 2017-10-18 11:48:20

Den 18-10-2017 kl. 11:36 skrev Joaquin M López Muñoz via Boost:
> El 16/10/2017 a las 19:38, Thorsten Ottosen via Boost escribió:

>> Maybe this is lost to me in the details, but given code that works for 
>> vector:
>>
>> Â  vector<int> v;
>> Â  ...
>> Â  v.reserve( v.size() + N );
>>
>> which guarantees no exceptions and no reallocations, how would that 
>> work with your policy?
> 
> Sorry, now it's me who's lost :-) std::vector::reserve can both throw 
> and reallocate, right?

Yes, sorry for being unclear, I'm talking about the guarantee given to 
push_back() and insert() of N elements after the call to reserve().

-Thorsten