Alternatives and similar repositories for gheap

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

• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆313Updated 4 years ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆280Updated last year
• greg7mdp / dlmalloc
  C++ version of Doug Lea's excellent malloc() implementation.
  ☆153Updated 5 years ago
• lemire / cbitset
  A simple bitset library in C
  ☆137Updated 8 months ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆83Updated 7 months ago
• cleeus / obstack
  A C++ pointer bump memory arena implementation
  ☆94Updated 10 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆183Updated last year
• lemire / fastmod
  A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.
  ☆330Updated 11 months ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• vnmakarov / mum-hash
  Hashing functions and PRNGs based on them
  ☆164Updated 8 months ago
• markpapadakis / coros-fibers
  Coroutines/Fibers implementation for x86
  ☆65Updated 9 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 6 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• gpakosz / PackedArray
  Random access array of tightly packed unsigned integers
  ☆171Updated 3 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆34Updated last year
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆64Updated 2 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆69Updated 4 years ago
• komrad36 / SortingNetworks
  Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…
  ☆50Updated 4 years ago
• ned14 / nedtries
  A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…
  ☆275Updated 4 years ago
• LoopPerfect / conduit
  High Performance Streams Based on Coroutine TS ⚡
  ☆150Updated 6 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆142Updated 6 years ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆77Updated 11 years ago
• skeeto / lstack
  C11 Lock-free Stack
  ☆183Updated last year
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 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!
  ☆129Updated 2 years ago
• WojciechMula / sse4-strstr
  SIMD (SWAR/SSE/SSE4/AVX2/AVX512F/ARM Neon) of Karp-Rabin algorithm's modification
  ☆261Updated 3 years ago
• emeryberger / Heap-Layers
  Heap Layers: An Extensible Memory Allocation Infrastructure
  ☆402Updated last month
• sandialabs / qthreads
  Lightweight locality-aware user-level threading runtime.
  ☆196Updated 2 weeks ago