Alternatives and similar repositories for hashtables

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

• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆32Updated last year
• backtrace-labs / dynamic_flag
  A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case
  ☆73Updated 2 years ago
• billziss-gh / imap
  Integer Map Data Structure
  ☆131Updated 2 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• oschonrock / binfuse
  c++ library for binary fuse filters, including a sharded filter
  ☆89Updated 5 months ago
• backtrace-labs / poireau
  Poireau: a sampling allocation debugger
  ☆99Updated 3 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• abolz / Drachennest
  Different algorithms for converting binary to decimal floating-point numbers
  ☆121Updated 2 years ago
• lemire / batched_random
  Batched random number generation
  ☆18Updated 2 months ago
• skarupke / branchless_binary_search
  A fast binary search that tries to be branchless
  ☆101Updated last year
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• mars-research / DRAMHiT
  ☆29Updated this week
• Keith-Cancel / k-hashv
  A vectorized single header hash function.
  ☆19Updated 8 months ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆67Updated last year
• danielcota / biski64
  A very fast and robust 64-bit PRNG with a minimum 2^64 period.
  ☆148Updated last month
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆97Updated 5 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆156Updated 6 months ago
• viega / hatrack
  Fast, multi-reader, multi-writer, lockless data structures for parallel programming
  ☆87Updated last year
• scandum / rotate
  A collection of array rotation algorithms.
  ☆155Updated 2 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• SEED-EA / O1ShufflingGrouping
  The code to accompany "Constant Time Stateless Shuffling and Grouping"
  ☆46Updated last year
• markwaterman / MutexShootout
  A benchmark to measure lock overhead and compare mutex performance under varying levels of contention.
  ☆38Updated last year
• splatlab / iceberghashtable
  ☆61Updated 8 months ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 4 years ago
• JustKshitijD / Harmonia_for_B_plus_trees
  Harmonia is an algorithm that allows for the implementation of operations on B+ trees using parallelization. As a part of my GPU project,…
  ☆30Updated 3 years ago
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆110Updated 11 months ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 6 years ago
• richgel999 / sserangecoding
  Fast vectorized (SSE 4.1) range coder for 8-bit alphabets
  ☆25Updated 2 years ago
• jart / morton
  ☆295Updated last year