lemire / FastShuffleExperiments
How fast can we shuffle values?
☆37Updated last year
Alternatives and similar repositories for FastShuffleExperiments:
Users that are interested in FastShuffleExperiments are comparing it to the libraries listed below
- For details, see the blog post:☆32Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- ☆39Updated 4 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆65Updated 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 hash table implementation using Robin Hood Linear Probing☆50Updated 10 years ago
- Vectorized version of the PCG random number generator☆77Updated last month
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆38Updated 4 years ago
- Linear vs binary search benchmark☆40Updated 5 years ago
- Succinct data structures in C/C++☆87Updated 6 months ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Improved NetBSD's Perfect Hash Generation Tool v3☆19Updated 11 months ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- Dictionary-based compression for inverted indexes.☆23Updated 6 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- String to Float Benchmark☆19Updated 6 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- A persistent hash array-mapped trie for C++☆91Updated last year
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆32Updated 7 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- ☆12Updated 8 years ago