tokenrove / fixie-trieLinks
Compact tries for fixed-width keys
☆26Updated 7 years ago
Alternatives and similar repositories for fixie-trie
Users that are interested in fixie-trie are comparing it to the libraries listed below
Sorting:
- A small DFA for under 16 states☆54Updated 7 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Lock-free slab allocator / freelist.☆72Updated 10 years ago
- qp tries and crit-bit tries☆124Updated 3 years ago
- ☆11Updated 7 years ago
- Backtrace.io's resilient log record framing format☆40Updated 4 years ago
- NetBSD cdb (constant database) library☆14Updated 6 years ago
- fixed-length integer trim☆35Updated 2 years ago
- Crit-bit tree (trie) library☆32Updated 11 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- ☆27Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Updated 3 years ago
- Fast 64 bit evolved hash.☆34Updated 8 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- A qp-trie implementation in Rust☆44Updated last year
- A distributed key-value cache with builtin materialized views.☆25Updated 11 years ago
- CLOCK-Pro cache replacement algorithm for Rust☆27Updated last year
- Experiments with array layouts for comparison-based searching☆86Updated 2 years ago
- Multiplication using AVX512 and AVX512IFMA instructions☆23Updated 10 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- ☆21Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆38Updated 7 years ago
- I-cache line packing and branch misprediction measuring tool☆18Updated 9 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 10 years ago
- Interactive object file browser with symbol, source, assembly, and analysis☆22Updated last year
- x86-64 instruction encoder in Go☆23Updated 6 years ago
- A software-based Ethernet switch design built around a memory-efficient, high-performance, and highly-concurrent hash table for compact a…☆37Updated 10 years ago
- The k-LSM: A relaxed, lock-free, linearizable priority queue☆23Updated 8 years ago