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
  ☆15Updated last year
• greg7mdp / amt
  An Array Mapped Tree implementation
  ☆10Updated 5 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 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…
  ☆56Updated 2 years ago
• jermp / dint
  Dictionary-based compression for inverted indexes.
  ☆23Updated 6 years ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆31Updated 6 years ago
• markisus / vapid-soa
  A header only structure of arrays container for C++
  ☆41Updated 2 years ago
• lemire / counters
  performance counters in C++
  ☆22Updated last month
• WojciechMula / ternary-logic
  Support for ternary logic in SSE, XOP, AVX2 and x86 programs
  ☆31Updated 6 months ago
• rigtorp / isatomic
  Test if AVX vector loads and stores are atomic
  ☆30Updated 5 years ago
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆53Updated 2 years ago
• skarupke / mutex_benchmarks
  Code for benchmarking of mutexes to accompany a blog post of mine.
  ☆28Updated 5 years ago
• KWillets / simd_interleave
  Interleaving bits from two sources using SIMD instructions.
  ☆14Updated 7 years ago
• skarupke / radix_sort
  ☆12Updated 8 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
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆26Updated last year
• jermp / mm_file
  A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.
  ☆26Updated 10 months ago
• cmuparlay / parlayhash
  Concurrent Hash Table
  ☆29Updated this week
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 4 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
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• DerekScottLedbetter / space-pruner
  Using ARM NEON instructions to filter an array.
  ☆11Updated 7 years ago
• node-dot-cpp / alloc-test
  Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical
  ☆46Updated 6 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆67Updated 4 years ago
• martinmoene / string-lite
  String facilities for C++98 and later - a library in search of its identity.
  ☆22Updated 2 years ago
• mattreecebentley / plf_indiesort
  A sort wrapper enabling both use of random-access sorting on non-random access containers, and increased performance for the sorting of l…
  ☆20Updated last week
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• lemire / fast_division
  Simple C++ code to benchmark fast division algorithms
  ☆52Updated 4 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆46Updated 11 years ago