{"id":24433333,"url":"https://github.com/younisshah/blooming-bella","last_synced_at":"2026-07-22T08:31:10.059Z","repository":{"id":89644797,"uuid":"75003117","full_name":"younisshah/blooming-bella","owner":"younisshah","description":"A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms.","archived":false,"fork":false,"pushed_at":"2017-05-03T14:42:23.000Z","size":6,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-10-25T11:18:53.728Z","etag":null,"topics":["bloom-filter","hash-functions","membership"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/younisshah.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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,"zenodo":null}},"created_at":"2016-11-28T18:39:43.000Z","updated_at":"2017-06-24T15:15:20.000Z","dependencies_parsed_at":null,"dependency_job_id":"c7f5beb0-8d99-4700-8ba7-2475dfc460c6","html_url":"https://github.com/younisshah/blooming-bella","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/younisshah/blooming-bella","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/younisshah%2Fblooming-bella","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/younisshah%2Fblooming-bella/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/younisshah%2Fblooming-bella/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/younisshah%2Fblooming-bella/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/younisshah","download_url":"https://codeload.github.com/younisshah/blooming-bella/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/younisshah%2Fblooming-bella/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":35755760,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-07-20T02:08:10.276Z","status":"online","status_checked_at":"2026-07-22T02:00:06.236Z","response_time":124,"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":["bloom-filter","hash-functions","membership"],"created_at":"2025-01-20T16:35:00.133Z","updated_at":"2026-07-22T08:31:10.054Z","avatar_url":"https://github.com/younisshah.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"###blooming-belle - A simple implementation of Bloom Filters \n\n### What?\n Bloom filter is a space efficient, probabilistic data structure, designed to test the membership of elements to a set.\n \n### Trade-offs? \n Being a space efficient data structure is it may return false positives, but always returns definite negatives.\n \n### Applications?\n Testing for non-membership saves resources such as calls to a web server, checking a proxy cache. Google Chrome uses bloom filters as a check for malicious URLs.\n \n### blooming-bella\n\n \u003e A bloom filter for integers.\n \u003e Uses __mummur3__,__Super Fast Hash__ and __marvin32__ hashing algorithms\n\n### Example\n\n```go\n bella, err := blooming_bella.NewBella(1000, 0.01)\n\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tbella.Add(10)\n\tbella.Add(121)\n\tbella.Add(13)\n\tbella.Add(111)\n\n\tfmt.Println(bella.Test(10)) // =\u003e true\n\tfmt.Println(bella.Test(104)) // =\u003e false\n\tfmt.Println(bella.Test(110)) // =\u003e false\n\tfmt.Println(bella.Test(13)) // =\u003e true\n ```\n \n### New \n\nAdded __Super Fast Hashing__ algorithm\n\n### TODO\n - [ ]  Calculate \"ideal\" number of hash functions to use.\n - [ ]  Dynamically \"generate\" the hash functions. *_What does it mean to be alive?_*\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyounisshah%2Fblooming-bella","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fyounisshah%2Fblooming-bella","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyounisshah%2Fblooming-bella/lists"}