How to Install and Uninstall libcritnib1 Package on Kali Linux
Last updated: November 05,2024
1. Install "libcritnib1" package
Please follow the steps below to install libcritnib1 on Kali Linux
$
sudo apt update
Copied
$
sudo apt install
libcritnib1
Copied
2. Uninstall "libcritnib1" package
Here is a brief guide to show you how to uninstall libcritnib1 on Kali Linux:
$
sudo apt remove
libcritnib1
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libcritnib1 package on Kali Linux
Package: libcritnib1
Source: critnib (1.1-2)
Version: 1.1-2+b1
Installed-Size: 33
Maintainer: Adam Borowski
Architecture: amd64
Depends: libc6 (>= 2.2.5)
Size: 7380
SHA256: e9832616887a96a261108ddc999ea8aa9358a80557c104a84ca015cdf6855e06
SHA1: 9740cebbeb64ad39740db250a0f94b2c6c5ba3e6
MD5sum: 4b7c3ee3a7c689c20f7f8a21d66b7f77
Description: ordered map data structure with lock-free reads
Critnib is a data structure that provides a very fast equal and
less-than/greater-than searches; it is a mix between DJBerstein's
critbit and radix trees. While in bad cases it has worse memory use
than binary trees, it works well on real-life data which tends to
have a limited number of "decision bits":
* fully random: divergence happens immediately
* malloc addresses: clumps of distinct bits in the middle
* sequences: only lowest bits are filled
.
This library ships only uintptr_t→uintptr_t mappings, optimized for
reads from a very critical section but not so frequent writes. Other
variants also exist (such as fully lock-free writes, keys of arbitrary
length), and can be added upon request.
Description-md5:
Multi-Arch: same
Homepage: https://github.com/kilobyte/critnib
Section: libs
Priority: optional
Filename: pool/main/c/critnib/libcritnib1_1.1-2+b1_amd64.deb
Source: critnib (1.1-2)
Version: 1.1-2+b1
Installed-Size: 33
Maintainer: Adam Borowski
Architecture: amd64
Depends: libc6 (>= 2.2.5)
Size: 7380
SHA256: e9832616887a96a261108ddc999ea8aa9358a80557c104a84ca015cdf6855e06
SHA1: 9740cebbeb64ad39740db250a0f94b2c6c5ba3e6
MD5sum: 4b7c3ee3a7c689c20f7f8a21d66b7f77
Description: ordered map data structure with lock-free reads
Critnib is a data structure that provides a very fast equal and
less-than/greater-than searches; it is a mix between DJBerstein's
critbit and radix trees. While in bad cases it has worse memory use
than binary trees, it works well on real-life data which tends to
have a limited number of "decision bits":
* fully random: divergence happens immediately
* malloc addresses: clumps of distinct bits in the middle
* sequences: only lowest bits are filled
.
This library ships only uintptr_t→uintptr_t mappings, optimized for
reads from a very critical section but not so frequent writes. Other
variants also exist (such as fully lock-free writes, keys of arbitrary
length), and can be added upon request.
Description-md5:
Multi-Arch: same
Homepage: https://github.com/kilobyte/critnib
Section: libs
Priority: optional
Filename: pool/main/c/critnib/libcritnib1_1.1-2+b1_amd64.deb