软件包:libcritnib1(1.1-2 以及其他的)
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 有关的软件包
|
|
|
|
下载 libcritnib1
硬件架构 | 版本 | 软件包大小 | 安装后大小 | 文件 |
---|---|---|---|---|
amd64 | 1.1-2+b2 | 7.2 kB | 33.0 kB | [文件列表] |
arm64 | 1.1-2+b2 | 7.3 kB | 81.0 kB | [文件列表] |
armhf | 1.1-2+b2 | 6.3 kB | 25.0 kB | [文件列表] |
i386 | 1.1-2+b2 | 7.4 kB | 33.0 kB | [文件列表] |
ppc64el | 1.1-2+b2 | 8.1 kB | 81.0 kB | [文件列表] |
riscv64 | 1.1-2+b2 | 7.3 kB | 25.0 kB | [文件列表] |
s390x | 1.1-2+b2 | 7.2 kB | 29.0 kB | [文件列表] |