- several algo for lock-free queue, including classic Michael & Scott algorithm and its derivatives,\r
the flat combining queue, the segmented queue.\r
- several implementation of unordered set/map - lock-free and fine-grained lock-based\r
+ - [flat-combining] (http://mcg.cs.tau.ac.il/projects/projects/flat-combining) technique\r
- lock-free [skip-list](http://en.wikipedia.org/wiki/Skip_list)\r
\r
Generally, each container has an intrusive and non-intrusive (STL-like) version belonging to \r
\r
Download the latest release from http://sourceforge.net/projects/libcds/files/\r
\r
+See online doxygen-generated doc here: http://libcds.sourceforge.net/doc/cds-api/index.html\r
+\r
References\r
----------\r
*Stack*\r