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
|
// Copyright 2021 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package main
import (
"./a"
"fmt"
"sort"
)
func TestSet() {
s1 := a.Make[int]()
if got := s1.Len(); got != 0 {
panic(fmt.Sprintf("Len of empty set = %d, want 0", got))
}
s1.Add(1)
s1.Add(1)
s1.Add(1)
if got := s1.Len(); got != 1 {
panic(fmt.Sprintf("(%v).Len() == %d, want 1", s1, got))
}
s1.Add(2)
s1.Add(3)
s1.Add(4)
if got := s1.Len(); got != 4 {
panic(fmt.Sprintf("(%v).Len() == %d, want 4", s1, got))
}
if !s1.Contains(1) {
panic(fmt.Sprintf("(%v).Contains(1) == false, want true", s1))
}
if s1.Contains(5) {
panic(fmt.Sprintf("(%v).Contains(5) == true, want false", s1))
}
vals := s1.Values()
sort.Ints(vals)
w1 := []int{1, 2, 3, 4}
if !a.SliceEqual(vals, w1) {
panic(fmt.Sprintf("(%v).Values() == %v, want %v", s1, vals, w1))
}
}
func TestEqual() {
s1 := a.Make[string]()
s2 := a.Make[string]()
if !a.Equal(s1, s2) {
panic(fmt.Sprintf("a.Equal(%v, %v) = false, want true", s1, s2))
}
s1.Add("hello")
s1.Add("world")
if got := s1.Len(); got != 2 {
panic(fmt.Sprintf("(%v).Len() == %d, want 2", s1, got))
}
if a.Equal(s1, s2) {
panic(fmt.Sprintf("a.Equal(%v, %v) = true, want false", s1, s2))
}
}
func TestCopy() {
s1 := a.Make[float64]()
s1.Add(0)
s2 := s1.Copy()
if !a.Equal(s1, s2) {
panic(fmt.Sprintf("a.Equal(%v, %v) = false, want true", s1, s2))
}
s1.Add(1)
if a.Equal(s1, s2) {
panic(fmt.Sprintf("a.Equal(%v, %v) = true, want false", s1, s2))
}
}
func TestAddSet() {
s1 := a.Make[int]()
s1.Add(1)
s1.Add(2)
s2 := a.Make[int]()
s2.Add(2)
s2.Add(3)
s1.AddSet(s2)
if got := s1.Len(); got != 3 {
panic(fmt.Sprintf("(%v).Len() == %d, want 3", s1, got))
}
s2.Add(1)
if !a.Equal(s1, s2) {
panic(fmt.Sprintf("a.Equal(%v, %v) = false, want true", s1, s2))
}
}
func TestSubSet() {
s1 := a.Make[int]()
s1.Add(1)
s1.Add(2)
s2 := a.Make[int]()
s2.Add(2)
s2.Add(3)
s1.SubSet(s2)
if got := s1.Len(); got != 1 {
panic(fmt.Sprintf("(%v).Len() == %d, want 1", s1, got))
}
if vals, want := s1.Values(), []int{1}; !a.SliceEqual(vals, want) {
panic(fmt.Sprintf("after SubSet got %v, want %v", vals, want))
}
}
func TestIntersect() {
s1 := a.Make[int]()
s1.Add(1)
s1.Add(2)
s2 := a.Make[int]()
s2.Add(2)
s2.Add(3)
s1.Intersect(s2)
if got := s1.Len(); got != 1 {
panic(fmt.Sprintf("(%v).Len() == %d, want 1", s1, got))
}
if vals, want := s1.Values(), []int{2}; !a.SliceEqual(vals, want) {
panic(fmt.Sprintf("after Intersect got %v, want %v", vals, want))
}
}
func TestIterate() {
s1 := a.Make[int]()
s1.Add(1)
s1.Add(2)
s1.Add(3)
s1.Add(4)
tot := 0
s1.Iterate(func(i int) { tot += i })
if tot != 10 {
panic(fmt.Sprintf("total of %v == %d, want 10", s1, tot))
}
}
func TestFilter() {
s1 := a.Make[int]()
s1.Add(1)
s1.Add(2)
s1.Add(3)
s1.Filter(func(v int) bool { return v%2 == 0 })
if vals, want := s1.Values(), []int{2}; !a.SliceEqual(vals, want) {
panic(fmt.Sprintf("after Filter got %v, want %v", vals, want))
}
}
func main() {
TestSet()
TestEqual()
TestCopy()
TestAddSet()
TestSubSet()
TestIntersect()
TestIterate()
TestFilter()
}
|
