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
|
-- |
-- Module: Data.Reify.Graph
-- Copyright: (c) 2009 Andy Gill
-- License: BSD3
--
-- Maintainer: Andy Gill <andygill@ku.edu>
-- Stability: unstable
-- Portability: ghc
--
-- This is the shared definition of a 'Graph' in Data.Reify.
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE UndecidableInstances #-}
module Data.Reify.Graph (
Graph(..),
Unique
) where
-- | 'Graph' is a basic graph structure over nodes of the higher kind 'e', with a single root.
-- There is an assumption that there is no Unique used in a node which does not have a
-- corresponding entry is the association list.
-- The idea with this structure is that it is trivial to convert into an 'Array',
-- 'IntMap', or into a Martin Erwig's Functional Graph, as required.
data Graph e = Graph [(Unique,e Unique)] Unique
type Unique = Int
-- | If 'e' is s Functor, and 'e' is 'Show'-able, then we can 'Show' a 'Graph'.
instance (Show (e Unique)) => Show (Graph e) where
show (Graph netlist start) = "let " ++ show [ (u,e)
| (u,e) <- netlist
] ++ " in " ++ show start
|
