Alternatives and similar repositories for parlayhash

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

• renzibei / fph-table
  Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
  ☆47Updated 2 years ago
• DolevAdas / Jiffy
  ☆44Updated 4 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆315Updated 2 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…
  ☆116Updated 9 months ago
• tugrul512bit / LruClockCache
  A low-latency LRU approximation cache in C++ using CLOCK second-chance algorithm. Multi level cache too. Up to 2.5 billion lookups per se…
  ☆73Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆286Updated last month
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆85Updated 2 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆46Updated 5 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• martinus / svector
  Compact SVO optimized vector for C++17 or higher
  ☆109Updated last year
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆242Updated last week
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆69Updated 4 years ago
• dian-lun-lin / taro
  Task graph-based asynchronous programming system using C++ coroutine
  ☆94Updated last year
• taskflow / work-stealing-queue
  A fast work-stealing queue template in C++
  ☆321Updated last year
• rigtorp / HashMap
  An open addressing linear probing hash table, tuned for delete heavy workloads
  ☆210Updated 2 years ago
• greg7mdp / gtl
  Greg's Template Library of useful classes.
  ☆225Updated this week
• tinloaf / ygg
  An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
  ☆129Updated 2 years ago
• markisus / vapid-soa
  A header only structure of arrays container for C++
  ☆41Updated 2 years ago
• jeffplaisance / BppTree
  B++ Tree
  ☆70Updated last year
• rezabrizi / AtomicRing
  Very fast lock-free queue (thread safe)
  ☆171Updated 3 months ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆34Updated 7 years ago
• gaujay / indivi_collection
  A collection of std-like containers written in C++11. Features fast unordered flat map/set, configurable double-ended vector and sparse d…
  ☆42Updated 2 months ago
• Jiwan / dense_hash_map
  A simple replacement for std::unordered_map
  ☆50Updated last year
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆38Updated last year
• cmuparlay / parlaylib
  A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
  ☆387Updated last month
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆125Updated 2 years ago
• jmuehlig / perf-cpp
  Lightweight recording and sampling of performance counters for specific code segments directly from your C++ application.
  ☆146Updated last week
• fix8mt / fiber
  C++20 fiber implementation with similar interface to std::thread, header-only / x86_64 / Linux only / stackful / built-in scheduler / thr…
  ☆29Updated last year
• fraillt / cpp_serializers_benchmark
  C++ serializers benchmark with realistic data
  ☆126Updated 2 years ago