Paket: libcritnib-dev (1.1-2 och andra)
Länkar för libcritnib-dev
Debianresurser:
Hämta källkodspaketet critnib:
Ansvarig:
Externa resurser:
- Hemsida [github.com]
Liknande paket:
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.
Andra paket besläktade med libcritnib-dev
|
|
|
|
-
- dep: libcritnib1 (= 1.1-2+b1)
- ordered map data structure with lock-free reads
Hämta libcritnib-dev
Arkitektur | Version | Paketstorlek | Installerad storlek | Filer |
---|---|---|---|---|
amd64 | 1.1-2+b1 | 6,5 kbyte | 21,0 kbyte | [filförteckning] |
arm64 | 1.1-2+b1 | 6,5 kbyte | 21,0 kbyte | [filförteckning] |
armel | 1.1-2+b1 | 6,5 kbyte | 21,0 kbyte | [filförteckning] |
armhf | 1.1-2+b1 | 6,5 kbyte | 21,0 kbyte | [filförteckning] |
i386 | 1.1-2+b1 | 6,5 kbyte | 21,0 kbyte | [filförteckning] |
mips64el | 1.1-2+b1 | 6,5 kbyte | 21,0 kbyte | [filförteckning] |
ppc64el | 1.1-2+b1 | 6,5 kbyte | 21,0 kbyte | [filförteckning] |
riscv64 | 1.1-2+b1 | 6,5 kbyte | 21,0 kbyte | [filförteckning] |
s390x | 1.1-2+b1 | 6,5 kbyte | 21,0 kbyte | [filförteckning] |