[ 源代码： libcds ]
软件包：libcds2.3.3（2.3.3-2）
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 有关的软件包
|
|
|
|
-
- dep: libc6 (>= 2.17) [arm64]
- GNU C 语言运行库：共享库
同时作为一个虚包由这些包填实： libc6-udeb
- dep: libc6 (>= 2.22) [ppc64el]
- dep: libc6 (>= 2.4) [除 arm64, ppc64el]
-
- dep: libgcc1 (>= 1:3.0) [除 armel, armhf]
- 软件包暂时不可用
- dep: libgcc1 (>= 1:3.5) [armel, armhf]
-
- dep: libstdc++6 (>= 5)
- GNU 标准 C++ 库，第3版