qp tries and crit-bit tries
☆123Jul 12, 2022Updated 4 years ago
Alternatives and similar repositories for qp
Users that are interested in qp are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- A qp-trie implementation in Rust☆43Sep 25, 2026Updated last month
- Critbit trees in C☆336Dec 17, 2021Updated 4 years ago
- Compact tries for fixed-width keys☆28Jun 4, 2018Updated 8 years ago
- External memory suffix array construction using inducing☆12Jul 27, 2020Updated 6 years ago
- message queue☆18Apr 10, 2022Updated 4 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Crit-bit tree (trie) library☆32Jun 8, 2014Updated 12 years ago
- Benchmark various data structures / algorithms for string searching.☆15Jul 1, 2015Updated 11 years ago
- Adaptive Radix Trees implemented in C☆839Mar 21, 2022Updated 4 years ago
- Dan Bernstein's qhasm package☆12Oct 10, 2015Updated 11 years ago
- Crit-bit tree☆26Nov 9, 2021Updated 4 years ago
- PopCount implementation for Go. Using hardware POPCNT instruction if available it.☆23May 30, 2017Updated 9 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆55Apr 19, 2024Updated 2 years ago
- Static Radix Tree (Patricia trie) implementation in C☆48May 17, 2017Updated 9 years ago
- Proof of concept LSM-tree built on MDB☆17Jun 1, 2015Updated 11 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- LZSSE compression codec ported to SIMDe☆21Jul 2, 2020Updated 6 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆52Sep 13, 2026Updated last month
- Optimal cache stampede prevention☆16May 11, 2017Updated 9 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 8 years ago
- C++ implementation of a fast and memory efficient HAT-trie☆874Nov 11, 2025Updated 11 months ago
- fast parallel file copy for Plan 9☆15Nov 2, 2023Updated 2 years ago
- BitMagic Library☆456Oct 18, 2026Updated 2 weeks ago
- git mirror of Bob Jenkins' Minimal Perfect Hashing article and code☆16Jun 8, 2021Updated 5 years ago
- A compact implementation of Dr. Askitis HatTrie☆81May 20, 2014Updated 12 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Fast compressed trie dictionary library☆73Sep 20, 2024Updated 2 years ago
- Low memory multithreaded hash table☆25Mar 23, 2015Updated 11 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆53May 2, 2017Updated 9 years ago
- crit-bit for golang and its applications (sorted map, IP routing table)☆47Dec 17, 2020Updated 5 years ago
- Lock-free multithreaded memory allocation☆111Dec 14, 2016Updated 9 years ago
- DBSCAN clustering optimized for multicore processing.☆13Jul 21, 2015Updated 11 years ago
- Self-Tuning Adaptive Radix Tree☆32Apr 19, 2020Updated 6 years ago
- A simple, reference implementation of a B^e-tree☆170Mar 25, 2019Updated 7 years ago
- Experiments with array layouts for comparison-based searching☆87Jan 5, 2024Updated 2 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- C library implementing the ridiculously fast CLHash hashing function☆306May 23, 2026Updated 5 months ago
- A collection of succinct data structures☆219Jan 3, 2024Updated 2 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆24Sep 16, 2022Updated 4 years ago
- Artifact for PPoPP'18☆19Apr 11, 2022Updated 4 years ago
- My "fork" of Adrian Thurston's syntax file☆15Dec 23, 2017Updated 8 years ago
- AVX-2 vectorised 8-bit positional popcount for Go☆23Aug 28, 2020Updated 6 years ago
- A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.☆38Jul 24, 2020Updated 6 years ago