blob: 1891ff96f0825f6fbef2262db9177e4bda468dc7 (
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
|
{-|
Module : VeriFuzz.Circuit
Description : Definition of the circuit graph.
Copyright : (c) 2018-2019, Yann Herklotz Grave
License : BSD-3
Maintainer : ymherklotz [at] gmail [dot] com
Stability : experimental
Portability : POSIX
Definition of the circuit graph.
-}
module VeriFuzz.Circuit where
import Data.Graph.Inductive ( Gr
, LNode
)
import System.Random
import Test.QuickCheck
-- | 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 CNode = CNode { getCNode :: LNode Gate }
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)
instance Arbitrary Gate where
arbitrary = elements [And, Or, Xor]
|
