From 4ba440d842e9a0502b429fbc04e2be41c8037a4c Mon Sep 17 00:00:00 2001
From: Yann Herklotz <ymherklotz@gmail.com>
Date: Sat, 19 Jan 2019 19:20:33 +0000
Subject: Add brittany formatting instead of stylish-haskell

---
 src/VeriFuzz/Internal/Gen.hs | 21 ++++++++++++++-------
 1 file changed, 14 insertions(+), 7 deletions(-)

(limited to 'src/VeriFuzz/Internal/Gen.hs')

diff --git a/src/VeriFuzz/Internal/Gen.hs b/src/VeriFuzz/Internal/Gen.hs
index be275dd..6e44524 100644
--- a/src/VeriFuzz/Internal/Gen.hs
+++ b/src/VeriFuzz/Internal/Gen.hs
@@ -12,18 +12,25 @@ Internal helpers for generation.
 
 module VeriFuzz.Internal.Gen where
 
-import           Data.Graph.Inductive (Graph, Node)
-import qualified Data.Graph.Inductive as G
-import qualified Data.Text            as T
+import           Data.Graph.Inductive           ( Graph
+                                                , Node
+                                                )
+import qualified Data.Graph.Inductive          as G
+import qualified Data.Text                     as T
 
 fromNode :: Int -> T.Text
 fromNode node = T.pack $ "w" <> show node
 
 filterGr :: (Graph gr) => gr n e -> (Node -> Bool) -> [Node]
-filterGr graph f =
-  filter f $ G.nodes graph
-
-only :: (Graph gr) => gr n e -> (gr n e -> Node -> Int) -> (gr n e -> Node -> Int) -> Node -> Bool
+filterGr graph f = filter f $ G.nodes graph
+
+only
+  :: (Graph gr)
+  => gr n e
+  -> (gr n e -> Node -> Int)
+  -> (gr n e -> Node -> Int)
+  -> Node
+  -> Bool
 only graph fun1 fun2 n = fun1 graph n == 0 && fun2 graph n /= 0
 
 inputs :: (Graph gr) => gr n e -> [Node]
-- 
cgit