C++ Logo

std-proposals

Advanced search

Re: [std-proposals] Concurrent containers

From: Phil Bouchard <boost_at_[hidden]>
Date: Tue, 8 Aug 2023 19:37:20 -0400
And... I just wrote an extremely high performance SPSC concurrent
container *and* cyclic with just 85 lines of code. I guess we don't need
all that mumbo jumbo and sorry if I can't share it because it's now
proprietary code for my employer.

But just a head's up that it is possible.


On 8/8/23 18:20, Phil Bouchard via Std-Proposals wrote:
> Apparently Windows 8 got a concurrent single-linked list already
> available as well:
> https://learn.microsoft.com/en-us/windows/win32/sync/interlocked-singly-linked-lists?redirectedfrom=MSDN
>
>
> On 8/4/23 14:33, Phil Bouchard via Std-Proposals wrote:
>>
>>
>> On 8/4/23 13:07, Julien Villemure-Fréchette via Std-Proposals wrote:
>>> If iterators were provided, then accessing the elements in between
>>> would incur a race condition.
>>
>> Not for a single producer / single consumer type.
>>
>>
>

-- 
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.

Received on 2023-08-08 23:37:21