{"id":41756197,"url":"https://github.com/liangyaopei/bloom","last_synced_at":"2026-01-25T01:37:02.287Z","repository":{"id":52114379,"uuid":"283118756","full_name":"liangyaopei/bloom","owner":"liangyaopei","description":"High performance bloom filter in golang","archived":false,"fork":false,"pushed_at":"2020-07-31T10:56:15.000Z","size":7,"stargazers_count":20,"open_issues_count":1,"forks_count":7,"subscribers_count":0,"default_branch":"master","last_synced_at":"2024-06-19T04:08:28.345Z","etag":null,"topics":["algorithms","bloom-filter","golang"],"latest_commit_sha":null,"homepage":"","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/liangyaopei.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":"2020-07-28T06:15:05.000Z","updated_at":"2024-06-02T07:26:26.000Z","dependencies_parsed_at":"2022-09-26T18:31:46.911Z","dependency_job_id":null,"html_url":"https://github.com/liangyaopei/bloom","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/liangyaopei/bloom","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/liangyaopei%2Fbloom","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/liangyaopei%2Fbloom/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/liangyaopei%2Fbloom/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/liangyaopei%2Fbloom/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/liangyaopei","download_url":"https://codeload.github.com/liangyaopei/bloom/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/liangyaopei%2Fbloom/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28740978,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-25T01:25:41.653Z","status":"ssl_error","status_checked_at":"2026-01-25T01:25:34.364Z","response_time":89,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["algorithms","bloom-filter","golang"],"created_at":"2026-01-25T01:37:02.181Z","updated_at":"2026-01-25T01:37:02.267Z","avatar_url":"https://github.com/liangyaopei.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"[![Go Report Card](https://goreportcard.com/badge/github.com/liangyaopei/bloom)](https://goreportcard.com/report/github.com/liangyaopei/bloom)\n[![GoDoc](https://godoc.org/github.com/liangyaopei/bloom?status.svg)](http://godoc.org/github.com/liangyaopei/bloom)\n# High-performance and user-friendly bloom filter in Golang\nThis library provides bloom filter which has high performance and is concurrent safe. \n\n## Install\n```\ngo get -u github.com/liangyaopei/bloom\n```\n\n## Usage\nUsers only need to specify the parameter of `m`,`k`,`race` and then can use it.\nExample.\n```go\n    filter := bloom.New(1024, 3, false)\n\t// chaining operation\n\tfilter.Add([]byte(\"Hello\")).\n\t\tAddString(\"World\").\n\t\tAddUInt16(uint16(16)).\n\t\tAddUInt32(uint32(32)).\n\t\tAddUInt64(uint64(64)).\n\t\tAddUint16Batch([]uint16{1, 2, 3})\n\n\tt.Logf(\"Hello exist:%t\", filter.Test([]byte(\"Hello\")))\n\tt.Logf(\"World exist:%t\", filter.TestString(\"World\"))\n\tt.Logf(\"uint 16 exist:%t\", filter.TestUInt16(uint16(16)))\n\tt.Logf(\"uint 32 exist:%t\", filter.TestUInt32(uint32(32)))\n\tt.Logf(\"uint 64 exist:%t\", filter.TestUInt64(uint64(64)))\n```\n\n## Performance: high performance with low false positive rate\nIn `_bloom_test`, the `TestFalsePositive` function demonstrates that after inserting 1 million random string key, whose string length is 30 each, this library has \na false positive ratio of 2.82%(0.028200).\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fliangyaopei%2Fbloom","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fliangyaopei%2Fbloom","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fliangyaopei%2Fbloom/lists"}