How to Install and Uninstall libcds2.3.3 Package on Ubuntu 21.10 (Impish Indri)
Last updated: November 22,2024
1. Install "libcds2.3.3" package
This is a short guide on how to install libcds2.3.3 on Ubuntu 21.10 (Impish Indri)
$
sudo apt update
Copied
$
sudo apt install
libcds2.3.3
Copied
2. Uninstall "libcds2.3.3" package
Please follow the guidelines below to uninstall libcds2.3.3 on Ubuntu 21.10 (Impish Indri):
$
sudo apt remove
libcds2.3.3
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libcds2.3.3 package on Ubuntu 21.10 (Impish Indri)
Package: libcds2.3.3
Architecture: amd64
Version: 2.3.3-2build1
Multi-Arch: same
Priority: optional
Section: universe/libs
Source: libcds
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Thorsten Alteholz
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 67
Depends: libc6 (>= 2.4), libgcc-s1 (>= 3.0), libstdc++6 (>= 5)
Filename: pool/universe/libc/libcds/libcds2.3.3_2.3.3-2build1_amd64.deb
Size: 19692
MD5sum: ccf66fbb463bf6b70e23c5f32aa1efbc
SHA1: 0902bbbbd115b5fb461d8173cc451432edd57586
SHA256: 0099e3e5fcb5c2fe7147e854869bb64eb43653c0d0c2af459a76724083856dbb
SHA512: 96897d4d976c87342cb2ac6f7a4f4617edc2cb6ab48cf6a0709a58a915e91432073c9ceb41804f93755ad7e82942bdbf20344144096c5b81a2e21e527f526619
Homepage: https://github.com/khizmax/libcds
Description-en: 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.
Description-md5: 938973ffcb59d5580620e0866895ff83
Architecture: amd64
Version: 2.3.3-2build1
Multi-Arch: same
Priority: optional
Section: universe/libs
Source: libcds
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Thorsten Alteholz
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 67
Depends: libc6 (>= 2.4), libgcc-s1 (>= 3.0), libstdc++6 (>= 5)
Filename: pool/universe/libc/libcds/libcds2.3.3_2.3.3-2build1_amd64.deb
Size: 19692
MD5sum: ccf66fbb463bf6b70e23c5f32aa1efbc
SHA1: 0902bbbbd115b5fb461d8173cc451432edd57586
SHA256: 0099e3e5fcb5c2fe7147e854869bb64eb43653c0d0c2af459a76724083856dbb
SHA512: 96897d4d976c87342cb2ac6f7a4f4617edc2cb6ab48cf6a0709a58a915e91432073c9ceb41804f93755ad7e82942bdbf20344144096c5b81a2e21e527f526619
Homepage: https://github.com/khizmax/libcds
Description-en: 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.
Description-md5: 938973ffcb59d5580620e0866895ff83