graph-rewriting-strategies 0.2.3 → 0.2.4
raw patch · 2 files changed
+7/−4 lines, 2 filesdep ~basedep ~graph-rewritingPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: base, graph-rewriting
API changes (from Hackage documentation)
- GraphRewriting.Strategies.Control: control :: Wrapper n -> Control
- GraphRewriting.Strategies.Control: instance [overlap ok] View Control (Wrapper n)
- GraphRewriting.Strategies.Control: instance [overlap ok] View v n => View v (Wrapper n)
- GraphRewriting.Strategies.Control: stack :: Control -> [Node]
- GraphRewriting.Strategies.Control: wrapped :: Wrapper n -> n
- GraphRewriting.Strategies.LeftmostOutermost: instance [overlap ok] LeftmostOutermost n => LeftmostOutermost (Wrapper n)
+ GraphRewriting.Strategies.Control: [control] :: Wrapper n -> Control
+ GraphRewriting.Strategies.Control: [stack] :: Control -> [Node]
+ GraphRewriting.Strategies.Control: [wrapped] :: Wrapper n -> n
+ GraphRewriting.Strategies.Control: instance Data.View.View GraphRewriting.Strategies.Control.Control (GraphRewriting.Strategies.Control.Wrapper n)
+ GraphRewriting.Strategies.Control: instance Data.View.View v n ⇒ Data.View.View v (GraphRewriting.Strategies.Control.Wrapper n)
+ GraphRewriting.Strategies.LeftmostOutermost: instance GraphRewriting.Strategies.LeftmostOutermost.LeftmostOutermost n ⇒ GraphRewriting.Strategies.LeftmostOutermost.LeftmostOutermost (GraphRewriting.Strategies.Control.Wrapper n)
- GraphRewriting.Strategies.LeftmostOutermost: getLmoPort :: LeftmostOutermost n => Node -> Pattern n Port
+ GraphRewriting.Strategies.LeftmostOutermost: getLmoPort :: (LeftmostOutermost n) ⇒ Node -> Pattern n Port
- GraphRewriting.Strategies.LeftmostOutermost: leftmostOutermost :: (View Control n, View [Port] n) => Rule n -> Rule n
+ GraphRewriting.Strategies.LeftmostOutermost: leftmostOutermost :: (View Control n, View [Port] n) ⇒ Rule n -> Rule n
- GraphRewriting.Strategies.LeftmostOutermost: lmoPort :: LeftmostOutermost n => n -> Maybe Port
+ GraphRewriting.Strategies.LeftmostOutermost: lmoPort :: LeftmostOutermost n ⇒ n -> Maybe Port
- GraphRewriting.Strategies.LeftmostOutermost: moveControl :: (View [Port] n, View Control n, LeftmostOutermost n) => Rule n
+ GraphRewriting.Strategies.LeftmostOutermost: moveControl :: (View [Port] n, View Control n, LeftmostOutermost n) ⇒ Rule n
Files
- AUTHORS +2/−0
- graph-rewriting-strategies.cabal +5/−4
+ AUTHORS view
@@ -0,0 +1,2 @@+Jan Rochel+Chas Leichner (Google Inc.)
graph-rewriting-strategies.cabal view
@@ -1,5 +1,5 @@ Name: graph-rewriting-strategies-Version: 0.2.3+Version: 0.2.4 Copyright: 2012, Robert Kreuzer, Jan Rochel License: BSD3 License-File: LICENSE@@ -12,12 +12,13 @@ Description: Defines a mechanism to add evaluation strategies to graph rewriting systems defined in terms of the graph-rewriting library. Currently only leftmost-outermost reduction is implemented. Category: Graphs, Graphics Cabal-Version: >= 1.6+Extra-Source-Files: AUTHORS Library Build-Depends:- base >= 4 && < 4.8,+ base >= 4 && < 4.9, base-unicode-symbols >= 0.2 && < 0.3,- graph-rewriting >= 0.7 && < 0.8,+ graph-rewriting >= 0.7.8 && < 0.8, containers >= 0.4 && < 0.6 Exposed-Modules: GraphRewriting.Strategies.Control@@ -28,4 +29,4 @@ MultiParamTypeClasses FlexibleContexts OverlappingInstances- GHC-Options: -fno-warn-duplicate-exports -fwarn-unused-binds -fwarn-unused-imports -fwarn-unused-do-bind -fwarn-wrong-do-bind -fwarn-unrecognised-pragmas+ GHC-Options: -fno-warn-duplicate-exports -fwarn-unused-binds -fwarn-unused-imports -fwarn-unused-do-bind -fwarn-wrong-do-bind -fwarn-unrecognised-pragmas -fno-warn-tabs