An open API service providing package, version and dependency metadata of many open source software ecosystems and registries.

Top 1.6% on proxy.golang.org
Top 1.4% dependent packages on proxy.golang.org
Top 2.3% dependent repos on proxy.golang.org
Top 1.9% forks on proxy.golang.org
Top 1.1% docker downloads on proxy.golang.org

proxy.golang.org : github.com/bits-and-blooms/bloom

Package bloom provides data structures and methods for creating Bloom filters. A Bloom filter is a representation of a set of _n_ items, where the main requirement is to make membership queries; _i.e._, whether an item is a member of a set. A Bloom filter has two parameters: _m_, a maximum size (typically a reasonably large multiple of the cardinality of the set to represent) and _k_, the number of hashing functions on elements of the set. (The actual hashing functions are important, too, but this is not a parameter for this implementation). A Bloom filter is backed by a BitSet; a key is represented in the filter by setting the bits at each value of the hashing functions (modulo _m_). Set membership is done by _testing_ whether the bits at each value of the hashing functions (again, modulo _m_) are set. If so, the item is in the set. If the item is actually in the set, a Bloom filter will never fail (the true positive rate is 1.0); but it is susceptible to false positives. The art is to choose _k_ and _m_ correctly. In this implementation, the hashing functions used is murmurhash, a non-cryptographic hashing function. This implementation accepts keys for setting as testing as []byte. Thus, to add a string item, "Love": Similarly, to test if "Love" is in bloom: For numeric data, I recommend that you look into the binary/encoding library. But, for example, to add a uint32 to the filter: Finally, there is a method to estimate the false positive rate of a particular Bloom filter for a set of size _n_: Given the particular hashing scheme, it's best to be empirical about this. Note that estimating the FP rate will clear the Bloom filter.

Registry - Source - Documentation - JSON
purl: pkg:golang/github.com/bits-and-blooms/bloom
Keywords: bloom , bloom-filters , go
License: BSD-2-Clause
Latest release: almost 8 years ago
First release: about 11 years ago
Namespace: github.com/bits-and-blooms
Dependent packages: 17
Dependent repositories: 5
Stars: 1,841 on GitHub
Forks: 215 on GitHub
Docker dependents: 14
Docker downloads: 2,172
See more repository details: repos.ecosyste.ms
Funding links: https://donate.mcc.org/
Last synced: about 9 hours ago

Top 8.2% on proxy.golang.org
github.com/forta-network/forta-node v0.9.10
Scan Node software for the Forta Network
95 versions - Latest release: about 1 year ago - 64 stars on GitHub
Top 8.2% on proxy.golang.org
github.com/forta-protocol/forta-node v0.9.10
Scan Node software for the Forta Network
95 versions - Latest release: about 1 year ago - 63 stars on GitHub
Top 8.2% on proxy.golang.org
github.com/neblic/platform v0.3.1
Neblic simplifies and automates the way you can view what went wrong with end-to-end Application ...
5 versions - Latest release: about 1 year ago - 0 stars on GitHub
Top 5.1% on proxy.golang.org
github.com/forta-network/forta-core-go v0.0.0-20240110111218-b4b8774d2bb6
Go libraries for Forta
179 versions - Latest release: over 1 year ago - 3 dependent packages - 3 dependent repositories - 20 stars on GitHub
Top 6.5% on proxy.golang.org
github.com/formancehq/stack v1.10.14 💰
Modular developer platform to build and operate complex money flows of any size and shape
136 versions - Latest release: over 1 year ago - 1 dependent package - 1 dependent repositories - 122 stars on GitHub
Top 8.2% on proxy.golang.org
github.com/xiusin/pinecms v0.0.0-20221013020406-aee1d0a710e3
基于Go(xorm+xasbin)+Vite开发的CMS管理系统,允许您对外提供.so链接库。 当前正在致力于插件开发以及权限系统完善。 您的✨✨才是最珍贵的鼓励。
2 versions - Latest release: over 2 years ago - 137 stars on GitHub
Past Dependents
Include Past Dependents

Check this option to include packages that no longer depend on this package in their latest version but previously did.