How to Install and Uninstall libcds-dev Package on Ubuntu 21.10 (Impish Indri)
Last updated: December 24,2024
1. Install "libcds-dev" package
Please follow the instructions below to install libcds-dev on Ubuntu 21.10 (Impish Indri)
$
sudo apt update
Copied
$
sudo apt install
libcds-dev
Copied
2. Uninstall "libcds-dev" package
Please follow the steps below to uninstall libcds-dev on Ubuntu 21.10 (Impish Indri):
$
sudo apt remove
libcds-dev
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libcds-dev package on Ubuntu 21.10 (Impish Indri)
Package: libcds-dev
Architecture: amd64
Version: 2.3.3-2build1
Multi-Arch: same
Priority: optional
Section: universe/libdevel
Source: libcds
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Thorsten Alteholz
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 4792
Depends: libcds2.3.3 (= 2.3.3-2build1)
Filename: pool/universe/libc/libcds/libcds-dev_2.3.3-2build1_amd64.deb
Size: 361592
MD5sum: c55c6847a4cee48302176804ba776ada
SHA1: 2cda3fc17676a9a734354c418ddf9740cc080d4f
SHA256: dab28336a2ace9feccb97056027f00093d861fa9b6cafb1671d92680186959cb
SHA512: b81fb8514e6ccce7e696fb4d64f5af147a79c19d525eb250567aadfced3b71c7cacab167785c19bc4e901b2159d3607c3049488ae0fbf71486656c2ae0df0522
Homepage: https://github.com/khizmax/libcds
Description-en: 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.
Description-md5: 06f110a7cf42d9ff75ce1a12154fe23f
Architecture: amd64
Version: 2.3.3-2build1
Multi-Arch: same
Priority: optional
Section: universe/libdevel
Source: libcds
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Thorsten Alteholz
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 4792
Depends: libcds2.3.3 (= 2.3.3-2build1)
Filename: pool/universe/libc/libcds/libcds-dev_2.3.3-2build1_amd64.deb
Size: 361592
MD5sum: c55c6847a4cee48302176804ba776ada
SHA1: 2cda3fc17676a9a734354c418ddf9740cc080d4f
SHA256: dab28336a2ace9feccb97056027f00093d861fa9b6cafb1671d92680186959cb
SHA512: b81fb8514e6ccce7e696fb4d64f5af147a79c19d525eb250567aadfced3b71c7cacab167785c19bc4e901b2159d3607c3049488ae0fbf71486656c2ae0df0522
Homepage: https://github.com/khizmax/libcds
Description-en: 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.
Description-md5: 06f110a7cf42d9ff75ce1a12154fe23f