Package: libcds2.3.3t64
Source: libcds
Version: 2.3.3-5
Architecture: arm64
Maintainer: Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
Original-Maintainer: Thorsten Alteholz <debian@alteholz.de>
Installed-Size: 86
Depends: libc6 (>= 2.34), libgcc-s1 (>= 3.3.1), libstdc++6 (>= 14)
Breaks: libcds2.3.3 (<< 2.3.3-5)
Replaces: libcds2.3.3
Provides: libcds2.3.3 (= 2.3.3-5)
Section: libs
Priority: optional
Multi-Arch: same
Homepage: https://github.com/khizmax/libcds
Description: 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.
