How to Install and Uninstall libjudydebian1 Package on Ubuntu 21.04 (Hirsute Hippo)

Last updated: May 05,2024

1. Install "libjudydebian1" package

This tutorial shows how to install libjudydebian1 on Ubuntu 21.04 (Hirsute Hippo)


    
        
            $
        

        
            
                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 Ubuntu 21.04 (Hirsute Hippo):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libjudydebian1
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libjudydebian1 package on Ubuntu 21.04 (Hirsute Hippo)

Package: libjudydebian1
Architecture: amd64
Version: 1.0.5-5
Priority: optional
Section: universe/libs
Source: judy
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Troy Heber
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 358
Depends: libc6 (>= 2.14)
Filename: pool/universe/j/judy/libjudydebian1_1.0.5-5_amd64.deb
Size: 94552
MD5sum: 46c98c22eae88fe9233fcafcee65864a
SHA1: 7be7aa4a3f470fee8c5aaa7103f6653f4e49a2e2
SHA256: 61e9dab03540bdb146674914d4c56ec247b8fd21996fb01b13648e1d89dd228e
SHA512: 86ed0869393b8f954ad26c2ecbd17dbc99dd5d2522503590b144b7723e022879931ff02678151a5580f631c0e51836ce2ab9c0bfa69ed44a253d0601d30df624
Description-en: 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: c319a2e1f849e99c268f4999ded0032f