Alternatives and similar repositories for benchmphf

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

• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 5 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 5 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆20Updated 2 months ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆38Updated 3 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• bonitao / cmph
  ☆20Updated 4 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 6 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 3 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆270Updated 5 months ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆34Updated 11 months ago
• justinasvd / art_map
  std::map/std::set implementation using the adaptive radix tree
  ☆15Updated 4 years ago
• tlk00 / BitMagic
  BitMagic Library
  ☆437Updated 3 months ago
• ekg / intervaltree
  a minimal C++ interval tree implementation
  ☆237Updated 4 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆34Updated 2 years ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆164Updated 11 months ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆31Updated 6 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last week
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆131Updated 2 years ago
• adrian17 / cpp-drop-merge-sort
  C++ reimplementation of https://github.com/emilk/drop-merge-sort
  ☆21Updated 4 years ago
• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆22Updated 3 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• ekg / mmmulti
  memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort
  ☆26Updated 4 years ago
• MatteoCeregini / quad-wavelet-tree
  ☆11Updated 2 years ago
• tommyettinger / waterhash
  Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math
  ☆26Updated 6 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆184Updated last month
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆28Updated 10 months ago
• bingmann / malloc_count
  Method to measure the amount of allocated memory of a program at run-time.
  ☆70Updated 3 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 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…
  ☆73Updated last year