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 2 months ago
• backtrace-labs / stuffed-record-stream
  Backtrace.io's resilient log record framing format
  ☆37Updated 3 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 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.
  ☆195Updated 7 months ago
• BenJoyenConseil / rmi
  A learned index structure
  ☆52Updated 4 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆29Updated last year
• kyotov / kysync
  ☆80Updated 3 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 6 years ago
• gueststar / nthm
  Non-preemptive Thread Hierarchy Manager
  ☆55Updated 4 months ago
• KWillets / range_generator
  Some variations on Lemire's Fast Random Integer Generation in an Interval
  ☆15Updated 5 years ago
• hashlookup / fleur
  Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.
  ☆118Updated 2 years ago
• juliusgeo / branchless_bisect
  Beating the `bisect` module's implementation using C-extensions.
  ☆30Updated last year
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 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(…
  ☆49Updated 10 months ago
• TCGV / ConsensusKit
  Implementation of popular consensus protocols
  ☆21Updated 4 years ago
• afiodorov / radixmmap
  Mmap radix sort file by a fixed length prefix of each line
  ☆52Updated 4 years ago
• Keith-Cancel / k-hash
  A simple single header 64 and 32 bit hash function using only add, sub, ror, and xor.
  ☆78Updated 3 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆156Updated last month
• geofflangdale / smh
  Shuffle-based predicate matcher and all-round branch free swiss army chainsaw
  ☆17Updated 6 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆116Updated 8 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• rgov / sqlite_protobuf
  A SQLite extension for extracting values from serialized Protobuf messages
  ☆87Updated last week
• WojciechMula / base64-avx512
  Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"
  ☆203Updated 5 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 last month
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆59Updated 3 years ago
• clausecker / pospopcnt
  AVX-2 vectorised 8-bit positional popcount for Go
  ☆23Updated 4 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• axiomhq / zig-hyperloglog
  Zig library for HyperLogLog estimation
  ☆89Updated 7 months ago