diff options
Diffstat (limited to 'src/VeriFuzz/Graph')
| -rw-r--r-- | src/VeriFuzz/Graph/ASTGen.hs | 10 | ||||
| -rw-r--r-- | src/VeriFuzz/Graph/CodeGen.hs | 15 | ||||
| -rw-r--r-- | src/VeriFuzz/Graph/Random.hs | 17 | ||||
| -rw-r--r-- | src/VeriFuzz/Graph/RandomAlt.hs | 12 |
4 files changed, 19 insertions, 35 deletions
diff --git a/src/VeriFuzz/Graph/ASTGen.hs b/src/VeriFuzz/Graph/ASTGen.hs index ad7dd50..30dee04 100644 --- a/src/VeriFuzz/Graph/ASTGen.hs +++ b/src/VeriFuzz/Graph/ASTGen.hs @@ -12,12 +12,10 @@ Generates the AST from the graph directly. module VeriFuzz.Graph.ASTGen where -import Data.Foldable ( fold ) -import Data.Graph.Inductive ( LNode - , Node - ) -import qualified Data.Graph.Inductive as G -import Data.Maybe ( catMaybes ) +import Data.Foldable (fold) +import Data.Graph.Inductive (LNode, Node) +import qualified Data.Graph.Inductive as G +import Data.Maybe (catMaybes) import VeriFuzz.Circuit import VeriFuzz.Internal.Gen import VeriFuzz.Verilog.AST diff --git a/src/VeriFuzz/Graph/CodeGen.hs b/src/VeriFuzz/Graph/CodeGen.hs index 56b28aa..20c354a 100644 --- a/src/VeriFuzz/Graph/CodeGen.hs +++ b/src/VeriFuzz/Graph/CodeGen.hs @@ -15,16 +15,11 @@ module VeriFuzz.Graph.CodeGen ) where -import Data.Foldable ( fold ) -import Data.Graph.Inductive ( Graph - , LNode - , Node - , labNodes - , pre - ) -import Data.Maybe ( fromMaybe ) -import Data.Text ( Text ) -import qualified Data.Text as T +import Data.Foldable (fold) +import Data.Graph.Inductive (Graph, LNode, Node, labNodes, pre) +import Data.Maybe (fromMaybe) +import Data.Text (Text) +import qualified Data.Text as T import VeriFuzz.Circuit import VeriFuzz.Internal.Gen import VeriFuzz.Internal.Shared 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) diff --git a/src/VeriFuzz/Graph/RandomAlt.hs b/src/VeriFuzz/Graph/RandomAlt.hs index c5fad9e..e6d16bb 100644 --- a/src/VeriFuzz/Graph/RandomAlt.hs +++ b/src/VeriFuzz/Graph/RandomAlt.hs @@ -12,14 +12,10 @@ Define the random generation for the directed acyclic graph. module VeriFuzz.Graph.RandomAlt where -import qualified Data.Graph.Inductive.Arbitrary - as G -import Data.Graph.Inductive.PatriciaTree - ( Gr ) -import Test.QuickCheck ( Arbitrary - , Gen - ) -import qualified Test.QuickCheck as QC +import qualified Data.Graph.Inductive.Arbitrary as G +import Data.Graph.Inductive.PatriciaTree (Gr) +import Test.QuickCheck (Arbitrary, Gen) +import qualified Test.QuickCheck as QC randomDAG :: (Arbitrary l, Arbitrary e) => Gen (Gr l e) randomDAG = G.looplessGraph <$> QC.arbitrary |