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 13:21:32

Den 18-10-2017 kl. 15:07 skrev Joaquin M López Muñoz via Boost:
> El 18/10/2017 a las 13:52, Thorsten Ottosen via Boost escribió:

>> We need an additional interface function for handling clear, don't we?
> 
> Umm... yes, we need something for clear(), right. In the rest of erasure 
> scenarios
> there's an obvious way to give free space back to both ends.

Obvious as in "erase never moves elements within the buffer"? or did you 
mean, leave front_free_capacity and back_free_capacity as they would for 
any call to erase?

If we erase the last element, do we then guarantee the same capacities 
as clear()?

-Thorsten