Alternatives and similar repositories for fasthashing

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

• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆30Updated 3 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated 2 years ago
• WojciechMula / base64simd
  Base64 coding and decoding with SIMD instructions (SSE/AVX2/AVX512F/AVX512BW/AVX512VBMI/ARM Neon)
  ☆170Updated 11 months ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆127Updated 2 months ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆51Updated 7 years ago
• phaistos-networks / ConsistentHashing
  Consistent Hashing data structures and algorithms for C++
  ☆40Updated 9 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 6 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• yandex / mms
  Memory-mapped storage library
  ☆76Updated 9 years ago
• fast-pack / LittleIntPacker
  C library to pack and unpack short arrays of integers as fast as possible
  ☆92Updated 2 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆52Updated 11 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆58Updated 3 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• rescrv / e
  Library containing high-performance datastructures and utilities for C++
  ☆76Updated 8 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• baruch / libwire
  User space threading (aka coroutines) library for C resembling GoLang and goroutines
  ☆166Updated 7 years ago
• mulle-concurrent / mulle-concurrent
  📶 A lock- and wait-free hashtable (and an array too)
  ☆109Updated 2 weeks ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆281Updated last year
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆68Updated 2 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆144Updated 6 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆139Updated last year
• yandex / handystats
  C++ library for collecting user-defined in-process runtime statistics with low overhead
  ☆98Updated 6 years ago
• duckie / boson
  A C++14 framework for asynchronous I/O, cooperative multitasking and green threads scheduling
  ☆160Updated 8 years ago
• Begun / lockfree-malloc
  The world's first Web-scale memory allocator
  ☆110Updated 7 years ago
• google / berrydb
  ☆66Updated 5 years ago
• philipbecker / cpp-art
  STL-compliant map and set container based on a C++11 Adaptive Radix Tree implementation.
  ☆11Updated 9 years ago