Make a minor fix

1 files changed, 8 insertions, 9 deletions

diff --git a/tests/fstar/betree/BetreeMain.Funs.fst b/tests/fstar/betree/BetreeMain.Funs.fst
index b098d8ca..0c868f47 100644
--- a/tests/fstar/betree/BetreeMain.Funs.fst
+++ b/tests/fstar/betree/BetreeMain.Funs.fst
@@ -469,10 +469,10 @@ and betree_internal_lookup_in_children_back
   if key < self.betree_internal_pivot
   then
     let* n = betree_node_lookup_back self.betree_internal_left key st in
-    Return { self where betree_internal_left = n }
+    Return { self with betree_internal_left = n }
   else
     let* n = betree_node_lookup_back self.betree_internal_right key st in
-    Return { self where betree_internal_right = n }
+    Return { self with betree_internal_right = n }
 
 (** [betree_main::betree::Node::{5}::lookup_mut_in_bindings] *)
 let rec betree_node_lookup_mut_in_bindings_fwd
@@ -785,8 +785,7 @@ and betree_node_apply_messages_back
       Return (BetreeNodeInternal new_node, node_id_cnt0)
     else
       let* _ = betree_store_leaf_node_fwd node.betree_leaf_id content0 st0 in
-      Return (BetreeNodeLeaf { node where betree_leaf_size = len },
-        node_id_cnt)
+      Return (BetreeNodeLeaf { node with betree_leaf_size = len }, node_id_cnt)
   end
 
 (** [betree_main::betree::Internal::{4}::flush] *)
@@ -860,14 +859,14 @@ and betree_internal_flush_back
         betree_node_apply_messages_back self.betree_internal_right params
           node_id_cnt0 msgs_right st0 in
       Return
-        ({ self where betree_internal_left = n; betree_internal_right = n0 },
+        ({ self with betree_internal_left = n; betree_internal_right = n0 },
         node_id_cnt1)
-    else Return ({ self where betree_internal_left = n }, node_id_cnt0)
+    else Return ({ self with betree_internal_left = n }, node_id_cnt0)
   else
     let* (n, node_id_cnt0) =
       betree_node_apply_messages_back self.betree_internal_right params
         node_id_cnt msgs_right st in
-    Return ({ self where betree_internal_right = n }, node_id_cnt0)
+    Return ({ self with betree_internal_right = n }, node_id_cnt0)
 
 (** [betree_main::betree::Node::{5}::apply] *)
 let betree_node_apply_fwd
@@ -939,7 +938,7 @@ let betree_be_tree_apply_back
     betree_node_apply_back self.betree_be_tree_root self.betree_be_tree_params
       self.betree_be_tree_node_id_cnt key msg st in
   Return
-    { self where betree_be_tree_node_id_cnt = nic; betree_be_tree_root = n }
+    { self with betree_be_tree_node_id_cnt = nic; betree_be_tree_root = n }
 
 (** [betree_main::betree::BeTree::{6}::insert] *)
 let betree_be_tree_insert_fwd
@@ -1004,7 +1003,7 @@ let betree_be_tree_lookup_back
   result betree_be_tree_t
   =
   let* n = betree_node_lookup_back self.betree_be_tree_root key st in
-  Return { self where betree_be_tree_root = n }
+  Return { self with betree_be_tree_root = n }
 
 (** [betree_main::main] *)
 let main_fwd : result unit =