Alternatives and similar repositories for growt

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

• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆20Updated 3 years ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆124Updated 2 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆284Updated last month
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆431Updated 8 months ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆314Updated 2 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆142Updated 6 years ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆85Updated 2 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆118Updated 6 months ago
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆126Updated 8 months ago
• cmuparlay / parlaylib
  A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
  ☆376Updated 2 weeks ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• sparsehash / sparsehash-c11
  Experimental C++11 version of sparsehash
  ☆292Updated 2 years ago
• google / hashtable-benchmarks
  ☆109Updated last year
• WojciechMula / sse-popcount
  SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html
  ☆347Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆439Updated 2 months ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆312Updated 4 years ago
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆350Updated last year
• cmuparlay / concurrent_deferred_rc
  Concurrent Deferred Reference Counting
  ☆167Updated last year
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆164Updated 8 months ago
• emeryberger / Heap-Layers
  Heap Layers: An Extensible Memory Allocation Infrastructure
  ☆401Updated last week
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆156Updated 3 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• mpoeter / emr
  Effective Memory Reclamation
  ☆61Updated 5 years ago
• Tessil / sparse-map
  C++ implementation of a memory efficient hash map and hash set
  ☆362Updated 2 weeks ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆128Updated 6 months ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆134Updated 5 years ago
• MorphStore / TVLLib
  Template Vector Library
  ☆18Updated 4 years ago