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
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆34Updated 9 months ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Bit packed vector of integral values☆27Updated 8 months ago
- Additional C++11 Random Distributions☆19Updated last year
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Updated 2 years ago
- Adaptive Radix Tree in C++☆47Updated last week
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Updated 2 years ago
- Benchmark of four minimal perfect hash libraries (phf, emphf, CMPH, Sux4J)☆13Updated 8 years ago
- Ultra fast MSD radix sorter☆11Updated 5 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Updated 3 weeks ago
- Bloom-filter based minimal perfect hash function library☆266Updated 3 months ago
- ☆54Updated last year
- Fast Approximate Membership Filters (C++)☆286Updated last month
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆26Updated 4 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Compact Tree Representation☆16Updated 8 years ago
- FOundation of stXXl and thriLL☆14Updated last year
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 6 months ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 3 months ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆113Updated 9 months ago
- C++ library to easily start subprocesses and pipelines of commands☆16Updated 2 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- Library for lock-free locks☆83Updated 2 years ago
- Fast in-place radix sort with STL-like API☆48Updated 8 years ago