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
• martinus / svector
  Compact SVO optimized vector for C++17 or higher
  ☆108Updated last year
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆314Updated 2 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!
  ☆129Updated 2 years ago
• bkille / BitLib
  Provides a bit-vector, an optimized replacement of the infamous std::vector<ool>. In addition to the bit-vector, the library also pro…
  ☆74Updated last year
• 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…
  ☆72Updated last year
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆183Updated last year
• Thermadiag / seq
  The seq library is a collection of original C++17 STL-like containers and related tools
  ☆99Updated 3 weeks ago
• DolevAdas / Jiffy
  ☆44Updated 4 years ago
• Donald-Rupin / zab
  C++20 liburing backed coroutine executor and event loop framework.
  ☆66Updated 3 years ago
• tirimatangi / MultiArena
  Polymorphic memory resource for real-time applications.
  ☆73Updated 2 years ago
• greg7mdp / gtl
  Greg's Template Library of useful classes.
  ☆223Updated last month
• ericniebler / ustdex
  a small lightweight std::execution work-alike
  ☆65Updated 6 months ago
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• boostorg / unordered
  Boost.org unordered module
  ☆80Updated last week
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆69Updated 4 years ago
• Jiwan / dense_hash_map
  A simple replacement for std::unordered_map
  ☆50Updated last year
• markisus / vapid-soa
  A header only structure of arrays container for C++
  ☆41Updated 2 years ago
• marzer / soagen
  Struct-of-Arrays generator for C++ projects.
  ☆59Updated last year
• rigtorp / HashMap
  An open addressing linear probing hash table, tuned for delete heavy workloads
  ☆210Updated 2 years ago
• jeffplaisance / BppTree
  B++ Tree
  ☆69Updated last year
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆37Updated last year
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆112Updated 9 months ago
• ConorWilliams / Threadpool
  Light, fast, threadpool for C++20
  ☆104Updated 2 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆46Updated 5 years ago
• rollbear / prio_queue
  C++14 cache friendly B-heap priority queue
  ☆106Updated 2 weeks ago
• fraillt / cpp_serializers_benchmark
  C++ serializers benchmark with realistic data
  ☆125Updated 2 years ago
• ConorWilliams / ConcurrentDeque
  Fast, generalized, implementation of the Chase-Lev lock-free work-stealing deque for C++17
  ☆151Updated 4 years ago
• Tessil / sparse-map
  C++ implementation of a memory efficient hash map and hash set
  ☆362Updated 2 weeks 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 last month