套件:libcritnib-dev(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.
This package contains the development headers.
其他與 libcritnib-dev 有關的套件
|
|
|
|
-
- dep: libcritnib1 (= 1.1-2+b1)
- ordered map data structure with lock-free reads
下載 libcritnib-dev
硬體架構 | 版本 | 套件大小 | 安裝後大小 | 檔案 |
---|---|---|---|---|
alpha (非官方移植版) | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |
amd64 | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |
arm64 | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |
armel | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |
armhf | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |
hppa (非官方移植版) | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |
i386 | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |
ia64 (非官方移植版) | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |
m68k (非官方移植版) | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |
mips64el | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |
ppc64 (非官方移植版) | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |
ppc64el | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |
riscv64 | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |
s390x | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |
sh4 (非官方移植版) | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |
sparc64 (非官方移植版) | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |
x32 (非官方移植版) | 1.1-2+b1 | 6。5 kB | 21。0 kB | [檔案列表] |