パッケージ: libcds-dev (2.3.3-3) [debports]
試験的な (experimental の) パッケージ
警告: このパッケージは experimental ディストリビューションのものです。つまり、おそらく不安定でバグがあり、それどころかデータの損失を起こすかもしれません。使用前には、変更履歴やその他の参照可能なドキュメントを必ず調べてください。
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.
その他の libcds-dev 関連パッケージ
|
|
|
|
-
- dep: libcds2.3.3 (= 2.3.3-3)
- Concurrent Data Structures (CDS) library