GraphRewriting.Pattern.Internal

Documentation

newtype Pattern n a

A pattern represents a graph scrutinisation that memorises all the scrutinised nodes during matching.

Constructors

Pattern

Fields

pattern :: Match -> ReaderT (Graph n) [] (Match, a)

Instances

Monad (Pattern n)

MonadPlus (Pattern n)

type Match = [Node]

Nodes matched in the evaluation of a pattern with the lastly matched node at the head