jedisct1 / rust-count-min-sketchLinks
Count Min Sketch implementation for Rust
☆13Updated 2 months ago
Alternatives and similar repositories for rust-count-min-sketch
Users that are interested in rust-count-min-sketch are comparing it to the libraries listed below
Sorting:
- A Rust implementation of the Strobe protocol framework☆27Updated 3 months ago
- A HyperLogLog implementation in Rust.☆50Updated 3 months ago
- Rust implementation `libsodium/utils`.☆50Updated 4 months ago
- Security-oriented protobuf-like serialization format with "Merkleized" content hashing support☆118Updated 2 years ago
- Set theory applied on sorted and deduplicated slices.☆45Updated 2 years ago
- Wraps around a futures::Spawn and adds diagnostics to it☆32Updated 5 years ago
- An implementation of the `group_by` Haskell function for slice and strings☆54Updated 2 years ago
- super simple in-memory blocking LSM for constant-size keys and values☆71Updated 3 months ago
- high-efficiency concurrent reclamation☆35Updated 9 months ago
- Concurrent hash trie☆54Updated 4 years ago
- Performance crypto in pure Rust☆55Updated 3 months ago
- Byzantine-fault-tolerant time synchronization☆40Updated 4 years ago
- Rust implementation of the LZJD algorithm (https://github.com/EdwardRaff/jLZJD)☆17Updated last year
- ☆47Updated 4 years ago
- Collection of universal hashing functions☆30Updated last week
- A safe and reliable process manager☆43Updated 5 years ago
- FST (Fast Succinct Trie) implementation in Rust☆26Updated 6 years ago
- An eventually consistent LRU designed for lock-free concurrent reads☆22Updated 2 years ago
- RSA blind signatures in Rust☆29Updated 3 months ago
- Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.☆139Updated last year
- A growable bit-vector for Rust, optimized for size☆41Updated 4 months ago
- ☆33Updated 2 years ago
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 4 years ago
- model testing sugar for testing interactions on structures over time☆27Updated 5 years ago
- This custom Rust allocator logs all memory actions for further analysis☆54Updated 4 years ago
- A fast implementation of single-pattern substring search using SIMD acceleration.☆96Updated 8 months ago
- A futures abstraction that runs a set of futures which may complete in any order.☆90Updated 2 months ago
- adaptive algorithms for rayon☆39Updated 5 years ago
- impl fallible collections in rust, quite as describe in RFC 2116☆37Updated 7 months ago
- Nudging the compiler to auto-vectorize things☆75Updated last year