Пакунок: libcritnib1 (1.1-2 and others) [debports]
Links for libcritnib1
Debian Resources:
Download Source Package :
Не знайденоMaintainers:
External Resources:
- Homepage [github.com]
Similar packages:
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.2)
- Бібліотека GNU C: спільні бібліотеки
also a virtual package provided by libc6-udeb
Завантажити libcritnib1
Архітектура | Версія | Розмір пакунка | Розмір після встановлення | Файли |
---|---|---|---|---|
sparc64 (unofficial port) | 1.1-2+b1 | 6.9 kB | 1,042.0 kB | [список файлів] |