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

Last updated: May 21,2024

1. Install "libjudy-dev" package

Please follow the step by step instructions below to install libjudy-dev on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libjudy-dev
            
                    
    
    Copied

2. Uninstall "libjudy-dev" package

Please follow the instructions below to uninstall libjudy-dev on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libjudy-dev
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

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

Package: libjudy-dev
Source: judy
Version: 1.0.5-5.1
Installed-Size: 762
Maintainer: Troy Heber
Architecture: amd64
Depends: libjudydebian1 (= 1.0.5-5.1)
Size: 141256
SHA256: 976620b238a4082a5d0f32a71975c42866643d31a95d9936dc0b22bc5c8ddcb3
SHA1: ddacf0541647dc3896b7223082af27ca2ce85dfa
MD5sum: 2041c582d38eb7e0e1cd9f2c7837094f
Description: C library for creating and accessing dynamic arrays (dev package)
Judy is a C library that implements a dynamic array. Empty Judy arrays are
declared with null pointers. A Judy array consumes memory only when
populated yet can grow to take advantage of all available memory. Judy's key
benefits are: scalability, performance, memory efficiency, and ease of use.
Judy arrays are designed to grow without tuning into the peta-element range,
scaling near O(log-base-256).
.
Judy arrays are accessed with insert, retrieve, and delete calls for number
or string indexes. Configuration and tuning are not required -- in fact not
possible. Judy offers sorting, counting, and neighbor/empty searching.
Indexes can be sequential, clustered, periodic, or random -- it doesn't
matter to the algorithm. Judy arrays can be arranged hierarchically to
handle any bit patterns -- large indexes, sets of keys, etc.
.
Judy is often an improvement over common data structures such as: arrays,
sparse arrays, hash tables, B-trees, binary trees, linear lists, skiplists,
other sort and search algorithms, and counting functions.
.
This is the development package.
Description-md5:
Tag: devel::lang:c, devel::library, implemented-in::c, role::devel-lib
Section: libdevel
Priority: optional
Filename: pool/main/j/judy/libjudy-dev_1.0.5-5.1_amd64.deb