critnib 1.1-2build1 source package in Ubuntu
Changelog
critnib (1.1-2build1) noble; urgency=high * No change rebuild against frame pointers and time_t. -- Julian Andres Klode <email address hidden> Mon, 22 Apr 2024 16:45:03 +0200
Upload details
- Uploaded by:
- Julian Andres Klode
- Uploaded to:
- Noble
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any
- Section:
- misc
- Urgency:
- Very Urgent
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Oracular | release | universe | misc | |
| Noble | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| critnib_1.1.orig.tar.gz | 14.9 KiB | 1e5b65f815b0c23f74ce70cfcc2d8c9570cebc17a70e2a2e6e894c1b68297354 |
| critnib_1.1-2build1.debian.tar.xz | 3.2 KiB | 7e2bc915fadcff1926bf323a58e85570f919b2899010afd0e8ece07d9cebcbe1 |
| critnib_1.1-2build1.dsc | 2.8 KiB | c16d1c6f29b45e555145db87987306c9ed4dd63b5b00883f8d02877454df1861 |
Available diffs
- diff from 1.1-2 (in Debian) to 1.1-2build1 (531 bytes)
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
