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 fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆29Updated last week
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 7 months ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆35Updated 2 years ago
- Adaptive Radix Tree in C++☆41Updated last week
- ☆53Updated 11 months ago
- Bit packed vector of integral values☆27Updated 2 months ago
- Fast in-place radix sort with STL-like API☆46Updated 8 years ago
- Learned Monotone Minimal Perfect Hashing☆25Updated 2 weeks ago
- ☆20Updated 2 years ago
- Succinct C++☆24Updated 4 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆19Updated 2 weeks ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆27Updated 4 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- This repository contains our work on efficient SIMD vectorization methods for hashing in OpenCL. It was first published at the 21th Inter…☆11Updated 6 years ago
- Template Vector Library☆18Updated 3 years ago
- ☆12Updated 6 years ago
- Additional C++11 Random Distributions☆17Updated 10 months ago
- Compact Tree Representation☆16Updated 8 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- For details, see the blog post:☆32Updated last year
- Five implementations of double linked lists to demonstrate generic data structures in C☆15Updated 5 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- Implemented Concurrent Priority Queues using fine grained locking over sequential heap and lockfree skiplist-based☆8Updated 7 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆43Updated 2 weeks ago