forked from ava-labs/avalanchego
-
Notifications
You must be signed in to change notification settings - Fork 0
/
short_set_test.go
319 lines (253 loc) · 6.68 KB
/
short_set_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
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
// Copyright (C) 2019-2022, Ava Labs, Inc. All rights reserved.
// See the file LICENSE for licensing terms.
package ids
import (
"strings"
"testing"
"github.com/stretchr/testify/require"
)
func TestShortSetContains(t *testing.T) {
set := ShortSet{}
id0 := ShortID{0}
id1 := ShortID{1}
switch {
case set.Contains(id0):
t.Fatalf("Sets shouldn't contain %s", id0)
case set.Contains(id1):
t.Fatalf("Sets shouldn't contain %s", id1)
}
set.Add(id0)
switch {
case !set.Contains(id0):
t.Fatalf("Set should contain %s", id0)
case set.Contains(id1):
t.Fatalf("Set shouldn't contain %s", id1)
}
set.Add(id1)
switch {
case !set.Contains(id0):
t.Fatalf("Set should contain %s", id0)
case !set.Contains(id1):
t.Fatalf("Set should contain %s", id1)
}
set.Remove(id0)
switch {
case set.Contains(id0):
t.Fatalf("Sets shouldn't contain %s", id0)
case !set.Contains(id1):
t.Fatalf("Set should contain %s", id1)
}
set.Add(id0)
switch {
case !set.Contains(id0):
t.Fatalf("Set should contain %s", id0)
case !set.Contains(id1):
t.Fatalf("Set should contain %s", id1)
}
}
func TestShortSetUnion(t *testing.T) {
set := ShortSet{}
unionSet := ShortSet{}
id0 := ShortID{0}
id1 := ShortID{1}
unionSet.Add(id0)
set.Union(unionSet)
switch {
case !set.Contains(id0):
t.Fatalf("Set should contain %s", id0)
case set.Contains(id1):
t.Fatalf("Set shouldn't contain %s", id1)
}
unionSet.Add(id1)
set.Union(unionSet)
switch {
case !set.Contains(id0):
t.Fatalf("Set should contain %s", id0)
case !set.Contains(id1):
t.Fatalf("Set should contain %s", id1)
}
set.Remove(id0)
switch {
case set.Contains(id0):
t.Fatalf("Sets shouldn't contain %s", id0)
case !set.Contains(id1):
t.Fatalf("Set should contain %s", id1)
}
set.Clear()
set.Union(unionSet)
switch {
case !set.Contains(id0):
t.Fatalf("Set should contain %s", id0)
case !set.Contains(id1):
t.Fatalf("Set should contain %s", id1)
}
}
func TestShortSetDifference(t *testing.T) {
set := ShortSet{}
diffSet := ShortSet{}
id0 := ShortID{0}
id1 := ShortID{1}
diffSet.Add(id0)
set.Add(id0, id1)
switch {
case !set.Contains(id0):
t.Fatalf("Set should contain %s", id0)
case !set.Contains(id1):
t.Fatalf("Set should contain %s", id1)
}
set.Difference(diffSet)
switch {
case set.Contains(id0):
t.Fatalf("Set shouldn't contain %s", id0)
case !set.Contains(id1):
t.Fatalf("Set should contain %s", id1)
}
}
func TestShortSetEquals(t *testing.T) {
set := ShortSet{}
otherSet := ShortSet{}
if !set.Equals(otherSet) {
t.Fatal("Empty sets should be equal")
}
if !otherSet.Equals(set) {
t.Fatal("Empty sets should be equal")
}
set.Add(ShortID{1, 2, 3, 4, 5})
if set.Equals(otherSet) {
t.Fatal("Sets should be unequal")
}
if otherSet.Equals(set) {
t.Fatal("Sets should be unequal")
}
otherSet.Add(ShortID{1, 2, 3, 4, 5})
if !set.Equals(otherSet) {
t.Fatal("sets should be equal")
}
if !otherSet.Equals(set) {
t.Fatal("sets should be equal")
}
otherSet.Add(ShortID{6, 7, 8, 9, 10})
if set.Equals(otherSet) {
t.Fatal("Sets should be unequal")
}
if otherSet.Equals(set) {
t.Fatal("Sets should be unequal")
}
set.Add(ShortID{6, 7, 8, 9, 10})
if !set.Equals(otherSet) {
t.Fatal("sets should be equal")
}
if !otherSet.Equals(set) {
t.Fatal("sets should be equal")
}
otherSet.Add(ShortID{11, 12, 13, 14, 15})
if set.Equals(otherSet) {
t.Fatal("Sets should be unequal")
}
if otherSet.Equals(set) {
t.Fatal("Sets should be unequal")
}
set.Add(ShortID{11, 12, 13, 14, 16})
if set.Equals(otherSet) {
t.Fatal("Sets should be unequal")
}
if otherSet.Equals(set) {
t.Fatal("Sets should be unequal")
}
}
func TestShortSetList(t *testing.T) {
set := ShortSet{}
otherSet := ShortSet{}
id0 := ShortID{0}
id1 := ShortID{1}
set.Add(id0)
otherSet.Add(set.List()...)
if !set.Equals(otherSet) {
t.Fatalf("Sets should be equal but are:\n%s\n%s", set, otherSet)
}
set.Add(id1)
otherSet.Clear()
otherSet.Add(set.List()...)
if !set.Equals(otherSet) {
t.Fatalf("Sets should be equal but are:\n%s\n%s", set, otherSet)
}
}
func TestShortSetCappedList(t *testing.T) {
set := ShortSet{}
id := ShortEmpty
if list := set.CappedList(0); len(list) != 0 {
t.Fatalf("List should have been empty but was %v", list)
}
set.Add(id)
if list := set.CappedList(0); len(list) != 0 {
t.Fatalf("List should have been empty but was %v", list)
} else if list := set.CappedList(1); len(list) != 1 {
t.Fatalf("List should have had length %d but had %d", 1, len(list))
} else if returnedID := list[0]; id != returnedID {
t.Fatalf("List should have been %s but was %s", id, returnedID)
} else if list := set.CappedList(2); len(list) != 1 {
t.Fatalf("List should have had length %d but had %d", 1, len(list))
} else if returnedID := list[0]; id != returnedID {
t.Fatalf("List should have been %s but was %s", id, returnedID)
}
}
func TestShortSetString(t *testing.T) {
set := ShortSet{}
id0 := ShortID{0}
id1 := ShortID{1}
if str := set.String(); str != "{}" {
t.Fatalf("Set should have been %s but was %s", "{}", str)
}
set.Add(id0)
if str := set.String(); str != "{111111111111111111116DBWJs}" {
t.Fatalf("Set should have been %s but was %s", "{111111111111111111116DBWJs}", str)
}
set.Add(id1)
if str := set.String(); !strings.Contains(str, "111111111111111111116DBWJs") {
t.Fatalf("Set should have contained %s", "111111111111111111116DBWJs")
} else if !strings.Contains(str, "6HgC8KRBEhXYbF4riJyJFLSHt37UNuRt") {
t.Fatalf("Set should have contained %s", "6HgC8KRBEhXYbF4riJyJFLSHt37UNuRt")
} else if count := strings.Count(str, ","); count != 1 {
t.Fatalf("Should only have one %s in %s", ",", str)
}
}
func TestShortSetPop(t *testing.T) {
var s ShortSet
_, ok := s.Pop()
require.False(t, ok)
s = make(ShortSet)
_, ok = s.Pop()
require.False(t, ok)
id1, id2 := GenerateTestShortID(), GenerateTestShortID()
s.Add(id1, id2)
got, ok := s.Pop()
require.True(t, ok)
require.True(t, got == id1 || got == id2)
require.EqualValues(t, 1, s.Len())
got, ok = s.Pop()
require.True(t, ok)
require.True(t, got == id1 || got == id2)
require.EqualValues(t, 0, s.Len())
_, ok = s.Pop()
require.False(t, ok)
}
func TestShortSortedList(t *testing.T) {
require := require.New(t)
set := ShortSet{}
require.Len(set.SortedList(), 0)
set.Add(ShortID{0})
sorted := set.SortedList()
require.Len(sorted, 1)
require.Equal(ShortID{0}, sorted[0])
set.Add(ShortID{1})
sorted = set.SortedList()
require.Len(sorted, 2)
require.Equal(ShortID{0}, sorted[0])
require.Equal(ShortID{1}, sorted[1])
set.Add(ShortID{2})
sorted = set.SortedList()
require.Len(sorted, 3)
require.Equal(ShortID{0}, sorted[0])
require.Equal(ShortID{1}, sorted[1])
require.Equal(ShortID{2}, sorted[2])
}