| Copyright | (c) 2018-2019 Yann Herklotz |
|---|---|
| License | GPL-3 |
| Maintainer | yann [at] yannherklotz [dot] com |
| Stability | experimental |
| Portability | POSIX |
| Safe Haskell | None |
| Language | Haskell2010 |
Verismith.Circuit
Contents
Description
Definition of the circuit graph.
Synopsis
Circuit
The types for all the gates.
Newtype for the Circuit which implements a Graph from fgl.
Constructors
| Circuit | |
Fields
| |
Newtype for a node in the circuit, which is an 'LNode Gate'.
Newtype for a named edge which is empty, as it does not need a label.
generateAST :: Circuit -> Verilog ann Source #
Arguments
| :: Gen Circuit | The generated graph. It uses Arbitrary to generate random instances of each node |
Gen instance for a random acyclic DAG.
genRandomDAG :: IO Circuit Source #
Generate a random acyclic DAG with an IO instance.