Paketti: libcritnib1 (1.1-2)
Links for libcritnib1
Trisquel-palvelut:
Imuroi lähdekoodipaketti critnib:
Ylläpitäjä:
Original Maintainer:
- Adam Borowski
External Resources:
- Kotisivu [github.com]
Samankaltaisia paketteja:
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.
Muut pakettiin libcritnib1 liittyvät paketit
|
|
|
-
- dep: libc6 (>= 2.17) [arm64, ppc64el]
- GNU C Library: Shared libraries
myös näennäispaketti, jonka toteuttaa libc6-udeb
- dep: libc6 (>= 2.2.5) [amd64]
- dep: libc6 (>= 2.4) [armhf]
Imuroi libcritnib1
Arkkitehtuuri | Paketin koko | Koko asennettuna | Tiedostot |
---|---|---|---|
amd64 | 7.2 kt | 32 kt | [tiedostoluettelo] |
arm64 | 7.1 kt | 24 kt | [tiedostoluettelo] |
armhf | 6.2 kt | 24 kt | [tiedostoluettelo] |
ppc64el | 9.5 kt | 80 kt | [tiedostoluettelo] |