On 2/22/24 02:00, Frederick Virchanza Gotham via Std-Proposals wrote:
>
> Without knowing how the containers are implemented and without seeing
> the performance statistics, I don't know how anyone could answer that
> question.

It's more on how to use them efficiently. They can be cyclic as well
where old nodes are deleted based on the maximum number of elements.

> When it comes to containers though, I'd probably see about getting it
> into Boost first. Lots of stuff started out in Boost and made its way
> into the Standard.

There's so simple and compact, I'm sure they can bypass Boost.

> I have used the "lockfree single producer single consumer" container in
> Boost a few times . . . you'd be doing well to get performance that good.
>
> Also I'd test out your containers against std::synchronized_value<
> std::vector > to see if it's any faster.

Ok I'll create benchmarks. Thanks!

-- 
Logo <https://www.fornux.com/>  
*Phil Bouchard*  facebook icon
<https://www.linkedin.com/in/phil-bouchard-5723a910/> 
Founder & CEO
T: (819) 328-4743
E: phil_at_[hidden]| www.fornux.com <http://www.fornux.com>
320-345 de la Gauchetière Ouest| Montréal (Qc), H2Z 0A2 Canada
Banner <https://goglobalawards.org/> Le message ci-dessus, ainsi que les
documents l'accompagnant, sont destinés uniquement aux personnes
identifiées et peuvent contenir des informations privilégiées,
confidentielles ou ne pouvant être divulguées. Si vous avez reçu ce
message par erreur, veuillez le détruire.
This communication (and/or the attachments) is intended for named
recipients only and may contain privileged or confidential information
which is not to be disclosed. If you received this communication by
mistake please destroy all copies.