graph-rewriting-0.8.0: Monadic graph rewriting of hypergraphs with ports and multiedges
Safe HaskellSafe-Inferred
LanguageHaskell2010

GraphRewriting.Graph.Write.Unsafe

Description

This modules provides variants of the functions in GraphRewriting.Graph.Write for transforming the graph, but without checking for changed port assignments, which could lead to an inconsistent state. Therefore these should only be used (for increased efficiency) if the modifications do not change the graph structure (such as in layouting), or you really know what you are doing. Note that the functions provided by this library never change the length of the port list

Documentation

writeNode :: Node -> n -> Rewrite n () Source #

modifyNode :: Node -> (n -> n) -> Rewrite n () Source #

updateNode :: View v n => Node -> v -> Rewrite n () Source #

adjustNode :: View v n => Node -> (v -> v) -> Rewrite n () Source #

adjustNodeM :: (View [Port] n, View v n) => Node -> (v -> Rewrite n v) -> Rewrite n () Source #

unregister :: Node -> [Edge] -> Rewrite n () Source #

register :: Node -> [Edge] -> Rewrite n () Source #

module GraphRewriting.Graph.Types