パッケージ: 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]