forked from tylertreat/BoomFilters
-
Notifications
You must be signed in to change notification settings - Fork 0
/
inverse_test.go
111 lines (90 loc) · 2.1 KB
/
inverse_test.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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
package boom
import (
"strconv"
"testing"
)
// Ensures that Capacity returns the correct filter size.
func TestInverseCapacity(t *testing.T) {
f := NewInverseBloomFilter(100)
if c := f.Capacity(); c != 100 {
t.Errorf("expected 100, got %d", c)
}
}
// Ensures that TestAndAdd behaves correctly.
func TestInverseTestAndAdd(t *testing.T) {
f := NewInverseBloomFilter(3)
if f.TestAndAdd([]byte(`a`)) {
t.Error("`a` should not be a member")
}
if !f.TestAndAdd([]byte(`a`)) {
t.Error("`a` should be a member")
}
// `d` hashes to the same index as `a`.
if f.TestAndAdd([]byte(`d`)) {
t.Error("`d` should not be a member")
}
// `a` was swapped out.
if f.TestAndAdd([]byte(`a`)) {
t.Error("`a` should not be a member")
}
if !f.TestAndAdd([]byte(`a`)) {
t.Error("`a` should be a member")
}
// `b` hashes to another index.
if f.TestAndAdd([]byte(`b`)) {
t.Error("`b` should not be a member")
}
if !f.TestAndAdd([]byte(`b`)) {
t.Error("`b` should be a member")
}
// `a` should still be a member.
if !f.TestAndAdd([]byte(`a`)) {
t.Error("`a` should be a member")
}
if f.Test([]byte(`c`)) {
t.Error("`c` should not be a member")
}
if f.Add([]byte(`c`)) != f {
t.Error("Returned InverseBloomFilter should be the same instance")
}
if !f.Test([]byte(`c`)) {
t.Error("`c` should be a member")
}
}
func BenchmarkInverseAdd(b *testing.B) {
b.StopTimer()
f := NewInverseBloomFilter(100000)
data := make([][]byte, b.N)
for i := 0; i < b.N; i++ {
data[i] = []byte(strconv.Itoa(i))
}
b.StartTimer()
for n := 0; n < b.N; n++ {
f.Add(data[n])
}
}
func BenchmarkInverseTest(b *testing.B) {
b.StopTimer()
f := NewInverseBloomFilter(100000)
data := make([][]byte, b.N)
for i := 0; i < b.N; i++ {
data[i] = []byte(strconv.Itoa(i))
f.Add(data[i])
}
b.StartTimer()
for n := 0; n < b.N; n++ {
f.Test(data[n])
}
}
func BenchmarkInverseTestAndAdd(b *testing.B) {
b.StopTimer()
f := NewInverseBloomFilter(100000)
data := make([][]byte, b.N)
for i := 0; i < b.N; i++ {
data[i] = []byte(strconv.Itoa(i))
}
b.StartTimer()
for n := 0; n < b.N; n++ {
f.TestAndAdd(data[n])
}
}