Alternatives and similar repositories for bloom-cpp

Users that are interested in bloom-cpp are comparing it to the libraries listed below

• yandex / fastops
  This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …
  ☆87Updated 3 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆54Updated last year
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 8 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆62Updated 6 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 7 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 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
• andralex / MedianOfNinthers
  ☆49Updated 5 years ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆124Updated 2 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• alasdairmackintosh / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆35Updated 9 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• goldshtn / shmemq-blog
  Shared memory queue benchmarks and tracing for blog
  ☆80Updated 9 years ago
• tinloaf / ygg
  An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
  ☆128Updated 2 years ago
• efficient / fast-succinct-trie
  ☆26Updated 8 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆41Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆48Updated 6 years ago
• google / dimsum
  Portable C++ SIMD library
  ☆173Updated 5 years ago
• samanbarghi / MPSCQ
  An intrusive lock-free multiple-producer, single-consumer queue in C++
  ☆52Updated 8 years ago
• rollbear / prio_queue
  C++14 cache friendly B-heap priority queue
  ☆105Updated 4 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆88Updated 10 months ago
• Donald-Rupin / zab
  C++20 liburing backed coroutine executor and event loop framework.
  ☆66Updated 3 years ago
• habanero-rice / hclib
  A C/C++ task-based programming model for shared memory and distributed parallel computing.
  ☆72Updated 5 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago