How to Install and Uninstall libcds2.3.3 Package on Kali Linux

Last updated: May 10,2024

1. Install "libcds2.3.3" package

This tutorial shows how to install libcds2.3.3 on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libcds2.3.3
            
                    
    
    Copied

2. Uninstall "libcds2.3.3" package

In this section, we are going to explain the necessary steps to uninstall libcds2.3.3 on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libcds2.3.3
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libcds2.3.3 package on Kali Linux

Package: libcds2.3.3
Source: libcds
Version: 2.3.3-4
Installed-Size: 67
Maintainer: Thorsten Alteholz
Architecture: amd64
Depends: libc6 (>= 2.34), libgcc-s1 (>= 3.0), libstdc++6 (>= 5.2)
Size: 19860
SHA256: 11f8c6ff36c91adc815f2dede2ca97db8e20f885698f84c249cb1088efcd1203
SHA1: ea6ca9229e00f0fcf64d6b1fb8342205838fb85f
MD5sum: 185c8fdb237ca2ea55ece2e95da1ef01
Description: 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:
Multi-Arch: same
Homepage: https://github.com/khizmax/libcds
Tag: role::shared-lib
Section: libs
Priority: optional
Filename: pool/main/libc/libcds/libcds2.3.3_2.3.3-4_amd64.deb