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
|
// Copyright 2024 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 slices_test
import (
"iter"
"math/rand/v2"
. "slices"
"testing"
)
func TestAll(t *testing.T) {
for size := 0; size < 10; size++ {
var s []int
for i := range size {
s = append(s, i)
}
ei, ev := 0, 0
cnt := 0
for i, v := range All(s) {
if i != ei || v != ev {
t.Errorf("at iteration %d got %d, %d want %d, %d", cnt, i, v, ei, ev)
}
ei++
ev++
cnt++
}
if cnt != size {
t.Errorf("read %d values expected %d", cnt, size)
}
}
}
func TestBackward(t *testing.T) {
for size := 0; size < 10; size++ {
var s []int
for i := range size {
s = append(s, i)
}
ei, ev := size-1, size-1
cnt := 0
for i, v := range Backward(s) {
if i != ei || v != ev {
t.Errorf("at iteration %d got %d, %d want %d, %d", cnt, i, v, ei, ev)
}
ei--
ev--
cnt++
}
if cnt != size {
t.Errorf("read %d values expected %d", cnt, size)
}
}
}
func TestValues(t *testing.T) {
for size := 0; size < 10; size++ {
var s []int
for i := range size {
s = append(s, i)
}
ev := 0
cnt := 0
for v := range Values(s) {
if v != ev {
t.Errorf("at iteration %d got %d want %d", cnt, v, ev)
}
ev++
cnt++
}
if cnt != size {
t.Errorf("read %d values expected %d", cnt, size)
}
}
}
func testSeq(yield func(int) bool) {
for i := 0; i < 10; i += 2 {
if !yield(i) {
return
}
}
}
var testSeqResult = []int{0, 2, 4, 6, 8}
func TestAppendSeq(t *testing.T) {
s := AppendSeq([]int{1, 2}, testSeq)
want := append([]int{1, 2}, testSeqResult...)
if !Equal(s, want) {
t.Errorf("got %v, want %v", s, want)
}
}
func TestCollect(t *testing.T) {
s := Collect(testSeq)
want := testSeqResult
if !Equal(s, want) {
t.Errorf("got %v, want %v", s, want)
}
}
var iterTests = [][]string{
nil,
{"a"},
{"a", "b"},
{"b", "a"},
strs[:],
}
func TestValuesAppendSeq(t *testing.T) {
for _, prefix := range iterTests {
for _, s := range iterTests {
got := AppendSeq(prefix, Values(s))
want := append(prefix, s...)
if !Equal(got, want) {
t.Errorf("AppendSeq(%v, Values(%v)) == %v, want %v", prefix, s, got, want)
}
}
}
}
func TestValuesCollect(t *testing.T) {
for _, s := range iterTests {
got := Collect(Values(s))
if !Equal(got, s) {
t.Errorf("Collect(Values(%v)) == %v, want %v", s, got, s)
}
}
}
func TestSorted(t *testing.T) {
s := Sorted(Values(ints[:]))
if !IsSorted(s) {
t.Errorf("sorted %v", ints)
t.Errorf(" got %v", s)
}
}
func TestSortedFunc(t *testing.T) {
s := SortedFunc(Values(ints[:]), func(a, b int) int { return a - b })
if !IsSorted(s) {
t.Errorf("sorted %v", ints)
t.Errorf(" got %v", s)
}
}
func TestSortedStableFunc(t *testing.T) {
n, m := 1000, 100
data := make(intPairs, n)
for i := range data {
data[i].a = rand.IntN(m)
}
data.initB()
s := intPairs(SortedStableFunc(Values(data), intPairCmp))
if !IsSortedFunc(s, intPairCmp) {
t.Errorf("SortedStableFunc didn't sort %d ints", n)
}
if !s.inOrder(false) {
t.Errorf("SortedStableFunc wasn't stable on %d ints", n)
}
// iterVal converts a Seq2 to a Seq.
iterVal := func(seq iter.Seq2[int, intPair]) iter.Seq[intPair] {
return func(yield func(intPair) bool) {
for _, v := range seq {
if !yield(v) {
return
}
}
}
}
s = intPairs(SortedStableFunc(iterVal(Backward(data)), intPairCmp))
if !IsSortedFunc(s, intPairCmp) {
t.Errorf("SortedStableFunc didn't sort %d reverse ints", n)
}
if !s.inOrder(true) {
t.Errorf("SortedStableFunc wasn't stable on %d reverse ints", n)
}
}
|
