justinasvd / art_mapLinks
std::map/std::set implementation using the adaptive radix tree
☆15Updated 4 years ago
Alternatives and similar repositories for art_map
Users that are interested in art_map are comparing it to the libraries listed below
Sorting:
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- C++ Implementation of Zip Trees☆14Updated 3 years ago
- ☆11Updated 2 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆34Updated last year
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Updated 3 years ago
- Bit packed vector of integral values☆28Updated 11 months ago
- Bloom-filter based minimal perfect hash function library☆270Updated 5 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Updated 3 months ago
- Additional C++11 Random Distributions☆19Updated last year
- Fast in-place radix sort with STL-like API☆48Updated 9 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Fast Approximate Membership Filters (C++)☆288Updated 4 months ago
- Benchmark of four minimal perfect hash libraries (phf, emphf, CMPH, Sux4J)☆14Updated 8 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Updated 2 years ago
- Compact Tree Representation☆16Updated 8 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- ☆57Updated last year
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆249Updated 2 months ago
- Ultra fast MSD radix sorter☆10Updated 5 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Updated 9 months ago
- Succinct Data Structure Library 3.0☆101Updated last month
- Dynamic succinct/compressed data structures☆113Updated 3 weeks ago
- Paper about the estimation of cardinalities from HyperLogLog sketches☆64Updated 4 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 7 years ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆26Updated 4 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 4 years ago
- Adaptive Radix Tree in C++☆50Updated 3 weeks ago