64 results found Sort:
- Filter by Primary Language:
- Go (13)
- C (11)
- C++ (9)
- Python (8)
- Java (5)
- Rust (5)
- Zig (2)
- C# (2)
- Erlang (2)
- JavaScript (1)
- Perl (1)
- Cython (1)
- Clojure (1)
- Scala (1)
- TypeScript (1)
- Assembly (1)
- +
🔍 Tiny, full-text search engine for static websites built with Rust and Wasm
Created
2018-01-28
378 commits to master branch, last one about a year ago
2021年最新总结 500个常用数据结构，算法，算法导论，面试常用，大厂高级工程师整理总结
Created
2020-06-15
528 commits to master branch, last one 7 months ago
Probabilistic Datatypes Module for Redis
Created
2017-06-22
750 commits to master branch, last one 2 days ago
Probabilistic data structures for processing continuous, unbounded streams.
Created
2015-02-06
152 commits to master branch, last one 3 years ago
Redis for humans. 🌎🌍🌏
Created
2015-06-10
723 commits to master branch, last one 10 days ago
The FASTEST QUALITY hash function, random number generators (PRNG) and hash map.
Created
2019-03-06
992 commits to master branch, last one 6 months ago
Cuckoo Filter implementation in Go, better than Bloom Filters (unmaintained)
Created
2016-07-22
15 commits to master branch, last one 7 years ago
In-memory nucleotide sequence k-mer counting, filtering, graph traversal and more
Created
2012-05-15
6,672 commits to master branch, last one 5 years ago
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Created
2017-01-23
228 commits to master branch, last one about a month ago
Bloom filter for Scala, the fastest for JVM
Created
2016-02-07
247 commits to master branch, last one 4 years ago
:dart: Bloom filters for C++11
Created
2011-05-18
145 commits to master branch, last one 3 years ago
:microscope: Assemble large genomes using short reads
Created
2012-03-19
5,565 commits to master branch, last one 2 months ago
Fast, reliable cuckoo hash table for Node.js.
Created
2018-09-06
24 commits to master branch, last one 3 years ago
Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化
Created
2021-02-19
36 commits to main branch, last one 3 years ago
A simple and small bloom filter implementation in plain C.
Created
2012-06-01
140 commits to master branch, last one 2 years ago
fastfilter: Binary fuse & xor filters for Zig (faster and smaller than bloom filters)
Created
2021-01-31
130 commits to main branch, last one 2 months ago
Interesting (non-cryptographic) hashes implemented in pure Python.
Created
2010-05-09
40 commits to master branch, last one 6 years ago
A fast, simple and lightweight Bloom filter library for Python, implemented in Rust.
Created
2023-01-17
157 commits to main branch, last one 2 months ago
Very fast, high-quality hash function, discrete-incremental and streamed hashing-capable (non-cryptographic, inline C/C++) 26GB/s + PRNG
Created
2021-11-21
131 commits to main branch, last one 6 months ago
A Minimal Perfect Hash Function Library
Created
2016-03-28
209 commits to master branch, last one 3 years ago
C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
Created
2016-11-21
1,275 commits to main branch, last one 5 months ago
Java Client for RedisBloom probabilistic module
Created
2017-08-25
94 commits to master branch, last one about a year ago
Sketching Algorithms for Clojure (bloom filter, min-hash, hyper-loglog, count-min sketch)
Created
2013-06-15
31 commits to master branch, last one about a year ago
May be fastest bloom filter in C++/Go/Java/C#/Python/Rust
Created
2023-04-08
65 commits to main branch, last one a day ago
Rust library implementing xor-filters
Created
2019-12-21
174 commits to master branch, last one 2 years ago
Munt is a witness-secured decentralized network for payments, digital assets, finance and more
Created
2015-08-13
20,650 commits to master branch, last one about a year ago
Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.
Created
2019-12-24
81 commits to master branch, last one 12 months ago
Fast Python Bloom Filter using Mmap
Created
2016-03-16
225 commits to master branch, last one 7 months ago
Analyse a forensic target (such as a directory) to find and report files found and not found from CIRCL hashlookup public service - https://circl.lu/services/hashlookup/
Created
2021-10-03
94 commits to main branch, last one about a year ago
Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.
Created
2022-07-13
48 commits to main branch, last one about a year ago