aboutsummaryrefslogtreecommitdiffstats
path: root/src/Verismith/Circuit/Base.hs
blob: 804fbfdbf523944c71d62067d2c5244b19f9049f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
-- |
-- Module      : Verismith.Circuit.Base
-- Description : Base types for the circuit module.
-- Copyright   : (c) 2019, Yann Herklotz Grave
-- License     : GPL-3
-- Maintainer  : yann [at] yannherklotz [dot] com
-- Stability   : experimental
-- Portability : POSIX
--
-- Base types for the circuit module.
module Verismith.Circuit.Base
  ( Gate (..),
    Circuit (..),
    CNode (..),
    CEdge (..),
  )
where

import Data.Graph.Inductive (Gr, LEdge, LNode)
import System.Random

-- | The types for all the gates.
data Gate
  = And
  | Or
  | Xor
  deriving (Show, Eq, Enum, Bounded, Ord)

-- | Newtype for the Circuit which implements a Graph from fgl.
newtype Circuit = Circuit {getCircuit :: Gr Gate ()}

-- | Newtype for a node in the circuit, which is an 'LNode Gate'.
newtype CNode = CNode {getCNode :: LNode Gate}

-- | Newtype for a named edge which is empty, as it does not need a label.
newtype CEdge = CEdge {getCEdge :: LEdge ()}

instance Random Gate where
  randomR (a, b) g =
    case randomR (fromEnum a, fromEnum b) g of
      (x, g') -> (toEnum x, g')

  random = randomR (minBound, maxBound)