Alternatives and similar repositories for timsort-cpp:

Users that are interested in timsort-cpp are comparing it to the libraries listed below

• ktprime / ktprime
  fast prime sieve and hash algorithm
  ☆38Updated last year
• ademakov / Oroch
  A C++ library for integer array compression
  ☆28Updated 2 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆90Updated last year
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆73Updated 10 years ago
• alasdairmackintosh / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆35Updated 9 years ago
• Tessil / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆37Updated 4 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• HowardHinnant / hash_append
  Implementation of hash_append proposal
  ☆69Updated 8 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆177Updated 4 months ago
• ogiroux / atomic_wait
  Sample implementation of C++20 atomic_wait/notify
  ☆59Updated 5 years ago
• iodcpp / metamap
  C++17 immutable compile-time key value map
  ☆50Updated 5 years ago
• laudrup / lz4_stream
  A C++ stream using LZ4 (de)compression
  ☆39Updated 3 years ago
• executors / futures
  A proposal for a futures programming model for ISO C++
  ☆22Updated 6 years ago
• jamboree / CxxFunctionBenchmark
  benchmark for various C++ function implementations; focus on invocation time
  ☆95Updated 6 years ago
• viboes / std-make
  C++ generic make factory
  ☆106Updated 5 years ago
• drbobbeaty / DKit
  C++ Library of Atomic and Lockless Data Structures
  ☆38Updated 4 years ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆30Updated 6 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆51Updated 11 months ago
• ldionne / mpl11
  Enjoy template metaprogramming
  ☆113Updated 8 years ago
• tinloaf / ygg
  An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
  ☆124Updated last year
• BlazingPhoenix / concurrent-hash-map
  STL compatible implementation of hash map optimized for concurrent access
  ☆25Updated 5 years ago
• greg7mdp / sho
  Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.
  ☆39Updated 7 years ago
• boostorg / multi_index
  Boost.org multi_index module
  ☆47Updated last month
• boostorg / coroutine
  Boost.Coroutine
  ☆81Updated last month
• boostorg / yap
  A C++14-and-later expression template library
  ☆108Updated last month
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆60Updated last year
• akashihi / stlcache
  STL-based caches for C++
  ☆115Updated last year
• martinmoene / byte-lite
  byte lite - A C++17-like byte type for C++98, C++11 and later in a single-file header-only library
  ☆53Updated 7 months ago
• google / hashtable-benchmarks
  ☆104Updated last year
• paulross / skiplist
  A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!
  ☆47Updated 5 months ago