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
  ☆49Updated 2 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 6 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆41Updated last year
• DolevAdas / Jiffy
  ☆45Updated 5 years ago
• martinus / svector
  Compact SVO optimized vector for C++17 or higher
  ☆112Updated last year
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆316Updated 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…
  ☆117Updated last year
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆56Updated 3 years ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆87Updated 2 years ago
• Jiwan / dense_hash_map
  A simple replacement for std::unordered_map
  ☆51Updated last year
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆249Updated last month
• 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…
  ☆43Updated 4 months ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 4 months ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆84Updated 10 months ago
• fix8mt / fiber
  C++20 fiber implementation with similar interface to std::thread, header-only / x86_64 / Linux only / stackful / built-in scheduler / thr…
  ☆30Updated last year
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆71Updated 2 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆69Updated 4 years ago
• cmuparlay / concurrent_deferred_rc
  Concurrent Deferred Reference Counting
  ☆173Updated last year
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆120Updated 5 years ago
• simd-sorting / fast-and-robust
  ☆32Updated 4 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!
  ☆130Updated 2 years ago
• mpaland / avl_array
  High performance templated AVL tree using a fixed size array. Extensive test suite passing.
  ☆51Updated 4 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• lemire / counters
  performance counters in C++
  ☆23Updated last week
• markisus / vapid-soa
  A header only structure of arrays container for C++
  ☆43Updated 2 years 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…
  ☆75Updated last year
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆184Updated 2 months ago
• skarupke / two_bit_mutex
  Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer
  ☆26Updated 3 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆70Updated 2 years ago