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☆46Updated 5 years ago
- benchmarking positional population count☆15Updated last year
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Vectorized version of the PCG random number generator☆83Updated 7 months ago
- fast prime sieve and hash algorithm☆38Updated last month
- For details, see the blog post:☆34Updated last year
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆38Updated last year
- 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
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆69Updated 4 years ago
- A proposal for a futures programming model for ISO C++☆22Updated 7 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- UME::SIMD A library for explicit simd vectorization.☆91Updated 7 years ago
- C++ Library of Atomic and Lockless Data Structures☆38Updated 5 years ago
- ☆110Updated last year
- DSL for SIMD Sorting on AVX2 & AVX512☆31Updated 6 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆113Updated 9 months ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- Persistent memory allocator for data-centric analytics☆56Updated last week
- Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.☆39Updated 8 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
- EDSL for C++ to make just-in-time code generation easier☆85Updated 2 years ago
- C library to compute the Hamming weight of arrays☆49Updated 6 years ago
- A collection of SIMD optimized general purpose hash functions☆47Updated 10 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 3 years ago
- Library for lock-free locks☆83Updated 2 years ago
- Succinct data structures in C/C++☆88Updated last year
- Mirror of Agner Fog's C++ vector class library☆30Updated 6 years ago