qp tries and crit-bit tries
☆124Jul 12, 2022Updated 3 years ago
Alternatives and similar repositories for qp
Users that are interested in qp are comparing it to the libraries listed below
Sorting:
- A qp-trie implementation in Rust☆44Dec 31, 2024Updated last year
- Critbit trees in C☆333Dec 17, 2021Updated 4 years ago
- Compact tries for fixed-width keys☆26Jun 4, 2018Updated 7 years ago
- A GIT clone of uthash.sourceforge.net, a hash table, implemented in C, supporting constant-time add/find/remove of C structures. Any stru…☆37Oct 17, 2013Updated 12 years ago
- Crit-bit tree (trie) library☆32Jun 8, 2014Updated 11 years ago
- LZSSE compression codec ported to SIMDe☆19Jul 2, 2020Updated 5 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Apr 19, 2024Updated last year
- message queue☆18Apr 10, 2022Updated 3 years ago
- Adaptive Radix Trees implemented in C☆817Mar 21, 2022Updated 3 years ago
- Experiments with array layouts for comparison-based searching☆87Jan 5, 2024Updated 2 years ago
- A compact implementation of Dr. Askitis HatTrie☆80May 20, 2014Updated 11 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52May 2, 2017Updated 8 years ago
- github.com/cznic/interval has moved to modernc.org/interval☆11Nov 22, 2018Updated 7 years ago
- C library implementing the ridiculously fast CLHash hashing function☆282Apr 4, 2024Updated last year
- Super-efficient, in-memory key/value data store☆21Jul 28, 2017Updated 8 years ago
- Automatic codegen for encoding/binary marshaling☆17Mar 14, 2015Updated 10 years ago
- LSM-trie☆115Mar 22, 2021Updated 4 years ago
- An-source C library developed and used at AppNexus.☆114Nov 24, 2019Updated 6 years ago
- blance - functional algorithm to assign partitions and replicas across distributed nodes☆14Apr 2, 2024Updated last year
- DBSCAN clustering optimized for multicore processing.☆12Jul 21, 2015Updated 10 years ago
- Fast compressed trie dictionary library☆71Sep 20, 2024Updated last year
- Low memory multithreaded hash table☆24Mar 23, 2015Updated 10 years ago
- A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.☆38Jul 24, 2020Updated 5 years ago
- BitMagic Library☆443Aug 26, 2025Updated 6 months ago
- ☆25Dec 9, 2024Updated last year
- Cuckoo Filter: Practically Better Than Bloom☆13Feb 21, 2023Updated 3 years ago
- Vectorized intersections (research code)☆16Jan 13, 2017Updated 9 years ago
- All-in-one text tokenizer for Go. Super-fast. Lots of features.☆13Dec 18, 2015Updated 10 years ago
- Dremel DB Column Striping and Record Assembly Algorithms in Golang☆21Jul 11, 2013Updated 12 years ago
- Intriman is a documentation generator that retargets the Intel Intrinsics Guide to other documentation formats☆28Jun 15, 2022Updated 3 years ago
- PopCount implementation for Go. Using hardware POPCNT instruction if available it.☆23May 30, 2017Updated 8 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆68Jan 30, 2024Updated 2 years ago
- A simple, reference implementation of a B^e-tree☆164Mar 25, 2019Updated 6 years ago
- Fast Approximate Membership Filters (C++)☆289Aug 29, 2025Updated 6 months ago
- C99 trie library☆101May 4, 2019Updated 6 years ago
- Lightweight SSA compiler suite☆11Sep 27, 2024Updated last year
- compressed, queryable variation graphs☆11Jun 25, 2015Updated 10 years ago
- My "fork" of Adrian Thurston's syntax file☆15Dec 23, 2017Updated 8 years ago
- A Secure and Memory-Efficient Heap Allocator☆34Jun 21, 2024Updated last year