Is there a decent C ++ wrapper around Win32 lockless SList?

Question

Windows provides a locked, separately linked list, as described on this page: Win32 SList

I am wondering if there is good good C ++ wrapper around this function. When I say good, I mean that it exports the normal STL interface as much as possible, supports iterators, etc. I'd rather use a different implementation than sit to write a container like STL.

Answer 1

You can quickly get up and work with boost and :: boost :: iterator_facade.

, , - , , Alexandrescou DevCon. , (, , ) . , . , .

Mars, semi-OO, , OO-vs-Distributed. "" / , . , " ", . , scoped_lock, "96 ", .

Atom Sutter DDJ ( 10 Pentium Pro ).

(, , - , boost DDJ .net MS CCR, , , OO- . , , , , concurrent_vector TBB. , , , ++ ..)

Answer 2

STL SList. , node , , . node - . node, , node, . , " " . node, "" SLIST_ENTRY, , , , , . , node .

SList . , , STL . STL , SList.

, , ++ SList, STL.

Answer 3

, , , ( ) - . , , , std:: list, .

, ( push pop), - .

Answer 4

I think that a thin wrapper should be very easy to write. something like 1-2 pages, maybe everything in the .h file. Instead of combing google, I would write it myself.