ormolu

Author: martyall

bench/Bench/Binary.hs

@@ -1,12 +1,10 @@
 module Bench.Binary where
 
-import Protolude
-
+import Bench.Galois
 import Control.Monad.Random
 import Criterion.Main
 import Data.Field.Galois
-
-import Bench.Galois
+import Protolude
 
 type F2m = Binary 0x80000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000425
 

bench/Bench/Extension.hs

@@ -1,27 +1,31 @@
 module Bench.Extension where
 
-import Protolude
-
+import Bench.Galois
+import Bench.Prime
 import Control.Monad.Random
 import Criterion.Main
 import Data.Field.Galois
-
-import Bench.Galois
-import Bench.Prime
+import Protolude
 
 data PU
+
 instance IrreducibleMonic PU Fq where
   poly _ = X2 + 1
+
 type Fq2 = Extension PU Fq
 
 data PV
+
 instance IrreducibleMonic PV Fq2 where
   poly _ = X3 - 9 - Y X
+
 type Fq6 = Extension PV Fq2
 
 data PW
+
 instance IrreducibleMonic PW Fq6 where
   poly _ = X2 - Y X
+
 type Fq12 = Extension PW Fq6
 
 fq12 :: Fq12

bench/Bench/Galois.hs

@@ -1,27 +1,28 @@
 module Bench.Galois where
 
-import Protolude
-
 import Criterion.Main
 import Data.Field.Galois
 import GHC.Base
+import Protolude
 
-benchmark :: GaloisField k => String -> k -> k -> Benchmark
-benchmark s a b = bgroup s
-  [ bench "Addition" $
-    nf (uncurry (+)) (a, b)
-  , bench "Multiplication" $
-    nf (uncurry (*)) (a, b)
-  , bench "Negation" $
-    nf negate a
-  , bench "Subtraction" $
-    nf (uncurry (-)) (a, b)
-  , bench "Inversion" $
-    nf recip a
-  , bench "Division" $
-    nf (uncurry (/)) (a, b)
-  , bench "Frobenius endomorphism" $
-    nf frob a
-  , bench "Square root" $
-    nf sr a
-  ]
+benchmark :: (GaloisField k) => String -> k -> k -> Benchmark
+benchmark s a b =
+  bgroup
+    s
+    [ bench "Addition" $
+        nf (uncurry (+)) (a, b),
+      bench "Multiplication" $
+        nf (uncurry (*)) (a, b),
+      bench "Negation" $
+        nf negate a,
+      bench "Subtraction" $
+        nf (uncurry (-)) (a, b),
+      bench "Inversion" $
+        nf recip a,
+      bench "Division" $
+        nf (uncurry (/)) (a, b),
+      bench "Frobenius endomorphism" $
+        nf frob a,
+      bench "Square root" $
+        nf sr a
+    ]

bench/Bench/Prime.hs

@@ -1,12 +1,10 @@
 module Bench.Prime where
 
-import Protolude
-
+import Bench.Galois
 import Control.Monad.Random
 import Criterion.Main
 import Data.Field.Galois
-
-import Bench.Galois
+import Protolude
 
 type Fq = Prime 21888242871839275222246405745257275088696311157297823662689037894645226208583
 

bench/Main.hs

@@ -1,13 +1,12 @@
 module Main where
 
-import Protolude
-
-import Criterion.Main
-
 import Bench.Binary
 import Bench.Extension
 import Bench.Prime
+import Criterion.Main
+import Protolude
 
 main :: IO ()
-main = defaultMain
-  [benchBinary, benchExtension, benchPrime]
+main =
+  defaultMain
+    [benchBinary, benchExtension, benchPrime]

src/Data/Field/Galois/Base.hs

@@ -5,7 +5,7 @@ where
 
 import Control.Monad.Random (Random)
 import Data.Field (Field)
-import qualified Data.Group as G (Group (..))
+import Data.Group qualified as G (Group (..))
 import GHC.Natural (Natural)
 import Protolude hiding (one, quot, (-))
 import Test.QuickCheck (Arbitrary)