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
|
package generic
import (
"maps"
"slices"
"testing"
)
type X struct{}
func TestZero(t *testing.T) {
if Zero[int]() != 0 {
t.Errorf("Zero[int]() != 0")
}
if Zero[string]() != "" {
t.Errorf(`Zero[string]() != ""`)
}
if Zero[bool]() != false {
t.Errorf("Zero[bool]() != false")
}
if Zero[*X]() != nil {
t.Errorf("Zero[*X]() != nil")
}
}
func TestIsZero(t *testing.T) {
tests := []struct {
name string
val any
want bool
}{
{
name: "int zero",
val: 0,
want: true,
},
{
"int non-zero",
1,
false,
},
{
"string zero",
"",
true,
},
{
"string non-zero",
"x",
false,
},
{
"nil pointer",
(*X)(nil),
true,
},
{
"non-nil pointer",
Ptr(X{}),
false,
},
}
for _, tt := range tests {
switch v := tt.val.(type) {
case int:
got := IsZero(v)
if got != tt.want {
t.Errorf("%s: got %v, want %v", tt.name, got, tt.want)
}
case string:
got := IsZero(v)
if got != tt.want {
t.Errorf("%s: got %v, want %v", tt.name, got, tt.want)
}
case *X:
got := IsZero(v)
if got != tt.want {
t.Errorf("%s: got %v, want %v", tt.name, got, tt.want)
}
}
}
}
func TestPtr(t *testing.T) {
v := 42
p := Ptr(v)
if p == nil || *p != v {
t.Errorf("Ptr(42) = %v, want pointer to 42", p)
}
}
func TestKeys(t *testing.T) {
m := map[string]int{"a": 1, "b": 2, "c": 3}
seq := Keys(maps.All(m))
keys := slices.Collect(seq)
want := slices.Collect(maps.Keys(m))
slices.Sort(keys)
slices.Sort(want)
if !slices.Equal(keys, want) {
t.Errorf("Keys() = %v, want %v", keys, want)
}
}
func TestValue(t *testing.T) {
m := map[string]int{"a": 1, "b": 2, "c": 3}
seq := Value(maps.All(m))
values := slices.Collect(seq)
want := slices.Collect(maps.Values(m))
// unordered compare
slices.Sort(values)
slices.Sort(want)
if !slices.Equal(values, want) {
t.Errorf("Values() = %v, want %v", values, want)
}
}
func TestSet_Add_Has_Del(t *testing.T) {
s := NewSet[int]()
if s.Has(10) {
t.Errorf("Set should not contain 10 initially")
}
s.Add(10)
if !s.Has(10) {
t.Errorf("Set should contain 10 after Add")
}
s.Del(10)
if s.Has(10) {
t.Errorf("Set should not contain 10 after Del")
}
}
func TestSet_All(t *testing.T) {
s := NewSet[string]()
s.Add("x")
s.Add("y")
s.Add("z")
got := slices.Collect(s.All())
want := []string{"x", "y", "z"}
slices.Sort(got)
slices.Sort(want)
if !slices.Equal(got, want) {
t.Errorf("Set.All() = %v, want %v", got, want)
}
}
|
