aboutsummaryrefslogtreecommitdiffstats
path: root/src/VeriFuzz/Graph/Random.hs
diff options
context:
space:
mode:
authorYann Herklotz <ymherklotz@gmail.com>2019-01-19 23:12:25 +0000
committerYann Herklotz <ymherklotz@gmail.com>2019-01-19 23:12:25 +0000
commit64a0ae3600073f486462b1d056409954634b0084 (patch)
treea2315f2f075a2c91b88b0cb3bfaa581d702e2e48 /src/VeriFuzz/Graph/Random.hs
parent771ff2ccb2f07f5c60d4af260d236ee148de667f (diff)
downloadverismith-64a0ae3600073f486462b1d056409954634b0084.tar.gz
verismith-64a0ae3600073f486462b1d056409954634b0084.zip
Reformat with stylish-haskell
Diffstat (limited to 'src/VeriFuzz/Graph/Random.hs')
-rw-r--r--src/VeriFuzz/Graph/Random.hs17
1 files changed, 6 insertions, 11 deletions
diff --git a/src/VeriFuzz/Graph/Random.hs b/src/VeriFuzz/Graph/Random.hs
index 573c179..4b72b95 100644
--- a/src/VeriFuzz/Graph/Random.hs
+++ b/src/VeriFuzz/Graph/Random.hs
@@ -12,17 +12,12 @@ Define the random generation for the directed acyclic graph.
module VeriFuzz.Graph.Random where
-import Data.Graph.Inductive ( Context
- , LEdge
- )
-import qualified Data.Graph.Inductive as G
-import Data.Graph.Inductive.PatriciaTree
- ( Gr )
-import Data.List ( nub )
-import Test.QuickCheck ( Arbitrary
- , Gen
- )
-import qualified Test.QuickCheck as QC
+import Data.Graph.Inductive (Context, LEdge)
+import qualified Data.Graph.Inductive as G
+import Data.Graph.Inductive.PatriciaTree (Gr)
+import Data.List (nub)
+import Test.QuickCheck (Arbitrary, Gen)
+import qualified Test.QuickCheck as QC
dupFolder :: (Eq a, Eq b) => Context a b -> [Context a b] -> [Context a b]
dupFolder cont ns = unique cont : ns where unique (a, b, c, d) = (nub a, b, c, nub d)