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

Subject: Re: [boost] [devector] optimum growing/insertion policy
From: Joaquin M López Muñoz (joaquinlopezmunoz_at_[hidden])
Date: 2017-10-18 13:07:49

El 18/10/2017 a las 13:52, Thorsten Ottosen via Boost escribió:
> Den 18-10-2017 kl. 11:26 skrev Joaquin M López Muñoz via Boost:
>> El 18/10/2017 a las 10:36, Thorsten Ottosen via Boost escribió:
>>> Den 17-10-2017 kl. 14:08 skrev Joaquin M López Muñoz via Boost:
>>>
>>>> Any policy can in principle be implemented behind the following 
>>>> interface:
>>>>
>>>> Â Â  struct free_space{std::size_t back,front;};
>>>> Â Â  free_space query_for_insertion(std::size_t pos,std::size_t n);
>>>
> [...]
>
> 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.

Joaquín M López Muñoz