-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathset_test.go
95 lines (91 loc) · 1.86 KB
/
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
package set_test
import (
"testing"
"github.com/DoWithLogic/mysql-schema-diff/internal/set"
"github.com/stretchr/testify/assert"
)
func TestSet_Add(t *testing.T) {
for _, tt := range []struct {
name string
adds [][]int
expectedValues []int
}{
{
name: "start empty",
adds: [][]int{
{},
{1, 1, 1},
{2, 3, 4},
{},
{4, 4, 4, 5},
},
expectedValues: []int{1, 2, 3, 4, 5},
},
{
name: "start with values (and add out of order)",
adds: [][]int{
{1, 1, 1},
{4, 4, 4, 5},
{2, 3, 4},
},
expectedValues: []int{1, 2, 3, 4, 5},
},
} {
t.Run(tt.name, func(t *testing.T) {
s := set.NewSet(tt.adds[0]...)
for _, adds := range tt.adds {
for _, add := range adds {
s.Add(add)
assert.True(t, s.Has(add))
}
}
assert.Equal(t, tt.expectedValues, s.Values())
})
}
}
func TestDifference(t *testing.T) {
for _, tc := range []struct {
name string
a *set.Set[int, int]
b *set.Set[int, int]
difference []int
}{
{
name: "empty sets",
a: set.NewSet[int](),
b: set.NewSet[int](),
},
{
name: "a is empty",
a: set.NewSet[int](),
b: set.NewSet[int](1, 2, 3),
},
{
name: "b is empty",
a: set.NewSet[int](1, 2, 3),
b: set.NewSet[int](),
difference: []int{1, 2, 3},
},
{
name: "a and b are the same",
a: set.NewSet[int](1, 2, 3),
b: set.NewSet[int](1, 2, 3),
},
{
name: "a has elements b does not",
a: set.NewSet[int](5, 4, 1, 2, 3),
b: set.NewSet[int](1, 2, 3, 6),
difference: []int{4, 5},
},
{
name: "a is a subset of b",
a: set.NewSet[int](1, 2, 3),
b: set.NewSet[int](1, 2, 3, 4, 5),
},
} {
t.Run(tc.name, func(t *testing.T) {
diff := set.Difference(tc.a, tc.b)
assert.Equal(t, tc.difference, diff)
})
}
}