How to Install and Uninstall libcritnib-dev Package on Kali Linux
Last updated: December 24,2024
1. Install "libcritnib-dev" package
Please follow the steps below to install libcritnib-dev on Kali Linux
$
sudo apt update
Copied
$
sudo apt install
libcritnib-dev
Copied
2. Uninstall "libcritnib-dev" package
Here is a brief guide to show you how to uninstall libcritnib-dev on Kali Linux:
$
sudo apt remove
libcritnib-dev
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libcritnib-dev package on Kali Linux
Package: libcritnib-dev
Source: critnib (1.1-2)
Version: 1.1-2+b1
Installed-Size: 21
Maintainer: Adam Borowski
Architecture: amd64
Depends: libcritnib1 (= 1.1-2+b1)
Size: 6656
SHA256: 63bc9a452b7072a1736912e7de1ed2425115e64298e279abe85dd06473e76f03
SHA1: 79bd21fa0ce3b63197eb5cdd9e3ea723035591c3
MD5sum: fd93dc175ed368fe20e16d067553dbcc
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.
.
This package contains the development headers.
Description-md5:
Multi-Arch: same
Homepage: https://github.com/kilobyte/critnib
Section: libdevel
Priority: optional
Filename: pool/main/c/critnib/libcritnib-dev_1.1-2+b1_amd64.deb
Source: critnib (1.1-2)
Version: 1.1-2+b1
Installed-Size: 21
Maintainer: Adam Borowski
Architecture: amd64
Depends: libcritnib1 (= 1.1-2+b1)
Size: 6656
SHA256: 63bc9a452b7072a1736912e7de1ed2425115e64298e279abe85dd06473e76f03
SHA1: 79bd21fa0ce3b63197eb5cdd9e3ea723035591c3
MD5sum: fd93dc175ed368fe20e16d067553dbcc
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.
.
This package contains the development headers.
Description-md5:
Multi-Arch: same
Homepage: https://github.com/kilobyte/critnib
Section: libdevel
Priority: optional
Filename: pool/main/c/critnib/libcritnib-dev_1.1-2+b1_amd64.deb