Alternatives and similar repositories for PolyZ

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

• lemire / despacer
  C library to remove white space from strings as fast as possible
  ☆156Updated last year
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆53Updated 7 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆122Updated 3 years ago
• stg7 / haesni
  haesni is a small hash function using aes-ni for fast string hashing
  ☆19Updated 7 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆159Updated last month
• lemire / rollinghashcpp
  Rolling Hash C++ Library
  ☆189Updated last year
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• fanf2 / hg64
  a 64-bit histogram / quantile sketch
  ☆59Updated 11 months ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆315Updated 4 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• goldsborough / tssx
  Transparently replace domain sockets with a fast shared memory channel
  ☆70Updated 9 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆51Updated 7 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 5 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 11 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆139Updated 11 months ago
• smilingthax / cttrie
  Compile-time TRIE based string matcher (C++11)
  ☆53Updated 6 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆85Updated last year
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆62Updated 6 years ago
• dcreager / libpush
  An arrow-based parser combinator library for C
  ☆39Updated 15 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• ot / succinct
  A collection of succinct data structures
  ☆211Updated last year
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• bretthall / Wyatt-STM
  Software transactional memory system developed at Wyatt Technology
  ☆29Updated 6 years ago