summaryrefslogtreecommitdiff
path: root/tests
diff options
context:
space:
mode:
Diffstat (limited to 'tests')
-rw-r--r--tests/.gitignore2
-rw-r--r--tests/Makefile2
-rw-r--r--tests/coq/arrays/Arrays.v126
-rw-r--r--tests/coq/demo/Demo.v32
-rw-r--r--tests/coq/hashmap/Hashmap_Funs.v60
-rw-r--r--tests/coq/hashmap/Hashmap_Types.v4
-rw-r--r--tests/coq/hashmap_on_disk/HashmapMain_Funs.v64
-rw-r--r--tests/coq/hashmap_on_disk/HashmapMain_FunsExternal_Template.v4
-rw-r--r--tests/coq/hashmap_on_disk/HashmapMain_Types.v4
-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/Loops.v98
-rw-r--r--tests/coq/misc/NoNestedBorrows.v126
-rw-r--r--tests/coq/misc/Paper.v18
-rw-r--r--tests/coq/misc/PoloniusList.v4
-rw-r--r--tests/coq/traits/Traits.v166
-rw-r--r--tests/fstar/arrays/Arrays.Clauses.Template.fst10
-rw-r--r--tests/fstar/arrays/Arrays.Funs.fst124
-rw-r--r--tests/fstar/arrays/Arrays.Types.fst2
-rw-r--r--tests/fstar/betree_back_stateful/BetreeMain.Clauses.Template.fst117
-rw-r--r--tests/fstar/betree_back_stateful/BetreeMain.Clauses.fst210
-rw-r--r--tests/fstar/betree_back_stateful/BetreeMain.Funs.fst676
-rw-r--r--tests/fstar/betree_back_stateful/BetreeMain.FunsExternal.fsti30
-rw-r--r--tests/fstar/betree_back_stateful/BetreeMain.Types.fst61
-rw-r--r--tests/fstar/betree_back_stateful/BetreeMain.TypesExternal.fsti10
-rw-r--r--tests/fstar/betree_back_stateful/Makefile49
-rw-r--r--tests/fstar/betree_back_stateful/Primitives.fst929
-rw-r--r--tests/fstar/demo/Demo.fst32
-rw-r--r--tests/fstar/hashmap/Hashmap.Clauses.Template.fst18
-rw-r--r--tests/fstar/hashmap/Hashmap.Funs.fst60
-rw-r--r--tests/fstar/hashmap/Hashmap.Types.fst4
-rw-r--r--tests/fstar/hashmap_on_disk/HashmapMain.Clauses.Template.fst18
-rw-r--r--tests/fstar/hashmap_on_disk/HashmapMain.Funs.fst64
-rw-r--r--tests/fstar/hashmap_on_disk/HashmapMain.FunsExternal.fsti4
-rw-r--r--tests/fstar/hashmap_on_disk/HashmapMain.Types.fst4
-rw-r--r--tests/fstar/misc/Bitwise.fst10
-rw-r--r--tests/fstar/misc/Constants.fst62
-rw-r--r--tests/fstar/misc/External.Funs.fst4
-rw-r--r--tests/fstar/misc/Loops.Clauses.Template.fst46
-rw-r--r--tests/fstar/misc/Loops.Funs.fst96
-rw-r--r--tests/fstar/misc/Loops.Types.fst2
-rw-r--r--tests/fstar/misc/NoNestedBorrows.fst126
-rw-r--r--tests/fstar/misc/Paper.fst18
-rw-r--r--tests/fstar/misc/PoloniusList.fst4
-rw-r--r--tests/fstar/traits/Traits.fst166
-rw-r--r--tests/lean/Arrays.lean126
-rw-r--r--tests/lean/Bitwise.lean10
-rw-r--r--tests/lean/Constants.lean62
-rw-r--r--tests/lean/Demo/Demo.lean32
-rw-r--r--tests/lean/External/Funs.lean4
-rw-r--r--tests/lean/Hashmap/Funs.lean60
-rw-r--r--tests/lean/Hashmap/Types.lean4
-rw-r--r--tests/lean/HashmapMain/Funs.lean64
-rw-r--r--tests/lean/HashmapMain/FunsExternal_Template.lean4
-rw-r--r--tests/lean/HashmapMain/Types.lean4
-rw-r--r--tests/lean/Loops.lean98
-rw-r--r--tests/lean/NoNestedBorrows.lean126
-rw-r--r--tests/lean/Paper.lean18
-rw-r--r--tests/lean/PoloniusList.lean4
-rw-r--r--tests/lean/Traits.lean166
-rw-r--r--tests/src/arrays.rs328
-rw-r--r--tests/src/betree/Cargo.lock299
-rw-r--r--tests/src/betree/Cargo.toml13
-rw-r--r--tests/src/betree/Makefile11
-rw-r--r--tests/src/betree/README.md1
-rw-r--r--tests/src/betree/rust-toolchain3
-rw-r--r--tests/src/betree/src/betree.rs1084
-rw-r--r--tests/src/betree/src/betree_utils.rs155
-rw-r--r--tests/src/betree/src/main.rs4
-rw-r--r--tests/src/bitwise.rs27
-rw-r--r--tests/src/constants.rs96
-rw-r--r--tests/src/demo.rs111
-rw-r--r--tests/src/external.rs11
-rw-r--r--tests/src/hashmap.rs352
-rw-r--r--tests/src/hashmap_main.rs16
-rw-r--r--tests/src/hashmap_utils.rs12
-rw-r--r--tests/src/loops.rs366
-rw-r--r--tests/src/nested_borrows.rs181
-rw-r--r--tests/src/no_nested_borrows.rs491
-rw-r--r--tests/src/paper.rs82
-rw-r--r--tests/src/polonius_list.rs27
-rw-r--r--tests/src/traits.rs341
-rw-r--r--tests/test_runner/.ocamlformat0
-rw-r--r--tests/test_runner/aeneas_test_runner.opam27
-rw-r--r--tests/test_runner/dune4
-rw-r--r--tests/test_runner/dune-project25
-rw-r--r--tests/test_runner/run_test.ml233
88 files changed, 5523 insertions, 3301 deletions
diff --git a/tests/.gitignore b/tests/.gitignore
new file mode 100644
index 00000000..7eab4f57
--- /dev/null
+++ b/tests/.gitignore
@@ -0,0 +1,2 @@
+*.llbc
+target/
diff --git a/tests/Makefile b/tests/Makefile
index 8d40e8da..ff4baaba 100644
--- a/tests/Makefile
+++ b/tests/Makefile
@@ -1,4 +1,6 @@
+.PHONY: all
all: test-fstar test-coq test-lean test-hol4
+.PHONY: test-%
test-%:
cd $* && $(MAKE) all
diff --git a/tests/coq/arrays/Arrays.v b/tests/coq/arrays/Arrays.v
index c9696147..35dea58c 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: 'src/arrays.rs', lines 3:0-3:11 *)
+ Source: 'tests/src/arrays.rs', lines 3:0-3:11 *)
Inductive AB_t := | AB_A : AB_t | AB_B : AB_t.
(** [arrays::incr]:
- Source: 'src/arrays.rs', lines 8:0-8:24 *)
+ Source: 'tests/src/arrays.rs', lines 8:0-8:24 *)
Definition incr (x : u32) : result u32 :=
u32_add x 1%u32.
(** [arrays::array_to_shared_slice_]:
- Source: 'src/arrays.rs', lines 16:0-16:53 *)
+ Source: 'tests/src/arrays.rs', lines 16:0-16: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: 'src/arrays.rs', lines 21:0-21:58 *)
+ Source: 'tests/src/arrays.rs', lines 21:0-21: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: 'src/arrays.rs', lines 25:0-25:40 *)
+ Source: 'tests/src/arrays.rs', lines 25:0-25: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: 'src/arrays.rs', lines 29:0-29:48 *)
+ Source: 'tests/src/arrays.rs', lines 29:0-29: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: 'src/arrays.rs', lines 33:0-33:44 *)
+ Source: 'tests/src/arrays.rs', lines 33:0-33:44 *)
Definition shared_slice_len (T : Type) (s : slice T) : result usize :=
Ok (slice_len T s)
.
(** [arrays::index_array_shared]:
- Source: 'src/arrays.rs', lines 37:0-37:57 *)
+ Source: 'tests/src/arrays.rs', lines 37:0-37: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: 'src/arrays.rs', lines 44:0-44:53 *)
+ Source: 'tests/src/arrays.rs', lines 44:0-44: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: 'src/arrays.rs', lines 48:0-48:45 *)
+ Source: 'tests/src/arrays.rs', lines 48:0-48: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: 'src/arrays.rs', lines 52:0-52:62 *)
+ Source: 'tests/src/arrays.rs', lines 52:0-52: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: 'src/arrays.rs', lines 56:0-56:46 *)
+ Source: 'tests/src/arrays.rs', lines 56:0-56:46 *)
Definition index_slice (T : Type) (s : slice T) (i : usize) : result T :=
slice_index_usize T s i
.
(** [arrays::index_mut_slice]:
- Source: 'src/arrays.rs', lines 60:0-60:58 *)
+ Source: 'tests/src/arrays.rs', lines 60:0-60: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: 'src/arrays.rs', lines 64:0-64:70 *)
+ Source: 'tests/src/arrays.rs', lines 64:0-64: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: 'src/arrays.rs', lines 68:0-68:75 *)
+ Source: 'tests/src/arrays.rs', lines 68:0-68: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: 'src/arrays.rs', lines 72:0-72:54 *)
+ Source: 'tests/src/arrays.rs', lines 72:0-72: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: 'src/arrays.rs', lines 76:0-76:59 *)
+ Source: 'tests/src/arrays.rs', lines 76:0-76: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: 'src/arrays.rs', lines 80:0-80:74 *)
+ Source: 'tests/src/arrays.rs', lines 80:0-80: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: 'src/arrays.rs', lines 84:0-84:79 *)
+ Source: 'tests/src/arrays.rs', lines 84:0-84: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: 'src/arrays.rs', lines 88:0-88:38 *)
+ Source: 'tests/src/arrays.rs', lines 88:0-88:38 *)
Definition index_slice_0 (T : Type) (s : slice T) : result T :=
slice_index_usize T s 0%usize
.
(** [arrays::index_array_0]:
- Source: 'src/arrays.rs', lines 92:0-92:42 *)
+ Source: 'tests/src/arrays.rs', lines 92:0-92: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: 'src/arrays.rs', lines 103:0-103:71 *)
+ Source: 'tests/src/arrays.rs', lines 103:0-103: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: 'src/arrays.rs', lines 114:0-114:70 *)
+ Source: 'tests/src/arrays.rs', lines 114:0-114: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: 'src/arrays.rs', lines 118:0-118:43 *)
+ Source: 'tests/src/arrays.rs', lines 118:0-118:43 *)
Definition array_local_deep_copy (x : array u32 32%usize) : result unit :=
Ok tt
.
(** [arrays::take_array]:
- Source: 'src/arrays.rs', lines 122:0-122:30 *)
+ Source: 'tests/src/arrays.rs', lines 122:0-122:30 *)
Definition take_array (a : array u32 2%usize) : result unit :=
Ok tt.
(** [arrays::take_array_borrow]:
- Source: 'src/arrays.rs', lines 123:0-123:38 *)
+ Source: 'tests/src/arrays.rs', lines 123:0-123:38 *)
Definition take_array_borrow (a : array u32 2%usize) : result unit :=
Ok tt.
(** [arrays::take_slice]:
- Source: 'src/arrays.rs', lines 124:0-124:28 *)
+ Source: 'tests/src/arrays.rs', lines 124:0-124:28 *)
Definition take_slice (s : slice u32) : result unit :=
Ok tt.
(** [arrays::take_mut_slice]:
- Source: 'src/arrays.rs', lines 125:0-125:36 *)
+ Source: 'tests/src/arrays.rs', lines 125:0-125:36 *)
Definition take_mut_slice (s : slice u32) : result (slice u32) :=
Ok s.
(** [arrays::const_array]:
- Source: 'src/arrays.rs', lines 127:0-127:32 *)
+ Source: 'tests/src/arrays.rs', lines 127:0-127:32 *)
Definition const_array : result (array u32 2%usize) :=
Ok (mk_array u32 2%usize [ 0%u32; 0%u32 ])
.
(** [arrays::const_slice]:
- Source: 'src/arrays.rs', lines 131:0-131:20 *)
+ Source: 'tests/src/arrays.rs', lines 131:0-131: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: 'src/arrays.rs', lines 141:0-141:17 *)
+ Source: 'tests/src/arrays.rs', lines 141:0-141: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: 'src/arrays.rs', lines 155:0-155:38 *)
+ Source: 'tests/src/arrays.rs', lines 155:0-155: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: 'src/arrays.rs', lines 158:0-158:46 *)
+ Source: 'tests/src/arrays.rs', lines 158:0-158: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: 'src/arrays.rs', lines 162:0-162:42 *)
+ Source: 'tests/src/arrays.rs', lines 162:0-162: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: 'src/arrays.rs', lines 166:0-166:50 *)
+ Source: 'tests/src/arrays.rs', lines 166:0-166: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: 'src/arrays.rs', lines 170:0-170:25 *)
+ Source: 'tests/src/arrays.rs', lines 170:0-170: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 ]);
@@ -295,7 +295,7 @@ Definition index_all : result u32 :=
.
(** [arrays::update_array]:
- Source: 'src/arrays.rs', lines 184:0-184:36 *)
+ Source: 'tests/src/arrays.rs', lines 184:0-184: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: 'src/arrays.rs', lines 187:0-187:48 *)
+ Source: 'tests/src/arrays.rs', lines 187:0-187: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: 'src/arrays.rs', lines 190:0-190:38 *)
+ Source: 'tests/src/arrays.rs', lines 190:0-190: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: 'src/arrays.rs', lines 194:0-194:19 *)
+ Source: 'tests/src/arrays.rs', lines 194:0-194: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: 'src/arrays.rs', lines 205:0-205:18 *)
+ Source: 'tests/src/arrays.rs', lines 205:0-205: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: 'src/arrays.rs', lines 214:0-214:46 *)
+ Source: 'tests/src/arrays.rs', lines 214:0-214: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: 'src/arrays.rs', lines 219:0-219:54 *)
+ Source: 'tests/src/arrays.rs', lines 219:0-219: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: 'src/arrays.rs', lines 227:0-227:31 *)
+ Source: 'tests/src/arrays.rs', lines 227:0-227:31 *)
Definition take_array_t (a : array AB_t 2%usize) : result unit :=
Ok tt.
(** [arrays::non_copyable_array]:
- Source: 'src/arrays.rs', lines 229:0-229:27 *)
+ Source: 'tests/src/arrays.rs', lines 229:0-229: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: 'src/arrays.rs', lines 242:0-250:1 *)
+ Source: 'tests/src/arrays.rs', lines 242:0-250: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: 'src/arrays.rs', lines 242:0-242:28 *)
+ Source: 'tests/src/arrays.rs', lines 242:0-242:28 *)
Definition sum (n : nat) (s : slice u32) : result u32 :=
sum_loop n s 0%u32 0%usize
.
(** [arrays::sum2]: loop 0:
- Source: 'src/arrays.rs', lines 252:0-261:1 *)
+ Source: 'tests/src/arrays.rs', lines 252:0-261: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: 'src/arrays.rs', lines 252:0-252:41 *)
+ Source: 'tests/src/arrays.rs', lines 252:0-252: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: 'src/arrays.rs', lines 263:0-263:11 *)
+ Source: 'tests/src/arrays.rs', lines 263:0-263: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: 'src/arrays.rs', lines 268:0-268:11 *)
+ Source: 'tests/src/arrays.rs', lines 268:0-268: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: 'src/arrays.rs', lines 273:0-273:17 *)
+ Source: 'tests/src/arrays.rs', lines 273:0-273:17 *)
Definition f2 (i : u32) : result unit :=
Ok tt.
(** [arrays::f4]:
- Source: 'src/arrays.rs', lines 282:0-282:54 *)
+ Source: 'tests/src/arrays.rs', lines 282:0-282: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: 'src/arrays.rs', lines 275:0-275:18 *)
+ Source: 'tests/src/arrays.rs', lines 275:0-275: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: 'src/arrays.rs', lines 286:0-286:19 *)
+ Source: 'tests/src/arrays.rs', lines 286:0-286:19 *)
Definition sz_body : result usize := Ok 32%usize.
Definition sz : usize := sz_body%global.
(** [arrays::f5]:
- Source: 'src/arrays.rs', lines 289:0-289:31 *)
+ Source: 'tests/src/arrays.rs', lines 289:0-289:31 *)
Definition f5 (x : array u32 32%usize) : result u32 :=
array_index_usize u32 32%usize x 0%usize
.
(** [arrays::ite]:
- Source: 'src/arrays.rs', lines 294:0-294:12 *)
+ Source: 'tests/src/arrays.rs', lines 294:0-294: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: 'src/arrays.rs', lines 303:0-310:1 *)
+ Source: 'tests/src/arrays.rs', lines 303:0-310: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: 'src/arrays.rs', lines 303:0-303:31 *)
+ Source: 'tests/src/arrays.rs', lines 303:0-303: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: 'src/arrays.rs', lines 312:0-318:1 *)
+ Source: 'tests/src/arrays.rs', lines 312:0-318: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: 'src/arrays.rs', lines 312:0-312:35 *)
+ Source: 'tests/src/arrays.rs', lines 312:0-312: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: 'src/arrays.rs', lines 320:0-328:1 *)
+ Source: 'tests/src/arrays.rs', lines 320:0-328: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: 'src/arrays.rs', lines 320:0-320:42 *)
+ Source: 'tests/src/arrays.rs', lines 320:0-320: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/demo/Demo.v b/tests/coq/demo/Demo.v
index 00b9b889..8d8f840d 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: 'src/demo.rs', lines 5:0-5:70 *)
+ Source: 'tests/src/demo.rs', lines 5:0-5: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: 'src/demo.rs', lines 13:0-13:31 *)
+ Source: 'tests/src/demo.rs', lines 13:0-13:31 *)
Definition mul2_add1 (x : u32) : result u32 :=
i <- u32_add x x; u32_add i 1%u32
.
(** [demo::use_mul2_add1]:
- Source: 'src/demo.rs', lines 17:0-17:43 *)
+ Source: 'tests/src/demo.rs', lines 17:0-17:43 *)
Definition use_mul2_add1 (x : u32) (y : u32) : result u32 :=
i <- mul2_add1 x; u32_add i y
.
(** [demo::incr]:
- Source: 'src/demo.rs', lines 21:0-21:31 *)
+ Source: 'tests/src/demo.rs', lines 21:0-21:31 *)
Definition incr (x : u32) : result u32 :=
u32_add x 1%u32.
(** [demo::use_incr]:
- Source: 'src/demo.rs', lines 25:0-25:17 *)
+ Source: 'tests/src/demo.rs', lines 25:0-25:17 *)
Definition use_incr : result unit :=
x <- incr 0%u32; x1 <- incr x; _ <- incr x1; Ok tt
.
(** [demo::CList]
- Source: 'src/demo.rs', lines 34:0-34:17 *)
+ Source: 'tests/src/demo.rs', lines 34:0-34: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: 'src/demo.rs', lines 39:0-39:56 *)
+ Source: 'tests/src/demo.rs', lines 39:0-39: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: 'src/demo.rs', lines 54:0-54:68 *)
+ Source: 'tests/src/demo.rs', lines 54:0-54: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: 'src/demo.rs', lines 69:0-78:1 *)
+ Source: 'tests/src/demo.rs', lines 69:0-78: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: 'src/demo.rs', lines 69:0-69:77 *)
+ Source: 'tests/src/demo.rs', lines 69:0-69: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: 'src/demo.rs', lines 80:0-80:28 *)
+ Source: 'tests/src/demo.rs', lines 80:0-80: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: 'src/demo.rs', lines 88:0-88:64 *)
+ Source: 'tests/src/demo.rs', lines 88:0-88: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: 'src/demo.rs', lines 97:0-97:17 *)
+ Source: 'tests/src/demo.rs', lines 97:0-97: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: 'src/demo.rs', lines 102:4-102:31 *)
+ Source: 'tests/src/demo.rs', lines 102:4-102: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: 'src/demo.rs', lines 101:0-101:22 *)
+ Source: 'tests/src/demo.rs', lines 101:0-101:22 *)
Definition CounterUsize : Counter_t usize := {|
Counter_t_incr := counterUsize_incr;
|}.
(** [demo::use_counter]:
- Source: 'src/demo.rs', lines 109:0-109:59 *)
+ Source: 'tests/src/demo.rs', lines 109:0-109: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 ebb7897d..1f2b2b22 100644
--- a/tests/coq/hashmap/Hashmap_Funs.v
+++ b/tests/coq/hashmap/Hashmap_Funs.v
@@ -11,12 +11,12 @@ Include Hashmap_Types.
Module Hashmap_Funs.
(** [hashmap::hash_key]:
- Source: 'src/hashmap.rs', lines 27:0-27:32 *)
+ Source: 'tests/src/hashmap.rs', lines 27:0-27:32 *)
Definition hash_key (k : usize) : result usize :=
Ok k.
(** [hashmap::{hashmap::HashMap<T>}::allocate_slots]: loop 0:
- Source: 'src/hashmap.rs', lines 50:4-56:5 *)
+ Source: 'tests/src/hashmap.rs', lines 50:4-56: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 +34,7 @@ Fixpoint hashMap_allocate_slots_loop
.
(** [hashmap::{hashmap::HashMap<T>}::allocate_slots]:
- Source: 'src/hashmap.rs', lines 50:4-50:76 *)
+ Source: 'tests/src/hashmap.rs', lines 50:4-50: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 +43,7 @@ Definition hashMap_allocate_slots
.
(** [hashmap::{hashmap::HashMap<T>}::new_with_capacity]:
- Source: 'src/hashmap.rs', lines 59:4-63:13 *)
+ Source: 'tests/src/hashmap.rs', lines 59:4-63:13 *)
Definition hashMap_new_with_capacity
(T : Type) (n : nat) (capacity : usize) (max_load_dividend : usize)
(max_load_divisor : usize) :
@@ -62,13 +62,13 @@ Definition hashMap_new_with_capacity
.
(** [hashmap::{hashmap::HashMap<T>}::new]:
- Source: 'src/hashmap.rs', lines 75:4-75:24 *)
+ Source: 'tests/src/hashmap.rs', lines 75:4-75: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: 'src/hashmap.rs', lines 80:4-88:5 *)
+ Source: 'tests/src/hashmap.rs', lines 80:4-88: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 +91,7 @@ Fixpoint hashMap_clear_loop
.
(** [hashmap::{hashmap::HashMap<T>}::clear]:
- Source: 'src/hashmap.rs', lines 80:4-80:27 *)
+ Source: 'tests/src/hashmap.rs', lines 80:4-80: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 +105,13 @@ Definition hashMap_clear
.
(** [hashmap::{hashmap::HashMap<T>}::len]:
- Source: 'src/hashmap.rs', lines 90:4-90:30 *)
+ Source: 'tests/src/hashmap.rs', lines 90:4-90: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: 'src/hashmap.rs', lines 97:4-114:5 *)
+ Source: 'tests/src/hashmap.rs', lines 97:4-114: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 +133,7 @@ Fixpoint hashMap_insert_in_list_loop
.
(** [hashmap::{hashmap::HashMap<T>}::insert_in_list]:
- Source: 'src/hashmap.rs', lines 97:4-97:71 *)
+ Source: 'tests/src/hashmap.rs', lines 97:4-97: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 +142,7 @@ Definition hashMap_insert_in_list
.
(** [hashmap::{hashmap::HashMap<T>}::insert_no_resize]:
- Source: 'src/hashmap.rs', lines 117:4-117:54 *)
+ Source: 'tests/src/hashmap.rs', lines 117:4-117:54 *)
Definition hashMap_insert_no_resize
(T : Type) (n : nat) (self : HashMap_t T) (key : usize) (value : T) :
result (HashMap_t T)
@@ -180,7 +180,7 @@ Definition hashMap_insert_no_resize
.
(** [hashmap::{hashmap::HashMap<T>}::move_elements_from_list]: loop 0:
- Source: 'src/hashmap.rs', lines 183:4-196:5 *)
+ Source: 'tests/src/hashmap.rs', lines 183:4-196: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 +198,7 @@ Fixpoint hashMap_move_elements_from_list_loop
.
(** [hashmap::{hashmap::HashMap<T>}::move_elements_from_list]:
- Source: 'src/hashmap.rs', lines 183:4-183:72 *)
+ Source: 'tests/src/hashmap.rs', lines 183:4-183: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 +207,7 @@ Definition hashMap_move_elements_from_list
.
(** [hashmap::{hashmap::HashMap<T>}::move_elements]: loop 0:
- Source: 'src/hashmap.rs', lines 171:4-180:5 *)
+ Source: 'tests/src/hashmap.rs', lines 171:4-180: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 +233,7 @@ Fixpoint hashMap_move_elements_loop
.
(** [hashmap::{hashmap::HashMap<T>}::move_elements]:
- Source: 'src/hashmap.rs', lines 171:4-171:95 *)
+ Source: 'tests/src/hashmap.rs', lines 171:4-171:95 *)
Definition hashMap_move_elements
(T : Type) (n : nat) (ntable : HashMap_t T)
(slots : alloc_vec_Vec (List_t T)) (i : usize) :
@@ -243,7 +243,7 @@ Definition hashMap_move_elements
.
(** [hashmap::{hashmap::HashMap<T>}::try_resize]:
- Source: 'src/hashmap.rs', lines 140:4-140:28 *)
+ Source: 'tests/src/hashmap.rs', lines 140:4-140: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 +275,7 @@ Definition hashMap_try_resize
.
(** [hashmap::{hashmap::HashMap<T>}::insert]:
- Source: 'src/hashmap.rs', lines 129:4-129:48 *)
+ Source: 'tests/src/hashmap.rs', lines 129:4-129:48 *)
Definition hashMap_insert
(T : Type) (n : nat) (self : HashMap_t T) (key : usize) (value : T) :
result (HashMap_t T)
@@ -288,7 +288,7 @@ Definition hashMap_insert
.
(** [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 206:4-219:5 *)
+ Source: 'tests/src/hashmap.rs', lines 206:4-219: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 +305,14 @@ Fixpoint hashMap_contains_key_in_list_loop
.
(** [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]:
- Source: 'src/hashmap.rs', lines 206:4-206:68 *)
+ Source: 'tests/src/hashmap.rs', lines 206:4-206: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: 'src/hashmap.rs', lines 199:4-199:49 *)
+ Source: 'tests/src/hashmap.rs', lines 199:4-199:49 *)
Definition hashMap_contains_key
(T : Type) (n : nat) (self : HashMap_t T) (key : usize) : result bool :=
hash <- hash_key key;
@@ -326,7 +326,7 @@ Definition hashMap_contains_key
.
(** [hashmap::{hashmap::HashMap<T>}::get_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 224:4-237:5 *)
+ Source: 'tests/src/hashmap.rs', lines 224:4-237:5 *)
Fixpoint hashMap_get_in_list_loop
(T : Type) (n : nat) (key : usize) (ls : List_t T) : result T :=
match n with
@@ -341,14 +341,14 @@ Fixpoint hashMap_get_in_list_loop
.
(** [hashmap::{hashmap::HashMap<T>}::get_in_list]:
- Source: 'src/hashmap.rs', lines 224:4-224:70 *)
+ Source: 'tests/src/hashmap.rs', lines 224:4-224: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: 'src/hashmap.rs', lines 239:4-239:55 *)
+ Source: 'tests/src/hashmap.rs', lines 239:4-239:55 *)
Definition hashMap_get
(T : Type) (n : nat) (self : HashMap_t T) (key : usize) : result T :=
hash <- hash_key key;
@@ -362,7 +362,7 @@ Definition hashMap_get
.
(** [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 245:4-254:5 *)
+ Source: 'tests/src/hashmap.rs', lines 245:4-254: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 +388,7 @@ Fixpoint hashMap_get_mut_in_list_loop
.
(** [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]:
- Source: 'src/hashmap.rs', lines 245:4-245:86 *)
+ Source: 'tests/src/hashmap.rs', lines 245:4-245: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 +397,7 @@ Definition hashMap_get_mut_in_list
.
(** [hashmap::{hashmap::HashMap<T>}::get_mut]:
- Source: 'src/hashmap.rs', lines 257:4-257:67 *)
+ Source: 'tests/src/hashmap.rs', lines 257:4-257:67 *)
Definition hashMap_get_mut
(T : Type) (n : nat) (self : HashMap_t T) (key : usize) :
result (T * (T -> result (HashMap_t T)))
@@ -427,7 +427,7 @@ Definition hashMap_get_mut
.
(** [hashmap::{hashmap::HashMap<T>}::remove_from_list]: loop 0:
- Source: 'src/hashmap.rs', lines 265:4-291:5 *)
+ Source: 'tests/src/hashmap.rs', lines 265:4-291: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 +455,7 @@ Fixpoint hashMap_remove_from_list_loop
.
(** [hashmap::{hashmap::HashMap<T>}::remove_from_list]:
- Source: 'src/hashmap.rs', lines 265:4-265:69 *)
+ Source: 'tests/src/hashmap.rs', lines 265:4-265:69 *)
Definition hashMap_remove_from_list
(T : Type) (n : nat) (key : usize) (ls : List_t T) :
result ((option T) * (List_t T))
@@ -464,7 +464,7 @@ Definition hashMap_remove_from_list
.
(** [hashmap::{hashmap::HashMap<T>}::remove]:
- Source: 'src/hashmap.rs', lines 294:4-294:52 *)
+ Source: 'tests/src/hashmap.rs', lines 294:4-294:52 *)
Definition hashMap_remove
(T : Type) (n : nat) (self : HashMap_t T) (key : usize) :
result ((option T) * (HashMap_t T))
@@ -503,7 +503,7 @@ Definition hashMap_remove
.
(** [hashmap::test1]:
- Source: 'src/hashmap.rs', lines 315:0-315:10 *)
+ Source: 'tests/src/hashmap.rs', lines 315:0-315: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_Types.v b/tests/coq/hashmap/Hashmap_Types.v
index 80a43593..2a9f7ddb 100644
--- a/tests/coq/hashmap/Hashmap_Types.v
+++ b/tests/coq/hashmap/Hashmap_Types.v
@@ -9,7 +9,7 @@ Local Open Scope Primitives_scope.
Module Hashmap_Types.
(** [hashmap::List]
- Source: 'src/hashmap.rs', lines 19:0-19:16 *)
+ Source: 'tests/src/hashmap.rs', lines 19:0-19:16 *)
Inductive List_t (T : Type) :=
| List_Cons : usize -> T -> List_t T -> List_t T
| List_Nil : List_t T
@@ -19,7 +19,7 @@ Arguments List_Cons { _ }.
Arguments List_Nil { _ }.
(** [hashmap::HashMap]
- Source: 'src/hashmap.rs', lines 35:0-35:21 *)
+ Source: 'tests/src/hashmap.rs', lines 35:0-35:21 *)
Record HashMap_t (T : Type) :=
mkHashMap_t {
hashMap_num_entries : usize;
diff --git a/tests/coq/hashmap_on_disk/HashmapMain_Funs.v b/tests/coq/hashmap_on_disk/HashmapMain_Funs.v
index 79da6e80..facd84ea 100644
--- a/tests/coq/hashmap_on_disk/HashmapMain_Funs.v
+++ b/tests/coq/hashmap_on_disk/HashmapMain_Funs.v
@@ -13,12 +13,12 @@ Include HashmapMain_FunsExternal.
Module HashmapMain_Funs.
(** [hashmap_main::hashmap::hash_key]:
- Source: 'src/hashmap.rs', lines 27:0-27:32 *)
+ 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: 'src/hashmap.rs', lines 50:4-56:5 *)
+ 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)
:
@@ -37,7 +37,7 @@ Fixpoint hashmap_HashMap_allocate_slots_loop
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::allocate_slots]:
- Source: 'src/hashmap.rs', lines 50:4-50:76 *)
+ 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)
:
@@ -47,7 +47,7 @@ Definition hashmap_HashMap_allocate_slots
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::new_with_capacity]:
- Source: 'src/hashmap.rs', lines 59:4-63:13 *)
+ 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) :
@@ -68,14 +68,14 @@ Definition hashmap_HashMap_new_with_capacity
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::new]:
- Source: 'src/hashmap.rs', lines 75:4-75:24 *)
+ 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: 'src/hashmap.rs', lines 80:4-88:5 *)
+ 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))
@@ -99,7 +99,7 @@ Fixpoint hashmap_HashMap_clear_loop
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::clear]:
- Source: 'src/hashmap.rs', lines 80:4-80:27 *)
+ 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)
@@ -115,14 +115,14 @@ Definition hashmap_HashMap_clear
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::len]:
- Source: 'src/hashmap.rs', lines 90:4-90:30 *)
+ 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: 'src/hashmap.rs', lines 97:4-114:5 *)
+ 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))
@@ -145,7 +145,7 @@ Fixpoint hashmap_HashMap_insert_in_list_loop
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_in_list]:
- Source: 'src/hashmap.rs', lines 97:4-97:71 *)
+ 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))
@@ -154,7 +154,7 @@ Definition hashmap_HashMap_insert_in_list
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_no_resize]:
- Source: 'src/hashmap.rs', lines 117:4-117:54 *)
+ 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)
@@ -194,7 +194,7 @@ Definition hashmap_HashMap_insert_no_resize
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements_from_list]: loop 0:
- Source: 'src/hashmap.rs', lines 183:4-196:5 *)
+ 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)
@@ -212,7 +212,7 @@ Fixpoint hashmap_HashMap_move_elements_from_list_loop
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements_from_list]:
- Source: 'src/hashmap.rs', lines 183:4-183:72 *)
+ 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)
@@ -221,7 +221,7 @@ Definition hashmap_HashMap_move_elements_from_list
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements]: loop 0:
- Source: 'src/hashmap.rs', lines 171:4-180:5 *)
+ 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) :
@@ -248,7 +248,7 @@ Fixpoint hashmap_HashMap_move_elements_loop
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements]:
- Source: 'src/hashmap.rs', lines 171:4-171:95 *)
+ 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) :
@@ -258,7 +258,7 @@ Definition hashmap_HashMap_move_elements
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::try_resize]:
- Source: 'src/hashmap.rs', lines 140:4-140:28 *)
+ 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)
@@ -295,7 +295,7 @@ Definition hashmap_HashMap_try_resize
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert]:
- Source: 'src/hashmap.rs', lines 129:4-129:48 *)
+ 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)
@@ -308,7 +308,7 @@ Definition hashmap_HashMap_insert
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 206:4-219:5 *)
+ 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
@@ -325,14 +325,14 @@ Fixpoint hashmap_HashMap_contains_key_in_list_loop
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key_in_list]:
- Source: 'src/hashmap.rs', lines 206:4-206:68 *)
+ 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: 'src/hashmap.rs', lines 199:4-199:49 *)
+ 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
@@ -348,7 +348,7 @@ Definition hashmap_HashMap_contains_key
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 224:4-237:5 *)
+ 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
@@ -365,14 +365,14 @@ Fixpoint hashmap_HashMap_get_in_list_loop
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_in_list]:
- Source: 'src/hashmap.rs', lines 224:4-224:70 *)
+ 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: 'src/hashmap.rs', lines 239:4-239:55 *)
+ 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;
@@ -386,7 +386,7 @@ Definition hashmap_HashMap_get
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 245:4-254:5 *)
+ 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)))
@@ -413,7 +413,7 @@ Fixpoint hashmap_HashMap_get_mut_in_list_loop
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut_in_list]:
- Source: 'src/hashmap.rs', lines 245:4-245:86 *)
+ 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)))
@@ -422,7 +422,7 @@ Definition hashmap_HashMap_get_mut_in_list
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut]:
- Source: 'src/hashmap.rs', lines 257:4-257:67 *)
+ 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)))
@@ -453,7 +453,7 @@ Definition hashmap_HashMap_get_mut
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove_from_list]: loop 0:
- Source: 'src/hashmap.rs', lines 265:4-291:5 *)
+ 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))
@@ -482,7 +482,7 @@ Fixpoint hashmap_HashMap_remove_from_list_loop
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove_from_list]:
- Source: 'src/hashmap.rs', lines 265:4-265:69 *)
+ 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))
@@ -491,7 +491,7 @@ Definition hashmap_HashMap_remove_from_list
.
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove]:
- Source: 'src/hashmap.rs', lines 294:4-294:52 *)
+ 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))
@@ -532,7 +532,7 @@ Definition hashmap_HashMap_remove
.
(** [hashmap_main::hashmap::test1]:
- Source: 'src/hashmap.rs', lines 315:0-315:10 *)
+ 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;
@@ -572,7 +572,7 @@ Definition hashmap_test1 (n : nat) : result unit :=
.
(** [hashmap_main::insert_on_disk]:
- Source: 'src/hashmap_main.rs', lines 7:0-7:43 *)
+ 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;
@@ -582,7 +582,7 @@ Definition insert_on_disk
.
(** [hashmap_main::main]:
- Source: 'src/hashmap_main.rs', lines 16:0-16:13 *)
+ Source: 'tests/src/hashmap_main.rs', lines 16:0-16:13 *)
Definition main : result unit :=
Ok tt.
diff --git a/tests/coq/hashmap_on_disk/HashmapMain_FunsExternal_Template.v b/tests/coq/hashmap_on_disk/HashmapMain_FunsExternal_Template.v
index fb2e052a..f9e3f747 100644
--- a/tests/coq/hashmap_on_disk/HashmapMain_FunsExternal_Template.v
+++ b/tests/coq/hashmap_on_disk/HashmapMain_FunsExternal_Template.v
@@ -12,13 +12,13 @@ Include HashmapMain_Types.
Module HashmapMain_FunsExternal_Template.
(** [hashmap_main::hashmap_utils::deserialize]:
- Source: 'src/hashmap_utils.rs', lines 10:0-10:43 *)
+ 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: 'src/hashmap_utils.rs', lines 5:0-5:42 *)
+ Source: 'tests/src/hashmap_utils.rs', lines 5:0-5:42 *)
Axiom hashmap_utils_serialize
: hashmap_HashMap_t u64 -> state -> result (state * unit)
.
diff --git a/tests/coq/hashmap_on_disk/HashmapMain_Types.v b/tests/coq/hashmap_on_disk/HashmapMain_Types.v
index 8d3d72aa..26029c9d 100644
--- a/tests/coq/hashmap_on_disk/HashmapMain_Types.v
+++ b/tests/coq/hashmap_on_disk/HashmapMain_Types.v
@@ -11,7 +11,7 @@ Include HashmapMain_TypesExternal.
Module HashmapMain_Types.
(** [hashmap_main::hashmap::List]
- Source: 'src/hashmap.rs', lines 19:0-19:16 *)
+ 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
@@ -21,7 +21,7 @@ Arguments Hashmap_List_Cons { _ }.
Arguments Hashmap_List_Nil { _ }.
(** [hashmap_main::hashmap::HashMap]
- Source: 'src/hashmap.rs', lines 35:0-35:21 *)
+ Source: 'tests/src/hashmap.rs', lines 35:0-35:21 *)
Record hashmap_HashMap_t (T : Type) :=
mkhashmap_HashMap_t {
hashmap_HashMap_num_entries : usize;
diff --git a/tests/coq/misc/Bitwise.v b/tests/coq/misc/Bitwise.v
index b2339c58..539141e5 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: 'src/bitwise.rs', lines 3:0-3:31 *)
+ Source: 'tests/src/bitwise.rs', lines 3:0-3:31 *)
Definition shift_u32 (a : u32) : result u32 :=
t <- u32_shr a 16%usize; u32_shl t 16%usize
.
(** [bitwise::shift_i32]:
- Source: 'src/bitwise.rs', lines 10:0-10:31 *)
+ Source: 'tests/src/bitwise.rs', lines 10:0-10:31 *)
Definition shift_i32 (a : i32) : result i32 :=
t <- i32_shr a 16%isize; i32_shl t 16%isize
.
(** [bitwise::xor_u32]:
- Source: 'src/bitwise.rs', lines 17:0-17:37 *)
+ Source: 'tests/src/bitwise.rs', lines 17:0-17:37 *)
Definition xor_u32 (a : u32) (b : u32) : result u32 :=
Ok (u32_xor a b).
(** [bitwise::or_u32]:
- Source: 'src/bitwise.rs', lines 21:0-21:36 *)
+ Source: 'tests/src/bitwise.rs', lines 21:0-21:36 *)
Definition or_u32 (a : u32) (b : u32) : result u32 :=
Ok (u32_or a b).
(** [bitwise::and_u32]:
- Source: 'src/bitwise.rs', lines 25:0-25:37 *)
+ Source: 'tests/src/bitwise.rs', lines 25:0-25: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 71185975..a5aba663 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: 'src/constants.rs', lines 5:0-5:17 *)
+ Source: 'tests/src/constants.rs', lines 5:0-5:17 *)
Definition x0_body : result u32 := Ok 0%u32.
Definition x0 : u32 := x0_body%global.
(** [constants::X1]
- Source: 'src/constants.rs', lines 7:0-7:17 *)
+ Source: 'tests/src/constants.rs', lines 7:0-7:17 *)
Definition x1_body : result u32 := Ok core_u32_max.
Definition x1 : u32 := x1_body%global.
(** [constants::X2]
- Source: 'src/constants.rs', lines 10:0-10:17 *)
+ Source: 'tests/src/constants.rs', lines 10:0-10:17 *)
Definition x2_body : result u32 := Ok 3%u32.
Definition x2 : u32 := x2_body%global.
(** [constants::incr]:
- Source: 'src/constants.rs', lines 17:0-17:32 *)
+ Source: 'tests/src/constants.rs', lines 17:0-17:32 *)
Definition incr (n : u32) : result u32 :=
u32_add n 1%u32.
(** [constants::X3]
- Source: 'src/constants.rs', lines 15:0-15:17 *)
+ Source: 'tests/src/constants.rs', lines 15:0-15:17 *)
Definition x3_body : result u32 := incr 32%u32.
Definition x3 : u32 := x3_body%global.
(** [constants::mk_pair0]:
- Source: 'src/constants.rs', lines 23:0-23:51 *)
+ Source: 'tests/src/constants.rs', lines 23:0-23:51 *)
Definition mk_pair0 (x : u32) (y1 : u32) : result (u32 * u32) :=
Ok (x, y1).
(** [constants::Pair]
- Source: 'src/constants.rs', lines 36:0-36:23 *)
+ Source: 'tests/src/constants.rs', lines 36:0-36: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: 'src/constants.rs', lines 27:0-27:55 *)
+ Source: 'tests/src/constants.rs', lines 27:0-27:55 *)
Definition mk_pair1 (x : u32) (y1 : u32) : result (Pair_t u32 u32) :=
Ok {| pair_x := x; pair_y := y1 |}
.
(** [constants::P0]
- Source: 'src/constants.rs', lines 31:0-31:24 *)
+ Source: 'tests/src/constants.rs', lines 31:0-31:24 *)
Definition p0_body : result (u32 * u32) := mk_pair0 0%u32 1%u32.
Definition p0 : (u32 * u32) := p0_body%global.
(** [constants::P1]
- Source: 'src/constants.rs', lines 32:0-32:28 *)
+ Source: 'tests/src/constants.rs', lines 32:0-32: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: 'src/constants.rs', lines 33:0-33:24 *)
+ Source: 'tests/src/constants.rs', lines 33:0-33:24 *)
Definition p2_body : result (u32 * u32) := Ok (0%u32, 1%u32).
Definition p2 : (u32 * u32) := p2_body%global.
(** [constants::P3]
- Source: 'src/constants.rs', lines 34:0-34:28 *)
+ Source: 'tests/src/constants.rs', lines 34:0-34: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: 'src/constants.rs', lines 49:0-49:18 *)
+ Source: 'tests/src/constants.rs', lines 49:0-49:18 *)
Record Wrap_t (T : Type) := mkWrap_t { wrap_value : T; }.
Arguments mkWrap_t { _ }.
Arguments wrap_value { _ }.
(** [constants::{constants::Wrap<T>}::new]:
- Source: 'src/constants.rs', lines 54:4-54:41 *)
+ Source: 'tests/src/constants.rs', lines 54:4-54:41 *)
Definition wrap_new (T : Type) (value : T) : result (Wrap_t T) :=
Ok {| wrap_value := value |}
.
(** [constants::Y]
- Source: 'src/constants.rs', lines 41:0-41:22 *)
+ Source: 'tests/src/constants.rs', lines 41:0-41: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: 'src/constants.rs', lines 43:0-43:30 *)
+ Source: 'tests/src/constants.rs', lines 43:0-43:30 *)
Definition unwrap_y : result i32 :=
Ok y.(wrap_value).
(** [constants::YVAL]
- Source: 'src/constants.rs', lines 47:0-47:19 *)
+ Source: 'tests/src/constants.rs', lines 47:0-47:19 *)
Definition yval_body : result i32 := unwrap_y.
Definition yval : i32 := yval_body%global.
(** [constants::get_z1::Z1]
- Source: 'src/constants.rs', lines 62:4-62:17 *)
+ Source: 'tests/src/constants.rs', lines 62:4-62: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: 'src/constants.rs', lines 61:0-61:28 *)
+ Source: 'tests/src/constants.rs', lines 61:0-61:28 *)
Definition get_z1 : result i32 :=
Ok get_z1_z1.
(** [constants::add]:
- Source: 'src/constants.rs', lines 66:0-66:39 *)
+ Source: 'tests/src/constants.rs', lines 66:0-66:39 *)
Definition add (a : i32) (b : i32) : result i32 :=
i32_add a b.
(** [constants::Q1]
- Source: 'src/constants.rs', lines 74:0-74:17 *)
+ Source: 'tests/src/constants.rs', lines 74:0-74:17 *)
Definition q1_body : result i32 := Ok 5%i32.
Definition q1 : i32 := q1_body%global.
(** [constants::Q2]
- Source: 'src/constants.rs', lines 75:0-75:17 *)
+ Source: 'tests/src/constants.rs', lines 75:0-75:17 *)
Definition q2_body : result i32 := Ok q1.
Definition q2 : i32 := q2_body%global.
(** [constants::Q3]
- Source: 'src/constants.rs', lines 76:0-76:17 *)
+ Source: 'tests/src/constants.rs', lines 76:0-76:17 *)
Definition q3_body : result i32 := add q2 3%i32.
Definition q3 : i32 := q3_body%global.
(** [constants::get_z2]:
- Source: 'src/constants.rs', lines 70:0-70:28 *)
+ Source: 'tests/src/constants.rs', lines 70:0-70:28 *)
Definition get_z2 : result i32 :=
i <- get_z1; i1 <- add i q3; add q1 i1.
(** [constants::S1]
- Source: 'src/constants.rs', lines 80:0-80:18 *)
+ Source: 'tests/src/constants.rs', lines 80:0-80:18 *)
Definition s1_body : result u32 := Ok 6%u32.
Definition s1 : u32 := s1_body%global.
(** [constants::S2]
- Source: 'src/constants.rs', lines 81:0-81:18 *)
+ Source: 'tests/src/constants.rs', lines 81:0-81:18 *)
Definition s2_body : result u32 := incr s1.
Definition s2 : u32 := s2_body%global.
(** [constants::S3]
- Source: 'src/constants.rs', lines 82:0-82:29 *)
+ Source: 'tests/src/constants.rs', lines 82:0-82:29 *)
Definition s3_body : result (Pair_t u32 u32) := Ok p3.
Definition s3 : Pair_t u32 u32 := s3_body%global.
(** [constants::S4]
- Source: 'src/constants.rs', lines 83:0-83:29 *)
+ Source: 'tests/src/constants.rs', lines 83:0-83: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: 'src/constants.rs', lines 86:0-86:31 *)
+ Source: 'tests/src/constants.rs', lines 86:0-86: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: 'src/constants.rs', lines 91:4-91:24 *)
+ Source: 'tests/src/constants.rs', lines 91:4-91: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: 'src/constants.rs', lines 94:0-94:42 *)
+ Source: 'tests/src/constants.rs', lines 94:0-94: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 85f6e4d1..d0de80d9 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: 'src/external.rs', lines 5:0-5:37 *)
+ Source: 'tests/src/external.rs', lines 5:0-5: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: 'src/external.rs', lines 9:0-9:31 *)
+ Source: 'tests/src/external.rs', lines 9:0-9:31 *)
Definition incr
(rc : core_cell_Cell_t u32) (st : state) :
result (state * (core_cell_Cell_t u32))
diff --git a/tests/coq/misc/Loops.v b/tests/coq/misc/Loops.v
index f396f16f..bf0a8bc1 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: 'src/loops.rs', lines 4:0-14:1 *)
+ Source: 'tests/src/loops.rs', lines 4:0-14: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: 'src/loops.rs', lines 4:0-4:27 *)
+ Source: 'tests/src/loops.rs', lines 4:0-4: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: 'src/loops.rs', lines 19:0-31:1 *)
+ Source: 'tests/src/loops.rs', lines 19:0-31: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: 'src/loops.rs', lines 19:0-19:44 *)
+ Source: 'tests/src/loops.rs', lines 19:0-19: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: 'src/loops.rs', lines 34:0-48:1 *)
+ Source: 'tests/src/loops.rs', lines 34:0-48: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: 'src/loops.rs', lines 34:0-34:47 *)
+ Source: 'tests/src/loops.rs', lines 34:0-34: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: 'src/loops.rs', lines 50:0-58:1 *)
+ Source: 'tests/src/loops.rs', lines 50:0-58: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: 'src/loops.rs', lines 50:0-50:52 *)
+ Source: 'tests/src/loops.rs', lines 50:0-50: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: 'src/loops.rs', lines 62:0-68:1 *)
+ Source: 'tests/src/loops.rs', lines 62:0-68: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: 'src/loops.rs', lines 62:0-62:30 *)
+ Source: 'tests/src/loops.rs', lines 62:0-62:30 *)
Definition clear
(n : nat) (v : alloc_vec_Vec u32) : result (alloc_vec_Vec u32) :=
clear_loop n v 0%usize
.
(** [loops::List]
- Source: 'src/loops.rs', lines 70:0-70:16 *)
+ Source: 'tests/src/loops.rs', lines 70:0-70: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: 'src/loops.rs', lines 76:0-85:1 *)
+ Source: 'tests/src/loops.rs', lines 76:0-85: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: 'src/loops.rs', lines 76:0-76:52 *)
+ Source: 'tests/src/loops.rs', lines 76:0-76: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: 'src/loops.rs', lines 88:0-98:1 *)
+ Source: 'tests/src/loops.rs', lines 88:0-98: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: 'src/loops.rs', lines 88:0-88:71 *)
+ Source: 'tests/src/loops.rs', lines 88:0-88: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: 'src/loops.rs', lines 101:0-111:1 *)
+ Source: 'tests/src/loops.rs', lines 101:0-111: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: 'src/loops.rs', lines 101:0-101:66 *)
+ Source: 'tests/src/loops.rs', lines 101:0-101: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: 'src/loops.rs', lines 113:0-127:1 *)
+ Source: 'tests/src/loops.rs', lines 113:0-127: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: 'src/loops.rs', lines 113:0-113:73 *)
+ Source: 'tests/src/loops.rs', lines 113:0-113: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: 'src/loops.rs', lines 129:0-143:1 *)
+ Source: 'tests/src/loops.rs', lines 129:0-143: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: 'src/loops.rs', lines 129:0-129:68 *)
+ Source: 'tests/src/loops.rs', lines 129:0-129: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: 'src/loops.rs', lines 145:0-145:50 *)
+ Source: 'tests/src/loops.rs', lines 145:0-145: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: 'src/loops.rs', lines 149:0-149:45 *)
+ Source: 'tests/src/loops.rs', lines 149:0-149: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: 'src/loops.rs', lines 154:0-165:1 *)
+ Source: 'tests/src/loops.rs', lines 154:0-165: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: 'src/loops.rs', lines 154:0-154:75 *)
+ Source: 'tests/src/loops.rs', lines 154:0-154: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: 'src/loops.rs', lines 168:0-179:1 *)
+ Source: 'tests/src/loops.rs', lines 168:0-179: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: 'src/loops.rs', lines 168:0-168:70 *)
+ Source: 'tests/src/loops.rs', lines 168:0-168: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: 'src/loops.rs', lines 184:0-205:1 *)
+ Source: 'tests/src/loops.rs', lines 184:0-205: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: 'src/loops.rs', lines 184:0-188:27 *)
+ Source: 'tests/src/loops.rs', lines 184:0-188: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: 'src/loops.rs', lines 208:0-229:1 *)
+ Source: 'tests/src/loops.rs', lines 208:0-229: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: 'src/loops.rs', lines 208:0-212:19 *)
+ Source: 'tests/src/loops.rs', lines 208:0-212: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: 'src/loops.rs', lines 233:0-248:1 *)
+ Source: 'tests/src/loops.rs', lines 233:0-248: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: 'src/loops.rs', lines 233:0-237:27 *)
+ Source: 'tests/src/loops.rs', lines 233:0-237: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: 'src/loops.rs', lines 251:0-266:1 *)
+ Source: 'tests/src/loops.rs', lines 251:0-266: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: 'src/loops.rs', lines 251:0-255:19 *)
+ Source: 'tests/src/loops.rs', lines 251:0-255: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: 'src/loops.rs', lines 269:0-284:1 *)
+ Source: 'tests/src/loops.rs', lines 269:0-284: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: 'src/loops.rs', lines 269:0-273:23 *)
+ Source: 'tests/src/loops.rs', lines 269:0-273: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: 'src/loops.rs', lines 288:0-303:1 *)
+ Source: 'tests/src/loops.rs', lines 288:0-303: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: 'src/loops.rs', lines 288:0-292:23 *)
+ Source: 'tests/src/loops.rs', lines 288:0-292: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: 'src/loops.rs', lines 307:0-322:1 *)
+ Source: 'tests/src/loops.rs', lines 307:0-322: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: 'src/loops.rs', lines 307:0-311:23 *)
+ Source: 'tests/src/loops.rs', lines 307:0-311: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: 'src/loops.rs', lines 326:0-341:1 *)
+ Source: 'tests/src/loops.rs', lines 326:0-341: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: 'src/loops.rs', lines 326:0-330:23 *)
+ Source: 'tests/src/loops.rs', lines 326:0-330: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: 'src/loops.rs', lines 345:0-349:1 *)
+ Source: 'tests/src/loops.rs', lines 345:0-349: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: 'src/loops.rs', lines 345:0-345:56 *)
+ Source: 'tests/src/loops.rs', lines 345:0-345: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: 'src/loops.rs', lines 353:0-358:1 *)
+ Source: 'tests/src/loops.rs', lines 353:0-358: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: 'src/loops.rs', lines 353:0-353:60 *)
+ Source: 'tests/src/loops.rs', lines 353:0-353: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: 'src/loops.rs', lines 362:0-366:1 *)
+ Source: 'tests/src/loops.rs', lines 362:0-366: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: 'src/loops.rs', lines 362:0-362:59 *)
+ Source: 'tests/src/loops.rs', lines 362:0-362: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 b19ea2df..a83347a7 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: 'src/no_nested_borrows.rs', lines 4:0-4:23 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 4:0-4: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: 'src/no_nested_borrows.rs', lines 9:0-9:16 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 9:0-9: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: 'src/no_nested_borrows.rs', lines 20:0-20:16 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 20:0-20:16 *)
Inductive One_t (T1 : Type) := | One_One : T1 -> One_t T1.
Arguments One_One { _ }.
(** [no_nested_borrows::EmptyEnum]
- Source: 'src/no_nested_borrows.rs', lines 26:0-26:18 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 26:0-26:18 *)
Inductive EmptyEnum_t := | EmptyEnum_Empty : EmptyEnum_t.
(** [no_nested_borrows::Enum]
- Source: 'src/no_nested_borrows.rs', lines 32:0-32:13 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 32:0-32:13 *)
Inductive Enum_t := | Enum_Variant1 : Enum_t | Enum_Variant2 : Enum_t.
(** [no_nested_borrows::EmptyStruct]
- Source: 'src/no_nested_borrows.rs', lines 39:0-39:22 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 39:0-39:22 *)
Definition EmptyStruct_t : Type := unit.
(** [no_nested_borrows::Sum]
- Source: 'src/no_nested_borrows.rs', lines 41:0-41:20 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 41:0-41: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: 'src/no_nested_borrows.rs', lines 46:0-46:37 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 46:0-46:37 *)
Definition cast_u32_to_i32 (x : u32) : result i32 :=
scalar_cast U32 I32 x.
(** [no_nested_borrows::cast_bool_to_i32]:
- Source: 'src/no_nested_borrows.rs', lines 50:0-50:39 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 50:0-50:39 *)
Definition cast_bool_to_i32 (x : bool) : result i32 :=
scalar_cast_bool I32 x.
(** [no_nested_borrows::cast_bool_to_bool]:
- Source: 'src/no_nested_borrows.rs', lines 55:0-55:41 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 55:0-55:41 *)
Definition cast_bool_to_bool (x : bool) : result bool :=
Ok x.
(** [no_nested_borrows::test2]:
- Source: 'src/no_nested_borrows.rs', lines 60:0-60:14 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 60:0-60: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: 'src/no_nested_borrows.rs', lines 72:0-72:37 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 72:0-72: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: 'src/no_nested_borrows.rs', lines 80:0-80:14 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 80:0-80: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: 'src/no_nested_borrows.rs', lines 87:0-87:18 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 87:0-87: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: 'src/no_nested_borrows.rs', lines 94:0-94:19 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 94:0-94: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: 'src/no_nested_borrows.rs', lines 105:0-105:19 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 105:0-105: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: 'src/no_nested_borrows.rs', lines 121:0-121:19 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 121:0-121: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: 'src/no_nested_borrows.rs', lines 126:0-126:18 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 126:0-126: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: 'src/no_nested_borrows.rs', lines 136:0-136:30 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 136:0-136:30 *)
Definition copy_int (x : i32) : result i32 :=
Ok x.
(** [no_nested_borrows::test_unreachable]:
- Source: 'src/no_nested_borrows.rs', lines 142:0-142:32 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 142:0-142:32 *)
Definition test_unreachable (b : bool) : result unit :=
if b then Fail_ Failure else Ok tt
.
(** [no_nested_borrows::test_panic]:
- Source: 'src/no_nested_borrows.rs', lines 150:0-150:26 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 150:0-150:26 *)
Definition test_panic (b : bool) : result unit :=
if b then Fail_ Failure else Ok tt
.
(** [no_nested_borrows::test_copy_int]:
- Source: 'src/no_nested_borrows.rs', lines 157:0-157:22 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 157:0-157: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: 'src/no_nested_borrows.rs', lines 164:0-164:38 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 164:0-164: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: 'src/no_nested_borrows.rs', lines 171:0-171:21 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 171:0-171: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: 'src/no_nested_borrows.rs', lines 177:0-177:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 177:0-177: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: 'src/no_nested_borrows.rs', lines 185:0-185:24 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 185:0-185: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: 'src/no_nested_borrows.rs', lines 192:0-192:70 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 192:0-192: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: 'src/no_nested_borrows.rs', lines 200:0-200:20 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 200:0-200:20 *)
Definition choose_test : result unit :=
p <- choose i32 true 0%i32 0%i32;
let (z, choose_back) := p in
@@ -239,18 +239,18 @@ Definition choose_test : result unit :=
Check (choose_test )%return.
(** [no_nested_borrows::test_char]:
- Source: 'src/no_nested_borrows.rs', lines 212:0-212:26 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 212:0-212:26 *)
Definition test_char : result char :=
Ok (char_of_byte Coq.Init.Byte.x61).
(** [no_nested_borrows::Tree]
- Source: 'src/no_nested_borrows.rs', lines 217:0-217:16 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 217:0-217: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: 'src/no_nested_borrows.rs', lines 222:0-222:20 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 222:0-222:20 *)
with NodeElem_t (T : Type) :=
| NodeElem_Cons : Tree_t T -> NodeElem_t T -> NodeElem_t T
| NodeElem_Nil : NodeElem_t T
@@ -263,7 +263,7 @@ Arguments NodeElem_Cons { _ }.
Arguments NodeElem_Nil { _ }.
(** [no_nested_borrows::list_length]:
- Source: 'src/no_nested_borrows.rs', lines 257:0-257:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 257:0-257: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
@@ -272,7 +272,7 @@ Fixpoint list_length (T : Type) (l : List_t T) : result u32 :=
.
(** [no_nested_borrows::list_nth_shared]:
- Source: 'src/no_nested_borrows.rs', lines 265:0-265:62 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 265:0-265:62 *)
Fixpoint list_nth_shared (T : Type) (l : List_t T) (i : u32) : result T :=
match l with
| List_Cons x tl =>
@@ -284,7 +284,7 @@ Fixpoint list_nth_shared (T : Type) (l : List_t T) (i : u32) : result T :=
.
(** [no_nested_borrows::list_nth_mut]:
- Source: 'src/no_nested_borrows.rs', lines 281:0-281:67 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 281:0-281:67 *)
Fixpoint list_nth_mut
(T : Type) (l : List_t T) (i : u32) :
result (T * (T -> result (List_t T)))
@@ -305,7 +305,7 @@ Fixpoint list_nth_mut
.
(** [no_nested_borrows::list_rev_aux]:
- Source: 'src/no_nested_borrows.rs', lines 297:0-297:63 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 297:0-297:63 *)
Fixpoint list_rev_aux
(T : Type) (li : List_t T) (lo : List_t T) : result (List_t T) :=
match li with
@@ -315,14 +315,14 @@ Fixpoint list_rev_aux
.
(** [no_nested_borrows::list_rev]:
- Source: 'src/no_nested_borrows.rs', lines 311:0-311:42 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 311:0-311: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: 'src/no_nested_borrows.rs', lines 316:0-316:28 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 316:0-316:28 *)
Definition test_list_functions : result unit :=
let l := List_Cons 2%i32 List_Nil in
let l1 := List_Cons 1%i32 l in
@@ -361,7 +361,7 @@ Definition test_list_functions : result unit :=
Check (test_list_functions )%return.
(** [no_nested_borrows::id_mut_pair1]:
- Source: 'src/no_nested_borrows.rs', lines 332:0-332:89 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 332:0-332:89 *)
Definition id_mut_pair1
(T1 T2 : Type) (x : T1) (y : T2) :
result ((T1 * T2) * ((T1 * T2) -> result (T1 * T2)))
@@ -370,7 +370,7 @@ Definition id_mut_pair1
.
(** [no_nested_borrows::id_mut_pair2]:
- Source: 'src/no_nested_borrows.rs', lines 336:0-336:88 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 336:0-336:88 *)
Definition id_mut_pair2
(T1 T2 : Type) (p : (T1 * T2)) :
result ((T1 * T2) * ((T1 * T2) -> result (T1 * T2)))
@@ -379,7 +379,7 @@ Definition id_mut_pair2
.
(** [no_nested_borrows::id_mut_pair3]:
- Source: 'src/no_nested_borrows.rs', lines 340:0-340:93 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 340:0-340:93 *)
Definition id_mut_pair3
(T1 T2 : Type) (x : T1) (y : T2) :
result ((T1 * T2) * (T1 -> result T1) * (T2 -> result T2))
@@ -388,7 +388,7 @@ Definition id_mut_pair3
.
(** [no_nested_borrows::id_mut_pair4]:
- Source: 'src/no_nested_borrows.rs', lines 344:0-344:92 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 344:0-344:92 *)
Definition id_mut_pair4
(T1 T2 : Type) (p : (T1 * T2)) :
result ((T1 * T2) * (T1 -> result T1) * (T2 -> result T2))
@@ -397,7 +397,7 @@ Definition id_mut_pair4
.
(** [no_nested_borrows::StructWithTuple]
- Source: 'src/no_nested_borrows.rs', lines 351:0-351:34 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 351:0-351:34 *)
Record StructWithTuple_t (T1 T2 : Type) :=
mkStructWithTuple_t {
structWithTuple_p : (T1 * T2);
@@ -408,25 +408,25 @@ Arguments mkStructWithTuple_t { _ _ }.
Arguments structWithTuple_p { _ _ }.
(** [no_nested_borrows::new_tuple1]:
- Source: 'src/no_nested_borrows.rs', lines 355:0-355:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 355:0-355:48 *)
Definition new_tuple1 : result (StructWithTuple_t u32 u32) :=
Ok {| structWithTuple_p := (1%u32, 2%u32) |}
.
(** [no_nested_borrows::new_tuple2]:
- Source: 'src/no_nested_borrows.rs', lines 359:0-359:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 359:0-359:48 *)
Definition new_tuple2 : result (StructWithTuple_t i16 i16) :=
Ok {| structWithTuple_p := (1%i16, 2%i16) |}
.
(** [no_nested_borrows::new_tuple3]:
- Source: 'src/no_nested_borrows.rs', lines 363:0-363:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 363:0-363:48 *)
Definition new_tuple3 : result (StructWithTuple_t u64 i64) :=
Ok {| structWithTuple_p := (1%u64, 2%i64) |}
.
(** [no_nested_borrows::StructWithPair]
- Source: 'src/no_nested_borrows.rs', lines 368:0-368:33 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 368:0-368:33 *)
Record StructWithPair_t (T1 T2 : Type) :=
mkStructWithPair_t {
structWithPair_p : Pair_t T1 T2;
@@ -437,13 +437,13 @@ Arguments mkStructWithPair_t { _ _ }.
Arguments structWithPair_p { _ _ }.
(** [no_nested_borrows::new_pair1]:
- Source: 'src/no_nested_borrows.rs', lines 372:0-372:46 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 372:0-372: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: 'src/no_nested_borrows.rs', lines 380:0-380:23 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 380:0-380:23 *)
Definition test_constants : result unit :=
swt <- new_tuple1;
let (i, _) := swt.(structWithTuple_p) in
@@ -470,7 +470,7 @@ Definition test_constants : result unit :=
Check (test_constants )%return.
(** [no_nested_borrows::test_weird_borrows1]:
- Source: 'src/no_nested_borrows.rs', lines 389:0-389:28 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 389:0-389:28 *)
Definition test_weird_borrows1 : result unit :=
Ok tt.
@@ -478,78 +478,78 @@ Definition test_weird_borrows1 : result unit :=
Check (test_weird_borrows1 )%return.
(** [no_nested_borrows::test_mem_replace]:
- Source: 'src/no_nested_borrows.rs', lines 399:0-399:37 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 399:0-399: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: 'src/no_nested_borrows.rs', lines 406:0-406:47 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 406:0-406: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: 'src/no_nested_borrows.rs', lines 419:0-419:40 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 419:0-419:40 *)
Definition test_shared_borrow_bool2 : result u32 :=
Ok 0%u32.
(** [no_nested_borrows::test_shared_borrow_enum1]:
- Source: 'src/no_nested_borrows.rs', lines 434:0-434:52 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 434:0-434: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: 'src/no_nested_borrows.rs', lines 446:0-446:40 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 446:0-446:40 *)
Definition test_shared_borrow_enum2 : result u32 :=
Ok 0%u32.
(** [no_nested_borrows::incr]:
- Source: 'src/no_nested_borrows.rs', lines 457:0-457:24 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 457:0-457:24 *)
Definition incr (x : u32) : result u32 :=
u32_add x 1%u32.
(** [no_nested_borrows::call_incr]:
- Source: 'src/no_nested_borrows.rs', lines 461:0-461:35 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 461:0-461:35 *)
Definition call_incr (x : u32) : result u32 :=
incr x.
(** [no_nested_borrows::read_then_incr]:
- Source: 'src/no_nested_borrows.rs', lines 466:0-466:41 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 466:0-466:41 *)
Definition read_then_incr (x : u32) : result (u32 * u32) :=
x1 <- u32_add x 1%u32; Ok (x, x1)
.
(** [no_nested_borrows::Tuple]
- Source: 'src/no_nested_borrows.rs', lines 472:0-472:24 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 472:0-472:24 *)
Definition Tuple_t (T1 T2 : Type) : Type := T1 * T2.
(** [no_nested_borrows::use_tuple_struct]:
- Source: 'src/no_nested_borrows.rs', lines 474:0-474:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 474:0-474: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: 'src/no_nested_borrows.rs', lines 478:0-478:61 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 478:0-478:61 *)
Definition create_tuple_struct
(x : u32) (y : u64) : result (Tuple_t u32 u64) :=
Ok (x, y)
.
(** [no_nested_borrows::IdType]
- Source: 'src/no_nested_borrows.rs', lines 483:0-483:20 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 483:0-483:20 *)
Definition IdType_t (T : Type) : Type := T.
(** [no_nested_borrows::use_id_type]:
- Source: 'src/no_nested_borrows.rs', lines 485:0-485:40 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 485:0-485:40 *)
Definition use_id_type (T : Type) (x : IdType_t T) : result T :=
Ok x.
(** [no_nested_borrows::create_id_type]:
- Source: 'src/no_nested_borrows.rs', lines 489:0-489:43 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 489:0-489: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 5995de15..661a8cc2 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: 'src/paper.rs', lines 4:0-4:28 *)
+ Source: 'tests/src/paper.rs', lines 4:0-4:28 *)
Definition ref_incr (x : i32) : result i32 :=
i32_add x 1%i32.
(** [paper::test_incr]:
- Source: 'src/paper.rs', lines 8:0-8:18 *)
+ Source: 'tests/src/paper.rs', lines 8:0-8: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: 'src/paper.rs', lines 15:0-15:70 *)
+ Source: 'tests/src/paper.rs', lines 15:0-15: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: 'src/paper.rs', lines 23:0-23:20 *)
+ Source: 'tests/src/paper.rs', lines 23:0-23: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: 'src/paper.rs', lines 35:0-35:16 *)
+ Source: 'tests/src/paper.rs', lines 35:0-35: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: 'src/paper.rs', lines 42:0-42:67 *)
+ Source: 'tests/src/paper.rs', lines 42:0-42: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: 'src/paper.rs', lines 57:0-57:32 *)
+ Source: 'tests/src/paper.rs', lines 57:0-57: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: 'src/paper.rs', lines 68:0-68:17 *)
+ Source: 'tests/src/paper.rs', lines 68:0-68: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: 'src/paper.rs', lines 76:0-76:44 *)
+ Source: 'tests/src/paper.rs', lines 76:0-76: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 8af7f69c..c89f9655 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: 'src/polonius_list.rs', lines 3:0-3:16 *)
+ Source: 'tests/src/polonius_list.rs', lines 3:0-3: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: 'src/polonius_list.rs', lines 13:0-13:76 *)
+ Source: 'tests/src/polonius_list.rs', lines 13:0-13: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 18b06bc1..e583c2be 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: 'src/traits.rs', lines 1:0-1:19 *)
+ Source: 'tests/src/traits.rs', lines 1:0-1: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: 'src/traits.rs', lines 12:4-12:30 *)
+ Source: 'tests/src/traits.rs', lines 12:4-12:30 *)
Definition boolTraitBool_get_bool (self : bool) : result bool :=
Ok self.
(** Trait implementation: [traits::{(traits::BoolTrait for bool)}]
- Source: 'src/traits.rs', lines 11:0-11:23 *)
+ Source: 'tests/src/traits.rs', lines 11:0-11:23 *)
Definition BoolTraitBool : BoolTrait_t bool := {|
BoolTrait_t_get_bool := boolTraitBool_get_bool;
|}.
(** [traits::BoolTrait::ret_true]:
- Source: 'src/traits.rs', lines 6:4-6:30 *)
+ Source: 'tests/src/traits.rs', lines 6:4-6:30 *)
Definition boolTrait_ret_true
{Self : Type} (self_clause : BoolTrait_t Self) (self : Self) : result bool :=
Ok true
.
(** [traits::test_bool_trait_bool]:
- Source: 'src/traits.rs', lines 17:0-17:44 *)
+ Source: 'tests/src/traits.rs', lines 17:0-17: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: 'src/traits.rs', lines 23:4-23:30 *)
+ Source: 'tests/src/traits.rs', lines 23:4-23: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: 'src/traits.rs', lines 22:0-22:31 *)
+ Source: 'tests/src/traits.rs', lines 22:0-22:31 *)
Definition BoolTraitOption (T : Type) : BoolTrait_t (option T) := {|
BoolTrait_t_get_bool := boolTraitOption_get_bool T;
|}.
(** [traits::test_bool_trait_option]:
- Source: 'src/traits.rs', lines 31:0-31:54 *)
+ Source: 'tests/src/traits.rs', lines 31:0-31: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: 'src/traits.rs', lines 35:0-35:50 *)
+ Source: 'tests/src/traits.rs', lines 35:0-35: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: 'src/traits.rs', lines 39:0-39:15 *)
+ Source: 'tests/src/traits.rs', lines 39:0-39: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: 'src/traits.rs', lines 44:4-44:26 *)
+ Source: 'tests/src/traits.rs', lines 44:4-44:26 *)
Definition toU64U64_to_u64 (self : u64) : result u64 :=
Ok self.
(** Trait implementation: [traits::{(traits::ToU64 for u64)#2}]
- Source: 'src/traits.rs', lines 43:0-43:18 *)
+ Source: 'tests/src/traits.rs', lines 43:0-43:18 *)
Definition ToU64U64 : ToU64_t u64 := {| ToU64_t_to_u64 := toU64U64_to_u64; |}.
(** [traits::{(traits::ToU64 for (A, A))#3}::to_u64]:
- Source: 'src/traits.rs', lines 50:4-50:26 *)
+ Source: 'tests/src/traits.rs', lines 50:4-50: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: 'src/traits.rs', lines 49:0-49:31 *)
+ Source: 'tests/src/traits.rs', lines 49:0-49: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: 'src/traits.rs', lines 55:0-55:36 *)
+ Source: 'tests/src/traits.rs', lines 55:0-55:36 *)
Definition f (T : Type) (toU64Inst : ToU64_t T) (x : (T * T)) : result u64 :=
toU64Pair_to_u64 T toU64Inst x
.
(** [traits::g]:
- Source: 'src/traits.rs', lines 59:0-61:18 *)
+ Source: 'tests/src/traits.rs', lines 59:0-61:18 *)
Definition g
(T : Type) (toU64PairInst : ToU64_t (T * T)) (x : (T * T)) : result u64 :=
toU64PairInst.(ToU64_t_to_u64) x
.
(** [traits::h0]:
- Source: 'src/traits.rs', lines 66:0-66:24 *)
+ Source: 'tests/src/traits.rs', lines 66:0-66:24 *)
Definition h0 (x : u64) : result u64 :=
toU64U64_to_u64 x.
(** [traits::Wrapper]
- Source: 'src/traits.rs', lines 70:0-70:21 *)
+ Source: 'tests/src/traits.rs', lines 70:0-70: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: 'src/traits.rs', lines 75:4-75:26 *)
+ Source: 'tests/src/traits.rs', lines 75:4-75: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: 'src/traits.rs', lines 74:0-74:35 *)
+ Source: 'tests/src/traits.rs', lines 74:0-74: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: 'src/traits.rs', lines 80:0-80:33 *)
+ Source: 'tests/src/traits.rs', lines 80:0-80:33 *)
Definition h1 (x : Wrapper_t u64) : result u64 :=
toU64traitsWrapper_to_u64 u64 ToU64U64 x
.
(** [traits::h2]:
- Source: 'src/traits.rs', lines 84:0-84:41 *)
+ Source: 'tests/src/traits.rs', lines 84:0-84: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: 'src/traits.rs', lines 88:0-88:19 *)
+ Source: 'tests/src/traits.rs', lines 88:0-88: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: 'src/traits.rs', lines 93:4-93:28 *)
+ Source: 'tests/src/traits.rs', lines 93:4-93:28 *)
Definition toTypeU64Bool_to_type (self : u64) : result bool :=
Ok (self s> 0%u64)
.
(** Trait implementation: [traits::{(traits::ToType<bool> for u64)#5}]
- Source: 'src/traits.rs', lines 92:0-92:25 *)
+ Source: 'tests/src/traits.rs', lines 92:0-92:25 *)
Definition ToTypeU64Bool : ToType_t u64 bool := {|
ToType_t_to_type := toTypeU64Bool_to_type;
|}.
(** Trait declaration: [traits::OfType]
- Source: 'src/traits.rs', lines 98:0-98:16 *)
+ Source: 'tests/src/traits.rs', lines 98:0-98: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: 'src/traits.rs', lines 104:0-104:50 *)
+ Source: 'tests/src/traits.rs', lines 104:0-104: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: 'src/traits.rs', lines 109:0-109:36 *)
+ Source: 'tests/src/traits.rs', lines 109:0-109: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: 'src/traits.rs', lines 118:0-118:57 *)
+ Source: 'tests/src/traits.rs', lines 118:0-118: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: 'src/traits.rs', lines 122:0-122:22 *)
+ Source: 'tests/src/traits.rs', lines 122:0-122:22 *)
Definition TestType_t (T : Type) : Type := T.
(** [traits::{traits::TestType<T>#6}::test::TestType1]
- Source: 'src/traits.rs', lines 127:8-127:24 *)
+ Source: 'tests/src/traits.rs', lines 127:8-127:24 *)
Definition TestType_test_TestType1_t : Type := u64.
(** Trait declaration: [traits::{traits::TestType<T>#6}::test::TestTrait]
- Source: 'src/traits.rs', lines 128:8-128:23 *)
+ Source: 'tests/src/traits.rs', lines 128:8-128: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: 'src/traits.rs', lines 139:12-139:34 *)
+ Source: 'tests/src/traits.rs', lines 139:12-139: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: 'src/traits.rs', lines 138:8-138:36 *)
+ Source: 'tests/src/traits.rs', lines 138:8-138: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: 'src/traits.rs', lines 126:4-126:36 *)
+ Source: 'tests/src/traits.rs', lines 126:4-126: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: 'src/traits.rs', lines 150:0-150:22 *)
+ Source: 'tests/src/traits.rs', lines 150:0-150:22 *)
Definition BoolWrapper_t : Type := bool.
(** [traits::{(traits::ToType<T> for traits::BoolWrapper)#7}::to_type]:
- Source: 'src/traits.rs', lines 156:4-156:25 *)
+ Source: 'tests/src/traits.rs', lines 156:4-156: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: 'src/traits.rs', lines 152:0-152:33 *)
+ Source: 'tests/src/traits.rs', lines 152:0-152: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: 'src/traits.rs', lines 164:4-164:21 *)
+ Source: 'tests/src/traits.rs', lines 164:4-164: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: 'src/traits.rs', lines 161:0-161:39 *)
+ Source: 'tests/src/traits.rs', lines 161:0-161: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: 'src/traits.rs', lines 175:4-175:21 *)
+ Source: 'tests/src/traits.rs', lines 175:4-175: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: 'src/traits.rs', lines 180:4-180:39 *)
+ Source: 'tests/src/traits.rs', lines 180:4-180: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: 'src/traits.rs', lines 174:0-174:29 *)
+ Source: 'tests/src/traits.rs', lines 174:0-174: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: 'src/traits.rs', lines 183:0-183:75 *)
+ Source: 'tests/src/traits.rs', lines 183:0-183: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: 'src/traits.rs', lines 187:0-187:73 *)
+ Source: 'tests/src/traits.rs', lines 187:0-187: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: 'src/traits.rs', lines 189:0-189:80 *)
+ Source: 'tests/src/traits.rs', lines 189:0-189: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: 'src/traits.rs', lines 193:0-193:40 *)
+ Source: 'tests/src/traits.rs', lines 193:0-193:40 *)
Definition test_where1 (T : Type) (_x : T) : result unit :=
Ok tt.
(** [traits::test_where2]:
- Source: 'src/traits.rs', lines 194:0-194:57 *)
+ Source: 'tests/src/traits.rs', lines 194:0-194: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: 'src/traits.rs', lines 200:0-200:22 *)
+ Source: 'tests/src/traits.rs', lines 200:0-200: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: 'src/traits.rs', lines 205:0-205:22 *)
+ Source: 'tests/src/traits.rs', lines 205:0-205:22 *)
Record ParentTrait1_t (Self : Type) := mkParentTrait1_t{}.
Arguments mkParentTrait1_t { _ }.
(** Trait declaration: [traits::ChildTrait]
- Source: 'src/traits.rs', lines 206:0-206:49 *)
+ Source: 'tests/src/traits.rs', lines 206:0-206: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: 'src/traits.rs', lines 209:0-209:56 *)
+ Source: 'tests/src/traits.rs', lines 209:0-209: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: 'src/traits.rs', lines 213:0-213:54 *)
+ Source: 'tests/src/traits.rs', lines 213:0-213: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: 'src/traits.rs', lines 219:0-219:59 *)
+ Source: 'tests/src/traits.rs', lines 219:0-219: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: 'src/traits.rs', lines 222:0-222:35 *)
+ Source: 'tests/src/traits.rs', lines 222:0-222: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: 'src/traits.rs', lines 224:0-224:27 *)
+ Source: 'tests/src/traits.rs', lines 224:0-224:27 *)
Definition ParentTrait1Usize : ParentTrait1_t usize := mkParentTrait1_t.
(** Trait implementation: [traits::{(traits::ChildTrait1 for usize)#10}]
- Source: 'src/traits.rs', lines 225:0-225:26 *)
+ Source: 'tests/src/traits.rs', lines 225:0-225:26 *)
Definition ChildTrait1Usize : ChildTrait1_t usize := {|
ChildTrait1_tChildTrait1_t_ParentTrait1Inst := ParentTrait1Usize;
|}.
(** Trait declaration: [traits::Iterator]
- Source: 'src/traits.rs', lines 229:0-229:18 *)
+ Source: 'tests/src/traits.rs', lines 229:0-229: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: 'src/traits.rs', lines 233:0-233:22 *)
+ Source: 'tests/src/traits.rs', lines 233:0-233: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: 'src/traits.rs', lines 250:0-250:21 *)
+ Source: 'tests/src/traits.rs', lines 250:0-250:21 *)
Record FromResidual_t (Self T : Type) := mkFromResidual_t{}.
Arguments mkFromResidual_t { _ _ }.
(** Trait declaration: [traits::Try]
- Source: 'src/traits.rs', lines 246:0-246:48 *)
+ Source: 'tests/src/traits.rs', lines 246:0-246: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: 'src/traits.rs', lines 252:0-252:20 *)
+ Source: 'tests/src/traits.rs', lines 252:0-252: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: 'src/traits.rs', lines 256:0-256:22 *)
+ Source: 'tests/src/traits.rs', lines 256:0-256: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: 'src/traits.rs', lines 260:0-260:35 *)
+ Source: 'tests/src/traits.rs', lines 260:0-260: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: 'src/traits.rs', lines 264:0-264:23 *)
+ Source: 'tests/src/traits.rs', lines 264:0-264:23 *)
Definition WithTargetU32 : WithTarget_t u32 := {|
WithTarget_tWithTarget_t_Target := u32;
|}.
(** Trait implementation: [traits::{(traits::ParentTrait2 for u32)#12}]
- Source: 'src/traits.rs', lines 268:0-268:25 *)
+ Source: 'tests/src/traits.rs', lines 268:0-268: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: 'src/traits.rs', lines 273:4-273:29 *)
+ Source: 'tests/src/traits.rs', lines 273:4-273:29 *)
Definition childTrait2U32_convert (x : u32) : result u32 :=
Ok x.
(** Trait implementation: [traits::{(traits::ChildTrait2 for u32)#13}]
- Source: 'src/traits.rs', lines 272:0-272:24 *)
+ Source: 'tests/src/traits.rs', lines 272:0-272:24 *)
Definition ChildTrait2U32 : ChildTrait2_t u32 := {|
ChildTrait2_tChildTrait2_t_ParentTrait2Inst := ParentTrait2U32;
ChildTrait2_t_convert := childTrait2U32_convert;
|}.
(** Trait declaration: [traits::CFnOnce]
- Source: 'src/traits.rs', lines 286:0-286:23 *)
+ Source: 'tests/src/traits.rs', lines 286:0-286: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: 'src/traits.rs', lines 292:0-292:37 *)
+ Source: 'tests/src/traits.rs', lines 292:0-292: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: 'src/traits.rs', lines 296:0-296:33 *)
+ Source: 'tests/src/traits.rs', lines 296:0-296: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: 'src/traits.rs', lines 300:0-300:18 *)
+ Source: 'tests/src/traits.rs', lines 300:0-300: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: 'src/traits.rs', lines 305:0-305:49 *)
+ Source: 'tests/src/traits.rs', lines 305:0-305: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: 'src/traits.rs', lines 310:0-310:15 *)
+ Source: 'tests/src/traits.rs', lines 310:0-310: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: 'src/traits.rs', lines 315:4-315:20 *)
+ Source: 'tests/src/traits.rs', lines 315:4-315: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: 'src/traits.rs', lines 314:0-314:40 *)
+ Source: 'tests/src/traits.rs', lines 314:0-314: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: 'src/traits.rs', lines 319:4-319:20 *)
+ Source: 'tests/src/traits.rs', lines 319:4-319: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: 'src/traits.rs', lines 318:0-318:35 *)
+ Source: 'tests/src/traits.rs', lines 318:0-318: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: 'src/traits.rs', lines 322:0-322:43 *)
+ Source: 'tests/src/traits.rs', lines 322:0-322:43 *)
Definition use_wrapper_len (T : Type) (traitInst : Trait_t T) : result usize :=
Ok (TraittraitsWrapper T traitInst).(Trait_tTrait_t_LEN)
.
(** [traits::Foo]
- Source: 'src/traits.rs', lines 326:0-326:20 *)
+ Source: 'tests/src/traits.rs', lines 326:0-326: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: 'src/traits.rs', lines 332:4-332:33 *)
+ Source: 'tests/src/traits.rs', lines 332:4-332: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: 'src/traits.rs', lines 335:0-335:48 *)
+ Source: 'tests/src/traits.rs', lines 335:0-335: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: 'src/traits.rs', lines 339:0-339:48 *)
+ Source: 'tests/src/traits.rs', lines 339:0-339:48 *)
Definition use_foo2
(T U : Type) (traitInst : Trait_t U) : result (core_result_Result_t U i32) :=
Ok (foo_foo U T traitInst)
diff --git a/tests/fstar/arrays/Arrays.Clauses.Template.fst b/tests/fstar/arrays/Arrays.Clauses.Template.fst
index 89654992..e695b89b 100644
--- a/tests/fstar/arrays/Arrays.Clauses.Template.fst
+++ b/tests/fstar/arrays/Arrays.Clauses.Template.fst
@@ -7,31 +7,31 @@ open Arrays.Types
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [arrays::sum]: decreases clause
- Source: 'src/arrays.rs', lines 242:0-250:1 *)
+ Source: 'tests/src/arrays.rs', lines 242:0-250:1 *)
unfold
let sum_loop_decreases (s : slice u32) (sum1 : u32) (i : usize) : nat =
admit ()
(** [arrays::sum2]: decreases clause
- Source: 'src/arrays.rs', lines 252:0-261:1 *)
+ Source: 'tests/src/arrays.rs', lines 252:0-261:1 *)
unfold
let sum2_loop_decreases (s : slice u32) (s2 : slice u32) (sum1 : u32)
(i : usize) : nat =
admit ()
(** [arrays::zero_slice]: decreases clause
- Source: 'src/arrays.rs', lines 303:0-310:1 *)
+ Source: 'tests/src/arrays.rs', lines 303:0-310:1 *)
unfold
let zero_slice_loop_decreases (a : slice u8) (i : usize) (len : usize) : nat =
admit ()
(** [arrays::iter_mut_slice]: decreases clause
- Source: 'src/arrays.rs', lines 312:0-318:1 *)
+ Source: 'tests/src/arrays.rs', lines 312:0-318:1 *)
unfold
let iter_mut_slice_loop_decreases (len : usize) (i : usize) : nat = admit ()
(** [arrays::sum_mut_slice]: decreases clause
- Source: 'src/arrays.rs', lines 320:0-328:1 *)
+ Source: 'tests/src/arrays.rs', lines 320:0-328:1 *)
unfold
let sum_mut_slice_loop_decreases (a : slice u32) (i : usize) (s : u32) : nat =
admit ()
diff --git a/tests/fstar/arrays/Arrays.Funs.fst b/tests/fstar/arrays/Arrays.Funs.fst
index 983b3761..6196e3b7 100644
--- a/tests/fstar/arrays/Arrays.Funs.fst
+++ b/tests/fstar/arrays/Arrays.Funs.fst
@@ -8,17 +8,17 @@ include Arrays.Clauses
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [arrays::incr]:
- Source: 'src/arrays.rs', lines 8:0-8:24 *)
+ Source: 'tests/src/arrays.rs', lines 8:0-8:24 *)
let incr (x : u32) : result u32 =
u32_add x 1
(** [arrays::array_to_shared_slice_]:
- Source: 'src/arrays.rs', lines 16:0-16:53 *)
+ Source: 'tests/src/arrays.rs', lines 16:0-16:53 *)
let array_to_shared_slice_ (t : Type0) (s : array t 32) : result (slice t) =
array_to_slice t 32 s
(** [arrays::array_to_mut_slice_]:
- Source: 'src/arrays.rs', lines 21:0-21:58 *)
+ Source: 'tests/src/arrays.rs', lines 21:0-21:58 *)
let array_to_mut_slice_
(t : Type0) (s : array t 32) :
result ((slice t) & (slice t -> result (array t 32)))
@@ -26,37 +26,37 @@ let array_to_mut_slice_
array_to_slice_mut t 32 s
(** [arrays::array_len]:
- Source: 'src/arrays.rs', lines 25:0-25:40 *)
+ Source: 'tests/src/arrays.rs', lines 25:0-25:40 *)
let array_len (t : Type0) (s : array t 32) : result usize =
let* s1 = array_to_slice t 32 s in Ok (slice_len t s1)
(** [arrays::shared_array_len]:
- Source: 'src/arrays.rs', lines 29:0-29:48 *)
+ Source: 'tests/src/arrays.rs', lines 29:0-29:48 *)
let shared_array_len (t : Type0) (s : array t 32) : result usize =
let* s1 = array_to_slice t 32 s in Ok (slice_len t s1)
(** [arrays::shared_slice_len]:
- Source: 'src/arrays.rs', lines 33:0-33:44 *)
+ Source: 'tests/src/arrays.rs', lines 33:0-33:44 *)
let shared_slice_len (t : Type0) (s : slice t) : result usize =
Ok (slice_len t s)
(** [arrays::index_array_shared]:
- Source: 'src/arrays.rs', lines 37:0-37:57 *)
+ Source: 'tests/src/arrays.rs', lines 37:0-37:57 *)
let index_array_shared (t : Type0) (s : array t 32) (i : usize) : result t =
array_index_usize t 32 s i
(** [arrays::index_array_u32]:
- Source: 'src/arrays.rs', lines 44:0-44:53 *)
+ Source: 'tests/src/arrays.rs', lines 44:0-44:53 *)
let index_array_u32 (s : array u32 32) (i : usize) : result u32 =
array_index_usize u32 32 s i
(** [arrays::index_array_copy]:
- Source: 'src/arrays.rs', lines 48:0-48:45 *)
+ Source: 'tests/src/arrays.rs', lines 48:0-48:45 *)
let index_array_copy (x : array u32 32) : result u32 =
array_index_usize u32 32 x 0
(** [arrays::index_mut_array]:
- Source: 'src/arrays.rs', lines 52:0-52:62 *)
+ Source: 'tests/src/arrays.rs', lines 52:0-52:62 *)
let index_mut_array
(t : Type0) (s : array t 32) (i : usize) :
result (t & (t -> result (array t 32)))
@@ -64,12 +64,12 @@ let index_mut_array
array_index_mut_usize t 32 s i
(** [arrays::index_slice]:
- Source: 'src/arrays.rs', lines 56:0-56:46 *)
+ Source: 'tests/src/arrays.rs', lines 56:0-56:46 *)
let index_slice (t : Type0) (s : slice t) (i : usize) : result t =
slice_index_usize t s i
(** [arrays::index_mut_slice]:
- Source: 'src/arrays.rs', lines 60:0-60:58 *)
+ Source: 'tests/src/arrays.rs', lines 60:0-60:58 *)
let index_mut_slice
(t : Type0) (s : slice t) (i : usize) :
result (t & (t -> result (slice t)))
@@ -77,7 +77,7 @@ let index_mut_slice
slice_index_mut_usize t s i
(** [arrays::slice_subslice_shared_]:
- Source: 'src/arrays.rs', lines 64:0-64:70 *)
+ Source: 'tests/src/arrays.rs', lines 64:0-64:70 *)
let slice_subslice_shared_
(x : slice u32) (y : usize) (z : usize) : result (slice u32) =
core_slice_index_Slice_index u32 (core_ops_range_Range usize)
@@ -85,7 +85,7 @@ let slice_subslice_shared_
{ start = y; end_ = z }
(** [arrays::slice_subslice_mut_]:
- Source: 'src/arrays.rs', lines 68:0-68:75 *)
+ Source: 'tests/src/arrays.rs', lines 68:0-68:75 *)
let slice_subslice_mut_
(x : slice u32) (y : usize) (z : usize) :
result ((slice u32) & (slice u32 -> result (slice u32)))
@@ -97,12 +97,12 @@ let slice_subslice_mut_
Ok (s, index_mut_back)
(** [arrays::array_to_slice_shared_]:
- Source: 'src/arrays.rs', lines 72:0-72:54 *)
+ Source: 'tests/src/arrays.rs', lines 72:0-72:54 *)
let array_to_slice_shared_ (x : array u32 32) : result (slice u32) =
array_to_slice u32 32 x
(** [arrays::array_to_slice_mut_]:
- Source: 'src/arrays.rs', lines 76:0-76:59 *)
+ Source: 'tests/src/arrays.rs', lines 76:0-76:59 *)
let array_to_slice_mut_
(x : array u32 32) :
result ((slice u32) & (slice u32 -> result (array u32 32)))
@@ -110,7 +110,7 @@ let array_to_slice_mut_
array_to_slice_mut u32 32 x
(** [arrays::array_subslice_shared_]:
- Source: 'src/arrays.rs', lines 80:0-80:74 *)
+ Source: 'tests/src/arrays.rs', lines 80:0-80:74 *)
let array_subslice_shared_
(x : array u32 32) (y : usize) (z : usize) : result (slice u32) =
core_array_Array_index u32 (core_ops_range_Range usize) 32
@@ -119,7 +119,7 @@ let array_subslice_shared_
{ start = y; end_ = z }
(** [arrays::array_subslice_mut_]:
- Source: 'src/arrays.rs', lines 84:0-84:79 *)
+ Source: 'tests/src/arrays.rs', lines 84:0-84:79 *)
let array_subslice_mut_
(x : array u32 32) (y : usize) (z : usize) :
result ((slice u32) & (slice u32 -> result (array u32 32)))
@@ -132,24 +132,24 @@ let array_subslice_mut_
Ok (s, index_mut_back)
(** [arrays::index_slice_0]:
- Source: 'src/arrays.rs', lines 88:0-88:38 *)
+ Source: 'tests/src/arrays.rs', lines 88:0-88:38 *)
let index_slice_0 (t : Type0) (s : slice t) : result t =
slice_index_usize t s 0
(** [arrays::index_array_0]:
- Source: 'src/arrays.rs', lines 92:0-92:42 *)
+ Source: 'tests/src/arrays.rs', lines 92:0-92:42 *)
let index_array_0 (t : Type0) (s : array t 32) : result t =
array_index_usize t 32 s 0
(** [arrays::index_index_array]:
- Source: 'src/arrays.rs', lines 103:0-103:71 *)
+ Source: 'tests/src/arrays.rs', lines 103:0-103:71 *)
let index_index_array
(s : array (array u32 32) 32) (i : usize) (j : usize) : result u32 =
let* a = array_index_usize (array u32 32) 32 s i in
array_index_usize u32 32 a j
(** [arrays::update_update_array]:
- Source: 'src/arrays.rs', lines 114:0-114:70 *)
+ Source: 'tests/src/arrays.rs', lines 114:0-114:70 *)
let update_update_array
(s : array (array u32 32) 32) (i : usize) (j : usize) : result unit =
let* (a, index_mut_back) = array_index_mut_usize (array u32 32) 32 s i in
@@ -159,42 +159,42 @@ let update_update_array
Ok ()
(** [arrays::array_local_deep_copy]:
- Source: 'src/arrays.rs', lines 118:0-118:43 *)
+ Source: 'tests/src/arrays.rs', lines 118:0-118:43 *)
let array_local_deep_copy (x : array u32 32) : result unit =
Ok ()
(** [arrays::take_array]:
- Source: 'src/arrays.rs', lines 122:0-122:30 *)
+ Source: 'tests/src/arrays.rs', lines 122:0-122:30 *)
let take_array (a : array u32 2) : result unit =
Ok ()
(** [arrays::take_array_borrow]:
- Source: 'src/arrays.rs', lines 123:0-123:38 *)
+ Source: 'tests/src/arrays.rs', lines 123:0-123:38 *)
let take_array_borrow (a : array u32 2) : result unit =
Ok ()
(** [arrays::take_slice]:
- Source: 'src/arrays.rs', lines 124:0-124:28 *)
+ Source: 'tests/src/arrays.rs', lines 124:0-124:28 *)
let take_slice (s : slice u32) : result unit =
Ok ()
(** [arrays::take_mut_slice]:
- Source: 'src/arrays.rs', lines 125:0-125:36 *)
+ Source: 'tests/src/arrays.rs', lines 125:0-125:36 *)
let take_mut_slice (s : slice u32) : result (slice u32) =
Ok s
(** [arrays::const_array]:
- Source: 'src/arrays.rs', lines 127:0-127:32 *)
+ Source: 'tests/src/arrays.rs', lines 127:0-127:32 *)
let const_array : result (array u32 2) =
Ok (mk_array u32 2 [ 0; 0 ])
(** [arrays::const_slice]:
- Source: 'src/arrays.rs', lines 131:0-131:20 *)
+ Source: 'tests/src/arrays.rs', lines 131:0-131:20 *)
let const_slice : result unit =
let* _ = array_to_slice u32 2 (mk_array u32 2 [ 0; 0 ]) in Ok ()
(** [arrays::take_all]:
- Source: 'src/arrays.rs', lines 141:0-141:17 *)
+ Source: 'tests/src/arrays.rs', lines 141:0-141:17 *)
let take_all : result unit =
let* _ = take_array (mk_array u32 2 [ 0; 0 ]) in
let* _ = take_array (mk_array u32 2 [ 0; 0 ]) in
@@ -208,27 +208,27 @@ let take_all : result unit =
Ok ()
(** [arrays::index_array]:
- Source: 'src/arrays.rs', lines 155:0-155:38 *)
+ Source: 'tests/src/arrays.rs', lines 155:0-155:38 *)
let index_array (x : array u32 2) : result u32 =
array_index_usize u32 2 x 0
(** [arrays::index_array_borrow]:
- Source: 'src/arrays.rs', lines 158:0-158:46 *)
+ Source: 'tests/src/arrays.rs', lines 158:0-158:46 *)
let index_array_borrow (x : array u32 2) : result u32 =
array_index_usize u32 2 x 0
(** [arrays::index_slice_u32_0]:
- Source: 'src/arrays.rs', lines 162:0-162:42 *)
+ Source: 'tests/src/arrays.rs', lines 162:0-162:42 *)
let index_slice_u32_0 (x : slice u32) : result u32 =
slice_index_usize u32 x 0
(** [arrays::index_mut_slice_u32_0]:
- Source: 'src/arrays.rs', lines 166:0-166:50 *)
+ Source: 'tests/src/arrays.rs', lines 166:0-166:50 *)
let index_mut_slice_u32_0 (x : slice u32) : result (u32 & (slice u32)) =
let* i = slice_index_usize u32 x 0 in Ok (i, x)
(** [arrays::index_all]:
- Source: 'src/arrays.rs', lines 170:0-170:25 *)
+ Source: 'tests/src/arrays.rs', lines 170:0-170:25 *)
let index_all : result u32 =
let* i = index_array (mk_array u32 2 [ 0; 0 ]) in
let* i1 = index_array (mk_array u32 2 [ 0; 0 ]) in
@@ -246,25 +246,25 @@ let index_all : result u32 =
Ok i8
(** [arrays::update_array]:
- Source: 'src/arrays.rs', lines 184:0-184:36 *)
+ Source: 'tests/src/arrays.rs', lines 184:0-184:36 *)
let update_array (x : array u32 2) : result unit =
let* (_, index_mut_back) = array_index_mut_usize u32 2 x 0 in
let* _ = index_mut_back 1 in
Ok ()
(** [arrays::update_array_mut_borrow]:
- Source: 'src/arrays.rs', lines 187:0-187:48 *)
+ Source: 'tests/src/arrays.rs', lines 187:0-187:48 *)
let update_array_mut_borrow (x : array u32 2) : result (array u32 2) =
let* (_, index_mut_back) = array_index_mut_usize u32 2 x 0 in
index_mut_back 1
(** [arrays::update_mut_slice]:
- Source: 'src/arrays.rs', lines 190:0-190:38 *)
+ Source: 'tests/src/arrays.rs', lines 190:0-190:38 *)
let update_mut_slice (x : slice u32) : result (slice u32) =
let* (_, index_mut_back) = slice_index_mut_usize u32 x 0 in index_mut_back 1
(** [arrays::update_all]:
- Source: 'src/arrays.rs', lines 194:0-194:19 *)
+ Source: 'tests/src/arrays.rs', lines 194:0-194:19 *)
let update_all : result unit =
let* _ = update_array (mk_array u32 2 [ 0; 0 ]) in
let* _ = update_array (mk_array u32 2 [ 0; 0 ]) in
@@ -275,7 +275,7 @@ let update_all : result unit =
Ok ()
(** [arrays::range_all]:
- Source: 'src/arrays.rs', lines 205:0-205:18 *)
+ Source: 'tests/src/arrays.rs', lines 205:0-205:18 *)
let range_all : result unit =
let* (s, index_mut_back) =
core_array_Array_index_mut u32 (core_ops_range_Range usize) 4
@@ -287,27 +287,27 @@ let range_all : result unit =
Ok ()
(** [arrays::deref_array_borrow]:
- Source: 'src/arrays.rs', lines 214:0-214:46 *)
+ Source: 'tests/src/arrays.rs', lines 214:0-214:46 *)
let deref_array_borrow (x : array u32 2) : result u32 =
array_index_usize u32 2 x 0
(** [arrays::deref_array_mut_borrow]:
- Source: 'src/arrays.rs', lines 219:0-219:54 *)
+ Source: 'tests/src/arrays.rs', lines 219:0-219:54 *)
let deref_array_mut_borrow (x : array u32 2) : result (u32 & (array u32 2)) =
let* i = array_index_usize u32 2 x 0 in Ok (i, x)
(** [arrays::take_array_t]:
- Source: 'src/arrays.rs', lines 227:0-227:31 *)
+ Source: 'tests/src/arrays.rs', lines 227:0-227:31 *)
let take_array_t (a : array aB_t 2) : result unit =
Ok ()
(** [arrays::non_copyable_array]:
- Source: 'src/arrays.rs', lines 229:0-229:27 *)
+ Source: 'tests/src/arrays.rs', lines 229:0-229:27 *)
let non_copyable_array : result unit =
take_array_t (mk_array aB_t 2 [ AB_A; AB_B ])
(** [arrays::sum]: loop 0:
- Source: 'src/arrays.rs', lines 242:0-250:1 *)
+ Source: 'tests/src/arrays.rs', lines 242:0-250:1 *)
let rec sum_loop
(s : slice u32) (sum1 : u32) (i : usize) :
Tot (result u32) (decreases (sum_loop_decreases s sum1 i))
@@ -322,12 +322,12 @@ let rec sum_loop
else Ok sum1
(** [arrays::sum]:
- Source: 'src/arrays.rs', lines 242:0-242:28 *)
+ Source: 'tests/src/arrays.rs', lines 242:0-242:28 *)
let sum (s : slice u32) : result u32 =
sum_loop s 0 0
(** [arrays::sum2]: loop 0:
- Source: 'src/arrays.rs', lines 252:0-261:1 *)
+ Source: 'tests/src/arrays.rs', lines 252:0-261:1 *)
let rec sum2_loop
(s : slice u32) (s2 : slice u32) (sum1 : u32) (i : usize) :
Tot (result u32) (decreases (sum2_loop_decreases s s2 sum1 i))
@@ -344,14 +344,14 @@ let rec sum2_loop
else Ok sum1
(** [arrays::sum2]:
- Source: 'src/arrays.rs', lines 252:0-252:41 *)
+ Source: 'tests/src/arrays.rs', lines 252:0-252:41 *)
let sum2 (s : slice u32) (s2 : slice u32) : result u32 =
let i = slice_len u32 s in
let i1 = slice_len u32 s2 in
if not (i = i1) then Fail Failure else sum2_loop s s2 0 0
(** [arrays::f0]:
- Source: 'src/arrays.rs', lines 263:0-263:11 *)
+ Source: 'tests/src/arrays.rs', lines 263:0-263:11 *)
let f0 : result unit =
let* (s, to_slice_mut_back) =
array_to_slice_mut u32 2 (mk_array u32 2 [ 1; 2 ]) in
@@ -361,7 +361,7 @@ let f0 : result unit =
Ok ()
(** [arrays::f1]:
- Source: 'src/arrays.rs', lines 268:0-268:11 *)
+ Source: 'tests/src/arrays.rs', lines 268:0-268:11 *)
let f1 : result unit =
let* (_, index_mut_back) =
array_index_mut_usize u32 2 (mk_array u32 2 [ 1; 2 ]) 0 in
@@ -369,12 +369,12 @@ let f1 : result unit =
Ok ()
(** [arrays::f2]:
- Source: 'src/arrays.rs', lines 273:0-273:17 *)
+ Source: 'tests/src/arrays.rs', lines 273:0-273:17 *)
let f2 (i : u32) : result unit =
Ok ()
(** [arrays::f4]:
- Source: 'src/arrays.rs', lines 282:0-282:54 *)
+ Source: 'tests/src/arrays.rs', lines 282:0-282:54 *)
let f4 (x : array u32 32) (y : usize) (z : usize) : result (slice u32) =
core_array_Array_index u32 (core_ops_range_Range usize) 32
(core_ops_index_IndexSliceTIInst u32 (core_ops_range_Range usize)
@@ -382,7 +382,7 @@ let f4 (x : array u32 32) (y : usize) (z : usize) : result (slice u32) =
{ start = y; end_ = z }
(** [arrays::f3]:
- Source: 'src/arrays.rs', lines 275:0-275:18 *)
+ Source: 'tests/src/arrays.rs', lines 275:0-275:18 *)
let f3 : result u32 =
let* i = array_index_usize u32 2 (mk_array u32 2 [ 1; 2 ]) 0 in
let* _ = f2 i in
@@ -392,17 +392,17 @@ let f3 : result u32 =
sum2 s s1
(** [arrays::SZ]
- Source: 'src/arrays.rs', lines 286:0-286:19 *)
+ Source: 'tests/src/arrays.rs', lines 286:0-286:19 *)
let sz_body : result usize = Ok 32
let sz : usize = eval_global sz_body
(** [arrays::f5]:
- Source: 'src/arrays.rs', lines 289:0-289:31 *)
+ Source: 'tests/src/arrays.rs', lines 289:0-289:31 *)
let f5 (x : array u32 32) : result u32 =
array_index_usize u32 32 x 0
(** [arrays::ite]:
- Source: 'src/arrays.rs', lines 294:0-294:12 *)
+ Source: 'tests/src/arrays.rs', lines 294:0-294:12 *)
let ite : result unit =
let* (s, to_slice_mut_back) =
array_to_slice_mut u32 2 (mk_array u32 2 [ 0; 0 ]) in
@@ -415,7 +415,7 @@ let ite : result unit =
Ok ()
(** [arrays::zero_slice]: loop 0:
- Source: 'src/arrays.rs', lines 303:0-310:1 *)
+ Source: 'tests/src/arrays.rs', lines 303:0-310:1 *)
let rec zero_slice_loop
(a : slice u8) (i : usize) (len : usize) :
Tot (result (slice u8)) (decreases (zero_slice_loop_decreases a i len))
@@ -429,12 +429,12 @@ let rec zero_slice_loop
else Ok a
(** [arrays::zero_slice]:
- Source: 'src/arrays.rs', lines 303:0-303:31 *)
+ Source: 'tests/src/arrays.rs', lines 303:0-303:31 *)
let zero_slice (a : slice u8) : result (slice u8) =
let len = slice_len u8 a in zero_slice_loop a 0 len
(** [arrays::iter_mut_slice]: loop 0:
- Source: 'src/arrays.rs', lines 312:0-318:1 *)
+ Source: 'tests/src/arrays.rs', lines 312:0-318:1 *)
let rec iter_mut_slice_loop
(len : usize) (i : usize) :
Tot (result unit) (decreases (iter_mut_slice_loop_decreases len i))
@@ -444,12 +444,12 @@ let rec iter_mut_slice_loop
else Ok ()
(** [arrays::iter_mut_slice]:
- Source: 'src/arrays.rs', lines 312:0-312:35 *)
+ Source: 'tests/src/arrays.rs', lines 312:0-312:35 *)
let iter_mut_slice (a : slice u8) : result (slice u8) =
let len = slice_len u8 a in let* _ = iter_mut_slice_loop len 0 in Ok a
(** [arrays::sum_mut_slice]: loop 0:
- Source: 'src/arrays.rs', lines 320:0-328:1 *)
+ Source: 'tests/src/arrays.rs', lines 320:0-328:1 *)
let rec sum_mut_slice_loop
(a : slice u32) (i : usize) (s : u32) :
Tot (result u32) (decreases (sum_mut_slice_loop_decreases a i s))
@@ -464,7 +464,7 @@ let rec sum_mut_slice_loop
else Ok s
(** [arrays::sum_mut_slice]:
- Source: 'src/arrays.rs', lines 320:0-320:42 *)
+ Source: 'tests/src/arrays.rs', lines 320:0-320:42 *)
let sum_mut_slice (a : slice u32) : result (u32 & (slice u32)) =
let* i = sum_mut_slice_loop a 0 0 in Ok (i, a)
diff --git a/tests/fstar/arrays/Arrays.Types.fst b/tests/fstar/arrays/Arrays.Types.fst
index d3596e92..be9c224f 100644
--- a/tests/fstar/arrays/Arrays.Types.fst
+++ b/tests/fstar/arrays/Arrays.Types.fst
@@ -6,6 +6,6 @@ open Primitives
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [arrays::AB]
- Source: 'src/arrays.rs', lines 3:0-3:11 *)
+ Source: 'tests/src/arrays.rs', lines 3:0-3:11 *)
type aB_t = | AB_A : aB_t | AB_B : aB_t
diff --git a/tests/fstar/betree_back_stateful/BetreeMain.Clauses.Template.fst b/tests/fstar/betree_back_stateful/BetreeMain.Clauses.Template.fst
deleted file mode 100644
index b317dca4..00000000
--- a/tests/fstar/betree_back_stateful/BetreeMain.Clauses.Template.fst
+++ /dev/null
@@ -1,117 +0,0 @@
-(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
-(** [betree_main]: templates for the decreases clauses *)
-module BetreeMain.Clauses.Template
-open Primitives
-open BetreeMain.Types
-
-#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
-
-(** [betree_main::betree::{betree_main::betree::List<T>#1}::len]: decreases clause
- Source: 'src/betree.rs', lines 276:4-276:24 *)
-unfold
-let betree_List_len_decreases (t : Type0) (self : betree_List_t t) : nat =
- admit ()
-
-(** [betree_main::betree::{betree_main::betree::List<T>#1}::split_at]: decreases clause
- Source: 'src/betree.rs', lines 284:4-284:51 *)
-unfold
-let betree_List_split_at_decreases (t : Type0) (self : betree_List_t t)
- (n : u64) : nat =
- admit ()
-
-(** [betree_main::betree::{betree_main::betree::List<(u64, T)>#2}::partition_at_pivot]: decreases clause
- Source: 'src/betree.rs', lines 339:4-339:73 *)
-unfold
-let betree_ListPairU64T_partition_at_pivot_decreases (t : Type0)
- (self : betree_List_t (u64 & t)) (pivot : u64) : nat =
- admit ()
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::lookup_first_message_for_key]: decreases clause
- Source: 'src/betree.rs', lines 789:4-792:34 *)
-unfold
-let betree_Node_lookup_first_message_for_key_decreases (key : u64)
- (msgs : betree_List_t (u64 & betree_Message_t)) : nat =
- admit ()
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::lookup_in_bindings]: decreases clause
- Source: 'src/betree.rs', lines 636:4-636:80 *)
-unfold
-let betree_Node_lookup_in_bindings_decreases (key : u64)
- (bindings : betree_List_t (u64 & u64)) : nat =
- admit ()
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply_upserts]: decreases clause
- Source: 'src/betree.rs', lines 819:4-819:90 *)
-unfold
-let betree_Node_apply_upserts_decreases
- (msgs : betree_List_t (u64 & betree_Message_t)) (prev : option u64)
- (key : u64) : nat =
- admit ()
-
-(** [betree_main::betree::{betree_main::betree::Internal#4}::lookup_in_children]: decreases clause
- Source: 'src/betree.rs', lines 395:4-395:63 *)
-unfold
-let betree_Internal_lookup_in_children_decreases (self : betree_Internal_t)
- (key : u64) (st : state) : nat =
- admit ()
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::lookup]: decreases clause
- Source: 'src/betree.rs', lines 709:4-709:58 *)
-unfold
-let betree_Node_lookup_decreases (self : betree_Node_t) (key : u64)
- (st : state) : nat =
- admit ()
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::filter_messages_for_key]: decreases clause
- Source: 'src/betree.rs', lines 674:4-674:77 *)
-unfold
-let betree_Node_filter_messages_for_key_decreases (key : u64)
- (msgs : betree_List_t (u64 & betree_Message_t)) : nat =
- admit ()
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::lookup_first_message_after_key]: decreases clause
- Source: 'src/betree.rs', lines 689:4-692:34 *)
-unfold
-let betree_Node_lookup_first_message_after_key_decreases (key : u64)
- (msgs : betree_List_t (u64 & betree_Message_t)) : nat =
- admit ()
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply_messages_to_internal]: decreases clause
- Source: 'src/betree.rs', lines 502:4-505:5 *)
-unfold
-let betree_Node_apply_messages_to_internal_decreases
- (msgs : betree_List_t (u64 & betree_Message_t))
- (new_msgs : betree_List_t (u64 & betree_Message_t)) : nat =
- admit ()
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::lookup_mut_in_bindings]: decreases clause
- Source: 'src/betree.rs', lines 653:4-656:32 *)
-unfold
-let betree_Node_lookup_mut_in_bindings_decreases (key : u64)
- (bindings : betree_List_t (u64 & u64)) : nat =
- admit ()
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply_messages_to_leaf]: decreases clause
- Source: 'src/betree.rs', lines 444:4-447:5 *)
-unfold
-let betree_Node_apply_messages_to_leaf_decreases
- (bindings : betree_List_t (u64 & u64))
- (new_msgs : betree_List_t (u64 & betree_Message_t)) : nat =
- admit ()
-
-(** [betree_main::betree::{betree_main::betree::Internal#4}::flush]: decreases clause
- Source: 'src/betree.rs', lines 410:4-415:26 *)
-unfold
-let betree_Internal_flush_decreases (self : betree_Internal_t)
- (params : betree_Params_t) (node_id_cnt : betree_NodeIdCounter_t)
- (content : betree_List_t (u64 & betree_Message_t)) (st : state) : nat =
- admit ()
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply_messages]: decreases clause
- Source: 'src/betree.rs', lines 588:4-593:5 *)
-unfold
-let betree_Node_apply_messages_decreases (self : betree_Node_t)
- (params : betree_Params_t) (node_id_cnt : betree_NodeIdCounter_t)
- (msgs : betree_List_t (u64 & betree_Message_t)) (st : state) : nat =
- admit ()
-
diff --git a/tests/fstar/betree_back_stateful/BetreeMain.Clauses.fst b/tests/fstar/betree_back_stateful/BetreeMain.Clauses.fst
deleted file mode 100644
index b95d4c7e..00000000
--- a/tests/fstar/betree_back_stateful/BetreeMain.Clauses.fst
+++ /dev/null
@@ -1,210 +0,0 @@
-(** [betree_main]: templates for the decreases clauses *)
-module BetreeMain.Clauses
-open Primitives
-open BetreeMain.Types
-
-#set-options "--z3rlimit 50 --fuel 0 --ifuel 1"
-
-(*** Well-founded relations *)
-
-(* We had a few issues when proving termination of the mutually recursive functions:
- * - betree_Internal_flush
- * - betree_Node_apply_messages
- *
- * The quantity which effectively decreases is:
- * (betree_size, messages_length)
- * where messages_length is 0 when there are no messages
- * (and where we use the lexicographic ordering, of course)
- *
- * However, the `%[...]` and `{:well-founded ...} notations are not available outside
- * of `decrease` clauses.
- *
- * We thus resorted to writing and proving correct a well-founded relation over
- * pairs of natural numbers. The trick is that `<<` can be used outside of decrease
- * clauses, and can be used to trigger SMT patterns.
- *
- * What follows is adapted from:
- * https://www.fstar-lang.org/tutorial/book/part2/part2_well_founded.html
- *
- * Also, the following PR might make things easier:
- * https://github.com/FStarLang/FStar/pull/2561
- *)
-
-module P = FStar.Preorder
-module W = FStar.WellFounded
-module L = FStar.LexicographicOrdering
-
-let lt_nat (x y:nat) : Type = x < y == true
-let rec wf_lt_nat (x:nat)
- : W.acc lt_nat x
- = W.AccIntro (fun y _ -> wf_lt_nat y)
-
-// A type abbreviation for a pair of nats
-let nat_pair = (x:nat & nat)
-
-// Making a lexicographic ordering from a pair of nat ordering
-let lex_order_nat_pair : P.relation nat_pair =
- L.lex_t lt_nat (fun _ -> lt_nat)
-
-// The lex order on nat pairs is well-founded, using our general proof
-// of lexicographic composition of well-founded orders
-let lex_order_nat_pair_wf : W.well_founded lex_order_nat_pair =
- L.lex_t_wf wf_lt_nat (fun _ -> wf_lt_nat)
-
-// A utility to introduce lt_nat
-let mk_lt_nat (x:nat) (y:nat { x < y }) : lt_nat x y =
- let _ : equals (x < y) true = Refl in
- ()
-
-// A utility to make a lex ordering of nat pairs
-let mk_lex_order_nat_pair (xy0:nat_pair)
- (xy1:nat_pair {
- let (|x0, y0|) = xy0 in
- let (|x1, y1|) = xy1 in
- x0 < x1 \/ (x0 == x1 /\ y0 < y1)
- }) : lex_order_nat_pair xy0 xy1 =
- let (|x0, y0|) = xy0 in
- let (|x1, y1|) = xy1 in
- if x0 < x1 then L.Left_lex x0 x1 y0 y1 (mk_lt_nat x0 x1)
- else L.Right_lex x0 y0 y1 (mk_lt_nat y0 y1)
-
-let rec coerce #a #r #x (p:W.acc #a r x) : Tot (W.acc r x) (decreases p) =
- W.AccIntro (fun y r -> coerce (p.access_smaller y r))
-
-let coerce_wf #a #r (p: (x:a -> W.acc r x)) : x:a -> W.acc r x =
- fun x -> coerce (p x)
-
-(* We need this axiom, which comes from the following discussion:
- * https://github.com/FStarLang/FStar/issues/1916
- * An issue here is that the `{well-founded ... }` notation
- *)
-assume
-val axiom_well_founded (a : Type) (rel : a -> a -> Type0)
- (rwf : W.well_founded #a rel) (x y : a) :
- Lemma (requires (rel x y)) (ensures (x << y))
-
-(* This lemma has a pattern (which makes it work) *)
-let wf_nat_pair_lem (p0 p1 : nat_pair) :
- Lemma
- (requires (
- let (|x0, y0|) = p0 in
- let (|x1, y1|) = p1 in
- x0 < x1 || (x0 = x1 && y0 < y1)))
- (ensures (p0 << p1))
- [SMTPat (p0 << p1)] =
- let rel = lex_order_nat_pair in
- let rel_wf = lex_order_nat_pair_wf in
- let _ = mk_lex_order_nat_pair p0 p1 in
- assert(rel p0 p1);
- axiom_well_founded nat_pair rel rel_wf p0 p1
-
-(*** Decrease clauses *)
-/// "Standard" decrease clauses
-
-(** [betree_main::betree::List::{1}::len]: decreases clause *)
-unfold
-let betree_List_len_decreases (t : Type0) (self : betree_List_t t) : betree_List_t t =
- self
-
-(** [betree_main::betree::List::{1}::split_at]: decreases clause *)
-unfold
-let betree_List_split_at_decreases (t : Type0) (self : betree_List_t t)
- (n : u64) : nat =
- n
-
-(** [betree_main::betree::List::{2}::partition_at_pivot]: decreases clause *)
-unfold
-let betree_ListPairU64T_partition_at_pivot_decreases (t : Type0)
- (self : betree_List_t (u64 & t)) (pivot : u64) : betree_List_t (u64 & t) =
- self
-
-(** [betree_main::betree::Node::{5}::lookup_in_bindings]: decreases clause *)
-unfold
-let betree_Node_lookup_in_bindings_decreases (key : u64)
- (bindings : betree_List_t (u64 & u64)) : betree_List_t (u64 & u64) =
- bindings
-
-(** [betree_main::betree::Node::{5}::lookup_first_message_for_key]: decreases clause *)
-unfold
-let betree_Node_lookup_first_message_for_key_decreases (key : u64)
- (msgs : betree_List_t (u64 & betree_Message_t)) : betree_List_t (u64 & betree_Message_t) =
- msgs
-
-(** [betree_main::betree::Node::{5}::apply_upserts]: decreases clause *)
-unfold
-let betree_Node_apply_upserts_decreases
- (msgs : betree_List_t (u64 & betree_Message_t)) (prev : option u64)
- (key : u64) : betree_List_t (u64 & betree_Message_t) =
- msgs
-
-(** [betree_main::betree::Internal::{4}::lookup_in_children]: decreases clause *)
-unfold
-let betree_Internal_lookup_in_children_decreases (self : betree_Internal_t)
- (key : u64) (st : state) : betree_Internal_t =
- self
-
-(** [betree_main::betree::Node::{5}::lookup]: decreases clause *)
-unfold
-let betree_Node_lookup_decreases (self : betree_Node_t) (key : u64)
- (st : state) : betree_Node_t =
- self
-
-(** [betree_main::betree::Node::{5}::lookup_mut_in_bindings]: decreases clause *)
-unfold
-let betree_Node_lookup_mut_in_bindings_decreases (key : u64)
- (bindings : betree_List_t (u64 & u64)) : betree_List_t (u64 & u64) =
- bindings
-
-unfold
-let betree_Node_apply_messages_to_leaf_decreases
- (bindings : betree_List_t (u64 & u64))
- (new_msgs : betree_List_t (u64 & betree_Message_t)) : betree_List_t (u64 & betree_Message_t) =
- new_msgs
-
-(** [betree_main::betree::Node::{5}::filter_messages_for_key]: decreases clause *)
-unfold
-let betree_Node_filter_messages_for_key_decreases (key : u64)
- (msgs : betree_List_t (u64 & betree_Message_t)) : betree_List_t (u64 & betree_Message_t) =
- msgs
-
-(** [betree_main::betree::Node::{5}::lookup_first_message_after_key]: decreases clause *)
-unfold
-let betree_Node_lookup_first_message_after_key_decreases (key : u64)
- (msgs : betree_List_t (u64 & betree_Message_t)) : betree_List_t (u64 & betree_Message_t) =
- msgs
-
-let betree_Node_apply_messages_to_internal_decreases
- (msgs : betree_List_t (u64 & betree_Message_t))
- (new_msgs : betree_List_t (u64 & betree_Message_t)) : betree_List_t (u64 & betree_Message_t) =
- new_msgs
-
-(*** Decrease clauses - nat_pair *)
-/// The following decrease clauses use the [nat_pair] definition and the well-founded
-/// relation proven above.
-
-let rec betree_size (bt : betree_Node_t) : nat =
- match bt with
- | Betree_Node_Internal node -> 1 + betree_Internal_size node
- | Betree_Node_Leaf _ -> 1
-
-and betree_Internal_size (node : betree_Internal_t) : nat =
- 1 + betree_size node.left + betree_size node.right
-
-let rec betree_List_len (#a : Type0) (ls : betree_List_t a) : nat =
- match ls with
- | Betree_List_Cons _ tl -> 1 + betree_List_len tl
- | Betree_List_Nil -> 0
-
-(** [betree_main::betree::Internal::{4}::flush]: decreases clause *)
-unfold
-let betree_Internal_flush_decreases (self : betree_Internal_t)
- (params : betree_Params_t) (node_id_cnt : betree_NodeIdCounter_t)
- (content : betree_List_t (u64 & betree_Message_t)) (st : state) : nat_pair =
- (|betree_Internal_size self, 0|)
-
-(** [betree_main::betree::Node::{5}::apply_messages]: decreases clause *)
-unfold
-let betree_Node_apply_messages_decreases (self : betree_Node_t)
- (params : betree_Params_t) (node_id_cnt : betree_NodeIdCounter_t)
- (msgs : betree_List_t (u64 & betree_Message_t)) (st : state) : nat_pair =
- (|betree_size self, betree_List_len msgs|)
diff --git a/tests/fstar/betree_back_stateful/BetreeMain.Funs.fst b/tests/fstar/betree_back_stateful/BetreeMain.Funs.fst
deleted file mode 100644
index 9942ef68..00000000
--- a/tests/fstar/betree_back_stateful/BetreeMain.Funs.fst
+++ /dev/null
@@ -1,676 +0,0 @@
-(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
-(** [betree_main]: function definitions *)
-module BetreeMain.Funs
-open Primitives
-include BetreeMain.Types
-include BetreeMain.FunsExternal
-include BetreeMain.Clauses
-
-#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
-
-(** [betree_main::betree::load_internal_node]:
- Source: 'src/betree.rs', lines 36:0-36:52 *)
-let betree_load_internal_node
- (id : u64) (st : state) :
- result (state & (betree_List_t (u64 & betree_Message_t)))
- =
- betree_utils_load_internal_node id st
-
-(** [betree_main::betree::store_internal_node]:
- Source: 'src/betree.rs', lines 41:0-41:60 *)
-let betree_store_internal_node
- (id : u64) (content : betree_List_t (u64 & betree_Message_t)) (st : state) :
- result (state & unit)
- =
- betree_utils_store_internal_node id content st
-
-(** [betree_main::betree::load_leaf_node]:
- Source: 'src/betree.rs', lines 46:0-46:44 *)
-let 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]:
- Source: 'src/betree.rs', lines 51:0-51:52 *)
-let betree_store_leaf_node
- (id : u64) (content : betree_List_t (u64 & u64)) (st : state) :
- result (state & unit)
- =
- betree_utils_store_leaf_node id content st
-
-(** [betree_main::betree::fresh_node_id]:
- Source: 'src/betree.rs', lines 55:0-55:48 *)
-let betree_fresh_node_id (counter : u64) : result (u64 & u64) =
- let* counter1 = u64_add counter 1 in Ok (counter, counter1)
-
-(** [betree_main::betree::{betree_main::betree::NodeIdCounter}::new]:
- Source: 'src/betree.rs', lines 206:4-206:20 *)
-let betree_NodeIdCounter_new : result betree_NodeIdCounter_t =
- Ok { next_node_id = 0 }
-
-(** [betree_main::betree::{betree_main::betree::NodeIdCounter}::fresh_id]:
- Source: 'src/betree.rs', lines 210:4-210:36 *)
-let betree_NodeIdCounter_fresh_id
- (self : betree_NodeIdCounter_t) : result (u64 & betree_NodeIdCounter_t) =
- let* i = u64_add self.next_node_id 1 in
- Ok (self.next_node_id, { next_node_id = i })
-
-(** [betree_main::betree::upsert_update]:
- Source: 'src/betree.rs', lines 234:0-234:70 *)
-let betree_upsert_update
- (prev : option u64) (st : betree_UpsertFunState_t) : result u64 =
- begin match prev with
- | None ->
- begin match st with
- | Betree_UpsertFunState_Add v -> Ok v
- | Betree_UpsertFunState_Sub _ -> Ok 0
- end
- | Some prev1 ->
- begin match st with
- | Betree_UpsertFunState_Add v ->
- let* margin = u64_sub core_u64_max prev1 in
- if margin >= v then u64_add prev1 v else Ok core_u64_max
- | Betree_UpsertFunState_Sub v ->
- if prev1 >= v then u64_sub prev1 v else Ok 0
- end
- end
-
-(** [betree_main::betree::{betree_main::betree::List<T>#1}::len]:
- Source: 'src/betree.rs', lines 276:4-276:24 *)
-let rec betree_List_len
- (t : Type0) (self : betree_List_t t) :
- Tot (result u64) (decreases (betree_List_len_decreases t self))
- =
- begin match self with
- | Betree_List_Cons _ tl -> let* i = betree_List_len t tl in u64_add 1 i
- | Betree_List_Nil -> Ok 0
- end
-
-(** [betree_main::betree::{betree_main::betree::List<T>#1}::split_at]:
- Source: 'src/betree.rs', lines 284:4-284:51 *)
-let rec betree_List_split_at
- (t : Type0) (self : betree_List_t t) (n : u64) :
- Tot (result ((betree_List_t t) & (betree_List_t t)))
- (decreases (betree_List_split_at_decreases t self n))
- =
- if n = 0
- then Ok (Betree_List_Nil, self)
- else
- begin match self with
- | Betree_List_Cons hd tl ->
- let* i = u64_sub n 1 in
- let* p = betree_List_split_at t tl i in
- let (ls0, ls1) = p in
- Ok (Betree_List_Cons hd ls0, ls1)
- | Betree_List_Nil -> Fail Failure
- end
-
-(** [betree_main::betree::{betree_main::betree::List<T>#1}::push_front]:
- Source: 'src/betree.rs', lines 299:4-299:34 *)
-let betree_List_push_front
- (t : Type0) (self : betree_List_t t) (x : t) : result (betree_List_t t) =
- let (tl, _) = core_mem_replace (betree_List_t t) self Betree_List_Nil in
- Ok (Betree_List_Cons x tl)
-
-(** [betree_main::betree::{betree_main::betree::List<T>#1}::pop_front]:
- Source: 'src/betree.rs', lines 306:4-306:32 *)
-let betree_List_pop_front
- (t : Type0) (self : betree_List_t t) : result (t & (betree_List_t t)) =
- let (ls, _) = core_mem_replace (betree_List_t t) self Betree_List_Nil in
- begin match ls with
- | Betree_List_Cons x tl -> Ok (x, tl)
- | Betree_List_Nil -> Fail Failure
- end
-
-(** [betree_main::betree::{betree_main::betree::List<T>#1}::hd]:
- Source: 'src/betree.rs', lines 318:4-318:22 *)
-let betree_List_hd (t : Type0) (self : betree_List_t t) : result t =
- begin match self with
- | Betree_List_Cons hd _ -> Ok hd
- | Betree_List_Nil -> Fail Failure
- end
-
-(** [betree_main::betree::{betree_main::betree::List<(u64, T)>#2}::head_has_key]:
- Source: 'src/betree.rs', lines 327:4-327:44 *)
-let betree_ListPairU64T_head_has_key
- (t : Type0) (self : betree_List_t (u64 & t)) (key : u64) : result bool =
- begin match self with
- | Betree_List_Cons hd _ -> let (i, _) = hd in Ok (i = key)
- | Betree_List_Nil -> Ok false
- end
-
-(** [betree_main::betree::{betree_main::betree::List<(u64, T)>#2}::partition_at_pivot]:
- Source: 'src/betree.rs', lines 339:4-339:73 *)
-let rec betree_ListPairU64T_partition_at_pivot
- (t : Type0) (self : betree_List_t (u64 & t)) (pivot : u64) :
- Tot (result ((betree_List_t (u64 & t)) & (betree_List_t (u64 & t))))
- (decreases (betree_ListPairU64T_partition_at_pivot_decreases t self pivot))
- =
- begin match self with
- | Betree_List_Cons hd tl ->
- let (i, x) = hd in
- if i >= pivot
- then Ok (Betree_List_Nil, Betree_List_Cons (i, x) tl)
- else
- let* p = betree_ListPairU64T_partition_at_pivot t tl pivot in
- let (ls0, ls1) = p in
- Ok (Betree_List_Cons (i, x) ls0, ls1)
- | Betree_List_Nil -> Ok (Betree_List_Nil, Betree_List_Nil)
- end
-
-(** [betree_main::betree::{betree_main::betree::Leaf#3}::split]:
- Source: 'src/betree.rs', lines 359:4-364:17 *)
-let betree_Leaf_split
- (self : betree_Leaf_t) (content : betree_List_t (u64 & u64))
- (params : betree_Params_t) (node_id_cnt : betree_NodeIdCounter_t)
- (st : state) :
- result (state & (betree_Internal_t & betree_NodeIdCounter_t))
- =
- let* p = betree_List_split_at (u64 & u64) content params.split_size in
- let (content0, content1) = p in
- let* p1 = betree_List_hd (u64 & u64) content1 in
- let (pivot, _) = p1 in
- let* (id0, node_id_cnt1) = betree_NodeIdCounter_fresh_id node_id_cnt in
- let* (id1, node_id_cnt2) = betree_NodeIdCounter_fresh_id node_id_cnt1 in
- let* (st1, _) = betree_store_leaf_node id0 content0 st in
- let* (st2, _) = betree_store_leaf_node id1 content1 st1 in
- let n = Betree_Node_Leaf { id = id0; size = params.split_size } in
- let n1 = Betree_Node_Leaf { id = id1; size = params.split_size } in
- Ok (st2, ({ id = self.id; pivot = pivot; left = n; right = n1 },
- node_id_cnt2))
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::lookup_first_message_for_key]:
- Source: 'src/betree.rs', lines 789:4-792:34 *)
-let rec betree_Node_lookup_first_message_for_key
- (key : u64) (msgs : betree_List_t (u64 & betree_Message_t)) :
- Tot (result ((betree_List_t (u64 & betree_Message_t)) & (betree_List_t (u64 &
- betree_Message_t) -> result (betree_List_t (u64 & betree_Message_t)))))
- (decreases (betree_Node_lookup_first_message_for_key_decreases key msgs))
- =
- begin match msgs with
- | Betree_List_Cons x next_msgs ->
- let (i, m) = x in
- if i >= key
- then Ok (Betree_List_Cons (i, m) next_msgs, Ok)
- else
- let* (l, lookup_first_message_for_key_back) =
- betree_Node_lookup_first_message_for_key key next_msgs in
- let back =
- fun ret ->
- let* next_msgs1 = lookup_first_message_for_key_back ret in
- Ok (Betree_List_Cons (i, m) next_msgs1) in
- Ok (l, back)
- | Betree_List_Nil -> Ok (Betree_List_Nil, Ok)
- end
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::lookup_in_bindings]:
- Source: 'src/betree.rs', lines 636:4-636:80 *)
-let rec betree_Node_lookup_in_bindings
- (key : u64) (bindings : betree_List_t (u64 & u64)) :
- Tot (result (option u64))
- (decreases (betree_Node_lookup_in_bindings_decreases key bindings))
- =
- begin match bindings with
- | Betree_List_Cons hd tl ->
- let (i, i1) = hd in
- if i = key
- then Ok (Some i1)
- else if i > key then Ok None else betree_Node_lookup_in_bindings key tl
- | Betree_List_Nil -> Ok None
- end
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply_upserts]:
- Source: 'src/betree.rs', lines 819:4-819:90 *)
-let rec betree_Node_apply_upserts
- (msgs : betree_List_t (u64 & betree_Message_t)) (prev : option u64)
- (key : u64) :
- Tot (result (u64 & (betree_List_t (u64 & betree_Message_t))))
- (decreases (betree_Node_apply_upserts_decreases msgs prev key))
- =
- let* b = betree_ListPairU64T_head_has_key betree_Message_t msgs key in
- if b
- then
- let* (msg, msgs1) = betree_List_pop_front (u64 & betree_Message_t) msgs in
- let (_, m) = msg in
- begin match m with
- | Betree_Message_Insert _ -> Fail Failure
- | Betree_Message_Delete -> Fail Failure
- | Betree_Message_Upsert s ->
- let* v = betree_upsert_update prev s in
- betree_Node_apply_upserts msgs1 (Some v) key
- end
- else
- let* v = core_option_Option_unwrap u64 prev in
- let* msgs1 =
- betree_List_push_front (u64 & betree_Message_t) msgs (key,
- Betree_Message_Insert v) in
- Ok (v, msgs1)
-
-(** [betree_main::betree::{betree_main::betree::Internal#4}::lookup_in_children]:
- Source: 'src/betree.rs', lines 395:4-395:63 *)
-let rec betree_Internal_lookup_in_children
- (self : betree_Internal_t) (key : u64) (st : state) :
- Tot (result (state & ((option u64) & betree_Internal_t)))
- (decreases (betree_Internal_lookup_in_children_decreases self key st))
- =
- if key < self.pivot
- then
- let* (st1, (o, n)) = betree_Node_lookup self.left key st in
- Ok (st1, (o, { self with left = n }))
- else
- let* (st1, (o, n)) = betree_Node_lookup self.right key st in
- Ok (st1, (o, { self with right = n }))
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::lookup]:
- Source: 'src/betree.rs', lines 709:4-709:58 *)
-and betree_Node_lookup
- (self : betree_Node_t) (key : u64) (st : state) :
- Tot (result (state & ((option u64) & betree_Node_t)))
- (decreases (betree_Node_lookup_decreases self key st))
- =
- begin match self with
- | Betree_Node_Internal node ->
- let* (st1, msgs) = betree_load_internal_node node.id st in
- let* (pending, lookup_first_message_for_key_back) =
- betree_Node_lookup_first_message_for_key key msgs in
- begin match pending with
- | Betree_List_Cons p l ->
- let (k, msg) = p in
- if k <> key
- then
- let* (st2, (o, node1)) =
- betree_Internal_lookup_in_children node key st1 in
- let* _ =
- lookup_first_message_for_key_back (Betree_List_Cons (k, msg) l) in
- Ok (st2, (o, Betree_Node_Internal node1))
- else
- begin match msg with
- | Betree_Message_Insert v ->
- let* _ =
- lookup_first_message_for_key_back (Betree_List_Cons (k,
- Betree_Message_Insert v) l) in
- Ok (st1, (Some v, Betree_Node_Internal node))
- | Betree_Message_Delete ->
- let* _ =
- lookup_first_message_for_key_back (Betree_List_Cons (k,
- Betree_Message_Delete) l) in
- Ok (st1, (None, Betree_Node_Internal node))
- | Betree_Message_Upsert ufs ->
- let* (st2, (v, node1)) =
- betree_Internal_lookup_in_children node key st1 in
- let* (v1, pending1) =
- betree_Node_apply_upserts (Betree_List_Cons (k,
- Betree_Message_Upsert ufs) l) v key in
- let* msgs1 = lookup_first_message_for_key_back pending1 in
- let* (st3, _) = betree_store_internal_node node1.id msgs1 st2 in
- Ok (st3, (Some v1, Betree_Node_Internal node1))
- end
- | Betree_List_Nil ->
- let* (st2, (o, node1)) = betree_Internal_lookup_in_children node key st1
- in
- let* _ = lookup_first_message_for_key_back Betree_List_Nil in
- Ok (st2, (o, Betree_Node_Internal node1))
- end
- | Betree_Node_Leaf node ->
- let* (st1, bindings) = betree_load_leaf_node node.id st in
- let* o = betree_Node_lookup_in_bindings key bindings in
- Ok (st1, (o, Betree_Node_Leaf node))
- end
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::filter_messages_for_key]:
- Source: 'src/betree.rs', lines 674:4-674:77 *)
-let rec betree_Node_filter_messages_for_key
- (key : u64) (msgs : betree_List_t (u64 & betree_Message_t)) :
- Tot (result (betree_List_t (u64 & betree_Message_t)))
- (decreases (betree_Node_filter_messages_for_key_decreases key msgs))
- =
- begin match msgs with
- | Betree_List_Cons p l ->
- let (k, m) = p in
- if k = key
- then
- let* (_, msgs1) =
- betree_List_pop_front (u64 & betree_Message_t) (Betree_List_Cons (k, m)
- l) in
- betree_Node_filter_messages_for_key key msgs1
- else Ok (Betree_List_Cons (k, m) l)
- | Betree_List_Nil -> Ok Betree_List_Nil
- end
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::lookup_first_message_after_key]:
- Source: 'src/betree.rs', lines 689:4-692:34 *)
-let rec betree_Node_lookup_first_message_after_key
- (key : u64) (msgs : betree_List_t (u64 & betree_Message_t)) :
- Tot (result ((betree_List_t (u64 & betree_Message_t)) & (betree_List_t (u64 &
- betree_Message_t) -> result (betree_List_t (u64 & betree_Message_t)))))
- (decreases (betree_Node_lookup_first_message_after_key_decreases key msgs))
- =
- begin match msgs with
- | Betree_List_Cons p next_msgs ->
- let (k, m) = p in
- if k = key
- then
- let* (l, lookup_first_message_after_key_back) =
- betree_Node_lookup_first_message_after_key key next_msgs in
- let back =
- fun ret ->
- let* next_msgs1 = lookup_first_message_after_key_back ret in
- Ok (Betree_List_Cons (k, m) next_msgs1) in
- Ok (l, back)
- else Ok (Betree_List_Cons (k, m) next_msgs, Ok)
- | Betree_List_Nil -> Ok (Betree_List_Nil, Ok)
- end
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply_to_internal]:
- Source: 'src/betree.rs', lines 521:4-521:89 *)
-let betree_Node_apply_to_internal
- (msgs : betree_List_t (u64 & betree_Message_t)) (key : u64)
- (new_msg : betree_Message_t) :
- result (betree_List_t (u64 & betree_Message_t))
- =
- let* (msgs1, lookup_first_message_for_key_back) =
- betree_Node_lookup_first_message_for_key key msgs in
- let* b = betree_ListPairU64T_head_has_key betree_Message_t msgs1 key in
- if b
- then
- begin match new_msg with
- | Betree_Message_Insert i ->
- let* msgs2 = betree_Node_filter_messages_for_key key msgs1 in
- let* msgs3 =
- betree_List_push_front (u64 & betree_Message_t) msgs2 (key,
- Betree_Message_Insert i) in
- lookup_first_message_for_key_back msgs3
- | Betree_Message_Delete ->
- let* msgs2 = betree_Node_filter_messages_for_key key msgs1 in
- let* msgs3 =
- betree_List_push_front (u64 & betree_Message_t) msgs2 (key,
- Betree_Message_Delete) in
- lookup_first_message_for_key_back msgs3
- | Betree_Message_Upsert s ->
- let* p = betree_List_hd (u64 & betree_Message_t) msgs1 in
- let (_, m) = p in
- begin match m with
- | Betree_Message_Insert prev ->
- let* v = betree_upsert_update (Some prev) s in
- let* (_, msgs2) = betree_List_pop_front (u64 & betree_Message_t) msgs1
- in
- let* msgs3 =
- betree_List_push_front (u64 & betree_Message_t) msgs2 (key,
- Betree_Message_Insert v) in
- lookup_first_message_for_key_back msgs3
- | Betree_Message_Delete ->
- let* (_, msgs2) = betree_List_pop_front (u64 & betree_Message_t) msgs1
- in
- let* v = betree_upsert_update None s in
- let* msgs3 =
- betree_List_push_front (u64 & betree_Message_t) msgs2 (key,
- Betree_Message_Insert v) in
- lookup_first_message_for_key_back msgs3
- | Betree_Message_Upsert _ ->
- let* (msgs2, lookup_first_message_after_key_back) =
- betree_Node_lookup_first_message_after_key key msgs1 in
- let* msgs3 =
- betree_List_push_front (u64 & betree_Message_t) msgs2 (key,
- Betree_Message_Upsert s) in
- let* msgs4 = lookup_first_message_after_key_back msgs3 in
- lookup_first_message_for_key_back msgs4
- end
- end
- else
- let* msgs2 =
- betree_List_push_front (u64 & betree_Message_t) msgs1 (key, new_msg) in
- lookup_first_message_for_key_back msgs2
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply_messages_to_internal]:
- Source: 'src/betree.rs', lines 502:4-505:5 *)
-let rec betree_Node_apply_messages_to_internal
- (msgs : betree_List_t (u64 & betree_Message_t))
- (new_msgs : betree_List_t (u64 & betree_Message_t)) :
- Tot (result (betree_List_t (u64 & betree_Message_t)))
- (decreases (betree_Node_apply_messages_to_internal_decreases msgs new_msgs))
- =
- begin match new_msgs with
- | Betree_List_Cons new_msg new_msgs_tl ->
- let (i, m) = new_msg in
- let* msgs1 = betree_Node_apply_to_internal msgs i m in
- betree_Node_apply_messages_to_internal msgs1 new_msgs_tl
- | Betree_List_Nil -> Ok msgs
- end
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::lookup_mut_in_bindings]:
- Source: 'src/betree.rs', lines 653:4-656:32 *)
-let rec betree_Node_lookup_mut_in_bindings
- (key : u64) (bindings : betree_List_t (u64 & u64)) :
- Tot (result ((betree_List_t (u64 & u64)) & (betree_List_t (u64 & u64) ->
- result (betree_List_t (u64 & u64)))))
- (decreases (betree_Node_lookup_mut_in_bindings_decreases key bindings))
- =
- begin match bindings with
- | Betree_List_Cons hd tl ->
- let (i, i1) = hd in
- if i >= key
- then Ok (Betree_List_Cons (i, i1) tl, Ok)
- else
- let* (l, lookup_mut_in_bindings_back) =
- betree_Node_lookup_mut_in_bindings key tl in
- let back =
- fun ret ->
- let* tl1 = lookup_mut_in_bindings_back ret in
- Ok (Betree_List_Cons (i, i1) tl1) in
- Ok (l, back)
- | Betree_List_Nil -> Ok (Betree_List_Nil, Ok)
- end
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply_to_leaf]:
- Source: 'src/betree.rs', lines 460:4-460:87 *)
-let betree_Node_apply_to_leaf
- (bindings : betree_List_t (u64 & u64)) (key : u64)
- (new_msg : betree_Message_t) :
- result (betree_List_t (u64 & u64))
- =
- let* (bindings1, lookup_mut_in_bindings_back) =
- betree_Node_lookup_mut_in_bindings key bindings in
- let* b = betree_ListPairU64T_head_has_key u64 bindings1 key in
- if b
- then
- let* (hd, bindings2) = betree_List_pop_front (u64 & u64) bindings1 in
- begin match new_msg with
- | Betree_Message_Insert v ->
- let* bindings3 = betree_List_push_front (u64 & u64) bindings2 (key, v) in
- lookup_mut_in_bindings_back bindings3
- | Betree_Message_Delete -> lookup_mut_in_bindings_back bindings2
- | Betree_Message_Upsert s ->
- let (_, i) = hd in
- let* v = betree_upsert_update (Some i) s in
- let* bindings3 = betree_List_push_front (u64 & u64) bindings2 (key, v) in
- lookup_mut_in_bindings_back bindings3
- end
- else
- begin match new_msg with
- | Betree_Message_Insert v ->
- let* bindings2 = betree_List_push_front (u64 & u64) bindings1 (key, v) in
- lookup_mut_in_bindings_back bindings2
- | Betree_Message_Delete -> lookup_mut_in_bindings_back bindings1
- | Betree_Message_Upsert s ->
- let* v = betree_upsert_update None s in
- let* bindings2 = betree_List_push_front (u64 & u64) bindings1 (key, v) in
- lookup_mut_in_bindings_back bindings2
- end
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply_messages_to_leaf]:
- Source: 'src/betree.rs', lines 444:4-447:5 *)
-let rec betree_Node_apply_messages_to_leaf
- (bindings : betree_List_t (u64 & u64))
- (new_msgs : betree_List_t (u64 & betree_Message_t)) :
- Tot (result (betree_List_t (u64 & u64)))
- (decreases (betree_Node_apply_messages_to_leaf_decreases bindings new_msgs))
- =
- begin match new_msgs with
- | Betree_List_Cons new_msg new_msgs_tl ->
- let (i, m) = new_msg in
- let* bindings1 = betree_Node_apply_to_leaf bindings i m in
- betree_Node_apply_messages_to_leaf bindings1 new_msgs_tl
- | Betree_List_Nil -> Ok bindings
- end
-
-(** [betree_main::betree::{betree_main::betree::Internal#4}::flush]:
- Source: 'src/betree.rs', lines 410:4-415:26 *)
-let rec betree_Internal_flush
- (self : betree_Internal_t) (params : betree_Params_t)
- (node_id_cnt : betree_NodeIdCounter_t)
- (content : betree_List_t (u64 & betree_Message_t)) (st : state) :
- Tot (result (state & ((betree_List_t (u64 & betree_Message_t)) &
- (betree_Internal_t & betree_NodeIdCounter_t))))
- (decreases (
- betree_Internal_flush_decreases self params node_id_cnt content st))
- =
- let* p =
- betree_ListPairU64T_partition_at_pivot betree_Message_t content self.pivot
- in
- let (msgs_left, msgs_right) = p in
- let* len_left = betree_List_len (u64 & betree_Message_t) msgs_left in
- if len_left >= params.min_flush_size
- then
- let* (st1, p1) =
- betree_Node_apply_messages self.left params node_id_cnt msgs_left st in
- let (n, node_id_cnt1) = p1 in
- let* len_right = betree_List_len (u64 & betree_Message_t) msgs_right in
- if len_right >= params.min_flush_size
- then
- let* (st2, p2) =
- betree_Node_apply_messages self.right params node_id_cnt1 msgs_right
- st1 in
- let (n1, node_id_cnt2) = p2 in
- Ok (st2, (Betree_List_Nil, ({ self with left = n; right = n1 },
- node_id_cnt2)))
- else Ok (st1, (msgs_right, ({ self with left = n }, node_id_cnt1)))
- else
- let* (st1, p1) =
- betree_Node_apply_messages self.right params node_id_cnt msgs_right st in
- let (n, node_id_cnt1) = p1 in
- Ok (st1, (msgs_left, ({ self with right = n }, node_id_cnt1)))
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply_messages]:
- Source: 'src/betree.rs', lines 588:4-593:5 *)
-and betree_Node_apply_messages
- (self : betree_Node_t) (params : betree_Params_t)
- (node_id_cnt : betree_NodeIdCounter_t)
- (msgs : betree_List_t (u64 & betree_Message_t)) (st : state) :
- Tot (result (state & (betree_Node_t & betree_NodeIdCounter_t)))
- (decreases (
- betree_Node_apply_messages_decreases self params node_id_cnt msgs st))
- =
- begin match self with
- | Betree_Node_Internal node ->
- let* (st1, content) = betree_load_internal_node node.id st in
- let* content1 = betree_Node_apply_messages_to_internal content msgs in
- let* num_msgs = betree_List_len (u64 & betree_Message_t) content1 in
- if num_msgs >= params.min_flush_size
- then
- let* (st2, (content2, p)) =
- betree_Internal_flush node params node_id_cnt content1 st1 in
- let (node1, node_id_cnt1) = p in
- let* (st3, _) = betree_store_internal_node node1.id content2 st2 in
- Ok (st3, (Betree_Node_Internal node1, node_id_cnt1))
- else
- let* (st2, _) = betree_store_internal_node node.id content1 st1 in
- Ok (st2, (Betree_Node_Internal node, node_id_cnt))
- | Betree_Node_Leaf node ->
- let* (st1, content) = betree_load_leaf_node node.id st in
- let* content1 = betree_Node_apply_messages_to_leaf content msgs in
- let* len = betree_List_len (u64 & u64) content1 in
- let* i = u64_mul 2 params.split_size in
- if len >= i
- then
- let* (st2, (new_node, node_id_cnt1)) =
- betree_Leaf_split node content1 params node_id_cnt st1 in
- let* (st3, _) = betree_store_leaf_node node.id Betree_List_Nil st2 in
- Ok (st3, (Betree_Node_Internal new_node, node_id_cnt1))
- else
- let* (st2, _) = betree_store_leaf_node node.id content1 st1 in
- Ok (st2, (Betree_Node_Leaf { node with size = len }, node_id_cnt))
- end
-
-(** [betree_main::betree::{betree_main::betree::Node#5}::apply]:
- Source: 'src/betree.rs', lines 576:4-582:5 *)
-let betree_Node_apply
- (self : betree_Node_t) (params : betree_Params_t)
- (node_id_cnt : betree_NodeIdCounter_t) (key : u64)
- (new_msg : betree_Message_t) (st : state) :
- result (state & (betree_Node_t & betree_NodeIdCounter_t))
- =
- let* (st1, p) =
- betree_Node_apply_messages self params node_id_cnt (Betree_List_Cons (key,
- new_msg) Betree_List_Nil) st in
- let (self1, node_id_cnt1) = p in
- Ok (st1, (self1, node_id_cnt1))
-
-(** [betree_main::betree::{betree_main::betree::BeTree#6}::new]:
- Source: 'src/betree.rs', lines 849:4-849:60 *)
-let betree_BeTree_new
- (min_flush_size : u64) (split_size : u64) (st : state) :
- result (state & betree_BeTree_t)
- =
- let* node_id_cnt = betree_NodeIdCounter_new in
- let* (id, node_id_cnt1) = betree_NodeIdCounter_fresh_id node_id_cnt in
- let* (st1, _) = betree_store_leaf_node id Betree_List_Nil st in
- Ok (st1,
- {
- params = { min_flush_size = min_flush_size; split_size = split_size };
- node_id_cnt = node_id_cnt1;
- root = (Betree_Node_Leaf { id = id; size = 0 })
- })
-
-(** [betree_main::betree::{betree_main::betree::BeTree#6}::apply]:
- Source: 'src/betree.rs', lines 868:4-868:47 *)
-let betree_BeTree_apply
- (self : betree_BeTree_t) (key : u64) (msg : betree_Message_t) (st : state) :
- result (state & betree_BeTree_t)
- =
- let* (st1, p) =
- betree_Node_apply self.root self.params self.node_id_cnt key msg st in
- let (n, nic) = p in
- Ok (st1, { self with node_id_cnt = nic; root = n })
-
-(** [betree_main::betree::{betree_main::betree::BeTree#6}::insert]:
- Source: 'src/betree.rs', lines 874:4-874:52 *)
-let betree_BeTree_insert
- (self : betree_BeTree_t) (key : u64) (value : u64) (st : state) :
- result (state & betree_BeTree_t)
- =
- betree_BeTree_apply self key (Betree_Message_Insert value) st
-
-(** [betree_main::betree::{betree_main::betree::BeTree#6}::delete]:
- Source: 'src/betree.rs', lines 880:4-880:38 *)
-let betree_BeTree_delete
- (self : betree_BeTree_t) (key : u64) (st : state) :
- result (state & betree_BeTree_t)
- =
- betree_BeTree_apply self key Betree_Message_Delete st
-
-(** [betree_main::betree::{betree_main::betree::BeTree#6}::upsert]:
- Source: 'src/betree.rs', lines 886:4-886:59 *)
-let betree_BeTree_upsert
- (self : betree_BeTree_t) (key : u64) (upd : betree_UpsertFunState_t)
- (st : state) :
- result (state & betree_BeTree_t)
- =
- betree_BeTree_apply self key (Betree_Message_Upsert upd) st
-
-(** [betree_main::betree::{betree_main::betree::BeTree#6}::lookup]:
- Source: 'src/betree.rs', lines 895:4-895:62 *)
-let betree_BeTree_lookup
- (self : betree_BeTree_t) (key : u64) (st : state) :
- result (state & ((option u64) & betree_BeTree_t))
- =
- let* (st1, (o, n)) = betree_Node_lookup self.root key st in
- Ok (st1, (o, { self with root = n }))
-
-(** [betree_main::main]:
- Source: 'src/main.rs', lines 4:0-4:9 *)
-let main : result unit =
- Ok ()
-
-(** Unit test for [betree_main::main] *)
-let _ = assert_norm (main = Ok ())
-
diff --git a/tests/fstar/betree_back_stateful/BetreeMain.FunsExternal.fsti b/tests/fstar/betree_back_stateful/BetreeMain.FunsExternal.fsti
deleted file mode 100644
index 8be98acf..00000000
--- a/tests/fstar/betree_back_stateful/BetreeMain.FunsExternal.fsti
+++ /dev/null
@@ -1,30 +0,0 @@
-(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
-(** [betree_main]: external function declarations *)
-module BetreeMain.FunsExternal
-open Primitives
-include BetreeMain.Types
-
-#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
-
-(** [betree_main::betree_utils::load_internal_node]:
- Source: 'src/betree_utils.rs', lines 98:0-98:63 *)
-val betree_utils_load_internal_node
- : u64 -> state -> result (state & (betree_List_t (u64 & betree_Message_t)))
-
-(** [betree_main::betree_utils::store_internal_node]:
- Source: 'src/betree_utils.rs', lines 115:0-115:71 *)
-val betree_utils_store_internal_node
- :
- u64 -> betree_List_t (u64 & betree_Message_t) -> state -> result (state &
- unit)
-
-(** [betree_main::betree_utils::load_leaf_node]:
- Source: 'src/betree_utils.rs', lines 132:0-132:55 *)
-val betree_utils_load_leaf_node
- : u64 -> state -> result (state & (betree_List_t (u64 & u64)))
-
-(** [betree_main::betree_utils::store_leaf_node]:
- Source: 'src/betree_utils.rs', lines 145:0-145:63 *)
-val betree_utils_store_leaf_node
- : u64 -> betree_List_t (u64 & u64) -> state -> result (state & unit)
-
diff --git a/tests/fstar/betree_back_stateful/BetreeMain.Types.fst b/tests/fstar/betree_back_stateful/BetreeMain.Types.fst
deleted file mode 100644
index b87219b2..00000000
--- a/tests/fstar/betree_back_stateful/BetreeMain.Types.fst
+++ /dev/null
@@ -1,61 +0,0 @@
-(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
-(** [betree_main]: type definitions *)
-module BetreeMain.Types
-open Primitives
-include BetreeMain.TypesExternal
-
-#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
-
-(** [betree_main::betree::List]
- Source: 'src/betree.rs', lines 17:0-17:23 *)
-type betree_List_t (t : Type0) =
-| Betree_List_Cons : t -> betree_List_t t -> betree_List_t t
-| Betree_List_Nil : betree_List_t t
-
-(** [betree_main::betree::UpsertFunState]
- Source: 'src/betree.rs', lines 63:0-63:23 *)
-type betree_UpsertFunState_t =
-| Betree_UpsertFunState_Add : u64 -> betree_UpsertFunState_t
-| Betree_UpsertFunState_Sub : u64 -> betree_UpsertFunState_t
-
-(** [betree_main::betree::Message]
- Source: 'src/betree.rs', lines 69:0-69:23 *)
-type betree_Message_t =
-| Betree_Message_Insert : u64 -> betree_Message_t
-| Betree_Message_Delete : betree_Message_t
-| Betree_Message_Upsert : betree_UpsertFunState_t -> betree_Message_t
-
-(** [betree_main::betree::Leaf]
- Source: 'src/betree.rs', lines 167:0-167:11 *)
-type betree_Leaf_t = { id : u64; size : u64; }
-
-(** [betree_main::betree::Internal]
- Source: 'src/betree.rs', lines 156:0-156:15 *)
-type betree_Internal_t =
-{
- id : u64; pivot : u64; left : betree_Node_t; right : betree_Node_t;
-}
-
-(** [betree_main::betree::Node]
- Source: 'src/betree.rs', lines 179:0-179:9 *)
-and betree_Node_t =
-| Betree_Node_Internal : betree_Internal_t -> betree_Node_t
-| Betree_Node_Leaf : betree_Leaf_t -> betree_Node_t
-
-(** [betree_main::betree::Params]
- Source: 'src/betree.rs', lines 187:0-187:13 *)
-type betree_Params_t = { min_flush_size : u64; split_size : u64; }
-
-(** [betree_main::betree::NodeIdCounter]
- Source: 'src/betree.rs', lines 201:0-201:20 *)
-type betree_NodeIdCounter_t = { next_node_id : u64; }
-
-(** [betree_main::betree::BeTree]
- Source: 'src/betree.rs', lines 218:0-218:17 *)
-type betree_BeTree_t =
-{
- params : betree_Params_t;
- node_id_cnt : betree_NodeIdCounter_t;
- root : betree_Node_t;
-}
-
diff --git a/tests/fstar/betree_back_stateful/BetreeMain.TypesExternal.fsti b/tests/fstar/betree_back_stateful/BetreeMain.TypesExternal.fsti
deleted file mode 100644
index 1b2c53a6..00000000
--- a/tests/fstar/betree_back_stateful/BetreeMain.TypesExternal.fsti
+++ /dev/null
@@ -1,10 +0,0 @@
-(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
-(** [betree_main]: external type declarations *)
-module BetreeMain.TypesExternal
-open Primitives
-
-#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
-
-(** The state type used in the state-error monad *)
-val state : Type0
-
diff --git a/tests/fstar/betree_back_stateful/Makefile b/tests/fstar/betree_back_stateful/Makefile
deleted file mode 100644
index fa7d1f36..00000000
--- a/tests/fstar/betree_back_stateful/Makefile
+++ /dev/null
@@ -1,49 +0,0 @@
-# This file was automatically generated - modify ../Makefile.template instead
-INCLUDE_DIRS = .
-
-FSTAR_INCLUDES = $(addprefix --include ,$(INCLUDE_DIRS))
-
-FSTAR_HINTS ?= --use_hints --use_hint_hashes --record_hints
-
-FSTAR_OPTIONS = $(FSTAR_HINTS) \
- --cache_checked_modules $(FSTAR_INCLUDES) --cmi \
- --warn_error '+241@247+285-274' \
-
-FSTAR_EXE ?= fstar.exe
-FSTAR_NO_FLAGS = $(FSTAR_EXE) --already_cached 'Prims FStar LowStar Steel' --odir obj --cache_dir obj
-
-FSTAR = $(FSTAR_NO_FLAGS) $(FSTAR_OPTIONS)
-
-# The F* roots are used to compute the dependency graph, and generate the .depend file
-FSTAR_ROOTS ?= $(wildcard *.fst *.fsti)
-
-# Build all the files
-all: $(addprefix obj/,$(addsuffix .checked,$(FSTAR_ROOTS)))
-
-# This is the right way to ensure the .depend file always gets re-built.
-ifeq (,$(filter %-in,$(MAKECMDGOALS)))
-ifndef NODEPEND
-ifndef MAKE_RESTARTS
-.depend: .FORCE
- $(FSTAR_NO_FLAGS) --dep full $(notdir $(FSTAR_ROOTS)) > $@
-
-.PHONY: .FORCE
-.FORCE:
-endif
-endif
-
-include .depend
-endif
-
-# For the interactive mode
-%.fst-in %.fsti-in:
- @echo $(FSTAR_OPTIONS)
-
-# Generete the .checked files in batch mode
-%.checked:
- $(FSTAR) $(FSTAR_OPTIONS) $< && \
- touch -c $@
-
-.PHONY: clean
-clean:
- rm -f obj/*
diff --git a/tests/fstar/betree_back_stateful/Primitives.fst b/tests/fstar/betree_back_stateful/Primitives.fst
deleted file mode 100644
index 9951ccc3..00000000
--- a/tests/fstar/betree_back_stateful/Primitives.fst
+++ /dev/null
@@ -1,929 +0,0 @@
-/// This file lists primitive and assumed functions and types
-module Primitives
-open FStar.Mul
-open FStar.List.Tot
-
-#set-options "--z3rlimit 15 --fuel 0 --ifuel 1"
-
-(*** Utilities *)
-val list_update (#a : Type0) (ls : list a) (i : nat{i < length ls}) (x : a) :
- ls':list a{
- length ls' = length ls /\
- index ls' i == x
- }
-#push-options "--fuel 1"
-let rec list_update #a ls i x =
- match ls with
- | x' :: ls -> if i = 0 then x :: ls else x' :: list_update ls (i-1) x
-#pop-options
-
-(*** Result *)
-type error : Type0 =
-| Failure
-| OutOfFuel
-
-type result (a : Type0) : Type0 =
-| Ok : v:a -> result a
-| Fail : e:error -> result a
-
-// Monadic return operator
-unfold let return (#a : Type0) (x : a) : result a = Ok x
-
-// Monadic bind operator.
-// Allows to use the notation:
-// ```
-// let* x = y in
-// ...
-// ```
-unfold let (let*) (#a #b : Type0) (m: result a)
- (f: (x:a) -> Pure (result b) (requires (m == Ok x)) (ensures fun _ -> True)) :
- result b =
- match m with
- | Ok x -> f x
- | Fail e -> Fail e
-
-// Monadic assert(...)
-let massert (b:bool) : result unit = if b then Ok () else Fail Failure
-
-// Normalize and unwrap a successful result (used for globals).
-let eval_global (#a : Type0) (x : result a{Ok? (normalize_term x)}) : a = Ok?.v x
-
-(*** Misc *)
-type char = FStar.Char.char
-type string = string
-
-let is_zero (n: nat) : bool = n = 0
-let decrease (n: nat{n > 0}) : nat = n - 1
-
-let core_mem_replace (a : Type0) (x : a) (y : a) : a & a = (x, x)
-
-// We don't really use raw pointers for now
-type mut_raw_ptr (t : Type0) = { v : t }
-type const_raw_ptr (t : Type0) = { v : t }
-
-(*** Scalars *)
-/// Rem.: most of the following code was partially generated
-
-assume val size_numbits : pos
-
-// TODO: we could use FStar.Int.int_t and FStar.UInt.int_t
-
-let isize_min : int = -9223372036854775808 // TODO: should be opaque
-let isize_max : int = 9223372036854775807 // TODO: should be opaque
-let i8_min : int = -128
-let i8_max : int = 127
-let i16_min : int = -32768
-let i16_max : int = 32767
-let i32_min : int = -2147483648
-let i32_max : int = 2147483647
-let i64_min : int = -9223372036854775808
-let i64_max : int = 9223372036854775807
-let i128_min : int = -170141183460469231731687303715884105728
-let i128_max : int = 170141183460469231731687303715884105727
-let usize_min : int = 0
-let usize_max : int = 4294967295 // TODO: should be opaque
-let u8_min : int = 0
-let u8_max : int = 255
-let u16_min : int = 0
-let u16_max : int = 65535
-let u32_min : int = 0
-let u32_max : int = 4294967295
-let u64_min : int = 0
-let u64_max : int = 18446744073709551615
-let u128_min : int = 0
-let u128_max : int = 340282366920938463463374607431768211455
-
-type scalar_ty =
-| Isize
-| I8
-| I16
-| I32
-| I64
-| I128
-| Usize
-| U8
-| U16
-| U32
-| U64
-| U128
-
-let is_unsigned = function
- | Isize | I8 | I16 | I32 | I64 | I128 -> false
- | Usize | U8 | U16 | U32 | U64 | U128 -> true
-
-let scalar_min (ty : scalar_ty) : int =
- 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
-
-let scalar_max (ty : scalar_ty) : int =
- 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
-
-type scalar (ty : scalar_ty) : eqtype = x:int{scalar_min ty <= x && x <= scalar_max ty}
-
-let mk_scalar (ty : scalar_ty) (x : int) : result (scalar ty) =
- if scalar_min ty <= x && scalar_max ty >= x then Ok x else Fail Failure
-
-let scalar_neg (#ty : scalar_ty) (x : scalar ty) : result (scalar ty) = mk_scalar ty (-x)
-
-let scalar_div (#ty : scalar_ty) (x : scalar ty) (y : scalar ty) : result (scalar ty) =
- if y <> 0 then mk_scalar ty (x / y) else Fail Failure
-
-/// The remainder operation
-let int_rem (x : int) (y : int{y <> 0}) : int =
- if x >= 0 then (x % y) else -(x % y)
-
-(* Checking consistency with Rust *)
-let _ = assert_norm(int_rem 1 2 = 1)
-let _ = assert_norm(int_rem (-1) 2 = -1)
-let _ = assert_norm(int_rem 1 (-2) = 1)
-let _ = assert_norm(int_rem (-1) (-2) = -1)
-
-let scalar_rem (#ty : scalar_ty) (x : scalar ty) (y : scalar ty) : result (scalar ty) =
- if y <> 0 then mk_scalar ty (int_rem x y) else Fail Failure
-
-let scalar_add (#ty : scalar_ty) (x : scalar ty) (y : scalar ty) : result (scalar ty) =
- mk_scalar ty (x + y)
-
-let scalar_sub (#ty : scalar_ty) (x : scalar ty) (y : scalar ty) : result (scalar ty) =
- mk_scalar ty (x - y)
-
-let scalar_mul (#ty : scalar_ty) (x : scalar ty) (y : scalar ty) : result (scalar ty) =
- mk_scalar ty (x * y)
-
-let scalar_xor (#ty : scalar_ty)
- (x : scalar ty) (y : scalar ty) : scalar ty =
- match ty with
- | U8 -> FStar.UInt.logxor #8 x y
- | U16 -> FStar.UInt.logxor #16 x y
- | U32 -> FStar.UInt.logxor #32 x y
- | U64 -> FStar.UInt.logxor #64 x y
- | U128 -> FStar.UInt.logxor #128 x y
- | Usize -> admit() // TODO
- | I8 ->
- // Encoding issues...
- normalize_spec (FStar.Int.int_t 8);
- normalize_spec (scalar I8);
- FStar.Int.logxor #8 x y
- | I16 ->
- // Encoding issues...
- normalize_spec (FStar.Int.int_t 16);
- normalize_spec (scalar I16);
- FStar.Int.logxor #16 x y
- | I32 -> FStar.Int.logxor #32 x y
- | I64 -> FStar.Int.logxor #64 x y
- | I128 ->
- // Encoding issues...
- normalize_spec (FStar.Int.int_t 128);
- normalize_spec (scalar I128);
- FStar.Int.logxor #128 x y
- | Isize -> admit() // TODO
-
-let scalar_or (#ty : scalar_ty)
- (x : scalar ty) (y : scalar ty) : scalar ty =
- match ty with
- | U8 -> FStar.UInt.logor #8 x y
- | U16 -> FStar.UInt.logor #16 x y
- | U32 -> FStar.UInt.logor #32 x y
- | U64 -> FStar.UInt.logor #64 x y
- | U128 -> FStar.UInt.logor #128 x y
- | Usize -> admit() // TODO
- | I8 ->
- // Encoding issues...
- normalize_spec (FStar.Int.int_t 8);
- normalize_spec (scalar I8);
- FStar.Int.logor #8 x y
- | I16 ->
- // Encoding issues...
- normalize_spec (FStar.Int.int_t 16);
- normalize_spec (scalar I16);
- FStar.Int.logor #16 x y
- | I32 -> FStar.Int.logor #32 x y
- | I64 -> FStar.Int.logor #64 x y
- | I128 ->
- // Encoding issues...
- normalize_spec (FStar.Int.int_t 128);
- normalize_spec (scalar I128);
- FStar.Int.logor #128 x y
- | Isize -> admit() // TODO
-
-let scalar_and (#ty : scalar_ty)
- (x : scalar ty) (y : scalar ty) : scalar ty =
- match ty with
- | U8 -> FStar.UInt.logand #8 x y
- | U16 -> FStar.UInt.logand #16 x y
- | U32 -> FStar.UInt.logand #32 x y
- | U64 -> FStar.UInt.logand #64 x y
- | U128 -> FStar.UInt.logand #128 x y
- | Usize -> admit() // TODO
- | I8 ->
- // Encoding issues...
- normalize_spec (FStar.Int.int_t 8);
- normalize_spec (scalar I8);
- FStar.Int.logand #8 x y
- | I16 ->
- // Encoding issues...
- normalize_spec (FStar.Int.int_t 16);
- normalize_spec (scalar I16);
- FStar.Int.logand #16 x y
- | I32 -> FStar.Int.logand #32 x y
- | I64 -> FStar.Int.logand #64 x y
- | I128 ->
- // Encoding issues...
- normalize_spec (FStar.Int.int_t 128);
- normalize_spec (scalar I128);
- FStar.Int.logand #128 x y
- | Isize -> admit() // TODO
-
-// Shift left
-let scalar_shl (#ty0 #ty1 : scalar_ty)
- (x : scalar ty0) (y : scalar ty1) : result (scalar ty0) =
- admit()
-
-// Shift right
-let scalar_shr (#ty0 #ty1 : scalar_ty)
- (x : scalar ty0) (y : scalar ty1) : result (scalar ty0) =
- admit()
-
-(** Cast an integer from a [src_ty] to a [tgt_ty] *)
-// TODO: check the semantics of casts in Rust
-let scalar_cast (src_ty : scalar_ty) (tgt_ty : scalar_ty) (x : scalar src_ty) : result (scalar tgt_ty) =
- mk_scalar tgt_ty x
-
-// This can't fail, but for now we make all casts faillible (easier for the translation)
-let scalar_cast_bool (tgt_ty : scalar_ty) (x : bool) : result (scalar tgt_ty) =
- mk_scalar tgt_ty (if x then 1 else 0)
-
-/// The scalar types
-type isize : eqtype = scalar Isize
-type i8 : eqtype = scalar I8
-type i16 : eqtype = scalar I16
-type i32 : eqtype = scalar I32
-type i64 : eqtype = scalar I64
-type i128 : eqtype = scalar I128
-type usize : eqtype = scalar Usize
-type u8 : eqtype = scalar U8
-type u16 : eqtype = scalar U16
-type u32 : eqtype = scalar U32
-type u64 : eqtype = scalar U64
-type u128 : eqtype = scalar U128
-
-
-let core_isize_min : isize = isize_min
-let core_isize_max : isize = isize_max
-let core_i8_min : i8 = i8_min
-let core_i8_max : i8 = i8_max
-let core_i16_min : i16 = i16_min
-let core_i16_max : i16 = i16_max
-let core_i32_min : i32 = i32_min
-let core_i32_max : i32 = i32_max
-let core_i64_min : i64 = i64_min
-let core_i64_max : i64 = i64_max
-let core_i128_min : i128 = i128_min
-let core_i128_max : i128 = i128_max
-
-let core_usize_min : usize = usize_min
-let core_usize_max : usize = usize_max
-let core_u8_min : u8 = u8_min
-let core_u8_max : u8 = u8_max
-let core_u16_min : u16 = u16_min
-let core_u16_max : u16 = u16_max
-let core_u32_min : u32 = u32_min
-let core_u32_max : u32 = u32_max
-let core_u64_min : u64 = u64_min
-let core_u64_max : u64 = u64_max
-let core_u128_min : u128 = u128_min
-let core_u128_max : u128 = u128_max
-
-/// Negation
-let isize_neg = scalar_neg #Isize
-let i8_neg = scalar_neg #I8
-let i16_neg = scalar_neg #I16
-let i32_neg = scalar_neg #I32
-let i64_neg = scalar_neg #I64
-let i128_neg = scalar_neg #I128
-
-/// Division
-let isize_div = scalar_div #Isize
-let i8_div = scalar_div #I8
-let i16_div = scalar_div #I16
-let i32_div = scalar_div #I32
-let i64_div = scalar_div #I64
-let i128_div = scalar_div #I128
-let usize_div = scalar_div #Usize
-let u8_div = scalar_div #U8
-let u16_div = scalar_div #U16
-let u32_div = scalar_div #U32
-let u64_div = scalar_div #U64
-let u128_div = scalar_div #U128
-
-/// Remainder
-let isize_rem = scalar_rem #Isize
-let i8_rem = scalar_rem #I8
-let i16_rem = scalar_rem #I16
-let i32_rem = scalar_rem #I32
-let i64_rem = scalar_rem #I64
-let i128_rem = scalar_rem #I128
-let usize_rem = scalar_rem #Usize
-let u8_rem = scalar_rem #U8
-let u16_rem = scalar_rem #U16
-let u32_rem = scalar_rem #U32
-let u64_rem = scalar_rem #U64
-let u128_rem = scalar_rem #U128
-
-/// Addition
-let isize_add = scalar_add #Isize
-let i8_add = scalar_add #I8
-let i16_add = scalar_add #I16
-let i32_add = scalar_add #I32
-let i64_add = scalar_add #I64
-let i128_add = scalar_add #I128
-let usize_add = scalar_add #Usize
-let u8_add = scalar_add #U8
-let u16_add = scalar_add #U16
-let u32_add = scalar_add #U32
-let u64_add = scalar_add #U64
-let u128_add = scalar_add #U128
-
-/// Subtraction
-let isize_sub = scalar_sub #Isize
-let i8_sub = scalar_sub #I8
-let i16_sub = scalar_sub #I16
-let i32_sub = scalar_sub #I32
-let i64_sub = scalar_sub #I64
-let i128_sub = scalar_sub #I128
-let usize_sub = scalar_sub #Usize
-let u8_sub = scalar_sub #U8
-let u16_sub = scalar_sub #U16
-let u32_sub = scalar_sub #U32
-let u64_sub = scalar_sub #U64
-let u128_sub = scalar_sub #U128
-
-/// Multiplication
-let isize_mul = scalar_mul #Isize
-let i8_mul = scalar_mul #I8
-let i16_mul = scalar_mul #I16
-let i32_mul = scalar_mul #I32
-let i64_mul = scalar_mul #I64
-let i128_mul = scalar_mul #I128
-let usize_mul = scalar_mul #Usize
-let u8_mul = scalar_mul #U8
-let u16_mul = scalar_mul #U16
-let u32_mul = scalar_mul #U32
-let u64_mul = scalar_mul #U64
-let u128_mul = scalar_mul #U128
-
-/// Xor
-let u8_xor = scalar_xor #U8
-let u16_xor = scalar_xor #U16
-let u32_xor = scalar_xor #U32
-let u64_xor = scalar_xor #U64
-let u128_xor = scalar_xor #U128
-let usize_xor = scalar_xor #Usize
-let i8_xor = scalar_xor #I8
-let i16_xor = scalar_xor #I16
-let i32_xor = scalar_xor #I32
-let i64_xor = scalar_xor #I64
-let i128_xor = scalar_xor #I128
-let isize_xor = scalar_xor #Isize
-
-/// Or
-let u8_or = scalar_or #U8
-let u16_or = scalar_or #U16
-let u32_or = scalar_or #U32
-let u64_or = scalar_or #U64
-let u128_or = scalar_or #U128
-let usize_or = scalar_or #Usize
-let i8_or = scalar_or #I8
-let i16_or = scalar_or #I16
-let i32_or = scalar_or #I32
-let i64_or = scalar_or #I64
-let i128_or = scalar_or #I128
-let isize_or = scalar_or #Isize
-
-/// And
-let u8_and = scalar_and #U8
-let u16_and = scalar_and #U16
-let u32_and = scalar_and #U32
-let u64_and = scalar_and #U64
-let u128_and = scalar_and #U128
-let usize_and = scalar_and #Usize
-let i8_and = scalar_and #I8
-let i16_and = scalar_and #I16
-let i32_and = scalar_and #I32
-let i64_and = scalar_and #I64
-let i128_and = scalar_and #I128
-let isize_and = scalar_and #Isize
-
-/// Shift left
-let u8_shl #ty = scalar_shl #U8 #ty
-let u16_shl #ty = scalar_shl #U16 #ty
-let u32_shl #ty = scalar_shl #U32 #ty
-let u64_shl #ty = scalar_shl #U64 #ty
-let u128_shl #ty = scalar_shl #U128 #ty
-let usize_shl #ty = scalar_shl #Usize #ty
-let i8_shl #ty = scalar_shl #I8 #ty
-let i16_shl #ty = scalar_shl #I16 #ty
-let i32_shl #ty = scalar_shl #I32 #ty
-let i64_shl #ty = scalar_shl #I64 #ty
-let i128_shl #ty = scalar_shl #I128 #ty
-let isize_shl #ty = scalar_shl #Isize #ty
-
-/// Shift right
-let u8_shr #ty = scalar_shr #U8 #ty
-let u16_shr #ty = scalar_shr #U16 #ty
-let u32_shr #ty = scalar_shr #U32 #ty
-let u64_shr #ty = scalar_shr #U64 #ty
-let u128_shr #ty = scalar_shr #U128 #ty
-let usize_shr #ty = scalar_shr #Usize #ty
-let i8_shr #ty = scalar_shr #I8 #ty
-let i16_shr #ty = scalar_shr #I16 #ty
-let i32_shr #ty = scalar_shr #I32 #ty
-let i64_shr #ty = scalar_shr #I64 #ty
-let i128_shr #ty = scalar_shr #I128 #ty
-let isize_shr #ty = scalar_shr #Isize #ty
-
-(*** core *)
-
-/// Trait declaration: [core::clone::Clone]
-noeq type core_clone_Clone (self : Type0) = {
- clone : self → result self
-}
-
-let core_clone_impls_CloneBool_clone (b : bool) : bool = b
-
-let core_clone_CloneBool : core_clone_Clone bool = {
- clone = fun b -> Ok (core_clone_impls_CloneBool_clone b)
-}
-
-let core_clone_impls_CloneUsize_clone (x : usize) : usize = x
-let core_clone_impls_CloneU8_clone (x : u8) : u8 = x
-let core_clone_impls_CloneU16_clone (x : u16) : u16 = x
-let core_clone_impls_CloneU32_clone (x : u32) : u32 = x
-let core_clone_impls_CloneU64_clone (x : u64) : u64 = x
-let core_clone_impls_CloneU128_clone (x : u128) : u128 = x
-
-let core_clone_impls_CloneIsize_clone (x : isize) : isize = x
-let core_clone_impls_CloneI8_clone (x : i8) : i8 = x
-let core_clone_impls_CloneI16_clone (x : i16) : i16 = x
-let core_clone_impls_CloneI32_clone (x : i32) : i32 = x
-let core_clone_impls_CloneI64_clone (x : i64) : i64 = x
-let core_clone_impls_CloneI128_clone (x : i128) : i128 = x
-
-let core_clone_CloneUsize : core_clone_Clone usize = {
- clone = fun x -> Ok (core_clone_impls_CloneUsize_clone x)
-}
-
-let core_clone_CloneU8 : core_clone_Clone u8 = {
- clone = fun x -> Ok (core_clone_impls_CloneU8_clone x)
-}
-
-let core_clone_CloneU16 : core_clone_Clone u16 = {
- clone = fun x -> Ok (core_clone_impls_CloneU16_clone x)
-}
-
-let core_clone_CloneU32 : core_clone_Clone u32 = {
- clone = fun x -> Ok (core_clone_impls_CloneU32_clone x)
-}
-
-let core_clone_CloneU64 : core_clone_Clone u64 = {
- clone = fun x -> Ok (core_clone_impls_CloneU64_clone x)
-}
-
-let core_clone_CloneU128 : core_clone_Clone u128 = {
- clone = fun x -> Ok (core_clone_impls_CloneU128_clone x)
-}
-
-let core_clone_CloneIsize : core_clone_Clone isize = {
- clone = fun x -> Ok (core_clone_impls_CloneIsize_clone x)
-}
-
-let core_clone_CloneI8 : core_clone_Clone i8 = {
- clone = fun x -> Ok (core_clone_impls_CloneI8_clone x)
-}
-
-let core_clone_CloneI16 : core_clone_Clone i16 = {
- clone = fun x -> Ok (core_clone_impls_CloneI16_clone x)
-}
-
-let core_clone_CloneI32 : core_clone_Clone i32 = {
- clone = fun x -> Ok (core_clone_impls_CloneI32_clone x)
-}
-
-let core_clone_CloneI64 : core_clone_Clone i64 = {
- clone = fun x -> Ok (core_clone_impls_CloneI64_clone x)
-}
-
-let core_clone_CloneI128 : core_clone_Clone i128 = {
- clone = fun x -> Ok (core_clone_impls_CloneI128_clone x)
-}
-
-(** [core::option::{core::option::Option<T>}::unwrap] *)
-let core_option_Option_unwrap (t : Type0) (x : option t) : result t =
- match x with
- | None -> Fail Failure
- | Some x -> Ok x
-
-(*** core::ops *)
-
-// Trait declaration: [core::ops::index::Index]
-noeq type core_ops_index_Index (self idx : Type0) = {
- output : Type0;
- index : self → idx → result output
-}
-
-// Trait declaration: [core::ops::index::IndexMut]
-noeq type core_ops_index_IndexMut (self idx : Type0) = {
- indexInst : core_ops_index_Index self idx;
- index_mut : self → idx → result (indexInst.output & (indexInst.output → result self));
-}
-
-// Trait declaration [core::ops::deref::Deref]
-noeq type core_ops_deref_Deref (self : Type0) = {
- target : Type0;
- deref : self → result target;
-}
-
-// Trait declaration [core::ops::deref::DerefMut]
-noeq type core_ops_deref_DerefMut (self : Type0) = {
- derefInst : core_ops_deref_Deref self;
- deref_mut : self → result (derefInst.target & (derefInst.target → result self));
-}
-
-type core_ops_range_Range (a : Type0) = {
- start : a;
- end_ : a;
-}
-
-(*** [alloc] *)
-
-let alloc_boxed_Box_deref (t : Type0) (x : t) : result t = Ok x
-let alloc_boxed_Box_deref_mut (t : Type0) (x : t) : result (t & (t -> result t)) =
- Ok (x, (fun x -> Ok x))
-
-// Trait instance
-let alloc_boxed_Box_coreopsDerefInst (self : Type0) : core_ops_deref_Deref self = {
- target = self;
- deref = alloc_boxed_Box_deref self;
-}
-
-// Trait instance
-let alloc_boxed_Box_coreopsDerefMutInst (self : Type0) : core_ops_deref_DerefMut self = {
- derefInst = alloc_boxed_Box_coreopsDerefInst self;
- deref_mut = alloc_boxed_Box_deref_mut self;
-}
-
-(*** Array *)
-type array (a : Type0) (n : usize) = s:list a{length s = n}
-
-// We tried putting the normalize_term condition as a refinement on the list
-// but it didn't work. It works with the requires clause.
-let mk_array (a : Type0) (n : usize)
- (l : list a) :
- Pure (array a n)
- (requires (normalize_term(FStar.List.Tot.length l) = n))
- (ensures (fun _ -> True)) =
- normalize_term_spec (FStar.List.Tot.length l);
- l
-
-let array_index_usize (a : Type0) (n : usize) (x : array a n) (i : usize) : result a =
- if i < length x then Ok (index x i)
- else Fail Failure
-
-let array_update_usize (a : Type0) (n : usize) (x : array a n) (i : usize) (nx : a) :
- result (array a n) =
- if i < length x then Ok (list_update x i nx)
- else Fail Failure
-
-let array_index_mut_usize (a : Type0) (n : usize) (x : array a n) (i : usize) :
- result (a & (a -> result (array a n))) =
- match array_index_usize a n x i with
- | Fail e -> Fail e
- | Ok v ->
- Ok (v, array_update_usize a n x i)
-
-(*** Slice *)
-type slice (a : Type0) = s:list a{length s <= usize_max}
-
-let slice_len (a : Type0) (s : slice a) : usize = length s
-
-let slice_index_usize (a : Type0) (x : slice a) (i : usize) : result a =
- if i < length x then Ok (index x i)
- else Fail Failure
-
-let slice_update_usize (a : Type0) (x : slice a) (i : usize) (nx : a) : result (slice a) =
- if i < length x then Ok (list_update x i nx)
- else Fail Failure
-
-let slice_index_mut_usize (a : Type0) (s : slice a) (i : usize) :
- result (a & (a -> result (slice a))) =
- match slice_index_usize a s i with
- | Fail e -> Fail e
- | Ok x ->
- Ok (x, slice_update_usize a s i)
-
-(*** Subslices *)
-
-let array_to_slice (a : Type0) (n : usize) (x : array a n) : result (slice a) = Ok x
-let array_from_slice (a : Type0) (n : usize) (x : array a n) (s : slice a) : result (array a n) =
- if length s = n then Ok s
- else Fail Failure
-
-let array_to_slice_mut (a : Type0) (n : usize) (x : array a n) :
- result (slice a & (slice a -> result (array a n))) =
- Ok (x, array_from_slice a n x)
-
-// TODO: finish the definitions below (there lacks [List.drop] and [List.take] in the standard library *)
-let array_subslice (a : Type0) (n : usize) (x : array a n) (r : core_ops_range_Range usize) : result (slice a) =
- admit()
-
-let array_update_subslice (a : Type0) (n : usize) (x : array a n) (r : core_ops_range_Range usize) (ns : slice a) : result (array a n) =
- admit()
-
-let array_repeat (a : Type0) (n : usize) (x : a) : array a n =
- admit()
-
-let slice_subslice (a : Type0) (x : slice a) (r : core_ops_range_Range usize) : result (slice a) =
- admit()
-
-let slice_update_subslice (a : Type0) (x : slice a) (r : core_ops_range_Range usize) (ns : slice a) : result (slice a) =
- admit()
-
-(*** Vector *)
-type alloc_vec_Vec (a : Type0) = v:list a{length v <= usize_max}
-
-let alloc_vec_Vec_new (a : Type0) : alloc_vec_Vec a = assert_norm(length #a [] == 0); []
-let alloc_vec_Vec_len (a : Type0) (v : alloc_vec_Vec a) : usize = length v
-
-// Helper
-let alloc_vec_Vec_index_usize (#a : Type0) (v : alloc_vec_Vec a) (i : usize) : result a =
- if i < length v then Ok (index v i) else Fail Failure
-// Helper
-let alloc_vec_Vec_update_usize (#a : Type0) (v : alloc_vec_Vec a) (i : usize) (x : a) : result (alloc_vec_Vec a) =
- if i < length v then Ok (list_update v i x) else Fail Failure
-
-let alloc_vec_Vec_index_mut_usize (#a : Type0) (v: alloc_vec_Vec a) (i: usize) :
- result (a & (a → result (alloc_vec_Vec a))) =
- match alloc_vec_Vec_index_usize v i with
- | Ok x ->
- Ok (x, alloc_vec_Vec_update_usize v i)
- | Fail e -> Fail e
-
-let alloc_vec_Vec_push (a : Type0) (v : alloc_vec_Vec a) (x : a) :
- Pure (result (alloc_vec_Vec a))
- (requires True)
- (ensures (fun res ->
- match res with
- | Fail e -> e == Failure
- | Ok v' -> length v' = length v + 1)) =
- if length v < usize_max then begin
- (**) assert_norm(length [x] == 1);
- (**) append_length v [x];
- (**) assert(length (append v [x]) = length v + 1);
- Ok (append v [x])
- end
- else Fail Failure
-
-let alloc_vec_Vec_insert (a : Type0) (v : alloc_vec_Vec a) (i : usize) (x : a) : result (alloc_vec_Vec a) =
- if i < length v then Ok (list_update v i x) else Fail Failure
-
-// Trait declaration: [core::slice::index::private_slice_index::Sealed]
-type core_slice_index_private_slice_index_Sealed (self : Type0) = unit
-
-// Trait declaration: [core::slice::index::SliceIndex]
-noeq type core_slice_index_SliceIndex (self t : Type0) = {
- sealedInst : core_slice_index_private_slice_index_Sealed self;
- output : Type0;
- get : self → t → result (option output);
- get_mut : self → t → result (option output & (option output -> result t));
- get_unchecked : self → const_raw_ptr t → result (const_raw_ptr output);
- get_unchecked_mut : self → mut_raw_ptr t → result (mut_raw_ptr output);
- index : self → t → result output;
- index_mut : self → t → result (output & (output -> result t));
-}
-
-// [core::slice::index::[T]::index]: forward function
-let core_slice_index_Slice_index
- (t idx : Type0) (inst : core_slice_index_SliceIndex idx (slice t))
- (s : slice t) (i : idx) : result inst.output =
- let* x = inst.get i s in
- match x with
- | None -> Fail Failure
- | Some x -> Ok x
-
-// [core::slice::index::Range:::get]: forward function
-let core_slice_index_RangeUsize_get (t : Type0) (i : core_ops_range_Range usize) (s : slice t) :
- result (option (slice t)) =
- admit () // TODO
-
-// [core::slice::index::Range::get_mut]: forward function
-let core_slice_index_RangeUsize_get_mut (t : Type0) :
- core_ops_range_Range usize → slice t → result (option (slice t) & (option (slice t) -> result (slice t))) =
- admit () // TODO
-
-// [core::slice::index::Range::get_unchecked]: forward function
-let core_slice_index_RangeUsize_get_unchecked
- (t : Type0) :
- 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
-let core_slice_index_RangeUsize_get_unchecked_mut
- (t : Type0) :
- 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
-let core_slice_index_RangeUsize_index
- (t : Type0) : core_ops_range_Range usize → slice t → result (slice t) =
- admit () // TODO
-
-// [core::slice::index::Range::index_mut]: forward function
-let core_slice_index_RangeUsize_index_mut (t : Type0) :
- core_ops_range_Range usize → slice t → result (slice t & (slice t -> result (slice t))) =
- admit () // TODO
-
-// [core::slice::index::[T]::index_mut]: forward function
-let core_slice_index_Slice_index_mut
- (t idx : Type0) (inst : core_slice_index_SliceIndex idx (slice t)) :
- slice t → idx → result (inst.output & (inst.output -> result (slice t))) =
- admit () //
-
-// [core::array::[T; N]::index]: forward function
-let core_array_Array_index
- (t idx : Type0) (n : usize) (inst : core_ops_index_Index (slice t) idx)
- (a : array t n) (i : idx) : result inst.output =
- admit () // TODO
-
-// [core::array::[T; N]::index_mut]: forward function
-let core_array_Array_index_mut
- (t idx : Type0) (n : usize) (inst : core_ops_index_IndexMut (slice t) idx)
- (a : array t n) (i : idx) :
- result (inst.indexInst.output & (inst.indexInst.output -> result (array t n))) =
- admit () // TODO
-
-// Trait implementation: [core::slice::index::private_slice_index::Range]
-let core_slice_index_private_slice_index_SealedRangeUsizeInst
- : core_slice_index_private_slice_index_Sealed (core_ops_range_Range usize) = ()
-
-// Trait implementation: [core::slice::index::Range]
-let core_slice_index_SliceIndexRangeUsizeSliceTInst (t : Type0) :
- core_slice_index_SliceIndex (core_ops_range_Range usize) (slice t) = {
- sealedInst = core_slice_index_private_slice_index_SealedRangeUsizeInst;
- output = slice t;
- get = core_slice_index_RangeUsize_get t;
- get_mut = core_slice_index_RangeUsize_get_mut t;
- get_unchecked = core_slice_index_RangeUsize_get_unchecked t;
- get_unchecked_mut = core_slice_index_RangeUsize_get_unchecked_mut t;
- index = core_slice_index_RangeUsize_index t;
- index_mut = core_slice_index_RangeUsize_index_mut t;
-}
-
-// Trait implementation: [core::slice::index::[T]]
-let core_ops_index_IndexSliceTIInst (t idx : Type0)
- (inst : core_slice_index_SliceIndex idx (slice t)) :
- core_ops_index_Index (slice t) idx = {
- output = inst.output;
- index = core_slice_index_Slice_index t idx inst;
-}
-
-// Trait implementation: [core::slice::index::[T]]
-let core_ops_index_IndexMutSliceTIInst (t idx : Type0)
- (inst : core_slice_index_SliceIndex idx (slice t)) :
- core_ops_index_IndexMut (slice t) idx = {
- indexInst = core_ops_index_IndexSliceTIInst t idx inst;
- index_mut = core_slice_index_Slice_index_mut t idx inst;
-}
-
-// Trait implementation: [core::array::[T; N]]
-let core_ops_index_IndexArrayInst (t idx : Type0) (n : usize)
- (inst : core_ops_index_Index (slice t) idx) :
- core_ops_index_Index (array t n) idx = {
- output = inst.output;
- index = core_array_Array_index t idx n inst;
-}
-
-// Trait implementation: [core::array::[T; N]]
-let core_ops_index_IndexMutArrayIInst (t idx : Type0) (n : usize)
- (inst : core_ops_index_IndexMut (slice t) idx) :
- core_ops_index_IndexMut (array t n) idx = {
- indexInst = core_ops_index_IndexArrayInst t idx n inst.indexInst;
- index_mut = core_array_Array_index_mut t idx n inst;
-}
-
-// [core::slice::index::usize::get]: forward function
-let core_slice_index_usize_get
- (t : Type0) : usize → slice t → result (option t) =
- admit () // TODO
-
-// [core::slice::index::usize::get_mut]: forward function
-let core_slice_index_usize_get_mut (t : Type0) :
- usize → slice t → result (option t & (option t -> result (slice t))) =
- admit () // TODO
-
-// [core::slice::index::usize::get_unchecked]: forward function
-let core_slice_index_usize_get_unchecked
- (t : Type0) : usize → const_raw_ptr (slice t) → result (const_raw_ptr t) =
- admit () // TODO
-
-// [core::slice::index::usize::get_unchecked_mut]: forward function
-let core_slice_index_usize_get_unchecked_mut
- (t : Type0) : usize → mut_raw_ptr (slice t) → result (mut_raw_ptr t) =
- admit () // TODO
-
-// [core::slice::index::usize::index]: forward function
-let core_slice_index_usize_index (t : Type0) : usize → slice t → result t =
- admit () // TODO
-
-// [core::slice::index::usize::index_mut]: forward function
-let core_slice_index_usize_index_mut (t : Type0) :
- usize → slice t → result (t & (t -> result (slice t))) =
- admit () // TODO
-
-// Trait implementation: [core::slice::index::private_slice_index::usize]
-let core_slice_index_private_slice_index_SealedUsizeInst
- : core_slice_index_private_slice_index_Sealed usize = ()
-
-// Trait implementation: [core::slice::index::usize]
-let core_slice_index_SliceIndexUsizeSliceTInst (t : Type0) :
- core_slice_index_SliceIndex usize (slice t) = {
- sealedInst = core_slice_index_private_slice_index_SealedUsizeInst;
- output = t;
- get = core_slice_index_usize_get t;
- get_mut = core_slice_index_usize_get_mut t;
- get_unchecked = core_slice_index_usize_get_unchecked t;
- get_unchecked_mut = core_slice_index_usize_get_unchecked_mut t;
- index = core_slice_index_usize_index t;
- index_mut = core_slice_index_usize_index_mut t;
-}
-
-// [alloc::vec::Vec::index]: forward function
-let alloc_vec_Vec_index (t idx : Type0) (inst : core_slice_index_SliceIndex idx (slice t))
- (self : alloc_vec_Vec t) (i : idx) : result inst.output =
- admit () // TODO
-
-// [alloc::vec::Vec::index_mut]: forward function
-let alloc_vec_Vec_index_mut (t idx : Type0) (inst : core_slice_index_SliceIndex idx (slice t))
- (self : alloc_vec_Vec t) (i : idx) :
- result (inst.output & (inst.output -> result (alloc_vec_Vec t))) =
- admit () // TODO
-
-// Trait implementation: [alloc::vec::Vec]
-let alloc_vec_Vec_coreopsindexIndexInst (t idx : Type0)
- (inst : core_slice_index_SliceIndex idx (slice t)) :
- core_ops_index_Index (alloc_vec_Vec t) idx = {
- output = inst.output;
- index = alloc_vec_Vec_index t idx inst;
-}
-
-// Trait implementation: [alloc::vec::Vec]
-let alloc_vec_Vec_coreopsindexIndexMutInst (t idx : Type0)
- (inst : core_slice_index_SliceIndex idx (slice t)) :
- core_ops_index_IndexMut (alloc_vec_Vec t) idx = {
- indexInst = alloc_vec_Vec_coreopsindexIndexInst t idx inst;
- index_mut = alloc_vec_Vec_index_mut t idx inst;
-}
-
-(*** Theorems *)
-
-let alloc_vec_Vec_index_eq (#a : Type0) (v : alloc_vec_Vec a) (i : usize) :
- Lemma (
- alloc_vec_Vec_index a usize (core_slice_index_SliceIndexUsizeSliceTInst a) v i ==
- alloc_vec_Vec_index_usize v i)
- [SMTPat (alloc_vec_Vec_index a usize (core_slice_index_SliceIndexUsizeSliceTInst a) v i)]
- =
- admit()
-
-let alloc_vec_Vec_index_mut_eq (#a : Type0) (v : alloc_vec_Vec a) (i : usize) :
- Lemma (
- alloc_vec_Vec_index_mut a usize (core_slice_index_SliceIndexUsizeSliceTInst a) v i ==
- alloc_vec_Vec_index_mut_usize v i)
- [SMTPat (alloc_vec_Vec_index_mut a usize (core_slice_index_SliceIndexUsizeSliceTInst a) v i)]
- =
- admit()
diff --git a/tests/fstar/demo/Demo.fst b/tests/fstar/demo/Demo.fst
index b210662f..41fd9804 100644
--- a/tests/fstar/demo/Demo.fst
+++ b/tests/fstar/demo/Demo.fst
@@ -6,7 +6,7 @@ open Primitives
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [demo::choose]:
- Source: 'src/demo.rs', lines 5:0-5:70 *)
+ Source: 'tests/src/demo.rs', lines 5:0-5:70 *)
let choose
(t : Type0) (b : bool) (x : t) (y : t) : result (t & (t -> result (t & t))) =
if b
@@ -14,33 +14,33 @@ let choose
else let back = fun ret -> Ok (x, ret) in Ok (y, back)
(** [demo::mul2_add1]:
- Source: 'src/demo.rs', lines 13:0-13:31 *)
+ Source: 'tests/src/demo.rs', lines 13:0-13:31 *)
let mul2_add1 (x : u32) : result u32 =
let* i = u32_add x x in u32_add i 1
(** [demo::use_mul2_add1]:
- Source: 'src/demo.rs', lines 17:0-17:43 *)
+ Source: 'tests/src/demo.rs', lines 17:0-17:43 *)
let use_mul2_add1 (x : u32) (y : u32) : result u32 =
let* i = mul2_add1 x in u32_add i y
(** [demo::incr]:
- Source: 'src/demo.rs', lines 21:0-21:31 *)
+ Source: 'tests/src/demo.rs', lines 21:0-21:31 *)
let incr (x : u32) : result u32 =
u32_add x 1
(** [demo::use_incr]:
- Source: 'src/demo.rs', lines 25:0-25:17 *)
+ Source: 'tests/src/demo.rs', lines 25:0-25:17 *)
let use_incr : result unit =
let* x = incr 0 in let* x1 = incr x in let* _ = incr x1 in Ok ()
(** [demo::CList]
- Source: 'src/demo.rs', lines 34:0-34:17 *)
+ Source: 'tests/src/demo.rs', lines 34:0-34:17 *)
type cList_t (t : Type0) =
| CList_CCons : t -> cList_t t -> cList_t t
| CList_CNil : cList_t t
(** [demo::list_nth]:
- Source: 'src/demo.rs', lines 39:0-39:56 *)
+ Source: 'tests/src/demo.rs', lines 39:0-39:56 *)
let rec list_nth (t : Type0) (n : nat) (l : cList_t t) (i : u32) : result t =
if is_zero n
then Fail OutOfFuel
@@ -53,7 +53,7 @@ let rec list_nth (t : Type0) (n : nat) (l : cList_t t) (i : u32) : result t =
end
(** [demo::list_nth_mut]:
- Source: 'src/demo.rs', lines 54:0-54:68 *)
+ Source: 'tests/src/demo.rs', lines 54:0-54:68 *)
let rec list_nth_mut
(t : Type0) (n : nat) (l : cList_t t) (i : u32) :
result (t & (t -> result (cList_t t)))
@@ -77,7 +77,7 @@ let rec list_nth_mut
end
(** [demo::list_nth_mut1]: loop 0:
- Source: 'src/demo.rs', lines 69:0-78:1 *)
+ Source: 'tests/src/demo.rs', lines 69:0-78:1 *)
let rec list_nth_mut1_loop
(t : Type0) (n : nat) (l : cList_t t) (i : u32) :
result (t & (t -> result (cList_t t)))
@@ -99,7 +99,7 @@ let rec list_nth_mut1_loop
end
(** [demo::list_nth_mut1]:
- Source: 'src/demo.rs', lines 69:0-69:77 *)
+ Source: 'tests/src/demo.rs', lines 69:0-69:77 *)
let list_nth_mut1
(t : Type0) (n : nat) (l : cList_t t) (i : u32) :
result (t & (t -> result (cList_t t)))
@@ -107,7 +107,7 @@ let list_nth_mut1
list_nth_mut1_loop t n l i
(** [demo::i32_id]:
- Source: 'src/demo.rs', lines 80:0-80:28 *)
+ Source: 'tests/src/demo.rs', lines 80:0-80:28 *)
let rec i32_id (n : nat) (i : i32) : result i32 =
if is_zero n
then Fail OutOfFuel
@@ -118,7 +118,7 @@ let rec i32_id (n : nat) (i : i32) : result i32 =
else let* i1 = i32_sub i 1 in let* i2 = i32_id n1 i1 in i32_add i2 1
(** [demo::list_tail]:
- Source: 'src/demo.rs', lines 88:0-88:64 *)
+ Source: 'tests/src/demo.rs', lines 88:0-88:64 *)
let rec list_tail
(t : Type0) (n : nat) (l : cList_t t) :
result ((cList_t t) & (cList_t t -> result (cList_t t)))
@@ -137,20 +137,20 @@ let rec list_tail
end
(** Trait declaration: [demo::Counter]
- Source: 'src/demo.rs', lines 97:0-97:17 *)
+ Source: 'tests/src/demo.rs', lines 97:0-97:17 *)
noeq type counter_t (self : Type0) = { incr : self -> result (usize & self); }
(** [demo::{(demo::Counter for usize)}::incr]:
- Source: 'src/demo.rs', lines 102:4-102:31 *)
+ Source: 'tests/src/demo.rs', lines 102:4-102:31 *)
let counterUsize_incr (self : usize) : result (usize & usize) =
let* self1 = usize_add self 1 in Ok (self, self1)
(** Trait implementation: [demo::{(demo::Counter for usize)}]
- Source: 'src/demo.rs', lines 101:0-101:22 *)
+ Source: 'tests/src/demo.rs', lines 101:0-101:22 *)
let counterUsize : counter_t usize = { incr = counterUsize_incr; }
(** [demo::use_counter]:
- Source: 'src/demo.rs', lines 109:0-109:59 *)
+ Source: 'tests/src/demo.rs', lines 109:0-109:59 *)
let use_counter
(t : Type0) (counterInst : counter_t t) (cnt : t) : result (usize & t) =
counterInst.incr cnt
diff --git a/tests/fstar/hashmap/Hashmap.Clauses.Template.fst b/tests/fstar/hashmap/Hashmap.Clauses.Template.fst
index 2733b371..b96f6784 100644
--- a/tests/fstar/hashmap/Hashmap.Clauses.Template.fst
+++ b/tests/fstar/hashmap/Hashmap.Clauses.Template.fst
@@ -7,63 +7,63 @@ open Hashmap.Types
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [hashmap::{hashmap::HashMap<T>}::allocate_slots]: decreases clause
- Source: 'src/hashmap.rs', lines 50:4-56:5 *)
+ Source: 'tests/src/hashmap.rs', lines 50:4-56:5 *)
unfold
let hashMap_allocate_slots_loop_decreases (t : Type0)
(slots : alloc_vec_Vec (list_t t)) (n : usize) : nat =
admit ()
(** [hashmap::{hashmap::HashMap<T>}::clear]: decreases clause
- Source: 'src/hashmap.rs', lines 80:4-88:5 *)
+ Source: 'tests/src/hashmap.rs', lines 80:4-88:5 *)
unfold
let hashMap_clear_loop_decreases (t : Type0) (slots : alloc_vec_Vec (list_t t))
(i : usize) : nat =
admit ()
(** [hashmap::{hashmap::HashMap<T>}::insert_in_list]: decreases clause
- Source: 'src/hashmap.rs', lines 97:4-114:5 *)
+ Source: 'tests/src/hashmap.rs', lines 97:4-114:5 *)
unfold
let hashMap_insert_in_list_loop_decreases (t : Type0) (key : usize) (value : t)
(ls : list_t t) : nat =
admit ()
(** [hashmap::{hashmap::HashMap<T>}::move_elements_from_list]: decreases clause
- Source: 'src/hashmap.rs', lines 183:4-196:5 *)
+ Source: 'tests/src/hashmap.rs', lines 183:4-196:5 *)
unfold
let hashMap_move_elements_from_list_loop_decreases (t : Type0)
(ntable : hashMap_t t) (ls : list_t t) : nat =
admit ()
(** [hashmap::{hashmap::HashMap<T>}::move_elements]: decreases clause
- Source: 'src/hashmap.rs', lines 171:4-180:5 *)
+ Source: 'tests/src/hashmap.rs', lines 171:4-180:5 *)
unfold
let hashMap_move_elements_loop_decreases (t : Type0) (ntable : hashMap_t t)
(slots : alloc_vec_Vec (list_t t)) (i : usize) : nat =
admit ()
(** [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]: decreases clause
- Source: 'src/hashmap.rs', lines 206:4-219:5 *)
+ Source: 'tests/src/hashmap.rs', lines 206:4-219:5 *)
unfold
let hashMap_contains_key_in_list_loop_decreases (t : Type0) (key : usize)
(ls : list_t t) : nat =
admit ()
(** [hashmap::{hashmap::HashMap<T>}::get_in_list]: decreases clause
- Source: 'src/hashmap.rs', lines 224:4-237:5 *)
+ Source: 'tests/src/hashmap.rs', lines 224:4-237:5 *)
unfold
let hashMap_get_in_list_loop_decreases (t : Type0) (key : usize)
(ls : list_t t) : nat =
admit ()
(** [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: decreases clause
- Source: 'src/hashmap.rs', lines 245:4-254:5 *)
+ Source: 'tests/src/hashmap.rs', lines 245:4-254:5 *)
unfold
let hashMap_get_mut_in_list_loop_decreases (t : Type0) (ls : list_t t)
(key : usize) : nat =
admit ()
(** [hashmap::{hashmap::HashMap<T>}::remove_from_list]: decreases clause
- Source: 'src/hashmap.rs', lines 265:4-291:5 *)
+ Source: 'tests/src/hashmap.rs', lines 265:4-291:5 *)
unfold
let hashMap_remove_from_list_loop_decreases (t : Type0) (key : usize)
(ls : list_t t) : nat =
diff --git a/tests/fstar/hashmap/Hashmap.Funs.fst b/tests/fstar/hashmap/Hashmap.Funs.fst
index 2be587af..2aca9fbe 100644
--- a/tests/fstar/hashmap/Hashmap.Funs.fst
+++ b/tests/fstar/hashmap/Hashmap.Funs.fst
@@ -8,12 +8,12 @@ include Hashmap.Clauses
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [hashmap::hash_key]:
- Source: 'src/hashmap.rs', lines 27:0-27:32 *)
+ Source: 'tests/src/hashmap.rs', lines 27:0-27:32 *)
let hash_key (k : usize) : result usize =
Ok k
(** [hashmap::{hashmap::HashMap<T>}::allocate_slots]: loop 0:
- Source: 'src/hashmap.rs', lines 50:4-56:5 *)
+ Source: 'tests/src/hashmap.rs', lines 50:4-56:5 *)
let rec hashMap_allocate_slots_loop
(t : Type0) (slots : alloc_vec_Vec (list_t t)) (n : usize) :
Tot (result (alloc_vec_Vec (list_t t)))
@@ -27,7 +27,7 @@ let rec hashMap_allocate_slots_loop
else Ok slots
(** [hashmap::{hashmap::HashMap<T>}::allocate_slots]:
- Source: 'src/hashmap.rs', lines 50:4-50:76 *)
+ Source: 'tests/src/hashmap.rs', lines 50:4-50:76 *)
let hashMap_allocate_slots
(t : Type0) (slots : alloc_vec_Vec (list_t t)) (n : usize) :
result (alloc_vec_Vec (list_t t))
@@ -35,7 +35,7 @@ let hashMap_allocate_slots
hashMap_allocate_slots_loop t slots n
(** [hashmap::{hashmap::HashMap<T>}::new_with_capacity]:
- Source: 'src/hashmap.rs', lines 59:4-63:13 *)
+ Source: 'tests/src/hashmap.rs', lines 59:4-63:13 *)
let hashMap_new_with_capacity
(t : Type0) (capacity : usize) (max_load_dividend : usize)
(max_load_divisor : usize) :
@@ -54,12 +54,12 @@ let hashMap_new_with_capacity
}
(** [hashmap::{hashmap::HashMap<T>}::new]:
- Source: 'src/hashmap.rs', lines 75:4-75:24 *)
+ Source: 'tests/src/hashmap.rs', lines 75:4-75:24 *)
let hashMap_new (t : Type0) : result (hashMap_t t) =
hashMap_new_with_capacity t 32 4 5
(** [hashmap::{hashmap::HashMap<T>}::clear]: loop 0:
- Source: 'src/hashmap.rs', lines 80:4-88:5 *)
+ Source: 'tests/src/hashmap.rs', lines 80:4-88:5 *)
let rec hashMap_clear_loop
(t : Type0) (slots : alloc_vec_Vec (list_t t)) (i : usize) :
Tot (result (alloc_vec_Vec (list_t t)))
@@ -77,18 +77,18 @@ let rec hashMap_clear_loop
else Ok slots
(** [hashmap::{hashmap::HashMap<T>}::clear]:
- Source: 'src/hashmap.rs', lines 80:4-80:27 *)
+ Source: 'tests/src/hashmap.rs', lines 80:4-80:27 *)
let hashMap_clear (t : Type0) (self : hashMap_t t) : result (hashMap_t t) =
let* hm = hashMap_clear_loop t self.slots 0 in
Ok { self with num_entries = 0; slots = hm }
(** [hashmap::{hashmap::HashMap<T>}::len]:
- Source: 'src/hashmap.rs', lines 90:4-90:30 *)
+ Source: 'tests/src/hashmap.rs', lines 90:4-90:30 *)
let hashMap_len (t : Type0) (self : hashMap_t t) : result usize =
Ok self.num_entries
(** [hashmap::{hashmap::HashMap<T>}::insert_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 97:4-114:5 *)
+ Source: 'tests/src/hashmap.rs', lines 97:4-114:5 *)
let rec hashMap_insert_in_list_loop
(t : Type0) (key : usize) (value : t) (ls : list_t t) :
Tot (result (bool & (list_t t)))
@@ -105,7 +105,7 @@ let rec hashMap_insert_in_list_loop
end
(** [hashmap::{hashmap::HashMap<T>}::insert_in_list]:
- Source: 'src/hashmap.rs', lines 97:4-97:71 *)
+ Source: 'tests/src/hashmap.rs', lines 97:4-97:71 *)
let hashMap_insert_in_list
(t : Type0) (key : usize) (value : t) (ls : list_t t) :
result (bool & (list_t t))
@@ -113,7 +113,7 @@ let hashMap_insert_in_list
hashMap_insert_in_list_loop t key value ls
(** [hashmap::{hashmap::HashMap<T>}::insert_no_resize]:
- Source: 'src/hashmap.rs', lines 117:4-117:54 *)
+ Source: 'tests/src/hashmap.rs', lines 117:4-117:54 *)
let hashMap_insert_no_resize
(t : Type0) (self : hashMap_t t) (key : usize) (value : t) :
result (hashMap_t t)
@@ -134,7 +134,7 @@ let hashMap_insert_no_resize
else let* v = index_mut_back l1 in Ok { self with slots = v }
(** [hashmap::{hashmap::HashMap<T>}::move_elements_from_list]: loop 0:
- Source: 'src/hashmap.rs', lines 183:4-196:5 *)
+ Source: 'tests/src/hashmap.rs', lines 183:4-196:5 *)
let rec hashMap_move_elements_from_list_loop
(t : Type0) (ntable : hashMap_t t) (ls : list_t t) :
Tot (result (hashMap_t t))
@@ -148,13 +148,13 @@ let rec hashMap_move_elements_from_list_loop
end
(** [hashmap::{hashmap::HashMap<T>}::move_elements_from_list]:
- Source: 'src/hashmap.rs', lines 183:4-183:72 *)
+ Source: 'tests/src/hashmap.rs', lines 183:4-183:72 *)
let hashMap_move_elements_from_list
(t : Type0) (ntable : hashMap_t t) (ls : list_t t) : result (hashMap_t t) =
hashMap_move_elements_from_list_loop t ntable ls
(** [hashmap::{hashmap::HashMap<T>}::move_elements]: loop 0:
- Source: 'src/hashmap.rs', lines 171:4-180:5 *)
+ Source: 'tests/src/hashmap.rs', lines 171:4-180:5 *)
let rec hashMap_move_elements_loop
(t : Type0) (ntable : hashMap_t t) (slots : alloc_vec_Vec (list_t t))
(i : usize) :
@@ -175,7 +175,7 @@ let rec hashMap_move_elements_loop
else Ok (ntable, slots)
(** [hashmap::{hashmap::HashMap<T>}::move_elements]:
- Source: 'src/hashmap.rs', lines 171:4-171:95 *)
+ Source: 'tests/src/hashmap.rs', lines 171:4-171:95 *)
let hashMap_move_elements
(t : Type0) (ntable : hashMap_t t) (slots : alloc_vec_Vec (list_t t))
(i : usize) :
@@ -184,7 +184,7 @@ let hashMap_move_elements
hashMap_move_elements_loop t ntable slots i
(** [hashmap::{hashmap::HashMap<T>}::try_resize]:
- Source: 'src/hashmap.rs', lines 140:4-140:28 *)
+ Source: 'tests/src/hashmap.rs', lines 140:4-140:28 *)
let hashMap_try_resize
(t : Type0) (self : hashMap_t t) : result (hashMap_t t) =
let* max_usize = scalar_cast U32 Usize core_u32_max in
@@ -204,7 +204,7 @@ let hashMap_try_resize
else Ok { self with max_load_factor = (i, i1) }
(** [hashmap::{hashmap::HashMap<T>}::insert]:
- Source: 'src/hashmap.rs', lines 129:4-129:48 *)
+ Source: 'tests/src/hashmap.rs', lines 129:4-129:48 *)
let hashMap_insert
(t : Type0) (self : hashMap_t t) (key : usize) (value : t) :
result (hashMap_t t)
@@ -214,7 +214,7 @@ let hashMap_insert
if i > self1.max_load then hashMap_try_resize t self1 else Ok self1
(** [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 206:4-219:5 *)
+ Source: 'tests/src/hashmap.rs', lines 206:4-219:5 *)
let rec hashMap_contains_key_in_list_loop
(t : Type0) (key : usize) (ls : list_t t) :
Tot (result bool)
@@ -227,13 +227,13 @@ let rec hashMap_contains_key_in_list_loop
end
(** [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]:
- Source: 'src/hashmap.rs', lines 206:4-206:68 *)
+ Source: 'tests/src/hashmap.rs', lines 206:4-206:68 *)
let hashMap_contains_key_in_list
(t : Type0) (key : usize) (ls : list_t t) : result bool =
hashMap_contains_key_in_list_loop t key ls
(** [hashmap::{hashmap::HashMap<T>}::contains_key]:
- Source: 'src/hashmap.rs', lines 199:4-199:49 *)
+ Source: 'tests/src/hashmap.rs', lines 199:4-199:49 *)
let hashMap_contains_key
(t : Type0) (self : hashMap_t t) (key : usize) : result bool =
let* hash = hash_key key in
@@ -246,7 +246,7 @@ let hashMap_contains_key
hashMap_contains_key_in_list t key l
(** [hashmap::{hashmap::HashMap<T>}::get_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 224:4-237:5 *)
+ Source: 'tests/src/hashmap.rs', lines 224:4-237:5 *)
let rec hashMap_get_in_list_loop
(t : Type0) (key : usize) (ls : list_t t) :
Tot (result t) (decreases (hashMap_get_in_list_loop_decreases t key ls))
@@ -258,12 +258,12 @@ let rec hashMap_get_in_list_loop
end
(** [hashmap::{hashmap::HashMap<T>}::get_in_list]:
- Source: 'src/hashmap.rs', lines 224:4-224:70 *)
+ Source: 'tests/src/hashmap.rs', lines 224:4-224:70 *)
let hashMap_get_in_list (t : Type0) (key : usize) (ls : list_t t) : result t =
hashMap_get_in_list_loop t key ls
(** [hashmap::{hashmap::HashMap<T>}::get]:
- Source: 'src/hashmap.rs', lines 239:4-239:55 *)
+ Source: 'tests/src/hashmap.rs', lines 239:4-239:55 *)
let hashMap_get (t : Type0) (self : hashMap_t t) (key : usize) : result t =
let* hash = hash_key key in
let i = alloc_vec_Vec_len (list_t t) self.slots in
@@ -275,7 +275,7 @@ let hashMap_get (t : Type0) (self : hashMap_t t) (key : usize) : result t =
hashMap_get_in_list t key l
(** [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 245:4-254:5 *)
+ Source: 'tests/src/hashmap.rs', lines 245:4-254:5 *)
let rec hashMap_get_mut_in_list_loop
(t : Type0) (ls : list_t t) (key : usize) :
Tot (result (t & (t -> result (list_t t))))
@@ -294,7 +294,7 @@ let rec hashMap_get_mut_in_list_loop
end
(** [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]:
- Source: 'src/hashmap.rs', lines 245:4-245:86 *)
+ Source: 'tests/src/hashmap.rs', lines 245:4-245:86 *)
let hashMap_get_mut_in_list
(t : Type0) (ls : list_t t) (key : usize) :
result (t & (t -> result (list_t t)))
@@ -302,7 +302,7 @@ let hashMap_get_mut_in_list
hashMap_get_mut_in_list_loop t ls key
(** [hashmap::{hashmap::HashMap<T>}::get_mut]:
- Source: 'src/hashmap.rs', lines 257:4-257:67 *)
+ Source: 'tests/src/hashmap.rs', lines 257:4-257:67 *)
let hashMap_get_mut
(t : Type0) (self : hashMap_t t) (key : usize) :
result (t & (t -> result (hashMap_t t)))
@@ -323,7 +323,7 @@ let hashMap_get_mut
Ok (x, back)
(** [hashmap::{hashmap::HashMap<T>}::remove_from_list]: loop 0:
- Source: 'src/hashmap.rs', lines 265:4-291:5 *)
+ Source: 'tests/src/hashmap.rs', lines 265:4-291:5 *)
let rec hashMap_remove_from_list_loop
(t : Type0) (key : usize) (ls : list_t t) :
Tot (result ((option t) & (list_t t)))
@@ -346,7 +346,7 @@ let rec hashMap_remove_from_list_loop
end
(** [hashmap::{hashmap::HashMap<T>}::remove_from_list]:
- Source: 'src/hashmap.rs', lines 265:4-265:69 *)
+ Source: 'tests/src/hashmap.rs', lines 265:4-265:69 *)
let hashMap_remove_from_list
(t : Type0) (key : usize) (ls : list_t t) :
result ((option t) & (list_t t))
@@ -354,7 +354,7 @@ let hashMap_remove_from_list
hashMap_remove_from_list_loop t key ls
(** [hashmap::{hashmap::HashMap<T>}::remove]:
- Source: 'src/hashmap.rs', lines 294:4-294:52 *)
+ Source: 'tests/src/hashmap.rs', lines 294:4-294:52 *)
let hashMap_remove
(t : Type0) (self : hashMap_t t) (key : usize) :
result ((option t) & (hashMap_t t))
@@ -376,7 +376,7 @@ let hashMap_remove
end
(** [hashmap::test1]:
- Source: 'src/hashmap.rs', lines 315:0-315:10 *)
+ Source: 'tests/src/hashmap.rs', lines 315:0-315:10 *)
let test1 : result unit =
let* hm = hashMap_new u64 in
let* hm1 = hashMap_insert u64 hm 0 42 in
diff --git a/tests/fstar/hashmap/Hashmap.Types.fst b/tests/fstar/hashmap/Hashmap.Types.fst
index ef96b1e9..ee06442f 100644
--- a/tests/fstar/hashmap/Hashmap.Types.fst
+++ b/tests/fstar/hashmap/Hashmap.Types.fst
@@ -6,13 +6,13 @@ open Primitives
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [hashmap::List]
- Source: 'src/hashmap.rs', lines 19:0-19:16 *)
+ Source: 'tests/src/hashmap.rs', lines 19:0-19:16 *)
type list_t (t : Type0) =
| List_Cons : usize -> t -> list_t t -> list_t t
| List_Nil : list_t t
(** [hashmap::HashMap]
- Source: 'src/hashmap.rs', lines 35:0-35:21 *)
+ Source: 'tests/src/hashmap.rs', lines 35:0-35:21 *)
type hashMap_t (t : Type0) =
{
num_entries : usize;
diff --git a/tests/fstar/hashmap_on_disk/HashmapMain.Clauses.Template.fst b/tests/fstar/hashmap_on_disk/HashmapMain.Clauses.Template.fst
index 7b274f59..0715bdcb 100644
--- a/tests/fstar/hashmap_on_disk/HashmapMain.Clauses.Template.fst
+++ b/tests/fstar/hashmap_on_disk/HashmapMain.Clauses.Template.fst
@@ -7,35 +7,35 @@ open HashmapMain.Types
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::allocate_slots]: decreases clause
- Source: 'src/hashmap.rs', lines 50:4-56:5 *)
+ Source: 'tests/src/hashmap.rs', lines 50:4-56:5 *)
unfold
let hashmap_HashMap_allocate_slots_loop_decreases (t : Type0)
(slots : alloc_vec_Vec (hashmap_List_t t)) (n : usize) : nat =
admit ()
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::clear]: decreases clause
- Source: 'src/hashmap.rs', lines 80:4-88:5 *)
+ Source: 'tests/src/hashmap.rs', lines 80:4-88:5 *)
unfold
let hashmap_HashMap_clear_loop_decreases (t : Type0)
(slots : alloc_vec_Vec (hashmap_List_t t)) (i : usize) : nat =
admit ()
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_in_list]: decreases clause
- Source: 'src/hashmap.rs', lines 97:4-114:5 *)
+ Source: 'tests/src/hashmap.rs', lines 97:4-114:5 *)
unfold
let hashmap_HashMap_insert_in_list_loop_decreases (t : Type0) (key : usize)
(value : t) (ls : hashmap_List_t t) : nat =
admit ()
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements_from_list]: decreases clause
- Source: 'src/hashmap.rs', lines 183:4-196:5 *)
+ Source: 'tests/src/hashmap.rs', lines 183:4-196:5 *)
unfold
let hashmap_HashMap_move_elements_from_list_loop_decreases (t : Type0)
(ntable : hashmap_HashMap_t t) (ls : hashmap_List_t t) : nat =
admit ()
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements]: decreases clause
- Source: 'src/hashmap.rs', lines 171:4-180:5 *)
+ Source: 'tests/src/hashmap.rs', lines 171:4-180:5 *)
unfold
let hashmap_HashMap_move_elements_loop_decreases (t : Type0)
(ntable : hashmap_HashMap_t t) (slots : alloc_vec_Vec (hashmap_List_t t))
@@ -43,28 +43,28 @@ let hashmap_HashMap_move_elements_loop_decreases (t : Type0)
admit ()
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key_in_list]: decreases clause
- Source: 'src/hashmap.rs', lines 206:4-219:5 *)
+ Source: 'tests/src/hashmap.rs', lines 206:4-219:5 *)
unfold
let hashmap_HashMap_contains_key_in_list_loop_decreases (t : Type0)
(key : usize) (ls : hashmap_List_t t) : nat =
admit ()
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_in_list]: decreases clause
- Source: 'src/hashmap.rs', lines 224:4-237:5 *)
+ Source: 'tests/src/hashmap.rs', lines 224:4-237:5 *)
unfold
let hashmap_HashMap_get_in_list_loop_decreases (t : Type0) (key : usize)
(ls : hashmap_List_t t) : nat =
admit ()
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut_in_list]: decreases clause
- Source: 'src/hashmap.rs', lines 245:4-254:5 *)
+ Source: 'tests/src/hashmap.rs', lines 245:4-254:5 *)
unfold
let hashmap_HashMap_get_mut_in_list_loop_decreases (t : Type0)
(ls : hashmap_List_t t) (key : usize) : nat =
admit ()
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove_from_list]: decreases clause
- Source: 'src/hashmap.rs', lines 265:4-291:5 *)
+ Source: 'tests/src/hashmap.rs', lines 265:4-291:5 *)
unfold
let hashmap_HashMap_remove_from_list_loop_decreases (t : Type0) (key : usize)
(ls : hashmap_List_t t) : nat =
diff --git a/tests/fstar/hashmap_on_disk/HashmapMain.Funs.fst b/tests/fstar/hashmap_on_disk/HashmapMain.Funs.fst
index ff86e087..4a032207 100644
--- a/tests/fstar/hashmap_on_disk/HashmapMain.Funs.fst
+++ b/tests/fstar/hashmap_on_disk/HashmapMain.Funs.fst
@@ -9,12 +9,12 @@ include HashmapMain.Clauses
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [hashmap_main::hashmap::hash_key]:
- Source: 'src/hashmap.rs', lines 27:0-27:32 *)
+ Source: 'tests/src/hashmap.rs', lines 27:0-27:32 *)
let hashmap_hash_key (k : usize) : result usize =
Ok k
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::allocate_slots]: loop 0:
- Source: 'src/hashmap.rs', lines 50:4-56:5 *)
+ Source: 'tests/src/hashmap.rs', lines 50:4-56:5 *)
let rec hashmap_HashMap_allocate_slots_loop
(t : Type0) (slots : alloc_vec_Vec (hashmap_List_t t)) (n : usize) :
Tot (result (alloc_vec_Vec (hashmap_List_t t)))
@@ -29,7 +29,7 @@ let rec hashmap_HashMap_allocate_slots_loop
else Ok slots
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::allocate_slots]:
- Source: 'src/hashmap.rs', lines 50:4-50:76 *)
+ Source: 'tests/src/hashmap.rs', lines 50:4-50:76 *)
let hashmap_HashMap_allocate_slots
(t : Type0) (slots : alloc_vec_Vec (hashmap_List_t t)) (n : usize) :
result (alloc_vec_Vec (hashmap_List_t t))
@@ -37,7 +37,7 @@ let hashmap_HashMap_allocate_slots
hashmap_HashMap_allocate_slots_loop t slots n
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::new_with_capacity]:
- Source: 'src/hashmap.rs', lines 59:4-63:13 *)
+ Source: 'tests/src/hashmap.rs', lines 59:4-63:13 *)
let hashmap_HashMap_new_with_capacity
(t : Type0) (capacity : usize) (max_load_dividend : usize)
(max_load_divisor : usize) :
@@ -57,12 +57,12 @@ let hashmap_HashMap_new_with_capacity
}
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::new]:
- Source: 'src/hashmap.rs', lines 75:4-75:24 *)
+ Source: 'tests/src/hashmap.rs', lines 75:4-75:24 *)
let hashmap_HashMap_new (t : Type0) : result (hashmap_HashMap_t t) =
hashmap_HashMap_new_with_capacity t 32 4 5
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::clear]: loop 0:
- Source: 'src/hashmap.rs', lines 80:4-88:5 *)
+ Source: 'tests/src/hashmap.rs', lines 80:4-88:5 *)
let rec hashmap_HashMap_clear_loop
(t : Type0) (slots : alloc_vec_Vec (hashmap_List_t t)) (i : usize) :
Tot (result (alloc_vec_Vec (hashmap_List_t t)))
@@ -81,20 +81,20 @@ let rec hashmap_HashMap_clear_loop
else Ok slots
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::clear]:
- Source: 'src/hashmap.rs', lines 80:4-80:27 *)
+ Source: 'tests/src/hashmap.rs', lines 80:4-80:27 *)
let hashmap_HashMap_clear
(t : Type0) (self : hashmap_HashMap_t t) : result (hashmap_HashMap_t t) =
let* hm = hashmap_HashMap_clear_loop t self.slots 0 in
Ok { self with num_entries = 0; slots = hm }
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::len]:
- Source: 'src/hashmap.rs', lines 90:4-90:30 *)
+ Source: 'tests/src/hashmap.rs', lines 90:4-90:30 *)
let hashmap_HashMap_len
(t : Type0) (self : hashmap_HashMap_t t) : result usize =
Ok self.num_entries
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 97:4-114:5 *)
+ Source: 'tests/src/hashmap.rs', lines 97:4-114:5 *)
let rec hashmap_HashMap_insert_in_list_loop
(t : Type0) (key : usize) (value : t) (ls : hashmap_List_t t) :
Tot (result (bool & (hashmap_List_t t)))
@@ -111,7 +111,7 @@ let rec hashmap_HashMap_insert_in_list_loop
end
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_in_list]:
- Source: 'src/hashmap.rs', lines 97:4-97:71 *)
+ Source: 'tests/src/hashmap.rs', lines 97:4-97:71 *)
let hashmap_HashMap_insert_in_list
(t : Type0) (key : usize) (value : t) (ls : hashmap_List_t t) :
result (bool & (hashmap_List_t t))
@@ -119,7 +119,7 @@ let hashmap_HashMap_insert_in_list
hashmap_HashMap_insert_in_list_loop t key value ls
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_no_resize]:
- Source: 'src/hashmap.rs', lines 117:4-117:54 *)
+ Source: 'tests/src/hashmap.rs', lines 117:4-117:54 *)
let hashmap_HashMap_insert_no_resize
(t : Type0) (self : hashmap_HashMap_t t) (key : usize) (value : t) :
result (hashmap_HashMap_t t)
@@ -140,7 +140,7 @@ let hashmap_HashMap_insert_no_resize
else let* v = index_mut_back l1 in Ok { self with slots = v }
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements_from_list]: loop 0:
- Source: 'src/hashmap.rs', lines 183:4-196:5 *)
+ Source: 'tests/src/hashmap.rs', lines 183:4-196:5 *)
let rec hashmap_HashMap_move_elements_from_list_loop
(t : Type0) (ntable : hashmap_HashMap_t t) (ls : hashmap_List_t t) :
Tot (result (hashmap_HashMap_t t))
@@ -155,7 +155,7 @@ let rec hashmap_HashMap_move_elements_from_list_loop
end
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements_from_list]:
- Source: 'src/hashmap.rs', lines 183:4-183:72 *)
+ Source: 'tests/src/hashmap.rs', lines 183:4-183:72 *)
let hashmap_HashMap_move_elements_from_list
(t : Type0) (ntable : hashmap_HashMap_t t) (ls : hashmap_List_t t) :
result (hashmap_HashMap_t t)
@@ -163,7 +163,7 @@ let hashmap_HashMap_move_elements_from_list
hashmap_HashMap_move_elements_from_list_loop t ntable ls
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements]: loop 0:
- Source: 'src/hashmap.rs', lines 171:4-180:5 *)
+ Source: 'tests/src/hashmap.rs', lines 171:4-180:5 *)
let rec hashmap_HashMap_move_elements_loop
(t : Type0) (ntable : hashmap_HashMap_t t)
(slots : alloc_vec_Vec (hashmap_List_t t)) (i : usize) :
@@ -185,7 +185,7 @@ let rec hashmap_HashMap_move_elements_loop
else Ok (ntable, slots)
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements]:
- Source: 'src/hashmap.rs', lines 171:4-171:95 *)
+ Source: 'tests/src/hashmap.rs', lines 171:4-171:95 *)
let hashmap_HashMap_move_elements
(t : Type0) (ntable : hashmap_HashMap_t t)
(slots : alloc_vec_Vec (hashmap_List_t t)) (i : usize) :
@@ -194,7 +194,7 @@ let hashmap_HashMap_move_elements
hashmap_HashMap_move_elements_loop t ntable slots i
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::try_resize]:
- Source: 'src/hashmap.rs', lines 140:4-140:28 *)
+ Source: 'tests/src/hashmap.rs', lines 140:4-140:28 *)
let hashmap_HashMap_try_resize
(t : Type0) (self : hashmap_HashMap_t t) : result (hashmap_HashMap_t t) =
let* max_usize = scalar_cast U32 Usize core_u32_max in
@@ -214,7 +214,7 @@ let hashmap_HashMap_try_resize
else Ok { self with max_load_factor = (i, i1) }
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert]:
- Source: 'src/hashmap.rs', lines 129:4-129:48 *)
+ Source: 'tests/src/hashmap.rs', lines 129:4-129:48 *)
let hashmap_HashMap_insert
(t : Type0) (self : hashmap_HashMap_t t) (key : usize) (value : t) :
result (hashmap_HashMap_t t)
@@ -224,7 +224,7 @@ let hashmap_HashMap_insert
if i > self1.max_load then hashmap_HashMap_try_resize t self1 else Ok self1
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 206:4-219:5 *)
+ Source: 'tests/src/hashmap.rs', lines 206:4-219:5 *)
let rec hashmap_HashMap_contains_key_in_list_loop
(t : Type0) (key : usize) (ls : hashmap_List_t t) :
Tot (result bool)
@@ -239,13 +239,13 @@ let rec hashmap_HashMap_contains_key_in_list_loop
end
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key_in_list]:
- Source: 'src/hashmap.rs', lines 206:4-206:68 *)
+ Source: 'tests/src/hashmap.rs', lines 206:4-206:68 *)
let hashmap_HashMap_contains_key_in_list
(t : Type0) (key : usize) (ls : hashmap_List_t t) : result bool =
hashmap_HashMap_contains_key_in_list_loop t key ls
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key]:
- Source: 'src/hashmap.rs', lines 199:4-199:49 *)
+ Source: 'tests/src/hashmap.rs', lines 199:4-199:49 *)
let hashmap_HashMap_contains_key
(t : Type0) (self : hashmap_HashMap_t t) (key : usize) : result bool =
let* hash = hashmap_hash_key key in
@@ -258,7 +258,7 @@ let hashmap_HashMap_contains_key
hashmap_HashMap_contains_key_in_list t key l
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 224:4-237:5 *)
+ Source: 'tests/src/hashmap.rs', lines 224:4-237:5 *)
let rec hashmap_HashMap_get_in_list_loop
(t : Type0) (key : usize) (ls : hashmap_List_t t) :
Tot (result t)
@@ -271,13 +271,13 @@ let rec hashmap_HashMap_get_in_list_loop
end
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_in_list]:
- Source: 'src/hashmap.rs', lines 224:4-224:70 *)
+ Source: 'tests/src/hashmap.rs', lines 224:4-224:70 *)
let hashmap_HashMap_get_in_list
(t : Type0) (key : usize) (ls : hashmap_List_t t) : result t =
hashmap_HashMap_get_in_list_loop t key ls
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get]:
- Source: 'src/hashmap.rs', lines 239:4-239:55 *)
+ Source: 'tests/src/hashmap.rs', lines 239:4-239:55 *)
let hashmap_HashMap_get
(t : Type0) (self : hashmap_HashMap_t t) (key : usize) : result t =
let* hash = hashmap_hash_key key in
@@ -290,7 +290,7 @@ let hashmap_HashMap_get
hashmap_HashMap_get_in_list t key l
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 245:4-254:5 *)
+ Source: 'tests/src/hashmap.rs', lines 245:4-254:5 *)
let rec hashmap_HashMap_get_mut_in_list_loop
(t : Type0) (ls : hashmap_List_t t) (key : usize) :
Tot (result (t & (t -> result (hashmap_List_t t))))
@@ -312,7 +312,7 @@ let rec hashmap_HashMap_get_mut_in_list_loop
end
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut_in_list]:
- Source: 'src/hashmap.rs', lines 245:4-245:86 *)
+ Source: 'tests/src/hashmap.rs', lines 245:4-245:86 *)
let hashmap_HashMap_get_mut_in_list
(t : Type0) (ls : hashmap_List_t t) (key : usize) :
result (t & (t -> result (hashmap_List_t t)))
@@ -320,7 +320,7 @@ let hashmap_HashMap_get_mut_in_list
hashmap_HashMap_get_mut_in_list_loop t ls key
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut]:
- Source: 'src/hashmap.rs', lines 257:4-257:67 *)
+ Source: 'tests/src/hashmap.rs', lines 257:4-257:67 *)
let hashmap_HashMap_get_mut
(t : Type0) (self : hashmap_HashMap_t t) (key : usize) :
result (t & (t -> result (hashmap_HashMap_t t)))
@@ -341,7 +341,7 @@ let hashmap_HashMap_get_mut
Ok (x, back)
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove_from_list]: loop 0:
- Source: 'src/hashmap.rs', lines 265:4-291:5 *)
+ Source: 'tests/src/hashmap.rs', lines 265:4-291:5 *)
let rec hashmap_HashMap_remove_from_list_loop
(t : Type0) (key : usize) (ls : hashmap_List_t t) :
Tot (result ((option t) & (hashmap_List_t t)))
@@ -365,7 +365,7 @@ let rec hashmap_HashMap_remove_from_list_loop
end
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove_from_list]:
- Source: 'src/hashmap.rs', lines 265:4-265:69 *)
+ Source: 'tests/src/hashmap.rs', lines 265:4-265:69 *)
let hashmap_HashMap_remove_from_list
(t : Type0) (key : usize) (ls : hashmap_List_t t) :
result ((option t) & (hashmap_List_t t))
@@ -373,7 +373,7 @@ let hashmap_HashMap_remove_from_list
hashmap_HashMap_remove_from_list_loop t key ls
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove]:
- Source: 'src/hashmap.rs', lines 294:4-294:52 *)
+ Source: 'tests/src/hashmap.rs', lines 294:4-294:52 *)
let hashmap_HashMap_remove
(t : Type0) (self : hashmap_HashMap_t t) (key : usize) :
result ((option t) & (hashmap_HashMap_t t))
@@ -395,7 +395,7 @@ let hashmap_HashMap_remove
end
(** [hashmap_main::hashmap::test1]:
- Source: 'src/hashmap.rs', lines 315:0-315:10 *)
+ Source: 'tests/src/hashmap.rs', lines 315:0-315:10 *)
let hashmap_test1 : result unit =
let* hm = hashmap_HashMap_new u64 in
let* hm1 = hashmap_HashMap_insert u64 hm 0 42 in
@@ -432,7 +432,7 @@ let hashmap_test1 : result unit =
end
(** [hashmap_main::insert_on_disk]:
- Source: 'src/hashmap_main.rs', lines 7:0-7:43 *)
+ Source: 'tests/src/hashmap_main.rs', lines 7:0-7:43 *)
let insert_on_disk
(key : usize) (value : u64) (st : state) : result (state & unit) =
let* (st1, hm) = hashmap_utils_deserialize st in
@@ -440,7 +440,7 @@ let insert_on_disk
hashmap_utils_serialize hm1 st1
(** [hashmap_main::main]:
- Source: 'src/hashmap_main.rs', lines 16:0-16:13 *)
+ Source: 'tests/src/hashmap_main.rs', lines 16:0-16:13 *)
let main : result unit =
Ok ()
diff --git a/tests/fstar/hashmap_on_disk/HashmapMain.FunsExternal.fsti b/tests/fstar/hashmap_on_disk/HashmapMain.FunsExternal.fsti
index 50a6509f..3afc4689 100644
--- a/tests/fstar/hashmap_on_disk/HashmapMain.FunsExternal.fsti
+++ b/tests/fstar/hashmap_on_disk/HashmapMain.FunsExternal.fsti
@@ -7,12 +7,12 @@ include HashmapMain.Types
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [hashmap_main::hashmap_utils::deserialize]:
- Source: 'src/hashmap_utils.rs', lines 10:0-10:43 *)
+ Source: 'tests/src/hashmap_utils.rs', lines 10:0-10:43 *)
val hashmap_utils_deserialize
: state -> result (state & (hashmap_HashMap_t u64))
(** [hashmap_main::hashmap_utils::serialize]:
- Source: 'src/hashmap_utils.rs', lines 5:0-5:42 *)
+ Source: 'tests/src/hashmap_utils.rs', lines 5:0-5:42 *)
val hashmap_utils_serialize
: hashmap_HashMap_t u64 -> state -> result (state & unit)
diff --git a/tests/fstar/hashmap_on_disk/HashmapMain.Types.fst b/tests/fstar/hashmap_on_disk/HashmapMain.Types.fst
index afebcde3..21d32541 100644
--- a/tests/fstar/hashmap_on_disk/HashmapMain.Types.fst
+++ b/tests/fstar/hashmap_on_disk/HashmapMain.Types.fst
@@ -7,13 +7,13 @@ include HashmapMain.TypesExternal
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [hashmap_main::hashmap::List]
- Source: 'src/hashmap.rs', lines 19:0-19:16 *)
+ Source: 'tests/src/hashmap.rs', lines 19:0-19:16 *)
type hashmap_List_t (t : Type0) =
| Hashmap_List_Cons : usize -> t -> hashmap_List_t t -> hashmap_List_t t
| Hashmap_List_Nil : hashmap_List_t t
(** [hashmap_main::hashmap::HashMap]
- Source: 'src/hashmap.rs', lines 35:0-35:21 *)
+ Source: 'tests/src/hashmap.rs', lines 35:0-35:21 *)
type hashmap_HashMap_t (t : Type0) =
{
num_entries : usize;
diff --git a/tests/fstar/misc/Bitwise.fst b/tests/fstar/misc/Bitwise.fst
index 11ef6861..b17c9233 100644
--- a/tests/fstar/misc/Bitwise.fst
+++ b/tests/fstar/misc/Bitwise.fst
@@ -6,27 +6,27 @@ open Primitives
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [bitwise::shift_u32]:
- Source: 'src/bitwise.rs', lines 3:0-3:31 *)
+ Source: 'tests/src/bitwise.rs', lines 3:0-3:31 *)
let shift_u32 (a : u32) : result u32 =
let* t = u32_shr #Usize a 16 in u32_shl #Usize t 16
(** [bitwise::shift_i32]:
- Source: 'src/bitwise.rs', lines 10:0-10:31 *)
+ Source: 'tests/src/bitwise.rs', lines 10:0-10:31 *)
let shift_i32 (a : i32) : result i32 =
let* t = i32_shr #Isize a 16 in i32_shl #Isize t 16
(** [bitwise::xor_u32]:
- Source: 'src/bitwise.rs', lines 17:0-17:37 *)
+ Source: 'tests/src/bitwise.rs', lines 17:0-17:37 *)
let xor_u32 (a : u32) (b : u32) : result u32 =
Ok (u32_xor a b)
(** [bitwise::or_u32]:
- Source: 'src/bitwise.rs', lines 21:0-21:36 *)
+ Source: 'tests/src/bitwise.rs', lines 21:0-21:36 *)
let or_u32 (a : u32) (b : u32) : result u32 =
Ok (u32_or a b)
(** [bitwise::and_u32]:
- Source: 'src/bitwise.rs', lines 25:0-25:37 *)
+ Source: 'tests/src/bitwise.rs', lines 25:0-25:37 *)
let and_u32 (a : u32) (b : u32) : result u32 =
Ok (u32_and a b)
diff --git a/tests/fstar/misc/Constants.fst b/tests/fstar/misc/Constants.fst
index 4fbafb83..78562ae1 100644
--- a/tests/fstar/misc/Constants.fst
+++ b/tests/fstar/misc/Constants.fst
@@ -6,154 +6,154 @@ open Primitives
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [constants::X0]
- Source: 'src/constants.rs', lines 5:0-5:17 *)
+ Source: 'tests/src/constants.rs', lines 5:0-5:17 *)
let x0_body : result u32 = Ok 0
let x0 : u32 = eval_global x0_body
(** [constants::X1]
- Source: 'src/constants.rs', lines 7:0-7:17 *)
+ Source: 'tests/src/constants.rs', lines 7:0-7:17 *)
let x1_body : result u32 = Ok core_u32_max
let x1 : u32 = eval_global x1_body
(** [constants::X2]
- Source: 'src/constants.rs', lines 10:0-10:17 *)
+ Source: 'tests/src/constants.rs', lines 10:0-10:17 *)
let x2_body : result u32 = Ok 3
let x2 : u32 = eval_global x2_body
(** [constants::incr]:
- Source: 'src/constants.rs', lines 17:0-17:32 *)
+ Source: 'tests/src/constants.rs', lines 17:0-17:32 *)
let incr (n : u32) : result u32 =
u32_add n 1
(** [constants::X3]
- Source: 'src/constants.rs', lines 15:0-15:17 *)
+ Source: 'tests/src/constants.rs', lines 15:0-15:17 *)
let x3_body : result u32 = incr 32
let x3 : u32 = eval_global x3_body
(** [constants::mk_pair0]:
- Source: 'src/constants.rs', lines 23:0-23:51 *)
+ Source: 'tests/src/constants.rs', lines 23:0-23:51 *)
let mk_pair0 (x : u32) (y1 : u32) : result (u32 & u32) =
Ok (x, y1)
(** [constants::Pair]
- Source: 'src/constants.rs', lines 36:0-36:23 *)
+ Source: 'tests/src/constants.rs', lines 36:0-36:23 *)
type pair_t (t1 t2 : Type0) = { x : t1; y : t2; }
(** [constants::mk_pair1]:
- Source: 'src/constants.rs', lines 27:0-27:55 *)
+ Source: 'tests/src/constants.rs', lines 27:0-27:55 *)
let mk_pair1 (x : u32) (y1 : u32) : result (pair_t u32 u32) =
Ok { x = x; y = y1 }
(** [constants::P0]
- Source: 'src/constants.rs', lines 31:0-31:24 *)
+ Source: 'tests/src/constants.rs', lines 31:0-31:24 *)
let p0_body : result (u32 & u32) = mk_pair0 0 1
let p0 : (u32 & u32) = eval_global p0_body
(** [constants::P1]
- Source: 'src/constants.rs', lines 32:0-32:28 *)
+ Source: 'tests/src/constants.rs', lines 32:0-32:28 *)
let p1_body : result (pair_t u32 u32) = mk_pair1 0 1
let p1 : pair_t u32 u32 = eval_global p1_body
(** [constants::P2]
- Source: 'src/constants.rs', lines 33:0-33:24 *)
+ Source: 'tests/src/constants.rs', lines 33:0-33:24 *)
let p2_body : result (u32 & u32) = Ok (0, 1)
let p2 : (u32 & u32) = eval_global p2_body
(** [constants::P3]
- Source: 'src/constants.rs', lines 34:0-34:28 *)
+ Source: 'tests/src/constants.rs', lines 34:0-34:28 *)
let p3_body : result (pair_t u32 u32) = Ok { x = 0; y = 1 }
let p3 : pair_t u32 u32 = eval_global p3_body
(** [constants::Wrap]
- Source: 'src/constants.rs', lines 49:0-49:18 *)
+ Source: 'tests/src/constants.rs', lines 49:0-49:18 *)
type wrap_t (t : Type0) = { value : t; }
(** [constants::{constants::Wrap<T>}::new]:
- Source: 'src/constants.rs', lines 54:4-54:41 *)
+ Source: 'tests/src/constants.rs', lines 54:4-54:41 *)
let wrap_new (t : Type0) (value : t) : result (wrap_t t) =
Ok { value = value }
(** [constants::Y]
- Source: 'src/constants.rs', lines 41:0-41:22 *)
+ Source: 'tests/src/constants.rs', lines 41:0-41:22 *)
let y_body : result (wrap_t i32) = wrap_new i32 2
let y : wrap_t i32 = eval_global y_body
(** [constants::unwrap_y]:
- Source: 'src/constants.rs', lines 43:0-43:30 *)
+ Source: 'tests/src/constants.rs', lines 43:0-43:30 *)
let unwrap_y : result i32 =
Ok y.value
(** [constants::YVAL]
- Source: 'src/constants.rs', lines 47:0-47:19 *)
+ Source: 'tests/src/constants.rs', lines 47:0-47:19 *)
let yval_body : result i32 = unwrap_y
let yval : i32 = eval_global yval_body
(** [constants::get_z1::Z1]
- Source: 'src/constants.rs', lines 62:4-62:17 *)
+ Source: 'tests/src/constants.rs', lines 62:4-62:17 *)
let get_z1_z1_body : result i32 = Ok 3
let get_z1_z1 : i32 = eval_global get_z1_z1_body
(** [constants::get_z1]:
- Source: 'src/constants.rs', lines 61:0-61:28 *)
+ Source: 'tests/src/constants.rs', lines 61:0-61:28 *)
let get_z1 : result i32 =
Ok get_z1_z1
(** [constants::add]:
- Source: 'src/constants.rs', lines 66:0-66:39 *)
+ Source: 'tests/src/constants.rs', lines 66:0-66:39 *)
let add (a : i32) (b : i32) : result i32 =
i32_add a b
(** [constants::Q1]
- Source: 'src/constants.rs', lines 74:0-74:17 *)
+ Source: 'tests/src/constants.rs', lines 74:0-74:17 *)
let q1_body : result i32 = Ok 5
let q1 : i32 = eval_global q1_body
(** [constants::Q2]
- Source: 'src/constants.rs', lines 75:0-75:17 *)
+ Source: 'tests/src/constants.rs', lines 75:0-75:17 *)
let q2_body : result i32 = Ok q1
let q2 : i32 = eval_global q2_body
(** [constants::Q3]
- Source: 'src/constants.rs', lines 76:0-76:17 *)
+ Source: 'tests/src/constants.rs', lines 76:0-76:17 *)
let q3_body : result i32 = add q2 3
let q3 : i32 = eval_global q3_body
(** [constants::get_z2]:
- Source: 'src/constants.rs', lines 70:0-70:28 *)
+ Source: 'tests/src/constants.rs', lines 70:0-70:28 *)
let get_z2 : result i32 =
let* i = get_z1 in let* i1 = add i q3 in add q1 i1
(** [constants::S1]
- Source: 'src/constants.rs', lines 80:0-80:18 *)
+ Source: 'tests/src/constants.rs', lines 80:0-80:18 *)
let s1_body : result u32 = Ok 6
let s1 : u32 = eval_global s1_body
(** [constants::S2]
- Source: 'src/constants.rs', lines 81:0-81:18 *)
+ Source: 'tests/src/constants.rs', lines 81:0-81:18 *)
let s2_body : result u32 = incr s1
let s2 : u32 = eval_global s2_body
(** [constants::S3]
- Source: 'src/constants.rs', lines 82:0-82:29 *)
+ Source: 'tests/src/constants.rs', lines 82:0-82:29 *)
let s3_body : result (pair_t u32 u32) = Ok p3
let s3 : pair_t u32 u32 = eval_global s3_body
(** [constants::S4]
- Source: 'src/constants.rs', lines 83:0-83:29 *)
+ Source: 'tests/src/constants.rs', lines 83:0-83:29 *)
let s4_body : result (pair_t u32 u32) = mk_pair1 7 8
let s4 : pair_t u32 u32 = eval_global s4_body
(** [constants::V]
- Source: 'src/constants.rs', lines 86:0-86:31 *)
+ Source: 'tests/src/constants.rs', lines 86:0-86:31 *)
type v_t (t : Type0) (n : usize) = { x : array t n; }
(** [constants::{constants::V<T, N>#1}::LEN]
- Source: 'src/constants.rs', lines 91:4-91:24 *)
+ Source: 'tests/src/constants.rs', lines 91:4-91:24 *)
let v_len_body (t : Type0) (n : usize) : result usize = Ok n
let v_len (t : Type0) (n : usize) : usize = eval_global (v_len_body t n)
(** [constants::use_v]:
- Source: 'src/constants.rs', lines 94:0-94:42 *)
+ Source: 'tests/src/constants.rs', lines 94:0-94:42 *)
let use_v (t : Type0) (n : usize) : result usize =
Ok (v_len t n)
diff --git a/tests/fstar/misc/External.Funs.fst b/tests/fstar/misc/External.Funs.fst
index 3b99ef25..5a7a9f32 100644
--- a/tests/fstar/misc/External.Funs.fst
+++ b/tests/fstar/misc/External.Funs.fst
@@ -15,12 +15,12 @@ let core_marker_CopyU32 : core_marker_Copy_t u32 = {
}
(** [external::use_get]:
- Source: 'src/external.rs', lines 5:0-5:37 *)
+ Source: 'tests/src/external.rs', lines 5:0-5:37 *)
let 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: 'src/external.rs', lines 9:0-9:31 *)
+ Source: 'tests/src/external.rs', lines 9:0-9:31 *)
let incr
(rc : core_cell_Cell_t u32) (st : state) :
result (state & (core_cell_Cell_t u32))
diff --git a/tests/fstar/misc/Loops.Clauses.Template.fst b/tests/fstar/misc/Loops.Clauses.Template.fst
index e43f8170..77f9c3e4 100644
--- a/tests/fstar/misc/Loops.Clauses.Template.fst
+++ b/tests/fstar/misc/Loops.Clauses.Template.fst
@@ -7,144 +7,144 @@ open Loops.Types
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [loops::sum]: decreases clause
- Source: 'src/loops.rs', lines 4:0-14:1 *)
+ Source: 'tests/src/loops.rs', lines 4:0-14:1 *)
unfold let sum_loop_decreases (max : u32) (i : u32) (s : u32) : nat = admit ()
(** [loops::sum_with_mut_borrows]: decreases clause
- Source: 'src/loops.rs', lines 19:0-31:1 *)
+ Source: 'tests/src/loops.rs', lines 19:0-31:1 *)
unfold
let sum_with_mut_borrows_loop_decreases (max : u32) (i : u32) (s : u32) : nat =
admit ()
(** [loops::sum_with_shared_borrows]: decreases clause
- Source: 'src/loops.rs', lines 34:0-48:1 *)
+ Source: 'tests/src/loops.rs', lines 34:0-48:1 *)
unfold
let sum_with_shared_borrows_loop_decreases (max : u32) (i : u32) (s : u32) :
nat =
admit ()
(** [loops::sum_array]: decreases clause
- Source: 'src/loops.rs', lines 50:0-58:1 *)
+ Source: 'tests/src/loops.rs', lines 50:0-58:1 *)
unfold
let sum_array_loop_decreases (n : usize) (a : array u32 n) (i : usize)
(s : u32) : nat =
admit ()
(** [loops::clear]: decreases clause
- Source: 'src/loops.rs', lines 62:0-68:1 *)
+ Source: 'tests/src/loops.rs', lines 62:0-68:1 *)
unfold
let clear_loop_decreases (v : alloc_vec_Vec u32) (i : usize) : nat = admit ()
(** [loops::list_mem]: decreases clause
- Source: 'src/loops.rs', lines 76:0-85:1 *)
+ Source: 'tests/src/loops.rs', lines 76:0-85:1 *)
unfold let list_mem_loop_decreases (x : u32) (ls : list_t u32) : nat = admit ()
(** [loops::list_nth_mut_loop]: decreases clause
- Source: 'src/loops.rs', lines 88:0-98:1 *)
+ Source: 'tests/src/loops.rs', lines 88:0-98:1 *)
unfold
let list_nth_mut_loop_loop_decreases (t : Type0) (ls : list_t t) (i : u32) :
nat =
admit ()
(** [loops::list_nth_shared_loop]: decreases clause
- Source: 'src/loops.rs', lines 101:0-111:1 *)
+ Source: 'tests/src/loops.rs', lines 101:0-111:1 *)
unfold
let list_nth_shared_loop_loop_decreases (t : Type0) (ls : list_t t) (i : u32) :
nat =
admit ()
(** [loops::get_elem_mut]: decreases clause
- Source: 'src/loops.rs', lines 113:0-127:1 *)
+ Source: 'tests/src/loops.rs', lines 113:0-127:1 *)
unfold
let get_elem_mut_loop_decreases (x : usize) (ls : list_t usize) : nat =
admit ()
(** [loops::get_elem_shared]: decreases clause
- Source: 'src/loops.rs', lines 129:0-143:1 *)
+ Source: 'tests/src/loops.rs', lines 129:0-143:1 *)
unfold
let get_elem_shared_loop_decreases (x : usize) (ls : list_t usize) : nat =
admit ()
(** [loops::list_nth_mut_loop_with_id]: decreases clause
- Source: 'src/loops.rs', lines 154:0-165:1 *)
+ Source: 'tests/src/loops.rs', lines 154:0-165:1 *)
unfold
let list_nth_mut_loop_with_id_loop_decreases (t : Type0) (i : u32)
(ls : list_t t) : nat =
admit ()
(** [loops::list_nth_shared_loop_with_id]: decreases clause
- Source: 'src/loops.rs', lines 168:0-179:1 *)
+ Source: 'tests/src/loops.rs', lines 168:0-179:1 *)
unfold
let list_nth_shared_loop_with_id_loop_decreases (t : Type0) (i : u32)
(ls : list_t t) : nat =
admit ()
(** [loops::list_nth_mut_loop_pair]: decreases clause
- Source: 'src/loops.rs', lines 184:0-205:1 *)
+ Source: 'tests/src/loops.rs', lines 184:0-205:1 *)
unfold
let list_nth_mut_loop_pair_loop_decreases (t : Type0) (ls0 : list_t t)
(ls1 : list_t t) (i : u32) : nat =
admit ()
(** [loops::list_nth_shared_loop_pair]: decreases clause
- Source: 'src/loops.rs', lines 208:0-229:1 *)
+ Source: 'tests/src/loops.rs', lines 208:0-229:1 *)
unfold
let list_nth_shared_loop_pair_loop_decreases (t : Type0) (ls0 : list_t t)
(ls1 : list_t t) (i : u32) : nat =
admit ()
(** [loops::list_nth_mut_loop_pair_merge]: decreases clause
- Source: 'src/loops.rs', lines 233:0-248:1 *)
+ Source: 'tests/src/loops.rs', lines 233:0-248:1 *)
unfold
let list_nth_mut_loop_pair_merge_loop_decreases (t : Type0) (ls0 : list_t t)
(ls1 : list_t t) (i : u32) : nat =
admit ()
(** [loops::list_nth_shared_loop_pair_merge]: decreases clause
- Source: 'src/loops.rs', lines 251:0-266:1 *)
+ Source: 'tests/src/loops.rs', lines 251:0-266:1 *)
unfold
let list_nth_shared_loop_pair_merge_loop_decreases (t : Type0) (ls0 : list_t t)
(ls1 : list_t t) (i : u32) : nat =
admit ()
(** [loops::list_nth_mut_shared_loop_pair]: decreases clause
- Source: 'src/loops.rs', lines 269:0-284:1 *)
+ Source: 'tests/src/loops.rs', lines 269:0-284:1 *)
unfold
let list_nth_mut_shared_loop_pair_loop_decreases (t : Type0) (ls0 : list_t t)
(ls1 : list_t t) (i : u32) : nat =
admit ()
(** [loops::list_nth_mut_shared_loop_pair_merge]: decreases clause
- Source: 'src/loops.rs', lines 288:0-303:1 *)
+ Source: 'tests/src/loops.rs', lines 288:0-303:1 *)
unfold
let list_nth_mut_shared_loop_pair_merge_loop_decreases (t : Type0)
(ls0 : list_t t) (ls1 : list_t t) (i : u32) : nat =
admit ()
(** [loops::list_nth_shared_mut_loop_pair]: decreases clause
- Source: 'src/loops.rs', lines 307:0-322:1 *)
+ Source: 'tests/src/loops.rs', lines 307:0-322:1 *)
unfold
let list_nth_shared_mut_loop_pair_loop_decreases (t : Type0) (ls0 : list_t t)
(ls1 : list_t t) (i : u32) : nat =
admit ()
(** [loops::list_nth_shared_mut_loop_pair_merge]: decreases clause
- Source: 'src/loops.rs', lines 326:0-341:1 *)
+ Source: 'tests/src/loops.rs', lines 326:0-341:1 *)
unfold
let list_nth_shared_mut_loop_pair_merge_loop_decreases (t : Type0)
(ls0 : list_t t) (ls1 : list_t t) (i : u32) : nat =
admit ()
(** [loops::ignore_input_mut_borrow]: decreases clause
- Source: 'src/loops.rs', lines 345:0-349:1 *)
+ Source: 'tests/src/loops.rs', lines 345:0-349:1 *)
unfold let ignore_input_mut_borrow_loop_decreases (i : u32) : nat = admit ()
(** [loops::incr_ignore_input_mut_borrow]: decreases clause
- Source: 'src/loops.rs', lines 353:0-358:1 *)
+ Source: 'tests/src/loops.rs', lines 353:0-358:1 *)
unfold
let incr_ignore_input_mut_borrow_loop_decreases (i : u32) : nat = admit ()
(** [loops::ignore_input_shared_borrow]: decreases clause
- Source: 'src/loops.rs', lines 362:0-366:1 *)
+ Source: 'tests/src/loops.rs', lines 362:0-366:1 *)
unfold let ignore_input_shared_borrow_loop_decreases (i : u32) : nat = admit ()
diff --git a/tests/fstar/misc/Loops.Funs.fst b/tests/fstar/misc/Loops.Funs.fst
index 26cb91d2..0eafeebb 100644
--- a/tests/fstar/misc/Loops.Funs.fst
+++ b/tests/fstar/misc/Loops.Funs.fst
@@ -8,7 +8,7 @@ include Loops.Clauses
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [loops::sum]: loop 0:
- Source: 'src/loops.rs', lines 4:0-14:1 *)
+ Source: 'tests/src/loops.rs', lines 4:0-14:1 *)
let rec sum_loop
(max : u32) (i : u32) (s : u32) :
Tot (result u32) (decreases (sum_loop_decreases max i s))
@@ -18,12 +18,12 @@ let rec sum_loop
else u32_mul s 2
(** [loops::sum]:
- Source: 'src/loops.rs', lines 4:0-4:27 *)
+ Source: 'tests/src/loops.rs', lines 4:0-4:27 *)
let sum (max : u32) : result u32 =
sum_loop max 0 0
(** [loops::sum_with_mut_borrows]: loop 0:
- Source: 'src/loops.rs', lines 19:0-31:1 *)
+ Source: 'tests/src/loops.rs', lines 19:0-31:1 *)
let rec sum_with_mut_borrows_loop
(max : u32) (i : u32) (s : u32) :
Tot (result u32) (decreases (sum_with_mut_borrows_loop_decreases max i s))
@@ -36,12 +36,12 @@ let rec sum_with_mut_borrows_loop
else u32_mul s 2
(** [loops::sum_with_mut_borrows]:
- Source: 'src/loops.rs', lines 19:0-19:44 *)
+ Source: 'tests/src/loops.rs', lines 19:0-19:44 *)
let sum_with_mut_borrows (max : u32) : result u32 =
sum_with_mut_borrows_loop max 0 0
(** [loops::sum_with_shared_borrows]: loop 0:
- Source: 'src/loops.rs', lines 34:0-48:1 *)
+ Source: 'tests/src/loops.rs', lines 34:0-48:1 *)
let rec sum_with_shared_borrows_loop
(max : u32) (i : u32) (s : u32) :
Tot (result u32) (decreases (sum_with_shared_borrows_loop_decreases max i s))
@@ -54,12 +54,12 @@ let rec sum_with_shared_borrows_loop
else u32_mul s 2
(** [loops::sum_with_shared_borrows]:
- Source: 'src/loops.rs', lines 34:0-34:47 *)
+ Source: 'tests/src/loops.rs', lines 34:0-34:47 *)
let sum_with_shared_borrows (max : u32) : result u32 =
sum_with_shared_borrows_loop max 0 0
(** [loops::sum_array]: loop 0:
- Source: 'src/loops.rs', lines 50:0-58:1 *)
+ Source: 'tests/src/loops.rs', lines 50:0-58:1 *)
let rec sum_array_loop
(n : usize) (a : array u32 n) (i : usize) (s : u32) :
Tot (result u32) (decreases (sum_array_loop_decreases n a i s))
@@ -73,12 +73,12 @@ let rec sum_array_loop
else Ok s
(** [loops::sum_array]:
- Source: 'src/loops.rs', lines 50:0-50:52 *)
+ Source: 'tests/src/loops.rs', lines 50:0-50:52 *)
let sum_array (n : usize) (a : array u32 n) : result u32 =
sum_array_loop n a 0 0
(** [loops::clear]: loop 0:
- Source: 'src/loops.rs', lines 62:0-68:1 *)
+ Source: 'tests/src/loops.rs', lines 62:0-68:1 *)
let rec clear_loop
(v : alloc_vec_Vec u32) (i : usize) :
Tot (result (alloc_vec_Vec u32)) (decreases (clear_loop_decreases v i))
@@ -95,12 +95,12 @@ let rec clear_loop
else Ok v
(** [loops::clear]:
- Source: 'src/loops.rs', lines 62:0-62:30 *)
+ Source: 'tests/src/loops.rs', lines 62:0-62:30 *)
let clear (v : alloc_vec_Vec u32) : result (alloc_vec_Vec u32) =
clear_loop v 0
(** [loops::list_mem]: loop 0:
- Source: 'src/loops.rs', lines 76:0-85:1 *)
+ Source: 'tests/src/loops.rs', lines 76:0-85:1 *)
let rec list_mem_loop
(x : u32) (ls : list_t u32) :
Tot (result bool) (decreases (list_mem_loop_decreases x ls))
@@ -111,12 +111,12 @@ let rec list_mem_loop
end
(** [loops::list_mem]:
- Source: 'src/loops.rs', lines 76:0-76:52 *)
+ Source: 'tests/src/loops.rs', lines 76:0-76:52 *)
let list_mem (x : u32) (ls : list_t u32) : result bool =
list_mem_loop x ls
(** [loops::list_nth_mut_loop]: loop 0:
- Source: 'src/loops.rs', lines 88:0-98:1 *)
+ Source: 'tests/src/loops.rs', lines 88:0-98:1 *)
let rec list_nth_mut_loop_loop
(t : Type0) (ls : list_t t) (i : u32) :
Tot (result (t & (t -> result (list_t t))))
@@ -135,7 +135,7 @@ let rec list_nth_mut_loop_loop
end
(** [loops::list_nth_mut_loop]:
- Source: 'src/loops.rs', lines 88:0-88:71 *)
+ Source: 'tests/src/loops.rs', lines 88:0-88:71 *)
let list_nth_mut_loop
(t : Type0) (ls : list_t t) (i : u32) :
result (t & (t -> result (list_t t)))
@@ -143,7 +143,7 @@ let list_nth_mut_loop
list_nth_mut_loop_loop t ls i
(** [loops::list_nth_shared_loop]: loop 0:
- Source: 'src/loops.rs', lines 101:0-111:1 *)
+ Source: 'tests/src/loops.rs', lines 101:0-111:1 *)
let rec list_nth_shared_loop_loop
(t : Type0) (ls : list_t t) (i : u32) :
Tot (result t) (decreases (list_nth_shared_loop_loop_decreases t ls i))
@@ -157,12 +157,12 @@ let rec list_nth_shared_loop_loop
end
(** [loops::list_nth_shared_loop]:
- Source: 'src/loops.rs', lines 101:0-101:66 *)
+ Source: 'tests/src/loops.rs', lines 101:0-101:66 *)
let list_nth_shared_loop (t : Type0) (ls : list_t t) (i : u32) : result t =
list_nth_shared_loop_loop t ls i
(** [loops::get_elem_mut]: loop 0:
- Source: 'src/loops.rs', lines 113:0-127:1 *)
+ Source: 'tests/src/loops.rs', lines 113:0-127:1 *)
let rec get_elem_mut_loop
(x : usize) (ls : list_t usize) :
Tot (result (usize & (usize -> result (list_t usize))))
@@ -180,7 +180,7 @@ let rec get_elem_mut_loop
end
(** [loops::get_elem_mut]:
- Source: 'src/loops.rs', lines 113:0-113:73 *)
+ Source: 'tests/src/loops.rs', lines 113:0-113:73 *)
let get_elem_mut
(slots : alloc_vec_Vec (list_t usize)) (x : usize) :
result (usize & (usize -> result (alloc_vec_Vec (list_t usize))))
@@ -193,7 +193,7 @@ let get_elem_mut
Ok (i, back1)
(** [loops::get_elem_shared]: loop 0:
- Source: 'src/loops.rs', lines 129:0-143:1 *)
+ Source: 'tests/src/loops.rs', lines 129:0-143:1 *)
let rec get_elem_shared_loop
(x : usize) (ls : list_t usize) :
Tot (result usize) (decreases (get_elem_shared_loop_decreases x ls))
@@ -204,7 +204,7 @@ let rec get_elem_shared_loop
end
(** [loops::get_elem_shared]:
- Source: 'src/loops.rs', lines 129:0-129:68 *)
+ Source: 'tests/src/loops.rs', lines 129:0-129:68 *)
let get_elem_shared
(slots : alloc_vec_Vec (list_t usize)) (x : usize) : result usize =
let* ls =
@@ -213,7 +213,7 @@ let get_elem_shared
get_elem_shared_loop x ls
(** [loops::id_mut]:
- Source: 'src/loops.rs', lines 145:0-145:50 *)
+ Source: 'tests/src/loops.rs', lines 145:0-145:50 *)
let id_mut
(t : Type0) (ls : list_t t) :
result ((list_t t) & (list_t t -> result (list_t t)))
@@ -221,12 +221,12 @@ let id_mut
Ok (ls, Ok)
(** [loops::id_shared]:
- Source: 'src/loops.rs', lines 149:0-149:45 *)
+ Source: 'tests/src/loops.rs', lines 149:0-149:45 *)
let id_shared (t : Type0) (ls : list_t t) : result (list_t t) =
Ok ls
(** [loops::list_nth_mut_loop_with_id]: loop 0:
- Source: 'src/loops.rs', lines 154:0-165:1 *)
+ Source: 'tests/src/loops.rs', lines 154:0-165:1 *)
let rec list_nth_mut_loop_with_id_loop
(t : Type0) (i : u32) (ls : list_t t) :
Tot (result (t & (t -> result (list_t t))))
@@ -245,7 +245,7 @@ let rec list_nth_mut_loop_with_id_loop
end
(** [loops::list_nth_mut_loop_with_id]:
- Source: 'src/loops.rs', lines 154:0-154:75 *)
+ Source: 'tests/src/loops.rs', lines 154:0-154:75 *)
let list_nth_mut_loop_with_id
(t : Type0) (ls : list_t t) (i : u32) :
result (t & (t -> result (list_t t)))
@@ -256,7 +256,7 @@ let list_nth_mut_loop_with_id
Ok (x, back1)
(** [loops::list_nth_shared_loop_with_id]: loop 0:
- Source: 'src/loops.rs', lines 168:0-179:1 *)
+ Source: 'tests/src/loops.rs', lines 168:0-179:1 *)
let rec list_nth_shared_loop_with_id_loop
(t : Type0) (i : u32) (ls : list_t t) :
Tot (result t)
@@ -271,13 +271,13 @@ let rec list_nth_shared_loop_with_id_loop
end
(** [loops::list_nth_shared_loop_with_id]:
- Source: 'src/loops.rs', lines 168:0-168:70 *)
+ Source: 'tests/src/loops.rs', lines 168:0-168:70 *)
let list_nth_shared_loop_with_id
(t : Type0) (ls : list_t t) (i : u32) : result t =
let* ls1 = id_shared t ls in list_nth_shared_loop_with_id_loop t i ls1
(** [loops::list_nth_mut_loop_pair]: loop 0:
- Source: 'src/loops.rs', lines 184:0-205:1 *)
+ Source: 'tests/src/loops.rs', lines 184:0-205:1 *)
let rec list_nth_mut_loop_pair_loop
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) :
Tot (result ((t & t) & (t -> result (list_t t)) & (t -> result (list_t t))))
@@ -306,7 +306,7 @@ let rec list_nth_mut_loop_pair_loop
end
(** [loops::list_nth_mut_loop_pair]:
- Source: 'src/loops.rs', lines 184:0-188:27 *)
+ Source: 'tests/src/loops.rs', lines 184:0-188:27 *)
let list_nth_mut_loop_pair
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) :
result ((t & t) & (t -> result (list_t t)) & (t -> result (list_t t)))
@@ -314,7 +314,7 @@ let list_nth_mut_loop_pair
list_nth_mut_loop_pair_loop t ls0 ls1 i
(** [loops::list_nth_shared_loop_pair]: loop 0:
- Source: 'src/loops.rs', lines 208:0-229:1 *)
+ Source: 'tests/src/loops.rs', lines 208:0-229:1 *)
let rec list_nth_shared_loop_pair_loop
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) :
Tot (result (t & t))
@@ -333,13 +333,13 @@ let rec list_nth_shared_loop_pair_loop
end
(** [loops::list_nth_shared_loop_pair]:
- Source: 'src/loops.rs', lines 208:0-212:19 *)
+ Source: 'tests/src/loops.rs', lines 208:0-212:19 *)
let list_nth_shared_loop_pair
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) : result (t & t) =
list_nth_shared_loop_pair_loop t ls0 ls1 i
(** [loops::list_nth_mut_loop_pair_merge]: loop 0:
- Source: 'src/loops.rs', lines 233:0-248:1 *)
+ Source: 'tests/src/loops.rs', lines 233:0-248:1 *)
let rec list_nth_mut_loop_pair_merge_loop
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) :
Tot (result ((t & t) & ((t & t) -> result ((list_t t) & (list_t t)))))
@@ -369,7 +369,7 @@ let rec list_nth_mut_loop_pair_merge_loop
end
(** [loops::list_nth_mut_loop_pair_merge]:
- Source: 'src/loops.rs', lines 233:0-237:27 *)
+ Source: 'tests/src/loops.rs', lines 233:0-237:27 *)
let list_nth_mut_loop_pair_merge
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) :
result ((t & t) & ((t & t) -> result ((list_t t) & (list_t t))))
@@ -377,7 +377,7 @@ let list_nth_mut_loop_pair_merge
list_nth_mut_loop_pair_merge_loop t ls0 ls1 i
(** [loops::list_nth_shared_loop_pair_merge]: loop 0:
- Source: 'src/loops.rs', lines 251:0-266:1 *)
+ Source: 'tests/src/loops.rs', lines 251:0-266:1 *)
let rec list_nth_shared_loop_pair_merge_loop
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) :
Tot (result (t & t))
@@ -398,13 +398,13 @@ let rec list_nth_shared_loop_pair_merge_loop
end
(** [loops::list_nth_shared_loop_pair_merge]:
- Source: 'src/loops.rs', lines 251:0-255:19 *)
+ Source: 'tests/src/loops.rs', lines 251:0-255:19 *)
let list_nth_shared_loop_pair_merge
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) : result (t & t) =
list_nth_shared_loop_pair_merge_loop t ls0 ls1 i
(** [loops::list_nth_mut_shared_loop_pair]: loop 0:
- Source: 'src/loops.rs', lines 269:0-284:1 *)
+ Source: 'tests/src/loops.rs', lines 269:0-284:1 *)
let rec list_nth_mut_shared_loop_pair_loop
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) :
Tot (result ((t & t) & (t -> result (list_t t))))
@@ -428,7 +428,7 @@ let rec list_nth_mut_shared_loop_pair_loop
end
(** [loops::list_nth_mut_shared_loop_pair]:
- Source: 'src/loops.rs', lines 269:0-273:23 *)
+ Source: 'tests/src/loops.rs', lines 269:0-273:23 *)
let list_nth_mut_shared_loop_pair
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) :
result ((t & t) & (t -> result (list_t t)))
@@ -436,7 +436,7 @@ let list_nth_mut_shared_loop_pair
list_nth_mut_shared_loop_pair_loop t ls0 ls1 i
(** [loops::list_nth_mut_shared_loop_pair_merge]: loop 0:
- Source: 'src/loops.rs', lines 288:0-303:1 *)
+ Source: 'tests/src/loops.rs', lines 288:0-303:1 *)
let rec list_nth_mut_shared_loop_pair_merge_loop
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) :
Tot (result ((t & t) & (t -> result (list_t t))))
@@ -461,7 +461,7 @@ let rec list_nth_mut_shared_loop_pair_merge_loop
end
(** [loops::list_nth_mut_shared_loop_pair_merge]:
- Source: 'src/loops.rs', lines 288:0-292:23 *)
+ Source: 'tests/src/loops.rs', lines 288:0-292:23 *)
let list_nth_mut_shared_loop_pair_merge
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) :
result ((t & t) & (t -> result (list_t t)))
@@ -469,7 +469,7 @@ let list_nth_mut_shared_loop_pair_merge
list_nth_mut_shared_loop_pair_merge_loop t ls0 ls1 i
(** [loops::list_nth_shared_mut_loop_pair]: loop 0:
- Source: 'src/loops.rs', lines 307:0-322:1 *)
+ Source: 'tests/src/loops.rs', lines 307:0-322:1 *)
let rec list_nth_shared_mut_loop_pair_loop
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) :
Tot (result ((t & t) & (t -> result (list_t t))))
@@ -493,7 +493,7 @@ let rec list_nth_shared_mut_loop_pair_loop
end
(** [loops::list_nth_shared_mut_loop_pair]:
- Source: 'src/loops.rs', lines 307:0-311:23 *)
+ Source: 'tests/src/loops.rs', lines 307:0-311:23 *)
let list_nth_shared_mut_loop_pair
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) :
result ((t & t) & (t -> result (list_t t)))
@@ -501,7 +501,7 @@ let list_nth_shared_mut_loop_pair
list_nth_shared_mut_loop_pair_loop t ls0 ls1 i
(** [loops::list_nth_shared_mut_loop_pair_merge]: loop 0:
- Source: 'src/loops.rs', lines 326:0-341:1 *)
+ Source: 'tests/src/loops.rs', lines 326:0-341:1 *)
let rec list_nth_shared_mut_loop_pair_merge_loop
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) :
Tot (result ((t & t) & (t -> result (list_t t))))
@@ -526,7 +526,7 @@ let rec list_nth_shared_mut_loop_pair_merge_loop
end
(** [loops::list_nth_shared_mut_loop_pair_merge]:
- Source: 'src/loops.rs', lines 326:0-330:23 *)
+ Source: 'tests/src/loops.rs', lines 326:0-330:23 *)
let list_nth_shared_mut_loop_pair_merge
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) :
result ((t & t) & (t -> result (list_t t)))
@@ -534,7 +534,7 @@ let list_nth_shared_mut_loop_pair_merge
list_nth_shared_mut_loop_pair_merge_loop t ls0 ls1 i
(** [loops::ignore_input_mut_borrow]: loop 0:
- Source: 'src/loops.rs', lines 345:0-349:1 *)
+ Source: 'tests/src/loops.rs', lines 345:0-349:1 *)
let rec ignore_input_mut_borrow_loop
(i : u32) :
Tot (result unit) (decreases (ignore_input_mut_borrow_loop_decreases i))
@@ -544,12 +544,12 @@ let rec ignore_input_mut_borrow_loop
else Ok ()
(** [loops::ignore_input_mut_borrow]:
- Source: 'src/loops.rs', lines 345:0-345:56 *)
+ Source: 'tests/src/loops.rs', lines 345:0-345:56 *)
let ignore_input_mut_borrow (_a : u32) (i : u32) : result u32 =
let* _ = ignore_input_mut_borrow_loop i in Ok _a
(** [loops::incr_ignore_input_mut_borrow]: loop 0:
- Source: 'src/loops.rs', lines 353:0-358:1 *)
+ Source: 'tests/src/loops.rs', lines 353:0-358:1 *)
let rec incr_ignore_input_mut_borrow_loop
(i : u32) :
Tot (result unit) (decreases (incr_ignore_input_mut_borrow_loop_decreases i))
@@ -559,14 +559,14 @@ let rec incr_ignore_input_mut_borrow_loop
else Ok ()
(** [loops::incr_ignore_input_mut_borrow]:
- Source: 'src/loops.rs', lines 353:0-353:60 *)
+ Source: 'tests/src/loops.rs', lines 353:0-353:60 *)
let incr_ignore_input_mut_borrow (a : u32) (i : u32) : result u32 =
let* a1 = u32_add a 1 in
let* _ = incr_ignore_input_mut_borrow_loop i in
Ok a1
(** [loops::ignore_input_shared_borrow]: loop 0:
- Source: 'src/loops.rs', lines 362:0-366:1 *)
+ Source: 'tests/src/loops.rs', lines 362:0-366:1 *)
let rec ignore_input_shared_borrow_loop
(i : u32) :
Tot (result unit) (decreases (ignore_input_shared_borrow_loop_decreases i))
@@ -576,7 +576,7 @@ let rec ignore_input_shared_borrow_loop
else Ok ()
(** [loops::ignore_input_shared_borrow]:
- Source: 'src/loops.rs', lines 362:0-362:59 *)
+ Source: 'tests/src/loops.rs', lines 362:0-362:59 *)
let ignore_input_shared_borrow (_a : u32) (i : u32) : result u32 =
let* _ = ignore_input_shared_borrow_loop i in Ok _a
diff --git a/tests/fstar/misc/Loops.Types.fst b/tests/fstar/misc/Loops.Types.fst
index 29f56e1b..534f5df7 100644
--- a/tests/fstar/misc/Loops.Types.fst
+++ b/tests/fstar/misc/Loops.Types.fst
@@ -6,7 +6,7 @@ open Primitives
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [loops::List]
- Source: 'src/loops.rs', lines 70:0-70:16 *)
+ Source: 'tests/src/loops.rs', lines 70:0-70:16 *)
type list_t (t : Type0) =
| List_Cons : t -> list_t t -> list_t t
| List_Nil : list_t t
diff --git a/tests/fstar/misc/NoNestedBorrows.fst b/tests/fstar/misc/NoNestedBorrows.fst
index 7d965944..340dd293 100644
--- a/tests/fstar/misc/NoNestedBorrows.fst
+++ b/tests/fstar/misc/NoNestedBorrows.fst
@@ -6,54 +6,54 @@ open Primitives
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [no_nested_borrows::Pair]
- Source: 'src/no_nested_borrows.rs', lines 4:0-4:23 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 4:0-4:23 *)
type pair_t (t1 t2 : Type0) = { x : t1; y : t2; }
(** [no_nested_borrows::List]
- Source: 'src/no_nested_borrows.rs', lines 9:0-9:16 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 9:0-9:16 *)
type list_t (t : Type0) =
| List_Cons : t -> list_t t -> list_t t
| List_Nil : list_t t
(** [no_nested_borrows::One]
- Source: 'src/no_nested_borrows.rs', lines 20:0-20:16 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 20:0-20:16 *)
type one_t (t1 : Type0) = | One_One : t1 -> one_t t1
(** [no_nested_borrows::EmptyEnum]
- Source: 'src/no_nested_borrows.rs', lines 26:0-26:18 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 26:0-26:18 *)
type emptyEnum_t = | EmptyEnum_Empty : emptyEnum_t
(** [no_nested_borrows::Enum]
- Source: 'src/no_nested_borrows.rs', lines 32:0-32:13 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 32:0-32:13 *)
type enum_t = | Enum_Variant1 : enum_t | Enum_Variant2 : enum_t
(** [no_nested_borrows::EmptyStruct]
- Source: 'src/no_nested_borrows.rs', lines 39:0-39:22 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 39:0-39:22 *)
type emptyStruct_t = unit
(** [no_nested_borrows::Sum]
- Source: 'src/no_nested_borrows.rs', lines 41:0-41:20 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 41:0-41:20 *)
type sum_t (t1 t2 : Type0) =
| Sum_Left : t1 -> sum_t t1 t2
| Sum_Right : t2 -> sum_t t1 t2
(** [no_nested_borrows::cast_u32_to_i32]:
- Source: 'src/no_nested_borrows.rs', lines 46:0-46:37 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 46:0-46:37 *)
let cast_u32_to_i32 (x : u32) : result i32 =
scalar_cast U32 I32 x
(** [no_nested_borrows::cast_bool_to_i32]:
- Source: 'src/no_nested_borrows.rs', lines 50:0-50:39 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 50:0-50:39 *)
let cast_bool_to_i32 (x : bool) : result i32 =
scalar_cast_bool I32 x
(** [no_nested_borrows::cast_bool_to_bool]:
- Source: 'src/no_nested_borrows.rs', lines 55:0-55:41 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 55:0-55:41 *)
let cast_bool_to_bool (x : bool) : result bool =
Ok x
(** [no_nested_borrows::test2]:
- Source: 'src/no_nested_borrows.rs', lines 60:0-60:14 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 60:0-60:14 *)
let test2 : result unit =
let* _ = u32_add 23 44 in Ok ()
@@ -61,12 +61,12 @@ let test2 : result unit =
let _ = assert_norm (test2 = Ok ())
(** [no_nested_borrows::get_max]:
- Source: 'src/no_nested_borrows.rs', lines 72:0-72:37 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 72:0-72:37 *)
let get_max (x : u32) (y : u32) : result u32 =
if x >= y then Ok x else Ok y
(** [no_nested_borrows::test3]:
- Source: 'src/no_nested_borrows.rs', lines 80:0-80:14 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 80:0-80:14 *)
let test3 : result unit =
let* x = get_max 4 3 in
let* y = get_max 10 11 in
@@ -77,7 +77,7 @@ let test3 : result unit =
let _ = assert_norm (test3 = Ok ())
(** [no_nested_borrows::test_neg1]:
- Source: 'src/no_nested_borrows.rs', lines 87:0-87:18 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 87:0-87:18 *)
let test_neg1 : result unit =
let* y = i32_neg 3 in if not (y = -3) then Fail Failure else Ok ()
@@ -85,7 +85,7 @@ let test_neg1 : result unit =
let _ = assert_norm (test_neg1 = Ok ())
(** [no_nested_borrows::refs_test1]:
- Source: 'src/no_nested_borrows.rs', lines 94:0-94:19 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 94:0-94:19 *)
let refs_test1 : result unit =
if not (1 = 1) then Fail Failure else Ok ()
@@ -93,7 +93,7 @@ let refs_test1 : result unit =
let _ = assert_norm (refs_test1 = Ok ())
(** [no_nested_borrows::refs_test2]:
- Source: 'src/no_nested_borrows.rs', lines 105:0-105:19 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 105:0-105:19 *)
let refs_test2 : result unit =
if not (2 = 2)
then Fail Failure
@@ -109,7 +109,7 @@ let refs_test2 : result unit =
let _ = assert_norm (refs_test2 = Ok ())
(** [no_nested_borrows::test_list1]:
- Source: 'src/no_nested_borrows.rs', lines 121:0-121:19 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 121:0-121:19 *)
let test_list1 : result unit =
Ok ()
@@ -117,7 +117,7 @@ let test_list1 : result unit =
let _ = assert_norm (test_list1 = Ok ())
(** [no_nested_borrows::test_box1]:
- Source: 'src/no_nested_borrows.rs', lines 126:0-126:18 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 126:0-126:18 *)
let test_box1 : result unit =
let* (_, deref_mut_back) = alloc_boxed_Box_deref_mut i32 0 in
let* b = deref_mut_back 1 in
@@ -128,22 +128,22 @@ let test_box1 : result unit =
let _ = assert_norm (test_box1 = Ok ())
(** [no_nested_borrows::copy_int]:
- Source: 'src/no_nested_borrows.rs', lines 136:0-136:30 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 136:0-136:30 *)
let copy_int (x : i32) : result i32 =
Ok x
(** [no_nested_borrows::test_unreachable]:
- Source: 'src/no_nested_borrows.rs', lines 142:0-142:32 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 142:0-142:32 *)
let test_unreachable (b : bool) : result unit =
if b then Fail Failure else Ok ()
(** [no_nested_borrows::test_panic]:
- Source: 'src/no_nested_borrows.rs', lines 150:0-150:26 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 150:0-150:26 *)
let test_panic (b : bool) : result unit =
if b then Fail Failure else Ok ()
(** [no_nested_borrows::test_copy_int]:
- Source: 'src/no_nested_borrows.rs', lines 157:0-157:22 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 157:0-157:22 *)
let test_copy_int : result unit =
let* y = copy_int 0 in if not (0 = y) then Fail Failure else Ok ()
@@ -151,12 +151,12 @@ let test_copy_int : result unit =
let _ = assert_norm (test_copy_int = Ok ())
(** [no_nested_borrows::is_cons]:
- Source: 'src/no_nested_borrows.rs', lines 164:0-164:38 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 164:0-164:38 *)
let is_cons (t : Type0) (l : list_t t) : result bool =
begin match l with | List_Cons _ _ -> Ok true | List_Nil -> Ok false end
(** [no_nested_borrows::test_is_cons]:
- Source: 'src/no_nested_borrows.rs', lines 171:0-171:21 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 171:0-171:21 *)
let test_is_cons : result unit =
let* b = is_cons i32 (List_Cons 0 List_Nil) in
if not b then Fail Failure else Ok ()
@@ -165,7 +165,7 @@ let test_is_cons : result unit =
let _ = assert_norm (test_is_cons = Ok ())
(** [no_nested_borrows::split_list]:
- Source: 'src/no_nested_borrows.rs', lines 177:0-177:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 177:0-177:48 *)
let split_list (t : Type0) (l : list_t t) : result (t & (list_t t)) =
begin match l with
| List_Cons hd tl -> Ok (hd, tl)
@@ -173,7 +173,7 @@ let split_list (t : Type0) (l : list_t t) : result (t & (list_t t)) =
end
(** [no_nested_borrows::test_split_list]:
- Source: 'src/no_nested_borrows.rs', lines 185:0-185:24 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 185:0-185:24 *)
let test_split_list : result unit =
let* p = split_list i32 (List_Cons 0 List_Nil) in
let (hd, _) = p in
@@ -183,7 +183,7 @@ let test_split_list : result unit =
let _ = assert_norm (test_split_list = Ok ())
(** [no_nested_borrows::choose]:
- Source: 'src/no_nested_borrows.rs', lines 192:0-192:70 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 192:0-192:70 *)
let choose
(t : Type0) (b : bool) (x : t) (y : t) : result (t & (t -> result (t & t))) =
if b
@@ -191,7 +191,7 @@ let choose
else let back = fun ret -> Ok (x, ret) in Ok (y, back)
(** [no_nested_borrows::choose_test]:
- Source: 'src/no_nested_borrows.rs', lines 200:0-200:20 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 200:0-200:20 *)
let choose_test : result unit =
let* (z, choose_back) = choose i32 true 0 0 in
let* z1 = i32_add z 1 in
@@ -207,24 +207,24 @@ let choose_test : result unit =
let _ = assert_norm (choose_test = Ok ())
(** [no_nested_borrows::test_char]:
- Source: 'src/no_nested_borrows.rs', lines 212:0-212:26 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 212:0-212:26 *)
let test_char : result char =
Ok 'a'
(** [no_nested_borrows::Tree]
- Source: 'src/no_nested_borrows.rs', lines 217:0-217:16 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 217:0-217:16 *)
type tree_t (t : Type0) =
| Tree_Leaf : t -> tree_t t
| Tree_Node : t -> nodeElem_t t -> tree_t t -> tree_t t
(** [no_nested_borrows::NodeElem]
- Source: 'src/no_nested_borrows.rs', lines 222:0-222:20 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 222:0-222:20 *)
and nodeElem_t (t : Type0) =
| NodeElem_Cons : tree_t t -> nodeElem_t t -> nodeElem_t t
| NodeElem_Nil : nodeElem_t t
(** [no_nested_borrows::list_length]:
- Source: 'src/no_nested_borrows.rs', lines 257:0-257:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 257:0-257:48 *)
let rec list_length (t : Type0) (l : list_t t) : result u32 =
begin match l with
| List_Cons _ l1 -> let* i = list_length t l1 in u32_add 1 i
@@ -232,7 +232,7 @@ let rec list_length (t : Type0) (l : list_t t) : result u32 =
end
(** [no_nested_borrows::list_nth_shared]:
- Source: 'src/no_nested_borrows.rs', lines 265:0-265:62 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 265:0-265:62 *)
let rec list_nth_shared (t : Type0) (l : list_t t) (i : u32) : result t =
begin match l with
| List_Cons x tl ->
@@ -241,7 +241,7 @@ let rec list_nth_shared (t : Type0) (l : list_t t) (i : u32) : result t =
end
(** [no_nested_borrows::list_nth_mut]:
- Source: 'src/no_nested_borrows.rs', lines 281:0-281:67 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 281:0-281:67 *)
let rec list_nth_mut
(t : Type0) (l : list_t t) (i : u32) :
result (t & (t -> result (list_t t)))
@@ -260,7 +260,7 @@ let rec list_nth_mut
end
(** [no_nested_borrows::list_rev_aux]:
- Source: 'src/no_nested_borrows.rs', lines 297:0-297:63 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 297:0-297:63 *)
let rec list_rev_aux
(t : Type0) (li : list_t t) (lo : list_t t) : result (list_t t) =
begin match li with
@@ -269,13 +269,13 @@ let rec list_rev_aux
end
(** [no_nested_borrows::list_rev]:
- Source: 'src/no_nested_borrows.rs', lines 311:0-311:42 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 311:0-311:42 *)
let list_rev (t : Type0) (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: 'src/no_nested_borrows.rs', lines 316:0-316:28 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 316:0-316:28 *)
let test_list_functions : result unit =
let l = List_Cons 2 List_Nil in
let l1 = List_Cons 1 l in
@@ -312,7 +312,7 @@ let test_list_functions : result unit =
let _ = assert_norm (test_list_functions = Ok ())
(** [no_nested_borrows::id_mut_pair1]:
- Source: 'src/no_nested_borrows.rs', lines 332:0-332:89 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 332:0-332:89 *)
let id_mut_pair1
(t1 t2 : Type0) (x : t1) (y : t2) :
result ((t1 & t2) & ((t1 & t2) -> result (t1 & t2)))
@@ -320,7 +320,7 @@ let id_mut_pair1
Ok ((x, y), Ok)
(** [no_nested_borrows::id_mut_pair2]:
- Source: 'src/no_nested_borrows.rs', lines 336:0-336:88 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 336:0-336:88 *)
let id_mut_pair2
(t1 t2 : Type0) (p : (t1 & t2)) :
result ((t1 & t2) & ((t1 & t2) -> result (t1 & t2)))
@@ -328,7 +328,7 @@ let id_mut_pair2
let (x, x1) = p in Ok ((x, x1), Ok)
(** [no_nested_borrows::id_mut_pair3]:
- Source: 'src/no_nested_borrows.rs', lines 340:0-340:93 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 340:0-340:93 *)
let id_mut_pair3
(t1 t2 : Type0) (x : t1) (y : t2) :
result ((t1 & t2) & (t1 -> result t1) & (t2 -> result t2))
@@ -336,7 +336,7 @@ let id_mut_pair3
Ok ((x, y), Ok, Ok)
(** [no_nested_borrows::id_mut_pair4]:
- Source: 'src/no_nested_borrows.rs', lines 344:0-344:92 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 344:0-344:92 *)
let id_mut_pair4
(t1 t2 : Type0) (p : (t1 & t2)) :
result ((t1 & t2) & (t1 -> result t1) & (t2 -> result t2))
@@ -344,35 +344,35 @@ let id_mut_pair4
let (x, x1) = p in Ok ((x, x1), Ok, Ok)
(** [no_nested_borrows::StructWithTuple]
- Source: 'src/no_nested_borrows.rs', lines 351:0-351:34 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 351:0-351:34 *)
type structWithTuple_t (t1 t2 : Type0) = { p : (t1 & t2); }
(** [no_nested_borrows::new_tuple1]:
- Source: 'src/no_nested_borrows.rs', lines 355:0-355:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 355:0-355:48 *)
let new_tuple1 : result (structWithTuple_t u32 u32) =
Ok { p = (1, 2) }
(** [no_nested_borrows::new_tuple2]:
- Source: 'src/no_nested_borrows.rs', lines 359:0-359:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 359:0-359:48 *)
let new_tuple2 : result (structWithTuple_t i16 i16) =
Ok { p = (1, 2) }
(** [no_nested_borrows::new_tuple3]:
- Source: 'src/no_nested_borrows.rs', lines 363:0-363:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 363:0-363:48 *)
let new_tuple3 : result (structWithTuple_t u64 i64) =
Ok { p = (1, 2) }
(** [no_nested_borrows::StructWithPair]
- Source: 'src/no_nested_borrows.rs', lines 368:0-368:33 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 368:0-368:33 *)
type structWithPair_t (t1 t2 : Type0) = { p : pair_t t1 t2; }
(** [no_nested_borrows::new_pair1]:
- Source: 'src/no_nested_borrows.rs', lines 372:0-372:46 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 372:0-372:46 *)
let new_pair1 : result (structWithPair_t u32 u32) =
Ok { p = { x = 1; y = 2 } }
(** [no_nested_borrows::test_constants]:
- Source: 'src/no_nested_borrows.rs', lines 380:0-380:23 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 380:0-380:23 *)
let test_constants : result unit =
let* swt = new_tuple1 in
let (i, _) = swt.p in
@@ -396,7 +396,7 @@ let test_constants : result unit =
let _ = assert_norm (test_constants = Ok ())
(** [no_nested_borrows::test_weird_borrows1]:
- Source: 'src/no_nested_borrows.rs', lines 389:0-389:28 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 389:0-389:28 *)
let test_weird_borrows1 : result unit =
Ok ()
@@ -404,71 +404,71 @@ let test_weird_borrows1 : result unit =
let _ = assert_norm (test_weird_borrows1 = Ok ())
(** [no_nested_borrows::test_mem_replace]:
- Source: 'src/no_nested_borrows.rs', lines 399:0-399:37 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 399:0-399:37 *)
let test_mem_replace (px : u32) : result u32 =
let (y, _) = core_mem_replace u32 px 1 in
if not (y = 0) then Fail Failure else Ok 2
(** [no_nested_borrows::test_shared_borrow_bool1]:
- Source: 'src/no_nested_borrows.rs', lines 406:0-406:47 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 406:0-406:47 *)
let test_shared_borrow_bool1 (b : bool) : result u32 =
if b then Ok 0 else Ok 1
(** [no_nested_borrows::test_shared_borrow_bool2]:
- Source: 'src/no_nested_borrows.rs', lines 419:0-419:40 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 419:0-419:40 *)
let test_shared_borrow_bool2 : result u32 =
Ok 0
(** [no_nested_borrows::test_shared_borrow_enum1]:
- Source: 'src/no_nested_borrows.rs', lines 434:0-434:52 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 434:0-434:52 *)
let test_shared_borrow_enum1 (l : list_t u32) : result u32 =
begin match l with | List_Cons _ _ -> Ok 1 | List_Nil -> Ok 0 end
(** [no_nested_borrows::test_shared_borrow_enum2]:
- Source: 'src/no_nested_borrows.rs', lines 446:0-446:40 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 446:0-446:40 *)
let test_shared_borrow_enum2 : result u32 =
Ok 0
(** [no_nested_borrows::incr]:
- Source: 'src/no_nested_borrows.rs', lines 457:0-457:24 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 457:0-457:24 *)
let incr (x : u32) : result u32 =
u32_add x 1
(** [no_nested_borrows::call_incr]:
- Source: 'src/no_nested_borrows.rs', lines 461:0-461:35 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 461:0-461:35 *)
let call_incr (x : u32) : result u32 =
incr x
(** [no_nested_borrows::read_then_incr]:
- Source: 'src/no_nested_borrows.rs', lines 466:0-466:41 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 466:0-466:41 *)
let read_then_incr (x : u32) : result (u32 & u32) =
let* x1 = u32_add x 1 in Ok (x, x1)
(** [no_nested_borrows::Tuple]
- Source: 'src/no_nested_borrows.rs', lines 472:0-472:24 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 472:0-472:24 *)
type tuple_t (t1 t2 : Type0) = t1 * t2
(** [no_nested_borrows::use_tuple_struct]:
- Source: 'src/no_nested_borrows.rs', lines 474:0-474:48 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 474:0-474:48 *)
let use_tuple_struct (x : tuple_t u32 u32) : result (tuple_t u32 u32) =
let (_, i) = x in Ok (1, i)
(** [no_nested_borrows::create_tuple_struct]:
- Source: 'src/no_nested_borrows.rs', lines 478:0-478:61 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 478:0-478:61 *)
let create_tuple_struct (x : u32) (y : u64) : result (tuple_t u32 u64) =
Ok (x, y)
(** [no_nested_borrows::IdType]
- Source: 'src/no_nested_borrows.rs', lines 483:0-483:20 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 483:0-483:20 *)
type idType_t (t : Type0) = t
(** [no_nested_borrows::use_id_type]:
- Source: 'src/no_nested_borrows.rs', lines 485:0-485:40 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 485:0-485:40 *)
let use_id_type (t : Type0) (x : idType_t t) : result t =
Ok x
(** [no_nested_borrows::create_id_type]:
- Source: 'src/no_nested_borrows.rs', lines 489:0-489:43 *)
+ Source: 'tests/src/no_nested_borrows.rs', lines 489:0-489:43 *)
let create_id_type (t : Type0) (x : t) : result (idType_t t) =
Ok x
diff --git a/tests/fstar/misc/Paper.fst b/tests/fstar/misc/Paper.fst
index e6b4eb25..2e74e21a 100644
--- a/tests/fstar/misc/Paper.fst
+++ b/tests/fstar/misc/Paper.fst
@@ -6,12 +6,12 @@ open Primitives
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [paper::ref_incr]:
- Source: 'src/paper.rs', lines 4:0-4:28 *)
+ Source: 'tests/src/paper.rs', lines 4:0-4:28 *)
let ref_incr (x : i32) : result i32 =
i32_add x 1
(** [paper::test_incr]:
- Source: 'src/paper.rs', lines 8:0-8:18 *)
+ Source: 'tests/src/paper.rs', lines 8:0-8:18 *)
let test_incr : result unit =
let* x = ref_incr 0 in if not (x = 1) then Fail Failure else Ok ()
@@ -19,7 +19,7 @@ let test_incr : result unit =
let _ = assert_norm (test_incr = Ok ())
(** [paper::choose]:
- Source: 'src/paper.rs', lines 15:0-15:70 *)
+ Source: 'tests/src/paper.rs', lines 15:0-15:70 *)
let choose
(t : Type0) (b : bool) (x : t) (y : t) : result (t & (t -> result (t & t))) =
if b
@@ -27,7 +27,7 @@ let choose
else let back = fun ret -> Ok (x, ret) in Ok (y, back)
(** [paper::test_choose]:
- Source: 'src/paper.rs', lines 23:0-23:20 *)
+ Source: 'tests/src/paper.rs', lines 23:0-23:20 *)
let test_choose : result unit =
let* (z, choose_back) = choose i32 true 0 0 in
let* z1 = i32_add z 1 in
@@ -43,13 +43,13 @@ let test_choose : result unit =
let _ = assert_norm (test_choose = Ok ())
(** [paper::List]
- Source: 'src/paper.rs', lines 35:0-35:16 *)
+ Source: 'tests/src/paper.rs', lines 35:0-35:16 *)
type list_t (t : Type0) =
| List_Cons : t -> list_t t -> list_t t
| List_Nil : list_t t
(** [paper::list_nth_mut]:
- Source: 'src/paper.rs', lines 42:0-42:67 *)
+ Source: 'tests/src/paper.rs', lines 42:0-42:67 *)
let rec list_nth_mut
(t : Type0) (l : list_t t) (i : u32) :
result (t & (t -> result (list_t t)))
@@ -68,7 +68,7 @@ let rec list_nth_mut
end
(** [paper::sum]:
- Source: 'src/paper.rs', lines 57:0-57:32 *)
+ Source: 'tests/src/paper.rs', lines 57:0-57:32 *)
let rec sum (l : list_t i32) : result i32 =
begin match l with
| List_Cons x tl -> let* i = sum tl in i32_add x i
@@ -76,7 +76,7 @@ let rec sum (l : list_t i32) : result i32 =
end
(** [paper::test_nth]:
- Source: 'src/paper.rs', lines 68:0-68:17 *)
+ Source: 'tests/src/paper.rs', lines 68:0-68:17 *)
let test_nth : result unit =
let l = List_Cons 3 List_Nil in
let l1 = List_Cons 2 l in
@@ -90,7 +90,7 @@ let test_nth : result unit =
let _ = assert_norm (test_nth = Ok ())
(** [paper::call_choose]:
- Source: 'src/paper.rs', lines 76:0-76:44 *)
+ Source: 'tests/src/paper.rs', lines 76:0-76:44 *)
let call_choose (p : (u32 & u32)) : result u32 =
let (px, py) = p in
let* (pz, choose_back) = choose u32 true px py in
diff --git a/tests/fstar/misc/PoloniusList.fst b/tests/fstar/misc/PoloniusList.fst
index c0bc592e..071fd3ef 100644
--- a/tests/fstar/misc/PoloniusList.fst
+++ b/tests/fstar/misc/PoloniusList.fst
@@ -6,13 +6,13 @@ open Primitives
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [polonius_list::List]
- Source: 'src/polonius_list.rs', lines 3:0-3:16 *)
+ Source: 'tests/src/polonius_list.rs', lines 3:0-3:16 *)
type list_t (t : Type0) =
| List_Cons : t -> list_t t -> list_t t
| List_Nil : list_t t
(** [polonius_list::get_list_at_x]:
- Source: 'src/polonius_list.rs', lines 13:0-13:76 *)
+ Source: 'tests/src/polonius_list.rs', lines 13:0-13:76 *)
let rec 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/fstar/traits/Traits.fst b/tests/fstar/traits/Traits.fst
index 0904e506..fa841e8a 100644
--- a/tests/fstar/traits/Traits.fst
+++ b/tests/fstar/traits/Traits.fst
@@ -6,20 +6,20 @@ open Primitives
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** Trait declaration: [traits::BoolTrait]
- Source: 'src/traits.rs', lines 1:0-1:19 *)
+ Source: 'tests/src/traits.rs', lines 1:0-1:19 *)
noeq type boolTrait_t (self : Type0) = { get_bool : self -> result bool; }
(** [traits::{(traits::BoolTrait for bool)}::get_bool]:
- Source: 'src/traits.rs', lines 12:4-12:30 *)
+ Source: 'tests/src/traits.rs', lines 12:4-12:30 *)
let boolTraitBool_get_bool (self : bool) : result bool =
Ok self
(** Trait implementation: [traits::{(traits::BoolTrait for bool)}]
- Source: 'src/traits.rs', lines 11:0-11:23 *)
+ Source: 'tests/src/traits.rs', lines 11:0-11:23 *)
let boolTraitBool : boolTrait_t bool = { get_bool = boolTraitBool_get_bool; }
(** [traits::BoolTrait::ret_true]:
- Source: 'src/traits.rs', lines 6:4-6:30 *)
+ Source: 'tests/src/traits.rs', lines 6:4-6:30 *)
let boolTrait_ret_true
(#self : Type0) (self_clause : boolTrait_t self) (self1 : self) :
result bool
@@ -27,49 +27,49 @@ let boolTrait_ret_true
Ok true
(** [traits::test_bool_trait_bool]:
- Source: 'src/traits.rs', lines 17:0-17:44 *)
+ Source: 'tests/src/traits.rs', lines 17:0-17:44 *)
let test_bool_trait_bool (x : bool) : result bool =
let* b = boolTraitBool_get_bool x in
if b then boolTrait_ret_true boolTraitBool x else Ok false
(** [traits::{(traits::BoolTrait for core::option::Option<T>)#1}::get_bool]:
- Source: 'src/traits.rs', lines 23:4-23:30 *)
+ Source: 'tests/src/traits.rs', lines 23:4-23:30 *)
let boolTraitOption_get_bool (t : Type0) (self : option t) : result bool =
begin match self with | None -> Ok false | Some _ -> Ok true end
(** Trait implementation: [traits::{(traits::BoolTrait for core::option::Option<T>)#1}]
- Source: 'src/traits.rs', lines 22:0-22:31 *)
+ Source: 'tests/src/traits.rs', lines 22:0-22:31 *)
let boolTraitOption (t : Type0) : boolTrait_t (option t) = {
get_bool = boolTraitOption_get_bool t;
}
(** [traits::test_bool_trait_option]:
- Source: 'src/traits.rs', lines 31:0-31:54 *)
+ Source: 'tests/src/traits.rs', lines 31:0-31:54 *)
let test_bool_trait_option (t : Type0) (x : option t) : result bool =
let* b = boolTraitOption_get_bool t x in
if b then boolTrait_ret_true (boolTraitOption t) x else Ok false
(** [traits::test_bool_trait]:
- Source: 'src/traits.rs', lines 35:0-35:50 *)
+ Source: 'tests/src/traits.rs', lines 35:0-35:50 *)
let test_bool_trait
(t : Type0) (boolTraitInst : boolTrait_t t) (x : t) : result bool =
boolTraitInst.get_bool x
(** Trait declaration: [traits::ToU64]
- Source: 'src/traits.rs', lines 39:0-39:15 *)
+ Source: 'tests/src/traits.rs', lines 39:0-39:15 *)
noeq type toU64_t (self : Type0) = { to_u64 : self -> result u64; }
(** [traits::{(traits::ToU64 for u64)#2}::to_u64]:
- Source: 'src/traits.rs', lines 44:4-44:26 *)
+ Source: 'tests/src/traits.rs', lines 44:4-44:26 *)
let toU64U64_to_u64 (self : u64) : result u64 =
Ok self
(** Trait implementation: [traits::{(traits::ToU64 for u64)#2}]
- Source: 'src/traits.rs', lines 43:0-43:18 *)
+ Source: 'tests/src/traits.rs', lines 43:0-43:18 *)
let toU64U64 : toU64_t u64 = { to_u64 = toU64U64_to_u64; }
(** [traits::{(traits::ToU64 for (A, A))#3}::to_u64]:
- Source: 'src/traits.rs', lines 50:4-50:26 *)
+ Source: 'tests/src/traits.rs', lines 50:4-50:26 *)
let toU64Pair_to_u64
(a : Type0) (toU64Inst : toU64_t a) (self : (a & a)) : result u64 =
let (x, x1) = self in
@@ -78,75 +78,75 @@ let toU64Pair_to_u64
u64_add i i1
(** Trait implementation: [traits::{(traits::ToU64 for (A, A))#3}]
- Source: 'src/traits.rs', lines 49:0-49:31 *)
+ Source: 'tests/src/traits.rs', lines 49:0-49:31 *)
let toU64Pair (a : Type0) (toU64Inst : toU64_t a) : toU64_t (a & a) = {
to_u64 = toU64Pair_to_u64 a toU64Inst;
}
(** [traits::f]:
- Source: 'src/traits.rs', lines 55:0-55:36 *)
+ Source: 'tests/src/traits.rs', lines 55:0-55:36 *)
let f (t : Type0) (toU64Inst : toU64_t t) (x : (t & t)) : result u64 =
toU64Pair_to_u64 t toU64Inst x
(** [traits::g]:
- Source: 'src/traits.rs', lines 59:0-61:18 *)
+ Source: 'tests/src/traits.rs', lines 59:0-61:18 *)
let g
(t : Type0) (toU64PairInst : toU64_t (t & t)) (x : (t & t)) : result u64 =
toU64PairInst.to_u64 x
(** [traits::h0]:
- Source: 'src/traits.rs', lines 66:0-66:24 *)
+ Source: 'tests/src/traits.rs', lines 66:0-66:24 *)
let h0 (x : u64) : result u64 =
toU64U64_to_u64 x
(** [traits::Wrapper]
- Source: 'src/traits.rs', lines 70:0-70:21 *)
+ Source: 'tests/src/traits.rs', lines 70:0-70:21 *)
type wrapper_t (t : Type0) = { x : t; }
(** [traits::{(traits::ToU64 for traits::Wrapper<T>)#4}::to_u64]:
- Source: 'src/traits.rs', lines 75:4-75:26 *)
+ Source: 'tests/src/traits.rs', lines 75:4-75:26 *)
let toU64traitsWrapper_to_u64
(t : Type0) (toU64Inst : toU64_t t) (self : wrapper_t t) : result u64 =
toU64Inst.to_u64 self.x
(** Trait implementation: [traits::{(traits::ToU64 for traits::Wrapper<T>)#4}]
- Source: 'src/traits.rs', lines 74:0-74:35 *)
+ Source: 'tests/src/traits.rs', lines 74:0-74:35 *)
let toU64traitsWrapper (t : Type0) (toU64Inst : toU64_t t) : toU64_t (wrapper_t
t) = {
to_u64 = toU64traitsWrapper_to_u64 t toU64Inst;
}
(** [traits::h1]:
- Source: 'src/traits.rs', lines 80:0-80:33 *)
+ Source: 'tests/src/traits.rs', lines 80:0-80:33 *)
let h1 (x : wrapper_t u64) : result u64 =
toU64traitsWrapper_to_u64 u64 toU64U64 x
(** [traits::h2]:
- Source: 'src/traits.rs', lines 84:0-84:41 *)
+ Source: 'tests/src/traits.rs', lines 84:0-84:41 *)
let h2 (t : Type0) (toU64Inst : toU64_t t) (x : wrapper_t t) : result u64 =
toU64traitsWrapper_to_u64 t toU64Inst x
(** Trait declaration: [traits::ToType]
- Source: 'src/traits.rs', lines 88:0-88:19 *)
+ Source: 'tests/src/traits.rs', lines 88:0-88:19 *)
noeq type toType_t (self t : Type0) = { to_type : self -> result t; }
(** [traits::{(traits::ToType<bool> for u64)#5}::to_type]:
- Source: 'src/traits.rs', lines 93:4-93:28 *)
+ Source: 'tests/src/traits.rs', lines 93:4-93:28 *)
let toTypeU64Bool_to_type (self : u64) : result bool =
Ok (self > 0)
(** Trait implementation: [traits::{(traits::ToType<bool> for u64)#5}]
- Source: 'src/traits.rs', lines 92:0-92:25 *)
+ Source: 'tests/src/traits.rs', lines 92:0-92:25 *)
let toTypeU64Bool : toType_t u64 bool = { to_type = toTypeU64Bool_to_type; }
(** Trait declaration: [traits::OfType]
- Source: 'src/traits.rs', lines 98:0-98:16 *)
+ Source: 'tests/src/traits.rs', lines 98:0-98:16 *)
noeq type ofType_t (self : Type0) = {
of_type : (t : Type0) -> (toTypeInst : toType_t t self) -> t -> result self;
}
(** [traits::h3]:
- Source: 'src/traits.rs', lines 104:0-104:50 *)
+ Source: 'tests/src/traits.rs', lines 104:0-104:50 *)
let h3
(t1 t2 : Type0) (ofTypeInst : ofType_t t1) (toTypeInst : toType_t t2 t1)
(y : t2) :
@@ -155,14 +155,14 @@ let h3
ofTypeInst.of_type t2 toTypeInst y
(** Trait declaration: [traits::OfTypeBis]
- Source: 'src/traits.rs', lines 109:0-109:36 *)
+ Source: 'tests/src/traits.rs', lines 109:0-109:36 *)
noeq type ofTypeBis_t (self t : Type0) = {
toTypeInst : toType_t t self;
of_type : t -> result self;
}
(** [traits::h4]:
- Source: 'src/traits.rs', lines 118:0-118:57 *)
+ Source: 'tests/src/traits.rs', lines 118:0-118:57 *)
let h4
(t1 t2 : Type0) (ofTypeBisInst : ofTypeBis_t t1 t2) (toTypeInst : toType_t t2
t1) (y : t2) :
@@ -171,34 +171,34 @@ let h4
ofTypeBisInst.of_type y
(** [traits::TestType]
- Source: 'src/traits.rs', lines 122:0-122:22 *)
+ Source: 'tests/src/traits.rs', lines 122:0-122:22 *)
type testType_t (t : Type0) = t
(** [traits::{traits::TestType<T>#6}::test::TestType1]
- Source: 'src/traits.rs', lines 127:8-127:24 *)
+ Source: 'tests/src/traits.rs', lines 127:8-127:24 *)
type testType_test_TestType1_t = u64
(** Trait declaration: [traits::{traits::TestType<T>#6}::test::TestTrait]
- Source: 'src/traits.rs', lines 128:8-128:23 *)
+ Source: 'tests/src/traits.rs', lines 128:8-128:23 *)
noeq type testType_test_TestTrait_t (self : Type0) = {
test : self -> result bool;
}
(** [traits::{traits::TestType<T>#6}::test::{(traits::{traits::TestType<T>#6}::test::TestTrait for traits::{traits::TestType<T>#6}::test::TestType1)}::test]:
- Source: 'src/traits.rs', lines 139:12-139:34 *)
+ Source: 'tests/src/traits.rs', lines 139:12-139:34 *)
let testType_test_TestTraittraitsTestTypetestTestType1_test
(self : testType_test_TestType1_t) : result bool =
Ok (self > 1)
(** Trait implementation: [traits::{traits::TestType<T>#6}::test::{(traits::{traits::TestType<T>#6}::test::TestTrait for traits::{traits::TestType<T>#6}::test::TestType1)}]
- Source: 'src/traits.rs', lines 138:8-138:36 *)
+ Source: 'tests/src/traits.rs', lines 138:8-138:36 *)
let testType_test_TestTraittraitsTestTypetestTestType1 :
testType_test_TestTrait_t testType_test_TestType1_t = {
test = testType_test_TestTraittraitsTestTypetestTestType1_test;
}
(** [traits::{traits::TestType<T>#6}::test]:
- Source: 'src/traits.rs', lines 126:4-126:36 *)
+ Source: 'tests/src/traits.rs', lines 126:4-126:36 *)
let testType_test
(t : Type0) (toU64Inst : toU64_t t) (self : testType_t t) (x : t) :
result bool
@@ -209,11 +209,11 @@ let testType_test
else Ok false
(** [traits::BoolWrapper]
- Source: 'src/traits.rs', lines 150:0-150:22 *)
+ Source: 'tests/src/traits.rs', lines 150:0-150:22 *)
type boolWrapper_t = bool
(** [traits::{(traits::ToType<T> for traits::BoolWrapper)#7}::to_type]:
- Source: 'src/traits.rs', lines 156:4-156:25 *)
+ Source: 'tests/src/traits.rs', lines 156:4-156:25 *)
let toTypetraitsBoolWrapperT_to_type
(t : Type0) (toTypeBoolTInst : toType_t bool t) (self : boolWrapper_t) :
result t
@@ -221,14 +221,14 @@ let toTypetraitsBoolWrapperT_to_type
toTypeBoolTInst.to_type self
(** Trait implementation: [traits::{(traits::ToType<T> for traits::BoolWrapper)#7}]
- Source: 'src/traits.rs', lines 152:0-152:33 *)
+ Source: 'tests/src/traits.rs', lines 152:0-152:33 *)
let toTypetraitsBoolWrapperT (t : Type0) (toTypeBoolTInst : toType_t bool t) :
toType_t boolWrapper_t t = {
to_type = toTypetraitsBoolWrapperT_to_type t toTypeBoolTInst;
}
(** [traits::WithConstTy::LEN2]
- Source: 'src/traits.rs', lines 164:4-164:21 *)
+ Source: 'tests/src/traits.rs', lines 164:4-164:21 *)
let with_const_ty_len2_default_body (self : Type0) (len : usize)
: result usize =
Ok 32
@@ -236,7 +236,7 @@ let with_const_ty_len2_default (self : Type0) (len : usize) : usize =
eval_global (with_const_ty_len2_default_body self len)
(** Trait declaration: [traits::WithConstTy]
- Source: 'src/traits.rs', lines 161:0-161:39 *)
+ Source: 'tests/src/traits.rs', lines 161:0-161:39 *)
noeq type withConstTy_t (self : Type0) (len : usize) = {
cLEN1 : usize;
cLEN2 : usize;
@@ -247,18 +247,18 @@ noeq type withConstTy_t (self : Type0) (len : usize) = {
}
(** [traits::{(traits::WithConstTy<32: usize> for bool)#8}::LEN1]
- Source: 'src/traits.rs', lines 175:4-175:21 *)
+ Source: 'tests/src/traits.rs', lines 175:4-175:21 *)
let with_const_ty_bool32_len1_body : result usize = Ok 12
let with_const_ty_bool32_len1 : usize =
eval_global with_const_ty_bool32_len1_body
(** [traits::{(traits::WithConstTy<32: usize> for bool)#8}::f]:
- Source: 'src/traits.rs', lines 180:4-180:39 *)
+ Source: 'tests/src/traits.rs', lines 180:4-180:39 *)
let withConstTyBool32_f (i : u64) (a : array u8 32) : result u64 =
Ok i
(** Trait implementation: [traits::{(traits::WithConstTy<32: usize> for bool)#8}]
- Source: 'src/traits.rs', lines 174:0-174:29 *)
+ Source: 'tests/src/traits.rs', lines 174:0-174:29 *)
let withConstTyBool32 : withConstTy_t bool 32 = {
cLEN1 = with_const_ty_bool32_len1;
cLEN2 = with_const_ty_len2_default bool 32;
@@ -269,7 +269,7 @@ let withConstTyBool32 : withConstTy_t bool 32 = {
}
(** [traits::use_with_const_ty1]:
- Source: 'src/traits.rs', lines 183:0-183:75 *)
+ Source: 'tests/src/traits.rs', lines 183:0-183:75 *)
let use_with_const_ty1
(h : Type0) (len : usize) (withConstTyInst : withConstTy_t h len) :
result usize
@@ -277,7 +277,7 @@ let use_with_const_ty1
Ok withConstTyInst.cLEN1
(** [traits::use_with_const_ty2]:
- Source: 'src/traits.rs', lines 187:0-187:73 *)
+ Source: 'tests/src/traits.rs', lines 187:0-187:73 *)
let use_with_const_ty2
(h : Type0) (len : usize) (withConstTyInst : withConstTy_t h len)
(w : withConstTyInst.tW) :
@@ -286,7 +286,7 @@ let use_with_const_ty2
Ok ()
(** [traits::use_with_const_ty3]:
- Source: 'src/traits.rs', lines 189:0-189:80 *)
+ Source: 'tests/src/traits.rs', lines 189:0-189:80 *)
let use_with_const_ty3
(h : Type0) (len : usize) (withConstTyInst : withConstTy_t h len)
(x : withConstTyInst.tW) :
@@ -295,12 +295,12 @@ let use_with_const_ty3
withConstTyInst.tW_clause_0.to_u64 x
(** [traits::test_where1]:
- Source: 'src/traits.rs', lines 193:0-193:40 *)
+ Source: 'tests/src/traits.rs', lines 193:0-193:40 *)
let test_where1 (t : Type0) (_x : t) : result unit =
Ok ()
(** [traits::test_where2]:
- Source: 'src/traits.rs', lines 194:0-194:57 *)
+ Source: 'tests/src/traits.rs', lines 194:0-194:57 *)
let test_where2
(t : Type0) (withConstTyT32Inst : withConstTy_t t 32) (_x : u32) :
result unit
@@ -308,7 +308,7 @@ let test_where2
Ok ()
(** Trait declaration: [traits::ParentTrait0]
- Source: 'src/traits.rs', lines 200:0-200:22 *)
+ Source: 'tests/src/traits.rs', lines 200:0-200:22 *)
noeq type parentTrait0_t (self : Type0) = {
tW : Type0;
get_name : self -> result string;
@@ -316,24 +316,24 @@ noeq type parentTrait0_t (self : Type0) = {
}
(** Trait declaration: [traits::ParentTrait1]
- Source: 'src/traits.rs', lines 205:0-205:22 *)
+ Source: 'tests/src/traits.rs', lines 205:0-205:22 *)
type parentTrait1_t (self : Type0) = unit
(** Trait declaration: [traits::ChildTrait]
- Source: 'src/traits.rs', lines 206:0-206:49 *)
+ Source: 'tests/src/traits.rs', lines 206:0-206:49 *)
noeq type childTrait_t (self : Type0) = {
parentTrait0Inst : parentTrait0_t self;
parentTrait1Inst : parentTrait1_t self;
}
(** [traits::test_child_trait1]:
- Source: 'src/traits.rs', lines 209:0-209:56 *)
+ Source: 'tests/src/traits.rs', lines 209:0-209:56 *)
let test_child_trait1
(t : Type0) (childTraitInst : childTrait_t t) (x : t) : result string =
childTraitInst.parentTrait0Inst.get_name x
(** [traits::test_child_trait2]:
- Source: 'src/traits.rs', lines 213:0-213:54 *)
+ Source: 'tests/src/traits.rs', lines 213:0-213:54 *)
let test_child_trait2
(t : Type0) (childTraitInst : childTrait_t t) (x : t) :
result childTraitInst.parentTrait0Inst.tW
@@ -341,7 +341,7 @@ let test_child_trait2
childTraitInst.parentTrait0Inst.get_w x
(** [traits::order1]:
- Source: 'src/traits.rs', lines 219:0-219:59 *)
+ Source: 'tests/src/traits.rs', lines 219:0-219:59 *)
let order1
(t u : Type0) (parentTrait0Inst : parentTrait0_t t) (parentTrait0Inst1 :
parentTrait0_t u) :
@@ -350,27 +350,27 @@ let order1
Ok ()
(** Trait declaration: [traits::ChildTrait1]
- Source: 'src/traits.rs', lines 222:0-222:35 *)
+ Source: 'tests/src/traits.rs', lines 222:0-222:35 *)
noeq type childTrait1_t (self : Type0) = {
parentTrait1Inst : parentTrait1_t self;
}
(** Trait implementation: [traits::{(traits::ParentTrait1 for usize)#9}]
- Source: 'src/traits.rs', lines 224:0-224:27 *)
+ Source: 'tests/src/traits.rs', lines 224:0-224:27 *)
let parentTrait1Usize : parentTrait1_t usize = ()
(** Trait implementation: [traits::{(traits::ChildTrait1 for usize)#10}]
- Source: 'src/traits.rs', lines 225:0-225:26 *)
+ Source: 'tests/src/traits.rs', lines 225:0-225:26 *)
let childTrait1Usize : childTrait1_t usize = {
parentTrait1Inst = parentTrait1Usize;
}
(** Trait declaration: [traits::Iterator]
- Source: 'src/traits.rs', lines 229:0-229:18 *)
+ Source: 'tests/src/traits.rs', lines 229:0-229:18 *)
noeq type iterator_t (self : Type0) = { tItem : Type0; }
(** Trait declaration: [traits::IntoIterator]
- Source: 'src/traits.rs', lines 233:0-233:22 *)
+ Source: 'tests/src/traits.rs', lines 233:0-233:22 *)
noeq type intoIterator_t (self : Type0) = {
tItem : Type0;
tIntoIter : Type0;
@@ -379,107 +379,107 @@ noeq type intoIterator_t (self : Type0) = {
}
(** Trait declaration: [traits::FromResidual]
- Source: 'src/traits.rs', lines 250:0-250:21 *)
+ Source: 'tests/src/traits.rs', lines 250:0-250:21 *)
type fromResidual_t (self t : Type0) = unit
(** Trait declaration: [traits::Try]
- Source: 'src/traits.rs', lines 246:0-246:48 *)
+ Source: 'tests/src/traits.rs', lines 246:0-246:48 *)
noeq type try_t (self : Type0) = {
tResidual : Type0;
fromResidualSelftraitsTryResidualInst : fromResidual_t self tResidual;
}
(** Trait declaration: [traits::WithTarget]
- Source: 'src/traits.rs', lines 252:0-252:20 *)
+ Source: 'tests/src/traits.rs', lines 252:0-252:20 *)
noeq type withTarget_t (self : Type0) = { tTarget : Type0; }
(** Trait declaration: [traits::ParentTrait2]
- Source: 'src/traits.rs', lines 256:0-256:22 *)
+ Source: 'tests/src/traits.rs', lines 256:0-256:22 *)
noeq type parentTrait2_t (self : Type0) = {
tU : Type0;
tU_clause_0 : withTarget_t tU;
}
(** Trait declaration: [traits::ChildTrait2]
- Source: 'src/traits.rs', lines 260:0-260:35 *)
+ Source: 'tests/src/traits.rs', lines 260:0-260:35 *)
noeq type childTrait2_t (self : Type0) = {
parentTrait2Inst : parentTrait2_t self;
convert : parentTrait2Inst.tU -> result parentTrait2Inst.tU_clause_0.tTarget;
}
(** Trait implementation: [traits::{(traits::WithTarget for u32)#11}]
- Source: 'src/traits.rs', lines 264:0-264:23 *)
+ Source: 'tests/src/traits.rs', lines 264:0-264:23 *)
let withTargetU32 : withTarget_t u32 = { tTarget = u32; }
(** Trait implementation: [traits::{(traits::ParentTrait2 for u32)#12}]
- Source: 'src/traits.rs', lines 268:0-268:25 *)
+ Source: 'tests/src/traits.rs', lines 268:0-268:25 *)
let parentTrait2U32 : parentTrait2_t u32 = {
tU = u32;
tU_clause_0 = withTargetU32;
}
(** [traits::{(traits::ChildTrait2 for u32)#13}::convert]:
- Source: 'src/traits.rs', lines 273:4-273:29 *)
+ Source: 'tests/src/traits.rs', lines 273:4-273:29 *)
let childTrait2U32_convert (x : u32) : result u32 =
Ok x
(** Trait implementation: [traits::{(traits::ChildTrait2 for u32)#13}]
- Source: 'src/traits.rs', lines 272:0-272:24 *)
+ Source: 'tests/src/traits.rs', lines 272:0-272:24 *)
let childTrait2U32 : childTrait2_t u32 = {
parentTrait2Inst = parentTrait2U32;
convert = childTrait2U32_convert;
}
(** Trait declaration: [traits::CFnOnce]
- Source: 'src/traits.rs', lines 286:0-286:23 *)
+ Source: 'tests/src/traits.rs', lines 286:0-286:23 *)
noeq type cFnOnce_t (self args : Type0) = {
tOutput : Type0;
call_once : self -> args -> result tOutput;
}
(** Trait declaration: [traits::CFnMut]
- Source: 'src/traits.rs', lines 292:0-292:37 *)
+ Source: 'tests/src/traits.rs', lines 292:0-292:37 *)
noeq type cFnMut_t (self args : Type0) = {
cFnOnceInst : cFnOnce_t self args;
call_mut : self -> args -> result (cFnOnceInst.tOutput & self);
}
(** Trait declaration: [traits::CFn]
- Source: 'src/traits.rs', lines 296:0-296:33 *)
+ Source: 'tests/src/traits.rs', lines 296:0-296:33 *)
noeq type cFn_t (self args : Type0) = {
cFnMutInst : cFnMut_t self args;
call : self -> args -> result cFnMutInst.cFnOnceInst.tOutput;
}
(** Trait declaration: [traits::GetTrait]
- Source: 'src/traits.rs', lines 300:0-300:18 *)
+ Source: 'tests/src/traits.rs', lines 300:0-300:18 *)
noeq type getTrait_t (self : Type0) = { tW : Type0; get_w : self -> result tW;
}
(** [traits::test_get_trait]:
- Source: 'src/traits.rs', lines 305:0-305:49 *)
+ Source: 'tests/src/traits.rs', lines 305:0-305:49 *)
let test_get_trait
(t : Type0) (getTraitInst : getTrait_t t) (x : t) : result getTraitInst.tW =
getTraitInst.get_w x
(** Trait declaration: [traits::Trait]
- Source: 'src/traits.rs', lines 310:0-310:15 *)
+ Source: 'tests/src/traits.rs', lines 310:0-310:15 *)
noeq type trait_t (self : Type0) = { cLEN : usize; }
(** [traits::{(traits::Trait for @Array<T, N>)#14}::LEN]
- Source: 'src/traits.rs', lines 315:4-315:20 *)
+ Source: 'tests/src/traits.rs', lines 315:4-315:20 *)
let trait_array_len_body (t : Type0) (n : usize) : result usize = Ok n
let trait_array_len (t : Type0) (n : usize) : usize =
eval_global (trait_array_len_body t n)
(** Trait implementation: [traits::{(traits::Trait for @Array<T, N>)#14}]
- Source: 'src/traits.rs', lines 314:0-314:40 *)
+ Source: 'tests/src/traits.rs', lines 314:0-314:40 *)
let traitArray (t : Type0) (n : usize) : trait_t (array t n) = {
cLEN = trait_array_len t n;
}
(** [traits::{(traits::Trait for traits::Wrapper<T>)#15}::LEN]
- Source: 'src/traits.rs', lines 319:4-319:20 *)
+ Source: 'tests/src/traits.rs', lines 319:4-319:20 *)
let traittraits_wrapper_len_body (t : Type0) (traitInst : trait_t t)
: result usize =
Ok 0
@@ -487,19 +487,19 @@ let traittraits_wrapper_len (t : Type0) (traitInst : trait_t t) : usize =
eval_global (traittraits_wrapper_len_body t traitInst)
(** Trait implementation: [traits::{(traits::Trait for traits::Wrapper<T>)#15}]
- Source: 'src/traits.rs', lines 318:0-318:35 *)
+ Source: 'tests/src/traits.rs', lines 318:0-318:35 *)
let traittraitsWrapper (t : Type0) (traitInst : trait_t t) : trait_t (wrapper_t
t) = {
cLEN = traittraits_wrapper_len t traitInst;
}
(** [traits::use_wrapper_len]:
- Source: 'src/traits.rs', lines 322:0-322:43 *)
+ Source: 'tests/src/traits.rs', lines 322:0-322:43 *)
let use_wrapper_len (t : Type0) (traitInst : trait_t t) : result usize =
Ok (traittraitsWrapper t traitInst).cLEN
(** [traits::Foo]
- Source: 'src/traits.rs', lines 326:0-326:20 *)
+ Source: 'tests/src/traits.rs', lines 326:0-326:20 *)
type foo_t (t u : Type0) = { x : t; y : u; }
(** [core::result::Result]
@@ -510,7 +510,7 @@ type core_result_Result_t (t e : Type0) =
| Core_result_Result_Err : e -> core_result_Result_t t e
(** [traits::{traits::Foo<T, U>#16}::FOO]
- Source: 'src/traits.rs', lines 332:4-332:33 *)
+ Source: 'tests/src/traits.rs', lines 332:4-332:33 *)
let foo_foo_body (t u : Type0) (traitInst : trait_t t)
: result (core_result_Result_t t i32) =
Ok (Core_result_Result_Err 0)
@@ -519,13 +519,13 @@ let foo_foo (t u : Type0) (traitInst : trait_t t)
eval_global (foo_foo_body t u traitInst)
(** [traits::use_foo1]:
- Source: 'src/traits.rs', lines 335:0-335:48 *)
+ Source: 'tests/src/traits.rs', lines 335:0-335:48 *)
let use_foo1
(t u : Type0) (traitInst : trait_t t) : result (core_result_Result_t t i32) =
Ok (foo_foo t u traitInst)
(** [traits::use_foo2]:
- Source: 'src/traits.rs', lines 339:0-339:48 *)
+ Source: 'tests/src/traits.rs', lines 339:0-339:48 *)
let use_foo2
(t u : Type0) (traitInst : trait_t u) : result (core_result_Result_t u i32) =
Ok (foo_foo u t traitInst)
diff --git a/tests/lean/Arrays.lean b/tests/lean/Arrays.lean
index d606640a..5ffcce51 100644
--- a/tests/lean/Arrays.lean
+++ b/tests/lean/Arrays.lean
@@ -6,24 +6,24 @@ open Primitives
namespace arrays
/- [arrays::AB]
- Source: 'src/arrays.rs', lines 3:0-3:11 -/
+ Source: 'tests/src/arrays.rs', lines 3:0-3:11 -/
inductive AB :=
| A : AB
| B : AB
/- [arrays::incr]:
- Source: 'src/arrays.rs', lines 8:0-8:24 -/
+ Source: 'tests/src/arrays.rs', lines 8:0-8:24 -/
def incr (x : U32) : Result U32 :=
x + 1#u32
/- [arrays::array_to_shared_slice_]:
- Source: 'src/arrays.rs', lines 16:0-16:53 -/
+ Source: 'tests/src/arrays.rs', lines 16:0-16:53 -/
def 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: 'src/arrays.rs', lines 21:0-21:58 -/
+ Source: 'tests/src/arrays.rs', lines 21:0-21:58 -/
def array_to_mut_slice_
(T : Type) (s : Array T 32#usize) :
Result ((Slice T) × (Slice T → Result (Array T 32#usize)))
@@ -31,42 +31,42 @@ def array_to_mut_slice_
Array.to_slice_mut T 32#usize s
/- [arrays::array_len]:
- Source: 'src/arrays.rs', lines 25:0-25:40 -/
+ Source: 'tests/src/arrays.rs', lines 25:0-25:40 -/
def array_len (T : Type) (s : Array T 32#usize) : Result Usize :=
do
let s1 ← Array.to_slice T 32#usize s
Result.ok (Slice.len T s1)
/- [arrays::shared_array_len]:
- Source: 'src/arrays.rs', lines 29:0-29:48 -/
+ Source: 'tests/src/arrays.rs', lines 29:0-29:48 -/
def shared_array_len (T : Type) (s : Array T 32#usize) : Result Usize :=
do
let s1 ← Array.to_slice T 32#usize s
Result.ok (Slice.len T s1)
/- [arrays::shared_slice_len]:
- Source: 'src/arrays.rs', lines 33:0-33:44 -/
+ Source: 'tests/src/arrays.rs', lines 33:0-33:44 -/
def shared_slice_len (T : Type) (s : Slice T) : Result Usize :=
Result.ok (Slice.len T s)
/- [arrays::index_array_shared]:
- Source: 'src/arrays.rs', lines 37:0-37:57 -/
+ Source: 'tests/src/arrays.rs', lines 37:0-37:57 -/
def 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: 'src/arrays.rs', lines 44:0-44:53 -/
+ Source: 'tests/src/arrays.rs', lines 44:0-44:53 -/
def 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: 'src/arrays.rs', lines 48:0-48:45 -/
+ Source: 'tests/src/arrays.rs', lines 48:0-48:45 -/
def index_array_copy (x : Array U32 32#usize) : Result U32 :=
Array.index_usize U32 32#usize x 0#usize
/- [arrays::index_mut_array]:
- Source: 'src/arrays.rs', lines 52:0-52:62 -/
+ Source: 'tests/src/arrays.rs', lines 52:0-52:62 -/
def index_mut_array
(T : Type) (s : Array T 32#usize) (i : Usize) :
Result (T × (T → Result (Array T 32#usize)))
@@ -74,12 +74,12 @@ def index_mut_array
Array.index_mut_usize T 32#usize s i
/- [arrays::index_slice]:
- Source: 'src/arrays.rs', lines 56:0-56:46 -/
+ Source: 'tests/src/arrays.rs', lines 56:0-56:46 -/
def index_slice (T : Type) (s : Slice T) (i : Usize) : Result T :=
Slice.index_usize T s i
/- [arrays::index_mut_slice]:
- Source: 'src/arrays.rs', lines 60:0-60:58 -/
+ Source: 'tests/src/arrays.rs', lines 60:0-60:58 -/
def index_mut_slice
(T : Type) (s : Slice T) (i : Usize) :
Result (T × (T → Result (Slice T)))
@@ -87,7 +87,7 @@ def index_mut_slice
Slice.index_mut_usize T s i
/- [arrays::slice_subslice_shared_]:
- Source: 'src/arrays.rs', lines 64:0-64:70 -/
+ Source: 'tests/src/arrays.rs', lines 64:0-64:70 -/
def slice_subslice_shared_
(x : Slice U32) (y : Usize) (z : Usize) : Result (Slice U32) :=
core.slice.index.Slice.index U32 (core.ops.range.Range Usize)
@@ -95,7 +95,7 @@ def slice_subslice_shared_
{ start := y, end_ := z }
/- [arrays::slice_subslice_mut_]:
- Source: 'src/arrays.rs', lines 68:0-68:75 -/
+ Source: 'tests/src/arrays.rs', lines 68:0-68:75 -/
def slice_subslice_mut_
(x : Slice U32) (y : Usize) (z : Usize) :
Result ((Slice U32) × (Slice U32 → Result (Slice U32)))
@@ -108,12 +108,12 @@ def slice_subslice_mut_
Result.ok (s, index_mut_back)
/- [arrays::array_to_slice_shared_]:
- Source: 'src/arrays.rs', lines 72:0-72:54 -/
+ Source: 'tests/src/arrays.rs', lines 72:0-72:54 -/
def 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: 'src/arrays.rs', lines 76:0-76:59 -/
+ Source: 'tests/src/arrays.rs', lines 76:0-76:59 -/
def array_to_slice_mut_
(x : Array U32 32#usize) :
Result ((Slice U32) × (Slice U32 → Result (Array U32 32#usize)))
@@ -121,7 +121,7 @@ def array_to_slice_mut_
Array.to_slice_mut U32 32#usize x
/- [arrays::array_subslice_shared_]:
- Source: 'src/arrays.rs', lines 80:0-80:74 -/
+ Source: 'tests/src/arrays.rs', lines 80:0-80:74 -/
def 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
@@ -130,7 +130,7 @@ def array_subslice_shared_
{ start := y, end_ := z }
/- [arrays::array_subslice_mut_]:
- Source: 'src/arrays.rs', lines 84:0-84:79 -/
+ Source: 'tests/src/arrays.rs', lines 84:0-84:79 -/
def array_subslice_mut_
(x : Array U32 32#usize) (y : Usize) (z : Usize) :
Result ((Slice U32) × (Slice U32 → Result (Array U32 32#usize)))
@@ -144,17 +144,17 @@ def array_subslice_mut_
Result.ok (s, index_mut_back)
/- [arrays::index_slice_0]:
- Source: 'src/arrays.rs', lines 88:0-88:38 -/
+ Source: 'tests/src/arrays.rs', lines 88:0-88:38 -/
def index_slice_0 (T : Type) (s : Slice T) : Result T :=
Slice.index_usize T s 0#usize
/- [arrays::index_array_0]:
- Source: 'src/arrays.rs', lines 92:0-92:42 -/
+ Source: 'tests/src/arrays.rs', lines 92:0-92:42 -/
def 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: 'src/arrays.rs', lines 103:0-103:71 -/
+ Source: 'tests/src/arrays.rs', lines 103:0-103:71 -/
def index_index_array
(s : Array (Array U32 32#usize) 32#usize) (i : Usize) (j : Usize) :
Result U32
@@ -164,7 +164,7 @@ def index_index_array
Array.index_usize U32 32#usize a j
/- [arrays::update_update_array]:
- Source: 'src/arrays.rs', lines 114:0-114:70 -/
+ Source: 'tests/src/arrays.rs', lines 114:0-114:70 -/
def update_update_array
(s : Array (Array U32 32#usize) 32#usize) (i : Usize) (j : Usize) :
Result Unit
@@ -178,37 +178,37 @@ def update_update_array
Result.ok ()
/- [arrays::array_local_deep_copy]:
- Source: 'src/arrays.rs', lines 118:0-118:43 -/
+ Source: 'tests/src/arrays.rs', lines 118:0-118:43 -/
def array_local_deep_copy (x : Array U32 32#usize) : Result Unit :=
Result.ok ()
/- [arrays::take_array]:
- Source: 'src/arrays.rs', lines 122:0-122:30 -/
+ Source: 'tests/src/arrays.rs', lines 122:0-122:30 -/
def take_array (a : Array U32 2#usize) : Result Unit :=
Result.ok ()
/- [arrays::take_array_borrow]:
- Source: 'src/arrays.rs', lines 123:0-123:38 -/
+ Source: 'tests/src/arrays.rs', lines 123:0-123:38 -/
def take_array_borrow (a : Array U32 2#usize) : Result Unit :=
Result.ok ()
/- [arrays::take_slice]:
- Source: 'src/arrays.rs', lines 124:0-124:28 -/
+ Source: 'tests/src/arrays.rs', lines 124:0-124:28 -/
def take_slice (s : Slice U32) : Result Unit :=
Result.ok ()
/- [arrays::take_mut_slice]:
- Source: 'src/arrays.rs', lines 125:0-125:36 -/
+ Source: 'tests/src/arrays.rs', lines 125:0-125:36 -/
def take_mut_slice (s : Slice U32) : Result (Slice U32) :=
Result.ok s
/- [arrays::const_array]:
- Source: 'src/arrays.rs', lines 127:0-127:32 -/
+ Source: 'tests/src/arrays.rs', lines 127:0-127:32 -/
def const_array : Result (Array U32 2#usize) :=
Result.ok (Array.make U32 2#usize [ 0#u32, 0#u32 ])
/- [arrays::const_slice]:
- Source: 'src/arrays.rs', lines 131:0-131:20 -/
+ Source: 'tests/src/arrays.rs', lines 131:0-131:20 -/
def const_slice : Result Unit :=
do
let _ ←
@@ -216,7 +216,7 @@ def const_slice : Result Unit :=
Result.ok ()
/- [arrays::take_all]:
- Source: 'src/arrays.rs', lines 141:0-141:17 -/
+ Source: 'tests/src/arrays.rs', lines 141:0-141:17 -/
def take_all : Result Unit :=
do
let _ ← take_array (Array.make U32 2#usize [ 0#u32, 0#u32 ])
@@ -232,29 +232,29 @@ def take_all : Result Unit :=
Result.ok ()
/- [arrays::index_array]:
- Source: 'src/arrays.rs', lines 155:0-155:38 -/
+ Source: 'tests/src/arrays.rs', lines 155:0-155:38 -/
def index_array (x : Array U32 2#usize) : Result U32 :=
Array.index_usize U32 2#usize x 0#usize
/- [arrays::index_array_borrow]:
- Source: 'src/arrays.rs', lines 158:0-158:46 -/
+ Source: 'tests/src/arrays.rs', lines 158:0-158:46 -/
def 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: 'src/arrays.rs', lines 162:0-162:42 -/
+ Source: 'tests/src/arrays.rs', lines 162:0-162:42 -/
def index_slice_u32_0 (x : Slice U32) : Result U32 :=
Slice.index_usize U32 x 0#usize
/- [arrays::index_mut_slice_u32_0]:
- Source: 'src/arrays.rs', lines 166:0-166:50 -/
+ Source: 'tests/src/arrays.rs', lines 166:0-166:50 -/
def index_mut_slice_u32_0 (x : Slice U32) : Result (U32 × (Slice U32)) :=
do
let i ← Slice.index_usize U32 x 0#usize
Result.ok (i, x)
/- [arrays::index_all]:
- Source: 'src/arrays.rs', lines 170:0-170:25 -/
+ Source: 'tests/src/arrays.rs', lines 170:0-170:25 -/
def index_all : Result U32 :=
do
let i ← index_array (Array.make U32 2#usize [ 0#u32, 0#u32 ])
@@ -274,7 +274,7 @@ def index_all : Result U32 :=
Result.ok i8
/- [arrays::update_array]:
- Source: 'src/arrays.rs', lines 184:0-184:36 -/
+ Source: 'tests/src/arrays.rs', lines 184:0-184:36 -/
def update_array (x : Array U32 2#usize) : Result Unit :=
do
let (_, index_mut_back) ← Array.index_mut_usize U32 2#usize x 0#usize
@@ -282,7 +282,7 @@ def update_array (x : Array U32 2#usize) : Result Unit :=
Result.ok ()
/- [arrays::update_array_mut_borrow]:
- Source: 'src/arrays.rs', lines 187:0-187:48 -/
+ Source: 'tests/src/arrays.rs', lines 187:0-187:48 -/
def update_array_mut_borrow
(x : Array U32 2#usize) : Result (Array U32 2#usize) :=
do
@@ -290,14 +290,14 @@ def update_array_mut_borrow
index_mut_back 1#u32
/- [arrays::update_mut_slice]:
- Source: 'src/arrays.rs', lines 190:0-190:38 -/
+ Source: 'tests/src/arrays.rs', lines 190:0-190:38 -/
def update_mut_slice (x : Slice U32) : Result (Slice U32) :=
do
let (_, index_mut_back) ← Slice.index_mut_usize U32 x 0#usize
index_mut_back 1#u32
/- [arrays::update_all]:
- Source: 'src/arrays.rs', lines 194:0-194:19 -/
+ Source: 'tests/src/arrays.rs', lines 194:0-194:19 -/
def update_all : Result Unit :=
do
let _ ← update_array (Array.make U32 2#usize [ 0#u32, 0#u32 ])
@@ -309,7 +309,7 @@ def update_all : Result Unit :=
Result.ok ()
/- [arrays::range_all]:
- Source: 'src/arrays.rs', lines 205:0-205:18 -/
+ Source: 'tests/src/arrays.rs', lines 205:0-205:18 -/
def range_all : Result Unit :=
do
let (s, index_mut_back) ←
@@ -323,12 +323,12 @@ def range_all : Result Unit :=
Result.ok ()
/- [arrays::deref_array_borrow]:
- Source: 'src/arrays.rs', lines 214:0-214:46 -/
+ Source: 'tests/src/arrays.rs', lines 214:0-214:46 -/
def 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: 'src/arrays.rs', lines 219:0-219:54 -/
+ Source: 'tests/src/arrays.rs', lines 219:0-219:54 -/
def deref_array_mut_borrow
(x : Array U32 2#usize) : Result (U32 × (Array U32 2#usize)) :=
do
@@ -336,17 +336,17 @@ def deref_array_mut_borrow
Result.ok (i, x)
/- [arrays::take_array_t]:
- Source: 'src/arrays.rs', lines 227:0-227:31 -/
+ Source: 'tests/src/arrays.rs', lines 227:0-227:31 -/
def take_array_t (a : Array AB 2#usize) : Result Unit :=
Result.ok ()
/- [arrays::non_copyable_array]:
- Source: 'src/arrays.rs', lines 229:0-229:27 -/
+ Source: 'tests/src/arrays.rs', lines 229:0-229:27 -/
def non_copyable_array : Result Unit :=
take_array_t (Array.make AB 2#usize [ AB.A, AB.B ])
/- [arrays::sum]: loop 0:
- Source: 'src/arrays.rs', lines 242:0-250:1 -/
+ Source: 'tests/src/arrays.rs', lines 242:0-250:1 -/
divergent def sum_loop (s : Slice U32) (sum1 : U32) (i : Usize) : Result U32 :=
let i1 := Slice.len U32 s
if i < i1
@@ -359,12 +359,12 @@ divergent def sum_loop (s : Slice U32) (sum1 : U32) (i : Usize) : Result U32 :=
else Result.ok sum1
/- [arrays::sum]:
- Source: 'src/arrays.rs', lines 242:0-242:28 -/
+ Source: 'tests/src/arrays.rs', lines 242:0-242:28 -/
def sum (s : Slice U32) : Result U32 :=
sum_loop s 0#u32 0#usize
/- [arrays::sum2]: loop 0:
- Source: 'src/arrays.rs', lines 252:0-261:1 -/
+ Source: 'tests/src/arrays.rs', lines 252:0-261:1 -/
divergent def sum2_loop
(s : Slice U32) (s2 : Slice U32) (sum1 : U32) (i : Usize) : Result U32 :=
let i1 := Slice.len U32 s
@@ -380,7 +380,7 @@ divergent def sum2_loop
else Result.ok sum1
/- [arrays::sum2]:
- Source: 'src/arrays.rs', lines 252:0-252:41 -/
+ Source: 'tests/src/arrays.rs', lines 252:0-252:41 -/
def sum2 (s : Slice U32) (s2 : Slice U32) : Result U32 :=
let i := Slice.len U32 s
let i1 := Slice.len U32 s2
@@ -389,7 +389,7 @@ def sum2 (s : Slice U32) (s2 : Slice U32) : Result U32 :=
else sum2_loop s s2 0#u32 0#usize
/- [arrays::f0]:
- Source: 'src/arrays.rs', lines 263:0-263:11 -/
+ Source: 'tests/src/arrays.rs', lines 263:0-263:11 -/
def f0 : Result Unit :=
do
let (s, to_slice_mut_back) ←
@@ -400,7 +400,7 @@ def f0 : Result Unit :=
Result.ok ()
/- [arrays::f1]:
- Source: 'src/arrays.rs', lines 268:0-268:11 -/
+ Source: 'tests/src/arrays.rs', lines 268:0-268:11 -/
def f1 : Result Unit :=
do
let (_, index_mut_back) ←
@@ -410,12 +410,12 @@ def f1 : Result Unit :=
Result.ok ()
/- [arrays::f2]:
- Source: 'src/arrays.rs', lines 273:0-273:17 -/
+ Source: 'tests/src/arrays.rs', lines 273:0-273:17 -/
def f2 (i : U32) : Result Unit :=
Result.ok ()
/- [arrays::f4]:
- Source: 'src/arrays.rs', lines 282:0-282:54 -/
+ Source: 'tests/src/arrays.rs', lines 282:0-282:54 -/
def 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
(core.ops.index.IndexSliceTIInst U32 (core.ops.range.Range Usize)
@@ -423,7 +423,7 @@ def f4 (x : Array U32 32#usize) (y : Usize) (z : Usize) : Result (Slice U32) :=
{ start := y, end_ := z }
/- [arrays::f3]:
- Source: 'src/arrays.rs', lines 275:0-275:18 -/
+ Source: 'tests/src/arrays.rs', lines 275:0-275:18 -/
def f3 : Result U32 :=
do
let i ←
@@ -437,17 +437,17 @@ def f3 : Result U32 :=
sum2 s s1
/- [arrays::SZ]
- Source: 'src/arrays.rs', lines 286:0-286:19 -/
+ Source: 'tests/src/arrays.rs', lines 286:0-286:19 -/
def SZ_body : Result Usize := Result.ok 32#usize
def SZ : Usize := eval_global SZ_body
/- [arrays::f5]:
- Source: 'src/arrays.rs', lines 289:0-289:31 -/
+ Source: 'tests/src/arrays.rs', lines 289:0-289:31 -/
def f5 (x : Array U32 32#usize) : Result U32 :=
Array.index_usize U32 32#usize x 0#usize
/- [arrays::ite]:
- Source: 'src/arrays.rs', lines 294:0-294:12 -/
+ Source: 'tests/src/arrays.rs', lines 294:0-294:12 -/
def ite : Result Unit :=
do
let (s, to_slice_mut_back) ←
@@ -461,7 +461,7 @@ def ite : Result Unit :=
Result.ok ()
/- [arrays::zero_slice]: loop 0:
- Source: 'src/arrays.rs', lines 303:0-310:1 -/
+ Source: 'tests/src/arrays.rs', lines 303:0-310:1 -/
divergent def zero_slice_loop
(a : Slice U8) (i : Usize) (len : Usize) : Result (Slice U8) :=
if i < len
@@ -474,13 +474,13 @@ divergent def zero_slice_loop
else Result.ok a
/- [arrays::zero_slice]:
- Source: 'src/arrays.rs', lines 303:0-303:31 -/
+ Source: 'tests/src/arrays.rs', lines 303:0-303:31 -/
def zero_slice (a : Slice U8) : Result (Slice U8) :=
let len := Slice.len U8 a
zero_slice_loop a 0#usize len
/- [arrays::iter_mut_slice]: loop 0:
- Source: 'src/arrays.rs', lines 312:0-318:1 -/
+ Source: 'tests/src/arrays.rs', lines 312:0-318:1 -/
divergent def iter_mut_slice_loop (len : Usize) (i : Usize) : Result Unit :=
if i < len
then do
@@ -489,7 +489,7 @@ divergent def iter_mut_slice_loop (len : Usize) (i : Usize) : Result Unit :=
else Result.ok ()
/- [arrays::iter_mut_slice]:
- Source: 'src/arrays.rs', lines 312:0-312:35 -/
+ Source: 'tests/src/arrays.rs', lines 312:0-312:35 -/
def iter_mut_slice (a : Slice U8) : Result (Slice U8) :=
do
let len := Slice.len U8 a
@@ -497,7 +497,7 @@ def iter_mut_slice (a : Slice U8) : Result (Slice U8) :=
Result.ok a
/- [arrays::sum_mut_slice]: loop 0:
- Source: 'src/arrays.rs', lines 320:0-328:1 -/
+ Source: 'tests/src/arrays.rs', lines 320:0-328:1 -/
divergent def sum_mut_slice_loop
(a : Slice U32) (i : Usize) (s : U32) : Result U32 :=
let i1 := Slice.len U32 a
@@ -511,7 +511,7 @@ divergent def sum_mut_slice_loop
else Result.ok s
/- [arrays::sum_mut_slice]:
- Source: 'src/arrays.rs', lines 320:0-320:42 -/
+ Source: 'tests/src/arrays.rs', lines 320:0-320:42 -/
def sum_mut_slice (a : Slice U32) : Result (U32 × (Slice U32)) :=
do
let i ← sum_mut_slice_loop a 0#usize 0#u32
diff --git a/tests/lean/Bitwise.lean b/tests/lean/Bitwise.lean
index c13129f1..4ed56a0a 100644
--- a/tests/lean/Bitwise.lean
+++ b/tests/lean/Bitwise.lean
@@ -6,31 +6,31 @@ open Primitives
namespace bitwise
/- [bitwise::shift_u32]:
- Source: 'src/bitwise.rs', lines 3:0-3:31 -/
+ Source: 'tests/src/bitwise.rs', lines 3:0-3:31 -/
def shift_u32 (a : U32) : Result U32 :=
do
let t ← a >>> 16#usize
t <<< 16#usize
/- [bitwise::shift_i32]:
- Source: 'src/bitwise.rs', lines 10:0-10:31 -/
+ Source: 'tests/src/bitwise.rs', lines 10:0-10:31 -/
def shift_i32 (a : I32) : Result I32 :=
do
let t ← a >>> 16#isize
t <<< 16#isize
/- [bitwise::xor_u32]:
- Source: 'src/bitwise.rs', lines 17:0-17:37 -/
+ Source: 'tests/src/bitwise.rs', lines 17:0-17:37 -/
def xor_u32 (a : U32) (b : U32) : Result U32 :=
Result.ok (a ^^^ b)
/- [bitwise::or_u32]:
- Source: 'src/bitwise.rs', lines 21:0-21:36 -/
+ Source: 'tests/src/bitwise.rs', lines 21:0-21:36 -/
def or_u32 (a : U32) (b : U32) : Result U32 :=
Result.ok (a ||| b)
/- [bitwise::and_u32]:
- Source: 'src/bitwise.rs', lines 25:0-25:37 -/
+ Source: 'tests/src/bitwise.rs', lines 25:0-25:37 -/
def and_u32 (a : U32) (b : U32) : Result U32 :=
Result.ok (a &&& b)
diff --git a/tests/lean/Constants.lean b/tests/lean/Constants.lean
index 3cc3ca40..532f265a 100644
--- a/tests/lean/Constants.lean
+++ b/tests/lean/Constants.lean
@@ -6,123 +6,123 @@ open Primitives
namespace constants
/- [constants::X0]
- Source: 'src/constants.rs', lines 5:0-5:17 -/
+ Source: 'tests/src/constants.rs', lines 5:0-5:17 -/
def X0_body : Result U32 := Result.ok 0#u32
def X0 : U32 := eval_global X0_body
/- [constants::X1]
- Source: 'src/constants.rs', lines 7:0-7:17 -/
+ Source: 'tests/src/constants.rs', lines 7:0-7:17 -/
def X1_body : Result U32 := Result.ok core_u32_max
def X1 : U32 := eval_global X1_body
/- [constants::X2]
- Source: 'src/constants.rs', lines 10:0-10:17 -/
+ Source: 'tests/src/constants.rs', lines 10:0-10:17 -/
def X2_body : Result U32 := Result.ok 3#u32
def X2 : U32 := eval_global X2_body
/- [constants::incr]:
- Source: 'src/constants.rs', lines 17:0-17:32 -/
+ Source: 'tests/src/constants.rs', lines 17:0-17:32 -/
def incr (n : U32) : Result U32 :=
n + 1#u32
/- [constants::X3]
- Source: 'src/constants.rs', lines 15:0-15:17 -/
+ Source: 'tests/src/constants.rs', lines 15:0-15:17 -/
def X3_body : Result U32 := incr 32#u32
def X3 : U32 := eval_global X3_body
/- [constants::mk_pair0]:
- Source: 'src/constants.rs', lines 23:0-23:51 -/
+ Source: 'tests/src/constants.rs', lines 23:0-23:51 -/
def mk_pair0 (x : U32) (y : U32) : Result (U32 × U32) :=
Result.ok (x, y)
/- [constants::Pair]
- Source: 'src/constants.rs', lines 36:0-36:23 -/
+ Source: 'tests/src/constants.rs', lines 36:0-36:23 -/
structure Pair (T1 T2 : Type) where
x : T1
y : T2
/- [constants::mk_pair1]:
- Source: 'src/constants.rs', lines 27:0-27:55 -/
+ Source: 'tests/src/constants.rs', lines 27:0-27:55 -/
def mk_pair1 (x : U32) (y : U32) : Result (Pair U32 U32) :=
Result.ok { x := x, y := y }
/- [constants::P0]
- Source: 'src/constants.rs', lines 31:0-31:24 -/
+ Source: 'tests/src/constants.rs', lines 31:0-31:24 -/
def P0_body : Result (U32 × U32) := mk_pair0 0#u32 1#u32
def P0 : (U32 × U32) := eval_global P0_body
/- [constants::P1]
- Source: 'src/constants.rs', lines 32:0-32:28 -/
+ Source: 'tests/src/constants.rs', lines 32:0-32:28 -/
def P1_body : Result (Pair U32 U32) := mk_pair1 0#u32 1#u32
def P1 : Pair U32 U32 := eval_global P1_body
/- [constants::P2]
- Source: 'src/constants.rs', lines 33:0-33:24 -/
+ Source: 'tests/src/constants.rs', lines 33:0-33:24 -/
def P2_body : Result (U32 × U32) := Result.ok (0#u32, 1#u32)
def P2 : (U32 × U32) := eval_global P2_body
/- [constants::P3]
- Source: 'src/constants.rs', lines 34:0-34:28 -/
+ Source: 'tests/src/constants.rs', lines 34:0-34:28 -/
def P3_body : Result (Pair U32 U32) := Result.ok { x := 0#u32, y := 1#u32 }
def P3 : Pair U32 U32 := eval_global P3_body
/- [constants::Wrap]
- Source: 'src/constants.rs', lines 49:0-49:18 -/
+ Source: 'tests/src/constants.rs', lines 49:0-49:18 -/
structure Wrap (T : Type) where
value : T
/- [constants::{constants::Wrap<T>}::new]:
- Source: 'src/constants.rs', lines 54:4-54:41 -/
+ Source: 'tests/src/constants.rs', lines 54:4-54:41 -/
def Wrap.new (T : Type) (value : T) : Result (Wrap T) :=
Result.ok { value := value }
/- [constants::Y]
- Source: 'src/constants.rs', lines 41:0-41:22 -/
+ Source: 'tests/src/constants.rs', lines 41:0-41:22 -/
def Y_body : Result (Wrap I32) := Wrap.new I32 2#i32
def Y : Wrap I32 := eval_global Y_body
/- [constants::unwrap_y]:
- Source: 'src/constants.rs', lines 43:0-43:30 -/
+ Source: 'tests/src/constants.rs', lines 43:0-43:30 -/
def unwrap_y : Result I32 :=
Result.ok Y.value
/- [constants::YVAL]
- Source: 'src/constants.rs', lines 47:0-47:19 -/
+ Source: 'tests/src/constants.rs', lines 47:0-47:19 -/
def YVAL_body : Result I32 := unwrap_y
def YVAL : I32 := eval_global YVAL_body
/- [constants::get_z1::Z1]
- Source: 'src/constants.rs', lines 62:4-62:17 -/
+ Source: 'tests/src/constants.rs', lines 62:4-62:17 -/
def get_z1.Z1_body : Result I32 := Result.ok 3#i32
def get_z1.Z1 : I32 := eval_global get_z1.Z1_body
/- [constants::get_z1]:
- Source: 'src/constants.rs', lines 61:0-61:28 -/
+ Source: 'tests/src/constants.rs', lines 61:0-61:28 -/
def get_z1 : Result I32 :=
Result.ok get_z1.Z1
/- [constants::add]:
- Source: 'src/constants.rs', lines 66:0-66:39 -/
+ Source: 'tests/src/constants.rs', lines 66:0-66:39 -/
def add (a : I32) (b : I32) : Result I32 :=
a + b
/- [constants::Q1]
- Source: 'src/constants.rs', lines 74:0-74:17 -/
+ Source: 'tests/src/constants.rs', lines 74:0-74:17 -/
def Q1_body : Result I32 := Result.ok 5#i32
def Q1 : I32 := eval_global Q1_body
/- [constants::Q2]
- Source: 'src/constants.rs', lines 75:0-75:17 -/
+ Source: 'tests/src/constants.rs', lines 75:0-75:17 -/
def Q2_body : Result I32 := Result.ok Q1
def Q2 : I32 := eval_global Q2_body
/- [constants::Q3]
- Source: 'src/constants.rs', lines 76:0-76:17 -/
+ Source: 'tests/src/constants.rs', lines 76:0-76:17 -/
def Q3_body : Result I32 := add Q2 3#i32
def Q3 : I32 := eval_global Q3_body
/- [constants::get_z2]:
- Source: 'src/constants.rs', lines 70:0-70:28 -/
+ Source: 'tests/src/constants.rs', lines 70:0-70:28 -/
def get_z2 : Result I32 :=
do
let i ← get_z1
@@ -130,37 +130,37 @@ def get_z2 : Result I32 :=
add Q1 i1
/- [constants::S1]
- Source: 'src/constants.rs', lines 80:0-80:18 -/
+ Source: 'tests/src/constants.rs', lines 80:0-80:18 -/
def S1_body : Result U32 := Result.ok 6#u32
def S1 : U32 := eval_global S1_body
/- [constants::S2]
- Source: 'src/constants.rs', lines 81:0-81:18 -/
+ Source: 'tests/src/constants.rs', lines 81:0-81:18 -/
def S2_body : Result U32 := incr S1
def S2 : U32 := eval_global S2_body
/- [constants::S3]
- Source: 'src/constants.rs', lines 82:0-82:29 -/
+ Source: 'tests/src/constants.rs', lines 82:0-82:29 -/
def S3_body : Result (Pair U32 U32) := Result.ok P3
def S3 : Pair U32 U32 := eval_global S3_body
/- [constants::S4]
- Source: 'src/constants.rs', lines 83:0-83:29 -/
+ Source: 'tests/src/constants.rs', lines 83:0-83:29 -/
def S4_body : Result (Pair U32 U32) := mk_pair1 7#u32 8#u32
def S4 : Pair U32 U32 := eval_global S4_body
/- [constants::V]
- Source: 'src/constants.rs', lines 86:0-86:31 -/
+ Source: 'tests/src/constants.rs', lines 86:0-86:31 -/
structure V (T : Type) (N : Usize) where
x : Array T N
/- [constants::{constants::V<T, N>#1}::LEN]
- Source: 'src/constants.rs', lines 91:4-91:24 -/
+ Source: 'tests/src/constants.rs', lines 91:4-91:24 -/
def V.LEN_body (T : Type) (N : Usize) : Result Usize := Result.ok N
def V.LEN (T : Type) (N : Usize) : Usize := eval_global (V.LEN_body T N)
/- [constants::use_v]:
- Source: 'src/constants.rs', lines 94:0-94:42 -/
+ Source: 'tests/src/constants.rs', lines 94:0-94:42 -/
def use_v (T : Type) (N : Usize) : Result Usize :=
Result.ok (V.LEN T N)
diff --git a/tests/lean/Demo/Demo.lean b/tests/lean/Demo/Demo.lean
index 3a3aeb96..a9b349b3 100644
--- a/tests/lean/Demo/Demo.lean
+++ b/tests/lean/Demo/Demo.lean
@@ -6,7 +6,7 @@ open Primitives
namespace demo
/- [demo::choose]:
- Source: 'src/demo.rs', lines 5:0-5:70 -/
+ Source: 'tests/src/demo.rs', lines 5:0-5:70 -/
def choose
(T : Type) (b : Bool) (x : T) (y : T) :
Result (T × (T → Result (T × T)))
@@ -18,26 +18,26 @@ def choose
Result.ok (y, back)
/- [demo::mul2_add1]:
- Source: 'src/demo.rs', lines 13:0-13:31 -/
+ Source: 'tests/src/demo.rs', lines 13:0-13:31 -/
def mul2_add1 (x : U32) : Result U32 :=
do
let i ← x + x
i + 1#u32
/- [demo::use_mul2_add1]:
- Source: 'src/demo.rs', lines 17:0-17:43 -/
+ Source: 'tests/src/demo.rs', lines 17:0-17:43 -/
def use_mul2_add1 (x : U32) (y : U32) : Result U32 :=
do
let i ← mul2_add1 x
i + y
/- [demo::incr]:
- Source: 'src/demo.rs', lines 21:0-21:31 -/
+ Source: 'tests/src/demo.rs', lines 21:0-21:31 -/
def incr (x : U32) : Result U32 :=
x + 1#u32
/- [demo::use_incr]:
- Source: 'src/demo.rs', lines 25:0-25:17 -/
+ Source: 'tests/src/demo.rs', lines 25:0-25:17 -/
def use_incr : Result Unit :=
do
let x ← incr 0#u32
@@ -46,13 +46,13 @@ def use_incr : Result Unit :=
Result.ok ()
/- [demo::CList]
- Source: 'src/demo.rs', lines 34:0-34:17 -/
+ Source: 'tests/src/demo.rs', lines 34:0-34:17 -/
inductive CList (T : Type) :=
| CCons : T → CList T → CList T
| CNil : CList T
/- [demo::list_nth]:
- Source: 'src/demo.rs', lines 39:0-39:56 -/
+ Source: 'tests/src/demo.rs', lines 39:0-39:56 -/
divergent def list_nth (T : Type) (l : CList T) (i : U32) : Result T :=
match l with
| CList.CCons x tl =>
@@ -64,7 +64,7 @@ divergent def list_nth (T : Type) (l : CList T) (i : U32) : Result T :=
| CList.CNil => Result.fail .panic
/- [demo::list_nth_mut]:
- Source: 'src/demo.rs', lines 54:0-54:68 -/
+ Source: 'tests/src/demo.rs', lines 54:0-54:68 -/
divergent def list_nth_mut
(T : Type) (l : CList T) (i : U32) :
Result (T × (T → Result (CList T)))
@@ -88,7 +88,7 @@ divergent def list_nth_mut
| CList.CNil => Result.fail .panic
/- [demo::list_nth_mut1]: loop 0:
- Source: 'src/demo.rs', lines 69:0-78:1 -/
+ Source: 'tests/src/demo.rs', lines 69:0-78:1 -/
divergent def list_nth_mut1_loop
(T : Type) (l : CList T) (i : U32) :
Result (T × (T → Result (CList T)))
@@ -111,7 +111,7 @@ divergent def list_nth_mut1_loop
| CList.CNil => Result.fail .panic
/- [demo::list_nth_mut1]:
- Source: 'src/demo.rs', lines 69:0-69:77 -/
+ Source: 'tests/src/demo.rs', lines 69:0-69:77 -/
def list_nth_mut1
(T : Type) (l : CList T) (i : U32) :
Result (T × (T → Result (CList T)))
@@ -119,7 +119,7 @@ def list_nth_mut1
list_nth_mut1_loop T l i
/- [demo::i32_id]:
- Source: 'src/demo.rs', lines 80:0-80:28 -/
+ Source: 'tests/src/demo.rs', lines 80:0-80:28 -/
divergent def i32_id (i : I32) : Result I32 :=
if i = 0#i32
then Result.ok 0#i32
@@ -129,7 +129,7 @@ divergent def i32_id (i : I32) : Result I32 :=
i2 + 1#i32
/- [demo::list_tail]:
- Source: 'src/demo.rs', lines 88:0-88:64 -/
+ Source: 'tests/src/demo.rs', lines 88:0-88:64 -/
divergent def list_tail
(T : Type) (l : CList T) :
Result ((CList T) × (CList T → Result (CList T)))
@@ -147,25 +147,25 @@ divergent def list_tail
| CList.CNil => Result.ok (CList.CNil, Result.ok)
/- Trait declaration: [demo::Counter]
- Source: 'src/demo.rs', lines 97:0-97:17 -/
+ Source: 'tests/src/demo.rs', lines 97:0-97:17 -/
structure Counter (Self : Type) where
incr : Self → Result (Usize × Self)
/- [demo::{(demo::Counter for usize)}::incr]:
- Source: 'src/demo.rs', lines 102:4-102:31 -/
+ Source: 'tests/src/demo.rs', lines 102:4-102:31 -/
def CounterUsize.incr (self : Usize) : Result (Usize × Usize) :=
do
let self1 ← self + 1#usize
Result.ok (self, self1)
/- Trait implementation: [demo::{(demo::Counter for usize)}]
- Source: 'src/demo.rs', lines 101:0-101:22 -/
+ Source: 'tests/src/demo.rs', lines 101:0-101:22 -/
def CounterUsize : Counter Usize := {
incr := CounterUsize.incr
}
/- [demo::use_counter]:
- Source: 'src/demo.rs', lines 109:0-109:59 -/
+ Source: 'tests/src/demo.rs', lines 109:0-109:59 -/
def use_counter
(T : Type) (CounterInst : Counter T) (cnt : T) : Result (Usize × T) :=
CounterInst.incr cnt
diff --git a/tests/lean/External/Funs.lean b/tests/lean/External/Funs.lean
index 0b0a2476..5e3c9b1d 100644
--- a/tests/lean/External/Funs.lean
+++ b/tests/lean/External/Funs.lean
@@ -15,12 +15,12 @@ def core.marker.CopyU32 : core.marker.Copy U32 := {
}
/- [external::use_get]:
- Source: 'src/external.rs', lines 5:0-5:37 -/
+ Source: 'tests/src/external.rs', lines 5:0-5:37 -/
def use_get (rc : core.cell.Cell U32) (st : State) : Result (State × U32) :=
core.cell.Cell.get U32 core.marker.CopyU32 rc st
/- [external::incr]:
- Source: 'src/external.rs', lines 9:0-9:31 -/
+ Source: 'tests/src/external.rs', lines 9:0-9:31 -/
def incr
(rc : core.cell.Cell U32) (st : State) :
Result (State × (core.cell.Cell U32))
diff --git a/tests/lean/Hashmap/Funs.lean b/tests/lean/Hashmap/Funs.lean
index 9cbd958c..cb11e5cf 100644
--- a/tests/lean/Hashmap/Funs.lean
+++ b/tests/lean/Hashmap/Funs.lean
@@ -7,12 +7,12 @@ open Primitives
namespace hashmap
/- [hashmap::hash_key]:
- Source: 'src/hashmap.rs', lines 27:0-27:32 -/
+ Source: 'tests/src/hashmap.rs', lines 27:0-27:32 -/
def hash_key (k : Usize) : Result Usize :=
Result.ok k
/- [hashmap::{hashmap::HashMap<T>}::allocate_slots]: loop 0:
- Source: 'src/hashmap.rs', lines 50:4-56:5 -/
+ Source: 'tests/src/hashmap.rs', lines 50:4-56:5 -/
divergent def HashMap.allocate_slots_loop
(T : Type) (slots : alloc.vec.Vec (List T)) (n : Usize) :
Result (alloc.vec.Vec (List T))
@@ -26,7 +26,7 @@ divergent def HashMap.allocate_slots_loop
else Result.ok slots
/- [hashmap::{hashmap::HashMap<T>}::allocate_slots]:
- Source: 'src/hashmap.rs', lines 50:4-50:76 -/
+ Source: 'tests/src/hashmap.rs', lines 50:4-50:76 -/
def HashMap.allocate_slots
(T : Type) (slots : alloc.vec.Vec (List T)) (n : Usize) :
Result (alloc.vec.Vec (List T))
@@ -34,7 +34,7 @@ def HashMap.allocate_slots
HashMap.allocate_slots_loop T slots n
/- [hashmap::{hashmap::HashMap<T>}::new_with_capacity]:
- Source: 'src/hashmap.rs', lines 59:4-63:13 -/
+ Source: 'tests/src/hashmap.rs', lines 59:4-63:13 -/
def HashMap.new_with_capacity
(T : Type) (capacity : Usize) (max_load_dividend : Usize)
(max_load_divisor : Usize) :
@@ -53,12 +53,12 @@ def HashMap.new_with_capacity
}
/- [hashmap::{hashmap::HashMap<T>}::new]:
- Source: 'src/hashmap.rs', lines 75:4-75:24 -/
+ Source: 'tests/src/hashmap.rs', lines 75:4-75:24 -/
def HashMap.new (T : Type) : Result (HashMap T) :=
HashMap.new_with_capacity T 32#usize 4#usize 5#usize
/- [hashmap::{hashmap::HashMap<T>}::clear]: loop 0:
- Source: 'src/hashmap.rs', lines 80:4-88:5 -/
+ Source: 'tests/src/hashmap.rs', lines 80:4-88:5 -/
divergent def HashMap.clear_loop
(T : Type) (slots : alloc.vec.Vec (List T)) (i : Usize) :
Result (alloc.vec.Vec (List T))
@@ -76,19 +76,19 @@ divergent def HashMap.clear_loop
else Result.ok slots
/- [hashmap::{hashmap::HashMap<T>}::clear]:
- Source: 'src/hashmap.rs', lines 80:4-80:27 -/
+ Source: 'tests/src/hashmap.rs', lines 80:4-80:27 -/
def HashMap.clear (T : Type) (self : HashMap T) : Result (HashMap T) :=
do
let hm ← HashMap.clear_loop T self.slots 0#usize
Result.ok { self with num_entries := 0#usize, slots := hm }
/- [hashmap::{hashmap::HashMap<T>}::len]:
- Source: 'src/hashmap.rs', lines 90:4-90:30 -/
+ Source: 'tests/src/hashmap.rs', lines 90:4-90:30 -/
def HashMap.len (T : Type) (self : HashMap T) : Result Usize :=
Result.ok self.num_entries
/- [hashmap::{hashmap::HashMap<T>}::insert_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 97:4-114:5 -/
+ Source: 'tests/src/hashmap.rs', lines 97:4-114:5 -/
divergent def HashMap.insert_in_list_loop
(T : Type) (key : Usize) (value : T) (ls : List T) :
Result (Bool × (List T))
@@ -104,7 +104,7 @@ divergent def HashMap.insert_in_list_loop
| List.Nil => Result.ok (true, List.Cons key value List.Nil)
/- [hashmap::{hashmap::HashMap<T>}::insert_in_list]:
- Source: 'src/hashmap.rs', lines 97:4-97:71 -/
+ Source: 'tests/src/hashmap.rs', lines 97:4-97:71 -/
def HashMap.insert_in_list
(T : Type) (key : Usize) (value : T) (ls : List T) :
Result (Bool × (List T))
@@ -112,7 +112,7 @@ def HashMap.insert_in_list
HashMap.insert_in_list_loop T key value ls
/- [hashmap::{hashmap::HashMap<T>}::insert_no_resize]:
- Source: 'src/hashmap.rs', lines 117:4-117:54 -/
+ Source: 'tests/src/hashmap.rs', lines 117:4-117:54 -/
def HashMap.insert_no_resize
(T : Type) (self : HashMap T) (key : Usize) (value : T) :
Result (HashMap T)
@@ -136,7 +136,7 @@ def HashMap.insert_no_resize
Result.ok { self with slots := v }
/- [hashmap::{hashmap::HashMap<T>}::move_elements_from_list]: loop 0:
- Source: 'src/hashmap.rs', lines 183:4-196:5 -/
+ Source: 'tests/src/hashmap.rs', lines 183:4-196:5 -/
divergent def HashMap.move_elements_from_list_loop
(T : Type) (ntable : HashMap T) (ls : List T) : Result (HashMap T) :=
match ls with
@@ -147,13 +147,13 @@ divergent def HashMap.move_elements_from_list_loop
| List.Nil => Result.ok ntable
/- [hashmap::{hashmap::HashMap<T>}::move_elements_from_list]:
- Source: 'src/hashmap.rs', lines 183:4-183:72 -/
+ Source: 'tests/src/hashmap.rs', lines 183:4-183:72 -/
def HashMap.move_elements_from_list
(T : Type) (ntable : HashMap T) (ls : List T) : Result (HashMap T) :=
HashMap.move_elements_from_list_loop T ntable ls
/- [hashmap::{hashmap::HashMap<T>}::move_elements]: loop 0:
- Source: 'src/hashmap.rs', lines 171:4-180:5 -/
+ Source: 'tests/src/hashmap.rs', lines 171:4-180:5 -/
divergent def HashMap.move_elements_loop
(T : Type) (ntable : HashMap T) (slots : alloc.vec.Vec (List T)) (i : Usize)
:
@@ -174,7 +174,7 @@ divergent def HashMap.move_elements_loop
else Result.ok (ntable, slots)
/- [hashmap::{hashmap::HashMap<T>}::move_elements]:
- Source: 'src/hashmap.rs', lines 171:4-171:95 -/
+ Source: 'tests/src/hashmap.rs', lines 171:4-171:95 -/
def HashMap.move_elements
(T : Type) (ntable : HashMap T) (slots : alloc.vec.Vec (List T)) (i : Usize)
:
@@ -183,7 +183,7 @@ def HashMap.move_elements
HashMap.move_elements_loop T ntable slots i
/- [hashmap::{hashmap::HashMap<T>}::try_resize]:
- Source: 'src/hashmap.rs', lines 140:4-140:28 -/
+ Source: 'tests/src/hashmap.rs', lines 140:4-140:28 -/
def HashMap.try_resize (T : Type) (self : HashMap T) : Result (HashMap T) :=
do
let max_usize ← Scalar.cast .Usize core_u32_max
@@ -207,7 +207,7 @@ def HashMap.try_resize (T : Type) (self : HashMap T) : Result (HashMap T) :=
else Result.ok { self with max_load_factor := (i, i1) }
/- [hashmap::{hashmap::HashMap<T>}::insert]:
- Source: 'src/hashmap.rs', lines 129:4-129:48 -/
+ Source: 'tests/src/hashmap.rs', lines 129:4-129:48 -/
def HashMap.insert
(T : Type) (self : HashMap T) (key : Usize) (value : T) :
Result (HashMap T)
@@ -220,7 +220,7 @@ def HashMap.insert
else Result.ok self1
/- [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 206:4-219:5 -/
+ Source: 'tests/src/hashmap.rs', lines 206:4-219:5 -/
divergent def HashMap.contains_key_in_list_loop
(T : Type) (key : Usize) (ls : List T) : Result Bool :=
match ls with
@@ -231,13 +231,13 @@ divergent def HashMap.contains_key_in_list_loop
| List.Nil => Result.ok false
/- [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]:
- Source: 'src/hashmap.rs', lines 206:4-206:68 -/
+ Source: 'tests/src/hashmap.rs', lines 206:4-206:68 -/
def HashMap.contains_key_in_list
(T : Type) (key : Usize) (ls : List T) : Result Bool :=
HashMap.contains_key_in_list_loop T key ls
/- [hashmap::{hashmap::HashMap<T>}::contains_key]:
- Source: 'src/hashmap.rs', lines 199:4-199:49 -/
+ Source: 'tests/src/hashmap.rs', lines 199:4-199:49 -/
def HashMap.contains_key
(T : Type) (self : HashMap T) (key : Usize) : Result Bool :=
do
@@ -250,7 +250,7 @@ def HashMap.contains_key
HashMap.contains_key_in_list T key l
/- [hashmap::{hashmap::HashMap<T>}::get_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 224:4-237:5 -/
+ Source: 'tests/src/hashmap.rs', lines 224:4-237:5 -/
divergent def HashMap.get_in_list_loop
(T : Type) (key : Usize) (ls : List T) : Result T :=
match ls with
@@ -261,12 +261,12 @@ divergent def HashMap.get_in_list_loop
| List.Nil => Result.fail .panic
/- [hashmap::{hashmap::HashMap<T>}::get_in_list]:
- Source: 'src/hashmap.rs', lines 224:4-224:70 -/
+ Source: 'tests/src/hashmap.rs', lines 224:4-224:70 -/
def HashMap.get_in_list (T : Type) (key : Usize) (ls : List T) : Result T :=
HashMap.get_in_list_loop T key ls
/- [hashmap::{hashmap::HashMap<T>}::get]:
- Source: 'src/hashmap.rs', lines 239:4-239:55 -/
+ Source: 'tests/src/hashmap.rs', lines 239:4-239:55 -/
def HashMap.get (T : Type) (self : HashMap T) (key : Usize) : Result T :=
do
let hash ← hash_key key
@@ -278,7 +278,7 @@ def HashMap.get (T : Type) (self : HashMap T) (key : Usize) : Result T :=
HashMap.get_in_list T key l
/- [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 245:4-254:5 -/
+ Source: 'tests/src/hashmap.rs', lines 245:4-254:5 -/
divergent def HashMap.get_mut_in_list_loop
(T : Type) (ls : List T) (key : Usize) :
Result (T × (T → Result (List T)))
@@ -301,7 +301,7 @@ divergent def HashMap.get_mut_in_list_loop
| List.Nil => Result.fail .panic
/- [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]:
- Source: 'src/hashmap.rs', lines 245:4-245:86 -/
+ Source: 'tests/src/hashmap.rs', lines 245:4-245:86 -/
def HashMap.get_mut_in_list
(T : Type) (ls : List T) (key : Usize) :
Result (T × (T → Result (List T)))
@@ -309,7 +309,7 @@ def HashMap.get_mut_in_list
HashMap.get_mut_in_list_loop T ls key
/- [hashmap::{hashmap::HashMap<T>}::get_mut]:
- Source: 'src/hashmap.rs', lines 257:4-257:67 -/
+ Source: 'tests/src/hashmap.rs', lines 257:4-257:67 -/
def HashMap.get_mut
(T : Type) (self : HashMap T) (key : Usize) :
Result (T × (T → Result (HashMap T)))
@@ -331,7 +331,7 @@ def HashMap.get_mut
Result.ok (t, back)
/- [hashmap::{hashmap::HashMap<T>}::remove_from_list]: loop 0:
- Source: 'src/hashmap.rs', lines 265:4-291:5 -/
+ Source: 'tests/src/hashmap.rs', lines 265:4-291:5 -/
divergent def HashMap.remove_from_list_loop
(T : Type) (key : Usize) (ls : List T) : Result ((Option T) × (List T)) :=
match ls with
@@ -350,13 +350,13 @@ divergent def HashMap.remove_from_list_loop
| List.Nil => Result.ok (none, List.Nil)
/- [hashmap::{hashmap::HashMap<T>}::remove_from_list]:
- Source: 'src/hashmap.rs', lines 265:4-265:69 -/
+ Source: 'tests/src/hashmap.rs', lines 265:4-265:69 -/
def HashMap.remove_from_list
(T : Type) (key : Usize) (ls : List T) : Result ((Option T) × (List T)) :=
HashMap.remove_from_list_loop T key ls
/- [hashmap::{hashmap::HashMap<T>}::remove]:
- Source: 'src/hashmap.rs', lines 294:4-294:52 -/
+ Source: 'tests/src/hashmap.rs', lines 294:4-294:52 -/
def HashMap.remove
(T : Type) (self : HashMap T) (key : Usize) :
Result ((Option T) × (HashMap T))
@@ -381,7 +381,7 @@ def HashMap.remove
Result.ok (some x1, { self with num_entries := i1, slots := v })
/- [hashmap::test1]:
- Source: 'src/hashmap.rs', lines 315:0-315:10 -/
+ Source: 'tests/src/hashmap.rs', lines 315:0-315:10 -/
def test1 : Result Unit :=
do
let hm ← HashMap.new U64
diff --git a/tests/lean/Hashmap/Types.lean b/tests/lean/Hashmap/Types.lean
index fa454123..c99ba8d0 100644
--- a/tests/lean/Hashmap/Types.lean
+++ b/tests/lean/Hashmap/Types.lean
@@ -6,13 +6,13 @@ open Primitives
namespace hashmap
/- [hashmap::List]
- Source: 'src/hashmap.rs', lines 19:0-19:16 -/
+ Source: 'tests/src/hashmap.rs', lines 19:0-19:16 -/
inductive List (T : Type) :=
| Cons : Usize → T → List T → List T
| Nil : List T
/- [hashmap::HashMap]
- Source: 'src/hashmap.rs', lines 35:0-35:21 -/
+ Source: 'tests/src/hashmap.rs', lines 35:0-35:21 -/
structure HashMap (T : Type) where
num_entries : Usize
max_load_factor : (Usize × Usize)
diff --git a/tests/lean/HashmapMain/Funs.lean b/tests/lean/HashmapMain/Funs.lean
index e985ec6a..e27305b1 100644
--- a/tests/lean/HashmapMain/Funs.lean
+++ b/tests/lean/HashmapMain/Funs.lean
@@ -8,12 +8,12 @@ open Primitives
namespace hashmap_main
/- [hashmap_main::hashmap::hash_key]:
- Source: 'src/hashmap.rs', lines 27:0-27:32 -/
+ Source: 'tests/src/hashmap.rs', lines 27:0-27:32 -/
def hashmap.hash_key (k : Usize) : Result Usize :=
Result.ok k
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::allocate_slots]: loop 0:
- Source: 'src/hashmap.rs', lines 50:4-56:5 -/
+ Source: 'tests/src/hashmap.rs', lines 50:4-56:5 -/
divergent def hashmap.HashMap.allocate_slots_loop
(T : Type) (slots : alloc.vec.Vec (hashmap.List T)) (n : Usize) :
Result (alloc.vec.Vec (hashmap.List T))
@@ -27,7 +27,7 @@ divergent def hashmap.HashMap.allocate_slots_loop
else Result.ok slots
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::allocate_slots]:
- Source: 'src/hashmap.rs', lines 50:4-50:76 -/
+ Source: 'tests/src/hashmap.rs', lines 50:4-50:76 -/
def hashmap.HashMap.allocate_slots
(T : Type) (slots : alloc.vec.Vec (hashmap.List T)) (n : Usize) :
Result (alloc.vec.Vec (hashmap.List T))
@@ -35,7 +35,7 @@ def hashmap.HashMap.allocate_slots
hashmap.HashMap.allocate_slots_loop T slots n
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::new_with_capacity]:
- Source: 'src/hashmap.rs', lines 59:4-63:13 -/
+ Source: 'tests/src/hashmap.rs', lines 59:4-63:13 -/
def hashmap.HashMap.new_with_capacity
(T : Type) (capacity : Usize) (max_load_dividend : Usize)
(max_load_divisor : Usize) :
@@ -56,12 +56,12 @@ def hashmap.HashMap.new_with_capacity
}
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::new]:
- Source: 'src/hashmap.rs', lines 75:4-75:24 -/
+ Source: 'tests/src/hashmap.rs', lines 75:4-75:24 -/
def hashmap.HashMap.new (T : Type) : Result (hashmap.HashMap T) :=
hashmap.HashMap.new_with_capacity T 32#usize 4#usize 5#usize
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::clear]: loop 0:
- Source: 'src/hashmap.rs', lines 80:4-88:5 -/
+ Source: 'tests/src/hashmap.rs', lines 80:4-88:5 -/
divergent def hashmap.HashMap.clear_loop
(T : Type) (slots : alloc.vec.Vec (hashmap.List T)) (i : Usize) :
Result (alloc.vec.Vec (hashmap.List T))
@@ -79,7 +79,7 @@ divergent def hashmap.HashMap.clear_loop
else Result.ok slots
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::clear]:
- Source: 'src/hashmap.rs', lines 80:4-80:27 -/
+ Source: 'tests/src/hashmap.rs', lines 80:4-80:27 -/
def hashmap.HashMap.clear
(T : Type) (self : hashmap.HashMap T) : Result (hashmap.HashMap T) :=
do
@@ -87,12 +87,12 @@ def hashmap.HashMap.clear
Result.ok { self with num_entries := 0#usize, slots := hm }
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::len]:
- Source: 'src/hashmap.rs', lines 90:4-90:30 -/
+ Source: 'tests/src/hashmap.rs', lines 90:4-90:30 -/
def hashmap.HashMap.len (T : Type) (self : hashmap.HashMap T) : Result Usize :=
Result.ok self.num_entries
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 97:4-114:5 -/
+ Source: 'tests/src/hashmap.rs', lines 97:4-114:5 -/
divergent def hashmap.HashMap.insert_in_list_loop
(T : Type) (key : Usize) (value : T) (ls : hashmap.List T) :
Result (Bool × (hashmap.List T))
@@ -109,7 +109,7 @@ divergent def hashmap.HashMap.insert_in_list_loop
Result.ok (true, hashmap.List.Cons key value hashmap.List.Nil)
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_in_list]:
- Source: 'src/hashmap.rs', lines 97:4-97:71 -/
+ Source: 'tests/src/hashmap.rs', lines 97:4-97:71 -/
def hashmap.HashMap.insert_in_list
(T : Type) (key : Usize) (value : T) (ls : hashmap.List T) :
Result (Bool × (hashmap.List T))
@@ -117,7 +117,7 @@ def hashmap.HashMap.insert_in_list
hashmap.HashMap.insert_in_list_loop T key value ls
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_no_resize]:
- Source: 'src/hashmap.rs', lines 117:4-117:54 -/
+ Source: 'tests/src/hashmap.rs', lines 117:4-117:54 -/
def hashmap.HashMap.insert_no_resize
(T : Type) (self : hashmap.HashMap T) (key : Usize) (value : T) :
Result (hashmap.HashMap T)
@@ -142,7 +142,7 @@ def hashmap.HashMap.insert_no_resize
Result.ok { self with slots := v }
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements_from_list]: loop 0:
- Source: 'src/hashmap.rs', lines 183:4-196:5 -/
+ Source: 'tests/src/hashmap.rs', lines 183:4-196:5 -/
divergent def hashmap.HashMap.move_elements_from_list_loop
(T : Type) (ntable : hashmap.HashMap T) (ls : hashmap.List T) :
Result (hashmap.HashMap T)
@@ -155,7 +155,7 @@ divergent def hashmap.HashMap.move_elements_from_list_loop
| hashmap.List.Nil => Result.ok ntable
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements_from_list]:
- Source: 'src/hashmap.rs', lines 183:4-183:72 -/
+ Source: 'tests/src/hashmap.rs', lines 183:4-183:72 -/
def hashmap.HashMap.move_elements_from_list
(T : Type) (ntable : hashmap.HashMap T) (ls : hashmap.List T) :
Result (hashmap.HashMap T)
@@ -163,7 +163,7 @@ def hashmap.HashMap.move_elements_from_list
hashmap.HashMap.move_elements_from_list_loop T ntable ls
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements]: loop 0:
- Source: 'src/hashmap.rs', lines 171:4-180:5 -/
+ Source: 'tests/src/hashmap.rs', lines 171:4-180:5 -/
divergent def hashmap.HashMap.move_elements_loop
(T : Type) (ntable : hashmap.HashMap T)
(slots : alloc.vec.Vec (hashmap.List T)) (i : Usize) :
@@ -184,7 +184,7 @@ divergent def hashmap.HashMap.move_elements_loop
else Result.ok (ntable, slots)
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements]:
- Source: 'src/hashmap.rs', lines 171:4-171:95 -/
+ Source: 'tests/src/hashmap.rs', lines 171:4-171:95 -/
def hashmap.HashMap.move_elements
(T : Type) (ntable : hashmap.HashMap T)
(slots : alloc.vec.Vec (hashmap.List T)) (i : Usize) :
@@ -193,7 +193,7 @@ def hashmap.HashMap.move_elements
hashmap.HashMap.move_elements_loop T ntable slots i
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::try_resize]:
- Source: 'src/hashmap.rs', lines 140:4-140:28 -/
+ Source: 'tests/src/hashmap.rs', lines 140:4-140:28 -/
def hashmap.HashMap.try_resize
(T : Type) (self : hashmap.HashMap T) : Result (hashmap.HashMap T) :=
do
@@ -218,7 +218,7 @@ def hashmap.HashMap.try_resize
else Result.ok { self with max_load_factor := (i, i1) }
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert]:
- Source: 'src/hashmap.rs', lines 129:4-129:48 -/
+ Source: 'tests/src/hashmap.rs', lines 129:4-129:48 -/
def hashmap.HashMap.insert
(T : Type) (self : hashmap.HashMap T) (key : Usize) (value : T) :
Result (hashmap.HashMap T)
@@ -231,7 +231,7 @@ def hashmap.HashMap.insert
else Result.ok self1
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 206:4-219:5 -/
+ Source: 'tests/src/hashmap.rs', lines 206:4-219:5 -/
divergent def hashmap.HashMap.contains_key_in_list_loop
(T : Type) (key : Usize) (ls : hashmap.List T) : Result Bool :=
match ls with
@@ -242,13 +242,13 @@ divergent def hashmap.HashMap.contains_key_in_list_loop
| hashmap.List.Nil => Result.ok false
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key_in_list]:
- Source: 'src/hashmap.rs', lines 206:4-206:68 -/
+ Source: 'tests/src/hashmap.rs', lines 206:4-206:68 -/
def hashmap.HashMap.contains_key_in_list
(T : Type) (key : Usize) (ls : hashmap.List T) : Result Bool :=
hashmap.HashMap.contains_key_in_list_loop T key ls
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key]:
- Source: 'src/hashmap.rs', lines 199:4-199:49 -/
+ Source: 'tests/src/hashmap.rs', lines 199:4-199:49 -/
def hashmap.HashMap.contains_key
(T : Type) (self : hashmap.HashMap T) (key : Usize) : Result Bool :=
do
@@ -262,7 +262,7 @@ def hashmap.HashMap.contains_key
hashmap.HashMap.contains_key_in_list T key l
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 224:4-237:5 -/
+ Source: 'tests/src/hashmap.rs', lines 224:4-237:5 -/
divergent def hashmap.HashMap.get_in_list_loop
(T : Type) (key : Usize) (ls : hashmap.List T) : Result T :=
match ls with
@@ -273,13 +273,13 @@ divergent def hashmap.HashMap.get_in_list_loop
| hashmap.List.Nil => Result.fail .panic
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_in_list]:
- Source: 'src/hashmap.rs', lines 224:4-224:70 -/
+ Source: 'tests/src/hashmap.rs', lines 224:4-224:70 -/
def hashmap.HashMap.get_in_list
(T : Type) (key : Usize) (ls : hashmap.List T) : Result T :=
hashmap.HashMap.get_in_list_loop T key ls
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get]:
- Source: 'src/hashmap.rs', lines 239:4-239:55 -/
+ Source: 'tests/src/hashmap.rs', lines 239:4-239:55 -/
def hashmap.HashMap.get
(T : Type) (self : hashmap.HashMap T) (key : Usize) : Result T :=
do
@@ -293,7 +293,7 @@ def hashmap.HashMap.get
hashmap.HashMap.get_in_list T key l
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut_in_list]: loop 0:
- Source: 'src/hashmap.rs', lines 245:4-254:5 -/
+ Source: 'tests/src/hashmap.rs', lines 245:4-254:5 -/
divergent def hashmap.HashMap.get_mut_in_list_loop
(T : Type) (ls : hashmap.List T) (key : Usize) :
Result (T × (T → Result (hashmap.List T)))
@@ -316,7 +316,7 @@ divergent def hashmap.HashMap.get_mut_in_list_loop
| hashmap.List.Nil => Result.fail .panic
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut_in_list]:
- Source: 'src/hashmap.rs', lines 245:4-245:86 -/
+ Source: 'tests/src/hashmap.rs', lines 245:4-245:86 -/
def hashmap.HashMap.get_mut_in_list
(T : Type) (ls : hashmap.List T) (key : Usize) :
Result (T × (T → Result (hashmap.List T)))
@@ -324,7 +324,7 @@ def hashmap.HashMap.get_mut_in_list
hashmap.HashMap.get_mut_in_list_loop T ls key
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut]:
- Source: 'src/hashmap.rs', lines 257:4-257:67 -/
+ Source: 'tests/src/hashmap.rs', lines 257:4-257:67 -/
def hashmap.HashMap.get_mut
(T : Type) (self : hashmap.HashMap T) (key : Usize) :
Result (T × (T → Result (hashmap.HashMap T)))
@@ -347,7 +347,7 @@ def hashmap.HashMap.get_mut
Result.ok (t, back)
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove_from_list]: loop 0:
- Source: 'src/hashmap.rs', lines 265:4-291:5 -/
+ Source: 'tests/src/hashmap.rs', lines 265:4-291:5 -/
divergent def hashmap.HashMap.remove_from_list_loop
(T : Type) (key : Usize) (ls : hashmap.List T) :
Result ((Option T) × (hashmap.List T))
@@ -369,7 +369,7 @@ divergent def hashmap.HashMap.remove_from_list_loop
| hashmap.List.Nil => Result.ok (none, hashmap.List.Nil)
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove_from_list]:
- Source: 'src/hashmap.rs', lines 265:4-265:69 -/
+ Source: 'tests/src/hashmap.rs', lines 265:4-265:69 -/
def hashmap.HashMap.remove_from_list
(T : Type) (key : Usize) (ls : hashmap.List T) :
Result ((Option T) × (hashmap.List T))
@@ -377,7 +377,7 @@ def hashmap.HashMap.remove_from_list
hashmap.HashMap.remove_from_list_loop T key ls
/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove]:
- Source: 'src/hashmap.rs', lines 294:4-294:52 -/
+ Source: 'tests/src/hashmap.rs', lines 294:4-294:52 -/
def hashmap.HashMap.remove
(T : Type) (self : hashmap.HashMap T) (key : Usize) :
Result ((Option T) × (hashmap.HashMap T))
@@ -403,7 +403,7 @@ def hashmap.HashMap.remove
Result.ok (some x1, { self with num_entries := i1, slots := v })
/- [hashmap_main::hashmap::test1]:
- Source: 'src/hashmap.rs', lines 315:0-315:10 -/
+ Source: 'tests/src/hashmap.rs', lines 315:0-315:10 -/
def hashmap.test1 : Result Unit :=
do
let hm ← hashmap.HashMap.new U64
@@ -447,7 +447,7 @@ def hashmap.test1 : Result Unit :=
else Result.ok ()
/- [hashmap_main::insert_on_disk]:
- Source: 'src/hashmap_main.rs', lines 7:0-7:43 -/
+ Source: 'tests/src/hashmap_main.rs', lines 7:0-7:43 -/
def insert_on_disk
(key : Usize) (value : U64) (st : State) : Result (State × Unit) :=
do
@@ -456,7 +456,7 @@ def insert_on_disk
hashmap_utils.serialize hm1 st1
/- [hashmap_main::main]:
- Source: 'src/hashmap_main.rs', lines 16:0-16:13 -/
+ Source: 'tests/src/hashmap_main.rs', lines 16:0-16:13 -/
def main : Result Unit :=
Result.ok ()
diff --git a/tests/lean/HashmapMain/FunsExternal_Template.lean b/tests/lean/HashmapMain/FunsExternal_Template.lean
index c09edbd2..c9c41608 100644
--- a/tests/lean/HashmapMain/FunsExternal_Template.lean
+++ b/tests/lean/HashmapMain/FunsExternal_Template.lean
@@ -7,12 +7,12 @@ open Primitives
open hashmap_main
/- [hashmap_main::hashmap_utils::deserialize]:
- Source: 'src/hashmap_utils.rs', lines 10:0-10:43 -/
+ Source: 'tests/src/hashmap_utils.rs', lines 10:0-10:43 -/
axiom hashmap_utils.deserialize
: State → Result (State × (hashmap.HashMap U64))
/- [hashmap_main::hashmap_utils::serialize]:
- Source: 'src/hashmap_utils.rs', lines 5:0-5:42 -/
+ Source: 'tests/src/hashmap_utils.rs', lines 5:0-5:42 -/
axiom hashmap_utils.serialize
: hashmap.HashMap U64 → State → Result (State × Unit)
diff --git a/tests/lean/HashmapMain/Types.lean b/tests/lean/HashmapMain/Types.lean
index ae9ac999..076fb9ea 100644
--- a/tests/lean/HashmapMain/Types.lean
+++ b/tests/lean/HashmapMain/Types.lean
@@ -7,13 +7,13 @@ open Primitives
namespace hashmap_main
/- [hashmap_main::hashmap::List]
- Source: 'src/hashmap.rs', lines 19:0-19:16 -/
+ Source: 'tests/src/hashmap.rs', lines 19:0-19:16 -/
inductive hashmap.List (T : Type) :=
| Cons : Usize → T → hashmap.List T → hashmap.List T
| Nil : hashmap.List T
/- [hashmap_main::hashmap::HashMap]
- Source: 'src/hashmap.rs', lines 35:0-35:21 -/
+ Source: 'tests/src/hashmap.rs', lines 35:0-35:21 -/
structure hashmap.HashMap (T : Type) where
num_entries : Usize
max_load_factor : (Usize × Usize)
diff --git a/tests/lean/Loops.lean b/tests/lean/Loops.lean
index eeba1add..d5bda6ab 100644
--- a/tests/lean/Loops.lean
+++ b/tests/lean/Loops.lean
@@ -6,7 +6,7 @@ open Primitives
namespace loops
/- [loops::sum]: loop 0:
- Source: 'src/loops.rs', lines 4:0-14:1 -/
+ Source: 'tests/src/loops.rs', lines 4:0-14:1 -/
divergent def sum_loop (max : U32) (i : U32) (s : U32) : Result U32 :=
if i < max
then do
@@ -16,12 +16,12 @@ divergent def sum_loop (max : U32) (i : U32) (s : U32) : Result U32 :=
else s * 2#u32
/- [loops::sum]:
- Source: 'src/loops.rs', lines 4:0-4:27 -/
+ Source: 'tests/src/loops.rs', lines 4:0-4:27 -/
def sum (max : U32) : Result U32 :=
sum_loop max 0#u32 0#u32
/- [loops::sum_with_mut_borrows]: loop 0:
- Source: 'src/loops.rs', lines 19:0-31:1 -/
+ Source: 'tests/src/loops.rs', lines 19:0-31:1 -/
divergent def sum_with_mut_borrows_loop
(max : U32) (i : U32) (s : U32) : Result U32 :=
if i < max
@@ -33,12 +33,12 @@ divergent def sum_with_mut_borrows_loop
else s * 2#u32
/- [loops::sum_with_mut_borrows]:
- Source: 'src/loops.rs', lines 19:0-19:44 -/
+ Source: 'tests/src/loops.rs', lines 19:0-19:44 -/
def sum_with_mut_borrows (max : U32) : Result U32 :=
sum_with_mut_borrows_loop max 0#u32 0#u32
/- [loops::sum_with_shared_borrows]: loop 0:
- Source: 'src/loops.rs', lines 34:0-48:1 -/
+ Source: 'tests/src/loops.rs', lines 34:0-48:1 -/
divergent def sum_with_shared_borrows_loop
(max : U32) (i : U32) (s : U32) : Result U32 :=
if i < max
@@ -50,12 +50,12 @@ divergent def sum_with_shared_borrows_loop
else s * 2#u32
/- [loops::sum_with_shared_borrows]:
- Source: 'src/loops.rs', lines 34:0-34:47 -/
+ Source: 'tests/src/loops.rs', lines 34:0-34:47 -/
def sum_with_shared_borrows (max : U32) : Result U32 :=
sum_with_shared_borrows_loop max 0#u32 0#u32
/- [loops::sum_array]: loop 0:
- Source: 'src/loops.rs', lines 50:0-58:1 -/
+ Source: 'tests/src/loops.rs', lines 50:0-58:1 -/
divergent def sum_array_loop
(N : Usize) (a : Array U32 N) (i : Usize) (s : U32) : Result U32 :=
if i < N
@@ -68,12 +68,12 @@ divergent def sum_array_loop
else Result.ok s
/- [loops::sum_array]:
- Source: 'src/loops.rs', lines 50:0-50:52 -/
+ Source: 'tests/src/loops.rs', lines 50:0-50:52 -/
def sum_array (N : Usize) (a : Array U32 N) : Result U32 :=
sum_array_loop N a 0#usize 0#u32
/- [loops::clear]: loop 0:
- Source: 'src/loops.rs', lines 62:0-68:1 -/
+ Source: 'tests/src/loops.rs', lines 62:0-68:1 -/
divergent def clear_loop
(v : alloc.vec.Vec U32) (i : Usize) : Result (alloc.vec.Vec U32) :=
let i1 := alloc.vec.Vec.len U32 v
@@ -89,18 +89,18 @@ divergent def clear_loop
else Result.ok v
/- [loops::clear]:
- Source: 'src/loops.rs', lines 62:0-62:30 -/
+ Source: 'tests/src/loops.rs', lines 62:0-62:30 -/
def clear (v : alloc.vec.Vec U32) : Result (alloc.vec.Vec U32) :=
clear_loop v 0#usize
/- [loops::List]
- Source: 'src/loops.rs', lines 70:0-70:16 -/
+ Source: 'tests/src/loops.rs', lines 70:0-70:16 -/
inductive List (T : Type) :=
| Cons : T → List T → List T
| Nil : List T
/- [loops::list_mem]: loop 0:
- Source: 'src/loops.rs', lines 76:0-85:1 -/
+ Source: 'tests/src/loops.rs', lines 76:0-85:1 -/
divergent def list_mem_loop (x : U32) (ls : List U32) : Result Bool :=
match ls with
| List.Cons y tl => if y = x
@@ -109,12 +109,12 @@ divergent def list_mem_loop (x : U32) (ls : List U32) : Result Bool :=
| List.Nil => Result.ok false
/- [loops::list_mem]:
- Source: 'src/loops.rs', lines 76:0-76:52 -/
+ Source: 'tests/src/loops.rs', lines 76:0-76:52 -/
def list_mem (x : U32) (ls : List U32) : Result Bool :=
list_mem_loop x ls
/- [loops::list_nth_mut_loop]: loop 0:
- Source: 'src/loops.rs', lines 88:0-98:1 -/
+ Source: 'tests/src/loops.rs', lines 88:0-98:1 -/
divergent def list_nth_mut_loop_loop
(T : Type) (ls : List T) (i : U32) : Result (T × (T → Result (List T))) :=
match ls with
@@ -135,13 +135,13 @@ divergent def list_nth_mut_loop_loop
| List.Nil => Result.fail .panic
/- [loops::list_nth_mut_loop]:
- Source: 'src/loops.rs', lines 88:0-88:71 -/
+ Source: 'tests/src/loops.rs', lines 88:0-88:71 -/
def list_nth_mut_loop
(T : Type) (ls : List T) (i : U32) : Result (T × (T → Result (List T))) :=
list_nth_mut_loop_loop T ls i
/- [loops::list_nth_shared_loop]: loop 0:
- Source: 'src/loops.rs', lines 101:0-111:1 -/
+ Source: 'tests/src/loops.rs', lines 101:0-111:1 -/
divergent def list_nth_shared_loop_loop
(T : Type) (ls : List T) (i : U32) : Result T :=
match ls with
@@ -154,12 +154,12 @@ divergent def list_nth_shared_loop_loop
| List.Nil => Result.fail .panic
/- [loops::list_nth_shared_loop]:
- Source: 'src/loops.rs', lines 101:0-101:66 -/
+ Source: 'tests/src/loops.rs', lines 101:0-101:66 -/
def list_nth_shared_loop (T : Type) (ls : List T) (i : U32) : Result T :=
list_nth_shared_loop_loop T ls i
/- [loops::get_elem_mut]: loop 0:
- Source: 'src/loops.rs', lines 113:0-127:1 -/
+ Source: 'tests/src/loops.rs', lines 113:0-127:1 -/
divergent def get_elem_mut_loop
(x : Usize) (ls : List Usize) :
Result (Usize × (Usize → Result (List Usize)))
@@ -181,7 +181,7 @@ divergent def get_elem_mut_loop
| List.Nil => Result.fail .panic
/- [loops::get_elem_mut]:
- Source: 'src/loops.rs', lines 113:0-113:73 -/
+ Source: 'tests/src/loops.rs', lines 113:0-113:73 -/
def get_elem_mut
(slots : alloc.vec.Vec (List Usize)) (x : Usize) :
Result (Usize × (Usize → Result (alloc.vec.Vec (List Usize))))
@@ -197,7 +197,7 @@ def get_elem_mut
Result.ok (i, back1)
/- [loops::get_elem_shared]: loop 0:
- Source: 'src/loops.rs', lines 129:0-143:1 -/
+ Source: 'tests/src/loops.rs', lines 129:0-143:1 -/
divergent def get_elem_shared_loop
(x : Usize) (ls : List Usize) : Result Usize :=
match ls with
@@ -207,7 +207,7 @@ divergent def get_elem_shared_loop
| List.Nil => Result.fail .panic
/- [loops::get_elem_shared]:
- Source: 'src/loops.rs', lines 129:0-129:68 -/
+ Source: 'tests/src/loops.rs', lines 129:0-129:68 -/
def get_elem_shared
(slots : alloc.vec.Vec (List Usize)) (x : Usize) : Result Usize :=
do
@@ -217,7 +217,7 @@ def get_elem_shared
get_elem_shared_loop x ls
/- [loops::id_mut]:
- Source: 'src/loops.rs', lines 145:0-145:50 -/
+ Source: 'tests/src/loops.rs', lines 145:0-145:50 -/
def id_mut
(T : Type) (ls : List T) :
Result ((List T) × (List T → Result (List T)))
@@ -225,12 +225,12 @@ def id_mut
Result.ok (ls, Result.ok)
/- [loops::id_shared]:
- Source: 'src/loops.rs', lines 149:0-149:45 -/
+ Source: 'tests/src/loops.rs', lines 149:0-149:45 -/
def id_shared (T : Type) (ls : List T) : Result (List T) :=
Result.ok ls
/- [loops::list_nth_mut_loop_with_id]: loop 0:
- Source: 'src/loops.rs', lines 154:0-165:1 -/
+ Source: 'tests/src/loops.rs', lines 154:0-165:1 -/
divergent def list_nth_mut_loop_with_id_loop
(T : Type) (i : U32) (ls : List T) : Result (T × (T → Result (List T))) :=
match ls with
@@ -251,7 +251,7 @@ divergent def list_nth_mut_loop_with_id_loop
| List.Nil => Result.fail .panic
/- [loops::list_nth_mut_loop_with_id]:
- Source: 'src/loops.rs', lines 154:0-154:75 -/
+ Source: 'tests/src/loops.rs', lines 154:0-154:75 -/
def list_nth_mut_loop_with_id
(T : Type) (ls : List T) (i : U32) : Result (T × (T → Result (List T))) :=
do
@@ -263,7 +263,7 @@ def list_nth_mut_loop_with_id
Result.ok (t, back1)
/- [loops::list_nth_shared_loop_with_id]: loop 0:
- Source: 'src/loops.rs', lines 168:0-179:1 -/
+ Source: 'tests/src/loops.rs', lines 168:0-179:1 -/
divergent def list_nth_shared_loop_with_id_loop
(T : Type) (i : U32) (ls : List T) : Result T :=
match ls with
@@ -276,7 +276,7 @@ divergent def list_nth_shared_loop_with_id_loop
| List.Nil => Result.fail .panic
/- [loops::list_nth_shared_loop_with_id]:
- Source: 'src/loops.rs', lines 168:0-168:70 -/
+ Source: 'tests/src/loops.rs', lines 168:0-168:70 -/
def list_nth_shared_loop_with_id
(T : Type) (ls : List T) (i : U32) : Result T :=
do
@@ -284,7 +284,7 @@ def list_nth_shared_loop_with_id
list_nth_shared_loop_with_id_loop T i ls1
/- [loops::list_nth_mut_loop_pair]: loop 0:
- Source: 'src/loops.rs', lines 184:0-205:1 -/
+ Source: 'tests/src/loops.rs', lines 184:0-205:1 -/
divergent def list_nth_mut_loop_pair_loop
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) :
Result ((T × T) × (T → Result (List T)) × (T → Result (List T)))
@@ -315,7 +315,7 @@ divergent def list_nth_mut_loop_pair_loop
| List.Nil => Result.fail .panic
/- [loops::list_nth_mut_loop_pair]:
- Source: 'src/loops.rs', lines 184:0-188:27 -/
+ Source: 'tests/src/loops.rs', lines 184:0-188:27 -/
def list_nth_mut_loop_pair
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) :
Result ((T × T) × (T → Result (List T)) × (T → Result (List T)))
@@ -323,7 +323,7 @@ def list_nth_mut_loop_pair
list_nth_mut_loop_pair_loop T ls0 ls1 i
/- [loops::list_nth_shared_loop_pair]: loop 0:
- Source: 'src/loops.rs', lines 208:0-229:1 -/
+ Source: 'tests/src/loops.rs', lines 208:0-229:1 -/
divergent def list_nth_shared_loop_pair_loop
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
match ls0 with
@@ -339,13 +339,13 @@ divergent def list_nth_shared_loop_pair_loop
| List.Nil => Result.fail .panic
/- [loops::list_nth_shared_loop_pair]:
- Source: 'src/loops.rs', lines 208:0-212:19 -/
+ Source: 'tests/src/loops.rs', lines 208:0-212:19 -/
def list_nth_shared_loop_pair
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
list_nth_shared_loop_pair_loop T ls0 ls1 i
/- [loops::list_nth_mut_loop_pair_merge]: loop 0:
- Source: 'src/loops.rs', lines 233:0-248:1 -/
+ Source: 'tests/src/loops.rs', lines 233:0-248:1 -/
divergent def list_nth_mut_loop_pair_merge_loop
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) :
Result ((T × T) × ((T × T) → Result ((List T) × (List T))))
@@ -375,7 +375,7 @@ divergent def list_nth_mut_loop_pair_merge_loop
| List.Nil => Result.fail .panic
/- [loops::list_nth_mut_loop_pair_merge]:
- Source: 'src/loops.rs', lines 233:0-237:27 -/
+ Source: 'tests/src/loops.rs', lines 233:0-237:27 -/
def list_nth_mut_loop_pair_merge
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) :
Result ((T × T) × ((T × T) → Result ((List T) × (List T))))
@@ -383,7 +383,7 @@ def list_nth_mut_loop_pair_merge
list_nth_mut_loop_pair_merge_loop T ls0 ls1 i
/- [loops::list_nth_shared_loop_pair_merge]: loop 0:
- Source: 'src/loops.rs', lines 251:0-266:1 -/
+ Source: 'tests/src/loops.rs', lines 251:0-266:1 -/
divergent def list_nth_shared_loop_pair_merge_loop
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
match ls0 with
@@ -400,13 +400,13 @@ divergent def list_nth_shared_loop_pair_merge_loop
| List.Nil => Result.fail .panic
/- [loops::list_nth_shared_loop_pair_merge]:
- Source: 'src/loops.rs', lines 251:0-255:19 -/
+ Source: 'tests/src/loops.rs', lines 251:0-255:19 -/
def list_nth_shared_loop_pair_merge
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) : Result (T × T) :=
list_nth_shared_loop_pair_merge_loop T ls0 ls1 i
/- [loops::list_nth_mut_shared_loop_pair]: loop 0:
- Source: 'src/loops.rs', lines 269:0-284:1 -/
+ Source: 'tests/src/loops.rs', lines 269:0-284:1 -/
divergent def list_nth_mut_shared_loop_pair_loop
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) :
Result ((T × T) × (T → Result (List T)))
@@ -432,7 +432,7 @@ divergent def list_nth_mut_shared_loop_pair_loop
| List.Nil => Result.fail .panic
/- [loops::list_nth_mut_shared_loop_pair]:
- Source: 'src/loops.rs', lines 269:0-273:23 -/
+ Source: 'tests/src/loops.rs', lines 269:0-273:23 -/
def list_nth_mut_shared_loop_pair
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) :
Result ((T × T) × (T → Result (List T)))
@@ -440,7 +440,7 @@ def list_nth_mut_shared_loop_pair
list_nth_mut_shared_loop_pair_loop T ls0 ls1 i
/- [loops::list_nth_mut_shared_loop_pair_merge]: loop 0:
- Source: 'src/loops.rs', lines 288:0-303:1 -/
+ Source: 'tests/src/loops.rs', lines 288:0-303:1 -/
divergent def list_nth_mut_shared_loop_pair_merge_loop
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) :
Result ((T × T) × (T → Result (List T)))
@@ -466,7 +466,7 @@ divergent def list_nth_mut_shared_loop_pair_merge_loop
| List.Nil => Result.fail .panic
/- [loops::list_nth_mut_shared_loop_pair_merge]:
- Source: 'src/loops.rs', lines 288:0-292:23 -/
+ Source: 'tests/src/loops.rs', lines 288:0-292:23 -/
def list_nth_mut_shared_loop_pair_merge
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) :
Result ((T × T) × (T → Result (List T)))
@@ -474,7 +474,7 @@ def list_nth_mut_shared_loop_pair_merge
list_nth_mut_shared_loop_pair_merge_loop T ls0 ls1 i
/- [loops::list_nth_shared_mut_loop_pair]: loop 0:
- Source: 'src/loops.rs', lines 307:0-322:1 -/
+ Source: 'tests/src/loops.rs', lines 307:0-322:1 -/
divergent def list_nth_shared_mut_loop_pair_loop
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) :
Result ((T × T) × (T → Result (List T)))
@@ -500,7 +500,7 @@ divergent def list_nth_shared_mut_loop_pair_loop
| List.Nil => Result.fail .panic
/- [loops::list_nth_shared_mut_loop_pair]:
- Source: 'src/loops.rs', lines 307:0-311:23 -/
+ Source: 'tests/src/loops.rs', lines 307:0-311:23 -/
def list_nth_shared_mut_loop_pair
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) :
Result ((T × T) × (T → Result (List T)))
@@ -508,7 +508,7 @@ def list_nth_shared_mut_loop_pair
list_nth_shared_mut_loop_pair_loop T ls0 ls1 i
/- [loops::list_nth_shared_mut_loop_pair_merge]: loop 0:
- Source: 'src/loops.rs', lines 326:0-341:1 -/
+ Source: 'tests/src/loops.rs', lines 326:0-341:1 -/
divergent def list_nth_shared_mut_loop_pair_merge_loop
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) :
Result ((T × T) × (T → Result (List T)))
@@ -534,7 +534,7 @@ divergent def list_nth_shared_mut_loop_pair_merge_loop
| List.Nil => Result.fail .panic
/- [loops::list_nth_shared_mut_loop_pair_merge]:
- Source: 'src/loops.rs', lines 326:0-330:23 -/
+ Source: 'tests/src/loops.rs', lines 326:0-330:23 -/
def list_nth_shared_mut_loop_pair_merge
(T : Type) (ls0 : List T) (ls1 : List T) (i : U32) :
Result ((T × T) × (T → Result (List T)))
@@ -542,7 +542,7 @@ def list_nth_shared_mut_loop_pair_merge
list_nth_shared_mut_loop_pair_merge_loop T ls0 ls1 i
/- [loops::ignore_input_mut_borrow]: loop 0:
- Source: 'src/loops.rs', lines 345:0-349:1 -/
+ Source: 'tests/src/loops.rs', lines 345:0-349:1 -/
divergent def ignore_input_mut_borrow_loop (i : U32) : Result Unit :=
if i > 0#u32
then do
@@ -551,14 +551,14 @@ divergent def ignore_input_mut_borrow_loop (i : U32) : Result Unit :=
else Result.ok ()
/- [loops::ignore_input_mut_borrow]:
- Source: 'src/loops.rs', lines 345:0-345:56 -/
+ Source: 'tests/src/loops.rs', lines 345:0-345:56 -/
def ignore_input_mut_borrow (_a : U32) (i : U32) : Result U32 :=
do
let _ ← ignore_input_mut_borrow_loop i
Result.ok _a
/- [loops::incr_ignore_input_mut_borrow]: loop 0:
- Source: 'src/loops.rs', lines 353:0-358:1 -/
+ Source: 'tests/src/loops.rs', lines 353:0-358:1 -/
divergent def incr_ignore_input_mut_borrow_loop (i : U32) : Result Unit :=
if i > 0#u32
then do
@@ -567,7 +567,7 @@ divergent def incr_ignore_input_mut_borrow_loop (i : U32) : Result Unit :=
else Result.ok ()
/- [loops::incr_ignore_input_mut_borrow]:
- Source: 'src/loops.rs', lines 353:0-353:60 -/
+ Source: 'tests/src/loops.rs', lines 353:0-353:60 -/
def incr_ignore_input_mut_borrow (a : U32) (i : U32) : Result U32 :=
do
let a1 ← a + 1#u32
@@ -575,7 +575,7 @@ def incr_ignore_input_mut_borrow (a : U32) (i : U32) : Result U32 :=
Result.ok a1
/- [loops::ignore_input_shared_borrow]: loop 0:
- Source: 'src/loops.rs', lines 362:0-366:1 -/
+ Source: 'tests/src/loops.rs', lines 362:0-366:1 -/
divergent def ignore_input_shared_borrow_loop (i : U32) : Result Unit :=
if i > 0#u32
then do
@@ -584,7 +584,7 @@ divergent def ignore_input_shared_borrow_loop (i : U32) : Result Unit :=
else Result.ok ()
/- [loops::ignore_input_shared_borrow]:
- Source: 'src/loops.rs', lines 362:0-362:59 -/
+ Source: 'tests/src/loops.rs', lines 362:0-362:59 -/
def ignore_input_shared_borrow (_a : U32) (i : U32) : Result U32 :=
do
let _ ← ignore_input_shared_borrow_loop i
diff --git a/tests/lean/NoNestedBorrows.lean b/tests/lean/NoNestedBorrows.lean
index 66ec917b..5ae22055 100644
--- a/tests/lean/NoNestedBorrows.lean
+++ b/tests/lean/NoNestedBorrows.lean
@@ -6,60 +6,60 @@ open Primitives
namespace no_nested_borrows
/- [no_nested_borrows::Pair]
- Source: 'src/no_nested_borrows.rs', lines 4:0-4:23 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 4:0-4:23 -/
structure Pair (T1 T2 : Type) where
x : T1
y : T2
/- [no_nested_borrows::List]
- Source: 'src/no_nested_borrows.rs', lines 9:0-9:16 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 9:0-9:16 -/
inductive List (T : Type) :=
| Cons : T → List T → List T
| Nil : List T
/- [no_nested_borrows::One]
- Source: 'src/no_nested_borrows.rs', lines 20:0-20:16 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 20:0-20:16 -/
inductive One (T1 : Type) :=
| One : T1 → One T1
/- [no_nested_borrows::EmptyEnum]
- Source: 'src/no_nested_borrows.rs', lines 26:0-26:18 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 26:0-26:18 -/
inductive EmptyEnum :=
| Empty : EmptyEnum
/- [no_nested_borrows::Enum]
- Source: 'src/no_nested_borrows.rs', lines 32:0-32:13 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 32:0-32:13 -/
inductive Enum :=
| Variant1 : Enum
| Variant2 : Enum
/- [no_nested_borrows::EmptyStruct]
- Source: 'src/no_nested_borrows.rs', lines 39:0-39:22 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 39:0-39:22 -/
@[reducible] def EmptyStruct := Unit
/- [no_nested_borrows::Sum]
- Source: 'src/no_nested_borrows.rs', lines 41:0-41:20 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 41:0-41:20 -/
inductive Sum (T1 T2 : Type) :=
| Left : T1 → Sum T1 T2
| Right : T2 → Sum T1 T2
/- [no_nested_borrows::cast_u32_to_i32]:
- Source: 'src/no_nested_borrows.rs', lines 46:0-46:37 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 46:0-46:37 -/
def cast_u32_to_i32 (x : U32) : Result I32 :=
Scalar.cast .I32 x
/- [no_nested_borrows::cast_bool_to_i32]:
- Source: 'src/no_nested_borrows.rs', lines 50:0-50:39 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 50:0-50:39 -/
def cast_bool_to_i32 (x : Bool) : Result I32 :=
Scalar.cast_bool .I32 x
/- [no_nested_borrows::cast_bool_to_bool]:
- Source: 'src/no_nested_borrows.rs', lines 55:0-55:41 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 55:0-55:41 -/
def cast_bool_to_bool (x : Bool) : Result Bool :=
Result.ok x
/- [no_nested_borrows::test2]:
- Source: 'src/no_nested_borrows.rs', lines 60:0-60:14 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 60:0-60:14 -/
def test2 : Result Unit :=
do
let _ ← 23#u32 + 44#u32
@@ -69,14 +69,14 @@ def test2 : Result Unit :=
#assert (test2 == Result.ok ())
/- [no_nested_borrows::get_max]:
- Source: 'src/no_nested_borrows.rs', lines 72:0-72:37 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 72:0-72:37 -/
def get_max (x : U32) (y : U32) : Result U32 :=
if x >= y
then Result.ok x
else Result.ok y
/- [no_nested_borrows::test3]:
- Source: 'src/no_nested_borrows.rs', lines 80:0-80:14 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 80:0-80:14 -/
def test3 : Result Unit :=
do
let x ← get_max 4#u32 3#u32
@@ -90,7 +90,7 @@ def test3 : Result Unit :=
#assert (test3 == Result.ok ())
/- [no_nested_borrows::test_neg1]:
- Source: 'src/no_nested_borrows.rs', lines 87:0-87:18 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 87:0-87:18 -/
def test_neg1 : Result Unit :=
do
let y ← -. 3#i32
@@ -102,7 +102,7 @@ def test_neg1 : Result Unit :=
#assert (test_neg1 == Result.ok ())
/- [no_nested_borrows::refs_test1]:
- Source: 'src/no_nested_borrows.rs', lines 94:0-94:19 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 94:0-94:19 -/
def refs_test1 : Result Unit :=
if ¬ (1#i32 = 1#i32)
then Result.fail .panic
@@ -112,7 +112,7 @@ def refs_test1 : Result Unit :=
#assert (refs_test1 == Result.ok ())
/- [no_nested_borrows::refs_test2]:
- Source: 'src/no_nested_borrows.rs', lines 105:0-105:19 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 105:0-105:19 -/
def refs_test2 : Result Unit :=
if ¬ (2#i32 = 2#i32)
then Result.fail .panic
@@ -130,7 +130,7 @@ def refs_test2 : Result Unit :=
#assert (refs_test2 == Result.ok ())
/- [no_nested_borrows::test_list1]:
- Source: 'src/no_nested_borrows.rs', lines 121:0-121:19 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 121:0-121:19 -/
def test_list1 : Result Unit :=
Result.ok ()
@@ -138,7 +138,7 @@ def test_list1 : Result Unit :=
#assert (test_list1 == Result.ok ())
/- [no_nested_borrows::test_box1]:
- Source: 'src/no_nested_borrows.rs', lines 126:0-126:18 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 126:0-126:18 -/
def test_box1 : Result Unit :=
do
let (_, deref_mut_back) ← alloc.boxed.Box.deref_mut I32 0#i32
@@ -152,26 +152,26 @@ def test_box1 : Result Unit :=
#assert (test_box1 == Result.ok ())
/- [no_nested_borrows::copy_int]:
- Source: 'src/no_nested_borrows.rs', lines 136:0-136:30 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 136:0-136:30 -/
def copy_int (x : I32) : Result I32 :=
Result.ok x
/- [no_nested_borrows::test_unreachable]:
- Source: 'src/no_nested_borrows.rs', lines 142:0-142:32 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 142:0-142:32 -/
def test_unreachable (b : Bool) : Result Unit :=
if b
then Result.fail .panic
else Result.ok ()
/- [no_nested_borrows::test_panic]:
- Source: 'src/no_nested_borrows.rs', lines 150:0-150:26 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 150:0-150:26 -/
def test_panic (b : Bool) : Result Unit :=
if b
then Result.fail .panic
else Result.ok ()
/- [no_nested_borrows::test_copy_int]:
- Source: 'src/no_nested_borrows.rs', lines 157:0-157:22 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 157:0-157:22 -/
def test_copy_int : Result Unit :=
do
let y ← copy_int 0#i32
@@ -183,14 +183,14 @@ def test_copy_int : Result Unit :=
#assert (test_copy_int == Result.ok ())
/- [no_nested_borrows::is_cons]:
- Source: 'src/no_nested_borrows.rs', lines 164:0-164:38 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 164:0-164:38 -/
def is_cons (T : Type) (l : List T) : Result Bool :=
match l with
| List.Cons _ _ => Result.ok true
| List.Nil => Result.ok false
/- [no_nested_borrows::test_is_cons]:
- Source: 'src/no_nested_borrows.rs', lines 171:0-171:21 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 171:0-171:21 -/
def test_is_cons : Result Unit :=
do
let b ← is_cons I32 (List.Cons 0#i32 List.Nil)
@@ -202,14 +202,14 @@ def test_is_cons : Result Unit :=
#assert (test_is_cons == Result.ok ())
/- [no_nested_borrows::split_list]:
- Source: 'src/no_nested_borrows.rs', lines 177:0-177:48 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 177:0-177:48 -/
def split_list (T : Type) (l : List T) : Result (T × (List T)) :=
match l with
| List.Cons hd tl => Result.ok (hd, tl)
| List.Nil => Result.fail .panic
/- [no_nested_borrows::test_split_list]:
- Source: 'src/no_nested_borrows.rs', lines 185:0-185:24 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 185:0-185:24 -/
def test_split_list : Result Unit :=
do
let p ← split_list I32 (List.Cons 0#i32 List.Nil)
@@ -222,7 +222,7 @@ def test_split_list : Result Unit :=
#assert (test_split_list == Result.ok ())
/- [no_nested_borrows::choose]:
- Source: 'src/no_nested_borrows.rs', lines 192:0-192:70 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 192:0-192:70 -/
def choose
(T : Type) (b : Bool) (x : T) (y : T) :
Result (T × (T → Result (T × T)))
@@ -234,7 +234,7 @@ def choose
Result.ok (y, back)
/- [no_nested_borrows::choose_test]:
- Source: 'src/no_nested_borrows.rs', lines 200:0-200:20 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 200:0-200:20 -/
def choose_test : Result Unit :=
do
let (z, choose_back) ← choose I32 true 0#i32 0#i32
@@ -254,20 +254,20 @@ def choose_test : Result Unit :=
#assert (choose_test == Result.ok ())
/- [no_nested_borrows::test_char]:
- Source: 'src/no_nested_borrows.rs', lines 212:0-212:26 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 212:0-212:26 -/
def test_char : Result Char :=
Result.ok 'a'
mutual
/- [no_nested_borrows::Tree]
- Source: 'src/no_nested_borrows.rs', lines 217:0-217:16 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 217:0-217:16 -/
inductive Tree (T : Type) :=
| Leaf : T → Tree T
| Node : T → NodeElem T → Tree T → Tree T
/- [no_nested_borrows::NodeElem]
- Source: 'src/no_nested_borrows.rs', lines 222:0-222:20 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 222:0-222:20 -/
inductive NodeElem (T : Type) :=
| Cons : Tree T → NodeElem T → NodeElem T
| Nil : NodeElem T
@@ -275,7 +275,7 @@ inductive NodeElem (T : Type) :=
end
/- [no_nested_borrows::list_length]:
- Source: 'src/no_nested_borrows.rs', lines 257:0-257:48 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 257:0-257:48 -/
divergent def list_length (T : Type) (l : List T) : Result U32 :=
match l with
| List.Cons _ l1 => do
@@ -284,7 +284,7 @@ divergent def list_length (T : Type) (l : List T) : Result U32 :=
| List.Nil => Result.ok 0#u32
/- [no_nested_borrows::list_nth_shared]:
- Source: 'src/no_nested_borrows.rs', lines 265:0-265:62 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 265:0-265:62 -/
divergent def list_nth_shared (T : Type) (l : List T) (i : U32) : Result T :=
match l with
| List.Cons x tl =>
@@ -296,7 +296,7 @@ divergent def list_nth_shared (T : Type) (l : List T) (i : U32) : Result T :=
| List.Nil => Result.fail .panic
/- [no_nested_borrows::list_nth_mut]:
- Source: 'src/no_nested_borrows.rs', lines 281:0-281:67 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 281:0-281:67 -/
divergent def list_nth_mut
(T : Type) (l : List T) (i : U32) : Result (T × (T → Result (List T))) :=
match l with
@@ -318,7 +318,7 @@ divergent def list_nth_mut
| List.Nil => Result.fail .panic
/- [no_nested_borrows::list_rev_aux]:
- Source: 'src/no_nested_borrows.rs', lines 297:0-297:63 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 297:0-297:63 -/
divergent def list_rev_aux
(T : Type) (li : List T) (lo : List T) : Result (List T) :=
match li with
@@ -326,13 +326,13 @@ divergent def list_rev_aux
| List.Nil => Result.ok lo
/- [no_nested_borrows::list_rev]:
- Source: 'src/no_nested_borrows.rs', lines 311:0-311:42 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 311:0-311:42 -/
def list_rev (T : Type) (l : List T) : Result (List T) :=
let (li, _) := core.mem.replace (List T) l List.Nil
list_rev_aux T li List.Nil
/- [no_nested_borrows::test_list_functions]:
- Source: 'src/no_nested_borrows.rs', lines 316:0-316:28 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 316:0-316:28 -/
def test_list_functions : Result Unit :=
do
let l := List.Cons 2#i32 List.Nil
@@ -379,7 +379,7 @@ def test_list_functions : Result Unit :=
#assert (test_list_functions == Result.ok ())
/- [no_nested_borrows::id_mut_pair1]:
- Source: 'src/no_nested_borrows.rs', lines 332:0-332:89 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 332:0-332:89 -/
def id_mut_pair1
(T1 T2 : Type) (x : T1) (y : T2) :
Result ((T1 × T2) × ((T1 × T2) → Result (T1 × T2)))
@@ -387,7 +387,7 @@ def id_mut_pair1
Result.ok ((x, y), Result.ok)
/- [no_nested_borrows::id_mut_pair2]:
- Source: 'src/no_nested_borrows.rs', lines 336:0-336:88 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 336:0-336:88 -/
def id_mut_pair2
(T1 T2 : Type) (p : (T1 × T2)) :
Result ((T1 × T2) × ((T1 × T2) → Result (T1 × T2)))
@@ -396,7 +396,7 @@ def id_mut_pair2
Result.ok ((t, t1), Result.ok)
/- [no_nested_borrows::id_mut_pair3]:
- Source: 'src/no_nested_borrows.rs', lines 340:0-340:93 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 340:0-340:93 -/
def id_mut_pair3
(T1 T2 : Type) (x : T1) (y : T2) :
Result ((T1 × T2) × (T1 → Result T1) × (T2 → Result T2))
@@ -404,7 +404,7 @@ def id_mut_pair3
Result.ok ((x, y), Result.ok, Result.ok)
/- [no_nested_borrows::id_mut_pair4]:
- Source: 'src/no_nested_borrows.rs', lines 344:0-344:92 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 344:0-344:92 -/
def id_mut_pair4
(T1 T2 : Type) (p : (T1 × T2)) :
Result ((T1 × T2) × (T1 → Result T1) × (T2 → Result T2))
@@ -413,37 +413,37 @@ def id_mut_pair4
Result.ok ((t, t1), Result.ok, Result.ok)
/- [no_nested_borrows::StructWithTuple]
- Source: 'src/no_nested_borrows.rs', lines 351:0-351:34 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 351:0-351:34 -/
structure StructWithTuple (T1 T2 : Type) where
p : (T1 × T2)
/- [no_nested_borrows::new_tuple1]:
- Source: 'src/no_nested_borrows.rs', lines 355:0-355:48 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 355:0-355:48 -/
def new_tuple1 : Result (StructWithTuple U32 U32) :=
Result.ok { p := (1#u32, 2#u32) }
/- [no_nested_borrows::new_tuple2]:
- Source: 'src/no_nested_borrows.rs', lines 359:0-359:48 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 359:0-359:48 -/
def new_tuple2 : Result (StructWithTuple I16 I16) :=
Result.ok { p := (1#i16, 2#i16) }
/- [no_nested_borrows::new_tuple3]:
- Source: 'src/no_nested_borrows.rs', lines 363:0-363:48 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 363:0-363:48 -/
def new_tuple3 : Result (StructWithTuple U64 I64) :=
Result.ok { p := (1#u64, 2#i64) }
/- [no_nested_borrows::StructWithPair]
- Source: 'src/no_nested_borrows.rs', lines 368:0-368:33 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 368:0-368:33 -/
structure StructWithPair (T1 T2 : Type) where
p : Pair T1 T2
/- [no_nested_borrows::new_pair1]:
- Source: 'src/no_nested_borrows.rs', lines 372:0-372:46 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 372:0-372:46 -/
def new_pair1 : Result (StructWithPair U32 U32) :=
Result.ok { p := { x := 1#u32, y := 2#u32 } }
/- [no_nested_borrows::test_constants]:
- Source: 'src/no_nested_borrows.rs', lines 380:0-380:23 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 380:0-380:23 -/
def test_constants : Result Unit :=
do
let swt ← new_tuple1
@@ -473,7 +473,7 @@ def test_constants : Result Unit :=
#assert (test_constants == Result.ok ())
/- [no_nested_borrows::test_weird_borrows1]:
- Source: 'src/no_nested_borrows.rs', lines 389:0-389:28 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 389:0-389:28 -/
def test_weird_borrows1 : Result Unit :=
Result.ok ()
@@ -481,7 +481,7 @@ def test_weird_borrows1 : Result Unit :=
#assert (test_weird_borrows1 == Result.ok ())
/- [no_nested_borrows::test_mem_replace]:
- Source: 'src/no_nested_borrows.rs', lines 399:0-399:37 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 399:0-399:37 -/
def test_mem_replace (px : U32) : Result U32 :=
let (y, _) := core.mem.replace U32 px 1#u32
if ¬ (y = 0#u32)
@@ -489,71 +489,71 @@ def test_mem_replace (px : U32) : Result U32 :=
else Result.ok 2#u32
/- [no_nested_borrows::test_shared_borrow_bool1]:
- Source: 'src/no_nested_borrows.rs', lines 406:0-406:47 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 406:0-406:47 -/
def test_shared_borrow_bool1 (b : Bool) : Result U32 :=
if b
then Result.ok 0#u32
else Result.ok 1#u32
/- [no_nested_borrows::test_shared_borrow_bool2]:
- Source: 'src/no_nested_borrows.rs', lines 419:0-419:40 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 419:0-419:40 -/
def test_shared_borrow_bool2 : Result U32 :=
Result.ok 0#u32
/- [no_nested_borrows::test_shared_borrow_enum1]:
- Source: 'src/no_nested_borrows.rs', lines 434:0-434:52 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 434:0-434:52 -/
def test_shared_borrow_enum1 (l : List U32) : Result U32 :=
match l with
| List.Cons _ _ => Result.ok 1#u32
| List.Nil => Result.ok 0#u32
/- [no_nested_borrows::test_shared_borrow_enum2]:
- Source: 'src/no_nested_borrows.rs', lines 446:0-446:40 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 446:0-446:40 -/
def test_shared_borrow_enum2 : Result U32 :=
Result.ok 0#u32
/- [no_nested_borrows::incr]:
- Source: 'src/no_nested_borrows.rs', lines 457:0-457:24 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 457:0-457:24 -/
def incr (x : U32) : Result U32 :=
x + 1#u32
/- [no_nested_borrows::call_incr]:
- Source: 'src/no_nested_borrows.rs', lines 461:0-461:35 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 461:0-461:35 -/
def call_incr (x : U32) : Result U32 :=
incr x
/- [no_nested_borrows::read_then_incr]:
- Source: 'src/no_nested_borrows.rs', lines 466:0-466:41 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 466:0-466:41 -/
def read_then_incr (x : U32) : Result (U32 × U32) :=
do
let x1 ← x + 1#u32
Result.ok (x, x1)
/- [no_nested_borrows::Tuple]
- Source: 'src/no_nested_borrows.rs', lines 472:0-472:24 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 472:0-472:24 -/
def Tuple (T1 T2 : Type) := T1 × T2
/- [no_nested_borrows::use_tuple_struct]:
- Source: 'src/no_nested_borrows.rs', lines 474:0-474:48 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 474:0-474:48 -/
def use_tuple_struct (x : Tuple U32 U32) : Result (Tuple U32 U32) :=
Result.ok (1#u32, x.#1)
/- [no_nested_borrows::create_tuple_struct]:
- Source: 'src/no_nested_borrows.rs', lines 478:0-478:61 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 478:0-478:61 -/
def create_tuple_struct (x : U32) (y : U64) : Result (Tuple U32 U64) :=
Result.ok (x, y)
/- [no_nested_borrows::IdType]
- Source: 'src/no_nested_borrows.rs', lines 483:0-483:20 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 483:0-483:20 -/
@[reducible] def IdType (T : Type) := T
/- [no_nested_borrows::use_id_type]:
- Source: 'src/no_nested_borrows.rs', lines 485:0-485:40 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 485:0-485:40 -/
def use_id_type (T : Type) (x : IdType T) : Result T :=
Result.ok x
/- [no_nested_borrows::create_id_type]:
- Source: 'src/no_nested_borrows.rs', lines 489:0-489:43 -/
+ Source: 'tests/src/no_nested_borrows.rs', lines 489:0-489:43 -/
def create_id_type (T : Type) (x : T) : Result (IdType T) :=
Result.ok x
diff --git a/tests/lean/Paper.lean b/tests/lean/Paper.lean
index 32203eca..bede3dd9 100644
--- a/tests/lean/Paper.lean
+++ b/tests/lean/Paper.lean
@@ -6,12 +6,12 @@ open Primitives
namespace paper
/- [paper::ref_incr]:
- Source: 'src/paper.rs', lines 4:0-4:28 -/
+ Source: 'tests/src/paper.rs', lines 4:0-4:28 -/
def ref_incr (x : I32) : Result I32 :=
x + 1#i32
/- [paper::test_incr]:
- Source: 'src/paper.rs', lines 8:0-8:18 -/
+ Source: 'tests/src/paper.rs', lines 8:0-8:18 -/
def test_incr : Result Unit :=
do
let x ← ref_incr 0#i32
@@ -23,7 +23,7 @@ def test_incr : Result Unit :=
#assert (test_incr == Result.ok ())
/- [paper::choose]:
- Source: 'src/paper.rs', lines 15:0-15:70 -/
+ Source: 'tests/src/paper.rs', lines 15:0-15:70 -/
def choose
(T : Type) (b : Bool) (x : T) (y : T) :
Result (T × (T → Result (T × T)))
@@ -35,7 +35,7 @@ def choose
Result.ok (y, back)
/- [paper::test_choose]:
- Source: 'src/paper.rs', lines 23:0-23:20 -/
+ Source: 'tests/src/paper.rs', lines 23:0-23:20 -/
def test_choose : Result Unit :=
do
let (z, choose_back) ← choose I32 true 0#i32 0#i32
@@ -55,13 +55,13 @@ def test_choose : Result Unit :=
#assert (test_choose == Result.ok ())
/- [paper::List]
- Source: 'src/paper.rs', lines 35:0-35:16 -/
+ Source: 'tests/src/paper.rs', lines 35:0-35:16 -/
inductive List (T : Type) :=
| Cons : T → List T → List T
| Nil : List T
/- [paper::list_nth_mut]:
- Source: 'src/paper.rs', lines 42:0-42:67 -/
+ Source: 'tests/src/paper.rs', lines 42:0-42:67 -/
divergent def list_nth_mut
(T : Type) (l : List T) (i : U32) : Result (T × (T → Result (List T))) :=
match l with
@@ -83,7 +83,7 @@ divergent def list_nth_mut
| List.Nil => Result.fail .panic
/- [paper::sum]:
- Source: 'src/paper.rs', lines 57:0-57:32 -/
+ Source: 'tests/src/paper.rs', lines 57:0-57:32 -/
divergent def sum (l : List I32) : Result I32 :=
match l with
| List.Cons x tl => do
@@ -92,7 +92,7 @@ divergent def sum (l : List I32) : Result I32 :=
| List.Nil => Result.ok 0#i32
/- [paper::test_nth]:
- Source: 'src/paper.rs', lines 68:0-68:17 -/
+ Source: 'tests/src/paper.rs', lines 68:0-68:17 -/
def test_nth : Result Unit :=
do
let l := List.Cons 3#i32 List.Nil
@@ -109,7 +109,7 @@ def test_nth : Result Unit :=
#assert (test_nth == Result.ok ())
/- [paper::call_choose]:
- Source: 'src/paper.rs', lines 76:0-76:44 -/
+ Source: 'tests/src/paper.rs', lines 76:0-76:44 -/
def call_choose (p : (U32 × U32)) : Result U32 :=
do
let (px, py) := p
diff --git a/tests/lean/PoloniusList.lean b/tests/lean/PoloniusList.lean
index 09f41056..d1ed10d2 100644
--- a/tests/lean/PoloniusList.lean
+++ b/tests/lean/PoloniusList.lean
@@ -6,13 +6,13 @@ open Primitives
namespace polonius_list
/- [polonius_list::List]
- Source: 'src/polonius_list.rs', lines 3:0-3:16 -/
+ Source: 'tests/src/polonius_list.rs', lines 3:0-3:16 -/
inductive List (T : Type) :=
| Cons : T → List T → List T
| Nil : List T
/- [polonius_list::get_list_at_x]:
- Source: 'src/polonius_list.rs', lines 13:0-13:76 -/
+ Source: 'tests/src/polonius_list.rs', lines 13:0-13:76 -/
divergent def get_list_at_x
(ls : List U32) (x : U32) :
Result ((List U32) × (List U32 → Result (List U32)))
diff --git a/tests/lean/Traits.lean b/tests/lean/Traits.lean
index 3746d494..32f84676 100644
--- a/tests/lean/Traits.lean
+++ b/tests/lean/Traits.lean
@@ -6,29 +6,29 @@ open Primitives
namespace traits
/- Trait declaration: [traits::BoolTrait]
- Source: 'src/traits.rs', lines 1:0-1:19 -/
+ Source: 'tests/src/traits.rs', lines 1:0-1:19 -/
structure BoolTrait (Self : Type) where
get_bool : Self → Result Bool
/- [traits::{(traits::BoolTrait for bool)}::get_bool]:
- Source: 'src/traits.rs', lines 12:4-12:30 -/
+ Source: 'tests/src/traits.rs', lines 12:4-12:30 -/
def BoolTraitBool.get_bool (self : Bool) : Result Bool :=
Result.ok self
/- Trait implementation: [traits::{(traits::BoolTrait for bool)}]
- Source: 'src/traits.rs', lines 11:0-11:23 -/
+ Source: 'tests/src/traits.rs', lines 11:0-11:23 -/
def BoolTraitBool : BoolTrait Bool := {
get_bool := BoolTraitBool.get_bool
}
/- [traits::BoolTrait::ret_true]:
- Source: 'src/traits.rs', lines 6:4-6:30 -/
+ Source: 'tests/src/traits.rs', lines 6:4-6:30 -/
def BoolTrait.ret_true
{Self : Type} (self_clause : BoolTrait Self) (self : Self) : Result Bool :=
Result.ok true
/- [traits::test_bool_trait_bool]:
- Source: 'src/traits.rs', lines 17:0-17:44 -/
+ Source: 'tests/src/traits.rs', lines 17:0-17:44 -/
def test_bool_trait_bool (x : Bool) : Result Bool :=
do
let b ← BoolTraitBool.get_bool x
@@ -37,20 +37,20 @@ def test_bool_trait_bool (x : Bool) : Result Bool :=
else Result.ok false
/- [traits::{(traits::BoolTrait for core::option::Option<T>)#1}::get_bool]:
- Source: 'src/traits.rs', lines 23:4-23:30 -/
+ Source: 'tests/src/traits.rs', lines 23:4-23:30 -/
def BoolTraitOption.get_bool (T : Type) (self : Option T) : Result Bool :=
match self with
| none => Result.ok false
| some _ => Result.ok true
/- Trait implementation: [traits::{(traits::BoolTrait for core::option::Option<T>)#1}]
- Source: 'src/traits.rs', lines 22:0-22:31 -/
+ Source: 'tests/src/traits.rs', lines 22:0-22:31 -/
def BoolTraitOption (T : Type) : BoolTrait (Option T) := {
get_bool := BoolTraitOption.get_bool T
}
/- [traits::test_bool_trait_option]:
- Source: 'src/traits.rs', lines 31:0-31:54 -/
+ Source: 'tests/src/traits.rs', lines 31:0-31:54 -/
def test_bool_trait_option (T : Type) (x : Option T) : Result Bool :=
do
let b ← BoolTraitOption.get_bool T x
@@ -59,29 +59,29 @@ def test_bool_trait_option (T : Type) (x : Option T) : Result Bool :=
else Result.ok false
/- [traits::test_bool_trait]:
- Source: 'src/traits.rs', lines 35:0-35:50 -/
+ Source: 'tests/src/traits.rs', lines 35:0-35:50 -/
def test_bool_trait
(T : Type) (BoolTraitInst : BoolTrait T) (x : T) : Result Bool :=
BoolTraitInst.get_bool x
/- Trait declaration: [traits::ToU64]
- Source: 'src/traits.rs', lines 39:0-39:15 -/
+ Source: 'tests/src/traits.rs', lines 39:0-39:15 -/
structure ToU64 (Self : Type) where
to_u64 : Self → Result U64
/- [traits::{(traits::ToU64 for u64)#2}::to_u64]:
- Source: 'src/traits.rs', lines 44:4-44:26 -/
+ Source: 'tests/src/traits.rs', lines 44:4-44:26 -/
def ToU64U64.to_u64 (self : U64) : Result U64 :=
Result.ok self
/- Trait implementation: [traits::{(traits::ToU64 for u64)#2}]
- Source: 'src/traits.rs', lines 43:0-43:18 -/
+ Source: 'tests/src/traits.rs', lines 43:0-43:18 -/
def ToU64U64 : ToU64 U64 := {
to_u64 := ToU64U64.to_u64
}
/- [traits::{(traits::ToU64 for (A, A))#3}::to_u64]:
- Source: 'src/traits.rs', lines 50:4-50:26 -/
+ Source: 'tests/src/traits.rs', lines 50:4-50:26 -/
def ToU64Pair.to_u64
(A : Type) (ToU64Inst : ToU64 A) (self : (A × A)) : Result U64 :=
do
@@ -91,78 +91,78 @@ def ToU64Pair.to_u64
i + i1
/- Trait implementation: [traits::{(traits::ToU64 for (A, A))#3}]
- Source: 'src/traits.rs', lines 49:0-49:31 -/
+ Source: 'tests/src/traits.rs', lines 49:0-49:31 -/
def ToU64Pair (A : Type) (ToU64Inst : ToU64 A) : ToU64 (A × A) := {
to_u64 := ToU64Pair.to_u64 A ToU64Inst
}
/- [traits::f]:
- Source: 'src/traits.rs', lines 55:0-55:36 -/
+ Source: 'tests/src/traits.rs', lines 55:0-55:36 -/
def f (T : Type) (ToU64Inst : ToU64 T) (x : (T × T)) : Result U64 :=
ToU64Pair.to_u64 T ToU64Inst x
/- [traits::g]:
- Source: 'src/traits.rs', lines 59:0-61:18 -/
+ Source: 'tests/src/traits.rs', lines 59:0-61:18 -/
def g
(T : Type) (ToU64PairInst : ToU64 (T × T)) (x : (T × T)) : Result U64 :=
ToU64PairInst.to_u64 x
/- [traits::h0]:
- Source: 'src/traits.rs', lines 66:0-66:24 -/
+ Source: 'tests/src/traits.rs', lines 66:0-66:24 -/
def h0 (x : U64) : Result U64 :=
ToU64U64.to_u64 x
/- [traits::Wrapper]
- Source: 'src/traits.rs', lines 70:0-70:21 -/
+ Source: 'tests/src/traits.rs', lines 70:0-70:21 -/
structure Wrapper (T : Type) where
x : T
/- [traits::{(traits::ToU64 for traits::Wrapper<T>)#4}::to_u64]:
- Source: 'src/traits.rs', lines 75:4-75:26 -/
+ Source: 'tests/src/traits.rs', lines 75:4-75:26 -/
def ToU64traitsWrapper.to_u64
(T : Type) (ToU64Inst : ToU64 T) (self : Wrapper T) : Result U64 :=
ToU64Inst.to_u64 self.x
/- Trait implementation: [traits::{(traits::ToU64 for traits::Wrapper<T>)#4}]
- Source: 'src/traits.rs', lines 74:0-74:35 -/
+ Source: 'tests/src/traits.rs', lines 74:0-74:35 -/
def ToU64traitsWrapper (T : Type) (ToU64Inst : ToU64 T) : ToU64 (Wrapper T)
:= {
to_u64 := ToU64traitsWrapper.to_u64 T ToU64Inst
}
/- [traits::h1]:
- Source: 'src/traits.rs', lines 80:0-80:33 -/
+ Source: 'tests/src/traits.rs', lines 80:0-80:33 -/
def h1 (x : Wrapper U64) : Result U64 :=
ToU64traitsWrapper.to_u64 U64 ToU64U64 x
/- [traits::h2]:
- Source: 'src/traits.rs', lines 84:0-84:41 -/
+ Source: 'tests/src/traits.rs', lines 84:0-84:41 -/
def h2 (T : Type) (ToU64Inst : ToU64 T) (x : Wrapper T) : Result U64 :=
ToU64traitsWrapper.to_u64 T ToU64Inst x
/- Trait declaration: [traits::ToType]
- Source: 'src/traits.rs', lines 88:0-88:19 -/
+ Source: 'tests/src/traits.rs', lines 88:0-88:19 -/
structure ToType (Self T : Type) where
to_type : Self → Result T
/- [traits::{(traits::ToType<bool> for u64)#5}::to_type]:
- Source: 'src/traits.rs', lines 93:4-93:28 -/
+ Source: 'tests/src/traits.rs', lines 93:4-93:28 -/
def ToTypeU64Bool.to_type (self : U64) : Result Bool :=
Result.ok (self > 0#u64)
/- Trait implementation: [traits::{(traits::ToType<bool> for u64)#5}]
- Source: 'src/traits.rs', lines 92:0-92:25 -/
+ Source: 'tests/src/traits.rs', lines 92:0-92:25 -/
def ToTypeU64Bool : ToType U64 Bool := {
to_type := ToTypeU64Bool.to_type
}
/- Trait declaration: [traits::OfType]
- Source: 'src/traits.rs', lines 98:0-98:16 -/
+ Source: 'tests/src/traits.rs', lines 98:0-98:16 -/
structure OfType (Self : Type) where
of_type : forall (T : Type) (ToTypeInst : ToType T Self), T → Result Self
/- [traits::h3]:
- Source: 'src/traits.rs', lines 104:0-104:50 -/
+ Source: 'tests/src/traits.rs', lines 104:0-104:50 -/
def h3
(T1 T2 : Type) (OfTypeInst : OfType T1) (ToTypeInst : ToType T2 T1)
(y : T2) :
@@ -171,13 +171,13 @@ def h3
OfTypeInst.of_type T2 ToTypeInst y
/- Trait declaration: [traits::OfTypeBis]
- Source: 'src/traits.rs', lines 109:0-109:36 -/
+ Source: 'tests/src/traits.rs', lines 109:0-109:36 -/
structure OfTypeBis (Self T : Type) where
ToTypeInst : ToType T Self
of_type : T → Result Self
/- [traits::h4]:
- Source: 'src/traits.rs', lines 118:0-118:57 -/
+ Source: 'tests/src/traits.rs', lines 118:0-118:57 -/
def h4
(T1 T2 : Type) (OfTypeBisInst : OfTypeBis T1 T2) (ToTypeInst : ToType T2 T1)
(y : T2) :
@@ -186,33 +186,33 @@ def h4
OfTypeBisInst.of_type y
/- [traits::TestType]
- Source: 'src/traits.rs', lines 122:0-122:22 -/
+ Source: 'tests/src/traits.rs', lines 122:0-122:22 -/
@[reducible] def TestType (T : Type) := T
/- [traits::{traits::TestType<T>#6}::test::TestType1]
- Source: 'src/traits.rs', lines 127:8-127:24 -/
+ Source: 'tests/src/traits.rs', lines 127:8-127:24 -/
@[reducible] def TestType.test.TestType1 := U64
/- Trait declaration: [traits::{traits::TestType<T>#6}::test::TestTrait]
- Source: 'src/traits.rs', lines 128:8-128:23 -/
+ Source: 'tests/src/traits.rs', lines 128:8-128:23 -/
structure TestType.test.TestTrait (Self : Type) where
test : Self → Result Bool
/- [traits::{traits::TestType<T>#6}::test::{(traits::{traits::TestType<T>#6}::test::TestTrait for traits::{traits::TestType<T>#6}::test::TestType1)}::test]:
- Source: 'src/traits.rs', lines 139:12-139:34 -/
+ Source: 'tests/src/traits.rs', lines 139:12-139:34 -/
def TestType.test.TestTraittraitsTestTypetestTestType1.test
(self : TestType.test.TestType1) : Result Bool :=
Result.ok (self > 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: 'src/traits.rs', lines 138:8-138:36 -/
+ Source: 'tests/src/traits.rs', lines 138:8-138:36 -/
def TestType.test.TestTraittraitsTestTypetestTestType1 :
TestType.test.TestTrait TestType.test.TestType1 := {
test := TestType.test.TestTraittraitsTestTypetestTestType1.test
}
/- [traits::{traits::TestType<T>#6}::test]:
- Source: 'src/traits.rs', lines 126:4-126:36 -/
+ Source: 'tests/src/traits.rs', lines 126:4-126:36 -/
def TestType.test
(T : Type) (ToU64Inst : ToU64 T) (self : TestType T) (x : T) : Result Bool :=
do
@@ -222,11 +222,11 @@ def TestType.test
else Result.ok false
/- [traits::BoolWrapper]
- Source: 'src/traits.rs', lines 150:0-150:22 -/
+ Source: 'tests/src/traits.rs', lines 150:0-150:22 -/
@[reducible] def BoolWrapper := Bool
/- [traits::{(traits::ToType<T> for traits::BoolWrapper)#7}::to_type]:
- Source: 'src/traits.rs', lines 156:4-156:25 -/
+ Source: 'tests/src/traits.rs', lines 156:4-156:25 -/
def ToTypetraitsBoolWrapperT.to_type
(T : Type) (ToTypeBoolTInst : ToType Bool T) (self : BoolWrapper) :
Result T
@@ -234,21 +234,21 @@ def ToTypetraitsBoolWrapperT.to_type
ToTypeBoolTInst.to_type self
/- Trait implementation: [traits::{(traits::ToType<T> for traits::BoolWrapper)#7}]
- Source: 'src/traits.rs', lines 152:0-152:33 -/
+ Source: 'tests/src/traits.rs', lines 152:0-152:33 -/
def ToTypetraitsBoolWrapperT (T : Type) (ToTypeBoolTInst : ToType Bool T) :
ToType BoolWrapper T := {
to_type := ToTypetraitsBoolWrapperT.to_type T ToTypeBoolTInst
}
/- [traits::WithConstTy::LEN2]
- Source: 'src/traits.rs', lines 164:4-164:21 -/
+ Source: 'tests/src/traits.rs', lines 164:4-164:21 -/
def WithConstTy.LEN2_default_body (Self : Type) (LEN : Usize) : Result Usize :=
Result.ok 32#usize
def WithConstTy.LEN2_default (Self : Type) (LEN : Usize) : Usize :=
eval_global (WithConstTy.LEN2_default_body Self LEN)
/- Trait declaration: [traits::WithConstTy]
- Source: 'src/traits.rs', lines 161:0-161:39 -/
+ Source: 'tests/src/traits.rs', lines 161:0-161:39 -/
structure WithConstTy (Self : Type) (LEN : Usize) where
LEN1 : Usize
LEN2 : Usize
@@ -258,17 +258,17 @@ structure WithConstTy (Self : Type) (LEN : Usize) where
f : W → Array U8 LEN → Result W
/- [traits::{(traits::WithConstTy<32: usize> for bool)#8}::LEN1]
- Source: 'src/traits.rs', lines 175:4-175:21 -/
+ Source: 'tests/src/traits.rs', lines 175:4-175:21 -/
def WithConstTyBool32.LEN1_body : Result Usize := Result.ok 12#usize
def WithConstTyBool32.LEN1 : Usize := eval_global WithConstTyBool32.LEN1_body
/- [traits::{(traits::WithConstTy<32: usize> for bool)#8}::f]:
- Source: 'src/traits.rs', lines 180:4-180:39 -/
+ Source: 'tests/src/traits.rs', lines 180:4-180:39 -/
def WithConstTyBool32.f (i : U64) (a : Array U8 32#usize) : Result U64 :=
Result.ok i
/- Trait implementation: [traits::{(traits::WithConstTy<32: usize> for bool)#8}]
- Source: 'src/traits.rs', lines 174:0-174:29 -/
+ Source: 'tests/src/traits.rs', lines 174:0-174:29 -/
def WithConstTyBool32 : WithConstTy Bool 32#usize := {
LEN1 := WithConstTyBool32.LEN1
LEN2 := WithConstTy.LEN2_default Bool 32#usize
@@ -279,7 +279,7 @@ def WithConstTyBool32 : WithConstTy Bool 32#usize := {
}
/- [traits::use_with_const_ty1]:
- Source: 'src/traits.rs', lines 183:0-183:75 -/
+ Source: 'tests/src/traits.rs', lines 183:0-183:75 -/
def use_with_const_ty1
(H : Type) (LEN : Usize) (WithConstTyInst : WithConstTy H LEN) :
Result Usize
@@ -287,7 +287,7 @@ def use_with_const_ty1
Result.ok WithConstTyInst.LEN1
/- [traits::use_with_const_ty2]:
- Source: 'src/traits.rs', lines 187:0-187:73 -/
+ Source: 'tests/src/traits.rs', lines 187:0-187:73 -/
def use_with_const_ty2
(H : Type) (LEN : Usize) (WithConstTyInst : WithConstTy H LEN)
(w : WithConstTyInst.W) :
@@ -296,7 +296,7 @@ def use_with_const_ty2
Result.ok ()
/- [traits::use_with_const_ty3]:
- Source: 'src/traits.rs', lines 189:0-189:80 -/
+ Source: 'tests/src/traits.rs', lines 189:0-189:80 -/
def use_with_const_ty3
(H : Type) (LEN : Usize) (WithConstTyInst : WithConstTy H LEN)
(x : WithConstTyInst.W) :
@@ -305,12 +305,12 @@ def use_with_const_ty3
WithConstTyInst.W_clause_0.to_u64 x
/- [traits::test_where1]:
- Source: 'src/traits.rs', lines 193:0-193:40 -/
+ Source: 'tests/src/traits.rs', lines 193:0-193:40 -/
def test_where1 (T : Type) (_x : T) : Result Unit :=
Result.ok ()
/- [traits::test_where2]:
- Source: 'src/traits.rs', lines 194:0-194:57 -/
+ Source: 'tests/src/traits.rs', lines 194:0-194:57 -/
def test_where2
(T : Type) (WithConstTyT32Inst : WithConstTy T 32#usize) (_x : U32) :
Result Unit
@@ -318,30 +318,30 @@ def test_where2
Result.ok ()
/- Trait declaration: [traits::ParentTrait0]
- Source: 'src/traits.rs', lines 200:0-200:22 -/
+ Source: 'tests/src/traits.rs', lines 200:0-200:22 -/
structure ParentTrait0 (Self : Type) where
W : Type
get_name : Self → Result String
get_w : Self → Result W
/- Trait declaration: [traits::ParentTrait1]
- Source: 'src/traits.rs', lines 205:0-205:22 -/
+ Source: 'tests/src/traits.rs', lines 205:0-205:22 -/
structure ParentTrait1 (Self : Type) where
/- Trait declaration: [traits::ChildTrait]
- Source: 'src/traits.rs', lines 206:0-206:49 -/
+ Source: 'tests/src/traits.rs', lines 206:0-206:49 -/
structure ChildTrait (Self : Type) where
ParentTrait0Inst : ParentTrait0 Self
ParentTrait1Inst : ParentTrait1 Self
/- [traits::test_child_trait1]:
- Source: 'src/traits.rs', lines 209:0-209:56 -/
+ Source: 'tests/src/traits.rs', lines 209:0-209:56 -/
def test_child_trait1
(T : Type) (ChildTraitInst : ChildTrait T) (x : T) : Result String :=
ChildTraitInst.ParentTrait0Inst.get_name x
/- [traits::test_child_trait2]:
- Source: 'src/traits.rs', lines 213:0-213:54 -/
+ Source: 'tests/src/traits.rs', lines 213:0-213:54 -/
def test_child_trait2
(T : Type) (ChildTraitInst : ChildTrait T) (x : T) :
Result ChildTraitInst.ParentTrait0Inst.W
@@ -349,7 +349,7 @@ def test_child_trait2
ChildTraitInst.ParentTrait0Inst.get_w x
/- [traits::order1]:
- Source: 'src/traits.rs', lines 219:0-219:59 -/
+ Source: 'tests/src/traits.rs', lines 219:0-219:59 -/
def order1
(T U : Type) (ParentTrait0Inst : ParentTrait0 T) (ParentTrait0Inst1 :
ParentTrait0 U) :
@@ -358,28 +358,28 @@ def order1
Result.ok ()
/- Trait declaration: [traits::ChildTrait1]
- Source: 'src/traits.rs', lines 222:0-222:35 -/
+ Source: 'tests/src/traits.rs', lines 222:0-222:35 -/
structure ChildTrait1 (Self : Type) where
ParentTrait1Inst : ParentTrait1 Self
/- Trait implementation: [traits::{(traits::ParentTrait1 for usize)#9}]
- Source: 'src/traits.rs', lines 224:0-224:27 -/
+ Source: 'tests/src/traits.rs', lines 224:0-224:27 -/
def ParentTrait1Usize : ParentTrait1 Usize := {
}
/- Trait implementation: [traits::{(traits::ChildTrait1 for usize)#10}]
- Source: 'src/traits.rs', lines 225:0-225:26 -/
+ Source: 'tests/src/traits.rs', lines 225:0-225:26 -/
def ChildTrait1Usize : ChildTrait1 Usize := {
ParentTrait1Inst := ParentTrait1Usize
}
/- Trait declaration: [traits::Iterator]
- Source: 'src/traits.rs', lines 229:0-229:18 -/
+ Source: 'tests/src/traits.rs', lines 229:0-229:18 -/
structure Iterator (Self : Type) where
Item : Type
/- Trait declaration: [traits::IntoIterator]
- Source: 'src/traits.rs', lines 233:0-233:22 -/
+ Source: 'tests/src/traits.rs', lines 233:0-233:22 -/
structure IntoIterator (Self : Type) where
Item : Type
IntoIter : Type
@@ -387,106 +387,106 @@ structure IntoIterator (Self : Type) where
into_iter : Self → Result IntoIter
/- Trait declaration: [traits::FromResidual]
- Source: 'src/traits.rs', lines 250:0-250:21 -/
+ Source: 'tests/src/traits.rs', lines 250:0-250:21 -/
structure FromResidual (Self T : Type) where
/- Trait declaration: [traits::Try]
- Source: 'src/traits.rs', lines 246:0-246:48 -/
+ Source: 'tests/src/traits.rs', lines 246:0-246:48 -/
structure Try (Self : Type) where
Residual : Type
FromResidualSelftraitsTryResidualInst : FromResidual Self Residual
/- Trait declaration: [traits::WithTarget]
- Source: 'src/traits.rs', lines 252:0-252:20 -/
+ Source: 'tests/src/traits.rs', lines 252:0-252:20 -/
structure WithTarget (Self : Type) where
Target : Type
/- Trait declaration: [traits::ParentTrait2]
- Source: 'src/traits.rs', lines 256:0-256:22 -/
+ Source: 'tests/src/traits.rs', lines 256:0-256:22 -/
structure ParentTrait2 (Self : Type) where
U : Type
U_clause_0 : WithTarget U
/- Trait declaration: [traits::ChildTrait2]
- Source: 'src/traits.rs', lines 260:0-260:35 -/
+ Source: 'tests/src/traits.rs', lines 260:0-260:35 -/
structure ChildTrait2 (Self : Type) where
ParentTrait2Inst : ParentTrait2 Self
convert : ParentTrait2Inst.U → Result ParentTrait2Inst.U_clause_0.Target
/- Trait implementation: [traits::{(traits::WithTarget for u32)#11}]
- Source: 'src/traits.rs', lines 264:0-264:23 -/
+ Source: 'tests/src/traits.rs', lines 264:0-264:23 -/
def WithTargetU32 : WithTarget U32 := {
Target := U32
}
/- Trait implementation: [traits::{(traits::ParentTrait2 for u32)#12}]
- Source: 'src/traits.rs', lines 268:0-268:25 -/
+ Source: 'tests/src/traits.rs', lines 268:0-268:25 -/
def ParentTrait2U32 : ParentTrait2 U32 := {
U := U32
U_clause_0 := WithTargetU32
}
/- [traits::{(traits::ChildTrait2 for u32)#13}::convert]:
- Source: 'src/traits.rs', lines 273:4-273:29 -/
+ Source: 'tests/src/traits.rs', lines 273:4-273:29 -/
def ChildTrait2U32.convert (x : U32) : Result U32 :=
Result.ok x
/- Trait implementation: [traits::{(traits::ChildTrait2 for u32)#13}]
- Source: 'src/traits.rs', lines 272:0-272:24 -/
+ Source: 'tests/src/traits.rs', lines 272:0-272:24 -/
def ChildTrait2U32 : ChildTrait2 U32 := {
ParentTrait2Inst := ParentTrait2U32
convert := ChildTrait2U32.convert
}
/- Trait declaration: [traits::CFnOnce]
- Source: 'src/traits.rs', lines 286:0-286:23 -/
+ Source: 'tests/src/traits.rs', lines 286:0-286:23 -/
structure CFnOnce (Self Args : Type) where
Output : Type
call_once : Self → Args → Result Output
/- Trait declaration: [traits::CFnMut]
- Source: 'src/traits.rs', lines 292:0-292:37 -/
+ Source: 'tests/src/traits.rs', lines 292:0-292:37 -/
structure CFnMut (Self Args : Type) where
CFnOnceInst : CFnOnce Self Args
call_mut : Self → Args → Result (CFnOnceInst.Output × Self)
/- Trait declaration: [traits::CFn]
- Source: 'src/traits.rs', lines 296:0-296:33 -/
+ Source: 'tests/src/traits.rs', lines 296:0-296:33 -/
structure CFn (Self Args : Type) where
CFnMutInst : CFnMut Self Args
call : Self → Args → Result CFnMutInst.CFnOnceInst.Output
/- Trait declaration: [traits::GetTrait]
- Source: 'src/traits.rs', lines 300:0-300:18 -/
+ Source: 'tests/src/traits.rs', lines 300:0-300:18 -/
structure GetTrait (Self : Type) where
W : Type
get_w : Self → Result W
/- [traits::test_get_trait]:
- Source: 'src/traits.rs', lines 305:0-305:49 -/
+ Source: 'tests/src/traits.rs', lines 305:0-305:49 -/
def test_get_trait
(T : Type) (GetTraitInst : GetTrait T) (x : T) : Result GetTraitInst.W :=
GetTraitInst.get_w x
/- Trait declaration: [traits::Trait]
- Source: 'src/traits.rs', lines 310:0-310:15 -/
+ Source: 'tests/src/traits.rs', lines 310:0-310:15 -/
structure Trait (Self : Type) where
LEN : Usize
/- [traits::{(traits::Trait for @Array<T, N>)#14}::LEN]
- Source: 'src/traits.rs', lines 315:4-315:20 -/
+ Source: 'tests/src/traits.rs', lines 315:4-315:20 -/
def TraitArray.LEN_body (T : Type) (N : Usize) : Result Usize := Result.ok N
def TraitArray.LEN (T : Type) (N : Usize) : Usize :=
eval_global (TraitArray.LEN_body T N)
/- Trait implementation: [traits::{(traits::Trait for @Array<T, N>)#14}]
- Source: 'src/traits.rs', lines 314:0-314:40 -/
+ Source: 'tests/src/traits.rs', lines 314:0-314:40 -/
def TraitArray (T : Type) (N : Usize) : Trait (Array T N) := {
LEN := TraitArray.LEN T N
}
/- [traits::{(traits::Trait for traits::Wrapper<T>)#15}::LEN]
- Source: 'src/traits.rs', lines 319:4-319:20 -/
+ Source: 'tests/src/traits.rs', lines 319:4-319:20 -/
def TraittraitsWrapper.LEN_body (T : Type) (TraitInst : Trait T)
: Result Usize :=
Result.ok 0#usize
@@ -494,19 +494,19 @@ def TraittraitsWrapper.LEN (T : Type) (TraitInst : Trait T) : Usize :=
eval_global (TraittraitsWrapper.LEN_body T TraitInst)
/- Trait implementation: [traits::{(traits::Trait for traits::Wrapper<T>)#15}]
- Source: 'src/traits.rs', lines 318:0-318:35 -/
+ Source: 'tests/src/traits.rs', lines 318:0-318:35 -/
def TraittraitsWrapper (T : Type) (TraitInst : Trait T) : Trait (Wrapper T)
:= {
LEN := TraittraitsWrapper.LEN T TraitInst
}
/- [traits::use_wrapper_len]:
- Source: 'src/traits.rs', lines 322:0-322:43 -/
+ Source: 'tests/src/traits.rs', lines 322:0-322:43 -/
def use_wrapper_len (T : Type) (TraitInst : Trait T) : Result Usize :=
Result.ok (TraittraitsWrapper T TraitInst).LEN
/- [traits::Foo]
- Source: 'src/traits.rs', lines 326:0-326:20 -/
+ Source: 'tests/src/traits.rs', lines 326:0-326:20 -/
structure Foo (T U : Type) where
x : T
y : U
@@ -519,7 +519,7 @@ inductive core.result.Result (T E : Type) :=
| Err : E → core.result.Result T E
/- [traits::{traits::Foo<T, U>#16}::FOO]
- Source: 'src/traits.rs', lines 332:4-332:33 -/
+ Source: 'tests/src/traits.rs', lines 332:4-332:33 -/
def Foo.FOO_body (T U : Type) (TraitInst : Trait T)
: Result (core.result.Result T I32) :=
Result.ok (core.result.Result.Err 0#i32)
@@ -527,13 +527,13 @@ def Foo.FOO (T U : Type) (TraitInst : Trait T) : core.result.Result T I32 :=
eval_global (Foo.FOO_body T U TraitInst)
/- [traits::use_foo1]:
- Source: 'src/traits.rs', lines 335:0-335:48 -/
+ Source: 'tests/src/traits.rs', lines 335:0-335:48 -/
def use_foo1
(T U : Type) (TraitInst : Trait T) : Result (core.result.Result T I32) :=
Result.ok (Foo.FOO T U TraitInst)
/- [traits::use_foo2]:
- Source: 'src/traits.rs', lines 339:0-339:48 -/
+ Source: 'tests/src/traits.rs', lines 339:0-339:48 -/
def use_foo2
(T U : Type) (TraitInst : Trait U) : Result (core.result.Result U I32) :=
Result.ok (Foo.FOO U T TraitInst)
diff --git a/tests/src/arrays.rs b/tests/src/arrays.rs
new file mode 100644
index 00000000..1f094541
--- /dev/null
+++ b/tests/src/arrays.rs
@@ -0,0 +1,328 @@
+//! Exercise the translation of arrays, with features supported by Eurydice
+
+pub enum AB {
+ A,
+ B,
+}
+
+pub fn incr(x: &mut u32) {
+ *x += 1;
+}
+
+// Nano-tests
+// ----------
+
+// The suffix `_` prevents name collisions in some backends
+pub fn array_to_shared_slice_<T>(s: &[T; 32]) -> &[T] {
+ s
+}
+
+// The suffix `_` prevents name collisions in some backends
+pub fn array_to_mut_slice_<T>(s: &mut [T; 32]) -> &mut [T] {
+ s
+}
+
+pub fn array_len<T>(s: [T; 32]) -> usize {
+ s.len()
+}
+
+pub fn shared_array_len<T>(s: &[T; 32]) -> usize {
+ s.len()
+}
+
+pub fn shared_slice_len<T>(s: &[T]) -> usize {
+ s.len()
+}
+
+pub fn index_array_shared<T>(s: &[T; 32], i: usize) -> &T {
+ &s[i]
+}
+
+// Remark: can't move out of an array
+// Also: can't move out of a slice.
+
+pub fn index_array_u32(s: [u32; 32], i: usize) -> u32 {
+ s[i]
+}
+
+pub fn index_array_copy(x: &[u32; 32]) -> u32 {
+ x[0]
+}
+
+pub fn index_mut_array<T>(s: &mut [T; 32], i: usize) -> &mut T {
+ &mut s[i]
+}
+
+pub fn index_slice<T>(s: &[T], i: usize) -> &T {
+ &s[i]
+}
+
+pub fn index_mut_slice<T>(s: &mut [T], i: usize) -> &mut T {
+ &mut s[i]
+}
+
+pub fn slice_subslice_shared_(x: &[u32], y: usize, z: usize) -> &[u32] {
+ &x[y..z]
+}
+
+pub fn slice_subslice_mut_(x: &mut [u32], y: usize, z: usize) -> &mut [u32] {
+ &mut x[y..z]
+}
+
+pub fn array_to_slice_shared_(x: &[u32; 32]) -> &[u32] {
+ x
+}
+
+pub fn array_to_slice_mut_(x: &mut [u32; 32]) -> &mut [u32] {
+ x
+}
+
+pub fn array_subslice_shared_(x: &[u32; 32], y: usize, z: usize) -> &[u32] {
+ &x[y..z]
+}
+
+pub fn array_subslice_mut_(x: &mut [u32; 32], y: usize, z: usize) -> &mut [u32] {
+ &mut x[y..z]
+}
+
+pub fn index_slice_0<T>(s: &[T]) -> &T {
+ &s[0]
+}
+
+pub fn index_array_0<T>(s: &[T; 32]) -> &T {
+ &s[0]
+}
+
+/*
+// Unsupported by Aeneas for now
+pub fn index_index_slice<'a, T>(s: &'a [&[T]], i: usize, j: usize) -> &'a T {
+ &s[i][j]
+}
+*/
+
+pub fn index_index_array(s: [[u32; 32]; 32], i: usize, j: usize) -> u32 {
+ s[i][j]
+}
+
+/*
+// Unsupported by Aeneas for now
+pub fn update_update_slice(s: &mut [&mut [u32]], i: usize, j: usize) {
+ s[i][j] = 0;
+}
+*/
+
+pub fn update_update_array(mut s: [[u32; 32]; 32], i: usize, j: usize) {
+ s[i][j] = 0;
+}
+
+pub fn array_local_deep_copy(x: &[u32; 32]) {
+ let _y = *x;
+}
+
+pub fn take_array(_: [u32; 2]) {}
+pub fn take_array_borrow(_: &[u32; 2]) {}
+pub fn take_slice(_: &[u32]) {}
+pub fn take_mut_slice(_: &mut [u32]) {}
+
+pub fn const_array() -> [u32; 2] {
+ [0, 0]
+}
+
+pub fn const_slice() {
+ let _: &[u32] = &[0, 0];
+}
+
+/*
+// This triggers a special case in the constant expressions
+pub fn const_string() {
+ let _ = "hello";
+}*/
+
+pub fn take_all() {
+ let mut x: [u32; 2] = [0, 0];
+ // x is deep copied (copy node appears in Charon, followed by a move)
+ take_array(x);
+ take_array(x);
+ // x passed by address, there is a reborrow here
+ take_array_borrow(&x);
+ // automatic cast from array to slice (spanning entire array)
+ take_slice(&x);
+ // note that both appear as SliceNew expressions, meaning the SliceNew UnOp is overloaded for
+ // mut and non-mut cases
+ take_mut_slice(&mut x);
+}
+
+pub fn index_array(x: [u32; 2]) -> u32 {
+ x[0]
+}
+pub fn index_array_borrow(x: &[u32; 2]) -> u32 {
+ x[0]
+}
+
+pub fn index_slice_u32_0(x: &[u32]) -> u32 {
+ x[0]
+}
+
+pub fn index_mut_slice_u32_0(x: &mut [u32]) -> u32 {
+ x[0]
+}
+
+pub fn index_all() -> u32 {
+ let mut x: [u32; 2] = [0, 0];
+ if true {
+ let _y: [u32; 2] = [0, 0];
+ } else {
+ let _z: [u32; 1] = [0];
+ }
+ index_array(x)
+ + index_array(x)
+ + index_array_borrow(&x)
+ + index_slice_u32_0(&x)
+ + index_mut_slice_u32_0(&mut x)
+}
+
+pub fn update_array(mut x: [u32; 2]) {
+ x[0] = 1
+}
+pub fn update_array_mut_borrow(x: &mut [u32; 2]) {
+ x[0] = 1
+}
+pub fn update_mut_slice(x: &mut [u32]) {
+ x[0] = 1
+}
+
+pub fn update_all() {
+ let mut x: [u32; 2] = [0, 0];
+ update_array(x);
+ update_array(x);
+ update_array_mut_borrow(&mut x);
+ update_mut_slice(&mut x);
+}
+
+// Nano-tests, with ranges
+// -----------------------
+
+pub fn range_all() {
+ let mut x: [u32; 4] = [0, 0, 0, 0];
+ // CONFIRM: there is no way to shrink [T;N] into [T;M] with M<N?
+ update_mut_slice(&mut x[1..3]);
+}
+
+// Nano-tests, with dereferences
+// -----------------------------
+
+pub fn deref_array_borrow(x: &[u32; 2]) -> u32 {
+ let x: [u32; 2] = *x;
+ x[0]
+}
+
+pub fn deref_array_mut_borrow(x: &mut [u32; 2]) -> u32 {
+ let x: [u32; 2] = *x;
+ x[0]
+}
+
+// Non-copiable arrays
+// -------------------
+
+pub fn take_array_t(_: [AB; 2]) {}
+
+pub fn non_copyable_array() {
+ let x: [AB; 2] = [AB::A, AB::B];
+ // x is moved (not deep copied!)
+ // TODO: determine whether the translation needs to be aware of that and pass by ref instead of by copy
+ take_array_t(x);
+
+ // this fails, naturally:
+ // take_array_t(x);
+}
+
+// Larger, random tests
+// --------------------
+
+pub fn sum(s: &[u32]) -> u32 {
+ let mut sum = 0;
+ let mut i = 0;
+ while i < s.len() {
+ sum += s[i];
+ i += 1;
+ }
+ sum
+}
+
+pub fn sum2(s: &[u32], s2: &[u32]) -> u32 {
+ let mut sum = 0;
+ assert!(s.len() == s2.len());
+ let mut i = 0;
+ while i < s.len() {
+ sum += s[i] + s2[i];
+ i += 1;
+ }
+ sum
+}
+
+pub fn f0() {
+ let s: &mut [u32] = &mut [1, 2];
+ s[0] = 1;
+}
+
+pub fn f1() {
+ let mut s: [u32; 2] = [1, 2];
+ s[0] = 1;
+}
+
+pub fn f2(_: u32) {}
+
+pub fn f3() -> u32 {
+ let a: [u32; 2] = [1, 2];
+ f2(a[0]);
+ let b = [0; 32];
+ sum2(&a, f4(&b, 16, 18))
+}
+
+pub fn f4(x: &[u32; 32], y: usize, z: usize) -> &[u32] {
+ &x[y..z]
+}
+
+pub const SZ: usize = 32;
+
+// There is something slightly annoying here: the SZ constant gets inlined
+pub fn f5(x: &[u32; SZ]) -> u32 {
+ x[0]
+}
+
+// To avoid lifetime shortening
+pub fn ite() {
+ let mut x: [u32; 2] = [0, 0];
+ if true {
+ let mut y: [u32; 2] = [0, 0];
+ index_mut_slice_u32_0(&mut x);
+ index_mut_slice_u32_0(&mut y);
+ }
+}
+
+pub fn zero_slice(a: &mut [u8]) {
+ let mut i: usize = 0;
+ let len = a.len();
+ while i < len {
+ a[i] = 0;
+ i += 1;
+ }
+}
+
+pub fn iter_mut_slice(a: &mut [u8]) {
+ let len = a.len();
+ let mut i = 0;
+ while i < len {
+ i += 1;
+ }
+}
+
+pub fn sum_mut_slice(a: &mut [u32]) -> u32 {
+ let mut i = 0;
+ let mut s = 0;
+ while i < a.len() {
+ s += a[i];
+ i += 1;
+ }
+ s
+}
diff --git a/tests/src/betree/Cargo.lock b/tests/src/betree/Cargo.lock
new file mode 100644
index 00000000..1bd274ad
--- /dev/null
+++ b/tests/src/betree/Cargo.lock
@@ -0,0 +1,299 @@
+# This file is automatically @generated by Cargo.
+# It is not intended for manual editing.
+version = 3
+
+[[package]]
+name = "aho-corasick"
+version = "1.1.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8e60d3430d3a69478ad0993f19238d2df97c507009a52b3c10addcd7f6bcb916"
+dependencies = [
+ "memchr",
+]
+
+[[package]]
+name = "atty"
+version = "0.2.14"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d9b39be18770d11421cdb1b9947a45dd3f37e93092cbf377614828a319d5fee8"
+dependencies = [
+ "hermit-abi",
+ "libc",
+ "winapi",
+]
+
+[[package]]
+name = "betree"
+version = "0.1.0"
+dependencies = [
+ "env_logger",
+ "log",
+ "serde",
+ "serde_json",
+]
+
+[[package]]
+name = "env_logger"
+version = "0.8.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a19187fea3ac7e84da7dacf48de0c45d63c6a76f9490dae389aead16c243fce3"
+dependencies = [
+ "atty",
+ "humantime",
+ "log",
+ "regex",
+ "termcolor",
+]
+
+[[package]]
+name = "hermit-abi"
+version = "0.1.19"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "62b467343b94ba476dcb2500d242dadbb39557df889310ac77c5d99100aaac33"
+dependencies = [
+ "libc",
+]
+
+[[package]]
+name = "humantime"
+version = "2.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9a3a5bfb195931eeb336b2a7b4d761daec841b97f947d34394601737a7bba5e4"
+
+[[package]]
+name = "itoa"
+version = "1.0.11"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "49f1f14873335454500d59611f1cf4a4b0f786f9ac11f4312a78e4cf2566695b"
+
+[[package]]
+name = "libc"
+version = "0.2.155"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "97b3888a4aecf77e811145cadf6eef5901f4782c53886191b2f693f24761847c"
+
+[[package]]
+name = "log"
+version = "0.4.21"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "90ed8c1e510134f979dbc4f070f87d4313098b704861a105fe34231c70a3901c"
+
+[[package]]
+name = "memchr"
+version = "2.7.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6c8640c5d730cb13ebd907d8d04b52f55ac9a2eec55b440c8892f40d56c76c1d"
+
+[[package]]
+name = "proc-macro2"
+version = "1.0.83"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0b33eb56c327dec362a9e55b3ad14f9d2f0904fb5a5b03b513ab5465399e9f43"
+dependencies = [
+ "unicode-ident",
+]
+
+[[package]]
+name = "quote"
+version = "1.0.36"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0fa76aaf39101c457836aec0ce2316dbdc3ab723cdda1c6bd4e6ad4208acaca7"
+dependencies = [
+ "proc-macro2",
+]
+
+[[package]]
+name = "regex"
+version = "1.10.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c117dbdfde9c8308975b6a18d71f3f385c89461f7b3fb054288ecf2a2058ba4c"
+dependencies = [
+ "aho-corasick",
+ "memchr",
+ "regex-automata",
+ "regex-syntax",
+]
+
+[[package]]
+name = "regex-automata"
+version = "0.4.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "86b83b8b9847f9bf95ef68afb0b8e6cdb80f498442f5179a29fad448fcc1eaea"
+dependencies = [
+ "aho-corasick",
+ "memchr",
+ "regex-syntax",
+]
+
+[[package]]
+name = "regex-syntax"
+version = "0.8.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "adad44e29e4c806119491a7f06f03de4d1af22c3a680dd47f1e6e179439d1f56"
+
+[[package]]
+name = "ryu"
+version = "1.0.18"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f3cb5ba0dc43242ce17de99c180e96db90b235b8a9fdc9543c96d2209116bd9f"
+
+[[package]]
+name = "serde"
+version = "1.0.202"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "226b61a0d411b2ba5ff6d7f73a476ac4f8bb900373459cd00fab8512828ba395"
+dependencies = [
+ "serde_derive",
+]
+
+[[package]]
+name = "serde_derive"
+version = "1.0.202"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6048858004bcff69094cd972ed40a32500f153bd3be9f716b2eed2e8217c4838"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "serde_json"
+version = "1.0.117"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "455182ea6142b14f93f4bc5320a2b31c1f266b66a4a5c858b013302a5d8cbfc3"
+dependencies = [
+ "itoa",
+ "ryu",
+ "serde",
+]
+
+[[package]]
+name = "syn"
+version = "2.0.65"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d2863d96a84c6439701d7a38f9de935ec562c8832cc55d1dde0f513b52fad106"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "unicode-ident",
+]
+
+[[package]]
+name = "termcolor"
+version = "1.4.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "06794f8f6c5c898b3275aebefa6b8a1cb24cd2c6c79397ab15774837a0bc5755"
+dependencies = [
+ "winapi-util",
+]
+
+[[package]]
+name = "unicode-ident"
+version = "1.0.12"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3354b9ac3fae1ff6755cb6db53683adb661634f67557942dea4facebec0fee4b"
+
+[[package]]
+name = "winapi"
+version = "0.3.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5c839a674fcd7a98952e593242ea400abe93992746761e38641405d28b00f419"
+dependencies = [
+ "winapi-i686-pc-windows-gnu",
+ "winapi-x86_64-pc-windows-gnu",
+]
+
+[[package]]
+name = "winapi-i686-pc-windows-gnu"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ac3b87c63620426dd9b991e5ce0329eff545bccbbb34f3be09ff6fb6ab51b7b6"
+
+[[package]]
+name = "winapi-util"
+version = "0.1.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4d4cc384e1e73b93bafa6fb4f1df8c41695c8a91cf9c4c64358067d15a7b6c6b"
+dependencies = [
+ "windows-sys",
+]
+
+[[package]]
+name = "winapi-x86_64-pc-windows-gnu"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "712e227841d057c1ee1cd2fb22fa7e5a5461ae8e48fa2ca79ec42cfc1931183f"
+
+[[package]]
+name = "windows-sys"
+version = "0.52.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "282be5f36a8ce781fad8c8ae18fa3f9beff57ec1b52cb3de0789201425d9a33d"
+dependencies = [
+ "windows-targets",
+]
+
+[[package]]
+name = "windows-targets"
+version = "0.52.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6f0713a46559409d202e70e28227288446bf7841d3211583a4b53e3f6d96e7eb"
+dependencies = [
+ "windows_aarch64_gnullvm",
+ "windows_aarch64_msvc",
+ "windows_i686_gnu",
+ "windows_i686_gnullvm",
+ "windows_i686_msvc",
+ "windows_x86_64_gnu",
+ "windows_x86_64_gnullvm",
+ "windows_x86_64_msvc",
+]
+
+[[package]]
+name = "windows_aarch64_gnullvm"
+version = "0.52.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7088eed71e8b8dda258ecc8bac5fb1153c5cffaf2578fc8ff5d61e23578d3263"
+
+[[package]]
+name = "windows_aarch64_msvc"
+version = "0.52.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9985fd1504e250c615ca5f281c3f7a6da76213ebd5ccc9561496568a2752afb6"
+
+[[package]]
+name = "windows_i686_gnu"
+version = "0.52.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "88ba073cf16d5372720ec942a8ccbf61626074c6d4dd2e745299726ce8b89670"
+
+[[package]]
+name = "windows_i686_gnullvm"
+version = "0.52.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "87f4261229030a858f36b459e748ae97545d6f1ec60e5e0d6a3d32e0dc232ee9"
+
+[[package]]
+name = "windows_i686_msvc"
+version = "0.52.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "db3c2bf3d13d5b658be73463284eaf12830ac9a26a90c717b7f771dfe97487bf"
+
+[[package]]
+name = "windows_x86_64_gnu"
+version = "0.52.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4e4246f76bdeff09eb48875a0fd3e2af6aada79d409d33011886d3e1581517d9"
+
+[[package]]
+name = "windows_x86_64_gnullvm"
+version = "0.52.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "852298e482cd67c356ddd9570386e2862b5673c85bd5f88df9ab6802b334c596"
+
+[[package]]
+name = "windows_x86_64_msvc"
+version = "0.52.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "bec47e5bfd1bff0eeaf6d8b485cc1074891a197ab4225d504cb7a1ab88b02bf0"
diff --git a/tests/src/betree/Cargo.toml b/tests/src/betree/Cargo.toml
new file mode 100644
index 00000000..c05c7d93
--- /dev/null
+++ b/tests/src/betree/Cargo.toml
@@ -0,0 +1,13 @@
+[package]
+name = "betree"
+version = "0.1.0"
+authors = ["Son Ho <hosonmarc@gmail.com>"]
+edition = "2018"
+
+[dependencies]
+serde_json = "1.0.91"
+serde = { version = "1.0.152", features = ["derive"] }
+log = "0.4.17"
+env_logger = "0.8.4"
+
+# TODO: If we turn this package into a library, building the tests fails.
diff --git a/tests/src/betree/Makefile b/tests/src/betree/Makefile
new file mode 100644
index 00000000..7b41e56d
--- /dev/null
+++ b/tests/src/betree/Makefile
@@ -0,0 +1,11 @@
+.PHONY: all
+all: tests
+
+.PHONY: test
+test:
+ cargo rustc -- --test -Zpolonius
+ cd target/debug/ && ./betree
+
+.PHONY: clean
+clean:
+ cargo clean
diff --git a/tests/src/betree/README.md b/tests/src/betree/README.md
new file mode 100644
index 00000000..a71fe884
--- /dev/null
+++ b/tests/src/betree/README.md
@@ -0,0 +1 @@
+This project contains tests which require the Polonius borrow checker.
diff --git a/tests/src/betree/rust-toolchain b/tests/src/betree/rust-toolchain
new file mode 100644
index 00000000..9460b1a8
--- /dev/null
+++ b/tests/src/betree/rust-toolchain
@@ -0,0 +1,3 @@
+[toolchain]
+channel = "nightly-2023-06-02"
+components = [ "rustc-dev", "llvm-tools-preview" ]
diff --git a/tests/src/betree/src/betree.rs b/tests/src/betree/src/betree.rs
new file mode 100644
index 00000000..12f2847d
--- /dev/null
+++ b/tests/src/betree/src/betree.rs
@@ -0,0 +1,1084 @@
+//! The following module implements a minimal betree.
+//! We don't have loops for now, so we will need to update the code to remove
+//! the recursive functions at some point.
+//! We drew a lot of inspiration from the C++ [Be-Tree](https://github.com/oscarlab/Be-Tree).
+//! implementation.
+#![allow(dead_code)]
+
+use crate::betree_utils as utils;
+
+pub type NodeId = u64;
+pub type Key = u64;
+pub type Value = u64;
+
+type Map<K, V> = List<(K, V)>;
+
+/// We use linked lists for the maps from keys to messages/bindings
+pub(crate) enum List<T> {
+ Cons(T, Box<List<T>>),
+ Nil,
+}
+
+/// Every node has a unique identifier (the betree has a counter).
+/// Whenever we need to read/update the content of a node, we read/update
+/// the whole content from disk at once.
+///
+/// In order to make things simple, the content of each node is saved in
+/// a single file, identified by the node index. Also, we use json.
+///
+/// We don't reason about the content of the load/store node functions
+/// (which are assumed), while the purpose of this example is to illustrate the
+/// proof experience we have with Aeneas: we are not looking for performance here.
+///
+/// Rk.: in the future, we will directly use the functions from betree_utils
+/// and setup the translation to consider this module as assumed (i.e., no
+/// wrappers)
+fn load_internal_node(id: NodeId) -> InternalContent {
+ utils::load_internal_node(id)
+}
+
+/// See [load_internal_node].
+fn store_internal_node(id: NodeId, content: InternalContent) {
+ utils::store_internal_node(id, content)
+}
+
+/// See [load_internal_node].
+fn load_leaf_node(id: NodeId) -> LeafContent {
+ utils::load_leaf_node(id)
+}
+
+/// See [load_internal_node].
+fn store_leaf_node(id: NodeId, content: LeafContent) {
+ utils::store_leaf_node(id, content)
+}
+
+fn fresh_node_id(counter: &mut NodeId) -> NodeId {
+ let id = *counter;
+ *counter += 1;
+ id
+}
+
+/// We use this type to encode closures.
+/// See [Message::Upsert] and [upsert_update]
+pub enum UpsertFunState {
+ Add(u64),
+ Sub(u64),
+}
+
+/// A message - note that all those messages have to be linked to a key
+pub(crate) enum Message {
+ /// Insert a binding from value to key
+ Insert(Value),
+ /// Delete a binding from value to key
+ Delete,
+ /// [Upsert] is "query then update" (query a value, then update the binding
+ /// by using the result of the query). This is pretty expensive if we
+ /// actually *do* query, *then* update: queries are expensive, because
+ /// we potentially have to explore the tree in depth (and every time we
+ /// lookup a node, we have an expensive I/O operation).
+ /// Instead, we insert this [Upsert] message in the tree, which progressively
+ /// gets propagated to the children untils it gets applied (when we find an
+ /// [Insert], or when we reach a leaf).
+ ///
+ /// In practice, [Upsert] should store a closure. For now we don't have
+ /// support for function pointers and closures, so [Upsert] doesn't store
+ /// a closure and always applies the same update function. Note that the
+ /// [Value] stored in [Upsert] acts as a closure's state.
+ ///
+ /// The interest of this example is to split the proof in two:
+ /// 1. a very simple refinement proof (which is made simple by the fact that
+ /// Aeneas takes care of the memory management proof obligations through
+ /// the translation)
+ /// 2. a more complex functional proof.
+ /// We write a very general model of the b-epsilon tree, prove that it is
+ /// refined by the translated code in 1., then prove the general functional
+ /// correctness case once and for all in 2.
+ /// The idea is that once we add support for closures, we should be able to
+ /// update the Rust code, and all we would need to do on the proof side is
+ /// to update the refinement proof in 1., which should hopefully be
+ /// straightforward.
+ ///
+ /// Also note that if we don't have [Upsert], there is no point in using
+ /// b-epsilon trees, which have the particularity of storing messages:
+ /// b-trees and their variants work very well (and don't use messages).
+ ///
+ /// Note there is something interesting about the proofs we do for [Upsert].
+ /// When we use [Insert] or [Delete], we remove the upserts which are pending
+ /// for the key, because there is no point in applying them (there would be
+ /// if we wanted to leverage the fact that the update functions we apply may
+ /// be stateful).
+ /// The consequence is that we don't observe potentially failing executions of
+ /// the update functions. At the opposite, the specification of [Upsert] is
+ /// "greedy": we see [Upsert] as query then update. This means that the
+ /// implementation refines the specification only if we make sure that the
+ /// update function used for the upsert doesn't fail on the input we give it
+ /// (all this can be seen in the specification we prove about the be-tree).
+ Upsert(UpsertFunState),
+}
+
+/// Internal node content.
+///
+/// An internal node contains a map from keys to pending messages
+///
+/// Invariants:
+/// - the pairs (key, message) are sorted so that the keys are in increasing order
+/// - for a given key, there can be:
+/// - no message
+/// - one insert or delete message
+/// - a list of upsert messages. In that case, the upsert message are sorted
+/// from the *first* to the *last* added in the betree.
+pub(crate) type InternalContent = Map<Key, Message>;
+
+/// Leaf node content.
+///
+/// A leaf node contains a map from keys to values.
+/// We store the bindings in order of increasing key.
+pub(crate) type LeafContent = Map<Key, Value>;
+
+/// Internal node. See [Node].
+///
+/// An internal node contains a stack of messages (stored on disk and thus
+/// absent from the node itself), and two children.
+///
+/// When transmitting messages to the children: the messages/bindings for the
+/// keys < pivot are given to the left child, and those for the keys >= pivot
+/// are given to the right child.
+///
+/// Note that in Be-Tree the internal nodes have lists of children, which
+/// allows to do even smarter things: if an internal node has too many
+/// messages, then:
+/// - either it can transmit big batches of those messages to some of its
+/// children, in which case it does
+/// - or it can't, in which case it splits, because otherwise we have too
+/// many unefficient updates to perform (the aim really is to amortize
+/// the cost of I/O, which is achieved by minimizing the number of
+/// accesses to node contents)
+struct Internal {
+ id: NodeId,
+ pivot: Key,
+ left: Box<Node>,
+ right: Box<Node>,
+}
+
+/// Leaf node. See [Node]
+///
+/// A leaf node contains bindings (stored on disk, and thus absent from the
+/// node itself).
+struct Leaf {
+ id: NodeId,
+ /// The number of bindings in the node
+ size: u64,
+}
+
+/// A node in the BeTree.
+///
+/// The node's content is stored on disk (and hence absent from the node itself).
+///
+/// Note that we don't have clean/dirty nodes: all node contents are immediately
+/// written on disk upon being updated.
+enum Node {
+ /// An internal node (with children).
+ Internal(Internal),
+ /// A leaf node.
+ Leaf(Leaf),
+}
+
+/// The parameters of a BeTree, which control when to flush or split.
+struct Params {
+ /// The minimum number of messages we flush to the children.
+ /// We wait to reach 2 * min_flush_size before flushing to children.
+ /// If one of the children doesn't receive a number of
+ /// messages >= min_flush_size, we keep those messages in the parent
+ /// node. Of course, at least one of the two children will receive
+ /// flushed messages: this gives us that an internal node has at most
+ /// 2 * min_flush_size pending messages - 1.
+ min_flush_size: u64,
+ /// The maximum number of bindings we can store in a leaf node (if we
+ /// reach this number, we split).
+ split_size: u64,
+}
+
+struct NodeIdCounter {
+ next_node_id: NodeId,
+}
+
+impl NodeIdCounter {
+ fn new() -> Self {
+ NodeIdCounter { next_node_id: 0 }
+ }
+
+ fn fresh_id(&mut self) -> NodeId {
+ let id = self.next_node_id;
+ self.next_node_id += 1;
+ id
+ }
+}
+
+/// The BeTree itself
+pub struct BeTree {
+ /// The parameters of the BeTree
+ params: Params,
+ /// Every node has a unique id: we keep a counter to generate fresh ids
+ node_id_cnt: NodeIdCounter,
+ /// The root of the tree
+ root: Node,
+}
+
+/// The update function used for [Upsert].
+/// Will be removed once we have closures (or at least function pointers).
+/// This function just computes a saturated sum.
+/// Also note that it takes an option as input, for the previous value:
+/// we draw inspiration from the C++ Be-Tree implemenation, where
+/// in case the binding is not present, the closure stored in upsert is
+/// given a default value.
+pub fn upsert_update(prev: Option<Value>, st: UpsertFunState) -> Value {
+ // We just compute the sum, until it saturates
+ match prev {
+ Option::None => {
+ match st {
+ UpsertFunState::Add(v) => {
+ // We consider the default value is 0, so we return 0 + v
+ // (or we could fail - it doesn't really matter)
+ v
+ }
+ UpsertFunState::Sub(_) => {
+ // Same logic as for [sub], but this time we saturate at 0
+ 0
+ }
+ }
+ }
+ Option::Some(prev) => {
+ match st {
+ UpsertFunState::Add(v) => {
+ // Note that Aeneas is a bit conservative about the max_usize
+ let margin = u64::MAX - prev;
+ // Check if we saturate
+ if margin >= v {
+ prev + v
+ } else {
+ u64::MAX
+ }
+ }
+ UpsertFunState::Sub(v) => {
+ // Check if we saturate
+ if prev >= v {
+ prev - v
+ } else {
+ 0
+ }
+ }
+ }
+ }
+ }
+}
+
+impl<T> List<T> {
+ fn len(&self) -> u64 {
+ match self {
+ List::Nil => 0,
+ List::Cons(_, tl) => 1 + tl.len(),
+ }
+ }
+
+ /// Split a list at a given length
+ fn split_at(self, n: u64) -> (List<T>, List<T>) {
+ if n == 0 {
+ (List::Nil, self)
+ } else {
+ match self {
+ List::Nil => unreachable!(),
+ List::Cons(hd, tl) => {
+ let (ls0, ls1) = tl.split_at(n - 1);
+ (List::Cons(hd, Box::new(ls0)), ls1)
+ }
+ }
+ }
+ }
+
+ /// Push an element at the front of the list.
+ fn push_front(&mut self, x: T) {
+ // Move under borrows: annoying...
+ let tl = std::mem::replace(self, List::Nil);
+ *self = List::Cons(x, Box::new(tl));
+ }
+
+ /// Pop the element at the front of the list
+ fn pop_front(&mut self) -> T {
+ // Move under borrows: annoying...
+ let ls = std::mem::replace(self, List::Nil);
+ match ls {
+ List::Nil => panic!(),
+ List::Cons(x, tl) => {
+ *self = *tl;
+ x
+ }
+ }
+ }
+
+ fn hd(&self) -> &T {
+ match self {
+ List::Nil => panic!(),
+ List::Cons(hd, _) => hd,
+ }
+ }
+}
+
+impl<T> Map<Key, T> {
+ fn head_has_key(&self, key: Key) -> bool {
+ match self {
+ List::Nil => false,
+ List::Cons(hd, _) => hd.0 == key,
+ }
+ }
+
+ /// Partition the map between two maps:
+ /// - a first map where the keys < pivot
+ /// - a second map where the keys >= pivot
+ /// Note that the bindings in the map are supposed to be sorted in
+ /// order of increasing keys.
+ fn partition_at_pivot(self, pivot: Key) -> (Map<Key, T>, Map<Key, T>) {
+ match self {
+ List::Nil => (List::Nil, List::Nil),
+ List::Cons(hd, tl) => {
+ if hd.0 >= pivot {
+ (List::Nil, List::Cons(hd, tl))
+ } else {
+ let (ls0, ls1) = tl.partition_at_pivot(pivot);
+ (List::Cons(hd, Box::new(ls0)), ls1)
+ }
+ }
+ }
+ }
+}
+
+impl Leaf {
+ /// Split a leaf into an internal node with two children.
+ ///
+ /// The leaf should have exactly 2 * split_size elements.
+ /// Also, we use the fact that the keys are sorted in increasing order.
+ fn split(
+ &self,
+ content: Map<Key, Value>,
+ params: &Params,
+ node_id_cnt: &mut NodeIdCounter,
+ ) -> Internal {
+ // Split the content
+ let (content0, content1) = content.split_at(params.split_size);
+ // Get the pivot
+ let pivot = content1.hd().0;
+ // Create the two nodes
+ let id0 = node_id_cnt.fresh_id();
+ let id1 = node_id_cnt.fresh_id();
+ let left = Leaf {
+ id: id0,
+ size: params.split_size,
+ };
+ let right = Leaf {
+ id: id1,
+ size: params.split_size,
+ };
+ // Store the content
+ store_leaf_node(id0, content0);
+ store_leaf_node(id1, content1);
+ // Return
+ Internal {
+ id: self.id,
+ pivot,
+ left: Box::new(Node::Leaf(left)),
+ right: Box::new(Node::Leaf(right)),
+ }
+ }
+}
+
+impl Internal {
+ /// Small utility: lookup a value in the children nodes.
+ fn lookup_in_children(&mut self, key: Key) -> Option<Value> {
+ if key < self.pivot {
+ self.left.lookup(key)
+ } else {
+ self.right.lookup(key)
+ }
+ }
+
+ /// Flush the messages in an internal node to its children.
+ /// Note that when flushing, we send messages to a child only if there
+ /// are more than min_flush_size messages to send. Also, we flush only
+ /// if the number of messages in the current node is >= 2* num_flush_size.
+ ///
+ /// The function returns the messages we couldn't flush to the children
+ /// nodes.
+ fn flush<'a>(
+ &'a mut self,
+ params: &Params,
+ node_id_cnt: &'a mut NodeIdCounter,
+ content: Map<Key, Message>,
+ ) -> Map<Key, Message> {
+ // Partition the messages
+ let (msgs_left, msgs_right) = content.partition_at_pivot(self.pivot);
+ // Check if we need to flush to the left child
+ let len_left = msgs_left.len();
+ if len_left >= params.min_flush_size {
+ // Flush to the left
+ self.left.apply_messages(params, node_id_cnt, msgs_left);
+ // Check if we need to flush to the right
+ let len_right = msgs_right.len();
+ if len_right >= params.min_flush_size {
+ self.right.apply_messages(params, node_id_cnt, msgs_right);
+ // No messages remain in the current node
+ List::Nil
+ } else {
+ // We keep the messages which belong to the right node
+ msgs_right
+ }
+ } else {
+ // Don't flush to the left: we necessarily flush to the right
+ self.right.apply_messages(params, node_id_cnt, msgs_right);
+ // We keep the messages which belong to the left node
+ msgs_left
+ }
+ }
+}
+
+impl Node {
+ /// Apply a list of message to ourselves: leaf node case
+ fn apply_messages_to_leaf<'a>(
+ bindings: &'a mut Map<Key, Value>,
+ new_msgs: List<(Key, Message)>,
+ ) {
+ match new_msgs {
+ List::Nil => (),
+ List::Cons(new_msg, new_msgs_tl) => {
+ Node::apply_to_leaf(bindings, new_msg.0, new_msg.1);
+ Node::apply_messages_to_leaf(bindings, *new_msgs_tl);
+ }
+ }
+ }
+
+ /// Apply a message to ourselves: leaf node case
+ ///
+ /// This simply updates the bindings.
+ fn apply_to_leaf<'a>(bindings: &'a mut Map<Key, Value>, key: Key, new_msg: Message) {
+ // Retrieve a mutable borrow to the position of the binding, if there is
+ // one, or to the end of the list
+ let bindings = Node::lookup_mut_in_bindings(key, bindings);
+ // Check if we point to a binding which has the key we are looking for
+ if bindings.head_has_key(key) {
+ // We need to pop the binding, and may need to reuse the
+ // previous value (for an upsert)
+ let hd = bindings.pop_front();
+ // Match over the message
+ match new_msg {
+ Message::Insert(v) => {
+ bindings.push_front((key, v));
+ }
+ Message::Delete => {
+ // Nothing to do: we popped the binding
+ ()
+ }
+ Message::Upsert(s) => {
+ let v = upsert_update(Option::Some(hd.1), s);
+ bindings.push_front((key, v));
+ }
+ }
+ } else {
+ // Key not found: simply insert
+ match new_msg {
+ Message::Insert(v) => {
+ bindings.push_front((key, v));
+ }
+ Message::Delete => {
+ // Nothing to do
+ ()
+ }
+ Message::Upsert(s) => {
+ let v = upsert_update(Option::None, s);
+ bindings.push_front((key, v));
+ }
+ }
+ }
+ }
+
+ /// Apply a list of message to ourselves: internal node case
+ fn apply_messages_to_internal<'a>(
+ msgs: &'a mut Map<Key, Message>,
+ new_msgs: List<(Key, Message)>,
+ ) {
+ match new_msgs {
+ List::Nil => (),
+ List::Cons(new_msg, new_msgs_tl) => {
+ Node::apply_to_internal(msgs, new_msg.0, new_msg.1);
+ Node::apply_messages_to_internal(msgs, *new_msgs_tl);
+ }
+ }
+ }
+
+ /// Apply a message to ourselves: internal node case
+ ///
+ /// This basically inserts a message in a messages stack. However,
+ /// we may need to filter previous messages: for insert, if we insert an
+ /// [Insert] in a stack which contains an [Insert] or a [Delete] for the
+ /// same key, we replace this old message with the new one.
+ fn apply_to_internal<'a>(msgs: &'a mut Map<Key, Message>, key: Key, new_msg: Message) {
+ // Lookup the first message for [key] (if there is no message for [key],
+ // we get a mutable borrow to the position in the list where we need
+ // to insert the new message).
+ let msgs = Node::lookup_first_message_for_key(key, msgs);
+ // What we do is not the same, depending on whether there is already
+ // a message or not.
+ if msgs.head_has_key(key) {
+ // We need to check the current message
+ match new_msg {
+ Message::Insert(_) | Message::Delete => {
+ // If [Insert] or [Delete]: filter the current
+ // messages, and insert the new one
+ Node::filter_messages_for_key(key, msgs);
+ msgs.push_front((key, new_msg));
+ }
+ Message::Upsert(s) => {
+ // If [Update]: we need to take into account the
+ // previous messages.
+ match msgs.hd().1 {
+ Message::Insert(prev) => {
+ // There should be exactly one [Insert]:
+ // pop it, compute the result of the [Upsert]
+ // and insert this result
+ let v = upsert_update(Option::Some(prev), s);
+ let _ = msgs.pop_front();
+ msgs.push_front((key, Message::Insert(v)));
+ }
+ Message::Delete => {
+ // There should be exactly one [Delete]
+ // message : pop it, compute the result of
+ // the [Upsert], and insert this result
+ let _ = msgs.pop_front();
+ let v = upsert_update(Option::None, s);
+ msgs.push_front((key, Message::Insert(v)));
+ }
+ Message::Upsert(_) => {
+ // There may be several msgs upserts:
+ // we need to insert the new message at
+ // the end of the list of upserts (so
+ // that later we can apply them all in
+ // proper order).
+ let msgs = Node::lookup_first_message_after_key(key, msgs);
+ msgs.push_front((key, Message::Upsert(s)));
+ }
+ }
+ }
+ }
+ } else {
+ // No pending message for [key]: simply add the new message
+ msgs.push_front((key, new_msg))
+ }
+ }
+
+ /// Apply a message to ourselves
+ fn apply<'a>(
+ &'a mut self,
+ params: &Params,
+ node_id_cnt: &'a mut NodeIdCounter,
+ key: Key,
+ new_msg: Message,
+ ) {
+ let msgs = List::Cons((key, new_msg), Box::new(List::Nil));
+ self.apply_messages(params, node_id_cnt, msgs);
+ }
+
+ /// Apply a list of messages to ourselves
+ fn apply_messages<'a>(
+ &'a mut self,
+ params: &Params,
+ node_id_cnt: &'a mut NodeIdCounter,
+ msgs: List<(Key, Message)>,
+ ) {
+ match self {
+ Node::Leaf(node) => {
+ // Load the content from disk
+ let mut content = load_leaf_node(node.id);
+ // Insert
+ Node::apply_messages_to_leaf(&mut content, msgs);
+ // Check if we need to split - in the future, we might want to
+ // do something smarter to compute the number of messages
+ let len = content.len();
+ if len >= 2 * params.split_size {
+ // Split
+ let new_node = node.split(content, params, node_id_cnt);
+ // Store the content to disk
+ store_leaf_node(node.id, List::Nil);
+ // Update the node
+ *self = Node::Internal(new_node);
+ } else {
+ // Update the size if necessary
+ node.size = len;
+ // Store the content to disk
+ store_leaf_node(node.id, content);
+ }
+ }
+ Node::Internal(node) => {
+ // Load the content from disk
+ let mut content = load_internal_node(node.id);
+ // Insert
+ Node::apply_messages_to_internal(&mut content, msgs);
+ // Check if we need to flush - in the future, we might want to
+ // do something smarter to compute the number of messages
+ let num_msgs = content.len();
+ if num_msgs >= params.min_flush_size {
+ content = node.flush(params, node_id_cnt, content);
+ }
+ // Store the content to disk
+ store_internal_node(node.id, content)
+ }
+ }
+ }
+
+ /// Lookup a value in a list of bindings.
+ /// Note that the values should be stored in order of increasing key.
+ fn lookup_in_bindings(key: Key, bindings: &Map<Key, Value>) -> Option<Value> {
+ match bindings {
+ List::Nil => Option::None,
+ List::Cons(hd, tl) => {
+ if hd.0 == key {
+ Option::Some(hd.1)
+ } else if hd.0 > key {
+ Option::None
+ } else {
+ Node::lookup_in_bindings(key, tl)
+ }
+ }
+ }
+ }
+
+ /// Lookup a value in a list of bindings, and return a borrow to the position
+ /// where the value is (or should be inserted, if the key is not in the bindings).
+ fn lookup_mut_in_bindings<'a>(
+ key: Key,
+ bindings: &'a mut Map<Key, Value>,
+ ) -> &'a mut Map<Key, Value> {
+ match bindings {
+ List::Nil => bindings,
+ List::Cons(hd, tl) => {
+ // This requires Polonius
+ if hd.0 >= key {
+ bindings
+ } else {
+ Node::lookup_mut_in_bindings(key, tl)
+ }
+ }
+ }
+ }
+
+ /// Filter all the messages which concern [key].
+ ///
+ /// Note that the stack of messages must start with a message for [key]:
+ /// we stop filtering at the first message which is not about [key].
+ fn filter_messages_for_key<'a>(key: Key, msgs: &'a mut Map<Key, Message>) {
+ match msgs {
+ List::Nil => (),
+ List::Cons((k, _), _) => {
+ if *k == key {
+ msgs.pop_front();
+ Node::filter_messages_for_key(key, msgs);
+ } else {
+ // Stop
+ ()
+ }
+ }
+ }
+ }
+
+ fn lookup_first_message_after_key<'a>(
+ key: Key,
+ msgs: &'a mut Map<Key, Message>,
+ ) -> &'a mut Map<Key, Message> {
+ match msgs {
+ List::Nil => msgs,
+ List::Cons((k, _), next_msgs) => {
+ if *k == key {
+ Node::lookup_first_message_after_key(key, next_msgs)
+ } else {
+ msgs
+ }
+ }
+ }
+ }
+
+ /// Returns the value bound to a key.
+ /// Note that while looking for the binding, we might reorganize the
+ /// internals of the betree to apply or flush messages: hence the mutable
+ /// borrow.
+ fn lookup<'a>(&'a mut self, key: Key) -> Option<Value> {
+ match self {
+ Node::Leaf(node) => {
+ // Load the node content
+ let bindings = load_leaf_node(node.id);
+ // Just lookup the binding in the map
+ Node::lookup_in_bindings(key, &bindings)
+ }
+ Node::Internal(node) => {
+ // Load the node content
+ let mut msgs = load_internal_node(node.id);
+ // Look for the first message pending for the key.
+ // Note that we maintain the following invariants:
+ // - if there are > 1 messages, they must be upsert messages only
+ // - the upsert messages are sorted from the *first* added to the
+ // *last* added to the betree.
+ // Also note that if there are upsert messages, we have to apply
+ // them immediately.
+ //
+ // Rk.: [lookup_first_message_for_key] below returns a borrow to
+ // the portion of the list we will update (if we have upserts,
+ // we will apply the messages, filter them while doing so,
+ // insert an [Insert] message, etc.). Should be interesting
+ // to see how the proof experience with the backward functions
+ // is at this for this piece of code. Note that this was inpired
+ // by Be-Tree.
+ // Also, can't wait to see how all this will work with loops.
+ let pending = Node::lookup_first_message_for_key(key, &mut msgs);
+ match pending {
+ List::Nil => {
+ // Nothing: dive into the children
+ node.lookup_in_children(key)
+ }
+ List::Cons((k, msg), _) => {
+ // Check if the borrow which points inside the messages
+ // stack points to a message for [key]
+ if *k != key {
+ // Note the same key: dive into the children
+ node.lookup_in_children(key)
+ } else {
+ // Same key: match over the message for this key
+ match msg {
+ Message::Insert(v) => Some(*v),
+ Message::Delete => None,
+ Message::Upsert(_) => {
+ // There are pending upserts: we have no choice but to
+ // apply them.
+ //
+ // Rk.: rather than calling [lookup], we could actually
+ // go down the tree accumulating upserts. On the other
+ // hand, the key is now "hotter", so it is not a bad
+ // idea to keep it as close to the root as possible.
+ // Note that what we do is what Be-Tree does.
+ //
+ // First, lookup the value from the children.
+ let v = node.lookup_in_children(key);
+ // Apply the pending updates, and replace them with
+ // an [Insert] containing the updated value.
+ //
+ // Rk.: Be-Tree doesn't seem to store the newly computed
+ // value, which I don't understand.
+ let v = Node::apply_upserts(pending, v, key);
+ // Update the node content
+ store_internal_node(node.id, msgs);
+ // Return the value
+ Option::Some(v)
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+
+ /// Return a mutable borrow to the first message whose key is <= than [key].
+ /// If the key is [key], then it is the first message about [key].
+ /// Otherwise, it gives us a mutable borrow to the place where we need
+ /// to insert new messages (note that the borrow may point to the end
+ /// of the list).
+ fn lookup_first_message_for_key<'a>(
+ key: Key,
+ msgs: &'a mut Map<Key, Message>,
+ ) -> &'a mut Map<Key, Message> {
+ match msgs {
+ List::Nil => msgs,
+ List::Cons(x, next_msgs) => {
+ // Rk.: we need Polonius here
+ // We wouldn't need Polonius if directly called the proper
+ // function to make the modifications here (because we wouldn't
+ // need to return anything). However, it would not be very
+ // idiomatic, especially with regards to the fact that we will
+ // rewrite everything with loops at some point.
+ if x.0 >= key {
+ msgs
+ } else {
+ Node::lookup_first_message_for_key(key, next_msgs)
+ }
+ }
+ }
+ }
+
+ /// Apply the upserts from the current messages stack to a looked up value.
+ ///
+ /// The input mutable borrow must point to the first upsert message in the
+ /// messages stack of the current node. We remove the messages from the stack
+ /// while applying them.
+ /// Note that if there are no more upserts to apply, then the value must be
+ /// `Some`. Also note that we use the invariant that in the message stack,
+ /// upsert messages are sorted from the first to the last to apply.
+ fn apply_upserts(msgs: &mut Map<Key, Message>, prev: Option<Value>, key: Key) -> Value {
+ if msgs.head_has_key(key) {
+ // Pop the front message.
+ // Note that it *must* be an upsert.
+ let msg = msgs.pop_front();
+ match msg.1 {
+ Message::Upsert(s) => {
+ // Apply the update
+ let v = upsert_update(prev, s);
+ let prev = Option::Some(v);
+ // Continue
+ Node::apply_upserts(msgs, prev, key)
+ }
+ _ => {
+ // Unreachable: we can only have [Upsert] messages
+ // for the key
+ unreachable!();
+ }
+ }
+ } else {
+ // We applied all the upsert messages: simply put an [Insert]
+ // message and return the value.
+ let v = prev.unwrap();
+ msgs.push_front((key, Message::Insert(v)));
+ return v;
+ }
+ }
+}
+
+impl BeTree {
+ pub fn new(min_flush_size: u64, split_size: u64) -> Self {
+ let mut node_id_cnt = NodeIdCounter::new();
+ let id = node_id_cnt.fresh_id();
+ let root = Node::Leaf(Leaf { id, size: 0 });
+ store_leaf_node(id, List::Nil);
+ let params = Params {
+ min_flush_size,
+ split_size,
+ };
+ BeTree {
+ params,
+ node_id_cnt,
+ root,
+ }
+ }
+
+ /// Apply a message to the tree.
+ ///
+ /// This is an auxiliary function.
+ fn apply(&mut self, key: Key, msg: Message) {
+ self.root
+ .apply(&self.params, &mut self.node_id_cnt, key, msg)
+ }
+
+ /// Insert a binding from [key] to [value]
+ pub fn insert(&mut self, key: Key, value: Value) {
+ let msg = Message::Insert(value);
+ self.apply(key, msg);
+ }
+
+ /// Delete the bindings for [key]
+ pub fn delete(&mut self, key: Key) {
+ let msg = Message::Delete;
+ self.apply(key, msg);
+ }
+
+ /// Apply a query-update
+ pub fn upsert(&mut self, key: Key, upd: UpsertFunState) {
+ let msg = Message::Upsert(upd);
+ self.apply(key, msg);
+ }
+
+ /// Returns the value bound to a key.
+ /// Note that while looking for the binding, we might reorganize the
+ /// internals of the betree to apply or flush messages: hence the mutable
+ /// borrow.
+ pub fn lookup<'a>(&'a mut self, key: Key) -> Option<Value> {
+ self.root.lookup(key)
+ }
+}
+
+#[cfg(test)]
+mod tests {
+ use crate::betree::*;
+ use std::collections::HashMap;
+ use std::fmt::{Display, Error, Formatter};
+ use std::vec::Vec;
+
+ struct Maps {
+ betree: BeTree,
+ refmap: HashMap<Key, Value>,
+ }
+
+ impl Maps {
+ fn insert(&mut self, k: Key, v: Value) {
+ log::trace!("insert: {} -> {}", k, v);
+ self.betree.insert(k, v);
+ self.refmap.insert(k, v);
+ }
+
+ fn delete(&mut self, k: Key) {
+ log::trace!("delete: {}", k);
+ self.betree.delete(k);
+ self.refmap.remove(&k);
+ }
+
+ /// This function doesn't return a value: it simply checks that the
+ /// b-epsilon tree and the reference map have the same bindings.
+ fn lookup(&mut self, k: Key) {
+ let v0 = self.betree.lookup(k);
+ let v1 = self.refmap.get(&k).map(|x| *x);
+ log::trace!("lookup {k}: betree: {:?}, ref: {:?}", v0, v1);
+ assert!(v0 == v1);
+ }
+
+ /// Only testing the addition (the choice of the update function doesn't
+ /// make much difference)
+ fn upsert(&mut self, k: Key, v: Value) {
+ log::trace!("upsert: {} -> add({})", k, v);
+ self.betree.upsert(k, UpsertFunState::Add(v));
+ let prev = self.refmap.get(&k).map(|x| *x);
+ let nv = upsert_update(prev, UpsertFunState::Add(v));
+ self.refmap.insert(k, nv);
+ }
+
+ /// Check that all the bindings in the betree give the same result as the
+ /// reference.
+ ///
+ /// Rk.: looking up actually updates the b-epsilon tree.
+ fn check_equal(&mut self) {
+ let keys: Vec<Key> = self.refmap.keys().map(|k| *k).collect();
+ for k in keys {
+ self.lookup(k);
+ }
+ }
+ }
+
+ impl Display for Map<Key, Value> {
+ fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error> {
+ match self {
+ List::Nil => write!(f, ""),
+ List::Cons(hd, tl) => {
+ write!(f, "{} -> {}, ", hd.0, hd.1).unwrap();
+ tl.fmt(f)
+ }
+ }
+ }
+ }
+
+ impl Display for UpsertFunState {
+ fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error> {
+ match self {
+ UpsertFunState::Add(v) => write!(f, "add({})", v),
+ UpsertFunState::Sub(v) => write!(f, "sub({})", v),
+ }
+ }
+ }
+
+ impl Display for Message {
+ fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error> {
+ match self {
+ Message::Insert(v) => write!(f, "insert({})", v),
+ Message::Delete => write!(f, "delete"),
+ Message::Upsert(v) => write!(f, "upsert({})", v),
+ }
+ }
+ }
+
+ impl Display for Map<Key, Message> {
+ fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error> {
+ match self {
+ List::Nil => write!(f, ""),
+ List::Cons(hd, tl) => {
+ write!(f, "{} -> {}, ", hd.0, hd.1).unwrap();
+ tl.fmt(f)
+ }
+ }
+ }
+ }
+
+ impl Node {
+ fn fmt(&self, indent: &String, f: &mut Formatter<'_>) -> Result<(), Error> {
+ match self {
+ Node::Leaf(node) => {
+ let content = load_leaf_node(node.id);
+ write!(f, "{}{}: [{}]", indent, node.id, content)
+ }
+ Node::Internal(node) => {
+ let content = load_internal_node(node.id);
+ let indent1 = format!("{} ", indent).to_string();
+ write!(
+ f,
+ "{}{{\n{}{},\n{}[{}],",
+ indent, indent, node.id, indent, &content
+ )
+ .unwrap();
+ write!(f, "\n{}", indent1).unwrap();
+ node.left.fmt(&indent1, f).unwrap();
+ write!(f, "\n{}", indent1).unwrap();
+ node.right.fmt(&indent1, f).unwrap();
+ write!(f, "\n{}}}", indent)
+ }
+ }
+ }
+ }
+
+ impl Display for BeTree {
+ fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error> {
+ self.root.fmt(&"".to_string(), f)
+ }
+ }
+
+ #[test]
+ fn test1() {
+ // Initialize the logger
+ env_logger::init();
+
+ let mut m = Maps {
+ betree: BeTree::new(5, 5),
+ refmap: HashMap::new(),
+ };
+ let num_keys = 100;
+
+ // Insert bindings
+ for k in 0..num_keys {
+ let v = 2 * k + 1;
+ m.insert(k, v);
+ log::trace!("\n{}", &m.betree);
+ }
+
+ // Make various queries
+ for kb in 0..(10 * num_keys) {
+ let k = kb % num_keys;
+ match k % 4 {
+ 0 => {
+ let v = 3 * k + 2;
+ m.insert(k, v);
+ }
+ 1 => {
+ m.delete(k);
+ }
+ 2 => {
+ let v = kb % 7;
+ m.upsert(k, v);
+ }
+ 3 => {
+ m.lookup(k);
+ }
+ _ => {
+ unreachable!();
+ }
+ }
+ log::trace!("\n{}", &m.betree);
+ }
+
+ // Check that the b-epsilon tree didn't diverge (we check twice,
+ // because looking up performs updates that we also want to test)
+ m.check_equal();
+ m.check_equal();
+ }
+ fn range_insert(tree: &mut BeTree, start: Key, end: Key) {
+ for k in start..end {
+ tree.insert(k, 2 * k + 1);
+ }
+ }
+}
diff --git a/tests/src/betree/src/betree_utils.rs b/tests/src/betree/src/betree_utils.rs
new file mode 100644
index 00000000..fd269f4d
--- /dev/null
+++ b/tests/src/betree/src/betree_utils.rs
@@ -0,0 +1,155 @@
+//! The following module implements utilities for [betree.rs].
+//! Those utilities are only used for serialization/deserialization (we don't
+//! reason about them).
+//!
+//! The issue is that we can't derive serialization/deserialization
+//! implementations directly in betree.rs, otherwise we can't translate.
+//! We could have hacked in Aeneas to skip those implementations, but I'd
+//! rather put a little bit of engineering time into this file, while thinking
+//! about a cleaner way of doing this in general. The following file is not
+//! difficult to write and maintain anyway.
+#![allow(dead_code)]
+
+use crate::betree::{
+ InternalContent, Key, LeafContent, List, Message, NodeId, UpsertFunState, Value,
+};
+use serde::{Deserialize, Serialize};
+use std::fs::File;
+use std::vec::Vec;
+
+/// Note that I tried using Serde's facilities to define serialization/
+/// deserialization functions for external types, but it proved cumbersome
+/// for the betree case.
+#[derive(Serialize, Deserialize)]
+pub enum UpsertFunStateSerde {
+ Add(u64),
+ Sub(u64),
+}
+
+impl UpsertFunStateSerde {
+ fn to_state(self) -> UpsertFunState {
+ match self {
+ UpsertFunStateSerde::Add(v) => UpsertFunState::Add(v),
+ UpsertFunStateSerde::Sub(v) => UpsertFunState::Sub(v),
+ }
+ }
+
+ fn from_state(msg: UpsertFunState) -> Self {
+ match msg {
+ UpsertFunState::Add(v) => UpsertFunStateSerde::Add(v),
+ UpsertFunState::Sub(v) => UpsertFunStateSerde::Sub(v),
+ }
+ }
+}
+
+/// Same remark as for [UpsertFunStateSerde]
+#[derive(Serialize, Deserialize)]
+enum MessageSerde {
+ Insert(Value),
+ Delete,
+ Upsert(UpsertFunStateSerde),
+}
+
+impl MessageSerde {
+ fn to_msg(self) -> Message {
+ match self {
+ MessageSerde::Insert(v) => Message::Insert(v),
+ MessageSerde::Delete => Message::Delete,
+ MessageSerde::Upsert(v) => Message::Upsert(v.to_state()),
+ }
+ }
+
+ fn from_msg(msg: Message) -> Self {
+ match msg {
+ Message::Insert(v) => MessageSerde::Insert(v),
+ Message::Delete => MessageSerde::Delete,
+ Message::Upsert(v) => MessageSerde::Upsert(UpsertFunStateSerde::from_state(v)),
+ }
+ }
+}
+
+// For some reason, I don't manage to make that in an impl...
+pub(crate) fn list_from_vec<T>(mut v: Vec<T>) -> List<T> {
+ // We need to reverse
+ v.reverse();
+ let mut l = List::Nil;
+ for x in v.into_iter() {
+ l = List::Cons(x, Box::new(l));
+ }
+ l
+}
+
+// For some reason, I don't manage to make that in an impl...
+pub(crate) fn list_to_vec<T>(mut l: List<T>) -> Vec<T> {
+ let mut v = Vec::new();
+ loop {
+ match l {
+ List::Nil => break,
+ List::Cons(hd, tl) => {
+ v.push(hd);
+ l = *tl;
+ }
+ }
+ }
+ v
+}
+
+/// See the equivalent function in betree.rs
+pub(crate) fn load_internal_node(id: NodeId) -> InternalContent {
+ // Open the file
+ std::fs::create_dir_all("tmp").unwrap();
+ let filename = format!("tmp/node{}", id).to_string();
+ // Read
+ let f = File::open(filename).unwrap();
+ // Serde makes things easy
+ let c: Vec<(Key, MessageSerde)> = serde_json::from_reader(&f).unwrap();
+ let c: Vec<(Key, Message)> = c
+ .into_iter()
+ .map(|(key, msg)| (key, msg.to_msg()))
+ .collect();
+ // Convert
+ list_from_vec(c)
+}
+
+/// See the equivalent function in betree.rs
+pub(crate) fn store_internal_node(id: NodeId, content: InternalContent) {
+ // Open the file
+ std::fs::create_dir_all("tmp").unwrap();
+ let filename = format!("tmp/node{}", id).to_string();
+ // Write
+ let f = File::create(filename).unwrap();
+ // Convert
+ let v: Vec<(Key, Message)> = list_to_vec(content);
+ let v: Vec<(Key, MessageSerde)> = v
+ .into_iter()
+ .map(|(k, msg)| (k, MessageSerde::from_msg(msg)))
+ .collect();
+ // Serde makes things easy
+ serde_json::to_writer(&f, &v).unwrap();
+}
+
+/// See the equivalent function in betree.rs
+pub(crate) fn load_leaf_node(id: NodeId) -> LeafContent {
+ // Open the file
+ std::fs::create_dir_all("tmp").unwrap();
+ let filename = format!("tmp/node{}", id).to_string();
+ // Read
+ let f = File::open(filename).unwrap();
+ // Serde makes things easy
+ let c: Vec<(Key, Value)> = serde_json::from_reader(&f).unwrap();
+ // Convert
+ list_from_vec(c)
+}
+
+/// See the equivalent function in betree.rs
+pub(crate) fn store_leaf_node(id: NodeId, content: LeafContent) {
+ // Open the file
+ std::fs::create_dir_all("tmp").unwrap();
+ let filename = format!("tmp/node{}", id).to_string();
+ // Write
+ let f = File::create(filename).unwrap();
+ // Convert
+ let v: Vec<(Key, Value)> = list_to_vec(content);
+ // Serde makes things easy
+ serde_json::to_writer(&f, &v).unwrap();
+}
diff --git a/tests/src/betree/src/main.rs b/tests/src/betree/src/main.rs
new file mode 100644
index 00000000..64e9f7db
--- /dev/null
+++ b/tests/src/betree/src/main.rs
@@ -0,0 +1,4 @@
+mod betree;
+mod betree_utils;
+
+fn main() {}
diff --git a/tests/src/bitwise.rs b/tests/src/bitwise.rs
new file mode 100644
index 00000000..9f48cb04
--- /dev/null
+++ b/tests/src/bitwise.rs
@@ -0,0 +1,27 @@
+//! Exercise the bitwise operations
+
+pub fn shift_u32(a: u32) -> u32 {
+ let i: usize = 16;
+ let mut t = a >> i;
+ t <<= i;
+ t
+}
+
+pub fn shift_i32(a: i32) -> i32 {
+ let i: isize = 16;
+ let mut t = a >> i;
+ t <<= i;
+ t
+}
+
+pub fn xor_u32(a: u32, b: u32) -> u32 {
+ a ^ b
+}
+
+pub fn or_u32(a: u32, b: u32) -> u32 {
+ a | b
+}
+
+pub fn and_u32(a: u32, b: u32) -> u32 {
+ a & b
+}
diff --git a/tests/src/constants.rs b/tests/src/constants.rs
new file mode 100644
index 00000000..83904eed
--- /dev/null
+++ b/tests/src/constants.rs
@@ -0,0 +1,96 @@
+//! Tests with constants
+
+// Integers
+
+pub const X0: u32 = 0;
+
+pub const X1: u32 = u32::MAX;
+
+#[allow(clippy::let_and_return)]
+pub const X2: u32 = {
+ let x = 3;
+ x
+};
+
+pub const X3: u32 = incr(32);
+
+pub const fn incr(n: u32) -> u32 {
+ n + 1
+}
+
+// Pairs
+
+pub const fn mk_pair0(x: u32, y: u32) -> (u32, u32) {
+ (x, y)
+}
+
+pub const fn mk_pair1(x: u32, y: u32) -> Pair<u32, u32> {
+ Pair { x, y }
+}
+
+pub const P0: (u32, u32) = mk_pair0(0, 1);
+pub const P1: Pair<u32, u32> = mk_pair1(0, 1);
+pub const P2: (u32, u32) = (0, 1);
+pub const P3: Pair<u32, u32> = Pair { x: 0, y: 1 };
+
+pub struct Pair<T1, T2> {
+ pub x: T1,
+ pub y: T2,
+}
+
+pub const Y: Wrap<i32> = Wrap::new(2);
+
+pub const fn unwrap_y() -> i32 {
+ Y.value
+}
+
+pub const YVAL: i32 = unwrap_y();
+
+pub struct Wrap<T> {
+ value: T,
+}
+
+impl<T> Wrap<T> {
+ pub const fn new(value: T) -> Wrap<T> {
+ Wrap { value }
+ }
+}
+
+// Additions
+
+pub const fn get_z1() -> i32 {
+ const Z1: i32 = 3;
+ Z1
+}
+
+pub const fn add(a: i32, b: i32) -> i32 {
+ a + b
+}
+
+pub const fn get_z2() -> i32 {
+ add(Q1, add(get_z1(), Q3))
+}
+
+pub const Q1: i32 = 5;
+pub const Q2: i32 = Q1;
+pub const Q3: i32 = add(Q2, 3);
+
+// Static
+
+pub static S1: u32 = 6;
+pub static S2: u32 = incr(S1);
+pub static S3: Pair<u32, u32> = P3;
+pub static S4: Pair<u32, u32> = mk_pair1(7, 8);
+
+// Constants with generics
+pub struct V<const N: usize, T> {
+ pub x: [T; N],
+}
+
+impl<const N: usize, T> V<N, T> {
+ pub const LEN: usize = N;
+}
+
+pub fn use_v<const N: usize, T>() -> usize {
+ V::<N, T>::LEN
+}
diff --git a/tests/src/demo.rs b/tests/src/demo.rs
new file mode 100644
index 00000000..bc74cc8b
--- /dev/null
+++ b/tests/src/demo.rs
@@ -0,0 +1,111 @@
+#![allow(clippy::needless_lifetimes)]
+
+/* Simple functions */
+
+pub fn choose<'a, T>(b: bool, x: &'a mut T, y: &'a mut T) -> &'a mut T {
+ if b {
+ x
+ } else {
+ y
+ }
+}
+
+pub fn mul2_add1(x: u32) -> u32 {
+ (x + x) + 1
+}
+
+pub fn use_mul2_add1(x: u32, y: u32) -> u32 {
+ mul2_add1(x) + y
+}
+
+pub fn incr<'a>(x: &'a mut u32) {
+ *x += 1;
+}
+
+pub fn use_incr() {
+ let mut x = 0;
+ incr(&mut x);
+ incr(&mut x);
+ incr(&mut x);
+}
+
+/* Recursion, loops */
+
+pub enum CList<T> {
+ CCons(T, Box<CList<T>>),
+ CNil,
+}
+
+pub fn list_nth<'a, T>(l: &'a CList<T>, i: u32) -> &'a T {
+ match l {
+ CList::CCons(x, tl) => {
+ if i == 0 {
+ x
+ } else {
+ list_nth(tl, i - 1)
+ }
+ }
+ CList::CNil => {
+ panic!()
+ }
+ }
+}
+
+pub fn list_nth_mut<'a, T>(l: &'a mut CList<T>, i: u32) -> &'a mut T {
+ match l {
+ CList::CCons(x, tl) => {
+ if i == 0 {
+ x
+ } else {
+ list_nth_mut(tl, i - 1)
+ }
+ }
+ CList::CNil => {
+ panic!()
+ }
+ }
+}
+
+pub fn list_nth_mut1<'a, T>(mut l: &'a mut CList<T>, mut i: u32) -> &'a mut T {
+ while let CList::CCons(x, tl) = l {
+ if i == 0 {
+ return x;
+ }
+ i -= 1;
+ l = tl;
+ }
+ panic!()
+}
+
+pub fn i32_id(i: i32) -> i32 {
+ if i == 0 {
+ 0
+ } else {
+ i32_id(i - 1) + 1
+ }
+}
+
+pub fn list_tail<'a, T>(l: &'a mut CList<T>) -> &'a mut CList<T> {
+ match l {
+ CList::CCons(_, tl) => list_tail(tl),
+ CList::CNil => l,
+ }
+}
+
+/* Traits */
+
+pub trait Counter {
+ fn incr(&mut self) -> usize;
+}
+
+impl Counter for usize {
+ fn incr(&mut self) -> usize {
+ let x = *self;
+ *self += 1;
+ x
+ }
+}
+
+pub fn use_counter<'a, T: Counter>(cnt: &'a mut T) -> usize {
+ cnt.incr()
+}
diff --git a/tests/src/external.rs b/tests/src/external.rs
new file mode 100644
index 00000000..521749d6
--- /dev/null
+++ b/tests/src/external.rs
@@ -0,0 +1,11 @@
+//! This module uses external types and functions
+
+use std::cell::Cell;
+
+pub fn use_get(rc: &Cell<u32>) -> u32 {
+ rc.get()
+}
+
+pub fn incr(rc: &mut Cell<u32>) {
+ *rc.get_mut() += 1;
+}
diff --git a/tests/src/hashmap.rs b/tests/src/hashmap.rs
new file mode 100644
index 00000000..58d22acd
--- /dev/null
+++ b/tests/src/hashmap.rs
@@ -0,0 +1,352 @@
+//! A hashmap implementation.
+//!
+//! Current limitations:
+//! - all the recursive functions should be rewritten with loops, once
+//! we have support for this.
+//! - we will need function pointers/closures if we want to make the map
+//! generic in the key type (having function pointers allows to mimic traits)
+//! - for the "get" functions: we don't support borrows inside of enumerations
+//! for now, so we can't return a type like `Option<&T>`. The real restriction
+//! we currently have on borrows is that we forbid *nested* borrows in function
+//! signatures, like in `&'a mut &'b mut T` (and the real problem comes from
+//! nested *lifetimes*, not nested borrows). Getting the borrows inside of
+//! enumerations mostly requires to pour some implementation time in it.
+
+use std::vec::Vec;
+pub type Key = usize; // TODO: make this generic
+pub type Hash = usize;
+
+pub enum List<T> {
+ Cons(Key, T, Box<List<T>>),
+ Nil,
+}
+
+/// A hash function for the keys.
+/// Rk.: we use shared references because we anticipate on the generic
+/// hash map version.
+pub fn hash_key(k: &Key) -> Hash {
+ // Do nothing for now, we might want to implement something smarter
+ // in the future, or to call an external function (which will be
+ // abstract): we don't need to reason about the hash function.
+ *k
+}
+
+/// A hash map from [u64] to values
+pub struct HashMap<T> {
+ /// The current number of entries in the table
+ num_entries: usize,
+ /// The max load factor, expressed as a fraction
+ max_load_factor: (usize, usize),
+ /// The max load factor applied to the current table length:
+ /// gives the threshold at which to resize the table.
+ max_load: usize,
+ /// The table itself
+ slots: Vec<List<T>>,
+}
+
+impl<T> HashMap<T> {
+ /// Allocate a vector of slots of a given size.
+ /// We would need a loop, but can't use loops for now...
+ fn allocate_slots(mut slots: Vec<List<T>>, mut n: usize) -> Vec<List<T>> {
+ while n > 0 {
+ slots.push(List::Nil);
+ n -= 1;
+ }
+ slots
+ }
+
+ /// Create a new table, with a given capacity
+ fn new_with_capacity(
+ capacity: usize,
+ max_load_dividend: usize,
+ max_load_divisor: usize,
+ ) -> Self {
+ // TODO: better to use `Vec::with_capacity(capacity)` instead
+ // of `Vec::new()`
+ let slots = HashMap::allocate_slots(Vec::new(), capacity);
+ HashMap {
+ num_entries: 0,
+ max_load_factor: (max_load_dividend, max_load_divisor),
+ max_load: (capacity * max_load_dividend) / max_load_divisor,
+ slots,
+ }
+ }
+
+ pub fn new() -> Self {
+ // For now we create a table with 32 slots and a max load factor of 4/5
+ HashMap::new_with_capacity(32, 4, 5)
+ }
+
+ pub fn clear(&mut self) {
+ self.num_entries = 0;
+ let slots = &mut self.slots;
+ let mut i = 0;
+ while i < slots.len() {
+ slots[i] = List::Nil;
+ i += 1;
+ }
+ }
+
+ pub fn len(&self) -> usize {
+ self.num_entries
+ }
+
+ /// Insert in a list.
+ /// Return `true` if we inserted an element, `false` if we simply updated
+ /// a value.
+ fn insert_in_list(key: Key, value: T, mut ls: &mut List<T>) -> bool {
+ loop {
+ match ls {
+ List::Nil => {
+ *ls = List::Cons(key, value, Box::new(List::Nil));
+ return true;
+ }
+ List::Cons(ckey, cvalue, tl) => {
+ if *ckey == key {
+ *cvalue = value;
+ return false;
+ } else {
+ ls = tl;
+ }
+ }
+ }
+ }
+ }
+
+ /// Auxiliary function to insert in the hashmap without triggering a resize
+ fn insert_no_resize(&mut self, key: Key, value: T) {
+ let hash = hash_key(&key);
+ let hash_mod = hash % self.slots.len();
+ // We may want to use slots[...] instead of get_mut...
+ let inserted = HashMap::insert_in_list(key, value, &mut self.slots[hash_mod]);
+ if inserted {
+ self.num_entries += 1;
+ }
+ }
+
+ /// Insertion function.
+ /// May trigger a resize of the hash table.
+ pub fn insert(&mut self, key: Key, value: T) {
+ // Insert
+ self.insert_no_resize(key, value);
+ // Resize if necessary
+ if self.len() > self.max_load {
+ self.try_resize()
+ }
+ }
+
+ /// The resize function, called if we need to resize the table after
+ /// an insertion.
+ fn try_resize(&mut self) {
+ // Check that we can resize: we need to check that there are no overflows.
+ // Note that we are conservative about the usize::MAX.
+ // Also note that `as usize` is a trait, but we apply it to a constant
+ // here, which gets compiled by the MIR interpreter (so we don't see
+ // the conversion, actually).
+ // Rk.: this is a hit heavy...
+ let max_usize = u32::MAX as usize;
+ let capacity = self.slots.len();
+ // Checking that there won't be overflows by using the fact that, if m > 0:
+ // n * m <= p <==> n <= p / m
+ let n1 = max_usize / 2;
+ if capacity <= n1 / self.max_load_factor.0 {
+ // Create a new table with a higher capacity
+ let mut ntable = HashMap::new_with_capacity(
+ capacity * 2,
+ self.max_load_factor.0,
+ self.max_load_factor.1,
+ );
+
+ // Move the elements to the new table
+ HashMap::move_elements(&mut ntable, &mut self.slots, 0);
+
+ // Replace the current table with the new table
+ self.slots = ntable.slots;
+ self.max_load = ntable.max_load;
+ }
+ }
+
+ /// Auxiliary function called by [try_resize] to move all the elements
+ /// from the table to a new table
+ fn move_elements<'a>(ntable: &'a mut HashMap<T>, slots: &'a mut Vec<List<T>>, mut i: usize) {
+ while i < slots.len() {
+ // Move the elements out of the slot i
+ let ls = std::mem::replace(&mut slots[i], List::Nil);
+ // Move all those elements to the new table
+ HashMap::move_elements_from_list(ntable, ls);
+ // Do the same for slot i+1
+ i += 1;
+ }
+ }
+
+ /// Auxiliary function.
+ fn move_elements_from_list(ntable: &mut HashMap<T>, mut ls: List<T>) {
+ // As long as there are elements in the list, move them
+ loop {
+ match ls {
+ List::Nil => return, // We're done
+ List::Cons(k, v, tl) => {
+ // Insert the element in the new table
+ ntable.insert_no_resize(k, v);
+ // Move the elements out of the tail
+ ls = *tl;
+ }
+ }
+ }
+ }
+
+ /// Returns `true` if the map contains a value for the specified key.
+ pub fn contains_key(&self, key: &Key) -> bool {
+ let hash = hash_key(key);
+ let hash_mod = hash % self.slots.len();
+ HashMap::contains_key_in_list(key, &self.slots[hash_mod])
+ }
+
+ /// Returns `true` if the list contains a value for the specified key.
+ pub fn contains_key_in_list(key: &Key, mut ls: &List<T>) -> bool {
+ loop {
+ match ls {
+ List::Nil => return false,
+ List::Cons(ckey, _, tl) => {
+ if *ckey == *key {
+ return true;
+ } else {
+ ls = tl;
+ }
+ }
+ }
+ }
+ }
+
+ /// We don't support borrows inside of enumerations for now, so we
+ /// can't return an option...
+ /// TODO: add support for that
+ fn get_in_list<'a, 'k>(key: &'k Key, mut ls: &'a List<T>) -> &'a T {
+ loop {
+ match ls {
+ List::Nil => panic!(),
+ List::Cons(ckey, cvalue, tl) => {
+ if *ckey == *key {
+ return cvalue;
+ } else {
+ ls = tl;
+ }
+ }
+ }
+ }
+ }
+
+ pub fn get<'a, 'k>(&'a self, key: &'k Key) -> &'a T {
+ let hash = hash_key(key);
+ let hash_mod = hash % self.slots.len();
+ HashMap::get_in_list(key, &self.slots[hash_mod])
+ }
+
+ pub fn get_mut_in_list<'a, 'k>(mut ls: &'a mut List<T>, key: &'k Key) -> &'a mut T {
+ while let List::Cons(ckey, cvalue, tl) = ls {
+ if *ckey == *key {
+ return cvalue;
+ } else {
+ ls = tl;
+ }
+ }
+ panic!()
+ }
+
+ /// Same remark as for [get].
+ pub fn get_mut<'a, 'k>(&'a mut self, key: &'k Key) -> &'a mut T {
+ let hash = hash_key(key);
+ let hash_mod = hash % self.slots.len();
+ HashMap::get_mut_in_list(&mut self.slots[hash_mod], key)
+ }
+
+ /// Remove an element from the list.
+ /// Return the removed element.
+ fn remove_from_list(key: &Key, mut ls: &mut List<T>) -> Option<T> {
+ loop {
+ match ls {
+ List::Nil => return None,
+ // We have to use a guard and split the Cons case into two
+ // branches, otherwise the borrow checker is not happy.
+ List::Cons(ckey, _, _) if *ckey == *key => {
+ // We have to move under borrows, so we need to use
+ // [std::mem::replace] in several steps.
+ // Retrieve the tail
+ let mv_ls = std::mem::replace(ls, List::Nil);
+ match mv_ls {
+ List::Nil => unreachable!(),
+ List::Cons(_, cvalue, tl) => {
+ // Make the list equal to its tail
+ *ls = *tl;
+ // Return the dropped value
+ return Some(cvalue);
+ }
+ }
+ }
+ List::Cons(_, _, tl) => {
+ ls = tl;
+ }
+ }
+ }
+ }
+
+ /// Same remark as for [get].
+ pub fn remove(&mut self, key: &Key) -> Option<T> {
+ let hash = hash_key(key);
+ let hash_mod = hash % self.slots.len();
+
+ let x = HashMap::remove_from_list(key, &mut self.slots[hash_mod]);
+ match x {
+ Option::None => Option::None,
+ Option::Some(x) => {
+ self.num_entries -= 1;
+ Option::Some(x)
+ }
+ }
+ }
+}
+
+/// I currently can't retrieve functions marked with the attribute #[test],
+/// while I want to extract the unit tests and use the normalize on them,
+/// so I have to define the test functions somewhere and call them from
+/// a test function.
+/// TODO: find a way to do that.
+#[allow(dead_code)]
+fn test1() {
+ let mut hm: HashMap<u64> = HashMap::new();
+ hm.insert(0, 42);
+ hm.insert(128, 18);
+ hm.insert(1024, 138);
+ hm.insert(1056, 256);
+ // Rk.: `&128` introduces a ref constant value
+ // TODO: add support for this
+ // Rk.: this only happens if we query the MIR too late (for instance,
+ // the optimized MIR). It is not a problem if we query, say, the
+ // "built" MIR.
+ let k = 128;
+ assert!(*hm.get(&k) == 18);
+ let k = 1024;
+ let x = hm.get_mut(&k);
+ *x = 56;
+ assert!(*hm.get(&k) == 56);
+ let x = hm.remove(&k);
+ // If we write `x == Option::Some(56)` rust introduces
+ // a call to `core::cmp::PartialEq::eq`, which is a trait
+ // I don't support for now.
+ // Also, I haven't implemented support for `unwrap` yet...
+ match x {
+ Option::None => panic!(),
+ Option::Some(x) => assert!(x == 56),
+ };
+ let k = 0;
+ assert!(*hm.get(&k) == 42);
+ let k = 128;
+ assert!(*hm.get(&k) == 18);
+ let k = 1056;
+ assert!(*hm.get(&k) == 256);
+}
+
+#[test]
+fn tests() {
+ test1();
+}
diff --git a/tests/src/hashmap_main.rs b/tests/src/hashmap_main.rs
new file mode 100644
index 00000000..45dfa6e2
--- /dev/null
+++ b/tests/src/hashmap_main.rs
@@ -0,0 +1,16 @@
+mod hashmap;
+mod hashmap_utils;
+
+use crate::hashmap::*;
+use crate::hashmap_utils::*;
+
+pub fn insert_on_disk(key: Key, value: u64) {
+ // Deserialize
+ let mut hm = deserialize();
+ // Update
+ hm.insert(key, value);
+ // Serialize
+ serialize(hm);
+}
+
+pub fn main() {}
diff --git a/tests/src/hashmap_utils.rs b/tests/src/hashmap_utils.rs
new file mode 100644
index 00000000..cd7b481f
--- /dev/null
+++ b/tests/src/hashmap_utils.rs
@@ -0,0 +1,12 @@
+use crate::hashmap::*;
+
+/// Serialize a hash map - we don't have traits, so we fix the type of the
+/// values (this is not the interesting part anyway)
+pub(crate) fn serialize(_hm: HashMap<u64>) {
+ unimplemented!();
+}
+/// Deserialize a hash map - we don't have traits, so we fix the type of the
+/// values (this is not the interesting part anyway)
+pub(crate) fn deserialize() -> HashMap<u64> {
+ unimplemented!();
+}
diff --git a/tests/src/loops.rs b/tests/src/loops.rs
new file mode 100644
index 00000000..2f71d75b
--- /dev/null
+++ b/tests/src/loops.rs
@@ -0,0 +1,366 @@
+use std::vec::Vec;
+
+/// No borrows
+pub fn sum(max: u32) -> u32 {
+ let mut i = 0;
+ let mut s = 0;
+ while i < max {
+ s += i;
+ i += 1;
+ }
+
+ s *= 2;
+ s
+}
+
+/// Same as [sum], but we use borrows in order tocreate loans inside a loop
+/// iteration, and those borrows will have to be ended by the end of the
+/// iteration.
+pub fn sum_with_mut_borrows(max: u32) -> u32 {
+ let mut i = 0;
+ let mut s = 0;
+ while i < max {
+ let ms = &mut s;
+ *ms += i;
+ let mi = &mut i;
+ *mi += 1;
+ }
+
+ s *= 2;
+ s
+}
+
+/// Similar to [sum_with_mut_borrows].
+pub fn sum_with_shared_borrows(max: u32) -> u32 {
+ let mut i = 0;
+ let mut s = 0;
+ while i < max {
+ i += 1;
+ // We changed the order compared to [sum_with_mut_borrows]:
+ // we want to have a shared borrow surviving until the end
+ // of the iteration.
+ let mi = &i;
+ s += *mi;
+ }
+
+ s *= 2;
+ s
+}
+
+pub fn sum_array<const N: usize>(a: [u32; N]) -> u32 {
+ let mut i = 0;
+ let mut s = 0;
+ while i < N {
+ s += a[i];
+ i += 1;
+ }
+ s
+}
+
+/// This case is interesting, because the fixed point for the loop doesn't
+/// introduce new abstractions.
+pub fn clear(v: &mut Vec<u32>) {
+ let mut i = 0;
+ while i < v.len() {
+ v[i] = 0;
+ i += 1;
+ }
+}
+
+pub enum List<T> {
+ Cons(T, Box<List<T>>),
+ Nil,
+}
+
+/// The parameter `x` is a borrow on purpose
+pub fn list_mem(x: &u32, mut ls: &List<u32>) -> bool {
+ while let List::Cons(y, tl) = ls {
+ if *y == *x {
+ return true;
+ } else {
+ ls = tl;
+ }
+ }
+ false
+}
+
+/// Same as [list_nth_mut] but with a loop
+pub fn list_nth_mut_loop<T>(mut ls: &mut List<T>, mut i: u32) -> &mut T {
+ while let List::Cons(x, tl) = ls {
+ if i == 0 {
+ return x;
+ } else {
+ ls = tl;
+ i -= 1;
+ }
+ }
+ panic!()
+}
+
+/// Same as [list_nth_mut_loop] but with shared borrows
+pub fn list_nth_shared_loop<T>(mut ls: &List<T>, mut i: u32) -> &T {
+ while let List::Cons(x, tl) = ls {
+ if i == 0 {
+ return x;
+ } else {
+ ls = tl;
+ i -= 1;
+ }
+ }
+ panic!()
+}
+
+pub fn get_elem_mut(slots: &mut Vec<List<usize>>, x: usize) -> &mut usize {
+ let mut ls = &mut slots[0];
+ loop {
+ match ls {
+ List::Nil => panic!(),
+ List::Cons(y, tl) => {
+ if *y == x {
+ return y;
+ } else {
+ ls = tl;
+ }
+ }
+ }
+ }
+}
+
+pub fn get_elem_shared(slots: &Vec<List<usize>>, x: usize) -> &usize {
+ let mut ls = &slots[0];
+ loop {
+ match ls {
+ List::Nil => panic!(),
+ List::Cons(y, tl) => {
+ if *y == x {
+ return y;
+ } else {
+ ls = tl;
+ }
+ }
+ }
+ }
+}
+
+pub fn id_mut<T>(ls: &mut List<T>) -> &mut List<T> {
+ ls
+}
+
+pub fn id_shared<T>(ls: &List<T>) -> &List<T> {
+ ls
+}
+
+/// Small variation of [list_nth_mut_loop]
+pub fn list_nth_mut_loop_with_id<T>(ls: &mut List<T>, mut i: u32) -> &mut T {
+ let mut ls = id_mut(ls);
+ while let List::Cons(x, tl) = ls {
+ if i == 0 {
+ return x;
+ } else {
+ ls = tl;
+ i -= 1;
+ }
+ }
+ panic!()
+}
+
+/// Small variation of [list_nth_shared_loop]
+pub fn list_nth_shared_loop_with_id<T>(ls: &List<T>, mut i: u32) -> &T {
+ let mut ls = id_shared(ls);
+ while let List::Cons(x, tl) = ls {
+ if i == 0 {
+ return x;
+ } else {
+ ls = tl;
+ i -= 1;
+ }
+ }
+ panic!()
+}
+
+/// Same as [list_nth_mut] but on a pair of lists.
+///
+/// This test checks that we manage to decompose a loop into disjoint regions.
+pub fn list_nth_mut_loop_pair<'a, 'b, T>(
+ mut ls0: &'a mut List<T>,
+ mut ls1: &'b mut List<T>,
+ mut i: u32,
+) -> (&'a mut T, &'b mut T) {
+ loop {
+ match (ls0, ls1) {
+ (List::Nil, _) | (_, List::Nil) => {
+ panic!()
+ }
+ (List::Cons(x0, tl0), List::Cons(x1, tl1)) => {
+ if i == 0 {
+ return (x0, x1);
+ } else {
+ ls0 = tl0;
+ ls1 = tl1;
+ i -= 1;
+ }
+ }
+ }
+ }
+}
+
+/// Same as [list_nth_mut_loop_pair] but with shared borrows.
+pub fn list_nth_shared_loop_pair<'a, 'b, T>(
+ mut ls0: &'a List<T>,
+ mut ls1: &'b List<T>,
+ mut i: u32,
+) -> (&'a T, &'b T) {
+ loop {
+ match (ls0, ls1) {
+ (List::Nil, _) | (_, List::Nil) => {
+ panic!()
+ }
+ (List::Cons(x0, tl0), List::Cons(x1, tl1)) => {
+ if i == 0 {
+ return (x0, x1);
+ } else {
+ ls0 = tl0;
+ ls1 = tl1;
+ i -= 1;
+ }
+ }
+ }
+ }
+}
+
+/// Same as [list_nth_mut_loop_pair] but this time we force the two loop
+/// regions to be merged.
+pub fn list_nth_mut_loop_pair_merge<'a, T>(
+ mut ls0: &'a mut List<T>,
+ mut ls1: &'a mut List<T>,
+ mut i: u32,
+) -> (&'a mut T, &'a mut T) {
+ while let (List::Cons(x0, tl0), List::Cons(x1, tl1)) = (ls0, ls1) {
+ if i == 0 {
+ return (x0, x1);
+ } else {
+ ls0 = tl0;
+ ls1 = tl1;
+ i -= 1;
+ }
+ }
+ panic!()
+}
+
+/// Same as [list_nth_mut_loop_pair_merge] but with shared borrows.
+pub fn list_nth_shared_loop_pair_merge<'a, T>(
+ mut ls0: &'a List<T>,
+ mut ls1: &'a List<T>,
+ mut i: u32,
+) -> (&'a T, &'a T) {
+ while let (List::Cons(x0, tl0), List::Cons(x1, tl1)) = (ls0, ls1) {
+ if i == 0 {
+ return (x0, x1);
+ } else {
+ ls0 = tl0;
+ ls1 = tl1;
+ i -= 1;
+ }
+ }
+ panic!()
+}
+
+/// Mixing mutable and shared borrows.
+pub fn list_nth_mut_shared_loop_pair<'a, 'b, T>(
+ mut ls0: &'a mut List<T>,
+ mut ls1: &'b List<T>,
+ mut i: u32,
+) -> (&'a mut T, &'b T) {
+ while let (List::Cons(x0, tl0), List::Cons(x1, tl1)) = (ls0, ls1) {
+ if i == 0 {
+ return (x0, x1);
+ } else {
+ ls0 = tl0;
+ ls1 = tl1;
+ i -= 1;
+ }
+ }
+ panic!()
+}
+
+/// Same as [list_nth_mut_shared_loop_pair] but this time we force the two loop
+/// regions to be merged.
+pub fn list_nth_mut_shared_loop_pair_merge<'a, T>(
+ mut ls0: &'a mut List<T>,
+ mut ls1: &'a List<T>,
+ mut i: u32,
+) -> (&'a mut T, &'a T) {
+ while let (List::Cons(x0, tl0), List::Cons(x1, tl1)) = (ls0, ls1) {
+ if i == 0 {
+ return (x0, x1);
+ } else {
+ ls0 = tl0;
+ ls1 = tl1;
+ i -= 1;
+ }
+ }
+ panic!()
+}
+
+/// Same as [list_nth_mut_shared_loop_pair], but we switched the positions of
+/// the mutable and shared borrows.
+pub fn list_nth_shared_mut_loop_pair<'a, 'b, T>(
+ mut ls0: &'a List<T>,
+ mut ls1: &'b mut List<T>,
+ mut i: u32,
+) -> (&'a T, &'b mut T) {
+ while let (List::Cons(x0, tl0), List::Cons(x1, tl1)) = (ls0, ls1) {
+ if i == 0 {
+ return (x0, x1);
+ } else {
+ ls0 = tl0;
+ ls1 = tl1;
+ i -= 1;
+ }
+ }
+ panic!()
+}
+
+/// Same as [list_nth_mut_shared_loop_pair_merge], but we switch the positions of
+/// the mutable and shared borrows.
+pub fn list_nth_shared_mut_loop_pair_merge<'a, T>(
+ mut ls0: &'a List<T>,
+ mut ls1: &'a mut List<T>,
+ mut i: u32,
+) -> (&'a T, &'a mut T) {
+ while let (List::Cons(x0, tl0), List::Cons(x1, tl1)) = (ls0, ls1) {
+ if i == 0 {
+ return (x0, x1);
+ } else {
+ ls0 = tl0;
+ ls1 = tl1;
+ i -= 1;
+ }
+ }
+ panic!()
+}
+
+// We do not use the input borrow inside the loop
+#[allow(clippy::empty_loop)]
+pub fn ignore_input_mut_borrow(_a: &mut u32, mut i: u32) {
+ while i > 0 {
+ i -= 1;
+ }
+}
+
+// We do not use the input borrow inside the loop
+#[allow(clippy::empty_loop)]
+pub fn incr_ignore_input_mut_borrow(a: &mut u32, mut i: u32) {
+ *a += 1;
+ while i > 0 {
+ i -= 1;
+ }
+}
+
+// We do not use the input borrow inside the loop
+#[allow(clippy::empty_loop)]
+pub fn ignore_input_shared_borrow(_a: &mut u32, mut i: u32) {
+ while i > 0 {
+ i -= 1;
+ }
+}
diff --git a/tests/src/nested_borrows.rs b/tests/src/nested_borrows.rs
new file mode 100644
index 00000000..94db0cec
--- /dev/null
+++ b/tests/src/nested_borrows.rs
@@ -0,0 +1,181 @@
+//! This module contains functions with nested borrows in their signatures.
+
+pub fn id_mut_mut<'a, 'b, T>(x: &'a mut &'b mut T) -> &'a mut &'b mut T {
+ x
+}
+
+pub fn id_mut_pair<'a, T>(x: &'a mut (&'a mut T, u32)) -> &'a mut (&'a mut T, u32) {
+ x
+}
+
+pub fn id_mut_pair_test1() {
+ let mut x: u32 = 0;
+ let px = &mut x;
+ let mut p = (px, 1);
+ let pp0 = &mut p;
+ let pp1 = id_mut_pair(pp0);
+ let mut y = 2;
+ *pp1 = (&mut y, 3);
+}
+
+pub fn id_mut_mut_pair<'a, T>(
+ x: &'a mut &'a mut (&'a mut T, u32),
+) -> &'a mut &'a mut (&'a mut T, u32) {
+ x
+}
+
+pub fn id_mut_mut_mut_same<'a, T>(x: &'a mut &'a mut &'a mut u32) -> &'a mut &'a mut &'a mut u32 {
+ x
+}
+
+pub fn id_borrow1<'a, 'b, 'c>(_x: &'a mut &'b u32, _y: &'a &'a mut u32) {
+ ()
+}
+
+/// For symbolic execution: testing what happens with several abstractions.
+pub fn id_mut_mut_test1() {
+ let mut x = 0;
+ let mut px = &mut x;
+ let ppx = &mut px;
+ let ppy = id_mut_mut(ppx);
+ **ppy = 1;
+ // Ending one abstraction
+ assert!(*px == 1);
+ // Ending the other abstraction
+ assert!(x == 1);
+}
+
+/*
+/// For symbolic execution: testing what happens with several abstractions.
+/// This case is a bit trickier, because we modify the borrow graph through
+/// a value returned by a function call.
+/// TODO: not supported! We overwrite a borrow in a returned value.
+pub fn id_mut_mut_test2() {
+ let mut x = 0;
+ let mut px = &mut x;
+ let ppx = &mut px;
+ let ppy = id_mut_mut(ppx);
+ **ppy = 1;
+ // This time, we replace one of the borrows
+ let mut y = 2;
+ let py = &mut y;
+ *ppy = py;
+ // Ending one abstraction
+ assert!(*px == 2);
+ *px = 3;
+ // Ending the other abstraction
+ assert!(x == 1);
+ assert!(y == 3);
+}
+*/
+
+/*
+/// For symbolic execution: testing what happens with several abstractions.
+/// See what happens when chaining function calls.
+/// TODO: not supported! We overwrite a borrow in a returned value.
+pub fn id_mut_mut_test3() {
+ let mut x = 0;
+ let mut px = &mut x;
+ let ppx = &mut px;
+ let ppy = id_mut_mut(ppx); // &'a mut &'b mut i32
+ **ppy = 1;
+ let ppz = id_mut_mut(ppy); // &'c mut &'b mut i32
+ **ppz = 2;
+ // End 'a and 'c
+ assert!(*px == 2);
+ // End 'b (2 abstractions at once)
+ assert!(x == 2);
+}*/
+
+/*
+/// For symbolic execution: testing what happens with several abstractions.
+/// See what happens when chaining function calls.
+/// This one is slightly more complex than the previous one.
+pub fn id_mut_mut_test4() {
+ let mut x = 0;
+ let mut px = &mut x;
+ let ppx = &mut px;
+ let ppy = id_mut_mut(ppx); // &'a mut &'b mut i32
+ **ppy = 1;
+ let ppz = id_mut_mut(ppy); // &'c mut &'b mut i32
+ **ppz = 2;
+ // End 'c
+ assert!(**ppy == 2);
+ // End 'a
+ assert!(*px == 2);
+ // End 'b (2 abstractions at once)
+ assert!(x == 2);
+}
+*/
+
+fn id<'a, T>(x: &'a mut T) -> &'a mut T {
+ x
+}
+
+/// Checking projectors over symbolic values
+pub fn test_borrows1() {
+ let mut x = 3;
+ let y = id(&mut x);
+ let z = id(y);
+ // We do not write a statement which would expand `z` on purpose:
+ // we want to test that the handling of non-expanded symbolic values
+ // is correct
+ assert!(x == 3);
+}
+
+fn id_pair<'a, 'b, T>(x: &'a mut T, y: &'b mut T) -> (&'a mut T, &'b mut T) {
+ (x, y)
+}
+
+/// Similar to the previous one
+pub fn test_borrows2() {
+ let mut x = 3;
+ let mut y = 4;
+ let z = id_pair(&mut x, &mut y);
+ // We do not write a statement which would expand `z` on purpose:
+ // we want to test that the handling of non-expanded symbolic values
+ // is correct
+ assert!(x == 3);
+ assert!(y == 4);
+}
+
+/// input type: 'b must last longer than 'a
+/// output type: 'a must last longer than 'b
+/// So: 'a = 'b, and the function is legal.
+pub fn nested_mut_borrows1<'a, 'b>(x: &'a mut &'b mut u32) -> &'b mut &'a mut u32 {
+ x
+}
+
+pub fn nested_shared_borrows1<'a, 'b>(x: &'a &'b u32) -> &'a &'b u32 {
+ x
+}
+
+pub fn nested_borrows1<'a, 'b>(x: &'a mut &'b u32) -> &'a mut &'b u32 {
+ x
+}
+
+pub fn nested_borrows2<'a, 'b>(x: &'a &'b mut u32) -> &'a &'b mut u32 {
+ x
+}
+
+fn nested_borrows1_test1() {
+ let x = 0;
+ let mut px = &x;
+ let ppx = &mut px;
+ let ppy = nested_borrows1(ppx);
+ assert!(**ppy == 0);
+ assert!(x == 0);
+}
+
+fn nested_borrows1_test2<'a, 'b>(x: &'a mut &'b u32) -> &'a mut &'b u32 {
+ nested_borrows1(x)
+}
+
+fn nested_borrows2_test1() {
+ let mut x = 0;
+ let px = &mut x;
+ let ppx = &px;
+ let ppy = nested_borrows2(ppx);
+ assert!(**ppy == 0);
+ assert!(x == 0);
+}
diff --git a/tests/src/no_nested_borrows.rs b/tests/src/no_nested_borrows.rs
new file mode 100644
index 00000000..9a7604e6
--- /dev/null
+++ b/tests/src/no_nested_borrows.rs
@@ -0,0 +1,491 @@
+//! This module doesn't contain **functions which use nested borrows in their
+//! signatures**, and doesn't contain functions with loops.
+
+pub struct Pair<T1, T2> {
+ pub x: T1,
+ pub y: T2,
+}
+
+pub enum List<T> {
+ Cons(T, Box<List<T>>),
+ Nil,
+}
+
+/// Sometimes, enumerations with one variant are not treated
+/// the same way as the other variants (for example, downcasts
+/// are not always introduced).
+/// A downcast is the cast of an enum to a specific variant, like
+/// in the left value of:
+/// `((_0 as Right).0: T2) = move _1;`
+pub enum One<T1> {
+ One(T1),
+}
+
+/// Truely degenerate case
+/// Instantiations of this are encoded as constant values by rust.
+pub enum EmptyEnum {
+ Empty,
+}
+
+/// Enumeration (several variants with no parameters)
+/// Those are not encoded as constant values.
+pub enum Enum {
+ Variant1,
+ Variant2,
+}
+
+/// Degenerate struct
+/// Instanciations of this are encoded as constant values by rust.
+pub struct EmptyStruct {}
+
+pub enum Sum<T1, T2> {
+ Left(T1),
+ Right(T2),
+}
+
+pub fn cast_u32_to_i32(x: u32) -> i32 {
+ x as i32
+}
+
+pub fn cast_bool_to_i32(x: bool) -> i32 {
+ x as i32
+}
+
+#[allow(clippy::unnecessary_cast)]
+pub fn cast_bool_to_bool(x: bool) -> bool {
+ x as bool
+}
+
+#[allow(unused_variables)]
+pub fn test2() {
+ let x: u32 = 23;
+ let y: u32 = 44;
+ let z = x + y;
+ let p: Pair<u32, u32> = Pair { x, y: z };
+ let s: Sum<u32, bool> = Sum::Right(true);
+ let o: One<u64> = One::One(3);
+ let e0 = EmptyEnum::Empty;
+ let e1 = e0;
+ let enum0 = Enum::Variant1;
+}
+
+pub fn get_max(x: u32, y: u32) -> u32 {
+ if x >= y {
+ x
+ } else {
+ y
+ }
+}
+
+pub fn test3() {
+ let x = get_max(4, 3);
+ let y = get_max(10, 11);
+ let z = x + y;
+ assert!(z == 15);
+}
+
+pub fn test_neg1() {
+ let x: i32 = 3;
+ let y = -x;
+ assert!(y == -3);
+}
+
+/// Testing nested references.
+pub fn refs_test1() {
+ let mut x = 0;
+ let mut px = &mut x;
+ let ppx = &mut px;
+ **ppx = 1;
+ // The interesting thing happening here is that the borrow of x is inside
+ // the borrow of px: ending the borrow of x requires ending the borrow of
+ // px first.
+ assert!(x == 1);
+}
+
+pub fn refs_test2() {
+ let mut x = 0;
+ let mut y = 1;
+ let mut px = &mut x;
+ let py = &mut y;
+ let ppx = &mut px;
+ *ppx = py;
+ **ppx = 2;
+ assert!(*px == 2);
+ assert!(x == 0);
+ assert!(*py == 2);
+ assert!(y == 2);
+}
+
+/// Box creation
+#[allow(unused_variables)]
+pub fn test_list1() {
+ let l: List<i32> = List::Cons(0, Box::new(List::Nil));
+}
+
+/// Box deref
+pub fn test_box1() {
+ use std::ops::Deref;
+ use std::ops::DerefMut;
+ let mut b: Box<i32> = Box::new(0);
+ let x = b.deref_mut();
+ *x = 1;
+ let x = b.deref();
+ assert!(*x == 1);
+}
+
+pub fn copy_int(x: i32) -> i32 {
+ x
+}
+
+/// Just checking the parameters given to unreachable
+/// Rk.: the input parameter prevents using the function as a unit test.
+pub fn test_unreachable(b: bool) {
+ if b {
+ unreachable!();
+ }
+}
+
+/// Just checking the parameters given to panic
+/// Rk.: the input parameter prevents using the function as a unit test.
+pub fn test_panic(b: bool) {
+ if b {
+ panic!("Panicked!");
+ }
+}
+
+// Just testing that shared loans are correctly handled
+pub fn test_copy_int() {
+ let x = 0;
+ let px = &x;
+ let y = copy_int(x);
+ assert!(*px == y);
+}
+
+pub fn is_cons<T>(l: &List<T>) -> bool {
+ match l {
+ List::Cons(_, _) => true,
+ List::Nil => false,
+ }
+}
+
+pub fn test_is_cons() {
+ let l: List<i32> = List::Cons(0, Box::new(List::Nil));
+
+ assert!(is_cons(&l));
+}
+
+pub fn split_list<T>(l: List<T>) -> (T, List<T>) {
+ match l {
+ List::Cons(hd, tl) => (hd, *tl),
+ _ => panic!(),
+ }
+}
+
+#[allow(unused_variables)]
+pub fn test_split_list() {
+ let l: List<i32> = List::Cons(0, Box::new(List::Nil));
+
+ let (hd, tl) = split_list(l);
+ assert!(hd == 0);
+}
+
+pub fn choose<'a, T>(b: bool, x: &'a mut T, y: &'a mut T) -> &'a mut T {
+ if b {
+ x
+ } else {
+ y
+ }
+}
+
+pub fn choose_test() {
+ let mut x = 0;
+ let mut y = 0;
+ let z = choose(true, &mut x, &mut y);
+ *z += 1;
+ assert!(*z == 1);
+ // drop(z)
+ assert!(x == 1);
+ assert!(y == 0);
+}
+
+/// Test with a char literal - testing serialization
+pub fn test_char() -> char {
+ 'a'
+}
+
+/// Mutually recursive types
+pub enum Tree<T> {
+ Leaf(T),
+ Node(T, NodeElem<T>, Box<Tree<T>>),
+}
+
+pub enum NodeElem<T> {
+ Cons(Box<Tree<T>>, Box<NodeElem<T>>),
+ Nil,
+}
+
+/*
+// TODO: those definitions requires semantic termination (breaks the Coq backend
+// because we don't use fuel in this case).
+
+/// Mutually recursive functions
+pub fn even(x: u32) -> bool {
+ if x == 0 {
+ true
+ } else {
+ odd(x - 1)
+ }
+}
+
+pub fn odd(x: u32) -> bool {
+ if x == 0 {
+ false
+ } else {
+ even(x - 1)
+ }
+}
+
+pub fn test_even_odd() {
+ assert!(even(0));
+ assert!(even(4));
+ assert!(odd(1));
+ assert!(odd(5));
+}
+*/
+
+#[allow(clippy::needless_lifetimes)]
+pub fn list_length<'a, T>(l: &'a List<T>) -> u32 {
+ match l {
+ List::Nil => 0,
+ List::Cons(_, l1) => 1 + list_length(l1),
+ }
+}
+
+#[allow(clippy::needless_lifetimes)]
+pub fn list_nth_shared<'a, T>(l: &'a List<T>, i: u32) -> &'a T {
+ match l {
+ List::Nil => {
+ panic!()
+ }
+ List::Cons(x, tl) => {
+ if i == 0 {
+ x
+ } else {
+ list_nth_shared(tl, i - 1)
+ }
+ }
+ }
+}
+
+#[allow(clippy::needless_lifetimes)]
+pub fn list_nth_mut<'a, T>(l: &'a mut List<T>, i: u32) -> &'a mut T {
+ match l {
+ List::Nil => {
+ panic!()
+ }
+ List::Cons(x, tl) => {
+ if i == 0 {
+ x
+ } else {
+ list_nth_mut(tl, i - 1)
+ }
+ }
+ }
+}
+
+/// In-place list reversal - auxiliary function
+pub fn list_rev_aux<T>(li: List<T>, mut lo: List<T>) -> List<T> {
+ match li {
+ List::Nil => lo,
+ List::Cons(hd, mut tl) => {
+ let next = *tl;
+ *tl = lo;
+ lo = List::Cons(hd, tl);
+ list_rev_aux(next, lo)
+ }
+ }
+}
+
+/// In-place list reversal
+#[allow(clippy::needless_lifetimes)]
+pub fn list_rev<'a, T>(l: &'a mut List<T>) {
+ let li = std::mem::replace(l, List::Nil);
+ *l = list_rev_aux(li, List::Nil);
+}
+
+pub fn test_list_functions() {
+ let mut ls = List::Cons(
+ 0,
+ Box::new(List::Cons(1, Box::new(List::Cons(2, Box::new(List::Nil))))),
+ );
+ assert!(list_length(&ls) == 3);
+ assert!(*list_nth_shared(&ls, 0) == 0);
+ assert!(*list_nth_shared(&ls, 1) == 1);
+ assert!(*list_nth_shared(&ls, 2) == 2);
+ let x = list_nth_mut(&mut ls, 1);
+ *x = 3;
+ assert!(*list_nth_shared(&ls, 0) == 0);
+ assert!(*list_nth_shared(&ls, 1) == 3); // Updated
+ assert!(*list_nth_shared(&ls, 2) == 2);
+}
+
+pub fn id_mut_pair1<'a, T1, T2>(x: &'a mut T1, y: &'a mut T2) -> (&'a mut T1, &'a mut T2) {
+ (x, y)
+}
+
+pub fn id_mut_pair2<'a, T1, T2>(p: (&'a mut T1, &'a mut T2)) -> (&'a mut T1, &'a mut T2) {
+ p
+}
+
+pub fn id_mut_pair3<'a, 'b, T1, T2>(x: &'a mut T1, y: &'b mut T2) -> (&'a mut T1, &'b mut T2) {
+ (x, y)
+}
+
+pub fn id_mut_pair4<'a, 'b, T1, T2>(p: (&'a mut T1, &'b mut T2)) -> (&'a mut T1, &'b mut T2) {
+ p
+}
+
+/// Testing constants (some constants are hard to retrieve from MIR, because
+/// they are compiled to very low values).
+/// We resort to the following structure to make rustc generate constants...
+pub struct StructWithTuple<T1, T2> {
+ p: (T1, T2),
+}
+
+pub fn new_tuple1() -> StructWithTuple<u32, u32> {
+ StructWithTuple { p: (1, 2) }
+}
+
+pub fn new_tuple2() -> StructWithTuple<i16, i16> {
+ StructWithTuple { p: (1, 2) }
+}
+
+pub fn new_tuple3() -> StructWithTuple<u64, i64> {
+ StructWithTuple { p: (1, 2) }
+}
+
+/// Similar to [StructWithTuple]
+pub struct StructWithPair<T1, T2> {
+ p: Pair<T1, T2>,
+}
+
+pub fn new_pair1() -> StructWithPair<u32, u32> {
+ // This actually doesn't make rustc generate a constant...
+ // I guess it only happens for tuples.
+ StructWithPair {
+ p: Pair { x: 1, y: 2 },
+ }
+}
+
+pub fn test_constants() {
+ assert!(new_tuple1().p.0 == 1);
+ assert!(new_tuple2().p.0 == 1);
+ assert!(new_tuple3().p.0 == 1);
+ assert!(new_pair1().p.x == 1);
+}
+
+/// This assignment is trickier than it seems
+#[allow(unused_assignments)]
+pub fn test_weird_borrows1() {
+ let mut x = 0;
+ let mut px = &mut x;
+ // Context:
+ // x -> [l0]
+ // px -> &mut l0 (0:i32)
+
+ px = &mut (*px);
+}
+
+pub fn test_mem_replace(px: &mut u32) {
+ let y = std::mem::replace(px, 1);
+ assert!(y == 0);
+ *px = 2;
+}
+
+/// Check that matching on borrowed values works well.
+pub fn test_shared_borrow_bool1(b: bool) -> u32 {
+ // Create a shared borrow of b
+ let _pb = &b;
+ // Match on b
+ if b {
+ 0
+ } else {
+ 1
+ }
+}
+
+/// Check that matching on borrowed values works well.
+/// Testing the concrete execution here.
+pub fn test_shared_borrow_bool2() -> u32 {
+ let b = true;
+ // Create a shared borrow of b
+ let _pb = &b;
+ // Match on b
+ if b {
+ 0
+ } else {
+ 1
+ }
+}
+
+/// Check that matching on borrowed values works well.
+/// In case of enumerations, we need to strip the outer loans before evaluating
+/// the discriminant.
+pub fn test_shared_borrow_enum1(l: List<u32>) -> u32 {
+ // Create a shared borrow of l
+ let _pl = &l;
+ // Match on l - must ignore the shared loan
+ match l {
+ List::Nil => 0,
+ List::Cons(_, _) => 1,
+ }
+}
+
+/// Check that matching on borrowed values works well.
+/// Testing the concrete execution here.
+pub fn test_shared_borrow_enum2() -> u32 {
+ let l: List<u32> = List::Nil;
+ // Create a shared borrow of l
+ let _pl = &l;
+ // Match on l - must ignore the shared loan
+ match l {
+ List::Nil => 0,
+ List::Cons(_, _) => 1,
+ }
+}
+
+pub fn incr(x: &mut u32) {
+ *x += 1;
+}
+
+pub fn call_incr(mut x: u32) -> u32 {
+ incr(&mut x);
+ x
+}
+
+pub fn read_then_incr(x: &mut u32) -> u32 {
+ let r = *x;
+ *x += 1;
+ r
+}
+
+pub struct Tuple<T1, T2>(T1, T2);
+
+pub fn use_tuple_struct(x: &mut Tuple<u32, u32>) {
+ x.0 = 1;
+}
+
+pub fn create_tuple_struct(x: u32, y: u64) -> Tuple<u32, u64> {
+ Tuple(x, y)
+}
+
+/// Structure with one field
+pub struct IdType<T>(T);
+
+pub fn use_id_type<T>(x: IdType<T>) -> T {
+ x.0
+}
+
+pub fn create_id_type<T>(x: T) -> IdType<T> {
+ IdType(x)
+}
diff --git a/tests/src/paper.rs b/tests/src/paper.rs
new file mode 100644
index 00000000..156f13ab
--- /dev/null
+++ b/tests/src/paper.rs
@@ -0,0 +1,82 @@
+//! The examples from the ICFP submission, all in one place.
+
+// 2.1
+pub fn ref_incr(x: &mut i32) {
+ *x = *x + 1;
+}
+
+pub fn test_incr() {
+ let mut x = 0i32;
+ ref_incr(&mut x);
+ assert!(x == 1);
+}
+
+// 2.2
+pub fn choose<'a, T>(b: bool, x: &'a mut T, y: &'a mut T) -> &'a mut T {
+ if b {
+ return x;
+ } else {
+ return y;
+ }
+}
+
+pub fn test_choose() {
+ let mut x = 0;
+ let mut y = 0;
+ let z = choose(true, &mut x, &mut y);
+ *z = *z + 1;
+ assert!(*z == 1);
+ assert!(x == 1);
+ assert!(y == 0);
+}
+
+// 2.3
+
+pub enum List<T> {
+ Cons(T, Box<List<T>>),
+ Nil,
+}
+use List::Cons;
+use List::Nil;
+
+pub fn list_nth_mut<'a, T>(l: &'a mut List<T>, i: u32) -> &'a mut T {
+ match l {
+ Nil => {
+ panic!()
+ }
+ Cons(x, tl) => {
+ if i == 0 {
+ return x;
+ } else {
+ return list_nth_mut(tl, i - 1);
+ }
+ }
+ }
+}
+
+pub fn sum(l: &List<i32>) -> i32 {
+ match l {
+ Nil => {
+ return 0;
+ }
+ Cons(x, tl) => {
+ return *x + sum(tl);
+ }
+ }
+}
+
+pub fn test_nth() {
+ let mut l = Cons(1, Box::new(Cons(2, Box::new(Cons(3, Box::new(Nil))))));
+ let x = list_nth_mut(&mut l, 2);
+ *x = *x + 1;
+ assert!(sum(&l) == 7);
+}
+
+// 4.3
+pub fn call_choose(mut p: (u32, u32)) -> u32 {
+ let px = &mut p.0;
+ let py = &mut p.1;
+ let pz = choose(true, px, py);
+ *pz = *pz + 1;
+ return p.0;
+}
diff --git a/tests/src/polonius_list.rs b/tests/src/polonius_list.rs
new file mode 100644
index 00000000..8c64110d
--- /dev/null
+++ b/tests/src/polonius_list.rs
@@ -0,0 +1,27 @@
+#![allow(dead_code)]
+
+pub enum List<T> {
+ Cons(T, Box<List<T>>),
+ Nil,
+}
+
+/// An example which comes from the b-epsilon tree.
+///
+/// Returns a mutable borrow to the first portion of the list where we
+/// can find [x]. This allows to do in-place modifications (insertion, filtering)
+/// in a natural manner (this piece of code was inspired by the C++ BeTree).
+pub fn get_list_at_x<'a>(ls: &'a mut List<u32>, x: u32) -> &'a mut List<u32> {
+ match ls {
+ List::Nil => {
+ // We reached the end: just return it
+ ls
+ }
+ List::Cons(hd, tl) => {
+ if *hd == x {
+ ls // Doing this requires NLL
+ } else {
+ get_list_at_x(tl, x)
+ }
+ }
+ }
+}
diff --git a/tests/src/traits.rs b/tests/src/traits.rs
new file mode 100644
index 00000000..27c90586
--- /dev/null
+++ b/tests/src/traits.rs
@@ -0,0 +1,341 @@
+pub trait BoolTrait {
+ // Required method
+ fn get_bool(&self) -> bool;
+
+ // Provided method
+ fn ret_true(&self) -> bool {
+ true
+ }
+}
+
+impl BoolTrait for bool {
+ fn get_bool(&self) -> bool {
+ *self
+ }
+}
+
+pub fn test_bool_trait_bool(x: bool) -> bool {
+ x.get_bool() && x.ret_true()
+}
+
+#[allow(clippy::redundant_pattern_matching)]
+impl<T> BoolTrait for Option<T> {
+ fn get_bool(&self) -> bool {
+ match self {
+ Option::Some(_) => true,
+ Option::None => false,
+ }
+ }
+}
+
+pub fn test_bool_trait_option<T>(x: Option<T>) -> bool {
+ x.get_bool() && x.ret_true()
+}
+
+pub fn test_bool_trait<T: BoolTrait>(x: T) -> bool {
+ x.get_bool()
+}
+
+pub trait ToU64 {
+ fn to_u64(self) -> u64;
+}
+
+impl ToU64 for u64 {
+ fn to_u64(self) -> u64 {
+ self
+ }
+}
+
+impl<A: ToU64> ToU64 for (A, A) {
+ fn to_u64(self) -> u64 {
+ self.0.to_u64() + self.1.to_u64()
+ }
+}
+
+pub fn f<T: ToU64>(x: (T, T)) -> u64 {
+ x.to_u64()
+}
+
+pub fn g<T>(x: (T, T)) -> u64
+where
+ (T, T): ToU64,
+{
+ x.to_u64()
+}
+
+pub fn h0(x: u64) -> u64 {
+ x.to_u64()
+}
+
+pub struct Wrapper<T> {
+ x: T,
+}
+
+impl<T: ToU64> ToU64 for Wrapper<T> {
+ fn to_u64(self) -> u64 {
+ self.x.to_u64()
+ }
+}
+
+pub fn h1(x: Wrapper<u64>) -> u64 {
+ x.to_u64()
+}
+
+pub fn h2<T: ToU64>(x: Wrapper<T>) -> u64 {
+ x.to_u64()
+}
+
+pub trait ToType<T> {
+ fn to_type(self) -> T;
+}
+
+impl ToType<bool> for u64 {
+ fn to_type(self) -> bool {
+ self > 0
+ }
+}
+
+pub trait OfType {
+ fn of_type<T: ToType<Self>>(x: T) -> Self
+ where
+ Self: std::marker::Sized;
+}
+
+pub fn h3<T1: OfType, T2: ToType<T1>>(y: T2) -> T1 {
+ T1::of_type(y)
+}
+
+// Checking what happens if we move trait clauses from a method to its enclosing block
+pub trait OfTypeBis<T: ToType<Self>>
+where
+ Self: std::marker::Sized,
+{
+ fn of_type(x: T) -> Self
+ where
+ Self: std::marker::Sized;
+}
+
+pub fn h4<T1: OfTypeBis<T2>, T2: ToType<T1>>(y: T2) -> T1 {
+ T1::of_type(y)
+}
+
+pub struct TestType<T>(T);
+
+// Checking what happens with nested blocks
+impl<T: ToU64> TestType<T> {
+ pub fn test(&self, x: T) -> bool {
+ struct TestType1(u64);
+ trait TestTrait {
+ fn test(&self) -> bool;
+ }
+
+ // Remark: we can't write: impl TestTrait for TestType<T>,
+ // we have to use a *local* parameter (can't use the outer T).
+ // In other words: the parameters used in the items inside
+ // an impl must be bound by the impl block (can't come from outer
+ // blocks).
+
+ impl TestTrait for TestType1 {
+ fn test(&self) -> bool {
+ self.0 > 1
+ }
+ }
+
+ let x = x.to_u64();
+ let y = TestType1(0);
+ x > 0 && y.test()
+ }
+}
+
+pub struct BoolWrapper(pub bool);
+
+impl<T> ToType<T> for BoolWrapper
+where
+ bool: ToType<T>,
+{
+ fn to_type(self) -> T {
+ self.0.to_type()
+ }
+}
+
+pub trait WithConstTy<const LEN: usize> {
+ const LEN1: usize;
+ // Testing default values
+ const LEN2: usize = 32;
+
+ type V;
+ type W: ToU64;
+
+ // Below: we can't use [Self::Len1] in the type of the array.
+ // Probably because of dyn traits...
+ fn f(x: &mut Self::W, y: &[u8; LEN]);
+}
+
+impl WithConstTy<32> for bool {
+ const LEN1: usize = 12;
+
+ type V = u8;
+ type W = u64;
+
+ fn f(_: &mut Self::W, _: &[u8; 32]) {}
+}
+
+pub fn use_with_const_ty1<const LEN: usize, H: WithConstTy<LEN>>() -> usize {
+ H::LEN1
+}
+
+pub fn use_with_const_ty2<const LEN: usize, H: WithConstTy<LEN>>(_: H::W) {}
+
+pub fn use_with_const_ty3<const LEN: usize, H: WithConstTy<LEN>>(x: H::W) -> u64 {
+ x.to_u64()
+}
+
+pub fn test_where1<'a, T: 'a>(_x: &'a T) {}
+pub fn test_where2<T: WithConstTy<32, V = u32>>(_x: T::V) {}
+
+// Below: testing super traits.
+//
+// Actually, this comes for free: ChildTrait : ParentTrait just adds a trait
+// clause for Self: `Self : ParentTrait`.
+pub trait ParentTrait0 {
+ type W;
+ fn get_name(&self) -> String;
+ fn get_w(&self) -> Self::W;
+}
+pub trait ParentTrait1 {}
+pub trait ChildTrait: ParentTrait0 + ParentTrait1 {}
+
+// But we still need to correctly reference the traits
+pub fn test_child_trait1<T: ChildTrait>(x: &T) -> String {
+ x.get_name()
+}
+
+pub fn test_child_trait2<T: ChildTrait>(x: &T) -> T::W {
+ x.get_w()
+}
+
+// Checking if the order has an importance (we use U::W before we declare that
+// U:ParentTrait0)
+pub fn order1<T: ParentTrait0<W = U::W>, U: ParentTrait0>() {}
+
+/* */
+pub trait ChildTrait1: ParentTrait1 {}
+
+impl ParentTrait1 for usize {}
+impl ChildTrait1 for usize {}
+
+/* [IntoIterator] is interesting because of the condition [Item = Self::Item]
+for the [IntoIter] associated type. */
+pub trait Iterator {
+ type Item;
+}
+
+pub trait IntoIterator {
+ type Item;
+ type IntoIter: Iterator<Item = Self::Item>;
+
+ // Required method
+ fn into_iter(self) -> Self::IntoIter;
+}
+
+/* The traits below are inspired by [Try] and [FromResidual].
+
+ The reference to `Self as Try` in the `FromResidual` clause used to
+ cause a bug.
+*/
+trait Try: FromResidual<<Self as Try>::Residual> {
+ type Residual;
+}
+
+trait FromResidual<T> {}
+
+pub trait WithTarget {
+ type Target;
+}
+
+pub trait ParentTrait2 {
+ type U: WithTarget;
+}
+
+pub trait ChildTrait2: ParentTrait2 {
+ fn convert(x: Self::U) -> <Self::U as WithTarget>::Target;
+}
+
+impl WithTarget for u32 {
+ type Target = u32;
+}
+
+impl ParentTrait2 for u32 {
+ type U = u32;
+}
+
+impl ChildTrait2 for u32 {
+ fn convert(x: u32) -> u32 {
+ x
+ }
+}
+
+/*
+// This one requires a lot of traits
+pub fn test_enumerate(x: usize) {
+ for _ in 0..x {}
+}
+*/
+
+/* Custom function pointers */
+pub trait CFnOnce<Args> {
+ type Output;
+
+ fn call_once(self, args: Args) -> Self::Output;
+}
+
+pub trait CFnMut<Args>: CFnOnce<Args> {
+ fn call_mut(&mut self, args: Args) -> Self::Output;
+}
+
+pub trait CFn<Args>: CFnMut<Args> {
+ fn call(&self, args: Args) -> Self::Output;
+}
+
+pub trait GetTrait {
+ type W;
+ fn get_w(&self) -> Self::W;
+}
+
+pub fn test_get_trait<T: GetTrait>(x: &T) -> T::W {
+ x.get_w()
+}
+
+// Constants with generics
+pub trait Trait {
+ const LEN: usize;
+}
+
+impl<const N: usize, T> Trait for [T; N] {
+ const LEN: usize = N;
+}
+
+impl<T: Trait> Trait for Wrapper<T> {
+ const LEN: usize = 0;
+}
+
+pub fn use_wrapper_len<T: Trait>() -> usize {
+ Wrapper::<T>::LEN
+}
+
+pub struct Foo<T, U> {
+ pub x: T,
+ pub y: U,
+}
+
+impl<T: Trait, U> Foo<T, U> {
+ pub const FOO: Result<T, i32> = Err(0);
+}
+
+pub fn use_foo1<T: Trait, U>() -> Result<T, i32> {
+ Foo::<T, U>::FOO
+}
+
+pub fn use_foo2<T, U: Trait>() -> Result<U, i32> {
+ Foo::<U, T>::FOO
+}
diff --git a/tests/test_runner/.ocamlformat b/tests/test_runner/.ocamlformat
new file mode 100644
index 00000000..e69de29b
--- /dev/null
+++ b/tests/test_runner/.ocamlformat
diff --git a/tests/test_runner/aeneas_test_runner.opam b/tests/test_runner/aeneas_test_runner.opam
new file mode 100644
index 00000000..b57cc9f6
--- /dev/null
+++ b/tests/test_runner/aeneas_test_runner.opam
@@ -0,0 +1,27 @@
+# This file is generated by dune, edit dune-project instead
+opam-version: "2.0"
+version: "0.1"
+authors: ["Son Ho" "Guillaume Boisseau"]
+license: "Apache-2.0"
+homepage: "https://github.com/AeneasVerif/aeneas"
+bug-reports: "https://github.com/AeneasVerif/aeneas/issues"
+depends: [
+ "ocaml"
+ "dune" {>= "3.12"}
+ "odoc" {with-doc}
+]
+build: [
+ ["dune" "subst"] {dev}
+ [
+ "dune"
+ "build"
+ "-p"
+ name
+ "-j"
+ jobs
+ "@install"
+ "@runtest" {with-test}
+ "@doc" {with-doc}
+ ]
+]
+dev-repo: "git+https://github.com/AeneasVerif/aeneas.git"
diff --git a/tests/test_runner/dune b/tests/test_runner/dune
new file mode 100644
index 00000000..7caf661f
--- /dev/null
+++ b/tests/test_runner/dune
@@ -0,0 +1,4 @@
+(executable
+ (public_name test_runner)
+ (libraries core_unix.sys_unix unix)
+ (name run_test))
diff --git a/tests/test_runner/dune-project b/tests/test_runner/dune-project
new file mode 100644
index 00000000..c614e923
--- /dev/null
+++ b/tests/test_runner/dune-project
@@ -0,0 +1,25 @@
+(lang dune 3.12)
+
+(name aeneas_test_runner)
+
+(version 0.1)
+
+(generate_opam_files true)
+
+(source
+ (uri git+https://github.com/AeneasVerif/aeneas.git))
+
+(homepage "https://github.com/AeneasVerif/aeneas")
+
+(bug_reports "https://github.com/AeneasVerif/aeneas/issues")
+
+(authors
+ "Son Ho"
+ "Guillaume Boisseau")
+
+(license Apache-2.0)
+
+(package
+ (name aeneas_test_runner)
+ (depends ocaml dune)
+)
diff --git a/tests/test_runner/run_test.ml b/tests/test_runner/run_test.ml
new file mode 100644
index 00000000..8aa6347c
--- /dev/null
+++ b/tests/test_runner/run_test.ml
@@ -0,0 +1,233 @@
+(* Paths to use for tests *)
+type runner_env = {
+ charon_path : string;
+ aeneas_path : string;
+ llbc_dir : string;
+}
+
+(* The data for a specific test to run aeneas on *)
+type aeneas_test_case = {
+ name : string;
+ backend : string;
+ subdir : string;
+ extra_aeneas_options : string list;
+}
+
+type input_kind = SingleFile | Crate
+
+(* The data for a specific test to generate llbc for *)
+type charon_test_case = {
+ kind : input_kind;
+ name : string;
+ path : string;
+ extra_charon_options : string list;
+}
+
+let concat_path = List.fold_left Filename.concat ""
+
+let run_command args =
+ (* Debug arguments *)
+ print_string "[test_runner] Running: ";
+ Array.iter
+ (fun x ->
+ print_string x;
+ print_string " ")
+ args;
+ print_endline "";
+
+ (* Run the command *)
+ let pid =
+ Unix.create_process args.(0) args Unix.stdin Unix.stdout Unix.stderr
+ in
+ let _ = Unix.waitpid [] pid in
+ ()
+
+(* Run Aeneas on a specific input with the given options *)
+let run_aeneas (env : runner_env) (case : aeneas_test_case) =
+ let input_file = concat_path [ env.llbc_dir; case.name ] ^ ".llbc" in
+ let dest_dir = concat_path [ "tests"; case.backend; case.subdir ] in
+ let args =
+ [|
+ env.aeneas_path; input_file; "-dest"; dest_dir; "-backend"; case.backend;
+ |]
+ in
+ let args = Array.append args (Array.of_list case.extra_aeneas_options) in
+ (* Run Aeneas *)
+ run_command args
+
+(* Run Charon on a specific input with the given options *)
+let run_charon (env : runner_env) (case : charon_test_case) =
+ match case.kind with
+ | SingleFile ->
+ let args =
+ [|
+ env.charon_path;
+ "--no-cargo";
+ "--input";
+ case.path;
+ "--crate";
+ case.name;
+ "--dest";
+ env.llbc_dir;
+ |]
+ in
+ let args = Array.append args (Array.of_list case.extra_charon_options) in
+ (* Run Charon on the rust file *)
+ run_command args
+ | Crate -> (
+ match Sys.getenv_opt "IN_CI" with
+ | None ->
+ let args = [| env.charon_path; "--dest"; env.llbc_dir |] in
+ let args =
+ Array.append args (Array.of_list case.extra_charon_options)
+ in
+ (* Run Charon inside the crate *)
+ let old_pwd = Unix.getcwd () in
+ Unix.chdir case.path;
+ run_command args;
+ Unix.chdir old_pwd
+ | Some _ ->
+ (* Crates with dependencies must be generated separately in CI. We skip
+ here and trust that CI takes care to generate the necessary llbc
+ file. *)
+ print_endline
+ "Warn: IN_CI is set; we skip generating llbc files for whole crates"
+ )
+
+(* File-specific options *)
+let aeneas_options_for_test backend test_name =
+ (* TODO: reactivate -test-trans-units for hashmap and hashmap_main *)
+ let use_fuel =
+ match (backend, test_name) with
+ | ( "coq",
+ ( "arrays" | "betree_main" | "demo" | "hashmap" | "hashmap_main"
+ | "loops" ) ) ->
+ true
+ | "fstar", "demo" -> true
+ | _ -> false
+ in
+ let options = if use_fuel then "-use-fuel" :: [] else [] in
+
+ let decrease_template_clauses =
+ backend = "fstar"
+ &&
+ match test_name with
+ | "arrays" | "betree_main" | "hashmap" | "hashmap_main" | "loops" | "traits"
+ ->
+ true
+ | _ -> false
+ in
+ let options =
+ if decrease_template_clauses then
+ "-decreases-clauses" :: "-template-clauses" :: options
+ else options
+ in
+
+ let extra_options =
+ match (backend, test_name) with
+ | _, "betree_main" ->
+ [
+ "-backward-no-state-update";
+ "-test-trans-units";
+ "-state";
+ "-split-files";
+ ]
+ | _, "bitwise" -> [ "-test-trans-units" ]
+ | _, "constants" -> [ "-test-trans-units" ]
+ | _, "external" -> [ "-test-trans-units"; "-state"; "-split-files" ]
+ | _, "hashmap_main" -> [ "-state"; "-split-files" ]
+ | _, "no_nested_borrows" -> [ "-test-trans-units" ]
+ | _, "paper" -> [ "-test-trans-units" ]
+ | _, "polonius_list" -> [ "-test-trans-units" ]
+ | "fstar", "arrays" -> [ "-split-files" ]
+ | "fstar", "loops" -> [ "-split-files" ]
+ (* We add a custom import in the Hashmap.lean file: we do not want to overwrite it *)
+ | "lean", "hashmap" -> [ "-split-files"; "-no-gen-lib-entry" ]
+ | _, "hashmap" -> [ "-split-files" ]
+ | _ -> []
+ in
+ let options = List.append extra_options options in
+ options
+
+(* File-specific options *)
+let charon_options_for_test test_name =
+ (* Possible to add `--no-code-duplication` for `hashmap_main` if we use the optimized MIR *)
+ let no_code_dup =
+ match test_name with
+ | "constants" | "external" | "nested_borrows" | "no_nested_borrows"
+ | "paper" ->
+ [ "--no-code-duplication" ]
+ | _ -> []
+ in
+ let extra_options =
+ match test_name with
+ | "betree" ->
+ [ "--polonius"; "--opaque=betree_utils"; "--crate"; "betree_main" ]
+ | "hashmap_main" -> [ "--opaque=hashmap_utils" ]
+ | "polonius_list" -> [ "--polonius" ]
+ | _ -> []
+ in
+ List.append no_code_dup extra_options
+
+(* The subdirectory in which to store the outputs. *)
+(* This reproduces the file layout that was set by the old Makefile. FIXME: cleanup *)
+let test_subdir backend test_name =
+ match (backend, test_name) with
+ | "lean", "demo" -> "Demo"
+ | "lean", _ -> "."
+ | _, ("arrays" | "demo" | "hashmap" | "traits") -> test_name
+ | _, "betree_main" -> "betree"
+ | _, "hashmap_main" -> "hashmap_on_disk"
+ | "hol4", _ -> "misc-" ^ test_name
+ | ( _,
+ ( "bitwise" | "constants" | "external" | "loops" | "no_nested_borrows"
+ | "paper" | "polonius_list" ) ) ->
+ "misc"
+ | _ -> test_name
+
+let () =
+ match Array.to_list Sys.argv with
+ (* Ad-hoc argument passing for now. *)
+ | _exe_path :: charon_path :: aeneas_path :: llbc_dir :: test_path
+ :: aeneas_options ->
+ let runner_env = { charon_path; aeneas_path; llbc_dir } in
+ let test_name = Filename.remove_extension (Filename.basename test_path) in
+
+ let charon_kind =
+ if Sys_unix.is_file_exn test_path then SingleFile
+ else if Sys_unix.is_directory_exn test_path then Crate
+ else failwith ("`" ^ test_path ^ "` is not a file or a directory.")
+ in
+ let extra_charon_options = charon_options_for_test test_name in
+ let charon_case =
+ {
+ path = test_path;
+ name = test_name;
+ kind = charon_kind;
+ extra_charon_options;
+ }
+ in
+ (* Generate the llbc file *)
+ run_charon runner_env charon_case;
+
+ (* FIXME: remove this special case *)
+ let test_name =
+ if test_name = "betree" then "betree_main" else test_name
+ in
+ (* TODO: reactivate HOL4 once traits are parameterized by their associated types *)
+ let backends = [ "coq"; "lean"; "fstar" ] in
+ List.iter
+ (fun backend ->
+ let subdir = test_subdir backend test_name in
+ let extra_aeneas_options =
+ List.append
+ (aeneas_options_for_test backend test_name)
+ aeneas_options
+ in
+ let aeneas_case =
+ { name = test_name; backend; subdir; extra_aeneas_options }
+ in
+ (* Process the llbc file for the current backend *)
+ run_aeneas runner_env aeneas_case)
+ backends
+ | _ -> failwith "Incorrect options passed to test runner"