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 2 years ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆124Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆279Updated 6 months ago
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆416Updated 6 months ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆172Updated 5 years ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆86Updated 2 years ago
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆310Updated 2 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆117Updated 3 months ago
• cmuparlay / flock
  Library for lock-free locks
  ☆82Updated 2 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• cmuparlay / parlaylib
  A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
  ☆368Updated last month
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆142Updated 6 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆121Updated 5 months ago
• jwbuurlage / Bulk
  A modern interface for implementing bulk-synchronous parallel programs.
  ☆94Updated 2 years ago
• LLNL / metall
  Persistent memory allocator for data-centric analytics
  ☆55Updated 2 weeks ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆163Updated 5 months ago
• MorphStore / TVLLib
  Template Vector Library
  ☆18Updated 4 years ago
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆434Updated this week
• sparsehash / sparsehash-c11
  Experimental C++11 version of sparsehash
  ☆291Updated 2 years ago
• david-grs / geiger
  C++ micro benchmark library
  ☆97Updated 8 years ago
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆90Updated 7 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• mpoeter / emr
  Effective Memory Reclamation
  ☆58Updated 5 years ago
• cmuparlay / concurrent_deferred_rc
  Concurrent Deferred Reference Counting
  ☆165Updated last year
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆135Updated 5 years ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• google / hashtable-benchmarks
  ☆107Updated last year
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆310Updated 4 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆249Updated 3 years ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆127Updated 3 months ago