How to Install and Uninstall libcds-dev Package on Kali Linux

Last updated: May 18,2024

1. Install "libcds-dev" package

This guide covers the steps necessary to install libcds-dev on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libcds-dev
            
                    
    
    Copied

2. Uninstall "libcds-dev" package

Please follow the guidance below to uninstall libcds-dev on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libcds-dev
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libcds-dev package on Kali Linux

Package: libcds-dev
Source: libcds
Version: 2.3.3-4
Installed-Size: 4792
Maintainer: Thorsten Alteholz
Architecture: amd64
Depends: libcds2.3.3 (= 2.3.3-4)
Size: 362256
SHA256: 73d8d8e003b6dfb53771218521a967222b3eebf71f8ccf98819d7d89d95c55ed
SHA1: 39f54e4b2c26693f5da0fcda101a2345213d1942
MD5sum: 4b2fbbbdd74a9751f2080587b504bfb6
Description: 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:
Multi-Arch: same
Homepage: https://github.com/khizmax/libcds
Tag: devel::library, role::devel-lib
Section: libdevel
Priority: optional
Filename: pool/main/libc/libcds/libcds-dev_2.3.3-4_amd64.deb