dune fmt

3 files changed, 56 insertions, 52 deletions

diff --git a/test/unit/kernel/EphemeralRelation.ml b/test/unit/kernel/EphemeralRelation.ml
index a72409b..f75fd0d 100644
--- a/test/unit/kernel/EphemeralRelation.ml
+++ b/test/unit/kernel/EphemeralRelation.ml
@@ -1,5 +1,4 @@
 open Alcotest
-
 module Concepts = Rnt.Concepts
 module Protocols = Rnt.Protocols
 
@@ -14,8 +13,8 @@ module Derivation = struct
   let describe _ =
     Ok
       (BatMap.String.singleton "value"
-         { Protocols.Schematics.domain = "integer";
-           provenance = [{Protocols.Schematics.source = ["example"]; attribute = "value"}] } )
+         { Protocols.Schematics.domain= "integer";
+           provenance= [{Protocols.Schematics.source= ["example"]; attribute= "value"}] } )
 
   let modes {declared; _} = Ok declared
 
@@ -31,13 +30,13 @@ end
 module Derived = Rnt.Kernel.EphemeralRelation.Make (Derivation)
 
 let member n =
-  { Concepts.Tuple.type_ = "example";
-    attributes = BatMap.String.singleton "value" (Concepts.Value.Integer n) }
+  { Concepts.Tuple.type_= "example";
+    attributes= BatMap.String.singleton "value" (Concepts.Value.Integer n) }
 
 let plan_over cardinality =
-  { Derivation.name = "the-derivation";
-    members = [member 1; member 2; member 3];
-    declared =
+  { Derivation.name= "the-derivation";
+    members= [member 1; member 2; member 3];
+    declared=
       Concepts.Mode.of_list
         [Concepts.Mode.enumerable cardinality; Concepts.Mode.decides_when ["value"]] }
 
@@ -46,9 +45,9 @@ let derive plan = Derived.derive plan |> Helpers.condition_as_failure
 let values tuples =
   BatFingerTree.to_list tuples
   |> List.filter_map (fun tuple ->
-         match BatMap.String.find_opt "value" tuple.Concepts.Tuple.attributes with
-         | Some (Concepts.Value.Integer n) -> Some n
-         | _ -> None )
+      match BatMap.String.find_opt "value" tuple.Concepts.Tuple.attributes with
+      | Some (Concepts.Value.Integer n) -> Some n
+      | _ -> None )
   |> List.sort compare
 
 let commit = Concepts.Hash.hash_of_bytes (Bytes.of_string "a-commit")
@@ -92,8 +91,7 @@ let a_countable_derivation_decides_only () =
     end
     |> Helpers.condition_as_failure
   in
-  check bool "no enumeration is offered" false
-    (Option.is_some (Protocols.Enumerable.from derived));
+  check bool "no enumeration is offered" false (Option.is_some (Protocols.Enumerable.from derived));
   check bool "membership is still decided" true holds;
   check bool "and still refused" false rejects
 
@@ -115,10 +113,11 @@ let a_derivation_describes_itself () =
         ( BatMap.String.values description
         |> BatList.of_enum
         |> List.concat_map (fun attribute ->
-               attribute.Protocols.Schematics.provenance
-               |> List.map (fun origin ->
-                      String.concat "/" origin.Protocols.Schematics.source
-                      ^ "/" ^ origin.Protocols.Schematics.attribute ) ) )
+            attribute.Protocols.Schematics.provenance
+            |> List.map (fun origin ->
+                String.concat "/" origin.Protocols.Schematics.source
+                ^ "/"
+                ^ origin.Protocols.Schematics.attribute ) ) )
   | _ -> fail "a derived relation describes itself as a relation"
 
 let releasing_a_derivation_releases_its_inputs () =
