{"id":27254834,"url":"https://github.com/jgautheron/bloomfilter","last_synced_at":"2026-07-10T11:31:22.755Z","repository":{"id":57612152,"uuid":"124808431","full_name":"jgautheron/bloomfilter","owner":"jgautheron","description":"Standard bloom filter implementation in Go","archived":false,"fork":false,"pushed_at":"2018-03-11T23:42:13.000Z","size":5,"stargazers_count":3,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-10-29T13:52:27.039Z","etag":null,"topics":["algorithm","bloom-filter","go"],"latest_commit_sha":null,"homepage":null,"language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/jgautheron.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}},"created_at":"2018-03-11T23:13:39.000Z","updated_at":"2020-06-08T19:04:47.000Z","dependencies_parsed_at":"2022-08-27T09:50:31.174Z","dependency_job_id":null,"html_url":"https://github.com/jgautheron/bloomfilter","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/jgautheron/bloomfilter","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jgautheron%2Fbloomfilter","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jgautheron%2Fbloomfilter/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jgautheron%2Fbloomfilter/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jgautheron%2Fbloomfilter/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jgautheron","download_url":"https://codeload.github.com/jgautheron/bloomfilter/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jgautheron%2Fbloomfilter/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":35330738,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-07-10T02:00:06.465Z","response_time":60,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["algorithm","bloom-filter","go"],"created_at":"2025-04-11T02:09:03.826Z","updated_at":"2026-07-10T11:31:22.733Z","avatar_url":"https://github.com/jgautheron.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Bloom filter\n[![Exago](https://api.exago.io:443/badge/rank/github.com/jgautheron/bloomfilter)](https://exago.io/project/github.com/jgautheron/bloomfilter)\n[![Exago](https://api.exago.io:443/badge/cov/github.com/jgautheron/bloomfilter)](https://exago.io/project/github.com/jgautheron/bloomfilter)\n[![GoDoc](https://godoc.org/github.com/jgautheron/bloomfilter?status.svg)](https://godoc.org/github.com/jgautheron/bloomfilter)\n\n\n[Standard Bloom filter](https://en.wikipedia.org/wiki/Bloom_filter) implementation in Go. [MurmurHash3](https://en.wikipedia.org/wiki/MurmurHash) is used for hashing.\n\n```go\n// First parameter is the maximum foreseeable size of your dataset.\n// The second is the false positive probability value that is acceptable for you.\n// Based on these two values, optimal values are calculated for the hash count \u0026 bit array size.\nbf := bloomfilter.New(1000, 0.025)\nbf.Add(\"foo\")\nbf.Add(\"bar\")\n\n// \"foo\" has been found!\nif bf.Check(\"foo\") {\n  fmt.Println(\"Found!\")\n}\n```\n\n```\nBenchmarkAdd10000-8     \t10000000\t       147 ns/op\nBenchmarkCheck10000-8   \t10000000\t       152 ns/op\n```\n\n## License\nMIT\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjgautheron%2Fbloomfilter","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjgautheron%2Fbloomfilter","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjgautheron%2Fbloomfilter/lists"}