Skip to content

Commit

Permalink
Regenerate the betree files
Browse files Browse the repository at this point in the history
  • Loading branch information
sonmarcho committed Nov 21, 2023
1 parent 46ab0fc commit 753f7e7
Show file tree
Hide file tree
Showing 12 changed files with 279 additions and 274 deletions.
114 changes: 57 additions & 57 deletions tests/coq/betree/BetreeMain_Funs.v

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion tests/coq/betree/BetreeMain_Opaque.v
Original file line number Diff line number Diff line change
Expand Up @@ -32,7 +32,7 @@ Axiom betree_utils_store_leaf_node
: u64 -> betree_List_t (u64 * u64) -> state -> result (state * unit)
.

(** [core::option::Option::{0}::unwrap]: forward function *)
(** [core::option::{core::option::Option<T>}::unwrap]: forward function *)
Axiom core_option_Option_unwrap :
forall(T : Type), option T -> state -> result (state * T)
.
Expand Down
32 changes: 16 additions & 16 deletions tests/fstar/betree/BetreeMain.Clauses.Template.fst
Original file line number Diff line number Diff line change
Expand Up @@ -6,94 +6,94 @@ open BetreeMain.Types

#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"

(** [betree_main::betree::List::{1}::len]: decreases clause *)
(** [betree_main::betree::{betree_main::betree::List<T>#1}::len]: decreases clause *)
unfold
let betree_List_len_decreases (t : Type0) (self : betree_List_t t) : nat =
admit ()

(** [betree_main::betree::List::{1}::split_at]: decreases clause *)
(** [betree_main::betree::{betree_main::betree::List<T>#1}::split_at]: decreases clause *)
unfold
let betree_List_split_at_decreases (t : Type0) (self : betree_List_t t)
(n : u64) : nat =
admit ()

(** [betree_main::betree::List::{2}::partition_at_pivot]: decreases clause *)
(** [betree_main::betree::{betree_main::betree::List<(u64, T)>#2}::partition_at_pivot]: decreases clause *)
unfold
let betree_List_partition_at_pivot_decreases (t : Type0)
let betree_ListTupleU64T_partition_at_pivot_decreases (t : Type0)
(self : betree_List_t (u64 & t)) (pivot : u64) : nat =
admit ()

(** [betree_main::betree::Node::{5}::lookup_first_message_for_key]: decreases clause *)
(** [betree_main::betree::{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)) : nat =
admit ()

(** [betree_main::betree::Node::{5}::apply_upserts]: decreases clause *)
(** [betree_main::betree::{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) (st : state) : nat =
admit ()

(** [betree_main::betree::Node::{5}::lookup_in_bindings]: decreases clause *)
(** [betree_main::betree::{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)) : nat =
admit ()

(** [betree_main::betree::Internal::{4}::lookup_in_children]: decreases clause *)
(** [betree_main::betree::{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) : nat =
admit ()

(** [betree_main::betree::Node::{5}::lookup]: decreases clause *)
(** [betree_main::betree::{betree_main::betree::Node#5}::lookup]: decreases clause *)
unfold
let betree_Node_lookup_decreases (self : betree_Node_t) (key : u64)
(st : state) : nat =
admit ()

(** [betree_main::betree::Node::{5}::filter_messages_for_key]: decreases clause *)
(** [betree_main::betree::{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)) : nat =
admit ()

(** [betree_main::betree::Node::{5}::lookup_first_message_after_key]: decreases clause *)
(** [betree_main::betree::{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)) : nat =
admit ()

(** [betree_main::betree::Node::{5}::apply_messages_to_internal]: decreases clause *)
(** [betree_main::betree::{betree_main::betree::Node#5}::apply_messages_to_internal]: decreases clause *)
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::Node::{5}::lookup_mut_in_bindings]: decreases clause *)
(** [betree_main::betree::{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)) : nat =
admit ()

(** [betree_main::betree::Node::{5}::apply_messages_to_leaf]: decreases clause *)
(** [betree_main::betree::{betree_main::betree::Node#5}::apply_messages_to_leaf]: decreases clause *)
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::Internal::{4}::flush]: decreases clause *)
(** [betree_main::betree::{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 =
admit ()

(** [betree_main::betree::Node::{5}::apply_messages]: decreases clause *)
(** [betree_main::betree::{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)
Expand Down
2 changes: 1 addition & 1 deletion tests/fstar/betree/BetreeMain.Clauses.fst
Original file line number Diff line number Diff line change
Expand Up @@ -114,7 +114,7 @@ let betree_List_split_at_decreases (t : Type0) (self : betree_List_t t)

(** [betree_main::betree::List::{2}::partition_at_pivot]: decreases clause *)
unfold
let betree_List_partition_at_pivot_decreases (t : Type0)
let betree_ListTupleU64T_partition_at_pivot_decreases (t : Type0)
(self : betree_List_t (u64 & t)) (pivot : u64) : betree_List_t (u64 & t) =
self

Expand Down
Loading

0 comments on commit 753f7e7

Please sign in to comment.