lemire / FastShuffleExperimentsLinks
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
Sorting:
- Bloom filter alternative (C++)☆18Updated 6 years ago
- For details, see the blog post:☆32Updated last year
- Looking into the performance of heaps, starting with the Min-Max Heap☆67Updated 4 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
- 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 flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- A collection of SIMD optimized general purpose hash functions☆45Updated 10 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆39Updated 4 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Vectorized version of the PCG random number generator☆80Updated 4 months ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated 6 months ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- String to Float Benchmark☆19Updated 6 years ago
- Succinct data structures in C/C++☆89Updated 9 months ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- A benchmark for sorting algorithms☆60Updated 4 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Improved NetBSD's Perfect Hash Generation Tool v3☆20Updated last year
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Comparing linear and binary searches☆41Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- header-only C++ template library to process n-dimensional arrays with multithreaded SIMD code☆43Updated 6 months ago
- ☆39Updated 4 years ago
- ☆20Updated 3 years ago