bloom
Membership tester
A collection of high-performance set membership tests using hash tables and bit manipulation techniques.
Bloom filters implemented in Go.
146 stars
8 watching
21 forks
Language: Go
last commit: over 8 years agoLinked from 2 awesome lists
Related projects:
| Repository | Description | Stars |
|---|---|---|
| A probabilistic data structure for testing membership in a set with high false positive rates. | 86 | |
| An implementation of a probabilistic data structure used to test membership in a set | 17 | |
| A high-performance probabilistic data structure for efficient membership testing | 88 | |
| An implementation of a flexible and space-efficient data structure for approximated set-membership queries with dynamic item addition and removal | 296 | |
| Implementation of a data structure for efficient set membership queries with optional deletion and dynamic updates | 175 | |
| A tool for writing functional tests against real databases in Go applications. | 1,125 | |
| A high-performance bloom filter implementation | 138 | |
| An implementation of Bloom filters in Ruby, allowing for efficient probabilistic membership testing with options for native counting and Redis-backed implementations. | 473 | |
| A simple and extensible library for behavioural testing of Go web applications. | 802 | |
| An extension for SQLite that allows creating and testing bloom filters using the Murmur3 hashing function. | 17 | |
| A tool that checks the usage of the testify testing framework in Go programs | 105 | |
| Reports on test coverage issues to ensure higher code quality and prevent regressions over time | 99 | |
| Tool for comparing and testing Go code | 436 | |
| A Go implementation of a realistic password strength estimator inspired by password crackers. | 68 | |
| Provides a boilerplate code to test and benchmark cloud platforms with Golang | 3 |