Alternatives and similar repositories for mlpds

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

• WojciechMula / ternary-logic
  Support for ternary logic in SSE, XOP, AVX2 and x86 programs
  ☆31Updated 6 months ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• KWillets / range_generator
  Some variations on Lemire's Fast Random Integer Generation in an Interval
  ☆15Updated 5 years ago
• zwegner / Miroslav
  A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD
  ☆12Updated 6 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• KWillets / fastdecode-utf-8
  SIMD-accelerated UTF-8 to UTF-32 conversion
  ☆11Updated 6 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
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 9 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 7 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 6 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• jermp / dint
  Dictionary-based compression for inverted indexes.
  ☆23Updated 6 years ago
• silentbicycle / skiparray
  unrolled skip list library for C
  ☆21Updated 6 years ago
• scandum / octosort
  Octosort is an in-place stable adaptive block merge sort.
  ☆18Updated 2 years ago
• 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
• travisdowns / concurrency-hierarchy-bench
  Supporting code for the concurrency hierarchy described in this blog post: https://travisdowns.github.io/blog/2020/07/06/concurrency-cost…
  ☆26Updated 3 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 years ago
• rurban / nbperf
  Improved NetBSD's Perfect Hash Generation Tool v3
  ☆20Updated last year
• willemt / splay-tree
  A splaytree ADT written in C with a BSD license
  ☆18Updated 5 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• blu / ascii_pruner
  Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64
  ☆10Updated 4 years ago
• Keith-Cancel / k-hashv
  A vectorized single header hash function.
  ☆19Updated 7 months ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 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
• lemire / backward_multiplication
  Multiplying... backward?
  ☆14Updated 4 years ago
• max0x7ba / parse-integers-benchmark
  Benchmarking reading and parsing integers from a file in C++.
  ☆9Updated 5 years ago