How to Install and Uninstall libjudydebian1 Package on Kali Linux

Last updated: September 16,2024

1. Install "libjudydebian1" package

Learn how to install libjudydebian1 on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libjudydebian1
            
                    
    
    Copied

2. Uninstall "libjudydebian1" package

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


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libjudydebian1
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libjudydebian1 package on Kali Linux

Package: libjudydebian1
Source: judy
Version: 1.0.5-5.1
Installed-Size: 330
Maintainer: Troy Heber
Architecture: amd64
Depends: libc6 (>= 2.14)
Size: 101504
SHA256: e4f329ec69c29a84859da4a6a8f4792d075c7eecc221d45c1666a5b92bbbdb32
SHA1: fffb540dca01fee5137034116743a8ec07fc0c77
MD5sum: df094826e87314c3e50311c76df4fe15
Description: C library for creating and accessing dynamic arrays
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.
Description-md5:
Tag: role::shared-lib
Section: libs
Priority: optional
Filename: pool/main/j/judy/libjudydebian1_1.0.5-5.1_amd64.deb