critnib 1.0-2 source package in Ubuntu
Changelog
critnib (1.0-2) unstable; urgency=medium * Add -latomic to make armel/mipsel/m68k/powerpc/sh4 happy. * Don't try to detect SMP on Hurd, there's none. -- Adam Borowski <email address hidden> Tue, 16 Nov 2021 02:42:54 +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 |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| critnib_1.0-2.dsc | 2.6 KiB | 71149a7516cb716e1be8cfefa19b3bd83b412d2e538005dab92e84c6f5faf9dc |
| critnib_1.0.orig.tar.gz | 13.6 KiB | 278b6d85d442351202a107e329d735953bd782c7c87ae7657714f4fe59ac0db3 |
| critnib_1.0-2.debian.tar.xz | 3.0 KiB | c43a0a8b0921b0b105de9aae653adabdc08f563cc19ad96e11aa713730558a29 |
Available diffs
- diff from 1.0-1 to 1.0-2 (1.1 KiB)
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
