Alternatives and similar repositories for simdpcg

Users that are interested in simdpcg are comparing it to the libraries listed below

• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆117Updated 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
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated last year
• adrian17 / cpp-drop-merge-sort
  C++ reimplementation of https://github.com/emilk/drop-merge-sort
  ☆21Updated 3 years ago
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆53Updated 2 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…
  ☆45Updated 4 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• gnzlbg / scattered
  C++ Scattered Containers
  ☆67Updated 7 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• simd-sorting / fast-and-robust
  ☆31Updated 3 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆46Updated 6 years ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆26Updated 3 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• gpderetta / libtask
  ☆13Updated 9 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆57Updated 6 years ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆61Updated last year
• kokkos / array_ref
  Polymorphic multidimensional array view
  ☆36Updated 5 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year