Alternatives and similar repositories for vxsort-cpp

Users that are interested in vxsort-cpp are comparing it to the libraries listed below

• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆83Updated 6 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆15Updated last year
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 5 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆46Updated 5 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆41Updated 5 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆33Updated last year
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 5 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆83Updated 7 months ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• komrad36 / SortingNetworks
  Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…
  ☆50Updated 4 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆69Updated 2 years ago
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆156Updated 3 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆61Updated 4 years ago
• mars-research / DRAMHiT
  ☆31Updated this week
• cleeus / hashx4
  A collection of SIMD optimized general purpose hash functions
  ☆47Updated 10 years ago
• goldsteinn / SIMD-sorting-network
  SIMD sorting network generator and very basic tester
  ☆16Updated 3 years ago
• fast-pack / FrameOfReference
  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
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆38Updated last year
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆52Updated 2 years ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆41Updated 5 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• skarupke / two_bit_mutex
  Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer
  ☆25Updated 2 years ago
• WojciechMula / ternary-logic
  Support for ternary logic in SSE, XOP, AVX2 and x86 programs
  ☆31Updated 9 months ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago