Alternatives and similar repositories for growt:

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

• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆124Updated last year
• cmuparlay / flock
  Library for lock-free locks
  ☆77Updated last year
• 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
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆85Updated 2 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆114Updated last week
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆307Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆274Updated 2 months ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆250Updated 3 years ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆119Updated 2 weeks ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 7 years ago
• cmuparlay / concurrent_deferred_rc
  Concurrent Deferred Reference Counting
  ☆159Updated last year
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆213Updated last year
• rigtorp / HashMap
  An open addressing linear probing hash table, tuned for delete heavy workloads
  ☆203Updated last year
• LLNL / metall
  Persistent memory allocator for data-centric analytics
  ☆54Updated 3 weeks ago
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆407Updated 2 months ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆124Updated 5 years ago
• MorphStore / TVLLib
  Template Vector Library
  ☆18Updated 3 years ago
• google / hashtable-benchmarks
  ☆105Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆139Updated 5 years ago
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆151Updated 2 years ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆179Updated 7 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆309Updated 4 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆154Updated last year
• GorNishanov / await
  ☆127Updated 2 years ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆161Updated 2 months ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• cmuparlay / parlaylib
  A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
  ☆351Updated 3 months ago