Package: libcds-dev (2.3.3-2)

[ Source: libcds  ]

Concurrent Data Structures (CDS) library - development

The Concurrent Data Structures (CDS) library is a collection of concurrent containers that don't require external (manual) synchronization for shared access, and safe memory reclamation (SMR) algorithms like Hazard Pointer and user-space RCU that is used as an epoch-based SMR.

CDS is mostly header-only template library. Only SMR core implementation is segregated to .so/.dll file.

The library contains the implementations of the following containers:

   - lock-free stack with optional elimination support
   - several algo for lock-free queue, including classic Michael & Scott
     algorithm and its derivatives, the flat combining queue, the
     segmented queue.
   - several implementation of unordered set/map - lock-free and
     fine-grained lock-based
   - flat-combining technique
   - lock-free skip-list
   - lock-free FeldmanHashMap/Set Multi-Level Array Hash with thread-safe
     bidirectional iterator support Bronson's et al algorithm for
     fine-grained lock-based AVL tree

Generally, each container has an intrusive and non-intrusive (STL-like) version belonging to cds::intrusive and cds::container namespace respectively.

This package contains the development files.

Tags: Software Development: Libraries, Role: Development Library

Other Packages Related to libcds-dev

• dep: libcds2.3.3 (= 2.3.3-2)

  Concurrent Data Structures (CDS) library

Download libcds-dev

Download for all available architectures

Architecture	Package Size	Installed Size	Files
amd64	353.6 kB	4,793.0 kB	[list of files]
arm64	353.9 kB	4,796.0 kB	[list of files]
armel	353.7 kB	4,781.0 kB	[list of files]
armhf	353.4 kB	4,772.0 kB	[list of files]
i386	354.9 kB	4,779.0 kB	[list of files]
mipsel	355.4 kB	4,788.0 kB	[list of files]
ppc64el	356.0 kB	4,808.0 kB	[list of files]