Rerito / Penjing

Related projects ⓘ

Alternatives and complementary repositories for Penjing

• bloomberg / p1160
  P1160 Add Test Polymorphic Memory Resource To Standard Library
  ☆39Updated last month
• greg7mdp / gtl
  Greg's Template Library of useful classes.
  ☆123Updated 2 weeks 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…
  ☆107Updated 8 months ago
• Kronuz / constexpr-phf
  Computes a constexpr (minimal) perfect hash function
  ☆35Updated 5 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆176Updated 2 months ago
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆300Updated last year
• google / hashtable-benchmarks
  ☆104Updated 9 months ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆120Updated last year
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆30Updated 8 months ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆90Updated last year
• lakshayg / google_benchmark_plot
  A handy script to visualize google benchmark output
  ☆54Updated last year
• weissan / BlockQuicksort
  ☆34Updated 2 years ago
• david-grs / papipp
  c++ wrapper around libpapi
  ☆49Updated 6 years ago
• boostorg / sort
  Boost.Sort
  ☆51Updated last week
• iboB / picobench
  A micro microbenchmarking library for C++11 in a single header file
  ☆212Updated 8 months ago
• ogiroux / atomic_wait
  Sample implementation of C++20 atomic_wait/notify
  ☆57Updated 5 years ago
• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆20Updated 2 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆57Updated 2 years ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆60Updated last year
• david-grs / geiger
  C++ micro benchmark library
  ☆88Updated 7 years ago
• mpark / wg21
  Framework for Writing C++ Committee Papers
  ☆125Updated 7 months ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆30Updated 7 years ago
• FelixPetriconi / AllocatorBuilder
  Policy Based C++ Allocator Library
  ☆123Updated 7 years ago
• executors / executors-impl
  A prototype implementation of the executors proposal
  ☆84Updated 5 years ago
• david-grs / static_any
  generic stack-based container
  ☆105Updated 6 years ago
• Quuxplusone / from-scratch
  C++ standard library features, "from scratch"
  ☆180Updated 4 years ago
• rigtorp / HashMap
  An open addressing linear probing hash table, tuned for delete heavy workloads
  ☆200Updated last year
• ClaasBontus / bitset2
  std::bitset with constexpr implementations plus additional features.
  ☆117Updated last year
• 5cript / interval-tree
  A C++ header only interval tree implementation.
  ☆61Updated last month