justinasvd / art_mapLinks
std::map/std::set implementation using the adaptive radix tree
☆15Updated 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
Sorting:
- Adaptive Radix Tree in C++☆45Updated 2 weeks ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated 2 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 9 months ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆35Updated 2 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Bit packed vector of integral values☆27Updated 4 months ago
- Compact Tree Representation☆16Updated 8 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆19Updated 2 months ago
- For details, see the blog post:☆32Updated last year
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- Implemented Concurrent Priority Queues using fine grained locking over sequential heap and lockfree skiplist-based☆8Updated 7 years ago
- ☆54Updated last year
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- A benchmark for sorting algorithms☆60Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- ☆12Updated 6 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Efficient Prefix-Sum data structures in C++.☆26Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Succinct C++☆24Updated 4 years ago
- C++ library to easily start subprocesses and pipelines of commands☆15Updated 2 years ago
- Concurrent Hash Table☆27Updated last month
- ☆20Updated 2 years ago