-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrangefunc_test.go
2206 lines (2037 loc) · 50.3 KB
/
rangefunc_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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Copyright 2023 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 rangefunc_test
import (
"fmt"
"regexp"
"slices"
"testing"
)
type Seq[T any] func(yield func(T) bool)
type Seq2[T1, T2 any] func(yield func(T1, T2) bool)
// OfSliceIndex returns a Seq2 over the elements of s. It is equivalent
// to range s.
func OfSliceIndex[T any, S ~[]T](s S) Seq2[int, T] {
return func(yield func(int, T) bool) {
for i, v := range s {
if !yield(i, v) {
return
}
}
return
}
}
// BadOfSliceIndex is "bad" because it ignores the return value from yield
// and just keeps on iterating.
func BadOfSliceIndex[T any, S ~[]T](s S) Seq2[int, T] {
return func(yield func(int, T) bool) {
for i, v := range s {
yield(i, v)
}
return
}
}
// VeryBadOfSliceIndex is "very bad" because it ignores the return value from yield
// and just keeps on iterating, and also wraps that call in a defer-recover so it can
// keep on trying after the first panic.
func VeryBadOfSliceIndex[T any, S ~[]T](s S) Seq2[int, T] {
return func(yield func(int, T) bool) {
for i, v := range s {
func() {
defer func() {
recover()
}()
yield(i, v)
}()
}
return
}
}
// SwallowPanicOfSliceIndex hides panics and converts them to normal return
func SwallowPanicOfSliceIndex[T any, S ~[]T](s S) Seq2[int, T] {
return func(yield func(int, T) bool) {
for i, v := range s {
done := false
func() {
defer func() {
if r := recover(); r != nil {
done = true
}
}()
done = !yield(i, v)
}()
if done {
return
}
}
return
}
}
// PanickyOfSliceIndex iterates the slice but panics if it exits the loop early
func PanickyOfSliceIndex[T any, S ~[]T](s S) Seq2[int, T] {
return func(yield func(int, T) bool) {
for i, v := range s {
if !yield(i, v) {
panic(fmt.Errorf("Panicky iterator panicking"))
}
}
return
}
}
// CooperativeBadOfSliceIndex calls the loop body from a goroutine after
// a ping on a channel, and returns recover()on that same channel.
func CooperativeBadOfSliceIndex[T any, S ~[]T](s S, proceed chan any) Seq2[int, T] {
return func(yield func(int, T) bool) {
for i, v := range s {
if !yield(i, v) {
// if the body breaks, call yield just once in a goroutine
go func() {
<-proceed
defer func() {
proceed <- recover()
}()
yield(0, s[0])
}()
return
}
}
return
}
}
// TrickyIterator is a type intended to test whether an iterator that
// calls a yield function after loop exit must inevitably escape the
// closure; this might be relevant to future checking/optimization.
type TrickyIterator struct {
yield func(int, int) bool
}
func (ti *TrickyIterator) iterEcho(s []int) Seq2[int, int] {
return func(yield func(int, int) bool) {
for i, v := range s {
if !yield(i, v) {
ti.yield = yield
return
}
if ti.yield != nil && !ti.yield(i, v) {
return
}
}
ti.yield = yield
return
}
}
func (ti *TrickyIterator) iterAll(s []int) Seq2[int, int] {
return func(yield func(int, int) bool) {
ti.yield = yield // Save yield for future abuse
for i, v := range s {
if !yield(i, v) {
return
}
}
return
}
}
func (ti *TrickyIterator) iterOne(s []int) Seq2[int, int] {
return func(yield func(int, int) bool) {
ti.yield = yield // Save yield for future abuse
if len(s) > 0 { // Not in a loop might escape differently
yield(0, s[0])
}
return
}
}
func (ti *TrickyIterator) iterZero(s []int) Seq2[int, int] {
return func(yield func(int, int) bool) {
ti.yield = yield // Save yield for future abuse
// Don't call it at all, maybe it won't escape
return
}
}
func (ti *TrickyIterator) fail() {
if ti.yield != nil {
ti.yield(1, 1)
}
}
const DONE = 0 // body of loop has exited in a non-panic way
const READY = 1 // body of loop has not exited yet, is not running
const PANIC = 2 // body of loop is either currently running, or has panicked
const EXHAUSTED = 3 // iterator function return, i.e., sequence is "exhausted"
const MISSING_PANIC = 4 // overload "READY" for panic call
// Check2 wraps the function body passed to iterator forall
// in code that ensures that it cannot (successfully) be called
// either after body return false (control flow out of loop) or
// forall itself returns (the iteration is now done).
//
// Note that this can catch errors before the inserted checks.
func Check2[U, V any](forall Seq2[U, V]) Seq2[U, V] {
return func(body func(U, V) bool) {
state := READY
forall(func(u U, v V) bool {
tmp := state
state = PANIC
if tmp != READY {
panic(fail[tmp])
}
ret := body(u, v)
if ret {
state = READY
} else {
state = DONE
}
return ret
})
if state == PANIC {
panic(fail[MISSING_PANIC])
}
state = EXHAUSTED
}
}
func Check[U any](forall Seq[U]) Seq[U] {
return func(body func(U) bool) {
state := READY
forall(func(u U) bool {
tmp := state
state = PANIC
if tmp != READY {
panic(fail[tmp])
}
ret := body(u)
if ret {
state = READY
} else {
state = DONE
}
return ret
})
if state == PANIC {
panic(fail[MISSING_PANIC])
}
state = EXHAUSTED
}
}
func matchError(r any, x string) bool {
if r == nil {
return false
}
if x == "" {
return true
}
if p, ok := r.(errorString); ok {
return p.Error() == x
}
if p, ok := r.(error); ok {
e, err := regexp.Compile(x)
if err != nil {
panic(fmt.Errorf("Bad regexp '%s' passed to matchError", x))
}
return e.MatchString(p.Error())
}
return false
}
func matchErrorHelper(t *testing.T, r any, x string) {
if matchError(r, x) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v', expected '%s'", r, x)
}
}
// An errorString represents a runtime error described by a single string.
type errorString string
func (e errorString) Error() string {
return string(e)
}
const (
// RERR_ is for runtime error, and may be regexps/substrings, to simplify use of tests with tools
RERR_DONE = "runtime error: range function continued iteration after function for loop body returned false"
RERR_PANIC = "runtime error: range function continued iteration after loop body panic"
RERR_EXHAUSTED = "runtime error: range function continued iteration after whole loop exit"
RERR_MISSING = "runtime error: range function recovered a loop body panic and did not resume panicking"
// CERR_ is for checked errors in the Check combinator defined above, and should be literal strings
CERR_PFX = "checked rangefunc error: "
CERR_DONE = CERR_PFX + "loop iteration after body done"
CERR_PANIC = CERR_PFX + "loop iteration after panic"
CERR_EXHAUSTED = CERR_PFX + "loop iteration after iterator exit"
CERR_MISSING = CERR_PFX + "loop iterator swallowed panic"
)
var fail []error = []error{
errorString(CERR_DONE),
errorString(CERR_PFX + "loop iterator, unexpected error"),
errorString(CERR_PANIC),
errorString(CERR_EXHAUSTED),
errorString(CERR_MISSING),
}
// TestNoVars ensures that versions of rangefunc that use zero or one
// iteration variable (instead of two) run the proper number of times
// and in the one variable case supply the proper values.
// For #65236.
func TestNoVars(t *testing.T) {
i, k := 0, 0
for range Check2(OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10})) {
i++
}
for j := range Check2(OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10})) {
k += j
}
if i != 10 {
t.Errorf("Expected 10, got %d", i)
}
if k != 45 {
t.Errorf("Expected 45, got %d", k)
}
}
func TestCheck(t *testing.T) {
i := 0
defer func() {
if r := recover(); r != nil {
if matchError(r, CERR_DONE) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v'", r)
}
} else {
t.Error("Wanted to see a failure")
}
}()
for _, x := range Check2(BadOfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10})) {
i += x
if i > 4*9 {
break
}
}
}
func TestCooperativeBadOfSliceIndex(t *testing.T) {
i := 0
proceed := make(chan any)
for _, x := range CooperativeBadOfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, proceed) {
i += x
if i >= 36 {
break
}
}
proceed <- true
if r := <-proceed; r != nil {
if matchError(r, RERR_EXHAUSTED) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v'", r)
}
} else {
t.Error("Wanted to see a failure")
}
if i != 36 {
t.Errorf("Expected i == 36, saw %d instead", i)
} else {
t.Logf("i = %d", i)
}
}
func TestCooperativeBadOfSliceIndexCheck(t *testing.T) {
i := 0
proceed := make(chan any)
for _, x := range Check2(CooperativeBadOfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, proceed)) {
i += x
if i >= 36 {
break
}
}
proceed <- true
if r := <-proceed; r != nil {
if matchError(r, CERR_EXHAUSTED) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v'", r)
}
} else {
t.Error("Wanted to see a failure")
}
if i != 36 {
t.Errorf("Expected i == 36, saw %d instead", i)
} else {
t.Logf("i = %d", i)
}
}
func TestTrickyIterAll(t *testing.T) {
trickItAll := TrickyIterator{}
i := 0
for _, x := range trickItAll.iterAll([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
i += x
if i >= 36 {
break
}
}
if i != 36 {
t.Errorf("Expected i == 36, saw %d instead", i)
} else {
t.Logf("i = %d", i)
}
defer func() {
if r := recover(); r != nil {
if matchError(r, RERR_EXHAUSTED) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v'", r)
}
} else {
t.Error("Wanted to see a failure")
}
}()
trickItAll.fail()
}
func TestTrickyIterOne(t *testing.T) {
trickItOne := TrickyIterator{}
i := 0
for _, x := range trickItOne.iterOne([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
i += x
if i >= 36 {
break
}
}
// Don't care about value, ought to be 36 anyhow.
t.Logf("i = %d", i)
defer func() {
if r := recover(); r != nil {
if matchError(r, RERR_EXHAUSTED) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v'", r)
}
} else {
t.Error("Wanted to see a failure")
}
}()
trickItOne.fail()
}
func TestTrickyIterZero(t *testing.T) {
trickItZero := TrickyIterator{}
i := 0
for _, x := range trickItZero.iterZero([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
i += x
if i >= 36 {
break
}
}
// Don't care about value, ought to be 0 anyhow.
t.Logf("i = %d", i)
defer func() {
if r := recover(); r != nil {
if matchError(r, RERR_EXHAUSTED) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v'", r)
}
} else {
t.Error("Wanted to see a failure")
}
}()
trickItZero.fail()
}
func TestTrickyIterZeroCheck(t *testing.T) {
trickItZero := TrickyIterator{}
i := 0
for _, x := range Check2(trickItZero.iterZero([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10})) {
i += x
if i >= 36 {
break
}
}
// Don't care about value, ought to be 0 anyhow.
t.Logf("i = %d", i)
defer func() {
if r := recover(); r != nil {
if matchError(r, CERR_EXHAUSTED) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v'", r)
}
} else {
t.Error("Wanted to see a failure")
}
}()
trickItZero.fail()
}
func TestTrickyIterEcho(t *testing.T) {
trickItAll := TrickyIterator{}
i := 0
for _, x := range trickItAll.iterAll([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
t.Logf("first loop i=%d", i)
i += x
if i >= 10 {
break
}
}
if i != 10 {
t.Errorf("Expected i == 10, saw %d instead", i)
} else {
t.Logf("i = %d", i)
}
defer func() {
if r := recover(); r != nil {
if matchError(r, RERR_EXHAUSTED) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v'", r)
}
} else {
t.Error("Wanted to see a failure")
}
}()
i = 0
for _, x := range trickItAll.iterEcho([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
t.Logf("second loop i=%d", i)
if x >= 5 {
break
}
}
}
func TestTrickyIterEcho2(t *testing.T) {
trickItAll := TrickyIterator{}
var i int
defer func() {
if r := recover(); r != nil {
if matchError(r, RERR_EXHAUSTED) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v'", r)
}
} else {
t.Error("Wanted to see a failure")
}
}()
for k := range 2 {
i = 0
for _, x := range trickItAll.iterEcho([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
t.Logf("k,x,i=%d,%d,%d", k, x, i)
i += x
if i >= 10 {
break
}
}
t.Logf("i = %d", i)
if i != 10 {
t.Errorf("Expected i == 10, saw %d instead", i)
}
}
}
// TestBreak1 should just work, with well-behaved iterators.
// (The misbehaving iterator detector should not trigger.)
func TestBreak1(t *testing.T) {
var result []int
var expect = []int{1, 2, -1, 1, 2, -2, 1, 2, -3}
for _, x := range OfSliceIndex([]int{-1, -2, -3, -4}) {
if x == -4 {
break
}
for _, y := range OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if y == 3 {
break
}
result = append(result, y)
}
result = append(result, x)
}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
}
// TestBreak2 should just work, with well-behaved iterators.
// (The misbehaving iterator detector should not trigger.)
func TestBreak2(t *testing.T) {
var result []int
var expect = []int{1, 2, -1, 1, 2, -2, 1, 2, -3}
outer:
for _, x := range OfSliceIndex([]int{-1, -2, -3, -4}) {
for _, y := range OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if y == 3 {
break
}
if x == -4 {
break outer
}
result = append(result, y)
}
result = append(result, x)
}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
}
// TestContinue should just work, with well-behaved iterators.
// (The misbehaving iterator detector should not trigger.)
func TestContinue(t *testing.T) {
var result []int
var expect = []int{-1, 1, 2, -2, 1, 2, -3, 1, 2, -4}
outer:
for _, x := range OfSliceIndex([]int{-1, -2, -3, -4}) {
result = append(result, x)
for _, y := range OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if y == 3 {
continue outer
}
if x == -4 {
break outer
}
result = append(result, y)
}
result = append(result, x-10)
}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
}
// TestBreak3 should just work, with well-behaved iterators.
// (The misbehaving iterator detector should not trigger.)
func TestBreak3(t *testing.T) {
var result []int
var expect = []int{100, 10, 2, 4, 200, 10, 2, 4, 20, 2, 4, 300, 10, 2, 4, 20, 2, 4, 30}
X:
for _, x := range OfSliceIndex([]int{100, 200, 300, 400}) {
Y:
for _, y := range OfSliceIndex([]int{10, 20, 30, 40}) {
if 10*y >= x {
break
}
result = append(result, y)
if y == 30 {
continue X
}
Z:
for _, z := range OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if z&1 == 1 {
continue Z
}
result = append(result, z)
if z >= 4 {
continue Y
}
}
result = append(result, -y) // should never be executed
}
result = append(result, x)
}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
}
// TestBreak1BadA should end in a panic when the outer-loop's
// single-level break is ignore by BadOfSliceIndex
func TestBreak1BadA(t *testing.T) {
var result []int
var expect = []int{1, 2, -1, 1, 2, -2, 1, 2, -3}
defer func() {
if r := recover(); r != nil {
if matchError(r, RERR_DONE) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v'", r)
}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
} else {
t.Error("Wanted to see a failure")
}
}()
for _, x := range BadOfSliceIndex([]int{-1, -2, -3, -4, -5}) {
if x == -4 {
break
}
for _, y := range OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if y == 3 {
break
}
result = append(result, y)
}
result = append(result, x)
}
}
// TestBreak1BadB should end in a panic, sooner, when the inner-loop's
// (nested) single-level break is ignored by BadOfSliceIndex
func TestBreak1BadB(t *testing.T) {
var result []int
var expect = []int{1, 2} // inner breaks, panics, after before outer appends
defer func() {
if r := recover(); r != nil {
if matchError(r, RERR_DONE) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v'", r)
}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
} else {
t.Error("Wanted to see a failure")
}
}()
for _, x := range OfSliceIndex([]int{-1, -2, -3, -4, -5}) {
if x == -4 {
break
}
for _, y := range BadOfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if y == 3 {
break
}
result = append(result, y)
}
result = append(result, x)
}
}
// TestMultiCont0 tests multilevel continue with no bad iterators
// (it should just work)
func TestMultiCont0(t *testing.T) {
var result []int
var expect = []int{1000, 10, 2, 4, 2000}
W:
for _, w := range OfSliceIndex([]int{1000, 2000}) {
result = append(result, w)
if w == 2000 {
break
}
for _, x := range OfSliceIndex([]int{100, 200, 300, 400}) {
for _, y := range OfSliceIndex([]int{10, 20, 30, 40}) {
result = append(result, y)
for _, z := range OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if z&1 == 1 {
continue
}
result = append(result, z)
if z >= 4 {
continue W // modified to be multilevel
}
}
result = append(result, -y) // should never be executed
}
result = append(result, x)
}
}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
}
// TestMultiCont1 tests multilevel continue with a bad iterator
// in the outermost loop exited by the continue.
func TestMultiCont1(t *testing.T) {
var result []int
var expect = []int{1000, 10, 2, 4}
defer func() {
if r := recover(); r != nil {
if matchError(r, RERR_DONE) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v'", r)
}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
} else {
t.Errorf("Wanted to see a failure, result was %v", result)
}
}()
W:
for _, w := range OfSliceIndex([]int{1000, 2000}) {
result = append(result, w)
if w == 2000 {
break
}
for _, x := range BadOfSliceIndex([]int{100, 200, 300, 400}) {
for _, y := range OfSliceIndex([]int{10, 20, 30, 40}) {
result = append(result, y)
for _, z := range OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if z&1 == 1 {
continue
}
result = append(result, z)
if z >= 4 {
continue W
}
}
result = append(result, -y) // should never be executed
}
result = append(result, x)
}
}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
}
// TestMultiCont2 tests multilevel continue with a bad iterator
// in a middle loop exited by the continue.
func TestMultiCont2(t *testing.T) {
var result []int
var expect = []int{1000, 10, 2, 4}
defer func() {
if r := recover(); r != nil {
if matchError(r, RERR_DONE) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v'", r)
}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
} else {
t.Errorf("Wanted to see a failure, result was %v", result)
}
}()
W:
for _, w := range OfSliceIndex([]int{1000, 2000}) {
result = append(result, w)
if w == 2000 {
break
}
for _, x := range OfSliceIndex([]int{100, 200, 300, 400}) {
for _, y := range BadOfSliceIndex([]int{10, 20, 30, 40}) {
result = append(result, y)
for _, z := range OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if z&1 == 1 {
continue
}
result = append(result, z)
if z >= 4 {
continue W
}
}
result = append(result, -y) // should never be executed
}
result = append(result, x)
}
}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
}
// TestMultiCont3 tests multilevel continue with a bad iterator
// in the innermost loop exited by the continue.
func TestMultiCont3(t *testing.T) {
var result []int
var expect = []int{1000, 10, 2, 4}
defer func() {
if r := recover(); r != nil {
if matchError(r, RERR_DONE) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v'", r)
}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
} else {
t.Errorf("Wanted to see a failure, result was %v", result)
}
}()
W:
for _, w := range OfSliceIndex([]int{1000, 2000}) {
result = append(result, w)
if w == 2000 {
break
}
for _, x := range OfSliceIndex([]int{100, 200, 300, 400}) {
for _, y := range OfSliceIndex([]int{10, 20, 30, 40}) {
result = append(result, y)
for _, z := range BadOfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if z&1 == 1 {
continue
}
result = append(result, z)
if z >= 4 {
continue W
}
}
result = append(result, -y) // should never be executed
}
result = append(result, x)
}
}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
}
// TestMultiBreak0 tests multilevel break with a bad iterator
// in the outermost loop exited by the break (the outermost loop).
func TestMultiBreak0(t *testing.T) {
var result []int
var expect = []int{1000, 10, 2, 4}
defer func() {
if r := recover(); r != nil {
if matchError(r, RERR_DONE) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v'", r)
}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
} else {
t.Errorf("Wanted to see a failure, result was %v", result)
}
}()
W:
for _, w := range BadOfSliceIndex([]int{1000, 2000}) {
result = append(result, w)
if w == 2000 {
break
}
for _, x := range OfSliceIndex([]int{100, 200, 300, 400}) {
for _, y := range OfSliceIndex([]int{10, 20, 30, 40}) {
result = append(result, y)
for _, z := range OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if z&1 == 1 {
continue
}
result = append(result, z)
if z >= 4 {
break W
}
}
result = append(result, -y) // should never be executed
}
result = append(result, x)
}
}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
}
// TestMultiBreak1 tests multilevel break with a bad iterator
// in an intermediate loop exited by the break.
func TestMultiBreak1(t *testing.T) {
var result []int
var expect = []int{1000, 10, 2, 4}
defer func() {
if r := recover(); r != nil {
if matchError(r, RERR_DONE) {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Errorf("Saw wrong panic '%v'", r)
}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
} else {
t.Errorf("Wanted to see a failure, result was %v", result)
}
}()
W:
for _, w := range OfSliceIndex([]int{1000, 2000}) {
result = append(result, w)
if w == 2000 {
break
}
for _, x := range BadOfSliceIndex([]int{100, 200, 300, 400}) {
for _, y := range OfSliceIndex([]int{10, 20, 30, 40}) {