Alternatives and similar repositories for sherwood_map

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

• 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
• markpapadakis / coros-fibers
  Coroutines/Fibers implementation for x86
  ☆65Updated 8 years ago
• nfrechette / gin
  A high performance C++ playground library
  ☆48Updated 9 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• adrian17 / cpp-drop-merge-sort
  C++ reimplementation of https://github.com/emilk/drop-merge-sort
  ☆21Updated 3 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆66Updated 4 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• mpark / format
  Compile-time Checked, Type-Safe Formatting in C++14
  ☆36Updated 8 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• orlp / devector
  Resizable contiguous sequence container with fast appends on either end.
  ☆37Updated 8 years ago
• duckie / named_types
  A C++14/17 implementation of named tuples
  ☆71Updated 9 months ago
• iodcpp / metamap
  C++17 immutable compile-time key value map
  ☆50Updated 5 years ago
• executors / futures
  A proposal for a futures programming model for ISO C++
  ☆22Updated 6 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• 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 2 months ago
• skarupke / reflection
  ☆31Updated 9 years ago
• skarupke / radix_sort
  ☆12Updated 8 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆60Updated last year
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆77Updated 2 months ago
• HowardHinnant / hash_append
  Implementation of hash_append proposal
  ☆69Updated 8 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• Manu343726 / Polyop
  Overridable universal operator overloading for C++14
  ☆20Updated 10 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• gnzlbg / scattered
  C++ Scattered Containers
  ☆67Updated 7 years ago
• mknejp / vmcontainer
  Virtual memory based containers
  ☆42Updated 3 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• dcdillon / cpuaff
  C++ interface to CPU affinity management
  ☆30Updated 7 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆53Updated 7 years ago
• SephDB / constexpr-format
  Compile-time printf-like string formatting
  ☆77Updated 7 years ago