Alternatives and similar repositories for zuckerli

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

• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• KWillets / range_generator
  Some variations on Lemire's Fast Random Integer Generation in an Interval
  ☆15Updated 5 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• zwegner / Miroslav
  A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD
  ☆12Updated 6 years ago
• WojciechMula / ternary-logic
  Support for ternary logic in SSE, XOP, AVX2 and x86 programs
  ☆31Updated 6 months ago
• tpn / perfecthash
  A performant, parallel, probabilistic, random acyclic-graph, low-latency, perfect hash generation library.
  ☆83Updated last month
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• plasma-umass / entroprise
  measure entropy of memory allocators
  ☆12Updated 3 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 6 years ago
• det / segmented_tree
  Sequence data structure with efficient random access insert and erase
  ☆13Updated last year
• sillycross / mlpds
  MlpIndex - Extremely fast ordered index via memory level parallelism
  ☆12Updated 6 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• jermp / dint
  Dictionary-based compression for inverted indexes.
  ☆23Updated 6 years ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆30Updated 3 months ago
• Keith-Cancel / k-hashv
  A vectorized single header hash function.
  ☆19Updated 7 months ago
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆30Updated 6 years ago
• lemire / backward_multiplication
  Multiplying... backward?
  ☆14Updated 4 years ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆40Updated 5 years ago
• 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
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• 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
• vigna / sux
  Succinct data structures in C/C++
  ☆89Updated 9 months ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆39Updated 4 years ago
• plasma-umass / memory-landscape
  The space of memory management research and systems produced by the PLASMA lab (https://plasma-umass.org).
  ☆20Updated 4 years ago
• rutgers-apl / TaskProf
  A Parallelism Profiler with What-If analyses for Intel Threading Building Blocks (TBB) programs
  ☆13Updated 7 years ago
• ashvardanian / LibSee
  Link to this library and it will log all the LibC functions you are calling and how much time you are spending in them!
  ☆18Updated 6 months ago