justinasvd / art_map
std::map/std::set implementation using the adaptive radix tree
☆13Updated 3 years ago
Alternatives and similar repositories for art_map:
Users that are interested in art_map are comparing it to the libraries listed below
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆35Updated 2 years ago
- Adaptive Radix Tree in C++☆39Updated this week
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Implemented Concurrent Priority Queues using fine grained locking over sequential heap and lockfree skiplist-based☆9Updated 6 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 4 months ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 4 years ago
- Succinct C++☆25Updated 4 years ago
- Compact Tree Representation☆16Updated 7 years ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆27Updated 3 years ago
- Fast in-place radix sort with STL-like API☆46Updated 8 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆27Updated 2 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆17Updated last month
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- For details, see the blog post:☆32Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Bit packed vector of integral values☆26Updated last year
- ☆15Updated last week
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 3 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- Header-only, gzread-like reader for gzip, bz2, and xz.☆12Updated 6 years ago
- Benchmark of four minimal perfect hash libraries (phf, emphf, CMPH, Sux4J)☆13Updated 7 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆22Updated 2 years ago
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Updated 4 years ago
- ☆12Updated 6 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year