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
|
-- THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS
-- [loops]: function definitions
import Base
import Loops.Types
open Primitives
namespace loops
/- [loops::sum]: loop 0: forward function -/
divergent def sum_loop (max : U32) (i : U32) (s : U32) : Result U32 :=
if i < max
then do
let s0 ← s + i
let i0 ← i + 1#u32
sum_loop max i0 s0
else s * 2#u32
/- [loops::sum]: forward function -/
def sum (max : U32) : Result U32 :=
sum_loop max 0#u32 0#u32
/- [loops::sum_with_mut_borrows]: loop 0: forward function -/
divergent def sum_with_mut_borrows_loop
(max : U32) (mi : U32) (ms : U32) : Result U32 :=
if mi < max
then
do
let ms0 ← ms + mi
let mi0 ← mi + 1#u32
sum_with_mut_borrows_loop max mi0 ms0
else ms * 2#u32
/- [loops::sum_with_mut_borrows]: forward function -/
def sum_with_mut_borrows (max : U32) : Result U32 :=
sum_with_mut_borrows_loop max 0#u32 0#u32
/- [loops::sum_with_shared_borrows]: loop 0: forward function -/
divergent def sum_with_shared_borrows_loop
(max : U32) (i : U32) (s : U32) : Result U32 :=
if i < max
then
do
let i0 ← i + 1#u32
let s0 ← s + i0
sum_with_shared_borrows_loop max i0 s0
else s * 2#u32
/- [loops::sum_with_shared_borrows]: forward function -/
def sum_with_shared_borrows (max : U32) : Result U32 :=
sum_with_shared_borrows_loop max 0#u32 0#u32
/- [loops::clear]: loop 0: merged forward/backward function
(there is a single backward function, and the forward function returns ()) -/
divergent def clear_loop
(v : alloc.vec.Vec U32) (i : Usize) : Result (alloc.vec.Vec U32) :=
let i0 := alloc.vec.Vec.len U32 v
if i < i0
then
do
let i1 ← i + 1#usize
let v0 ←
alloc.vec.Vec.index_mut_back U32 Usize
(core.slice.index.usize.coresliceindexSliceIndexInst U32) v i 0#u32
clear_loop v0 i1
else Result.ret v
/- [loops::clear]: merged forward/backward function
(there is a single backward function, and the forward function returns ()) -/
def clear (v : alloc.vec.Vec U32) : Result (alloc.vec.Vec U32) :=
clear_loop v 0#usize
/- [loops::list_mem]: loop 0: forward function -/
divergent def list_mem_loop (x : U32) (ls : List U32) : Result Bool :=
match ls with
| List.Cons y tl => if y = x
then Result.ret true
else list_mem_loop x tl
| List.Nil => Result.ret false
/- [loops::list_mem]: forward function -/
def list_mem (x : U32) (ls : List U32) : Result Bool :=
list_mem_loop x ls
/- [loops::list_nth_mut_loop]: loop 0: forward function -/
divergent def list_nth_mut_loop_loop
(T : Type) (ls : List T) (i : U32) : Result T :=
match ls with
| List.Cons x tl =>
if i = 0#u32
then Result.ret x
else do
let i0 ← i - 1#u32
list_nth_mut_loop_loop T tl i0
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_mut_loop]: forward function -/
def list_nth_mut_loop (T : Type) (ls : List T) (i : U32) : Result T :=
list_nth_mut_loop_loop T ls i
/- [loops::list_nth_mut_loop]: loop 0: backward function 0 -/
divergent def list_nth_mut_loop_loop_back
(T : Type) (ls : List T) (i : U32) (ret0 : T) : Result (List T) :=
match ls with
| List.Cons x tl =>
if i = 0#u32
then Result.ret (List.Cons ret0 tl)
else
do
let i0 ← i - 1#u32
let tl0 ← list_nth_mut_loop_loop_back T tl i0 ret0
Result.ret (List.Cons x tl0)
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_mut_loop]: backward function 0 -/
def list_nth_mut_loop_back
(T : Type) (ls : List T) (i : U32) (ret0 : T) : Result (List T) :=
list_nth_mut_loop_loop_back T ls i ret0
/- [loops::list_nth_shared_loop]: loop 0: forward function -/
divergent def list_nth_shared_loop_loop
(T : Type) (ls : List T) (i : U32) : Result T :=
match ls with
| List.Cons x tl =>
if i = 0#u32
then Result.ret x
else do
let i0 ← i - 1#u32
list_nth_shared_loop_loop T tl i0
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_shared_loop]: forward function -/
def list_nth_shared_loop (T : Type) (ls : List T) (i : U32) : Result T :=
list_nth_shared_loop_loop T ls i
/- [loops::get_elem_mut]: loop 0: forward function -/
divergent def get_elem_mut_loop (x : Usize) (ls : List Usize) : Result Usize :=
match ls with
| List.Cons y tl => if y = x
then Result.ret y
else get_elem_mut_loop x tl
| List.Nil => Result.fail Error.panic
/- [loops::get_elem_mut]: forward function -/
def get_elem_mut
(slots : alloc.vec.Vec (List Usize)) (x : Usize) : Result Usize :=
do
let l ←
alloc.vec.Vec.index_mut (List Usize) Usize
(core.slice.index.usize.coresliceindexSliceIndexInst (List Usize))
slots 0#usize
get_elem_mut_loop x l
/- [loops::get_elem_mut]: loop 0: backward function 0 -/
divergent def get_elem_mut_loop_back
(x : Usize) (ls : List Usize) (ret0 : Usize) : Result (List Usize) :=
match ls with
| List.Cons y tl =>
if y = x
then Result.ret (List.Cons ret0 tl)
else
do
let tl0 ← get_elem_mut_loop_back x tl ret0
Result.ret (List.Cons y tl0)
| List.Nil => Result.fail Error.panic
/- [loops::get_elem_mut]: backward function 0 -/
def get_elem_mut_back
(slots : alloc.vec.Vec (List Usize)) (x : Usize) (ret0 : Usize) :
Result (alloc.vec.Vec (List Usize))
:=
do
let l ←
alloc.vec.Vec.index_mut (List Usize) Usize
(core.slice.index.usize.coresliceindexSliceIndexInst (List Usize))
slots 0#usize
let l0 ← get_elem_mut_loop_back x l ret0
alloc.vec.Vec.index_mut_back (List Usize) Usize
(core.slice.index.usize.coresliceindexSliceIndexInst (List Usize)) slots
0#usize l0
/- [loops::get_elem_shared]: loop 0: forward function -/
divergent def get_elem_shared_loop
(x : Usize) (ls : List Usize) : Result Usize :=
match ls with
| List.Cons y tl => if y = x
then Result.ret y
else get_elem_shared_loop x tl
| List.Nil => Result.fail Error.panic
/- [loops::get_elem_shared]: forward function -/
def get_elem_shared
(slots : alloc.vec.Vec (List Usize)) (x : Usize) : Result Usize :=
do
let l ←
alloc.vec.Vec.index (List Usize) Usize
(core.slice.index.usize.coresliceindexSliceIndexInst (List Usize))
slots 0#usize
get_elem_shared_loop x l
/- [loops::id_mut]: forward function -/
def id_mut (T : Type) (ls : List T) : Result (List T) :=
Result.ret ls
/- [loops::id_mut]: backward function 0 -/
def id_mut_back (T : Type) (ls : List T) (ret0 : List T) : Result (List T) :=
Result.ret ret0
/- [loops::id_shared]: forward function -/
def id_shared (T : Type) (ls : List T) : Result (List T) :=
Result.ret ls
/- [loops::list_nth_mut_loop_with_id]: loop 0: forward function -/
divergent def list_nth_mut_loop_with_id_loop
(T : Type) (i : U32) (ls : List T) : Result T :=
match ls with
| List.Cons x tl =>
if i = 0#u32
then Result.ret x
else do
let i0 ← i - 1#u32
list_nth_mut_loop_with_id_loop T i0 tl
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_mut_loop_with_id]: forward function -/
def list_nth_mut_loop_with_id (T : Type) (ls : List T) (i : U32) : Result T :=
do
let ls0 ← id_mut T ls
list_nth_mut_loop_with_id_loop T i ls0
/- [loops::list_nth_mut_loop_with_id]: loop 0: backward function 0 -/
divergent def list_nth_mut_loop_with_id_loop_back
(T : Type) (i : U32) (ls : List T) (ret0 : T) : Result (List T) :=
match ls with
| List.Cons x tl =>
if i = 0#u32
then Result.ret (List.Cons ret0 tl)
else
do
let i0 ← i - 1#u32
let tl0 ← list_nth_mut_loop_with_id_loop_back T i0 tl ret0
Result.ret (List.Cons x tl0)
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_mut_loop_with_id]: backward function 0 -/
def list_nth_mut_loop_with_id_back
(T : Type) (ls : List T) (i : U32) (ret0 : T) : Result (List T) :=
do
let ls0 ← id_mut T ls
let l ← list_nth_mut_loop_with_id_loop_back T i ls0 ret0
id_mut_back T ls l
/- [loops::list_nth_shared_loop_with_id]: loop 0: forward function -/
divergent def list_nth_shared_loop_with_id_loop
(T : Type) (i : U32) (ls : List T) : Result T :=
match ls with
| List.Cons x tl =>
if i = 0#u32
then Result.ret x
else do
let i0 ← i - 1#u32
list_nth_shared_loop_with_id_loop T i0 tl
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_shared_loop_with_id]: forward function -/
def list_nth_shared_loop_with_id
(T : Type) (ls : List T) (i : U32) : Result T :=
do
let ls0 ← id_shared T ls
list_nth_shared_loop_with_id_loop T i ls0
/- [loops::list_nth_mut_loop_pair]: loop 0: forward function -/
divergent def list_nth_mut_loop_pair_loop
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
match ls0 with
| List.Cons x0 tl0 =>
match ls1 with
| List.Cons x1 tl1 =>
if i = 0#u32
then Result.ret (x0, x1)
else do
let i0 ← i - 1#u32
list_nth_mut_loop_pair_loop T tl0 tl1 i0
| List.Nil => Result.fail Error.panic
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_mut_loop_pair]: forward function -/
def list_nth_mut_loop_pair
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
list_nth_mut_loop_pair_loop T ls0 ls1 i
/- [loops::list_nth_mut_loop_pair]: loop 0: backward function 0 -/
divergent def list_nth_mut_loop_pair_loop_back'a
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) (ret0 : T) :
Result (List T)
:=
match ls0 with
| List.Cons x0 tl0 =>
match ls1 with
| List.Cons x1 tl1 =>
if i = 0#u32
then Result.ret (List.Cons ret0 tl0)
else
do
let i0 ← i - 1#u32
let tl00 ← list_nth_mut_loop_pair_loop_back'a T tl0 tl1 i0 ret0
Result.ret (List.Cons x0 tl00)
| List.Nil => Result.fail Error.panic
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_mut_loop_pair]: backward function 0 -/
def list_nth_mut_loop_pair_back'a
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) (ret0 : T) :
Result (List T)
:=
list_nth_mut_loop_pair_loop_back'a T ls0 ls1 i ret0
/- [loops::list_nth_mut_loop_pair]: loop 0: backward function 1 -/
divergent def list_nth_mut_loop_pair_loop_back'b
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) (ret0 : T) :
Result (List T)
:=
match ls0 with
| List.Cons x0 tl0 =>
match ls1 with
| List.Cons x1 tl1 =>
if i = 0#u32
then Result.ret (List.Cons ret0 tl1)
else
do
let i0 ← i - 1#u32
let tl10 ← list_nth_mut_loop_pair_loop_back'b T tl0 tl1 i0 ret0
Result.ret (List.Cons x1 tl10)
| List.Nil => Result.fail Error.panic
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_mut_loop_pair]: backward function 1 -/
def list_nth_mut_loop_pair_back'b
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) (ret0 : T) :
Result (List T)
:=
list_nth_mut_loop_pair_loop_back'b T ls0 ls1 i ret0
/- [loops::list_nth_shared_loop_pair]: loop 0: forward function -/
divergent def list_nth_shared_loop_pair_loop
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
match ls0 with
| List.Cons x0 tl0 =>
match ls1 with
| List.Cons x1 tl1 =>
if i = 0#u32
then Result.ret (x0, x1)
else do
let i0 ← i - 1#u32
list_nth_shared_loop_pair_loop T tl0 tl1 i0
| List.Nil => Result.fail Error.panic
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_shared_loop_pair]: forward function -/
def list_nth_shared_loop_pair
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
list_nth_shared_loop_pair_loop T ls0 ls1 i
/- [loops::list_nth_mut_loop_pair_merge]: loop 0: forward function -/
divergent def list_nth_mut_loop_pair_merge_loop
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
match ls0 with
| List.Cons x0 tl0 =>
match ls1 with
| List.Cons x1 tl1 =>
if i = 0#u32
then Result.ret (x0, x1)
else
do
let i0 ← i - 1#u32
list_nth_mut_loop_pair_merge_loop T tl0 tl1 i0
| List.Nil => Result.fail Error.panic
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_mut_loop_pair_merge]: forward function -/
def list_nth_mut_loop_pair_merge
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
list_nth_mut_loop_pair_merge_loop T ls0 ls1 i
/- [loops::list_nth_mut_loop_pair_merge]: loop 0: backward function 0 -/
divergent def list_nth_mut_loop_pair_merge_loop_back
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) (ret0 : (T × T)) :
Result ((List T) × (List T))
:=
match ls0 with
| List.Cons x0 tl0 =>
match ls1 with
| List.Cons x1 tl1 =>
if i = 0#u32
then let (t, t0) := ret0
Result.ret (List.Cons t tl0, List.Cons t0 tl1)
else
do
let i0 ← i - 1#u32
let (tl00, tl10) ←
list_nth_mut_loop_pair_merge_loop_back T tl0 tl1 i0 ret0
Result.ret (List.Cons x0 tl00, List.Cons x1 tl10)
| List.Nil => Result.fail Error.panic
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_mut_loop_pair_merge]: backward function 0 -/
def list_nth_mut_loop_pair_merge_back
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) (ret0 : (T × T)) :
Result ((List T) × (List T))
:=
list_nth_mut_loop_pair_merge_loop_back T ls0 ls1 i ret0
/- [loops::list_nth_shared_loop_pair_merge]: loop 0: forward function -/
divergent def list_nth_shared_loop_pair_merge_loop
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
match ls0 with
| List.Cons x0 tl0 =>
match ls1 with
| List.Cons x1 tl1 =>
if i = 0#u32
then Result.ret (x0, x1)
else
do
let i0 ← i - 1#u32
list_nth_shared_loop_pair_merge_loop T tl0 tl1 i0
| List.Nil => Result.fail Error.panic
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_shared_loop_pair_merge]: forward function -/
def list_nth_shared_loop_pair_merge
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
list_nth_shared_loop_pair_merge_loop T ls0 ls1 i
/- [loops::list_nth_mut_shared_loop_pair]: loop 0: forward function -/
divergent def list_nth_mut_shared_loop_pair_loop
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
match ls0 with
| List.Cons x0 tl0 =>
match ls1 with
| List.Cons x1 tl1 =>
if i = 0#u32
then Result.ret (x0, x1)
else
do
let i0 ← i - 1#u32
list_nth_mut_shared_loop_pair_loop T tl0 tl1 i0
| List.Nil => Result.fail Error.panic
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_mut_shared_loop_pair]: forward function -/
def list_nth_mut_shared_loop_pair
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
list_nth_mut_shared_loop_pair_loop T ls0 ls1 i
/- [loops::list_nth_mut_shared_loop_pair]: loop 0: backward function 0 -/
divergent def list_nth_mut_shared_loop_pair_loop_back
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) (ret0 : T) :
Result (List T)
:=
match ls0 with
| List.Cons x0 tl0 =>
match ls1 with
| List.Cons x1 tl1 =>
if i = 0#u32
then Result.ret (List.Cons ret0 tl0)
else
do
let i0 ← i - 1#u32
let tl00 ←
list_nth_mut_shared_loop_pair_loop_back T tl0 tl1 i0 ret0
Result.ret (List.Cons x0 tl00)
| List.Nil => Result.fail Error.panic
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_mut_shared_loop_pair]: backward function 0 -/
def list_nth_mut_shared_loop_pair_back
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) (ret0 : T) :
Result (List T)
:=
list_nth_mut_shared_loop_pair_loop_back T ls0 ls1 i ret0
/- [loops::list_nth_mut_shared_loop_pair_merge]: loop 0: forward function -/
divergent def list_nth_mut_shared_loop_pair_merge_loop
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
match ls0 with
| List.Cons x0 tl0 =>
match ls1 with
| List.Cons x1 tl1 =>
if i = 0#u32
then Result.ret (x0, x1)
else
do
let i0 ← i - 1#u32
list_nth_mut_shared_loop_pair_merge_loop T tl0 tl1 i0
| List.Nil => Result.fail Error.panic
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_mut_shared_loop_pair_merge]: forward function -/
def list_nth_mut_shared_loop_pair_merge
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
list_nth_mut_shared_loop_pair_merge_loop T ls0 ls1 i
/- [loops::list_nth_mut_shared_loop_pair_merge]: loop 0: backward function 0 -/
divergent def list_nth_mut_shared_loop_pair_merge_loop_back
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) (ret0 : T) :
Result (List T)
:=
match ls0 with
| List.Cons x0 tl0 =>
match ls1 with
| List.Cons x1 tl1 =>
if i = 0#u32
then Result.ret (List.Cons ret0 tl0)
else
do
let i0 ← i - 1#u32
let tl00 ←
list_nth_mut_shared_loop_pair_merge_loop_back T tl0 tl1 i0 ret0
Result.ret (List.Cons x0 tl00)
| List.Nil => Result.fail Error.panic
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_mut_shared_loop_pair_merge]: backward function 0 -/
def list_nth_mut_shared_loop_pair_merge_back
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) (ret0 : T) :
Result (List T)
:=
list_nth_mut_shared_loop_pair_merge_loop_back T ls0 ls1 i ret0
/- [loops::list_nth_shared_mut_loop_pair]: loop 0: forward function -/
divergent def list_nth_shared_mut_loop_pair_loop
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
match ls0 with
| List.Cons x0 tl0 =>
match ls1 with
| List.Cons x1 tl1 =>
if i = 0#u32
then Result.ret (x0, x1)
else
do
let i0 ← i - 1#u32
list_nth_shared_mut_loop_pair_loop T tl0 tl1 i0
| List.Nil => Result.fail Error.panic
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_shared_mut_loop_pair]: forward function -/
def list_nth_shared_mut_loop_pair
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
list_nth_shared_mut_loop_pair_loop T ls0 ls1 i
/- [loops::list_nth_shared_mut_loop_pair]: loop 0: backward function 1 -/
divergent def list_nth_shared_mut_loop_pair_loop_back
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) (ret0 : T) :
Result (List T)
:=
match ls0 with
| List.Cons x0 tl0 =>
match ls1 with
| List.Cons x1 tl1 =>
if i = 0#u32
then Result.ret (List.Cons ret0 tl1)
else
do
let i0 ← i - 1#u32
let tl10 ←
list_nth_shared_mut_loop_pair_loop_back T tl0 tl1 i0 ret0
Result.ret (List.Cons x1 tl10)
| List.Nil => Result.fail Error.panic
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_shared_mut_loop_pair]: backward function 1 -/
def list_nth_shared_mut_loop_pair_back
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) (ret0 : T) :
Result (List T)
:=
list_nth_shared_mut_loop_pair_loop_back T ls0 ls1 i ret0
/- [loops::list_nth_shared_mut_loop_pair_merge]: loop 0: forward function -/
divergent def list_nth_shared_mut_loop_pair_merge_loop
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
match ls0 with
| List.Cons x0 tl0 =>
match ls1 with
| List.Cons x1 tl1 =>
if i = 0#u32
then Result.ret (x0, x1)
else
do
let i0 ← i - 1#u32
list_nth_shared_mut_loop_pair_merge_loop T tl0 tl1 i0
| List.Nil => Result.fail Error.panic
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_shared_mut_loop_pair_merge]: forward function -/
def list_nth_shared_mut_loop_pair_merge
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
list_nth_shared_mut_loop_pair_merge_loop T ls0 ls1 i
/- [loops::list_nth_shared_mut_loop_pair_merge]: loop 0: backward function 0 -/
divergent def list_nth_shared_mut_loop_pair_merge_loop_back
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) (ret0 : T) :
Result (List T)
:=
match ls0 with
| List.Cons x0 tl0 =>
match ls1 with
| List.Cons x1 tl1 =>
if i = 0#u32
then Result.ret (List.Cons ret0 tl1)
else
do
let i0 ← i - 1#u32
let tl10 ←
list_nth_shared_mut_loop_pair_merge_loop_back T tl0 tl1 i0 ret0
Result.ret (List.Cons x1 tl10)
| List.Nil => Result.fail Error.panic
| List.Nil => Result.fail Error.panic
/- [loops::list_nth_shared_mut_loop_pair_merge]: backward function 0 -/
def list_nth_shared_mut_loop_pair_merge_back
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) (ret0 : T) :
Result (List T)
:=
list_nth_shared_mut_loop_pair_merge_loop_back T ls0 ls1 i ret0
end loops
|