Skip to content
Sections
>> Trisquel >> Paketit >> nabia >> libs >> libcds2.3.3
nabia  ] [  aramo  ]
[ Source: libcds  ]

Paketti: libcds2.3.3 (2.3.3-2build1)

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.

Muut pakettiin libcds2.3.3 liittyvät paketit

  • depends
  • recommends
  • suggests
  • dep: libc6 (>= 2.4)
    GNU C Library: Shared libraries
    myös näennäispaketti, jonka toteuttaa libc6-udeb
  • dep: libgcc-s1 (>= 3.0) [amd64]
    GCC support library
    dep: libgcc-s1 (>= 3.5) [armhf]
  • dep: libstdc++6 (>= 5)
    GNU Standard C++ Library v3

Imuroi libcds2.3.3

Imurointi kaikille saataville arkkitehtuureille
Arkkitehtuuri Paketin koko Koko asennettuna Tiedostot
amd64 19.2 kt67 kt [tiedostoluettelo]
armhf 17.4 kt50 kt [tiedostoluettelo]