Alternatives and similar repositories for vergesort

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

• SaadAhmad / in_constexpr
  An approach for runtime detection inside a constexpr function
  ☆80Updated 7 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• HDembinski / stateful_pointer
  Use unused bits in your pointer
  ☆46Updated 8 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 8 years ago
• jamboree / CxxFunctionBenchmark
  benchmark for various C++ function implementations; focus on invocation time
  ☆96Updated 6 years ago
• jacquelinekay / petra
  runtime to compile-time mappings
  ☆108Updated 8 years ago
• aguinet / pector
  A C++11 std::vector-compliant implementation with a customizable size type and growing algorithm
  ☆69Updated 10 years ago
• hanickadot / static-regexp-old
  Very fast regexp using c++11 templates.
  ☆83Updated 10 years ago
• HowardHinnant / hash_append
  Implementation of hash_append proposal
  ☆67Updated 8 years ago
• vreverdy / bit
  The Bit Library
  ☆58Updated 6 years ago
• r-lyeh-archived / ltalloc
  LightweighT Almost Lock-Less Oriented for C++ programs memory allocator
  ☆168Updated 6 years ago
• evgeny-panasyuk / stack_unwinding
  The stack_unwinding is a small header only C++ library which supplies primitive(class unwinding_indicator) to determining when object des…
  ☆87Updated 10 years ago
• gnzlbg / scattered
  C++ Scattered Containers
  ☆67Updated 8 years ago
• SephDB / constexpr-format
  Compile-time printf-like string formatting
  ☆77Updated 7 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆183Updated 2 weeks ago
• FelixPetriconi / AllocatorBuilder
  Policy Based C++ Allocator Library
  ☆123Updated 4 months ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆21Updated 5 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…
  ☆160Updated 4 months ago
• iodcpp / metamap
  C++17 immutable compile-time key value map
  ☆50Updated 5 years ago
• david-grs / static_any
  generic stack-based container
  ☆109Updated 7 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆120Updated 5 years ago
• foonathan / tiny
  low-level library for minimizing the size of your types
  ☆116Updated 6 years ago
• NickStrupat / Aligned
  Memory alignment wrappers, useful for avoiding false sharing
  ☆41Updated 9 years ago
• mattcalabrese / argot
  A C++ library that simplifies working with tuples, variants, and more through argument list generation and the ability to convert from ru…
  ☆62Updated 5 years ago
• ruslo / leathers
  Warning suppression library (C++)
  ☆83Updated 5 years ago
• taocpp / tuple
  Compile-time-efficient proof-of-concept implementation for std::tuple
  ☆94Updated 4 years ago
• google / dimsum
  Portable C++ SIMD library
  ☆171Updated 6 years ago
• bruxisma / retain-ptr
  WG21 P0468 implementation of an intrusive smart pointer for C++
  ☆58Updated 5 years ago
• adrian17 / cpp-drop-merge-sort
  C++ reimplementation of https://github.com/emilk/drop-merge-sort
  ☆21Updated 3 years ago
• DaemonSnake / unconstexpr
  a c++ header library that implements variant constexpr functions and types.
  ☆85Updated 5 years ago