pasta-toolbox / bit_vectorLinks
Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
☆31Updated 5 months ago
Alternatives and similar repositories for bit_vector
Users that are interested in bit_vector are comparing it to the libraries listed below
Sorting:
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Learned Monotone Minimal Perfect Hashing☆28Updated 6 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Succinct data structures in C/C++☆88Updated 11 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆48Updated 3 months ago
- Packed and Compressed Hash Tables☆15Updated 5 months ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆237Updated last week
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Updated 2 years ago
- Library for lock-free locks☆83Updated 2 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆164Updated 8 months ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- ☆17Updated 6 months ago
- Persistent memory allocator for data-centric analytics☆55Updated 2 months ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆112Updated 9 months ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Parallel Balanced Binary Tree Structures☆118Updated 6 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 7 months ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆126Updated 8 months ago
- Fast Approximate Membership Filters (C++)☆284Updated last month
- Multi-platform topology-aware memory management library☆13Updated 5 years ago
- ☆109Updated last year
- A blend of the compact and sparse hash table implementations.☆15Updated 4 years ago
- ☆38Updated 5 years ago
- Efficient Prefix-Sum data structures in C++.☆26Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago