imneme / bounded-rands

Related projects ⓘ

Alternatives and complementary repositories for bounded-rands

• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆56Updated 5 years ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 4 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆157Updated last month
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 7 years ago
• jonmaiga / mx3
  A bit mixer, pseudo random number generator and a hash function.
  ☆20Updated 2 years ago
• bdonlan / branchless-utf8
  Branchless UTF-8 decoder
  ☆33Updated 7 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 2 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• kagiannis / FPC
  FPC - Fast Prefix Coder
  ☆30Updated 2 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆111Updated 4 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• dougallj / zlib-dougallj
  Experimental fork of zlib with performance improvements
  ☆35Updated last year
• aphitorite / Logsort
  O(n log n) In-place Stable Quicksort
  ☆14Updated last month
• suiginsoft / hebimath
  arbitrary precision arithmetic library
  ☆42Updated 6 years ago
• WojciechMula / ternary-logic
  Support for ternary logic in SSE, XOP, AVX2 and x86 programs
  ☆31Updated 3 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 3 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆59Updated 3 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated 8 months ago
• HolyGrailSortProject / Rewritten-Grailsort
  A diverse array of heavily refactored versions of Andrey Astrelin's GrailSort.h, aiming to be as readable and intuitive as possible
  ☆45Updated last month
• liuliu / co
  Example implementation of coroutine in C
  ☆19Updated 4 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆52Updated 6 years ago
• rutgers-apl / rlibm-32
  RLibm for 32-bit representations (float and posit32)
  ☆61Updated 3 years ago
• rurban / libu8ident
  unicode security guidelines for identifiers
  ☆19Updated last year
• kristiandupont / rtasm
  Runtime Assembler for C++
  ☆13Updated 11 months ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆133Updated 4 years ago
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆46Updated 3 months ago
• stephenrkell / libcrunch
  A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.
  ☆101Updated 2 months ago
• WojciechMula / parsing-int-series
  Parse multiple decimal integers separated by arbitrary number of delimiters
  ☆34Updated 9 months ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago