-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathchd_test.go
157 lines (123 loc) · 2.45 KB
/
chd_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
package chd
import (
"bytes"
"encoding/binary"
"testing"
"github.com/stretchr/testify/assert"
)
func TestMapGet(t *testing.T) {
b := NewBuilder(nil)
keys := [][]byte{}
for i := 0; i < 1e4; i++ {
k := encode(i)
b.Add(k)
keys = append(keys, k)
}
m, _ := b.Build()
occupied := make([]bool, m.Cap())
for _, k := range keys {
idx := m.Get(k)
// Key index must be unique for every key
if !assert.False(t, occupied[idx]) {
break
}
occupied[idx] = true
}
assert.EqualValues(t, len(keys), m.Len())
}
func TestMapDelete(t *testing.T) {
b := NewBuilder(nil)
// Delete items that weren't added
for i := 0; i < 100; i++ {
b.Delete(encode(i))
}
// Add items
keys := map[string]struct{}{}
for i := 0; i < 1e4; i++ {
k := encode(i)
b.Add(k)
keys[string(k)] = struct{}{}
}
// Delete added items
i := 0
reinsert := map[string]struct{}{}
for k := range keys {
delete(keys, k)
b.Delete([]byte(k))
reinsert[k] = struct{}{}
if i == 1000 {
break
}
i++
}
// Reinsert some deleted items
i = 0
for k := range reinsert {
keys[k] = struct{}{}
b.Add([]byte(k))
if i == 500 {
break
}
i++
}
m, _ := b.Build()
occupied := make([]bool, m.Cap())
for k := range keys {
idx := m.Get([]byte(k))
// Key index must be unique for every key
if !assert.False(t, occupied[idx]) {
break
}
occupied[idx] = true
}
assert.EqualValues(t, len(keys), m.Len())
}
func TestMapWriteRead(t *testing.T) {
b := NewBuilder(nil)
keys := map[string]int{}
for i := 0; i < 1e4; i++ {
k := encode(i)
keys[string(k)] = -1
b.Add(k)
}
m, _ := b.Build()
for k := range keys {
keys[k] = m.Get([]byte(k))
}
buf := &bytes.Buffer{}
err := m.Write(buf)
assert.Nil(t, err)
mm := NewMap()
err = mm.Read(buf)
assert.Nil(t, err)
for k, i := range keys {
if !assert.Equal(t, i, mm.Get([]byte(k))) {
break
}
}
assert.EqualValues(t, m.Len(), mm.Len())
}
// BenchmarkMapGet measures the average running
// time of Map.Get operations using an IntArray.
func BenchmarkMapGet100KKeys(b *testing.B) {
builder := NewBuilder(nil)
keys := make([][]byte, 1e5)
for i := range keys {
k := encode(i)
keys[i] = k
builder.Add(k)
}
m, _ := builder.Build()
b.ResetTimer()
for i := 0; i < b.N; i++ {
m.Get(keys[i%1e5])
}
}
func encode(v int) []byte {
buffer := make([]byte, 8)
binary.LittleEndian.PutUint64(buffer, uint64(v))
return buffer
}
func decode(b []byte) int {
return int(binary.LittleEndian.Uint64(b))
}