@@ -143,8 +142,7 @@ let releasing_a_derivation_releases_its_inputs () =
 let suites () =
   [ ( "kernel/ephemeral-relation",
       [ test_case "identity-is-the-derivation" `Quick identity_is_the_derivation;
-        test_case "an-exhaustible-derivation-enumerates" `Quick
-          an_exhaustible_derivation_enumerates;
+        test_case "an-exhaustible-derivation-enumerates" `Quick an_exhaustible_derivation_enumerates;
         test_case "a-countable-derivation-decides-only" `Quick a_countable_derivation_decides_only;
         test_case "a-derivation-describes-itself" `Quick a_derivation_describes_itself;
         test_case "releasing-a-derivation-releases-its-inputs" `Quick
diff --git a/test/unit/kernel/Merkle.ml b/test/unit/kernel/Merkle.ml
index 85c756c..eaff92d 100644
--- a/test/unit/kernel/Merkle.ml
+++ b/test/unit/kernel/Merkle.ml
@@ -2,9 +2,10 @@ open Rnt
 
 module Make (S : Abstract.Storage.STORAGE) (C : Helpers.Storage.CONFIGURATOR) = struct
   open Alcotest
-
   module H = Helpers.Storage.Make (S) (C)
-  module T = Rnt.Kernel.Merkle.Interface (S) (Rnt.Kernel.Merkle.StringKey) (Rnt.Kernel.Merkle.StringKey)
+
+  module T =
+    Rnt.Kernel.Merkle.Interface (S) (Rnt.Kernel.Merkle.StringKey) (Rnt.Kernel.Merkle.StringKey)
 
   (* TODO: be a bit more comprehensive (ideally, we want to test splits as well) *)
   let insert_and_lookup conn =
@@ -12,10 +13,11 @@ module Make (S : Abstract.Storage.STORAGE) (C : Helpers.Storage.CONFIGURATOR) =
       begin
         let open Utilities.Result in
         let* tx = S.start conn in
-        let* node = T.empty
-                    |> T.insert tx "k1" "v1"
-                    |> fmap (T.insert tx "k2" "v2")
-                    |> fmap (T.insert tx "k3" "v3")
+        let* node =
+          T.empty
+          |> T.insert tx "k1" "v1"
+          |> fmap (T.insert tx "k2" "v2")
+          |> fmap (T.insert tx "k3" "v3")
         in
         let* node' = T.insert tx "k3" "toodles" node in
         let* v1 = T.lookup tx "k1" node in
@@ -31,7 +33,8 @@ module Make (S : Abstract.Storage.STORAGE) (C : Helpers.Storage.CONFIGURATOR) =
     check (option string) "that in-memory reads from the first write work properly" (Some "v1") v1;
     check (option string) "that in-memory reads from the second write work properly" (Some "v2") v2;
     check (option string) "that in-memory reads from the third write work properly" (Some "v3") v3;
-    check (option string) "that in-memory reads from a value replacement work properly" (Some "toodles") v3';
+    check (option string) "that in-memory reads from a value replacement work properly"
+      (Some "toodles") v3';
     check (option string) "that in-memory reads from a non-existent key returns nothing" None bogus
 
   let batching conn =
@@ -40,10 +43,12 @@ module Make (S : Abstract.Storage.STORAGE) (C : Helpers.Storage.CONFIGURATOR) =
         let open Utilities.Result in
         let* tx = S.start conn in
         let intermediate = ref None in
-        let* final = T.with_batch tx (fun () ->
-                         let* i = T.empty |> T.insert tx "tree" "maple" in
-                         intermediate := Some (T.hash_of i);
-                         T.insert tx "tree" "spruce" i) in
+        let* final =
+          T.with_batch tx (fun () ->
+              let* i = T.empty |> T.insert tx "tree" "maple" in
+              intermediate := Some (T.hash_of i);
+              T.insert tx "tree" "spruce" i )
+        in
         let* () = S.commit tx in
         Ok (Option.get !intermediate, T.hash_of final)
       end
@@ -62,16 +67,16 @@ module Make (S : Abstract.Storage.STORAGE) (C : Helpers.Storage.CONFIGURATOR) =
     check bool "that the intermediate node does not get persisted" true (Option.is_none i_node);
     check bool "that the final node does get persisted" true (Option.is_some f_node)
 
-
   let persistence conn =
     let addr =
       begin
         let open Utilities.Result in
         let* tx = S.start conn in
-        let* node = T.empty
-                    |> T.insert tx "k1" "v1"
-                    |> fmap (T.insert tx "k2" "v2")
-                    |> fmap (T.insert tx "k3" "v3")
+        let* node =
+          T.empty
+          |> T.insert tx "k1" "v1"
+          |> fmap (T.insert tx "k2" "v2")
+          |> fmap (T.insert tx "k3" "v3")
         in
         let* () = S.commit tx in
         Ok (T.hash_of node)
@@ -99,10 +104,11 @@ module Make (S : Abstract.Storage.STORAGE) (C : Helpers.Storage.CONFIGURATOR) =
       begin
         let open Utilities.Result in
         let* tx = S.start conn in
-        let* node = T.empty
-                    |> T.insert tx "k1" "v1"
-                    |> fmap (T.insert tx "k2" "v2")
-                    |> fmap (T.insert tx "k3" "v3")
+        let* node =
+          T.empty
+          |> T.insert tx "k1" "v1"
+          |> fmap (T.insert tx "k2" "v2")
+          |> fmap (T.insert tx "k3" "v3")
         in
         let* keys = T.fold_left tx (fun acc k _ -> k :: acc) [] node |> Result.map List.rev in
         let* values = T.fold_left tx (fun acc _ v -> v :: acc) [] node |> Result.map List.rev in
@@ -111,8 +117,10 @@ module Make (S : Abstract.Storage.STORAGE) (C : Helpers.Storage.CONFIGURATOR) =
       end
       |> Helpers.condition_as_failure
     in
-    check (list string) "that keys are properly enumerated from left to right" ["k1"; "k2"; "k3"] keys;
-    check (list string) "that values are properly enumerated from left to right" ["v1"; "v2"; "v3"] values
+    check (list string) "that keys are properly enumerated from left to right" ["k1"; "k2"; "k3"]
+      keys;
+    check (list string) "that values are properly enumerated from left to right" ["v1"; "v2"; "v3"]
+      values
 
   (* TODO: this will need `remove` *)
   (* let determinism _conn = *)
@@ -120,10 +128,10 @@ module Make (S : Abstract.Storage.STORAGE) (C : Helpers.Storage.CONFIGURATOR) =
 
   let suite prefix =
     ( "merkle/" ^ prefix,
-      [test_case "insert-and-lookup" `Quick (H.with_connection insert_and_lookup "merkle-test");
-       test_case "batching" `Quick (H.with_connection batching "merkle-test");
-       test_case "persistence" `Quick (H.with_connection persistence "merkle-test");
-       test_case "iteration" `Quick (H.with_connection iteration "merkle-test")])
+      [ test_case "insert-and-lookup" `Quick (H.with_connection insert_and_lookup "merkle-test");
+        test_case "batching" `Quick (H.with_connection batching "merkle-test");
+        test_case "persistence" `Quick (H.with_connection persistence "merkle-test");
+        test_case "iteration" `Quick (H.with_connection iteration "merkle-test") ] )
 end
 
 module LMDB = Make (Rnt.Backend.Storage.LMDB) (Helpers.Storage.LMDB_Configurator)
diff --git a/test/unit/kernel/SubstantialRelation.ml b/test/unit/kernel/SubstantialRelation.ml
index f639599..db13026 100644
--- a/test/unit/kernel/SubstantialRelation.ml
+++ b/test/unit/kernel/SubstantialRelation.ml
@@ -2,16 +2,14 @@ open Rnt
 
 module Make (S : Abstract.Storage.STORAGE) (C : Helpers.Storage.CONFIGURATOR) = struct
   open Alcotest
-
   module H = Helpers.Storage.Make (S) (C)
   module SR = Rnt.Kernel.SubstantialRelation.Make (S)
 
-  let hash s =
-    Concepts.Blob.blob_of_bytes (Bytes.of_string s) |> Concepts.Hash.hash_of_blob
+  let hash s = Concepts.Blob.blob_of_bytes (Bytes.of_string s) |> Concepts.Hash.hash_of_blob
 
   let alaric =
-    { Concepts.Tuple.type_ = "employee";
-      attributes =
+    { Concepts.Tuple.type_= "employee";
+      attributes=
         BatMap.String.empty
         |> BatMap.String.add "name" (Concepts.Value.String "Alaric")
         |> BatMap.String.add "age" (Concepts.Value.Integer 42) }
@@ -40,8 +38,8 @@ module Make (S : Abstract.Storage.STORAGE) (C : Helpers.Storage.CONFIGURATOR) =
     check bool "the tuple that was asserted" true
       (List.for_all
          (fun tuple ->
-           Concepts.Hash.hash_equals (Concepts.Tuple.hash tuple) (Concepts.Tuple.hash alaric))
-         enumerated)
+           Concepts.Hash.hash_equals (Concepts.Tuple.hash tuple) (Concepts.Tuple.hash alaric) )
+         enumerated )
 
   let suite prefix =
     ( "substantial-relation/" ^ prefix,