🔍 Tiny, full-text search engine for static websites built with Rust and Wasm
Repository Index
47,133 repositories indexed
1–10 of 10 · Most stars
Probabilistic data structures for processing continuous, unbounded streams.
In-memory nucleotide sequence k-mer counting, filtering, graph traversal and more
Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化
Very fast, high-quality hash function, discrete-incremental and streamed hashing-capable (non-cryptographic, header-only C/C++) 27GB/s + PRNG
Verified hash-based AMQ structures in Coq
Probabilistic set data structure
fast, extensible, versatile event router for Suricata's EVE-JSON format
Erlang nif for xor_filter. 'Faster and Smaller Than Bloom and Cuckoo Filters'.
ribbon filter in golang(Go), practically smaller than Bloom and Xor