forked from eclesh/hyperloglog
-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathmurmur_test.go
184 lines (164 loc) · 3.87 KB
/
murmur_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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
package hyperloglog
import (
"encoding/binary"
"math/rand"
"testing"
"unsafe"
"github.com/DataDog/mmh3"
"github.com/dustin/randbo"
)
var buf32 = make([]byte, 4)
var buf64 = make([]byte, 8)
var buf128 = make([]byte, 16)
// Test that our abbreviated murmur hash works the same as upstream
func TestMurmur(t *testing.T) {
for i := 0; i < 100; i++ {
x := rand.Int31()
binary.LittleEndian.PutUint32(buf32, uint32(x))
hash := mmh3.Hash32(buf32)
m := Murmur32(uint32(x))
if hash != m {
t.Errorf("Hash mismatch on 32 bit %d: expected 0x%X, got 0x%X\n", x, hash, m)
}
}
for i := 0; i < 100; i++ {
x := rand.Int63()
binary.LittleEndian.PutUint64(buf64, uint64(x))
hash := mmh3.Hash32(buf64)
m := Murmur64(uint64(x))
if hash != m {
t.Errorf("Hash mismatch on 64 bit %d: expected 0x%X, got 0x%X\n", x, hash, m)
}
}
for i := 0; i < 100; i++ {
x := rand.Int63()
y := rand.Int63()
binary.LittleEndian.PutUint64(buf128, uint64(x))
binary.LittleEndian.PutUint64(buf128[8:], uint64(y))
hash := mmh3.Hash32(buf128)
m := Murmur128(uint64(x), uint64(y))
if hash != m {
t.Errorf("Hash mismatch on 128 bit %d,%d: expected 0x%X, got 0x%X\n", x, y, hash, m)
}
}
for i := 0; i < 100; i++ {
key := randString((i % 15) + 5)
hash := mmh3.Hash32([]byte(key))
m := MurmurString(key)
if hash != m {
t.Errorf("Hash mismatch on key %s: expected 0x%X, got 0x%X\n", key, hash, m)
}
}
}
func TestMurmurBytes(t *testing.T) {
b := []byte("hello")
v := MurmurBytes(b)
if v != 613153351 {
t.Fatalf("MurmurBytes failed for %s: %v != %v", b, v, 613153351)
}
}
func TestMurmurString(t *testing.T) {
s := "hello"
v := MurmurString(s)
if v != 613153351 {
t.Fatalf("MurmurString failed for %s: %v != %v", s, v, 613153351)
}
}
func TestMurmurStringZero(t *testing.T) {
s := ""
v := MurmurString(s)
if v != 0 {
t.Fatalf("MurmurString failed for %s: %v != %v", s, v, 0)
}
}
func randString(n int) string {
rand.Seed(10)
letterRunes := []rune("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ")
b := make([]rune, n)
for i := range b {
b[i] = letterRunes[rand.Intn(len(letterRunes))]
}
return string(b)
}
// Benchmarks
func benchmarkMurmurBytes(b *testing.B, input [][]byte) {
b.ResetTimer()
for n := 0; n < b.N; n++ {
for _, x := range input {
MurmurBytes(x)
}
}
}
func benchmarkMurmur64(b *testing.B, input []uint64) {
b.ResetTimer()
for n := 0; n < b.N; n++ {
for _, x := range input {
Murmur64(x)
}
}
}
func benchmarkMurmurString(b *testing.B, input []string) {
b.ResetTimer()
for n := 0; n < b.N; n++ {
for _, x := range input {
MurmurString(x)
}
}
}
func benchmarkHash32(b *testing.B, input []string) {
b.ResetTimer()
for n := 0; n < b.N; n++ {
for _, x := range input {
b := *(*[]byte)(unsafe.Pointer(&x))
mmh3.Hash32(b)
}
}
}
func Benchmark100MurmurBytes(b *testing.B) {
rand.Seed(10)
input := make([][]byte, 100)
for i := 0; i < 100; i++ {
x := make([]byte, 1000)
rand.Read(x)
input[i] = x
}
benchmarkMurmurBytes(b, input)
}
func Benchmark100Murmur64(b *testing.B) {
rand.Seed(10)
input := make([]uint64, 100)
for i := 0; i < 100; i++ {
input[i] = uint64(rand.Int63())
}
benchmarkMurmur64(b, input)
}
func Benchmark100MurmurString(b *testing.B) {
rand.Seed(10)
input := make([]string, 100)
for i := 0; i < 100; i++ {
input[i] = randString((i % 15) + 5)
}
benchmarkMurmurString(b, input)
}
func Benchmark100Hash32(b *testing.B) {
rand.Seed(10)
input := make([]string, 100)
for i := 0; i < 100; i++ {
input[i] = randString((i % 15) + 5)
}
benchmarkHash32(b, input)
}
func BenchmarkMurmurStringBig(b *testing.B) {
// Make a 100Mb string and use that as a benchmark
r := randbo.New()
slice := make([]byte, 100*1024*1024)
_, err := r.Read(slice)
if err != nil {
b.Fatalf("Failed to create benchmark data: %s", err)
}
s := string(slice)
b.ResetTimer()
for i := 0; i < b.N; i++ {
MurmurString(s)
}
}