Alternatives and similar repositories for clhash

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

• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆311Updated 4 years ago
• fast-pack / simdcomp
  A simple C library for compressing lists of integers using binary packing
  ☆505Updated 2 years ago
• vnmakarov / mum-hash
  Hashing functions and PRNGs based on them
  ☆162Updated 7 months ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• fast-pack / streamvbyte
  Fast integer compression in C using the StreamVByte codec
  ☆407Updated 6 months ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆121Updated 3 years ago
• lemire / fastmod
  A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.
  ☆324Updated 9 months ago
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆135Updated 6 years ago
• lemire / fastvalidate-utf-8
  header-only library to validate utf-8 strings at high speeds (using SIMD instructions)
  ☆304Updated last year
• kuszmaul / SuperMalloc
  A Super Fast Multithreaded malloc() for 64-bit Machines
  ☆292Updated 5 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆266Updated last month
• appnexus / acf
  An-source C library developed and used at AppNexus.
  ☆111Updated 5 years ago
• FastFilter / xor_singleheader
  Header-only binary fuse and xor filter library
  ☆409Updated this week
• powturbo / Turbo-Run-Length-Encoding
  TurboRLE-Fastest Run Length Encoding
  ☆287Updated 2 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆138Updated 7 months ago
• cksystemsgroup / scalloc
  A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator
  ☆163Updated 2 months ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆61Updated 4 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• ned14 / nedtries
  A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…
  ☆275Updated 3 years ago
• WojciechMula / sse4-strstr
  SIMD (SWAR/SSE/SSE4/AVX2/AVX512F/ARM Neon) of Karp-Rabin algorithm's modification
  ☆261Updated 3 years ago
• lemire / EWAHBoolArray
  A compressed bitmap class in C++.
  ☆454Updated 10 months ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 4 years ago
• gpakosz / PackedArray
  Random access array of tightly packed unsigned integers
  ☆167Updated 3 years ago
• powturbo / Turbo-Histogram
  Fastest Histogram Construction
  ☆70Updated 3 years ago
• lemire / cbitset
  A simple bitset library in C
  ☆135Updated 6 months ago
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆437Updated last month
• WojciechMula / base64-avx512
  Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"
  ☆204Updated 5 years ago
• erthink / t1ha
  One of the fastest hash functions.
  ☆359Updated 6 months ago
• rurban / Perfect-Hash
  generate perfect hashes (alpha)
  ☆77Updated 3 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆124Updated last year