graph-rewriting-strategies-0.2.9: Evaluation strategies for port-graph rewriting systems

Safe Haskell	Safe-Inferred
Language	Haskell2010

GraphRewriting.Strategies.LeftmostOutermost

Synopsis

class LeftmostOutermost n where
- lmoPort :: n -> Maybe Port
getLmoPort :: LeftmostOutermost n => Node -> Pattern n Port
moveControl :: (View [Port] n, View Control n, LeftmostOutermost n) => Rule n
leftmostOutermost :: (View Control n, View [Port] n) => Rule n -> Rule n

Documentation

class LeftmostOutermost n where Source #

Gives us the the left port for a given node

Methods

lmoPort :: n -> Maybe Port Source #

Instances

Instances details

LeftmostOutermost n => LeftmostOutermost (Wrapper n) Source #
Instance details Defined in GraphRewriting.Strategies.LeftmostOutermost Methods lmoPort :: Wrapper n -> Maybe Port Source #

getLmoPort :: LeftmostOutermost n => Node -> Pattern n Port Source #

moveControl :: (View [Port] n, View Control n, LeftmostOutermost n) => Rule n Source #

leftmostOutermost :: (View Control n, View [Port] n) => Rule n -> Rule n Source #