tarsa / SortingAlgorithmsBenchmarkLinks
☆16Updated 11 years ago
Alternatives and similar repositories for SortingAlgorithmsBenchmark
Users that are interested in SortingAlgorithmsBenchmark are comparing it to the libraries listed below
Sorting:
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- benchmarking positional population count☆15Updated last year
- 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
- ☆21Updated 8 months ago
- For details, see the blog post:☆32Updated last year
- A proposal for a futures programming model for ISO C++☆22Updated 6 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- A benchmark of some prominent C/C++ hash table implementations☆105Updated 6 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Boost.Sort☆53Updated last week
- Persistent memory allocator for data-centric analytics☆55Updated 2 weeks ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Vectorized version of the PCG random number generator☆80Updated 4 months 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 comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆35Updated last year
- Looking into the performance of heaps, starting with the Min-Max Heap☆67Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- C++ Library of Atomic and Lockless Data Structures☆38Updated 5 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆32Updated 8 years ago
- Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math☆26Updated 6 years ago
- C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…☆77Updated 4 years ago
- How fast can we shuffle values?☆37Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Finite State Coder☆14Updated 10 years ago
- fast prime sieve and hash algorithm☆38Updated last month