{"id":13411467,"url":"https://github.com/tannerryan/ring","last_synced_at":"2025-12-14T22:46:27.333Z","repository":{"id":54611905,"uuid":"167767543","full_name":"tannerryan/ring","owner":"tannerryan","description":"Package ring provides a high performance and thread safe Go implementation of a bloom filter.","archived":false,"fork":false,"pushed_at":"2020-09-10T16:36:16.000Z","size":41,"stargazers_count":138,"open_issues_count":1,"forks_count":17,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-12-24T10:02:45.573Z","etag":null,"topics":["go","golang"],"latest_commit_sha":null,"homepage":"https://pkg.go.dev/github.com/tannerryan/ring","language":"Go","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/tannerryan.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":"2019-01-27T04:02:20.000Z","updated_at":"2024-07-09T22:48:31.000Z","dependencies_parsed_at":"2022-08-13T21:31:03.825Z","dependency_job_id":null,"html_url":"https://github.com/tannerryan/ring","commit_stats":null,"previous_names":["thetannerryan/ring"],"tags_count":4,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tannerryan%2Fring","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tannerryan%2Fring/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tannerryan%2Fring/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tannerryan%2Fring/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tannerryan","download_url":"https://codeload.github.com/tannerryan/ring/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243618632,"owners_count":20320268,"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":["go","golang"],"created_at":"2024-07-30T20:01:13.896Z","updated_at":"2025-12-14T22:46:22.315Z","avatar_url":"https://github.com/tannerryan.png","language":"Go","funding_links":[],"categories":["Generators","Uncategorized"],"sub_categories":["Bloom and Cuckoo Filters"],"readme":"# ring - high performance bloom filter\n[![Build\nStatus](https://img.shields.io/travis/tannerryan/ring.svg?style=flat-square)](https://travis-ci.org/tannerryan/ring)\n[![codecov](https://img.shields.io/codecov/c/github/tannerryan/ring.svg?style=flat-square)](https://codecov.io/gh/tannerryan/ring)\n[![Go Report\nCard](https://goreportcard.com/badge/github.com/tannerryan/ring?style=flat-square)](https://goreportcard.com/report/github.com/tannerryan/ring)\n[![PkgGoDev](https://pkg.go.dev/badge/github.com/tannerryan/ring?tab=doc)](https://pkg.go.dev/github.com/tannerryan/ring?tab=doc)\n[![GitHub\nlicense](https://img.shields.io/github/license/tannerryan/ring.svg?style=flat-square)](https://github.com/tannerryan/ring/blob/master/LICENSE)\n[![Mentioned in Awesome\nGo](https://awesome.re/mentioned-badge-flat.svg)](https://github.com/avelino/awesome-go)\n\nPackage ring provides a high performance and thread safe Go implementation of a\nbloom filter.\n\n## Usage\nPlease see the [godoc](https://godoc.org/github.com/tannerryan/ring) for\nusage.\n\n## Accuracy\nRunning `make` will perform unit tests, comparing the target false positive rate\nwith the actual rate. Here is a test against 1 million elements with a targeted\nfalse positive rate of 0.1%. Tests fail if the number of false positives exceeds\nthe target.\n```\n=== RUN   TestBadParameters\n--- PASS: TestBadParameters (0.00s)\n=== RUN   TestReset\n--- PASS: TestReset (0.26s)\n=== RUN   TestData\n--- PASS: TestData (14.07s)\n=== RUN   TestMerge\n--- PASS: TestMerge (13.78s)\n=== RUN   TestMarshal\n--- PASS: TestMarshal (14.48s)\nPASS\n\u003e\u003e Number of elements:  1000000\n\u003e\u003e Target false positive rate:  0.001000\n\u003e\u003e Number of false positives:  99\n\u003e\u003e Actual false positive rate:  0.000099\n\u003e\u003e Number of false negatives:  0\n\u003e\u003e Actual false negative rate:  0.000000\n\u003e\u003e Benchmark Add():  10000000          158 ns/op\n\u003e\u003e Benchmark Test():  10000000         173 ns/op\nok      command-line-arguments  47.914s\n```\n\n## License\nCopyright (c) 2019 Tanner Ryan. All rights reserved. Use of this source code is\ngoverned by a BSD-style license that can be found in the LICENSE file.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftannerryan%2Fring","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftannerryan%2Fring","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftannerryan%2Fring/lists"}