critnib 1.0-1 source package in Ubuntu
Changelog
critnib (1.0-1) unstable; urgency=medium * Initial release (Closes: #994958) -- Adam Borowski <email address hidden> Fri, 24 Sep 2021 01:36:42 +0200
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 |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| critnib_1.0-1.dsc | 2.6 KiB | f230a373f8bd0f5117dc9bc9a4c709cb40f41580df4796364d3c125e30d2c8cc |
| critnib_1.0.orig.tar.gz | 13.6 KiB | 278b6d85d442351202a107e329d735953bd782c7c87ae7657714f4fe59ac0db3 |
| critnib_1.0-1.debian.tar.xz | 2.4 KiB | 012e4d4adc308f743593ad8eead1623c48951421d05b8615910f30202b70b7ae |
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
