Alternatives and similar repositories for ssssort

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

• tinloaf / ygg
  An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
  ☆131Updated 2 years ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆67Updated 2 months ago
• MakersF / corobatch
  ☆25Updated 5 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆35Updated 2 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆117Updated last year
• yet-another-user / pimpl
  The C++ Pimpl Idiom Again!
  ☆37Updated 7 years ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆36Updated 7 years ago
• HowardHinnant / hash_append
  Implementation of hash_append proposal
  ☆67Updated 9 years ago
• taocpp / tuple
  Compile-time-efficient proof-of-concept implementation for std::tuple
  ☆94Updated last month
• executors / executors
  A proposal for a executor programming model for ISO C++
  ☆141Updated 5 years ago
• alasdairmackintosh / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆35Updated 10 years ago
• aguinet / pector
  A C++11 std::vector-compliant implementation with a customizable size type and growing algorithm
  ☆70Updated 10 years ago
• david-grs / static_any
  generic stack-based container
  ☆110Updated 7 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆185Updated 2 months ago
• foonathan / tiny
  low-level library for minimizing the size of your types
  ☆118Updated 6 years ago
• mattreecebentley / plf_list
  A drop-in replacement for std::list with 293% faster insertion, 57% faster erasure, 17% faster iteration and 77% faster sorting on averag…
  ☆165Updated last month
• executors / futures
  A proposal for a futures programming model for ISO C++
  ☆23Updated 7 years ago
• hanickadot / static-regexp-old
  Very fast regexp using c++11 templates.
  ☆83Updated 10 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆33Updated 8 years ago
• vreverdy / bit
  The Bit Library
  ☆58Updated 6 years ago
• jacquelinekay / petra
  runtime to compile-time mappings
  ☆109Updated 8 years ago
• ogiroux / atomic_wait
  Sample implementation of C++20 atomic_wait/notify
  ☆62Updated 6 years ago
• zajo / boost-noexcept
  ☆27Updated 8 years ago
• romange / gaia
  C++ framework for rapid server development
  ☆76Updated last year
• moroneyt / ctla
  Compile-time linear algebra in C++
  ☆56Updated 8 years ago
• boostorg / stl_interfaces
  A C++14 and later CRTP template for defining iterators
  ☆76Updated last month
• executors / executors-impl
  A prototype implementation of the executors proposal
  ☆86Updated 6 years ago
• rollbear / prio_queue
  C++14 cache friendly B-heap priority queue
  ☆109Updated 4 months ago
• boostorg / variant2
  A never-valueless, strong guarantee implementation of std::variant
  ☆71Updated this week