Alternatives and similar repositories for bounded-rands

Users that are interested in bounded-rands are comparing it to the libraries listed below

• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆61Updated 6 years ago
• bdonlan / branchless-utf8
  Branchless UTF-8 decoder
  ☆36Updated 8 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆159Updated 2 months ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆62Updated 6 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆120Updated 5 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆84Updated 6 years ago
• abolz / Drachennest
  Different algorithms for converting binary to decimal floating-point numbers
  ☆128Updated 3 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆63Updated 4 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• lemire / despacer
  C library to remove white space from strings as fast as possible
  ☆156Updated last year
• suiginsoft / hebimath
  arbitrary precision arithmetic library
  ☆44Updated 7 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• lemire / testingRNG
  Testing common random-number generators (RNG)
  ☆196Updated 2 weeks ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆53Updated 7 years ago
• waywardgeek / datadraw
  ☆42Updated 2 years ago
• smilingthax / cttrie
  Compile-time TRIE based string matcher (C++11)
  ☆53Updated 6 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆315Updated 4 years ago
• backtrace-labs / dynamic_flag
  A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case
  ☆76Updated 3 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆92Updated last year
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆40Updated last year
• rurban / perl-hash-stats
  Counting the collisions with perl hash tables per function
  ☆12Updated 6 years ago
• ludocode / schemaless-benchmarks
  Benchmarks for Schemaless Data Serialization Libraries
  ☆58Updated 4 years ago
• andralex / lomuto
  Code that accompanies the article "Lomuto's Comeback"
  ☆35Updated 5 years ago
• jonmaiga / mx3
  A bit mixer, pseudo random number generator and a hash function.
  ☆29Updated 3 years ago
• adrian-thurston / colm
  The Colm Programming Language
  ☆184Updated 5 months ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆84Updated 10 months ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 7 years ago
• beardsvibe / buildfox
  Minimalistic Ninja generator
  ☆51Updated 9 years ago