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.
  ☆23Updated 3 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆175Updated 5 years ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆126Updated last month
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 4 months ago
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆444Updated last year
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆122Updated 10 months ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆166Updated last year
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆132Updated last year
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆316Updated 2 years ago
• llnl / metall
  Persistent memory allocator for data-centric analytics
  ☆60Updated 2 months ago
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆144Updated 6 years ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆87Updated 2 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• cmuparlay / parlaylib
  A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
  ☆418Updated 2 months ago
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆442Updated 6 months ago
• WojciechMula / sse-popcount
  SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html
  ☆354Updated last year
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 8 years ago
• sid1607 / avx2-merge-sort
  ☆17Updated 9 years ago
• MorphStore / TVLLib
  Template Vector Library
  ☆18Updated 4 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆251Updated 4 years ago
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆359Updated last year
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆21Updated 5 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆316Updated 4 years ago
• jwbuurlage / Bulk
  Modern library for bulk-synchronous parallel programs.
  ☆94Updated 2 years ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆137Updated 2 weeks ago
• emeryberger / Heap-Layers
  Heap Layers: An Extensible Memory Allocation Infrastructure
  ☆411Updated 3 weeks ago
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆159Updated 3 years ago