diff options
Diffstat (limited to 'tests/fstar/betree')
-rw-r--r-- | tests/fstar/betree/Betree.Clauses.Template.fst | 8 | ||||
-rw-r--r-- | tests/fstar/betree/Betree.Funs.fst | 8 |
2 files changed, 8 insertions, 8 deletions
diff --git a/tests/fstar/betree/Betree.Clauses.Template.fst b/tests/fstar/betree/Betree.Clauses.Template.fst index d3e07c7e..dbbfae2b 100644 --- a/tests/fstar/betree/Betree.Clauses.Template.fst +++ b/tests/fstar/betree/Betree.Clauses.Template.fst @@ -7,28 +7,28 @@ open Betree.Types #set-options "--z3rlimit 50 --fuel 1 --ifuel 1" (** [betree::betree::{betree::betree::List<T>#1}::len]: decreases clause - Source: 'src/betree.rs', lines 276:4-284:5 *) + Source: 'src/betree.rs', lines 278:8-284:5 *) unfold let betree_List_len_loop_decreases (t : Type0) (self : betree_List_t t) (len : u64) : nat = admit () (** [betree::betree::{betree::betree::List<T>#1}::reverse]: decreases clause - Source: 'src/betree.rs', lines 304:4-312:5 *) + Source: 'src/betree.rs', lines 305:8-312:5 *) unfold let betree_List_reverse_loop_decreases (t : Type0) (self : betree_List_t t) (out : betree_List_t t) : nat = admit () (** [betree::betree::{betree::betree::List<T>#1}::split_at]: decreases clause - Source: 'src/betree.rs', lines 287:4-302:5 *) + Source: 'src/betree.rs', lines 289:8-302:5 *) unfold let betree_List_split_at_loop_decreases (t : Type0) (n : u64) (beg : betree_List_t t) (self : betree_List_t t) : nat = admit () (** [betree::betree::{betree::betree::List<(u64, T)>#2}::partition_at_pivot]: decreases clause - Source: 'src/betree.rs', lines 355:4-370:5 *) + Source: 'src/betree.rs', lines 358:8-370:5 *) unfold let betree_ListPairU64T_partition_at_pivot_loop_decreases (t : Type0) (pivot : u64) (beg : betree_List_t (u64 & t)) diff --git a/tests/fstar/betree/Betree.Funs.fst b/tests/fstar/betree/Betree.Funs.fst index de3ac13c..53356bdb 100644 --- a/tests/fstar/betree/Betree.Funs.fst +++ b/tests/fstar/betree/Betree.Funs.fst @@ -76,7 +76,7 @@ let betree_upsert_update end (** [betree::betree::{betree::betree::List<T>#1}::len]: loop 0: - Source: 'src/betree.rs', lines 276:4-284:5 *) + Source: 'src/betree.rs', lines 278:8-284:5 *) let rec betree_List_len_loop (t : Type0) (self : betree_List_t t) (len : u64) : Tot (result u64) (decreases (betree_List_len_loop_decreases t self len)) @@ -93,7 +93,7 @@ let betree_List_len (t : Type0) (self : betree_List_t t) : result u64 = betree_List_len_loop t self 0 (** [betree::betree::{betree::betree::List<T>#1}::reverse]: loop 0: - Source: 'src/betree.rs', lines 304:4-312:5 *) + Source: 'src/betree.rs', lines 305:8-312:5 *) let rec betree_List_reverse_loop (t : Type0) (self : betree_List_t t) (out : betree_List_t t) : Tot (result (betree_List_t t)) @@ -112,7 +112,7 @@ let betree_List_reverse betree_List_reverse_loop t self Betree_List_Nil (** [betree::betree::{betree::betree::List<T>#1}::split_at]: loop 0: - Source: 'src/betree.rs', lines 287:4-302:5 *) + Source: 'src/betree.rs', lines 289:8-302:5 *) let rec betree_List_split_at_loop (t : Type0) (n : u64) (beg : betree_List_t t) (self : betree_List_t t) : Tot (result ((betree_List_t t) & (betree_List_t t))) @@ -171,7 +171,7 @@ let betree_ListPairU64T_head_has_key end (** [betree::betree::{betree::betree::List<(u64, T)>#2}::partition_at_pivot]: loop 0: - Source: 'src/betree.rs', lines 355:4-370:5 *) + Source: 'src/betree.rs', lines 358:8-370:5 *) let rec betree_ListPairU64T_partition_at_pivot_loop (t : Type0) (pivot : u64) (beg : betree_List_t (u64 & t)) (end1 : betree_List_t (u64 & t)) (self : betree_List_t (u64 & t)) : |