Format code

src/btree.ml

@@ -3,7 +3,7 @@ open Interpreter.Types
 open Interpreter.Values
 
 let print_b_tree_keys (mem : memory) (n_keys : int) (max_keys : int)
-    (node_addr : int) =
+  (node_addr : int) =
   Printf.printf "[node: %s; keys: { " (string_of_int node_addr);
   for i = 0 to n_keys - 1 do
     let v, sym =
@@ -82,10 +82,10 @@ let print_b_tree (mem : memory) =
       let value, _ =
         load_value mem
           (Int64.of_int
-             (int_of_string (string_of_value root_addr)
+             ( int_of_string (string_of_value root_addr)
              + 8
              + (4 * (int_of_string (string_of_value t) - 1))
-             + (4 * i)))
+             + (4 * i) ) )
           0l I32Type
       in
       children := !children @ [ int_of_string (string_of_value value) ]

src/concolic/store.ml

@@ -189,8 +189,7 @@ let rec eval (env : t) (e : Expr.t) : Value.t =
   | Extract (e', h, l) when h - l = 1 ->
     let v = int64_of_value (eval env e') in
     Num (I64 Int64.(logand (shift_right v (8 * l)) 0xffL))
-  | Extract (_, _, _) ->
-      assert false
+  | Extract (_, _, _) -> assert false
   | Concat (e1, e2) -> (
     let v1 = int64_of_value (eval env e1) in
     let v2 = int64_of_value (eval env e2) in

src/std.ml

@@ -1,6 +1,7 @@
 module Let_syntax = struct
   module Result = struct
     let ( let* ) = Result.bind
+
     let ( let+ ) v f = Result.map f v
   end
 end

tests/failing/dune

@@ -1,4 +1,2 @@
 (cram
- (deps
-  %{bin:wasp}
-  test1.wast))
+ (deps %{bin:wasp} test1.wast))

tests/passing/dune

@@ -1,4 +1,2 @@
 (cram
- (deps
-  %{bin:wasp}
-  test1.wast))
+ (deps %{bin:wasp} test1.wast))