pdatastructs
| Crates.io | pdatastructs |
| lib.rs | pdatastructs |
| version | 0.7.0 |
| source | src |
| created_at | 2017-10-07 18:25:40.444056 |
| updated_at | 2022-06-13 12:43:34.24232 |
| description | Simple probabilistic data structures |
| homepage | |
| repository | https://github.com/crepererum/pdatastructs.rs |
| max_upload_size | |
| id | 34753 |
| size | 365,589 |
Marco Neumann (crepererum)
documentation
https://docs.rs/pdatastructs/
README
pdatastructs
A collection of data structures that are based probability theory and therefore only provide the correct answer if a certain probability. In exchange they have a better runtime and memory complexity compared to traditional data structures.
The following data structures are implemented:
- CountMinSketch
- Filters:
- BloomFilter
- CuckooFilter
- QuotientFilter
- HyperLogLog
- ReservoirSampling
- T-Digest
- Top-K:
- CMSHeap
- LossyCounter
License
Licensed under either of these:
- Apache License, Version 2.0 (LICENSE-APACHE or https://www.apache.org/licenses/LICENSE-2.0)
- MIT License (LICENSE-MIT or https://opensource.org/licenses/MIT)
Contributing
Unless you explicitly state otherwise, any contribution you intentionally submit for inclusion in the work, as defined in the Apache-2.0 license, shall be dual-licensed as above, without any additional terms or conditions.