Alternatives and similar repositories for smh

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

• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆85Updated 6 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• WojciechMula / ternary-logic
  Support for ternary logic in SSE, XOP, AVX2 and x86 programs
  ☆31Updated last year
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆54Updated 7 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆159Updated 2 weeks ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated 2 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• rurban / perl-hash-stats
  Counting the collisions with perl hash tables per function
  ☆12Updated 6 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 6 years ago
• pdillinger / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆24Updated 4 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆61Updated 6 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆86Updated 2 years ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆27Updated 5 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆38Updated 7 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆124Updated 3 years ago
• intel / lineuse
  I-cache line packing and branch misprediction measuring tool
  ☆18Updated 9 years ago
• stephenrkell / libcrunch
  A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.
  ☆107Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 3 years ago
• pramalhe / 2PLSF
  Two-Phase Locking with Starvation-Freedom
  ☆23Updated 3 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆139Updated last year
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 3 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆31Updated 2 years ago
• giannitedesco / cola
  Cache Oblivious Lookahead Arrays
  ☆27Updated 12 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆51Updated 7 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆39Updated 2 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 7 years ago
• zvelo / cmph
  C Minimal Perfect Hashing Library
  ☆88Updated 8 years ago
• appnexus / acf
  An-source C library developed and used at AppNexus.
  ☆113Updated 6 years ago
• stg7 / haesni
  haesni is a small hash function using aes-ni for fast string hashing
  ☆19Updated 7 years ago