2021年最新总结 500个常用数据结构,算法,算法导论,面试常用,大厂高级工程师整理总结
-
Updated
May 20, 2024 - C
2021年最新总结 500个常用数据结构,算法,算法导论,面试常用,大厂高级工程师整理总结
In-memory nucleotide sequence k-mer counting, filtering, graph traversal and more
Probabilistic Datatypes Module for Redis
Probabilistic data structures for processing continuous, unbounded streams.
🔬 Assemble large genomes using short reads
🔍 Tiny, full-text search engine for static websites built with Rust and Wasm
C++ Bloom Filter Library https://www.partow.net/programming/bloomfilter/index.html
The FASTEST QUALITY hash function, random number generators (PRNG) and hash map.
LUA Redis scripts for a scaling bloom filter
Bloom filter for Scala, the fastest for JVM
Redis for humans. 🌎🌍🌏
Data-Structures using C++.
Munt is a witness-secured decentralized network for payments, digital assets, finance and more
Interesting (non-cryptographic) hashes implemented in pure Python.
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Cuckoo Filter implementation in Go, better than Bloom Filters (unmaintained)
Java Client for RedisBloom probabilistic module
Study group for algorithms in Ruby, hosted at App Academy
Add a description, image, and links to the bloom-filter topic page so that developers can more easily learn about it.
To associate your repository with the bloom-filter topic, visit your repo's landing page and select "manage topics."