Пакет: libcritnib1 (1.1-2)
Ссылки для libcritnib1
Ресурсы Trisquel:
Исходный код critnib:
Сопровождающий:
Original Maintainer:
- Adam Borowski
Внешние ресурсы:
- Сайт [github.com]
Подобные пакеты:
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
|
|
|
-
- dep: libc6 (>= 2.17) [arm64, ppc64el]
- GNU C Library: Shared libraries
также виртуальный пакет, предоставляемый libc6-udeb
- dep: libc6 (>= 2.2.5) [amd64]
- dep: libc6 (>= 2.4) [armhf]
Загрузка libcritnib1
Архитектура | Размер пакета | В установленном виде | Файлы |
---|---|---|---|
amd64 | 7,2 Кб | 32 Кб | [список файлов] |
arm64 | 7,1 Кб | 24 Кб | [список файлов] |
armhf | 6,2 Кб | 24 Кб | [список файлов] |
ppc64el | 9,5 Кб | 80 Кб | [список файлов] |