nicola-gigante / bitvectorLinks
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
☆26Updated 3 years ago
Alternatives and similar repositories for bitvector
Users that are interested in bitvector are comparing it to the libraries listed below
Sorting:
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- For details, see the blog post:☆32Updated last year
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Intriman is a documentation generator that retargets the Intel Intrinsics Guide to other documentation formats☆28Updated 3 years ago
- Vectorized version of the PCG random number generator☆80Updated 4 months ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated 6 months ago
- Create man pages from information used by Intel Intrinsics Guide and optionally uops.info☆45Updated 6 months ago
- benchmarking positional population count☆15Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆39Updated 4 years ago
- Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.☆39Updated 7 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- An exploratory implementation of bit overloads of the C++ standard algorithms☆18Updated 4 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- A collection of SIMD optimized general purpose hash functions☆45Updated 10 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated 3 months ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- A benchmark for cache efficient data structures.☆30Updated 6 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- immintrin_dbg.h is an include file, a wrapper around immintrin.h. It implements most of AVX, AVX2, AVX-512 vector intrinsics to enable so…☆56Updated 2 years ago
- A performant, parallel, probabilistic, random acyclic-graph, low-latency, perfect hash generation library.☆83Updated last month
- Parse multiple decimal integers separated by arbitrary number of delimiters☆36Updated last year
- Benchmarks for our memory allocator☆65Updated last year
- A small DFA for under 16 states☆51Updated 7 years ago
- How fast can we shuffle values?☆37Updated last year
- String to Float Benchmark☆19Updated 6 years ago