How to Install and Uninstall libjudy-dev Package on Ubuntu 21.10 (Impish Indri)

Last updated: December 23,2024

1. Install "libjudy-dev" package

This guide covers the steps necessary to install libjudy-dev on Ubuntu 21.10 (Impish Indri)

$ sudo apt update $ sudo apt install libjudy-dev

2. Uninstall "libjudy-dev" package

Please follow the guidelines below to uninstall libjudy-dev on Ubuntu 21.10 (Impish Indri):

$ sudo apt remove libjudy-dev $ sudo apt autoclean && sudo apt autoremove

3. Information about the libjudy-dev package on Ubuntu 21.10 (Impish Indri)

Package: libjudy-dev
Architecture: amd64
Version: 1.0.5-5
Priority: optional
Section: universe/libdevel
Source: judy
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Troy Heber
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 794
Depends: libjudydebian1 (= 1.0.5-5)
Filename: pool/universe/j/judy/libjudy-dev_1.0.5-5_amd64.deb
Size: 133316
MD5sum: 3b85087edfedc952b1b3ad19d4a30fc2
SHA1: a063a577f29c41215f70dfa087bce1db98049054
SHA256: be1f2ee6891cc5c07a055047718187666e97d2fc31ef5a39c1fcf66316a954e8
SHA512: cd7037650427f4ef5e535062221a1f142e48ea67e06e75ec8214d7dff022b2a8f48cb989ee8bf38ea531d78cf0410b0e2f4398bd1c0bd50b1cdc8bf1de6b3b19
Description-en: 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: 3f37f9368d6875c98dfa4a78c12db96b