critnib 1.1-2 source package in Ubuntu
Changelog
critnib (1.1-2) unstable; urgency=medium * Fix the autopkgtest on 32-bit. -- Adam Borowski <email address hidden> Sat, 04 Dec 2021 20:49:01 +0100
Upload details
- Uploaded by:
- Adam Borowski
- Uploaded to:
- Sid
- Original maintainer:
- Adam Borowski
- Architectures:
- any
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Mantic | release | universe | misc | |
| Lunar | release | universe | misc | |
| Jammy | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| critnib_1.1-2.dsc | 2.7 KiB | 9e9d97068e329ff7e7f4aaa3e006f8292d192aab8435bb0e5ddf167277640216 |
| critnib_1.1.orig.tar.gz | 14.9 KiB | 1e5b65f815b0c23f74ce70cfcc2d8c9570cebc17a70e2a2e6e894c1b68297354 |
| critnib_1.1-2.debian.tar.xz | 3.0 KiB | eccc0e56dbe500da4b813afb150105994174d555e9c5c14f1dc357133c505dea |
Available diffs
- diff from 1.1-1 to 1.1-2 (557 bytes)
No changes file available.
Binary packages built by this source
- libcritnib-dev: 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.
- libcritnib1: 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.
- libcritnib1-dbgsym: debug symbols for libcritnib1
