GraphRewriting.Graph.Types

Documentation

data Graph n

Hypergraph that holds nodes of type n. Nodes can be referenced by type Node, edges by type Edge, see GraphRewriting.Graph.Read and GraphRewriting.Graph.Write

Instances

MonadReader (Graph n) (Rewrite n)

Methods

ask :: Rewrite n (Graph n)

local :: (Graph n -> Graph n) -> Rewrite n a -> Rewrite n a

reader :: (Graph n -> a) -> Rewrite n a

MonadState (Graph n) (Rewrite n)

Methods

get :: Rewrite n (Graph n)

put :: Graph n -> Rewrite n ()

state :: (Graph n -> (a, Graph n)) -> Rewrite n a

data Rewrite n a

Instances

Monad (Rewrite n)

Methods

(>>=) :: Rewrite n a -> (a -> Rewrite n b) -> Rewrite n b

(>>) :: Rewrite n a -> Rewrite n b -> Rewrite n b

return :: a -> Rewrite n a

fail :: String -> Rewrite n a

Functor (Rewrite n)

Methods

fmap :: (a -> b) -> Rewrite n a -> Rewrite n b

(<$) :: a -> Rewrite n b -> Rewrite n a

MonadFix (Rewrite n)

Methods

mfix :: (a -> Rewrite n a) -> Rewrite n a

Applicative (Rewrite n)

Methods

pure :: a -> Rewrite n a

(<*>) :: Rewrite n (a -> b) -> Rewrite n a -> Rewrite n b

(*>) :: Rewrite n a -> Rewrite n b -> Rewrite n b

(<*) :: Rewrite n a -> Rewrite n b -> Rewrite n a

MonadReader (Graph n) (Rewrite n)

Methods

ask :: Rewrite n (Graph n)

local :: (Graph n -> Graph n) -> Rewrite n a -> Rewrite n a

reader :: (Graph n -> a) -> Rewrite n a

MonadState (Graph n) (Rewrite n)

Methods

get :: Rewrite n (Graph n)

put :: Graph n -> Rewrite n ()

state :: (Graph n -> (a, Graph n)) -> Rewrite n a

data Node

Instances

Eq Node

Methods

(==) :: Node -> Node -> Bool

(/=) :: Node -> Node -> Bool

Ord Node

Methods

compare :: Node -> Node -> Ordering

(<) :: Node -> Node -> Bool

(<=) :: Node -> Node -> Bool

(>) :: Node -> Node -> Bool

(>=) :: Node -> Node -> Bool

max :: Node -> Node -> Node

min :: Node -> Node -> Node

Show Node

Methods

showsPrec :: Int -> Node -> ShowS

show :: Node -> String

showList :: [Node] -> ShowS

data Port

Instances

Eq Port

Methods

(==) :: Port -> Port -> Bool

(/=) :: Port -> Port -> Bool

Ord Port

Methods

compare :: Port -> Port -> Ordering

(<) :: Port -> Port -> Bool

(<=) :: Port -> Port -> Bool

(>) :: Port -> Port -> Bool

(>=) :: Port -> Port -> Bool

max :: Port -> Port -> Port

min :: Port -> Port -> Port

Show Edge

Methods

showsPrec :: Int -> Edge -> ShowS

show :: Edge -> String

showList :: [Edge] -> ShowS

type Edge

Arguments

 = Port

a hyperedge really, connecting a non-empty subset of the graph's nodes (see attachedNodes)