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.
  ☆22Updated 3 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆438Updated 10 months ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆126Updated 2 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆286Updated 2 months ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆129Updated 9 months ago
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆316Updated 2 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆143Updated 6 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆85Updated 2 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆120Updated 7 months ago
• david-grs / geiger
  C++ micro benchmark library
  ☆97Updated 8 years ago
• google / hashtable-benchmarks
  ☆111Updated last year
• cmuparlay / concurrent_deferred_rc
  Concurrent Deferred Reference Counting
  ☆169Updated last year
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆164Updated 9 months ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆135Updated 2 weeks ago
• sparsehash / sparsehash-c11
  Experimental C++11 version of sparsehash
  ☆293Updated 3 years ago
• WojciechMula / sse-popcount
  SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html
  ☆349Updated last year
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 7 years ago
• rigtorp / HashMap
  An open addressing linear probing hash table, tuned for delete heavy workloads
  ☆211Updated 2 years ago
• Tessil / sparse-map
  C++ implementation of a memory efficient hash map and hash set
  ☆363Updated last week
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆314Updated 4 years ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆132Updated 7 months ago
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆439Updated 4 months ago
• tlk00 / BitMagic
  BitMagic Library
  ☆433Updated 2 months ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• emeryberger / Heap-Layers
  Heap Layers: An Extensible Memory Allocation Infrastructure
  ☆404Updated last month
• jwbuurlage / Bulk
  Modern library for bulk-synchronous parallel programs.
  ☆94Updated 2 years ago