https://github.com/namannimmo10/bloom-filter

A Bloom filter implementation in Go
https://github.com/namannimmo10/bloom-filter

bloom-filter go golang probablistic-data-structures

Last synced: about 2 months ago
JSON representation

A Bloom filter implementation in Go

• Host: GitHub
• URL: https://github.com/namannimmo10/bloom-filter
• Owner: namannimmo10
• Created: 2021-04-02T05:52:47.000Z (almost 4 years ago)
• Default Branch: main
• Last Pushed: 2021-04-02T05:57:49.000Z (almost 4 years ago)
• Last Synced: 2024-04-16T01:32:35.511Z (9 months ago)
• Topics: bloom-filter, go, golang, probablistic-data-structures
• Language: Go
• Homepage:
• Size: 1.95 KB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
A Bloom filter is a space-efficient probabilistic data structure that is used to check whether an element is a member of a set.

False positive matches are possible, but false negatives are not, therefore, each query may either return "possibly present" in the set or

"_definitely_ not in the set". Elements can be added to this set, but cannot be removed. In this implementation, `murmurhash` is used, which is a non-cryptographic hashing function.

Test coverage - 100%

```

$ go test -cover

PASS

coverage: 100.0% of statements

ok      github.com/namannimmo/bloomfilter       0.002s

```