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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
|
// 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.
//go:build goexperiment.rangefunc
package rangefunc_test
import (
"slices"
"testing"
)
type Seq2[T1, T2 any] func(yield func(T1, T2) bool)
// OfSliceIndex returns a Seq 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
}
}
// 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) 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)
}
}
// Check 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 Check[U, V any](forall Seq2[U, V]) Seq2[U, V] {
return func(body func(U, V) bool) {
ret := true
forall(func(u U, v V) bool {
if !ret {
panic("Checked iterator access after exit")
}
ret = body(u, v)
return ret
})
ret = false
}
}
func TestCheck(t *testing.T) {
i := 0
defer func() {
if r := recover(); r != nil {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Error("Wanted to see a failure")
}
}()
for _, x := range Check(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 {
t.Logf("Saw expected 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 TestCheckCooperativeBadOfSliceIndex(t *testing.T) {
i := 0
proceed := make(chan any)
for _, x := range Check(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 {
t.Logf("Saw expected 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 {
t.Logf("Saw expected 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 {
t.Logf("Saw expected 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 {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Error("Wanted to see a failure")
}
}()
trickItZero.fail()
}
func TestCheckTrickyIterZero(t *testing.T) {
trickItZero := TrickyIterator{}
i := 0
for _, x := range Check(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 {
t.Logf("Saw expected panic '%v'", r)
} else {
t.Error("Wanted to see a failure")
}
}()
trickItZero.fail()
}
// 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 {
t.Logf("Saw expected 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 {
t.Logf("Saw expected 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 {
t.Logf("Saw expected 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 {
t.Logf("Saw expected 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 {
t.Logf("Saw expected 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 {
t.Logf("Saw expected 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 {
t.Logf("Saw expected 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 {
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)
}
}
// TestMultiBreak2 tests multilevel break with two bad iterators
// in intermediate loops exited by the break.
func TestMultiBreak2(t *testing.T) {
var result []int
var expect = []int{1000, 10, 2, 4}
defer func() {
if r := recover(); r != nil {
t.Logf("Saw expected 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 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 {
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)
}
}
// TestMultiBreak3 tests multilevel break with the bad iterator
// in the innermost loop exited by the break.
func TestMultiBreak3(t *testing.T) {
var result []int
var expect = []int{1000, 10, 2, 4}
defer func() {
if r := recover(); r != nil {
t.Logf("Saw expected 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 {
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)
}
}
// veryBad tests that a loop nest behaves sensibly in the face of a
// "very bad" iterator. In this case, "sensibly" means that the
// break out of X still occurs after the very bad iterator finally
// quits running (the control flow bread crumbs remain.)
func veryBad(s []int) []int {
var result []int
X:
for _, x := range OfSliceIndex([]int{1, 2, 3}) {
result = append(result, x)
for _, y := range VeryBadOfSliceIndex(s) {
result = append(result, y)
break X
}
for _, z := range OfSliceIndex([]int{100, 200, 300}) {
result = append(result, z)
if z == 100 {
break
}
}
}
return result
}
// checkVeryBad wraps a "very bad" iterator with Check,
// demonstrating that the very bad iterator also hides panics
// thrown by Check.
func checkVeryBad(s []int) []int {
var result []int
X:
for _, x := range OfSliceIndex([]int{1, 2, 3}) {
result = append(result, x)
for _, y := range Check(VeryBadOfSliceIndex(s)) {
result = append(result, y)
break X
}
for _, z := range OfSliceIndex([]int{100, 200, 300}) {
result = append(result, z)
if z == 100 {
break
}
}
}
return result
}
// okay is the not-bad version of veryBad.
// They should behave the same.
func okay(s []int) []int {
var result []int
X:
for _, x := range OfSliceIndex([]int{1, 2, 3}) {
result = append(result, x)
for _, y := range OfSliceIndex(s) {
result = append(result, y)
break X
}
for _, z := range OfSliceIndex([]int{100, 200, 300}) {
result = append(result, z)
if z == 100 {
break
}
}
}
return result
}
// TestVeryBad1 checks the behavior of an extremely poorly behaved iterator.
func TestVeryBad1(t *testing.T) {
result := veryBad([]int{10, 20, 30, 40, 50}) // odd length
expect := []int{1, 10}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
}
// TestVeryBad2 checks the behavior of an extremely poorly behaved iterator.
func TestVeryBad2(t *testing.T) {
result := veryBad([]int{10, 20, 30, 40}) // even length
expect := []int{1, 10}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
}
// TestCheckVeryBad checks the behavior of an extremely poorly behaved iterator,
// which also suppresses the exceptions from "Check"
func TestCheckVeryBad(t *testing.T) {
result := checkVeryBad([]int{10, 20, 30, 40}) // even length
expect := []int{1, 10}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
}
// TestOk is the nice version of the very bad iterator.
func TestOk(t *testing.T) {
result := okay([]int{10, 20, 30, 40, 50}) // odd length
expect := []int{1, 10}
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
}
// testBreak1BadDefer checks that defer behaves properly even in
// the presence of loop bodies panicking out of bad iterators.
// (i.e., the instrumentation did not break defer in these loops)
func testBreak1BadDefer(t *testing.T) (result []int) {
var expect = []int{1, 2, -1, 1, 2, -2, 1, 2, -3, -30, -20, -10}
defer func() {
if r := recover(); r != nil {
t.Logf("Saw expected panic '%v'", r)
if !slices.Equal(expect, result) {
t.Errorf("(Inner) 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
}
defer func() {
result = append(result, x*10)
}()
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)
}
return
}
func TestBreak1BadDefer(t *testing.T) {
var result []int
var expect = []int{1, 2, -1, 1, 2, -2, 1, 2, -3, -30, -20, -10}
result = testBreak1BadDefer(t)
if !slices.Equal(expect, result) {
t.Errorf("(Outer) Expected %v, got %v", expect, result)
}
}
// testReturn1 has no bad iterators.
func testReturn1(t *testing.T) (result []int, err any) {
defer func() {
err = recover()
}()
for _, x := range OfSliceIndex([]int{-1, -2, -3, -4, -5}) {
result = append(result, x)
if x == -4 {
break
}
defer func() {
result = append(result, x*10)
}()
for _, y := range OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if y == 3 {
return
}
result = append(result, y)
}
result = append(result, x)
}
return
}
// testReturn2 has an outermost bad iterator
func testReturn2(t *testing.T) (result []int, err any) {
defer func() {
err = recover()
}()
for _, x := range BadOfSliceIndex([]int{-1, -2, -3, -4, -5}) {
result = append(result, x)
if x == -4 {
break
}
defer func() {
result = append(result, x*10)
}()
for _, y := range OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if y == 3 {
return
}
result = append(result, y)
}
result = append(result, x)
}
return
}
// testReturn3 has an innermost bad iterator
func testReturn3(t *testing.T) (result []int, err any) {
defer func() {
err = recover()
}()
for _, x := range OfSliceIndex([]int{-1, -2, -3, -4, -5}) {
result = append(result, x)
if x == -4 {
break
}
defer func() {
result = append(result, x*10)
}()
for _, y := range BadOfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if y == 3 {
return
}
result = append(result, y)
}
}
return
}
// TestReturns checks that returns through bad iterators behave properly,
// for inner and outer bad iterators.
func TestReturns(t *testing.T) {
var result []int
var expect = []int{-1, 1, 2, -10}
var err any
result, err = testReturn1(t)
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
if err != nil {
t.Errorf("Unexpected error %v", err)
}
result, err = testReturn2(t)
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
if err == nil {
t.Errorf("Missing expected error")
} else {
t.Logf("Saw expected panic '%v'", err)
}
result, err = testReturn3(t)
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
if err == nil {
t.Errorf("Missing expected error")
} else {
t.Logf("Saw expected panic '%v'", err)
}
}
// testGotoA1 tests loop-nest-internal goto, no bad iterators.
func testGotoA1(t *testing.T) (result []int, err any) {
defer func() {
err = recover()
}()
for _, x := range OfSliceIndex([]int{-1, -2, -3, -4, -5}) {
result = append(result, x)
if x == -4 {
break
}
defer func() {
result = append(result, x*10)
}()
for _, y := range OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if y == 3 {
goto A
}
result = append(result, y)
}
result = append(result, x)
A:
}
return
}
// testGotoA2 tests loop-nest-internal goto, outer bad iterator.
func testGotoA2(t *testing.T) (result []int, err any) {
defer func() {
err = recover()
}()
for _, x := range BadOfSliceIndex([]int{-1, -2, -3, -4, -5}) {
result = append(result, x)
if x == -4 {
break
}
defer func() {
result = append(result, x*10)
}()
for _, y := range OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if y == 3 {
goto A
}
result = append(result, y)
}
result = append(result, x)
A:
}
return
}
// testGotoA3 tests loop-nest-internal goto, inner bad iterator.
func testGotoA3(t *testing.T) (result []int, err any) {
defer func() {
err = recover()
}()
for _, x := range OfSliceIndex([]int{-1, -2, -3, -4, -5}) {
result = append(result, x)
if x == -4 {
break
}
defer func() {
result = append(result, x*10)
}()
for _, y := range BadOfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if y == 3 {
goto A
}
result = append(result, y)
}
result = append(result, x)
A:
}
return
}
func TestGotoA(t *testing.T) {
var result []int
var expect = []int{-1, 1, 2, -2, 1, 2, -3, 1, 2, -4, -30, -20, -10}
var expect3 = []int{-1, 1, 2, -10} // first goto becomes a panic
var err any
result, err = testGotoA1(t)
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
if err != nil {
t.Errorf("Unexpected error %v", err)
}
result, err = testGotoA2(t)
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
if err == nil {
t.Errorf("Missing expected error")
} else {
t.Logf("Saw expected panic '%v'", err)
}
result, err = testGotoA3(t)
if !slices.Equal(expect3, result) {
t.Errorf("Expected %v, got %v", expect3, result)
}
if err == nil {
t.Errorf("Missing expected error")
} else {
t.Logf("Saw expected panic '%v'", err)
}
}
// testGotoB1 tests loop-nest-exiting goto, no bad iterators.
func testGotoB1(t *testing.T) (result []int, err any) {
defer func() {
err = recover()
}()
for _, x := range OfSliceIndex([]int{-1, -2, -3, -4, -5}) {
result = append(result, x)
if x == -4 {
break
}
defer func() {
result = append(result, x*10)
}()
for _, y := range OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if y == 3 {
goto B
}
result = append(result, y)
}
result = append(result, x)
}
B:
result = append(result, 999)
return
}
// testGotoB2 tests loop-nest-exiting goto, outer bad iterator.
func testGotoB2(t *testing.T) (result []int, err any) {
defer func() {
err = recover()
}()
for _, x := range BadOfSliceIndex([]int{-1, -2, -3, -4, -5}) {
result = append(result, x)
if x == -4 {
break
}
defer func() {
result = append(result, x*10)
}()
for _, y := range OfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if y == 3 {
goto B
}
result = append(result, y)
}
result = append(result, x)
}
B:
result = append(result, 999)
return
}
// testGotoB3 tests loop-nest-exiting goto, inner bad iterator.
func testGotoB3(t *testing.T) (result []int, err any) {
defer func() {
err = recover()
}()
for _, x := range OfSliceIndex([]int{-1, -2, -3, -4, -5}) {
result = append(result, x)
if x == -4 {
break
}
defer func() {
result = append(result, x*10)
}()
for _, y := range BadOfSliceIndex([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}) {
if y == 3 {
goto B
}
result = append(result, y)
}
result = append(result, x)
}
B:
result = append(result, 999)
return
}
func TestGotoB(t *testing.T) {
var result []int
var expect = []int{-1, 1, 2, 999, -10}
var expectX = []int{-1, 1, 2, -10}
var err any
result, err = testGotoB1(t)
if !slices.Equal(expect, result) {
t.Errorf("Expected %v, got %v", expect, result)
}
if err != nil {
t.Errorf("Unexpected error %v", err)
}
result, err = testGotoB2(t)
if !slices.Equal(expectX, result) {
t.Errorf("Expected %v, got %v", expectX, result)
}
if err == nil {
t.Errorf("Missing expected error")
} else {
t.Logf("Saw expected panic '%v'", err)
}
result, err = testGotoB3(t)
if !slices.Equal(expectX, result) {
t.Errorf("Expected %v, got %v", expectX, result)
}
if err == nil {
t.Errorf("Missing expected error")
} else {
t.Logf("Saw expected panic '%v'", err)
}
}
|