-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbloomfilter.go
56 lines (46 loc) · 1.04 KB
/
bloomfilter.go
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
package bloomfilter
import (
"crypto/sha1"
"strconv"
)
type BloomFilter struct {
bitArray []bool
size int
numHashes int
}
func NewBloomFilter(size, numHashes int) *BloomFilter {
return &BloomFilter{
bitArray: make([]bool, size),
size: size,
numHashes: numHashes,
}
}
func (bf *BloomFilter) Add(value string) {
for i := 0; i < bf.numHashes; i++ {
hash := sha1.New()
hash.Write([]byte(value + strconv.Itoa(i)))
digest := hash.Sum(nil)
index := int(digest[0])<<24 | int(digest[1])<<16 | int(digest[2])<<8 | int(digest[3])
index = index % bf.size
if index < 0 {
index += bf.size
}
bf.bitArray[index] = true
}
}
func (bf *BloomFilter) Contains(value string) bool {
for i := 0; i < bf.numHashes; i++ {
hash := sha1.New()
hash.Write([]byte(value + strconv.Itoa(i)))
digest := hash.Sum(nil)
index := int(digest[0])<<24 | int(digest[1])<<16 | int(digest[2])<<8 | int(digest[3])
index = index % bf.size
if index < 0 {
index += bf.size
}
if !bf.bitArray[index] {
return false
}
}
return true
}