Пакет: libcritnib1 (1.1-2 и други) [debports]

[ Източник:  ]

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.1 (>= 2.1.3)

  GNU C Library: Shared libraries
  също и виртуален пакет, предлаган от libc6.1-udeb

Изтегляне на libcritnib1

Изтегляне за всички налични архитектури

Архитектура	Версия	Големина на пакета	Големина след инсталиране	Файлове
alpha (неофициална архитектура)	1.1-2+b1	7,4 кБ	81,0 кБ	[списък на файловете]