libcritnib1
ordered map data structure with lock-free reads
Description
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.Upload more screenshots
Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.
Upload a screenshotHint: upload an image here from your clipboard with Ctrl-V
Homepage
https://github.com/kilobyte/critnib
Install this software package
If the package is available for the distribution you are currently using on your computer then install the software by clicking on…
Install libcritnib1