Re: [container] Proposal for ring queues

From: degski (degski_at_[hidden])
Date: 2020-05-23 18:53:43

On Sat, 23 May 2020 at 13:20, degski <degski_at_[hidden]> wrote:

>
>
> On Sat, 23 May 2020 at 13:13, Andrey Semashev via Boost <
> boost_at_[hidden]> wrote:
>
>> On 2020-05-23 21:02, degski via Boost wrote:
>> >
>> > What about using *std::circular_list,* an end-to-begin-connected
>> > *std::list ?*
>>
>
> This *plf::list <https://www.plflib.org/list.htm>* is doing exactly that
> (allocating in increasingly larger blocks, re-using as possible). It is
> written on top of *plf::colony*, I seem to remember it was proposed as a
> Boost addition but was rejected.
>

In case my message still was unclear, very possibly. I'm saying is to
create a replacement for std::list, this std::list-v2 is in effect a
circular_list, the generalization can be done at no cost and overall the
design will/can be better even when viewed as a std::list.

degski
-- 
@systemdeg
"We value your privacy, click here!" Sod off! - degski
"Anyone who believes that exponential growth can go on forever in a finite
world is either a madman or an economist" - Kenneth E. Boulding
"Growth for the sake of growth is the ideology of the cancer cell" - Edward
P. Abbey