nicola-gigante / bitvector
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 in succinct space
☆22Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for bitvector
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- For details, see the blog post:☆31Updated 11 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆53Updated 10 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- Vectorized version of the PCG random number generator☆75Updated 5 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 4 years ago
- A C++ library for integer array compression☆27Updated 2 years ago
- haesni is a small hash function using aes-ni for fast string hashing☆16Updated 6 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆62Updated 5 months ago
- Compact Data Structures Library☆98Updated 2 years ago
- Linear vs binary search benchmark☆41Updated 4 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 4 years ago
- Comparing linear and binary searches☆38Updated 4 years ago
- ☆12Updated 8 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆26Updated this week
- A fast implementation for varbyte 32bit/64bit integer compression☆115Updated 7 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year
- Pruning elements in SIMD vectors (i.e., packing left elements)☆60Updated 9 months ago
- benchmarking positional population count☆12Updated 8 months ago
- C library to compute the Hamming weight of arrays☆44Updated 5 years ago
- Universe-sliced indexes in C++.☆17Updated last year
- FOundation of stXXl and thriLL☆14Updated 10 months ago
- Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.☆37Updated 7 years ago
- A dynamic version of std::bitset☆16Updated 11 years ago
- Compact Tree Representation☆16Updated 7 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆50Updated 9 months ago
- Utilities to help using Coroutines with Ranges☆23Updated 7 years ago