Alternatives and similar repositories for simd-heap

Users that are interested in simd-heap are comparing it to the libraries listed below

• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated last year
• greg7mdp / amt
  An Array Mapped Tree implementation
  ☆10Updated 4 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• 3rdparty / stout-borrowed-ptr
  C++ "borrowing" smart pointer.
  ☆11Updated 3 years ago
• jfalcou / raberu
  The Fancy Named Parameters Library
  ☆31Updated this week
• markisus / vapid-soa
  A header only structure of arrays container for C++
  ☆41Updated last year
• rigtorp / isatomic
  Test if AVX vector loads and stores are atomic
  ☆30Updated 4 years ago
• neumannt / exceptionperformance
  performance experiments for C++ exception handling
  ☆30Updated 3 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• ashvardanian / HashTableBenchmark
  A simple cross-platform speed & memory-efficiency benchmark for the most common hash-table implementations in the C++ world
  ☆11Updated 2 years ago
• intel / Immintrin-debug
  immintrin_dbg.h is an include file, a wrapper around immintrin.h. It implements most of AVX, AVX2, AVX-512 vector intrinsics to enable so…
  ☆57Updated 2 years ago
• goldsborough / bloom-cpp
  A header-only bloom filter implementation in C++14.
  ☆13Updated 6 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• ppetr / lockfree-userspace-rcu
  Lock-free RCU (Read-Copy-Update) user-space library
  ☆10Updated last year
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆38Updated 4 years ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆29Updated 6 years ago
• executors / futures-impl
  A prototype implementation of the futures proposal
  ☆11Updated 6 years ago
• Daskie / qc-hash
  (Legacy) Extremely fast unordered map and set library for C++20
  ☆11Updated last year
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 8 years ago
• WojciechMula / ternary-logic
  Support for ternary logic in SSE, XOP, AVX2 and x86 programs
  ☆31Updated 4 months ago
• jfalcou / tts
  Tiny Test System
  ☆27Updated last month
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆64Updated 9 years ago
• martinmoene / atomic-lite
  atomic lite - a C++11 atomic operations library for C++98 and later
  ☆13Updated last year
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• boostorg / boost_unordered_benchmarks
  ☆21Updated 6 months ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆15Updated 8 years ago
• KWillets / simd_interleave
  Interleaving bits from two sources using SIMD instructions.
  ☆14Updated 7 years ago
• lemire / fast_division
  Simple C++ code to benchmark fast division algorithms
  ☆50Updated 4 years ago
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆53Updated 2 years ago