Alternatives and similar repositories for wyHLL:

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

• fanf2 / hg64
  a 64-bit histogram / quantile sketch
  ☆58Updated 3 months ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 6 years ago
• gueststar / nthm
  Non-preemptive Thread Hierarchy Manager
  ☆55Updated 5 months ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• backtrace-labs / stuffed-record-stream
  Backtrace.io's resilient log record framing format
  ☆38Updated 3 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆29Updated last year
• hashlookup / fleur
  Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.
  ☆117Updated 2 years ago
• KWillets / range_generator
  Some variations on Lemire's Fast Random Integer Generation in an Interval
  ☆15Updated 5 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• afiodorov / radixmmap
  Mmap radix sort file by a fixed length prefix of each line
  ☆52Updated 4 years ago
• TCGV / ConsensusKit
  Implementation of popular consensus protocols
  ☆21Updated 4 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• scandum / wolfsort
  Wolfsort is a stable adaptive hybrid radix / merge sort.
  ☆196Updated 8 months ago
• kyotov / kysync
  ☆80Updated 3 years ago
• geofflangdale / smh
  Shuffle-based predicate matcher and all-round branch free swiss army chainsaw
  ☆17Updated 6 years ago
• clasp-developers / ctak
  A small test for multithreaded C++ stack unwinding on unixes
  ☆16Updated 5 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆116Updated 8 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 5 years ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• fwessels / simdcsv
  ☆36Updated 4 years ago
• pschanely / scoredb
  A simple database optimized for returning results by custom scoring functions.
  ☆20Updated 9 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• BenJoyenConseil / rmi
  A learned index structure
  ☆53Updated 4 years ago
• dosyago / beamsplitter
  Beamsplitter - A new (possibly universal) hash that passes SMHasher. Built mainly with a random 10x64 S-box. Also in NodeJS
  ☆91Updated 2 months ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆155Updated 2 months ago
• apankrat / notes
  Assorted notes
  ☆84Updated last year
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago