Ubuntu
libcds package

libcds 2.3.3-2 source package in Ubuntu

Changelog

libcds (2.3.3-2) unstable; urgency=medium

  * source upload
  * debian/*.install: user better path for installation (Closes: #934471)

 -- Thorsten Alteholz <email address hidden>  Sun, 11 Aug 2019 19:23:22 +0200

Upload details

Uploaded by:
Thorsten Alteholz
Uploaded to:
Sid
Original maintainer:
Thorsten Alteholz
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
libcds_2.3.3-2.dsc 2.0 KiB 8385d0bf7a65a5b9a98ecb6cb65d77ead51a9088a9077258f4f550c56cdd0f8e
libcds_2.3.3.orig.tar.gz 1.4 MiB f090380ecd6b63a3c2b2f0bdb27260de2ccb22486ef7f47cc1175b70c6e4e388
libcds_2.3.3-2.debian.tar.xz 3.5 KiB ece1e33742b18fa8a7e0e1097f87d57cd7c949ed54381f5737112c86084a1921

Available diffs

No changes file available.

Binary packages built by this source

libcds-dev: No summary available for libcds-dev in ubuntu eoan.

No description available for libcds-dev in ubuntu eoan.

libcds2.3.3: Concurrent Data Structures (CDS) library

 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.

libcds2.3.3-dbgsym: No summary available for libcds2.3.3-dbgsym in ubuntu eoan.

No description available for libcds2.3.3-dbgsym in ubuntu eoan.