-
Notifications
You must be signed in to change notification settings - Fork 12
/
enumerator_test.go
237 lines (214 loc) · 4.57 KB
/
enumerator_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
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
// Copyright (c) 2018 Couchbase, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
// implied. See the License for the specific language governing
// permissions and limitations under the License.
package zap
import (
"fmt"
"testing"
"github.com/blevesearch/vellum"
)
type enumTestEntry struct {
key string
val uint64
}
type enumTestWant struct {
key string
idx int
val uint64
}
func TestEnumerator(t *testing.T) {
tests := []struct {
desc string
in [][]enumTestEntry
want []enumTestWant
}{
{
desc: "two non-empty enumerators with no duplicate keys",
in: [][]enumTestEntry{
{
{"a", 1},
{"c", 3},
{"e", 5},
},
{
{"b", 2},
{"d", 4},
{"f", 6},
},
},
want: []enumTestWant{
{"a", 0, 1},
{"b", 1, 2},
{"c", 0, 3},
{"d", 1, 4},
{"e", 0, 5},
{"f", 1, 6},
},
},
{
desc: "two non-empty enumerators with duplicate keys",
in: [][]enumTestEntry{
{
{"a", 1},
{"c", 3},
{"e", 5},
},
{
{"a", 2},
{"c", 4},
{"e", 6},
},
},
want: []enumTestWant{
{"a", 0, 1},
{"a", 1, 2},
{"c", 0, 3},
{"c", 1, 4},
{"e", 0, 5},
{"e", 1, 6},
},
},
{
desc: "first iterator is empty",
in: [][]enumTestEntry{
{},
{
{"a", 2},
{"c", 4},
{"e", 6},
},
},
want: []enumTestWant{
{"a", 1, 2},
{"c", 1, 4},
{"e", 1, 6},
},
},
{
desc: "last iterator is empty",
in: [][]enumTestEntry{
{
{"a", 1},
{"c", 3},
{"e", 5},
},
{},
},
want: []enumTestWant{
{"a", 0, 1},
{"c", 0, 3},
{"e", 0, 5},
},
},
{
desc: "two different length enumerators with duplicate keys",
in: [][]enumTestEntry{
{
{"a", 1},
{"c", 3},
{"e", 5},
},
{
{"a", 2},
{"b", 4},
{"d", 1000},
{"e", 6},
},
},
want: []enumTestWant{
{"a", 0, 1},
{"a", 1, 2},
{"b", 1, 4},
{"c", 0, 3},
{"d", 1, 1000},
{"e", 0, 5},
{"e", 1, 6},
},
},
}
for _, test := range tests {
var itrs []vellum.Iterator
for _, entries := range test.in {
itrs = append(itrs, &testIterator{entries: entries})
}
enumerator, err := newEnumerator(itrs)
if err != nil {
t.Fatalf("%s - expected no err on newNumerator, got: %v", test.desc, err)
}
wanti := 0
for wanti < len(test.want) {
if err != nil {
t.Fatalf("%s - wanted no err, got: %v", test.desc, err)
}
currK, currIdx, currV := enumerator.Current()
want := test.want[wanti]
if want.key != string(currK) {
t.Fatalf("%s - wrong key, wanted: %#v, got: %q, %d, %d", test.desc,
want, currK, currIdx, currV)
}
if want.idx != currIdx {
t.Fatalf("%s - wrong idx, wanted: %#v, got: %q, %d, %d", test.desc,
want, currK, currIdx, currV)
}
if want.val != currV {
t.Fatalf("%s - wrong val, wanted: %#v, got: %q, %d, %d", test.desc,
want, currK, currIdx, currV)
}
wanti += 1
err = enumerator.Next()
}
if err != vellum.ErrIteratorDone {
t.Fatalf("%s - expected ErrIteratorDone, got: %v", test.desc, err)
}
err = enumerator.Close()
if err != nil {
t.Fatalf("%s - expected nil err on close, got: %v", test.desc, err)
}
for _, itr := range itrs {
if itr.(*testIterator).curr != 654321 {
t.Fatalf("%s - expected child iter to be closed", test.desc)
}
}
}
}
type testIterator struct {
entries []enumTestEntry
curr int
}
func (m *testIterator) Current() ([]byte, uint64) {
if m.curr >= len(m.entries) {
return nil, 0
}
return []byte(m.entries[m.curr].key), m.entries[m.curr].val
}
func (m *testIterator) Next() error {
m.curr++
if m.curr >= len(m.entries) {
return vellum.ErrIteratorDone
}
return nil
}
func (m *testIterator) Seek(key []byte) error {
return fmt.Errorf("not implemented for enumerator unit tests")
}
func (m *testIterator) Reset(f *vellum.FST,
startKeyInclusive, endKeyExclusive []byte, aut vellum.Automaton) error {
return fmt.Errorf("not implemented for enumerator unit tests")
}
func (m *testIterator) Close() error {
m.curr = 654321
return nil
}
func (m *testIterator) Exists(key []byte) (bool, error) {
return false, fmt.Errorf("not implemented for enumerator unit tests")
}