Alternatives and similar repositories for batched_random

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

• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• Keith-Cancel / k-hashv
  A vectorized single header hash function.
  ☆19Updated 7 months ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated last year
• google-research / automemcpy
  ☆20Updated 3 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• 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
• WojciechMula / ternary-logic
  Support for ternary logic in SSE, XOP, AVX2 and x86 programs
  ☆31Updated 5 months ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆40Updated 5 years ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• cleeus / hashx4
  A collection of SIMD optimized general purpose hash functions
  ☆45Updated 10 years ago
• mars-research / DRAMHiT
  ☆29Updated this week
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• boostorg / boost_unordered_benchmarks
  ☆21Updated 8 months ago
• gerben-s / quicksort-blog-post
  ☆39Updated 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
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• 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
• WojciechMula / parsing-int-series
  Parse multiple decimal integers separated by arbitrary number of delimiters
  ☆36Updated last year
• BenjaminNavarro / lvc
  Collection of C++ containers extracted from LLVM
  ☆26Updated 4 years ago
• lemire / fast_division
  Simple C++ code to benchmark fast division algorithms
  ☆51Updated 4 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
  ☆54Updated last year
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆66Updated 4 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆34Updated last year
• jermp / mm_file
  A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.
  ☆26Updated 9 months ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆45Updated 11 years ago
• ppetr / lockfree-userspace-rcu
  Lock-free RCU (Read-Copy-Update) user-space library
  ☆10Updated last year
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago