sbf
| Crates.io | sbf |
| lib.rs | sbf |
| version | 0.1.6 |
| created_at | 2019-10-01 07:44:59.237805+00 |
| updated_at | 2021-12-10 11:08:04.463434+00 |
| description | Spatial Bloom Filter, a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space. |
| homepage | https://github.com/bertof/sbf-rs |
| repository | https://gitlab.com/bertof/sbf-rs |
| max_upload_size | |
| id | 169028 |
| size | 38,237 |
Filippo Berto (bertof)
documentation
https://docs.rs/sbf
README
Spatial Bloom Filter
SBF is a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space.
This is a reimplementation of the C library by the original research group.
This repository is mirrored in GitLab and Github
Crate features
This crate allows the following features:
md4_hashAllows to use a md4 based hashing algorithm;md5_hashAllows to use a md5 based hashing algorithm;serialEnablesserdeintegration;metricsGenerates and updates an internal metrics object, useful in simulations and benchmarks of the library.
By default only md5_hash is enabled.