{"id":13632754,"url":"https://github.com/jedisct1/rust-bloom-filter","last_synced_at":"2025-04-13T01:55:45.097Z","repository":{"id":10835097,"uuid":"13113686","full_name":"jedisct1/rust-bloom-filter","owner":"jedisct1","description":"A fast Bloom filter implementation in Rust","archived":false,"fork":false,"pushed_at":"2025-04-07T04:36:41.000Z","size":229,"stargazers_count":253,"open_issues_count":1,"forks_count":53,"subscribers_count":6,"default_branch":"master","last_synced_at":"2025-04-13T01:55:29.179Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"bsd-2-clause","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/jedisct1.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2013-09-26T05:25:12.000Z","updated_at":"2025-04-11T08:37:11.000Z","dependencies_parsed_at":"2024-01-14T07:14:05.188Z","dependency_job_id":"ad9f48c8-4617-4f5a-8318-487f7f620e6f","html_url":"https://github.com/jedisct1/rust-bloom-filter","commit_stats":{"total_commits":144,"total_committers":17,"mean_commits":8.470588235294118,"dds":"0.19444444444444442","last_synced_commit":"12dc47ae033d611f4203950d9a1a4dc3bce693fe"},"previous_names":[],"tags_count":27,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jedisct1%2Frust-bloom-filter","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jedisct1%2Frust-bloom-filter/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jedisct1%2Frust-bloom-filter/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jedisct1%2Frust-bloom-filter/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jedisct1","download_url":"https://codeload.github.com/jedisct1/rust-bloom-filter/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248654050,"owners_count":21140235,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-08-01T22:03:14.538Z","updated_at":"2025-04-13T01:55:45.035Z","avatar_url":"https://github.com/jedisct1.png","language":"Rust","funding_links":[],"categories":["Rust"],"sub_categories":[],"readme":"# bloomfilter \u003cimg src=\"img/logo.png\" align=\"right\" width=\"150\" /\u003e\n\n[![Crates.io](https://img.shields.io/crates/v/bloomfilter.svg)](https://crates.io/crates/bloomfilter)\n[![docs.rs](https://docs.rs/bloomfilter/badge.svg)](https://docs.rs/bloomfilter)\n[![License: ISC](https://img.shields.io/badge/License-ISC-blue.svg)](https://github.com/jedisct1/rust-bloom-filter/blob/master/LICENSE)\n\u003ca href=\"https://codecov.io/gh/jedisct1/rust-bloom-filter\"\u003e\n    \u003cimg src=\"https://codecov.io/gh/jedisct1/rust-bloom-filter/branch/main/graph/badge.svg\"\u003e\n\u003c/a\u003e\n\nA simple but fast implementation of the Bloom filter in Rust. The Bloom filter is a a space-efficient probabilistic data structure supporting dynamic set membership queries with false positives. It was introduced by Burton H. Bloom in 1970 [(Bloom, 1970)](https://dl.acm.org/doi/10.1145/362686.362692) and have since been increasingly used in computing applications and bioinformatics.\n\n### Documentation\n\nLibrary documentation is available on [docs.rs](https://docs.rs/bloomfilter).\n\n### Usage\n\nAdd this to your `Cargo.toml`:\n\n```toml\n[dependencies]\nbloomfilter = \"3\"\n```\n\nHere is a simple example for creating a bloom filter with a false positive rate of 0.001 and query for presence of some numbers.\n\n```rust\nuse bloomfilter::Bloom;\n\nlet num_items = 100000;\nlet fp_rate = 0.001;\n\nlet mut bloom = Bloom::new_for_fp_rate(num_items, fp_rate).unwrap();\nbloom.set(\u002610);   // insert 10 in the bloom filter\nbloom.check(\u002610); // return true\nbloom.check(\u002620); // return false\n```\n\n### License\nThis project is licensed under the ISC license ([LICENSE](https://github.com/jedisct1/rust-bloom-filter/blob/master/LICENSE) or https://opensource.org/licenses/ISC).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjedisct1%2Frust-bloom-filter","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjedisct1%2Frust-bloom-filter","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjedisct1%2Frust-bloom-filter/lists"}