summaryrefslogtreecommitdiff
path: root/tests/fstar
diff options
context:
space:
mode:
Diffstat (limited to '')
-rw-r--r--tests/fstar/arrays/Arrays.Clauses.Template.fst19
-rw-r--r--tests/fstar/arrays/Arrays.Funs.fst54
-rw-r--r--tests/fstar/demo/Demo.fst24
-rw-r--r--tests/fstar/hashmap/Hashmap.Clauses.Template.fst56
-rw-r--r--tests/fstar/hashmap/Hashmap.Funs.fst154
-rw-r--r--tests/fstar/hashmap_on_disk/HashmapMain.Clauses.Template.fst57
-rw-r--r--tests/fstar/hashmap_on_disk/HashmapMain.Funs.fst164
-rw-r--r--tests/fstar/misc/Loops.Clauses.Template.fst105
-rw-r--r--tests/fstar/misc/Loops.Funs.fst364
9 files changed, 961 insertions, 36 deletions
diff --git a/tests/fstar/arrays/Arrays.Clauses.Template.fst b/tests/fstar/arrays/Arrays.Clauses.Template.fst
index c189e41e..e695b89b 100644
--- a/tests/fstar/arrays/Arrays.Clauses.Template.fst
+++ b/tests/fstar/arrays/Arrays.Clauses.Template.fst
@@ -6,6 +6,25 @@ open Arrays.Types
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
+(** [arrays::sum]: decreases clause
+ 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: '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: '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: 'tests/src/arrays.rs', lines 312:0-318:1 *)
unfold
diff --git a/tests/fstar/arrays/Arrays.Funs.fst b/tests/fstar/arrays/Arrays.Funs.fst
index f77b9c40..6196e3b7 100644
--- a/tests/fstar/arrays/Arrays.Funs.fst
+++ b/tests/fstar/arrays/Arrays.Funs.fst
@@ -306,15 +306,49 @@ let take_array_t (a : array aB_t 2) : result unit =
let non_copyable_array : result unit =
take_array_t (mk_array aB_t 2 [ AB_A; AB_B ])
+(** [arrays::sum]: loop 0:
+ 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))
+ =
+ let i1 = slice_len u32 s in
+ if i < i1
+ then
+ let* i2 = slice_index_usize u32 s i in
+ let* sum3 = u32_add sum1 i2 in
+ let* i3 = usize_add i 1 in
+ sum_loop s sum3 i3
+ else Ok sum1
+
(** [arrays::sum]:
Source: 'tests/src/arrays.rs', lines 242:0-242:28 *)
let sum (s : slice u32) : result u32 =
- admit
+ sum_loop s 0 0
+
+(** [arrays::sum2]: loop 0:
+ 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))
+ =
+ let i1 = slice_len u32 s in
+ if i < i1
+ then
+ let* i2 = slice_index_usize u32 s i in
+ let* i3 = slice_index_usize u32 s2 i in
+ let* i4 = u32_add i2 i3 in
+ let* sum3 = u32_add sum1 i4 in
+ let* i5 = usize_add i 1 in
+ sum2_loop s s2 sum3 i5
+ else Ok sum1
(** [arrays::sum2]:
Source: 'tests/src/arrays.rs', lines 252:0-252:41 *)
let sum2 (s : slice u32) (s2 : slice u32) : result u32 =
- admit
+ 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: 'tests/src/arrays.rs', lines 263:0-263:11 *)
@@ -380,10 +414,24 @@ let ite : result unit =
let* _ = to_slice_mut_back s1 in
Ok ()
+(** [arrays::zero_slice]: loop 0:
+ 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))
+ =
+ if i < len
+ then
+ let* (_, index_mut_back) = slice_index_mut_usize u8 a i in
+ let* i1 = usize_add i 1 in
+ let* a1 = index_mut_back 0 in
+ zero_slice_loop a1 i1 len
+ else Ok a
+
(** [arrays::zero_slice]:
Source: 'tests/src/arrays.rs', lines 303:0-303:31 *)
let zero_slice (a : slice u8) : result (slice u8) =
- admit
+ let len = slice_len u8 a in zero_slice_loop a 0 len
(** [arrays::iter_mut_slice]: loop 0:
Source: 'tests/src/arrays.rs', lines 312:0-318:1 *)
diff --git a/tests/fstar/demo/Demo.fst b/tests/fstar/demo/Demo.fst
index c78dab8e..41fd9804 100644
--- a/tests/fstar/demo/Demo.fst
+++ b/tests/fstar/demo/Demo.fst
@@ -76,13 +76,35 @@ let rec list_nth_mut
| CList_CNil -> Fail Failure
end
+(** [demo::list_nth_mut1]: loop 0:
+ 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)))
+ =
+ if is_zero n
+ then Fail OutOfFuel
+ else
+ let n1 = decrease n in
+ begin match l with
+ | CList_CCons x tl ->
+ if i = 0
+ then let back = fun ret -> Ok (CList_CCons ret tl) in Ok (x, back)
+ else
+ let* i1 = u32_sub i 1 in
+ let* (x1, back) = list_nth_mut1_loop t n1 tl i1 in
+ let back1 = fun ret -> let* tl1 = back ret in Ok (CList_CCons x tl1) in
+ Ok (x1, back1)
+ | CList_CNil -> Fail Failure
+ end
+
(** [demo::list_nth_mut1]:
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)))
=
- admit
+ list_nth_mut1_loop t n l i
(** [demo::i32_id]:
Source: 'tests/src/demo.rs', lines 80:0-80:28 *)
diff --git a/tests/fstar/hashmap/Hashmap.Clauses.Template.fst b/tests/fstar/hashmap/Hashmap.Clauses.Template.fst
index 5effb67a..b96f6784 100644
--- a/tests/fstar/hashmap/Hashmap.Clauses.Template.fst
+++ b/tests/fstar/hashmap/Hashmap.Clauses.Template.fst
@@ -13,3 +13,59 @@ 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: '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: '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: '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: '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: '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: '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: '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: '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 =
+ admit ()
+
diff --git a/tests/fstar/hashmap/Hashmap.Funs.fst b/tests/fstar/hashmap/Hashmap.Funs.fst
index 638cd66f..38be12ac 100644
--- a/tests/fstar/hashmap/Hashmap.Funs.fst
+++ b/tests/fstar/hashmap/Hashmap.Funs.fst
@@ -58,23 +58,59 @@ let hashMap_new_with_capacity
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: '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)))
+ (decreases (hashMap_clear_loop_decreases t slots i))
+ =
+ let i1 = alloc_vec_Vec_len (list_t t) slots in
+ if i < i1
+ then
+ let* (_, index_mut_back) =
+ alloc_vec_Vec_index_mut (list_t t) usize
+ (core_slice_index_SliceIndexUsizeSliceTInst (list_t t)) slots i in
+ let* i2 = usize_add i 1 in
+ let* slots1 = index_mut_back List_Nil in
+ hashMap_clear_loop t slots1 i2
+ else Ok slots
+
(** [hashmap::{hashmap::HashMap<T>}::clear]:
Source: 'tests/src/hashmap.rs', lines 80:4-80:27 *)
let hashMap_clear (t : Type0) (self : hashMap_t t) : result (hashMap_t t) =
- admit
+ let* hm = hashMap_clear_loop t self.slots 0 in
+ Ok { self with num_entries = 0; slots = hm }
(** [hashmap::{hashmap::HashMap<T>}::len]:
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: '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)))
+ (decreases (hashMap_insert_in_list_loop_decreases t key value ls))
+ =
+ begin match ls with
+ | List_Cons ckey cvalue tl ->
+ if ckey = key
+ then Ok (false, List_Cons ckey value tl)
+ else
+ let* (b, tl1) = hashMap_insert_in_list_loop t key value tl in
+ Ok (b, List_Cons ckey cvalue tl1)
+ | List_Nil -> Ok (true, List_Cons key value List_Nil)
+ end
+
(** [hashmap::{hashmap::HashMap<T>}::insert_in_list]:
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))
=
- admit
+ hashMap_insert_in_list_loop t key value ls
(** [hashmap::{hashmap::HashMap<T>}::insert_no_resize]:
Source: 'tests/src/hashmap.rs', lines 117:4-117:54 *)
@@ -97,11 +133,46 @@ let hashMap_insert_no_resize
Ok { self with num_entries = i1; slots = v }
else let* v = index_mut_back l1 in Ok { self with slots = v }
+(** [hashmap::{hashmap::HashMap<T>}::move_elements_from_list]: loop 0:
+ 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))
+ (decreases (hashMap_move_elements_from_list_loop_decreases t ntable ls))
+ =
+ begin match ls with
+ | List_Cons k v tl ->
+ let* ntable1 = hashMap_insert_no_resize t ntable k v in
+ hashMap_move_elements_from_list_loop t ntable1 tl
+ | List_Nil -> Ok ntable
+ end
+
(** [hashmap::{hashmap::HashMap<T>}::move_elements_from_list]:
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) =
- admit
+ hashMap_move_elements_from_list_loop t ntable ls
+
+(** [hashmap::{hashmap::HashMap<T>}::move_elements]: loop 0:
+ 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) :
+ Tot (result ((alloc_vec_Vec (list_t t)) & (hashMap_t t)))
+ (decreases (hashMap_move_elements_loop_decreases t ntable slots i))
+ =
+ let i1 = alloc_vec_Vec_len (list_t t) slots in
+ if i < i1
+ then
+ let* (l, index_mut_back) =
+ alloc_vec_Vec_index_mut (list_t t) usize
+ (core_slice_index_SliceIndexUsizeSliceTInst (list_t t)) slots i in
+ let (ls, l1) = core_mem_replace (list_t t) l List_Nil in
+ let* ntable1 = hashMap_move_elements_from_list t ntable ls in
+ let* i2 = usize_add i 1 in
+ let* slots1 = index_mut_back l1 in
+ hashMap_move_elements_loop t ntable1 slots1 i2
+ else Ok (ntable, slots)
(** [hashmap::{hashmap::HashMap<T>}::move_elements]:
Source: 'tests/src/hashmap.rs', lines 171:4-171:95 *)
@@ -110,7 +181,7 @@ let hashMap_move_elements
(i : usize) :
result ((hashMap_t t) & (alloc_vec_Vec (list_t t)))
=
- admit
+ hashMap_move_elements_loop t ntable slots i
(** [hashmap::{hashmap::HashMap<T>}::try_resize]:
Source: 'tests/src/hashmap.rs', lines 140:4-140:28 *)
@@ -142,11 +213,24 @@ let hashMap_insert
let* i = hashMap_len t self1 in
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: '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)
+ (decreases (hashMap_contains_key_in_list_loop_decreases t key ls))
+ =
+ begin match ls with
+ | List_Cons ckey _ tl ->
+ if ckey = key then Ok true else hashMap_contains_key_in_list_loop t key tl
+ | List_Nil -> Ok false
+ end
+
(** [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]:
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 =
- admit
+ hashMap_contains_key_in_list_loop t key ls
(** [hashmap::{hashmap::HashMap<T>}::contains_key]:
Source: 'tests/src/hashmap.rs', lines 199:4-199:49 *)
@@ -161,10 +245,22 @@ let hashMap_contains_key
hash_mod in
hashMap_contains_key_in_list t key l
+(** [hashmap::{hashmap::HashMap<T>}::get_in_list]: loop 0:
+ 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))
+ =
+ begin match ls with
+ | List_Cons ckey cvalue tl ->
+ if ckey = key then Ok cvalue else hashMap_get_in_list_loop t key tl
+ | List_Nil -> Fail Failure
+ end
+
(** [hashmap::{hashmap::HashMap<T>}::get_in_list]:
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 =
- admit
+ hashMap_get_in_list_loop t key ls
(** [hashmap::{hashmap::HashMap<T>}::get]:
Source: 'tests/src/hashmap.rs', lines 239:4-239:55 *)
@@ -178,13 +274,32 @@ let hashMap_get (t : Type0) (self : hashMap_t t) (key : usize) : result t =
hash_mod in
hashMap_get_in_list t key l
+(** [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: loop 0:
+ 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))))
+ (decreases (hashMap_get_mut_in_list_loop_decreases t ls key))
+ =
+ begin match ls with
+ | List_Cons ckey cvalue tl ->
+ if ckey = key
+ then let back = fun ret -> Ok (List_Cons ckey ret tl) in Ok (cvalue, back)
+ else
+ let* (x, back) = hashMap_get_mut_in_list_loop t tl key in
+ let back1 =
+ fun ret -> let* tl1 = back ret in Ok (List_Cons ckey cvalue tl1) in
+ Ok (x, back1)
+ | List_Nil -> Fail Failure
+ end
+
(** [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]:
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)))
=
- admit
+ hashMap_get_mut_in_list_loop t ls key
(** [hashmap::{hashmap::HashMap<T>}::get_mut]:
Source: 'tests/src/hashmap.rs', lines 257:4-257:67 *)
@@ -207,13 +322,36 @@ let hashMap_get_mut
Ok { self with slots = v } in
Ok (x, back)
+(** [hashmap::{hashmap::HashMap<T>}::remove_from_list]: loop 0:
+ 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)))
+ (decreases (hashMap_remove_from_list_loop_decreases t key ls))
+ =
+ begin match ls with
+ | List_Cons ckey x tl ->
+ if ckey = key
+ then
+ let (mv_ls, _) =
+ core_mem_replace (list_t t) (List_Cons ckey x tl) List_Nil in
+ begin match mv_ls with
+ | List_Cons _ cvalue tl1 -> Ok (Some cvalue, tl1)
+ | List_Nil -> Fail Failure
+ end
+ else
+ let* (o, tl1) = hashMap_remove_from_list_loop t key tl in
+ Ok (o, List_Cons ckey x tl1)
+ | List_Nil -> Ok (None, List_Nil)
+ end
+
(** [hashmap::{hashmap::HashMap<T>}::remove_from_list]:
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))
=
- admit
+ hashMap_remove_from_list_loop t key ls
(** [hashmap::{hashmap::HashMap<T>}::remove]:
Source: 'tests/src/hashmap.rs', lines 294:4-294:52 *)
diff --git a/tests/fstar/hashmap_on_disk/HashmapMain.Clauses.Template.fst b/tests/fstar/hashmap_on_disk/HashmapMain.Clauses.Template.fst
index 3c6b4af0..0715bdcb 100644
--- a/tests/fstar/hashmap_on_disk/HashmapMain.Clauses.Template.fst
+++ b/tests/fstar/hashmap_on_disk/HashmapMain.Clauses.Template.fst
@@ -13,3 +13,60 @@ 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: '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: '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: '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: '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))
+ (i : usize) : nat =
+ admit ()
+
+(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key_in_list]: decreases clause
+ 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: '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: '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: '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 =
+ admit ()
+
diff --git a/tests/fstar/hashmap_on_disk/HashmapMain.Funs.fst b/tests/fstar/hashmap_on_disk/HashmapMain.Funs.fst
index 27041dd6..cf3ae858 100644
--- a/tests/fstar/hashmap_on_disk/HashmapMain.Funs.fst
+++ b/tests/fstar/hashmap_on_disk/HashmapMain.Funs.fst
@@ -61,11 +61,31 @@ let hashmap_HashMap_new_with_capacity
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: '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)))
+ (decreases (hashmap_HashMap_clear_loop_decreases t slots i))
+ =
+ let i1 = alloc_vec_Vec_len (hashmap_List_t t) slots in
+ if i < i1
+ then
+ let* (_, index_mut_back) =
+ alloc_vec_Vec_index_mut (hashmap_List_t t) usize
+ (core_slice_index_SliceIndexUsizeSliceTInst (hashmap_List_t t)) slots i
+ in
+ let* i2 = usize_add i 1 in
+ let* slots1 = index_mut_back Hashmap_List_Nil in
+ hashmap_HashMap_clear_loop t slots1 i2
+ else Ok slots
+
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::clear]:
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) =
- admit
+ 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: 'tests/src/hashmap.rs', lines 90:4-90:30 *)
@@ -73,13 +93,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: '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)))
+ (decreases (hashmap_HashMap_insert_in_list_loop_decreases t key value ls))
+ =
+ begin match ls with
+ | Hashmap_List_Cons ckey cvalue tl ->
+ if ckey = key
+ then Ok (false, Hashmap_List_Cons ckey value tl)
+ else
+ let* (b, tl1) = hashmap_HashMap_insert_in_list_loop t key value tl in
+ Ok (b, Hashmap_List_Cons ckey cvalue tl1)
+ | Hashmap_List_Nil -> Ok (true, Hashmap_List_Cons key value Hashmap_List_Nil)
+ end
+
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_in_list]:
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))
=
- admit
+ hashmap_HashMap_insert_in_list_loop t key value ls
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_no_resize]:
Source: 'tests/src/hashmap.rs', lines 117:4-117:54 *)
@@ -102,13 +139,50 @@ let hashmap_HashMap_insert_no_resize
Ok { self with num_entries = i1; slots = v }
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: '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))
+ (decreases (
+ hashmap_HashMap_move_elements_from_list_loop_decreases t ntable ls))
+ =
+ begin match ls with
+ | Hashmap_List_Cons k v tl ->
+ let* ntable1 = hashmap_HashMap_insert_no_resize t ntable k v in
+ hashmap_HashMap_move_elements_from_list_loop t ntable1 tl
+ | Hashmap_List_Nil -> Ok ntable
+ end
+
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements_from_list]:
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)
=
- admit
+ hashmap_HashMap_move_elements_from_list_loop t ntable ls
+
+(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements]: loop 0:
+ 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) :
+ Tot (result ((alloc_vec_Vec (hashmap_List_t t)) & (hashmap_HashMap_t t)))
+ (decreases (hashmap_HashMap_move_elements_loop_decreases t ntable slots i))
+ =
+ let i1 = alloc_vec_Vec_len (hashmap_List_t t) slots in
+ if i < i1
+ then
+ let* (l, index_mut_back) =
+ alloc_vec_Vec_index_mut (hashmap_List_t t) usize
+ (core_slice_index_SliceIndexUsizeSliceTInst (hashmap_List_t t)) slots i
+ in
+ let (ls, l1) = core_mem_replace (hashmap_List_t t) l Hashmap_List_Nil in
+ let* ntable1 = hashmap_HashMap_move_elements_from_list t ntable ls in
+ let* i2 = usize_add i 1 in
+ let* slots1 = index_mut_back l1 in
+ hashmap_HashMap_move_elements_loop t ntable1 slots1 i2
+ else Ok (ntable, slots)
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements]:
Source: 'tests/src/hashmap.rs', lines 171:4-171:95 *)
@@ -117,7 +191,7 @@ let hashmap_HashMap_move_elements
(slots : alloc_vec_Vec (hashmap_List_t t)) (i : usize) :
result ((hashmap_HashMap_t t) & (alloc_vec_Vec (hashmap_List_t t)))
=
- admit
+ hashmap_HashMap_move_elements_loop t ntable slots i
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::try_resize]:
Source: 'tests/src/hashmap.rs', lines 140:4-140:28 *)
@@ -149,11 +223,26 @@ let hashmap_HashMap_insert
let* i = hashmap_HashMap_len t self1 in
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: '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)
+ (decreases (hashmap_HashMap_contains_key_in_list_loop_decreases t key ls))
+ =
+ begin match ls with
+ | Hashmap_List_Cons ckey _ tl ->
+ if ckey = key
+ then Ok true
+ else hashmap_HashMap_contains_key_in_list_loop t key tl
+ | Hashmap_List_Nil -> Ok false
+ end
+
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key_in_list]:
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 =
- admit
+ hashmap_HashMap_contains_key_in_list_loop t key ls
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key]:
Source: 'tests/src/hashmap.rs', lines 199:4-199:49 *)
@@ -168,11 +257,24 @@ let hashmap_HashMap_contains_key
self.slots hash_mod in
hashmap_HashMap_contains_key_in_list t key l
+(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_in_list]: loop 0:
+ Source: 'tests/src/hashmap.rs', lines 224:4-237:5 *)
+let rec hashmap_HashMap_get_in_list_loop
+ (t : Type0) (key : usize) (ls : hashmap_List_t t) :
+ Tot (result t)
+ (decreases (hashmap_HashMap_get_in_list_loop_decreases t key ls))
+ =
+ begin match ls with
+ | Hashmap_List_Cons ckey cvalue tl ->
+ if ckey = key then Ok cvalue else hashmap_HashMap_get_in_list_loop t key tl
+ | Hashmap_List_Nil -> Fail Failure
+ end
+
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_in_list]:
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 =
- admit
+ hashmap_HashMap_get_in_list_loop t key ls
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get]:
Source: 'tests/src/hashmap.rs', lines 239:4-239:55 *)
@@ -187,13 +289,35 @@ let hashmap_HashMap_get
self.slots hash_mod in
hashmap_HashMap_get_in_list t key l
+(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut_in_list]: loop 0:
+ Source: 'tests/src/hashmap.rs', lines 245:4-254:5 *)
+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))))
+ (decreases (hashmap_HashMap_get_mut_in_list_loop_decreases t ls key))
+ =
+ begin match ls with
+ | Hashmap_List_Cons ckey cvalue tl ->
+ if ckey = key
+ then
+ let back = fun ret -> Ok (Hashmap_List_Cons ckey ret tl) in
+ Ok (cvalue, back)
+ else
+ let* (x, back) = hashmap_HashMap_get_mut_in_list_loop t tl key in
+ let back1 =
+ fun ret ->
+ let* tl1 = back ret in Ok (Hashmap_List_Cons ckey cvalue tl1) in
+ Ok (x, back1)
+ | Hashmap_List_Nil -> Fail Failure
+ end
+
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut_in_list]:
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)))
=
- admit
+ hashmap_HashMap_get_mut_in_list_loop t ls key
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut]:
Source: 'tests/src/hashmap.rs', lines 257:4-257:67 *)
@@ -216,13 +340,37 @@ let hashmap_HashMap_get_mut
Ok { self with slots = v } in
Ok (x, back)
+(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove_from_list]: loop 0:
+ 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)))
+ (decreases (hashmap_HashMap_remove_from_list_loop_decreases t key ls))
+ =
+ begin match ls with
+ | Hashmap_List_Cons ckey x tl ->
+ if ckey = key
+ then
+ let (mv_ls, _) =
+ core_mem_replace (hashmap_List_t t) (Hashmap_List_Cons ckey x tl)
+ Hashmap_List_Nil in
+ begin match mv_ls with
+ | Hashmap_List_Cons _ cvalue tl1 -> Ok (Some cvalue, tl1)
+ | Hashmap_List_Nil -> Fail Failure
+ end
+ else
+ let* (o, tl1) = hashmap_HashMap_remove_from_list_loop t key tl in
+ Ok (o, Hashmap_List_Cons ckey x tl1)
+ | Hashmap_List_Nil -> Ok (None, Hashmap_List_Nil)
+ end
+
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove_from_list]:
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))
=
- admit
+ hashmap_HashMap_remove_from_list_loop t key ls
(** [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove]:
Source: 'tests/src/hashmap.rs', lines 294:4-294:52 *)
diff --git a/tests/fstar/misc/Loops.Clauses.Template.fst b/tests/fstar/misc/Loops.Clauses.Template.fst
index 21c128bb..77f9c3e4 100644
--- a/tests/fstar/misc/Loops.Clauses.Template.fst
+++ b/tests/fstar/misc/Loops.Clauses.Template.fst
@@ -30,6 +30,111 @@ let sum_array_loop_decreases (n : usize) (a : array u32 n) (i : usize)
(s : u32) : nat =
admit ()
+(** [loops::clear]: decreases clause
+ 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: '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: '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: '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: '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: '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: '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: '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: '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: '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: '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: '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: '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: '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: '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: '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: 'tests/src/loops.rs', lines 345:0-349:1 *)
unfold let ignore_input_mut_borrow_loop_decreases (i : u32) : nat = admit ()
diff --git a/tests/fstar/misc/Loops.Funs.fst b/tests/fstar/misc/Loops.Funs.fst
index dc53a04b..0eafeebb 100644
--- a/tests/fstar/misc/Loops.Funs.fst
+++ b/tests/fstar/misc/Loops.Funs.fst
@@ -77,15 +77,62 @@ let rec sum_array_loop
let sum_array (n : usize) (a : array u32 n) : result u32 =
sum_array_loop n a 0 0
+(** [loops::clear]: loop 0:
+ 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))
+ =
+ let i1 = alloc_vec_Vec_len u32 v in
+ if i < i1
+ then
+ let* (_, index_mut_back) =
+ alloc_vec_Vec_index_mut u32 usize
+ (core_slice_index_SliceIndexUsizeSliceTInst u32) v i in
+ let* i2 = usize_add i 1 in
+ let* v1 = index_mut_back 0 in
+ clear_loop v1 i2
+ else Ok v
+
(** [loops::clear]:
Source: 'tests/src/loops.rs', lines 62:0-62:30 *)
let clear (v : alloc_vec_Vec u32) : result (alloc_vec_Vec u32) =
- admit
+ clear_loop v 0
+
+(** [loops::list_mem]: loop 0:
+ 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))
+ =
+ begin match ls with
+ | List_Cons y tl -> if y = x then Ok true else list_mem_loop x tl
+ | List_Nil -> Ok false
+ end
(** [loops::list_mem]:
Source: 'tests/src/loops.rs', lines 76:0-76:52 *)
let list_mem (x : u32) (ls : list_t u32) : result bool =
- admit
+ list_mem_loop x ls
+
+(** [loops::list_nth_mut_loop]: loop 0:
+ 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))))
+ (decreases (list_nth_mut_loop_loop_decreases t ls i))
+ =
+ begin match ls with
+ | List_Cons x tl ->
+ if i = 0
+ then let back = fun ret -> Ok (List_Cons ret tl) in Ok (x, back)
+ else
+ let* i1 = u32_sub i 1 in
+ let* (x1, back) = list_nth_mut_loop_loop t tl i1 in
+ let back1 = fun ret -> let* tl1 = back ret in Ok (List_Cons x tl1) in
+ Ok (x1, back1)
+ | List_Nil -> Fail Failure
+ end
(** [loops::list_nth_mut_loop]:
Source: 'tests/src/loops.rs', lines 88:0-88:71 *)
@@ -93,12 +140,44 @@ let list_nth_mut_loop
(t : Type0) (ls : list_t t) (i : u32) :
result (t & (t -> result (list_t t)))
=
- admit
+ list_nth_mut_loop_loop t ls i
+
+(** [loops::list_nth_shared_loop]: loop 0:
+ 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))
+ =
+ begin match ls with
+ | List_Cons x tl ->
+ if i = 0
+ then Ok x
+ else let* i1 = u32_sub i 1 in list_nth_shared_loop_loop t tl i1
+ | List_Nil -> Fail Failure
+ end
(** [loops::list_nth_shared_loop]:
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 =
- admit
+ list_nth_shared_loop_loop t ls i
+
+(** [loops::get_elem_mut]: loop 0:
+ 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))))
+ (decreases (get_elem_mut_loop_decreases x ls))
+ =
+ begin match ls with
+ | List_Cons y tl ->
+ if y = x
+ then let back = fun ret -> Ok (List_Cons ret tl) in Ok (y, back)
+ else
+ let* (i, back) = get_elem_mut_loop x tl in
+ let back1 = fun ret -> let* tl1 = back ret in Ok (List_Cons y tl1) in
+ Ok (i, back1)
+ | List_Nil -> Fail Failure
+ end
(** [loops::get_elem_mut]:
Source: 'tests/src/loops.rs', lines 113:0-113:73 *)
@@ -106,13 +185,32 @@ let get_elem_mut
(slots : alloc_vec_Vec (list_t usize)) (x : usize) :
result (usize & (usize -> result (alloc_vec_Vec (list_t usize))))
=
- admit
+ let* (ls, index_mut_back) =
+ alloc_vec_Vec_index_mut (list_t usize) usize
+ (core_slice_index_SliceIndexUsizeSliceTInst (list_t usize)) slots 0 in
+ let* (i, back) = get_elem_mut_loop x ls in
+ let back1 = fun ret -> let* l = back ret in index_mut_back l in
+ Ok (i, back1)
+
+(** [loops::get_elem_shared]: loop 0:
+ 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))
+ =
+ begin match ls with
+ | List_Cons y tl -> if y = x then Ok y else get_elem_shared_loop x tl
+ | List_Nil -> Fail Failure
+ end
(** [loops::get_elem_shared]:
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 =
- admit
+ let* ls =
+ alloc_vec_Vec_index (list_t usize) usize
+ (core_slice_index_SliceIndexUsizeSliceTInst (list_t usize)) slots 0 in
+ get_elem_shared_loop x ls
(** [loops::id_mut]:
Source: 'tests/src/loops.rs', lines 145:0-145:50 *)
@@ -127,19 +225,85 @@ let id_mut
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: '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))))
+ (decreases (list_nth_mut_loop_with_id_loop_decreases t i ls))
+ =
+ begin match ls with
+ | List_Cons x tl ->
+ if i = 0
+ then let back = fun ret -> Ok (List_Cons ret tl) in Ok (x, back)
+ else
+ let* i1 = u32_sub i 1 in
+ let* (x1, back) = list_nth_mut_loop_with_id_loop t i1 tl in
+ let back1 = fun ret -> let* tl1 = back ret in Ok (List_Cons x tl1) in
+ Ok (x1, back1)
+ | List_Nil -> Fail Failure
+ end
+
(** [loops::list_nth_mut_loop_with_id]:
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)))
=
- admit
+ let* (ls1, id_mut_back) = id_mut t ls in
+ let* (x, back) = list_nth_mut_loop_with_id_loop t i ls1 in
+ let back1 = fun ret -> let* l = back ret in id_mut_back l in
+ Ok (x, back1)
+
+(** [loops::list_nth_shared_loop_with_id]: loop 0:
+ 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)
+ (decreases (list_nth_shared_loop_with_id_loop_decreases t i ls))
+ =
+ begin match ls with
+ | List_Cons x tl ->
+ if i = 0
+ then Ok x
+ else let* i1 = u32_sub i 1 in list_nth_shared_loop_with_id_loop t i1 tl
+ | List_Nil -> Fail Failure
+ end
(** [loops::list_nth_shared_loop_with_id]:
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 =
- admit
+ 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: '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))))
+ (decreases (list_nth_mut_loop_pair_loop_decreases t ls0 ls1 i))
+ =
+ begin match ls0 with
+ | List_Cons x0 tl0 ->
+ begin match ls1 with
+ | List_Cons x1 tl1 ->
+ if i = 0
+ then
+ let back'a = fun ret -> Ok (List_Cons ret tl0) in
+ let back'b = fun ret -> Ok (List_Cons ret tl1) in
+ Ok ((x0, x1), back'a, back'b)
+ else
+ let* i1 = u32_sub i 1 in
+ let* (p, back'a, back'b) = list_nth_mut_loop_pair_loop t tl0 tl1 i1 in
+ let back'a1 =
+ fun ret -> let* tl01 = back'a ret in Ok (List_Cons x0 tl01) in
+ let back'b1 =
+ fun ret -> let* tl11 = back'b ret in Ok (List_Cons x1 tl11) in
+ Ok (p, back'a1, back'b1)
+ | List_Nil -> Fail Failure
+ end
+ | List_Nil -> Fail Failure
+ end
(** [loops::list_nth_mut_loop_pair]:
Source: 'tests/src/loops.rs', lines 184:0-188:27 *)
@@ -147,13 +311,62 @@ 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)))
=
- admit
+ list_nth_mut_loop_pair_loop t ls0 ls1 i
+
+(** [loops::list_nth_shared_loop_pair]: loop 0:
+ 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))
+ (decreases (list_nth_shared_loop_pair_loop_decreases t ls0 ls1 i))
+ =
+ begin match ls0 with
+ | List_Cons x0 tl0 ->
+ begin match ls1 with
+ | List_Cons x1 tl1 ->
+ if i = 0
+ then Ok (x0, x1)
+ else let* i1 = u32_sub i 1 in list_nth_shared_loop_pair_loop t tl0 tl1 i1
+ | List_Nil -> Fail Failure
+ end
+ | List_Nil -> Fail Failure
+ end
(** [loops::list_nth_shared_loop_pair]:
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) =
- admit
+ list_nth_shared_loop_pair_loop t ls0 ls1 i
+
+(** [loops::list_nth_mut_loop_pair_merge]: loop 0:
+ 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)))))
+ (decreases (list_nth_mut_loop_pair_merge_loop_decreases t ls0 ls1 i))
+ =
+ begin match ls0 with
+ | List_Cons x0 tl0 ->
+ begin match ls1 with
+ | List_Cons x1 tl1 ->
+ if i = 0
+ then
+ let back =
+ fun ret ->
+ let (x, x2) = ret in Ok (List_Cons x tl0, List_Cons x2 tl1) in
+ Ok ((x0, x1), back)
+ else
+ let* i1 = u32_sub i 1 in
+ let* (p, back) = list_nth_mut_loop_pair_merge_loop t tl0 tl1 i1 in
+ let back1 =
+ fun ret ->
+ let* (tl01, tl11) = back ret in
+ Ok (List_Cons x0 tl01, List_Cons x1 tl11) in
+ Ok (p, back1)
+ | List_Nil -> Fail Failure
+ end
+ | List_Nil -> Fail Failure
+ end
(** [loops::list_nth_mut_loop_pair_merge]:
Source: 'tests/src/loops.rs', lines 233:0-237:27 *)
@@ -161,13 +374,58 @@ 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))))
=
- admit
+ list_nth_mut_loop_pair_merge_loop t ls0 ls1 i
+
+(** [loops::list_nth_shared_loop_pair_merge]: loop 0:
+ 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))
+ (decreases (list_nth_shared_loop_pair_merge_loop_decreases t ls0 ls1 i))
+ =
+ begin match ls0 with
+ | List_Cons x0 tl0 ->
+ begin match ls1 with
+ | List_Cons x1 tl1 ->
+ if i = 0
+ then Ok (x0, x1)
+ else
+ let* i1 = u32_sub i 1 in
+ list_nth_shared_loop_pair_merge_loop t tl0 tl1 i1
+ | List_Nil -> Fail Failure
+ end
+ | List_Nil -> Fail Failure
+ end
(** [loops::list_nth_shared_loop_pair_merge]:
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) =
- admit
+ list_nth_shared_loop_pair_merge_loop t ls0 ls1 i
+
+(** [loops::list_nth_mut_shared_loop_pair]: loop 0:
+ 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))))
+ (decreases (list_nth_mut_shared_loop_pair_loop_decreases t ls0 ls1 i))
+ =
+ begin match ls0 with
+ | List_Cons x0 tl0 ->
+ begin match ls1 with
+ | List_Cons x1 tl1 ->
+ if i = 0
+ then let back = fun ret -> Ok (List_Cons ret tl0) in Ok ((x0, x1), back)
+ else
+ let* i1 = u32_sub i 1 in
+ let* (p, back) = list_nth_mut_shared_loop_pair_loop t tl0 tl1 i1 in
+ let back1 = fun ret -> let* tl01 = back ret in Ok (List_Cons x0 tl01)
+ in
+ Ok (p, back1)
+ | List_Nil -> Fail Failure
+ end
+ | List_Nil -> Fail Failure
+ end
(** [loops::list_nth_mut_shared_loop_pair]:
Source: 'tests/src/loops.rs', lines 269:0-273:23 *)
@@ -175,7 +433,32 @@ 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)))
=
- admit
+ list_nth_mut_shared_loop_pair_loop t ls0 ls1 i
+
+(** [loops::list_nth_mut_shared_loop_pair_merge]: loop 0:
+ 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))))
+ (decreases (list_nth_mut_shared_loop_pair_merge_loop_decreases t ls0 ls1 i))
+ =
+ begin match ls0 with
+ | List_Cons x0 tl0 ->
+ begin match ls1 with
+ | List_Cons x1 tl1 ->
+ if i = 0
+ then let back = fun ret -> Ok (List_Cons ret tl0) in Ok ((x0, x1), back)
+ else
+ let* i1 = u32_sub i 1 in
+ let* (p, back) = list_nth_mut_shared_loop_pair_merge_loop t tl0 tl1 i1
+ in
+ let back1 = fun ret -> let* tl01 = back ret in Ok (List_Cons x0 tl01)
+ in
+ Ok (p, back1)
+ | List_Nil -> Fail Failure
+ end
+ | List_Nil -> Fail Failure
+ end
(** [loops::list_nth_mut_shared_loop_pair_merge]:
Source: 'tests/src/loops.rs', lines 288:0-292:23 *)
@@ -183,7 +466,31 @@ 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)))
=
- admit
+ list_nth_mut_shared_loop_pair_merge_loop t ls0 ls1 i
+
+(** [loops::list_nth_shared_mut_loop_pair]: loop 0:
+ 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))))
+ (decreases (list_nth_shared_mut_loop_pair_loop_decreases t ls0 ls1 i))
+ =
+ begin match ls0 with
+ | List_Cons x0 tl0 ->
+ begin match ls1 with
+ | List_Cons x1 tl1 ->
+ if i = 0
+ then let back = fun ret -> Ok (List_Cons ret tl1) in Ok ((x0, x1), back)
+ else
+ let* i1 = u32_sub i 1 in
+ let* (p, back) = list_nth_shared_mut_loop_pair_loop t tl0 tl1 i1 in
+ let back1 = fun ret -> let* tl11 = back ret in Ok (List_Cons x1 tl11)
+ in
+ Ok (p, back1)
+ | List_Nil -> Fail Failure
+ end
+ | List_Nil -> Fail Failure
+ end
(** [loops::list_nth_shared_mut_loop_pair]:
Source: 'tests/src/loops.rs', lines 307:0-311:23 *)
@@ -191,7 +498,32 @@ 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)))
=
- admit
+ list_nth_shared_mut_loop_pair_loop t ls0 ls1 i
+
+(** [loops::list_nth_shared_mut_loop_pair_merge]: loop 0:
+ 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))))
+ (decreases (list_nth_shared_mut_loop_pair_merge_loop_decreases t ls0 ls1 i))
+ =
+ begin match ls0 with
+ | List_Cons x0 tl0 ->
+ begin match ls1 with
+ | List_Cons x1 tl1 ->
+ if i = 0
+ then let back = fun ret -> Ok (List_Cons ret tl1) in Ok ((x0, x1), back)
+ else
+ let* i1 = u32_sub i 1 in
+ let* (p, back) = list_nth_shared_mut_loop_pair_merge_loop t tl0 tl1 i1
+ in
+ let back1 = fun ret -> let* tl11 = back ret in Ok (List_Cons x1 tl11)
+ in
+ Ok (p, back1)
+ | List_Nil -> Fail Failure
+ end
+ | List_Nil -> Fail Failure
+ end
(** [loops::list_nth_shared_mut_loop_pair_merge]:
Source: 'tests/src/loops.rs', lines 326:0-330:23 *)
@@ -199,7 +531,7 @@ 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)))
=
- admit
+ list_nth_shared_mut_loop_pair_merge_loop t ls0 ls1 i
(** [loops::ignore_input_mut_borrow]: loop 0:
Source: 'tests/src/loops.rs', lines 345:0-349:1 *)