Etage-Graph 0.1.6 → 0.1.7
raw patch · 2 files changed
+12/−8 lines, 2 filesdep ~Etagedep ~Etage-GraphPVP ok
version bump matches the API change (PVP)
Dependency ranges changed: Etage, Etage-Graph
API changes (from Hackage documentation)
Files
- Etage-Graph.cabal +7/−7
- lib/Data/Graph/Etage.hs +5/−1
Etage-Graph.cabal view
@@ -1,5 +1,5 @@ Name: Etage-Graph-Version: 0.1.6+Version: 0.1.7 Synopsis: Data-flow based graph algorithms Description: Data-flow based graph algorithms using the "Control.Etage" framework, showcasing its use for data-flow computations. It is meant to be used with the "Data.Graph.Inductive" package which provides graph structures@@ -13,7 +13,7 @@ License-file: LICENSE Author: Mitar Milutinovic Maintainer: mitar.haskell@tnode.com-Copyright: (c) 2011-2012 Mitar Milutinovic+Copyright: (c) 2011-2013 Mitar Milutinovic Category: Data Structures Build-type: Simple Cabal-version: >= 1.8@@ -23,7 +23,7 @@ Library Exposed-modules: Data.Graph.Etage Build-depends: base >= 4.3 && < 5,- Etage >= 0.1.10 && < 0.2,+ Etage >= 0.1.11 && < 0.2, fgl >= 5.4.2 && < 5.5, mtl >= 2.0 && < 3, containers >= 0.4 && < 1@@ -33,8 +33,8 @@ GHC-shared-options: -Wall Source-repository head- type: mercurial- location: https://bitbucket.org/mitar/etage-graph+ type: git+ location: git://github.com/mitar/etage-graph.git Executable etage-graph-test Main-is: Test.hs@@ -48,7 +48,7 @@ array >= 0.3 && < 1, time >= 1.1 && < 2, parallel >= 3.1 && < 4,- Etage >= 0.1.10 && < 0.2,- Etage-Graph == 0.1.6+ Etage >= 0.1.11 && < 0.2,+ Etage-Graph == 0.1.7 GHC-options: -Wall -rtsopts -threaded
lib/Data/Graph/Etage.hs view
@@ -1,4 +1,4 @@-{-# LANGUAGE TypeFamilies, MultiParamTypeClasses, FlexibleInstances, ScopedTypeVariables, TypeSynonymInstances, StandaloneDeriving, DeriveDataTypeable, NamedFieldPuns #-}+{-# LANGUAGE TypeFamilies, MultiParamTypeClasses, FlexibleInstances, ScopedTypeVariables, TypeSynonymInstances, StandaloneDeriving, DeriveDataTypeable, NamedFieldPuns, CPP #-} {-# OPTIONS_GHC -fno-warn-orphans #-} {-|@@ -17,7 +17,11 @@ import Data.Data import Data.Graph.Inductive hiding (inn, inn', out, out', node', nodes, run) import qualified Data.Map as M+#if MIN_VERSION_base(4,5,0) import Data.Map hiding (filter, map, empty, null, lookup, foldl)+#else+import Data.Map hiding (filter, map, empty, null, lookup)+#endif import Data.Tuple import System.IO