forked from subdotnet/avalanchego
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbit_set_test.go
164 lines (134 loc) · 3.11 KB
/
bit_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
// Copyright (C) 2019-2022, Ava Labs, Inc. All rights reserved.
// See the file LICENSE for licensing terms.
package ids
import "testing"
func TestBitSet(t *testing.T) {
var bs1 BitSet64
if bs1.Len() != 0 {
t.Fatalf("Empty set's len should be 0")
}
bs1.Add(5)
if bs1.Len() != 1 {
t.Fatalf("Wrong set length")
} else if !bs1.Contains(5) {
t.Fatalf("Set should contain element")
}
bs1.Add(10)
switch {
case bs1.Len() != 2:
t.Fatalf("Wrong set length")
case !bs1.Contains(5):
t.Fatalf("Set should contain element")
case !bs1.Contains(10):
t.Fatalf("Set should contain element")
}
bs1.Add(10)
switch {
case bs1.Len() != 2:
t.Fatalf("Wrong set length")
case !bs1.Contains(5):
t.Fatalf("Set should contain element")
case !bs1.Contains(10):
t.Fatalf("Set should contain element")
}
var bs2 BitSet64
bs2.Add(0)
if bs2.Len() != 1 {
t.Fatalf("Wrong set length")
} else if !bs2.Contains(0) {
t.Fatalf("Set should contain element")
}
bs2.Union(bs1)
switch {
case bs1.Len() != 2:
t.Fatalf("Wrong set length")
case !bs1.Contains(5):
t.Fatalf("Set should contain element")
case !bs1.Contains(10):
t.Fatalf("Set should contain element")
case bs2.Len() != 3:
t.Fatalf("Wrong set length")
case !bs2.Contains(0):
t.Fatalf("Set should contain element")
case !bs2.Contains(5):
t.Fatalf("Set should contain element")
case !bs2.Contains(10):
t.Fatalf("Set should contain element")
}
bs1.Clear()
switch {
case bs1.Len() != 0:
t.Fatalf("Wrong set length")
case bs2.Len() != 3:
t.Fatalf("Wrong set length")
case !bs2.Contains(0):
t.Fatalf("Set should contain element")
case !bs2.Contains(5):
t.Fatalf("Set should contain element")
case !bs2.Contains(10):
t.Fatalf("Set should contain element")
}
bs1.Add(63)
if bs1.Len() != 1 {
t.Fatalf("Wrong set length")
} else if !bs1.Contains(63) {
t.Fatalf("Set should contain element")
}
bs1.Add(1)
switch {
case bs1.Len() != 2:
t.Fatalf("Wrong set length")
case !bs1.Contains(1):
t.Fatalf("Set should contain element")
case !bs1.Contains(63):
t.Fatalf("Set should contain element")
}
bs1.Remove(63)
if bs1.Len() != 1 {
t.Fatalf("Wrong set length")
} else if !bs1.Contains(1) {
t.Fatalf("Set should contain element")
}
var bs3 BitSet64
bs3.Add(0)
bs3.Add(2)
bs3.Add(5)
var bs4 BitSet64
bs4.Add(2)
bs4.Add(5)
bs3.Intersection(bs4)
switch {
case bs3.Len() != 2:
t.Fatalf("Wrong set length")
case !bs3.Contains(2):
t.Fatalf("Set should contain element")
case !bs3.Contains(5):
t.Fatalf("Set should contain element")
case bs4.Len() != 2:
t.Fatalf("Wrong set length")
}
var bs5 BitSet64
bs5.Add(7)
bs5.Add(11)
bs5.Add(9)
var bs6 BitSet64
bs6.Add(9)
bs6.Add(11)
bs5.Difference(bs6)
switch {
case bs5.Len() != 1:
t.Fatalf("Wrong set length")
case !bs5.Contains(7):
t.Fatalf("Set should contain element")
case bs6.Len() != 2:
t.Fatalf("Wrong set length")
}
}
func TestBitSetString(t *testing.T) {
var bs BitSet64
bs.Add(17)
expected := "0000000000020000"
if bsString := bs.String(); bsString != expected {
t.Fatalf("BitSet.String returned %s expected %s", bsString, expected)
}
}