1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
|
Source: golang-github-willf-bloom
Section: devel
Priority: optional
Maintainer: Debian Go Packaging Team <team+pkg-go@tracker.debian.org>
Uploaders: Thorsten Alteholz <debian@alteholz.de>
Build-Depends: debhelper (>= 11),
dh-golang,
golang-any,
golang-github-spaolacci-murmur3-dev,
golang-github-willf-bitset-dev
Standards-Version: 4.3.0
Homepage: https://github.com/willf/bloom
Vcs-Browser: https://salsa.debian.org/go-team/packages/golang-github-willf-bloom
Vcs-Git: https://salsa.debian.org/go-team/packages/golang-github-willf-bloom.git
XS-Go-Import-Path: github.com/willf/bloom
Testsuite: autopkgtest-pkg-go
Package: golang-github-willf-bloom-dev
Architecture: all
Depends: ${misc:Depends},
golang-github-spaolacci-murmur3-dev,
golang-github-willf-bitset-dev
Description: Go package implementing 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
(https://github.com/willf/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
(github.com/spaolacci/murmur3), a non-cryptographic hashing function.
|
