From fd4b0b5152f94cd406f2e5de86ce7ed0a4d2cbd0 Mon Sep 17 00:00:00 2001
From: Yann Herklotz <git@ymhg.org>
Date: Tue, 2 Apr 2019 19:47:32 +0100
Subject: Large refactor with passing tests

---
 src/VeriFuzz/Internal/Circuit.hs | 38 --------------------------------------
 1 file changed, 38 deletions(-)
 delete mode 100644 src/VeriFuzz/Internal/Circuit.hs

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

diff --git a/src/VeriFuzz/Internal/Circuit.hs b/src/VeriFuzz/Internal/Circuit.hs
deleted file mode 100644
index 832d0a4..0000000
--- a/src/VeriFuzz/Internal/Circuit.hs
+++ /dev/null
@@ -1,38 +0,0 @@
-{-|
-Module      : VeriFuzz.Internal.Circuit
-Description : Internal helpers for generation.
-Copyright   : (c) 2018-2019, Yann Herklotz
-License     : BSD-3
-Maintainer  : ymherklotz [at] gmail [dot] com
-Stability   : experimental
-Portability : POSIX
-
-Internal helpers for generation.
--}
-
-module VeriFuzz.Internal.Circuit where
-
-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
-only graph fun1 fun2 n = fun1 graph n == 0 && fun2 graph n /= 0
-
-inputs :: (Graph gr) => gr n e -> [Node]
-inputs graph = filterGr graph $ only graph G.indeg G.outdeg
-
-outputs :: (Graph gr) => gr n e -> [Node]
-outputs graph = filterGr graph $ only graph G.outdeg G.indeg
-- 
cgit