summaryrefslogtreecommitdiff
path: root/tests/coq
diff options
context:
space:
mode:
Diffstat (limited to '')
-rw-r--r--tests/coq/arrays/Arrays.v130
-rw-r--r--tests/coq/betree/Betree_Funs.v (renamed from tests/coq/betree/BetreeMain_Funs.v)92
-rw-r--r--tests/coq/betree/Betree_FunsExternal.v (renamed from tests/coq/betree/BetreeMain_FunsExternal.v)8
-rw-r--r--tests/coq/betree/Betree_FunsExternal_Template.v (renamed from tests/coq/betree/BetreeMain_FunsExternal_Template.v)18
-rw-r--r--tests/coq/betree/Betree_Types.v (renamed from tests/coq/betree/BetreeMain_Types.v)28
-rw-r--r--tests/coq/betree/Betree_TypesExternal.v (renamed from tests/coq/betree/BetreeMain_TypesExternal.v)4
-rw-r--r--tests/coq/betree/Betree_TypesExternal_Template.v (renamed from tests/coq/betree/BetreeMain_TypesExternal_Template.v)6
-rw-r--r--tests/coq/betree/_CoqProject12
-rw-r--r--tests/coq/demo/Demo.v32
-rw-r--r--tests/coq/hashmap/Hashmap_Funs.v72
-rw-r--r--tests/coq/hashmap/Hashmap_FunsExternal.v21
-rw-r--r--tests/coq/hashmap/Hashmap_FunsExternal_Template.v22
-rw-r--r--tests/coq/hashmap/Hashmap_Types.v6
-rw-r--r--tests/coq/hashmap/Hashmap_TypesExternal.v (renamed from tests/coq/hashmap_on_disk/HashmapMain_TypesExternal.v)7
-rw-r--r--tests/coq/hashmap/Hashmap_TypesExternal_Template.v (renamed from tests/coq/hashmap_on_disk/HashmapMain_TypesExternal_Template.v)6
-rw-r--r--tests/coq/hashmap_on_disk/HashmapMain_Funs.v589
-rw-r--r--tests/coq/hashmap_on_disk/HashmapMain_FunsExternal.v24
-rw-r--r--tests/coq/hashmap_on_disk/HashmapMain_FunsExternal_Template.v26
-rw-r--r--tests/coq/hashmap_on_disk/HashmapMain_Types.v40
-rw-r--r--tests/coq/hashmap_on_disk/Makefile23
-rw-r--r--tests/coq/hashmap_on_disk/Primitives.v981
-rw-r--r--tests/coq/hashmap_on_disk/_CoqProject12
-rw-r--r--tests/coq/misc/Bitwise.v10
-rw-r--r--tests/coq/misc/Constants.v62
-rw-r--r--tests/coq/misc/External_Funs.v4
-rw-r--r--tests/coq/misc/InfiniteLoop.v27
-rw-r--r--tests/coq/misc/Issue194RecursiveStructProjector.v54
-rw-r--r--tests/coq/misc/Loops.v98
-rw-r--r--tests/coq/misc/NoNestedBorrows.v128
-rw-r--r--tests/coq/misc/Paper.v18
-rw-r--r--tests/coq/misc/PoloniusList.v4
-rw-r--r--tests/coq/traits/Traits.v166
32 files changed, 586 insertions, 2144 deletions
diff --git a/tests/coq/arrays/Arrays.v b/tests/coq/arrays/Arrays.v
index 35dea58c..6e4ab188 100644
--- a/tests/coq/arrays/Arrays.v
+++ b/tests/coq/arrays/Arrays.v
@@ -9,23 +9,23 @@ Local Open Scope Primitives_scope.
Module Arrays.
(** [arrays::AB]
- Source: 'tests/src/arrays.rs', lines 3:0-3:11 *)
+ Source: 'tests/src/arrays.rs', lines 6:0-6:11 *)
Inductive AB_t := | AB_A : AB_t | AB_B : AB_t.
(** [arrays::incr]:
- Source: 'tests/src/arrays.rs', lines 8:0-8:24 *)
+ Source: 'tests/src/arrays.rs', lines 11:0-11:24 *)
Definition incr (x : u32) : result u32 :=
u32_add x 1%u32.
(** [arrays::array_to_shared_slice_]:
- Source: 'tests/src/arrays.rs', lines 16:0-16:53 *)
+ Source: 'tests/src/arrays.rs', lines 19:0-19:53 *)
Definition array_to_shared_slice_
(T : Type) (s : array T 32%usize) : result (slice T) :=
array_to_slice T 32%usize s
.
(** [arrays::array_to_mut_slice_]:
- Source: 'tests/src/arrays.rs', lines 21:0-21:58 *)
+ Source: 'tests/src/arrays.rs', lines 24:0-24:58 *)
Definition array_to_mut_slice_
(T : Type) (s : array T 32%usize) :
result ((slice T) * (slice T -> result (array T 32%usize)))
@@ -34,44 +34,44 @@ Definition array_to_mut_slice_
.
(** [arrays::array_len]:
- Source: 'tests/src/arrays.rs', lines 25:0-25:40 *)
+ Source: 'tests/src/arrays.rs', lines 28:0-28:40 *)
Definition array_len (T : Type) (s : array T 32%usize) : result usize :=
s1 <- array_to_slice T 32%usize s; Ok (slice_len T s1)
.
(** [arrays::shared_array_len]:
- Source: 'tests/src/arrays.rs', lines 29:0-29:48 *)
+ Source: 'tests/src/arrays.rs', lines 32:0-32:48 *)
Definition shared_array_len (T : Type) (s : array T 32%usize) : result usize :=
s1 <- array_to_slice T 32%usize s; Ok (slice_len T s1)
.
(** [arrays::shared_slice_len]:
- Source: 'tests/src/arrays.rs', lines 33:0-33:44 *)
+ Source: 'tests/src/arrays.rs', lines 36:0-36:44 *)
Definition shared_slice_len (T : Type) (s : slice T) : result usize :=
Ok (slice_len T s)
.
(** [arrays::index_array_shared]:
- Source: 'tests/src/arrays.rs', lines 37:0-37:57 *)
+ Source: 'tests/src/arrays.rs', lines 40:0-40:57 *)
Definition index_array_shared
(T : Type) (s : array T 32%usize) (i : usize) : result T :=
array_index_usize T 32%usize s i
.
(** [arrays::index_array_u32]:
- Source: 'tests/src/arrays.rs', lines 44:0-44:53 *)
+ Source: 'tests/src/arrays.rs', lines 47:0-47:53 *)
Definition index_array_u32 (s : array u32 32%usize) (i : usize) : result u32 :=
array_index_usize u32 32%usize s i
.
(** [arrays::index_array_copy]:
- Source: 'tests/src/arrays.rs', lines 48:0-48:45 *)
+ Source: 'tests/src/arrays.rs', lines 51:0-51:45 *)
Definition index_array_copy (x : array u32 32%usize) : result u32 :=
array_index_usize u32 32%usize x 0%usize
.
(** [arrays::index_mut_array]:
- Source: 'tests/src/arrays.rs', lines 52:0-52:62 *)
+ Source: 'tests/src/arrays.rs', lines 55:0-55:62 *)
Definition index_mut_array
(T : Type) (s : array T 32%usize) (i : usize) :
result (T * (T -> result (array T 32%usize)))
@@ -80,13 +80,13 @@ Definition index_mut_array
.
(** [arrays::index_slice]:
- Source: 'tests/src/arrays.rs', lines 56:0-56:46 *)
+ Source: 'tests/src/arrays.rs', lines 59:0-59:46 *)
Definition index_slice (T : Type) (s : slice T) (i : usize) : result T :=
slice_index_usize T s i
.
(** [arrays::index_mut_slice]:
- Source: 'tests/src/arrays.rs', lines 60:0-60:58 *)
+ Source: 'tests/src/arrays.rs', lines 63:0-63:58 *)
Definition index_mut_slice
(T : Type) (s : slice T) (i : usize) :
result (T * (T -> result (slice T)))
@@ -95,7 +95,7 @@ Definition index_mut_slice
.
(** [arrays::slice_subslice_shared_]:
- Source: 'tests/src/arrays.rs', lines 64:0-64:70 *)
+ Source: 'tests/src/arrays.rs', lines 67:0-67:70 *)
Definition slice_subslice_shared_
(x : slice u32) (y : usize) (z : usize) : result (slice u32) :=
core_slice_index_Slice_index u32 (core_ops_range_Range usize)
@@ -104,7 +104,7 @@ Definition slice_subslice_shared_
.
(** [arrays::slice_subslice_mut_]:
- Source: 'tests/src/arrays.rs', lines 68:0-68:75 *)
+ Source: 'tests/src/arrays.rs', lines 71:0-71:75 *)
Definition slice_subslice_mut_
(x : slice u32) (y : usize) (z : usize) :
result ((slice u32) * (slice u32 -> result (slice u32)))
@@ -118,14 +118,14 @@ Definition slice_subslice_mut_
.
(** [arrays::array_to_slice_shared_]:
- Source: 'tests/src/arrays.rs', lines 72:0-72:54 *)
+ Source: 'tests/src/arrays.rs', lines 75:0-75:54 *)
Definition array_to_slice_shared_
(x : array u32 32%usize) : result (slice u32) :=
array_to_slice u32 32%usize x
.
(** [arrays::array_to_slice_mut_]:
- Source: 'tests/src/arrays.rs', lines 76:0-76:59 *)
+ Source: 'tests/src/arrays.rs', lines 79:0-79:59 *)
Definition array_to_slice_mut_
(x : array u32 32%usize) :
result ((slice u32) * (slice u32 -> result (array u32 32%usize)))
@@ -134,7 +134,7 @@ Definition array_to_slice_mut_
.
(** [arrays::array_subslice_shared_]:
- Source: 'tests/src/arrays.rs', lines 80:0-80:74 *)
+ Source: 'tests/src/arrays.rs', lines 83:0-83:74 *)
Definition array_subslice_shared_
(x : array u32 32%usize) (y : usize) (z : usize) : result (slice u32) :=
core_array_Array_index u32 (core_ops_range_Range usize) 32%usize
@@ -144,7 +144,7 @@ Definition array_subslice_shared_
.
(** [arrays::array_subslice_mut_]:
- Source: 'tests/src/arrays.rs', lines 84:0-84:79 *)
+ Source: 'tests/src/arrays.rs', lines 87:0-87:79 *)
Definition array_subslice_mut_
(x : array u32 32%usize) (y : usize) (z : usize) :
result ((slice u32) * (slice u32 -> result (array u32 32%usize)))
@@ -159,19 +159,19 @@ Definition array_subslice_mut_
.
(** [arrays::index_slice_0]:
- Source: 'tests/src/arrays.rs', lines 88:0-88:38 *)
+ Source: 'tests/src/arrays.rs', lines 91:0-91:38 *)
Definition index_slice_0 (T : Type) (s : slice T) : result T :=
slice_index_usize T s 0%usize
.
(** [arrays::index_array_0]:
- Source: 'tests/src/arrays.rs', lines 92:0-92:42 *)
+ Source: 'tests/src/arrays.rs', lines 95:0-95:42 *)
Definition index_array_0 (T : Type) (s : array T 32%usize) : result T :=
array_index_usize T 32%usize s 0%usize
.
(** [arrays::index_index_array]:
- Source: 'tests/src/arrays.rs', lines 103:0-103:71 *)
+ Source: 'tests/src/arrays.rs', lines 106:0-106:71 *)
Definition index_index_array
(s : array (array u32 32%usize) 32%usize) (i : usize) (j : usize) :
result u32
@@ -181,7 +181,7 @@ Definition index_index_array
.
(** [arrays::update_update_array]:
- Source: 'tests/src/arrays.rs', lines 114:0-114:70 *)
+ Source: 'tests/src/arrays.rs', lines 117:0-117:70 *)
Definition update_update_array
(s : array (array u32 32%usize) 32%usize) (i : usize) (j : usize) :
result unit
@@ -196,46 +196,46 @@ Definition update_update_array
.
(** [arrays::array_local_deep_copy]:
- Source: 'tests/src/arrays.rs', lines 118:0-118:43 *)
+ Source: 'tests/src/arrays.rs', lines 121:0-121:43 *)
Definition array_local_deep_copy (x : array u32 32%usize) : result unit :=
Ok tt
.
(** [arrays::take_array]:
- Source: 'tests/src/arrays.rs', lines 122:0-122:30 *)
+ Source: 'tests/src/arrays.rs', lines 125:0-125:30 *)
Definition take_array (a : array u32 2%usize) : result unit :=
Ok tt.
(** [arrays::take_array_borrow]:
- Source: 'tests/src/arrays.rs', lines 123:0-123:38 *)
+ Source: 'tests/src/arrays.rs', lines 126:0-126:38 *)
Definition take_array_borrow (a : array u32 2%usize) : result unit :=
Ok tt.
(** [arrays::take_slice]:
- Source: 'tests/src/arrays.rs', lines 124:0-124:28 *)
+ Source: 'tests/src/arrays.rs', lines 127:0-127:28 *)
Definition take_slice (s : slice u32) : result unit :=
Ok tt.
(** [arrays::take_mut_slice]:
- Source: 'tests/src/arrays.rs', lines 125:0-125:36 *)
+ Source: 'tests/src/arrays.rs', lines 128:0-128:36 *)
Definition take_mut_slice (s : slice u32) : result (slice u32) :=
Ok s.
(** [arrays::const_array]:
- Source: 'tests/src/arrays.rs', lines 127:0-127:32 *)
+ Source: 'tests/src/arrays.rs', lines 130:0-130:32 *)
Definition const_array : result (array u32 2%usize) :=
Ok (mk_array u32 2%usize [ 0%u32; 0%u32 ])
.
(** [arrays::const_slice]:
- Source: 'tests/src/arrays.rs', lines 131:0-131:20 *)
+ Source: 'tests/src/arrays.rs', lines 134:0-134:20 *)
Definition const_slice : result unit :=
_ <- array_to_slice u32 2%usize (mk_array u32 2%usize [ 0%u32; 0%u32 ]);
Ok tt
.
(** [arrays::take_all]:
- Source: 'tests/src/arrays.rs', lines 141:0-141:17 *)
+ Source: 'tests/src/arrays.rs', lines 144:0-144:17 *)
Definition take_all : result unit :=
_ <- take_array (mk_array u32 2%usize [ 0%u32; 0%u32 ]);
_ <- take_array (mk_array u32 2%usize [ 0%u32; 0%u32 ]);
@@ -250,32 +250,32 @@ Definition take_all : result unit :=
.
(** [arrays::index_array]:
- Source: 'tests/src/arrays.rs', lines 155:0-155:38 *)
+ Source: 'tests/src/arrays.rs', lines 158:0-158:38 *)
Definition index_array (x : array u32 2%usize) : result u32 :=
array_index_usize u32 2%usize x 0%usize
.
(** [arrays::index_array_borrow]:
- Source: 'tests/src/arrays.rs', lines 158:0-158:46 *)
+ Source: 'tests/src/arrays.rs', lines 161:0-161:46 *)
Definition index_array_borrow (x : array u32 2%usize) : result u32 :=
array_index_usize u32 2%usize x 0%usize
.
(** [arrays::index_slice_u32_0]:
- Source: 'tests/src/arrays.rs', lines 162:0-162:42 *)
+ Source: 'tests/src/arrays.rs', lines 165:0-165:42 *)
Definition index_slice_u32_0 (x : slice u32) : result u32 :=
slice_index_usize u32 x 0%usize
.
(** [arrays::index_mut_slice_u32_0]:
- Source: 'tests/src/arrays.rs', lines 166:0-166:50 *)
+ Source: 'tests/src/arrays.rs', lines 169:0-169:50 *)
Definition index_mut_slice_u32_0
(x : slice u32) : result (u32 * (slice u32)) :=
i <- slice_index_usize u32 x 0%usize; Ok (i, x)
.
(** [arrays::index_all]:
- Source: 'tests/src/arrays.rs', lines 170:0-170:25 *)
+ Source: 'tests/src/arrays.rs', lines 173:0-173:25 *)
Definition index_all : result u32 :=
i <- index_array (mk_array u32 2%usize [ 0%u32; 0%u32 ]);
i1 <- index_array (mk_array u32 2%usize [ 0%u32; 0%u32 ]);
@@ -289,13 +289,13 @@ Definition index_all : result u32 :=
let (s1, to_slice_mut_back) := p in
p1 <- index_mut_slice_u32_0 s1;
let (i7, s2) := p1 in
- i8 <- u32_add i6 i7;
+ i9 <- u32_add i6 i7;
_ <- to_slice_mut_back s2;
- Ok i8
+ Ok i9
.
(** [arrays::update_array]:
- Source: 'tests/src/arrays.rs', lines 184:0-184:36 *)
+ Source: 'tests/src/arrays.rs', lines 187:0-187:36 *)
Definition update_array (x : array u32 2%usize) : result unit :=
p <- array_index_mut_usize u32 2%usize x 0%usize;
let (_, index_mut_back) := p in
@@ -304,7 +304,7 @@ Definition update_array (x : array u32 2%usize) : result unit :=
.
(** [arrays::update_array_mut_borrow]:
- Source: 'tests/src/arrays.rs', lines 187:0-187:48 *)
+ Source: 'tests/src/arrays.rs', lines 190:0-190:48 *)
Definition update_array_mut_borrow
(x : array u32 2%usize) : result (array u32 2%usize) :=
p <- array_index_mut_usize u32 2%usize x 0%usize;
@@ -313,7 +313,7 @@ Definition update_array_mut_borrow
.
(** [arrays::update_mut_slice]:
- Source: 'tests/src/arrays.rs', lines 190:0-190:38 *)
+ Source: 'tests/src/arrays.rs', lines 193:0-193:38 *)
Definition update_mut_slice (x : slice u32) : result (slice u32) :=
p <- slice_index_mut_usize u32 x 0%usize;
let (_, index_mut_back) := p in
@@ -321,7 +321,7 @@ Definition update_mut_slice (x : slice u32) : result (slice u32) :=
.
(** [arrays::update_all]:
- Source: 'tests/src/arrays.rs', lines 194:0-194:19 *)
+ Source: 'tests/src/arrays.rs', lines 197:0-197:19 *)
Definition update_all : result unit :=
_ <- update_array (mk_array u32 2%usize [ 0%u32; 0%u32 ]);
_ <- update_array (mk_array u32 2%usize [ 0%u32; 0%u32 ]);
@@ -334,7 +334,7 @@ Definition update_all : result unit :=
.
(** [arrays::range_all]:
- Source: 'tests/src/arrays.rs', lines 205:0-205:18 *)
+ Source: 'tests/src/arrays.rs', lines 208:0-208:18 *)
Definition range_all : result unit :=
p <-
core_array_Array_index_mut u32 (core_ops_range_Range usize) 4%usize
@@ -352,31 +352,31 @@ Definition range_all : result unit :=
.
(** [arrays::deref_array_borrow]:
- Source: 'tests/src/arrays.rs', lines 214:0-214:46 *)
+ Source: 'tests/src/arrays.rs', lines 217:0-217:46 *)
Definition deref_array_borrow (x : array u32 2%usize) : result u32 :=
array_index_usize u32 2%usize x 0%usize
.
(** [arrays::deref_array_mut_borrow]:
- Source: 'tests/src/arrays.rs', lines 219:0-219:54 *)
+ Source: 'tests/src/arrays.rs', lines 222:0-222:54 *)
Definition deref_array_mut_borrow
(x : array u32 2%usize) : result (u32 * (array u32 2%usize)) :=
i <- array_index_usize u32 2%usize x 0%usize; Ok (i, x)
.
(** [arrays::take_array_t]:
- Source: 'tests/src/arrays.rs', lines 227:0-227:31 *)
+ Source: 'tests/src/arrays.rs', lines 230:0-230:31 *)
Definition take_array_t (a : array AB_t 2%usize) : result unit :=
Ok tt.
(** [arrays::non_copyable_array]:
- Source: 'tests/src/arrays.rs', lines 229:0-229:27 *)
+ Source: 'tests/src/arrays.rs', lines 232:0-232:27 *)
Definition non_copyable_array : result unit :=
take_array_t (mk_array AB_t 2%usize [ AB_A; AB_B ])
.
(** [arrays::sum]: loop 0:
- Source: 'tests/src/arrays.rs', lines 242:0-250:1 *)
+ Source: 'tests/src/arrays.rs', lines 245:0-253:1 *)
Fixpoint sum_loop
(n : nat) (s : slice u32) (sum1 : u32) (i : usize) : result u32 :=
match n with
@@ -394,13 +394,13 @@ Fixpoint sum_loop
.
(** [arrays::sum]:
- Source: 'tests/src/arrays.rs', lines 242:0-242:28 *)
+ Source: 'tests/src/arrays.rs', lines 245:0-245:28 *)
Definition sum (n : nat) (s : slice u32) : result u32 :=
sum_loop n s 0%u32 0%usize
.
(** [arrays::sum2]: loop 0:
- Source: 'tests/src/arrays.rs', lines 252:0-261:1 *)
+ Source: 'tests/src/arrays.rs', lines 255:0-264:1 *)
Fixpoint sum2_loop
(n : nat) (s : slice u32) (s2 : slice u32) (sum1 : u32) (i : usize) :
result u32
@@ -422,7 +422,7 @@ Fixpoint sum2_loop
.
(** [arrays::sum2]:
- Source: 'tests/src/arrays.rs', lines 252:0-252:41 *)
+ Source: 'tests/src/arrays.rs', lines 255:0-255:41 *)
Definition sum2 (n : nat) (s : slice u32) (s2 : slice u32) : result u32 :=
let i := slice_len u32 s in
let i1 := slice_len u32 s2 in
@@ -430,7 +430,7 @@ Definition sum2 (n : nat) (s : slice u32) (s2 : slice u32) : result u32 :=
.
(** [arrays::f0]:
- Source: 'tests/src/arrays.rs', lines 263:0-263:11 *)
+ Source: 'tests/src/arrays.rs', lines 266:0-266:11 *)
Definition f0 : result unit :=
p <- array_to_slice_mut u32 2%usize (mk_array u32 2%usize [ 1%u32; 2%u32 ]);
let (s, to_slice_mut_back) := p in
@@ -442,7 +442,7 @@ Definition f0 : result unit :=
.
(** [arrays::f1]:
- Source: 'tests/src/arrays.rs', lines 268:0-268:11 *)
+ Source: 'tests/src/arrays.rs', lines 271:0-271:11 *)
Definition f1 : result unit :=
p <-
array_index_mut_usize u32 2%usize (mk_array u32 2%usize [ 1%u32; 2%u32 ])
@@ -453,12 +453,12 @@ Definition f1 : result unit :=
.
(** [arrays::f2]:
- Source: 'tests/src/arrays.rs', lines 273:0-273:17 *)
+ Source: 'tests/src/arrays.rs', lines 276:0-276:17 *)
Definition f2 (i : u32) : result unit :=
Ok tt.
(** [arrays::f4]:
- Source: 'tests/src/arrays.rs', lines 282:0-282:54 *)
+ Source: 'tests/src/arrays.rs', lines 285:0-285:54 *)
Definition f4
(x : array u32 32%usize) (y : usize) (z : usize) : result (slice u32) :=
core_array_Array_index u32 (core_ops_range_Range usize) 32%usize
@@ -468,7 +468,7 @@ Definition f4
.
(** [arrays::f3]:
- Source: 'tests/src/arrays.rs', lines 275:0-275:18 *)
+ Source: 'tests/src/arrays.rs', lines 278:0-278:18 *)
Definition f3 (n : nat) : result u32 :=
i <-
array_index_usize u32 2%usize (mk_array u32 2%usize [ 1%u32; 2%u32 ])
@@ -481,18 +481,18 @@ Definition f3 (n : nat) : result u32 :=
.
(** [arrays::SZ]
- Source: 'tests/src/arrays.rs', lines 286:0-286:19 *)
+ Source: 'tests/src/arrays.rs', lines 289:0-289:19 *)
Definition sz_body : result usize := Ok 32%usize.
Definition sz : usize := sz_body%global.
(** [arrays::f5]:
- Source: 'tests/src/arrays.rs', lines 289:0-289:31 *)
+ Source: 'tests/src/arrays.rs', lines 292:0-292:31 *)
Definition f5 (x : array u32 32%usize) : result u32 :=
array_index_usize u32 32%usize x 0%usize
.
(** [arrays::ite]:
- Source: 'tests/src/arrays.rs', lines 294:0-294:12 *)
+ Source: 'tests/src/arrays.rs', lines 297:0-297:12 *)
Definition ite : result unit :=
p <- array_to_slice_mut u32 2%usize (mk_array u32 2%usize [ 0%u32; 0%u32 ]);
let (s, to_slice_mut_back) := p in
@@ -508,7 +508,7 @@ Definition ite : result unit :=
.
(** [arrays::zero_slice]: loop 0:
- Source: 'tests/src/arrays.rs', lines 303:0-310:1 *)
+ Source: 'tests/src/arrays.rs', lines 306:0-313:1 *)
Fixpoint zero_slice_loop
(n : nat) (a : slice u8) (i : usize) (len : usize) : result (slice u8) :=
match n with
@@ -526,13 +526,13 @@ Fixpoint zero_slice_loop
.
(** [arrays::zero_slice]:
- Source: 'tests/src/arrays.rs', lines 303:0-303:31 *)
+ Source: 'tests/src/arrays.rs', lines 306:0-306:31 *)
Definition zero_slice (n : nat) (a : slice u8) : result (slice u8) :=
let len := slice_len u8 a in zero_slice_loop n a 0%usize len
.
(** [arrays::iter_mut_slice]: loop 0:
- Source: 'tests/src/arrays.rs', lines 312:0-318:1 *)
+ Source: 'tests/src/arrays.rs', lines 315:0-321:1 *)
Fixpoint iter_mut_slice_loop
(n : nat) (len : usize) (i : usize) : result unit :=
match n with
@@ -545,13 +545,13 @@ Fixpoint iter_mut_slice_loop
.
(** [arrays::iter_mut_slice]:
- Source: 'tests/src/arrays.rs', lines 312:0-312:35 *)
+ Source: 'tests/src/arrays.rs', lines 315:0-315:35 *)
Definition iter_mut_slice (n : nat) (a : slice u8) : result (slice u8) :=
let len := slice_len u8 a in _ <- iter_mut_slice_loop n len 0%usize; Ok a
.
(** [arrays::sum_mut_slice]: loop 0:
- Source: 'tests/src/arrays.rs', lines 320:0-328:1 *)
+ Source: 'tests/src/arrays.rs', lines 323:0-331:1 *)
Fixpoint sum_mut_slice_loop
(n : nat) (a : slice u32) (i : usize) (s : u32) : result u32 :=
match n with
@@ -569,7 +569,7 @@ Fixpoint sum_mut_slice_loop
.
(** [arrays::sum_mut_slice]:
- Source: 'tests/src/arrays.rs', lines 320:0-320:42 *)
+ Source: 'tests/src/arrays.rs', lines 323:0-323:42 *)
Definition sum_mut_slice
(n : nat) (a : slice u32) : result (u32 * (slice u32)) :=
i <- sum_mut_slice_loop n a 0%usize 0%u32; Ok (i, a)
diff --git a/tests/coq/betree/BetreeMain_Funs.v b/tests/coq/betree/Betree_Funs.v
index e0a1d8a2..b965d423 100644
--- a/tests/coq/betree/BetreeMain_Funs.v
+++ b/tests/coq/betree/Betree_Funs.v
@@ -1,18 +1,18 @@
(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
-(** [betree_main]: function definitions *)
+(** [betree]: function definitions *)
Require Import Primitives.
Import Primitives.
Require Import Coq.ZArith.ZArith.
Require Import List.
Import ListNotations.
Local Open Scope Primitives_scope.
-Require Import BetreeMain_Types.
-Include BetreeMain_Types.
-Require Import BetreeMain_FunsExternal.
-Include BetreeMain_FunsExternal.
-Module BetreeMain_Funs.
+Require Import Betree_Types.
+Include Betree_Types.
+Require Import Betree_FunsExternal.
+Include Betree_FunsExternal.
+Module Betree_Funs.
-(** [betree_main::betree::load_internal_node]:
+(** [betree::betree::load_internal_node]:
Source: 'src/betree.rs', lines 36:0-36:52 *)
Definition betree_load_internal_node
(id : u64) (st : state) :
@@ -21,7 +21,7 @@ Definition betree_load_internal_node
betree_utils_load_internal_node id st
.
-(** [betree_main::betree::store_internal_node]:
+(** [betree::betree::store_internal_node]:
Source: 'src/betree.rs', lines 41:0-41:60 *)
Definition betree_store_internal_node
(id : u64) (content : betree_List_t (u64 * betree_Message_t)) (st : state) :
@@ -30,14 +30,14 @@ Definition betree_store_internal_node
betree_utils_store_internal_node id content st
.
-(** [betree_main::betree::load_leaf_node]:
+(** [betree::betree::load_leaf_node]:
Source: 'src/betree.rs', lines 46:0-46:44 *)
Definition betree_load_leaf_node
(id : u64) (st : state) : result (state * (betree_List_t (u64 * u64))) :=
betree_utils_load_leaf_node id st
.
-(** [betree_main::betree::store_leaf_node]:
+(** [betree::betree::store_leaf_node]:
Source: 'src/betree.rs', lines 51:0-51:52 *)
Definition betree_store_leaf_node
(id : u64) (content : betree_List_t (u64 * u64)) (st : state) :
@@ -46,19 +46,19 @@ Definition betree_store_leaf_node
betree_utils_store_leaf_node id content st
.
-(** [betree_main::betree::fresh_node_id]:
+(** [betree::betree::fresh_node_id]:
Source: 'src/betree.rs', lines 55:0-55:48 *)
Definition betree_fresh_node_id (counter : u64) : result (u64 * u64) :=
counter1 <- u64_add counter 1%u64; Ok (counter, counter1)
.
-(** [betree_main::betree::{betree_main::betree::NodeIdCounter}::new]:
+(** [betree::betree::{betree::betree::NodeIdCounter}::new]:
Source: 'src/betree.rs', lines 206:4-206:20 *)
Definition betree_NodeIdCounter_new : result betree_NodeIdCounter_t :=
Ok {| betree_NodeIdCounter_next_node_id := 0%u64 |}
.
-(** [betree_main::betree::{betree_main::betree::NodeIdCounter}::fresh_id]:
+(** [betree::betree::{betree::betree::NodeIdCounter}::fresh_id]:
Source: 'src/betree.rs', lines 210:4-210:36 *)
Definition betree_NodeIdCounter_fresh_id
(self : betree_NodeIdCounter_t) : result (u64 * betree_NodeIdCounter_t) :=
@@ -67,7 +67,7 @@ Definition betree_NodeIdCounter_fresh_id
{| betree_NodeIdCounter_next_node_id := i |})
.
-(** [betree_main::betree::upsert_update]:
+(** [betree::betree::upsert_update]:
Source: 'src/betree.rs', lines 234:0-234:70 *)
Definition betree_upsert_update
(prev : option u64) (st : betree_UpsertFunState_t) : result u64 :=
@@ -88,7 +88,7 @@ Definition betree_upsert_update
end
.
-(** [betree_main::betree::{betree_main::betree::List<T>#1}::len]:
+(** [betree::betree::{betree::betree::List<T>#1}::len]:
Source: 'src/betree.rs', lines 276:4-276:24 *)
Fixpoint betree_List_len
(T : Type) (n : nat) (self : betree_List_t T) : result u64 :=
@@ -102,7 +102,7 @@ Fixpoint betree_List_len
end
.
-(** [betree_main::betree::{betree_main::betree::List<T>#1}::split_at]:
+(** [betree::betree::{betree::betree::List<T>#1}::split_at]:
Source: 'src/betree.rs', lines 284:4-284:51 *)
Fixpoint betree_List_split_at
(T : Type) (n : nat) (self : betree_List_t T) (n1 : u64) :
@@ -125,7 +125,7 @@ Fixpoint betree_List_split_at
end
.
-(** [betree_main::betree::{betree_main::betree::List<T>#1}::push_front]:
+(** [betree::betree::{betree::betree::List<T>#1}::push_front]:
Source: 'src/betree.rs', lines 299:4-299:34 *)
Definition betree_List_push_front
(T : Type) (self : betree_List_t T) (x : T) : result (betree_List_t T) :=
@@ -133,7 +133,7 @@ Definition betree_List_push_front
Ok (Betree_List_Cons x tl)
.
-(** [betree_main::betree::{betree_main::betree::List<T>#1}::pop_front]:
+(** [betree::betree::{betree::betree::List<T>#1}::pop_front]:
Source: 'src/betree.rs', lines 306:4-306:32 *)
Definition betree_List_pop_front
(T : Type) (self : betree_List_t T) : result (T * (betree_List_t T)) :=
@@ -144,7 +144,7 @@ Definition betree_List_pop_front
end
.
-(** [betree_main::betree::{betree_main::betree::List<T>#1}::hd]:
+(** [betree::betree::{betree::betree::List<T>#1}::hd]:
Source: 'src/betree.rs', lines 318:4-318:22 *)
Definition betree_List_hd (T : Type) (self : betree_List_t T) : result T :=
match self with
@@ -153,7 +153,7 @@ Definition betree_List_hd (T : Type) (self : betree_List_t T) : result T :=
end
.
-(** [betree_main::betree::{betree_main::betree::List<(u64, T)>#2}::head_has_key]:
+(** [betree::betree::{betree::betree::List<(u64, T)>#2}::head_has_key]:
Source: 'src/betree.rs', lines 327:4-327:44 *)
Definition betree_ListPairU64T_head_has_key
(T : Type) (self : betree_List_t (u64 * T)) (key : u64) : result bool :=
@@ -163,7 +163,7 @@ Definition betree_ListPairU64T_head_has_key
end
.
-(** [betree_main::betree::{betree_main::betree::List<(u64, T)>#2}::partition_at_pivot]:
+(** [betree::betree::{betree::betree::List<(u64, T)>#2}::partition_at_pivot]:
Source: 'src/betree.rs', lines 339:4-339:73 *)
Fixpoint betree_ListPairU64T_partition_at_pivot
(T : Type) (n : nat) (self : betree_List_t (u64 * T)) (pivot : u64) :
@@ -186,7 +186,7 @@ Fixpoint betree_ListPairU64T_partition_at_pivot
end
.
-(** [betree_main::betree::{betree_main::betree::Leaf#3}::split]:
+(** [betree::betree::{betree::betree::Leaf#3}::split]:
Source: 'src/betree.rs', lines 359:4-364:17 *)
Definition betree_Leaf_split
(n : nat) (self : betree_Leaf_t) (content : betree_List_t (u64 * u64))
@@ -222,7 +222,7 @@ Definition betree_Leaf_split
node_id_cnt2))
.
-(** [betree_main::betree::{betree_main::betree::Node#5}::lookup_first_message_for_key]:
+(** [betree::betree::{betree::betree::Node#5}::lookup_first_message_for_key]:
Source: 'src/betree.rs', lines 789:4-792:34 *)
Fixpoint betree_Node_lookup_first_message_for_key
(n : nat) (key : u64) (msgs : betree_List_t (u64 * betree_Message_t)) :
@@ -250,7 +250,7 @@ Fixpoint betree_Node_lookup_first_message_for_key
end
.
-(** [betree_main::betree::{betree_main::betree::Node#5}::lookup_in_bindings]:
+(** [betree::betree::{betree::betree::Node#5}::lookup_in_bindings]:
Source: 'src/betree.rs', lines 636:4-636:80 *)
Fixpoint betree_Node_lookup_in_bindings
(n : nat) (key : u64) (bindings : betree_List_t (u64 * u64)) :
@@ -271,7 +271,7 @@ Fixpoint betree_Node_lookup_in_bindings
end
.
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply_upserts]:
+(** [betree::betree::{betree::betree::Node#5}::apply_upserts]:
Source: 'src/betree.rs', lines 819:4-819:90 *)
Fixpoint betree_Node_apply_upserts
(n : nat) (msgs : betree_List_t (u64 * betree_Message_t)) (prev : option u64)
@@ -303,7 +303,7 @@ Fixpoint betree_Node_apply_upserts
end
.
-(** [betree_main::betree::{betree_main::betree::Internal#4}::lookup_in_children]:
+(** [betree::betree::{betree::betree::Internal#4}::lookup_in_children]:
Source: 'src/betree.rs', lines 395:4-395:63 *)
Fixpoint betree_Internal_lookup_in_children
(n : nat) (self : betree_Internal_t) (key : u64) (st : state) :
@@ -327,7 +327,7 @@ Fixpoint betree_Internal_lookup_in_children
self.(betree_Internal_pivot) self.(betree_Internal_left) n2)))
end
-(** [betree_main::betree::{betree_main::betree::Node#5}::lookup]:
+(** [betree::betree::{betree::betree::Node#5}::lookup]:
Source: 'src/betree.rs', lines 709:4-709:58 *)
with betree_Node_lookup
(n : nat) (self : betree_Node_t) (key : u64) (st : state) :
@@ -394,7 +394,7 @@ with betree_Node_lookup
end
.
-(** [betree_main::betree::{betree_main::betree::Node#5}::filter_messages_for_key]:
+(** [betree::betree::{betree::betree::Node#5}::filter_messages_for_key]:
Source: 'src/betree.rs', lines 674:4-674:77 *)
Fixpoint betree_Node_filter_messages_for_key
(n : nat) (key : u64) (msgs : betree_List_t (u64 * betree_Message_t)) :
@@ -419,7 +419,7 @@ Fixpoint betree_Node_filter_messages_for_key
end
.
-(** [betree_main::betree::{betree_main::betree::Node#5}::lookup_first_message_after_key]:
+(** [betree::betree::{betree::betree::Node#5}::lookup_first_message_after_key]:
Source: 'src/betree.rs', lines 689:4-692:34 *)
Fixpoint betree_Node_lookup_first_message_after_key
(n : nat) (key : u64) (msgs : betree_List_t (u64 * betree_Message_t)) :
@@ -447,7 +447,7 @@ Fixpoint betree_Node_lookup_first_message_after_key
end
.
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply_to_internal]:
+(** [betree::betree::{betree::betree::Node#5}::apply_to_internal]:
Source: 'src/betree.rs', lines 521:4-521:89 *)
Definition betree_Node_apply_to_internal
(n : nat) (msgs : betree_List_t (u64 * betree_Message_t)) (key : u64)
@@ -508,7 +508,7 @@ Definition betree_Node_apply_to_internal
lookup_first_message_for_key_back msgs2)
.
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply_messages_to_internal]:
+(** [betree::betree::{betree::betree::Node#5}::apply_messages_to_internal]:
Source: 'src/betree.rs', lines 502:4-505:5 *)
Fixpoint betree_Node_apply_messages_to_internal
(n : nat) (msgs : betree_List_t (u64 * betree_Message_t))
@@ -528,7 +528,7 @@ Fixpoint betree_Node_apply_messages_to_internal
end
.
-(** [betree_main::betree::{betree_main::betree::Node#5}::lookup_mut_in_bindings]:
+(** [betree::betree::{betree::betree::Node#5}::lookup_mut_in_bindings]:
Source: 'src/betree.rs', lines 653:4-656:32 *)
Fixpoint betree_Node_lookup_mut_in_bindings
(n : nat) (key : u64) (bindings : betree_List_t (u64 * u64)) :
@@ -556,7 +556,7 @@ Fixpoint betree_Node_lookup_mut_in_bindings
end
.
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply_to_leaf]:
+(** [betree::betree::{betree::betree::Node#5}::apply_to_leaf]:
Source: 'src/betree.rs', lines 460:4-460:87 *)
Definition betree_Node_apply_to_leaf
(n : nat) (bindings : betree_List_t (u64 * u64)) (key : u64)
@@ -594,7 +594,7 @@ Definition betree_Node_apply_to_leaf
end
.
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply_messages_to_leaf]:
+(** [betree::betree::{betree::betree::Node#5}::apply_messages_to_leaf]:
Source: 'src/betree.rs', lines 444:4-447:5 *)
Fixpoint betree_Node_apply_messages_to_leaf
(n : nat) (bindings : betree_List_t (u64 * u64))
@@ -614,7 +614,7 @@ Fixpoint betree_Node_apply_messages_to_leaf
end
.
-(** [betree_main::betree::{betree_main::betree::Internal#4}::flush]:
+(** [betree::betree::{betree::betree::Internal#4}::flush]:
Source: 'src/betree.rs', lines 410:4-415:26 *)
Fixpoint betree_Internal_flush
(n : nat) (self : betree_Internal_t) (params : betree_Params_t)
@@ -664,7 +664,7 @@ Fixpoint betree_Internal_flush
node_id_cnt1))))
end
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply_messages]:
+(** [betree::betree::{betree::betree::Node#5}::apply_messages]:
Source: 'src/betree.rs', lines 588:4-593:5 *)
with betree_Node_apply_messages
(n : nat) (self : betree_Node_t) (params : betree_Params_t)
@@ -720,7 +720,7 @@ with betree_Node_apply_messages
end
.
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply]:
+(** [betree::betree::{betree::betree::Node#5}::apply]:
Source: 'src/betree.rs', lines 576:4-582:5 *)
Definition betree_Node_apply
(n : nat) (self : betree_Node_t) (params : betree_Params_t)
@@ -736,7 +736,7 @@ Definition betree_Node_apply
Ok (st1, (self1, node_id_cnt1))
.
-(** [betree_main::betree::{betree_main::betree::BeTree#6}::new]:
+(** [betree::betree::{betree::betree::BeTree#6}::new]:
Source: 'src/betree.rs', lines 849:4-849:60 *)
Definition betree_BeTree_new
(min_flush_size : u64) (split_size : u64) (st : state) :
@@ -761,7 +761,7 @@ Definition betree_BeTree_new
|})
.
-(** [betree_main::betree::{betree_main::betree::BeTree#6}::apply]:
+(** [betree::betree::{betree::betree::BeTree#6}::apply]:
Source: 'src/betree.rs', lines 868:4-868:47 *)
Definition betree_BeTree_apply
(n : nat) (self : betree_BeTree_t) (key : u64) (msg : betree_Message_t)
@@ -781,7 +781,7 @@ Definition betree_BeTree_apply
|})
.
-(** [betree_main::betree::{betree_main::betree::BeTree#6}::insert]:
+(** [betree::betree::{betree::betree::BeTree#6}::insert]:
Source: 'src/betree.rs', lines 874:4-874:52 *)
Definition betree_BeTree_insert
(n : nat) (self : betree_BeTree_t) (key : u64) (value : u64) (st : state) :
@@ -790,7 +790,7 @@ Definition betree_BeTree_insert
betree_BeTree_apply n self key (Betree_Message_Insert value) st
.
-(** [betree_main::betree::{betree_main::betree::BeTree#6}::delete]:
+(** [betree::betree::{betree::betree::BeTree#6}::delete]:
Source: 'src/betree.rs', lines 880:4-880:38 *)
Definition betree_BeTree_delete
(n : nat) (self : betree_BeTree_t) (key : u64) (st : state) :
@@ -799,7 +799,7 @@ Definition betree_BeTree_delete
betree_BeTree_apply n self key Betree_Message_Delete st
.
-(** [betree_main::betree::{betree_main::betree::BeTree#6}::upsert]:
+(** [betree::betree::{betree::betree::BeTree#6}::upsert]:
Source: 'src/betree.rs', lines 886:4-886:59 *)
Definition betree_BeTree_upsert
(n : nat) (self : betree_BeTree_t) (key : u64)
@@ -809,7 +809,7 @@ Definition betree_BeTree_upsert
betree_BeTree_apply n self key (Betree_Message_Upsert upd) st
.
-(** [betree_main::betree::{betree_main::betree::BeTree#6}::lookup]:
+(** [betree::betree::{betree::betree::BeTree#6}::lookup]:
Source: 'src/betree.rs', lines 895:4-895:62 *)
Definition betree_BeTree_lookup
(n : nat) (self : betree_BeTree_t) (key : u64) (st : state) :
@@ -826,12 +826,12 @@ Definition betree_BeTree_lookup
|}))
.
-(** [betree_main::main]:
+(** [betree::main]:
Source: 'src/main.rs', lines 4:0-4:9 *)
Definition main : result unit :=
Ok tt.
-(** Unit test for [betree_main::main] *)
+(** Unit test for [betree::main] *)
Check (main )%return.
-End BetreeMain_Funs.
+End Betree_Funs.
diff --git a/tests/coq/betree/BetreeMain_FunsExternal.v b/tests/coq/betree/Betree_FunsExternal.v
index 099a2e8f..0263c272 100644
--- a/tests/coq/betree/BetreeMain_FunsExternal.v
+++ b/tests/coq/betree/Betree_FunsExternal.v
@@ -6,9 +6,9 @@ Require Import Coq.ZArith.ZArith.
Require Import List.
Import ListNotations.
Local Open Scope Primitives_scope.
-Require Export BetreeMain_Types.
-Import BetreeMain_Types.
-Module BetreeMain_FunsExternal.
+Require Export Betree_Types.
+Import Betree_Types.
+Module Betree_FunsExternal.
(** [betree_main::betree_utils::load_internal_node]: forward function
Source: 'src/betree_utils.rs', lines 98:0-98:63 *)
@@ -36,4 +36,4 @@ Axiom betree_utils_store_leaf_node
: u64 -> betree_List_t (u64 * u64) -> state -> result (state * unit)
.
-End BetreeMain_FunsExternal.
+End Betree_FunsExternal.
diff --git a/tests/coq/betree/BetreeMain_FunsExternal_Template.v b/tests/coq/betree/Betree_FunsExternal_Template.v
index 58be2733..2a2fddfc 100644
--- a/tests/coq/betree/BetreeMain_FunsExternal_Template.v
+++ b/tests/coq/betree/Betree_FunsExternal_Template.v
@@ -1,5 +1,5 @@
(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
-(** [betree_main]: external functions.
+(** [betree]: external functions.
-- This is a template file: rename it to "FunsExternal.lean" and fill the holes. *)
Require Import Primitives.
Import Primitives.
@@ -7,17 +7,17 @@ Require Import Coq.ZArith.ZArith.
Require Import List.
Import ListNotations.
Local Open Scope Primitives_scope.
-Require Import BetreeMain_Types.
-Include BetreeMain_Types.
-Module BetreeMain_FunsExternal_Template.
+Require Import Betree_Types.
+Include Betree_Types.
+Module Betree_FunsExternal_Template.
-(** [betree_main::betree_utils::load_internal_node]:
+(** [betree::betree_utils::load_internal_node]:
Source: 'src/betree_utils.rs', lines 98:0-98:63 *)
Axiom betree_utils_load_internal_node
: u64 -> state -> result (state * (betree_List_t (u64 * betree_Message_t)))
.
-(** [betree_main::betree_utils::store_internal_node]:
+(** [betree::betree_utils::store_internal_node]:
Source: 'src/betree_utils.rs', lines 115:0-115:71 *)
Axiom betree_utils_store_internal_node
:
@@ -25,16 +25,16 @@ Axiom betree_utils_store_internal_node
unit)
.
-(** [betree_main::betree_utils::load_leaf_node]:
+(** [betree::betree_utils::load_leaf_node]:
Source: 'src/betree_utils.rs', lines 132:0-132:55 *)
Axiom betree_utils_load_leaf_node
: u64 -> state -> result (state * (betree_List_t (u64 * u64)))
.
-(** [betree_main::betree_utils::store_leaf_node]:
+(** [betree::betree_utils::store_leaf_node]:
Source: 'src/betree_utils.rs', lines 145:0-145:63 *)
Axiom betree_utils_store_leaf_node
: u64 -> betree_List_t (u64 * u64) -> state -> result (state * unit)
.
-End BetreeMain_FunsExternal_Template.
+End Betree_FunsExternal_Template.
diff --git a/tests/coq/betree/BetreeMain_Types.v b/tests/coq/betree/Betree_Types.v
index acbc2085..aa39d8e4 100644
--- a/tests/coq/betree/BetreeMain_Types.v
+++ b/tests/coq/betree/Betree_Types.v
@@ -1,16 +1,16 @@
(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
-(** [betree_main]: type definitions *)
+(** [betree]: type definitions *)
Require Import Primitives.
Import Primitives.
Require Import Coq.ZArith.ZArith.
Require Import List.
Import ListNotations.
Local Open Scope Primitives_scope.
-Require Import BetreeMain_TypesExternal.
-Include BetreeMain_TypesExternal.
-Module BetreeMain_Types.
+Require Import Betree_TypesExternal.
+Include Betree_TypesExternal.
+Module Betree_Types.
-(** [betree_main::betree::List]
+(** [betree::betree::List]
Source: 'src/betree.rs', lines 17:0-17:23 *)
Inductive betree_List_t (T : Type) :=
| Betree_List_Cons : T -> betree_List_t T -> betree_List_t T
@@ -20,14 +20,14 @@ Inductive betree_List_t (T : Type) :=
Arguments Betree_List_Cons { _ }.
Arguments Betree_List_Nil { _ }.
-(** [betree_main::betree::UpsertFunState]
+(** [betree::betree::UpsertFunState]
Source: 'src/betree.rs', lines 63:0-63:23 *)
Inductive betree_UpsertFunState_t :=
| Betree_UpsertFunState_Add : u64 -> betree_UpsertFunState_t
| Betree_UpsertFunState_Sub : u64 -> betree_UpsertFunState_t
.
-(** [betree_main::betree::Message]
+(** [betree::betree::Message]
Source: 'src/betree.rs', lines 69:0-69:23 *)
Inductive betree_Message_t :=
| Betree_Message_Insert : u64 -> betree_Message_t
@@ -35,7 +35,7 @@ Inductive betree_Message_t :=
| Betree_Message_Upsert : betree_UpsertFunState_t -> betree_Message_t
.
-(** [betree_main::betree::Leaf]
+(** [betree::betree::Leaf]
Source: 'src/betree.rs', lines 167:0-167:11 *)
Record betree_Leaf_t :=
mkbetree_Leaf_t {
@@ -43,7 +43,7 @@ mkbetree_Leaf_t {
}
.
-(** [betree_main::betree::Internal]
+(** [betree::betree::Internal]
Source: 'src/betree.rs', lines 156:0-156:15 *)
Inductive betree_Internal_t :=
| mkbetree_Internal_t :
@@ -53,7 +53,7 @@ Inductive betree_Internal_t :=
betree_Node_t ->
betree_Internal_t
-(** [betree_main::betree::Node]
+(** [betree::betree::Node]
Source: 'src/betree.rs', lines 179:0-179:9 *)
with betree_Node_t :=
| Betree_Node_Internal : betree_Internal_t -> betree_Node_t
@@ -89,7 +89,7 @@ Notation "x2 .(betree_Internal_right)" := (betree_Internal_right x2)
(at level 9)
.
-(** [betree_main::betree::Params]
+(** [betree::betree::Params]
Source: 'src/betree.rs', lines 187:0-187:13 *)
Record betree_Params_t :=
mkbetree_Params_t {
@@ -97,7 +97,7 @@ mkbetree_Params_t {
}
.
-(** [betree_main::betree::NodeIdCounter]
+(** [betree::betree::NodeIdCounter]
Source: 'src/betree.rs', lines 201:0-201:20 *)
Record betree_NodeIdCounter_t :=
mkbetree_NodeIdCounter_t {
@@ -105,7 +105,7 @@ mkbetree_NodeIdCounter_t {
}
.
-(** [betree_main::betree::BeTree]
+(** [betree::betree::BeTree]
Source: 'src/betree.rs', lines 218:0-218:17 *)
Record betree_BeTree_t :=
mkbetree_BeTree_t {
@@ -115,4 +115,4 @@ mkbetree_BeTree_t {
}
.
-End BetreeMain_Types.
+End Betree_Types.
diff --git a/tests/coq/betree/BetreeMain_TypesExternal.v b/tests/coq/betree/Betree_TypesExternal.v
index 870d2601..37487d6d 100644
--- a/tests/coq/betree/BetreeMain_TypesExternal.v
+++ b/tests/coq/betree/Betree_TypesExternal.v
@@ -6,9 +6,9 @@ Require Import Coq.ZArith.ZArith.
Require Import List.
Import ListNotations.
Local Open Scope Primitives_scope.
-Module BetreeMain_TypesExternal.
+Module Betree_TypesExternal.
(** The state type used in the state-error monad *)
Axiom state : Type.
-End BetreeMain_TypesExternal.
+End Betree_TypesExternal.
diff --git a/tests/coq/betree/BetreeMain_TypesExternal_Template.v b/tests/coq/betree/Betree_TypesExternal_Template.v
index 651de2b7..a40811cb 100644
--- a/tests/coq/betree/BetreeMain_TypesExternal_Template.v
+++ b/tests/coq/betree/Betree_TypesExternal_Template.v
@@ -1,5 +1,5 @@
(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
-(** [betree_main]: external types.
+(** [betree]: external types.
-- This is a template file: rename it to "TypesExternal.lean" and fill the holes. *)
Require Import Primitives.
Import Primitives.
@@ -7,9 +7,9 @@ Require Import Coq.ZArith.ZArith.
Require Import List.
Import ListNotations.
Local Open Scope Primitives_scope.
-Module BetreeMain_TypesExternal_Template.
+Module Betree_TypesExternal_Template.
(** The state type used in the state-error monad *)
Axiom state : Type.
-End BetreeMain_TypesExternal_Template.
+End Betree_TypesExternal_Template.
diff --git a/tests/coq/betree/_CoqProject b/tests/coq/betree/_CoqProject
index 2ba444c2..9fb7fe64 100644
--- a/tests/coq/betree/_CoqProject
+++ b/tests/coq/betree/_CoqProject
@@ -3,10 +3,10 @@
-arg -w
-arg all
-BetreeMain_Funs.v
-BetreeMain_FunsExternal.v
-BetreeMain_FunsExternal_Template.v
-BetreeMain_Types.v
-BetreeMain_TypesExternal.v
-BetreeMain_TypesExternal_Template.v
+Betree_TypesExternal_Template.v
+Betree_Types.v
Primitives.v
+Betree_FunsExternal_Template.v
+Betree_Funs.v
+Betree_TypesExternal.v
+Betree_FunsExternal.v
diff --git a/tests/coq/demo/Demo.v b/tests/coq/demo/Demo.v
index 8d8f840d..e8c3a694 100644
--- a/tests/coq/demo/Demo.v
+++ b/tests/coq/demo/Demo.v
@@ -9,7 +9,7 @@ Local Open Scope Primitives_scope.
Module Demo.
(** [demo::choose]:
- Source: 'tests/src/demo.rs', lines 5:0-5:70 *)
+ Source: 'tests/src/demo.rs', lines 7:0-7:70 *)
Definition choose
(T : Type) (b : bool) (x : T) (y : T) : result (T * (T -> result (T * T))) :=
if b
@@ -18,30 +18,30 @@ Definition choose
.
(** [demo::mul2_add1]:
- Source: 'tests/src/demo.rs', lines 13:0-13:31 *)
+ Source: 'tests/src/demo.rs', lines 15:0-15:31 *)
Definition mul2_add1 (x : u32) : result u32 :=
i <- u32_add x x; u32_add i 1%u32
.
(** [demo::use_mul2_add1]:
- Source: 'tests/src/demo.rs', lines 17:0-17:43 *)
+ Source: 'tests/src/demo.rs', lines 19:0-19:43 *)
Definition use_mul2_add1 (x : u32) (y : u32) : result u32 :=
i <- mul2_add1 x; u32_add i y
.
(** [demo::incr]:
- Source: 'tests/src/demo.rs', lines 21:0-21:31 *)
+ Source: 'tests/src/demo.rs', lines 23:0-23:31 *)
Definition incr (x : u32) : result u32 :=
u32_add x 1%u32.
(** [demo::use_incr]:
- Source: 'tests/src/demo.rs', lines 25:0-25:17 *)
+ Source: 'tests/src/demo.rs', lines 27:0-27:17 *)
Definition use_incr : result unit :=
x <- incr 0%u32; x1 <- incr x; _ <- incr x1; Ok tt
.
(** [demo::CList]
- Source: 'tests/src/demo.rs', lines 34:0-34:17 *)
+ Source: 'tests/src/demo.rs', lines 36:0-36:17 *)
Inductive CList_t (T : Type) :=
| CList_CCons : T -> CList_t T -> CList_t T
| CList_CNil : CList_t T
@@ -51,7 +51,7 @@ Arguments CList_CCons { _ }.
Arguments CList_CNil { _ }.
(** [demo::list_nth]:
- Source: 'tests/src/demo.rs', lines 39:0-39:56 *)
+ Source: 'tests/src/demo.rs', lines 41:0-41:56 *)
Fixpoint list_nth (T : Type) (n : nat) (l : CList_t T) (i : u32) : result T :=
match n with
| O => Fail_ OutOfFuel
@@ -65,7 +65,7 @@ Fixpoint list_nth (T : Type) (n : nat) (l : CList_t T) (i : u32) : result T :=
.
(** [demo::list_nth_mut]:
- Source: 'tests/src/demo.rs', lines 54:0-54:68 *)
+ Source: 'tests/src/demo.rs', lines 56:0-56:68 *)
Fixpoint list_nth_mut
(T : Type) (n : nat) (l : CList_t T) (i : u32) :
result (T * (T -> result (CList_t T)))
@@ -91,7 +91,7 @@ Fixpoint list_nth_mut
.
(** [demo::list_nth_mut1]: loop 0:
- Source: 'tests/src/demo.rs', lines 69:0-78:1 *)
+ Source: 'tests/src/demo.rs', lines 71:0-80:1 *)
Fixpoint list_nth_mut1_loop
(T : Type) (n : nat) (l : CList_t T) (i : u32) :
result (T * (T -> result (CList_t T)))
@@ -116,7 +116,7 @@ Fixpoint list_nth_mut1_loop
.
(** [demo::list_nth_mut1]:
- Source: 'tests/src/demo.rs', lines 69:0-69:77 *)
+ Source: 'tests/src/demo.rs', lines 71:0-71:77 *)
Definition list_nth_mut1
(T : Type) (n : nat) (l : CList_t T) (i : u32) :
result (T * (T -> result (CList_t T)))
@@ -125,7 +125,7 @@ Definition list_nth_mut1
.
(** [demo::i32_id]:
- Source: 'tests/src/demo.rs', lines 80:0-80:28 *)
+ Source: 'tests/src/demo.rs', lines 82:0-82:28 *)
Fixpoint i32_id (n : nat) (i : i32) : result i32 :=
match n with
| O => Fail_ OutOfFuel
@@ -137,7 +137,7 @@ Fixpoint i32_id (n : nat) (i : i32) : result i32 :=
.
(** [demo::list_tail]:
- Source: 'tests/src/demo.rs', lines 88:0-88:64 *)
+ Source: 'tests/src/demo.rs', lines 90:0-90:64 *)
Fixpoint list_tail
(T : Type) (n : nat) (l : CList_t T) :
result ((CList_t T) * (CList_t T -> result (CList_t T)))
@@ -159,7 +159,7 @@ Fixpoint list_tail
.
(** Trait declaration: [demo::Counter]
- Source: 'tests/src/demo.rs', lines 97:0-97:17 *)
+ Source: 'tests/src/demo.rs', lines 99:0-99:17 *)
Record Counter_t (Self : Type) := mkCounter_t {
Counter_t_incr : Self -> result (usize * Self);
}.
@@ -168,19 +168,19 @@ Arguments mkCounter_t { _ }.
Arguments Counter_t_incr { _ }.
(** [demo::{(demo::Counter for usize)}::incr]:
- Source: 'tests/src/demo.rs', lines 102:4-102:31 *)
+ Source: 'tests/src/demo.rs', lines 104:4-104:31 *)
Definition counterUsize_incr (self : usize) : result (usize * usize) :=
self1 <- usize_add self 1%usize; Ok (self, self1)
.
(** Trait implementation: [demo::{(demo::Counter for usize)}]
- Source: 'tests/src/demo.rs', lines 101:0-101:22 *)
+ Source: 'tests/src/demo.rs', lines 103:0-103:22 *)
Definition CounterUsize : Counter_t usize := {|
Counter_t_incr := counterUsize_incr;
|}.
(** [demo::use_counter]:
- Source: 'tests/src/demo.rs', lines 109:0-109:59 *)
+ Source: 'tests/src/demo.rs', lines 111:0-111:59 *)
Definition use_counter
(T : Type) (counterInst : Counter_t T) (cnt : T) : result (usize * T) :=
counterInst.(Counter_t_incr) cnt
diff --git a/tests/coq/hashmap/Hashmap_Funs.v b/tests/coq/hashmap/Hashmap_Funs.v
index 1f2b2b22..04df873a 100644
--- a/tests/coq/hashmap/Hashmap_Funs.v
+++ b/tests/coq/hashmap/Hashmap_Funs.v
@@ -8,15 +8,17 @@ Import ListNotations.
Local Open Scope Primitives_scope.
Require Import Hashmap_Types.
Include Hashmap_Types.
+Require Import Hashmap_FunsExternal.
+Include Hashmap_FunsExternal.
Module Hashmap_Funs.
(** [hashmap::hash_key]:
- Source: 'tests/src/hashmap.rs', lines 27:0-27:32 *)
+ Source: 'tests/src/hashmap.rs', lines 37:0-37:32 *)
Definition hash_key (k : usize) : result usize :=
Ok k.
(** [hashmap::{hashmap::HashMap<T>}::allocate_slots]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 50:4-56:5 *)
+ Source: 'tests/src/hashmap.rs', lines 60:4-66:5 *)
Fixpoint hashMap_allocate_slots_loop
(T : Type) (n : nat) (slots : alloc_vec_Vec (List_t T)) (n1 : usize) :
result (alloc_vec_Vec (List_t T))
@@ -34,7 +36,7 @@ Fixpoint hashMap_allocate_slots_loop
.
(** [hashmap::{hashmap::HashMap<T>}::allocate_slots]:
- Source: 'tests/src/hashmap.rs', lines 50:4-50:76 *)
+ Source: 'tests/src/hashmap.rs', lines 60:4-60:76 *)
Definition hashMap_allocate_slots
(T : Type) (n : nat) (slots : alloc_vec_Vec (List_t T)) (n1 : usize) :
result (alloc_vec_Vec (List_t T))
@@ -43,7 +45,7 @@ Definition hashMap_allocate_slots
.
(** [hashmap::{hashmap::HashMap<T>}::new_with_capacity]:
- Source: 'tests/src/hashmap.rs', lines 59:4-63:13 *)
+ Source: 'tests/src/hashmap.rs', lines 69:4-73:13 *)
Definition hashMap_new_with_capacity
(T : Type) (n : nat) (capacity : usize) (max_load_dividend : usize)
(max_load_divisor : usize) :
@@ -62,13 +64,13 @@ Definition hashMap_new_with_capacity
.
(** [hashmap::{hashmap::HashMap<T>}::new]:
- Source: 'tests/src/hashmap.rs', lines 75:4-75:24 *)
+ Source: 'tests/src/hashmap.rs', lines 85:4-85:24 *)
Definition hashMap_new (T : Type) (n : nat) : result (HashMap_t T) :=
hashMap_new_with_capacity T n 32%usize 4%usize 5%usize
.
(** [hashmap::{hashmap::HashMap<T>}::clear]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 80:4-88:5 *)
+ Source: 'tests/src/hashmap.rs', lines 90:4-98:5 *)
Fixpoint hashMap_clear_loop
(T : Type) (n : nat) (slots : alloc_vec_Vec (List_t T)) (i : usize) :
result (alloc_vec_Vec (List_t T))
@@ -91,7 +93,7 @@ Fixpoint hashMap_clear_loop
.
(** [hashmap::{hashmap::HashMap<T>}::clear]:
- Source: 'tests/src/hashmap.rs', lines 80:4-80:27 *)
+ Source: 'tests/src/hashmap.rs', lines 90:4-90:27 *)
Definition hashMap_clear
(T : Type) (n : nat) (self : HashMap_t T) : result (HashMap_t T) :=
hm <- hashMap_clear_loop T n self.(hashMap_slots) 0%usize;
@@ -105,13 +107,13 @@ Definition hashMap_clear
.
(** [hashmap::{hashmap::HashMap<T>}::len]:
- Source: 'tests/src/hashmap.rs', lines 90:4-90:30 *)
+ Source: 'tests/src/hashmap.rs', lines 100:4-100:30 *)
Definition hashMap_len (T : Type) (self : HashMap_t T) : result usize :=
Ok self.(hashMap_num_entries)
.
(** [hashmap::{hashmap::HashMap<T>}::insert_in_list]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 97:4-114:5 *)
+ Source: 'tests/src/hashmap.rs', lines 107:4-124:5 *)
Fixpoint hashMap_insert_in_list_loop
(T : Type) (n : nat) (key : usize) (value : T) (ls : List_t T) :
result (bool * (List_t T))
@@ -133,7 +135,7 @@ Fixpoint hashMap_insert_in_list_loop
.
(** [hashmap::{hashmap::HashMap<T>}::insert_in_list]:
- Source: 'tests/src/hashmap.rs', lines 97:4-97:71 *)
+ Source: 'tests/src/hashmap.rs', lines 107:4-107:71 *)
Definition hashMap_insert_in_list
(T : Type) (n : nat) (key : usize) (value : T) (ls : List_t T) :
result (bool * (List_t T))
@@ -142,7 +144,7 @@ Definition hashMap_insert_in_list
.
(** [hashmap::{hashmap::HashMap<T>}::insert_no_resize]:
- Source: 'tests/src/hashmap.rs', lines 117:4-117:54 *)
+ Source: 'tests/src/hashmap.rs', lines 127:4-127:54 *)
Definition hashMap_insert_no_resize
(T : Type) (n : nat) (self : HashMap_t T) (key : usize) (value : T) :
result (HashMap_t T)
@@ -180,7 +182,7 @@ Definition hashMap_insert_no_resize
.
(** [hashmap::{hashmap::HashMap<T>}::move_elements_from_list]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 183:4-196:5 *)
+ Source: 'tests/src/hashmap.rs', lines 193:4-206:5 *)
Fixpoint hashMap_move_elements_from_list_loop
(T : Type) (n : nat) (ntable : HashMap_t T) (ls : List_t T) :
result (HashMap_t T)
@@ -198,7 +200,7 @@ Fixpoint hashMap_move_elements_from_list_loop
.
(** [hashmap::{hashmap::HashMap<T>}::move_elements_from_list]:
- Source: 'tests/src/hashmap.rs', lines 183:4-183:72 *)
+ Source: 'tests/src/hashmap.rs', lines 193:4-193:72 *)
Definition hashMap_move_elements_from_list
(T : Type) (n : nat) (ntable : HashMap_t T) (ls : List_t T) :
result (HashMap_t T)
@@ -207,7 +209,7 @@ Definition hashMap_move_elements_from_list
.
(** [hashmap::{hashmap::HashMap<T>}::move_elements]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 171:4-180:5 *)
+ Source: 'tests/src/hashmap.rs', lines 181:4-190:5 *)
Fixpoint hashMap_move_elements_loop
(T : Type) (n : nat) (ntable : HashMap_t T)
(slots : alloc_vec_Vec (List_t T)) (i : usize) :
@@ -233,7 +235,7 @@ Fixpoint hashMap_move_elements_loop
.
(** [hashmap::{hashmap::HashMap<T>}::move_elements]:
- Source: 'tests/src/hashmap.rs', lines 171:4-171:95 *)
+ Source: 'tests/src/hashmap.rs', lines 181:4-181:95 *)
Definition hashMap_move_elements
(T : Type) (n : nat) (ntable : HashMap_t T)
(slots : alloc_vec_Vec (List_t T)) (i : usize) :
@@ -243,7 +245,7 @@ Definition hashMap_move_elements
.
(** [hashmap::{hashmap::HashMap<T>}::try_resize]:
- Source: 'tests/src/hashmap.rs', lines 140:4-140:28 *)
+ Source: 'tests/src/hashmap.rs', lines 150:4-150:28 *)
Definition hashMap_try_resize
(T : Type) (n : nat) (self : HashMap_t T) : result (HashMap_t T) :=
max_usize <- scalar_cast U32 Usize core_u32_max;
@@ -275,7 +277,7 @@ Definition hashMap_try_resize
.
(** [hashmap::{hashmap::HashMap<T>}::insert]:
- Source: 'tests/src/hashmap.rs', lines 129:4-129:48 *)
+ Source: 'tests/src/hashmap.rs', lines 139:4-139:48 *)
Definition hashMap_insert
(T : Type) (n : nat) (self : HashMap_t T) (key : usize) (value : T) :
result (HashMap_t T)
@@ -288,7 +290,7 @@ Definition hashMap_insert
.
(** [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 206:4-219:5 *)
+ Source: 'tests/src/hashmap.rs', lines 216:4-229:5 *)
Fixpoint hashMap_contains_key_in_list_loop
(T : Type) (n : nat) (key : usize) (ls : List_t T) : result bool :=
match n with
@@ -305,14 +307,14 @@ Fixpoint hashMap_contains_key_in_list_loop
.
(** [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]:
- Source: 'tests/src/hashmap.rs', lines 206:4-206:68 *)
+ Source: 'tests/src/hashmap.rs', lines 216:4-216:68 *)
Definition hashMap_contains_key_in_list
(T : Type) (n : nat) (key : usize) (ls : List_t T) : result bool :=
hashMap_contains_key_in_list_loop T n key ls
.
(** [hashmap::{hashmap::HashMap<T>}::contains_key]:
- Source: 'tests/src/hashmap.rs', lines 199:4-199:49 *)
+ Source: 'tests/src/hashmap.rs', lines 209:4-209:49 *)
Definition hashMap_contains_key
(T : Type) (n : nat) (self : HashMap_t T) (key : usize) : result bool :=
hash <- hash_key key;
@@ -326,7 +328,7 @@ Definition hashMap_contains_key
.
(** [hashmap::{hashmap::HashMap<T>}::get_in_list]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 224:4-237:5 *)
+ Source: 'tests/src/hashmap.rs', lines 234:4-247:5 *)
Fixpoint hashMap_get_in_list_loop
(T : Type) (n : nat) (key : usize) (ls : List_t T) : result T :=
match n with
@@ -341,14 +343,14 @@ Fixpoint hashMap_get_in_list_loop
.
(** [hashmap::{hashmap::HashMap<T>}::get_in_list]:
- Source: 'tests/src/hashmap.rs', lines 224:4-224:70 *)
+ Source: 'tests/src/hashmap.rs', lines 234:4-234:70 *)
Definition hashMap_get_in_list
(T : Type) (n : nat) (key : usize) (ls : List_t T) : result T :=
hashMap_get_in_list_loop T n key ls
.
(** [hashmap::{hashmap::HashMap<T>}::get]:
- Source: 'tests/src/hashmap.rs', lines 239:4-239:55 *)
+ Source: 'tests/src/hashmap.rs', lines 249:4-249:55 *)
Definition hashMap_get
(T : Type) (n : nat) (self : HashMap_t T) (key : usize) : result T :=
hash <- hash_key key;
@@ -362,7 +364,7 @@ Definition hashMap_get
.
(** [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 245:4-254:5 *)
+ Source: 'tests/src/hashmap.rs', lines 255:4-264:5 *)
Fixpoint hashMap_get_mut_in_list_loop
(T : Type) (n : nat) (ls : List_t T) (key : usize) :
result (T * (T -> result (List_t T)))
@@ -388,7 +390,7 @@ Fixpoint hashMap_get_mut_in_list_loop
.
(** [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]:
- Source: 'tests/src/hashmap.rs', lines 245:4-245:86 *)
+ Source: 'tests/src/hashmap.rs', lines 255:4-255:86 *)
Definition hashMap_get_mut_in_list
(T : Type) (n : nat) (ls : List_t T) (key : usize) :
result (T * (T -> result (List_t T)))
@@ -397,7 +399,7 @@ Definition hashMap_get_mut_in_list
.
(** [hashmap::{hashmap::HashMap<T>}::get_mut]:
- Source: 'tests/src/hashmap.rs', lines 257:4-257:67 *)
+ Source: 'tests/src/hashmap.rs', lines 267:4-267:67 *)
Definition hashMap_get_mut
(T : Type) (n : nat) (self : HashMap_t T) (key : usize) :
result (T * (T -> result (HashMap_t T)))
@@ -427,7 +429,7 @@ Definition hashMap_get_mut
.
(** [hashmap::{hashmap::HashMap<T>}::remove_from_list]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 265:4-291:5 *)
+ Source: 'tests/src/hashmap.rs', lines 275:4-301:5 *)
Fixpoint hashMap_remove_from_list_loop
(T : Type) (n : nat) (key : usize) (ls : List_t T) :
result ((option T) * (List_t T))
@@ -455,7 +457,7 @@ Fixpoint hashMap_remove_from_list_loop
.
(** [hashmap::{hashmap::HashMap<T>}::remove_from_list]:
- Source: 'tests/src/hashmap.rs', lines 265:4-265:69 *)
+ Source: 'tests/src/hashmap.rs', lines 275:4-275:69 *)
Definition hashMap_remove_from_list
(T : Type) (n : nat) (key : usize) (ls : List_t T) :
result ((option T) * (List_t T))
@@ -464,7 +466,7 @@ Definition hashMap_remove_from_list
.
(** [hashmap::{hashmap::HashMap<T>}::remove]:
- Source: 'tests/src/hashmap.rs', lines 294:4-294:52 *)
+ Source: 'tests/src/hashmap.rs', lines 304:4-304:52 *)
Definition hashMap_remove
(T : Type) (n : nat) (self : HashMap_t T) (key : usize) :
result ((option T) * (HashMap_t T))
@@ -502,8 +504,18 @@ Definition hashMap_remove
end
.
+(** [hashmap::insert_on_disk]:
+ Source: 'tests/src/hashmap.rs', lines 335:0-335:43 *)
+Definition insert_on_disk
+ (n : nat) (key : usize) (value : u64) (st : state) : result (state * unit) :=
+ p <- utils_deserialize st;
+ let (st1, hm) := p in
+ hm1 <- hashMap_insert u64 n hm key value;
+ utils_serialize hm1 st1
+.
+
(** [hashmap::test1]:
- Source: 'tests/src/hashmap.rs', lines 315:0-315:10 *)
+ Source: 'tests/src/hashmap.rs', lines 350:0-350:10 *)
Definition test1 (n : nat) : result unit :=
hm <- hashMap_new u64 n;
hm1 <- hashMap_insert u64 n hm 0%usize 42%u64;
diff --git a/tests/coq/hashmap/Hashmap_FunsExternal.v b/tests/coq/hashmap/Hashmap_FunsExternal.v
new file mode 100644
index 00000000..3bc6c98a
--- /dev/null
+++ b/tests/coq/hashmap/Hashmap_FunsExternal.v
@@ -0,0 +1,21 @@
+(** [hashmap]: external functions. *)
+Require Import Primitives.
+Import Primitives.
+Require Import Coq.ZArith.ZArith.
+Require Import List.
+Import ListNotations.
+Local Open Scope Primitives_scope.
+Require Export Hashmap_Types.
+Import Hashmap_Types.
+Module Hashmap_FunsExternal.
+
+(** [hashmap::utils::deserialize]:
+ Source: 'tests/src/hashmap.rs', lines 330:4-330:47 *)
+Axiom utils_deserialize : state -> result (state * (HashMap_t u64)).
+
+(** [hashmap::utils::serialize]:
+ Source: 'tests/src/hashmap.rs', lines 325:4-325:46 *)
+Axiom utils_serialize : HashMap_t u64 -> state -> result (state * unit)
+.
+
+End Hashmap_FunsExternal.
diff --git a/tests/coq/hashmap/Hashmap_FunsExternal_Template.v b/tests/coq/hashmap/Hashmap_FunsExternal_Template.v
new file mode 100644
index 00000000..c58b021d
--- /dev/null
+++ b/tests/coq/hashmap/Hashmap_FunsExternal_Template.v
@@ -0,0 +1,22 @@
+(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
+(** [hashmap]: external functions.
+-- This is a template file: rename it to "FunsExternal.lean" and fill the holes. *)
+Require Import Primitives.
+Import Primitives.
+Require Import Coq.ZArith.ZArith.
+Require Import List.
+Import ListNotations.
+Local Open Scope Primitives_scope.
+Require Import Hashmap_Types.
+Include Hashmap_Types.
+Module Hashmap_FunsExternal_Template.
+
+(** [hashmap::utils::deserialize]:
+ Source: 'tests/src/hashmap.rs', lines 330:4-330:47 *)
+Axiom utils_deserialize : state -> result (state * (HashMap_t u64)).
+
+(** [hashmap::utils::serialize]:
+ Source: 'tests/src/hashmap.rs', lines 325:4-325:46 *)
+Axiom utils_serialize : HashMap_t u64 -> state -> result (state * unit).
+
+End Hashmap_FunsExternal_Template.
diff --git a/tests/coq/hashmap/Hashmap_Types.v b/tests/coq/hashmap/Hashmap_Types.v
index 2a9f7ddb..452d56f8 100644
--- a/tests/coq/hashmap/Hashmap_Types.v
+++ b/tests/coq/hashmap/Hashmap_Types.v
@@ -6,10 +6,12 @@ Require Import Coq.ZArith.ZArith.
Require Import List.
Import ListNotations.
Local Open Scope Primitives_scope.
+Require Import Hashmap_TypesExternal.
+Include Hashmap_TypesExternal.
Module Hashmap_Types.
(** [hashmap::List]
- Source: 'tests/src/hashmap.rs', lines 19:0-19:16 *)
+ Source: 'tests/src/hashmap.rs', lines 29:0-29:16 *)
Inductive List_t (T : Type) :=
| List_Cons : usize -> T -> List_t T -> List_t T
| List_Nil : List_t T
@@ -19,7 +21,7 @@ Arguments List_Cons { _ }.
Arguments List_Nil { _ }.
(** [hashmap::HashMap]
- Source: 'tests/src/hashmap.rs', lines 35:0-35:21 *)
+ Source: 'tests/src/hashmap.rs', lines 45:0-45:21 *)
Record HashMap_t (T : Type) :=
mkHashMap_t {
hashMap_num_entries : usize;
diff --git a/tests/coq/hashmap_on_disk/HashmapMain_TypesExternal.v b/tests/coq/hashmap/Hashmap_TypesExternal.v
index 28651c14..0aa52a5d 100644
--- a/tests/coq/hashmap_on_disk/HashmapMain_TypesExternal.v
+++ b/tests/coq/hashmap/Hashmap_TypesExternal.v
@@ -1,14 +1,13 @@
-(** [hashmap_main]: external types.
--- This is a template file: rename it to "TypesExternal.lean" and fill the holes. *)
+(** [hashmap]: external types. *)
Require Import Primitives.
Import Primitives.
Require Import Coq.ZArith.ZArith.
Require Import List.
Import ListNotations.
Local Open Scope Primitives_scope.
-Module HashmapMain_TypesExternal.
+Module Hashmap_TypesExternal.
(** The state type used in the state-error monad *)
Axiom state : Type.
-End HashmapMain_TypesExternal.
+End Hashmap_TypesExternal.
diff --git a/tests/coq/hashmap_on_disk/HashmapMain_TypesExternal_Template.v b/tests/coq/hashmap/Hashmap_TypesExternal_Template.v
index 391b2775..a8051adb 100644
--- a/tests/coq/hashmap_on_disk/HashmapMain_TypesExternal_Template.v
+++ b/tests/coq/hashmap/Hashmap_TypesExternal_Template.v
@@ -1,5 +1,5 @@
(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
-(** [hashmap_main]: external types.
+(** [hashmap]: external types.
-- This is a template file: rename it to "TypesExternal.lean" and fill the holes. *)
Require Import Primitives.
Import Primitives.
@@ -7,9 +7,9 @@ Require Import Coq.ZArith.ZArith.
Require Import List.
Import ListNotations.
Local Open Scope Primitives_scope.
-Module HashmapMain_TypesExternal_Template.
+Module Hashmap_TypesExternal_Template.
(** The state type used in the state-error monad *)
Axiom state : Type.
-End HashmapMain_TypesExternal_Template.
+End Hashmap_TypesExternal_Template.
diff --git a/tests/coq/hashmap_on_disk/HashmapMain_Funs.v b/tests/coq/hashmap_on_disk/HashmapMain_Funs.v
deleted file mode 100644
index facd84ea..00000000
--- a/tests/coq/hashmap_on_disk/HashmapMain_Funs.v
+++ /dev/null
@@ -1,589 +0,0 @@
-(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
-(** [hashmap_main]: function definitions *)
-Require Import Primitives.
-Import Primitives.
-Require Import Coq.ZArith.ZArith.
-Require Import List.
-Import ListNotations.
-Local Open Scope Primitives_scope.
-Require Import HashmapMain_Types.
-Include HashmapMain_Types.
-Require Import HashmapMain_FunsExternal.
-Include HashmapMain_FunsExternal.
-Module HashmapMain_Funs.
-
-(** [hashmap_main::hashmap::hash_key]:
- Source: 'tests/src/hashmap.rs', lines 27:0-27:32 *)
-Definition hashmap_hash_key (k : usize) : result usize :=
- Ok k.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::allocate_slots]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 50:4-56:5 *)
-Fixpoint hashmap_HashMap_allocate_slots_loop
- (T : Type) (n : nat) (slots : alloc_vec_Vec (hashmap_List_t T)) (n1 : usize)
- :
- result (alloc_vec_Vec (hashmap_List_t T))
- :=
- match n with
- | O => Fail_ OutOfFuel
- | S n2 =>
- if n1 s> 0%usize
- then (
- slots1 <- alloc_vec_Vec_push (hashmap_List_t T) slots Hashmap_List_Nil;
- n3 <- usize_sub n1 1%usize;
- hashmap_HashMap_allocate_slots_loop T n2 slots1 n3)
- else Ok slots
- end
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::allocate_slots]:
- Source: 'tests/src/hashmap.rs', lines 50:4-50:76 *)
-Definition hashmap_HashMap_allocate_slots
- (T : Type) (n : nat) (slots : alloc_vec_Vec (hashmap_List_t T)) (n1 : usize)
- :
- result (alloc_vec_Vec (hashmap_List_t T))
- :=
- hashmap_HashMap_allocate_slots_loop T n slots n1
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::new_with_capacity]:
- Source: 'tests/src/hashmap.rs', lines 59:4-63:13 *)
-Definition hashmap_HashMap_new_with_capacity
- (T : Type) (n : nat) (capacity : usize) (max_load_dividend : usize)
- (max_load_divisor : usize) :
- result (hashmap_HashMap_t T)
- :=
- slots <-
- hashmap_HashMap_allocate_slots T n (alloc_vec_Vec_new (hashmap_List_t T))
- capacity;
- i <- usize_mul capacity max_load_dividend;
- i1 <- usize_div i max_load_divisor;
- Ok
- {|
- hashmap_HashMap_num_entries := 0%usize;
- hashmap_HashMap_max_load_factor := (max_load_dividend, max_load_divisor);
- hashmap_HashMap_max_load := i1;
- hashmap_HashMap_slots := slots
- |}
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::new]:
- Source: 'tests/src/hashmap.rs', lines 75:4-75:24 *)
-Definition hashmap_HashMap_new
- (T : Type) (n : nat) : result (hashmap_HashMap_t T) :=
- hashmap_HashMap_new_with_capacity T n 32%usize 4%usize 5%usize
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::clear]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 80:4-88:5 *)
-Fixpoint hashmap_HashMap_clear_loop
- (T : Type) (n : nat) (slots : alloc_vec_Vec (hashmap_List_t T)) (i : usize) :
- result (alloc_vec_Vec (hashmap_List_t T))
- :=
- match n with
- | O => Fail_ OutOfFuel
- | S n1 =>
- let i1 := alloc_vec_Vec_len (hashmap_List_t T) slots in
- if i s< i1
- then (
- p <-
- alloc_vec_Vec_index_mut (hashmap_List_t T) usize
- (core_slice_index_SliceIndexUsizeSliceTInst (hashmap_List_t T)) slots
- i;
- let (_, index_mut_back) := p in
- i2 <- usize_add i 1%usize;
- slots1 <- index_mut_back Hashmap_List_Nil;
- hashmap_HashMap_clear_loop T n1 slots1 i2)
- else Ok slots
- end
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::clear]:
- Source: 'tests/src/hashmap.rs', lines 80:4-80:27 *)
-Definition hashmap_HashMap_clear
- (T : Type) (n : nat) (self : hashmap_HashMap_t T) :
- result (hashmap_HashMap_t T)
- :=
- hm <- hashmap_HashMap_clear_loop T n self.(hashmap_HashMap_slots) 0%usize;
- Ok
- {|
- hashmap_HashMap_num_entries := 0%usize;
- hashmap_HashMap_max_load_factor := self.(hashmap_HashMap_max_load_factor);
- hashmap_HashMap_max_load := self.(hashmap_HashMap_max_load);
- hashmap_HashMap_slots := hm
- |}
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::len]:
- Source: 'tests/src/hashmap.rs', lines 90:4-90:30 *)
-Definition hashmap_HashMap_len
- (T : Type) (self : hashmap_HashMap_t T) : result usize :=
- Ok self.(hashmap_HashMap_num_entries)
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_in_list]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 97:4-114:5 *)
-Fixpoint hashmap_HashMap_insert_in_list_loop
- (T : Type) (n : nat) (key : usize) (value : T) (ls : hashmap_List_t T) :
- result (bool * (hashmap_List_t T))
- :=
- match n with
- | O => Fail_ OutOfFuel
- | S n1 =>
- match ls with
- | Hashmap_List_Cons ckey cvalue tl =>
- if ckey s= key
- then Ok (false, Hashmap_List_Cons ckey value tl)
- else (
- p <- hashmap_HashMap_insert_in_list_loop T n1 key value tl;
- let (b, tl1) := p in
- Ok (b, Hashmap_List_Cons ckey cvalue tl1))
- | Hashmap_List_Nil =>
- Ok (true, Hashmap_List_Cons key value Hashmap_List_Nil)
- end
- end
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_in_list]:
- Source: 'tests/src/hashmap.rs', lines 97:4-97:71 *)
-Definition hashmap_HashMap_insert_in_list
- (T : Type) (n : nat) (key : usize) (value : T) (ls : hashmap_List_t T) :
- result (bool * (hashmap_List_t T))
- :=
- hashmap_HashMap_insert_in_list_loop T n key value ls
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_no_resize]:
- Source: 'tests/src/hashmap.rs', lines 117:4-117:54 *)
-Definition hashmap_HashMap_insert_no_resize
- (T : Type) (n : nat) (self : hashmap_HashMap_t T) (key : usize) (value : T) :
- result (hashmap_HashMap_t T)
- :=
- hash <- hashmap_hash_key key;
- let i := alloc_vec_Vec_len (hashmap_List_t T) self.(hashmap_HashMap_slots) in
- hash_mod <- usize_rem hash i;
- p <-
- alloc_vec_Vec_index_mut (hashmap_List_t T) usize
- (core_slice_index_SliceIndexUsizeSliceTInst (hashmap_List_t T))
- self.(hashmap_HashMap_slots) hash_mod;
- let (l, index_mut_back) := p in
- p1 <- hashmap_HashMap_insert_in_list T n key value l;
- let (inserted, l1) := p1 in
- if inserted
- then (
- i1 <- usize_add self.(hashmap_HashMap_num_entries) 1%usize;
- v <- index_mut_back l1;
- Ok
- {|
- hashmap_HashMap_num_entries := i1;
- hashmap_HashMap_max_load_factor :=
- self.(hashmap_HashMap_max_load_factor);
- hashmap_HashMap_max_load := self.(hashmap_HashMap_max_load);
- hashmap_HashMap_slots := v
- |})
- else (
- v <- index_mut_back l1;
- Ok
- {|
- hashmap_HashMap_num_entries := self.(hashmap_HashMap_num_entries);
- hashmap_HashMap_max_load_factor :=
- self.(hashmap_HashMap_max_load_factor);
- hashmap_HashMap_max_load := self.(hashmap_HashMap_max_load);
- hashmap_HashMap_slots := v
- |})
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements_from_list]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 183:4-196:5 *)
-Fixpoint hashmap_HashMap_move_elements_from_list_loop
- (T : Type) (n : nat) (ntable : hashmap_HashMap_t T) (ls : hashmap_List_t T) :
- result (hashmap_HashMap_t T)
- :=
- match n with
- | O => Fail_ OutOfFuel
- | S n1 =>
- match ls with
- | Hashmap_List_Cons k v tl =>
- ntable1 <- hashmap_HashMap_insert_no_resize T n1 ntable k v;
- hashmap_HashMap_move_elements_from_list_loop T n1 ntable1 tl
- | Hashmap_List_Nil => Ok ntable
- end
- end
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements_from_list]:
- Source: 'tests/src/hashmap.rs', lines 183:4-183:72 *)
-Definition hashmap_HashMap_move_elements_from_list
- (T : Type) (n : nat) (ntable : hashmap_HashMap_t T) (ls : hashmap_List_t T) :
- result (hashmap_HashMap_t T)
- :=
- hashmap_HashMap_move_elements_from_list_loop T n ntable ls
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 171:4-180:5 *)
-Fixpoint hashmap_HashMap_move_elements_loop
- (T : Type) (n : nat) (ntable : hashmap_HashMap_t T)
- (slots : alloc_vec_Vec (hashmap_List_t T)) (i : usize) :
- result ((hashmap_HashMap_t T) * (alloc_vec_Vec (hashmap_List_t T)))
- :=
- match n with
- | O => Fail_ OutOfFuel
- | S n1 =>
- let i1 := alloc_vec_Vec_len (hashmap_List_t T) slots in
- if i s< i1
- then (
- p <-
- alloc_vec_Vec_index_mut (hashmap_List_t T) usize
- (core_slice_index_SliceIndexUsizeSliceTInst (hashmap_List_t T)) slots
- i;
- let (l, index_mut_back) := p in
- let (ls, l1) := core_mem_replace (hashmap_List_t T) l Hashmap_List_Nil in
- ntable1 <- hashmap_HashMap_move_elements_from_list T n1 ntable ls;
- i2 <- usize_add i 1%usize;
- slots1 <- index_mut_back l1;
- hashmap_HashMap_move_elements_loop T n1 ntable1 slots1 i2)
- else Ok (ntable, slots)
- end
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements]:
- Source: 'tests/src/hashmap.rs', lines 171:4-171:95 *)
-Definition hashmap_HashMap_move_elements
- (T : Type) (n : nat) (ntable : hashmap_HashMap_t T)
- (slots : alloc_vec_Vec (hashmap_List_t T)) (i : usize) :
- result ((hashmap_HashMap_t T) * (alloc_vec_Vec (hashmap_List_t T)))
- :=
- hashmap_HashMap_move_elements_loop T n ntable slots i
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::try_resize]:
- Source: 'tests/src/hashmap.rs', lines 140:4-140:28 *)
-Definition hashmap_HashMap_try_resize
- (T : Type) (n : nat) (self : hashmap_HashMap_t T) :
- result (hashmap_HashMap_t T)
- :=
- max_usize <- scalar_cast U32 Usize core_u32_max;
- let capacity :=
- alloc_vec_Vec_len (hashmap_List_t T) self.(hashmap_HashMap_slots) in
- n1 <- usize_div max_usize 2%usize;
- let (i, i1) := self.(hashmap_HashMap_max_load_factor) in
- i2 <- usize_div n1 i;
- if capacity s<= i2
- then (
- i3 <- usize_mul capacity 2%usize;
- ntable <- hashmap_HashMap_new_with_capacity T n i3 i i1;
- p <-
- hashmap_HashMap_move_elements T n ntable self.(hashmap_HashMap_slots)
- 0%usize;
- let (ntable1, _) := p in
- Ok
- {|
- hashmap_HashMap_num_entries := self.(hashmap_HashMap_num_entries);
- hashmap_HashMap_max_load_factor := (i, i1);
- hashmap_HashMap_max_load := ntable1.(hashmap_HashMap_max_load);
- hashmap_HashMap_slots := ntable1.(hashmap_HashMap_slots)
- |})
- else
- Ok
- {|
- hashmap_HashMap_num_entries := self.(hashmap_HashMap_num_entries);
- hashmap_HashMap_max_load_factor := (i, i1);
- hashmap_HashMap_max_load := self.(hashmap_HashMap_max_load);
- hashmap_HashMap_slots := self.(hashmap_HashMap_slots)
- |}
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert]:
- Source: 'tests/src/hashmap.rs', lines 129:4-129:48 *)
-Definition hashmap_HashMap_insert
- (T : Type) (n : nat) (self : hashmap_HashMap_t T) (key : usize) (value : T) :
- result (hashmap_HashMap_t T)
- :=
- self1 <- hashmap_HashMap_insert_no_resize T n self key value;
- i <- hashmap_HashMap_len T self1;
- if i s> self1.(hashmap_HashMap_max_load)
- then hashmap_HashMap_try_resize T n self1
- else Ok self1
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key_in_list]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 206:4-219:5 *)
-Fixpoint hashmap_HashMap_contains_key_in_list_loop
- (T : Type) (n : nat) (key : usize) (ls : hashmap_List_t T) : result bool :=
- match n with
- | O => Fail_ OutOfFuel
- | S n1 =>
- match ls with
- | Hashmap_List_Cons ckey _ tl =>
- if ckey s= key
- then Ok true
- else hashmap_HashMap_contains_key_in_list_loop T n1 key tl
- | Hashmap_List_Nil => Ok false
- end
- end
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key_in_list]:
- Source: 'tests/src/hashmap.rs', lines 206:4-206:68 *)
-Definition hashmap_HashMap_contains_key_in_list
- (T : Type) (n : nat) (key : usize) (ls : hashmap_List_t T) : result bool :=
- hashmap_HashMap_contains_key_in_list_loop T n key ls
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key]:
- Source: 'tests/src/hashmap.rs', lines 199:4-199:49 *)
-Definition hashmap_HashMap_contains_key
- (T : Type) (n : nat) (self : hashmap_HashMap_t T) (key : usize) :
- result bool
- :=
- hash <- hashmap_hash_key key;
- let i := alloc_vec_Vec_len (hashmap_List_t T) self.(hashmap_HashMap_slots) in
- hash_mod <- usize_rem hash i;
- l <-
- alloc_vec_Vec_index (hashmap_List_t T) usize
- (core_slice_index_SliceIndexUsizeSliceTInst (hashmap_List_t T))
- self.(hashmap_HashMap_slots) hash_mod;
- hashmap_HashMap_contains_key_in_list T n key l
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_in_list]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 224:4-237:5 *)
-Fixpoint hashmap_HashMap_get_in_list_loop
- (T : Type) (n : nat) (key : usize) (ls : hashmap_List_t T) : result T :=
- match n with
- | O => Fail_ OutOfFuel
- | S n1 =>
- match ls with
- | Hashmap_List_Cons ckey cvalue tl =>
- if ckey s= key
- then Ok cvalue
- else hashmap_HashMap_get_in_list_loop T n1 key tl
- | Hashmap_List_Nil => Fail_ Failure
- end
- end
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_in_list]:
- Source: 'tests/src/hashmap.rs', lines 224:4-224:70 *)
-Definition hashmap_HashMap_get_in_list
- (T : Type) (n : nat) (key : usize) (ls : hashmap_List_t T) : result T :=
- hashmap_HashMap_get_in_list_loop T n key ls
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get]:
- Source: 'tests/src/hashmap.rs', lines 239:4-239:55 *)
-Definition hashmap_HashMap_get
- (T : Type) (n : nat) (self : hashmap_HashMap_t T) (key : usize) : result T :=
- hash <- hashmap_hash_key key;
- let i := alloc_vec_Vec_len (hashmap_List_t T) self.(hashmap_HashMap_slots) in
- hash_mod <- usize_rem hash i;
- l <-
- alloc_vec_Vec_index (hashmap_List_t T) usize
- (core_slice_index_SliceIndexUsizeSliceTInst (hashmap_List_t T))
- self.(hashmap_HashMap_slots) hash_mod;
- hashmap_HashMap_get_in_list T n key l
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut_in_list]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 245:4-254:5 *)
-Fixpoint hashmap_HashMap_get_mut_in_list_loop
- (T : Type) (n : nat) (ls : hashmap_List_t T) (key : usize) :
- result (T * (T -> result (hashmap_List_t T)))
- :=
- match n with
- | O => Fail_ OutOfFuel
- | S n1 =>
- match ls with
- | Hashmap_List_Cons ckey cvalue tl =>
- if ckey s= key
- then
- let back := fun (ret : T) => Ok (Hashmap_List_Cons ckey ret tl) in
- Ok (cvalue, back)
- else (
- p <- hashmap_HashMap_get_mut_in_list_loop T n1 tl key;
- let (t, back) := p in
- let back1 :=
- fun (ret : T) =>
- tl1 <- back ret; Ok (Hashmap_List_Cons ckey cvalue tl1) in
- Ok (t, back1))
- | Hashmap_List_Nil => Fail_ Failure
- end
- end
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut_in_list]:
- Source: 'tests/src/hashmap.rs', lines 245:4-245:86 *)
-Definition hashmap_HashMap_get_mut_in_list
- (T : Type) (n : nat) (ls : hashmap_List_t T) (key : usize) :
- result (T * (T -> result (hashmap_List_t T)))
- :=
- hashmap_HashMap_get_mut_in_list_loop T n ls key
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut]:
- Source: 'tests/src/hashmap.rs', lines 257:4-257:67 *)
-Definition hashmap_HashMap_get_mut
- (T : Type) (n : nat) (self : hashmap_HashMap_t T) (key : usize) :
- result (T * (T -> result (hashmap_HashMap_t T)))
- :=
- hash <- hashmap_hash_key key;
- let i := alloc_vec_Vec_len (hashmap_List_t T) self.(hashmap_HashMap_slots) in
- hash_mod <- usize_rem hash i;
- p <-
- alloc_vec_Vec_index_mut (hashmap_List_t T) usize
- (core_slice_index_SliceIndexUsizeSliceTInst (hashmap_List_t T))
- self.(hashmap_HashMap_slots) hash_mod;
- let (l, index_mut_back) := p in
- p1 <- hashmap_HashMap_get_mut_in_list T n l key;
- let (t, get_mut_in_list_back) := p1 in
- let back :=
- fun (ret : T) =>
- l1 <- get_mut_in_list_back ret;
- v <- index_mut_back l1;
- Ok
- {|
- hashmap_HashMap_num_entries := self.(hashmap_HashMap_num_entries);
- hashmap_HashMap_max_load_factor :=
- self.(hashmap_HashMap_max_load_factor);
- hashmap_HashMap_max_load := self.(hashmap_HashMap_max_load);
- hashmap_HashMap_slots := v
- |} in
- Ok (t, back)
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove_from_list]: loop 0:
- Source: 'tests/src/hashmap.rs', lines 265:4-291:5 *)
-Fixpoint hashmap_HashMap_remove_from_list_loop
- (T : Type) (n : nat) (key : usize) (ls : hashmap_List_t T) :
- result ((option T) * (hashmap_List_t T))
- :=
- match n with
- | O => Fail_ OutOfFuel
- | S n1 =>
- match ls with
- | Hashmap_List_Cons ckey t tl =>
- if ckey s= key
- then
- let (mv_ls, _) :=
- core_mem_replace (hashmap_List_t T) (Hashmap_List_Cons ckey t tl)
- Hashmap_List_Nil in
- match mv_ls with
- | Hashmap_List_Cons _ cvalue tl1 => Ok (Some cvalue, tl1)
- | Hashmap_List_Nil => Fail_ Failure
- end
- else (
- p <- hashmap_HashMap_remove_from_list_loop T n1 key tl;
- let (o, tl1) := p in
- Ok (o, Hashmap_List_Cons ckey t tl1))
- | Hashmap_List_Nil => Ok (None, Hashmap_List_Nil)
- end
- end
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove_from_list]:
- Source: 'tests/src/hashmap.rs', lines 265:4-265:69 *)
-Definition hashmap_HashMap_remove_from_list
- (T : Type) (n : nat) (key : usize) (ls : hashmap_List_t T) :
- result ((option T) * (hashmap_List_t T))
- :=
- hashmap_HashMap_remove_from_list_loop T n key ls
-.
-
-(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove]:
- Source: 'tests/src/hashmap.rs', lines 294:4-294:52 *)
-Definition hashmap_HashMap_remove
- (T : Type) (n : nat) (self : hashmap_HashMap_t T) (key : usize) :
- result ((option T) * (hashmap_HashMap_t T))
- :=
- hash <- hashmap_hash_key key;
- let i := alloc_vec_Vec_len (hashmap_List_t T) self.(hashmap_HashMap_slots) in
- hash_mod <- usize_rem hash i;
- p <-
- alloc_vec_Vec_index_mut (hashmap_List_t T) usize
- (core_slice_index_SliceIndexUsizeSliceTInst (hashmap_List_t T))
- self.(hashmap_HashMap_slots) hash_mod;
- let (l, index_mut_back) := p in
- p1 <- hashmap_HashMap_remove_from_list T n key l;
- let (x, l1) := p1 in
- match x with
- | None =>
- v <- index_mut_back l1;
- Ok (None,
- {|
- hashmap_HashMap_num_entries := self.(hashmap_HashMap_num_entries);
- hashmap_HashMap_max_load_factor :=
- self.(hashmap_HashMap_max_load_factor);
- hashmap_HashMap_max_load := self.(hashmap_HashMap_max_load);
- hashmap_HashMap_slots := v
- |})
- | Some x1 =>
- i1 <- usize_sub self.(hashmap_HashMap_num_entries) 1%usize;
- v <- index_mut_back l1;
- Ok (Some x1,
- {|
- hashmap_HashMap_num_entries := i1;
- hashmap_HashMap_max_load_factor :=
- self.(hashmap_HashMap_max_load_factor);
- hashmap_HashMap_max_load := self.(hashmap_HashMap_max_load);
- hashmap_HashMap_slots := v
- |})
- end
-.
-
-(** [hashmap_main::hashmap::test1]:
- Source: 'tests/src/hashmap.rs', lines 315:0-315:10 *)
-Definition hashmap_test1 (n : nat) : result unit :=
- hm <- hashmap_HashMap_new u64 n;
- hm1 <- hashmap_HashMap_insert u64 n hm 0%usize 42%u64;
- hm2 <- hashmap_HashMap_insert u64 n hm1 128%usize 18%u64;
- hm3 <- hashmap_HashMap_insert u64 n hm2 1024%usize 138%u64;
- hm4 <- hashmap_HashMap_insert u64 n hm3 1056%usize 256%u64;
- i <- hashmap_HashMap_get u64 n hm4 128%usize;
- if negb (i s= 18%u64)
- then Fail_ Failure
- else (
- p <- hashmap_HashMap_get_mut u64 n hm4 1024%usize;
- let (_, get_mut_back) := p in
- hm5 <- get_mut_back 56%u64;
- i1 <- hashmap_HashMap_get u64 n hm5 1024%usize;
- if negb (i1 s= 56%u64)
- then Fail_ Failure
- else (
- p1 <- hashmap_HashMap_remove u64 n hm5 1024%usize;
- let (x, hm6) := p1 in
- match x with
- | None => Fail_ Failure
- | Some x1 =>
- if negb (x1 s= 56%u64)
- then Fail_ Failure
- else (
- i2 <- hashmap_HashMap_get u64 n hm6 0%usize;
- if negb (i2 s= 42%u64)
- then Fail_ Failure
- else (
- i3 <- hashmap_HashMap_get u64 n hm6 128%usize;
- if negb (i3 s= 18%u64)
- then Fail_ Failure
- else (
- i4 <- hashmap_HashMap_get u64 n hm6 1056%usize;
- if negb (i4 s= 256%u64) then Fail_ Failure else Ok tt)))
- end))
-.
-
-(** [hashmap_main::insert_on_disk]:
- Source: 'tests/src/hashmap_main.rs', lines 7:0-7:43 *)
-Definition insert_on_disk
- (n : nat) (key : usize) (value : u64) (st : state) : result (state * unit) :=
- p <- hashmap_utils_deserialize st;
- let (st1, hm) := p in
- hm1 <- hashmap_HashMap_insert u64 n hm key value;
- hashmap_utils_serialize hm1 st1
-.
-
-(** [hashmap_main::main]:
- Source: 'tests/src/hashmap_main.rs', lines 16:0-16:13 *)
-Definition main : result unit :=
- Ok tt.
-
-End HashmapMain_Funs.
diff --git a/tests/coq/hashmap_on_disk/HashmapMain_FunsExternal.v b/tests/coq/hashmap_on_disk/HashmapMain_FunsExternal.v
deleted file mode 100644
index fb5f23cd..00000000
--- a/tests/coq/hashmap_on_disk/HashmapMain_FunsExternal.v
+++ /dev/null
@@ -1,24 +0,0 @@
-(** [hashmap_main]: external function declarations *)
-Require Import Primitives.
-Import Primitives.
-Require Import Coq.ZArith.ZArith.
-Require Import List.
-Import ListNotations.
-Local Open Scope Primitives_scope.
-Require Export HashmapMain_Types.
-Import HashmapMain_Types.
-Module HashmapMain_FunsExternal.
-
-(** [hashmap_main::hashmap_utils::deserialize]: forward function
- Source: 'src/hashmap_utils.rs', lines 10:0-10:43 *)
-Axiom hashmap_utils_deserialize
- : state -> result (state * (hashmap_HashMap_t u64))
-.
-
-(** [hashmap_main::hashmap_utils::serialize]: forward function
- Source: 'src/hashmap_utils.rs', lines 5:0-5:42 *)
-Axiom hashmap_utils_serialize
- : hashmap_HashMap_t u64 -> state -> result (state * unit)
-.
-
-End HashmapMain_FunsExternal.
diff --git a/tests/coq/hashmap_on_disk/HashmapMain_FunsExternal_Template.v b/tests/coq/hashmap_on_disk/HashmapMain_FunsExternal_Template.v
deleted file mode 100644
index f9e3f747..00000000
--- a/tests/coq/hashmap_on_disk/HashmapMain_FunsExternal_Template.v
+++ /dev/null
@@ -1,26 +0,0 @@
-(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
-(** [hashmap_main]: external functions.
--- This is a template file: rename it to "FunsExternal.lean" and fill the holes. *)
-Require Import Primitives.
-Import Primitives.
-Require Import Coq.ZArith.ZArith.
-Require Import List.
-Import ListNotations.
-Local Open Scope Primitives_scope.
-Require Import HashmapMain_Types.
-Include HashmapMain_Types.
-Module HashmapMain_FunsExternal_Template.
-
-(** [hashmap_main::hashmap_utils::deserialize]:
- Source: 'tests/src/hashmap_utils.rs', lines 10:0-10:43 *)
-Axiom hashmap_utils_deserialize
- : state -> result (state * (hashmap_HashMap_t u64))
-.
-
-(** [hashmap_main::hashmap_utils::serialize]:
- Source: 'tests/src/hashmap_utils.rs', lines 5:0-5:42 *)
-Axiom hashmap_utils_serialize
- : hashmap_HashMap_t u64 -> state -> result (state * unit)
-.
-
-End HashmapMain_FunsExternal_Template.
diff --git a/tests/coq/hashmap_on_disk/HashmapMain_Types.v b/tests/coq/hashmap_on_disk/HashmapMain_Types.v
deleted file mode 100644
index 26029c9d..00000000
--- a/tests/coq/hashmap_on_disk/HashmapMain_Types.v
+++ /dev/null
@@ -1,40 +0,0 @@
-(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
-(** [hashmap_main]: type definitions *)
-Require Import Primitives.
-Import Primitives.
-Require Import Coq.ZArith.ZArith.
-Require Import List.
-Import ListNotations.
-Local Open Scope Primitives_scope.
-Require Import HashmapMain_TypesExternal.
-Include HashmapMain_TypesExternal.
-Module HashmapMain_Types.
-
-(** [hashmap_main::hashmap::List]
- Source: 'tests/src/hashmap.rs', lines 19:0-19:16 *)
-Inductive hashmap_List_t (T : Type) :=
-| Hashmap_List_Cons : usize -> T -> hashmap_List_t T -> hashmap_List_t T
-| Hashmap_List_Nil : hashmap_List_t T
-.
-
-Arguments Hashmap_List_Cons { _ }.
-Arguments Hashmap_List_Nil { _ }.
-
-(** [hashmap_main::hashmap::HashMap]
- Source: 'tests/src/hashmap.rs', lines 35:0-35:21 *)
-Record hashmap_HashMap_t (T : Type) :=
-mkhashmap_HashMap_t {
- hashmap_HashMap_num_entries : usize;
- hashmap_HashMap_max_load_factor : (usize * usize);
- hashmap_HashMap_max_load : usize;
- hashmap_HashMap_slots : alloc_vec_Vec (hashmap_List_t T);
-}
-.
-
-Arguments mkhashmap_HashMap_t { _ }.
-Arguments hashmap_HashMap_num_entries { _ }.
-Arguments hashmap_HashMap_max_load_factor { _ }.
-Arguments hashmap_HashMap_max_load { _ }.
-Arguments hashmap_HashMap_slots { _ }.
-
-End HashmapMain_Types.
diff --git a/tests/coq/hashmap_on_disk/Makefile b/tests/coq/hashmap_on_disk/Makefile
deleted file mode 100644
index 1a5aee4a..00000000
--- a/tests/coq/hashmap_on_disk/Makefile
+++ /dev/null
@@ -1,23 +0,0 @@
-# This file was automatically generated - modify ../Makefile.template instead
-# Makefile originally taken from coq-club
-
-%: Makefile.coq phony
- +make -f Makefile.coq $@
-
-all: Makefile.coq
- +make -f Makefile.coq all
-
-clean: Makefile.coq
- +make -f Makefile.coq clean
- rm -f Makefile.coq
-
-Makefile.coq: _CoqProject Makefile
- coq_makefile -f _CoqProject | sed 's/$$(COQCHK) $$(COQCHKFLAGS) $$(COQLIBS)/$$(COQCHK) $$(COQCHKFLAGS) $$(subst -Q,-R,$$(COQLIBS))/' > Makefile.coq
-
-_CoqProject: ;
-
-Makefile: ;
-
-phony: ;
-
-.PHONY: all clean phony
diff --git a/tests/coq/hashmap_on_disk/Primitives.v b/tests/coq/hashmap_on_disk/Primitives.v
deleted file mode 100644
index b29fce43..00000000
--- a/tests/coq/hashmap_on_disk/Primitives.v
+++ /dev/null
@@ -1,981 +0,0 @@
-Require Import Lia.
-Require Coq.Strings.Ascii.
-Require Coq.Strings.String.
-Require Import Coq.Program.Equality.
-Require Import Coq.ZArith.ZArith.
-Require Import Coq.ZArith.Znat.
-Require Import List.
-Import ListNotations.
-
-Module Primitives.
-
- (* TODO: use more *)
-Declare Scope Primitives_scope.
-
-(*** Result *)
-
-Inductive error :=
- | Failure
- | OutOfFuel.
-
-Inductive result A :=
- | Ok : A -> result A
- | Fail_ : error -> result A.
-
-Arguments Ok {_} a.
-Arguments Fail_ {_}.
-
-Definition bind {A B} (m: result A) (f: A -> result B) : result B :=
- match m with
- | Fail_ e => Fail_ e
- | Ok x => f x
- end.
-
-Definition return_ {A: Type} (x: A) : result A := Ok x.
-Definition fail_ {A: Type} (e: error) : result A := Fail_ e.
-
-Notation "x <- c1 ; c2" := (bind c1 (fun x => c2))
- (at level 61, c1 at next level, right associativity).
-
-(** Monadic assert *)
-Definition massert (b: bool) : result unit :=
- if b then Ok tt else Fail_ Failure.
-
-(** Normalize and unwrap a successful result (used for globals) *)
-Definition eval_result_refl {A} {x} (a: result A) (p: a = Ok x) : A :=
- match a as r return (r = Ok x -> A) with
- | Ok a' => fun _ => a'
- | Fail_ e => fun p' =>
- False_rect _ (eq_ind (Fail_ e)
- (fun e : result A =>
- match e with
- | Ok _ => False
- | Fail_ e => True
- end)
- I (Ok x) p')
- end p.
-
-Notation "x %global" := (eval_result_refl x eq_refl) (at level 40).
-Notation "x %return" := (eval_result_refl x eq_refl) (at level 40).
-
-(* Sanity check *)
-Check (if true then Ok (1 + 2) else Fail_ Failure)%global = 3.
-
-(*** Misc *)
-
-Definition string := Coq.Strings.String.string.
-Definition char := Coq.Strings.Ascii.ascii.
-Definition char_of_byte := Coq.Strings.Ascii.ascii_of_byte.
-
-Definition core_mem_replace (a : Type) (x : a) (y : a) : a * a := (x, x) .
-
-Record mut_raw_ptr (T : Type) := { mut_raw_ptr_v : T }.
-Record const_raw_ptr (T : Type) := { const_raw_ptr_v : T }.
-
-(*** Scalars *)
-
-Definition i8_min : Z := -128%Z.
-Definition i8_max : Z := 127%Z.
-Definition i16_min : Z := -32768%Z.
-Definition i16_max : Z := 32767%Z.
-Definition i32_min : Z := -2147483648%Z.
-Definition i32_max : Z := 2147483647%Z.
-Definition i64_min : Z := -9223372036854775808%Z.
-Definition i64_max : Z := 9223372036854775807%Z.
-Definition i128_min : Z := -170141183460469231731687303715884105728%Z.
-Definition i128_max : Z := 170141183460469231731687303715884105727%Z.
-Definition u8_min : Z := 0%Z.
-Definition u8_max : Z := 255%Z.
-Definition u16_min : Z := 0%Z.
-Definition u16_max : Z := 65535%Z.
-Definition u32_min : Z := 0%Z.
-Definition u32_max : Z := 4294967295%Z.
-Definition u64_min : Z := 0%Z.
-Definition u64_max : Z := 18446744073709551615%Z.
-Definition u128_min : Z := 0%Z.
-Definition u128_max : Z := 340282366920938463463374607431768211455%Z.
-
-(** The bounds of [isize] and [usize] vary with the architecture. *)
-Axiom isize_min : Z.
-Axiom isize_max : Z.
-Definition usize_min : Z := 0%Z.
-Axiom usize_max : Z.
-
-Open Scope Z_scope.
-
-(** We provide those lemmas to reason about the bounds of [isize] and [usize] *)
-Axiom isize_min_bound : isize_min <= i32_min.
-Axiom isize_max_bound : i32_max <= isize_max.
-Axiom usize_max_bound : u32_max <= usize_max.
-
-Inductive scalar_ty :=
- | Isize
- | I8
- | I16
- | I32
- | I64
- | I128
- | Usize
- | U8
- | U16
- | U32
- | U64
- | U128
-.
-
-Definition scalar_min (ty: scalar_ty) : Z :=
- match ty with
- | Isize => isize_min
- | I8 => i8_min
- | I16 => i16_min
- | I32 => i32_min
- | I64 => i64_min
- | I128 => i128_min
- | Usize => usize_min
- | U8 => u8_min
- | U16 => u16_min
- | U32 => u32_min
- | U64 => u64_min
- | U128 => u128_min
-end.
-
-Definition scalar_max (ty: scalar_ty) : Z :=
- match ty with
- | Isize => isize_max
- | I8 => i8_max
- | I16 => i16_max
- | I32 => i32_max
- | I64 => i64_max
- | I128 => i128_max
- | Usize => usize_max
- | U8 => u8_max
- | U16 => u16_max
- | U32 => u32_max
- | U64 => u64_max
- | U128 => u128_max
-end.
-
-(** We use the following conservative bounds to make sure we can compute bound
- checks in most situations *)
-Definition scalar_min_cons (ty: scalar_ty) : Z :=
- match ty with
- | Isize => i32_min
- | Usize => u32_min
- | _ => scalar_min ty
-end.
-
-Definition scalar_max_cons (ty: scalar_ty) : Z :=
- match ty with
- | Isize => i32_max
- | Usize => u32_max
- | _ => scalar_max ty
-end.
-
-Lemma scalar_min_cons_valid : forall ty, scalar_min ty <= scalar_min_cons ty .
-Proof.
- destruct ty; unfold scalar_min_cons, scalar_min; try lia.
- - pose isize_min_bound; lia.
- - apply Z.le_refl.
-Qed.
-
-Lemma scalar_max_cons_valid : forall ty, scalar_max ty >= scalar_max_cons ty .
-Proof.
- destruct ty; unfold scalar_max_cons, scalar_max; try lia.
- - pose isize_max_bound; lia.
- - pose usize_max_bound. lia.
-Qed.
-
-Definition scalar (ty: scalar_ty) : Type :=
- { x: Z | scalar_min ty <= x <= scalar_max ty }.
-
-Definition to_Z {ty} (x: scalar ty) : Z := proj1_sig x.
-
-(** Bounds checks: we start by using the conservative bounds, to make sure we
- can compute in most situations, then we use the real bounds (for [isize]
- and [usize]). *)
-Definition scalar_ge_min (ty: scalar_ty) (x: Z) : bool :=
- Z.leb (scalar_min_cons ty) x || Z.leb (scalar_min ty) x.
-
-Definition scalar_le_max (ty: scalar_ty) (x: Z) : bool :=
- Z.leb x (scalar_max_cons ty) || Z.leb x (scalar_max ty).
-
-Lemma scalar_ge_min_valid (ty: scalar_ty) (x: Z) :
- scalar_ge_min ty x = true -> scalar_min ty <= x .
-Proof.
- unfold scalar_ge_min.
- pose (scalar_min_cons_valid ty).
- lia.
-Qed.
-
-Lemma scalar_le_max_valid (ty: scalar_ty) (x: Z) :
- scalar_le_max ty x = true -> x <= scalar_max ty .
-Proof.
- unfold scalar_le_max.
- pose (scalar_max_cons_valid ty).
- lia.
-Qed.
-
-Definition scalar_in_bounds (ty: scalar_ty) (x: Z) : bool :=
- scalar_ge_min ty x && scalar_le_max ty x .
-
-Lemma scalar_in_bounds_valid (ty: scalar_ty) (x: Z) :
- scalar_in_bounds ty x = true -> scalar_min ty <= x <= scalar_max ty .
-Proof.
- unfold scalar_in_bounds.
- intros H.
- destruct (scalar_ge_min ty x) eqn:Hmin.
- - destruct (scalar_le_max ty x) eqn:Hmax.
- + pose (scalar_ge_min_valid ty x Hmin).
- pose (scalar_le_max_valid ty x Hmax).
- lia.
- + inversion H.
- - inversion H.
-Qed.
-
-Import Sumbool.
-
-Definition mk_scalar (ty: scalar_ty) (x: Z) : result (scalar ty) :=
- match sumbool_of_bool (scalar_in_bounds ty x) with
- | left H => Ok (exist _ x (scalar_in_bounds_valid _ _ H))
- | right _ => Fail_ Failure
- end.
-
-Definition scalar_add {ty} (x y: scalar ty) : result (scalar ty) := mk_scalar ty (to_Z x + to_Z y).
-
-Definition scalar_sub {ty} (x y: scalar ty) : result (scalar ty) := mk_scalar ty (to_Z x - to_Z y).
-
-Definition scalar_mul {ty} (x y: scalar ty) : result (scalar ty) := mk_scalar ty (to_Z x * to_Z y).
-
-Definition scalar_div {ty} (x y: scalar ty) : result (scalar ty) :=
- if to_Z y =? 0 then Fail_ Failure else
- mk_scalar ty (to_Z x / to_Z y).
-
-Definition scalar_rem {ty} (x y: scalar ty) : result (scalar ty) := mk_scalar ty (Z.rem (to_Z x) (to_Z y)).
-
-Definition scalar_neg {ty} (x: scalar ty) : result (scalar ty) := mk_scalar ty (-(to_Z x)).
-
-Axiom scalar_xor : forall ty, scalar ty -> scalar ty -> scalar ty. (* TODO *)
-Axiom scalar_or : forall ty, scalar ty -> scalar ty -> scalar ty. (* TODO *)
-Axiom scalar_and : forall ty, scalar ty -> scalar ty -> scalar ty. (* TODO *)
-Axiom scalar_shl : forall ty0 ty1, scalar ty0 -> scalar ty1 -> result (scalar ty0). (* TODO *)
-Axiom scalar_shr : forall ty0 ty1, scalar ty0 -> scalar ty1 -> result (scalar ty0). (* TODO *)
-
-(** Cast an integer from a [src_ty] to a [tgt_ty] *)
-(* TODO: check the semantics of casts in Rust *)
-Definition scalar_cast (src_ty tgt_ty : scalar_ty) (x : scalar src_ty) : result (scalar tgt_ty) :=
- mk_scalar tgt_ty (to_Z x).
-
-(* This can't fail, but for now we make all casts faillible (easier for the translation) *)
-Definition scalar_cast_bool (tgt_ty : scalar_ty) (x : bool) : result (scalar tgt_ty) :=
- mk_scalar tgt_ty (if x then 1 else 0).
-
-(** Comparisons *)
-Definition scalar_leb {ty : scalar_ty} (x : scalar ty) (y : scalar ty) : bool :=
- Z.leb (to_Z x) (to_Z y) .
-
-Definition scalar_ltb {ty : scalar_ty} (x : scalar ty) (y : scalar ty) : bool :=
- Z.ltb (to_Z x) (to_Z y) .
-
-Definition scalar_geb {ty : scalar_ty} (x : scalar ty) (y : scalar ty) : bool :=
- Z.geb (to_Z x) (to_Z y) .
-
-Definition scalar_gtb {ty : scalar_ty} (x : scalar ty) (y : scalar ty) : bool :=
- Z.gtb (to_Z x) (to_Z y) .
-
-Definition scalar_eqb {ty : scalar_ty} (x : scalar ty) (y : scalar ty) : bool :=
- Z.eqb (to_Z x) (to_Z y) .
-
-Definition scalar_neqb {ty : scalar_ty} (x : scalar ty) (y : scalar ty) : bool :=
- negb (Z.eqb (to_Z x) (to_Z y)) .
-
-
-(** The scalar types *)
-Definition isize := scalar Isize.
-Definition i8 := scalar I8.
-Definition i16 := scalar I16.
-Definition i32 := scalar I32.
-Definition i64 := scalar I64.
-Definition i128 := scalar I128.
-Definition usize := scalar Usize.
-Definition u8 := scalar U8.
-Definition u16 := scalar U16.
-Definition u32 := scalar U32.
-Definition u64 := scalar U64.
-Definition u128 := scalar U128.
-
-(** Negaion *)
-Definition isize_neg := @scalar_neg Isize.
-Definition i8_neg := @scalar_neg I8.
-Definition i16_neg := @scalar_neg I16.
-Definition i32_neg := @scalar_neg I32.
-Definition i64_neg := @scalar_neg I64.
-Definition i128_neg := @scalar_neg I128.
-
-(** Division *)
-Definition isize_div := @scalar_div Isize.
-Definition i8_div := @scalar_div I8.
-Definition i16_div := @scalar_div I16.
-Definition i32_div := @scalar_div I32.
-Definition i64_div := @scalar_div I64.
-Definition i128_div := @scalar_div I128.
-Definition usize_div := @scalar_div Usize.
-Definition u8_div := @scalar_div U8.
-Definition u16_div := @scalar_div U16.
-Definition u32_div := @scalar_div U32.
-Definition u64_div := @scalar_div U64.
-Definition u128_div := @scalar_div U128.
-
-(** Remainder *)
-Definition isize_rem := @scalar_rem Isize.
-Definition i8_rem := @scalar_rem I8.
-Definition i16_rem := @scalar_rem I16.
-Definition i32_rem := @scalar_rem I32.
-Definition i64_rem := @scalar_rem I64.
-Definition i128_rem := @scalar_rem I128.
-Definition usize_rem := @scalar_rem Usize.
-Definition u8_rem := @scalar_rem U8.
-Definition u16_rem := @scalar_rem U16.
-Definition u32_rem := @scalar_rem U32.
-Definition u64_rem := @scalar_rem U64.
-Definition u128_rem := @scalar_rem U128.
-
-(** Addition *)
-Definition isize_add := @scalar_add Isize.
-Definition i8_add := @scalar_add I8.
-Definition i16_add := @scalar_add I16.
-Definition i32_add := @scalar_add I32.
-Definition i64_add := @scalar_add I64.
-Definition i128_add := @scalar_add I128.
-Definition usize_add := @scalar_add Usize.
-Definition u8_add := @scalar_add U8.
-Definition u16_add := @scalar_add U16.
-Definition u32_add := @scalar_add U32.
-Definition u64_add := @scalar_add U64.
-Definition u128_add := @scalar_add U128.
-
-(** Substraction *)
-Definition isize_sub := @scalar_sub Isize.
-Definition i8_sub := @scalar_sub I8.
-Definition i16_sub := @scalar_sub I16.
-Definition i32_sub := @scalar_sub I32.
-Definition i64_sub := @scalar_sub I64.
-Definition i128_sub := @scalar_sub I128.
-Definition usize_sub := @scalar_sub Usize.
-Definition u8_sub := @scalar_sub U8.
-Definition u16_sub := @scalar_sub U16.
-Definition u32_sub := @scalar_sub U32.
-Definition u64_sub := @scalar_sub U64.
-Definition u128_sub := @scalar_sub U128.
-
-(** Multiplication *)
-Definition isize_mul := @scalar_mul Isize.
-Definition i8_mul := @scalar_mul I8.
-Definition i16_mul := @scalar_mul I16.
-Definition i32_mul := @scalar_mul I32.
-Definition i64_mul := @scalar_mul I64.
-Definition i128_mul := @scalar_mul I128.
-Definition usize_mul := @scalar_mul Usize.
-Definition u8_mul := @scalar_mul U8.
-Definition u16_mul := @scalar_mul U16.
-Definition u32_mul := @scalar_mul U32.
-Definition u64_mul := @scalar_mul U64.
-Definition u128_mul := @scalar_mul U128.
-
-(** Xor *)
-Definition u8_xor := @scalar_xor U8.
-Definition u16_xor := @scalar_xor U16.
-Definition u32_xor := @scalar_xor U32.
-Definition u64_xor := @scalar_xor U64.
-Definition u128_xor := @scalar_xor U128.
-Definition usize_xor := @scalar_xor Usize.
-Definition i8_xor := @scalar_xor I8.
-Definition i16_xor := @scalar_xor I16.
-Definition i32_xor := @scalar_xor I32.
-Definition i64_xor := @scalar_xor I64.
-Definition i128_xor := @scalar_xor I128.
-Definition isize_xor := @scalar_xor Isize.
-
-(** Or *)
-Definition u8_or := @scalar_or U8.
-Definition u16_or := @scalar_or U16.
-Definition u32_or := @scalar_or U32.
-Definition u64_or := @scalar_or U64.
-Definition u128_or := @scalar_or U128.
-Definition usize_or := @scalar_or Usize.
-Definition i8_or := @scalar_or I8.
-Definition i16_or := @scalar_or I16.
-Definition i32_or := @scalar_or I32.
-Definition i64_or := @scalar_or I64.
-Definition i128_or := @scalar_or I128.
-Definition isize_or := @scalar_or Isize.
-
-(** And *)
-Definition u8_and := @scalar_and U8.
-Definition u16_and := @scalar_and U16.
-Definition u32_and := @scalar_and U32.
-Definition u64_and := @scalar_and U64.
-Definition u128_and := @scalar_and U128.
-Definition usize_and := @scalar_and Usize.
-Definition i8_and := @scalar_and I8.
-Definition i16_and := @scalar_and I16.
-Definition i32_and := @scalar_and I32.
-Definition i64_and := @scalar_and I64.
-Definition i128_and := @scalar_and I128.
-Definition isize_and := @scalar_and Isize.
-
-(** Shift left *)
-Definition u8_shl {ty} := @scalar_shl U8 ty.
-Definition u16_shl {ty} := @scalar_shl U16 ty.
-Definition u32_shl {ty} := @scalar_shl U32 ty.
-Definition u64_shl {ty} := @scalar_shl U64 ty.
-Definition u128_shl {ty} := @scalar_shl U128 ty.
-Definition usize_shl {ty} := @scalar_shl Usize ty.
-Definition i8_shl {ty} := @scalar_shl I8 ty.
-Definition i16_shl {ty} := @scalar_shl I16 ty.
-Definition i32_shl {ty} := @scalar_shl I32 ty.
-Definition i64_shl {ty} := @scalar_shl I64 ty.
-Definition i128_shl {ty} := @scalar_shl I128 ty.
-Definition isize_shl {ty} := @scalar_shl Isize ty.
-
-(** Shift right *)
-Definition u8_shr {ty} := @scalar_shr U8 ty.
-Definition u16_shr {ty} := @scalar_shr U16 ty.
-Definition u32_shr {ty} := @scalar_shr U32 ty.
-Definition u64_shr {ty} := @scalar_shr U64 ty.
-Definition u128_shr {ty} := @scalar_shr U128 ty.
-Definition usize_shr {ty} := @scalar_shr Usize ty.
-Definition i8_shr {ty} := @scalar_shr I8 ty.
-Definition i16_shr {ty} := @scalar_shr I16 ty.
-Definition i32_shr {ty} := @scalar_shr I32 ty.
-Definition i64_shr {ty} := @scalar_shr I64 ty.
-Definition i128_shr {ty} := @scalar_shr I128 ty.
-Definition isize_shr {ty} := @scalar_shr Isize ty.
-
-(** Small utility *)
-Definition usize_to_nat (x: usize) : nat := Z.to_nat (to_Z x).
-
-(** Notations *)
-Notation "x %isize" := ((mk_scalar Isize x)%return) (at level 9).
-Notation "x %i8" := ((mk_scalar I8 x)%return) (at level 9).
-Notation "x %i16" := ((mk_scalar I16 x)%return) (at level 9).
-Notation "x %i32" := ((mk_scalar I32 x)%return) (at level 9).
-Notation "x %i64" := ((mk_scalar I64 x)%return) (at level 9).
-Notation "x %i128" := ((mk_scalar I128 x)%return) (at level 9).
-Notation "x %usize" := ((mk_scalar Usize x)%return) (at level 9).
-Notation "x %u8" := ((mk_scalar U8 x)%return) (at level 9).
-Notation "x %u16" := ((mk_scalar U16 x)%return) (at level 9).
-Notation "x %u32" := ((mk_scalar U32 x)%return) (at level 9).
-Notation "x %u64" := ((mk_scalar U64 x)%return) (at level 9).
-Notation "x %u128" := ((mk_scalar U128 x)%return) (at level 9).
-
-Notation "x s= y" := (scalar_eqb x y) (at level 80) : Primitives_scope.
-Notation "x s<> y" := (scalar_neqb x y) (at level 80) : Primitives_scope.
-Notation "x s<= y" := (scalar_leb x y) (at level 80) : Primitives_scope.
-Notation "x s< y" := (scalar_ltb x y) (at level 80) : Primitives_scope.
-Notation "x s>= y" := (scalar_geb x y) (at level 80) : Primitives_scope.
-Notation "x s> y" := (scalar_gtb x y) (at level 80) : Primitives_scope.
-
-(** Constants *)
-Definition core_u8_max := u8_max %u32.
-Definition core_u16_max := u16_max %u32.
-Definition core_u32_max := u32_max %u32.
-Definition core_u64_max := u64_max %u64.
-Definition core_u128_max := u64_max %u128.
-Axiom core_usize_max : usize. (** TODO *)
-Definition core_i8_max := i8_max %i32.
-Definition core_i16_max := i16_max %i32.
-Definition core_i32_max := i32_max %i32.
-Definition core_i64_max := i64_max %i64.
-Definition core_i128_max := i64_max %i128.
-Axiom core_isize_max : isize. (** TODO *)
-
-(*** core *)
-
-(** Trait declaration: [core::clone::Clone] *)
-Record core_clone_Clone (self : Type) := {
- clone : self -> result self
-}.
-
-Definition core_clone_impls_CloneBool_clone (b : bool) : bool := b.
-
-Definition core_clone_CloneBool : core_clone_Clone bool := {|
- clone := fun b => Ok (core_clone_impls_CloneBool_clone b)
-|}.
-
-Definition core_clone_impls_CloneUsize_clone (x : usize) : usize := x.
-Definition core_clone_impls_CloneU8_clone (x : u8) : u8 := x.
-Definition core_clone_impls_CloneU16_clone (x : u16) : u16 := x.
-Definition core_clone_impls_CloneU32_clone (x : u32) : u32 := x.
-Definition core_clone_impls_CloneU64_clone (x : u64) : u64 := x.
-Definition core_clone_impls_CloneU128_clone (x : u128) : u128 := x.
-
-Definition core_clone_impls_CloneIsize_clone (x : isize) : isize := x.
-Definition core_clone_impls_CloneI8_clone (x : i8) : i8 := x.
-Definition core_clone_impls_CloneI16_clone (x : i16) : i16 := x.
-Definition core_clone_impls_CloneI32_clone (x : i32) : i32 := x.
-Definition core_clone_impls_CloneI64_clone (x : i64) : i64 := x.
-Definition core_clone_impls_CloneI128_clone (x : i128) : i128 := x.
-
-Definition core_clone_CloneUsize : core_clone_Clone usize := {|
- clone := fun x => Ok (core_clone_impls_CloneUsize_clone x)
-|}.
-
-Definition core_clone_CloneU8 : core_clone_Clone u8 := {|
- clone := fun x => Ok (core_clone_impls_CloneU8_clone x)
-|}.
-
-Definition core_clone_CloneU16 : core_clone_Clone u16 := {|
- clone := fun x => Ok (core_clone_impls_CloneU16_clone x)
-|}.
-
-Definition core_clone_CloneU32 : core_clone_Clone u32 := {|
- clone := fun x => Ok (core_clone_impls_CloneU32_clone x)
-|}.
-
-Definition core_clone_CloneU64 : core_clone_Clone u64 := {|
- clone := fun x => Ok (core_clone_impls_CloneU64_clone x)
-|}.
-
-Definition core_clone_CloneU128 : core_clone_Clone u128 := {|
- clone := fun x => Ok (core_clone_impls_CloneU128_clone x)
-|}.
-
-Definition core_clone_CloneIsize : core_clone_Clone isize := {|
- clone := fun x => Ok (core_clone_impls_CloneIsize_clone x)
-|}.
-
-Definition core_clone_CloneI8 : core_clone_Clone i8 := {|
- clone := fun x => Ok (core_clone_impls_CloneI8_clone x)
-|}.
-
-Definition core_clone_CloneI16 : core_clone_Clone i16 := {|
- clone := fun x => Ok (core_clone_impls_CloneI16_clone x)
-|}.
-
-Definition core_clone_CloneI32 : core_clone_Clone i32 := {|
- clone := fun x => Ok (core_clone_impls_CloneI32_clone x)
-|}.
-
-Definition core_clone_CloneI64 : core_clone_Clone i64 := {|
- clone := fun x => Ok (core_clone_impls_CloneI64_clone x)
-|}.
-
-Definition core_clone_CloneI128 : core_clone_Clone i128 := {|
- clone := fun x => Ok (core_clone_impls_CloneI128_clone x)
-|}.
-
-(** [core::option::{core::option::Option<T>}::unwrap] *)
-Definition core_option_Option_unwrap (T : Type) (x : option T) : result T :=
- match x with
- | None => Fail_ Failure
- | Some x => Ok x
- end.
-
-(*** core::ops *)
-
-(* Trait declaration: [core::ops::index::Index] *)
-Record core_ops_index_Index (Self Idx : Type) := mk_core_ops_index_Index {
- core_ops_index_Index_Output : Type;
- core_ops_index_Index_index : Self -> Idx -> result core_ops_index_Index_Output;
-}.
-Arguments mk_core_ops_index_Index {_ _}.
-Arguments core_ops_index_Index_Output {_ _}.
-Arguments core_ops_index_Index_index {_ _}.
-
-(* Trait declaration: [core::ops::index::IndexMut] *)
-Record core_ops_index_IndexMut (Self Idx : Type) := mk_core_ops_index_IndexMut {
- core_ops_index_IndexMut_indexInst : core_ops_index_Index Self Idx;
- core_ops_index_IndexMut_index_mut :
- Self ->
- Idx ->
- result (core_ops_index_IndexMut_indexInst.(core_ops_index_Index_Output) *
- (core_ops_index_IndexMut_indexInst.(core_ops_index_Index_Output) -> result Self));
-}.
-Arguments mk_core_ops_index_IndexMut {_ _}.
-Arguments core_ops_index_IndexMut_indexInst {_ _}.
-Arguments core_ops_index_IndexMut_index_mut {_ _}.
-
-(* Trait declaration [core::ops::deref::Deref] *)
-Record core_ops_deref_Deref (Self : Type) := mk_core_ops_deref_Deref {
- core_ops_deref_Deref_target : Type;
- core_ops_deref_Deref_deref : Self -> result core_ops_deref_Deref_target;
-}.
-Arguments mk_core_ops_deref_Deref {_}.
-Arguments core_ops_deref_Deref_target {_}.
-Arguments core_ops_deref_Deref_deref {_}.
-
-(* Trait declaration [core::ops::deref::DerefMut] *)
-Record core_ops_deref_DerefMut (Self : Type) := mk_core_ops_deref_DerefMut {
- core_ops_deref_DerefMut_derefInst : core_ops_deref_Deref Self;
- core_ops_deref_DerefMut_deref_mut :
- Self ->
- result (core_ops_deref_DerefMut_derefInst.(core_ops_deref_Deref_target) *
- (core_ops_deref_DerefMut_derefInst.(core_ops_deref_Deref_target) -> result Self));
-}.
-Arguments mk_core_ops_deref_DerefMut {_}.
-Arguments core_ops_deref_DerefMut_derefInst {_}.
-Arguments core_ops_deref_DerefMut_deref_mut {_}.
-
-Record core_ops_range_Range (T : Type) := mk_core_ops_range_Range {
- core_ops_range_Range_start : T;
- core_ops_range_Range_end_ : T;
-}.
-Arguments mk_core_ops_range_Range {_}.
-Arguments core_ops_range_Range_start {_}.
-Arguments core_ops_range_Range_end_ {_}.
-
-(*** [alloc] *)
-
-Definition alloc_boxed_Box_deref (T : Type) (x : T) : result T := Ok x.
-Definition alloc_boxed_Box_deref_mut (T : Type) (x : T) : result (T * (T -> result T)) :=
- Ok (x, fun x => Ok x).
-
-(* Trait instance *)
-Definition alloc_boxed_Box_coreopsDerefInst (Self : Type) : core_ops_deref_Deref Self := {|
- core_ops_deref_Deref_target := Self;
- core_ops_deref_Deref_deref := alloc_boxed_Box_deref Self;
-|}.
-
-(* Trait instance *)
-Definition alloc_boxed_Box_coreopsDerefMutInst (Self : Type) : core_ops_deref_DerefMut Self := {|
- core_ops_deref_DerefMut_derefInst := alloc_boxed_Box_coreopsDerefInst Self;
- core_ops_deref_DerefMut_deref_mut := alloc_boxed_Box_deref_mut Self;
-|}.
-
-
-(*** Arrays *)
-Definition array T (n : usize) := { l: list T | Z.of_nat (length l) = to_Z n}.
-
-Lemma le_0_usize_max : 0 <= usize_max.
-Proof.
- pose (H := usize_max_bound).
- unfold u32_max in H.
- lia.
-Qed.
-
-Lemma eqb_imp_eq (x y : Z) : Z.eqb x y = true -> x = y.
-Proof.
- lia.
-Qed.
-
-(* TODO: finish the definitions *)
-Axiom mk_array : forall (T : Type) (n : usize) (l : list T), array T n.
-
-(* For initialization *)
-Axiom array_repeat : forall (T : Type) (n : usize) (x : T), array T n.
-
-Axiom array_index_usize : forall (T : Type) (n : usize) (x : array T n) (i : usize), result T.
-Axiom array_update_usize : forall (T : Type) (n : usize) (x : array T n) (i : usize) (nx : T), result (array T n).
-
-Definition array_index_mut_usize (T : Type) (n : usize) (a : array T n) (i : usize) :
- result (T * (T -> result (array T n))) :=
- match array_index_usize T n a i with
- | Fail_ e => Fail_ e
- | Ok x => Ok (x, array_update_usize T n a i)
- end.
-
-(*** Slice *)
-Definition slice T := { l: list T | Z.of_nat (length l) <= usize_max}.
-
-Axiom slice_len : forall (T : Type) (s : slice T), usize.
-Axiom slice_index_usize : forall (T : Type) (x : slice T) (i : usize), result T.
-Axiom slice_update_usize : forall (T : Type) (x : slice T) (i : usize) (nx : T), result (slice T).
-
-Definition slice_index_mut_usize (T : Type) (s : slice T) (i : usize) :
- result (T * (T -> result (slice T))) :=
- match slice_index_usize T s i with
- | Fail_ e => Fail_ e
- | Ok x => Ok (x, slice_update_usize T s i)
- end.
-
-(*** Subslices *)
-
-Axiom array_to_slice : forall (T : Type) (n : usize) (x : array T n), result (slice T).
-Axiom array_from_slice : forall (T : Type) (n : usize) (x : array T n) (s : slice T), result (array T n).
-
-Definition array_to_slice_mut (T : Type) (n : usize) (a : array T n) :
- result (slice T * (slice T -> result (array T n))) :=
- match array_to_slice T n a with
- | Fail_ e => Fail_ e
- | Ok x => Ok (x, array_from_slice T n a)
- end.
-
-Axiom array_subslice: forall (T : Type) (n : usize) (x : array T n) (r : core_ops_range_Range usize), result (slice T).
-Axiom array_update_subslice: forall (T : Type) (n : usize) (x : array T n) (r : core_ops_range_Range usize) (ns : slice T), result (array T n).
-
-Axiom slice_subslice: forall (T : Type) (x : slice T) (r : core_ops_range_Range usize), result (slice T).
-Axiom slice_update_subslice: forall (T : Type) (x : slice T) (r : core_ops_range_Range usize) (ns : slice T), result (slice T).
-
-(*** Vectors *)
-
-Definition alloc_vec_Vec T := { l: list T | Z.of_nat (length l) <= usize_max }.
-
-Definition alloc_vec_Vec_to_list {T: Type} (v: alloc_vec_Vec T) : list T := proj1_sig v.
-
-Definition alloc_vec_Vec_length {T: Type} (v: alloc_vec_Vec T) : Z := Z.of_nat (length (alloc_vec_Vec_to_list v)).
-
-Definition alloc_vec_Vec_new (T: Type) : alloc_vec_Vec T := (exist _ [] le_0_usize_max).
-
-Lemma alloc_vec_Vec_len_in_usize {T} (v: alloc_vec_Vec T) : usize_min <= alloc_vec_Vec_length v <= usize_max.
-Proof.
- unfold alloc_vec_Vec_length, usize_min.
- split.
- - lia.
- - apply (proj2_sig v).
-Qed.
-
-Definition alloc_vec_Vec_len (T: Type) (v: alloc_vec_Vec T) : usize :=
- exist _ (alloc_vec_Vec_length v) (alloc_vec_Vec_len_in_usize v).
-
-Fixpoint list_update {A} (l: list A) (n: nat) (a: A)
- : list A :=
- match l with
- | [] => []
- | x :: t => match n with
- | 0%nat => a :: t
- | S m => x :: (list_update t m a)
-end end.
-
-Definition alloc_vec_Vec_bind {A B} (v: alloc_vec_Vec A) (f: list A -> result (list B)) : result (alloc_vec_Vec B) :=
- l <- f (alloc_vec_Vec_to_list v) ;
- match sumbool_of_bool (scalar_le_max Usize (Z.of_nat (length l))) with
- | left H => Ok (exist _ l (scalar_le_max_valid _ _ H))
- | right _ => Fail_ Failure
- end.
-
-Definition alloc_vec_Vec_push (T: Type) (v: alloc_vec_Vec T) (x: T) : result (alloc_vec_Vec T) :=
- alloc_vec_Vec_bind v (fun l => Ok (l ++ [x])).
-
-Definition alloc_vec_Vec_insert (T: Type) (v: alloc_vec_Vec T) (i: usize) (x: T) : result (alloc_vec_Vec T) :=
- alloc_vec_Vec_bind v (fun l =>
- if to_Z i <? Z.of_nat (length l)
- then Ok (list_update l (usize_to_nat i) x)
- else Fail_ Failure).
-
-(* Helper *)
-Axiom alloc_vec_Vec_index_usize : forall {T : Type} (v : alloc_vec_Vec T) (i : usize), result T.
-
-(* Helper *)
-Axiom alloc_vec_Vec_update_usize : forall {T : Type} (v : alloc_vec_Vec T) (i : usize) (x : T), result (alloc_vec_Vec T).
-
-Definition alloc_vec_Vec_index_mut_usize {T : Type} (v: alloc_vec_Vec T) (i: usize) :
- result (T * (T -> result (alloc_vec_Vec T))) :=
- match alloc_vec_Vec_index_usize v i with
- | Ok x =>
- Ok (x, alloc_vec_Vec_update_usize v i)
- | Fail_ e => Fail_ e
- end.
-
-(* Trait declaration: [core::slice::index::private_slice_index::Sealed] *)
-Definition core_slice_index_private_slice_index_Sealed (self : Type) := unit.
-
-(* Trait declaration: [core::slice::index::SliceIndex] *)
-Record core_slice_index_SliceIndex (Self T : Type) := mk_core_slice_index_SliceIndex {
- core_slice_index_SliceIndex_sealedInst : core_slice_index_private_slice_index_Sealed Self;
- core_slice_index_SliceIndex_Output : Type;
- core_slice_index_SliceIndex_get : Self -> T -> result (option core_slice_index_SliceIndex_Output);
- core_slice_index_SliceIndex_get_mut :
- Self -> T -> result (option core_slice_index_SliceIndex_Output * (option core_slice_index_SliceIndex_Output -> result T));
- core_slice_index_SliceIndex_get_unchecked : Self -> const_raw_ptr T -> result (const_raw_ptr core_slice_index_SliceIndex_Output);
- core_slice_index_SliceIndex_get_unchecked_mut : Self -> mut_raw_ptr T -> result (mut_raw_ptr core_slice_index_SliceIndex_Output);
- core_slice_index_SliceIndex_index : Self -> T -> result core_slice_index_SliceIndex_Output;
- core_slice_index_SliceIndex_index_mut :
- Self -> T -> result (core_slice_index_SliceIndex_Output * (core_slice_index_SliceIndex_Output -> result T));
-}.
-Arguments mk_core_slice_index_SliceIndex {_ _}.
-Arguments core_slice_index_SliceIndex_sealedInst {_ _}.
-Arguments core_slice_index_SliceIndex_Output {_ _}.
-Arguments core_slice_index_SliceIndex_get {_ _}.
-Arguments core_slice_index_SliceIndex_get_mut {_ _}.
-Arguments core_slice_index_SliceIndex_get_unchecked {_ _}.
-Arguments core_slice_index_SliceIndex_get_unchecked_mut {_ _}.
-Arguments core_slice_index_SliceIndex_index {_ _}.
-Arguments core_slice_index_SliceIndex_index_mut {_ _}.
-
-(* [core::slice::index::[T]::index]: forward function *)
-Definition core_slice_index_Slice_index
- (T Idx : Type) (inst : core_slice_index_SliceIndex Idx (slice T))
- (s : slice T) (i : Idx) : result inst.(core_slice_index_SliceIndex_Output) :=
- x <- inst.(core_slice_index_SliceIndex_get) i s;
- match x with
- | None => Fail_ Failure
- | Some x => Ok x
- end.
-
-(* [core::slice::index::Range:::get]: forward function *)
-Axiom core_slice_index_RangeUsize_get : forall (T : Type) (i : core_ops_range_Range usize) (s : slice T), result (option (slice T)).
-
-(* [core::slice::index::Range::get_mut]: forward function *)
-Axiom core_slice_index_RangeUsize_get_mut :
- forall (T : Type),
- core_ops_range_Range usize -> slice T ->
- result (option (slice T) * (option (slice T) -> result (slice T))).
-
-(* [core::slice::index::Range::get_unchecked]: forward function *)
-Definition core_slice_index_RangeUsize_get_unchecked
- (T : Type) :
- core_ops_range_Range usize -> const_raw_ptr (slice T) -> result (const_raw_ptr (slice T)) :=
- (* Don't know what the model should be - for now we always fail to make
- sure code which uses it fails *)
- fun _ _ => Fail_ Failure.
-
-(* [core::slice::index::Range::get_unchecked_mut]: forward function *)
-Definition core_slice_index_RangeUsize_get_unchecked_mut
- (T : Type) :
- core_ops_range_Range usize -> mut_raw_ptr (slice T) -> result (mut_raw_ptr (slice T)) :=
- (* Don't know what the model should be - for now we always fail to make
- sure code which uses it fails *)
- fun _ _ => Fail_ Failure.
-
-(* [core::slice::index::Range::index]: forward function *)
-Axiom core_slice_index_RangeUsize_index :
- forall (T : Type), core_ops_range_Range usize -> slice T -> result (slice T).
-
-(* [core::slice::index::Range::index_mut]: forward function *)
-Axiom core_slice_index_RangeUsize_index_mut :
- forall (T : Type), core_ops_range_Range usize -> slice T -> result (slice T * (slice T -> result (slice T))).
-
-(* [core::slice::index::[T]::index_mut]: forward function *)
-Axiom core_slice_index_Slice_index_mut :
- forall (T Idx : Type) (inst : core_slice_index_SliceIndex Idx (slice T)),
- slice T -> Idx ->
- result (inst.(core_slice_index_SliceIndex_Output) *
- (inst.(core_slice_index_SliceIndex_Output) -> result (slice T))).
-
-(* [core::array::[T; N]::index]: forward function *)
-Axiom core_array_Array_index :
- forall (T Idx : Type) (N : usize) (inst : core_ops_index_Index (slice T) Idx)
- (a : array T N) (i : Idx), result inst.(core_ops_index_Index_Output).
-
-(* [core::array::[T; N]::index_mut]: forward function *)
-Axiom core_array_Array_index_mut :
- forall (T Idx : Type) (N : usize) (inst : core_ops_index_IndexMut (slice T) Idx)
- (a : array T N) (i : Idx),
- result (inst.(core_ops_index_IndexMut_indexInst).(core_ops_index_Index_Output) *
- (inst.(core_ops_index_IndexMut_indexInst).(core_ops_index_Index_Output) -> result (array T N))).
-
-(* Trait implementation: [core::slice::index::private_slice_index::Range] *)
-Definition core_slice_index_private_slice_index_SealedRangeUsizeInst
- : core_slice_index_private_slice_index_Sealed (core_ops_range_Range usize) := tt.
-
-(* Trait implementation: [core::slice::index::Range] *)
-Definition core_slice_index_SliceIndexRangeUsizeSliceTInst (T : Type) :
- core_slice_index_SliceIndex (core_ops_range_Range usize) (slice T) := {|
- core_slice_index_SliceIndex_sealedInst := core_slice_index_private_slice_index_SealedRangeUsizeInst;
- core_slice_index_SliceIndex_Output := slice T;
- core_slice_index_SliceIndex_get := core_slice_index_RangeUsize_get T;
- core_slice_index_SliceIndex_get_mut := core_slice_index_RangeUsize_get_mut T;
- core_slice_index_SliceIndex_get_unchecked := core_slice_index_RangeUsize_get_unchecked T;
- core_slice_index_SliceIndex_get_unchecked_mut := core_slice_index_RangeUsize_get_unchecked_mut T;
- core_slice_index_SliceIndex_index := core_slice_index_RangeUsize_index T;
- core_slice_index_SliceIndex_index_mut := core_slice_index_RangeUsize_index_mut T;
-|}.
-
-(* Trait implementation: [core::slice::index::[T]] *)
-Definition core_ops_index_IndexSliceTIInst (T Idx : Type)
- (inst : core_slice_index_SliceIndex Idx (slice T)) :
- core_ops_index_Index (slice T) Idx := {|
- core_ops_index_Index_Output := inst.(core_slice_index_SliceIndex_Output);
- core_ops_index_Index_index := core_slice_index_Slice_index T Idx inst;
-|}.
-
-(* Trait implementation: [core::slice::index::[T]] *)
-Definition core_ops_index_IndexMutSliceTIInst (T Idx : Type)
- (inst : core_slice_index_SliceIndex Idx (slice T)) :
- core_ops_index_IndexMut (slice T) Idx := {|
- core_ops_index_IndexMut_indexInst := core_ops_index_IndexSliceTIInst T Idx inst;
- core_ops_index_IndexMut_index_mut := core_slice_index_Slice_index_mut T Idx inst;
-|}.
-
-(* Trait implementation: [core::array::[T; N]] *)
-Definition core_ops_index_IndexArrayInst (T Idx : Type) (N : usize)
- (inst : core_ops_index_Index (slice T) Idx) :
- core_ops_index_Index (array T N) Idx := {|
- core_ops_index_Index_Output := inst.(core_ops_index_Index_Output);
- core_ops_index_Index_index := core_array_Array_index T Idx N inst;
-|}.
-
-(* Trait implementation: [core::array::[T; N]] *)
-Definition core_ops_index_IndexMutArrayInst (T Idx : Type) (N : usize)
- (inst : core_ops_index_IndexMut (slice T) Idx) :
- core_ops_index_IndexMut (array T N) Idx := {|
- core_ops_index_IndexMut_indexInst := core_ops_index_IndexArrayInst T Idx N inst.(core_ops_index_IndexMut_indexInst);
- core_ops_index_IndexMut_index_mut := core_array_Array_index_mut T Idx N inst;
-|}.
-
-(* [core::slice::index::usize::get]: forward function *)
-Axiom core_slice_index_usize_get : forall (T : Type), usize -> slice T -> result (option T).
-
-(* [core::slice::index::usize::get_mut]: forward function *)
-Axiom core_slice_index_usize_get_mut :
- forall (T : Type), usize -> slice T -> result (option T * (option T -> result (slice T))).
-
-(* [core::slice::index::usize::get_unchecked]: forward function *)
-Axiom core_slice_index_usize_get_unchecked :
- forall (T : Type), usize -> const_raw_ptr (slice T) -> result (const_raw_ptr T).
-
-(* [core::slice::index::usize::get_unchecked_mut]: forward function *)
-Axiom core_slice_index_usize_get_unchecked_mut :
- forall (T : Type), usize -> mut_raw_ptr (slice T) -> result (mut_raw_ptr T).
-
-(* [core::slice::index::usize::index]: forward function *)
-Axiom core_slice_index_usize_index : forall (T : Type), usize -> slice T -> result T.
-
-(* [core::slice::index::usize::index_mut]: forward function *)
-Axiom core_slice_index_usize_index_mut :
- forall (T : Type), usize -> slice T -> result (T * (T -> result (slice T))).
-
-(* Trait implementation: [core::slice::index::private_slice_index::usize] *)
-Definition core_slice_index_private_slice_index_SealedUsizeInst
- : core_slice_index_private_slice_index_Sealed usize := tt.
-
-(* Trait implementation: [core::slice::index::usize] *)
-Definition core_slice_index_SliceIndexUsizeSliceTInst (T : Type) :
- core_slice_index_SliceIndex usize (slice T) := {|
- core_slice_index_SliceIndex_sealedInst := core_slice_index_private_slice_index_SealedUsizeInst;
- core_slice_index_SliceIndex_Output := T;
- core_slice_index_SliceIndex_get := core_slice_index_usize_get T;
- core_slice_index_SliceIndex_get_mut := core_slice_index_usize_get_mut T;
- core_slice_index_SliceIndex_get_unchecked := core_slice_index_usize_get_unchecked T;
- core_slice_index_SliceIndex_get_unchecked_mut := core_slice_index_usize_get_unchecked_mut T;
- core_slice_index_SliceIndex_index := core_slice_index_usize_index T;
- core_slice_index_SliceIndex_index_mut := core_slice_index_usize_index_mut T;
-|}.
-
-(* [alloc::vec::Vec::index]: forward function *)
-Axiom alloc_vec_Vec_index : forall (T Idx : Type) (inst : core_slice_index_SliceIndex Idx (slice T))
- (Self : alloc_vec_Vec T) (i : Idx), result inst.(core_slice_index_SliceIndex_Output).
-
-(* [alloc::vec::Vec::index_mut]: forward function *)
-Axiom alloc_vec_Vec_index_mut : forall (T Idx : Type) (inst : core_slice_index_SliceIndex Idx (slice T))
- (Self : alloc_vec_Vec T) (i : Idx),
- result (inst.(core_slice_index_SliceIndex_Output) *
- (inst.(core_slice_index_SliceIndex_Output) -> result (alloc_vec_Vec T))).
-
-(* Trait implementation: [alloc::vec::Vec] *)
-Definition alloc_vec_Vec_coreopsindexIndexInst (T Idx : Type)
- (inst : core_slice_index_SliceIndex Idx (slice T)) :
- core_ops_index_Index (alloc_vec_Vec T) Idx := {|
- core_ops_index_Index_Output := inst.(core_slice_index_SliceIndex_Output);
- core_ops_index_Index_index := alloc_vec_Vec_index T Idx inst;
-|}.
-
-(* Trait implementation: [alloc::vec::Vec] *)
-Definition alloc_vec_Vec_coreopsindexIndexMutInst (T Idx : Type)
- (inst : core_slice_index_SliceIndex Idx (slice T)) :
- core_ops_index_IndexMut (alloc_vec_Vec T) Idx := {|
- core_ops_index_IndexMut_indexInst := alloc_vec_Vec_coreopsindexIndexInst T Idx inst;
- core_ops_index_IndexMut_index_mut := alloc_vec_Vec_index_mut T Idx inst;
-|}.
-
-(*** Theorems *)
-
-Axiom alloc_vec_Vec_index_eq : forall {a : Type} (v : alloc_vec_Vec a) (i : usize) (x : a),
- alloc_vec_Vec_index a usize (core_slice_index_SliceIndexUsizeSliceTInst a) v i =
- alloc_vec_Vec_index_usize v i.
-
-Axiom alloc_vec_Vec_index_mut_eq : forall {a : Type} (v : alloc_vec_Vec a) (i : usize) (x : a),
- alloc_vec_Vec_index_mut a usize (core_slice_index_SliceIndexUsizeSliceTInst a) v i =
- alloc_vec_Vec_index_mut_usize v i.
-
-End Primitives.
diff --git a/tests/coq/hashmap_on_disk/_CoqProject b/tests/coq/hashmap_on_disk/_CoqProject
deleted file mode 100644
index 837bbbaf..00000000
--- a/tests/coq/hashmap_on_disk/_CoqProject
+++ /dev/null
@@ -1,12 +0,0 @@
-# This file was automatically generated - see ../Makefile
--R . Lib
--arg -w
--arg all
-
-HashmapMain_Funs.v
-HashmapMain_FunsExternal.v
-HashmapMain_FunsExternal_Template.v
-HashmapMain_Types.v
-HashmapMain_TypesExternal.v
-HashmapMain_TypesExternal_Template.v
-Primitives.v
diff --git a/tests/coq/misc/Bitwise.v b/tests/coq/misc/Bitwise.v
index 539141e5..610f4ea8 100644
--- a/tests/coq/misc/Bitwise.v
+++ b/tests/coq/misc/Bitwise.v
@@ -9,29 +9,29 @@ Local Open Scope Primitives_scope.
Module Bitwise.
(** [bitwise::shift_u32]:
- Source: 'tests/src/bitwise.rs', lines 3:0-3:31 *)
+ Source: 'tests/src/bitwise.rs', lines 5:0-5:31 *)
Definition shift_u32 (a : u32) : result u32 :=
t <- u32_shr a 16%usize; u32_shl t 16%usize
.
(** [bitwise::shift_i32]:
- Source: 'tests/src/bitwise.rs', lines 10:0-10:31 *)
+ Source: 'tests/src/bitwise.rs', lines 12:0-12:31 *)
Definition shift_i32 (a : i32) : result i32 :=
t <- i32_shr a 16%isize; i32_shl t 16%isize
.
(** [bitwise::xor_u32]:
- Source: 'tests/src/bitwise.rs', lines 17:0-17:37 *)
+ Source: 'tests/src/bitwise.rs', lines 19:0-19:37 *)
Definition xor_u32 (a : u32) (b : u32) : result u32 :=
Ok (u32_xor a b).
(** [bitwise::or_u32]:
- Source: 'tests/src/bitwise.rs', lines 21:0-21:36 *)
+ Source: 'tests/src/bitwise.rs', lines 23:0-23:36 *)
Definition or_u32 (a : u32) (b : u32) : result u32 :=
Ok (u32_or a b).
(** [bitwise::and_u32]:
- Source: 'tests/src/bitwise.rs', lines 25:0-25:37 *)
+ Source: 'tests/src/bitwise.rs', lines 27:0-27:37 *)
Definition and_u32 (a : u32) (b : u32) : result u32 :=
Ok (u32_and a b).
diff --git a/tests/coq/misc/Constants.v b/tests/coq/misc/Constants.v
index a5aba663..fb5f5a29 100644
--- a/tests/coq/misc/Constants.v
+++ b/tests/coq/misc/Constants.v
@@ -9,37 +9,37 @@ Local Open Scope Primitives_scope.
Module Constants.
(** [constants::X0]
- Source: 'tests/src/constants.rs', lines 5:0-5:17 *)
+ Source: 'tests/src/constants.rs', lines 8:0-8:17 *)
Definition x0_body : result u32 := Ok 0%u32.
Definition x0 : u32 := x0_body%global.
(** [constants::X1]
- Source: 'tests/src/constants.rs', lines 7:0-7:17 *)
+ Source: 'tests/src/constants.rs', lines 10:0-10:17 *)
Definition x1_body : result u32 := Ok core_u32_max.
Definition x1 : u32 := x1_body%global.
(** [constants::X2]
- Source: 'tests/src/constants.rs', lines 10:0-10:17 *)
+ Source: 'tests/src/constants.rs', lines 13:0-13:17 *)
Definition x2_body : result u32 := Ok 3%u32.
Definition x2 : u32 := x2_body%global.
(** [constants::incr]:
- Source: 'tests/src/constants.rs', lines 17:0-17:32 *)
+ Source: 'tests/src/constants.rs', lines 20:0-20:32 *)
Definition incr (n : u32) : result u32 :=
u32_add n 1%u32.
(** [constants::X3]
- Source: 'tests/src/constants.rs', lines 15:0-15:17 *)
+ Source: 'tests/src/constants.rs', lines 18:0-18:17 *)
Definition x3_body : result u32 := incr 32%u32.
Definition x3 : u32 := x3_body%global.
(** [constants::mk_pair0]:
- Source: 'tests/src/constants.rs', lines 23:0-23:51 *)
+ Source: 'tests/src/constants.rs', lines 26:0-26:51 *)
Definition mk_pair0 (x : u32) (y1 : u32) : result (u32 * u32) :=
Ok (x, y1).
(** [constants::Pair]
- Source: 'tests/src/constants.rs', lines 36:0-36:23 *)
+ Source: 'tests/src/constants.rs', lines 39:0-39:23 *)
Record Pair_t (T1 T2 : Type) := mkPair_t { pair_x : T1; pair_y : T2; }.
Arguments mkPair_t { _ _ }.
@@ -47,130 +47,130 @@ Arguments pair_x { _ _ }.
Arguments pair_y { _ _ }.
(** [constants::mk_pair1]:
- Source: 'tests/src/constants.rs', lines 27:0-27:55 *)
+ Source: 'tests/src/constants.rs', lines 30:0-30:55 *)
Definition mk_pair1 (x : u32) (y1 : u32) : result (Pair_t u32 u32) :=
Ok {| pair_x := x; pair_y := y1 |}
.
(** [constants::P0]
- Source: 'tests/src/constants.rs', lines 31:0-31:24 *)
+ Source: 'tests/src/constants.rs', lines 34:0-34:24 *)
Definition p0_body : result (u32 * u32) := mk_pair0 0%u32 1%u32.
Definition p0 : (u32 * u32) := p0_body%global.
(** [constants::P1]
- Source: 'tests/src/constants.rs', lines 32:0-32:28 *)
+ Source: 'tests/src/constants.rs', lines 35:0-35:28 *)
Definition p1_body : result (Pair_t u32 u32) := mk_pair1 0%u32 1%u32.
Definition p1 : Pair_t u32 u32 := p1_body%global.
(** [constants::P2]
- Source: 'tests/src/constants.rs', lines 33:0-33:24 *)
+ Source: 'tests/src/constants.rs', lines 36:0-36:24 *)
Definition p2_body : result (u32 * u32) := Ok (0%u32, 1%u32).
Definition p2 : (u32 * u32) := p2_body%global.
(** [constants::P3]
- Source: 'tests/src/constants.rs', lines 34:0-34:28 *)
+ Source: 'tests/src/constants.rs', lines 37:0-37:28 *)
Definition p3_body : result (Pair_t u32 u32) :=
Ok {| pair_x := 0%u32; pair_y := 1%u32 |}
.
Definition p3 : Pair_t u32 u32 := p3_body%global.
(** [constants::Wrap]
- Source: 'tests/src/constants.rs', lines 49:0-49:18 *)
+ Source: 'tests/src/constants.rs', lines 52:0-52:18 *)
Record Wrap_t (T : Type) := mkWrap_t { wrap_value : T; }.
Arguments mkWrap_t { _ }.
Arguments wrap_value { _ }.
(** [constants::{constants::Wrap<T>}::new]:
- Source: 'tests/src/constants.rs', lines 54:4-54:41 *)
+ Source: 'tests/src/constants.rs', lines 57:4-57:41 *)
Definition wrap_new (T : Type) (value : T) : result (Wrap_t T) :=
Ok {| wrap_value := value |}
.
(** [constants::Y]
- Source: 'tests/src/constants.rs', lines 41:0-41:22 *)
+ Source: 'tests/src/constants.rs', lines 44:0-44:22 *)
Definition y_body : result (Wrap_t i32) := wrap_new i32 2%i32.
Definition y : Wrap_t i32 := y_body%global.
(** [constants::unwrap_y]:
- Source: 'tests/src/constants.rs', lines 43:0-43:30 *)
+ Source: 'tests/src/constants.rs', lines 46:0-46:30 *)
Definition unwrap_y : result i32 :=
Ok y.(wrap_value).
(** [constants::YVAL]
- Source: 'tests/src/constants.rs', lines 47:0-47:19 *)
+ Source: 'tests/src/constants.rs', lines 50:0-50:19 *)
Definition yval_body : result i32 := unwrap_y.
Definition yval : i32 := yval_body%global.
(** [constants::get_z1::Z1]
- Source: 'tests/src/constants.rs', lines 62:4-62:17 *)
+ Source: 'tests/src/constants.rs', lines 65:4-65:17 *)
Definition get_z1_z1_body : result i32 := Ok 3%i32.
Definition get_z1_z1 : i32 := get_z1_z1_body%global.
(** [constants::get_z1]:
- Source: 'tests/src/constants.rs', lines 61:0-61:28 *)
+ Source: 'tests/src/constants.rs', lines 64:0-64:28 *)
Definition get_z1 : result i32 :=
Ok get_z1_z1.
(** [constants::add]:
- Source: 'tests/src/constants.rs', lines 66:0-66:39 *)
+ Source: 'tests/src/constants.rs', lines 69:0-69:39 *)
Definition add (a : i32) (b : i32) : result i32 :=
i32_add a b.
(** [constants::Q1]
- Source: 'tests/src/constants.rs', lines 74:0-74:17 *)
+ Source: 'tests/src/constants.rs', lines 77:0-77:17 *)
Definition q1_body : result i32 := Ok 5%i32.
Definition q1 : i32 := q1_body%global.
(** [constants::Q2]
- Source: 'tests/src/constants.rs', lines 75:0-75:17 *)
+ Source: 'tests/src/constants.rs', lines 78:0-78:17 *)
Definition q2_body : result i32 := Ok q1.
Definition q2 : i32 := q2_body%global.
(** [constants::Q3]
- Source: 'tests/src/constants.rs', lines 76:0-76:17 *)
+ Source: 'tests/src/constants.rs', lines 79:0-79:17 *)
Definition q3_body : result i32 := add q2 3%i32.
Definition q3 : i32 := q3_body%global.
(** [constants::get_z2]:
- Source: 'tests/src/constants.rs', lines 70:0-70:28 *)
+ Source: 'tests/src/constants.rs', lines 73:0-73:28 *)
Definition get_z2 : result i32 :=
i <- get_z1; i1 <- add i q3; add q1 i1.
(** [constants::S1]
- Source: 'tests/src/constants.rs', lines 80:0-80:18 *)
+ Source: 'tests/src/constants.rs', lines 83:0-83:18 *)
Definition s1_body : result u32 := Ok 6%u32.
Definition s1 : u32 := s1_body%global.
(** [constants::S2]
- Source: 'tests/src/constants.rs', lines 81:0-81:18 *)
+ Source: 'tests/src/constants.rs', lines 84:0-84:18 *)
Definition s2_body : result u32 := incr s1.
Definition s2 : u32 := s2_body%global.
(** [constants::S3]
- Source: 'tests/src/constants.rs', lines 82:0-82:29 *)
+ Source: 'tests/src/constants.rs', lines 85:0-85:29 *)
Definition s3_body : result (Pair_t u32 u32) := Ok p3.
Definition s3 : Pair_t u32 u32 := s3_body%global.
(** [constants::S4]
- Source: 'tests/src/constants.rs', lines 83:0-83:29 *)
+ Source: 'tests/src/constants.rs', lines 86:0-86:29 *)
Definition s4_body : result (Pair_t u32 u32) := mk_pair1 7%u32 8%u32.
Definition s4 : Pair_t u32 u32 := s4_body%global.
(** [constants::V]
- Source: 'tests/src/constants.rs', lines 86:0-86:31 *)
+ Source: 'tests/src/constants.rs', lines 89:0-89:31 *)
Record V_t (T : Type) (N : usize) := mkV_t { v_x : array T N; }.
Arguments mkV_t { _ _ }.
Arguments v_x { _ _ }.
(** [constants::{constants::V<T, N>#1}::LEN]
- Source: 'tests/src/constants.rs', lines 91:4-91:24 *)
+ Source: 'tests/src/constants.rs', lines 94:4-94:24 *)
Definition v_len_body (T : Type) (N : usize) : result usize := Ok N.
Definition v_len (T : Type) (N : usize) : usize := (v_len_body T N)%global.
(** [constants::use_v]:
- Source: 'tests/src/constants.rs', lines 94:0-94:42 *)
+ Source: 'tests/src/constants.rs', lines 97:0-97:42 *)
Definition use_v (T : Type) (N : usize) : result usize :=
Ok (v_len T N).
diff --git a/tests/coq/misc/External_Funs.v b/tests/coq/misc/External_Funs.v
index d0de80d9..7b9a9842 100644
--- a/tests/coq/misc/External_Funs.v
+++ b/tests/coq/misc/External_Funs.v
@@ -20,14 +20,14 @@ Definition core_marker_CopyU32 : core_marker_Copy_t u32 := {|
|}.
(** [external::use_get]:
- Source: 'tests/src/external.rs', lines 5:0-5:37 *)
+ Source: 'tests/src/external.rs', lines 9:0-9:37 *)
Definition use_get
(rc : core_cell_Cell_t u32) (st : state) : result (state * u32) :=
core_cell_Cell_get u32 core_marker_CopyU32 rc st
.
(** [external::incr]:
- Source: 'tests/src/external.rs', lines 9:0-9:31 *)
+ Source: 'tests/src/external.rs', lines 13:0-13:31 *)
Definition incr
(rc : core_cell_Cell_t u32) (st : state) :
result (state * (core_cell_Cell_t u32))
diff --git a/tests/coq/misc/InfiniteLoop.v b/tests/coq/misc/InfiniteLoop.v
new file mode 100644
index 00000000..1c0ccbe0
--- /dev/null
+++ b/tests/coq/misc/InfiniteLoop.v
@@ -0,0 +1,27 @@
+(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
+(** [infinite_loop] *)
+Require Import Primitives.
+Import Primitives.
+Require Import Coq.ZArith.ZArith.
+Require Import List.
+Import ListNotations.
+Local Open Scope Primitives_scope.
+Module InfiniteLoop.
+
+(** [infinite_loop::bar]:
+ Source: 'tests/src/infinite-loop.rs', lines 4:0-4:8 *)
+Definition bar : result unit :=
+ Ok tt.
+
+(** [infinite_loop::foo]: loop 0:
+ Source: 'tests/src/infinite-loop.rs', lines 6:0-10:1 *)
+Fixpoint foo_loop (n : nat) : result unit :=
+ match n with | O => Fail_ OutOfFuel | S n1 => _ <- bar; foo_loop n1 end
+.
+
+(** [infinite_loop::foo]:
+ Source: 'tests/src/infinite-loop.rs', lines 6:0-6:8 *)
+Definition foo (n : nat) : result unit :=
+ foo_loop n.
+
+End InfiniteLoop.
diff --git a/tests/coq/misc/Issue194RecursiveStructProjector.v b/tests/coq/misc/Issue194RecursiveStructProjector.v
new file mode 100644
index 00000000..d1a07449
--- /dev/null
+++ b/tests/coq/misc/Issue194RecursiveStructProjector.v
@@ -0,0 +1,54 @@
+(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
+(** [issue_194_recursive_struct_projector] *)
+Require Import Primitives.
+Import Primitives.
+Require Import Coq.ZArith.ZArith.
+Require Import List.
+Import ListNotations.
+Local Open Scope Primitives_scope.
+Module Issue194RecursiveStructProjector.
+
+(** [issue_194_recursive_struct_projector::AVLNode]
+ Source: 'tests/src/issue-194-recursive-struct-projector.rs', lines 2:0-2:17 *)
+Inductive AVLNode_t (T : Type) :=
+| mkAVLNode_t :
+ T ->
+ option (AVLNode_t T) ->
+ option (AVLNode_t T) ->
+ AVLNode_t T
+.
+
+Arguments mkAVLNode_t { _ }.
+
+Definition aVLNode_value {T : Type} (x : AVLNode_t T) :=
+ match x with | mkAVLNode_t x1 _ _ => x1 end
+.
+
+Notation "x2 .(aVLNode_value)" := (aVLNode_value x2) (at level 9).
+
+Definition aVLNode_left {T : Type} (x : AVLNode_t T) :=
+ match x with | mkAVLNode_t _ x1 _ => x1 end
+.
+
+Notation "x2 .(aVLNode_left)" := (aVLNode_left x2) (at level 9).
+
+Definition aVLNode_right {T : Type} (x : AVLNode_t T) :=
+ match x with | mkAVLNode_t _ _ x1 => x1 end
+.
+
+Notation "x2 .(aVLNode_right)" := (aVLNode_right x2) (at level 9).
+
+(** [issue_194_recursive_struct_projector::get_val]:
+ Source: 'tests/src/issue-194-recursive-struct-projector.rs', lines 10:0-10:33 *)
+Definition get_val (T : Type) (x : AVLNode_t T) : result T :=
+ Ok x.(aVLNode_value)
+.
+
+(** [issue_194_recursive_struct_projector::get_left]:
+ Source: 'tests/src/issue-194-recursive-struct-projector.rs', lines 14:0-14:43 *)
+Definition get_left
+ (T : Type) (x : AVLNode_t T) : result (option (AVLNode_t T)) :=
+ Ok x.(aVLNode_left)
+.
+
+End Issue194RecursiveStructProjector.
diff --git a/tests/coq/misc/Loops.v b/tests/coq/misc/Loops.v
index bf0a8bc1..87b05193 100644
--- a/tests/coq/misc/Loops.v
+++ b/tests/coq/misc/Loops.v
@@ -9,7 +9,7 @@ Local Open Scope Primitives_scope.
Module Loops.
(** [loops::sum]: loop 0:
- Source: 'tests/src/loops.rs', lines 4:0-14:1 *)
+ Source: 'tests/src/loops.rs', lines 8:0-18:1 *)
Fixpoint sum_loop (n : nat) (max : u32) (i : u32) (s : u32) : result u32 :=
match n with
| O => Fail_ OutOfFuel
@@ -21,13 +21,13 @@ Fixpoint sum_loop (n : nat) (max : u32) (i : u32) (s : u32) : result u32 :=
.
(** [loops::sum]:
- Source: 'tests/src/loops.rs', lines 4:0-4:27 *)
+ Source: 'tests/src/loops.rs', lines 8:0-8:27 *)
Definition sum (n : nat) (max : u32) : result u32 :=
sum_loop n max 0%u32 0%u32
.
(** [loops::sum_with_mut_borrows]: loop 0:
- Source: 'tests/src/loops.rs', lines 19:0-31:1 *)
+ Source: 'tests/src/loops.rs', lines 23:0-35:1 *)
Fixpoint sum_with_mut_borrows_loop
(n : nat) (max : u32) (i : u32) (s : u32) : result u32 :=
match n with
@@ -43,13 +43,13 @@ Fixpoint sum_with_mut_borrows_loop
.
(** [loops::sum_with_mut_borrows]:
- Source: 'tests/src/loops.rs', lines 19:0-19:44 *)
+ Source: 'tests/src/loops.rs', lines 23:0-23:44 *)
Definition sum_with_mut_borrows (n : nat) (max : u32) : result u32 :=
sum_with_mut_borrows_loop n max 0%u32 0%u32
.
(** [loops::sum_with_shared_borrows]: loop 0:
- Source: 'tests/src/loops.rs', lines 34:0-48:1 *)
+ Source: 'tests/src/loops.rs', lines 38:0-52:1 *)
Fixpoint sum_with_shared_borrows_loop
(n : nat) (max : u32) (i : u32) (s : u32) : result u32 :=
match n with
@@ -65,13 +65,13 @@ Fixpoint sum_with_shared_borrows_loop
.
(** [loops::sum_with_shared_borrows]:
- Source: 'tests/src/loops.rs', lines 34:0-34:47 *)
+ Source: 'tests/src/loops.rs', lines 38:0-38:47 *)
Definition sum_with_shared_borrows (n : nat) (max : u32) : result u32 :=
sum_with_shared_borrows_loop n max 0%u32 0%u32
.
(** [loops::sum_array]: loop 0:
- Source: 'tests/src/loops.rs', lines 50:0-58:1 *)
+ Source: 'tests/src/loops.rs', lines 54:0-62:1 *)
Fixpoint sum_array_loop
(N : usize) (n : nat) (a : array u32 N) (i : usize) (s : u32) : result u32 :=
match n with
@@ -88,13 +88,13 @@ Fixpoint sum_array_loop
.
(** [loops::sum_array]:
- Source: 'tests/src/loops.rs', lines 50:0-50:52 *)
+ Source: 'tests/src/loops.rs', lines 54:0-54:52 *)
Definition sum_array (N : usize) (n : nat) (a : array u32 N) : result u32 :=
sum_array_loop N n a 0%usize 0%u32
.
(** [loops::clear]: loop 0:
- Source: 'tests/src/loops.rs', lines 62:0-68:1 *)
+ Source: 'tests/src/loops.rs', lines 66:0-72:1 *)
Fixpoint clear_loop
(n : nat) (v : alloc_vec_Vec u32) (i : usize) : result (alloc_vec_Vec u32) :=
match n with
@@ -115,14 +115,14 @@ Fixpoint clear_loop
.
(** [loops::clear]:
- Source: 'tests/src/loops.rs', lines 62:0-62:30 *)
+ Source: 'tests/src/loops.rs', lines 66:0-66:30 *)
Definition clear
(n : nat) (v : alloc_vec_Vec u32) : result (alloc_vec_Vec u32) :=
clear_loop n v 0%usize
.
(** [loops::List]
- Source: 'tests/src/loops.rs', lines 70:0-70:16 *)
+ Source: 'tests/src/loops.rs', lines 74:0-74:16 *)
Inductive List_t (T : Type) :=
| List_Cons : T -> List_t T -> List_t T
| List_Nil : List_t T
@@ -132,7 +132,7 @@ Arguments List_Cons { _ }.
Arguments List_Nil { _ }.
(** [loops::list_mem]: loop 0:
- Source: 'tests/src/loops.rs', lines 76:0-85:1 *)
+ Source: 'tests/src/loops.rs', lines 80:0-89:1 *)
Fixpoint list_mem_loop (n : nat) (x : u32) (ls : List_t u32) : result bool :=
match n with
| O => Fail_ OutOfFuel
@@ -145,13 +145,13 @@ Fixpoint list_mem_loop (n : nat) (x : u32) (ls : List_t u32) : result bool :=
.
(** [loops::list_mem]:
- Source: 'tests/src/loops.rs', lines 76:0-76:52 *)
+ Source: 'tests/src/loops.rs', lines 80:0-80:52 *)
Definition list_mem (n : nat) (x : u32) (ls : List_t u32) : result bool :=
list_mem_loop n x ls
.
(** [loops::list_nth_mut_loop]: loop 0:
- Source: 'tests/src/loops.rs', lines 88:0-98:1 *)
+ Source: 'tests/src/loops.rs', lines 92:0-102:1 *)
Fixpoint list_nth_mut_loop_loop
(T : Type) (n : nat) (ls : List_t T) (i : u32) :
result (T * (T -> result (List_t T)))
@@ -175,7 +175,7 @@ Fixpoint list_nth_mut_loop_loop
.
(** [loops::list_nth_mut_loop]:
- Source: 'tests/src/loops.rs', lines 88:0-88:71 *)
+ Source: 'tests/src/loops.rs', lines 92:0-92:71 *)
Definition list_nth_mut_loop
(T : Type) (n : nat) (ls : List_t T) (i : u32) :
result (T * (T -> result (List_t T)))
@@ -184,7 +184,7 @@ Definition list_nth_mut_loop
.
(** [loops::list_nth_shared_loop]: loop 0:
- Source: 'tests/src/loops.rs', lines 101:0-111:1 *)
+ Source: 'tests/src/loops.rs', lines 105:0-115:1 *)
Fixpoint list_nth_shared_loop_loop
(T : Type) (n : nat) (ls : List_t T) (i : u32) : result T :=
match n with
@@ -201,14 +201,14 @@ Fixpoint list_nth_shared_loop_loop
.
(** [loops::list_nth_shared_loop]:
- Source: 'tests/src/loops.rs', lines 101:0-101:66 *)
+ Source: 'tests/src/loops.rs', lines 105:0-105:66 *)
Definition list_nth_shared_loop
(T : Type) (n : nat) (ls : List_t T) (i : u32) : result T :=
list_nth_shared_loop_loop T n ls i
.
(** [loops::get_elem_mut]: loop 0:
- Source: 'tests/src/loops.rs', lines 113:0-127:1 *)
+ Source: 'tests/src/loops.rs', lines 117:0-131:1 *)
Fixpoint get_elem_mut_loop
(n : nat) (x : usize) (ls : List_t usize) :
result (usize * (usize -> result (List_t usize)))
@@ -233,7 +233,7 @@ Fixpoint get_elem_mut_loop
.
(** [loops::get_elem_mut]:
- Source: 'tests/src/loops.rs', lines 113:0-113:73 *)
+ Source: 'tests/src/loops.rs', lines 117:0-117:73 *)
Definition get_elem_mut
(n : nat) (slots : alloc_vec_Vec (List_t usize)) (x : usize) :
result (usize * (usize -> result (alloc_vec_Vec (List_t usize))))
@@ -249,7 +249,7 @@ Definition get_elem_mut
.
(** [loops::get_elem_shared]: loop 0:
- Source: 'tests/src/loops.rs', lines 129:0-143:1 *)
+ Source: 'tests/src/loops.rs', lines 133:0-147:1 *)
Fixpoint get_elem_shared_loop
(n : nat) (x : usize) (ls : List_t usize) : result usize :=
match n with
@@ -263,7 +263,7 @@ Fixpoint get_elem_shared_loop
.
(** [loops::get_elem_shared]:
- Source: 'tests/src/loops.rs', lines 129:0-129:68 *)
+ Source: 'tests/src/loops.rs', lines 133:0-133:68 *)
Definition get_elem_shared
(n : nat) (slots : alloc_vec_Vec (List_t usize)) (x : usize) :
result usize
@@ -275,7 +275,7 @@ Definition get_elem_shared
.
(** [loops::id_mut]:
- Source: 'tests/src/loops.rs', lines 145:0-145:50 *)
+ Source: 'tests/src/loops.rs', lines 149:0-149:50 *)
Definition id_mut
(T : Type) (ls : List_t T) :
result ((List_t T) * (List_t T -> result (List_t T)))
@@ -284,12 +284,12 @@ Definition id_mut
.
(** [loops::id_shared]:
- Source: 'tests/src/loops.rs', lines 149:0-149:45 *)
+ Source: 'tests/src/loops.rs', lines 153:0-153:45 *)
Definition id_shared (T : Type) (ls : List_t T) : result (List_t T) :=
Ok ls.
(** [loops::list_nth_mut_loop_with_id]: loop 0:
- Source: 'tests/src/loops.rs', lines 154:0-165:1 *)
+ Source: 'tests/src/loops.rs', lines 158:0-169:1 *)
Fixpoint list_nth_mut_loop_with_id_loop
(T : Type) (n : nat) (i : u32) (ls : List_t T) :
result (T * (T -> result (List_t T)))
@@ -313,7 +313,7 @@ Fixpoint list_nth_mut_loop_with_id_loop
.
(** [loops::list_nth_mut_loop_with_id]:
- Source: 'tests/src/loops.rs', lines 154:0-154:75 *)
+ Source: 'tests/src/loops.rs', lines 158:0-158:75 *)
Definition list_nth_mut_loop_with_id
(T : Type) (n : nat) (ls : List_t T) (i : u32) :
result (T * (T -> result (List_t T)))
@@ -327,7 +327,7 @@ Definition list_nth_mut_loop_with_id
.
(** [loops::list_nth_shared_loop_with_id]: loop 0:
- Source: 'tests/src/loops.rs', lines 168:0-179:1 *)
+ Source: 'tests/src/loops.rs', lines 172:0-183:1 *)
Fixpoint list_nth_shared_loop_with_id_loop
(T : Type) (n : nat) (i : u32) (ls : List_t T) : result T :=
match n with
@@ -345,14 +345,14 @@ Fixpoint list_nth_shared_loop_with_id_loop
.
(** [loops::list_nth_shared_loop_with_id]:
- Source: 'tests/src/loops.rs', lines 168:0-168:70 *)
+ Source: 'tests/src/loops.rs', lines 172:0-172:70 *)
Definition list_nth_shared_loop_with_id
(T : Type) (n : nat) (ls : List_t T) (i : u32) : result T :=
ls1 <- id_shared T ls; list_nth_shared_loop_with_id_loop T n i ls1
.
(** [loops::list_nth_mut_loop_pair]: loop 0:
- Source: 'tests/src/loops.rs', lines 184:0-205:1 *)
+ Source: 'tests/src/loops.rs', lines 188:0-209:1 *)
Fixpoint list_nth_mut_loop_pair_loop
(T : Type) (n : nat) (ls0 : List_t T) (ls1 : List_t T) (i : u32) :
result ((T * T) * (T -> result (List_t T)) * (T -> result (List_t T)))
@@ -386,7 +386,7 @@ Fixpoint list_nth_mut_loop_pair_loop
.
(** [loops::list_nth_mut_loop_pair]:
- Source: 'tests/src/loops.rs', lines 184:0-188:27 *)
+ Source: 'tests/src/loops.rs', lines 188:0-192:27 *)
Definition list_nth_mut_loop_pair
(T : Type) (n : nat) (ls0 : List_t T) (ls1 : List_t T) (i : u32) :
result ((T * T) * (T -> result (List_t T)) * (T -> result (List_t T)))
@@ -395,7 +395,7 @@ Definition list_nth_mut_loop_pair
.
(** [loops::list_nth_shared_loop_pair]: loop 0:
- Source: 'tests/src/loops.rs', lines 208:0-229:1 *)
+ Source: 'tests/src/loops.rs', lines 212:0-233:1 *)
Fixpoint list_nth_shared_loop_pair_loop
(T : Type) (n : nat) (ls0 : List_t T) (ls1 : List_t T) (i : u32) :
result (T * T)
@@ -419,7 +419,7 @@ Fixpoint list_nth_shared_loop_pair_loop
.
(** [loops::list_nth_shared_loop_pair]:
- Source: 'tests/src/loops.rs', lines 208:0-212:19 *)
+ Source: 'tests/src/loops.rs', lines 212:0-216:19 *)
Definition list_nth_shared_loop_pair
(T : Type) (n : nat) (ls0 : List_t T) (ls1 : List_t T) (i : u32) :
result (T * T)
@@ -428,7 +428,7 @@ Definition list_nth_shared_loop_pair
.
(** [loops::list_nth_mut_loop_pair_merge]: loop 0:
- Source: 'tests/src/loops.rs', lines 233:0-248:1 *)
+ Source: 'tests/src/loops.rs', lines 237:0-252:1 *)
Fixpoint list_nth_mut_loop_pair_merge_loop
(T : Type) (n : nat) (ls0 : List_t T) (ls1 : List_t T) (i : u32) :
result ((T * T) * ((T * T) -> result ((List_t T) * (List_t T))))
@@ -464,7 +464,7 @@ Fixpoint list_nth_mut_loop_pair_merge_loop
.
(** [loops::list_nth_mut_loop_pair_merge]:
- Source: 'tests/src/loops.rs', lines 233:0-237:27 *)
+ Source: 'tests/src/loops.rs', lines 237:0-241:27 *)
Definition list_nth_mut_loop_pair_merge
(T : Type) (n : nat) (ls0 : List_t T) (ls1 : List_t T) (i : u32) :
result ((T * T) * ((T * T) -> result ((List_t T) * (List_t T))))
@@ -473,7 +473,7 @@ Definition list_nth_mut_loop_pair_merge
.
(** [loops::list_nth_shared_loop_pair_merge]: loop 0:
- Source: 'tests/src/loops.rs', lines 251:0-266:1 *)
+ Source: 'tests/src/loops.rs', lines 255:0-270:1 *)
Fixpoint list_nth_shared_loop_pair_merge_loop
(T : Type) (n : nat) (ls0 : List_t T) (ls1 : List_t T) (i : u32) :
result (T * T)
@@ -498,7 +498,7 @@ Fixpoint list_nth_shared_loop_pair_merge_loop
.
(** [loops::list_nth_shared_loop_pair_merge]:
- Source: 'tests/src/loops.rs', lines 251:0-255:19 *)
+ Source: 'tests/src/loops.rs', lines 255:0-259:19 *)
Definition list_nth_shared_loop_pair_merge
(T : Type) (n : nat) (ls0 : List_t T) (ls1 : List_t T) (i : u32) :
result (T * T)
@@ -507,7 +507,7 @@ Definition list_nth_shared_loop_pair_merge
.
(** [loops::list_nth_mut_shared_loop_pair]: loop 0:
- Source: 'tests/src/loops.rs', lines 269:0-284:1 *)
+ Source: 'tests/src/loops.rs', lines 273:0-288:1 *)
Fixpoint list_nth_mut_shared_loop_pair_loop
(T : Type) (n : nat) (ls0 : List_t T) (ls1 : List_t T) (i : u32) :
result ((T * T) * (T -> result (List_t T)))
@@ -538,7 +538,7 @@ Fixpoint list_nth_mut_shared_loop_pair_loop
.
(** [loops::list_nth_mut_shared_loop_pair]:
- Source: 'tests/src/loops.rs', lines 269:0-273:23 *)
+ Source: 'tests/src/loops.rs', lines 273:0-277:23 *)
Definition list_nth_mut_shared_loop_pair
(T : Type) (n : nat) (ls0 : List_t T) (ls1 : List_t T) (i : u32) :
result ((T * T) * (T -> result (List_t T)))
@@ -547,7 +547,7 @@ Definition list_nth_mut_shared_loop_pair
.
(** [loops::list_nth_mut_shared_loop_pair_merge]: loop 0:
- Source: 'tests/src/loops.rs', lines 288:0-303:1 *)
+ Source: 'tests/src/loops.rs', lines 292:0-307:1 *)
Fixpoint list_nth_mut_shared_loop_pair_merge_loop
(T : Type) (n : nat) (ls0 : List_t T) (ls1 : List_t T) (i : u32) :
result ((T * T) * (T -> result (List_t T)))
@@ -578,7 +578,7 @@ Fixpoint list_nth_mut_shared_loop_pair_merge_loop
.
(** [loops::list_nth_mut_shared_loop_pair_merge]:
- Source: 'tests/src/loops.rs', lines 288:0-292:23 *)
+ Source: 'tests/src/loops.rs', lines 292:0-296:23 *)
Definition list_nth_mut_shared_loop_pair_merge
(T : Type) (n : nat) (ls0 : List_t T) (ls1 : List_t T) (i : u32) :
result ((T * T) * (T -> result (List_t T)))
@@ -587,7 +587,7 @@ Definition list_nth_mut_shared_loop_pair_merge
.
(** [loops::list_nth_shared_mut_loop_pair]: loop 0:
- Source: 'tests/src/loops.rs', lines 307:0-322:1 *)
+ Source: 'tests/src/loops.rs', lines 311:0-326:1 *)
Fixpoint list_nth_shared_mut_loop_pair_loop
(T : Type) (n : nat) (ls0 : List_t T) (ls1 : List_t T) (i : u32) :
result ((T * T) * (T -> result (List_t T)))
@@ -618,7 +618,7 @@ Fixpoint list_nth_shared_mut_loop_pair_loop
.
(** [loops::list_nth_shared_mut_loop_pair]:
- Source: 'tests/src/loops.rs', lines 307:0-311:23 *)
+ Source: 'tests/src/loops.rs', lines 311:0-315:23 *)
Definition list_nth_shared_mut_loop_pair
(T : Type) (n : nat) (ls0 : List_t T) (ls1 : List_t T) (i : u32) :
result ((T * T) * (T -> result (List_t T)))
@@ -627,7 +627,7 @@ Definition list_nth_shared_mut_loop_pair
.
(** [loops::list_nth_shared_mut_loop_pair_merge]: loop 0:
- Source: 'tests/src/loops.rs', lines 326:0-341:1 *)
+ Source: 'tests/src/loops.rs', lines 330:0-345:1 *)
Fixpoint list_nth_shared_mut_loop_pair_merge_loop
(T : Type) (n : nat) (ls0 : List_t T) (ls1 : List_t T) (i : u32) :
result ((T * T) * (T -> result (List_t T)))
@@ -658,7 +658,7 @@ Fixpoint list_nth_shared_mut_loop_pair_merge_loop
.
(** [loops::list_nth_shared_mut_loop_pair_merge]:
- Source: 'tests/src/loops.rs', lines 326:0-330:23 *)
+ Source: 'tests/src/loops.rs', lines 330:0-334:23 *)
Definition list_nth_shared_mut_loop_pair_merge
(T : Type) (n : nat) (ls0 : List_t T) (ls1 : List_t T) (i : u32) :
result ((T * T) * (T -> result (List_t T)))
@@ -667,7 +667,7 @@ Definition list_nth_shared_mut_loop_pair_merge
.
(** [loops::ignore_input_mut_borrow]: loop 0:
- Source: 'tests/src/loops.rs', lines 345:0-349:1 *)
+ Source: 'tests/src/loops.rs', lines 349:0-353:1 *)
Fixpoint ignore_input_mut_borrow_loop (n : nat) (i : u32) : result unit :=
match n with
| O => Fail_ OutOfFuel
@@ -679,14 +679,14 @@ Fixpoint ignore_input_mut_borrow_loop (n : nat) (i : u32) : result unit :=
.
(** [loops::ignore_input_mut_borrow]:
- Source: 'tests/src/loops.rs', lines 345:0-345:56 *)
+ Source: 'tests/src/loops.rs', lines 349:0-349:56 *)
Definition ignore_input_mut_borrow
(n : nat) (_a : u32) (i : u32) : result u32 :=
_ <- ignore_input_mut_borrow_loop n i; Ok _a
.
(** [loops::incr_ignore_input_mut_borrow]: loop 0:
- Source: 'tests/src/loops.rs', lines 353:0-358:1 *)
+ Source: 'tests/src/loops.rs', lines 357:0-362:1 *)
Fixpoint incr_ignore_input_mut_borrow_loop (n : nat) (i : u32) : result unit :=
match n with
| O => Fail_ OutOfFuel
@@ -698,14 +698,14 @@ Fixpoint incr_ignore_input_mut_borrow_loop (n : nat) (i : u32) : result unit :=
.
(** [loops::incr_ignore_input_mut_borrow]:
- Source: 'tests/src/loops.rs', lines 353:0-353:60 *)
+ Source: 'tests/src/loops.rs', lines 357:0-357:60 *)
Definition incr_ignore_input_mut_borrow
(n : nat) (a : u32) (i : u32) : result u32 :=
a1 <- u32_add a 1%u32; _ <- incr_ignore_input_mut_borrow_loop n i; Ok a1
.
(** [loops::ignore_input_shared_borrow]: loop 0:
- Source: 'tests/src/loops.rs', lines 362:0-366:1 *)
+ Source: 'tests/src/loops.rs', lines 366:0-370:1 *)
Fixpoint ignore_input_shared_borrow_loop (n : nat) (i : u32) : result unit :=
match n with
| O => Fail_ OutOfFuel
@@ -717,7 +717,7 @@ Fixpoint ignore_input_shared_borrow_loop (n : nat) (i : u32) : result unit :=
.
(** [loops::ignore_input_shared_borrow]:
- Source: 'tests/src/loops.rs', lines 362:0-362:59 *)
+ Source: 'tests/src/loops.rs', lines 366:0-366:59 *)
Definition ignore_input_shared_borrow
(n : nat) (_a : u32) (i : u32) : result u32 :=
_ <- ignore_input_shared_borrow_loop n i; Ok _a
diff --git a/tests/coq/misc/NoNestedBorrows.v b/tests/coq/misc/NoNestedBorrows.v
index de31fec7..b3e59172 100644
--- a/tests/coq/misc/NoNestedBorrows.v
+++ b/tests/coq/misc/NoNestedBorrows.v
@@ -9,7 +9,7 @@ Local Open Scope Primitives_scope.
Module NoNestedBorrows.
(** [no_nested_borrows::Pair]
- Source: 'tests/src/no_nested_borrows.rs', lines 4:0-4:23 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 7:0-7:23 *)
Record Pair_t (T1 T2 : Type) := mkPair_t { pair_x : T1; pair_y : T2; }.
Arguments mkPair_t { _ _ }.
@@ -17,7 +17,7 @@ Arguments pair_x { _ _ }.
Arguments pair_y { _ _ }.
(** [no_nested_borrows::List]
- Source: 'tests/src/no_nested_borrows.rs', lines 9:0-9:16 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 12:0-12:16 *)
Inductive List_t (T : Type) :=
| List_Cons : T -> List_t T -> List_t T
| List_Nil : List_t T
@@ -27,25 +27,25 @@ Arguments List_Cons { _ }.
Arguments List_Nil { _ }.
(** [no_nested_borrows::One]
- Source: 'tests/src/no_nested_borrows.rs', lines 20:0-20:16 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 23:0-23:16 *)
Inductive One_t (T1 : Type) := | One_One : T1 -> One_t T1.
Arguments One_One { _ }.
(** [no_nested_borrows::EmptyEnum]
- Source: 'tests/src/no_nested_borrows.rs', lines 26:0-26:18 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 29:0-29:18 *)
Inductive EmptyEnum_t := | EmptyEnum_Empty : EmptyEnum_t.
(** [no_nested_borrows::Enum]
- Source: 'tests/src/no_nested_borrows.rs', lines 32:0-32:13 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 35:0-35:13 *)
Inductive Enum_t := | Enum_Variant1 : Enum_t | Enum_Variant2 : Enum_t.
(** [no_nested_borrows::EmptyStruct]
- Source: 'tests/src/no_nested_borrows.rs', lines 39:0-39:22 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 42:0-42:22 *)
Definition EmptyStruct_t : Type := unit.
(** [no_nested_borrows::Sum]
- Source: 'tests/src/no_nested_borrows.rs', lines 41:0-41:20 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 44:0-44:20 *)
Inductive Sum_t (T1 T2 : Type) :=
| Sum_Left : T1 -> Sum_t T1 T2
| Sum_Right : T2 -> Sum_t T1 T2
@@ -55,22 +55,22 @@ Arguments Sum_Left { _ _ }.
Arguments Sum_Right { _ _ }.
(** [no_nested_borrows::cast_u32_to_i32]:
- Source: 'tests/src/no_nested_borrows.rs', lines 46:0-46:37 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 49:0-49:37 *)
Definition cast_u32_to_i32 (x : u32) : result i32 :=
scalar_cast U32 I32 x.
(** [no_nested_borrows::cast_bool_to_i32]:
- Source: 'tests/src/no_nested_borrows.rs', lines 50:0-50:39 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 53:0-53:39 *)
Definition cast_bool_to_i32 (x : bool) : result i32 :=
scalar_cast_bool I32 x.
(** [no_nested_borrows::cast_bool_to_bool]:
- Source: 'tests/src/no_nested_borrows.rs', lines 55:0-55:41 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 58:0-58:41 *)
Definition cast_bool_to_bool (x : bool) : result bool :=
Ok x.
(** [no_nested_borrows::test2]:
- Source: 'tests/src/no_nested_borrows.rs', lines 60:0-60:14 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 63:0-63:14 *)
Definition test2 : result unit :=
_ <- u32_add 23%u32 44%u32; Ok tt.
@@ -78,13 +78,13 @@ Definition test2 : result unit :=
Check (test2 )%return.
(** [no_nested_borrows::get_max]:
- Source: 'tests/src/no_nested_borrows.rs', lines 72:0-72:37 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 75:0-75:37 *)
Definition get_max (x : u32) (y : u32) : result u32 :=
if x s>= y then Ok x else Ok y
.
(** [no_nested_borrows::test3]:
- Source: 'tests/src/no_nested_borrows.rs', lines 80:0-80:14 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 83:0-83:14 *)
Definition test3 : result unit :=
x <- get_max 4%u32 3%u32;
y <- get_max 10%u32 11%u32;
@@ -96,7 +96,7 @@ Definition test3 : result unit :=
Check (test3 )%return.
(** [no_nested_borrows::test_neg1]:
- Source: 'tests/src/no_nested_borrows.rs', lines 87:0-87:18 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 90:0-90:18 *)
Definition test_neg1 : result unit :=
y <- i32_neg 3%i32; if negb (y s= (-3)%i32) then Fail_ Failure else Ok tt
.
@@ -105,7 +105,7 @@ Definition test_neg1 : result unit :=
Check (test_neg1 )%return.
(** [no_nested_borrows::refs_test1]:
- Source: 'tests/src/no_nested_borrows.rs', lines 94:0-94:19 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 97:0-97:19 *)
Definition refs_test1 : result unit :=
if negb (1%i32 s= 1%i32) then Fail_ Failure else Ok tt
.
@@ -114,7 +114,7 @@ Definition refs_test1 : result unit :=
Check (refs_test1 )%return.
(** [no_nested_borrows::refs_test2]:
- Source: 'tests/src/no_nested_borrows.rs', lines 105:0-105:19 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 108:0-108:19 *)
Definition refs_test2 : result unit :=
if negb (2%i32 s= 2%i32)
then Fail_ Failure
@@ -131,7 +131,7 @@ Definition refs_test2 : result unit :=
Check (refs_test2 )%return.
(** [no_nested_borrows::test_list1]:
- Source: 'tests/src/no_nested_borrows.rs', lines 121:0-121:19 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 124:0-124:19 *)
Definition test_list1 : result unit :=
Ok tt.
@@ -139,7 +139,7 @@ Definition test_list1 : result unit :=
Check (test_list1 )%return.
(** [no_nested_borrows::test_box1]:
- Source: 'tests/src/no_nested_borrows.rs', lines 126:0-126:18 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 129:0-129:18 *)
Definition test_box1 : result unit :=
p <- alloc_boxed_Box_deref_mut i32 0%i32;
let (_, deref_mut_back) := p in
@@ -152,24 +152,24 @@ Definition test_box1 : result unit :=
Check (test_box1 )%return.
(** [no_nested_borrows::copy_int]:
- Source: 'tests/src/no_nested_borrows.rs', lines 136:0-136:30 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 139:0-139:30 *)
Definition copy_int (x : i32) : result i32 :=
Ok x.
(** [no_nested_borrows::test_unreachable]:
- Source: 'tests/src/no_nested_borrows.rs', lines 142:0-142:32 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 145:0-145:32 *)
Definition test_unreachable (b : bool) : result unit :=
if b then Fail_ Failure else Ok tt
.
(** [no_nested_borrows::test_panic]:
- Source: 'tests/src/no_nested_borrows.rs', lines 150:0-150:26 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 153:0-153:26 *)
Definition test_panic (b : bool) : result unit :=
if b then Fail_ Failure else Ok tt
.
(** [no_nested_borrows::test_copy_int]:
- Source: 'tests/src/no_nested_borrows.rs', lines 157:0-157:22 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 160:0-160:22 *)
Definition test_copy_int : result unit :=
y <- copy_int 0%i32; if negb (0%i32 s= y) then Fail_ Failure else Ok tt
.
@@ -178,13 +178,13 @@ Definition test_copy_int : result unit :=
Check (test_copy_int )%return.
(** [no_nested_borrows::is_cons]:
- Source: 'tests/src/no_nested_borrows.rs', lines 164:0-164:38 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 167:0-167:38 *)
Definition is_cons (T : Type) (l : List_t T) : result bool :=
match l with | List_Cons _ _ => Ok true | List_Nil => Ok false end
.
(** [no_nested_borrows::test_is_cons]:
- Source: 'tests/src/no_nested_borrows.rs', lines 171:0-171:21 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 174:0-174:21 *)
Definition test_is_cons : result unit :=
b <- is_cons i32 (List_Cons 0%i32 List_Nil);
if negb b then Fail_ Failure else Ok tt
@@ -194,13 +194,13 @@ Definition test_is_cons : result unit :=
Check (test_is_cons )%return.
(** [no_nested_borrows::split_list]:
- Source: 'tests/src/no_nested_borrows.rs', lines 177:0-177:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 180:0-180:48 *)
Definition split_list (T : Type) (l : List_t T) : result (T * (List_t T)) :=
match l with | List_Cons hd tl => Ok (hd, tl) | List_Nil => Fail_ Failure end
.
(** [no_nested_borrows::test_split_list]:
- Source: 'tests/src/no_nested_borrows.rs', lines 185:0-185:24 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 188:0-188:24 *)
Definition test_split_list : result unit :=
p <- split_list i32 (List_Cons 0%i32 List_Nil);
let (hd, _) := p in
@@ -211,7 +211,7 @@ Definition test_split_list : result unit :=
Check (test_split_list )%return.
(** [no_nested_borrows::choose]:
- Source: 'tests/src/no_nested_borrows.rs', lines 192:0-192:70 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 195:0-195:70 *)
Definition choose
(T : Type) (b : bool) (x : T) (y : T) : result (T * (T -> result (T * T))) :=
if b
@@ -220,7 +220,7 @@ Definition choose
.
(** [no_nested_borrows::choose_test]:
- Source: 'tests/src/no_nested_borrows.rs', lines 200:0-200:20 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 203:0-203:20 *)
Definition choose_test : result unit :=
p <- choose i32 true 0%i32 0%i32;
let (z, choose_back) := p in
@@ -239,23 +239,23 @@ Definition choose_test : result unit :=
Check (choose_test )%return.
(** [no_nested_borrows::test_char]:
- Source: 'tests/src/no_nested_borrows.rs', lines 212:0-212:26 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 215:0-215:26 *)
Definition test_char : result char :=
Ok (char_of_byte Coq.Init.Byte.x61).
(** [no_nested_borrows::panic_mut_borrow]:
- Source: 'tests/src/no_nested_borrows.rs', lines 217:0-217:36 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 220:0-220:36 *)
Definition panic_mut_borrow (i : u32) : result u32 :=
Fail_ Failure.
(** [no_nested_borrows::Tree]
- Source: 'tests/src/no_nested_borrows.rs', lines 222:0-222:16 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 225:0-225:16 *)
Inductive Tree_t (T : Type) :=
| Tree_Leaf : T -> Tree_t T
| Tree_Node : T -> NodeElem_t T -> Tree_t T -> Tree_t T
(** [no_nested_borrows::NodeElem]
- Source: 'tests/src/no_nested_borrows.rs', lines 227:0-227:20 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 230:0-230:20 *)
with NodeElem_t (T : Type) :=
| NodeElem_Cons : Tree_t T -> NodeElem_t T -> NodeElem_t T
| NodeElem_Nil : NodeElem_t T
@@ -268,7 +268,7 @@ Arguments NodeElem_Cons { _ }.
Arguments NodeElem_Nil { _ }.
(** [no_nested_borrows::list_length]:
- Source: 'tests/src/no_nested_borrows.rs', lines 262:0-262:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 265:0-265:48 *)
Fixpoint list_length (T : Type) (l : List_t T) : result u32 :=
match l with
| List_Cons _ l1 => i <- list_length T l1; u32_add 1%u32 i
@@ -277,7 +277,7 @@ Fixpoint list_length (T : Type) (l : List_t T) : result u32 :=
.
(** [no_nested_borrows::list_nth_shared]:
- Source: 'tests/src/no_nested_borrows.rs', lines 270:0-270:62 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 273:0-273:62 *)
Fixpoint list_nth_shared (T : Type) (l : List_t T) (i : u32) : result T :=
match l with
| List_Cons x tl =>
@@ -289,7 +289,7 @@ Fixpoint list_nth_shared (T : Type) (l : List_t T) (i : u32) : result T :=
.
(** [no_nested_borrows::list_nth_mut]:
- Source: 'tests/src/no_nested_borrows.rs', lines 286:0-286:67 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 289:0-289:67 *)
Fixpoint list_nth_mut
(T : Type) (l : List_t T) (i : u32) :
result (T * (T -> result (List_t T)))
@@ -310,7 +310,7 @@ Fixpoint list_nth_mut
.
(** [no_nested_borrows::list_rev_aux]:
- Source: 'tests/src/no_nested_borrows.rs', lines 302:0-302:63 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 305:0-305:63 *)
Fixpoint list_rev_aux
(T : Type) (li : List_t T) (lo : List_t T) : result (List_t T) :=
match li with
@@ -320,14 +320,14 @@ Fixpoint list_rev_aux
.
(** [no_nested_borrows::list_rev]:
- Source: 'tests/src/no_nested_borrows.rs', lines 316:0-316:42 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 319:0-319:42 *)
Definition list_rev (T : Type) (l : List_t T) : result (List_t T) :=
let (li, _) := core_mem_replace (List_t T) l List_Nil in
list_rev_aux T li List_Nil
.
(** [no_nested_borrows::test_list_functions]:
- Source: 'tests/src/no_nested_borrows.rs', lines 321:0-321:28 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 324:0-324:28 *)
Definition test_list_functions : result unit :=
let l := List_Cons 2%i32 List_Nil in
let l1 := List_Cons 1%i32 l in
@@ -366,7 +366,7 @@ Definition test_list_functions : result unit :=
Check (test_list_functions )%return.
(** [no_nested_borrows::id_mut_pair1]:
- Source: 'tests/src/no_nested_borrows.rs', lines 337:0-337:89 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 340:0-340:89 *)
Definition id_mut_pair1
(T1 T2 : Type) (x : T1) (y : T2) :
result ((T1 * T2) * ((T1 * T2) -> result (T1 * T2)))
@@ -375,7 +375,7 @@ Definition id_mut_pair1
.
(** [no_nested_borrows::id_mut_pair2]:
- Source: 'tests/src/no_nested_borrows.rs', lines 341:0-341:88 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 344:0-344:88 *)
Definition id_mut_pair2
(T1 T2 : Type) (p : (T1 * T2)) :
result ((T1 * T2) * ((T1 * T2) -> result (T1 * T2)))
@@ -384,7 +384,7 @@ Definition id_mut_pair2
.
(** [no_nested_borrows::id_mut_pair3]:
- Source: 'tests/src/no_nested_borrows.rs', lines 345:0-345:93 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 348:0-348:93 *)
Definition id_mut_pair3
(T1 T2 : Type) (x : T1) (y : T2) :
result ((T1 * T2) * (T1 -> result T1) * (T2 -> result T2))
@@ -393,7 +393,7 @@ Definition id_mut_pair3
.
(** [no_nested_borrows::id_mut_pair4]:
- Source: 'tests/src/no_nested_borrows.rs', lines 349:0-349:92 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 352:0-352:92 *)
Definition id_mut_pair4
(T1 T2 : Type) (p : (T1 * T2)) :
result ((T1 * T2) * (T1 -> result T1) * (T2 -> result T2))
@@ -402,7 +402,7 @@ Definition id_mut_pair4
.
(** [no_nested_borrows::StructWithTuple]
- Source: 'tests/src/no_nested_borrows.rs', lines 356:0-356:34 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 359:0-359:34 *)
Record StructWithTuple_t (T1 T2 : Type) :=
mkStructWithTuple_t {
structWithTuple_p : (T1 * T2);
@@ -413,25 +413,25 @@ Arguments mkStructWithTuple_t { _ _ }.
Arguments structWithTuple_p { _ _ }.
(** [no_nested_borrows::new_tuple1]:
- Source: 'tests/src/no_nested_borrows.rs', lines 360:0-360:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 363:0-363:48 *)
Definition new_tuple1 : result (StructWithTuple_t u32 u32) :=
Ok {| structWithTuple_p := (1%u32, 2%u32) |}
.
(** [no_nested_borrows::new_tuple2]:
- Source: 'tests/src/no_nested_borrows.rs', lines 364:0-364:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 367:0-367:48 *)
Definition new_tuple2 : result (StructWithTuple_t i16 i16) :=
Ok {| structWithTuple_p := (1%i16, 2%i16) |}
.
(** [no_nested_borrows::new_tuple3]:
- Source: 'tests/src/no_nested_borrows.rs', lines 368:0-368:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 371:0-371:48 *)
Definition new_tuple3 : result (StructWithTuple_t u64 i64) :=
Ok {| structWithTuple_p := (1%u64, 2%i64) |}
.
(** [no_nested_borrows::StructWithPair]
- Source: 'tests/src/no_nested_borrows.rs', lines 373:0-373:33 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 376:0-376:33 *)
Record StructWithPair_t (T1 T2 : Type) :=
mkStructWithPair_t {
structWithPair_p : Pair_t T1 T2;
@@ -442,13 +442,13 @@ Arguments mkStructWithPair_t { _ _ }.
Arguments structWithPair_p { _ _ }.
(** [no_nested_borrows::new_pair1]:
- Source: 'tests/src/no_nested_borrows.rs', lines 377:0-377:46 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 380:0-380:46 *)
Definition new_pair1 : result (StructWithPair_t u32 u32) :=
Ok {| structWithPair_p := {| pair_x := 1%u32; pair_y := 2%u32 |} |}
.
(** [no_nested_borrows::test_constants]:
- Source: 'tests/src/no_nested_borrows.rs', lines 385:0-385:23 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 388:0-388:23 *)
Definition test_constants : result unit :=
swt <- new_tuple1;
let (i, _) := swt.(structWithTuple_p) in
@@ -475,7 +475,7 @@ Definition test_constants : result unit :=
Check (test_constants )%return.
(** [no_nested_borrows::test_weird_borrows1]:
- Source: 'tests/src/no_nested_borrows.rs', lines 394:0-394:28 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 397:0-397:28 *)
Definition test_weird_borrows1 : result unit :=
Ok tt.
@@ -483,78 +483,78 @@ Definition test_weird_borrows1 : result unit :=
Check (test_weird_borrows1 )%return.
(** [no_nested_borrows::test_mem_replace]:
- Source: 'tests/src/no_nested_borrows.rs', lines 404:0-404:37 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 407:0-407:37 *)
Definition test_mem_replace (px : u32) : result u32 :=
let (y, _) := core_mem_replace u32 px 1%u32 in
if negb (y s= 0%u32) then Fail_ Failure else Ok 2%u32
.
(** [no_nested_borrows::test_shared_borrow_bool1]:
- Source: 'tests/src/no_nested_borrows.rs', lines 411:0-411:47 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 414:0-414:47 *)
Definition test_shared_borrow_bool1 (b : bool) : result u32 :=
if b then Ok 0%u32 else Ok 1%u32
.
(** [no_nested_borrows::test_shared_borrow_bool2]:
- Source: 'tests/src/no_nested_borrows.rs', lines 424:0-424:40 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 427:0-427:40 *)
Definition test_shared_borrow_bool2 : result u32 :=
Ok 0%u32.
(** [no_nested_borrows::test_shared_borrow_enum1]:
- Source: 'tests/src/no_nested_borrows.rs', lines 439:0-439:52 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 442:0-442:52 *)
Definition test_shared_borrow_enum1 (l : List_t u32) : result u32 :=
match l with | List_Cons _ _ => Ok 1%u32 | List_Nil => Ok 0%u32 end
.
(** [no_nested_borrows::test_shared_borrow_enum2]:
- Source: 'tests/src/no_nested_borrows.rs', lines 451:0-451:40 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 454:0-454:40 *)
Definition test_shared_borrow_enum2 : result u32 :=
Ok 0%u32.
(** [no_nested_borrows::incr]:
- Source: 'tests/src/no_nested_borrows.rs', lines 462:0-462:24 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 465:0-465:24 *)
Definition incr (x : u32) : result u32 :=
u32_add x 1%u32.
(** [no_nested_borrows::call_incr]:
- Source: 'tests/src/no_nested_borrows.rs', lines 466:0-466:35 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 469:0-469:35 *)
Definition call_incr (x : u32) : result u32 :=
incr x.
(** [no_nested_borrows::read_then_incr]:
- Source: 'tests/src/no_nested_borrows.rs', lines 471:0-471:41 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 474:0-474:41 *)
Definition read_then_incr (x : u32) : result (u32 * u32) :=
x1 <- u32_add x 1%u32; Ok (x, x1)
.
(** [no_nested_borrows::Tuple]
- Source: 'tests/src/no_nested_borrows.rs', lines 477:0-477:24 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 480:0-480:24 *)
Definition Tuple_t (T1 T2 : Type) : Type := T1 * T2.
(** [no_nested_borrows::use_tuple_struct]:
- Source: 'tests/src/no_nested_borrows.rs', lines 479:0-479:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 482:0-482:48 *)
Definition use_tuple_struct (x : Tuple_t u32 u32) : result (Tuple_t u32 u32) :=
let (_, i) := x in Ok (1%u32, i)
.
(** [no_nested_borrows::create_tuple_struct]:
- Source: 'tests/src/no_nested_borrows.rs', lines 483:0-483:61 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 486:0-486:61 *)
Definition create_tuple_struct
(x : u32) (y : u64) : result (Tuple_t u32 u64) :=
Ok (x, y)
.
(** [no_nested_borrows::IdType]
- Source: 'tests/src/no_nested_borrows.rs', lines 488:0-488:20 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 491:0-491:20 *)
Definition IdType_t (T : Type) : Type := T.
(** [no_nested_borrows::use_id_type]:
- Source: 'tests/src/no_nested_borrows.rs', lines 490:0-490:40 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 493:0-493:40 *)
Definition use_id_type (T : Type) (x : IdType_t T) : result T :=
Ok x.
(** [no_nested_borrows::create_id_type]:
- Source: 'tests/src/no_nested_borrows.rs', lines 494:0-494:43 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 497:0-497:43 *)
Definition create_id_type (T : Type) (x : T) : result (IdType_t T) :=
Ok x.
diff --git a/tests/coq/misc/Paper.v b/tests/coq/misc/Paper.v
index 661a8cc2..e5728364 100644
--- a/tests/coq/misc/Paper.v
+++ b/tests/coq/misc/Paper.v
@@ -9,12 +9,12 @@ Local Open Scope Primitives_scope.
Module Paper.
(** [paper::ref_incr]:
- Source: 'tests/src/paper.rs', lines 4:0-4:28 *)
+ Source: 'tests/src/paper.rs', lines 7:0-7:28 *)
Definition ref_incr (x : i32) : result i32 :=
i32_add x 1%i32.
(** [paper::test_incr]:
- Source: 'tests/src/paper.rs', lines 8:0-8:18 *)
+ Source: 'tests/src/paper.rs', lines 11:0-11:18 *)
Definition test_incr : result unit :=
x <- ref_incr 0%i32; if negb (x s= 1%i32) then Fail_ Failure else Ok tt
.
@@ -23,7 +23,7 @@ Definition test_incr : result unit :=
Check (test_incr )%return.
(** [paper::choose]:
- Source: 'tests/src/paper.rs', lines 15:0-15:70 *)
+ Source: 'tests/src/paper.rs', lines 18:0-18:70 *)
Definition choose
(T : Type) (b : bool) (x : T) (y : T) : result (T * (T -> result (T * T))) :=
if b
@@ -32,7 +32,7 @@ Definition choose
.
(** [paper::test_choose]:
- Source: 'tests/src/paper.rs', lines 23:0-23:20 *)
+ Source: 'tests/src/paper.rs', lines 26:0-26:20 *)
Definition test_choose : result unit :=
p <- choose i32 true 0%i32 0%i32;
let (z, choose_back) := p in
@@ -51,7 +51,7 @@ Definition test_choose : result unit :=
Check (test_choose )%return.
(** [paper::List]
- Source: 'tests/src/paper.rs', lines 35:0-35:16 *)
+ Source: 'tests/src/paper.rs', lines 38:0-38:16 *)
Inductive List_t (T : Type) :=
| List_Cons : T -> List_t T -> List_t T
| List_Nil : List_t T
@@ -61,7 +61,7 @@ Arguments List_Cons { _ }.
Arguments List_Nil { _ }.
(** [paper::list_nth_mut]:
- Source: 'tests/src/paper.rs', lines 42:0-42:67 *)
+ Source: 'tests/src/paper.rs', lines 45:0-45:67 *)
Fixpoint list_nth_mut
(T : Type) (l : List_t T) (i : u32) :
result (T * (T -> result (List_t T)))
@@ -82,7 +82,7 @@ Fixpoint list_nth_mut
.
(** [paper::sum]:
- Source: 'tests/src/paper.rs', lines 57:0-57:32 *)
+ Source: 'tests/src/paper.rs', lines 60:0-60:32 *)
Fixpoint sum (l : List_t i32) : result i32 :=
match l with
| List_Cons x tl => i <- sum tl; i32_add x i
@@ -91,7 +91,7 @@ Fixpoint sum (l : List_t i32) : result i32 :=
.
(** [paper::test_nth]:
- Source: 'tests/src/paper.rs', lines 68:0-68:17 *)
+ Source: 'tests/src/paper.rs', lines 71:0-71:17 *)
Definition test_nth : result unit :=
let l := List_Cons 3%i32 List_Nil in
let l1 := List_Cons 2%i32 l in
@@ -107,7 +107,7 @@ Definition test_nth : result unit :=
Check (test_nth )%return.
(** [paper::call_choose]:
- Source: 'tests/src/paper.rs', lines 76:0-76:44 *)
+ Source: 'tests/src/paper.rs', lines 79:0-79:44 *)
Definition call_choose (p : (u32 * u32)) : result u32 :=
let (px, py) := p in
p1 <- choose u32 true px py;
diff --git a/tests/coq/misc/PoloniusList.v b/tests/coq/misc/PoloniusList.v
index c89f9655..a600deaa 100644
--- a/tests/coq/misc/PoloniusList.v
+++ b/tests/coq/misc/PoloniusList.v
@@ -9,7 +9,7 @@ Local Open Scope Primitives_scope.
Module PoloniusList.
(** [polonius_list::List]
- Source: 'tests/src/polonius_list.rs', lines 3:0-3:16 *)
+ Source: 'tests/src/polonius_list.rs', lines 6:0-6:16 *)
Inductive List_t (T : Type) :=
| List_Cons : T -> List_t T -> List_t T
| List_Nil : List_t T
@@ -19,7 +19,7 @@ Arguments List_Cons { _ }.
Arguments List_Nil { _ }.
(** [polonius_list::get_list_at_x]:
- Source: 'tests/src/polonius_list.rs', lines 13:0-13:76 *)
+ Source: 'tests/src/polonius_list.rs', lines 16:0-16:76 *)
Fixpoint get_list_at_x
(ls : List_t u32) (x : u32) :
result ((List_t u32) * (List_t u32 -> result (List_t u32)))
diff --git a/tests/coq/traits/Traits.v b/tests/coq/traits/Traits.v
index e583c2be..ad1be7ef 100644
--- a/tests/coq/traits/Traits.v
+++ b/tests/coq/traits/Traits.v
@@ -9,7 +9,7 @@ Local Open Scope Primitives_scope.
Module Traits.
(** Trait declaration: [traits::BoolTrait]
- Source: 'tests/src/traits.rs', lines 1:0-1:19 *)
+ Source: 'tests/src/traits.rs', lines 2:0-2:19 *)
Record BoolTrait_t (Self : Type) := mkBoolTrait_t {
BoolTrait_t_get_bool : Self -> result bool;
}.
@@ -18,59 +18,59 @@ Arguments mkBoolTrait_t { _ }.
Arguments BoolTrait_t_get_bool { _ }.
(** [traits::{(traits::BoolTrait for bool)}::get_bool]:
- Source: 'tests/src/traits.rs', lines 12:4-12:30 *)
+ Source: 'tests/src/traits.rs', lines 13:4-13:30 *)
Definition boolTraitBool_get_bool (self : bool) : result bool :=
Ok self.
(** Trait implementation: [traits::{(traits::BoolTrait for bool)}]
- Source: 'tests/src/traits.rs', lines 11:0-11:23 *)
+ Source: 'tests/src/traits.rs', lines 12:0-12:23 *)
Definition BoolTraitBool : BoolTrait_t bool := {|
BoolTrait_t_get_bool := boolTraitBool_get_bool;
|}.
(** [traits::BoolTrait::ret_true]:
- Source: 'tests/src/traits.rs', lines 6:4-6:30 *)
+ Source: 'tests/src/traits.rs', lines 7:4-7:30 *)
Definition boolTrait_ret_true
{Self : Type} (self_clause : BoolTrait_t Self) (self : Self) : result bool :=
Ok true
.
(** [traits::test_bool_trait_bool]:
- Source: 'tests/src/traits.rs', lines 17:0-17:44 *)
+ Source: 'tests/src/traits.rs', lines 18:0-18:44 *)
Definition test_bool_trait_bool (x : bool) : result bool :=
b <- boolTraitBool_get_bool x;
if b then boolTrait_ret_true BoolTraitBool x else Ok false
.
(** [traits::{(traits::BoolTrait for core::option::Option<T>)#1}::get_bool]:
- Source: 'tests/src/traits.rs', lines 23:4-23:30 *)
+ Source: 'tests/src/traits.rs', lines 24:4-24:30 *)
Definition boolTraitOption_get_bool
(T : Type) (self : option T) : result bool :=
match self with | None => Ok false | Some _ => Ok true end
.
(** Trait implementation: [traits::{(traits::BoolTrait for core::option::Option<T>)#1}]
- Source: 'tests/src/traits.rs', lines 22:0-22:31 *)
+ Source: 'tests/src/traits.rs', lines 23:0-23:31 *)
Definition BoolTraitOption (T : Type) : BoolTrait_t (option T) := {|
BoolTrait_t_get_bool := boolTraitOption_get_bool T;
|}.
(** [traits::test_bool_trait_option]:
- Source: 'tests/src/traits.rs', lines 31:0-31:54 *)
+ Source: 'tests/src/traits.rs', lines 32:0-32:54 *)
Definition test_bool_trait_option (T : Type) (x : option T) : result bool :=
b <- boolTraitOption_get_bool T x;
if b then boolTrait_ret_true (BoolTraitOption T) x else Ok false
.
(** [traits::test_bool_trait]:
- Source: 'tests/src/traits.rs', lines 35:0-35:50 *)
+ Source: 'tests/src/traits.rs', lines 36:0-36:50 *)
Definition test_bool_trait
(T : Type) (boolTraitInst : BoolTrait_t T) (x : T) : result bool :=
boolTraitInst.(BoolTrait_t_get_bool) x
.
(** Trait declaration: [traits::ToU64]
- Source: 'tests/src/traits.rs', lines 39:0-39:15 *)
+ Source: 'tests/src/traits.rs', lines 40:0-40:15 *)
Record ToU64_t (Self : Type) := mkToU64_t {
ToU64_t_to_u64 : Self -> result u64;
}.
@@ -79,16 +79,16 @@ Arguments mkToU64_t { _ }.
Arguments ToU64_t_to_u64 { _ }.
(** [traits::{(traits::ToU64 for u64)#2}::to_u64]:
- Source: 'tests/src/traits.rs', lines 44:4-44:26 *)
+ Source: 'tests/src/traits.rs', lines 45:4-45:26 *)
Definition toU64U64_to_u64 (self : u64) : result u64 :=
Ok self.
(** Trait implementation: [traits::{(traits::ToU64 for u64)#2}]
- Source: 'tests/src/traits.rs', lines 43:0-43:18 *)
+ Source: 'tests/src/traits.rs', lines 44:0-44:18 *)
Definition ToU64U64 : ToU64_t u64 := {| ToU64_t_to_u64 := toU64U64_to_u64; |}.
(** [traits::{(traits::ToU64 for (A, A))#3}::to_u64]:
- Source: 'tests/src/traits.rs', lines 50:4-50:26 *)
+ Source: 'tests/src/traits.rs', lines 51:4-51:26 *)
Definition toU64Pair_to_u64
(A : Type) (toU64Inst : ToU64_t A) (self : (A * A)) : result u64 :=
let (t, t1) := self in
@@ -98,65 +98,65 @@ Definition toU64Pair_to_u64
.
(** Trait implementation: [traits::{(traits::ToU64 for (A, A))#3}]
- Source: 'tests/src/traits.rs', lines 49:0-49:31 *)
+ Source: 'tests/src/traits.rs', lines 50:0-50:31 *)
Definition ToU64Pair (A : Type) (toU64Inst : ToU64_t A) : ToU64_t (A * A) := {|
ToU64_t_to_u64 := toU64Pair_to_u64 A toU64Inst;
|}.
(** [traits::f]:
- Source: 'tests/src/traits.rs', lines 55:0-55:36 *)
+ Source: 'tests/src/traits.rs', lines 56:0-56:36 *)
Definition f (T : Type) (toU64Inst : ToU64_t T) (x : (T * T)) : result u64 :=
toU64Pair_to_u64 T toU64Inst x
.
(** [traits::g]:
- Source: 'tests/src/traits.rs', lines 59:0-61:18 *)
+ Source: 'tests/src/traits.rs', lines 60:0-62:18 *)
Definition g
(T : Type) (toU64PairInst : ToU64_t (T * T)) (x : (T * T)) : result u64 :=
toU64PairInst.(ToU64_t_to_u64) x
.
(** [traits::h0]:
- Source: 'tests/src/traits.rs', lines 66:0-66:24 *)
+ Source: 'tests/src/traits.rs', lines 67:0-67:24 *)
Definition h0 (x : u64) : result u64 :=
toU64U64_to_u64 x.
(** [traits::Wrapper]
- Source: 'tests/src/traits.rs', lines 70:0-70:21 *)
+ Source: 'tests/src/traits.rs', lines 71:0-71:21 *)
Record Wrapper_t (T : Type) := mkWrapper_t { wrapper_x : T; }.
Arguments mkWrapper_t { _ }.
Arguments wrapper_x { _ }.
(** [traits::{(traits::ToU64 for traits::Wrapper<T>)#4}::to_u64]:
- Source: 'tests/src/traits.rs', lines 75:4-75:26 *)
+ Source: 'tests/src/traits.rs', lines 76:4-76:26 *)
Definition toU64traitsWrapper_to_u64
(T : Type) (toU64Inst : ToU64_t T) (self : Wrapper_t T) : result u64 :=
toU64Inst.(ToU64_t_to_u64) self.(wrapper_x)
.
(** Trait implementation: [traits::{(traits::ToU64 for traits::Wrapper<T>)#4}]
- Source: 'tests/src/traits.rs', lines 74:0-74:35 *)
+ Source: 'tests/src/traits.rs', lines 75:0-75:35 *)
Definition ToU64traitsWrapper (T : Type) (toU64Inst : ToU64_t T) : ToU64_t
(Wrapper_t T) := {|
ToU64_t_to_u64 := toU64traitsWrapper_to_u64 T toU64Inst;
|}.
(** [traits::h1]:
- Source: 'tests/src/traits.rs', lines 80:0-80:33 *)
+ Source: 'tests/src/traits.rs', lines 81:0-81:33 *)
Definition h1 (x : Wrapper_t u64) : result u64 :=
toU64traitsWrapper_to_u64 u64 ToU64U64 x
.
(** [traits::h2]:
- Source: 'tests/src/traits.rs', lines 84:0-84:41 *)
+ Source: 'tests/src/traits.rs', lines 85:0-85:41 *)
Definition h2
(T : Type) (toU64Inst : ToU64_t T) (x : Wrapper_t T) : result u64 :=
toU64traitsWrapper_to_u64 T toU64Inst x
.
(** Trait declaration: [traits::ToType]
- Source: 'tests/src/traits.rs', lines 88:0-88:19 *)
+ Source: 'tests/src/traits.rs', lines 89:0-89:19 *)
Record ToType_t (Self T : Type) := mkToType_t {
ToType_t_to_type : Self -> result T;
}.
@@ -165,19 +165,19 @@ Arguments mkToType_t { _ _ }.
Arguments ToType_t_to_type { _ _ }.
(** [traits::{(traits::ToType<bool> for u64)#5}::to_type]:
- Source: 'tests/src/traits.rs', lines 93:4-93:28 *)
+ Source: 'tests/src/traits.rs', lines 94:4-94:28 *)
Definition toTypeU64Bool_to_type (self : u64) : result bool :=
Ok (self s> 0%u64)
.
(** Trait implementation: [traits::{(traits::ToType<bool> for u64)#5}]
- Source: 'tests/src/traits.rs', lines 92:0-92:25 *)
+ Source: 'tests/src/traits.rs', lines 93:0-93:25 *)
Definition ToTypeU64Bool : ToType_t u64 bool := {|
ToType_t_to_type := toTypeU64Bool_to_type;
|}.
(** Trait declaration: [traits::OfType]
- Source: 'tests/src/traits.rs', lines 98:0-98:16 *)
+ Source: 'tests/src/traits.rs', lines 99:0-99:16 *)
Record OfType_t (Self : Type) := mkOfType_t {
OfType_t_of_type : forall (T : Type) (toTypeInst : ToType_t T Self), T ->
result Self;
@@ -187,7 +187,7 @@ Arguments mkOfType_t { _ }.
Arguments OfType_t_of_type { _ }.
(** [traits::h3]:
- Source: 'tests/src/traits.rs', lines 104:0-104:50 *)
+ Source: 'tests/src/traits.rs', lines 105:0-105:50 *)
Definition h3
(T1 T2 : Type) (ofTypeInst : OfType_t T1) (toTypeInst : ToType_t T2 T1)
(y : T2) :
@@ -197,7 +197,7 @@ Definition h3
.
(** Trait declaration: [traits::OfTypeBis]
- Source: 'tests/src/traits.rs', lines 109:0-109:36 *)
+ Source: 'tests/src/traits.rs', lines 110:0-110:36 *)
Record OfTypeBis_t (Self T : Type) := mkOfTypeBis_t {
OfTypeBis_tOfTypeBis_t_ToTypeInst : ToType_t T Self;
OfTypeBis_t_of_type : T -> result Self;
@@ -208,7 +208,7 @@ Arguments OfTypeBis_tOfTypeBis_t_ToTypeInst { _ _ }.
Arguments OfTypeBis_t_of_type { _ _ }.
(** [traits::h4]:
- Source: 'tests/src/traits.rs', lines 118:0-118:57 *)
+ Source: 'tests/src/traits.rs', lines 119:0-119:57 *)
Definition h4
(T1 T2 : Type) (ofTypeBisInst : OfTypeBis_t T1 T2) (toTypeInst : ToType_t T2
T1) (y : T2) :
@@ -218,15 +218,15 @@ Definition h4
.
(** [traits::TestType]
- Source: 'tests/src/traits.rs', lines 122:0-122:22 *)
+ Source: 'tests/src/traits.rs', lines 123:0-123:22 *)
Definition TestType_t (T : Type) : Type := T.
(** [traits::{traits::TestType<T>#6}::test::TestType1]
- Source: 'tests/src/traits.rs', lines 127:8-127:24 *)
+ Source: 'tests/src/traits.rs', lines 128:8-128:24 *)
Definition TestType_test_TestType1_t : Type := u64.
(** Trait declaration: [traits::{traits::TestType<T>#6}::test::TestTrait]
- Source: 'tests/src/traits.rs', lines 128:8-128:23 *)
+ Source: 'tests/src/traits.rs', lines 129:8-129:23 *)
Record TestType_test_TestTrait_t (Self : Type) := mkTestType_test_TestTrait_t {
TestType_test_TestTrait_t_test : Self -> result bool;
}.
@@ -235,14 +235,14 @@ Arguments mkTestType_test_TestTrait_t { _ }.
Arguments TestType_test_TestTrait_t_test { _ }.
(** [traits::{traits::TestType<T>#6}::test::{(traits::{traits::TestType<T>#6}::test::TestTrait for traits::{traits::TestType<T>#6}::test::TestType1)}::test]:
- Source: 'tests/src/traits.rs', lines 139:12-139:34 *)
+ Source: 'tests/src/traits.rs', lines 140:12-140:34 *)
Definition testType_test_TestTraittraitsTestTypetestTestType1_test
(self : TestType_test_TestType1_t) : result bool :=
Ok (self s> 1%u64)
.
(** Trait implementation: [traits::{traits::TestType<T>#6}::test::{(traits::{traits::TestType<T>#6}::test::TestTrait for traits::{traits::TestType<T>#6}::test::TestType1)}]
- Source: 'tests/src/traits.rs', lines 138:8-138:36 *)
+ Source: 'tests/src/traits.rs', lines 139:8-139:36 *)
Definition TestType_test_TestTraittraitsTestTypetestTestType1 :
TestType_test_TestTrait_t TestType_test_TestType1_t := {|
TestType_test_TestTrait_t_test :=
@@ -250,7 +250,7 @@ Definition TestType_test_TestTraittraitsTestTypetestTestType1 :
|}.
(** [traits::{traits::TestType<T>#6}::test]:
- Source: 'tests/src/traits.rs', lines 126:4-126:36 *)
+ Source: 'tests/src/traits.rs', lines 127:4-127:36 *)
Definition testType_test
(T : Type) (toU64Inst : ToU64_t T) (self : TestType_t T) (x : T) :
result bool
@@ -262,11 +262,11 @@ Definition testType_test
.
(** [traits::BoolWrapper]
- Source: 'tests/src/traits.rs', lines 150:0-150:22 *)
+ Source: 'tests/src/traits.rs', lines 151:0-151:22 *)
Definition BoolWrapper_t : Type := bool.
(** [traits::{(traits::ToType<T> for traits::BoolWrapper)#7}::to_type]:
- Source: 'tests/src/traits.rs', lines 156:4-156:25 *)
+ Source: 'tests/src/traits.rs', lines 157:4-157:25 *)
Definition toTypetraitsBoolWrapperT_to_type
(T : Type) (toTypeBoolTInst : ToType_t bool T) (self : BoolWrapper_t) :
result T
@@ -275,14 +275,14 @@ Definition toTypetraitsBoolWrapperT_to_type
.
(** Trait implementation: [traits::{(traits::ToType<T> for traits::BoolWrapper)#7}]
- Source: 'tests/src/traits.rs', lines 152:0-152:33 *)
+ Source: 'tests/src/traits.rs', lines 153:0-153:33 *)
Definition ToTypetraitsBoolWrapperT (T : Type) (toTypeBoolTInst : ToType_t bool
T) : ToType_t BoolWrapper_t T := {|
ToType_t_to_type := toTypetraitsBoolWrapperT_to_type T toTypeBoolTInst;
|}.
(** [traits::WithConstTy::LEN2]
- Source: 'tests/src/traits.rs', lines 164:4-164:21 *)
+ Source: 'tests/src/traits.rs', lines 165:4-165:21 *)
Definition with_const_ty_len2_default_body (Self : Type) (LEN : usize)
: result usize :=
Ok 32%usize
@@ -292,7 +292,7 @@ Definition with_const_ty_len2_default (Self : Type) (LEN : usize) : usize :=
.
(** Trait declaration: [traits::WithConstTy]
- Source: 'tests/src/traits.rs', lines 161:0-161:39 *)
+ Source: 'tests/src/traits.rs', lines 162:0-162:39 *)
Record WithConstTy_t (Self : Type) (LEN : usize) := mkWithConstTy_t {
WithConstTy_tWithConstTy_t_LEN1 : usize;
WithConstTy_tWithConstTy_t_LEN2 : usize;
@@ -312,21 +312,21 @@ Arguments WithConstTy_tWithConstTy_t_W_clause_0 { _ _ }.
Arguments WithConstTy_t_f { _ _ }.
(** [traits::{(traits::WithConstTy<32: usize> for bool)#8}::LEN1]
- Source: 'tests/src/traits.rs', lines 175:4-175:21 *)
+ Source: 'tests/src/traits.rs', lines 176:4-176:21 *)
Definition with_const_ty_bool32_len1_body : result usize := Ok 12%usize.
Definition with_const_ty_bool32_len1 : usize :=
with_const_ty_bool32_len1_body%global
.
(** [traits::{(traits::WithConstTy<32: usize> for bool)#8}::f]:
- Source: 'tests/src/traits.rs', lines 180:4-180:39 *)
+ Source: 'tests/src/traits.rs', lines 181:4-181:39 *)
Definition withConstTyBool32_f
(i : u64) (a : array u8 32%usize) : result u64 :=
Ok i
.
(** Trait implementation: [traits::{(traits::WithConstTy<32: usize> for bool)#8}]
- Source: 'tests/src/traits.rs', lines 174:0-174:29 *)
+ Source: 'tests/src/traits.rs', lines 175:0-175:29 *)
Definition WithConstTyBool32 : WithConstTy_t bool 32%usize := {|
WithConstTy_tWithConstTy_t_LEN1 := with_const_ty_bool32_len1;
WithConstTy_tWithConstTy_t_LEN2 := with_const_ty_len2_default bool 32%usize;
@@ -337,7 +337,7 @@ Definition WithConstTyBool32 : WithConstTy_t bool 32%usize := {|
|}.
(** [traits::use_with_const_ty1]:
- Source: 'tests/src/traits.rs', lines 183:0-183:75 *)
+ Source: 'tests/src/traits.rs', lines 184:0-184:75 *)
Definition use_with_const_ty1
(H : Type) (LEN : usize) (withConstTyInst : WithConstTy_t H LEN) :
result usize
@@ -346,7 +346,7 @@ Definition use_with_const_ty1
.
(** [traits::use_with_const_ty2]:
- Source: 'tests/src/traits.rs', lines 187:0-187:73 *)
+ Source: 'tests/src/traits.rs', lines 188:0-188:73 *)
Definition use_with_const_ty2
(H : Type) (LEN : usize) (withConstTyInst : WithConstTy_t H LEN)
(w : withConstTyInst.(WithConstTy_tWithConstTy_t_W)) :
@@ -356,7 +356,7 @@ Definition use_with_const_ty2
.
(** [traits::use_with_const_ty3]:
- Source: 'tests/src/traits.rs', lines 189:0-189:80 *)
+ Source: 'tests/src/traits.rs', lines 190:0-190:80 *)
Definition use_with_const_ty3
(H : Type) (LEN : usize) (withConstTyInst : WithConstTy_t H LEN)
(x : withConstTyInst.(WithConstTy_tWithConstTy_t_W)) :
@@ -366,12 +366,12 @@ Definition use_with_const_ty3
.
(** [traits::test_where1]:
- Source: 'tests/src/traits.rs', lines 193:0-193:40 *)
+ Source: 'tests/src/traits.rs', lines 194:0-194:40 *)
Definition test_where1 (T : Type) (_x : T) : result unit :=
Ok tt.
(** [traits::test_where2]:
- Source: 'tests/src/traits.rs', lines 194:0-194:57 *)
+ Source: 'tests/src/traits.rs', lines 195:0-195:57 *)
Definition test_where2
(T : Type) (withConstTyT32Inst : WithConstTy_t T 32%usize) (_x : u32) :
result unit
@@ -380,7 +380,7 @@ Definition test_where2
.
(** Trait declaration: [traits::ParentTrait0]
- Source: 'tests/src/traits.rs', lines 200:0-200:22 *)
+ Source: 'tests/src/traits.rs', lines 201:0-201:22 *)
Record ParentTrait0_t (Self : Type) := mkParentTrait0_t {
ParentTrait0_tParentTrait0_t_W : Type;
ParentTrait0_t_get_name : Self -> result string;
@@ -393,13 +393,13 @@ Arguments ParentTrait0_t_get_name { _ }.
Arguments ParentTrait0_t_get_w { _ }.
(** Trait declaration: [traits::ParentTrait1]
- Source: 'tests/src/traits.rs', lines 205:0-205:22 *)
+ Source: 'tests/src/traits.rs', lines 206:0-206:22 *)
Record ParentTrait1_t (Self : Type) := mkParentTrait1_t{}.
Arguments mkParentTrait1_t { _ }.
(** Trait declaration: [traits::ChildTrait]
- Source: 'tests/src/traits.rs', lines 206:0-206:49 *)
+ Source: 'tests/src/traits.rs', lines 207:0-207:49 *)
Record ChildTrait_t (Self : Type) := mkChildTrait_t {
ChildTrait_tChildTrait_t_ParentTrait0Inst : ParentTrait0_t Self;
ChildTrait_tChildTrait_t_ParentTrait1Inst : ParentTrait1_t Self;
@@ -410,7 +410,7 @@ Arguments ChildTrait_tChildTrait_t_ParentTrait0Inst { _ }.
Arguments ChildTrait_tChildTrait_t_ParentTrait1Inst { _ }.
(** [traits::test_child_trait1]:
- Source: 'tests/src/traits.rs', lines 209:0-209:56 *)
+ Source: 'tests/src/traits.rs', lines 210:0-210:56 *)
Definition test_child_trait1
(T : Type) (childTraitInst : ChildTrait_t T) (x : T) : result string :=
childTraitInst.(ChildTrait_tChildTrait_t_ParentTrait0Inst).(ParentTrait0_t_get_name)
@@ -418,7 +418,7 @@ Definition test_child_trait1
.
(** [traits::test_child_trait2]:
- Source: 'tests/src/traits.rs', lines 213:0-213:54 *)
+ Source: 'tests/src/traits.rs', lines 214:0-214:54 *)
Definition test_child_trait2
(T : Type) (childTraitInst : ChildTrait_t T) (x : T) :
result
@@ -429,7 +429,7 @@ Definition test_child_trait2
.
(** [traits::order1]:
- Source: 'tests/src/traits.rs', lines 219:0-219:59 *)
+ Source: 'tests/src/traits.rs', lines 220:0-220:59 *)
Definition order1
(T U : Type) (parentTrait0Inst : ParentTrait0_t T) (parentTrait0Inst1 :
ParentTrait0_t U) :
@@ -439,7 +439,7 @@ Definition order1
.
(** Trait declaration: [traits::ChildTrait1]
- Source: 'tests/src/traits.rs', lines 222:0-222:35 *)
+ Source: 'tests/src/traits.rs', lines 223:0-223:35 *)
Record ChildTrait1_t (Self : Type) := mkChildTrait1_t {
ChildTrait1_tChildTrait1_t_ParentTrait1Inst : ParentTrait1_t Self;
}.
@@ -448,17 +448,17 @@ Arguments mkChildTrait1_t { _ }.
Arguments ChildTrait1_tChildTrait1_t_ParentTrait1Inst { _ }.
(** Trait implementation: [traits::{(traits::ParentTrait1 for usize)#9}]
- Source: 'tests/src/traits.rs', lines 224:0-224:27 *)
+ Source: 'tests/src/traits.rs', lines 225:0-225:27 *)
Definition ParentTrait1Usize : ParentTrait1_t usize := mkParentTrait1_t.
(** Trait implementation: [traits::{(traits::ChildTrait1 for usize)#10}]
- Source: 'tests/src/traits.rs', lines 225:0-225:26 *)
+ Source: 'tests/src/traits.rs', lines 226:0-226:26 *)
Definition ChildTrait1Usize : ChildTrait1_t usize := {|
ChildTrait1_tChildTrait1_t_ParentTrait1Inst := ParentTrait1Usize;
|}.
(** Trait declaration: [traits::Iterator]
- Source: 'tests/src/traits.rs', lines 229:0-229:18 *)
+ Source: 'tests/src/traits.rs', lines 230:0-230:18 *)
Record Iterator_t (Self : Type) := mkIterator_t {
Iterator_tIterator_t_Item : Type;
}.
@@ -467,7 +467,7 @@ Arguments mkIterator_t { _ }.
Arguments Iterator_tIterator_t_Item { _ }.
(** Trait declaration: [traits::IntoIterator]
- Source: 'tests/src/traits.rs', lines 233:0-233:22 *)
+ Source: 'tests/src/traits.rs', lines 234:0-234:22 *)
Record IntoIterator_t (Self : Type) := mkIntoIterator_t {
IntoIterator_tIntoIterator_t_Item : Type;
IntoIterator_tIntoIterator_t_IntoIter : Type;
@@ -484,13 +484,13 @@ Arguments IntoIterator_tIntoIterator_t_IntoIter_clause_0 { _ }.
Arguments IntoIterator_t_into_iter { _ }.
(** Trait declaration: [traits::FromResidual]
- Source: 'tests/src/traits.rs', lines 250:0-250:21 *)
+ Source: 'tests/src/traits.rs', lines 251:0-251:21 *)
Record FromResidual_t (Self T : Type) := mkFromResidual_t{}.
Arguments mkFromResidual_t { _ _ }.
(** Trait declaration: [traits::Try]
- Source: 'tests/src/traits.rs', lines 246:0-246:48 *)
+ Source: 'tests/src/traits.rs', lines 247:0-247:48 *)
Record Try_t (Self : Type) := mkTry_t {
Try_tTry_t_Residual : Type;
Try_tTry_t_FromResidualSelftraitsTryResidualInst : FromResidual_t Self
@@ -502,7 +502,7 @@ Arguments Try_tTry_t_Residual { _ }.
Arguments Try_tTry_t_FromResidualSelftraitsTryResidualInst { _ }.
(** Trait declaration: [traits::WithTarget]
- Source: 'tests/src/traits.rs', lines 252:0-252:20 *)
+ Source: 'tests/src/traits.rs', lines 253:0-253:20 *)
Record WithTarget_t (Self : Type) := mkWithTarget_t {
WithTarget_tWithTarget_t_Target : Type;
}.
@@ -511,7 +511,7 @@ Arguments mkWithTarget_t { _ }.
Arguments WithTarget_tWithTarget_t_Target { _ }.
(** Trait declaration: [traits::ParentTrait2]
- Source: 'tests/src/traits.rs', lines 256:0-256:22 *)
+ Source: 'tests/src/traits.rs', lines 257:0-257:22 *)
Record ParentTrait2_t (Self : Type) := mkParentTrait2_t {
ParentTrait2_tParentTrait2_t_U : Type;
ParentTrait2_tParentTrait2_t_U_clause_0 : WithTarget_t
@@ -523,7 +523,7 @@ Arguments ParentTrait2_tParentTrait2_t_U { _ }.
Arguments ParentTrait2_tParentTrait2_t_U_clause_0 { _ }.
(** Trait declaration: [traits::ChildTrait2]
- Source: 'tests/src/traits.rs', lines 260:0-260:35 *)
+ Source: 'tests/src/traits.rs', lines 261:0-261:35 *)
Record ChildTrait2_t (Self : Type) := mkChildTrait2_t {
ChildTrait2_tChildTrait2_t_ParentTrait2Inst : ParentTrait2_t Self;
ChildTrait2_t_convert :
@@ -537,32 +537,32 @@ Arguments ChildTrait2_tChildTrait2_t_ParentTrait2Inst { _ }.
Arguments ChildTrait2_t_convert { _ }.
(** Trait implementation: [traits::{(traits::WithTarget for u32)#11}]
- Source: 'tests/src/traits.rs', lines 264:0-264:23 *)
+ Source: 'tests/src/traits.rs', lines 265:0-265:23 *)
Definition WithTargetU32 : WithTarget_t u32 := {|
WithTarget_tWithTarget_t_Target := u32;
|}.
(** Trait implementation: [traits::{(traits::ParentTrait2 for u32)#12}]
- Source: 'tests/src/traits.rs', lines 268:0-268:25 *)
+ Source: 'tests/src/traits.rs', lines 269:0-269:25 *)
Definition ParentTrait2U32 : ParentTrait2_t u32 := {|
ParentTrait2_tParentTrait2_t_U := u32;
ParentTrait2_tParentTrait2_t_U_clause_0 := WithTargetU32;
|}.
(** [traits::{(traits::ChildTrait2 for u32)#13}::convert]:
- Source: 'tests/src/traits.rs', lines 273:4-273:29 *)
+ Source: 'tests/src/traits.rs', lines 274:4-274:29 *)
Definition childTrait2U32_convert (x : u32) : result u32 :=
Ok x.
(** Trait implementation: [traits::{(traits::ChildTrait2 for u32)#13}]
- Source: 'tests/src/traits.rs', lines 272:0-272:24 *)
+ Source: 'tests/src/traits.rs', lines 273:0-273:24 *)
Definition ChildTrait2U32 : ChildTrait2_t u32 := {|
ChildTrait2_tChildTrait2_t_ParentTrait2Inst := ParentTrait2U32;
ChildTrait2_t_convert := childTrait2U32_convert;
|}.
(** Trait declaration: [traits::CFnOnce]
- Source: 'tests/src/traits.rs', lines 286:0-286:23 *)
+ Source: 'tests/src/traits.rs', lines 287:0-287:23 *)
Record CFnOnce_t (Self Args : Type) := mkCFnOnce_t {
CFnOnce_tCFnOnce_t_Output : Type;
CFnOnce_t_call_once : Self -> Args -> result CFnOnce_tCFnOnce_t_Output;
@@ -573,7 +573,7 @@ Arguments CFnOnce_tCFnOnce_t_Output { _ _ }.
Arguments CFnOnce_t_call_once { _ _ }.
(** Trait declaration: [traits::CFnMut]
- Source: 'tests/src/traits.rs', lines 292:0-292:37 *)
+ Source: 'tests/src/traits.rs', lines 293:0-293:37 *)
Record CFnMut_t (Self Args : Type) := mkCFnMut_t {
CFnMut_tCFnMut_t_CFnOnceInst : CFnOnce_t Self Args;
CFnMut_t_call_mut : Self -> Args -> result
@@ -585,7 +585,7 @@ Arguments CFnMut_tCFnMut_t_CFnOnceInst { _ _ }.
Arguments CFnMut_t_call_mut { _ _ }.
(** Trait declaration: [traits::CFn]
- Source: 'tests/src/traits.rs', lines 296:0-296:33 *)
+ Source: 'tests/src/traits.rs', lines 297:0-297:33 *)
Record CFn_t (Self Args : Type) := mkCFn_t {
CFn_tCFn_t_CFnMutInst : CFnMut_t Self Args;
CFn_t_call : Self -> Args -> result
@@ -597,7 +597,7 @@ Arguments CFn_tCFn_t_CFnMutInst { _ _ }.
Arguments CFn_t_call { _ _ }.
(** Trait declaration: [traits::GetTrait]
- Source: 'tests/src/traits.rs', lines 300:0-300:18 *)
+ Source: 'tests/src/traits.rs', lines 301:0-301:18 *)
Record GetTrait_t (Self : Type) := mkGetTrait_t {
GetTrait_tGetTrait_t_W : Type;
GetTrait_t_get_w : Self -> result GetTrait_tGetTrait_t_W;
@@ -608,7 +608,7 @@ Arguments GetTrait_tGetTrait_t_W { _ }.
Arguments GetTrait_t_get_w { _ }.
(** [traits::test_get_trait]:
- Source: 'tests/src/traits.rs', lines 305:0-305:49 *)
+ Source: 'tests/src/traits.rs', lines 306:0-306:49 *)
Definition test_get_trait
(T : Type) (getTraitInst : GetTrait_t T) (x : T) :
result getTraitInst.(GetTrait_tGetTrait_t_W)
@@ -617,27 +617,27 @@ Definition test_get_trait
.
(** Trait declaration: [traits::Trait]
- Source: 'tests/src/traits.rs', lines 310:0-310:15 *)
+ Source: 'tests/src/traits.rs', lines 311:0-311:15 *)
Record Trait_t (Self : Type) := mkTrait_t { Trait_tTrait_t_LEN : usize; }.
Arguments mkTrait_t { _ }.
Arguments Trait_tTrait_t_LEN { _ }.
(** [traits::{(traits::Trait for @Array<T, N>)#14}::LEN]
- Source: 'tests/src/traits.rs', lines 315:4-315:20 *)
+ Source: 'tests/src/traits.rs', lines 316:4-316:20 *)
Definition trait_array_len_body (T : Type) (N : usize) : result usize := Ok N.
Definition trait_array_len (T : Type) (N : usize) : usize :=
(trait_array_len_body T N)%global
.
(** Trait implementation: [traits::{(traits::Trait for @Array<T, N>)#14}]
- Source: 'tests/src/traits.rs', lines 314:0-314:40 *)
+ Source: 'tests/src/traits.rs', lines 315:0-315:40 *)
Definition TraitArray (T : Type) (N : usize) : Trait_t (array T N) := {|
Trait_tTrait_t_LEN := trait_array_len T N;
|}.
(** [traits::{(traits::Trait for traits::Wrapper<T>)#15}::LEN]
- Source: 'tests/src/traits.rs', lines 319:4-319:20 *)
+ Source: 'tests/src/traits.rs', lines 320:4-320:20 *)
Definition traittraits_wrapper_len_body (T : Type) (traitInst : Trait_t T)
: result usize :=
Ok 0%usize
@@ -648,20 +648,20 @@ Definition traittraits_wrapper_len (T : Type) (traitInst : Trait_t T)
.
(** Trait implementation: [traits::{(traits::Trait for traits::Wrapper<T>)#15}]
- Source: 'tests/src/traits.rs', lines 318:0-318:35 *)
+ Source: 'tests/src/traits.rs', lines 319:0-319:35 *)
Definition TraittraitsWrapper (T : Type) (traitInst : Trait_t T) : Trait_t
(Wrapper_t T) := {|
Trait_tTrait_t_LEN := traittraits_wrapper_len T traitInst;
|}.
(** [traits::use_wrapper_len]:
- Source: 'tests/src/traits.rs', lines 322:0-322:43 *)
+ Source: 'tests/src/traits.rs', lines 323:0-323:43 *)
Definition use_wrapper_len (T : Type) (traitInst : Trait_t T) : result usize :=
Ok (TraittraitsWrapper T traitInst).(Trait_tTrait_t_LEN)
.
(** [traits::Foo]
- Source: 'tests/src/traits.rs', lines 326:0-326:20 *)
+ Source: 'tests/src/traits.rs', lines 327:0-327:20 *)
Record Foo_t (T U : Type) := mkFoo_t { foo_x : T; foo_y : U; }.
Arguments mkFoo_t { _ _ }.
@@ -680,7 +680,7 @@ Arguments Core_result_Result_Ok { _ _ }.
Arguments Core_result_Result_Err { _ _ }.
(** [traits::{traits::Foo<T, U>#16}::FOO]
- Source: 'tests/src/traits.rs', lines 332:4-332:33 *)
+ Source: 'tests/src/traits.rs', lines 333:4-333:33 *)
Definition foo_foo_body (T U : Type) (traitInst : Trait_t T)
: result (core_result_Result_t T i32) :=
Ok (Core_result_Result_Err 0%i32)
@@ -691,14 +691,14 @@ Definition foo_foo (T U : Type) (traitInst : Trait_t T)
.
(** [traits::use_foo1]:
- Source: 'tests/src/traits.rs', lines 335:0-335:48 *)
+ Source: 'tests/src/traits.rs', lines 336:0-336:48 *)
Definition use_foo1
(T U : Type) (traitInst : Trait_t T) : result (core_result_Result_t T i32) :=
Ok (foo_foo T U traitInst)
.
(** [traits::use_foo2]:
- Source: 'tests/src/traits.rs', lines 339:0-339:48 *)
+ Source: 'tests/src/traits.rs', lines 340:0-340:48 *)
Definition use_foo2
(T U : Type) (traitInst : Trait_t U) : result (core_result_Result_t U i32) :=
Ok (foo_foo U T traitInst)