Alternatives and similar repositories for ssssort

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

• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆67Updated 3 months ago
• MakersF / corobatch
  ☆25Updated 5 years ago
• HowardHinnant / hash_append
  Implementation of hash_append proposal
  ☆67Updated 9 years ago
• mpoeter / emr
  Effective Memory Reclamation
  ☆63Updated 6 years ago
• aguinet / pector
  A C++11 std::vector-compliant implementation with a customizable size type and growing algorithm
  ☆70Updated 10 years ago
• taocpp / sequences
  Variadic templates and std::integer_sequence support library
  ☆112Updated 11 months ago
• david-grs / static_any
  generic stack-based container
  ☆110Updated 7 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆33Updated 8 years ago
• alasdairmackintosh / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆35Updated 10 years ago
• taocpp / tuple
  Compile-time-efficient proof-of-concept implementation for std::tuple
  ☆94Updated last month
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆185Updated 3 months ago
• jwbuurlage / Bulk
  Modern library for bulk-synchronous parallel programs.
  ☆94Updated 2 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆92Updated 2 years ago
• executors / executors-impl
  A prototype implementation of the executors proposal
  ☆86Updated 7 years ago
• executors / futures
  A proposal for a futures programming model for ISO C++
  ☆23Updated 7 years ago
• boostorg / stl_interfaces
  A C++14 and later CRTP template for defining iterators
  ☆76Updated 2 months ago
• tinloaf / ygg
  An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
  ☆132Updated 2 years ago
• mpaland / avl_array
  High performance templated AVL tree using a fixed size array. Extensive test suite passing.
  ☆51Updated 4 years ago
• boostorg / poly_collection
  Fast containers of polymorphic objects.
  ☆71Updated 2 months ago
• vittorioromeo / orizzonte
  WIP
  ☆27Updated 6 years ago
• foonathan / tiny
  low-level library for minimizing the size of your types
  ☆118Updated 6 years ago
• executors / executors
  A proposal for a executor programming model for ISO C++
  ☆141Updated 5 years ago
• jaredhoberock / tuple_utility
  The missing C++ tuple functionality
  ☆85Updated 5 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
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆118Updated last year
• boostorg / variant2
  A never-valueless, strong guarantee implementation of std::variant
  ☆71Updated last week
• rhalbersma / bit_set
  Rebooting the std::bitset franchise
  ☆46Updated last month
• SephDB / constexpr-format
  Compile-time printf-like string formatting
  ☆76Updated 7 years ago
• NickStrupat / Aligned
  Memory alignment wrappers, useful for avoiding false sharing
  ☆41Updated 9 years ago