fgl 5.8.3.0 → 5.8.3.1
raw patch · 4 files changed
+21/−25 lines, 4 filesdep ~QuickCheckPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: QuickCheck
API changes (from Hackage documentation)
- Data.Graph.Inductive.Graph: OrdGr :: gr a b -> OrdGr gr a b
+ Data.Graph.Inductive.Graph: OrdGr :: gr a b -> OrdGr (gr :: Type -> Type -> Type) a b
- Data.Graph.Inductive.Graph: [unOrdGr] :: OrdGr gr a b -> gr a b
+ Data.Graph.Inductive.Graph: [unOrdGr] :: OrdGr (gr :: Type -> Type -> Type) a b -> gr a b
- Data.Graph.Inductive.Graph: class (Graph gr) => DynGraph gr
+ Data.Graph.Inductive.Graph: class Graph gr => DynGraph (gr :: Type -> Type -> Type)
- Data.Graph.Inductive.Graph: class Graph gr
+ Data.Graph.Inductive.Graph: class Graph (gr :: Type -> Type -> Type)
- Data.Graph.Inductive.Graph: newtype OrdGr gr a b
+ Data.Graph.Inductive.Graph: newtype OrdGr (gr :: Type -> Type -> Type) a b
- Data.Graph.Inductive.Graph: type Decomp g a b = (MContext a b, g a b)
+ Data.Graph.Inductive.Graph: type Decomp (g :: Type -> Type -> Type) a b = (MContext a b, g a b)
- Data.Graph.Inductive.Graph: type GDecomp g a b = (Context a b, g a b)
+ Data.Graph.Inductive.Graph: type GDecomp (g :: Type -> Type -> Type) a b = (Context a b, g a b)
- Data.Graph.Inductive.Graph: type MContext a b = Maybe (Context a b)
+ Data.Graph.Inductive.Graph: type MContext a b = Maybe Context a b
- Data.Graph.Inductive.Internal.Thread: type SplitM t i r = Split t i (Maybe r)
+ Data.Graph.Inductive.Internal.Thread: type SplitM t i r = Split t i Maybe r
- Data.Graph.Inductive.Monad: class (Monad m) => GraphM m gr
+ Data.Graph.Inductive.Monad: class Monad m => GraphM (m :: Type -> Type) (gr :: Type -> Type -> Type)
- Data.Graph.Inductive.Monad.IOArray: type GraphRep a b = (Int, Array Node (Context' a b), IOArray Node Bool)
+ Data.Graph.Inductive.Monad.IOArray: type GraphRep a b = (Int, Array Node Context' a b, IOArray Node Bool)
- Data.Graph.Inductive.Monad.STArray: type GraphRep s a b = (Int, Array Node (Context' a b), STArray s Node Bool)
+ Data.Graph.Inductive.Monad.STArray: type GraphRep s a b = (Int, Array Node Context' a b, STArray s Node Bool)
- Data.Graph.Inductive.NodeMap: type NodeMapM a b g r = State (NodeMap a, g a b) r
+ Data.Graph.Inductive.NodeMap: type NodeMapM a b (g :: Type -> Type -> Type) r = State (NodeMap a, g a b) r
- Data.Graph.Inductive.Query.Monad: MGT :: (m g -> m (a, g)) -> GT m g a
+ Data.Graph.Inductive.Query.Monad: MGT :: (m g -> m (a, g)) -> GT (m :: Type -> Type) g a
- Data.Graph.Inductive.Query.Monad: condMGT' :: Monad m => (s -> Bool) -> GT m s a -> GT m s a -> GT m s a
+ Data.Graph.Inductive.Query.Monad: condMGT' :: forall (m :: Type -> Type) s a. Monad m => (s -> Bool) -> GT m s a -> GT m s a -> GT m s a
- Data.Graph.Inductive.Query.Monad: dffM :: GraphM m gr => [Node] -> GT m (gr a b) [Tree Node]
+ Data.Graph.Inductive.Query.Monad: dffM :: forall (m :: Type -> Type) gr a b. GraphM m gr => [Node] -> GT m (gr a b) [Tree Node]
- Data.Graph.Inductive.Query.Monad: dfsGT :: GraphM m gr => [Node] -> GT m (gr a b) [Node]
+ Data.Graph.Inductive.Query.Monad: dfsGT :: forall (m :: Type -> Type) gr a b. GraphM m gr => [Node] -> GT m (gr a b) [Node]
- Data.Graph.Inductive.Query.Monad: getContext :: GraphM m gr => GT m (gr a b) (Context a b)
+ Data.Graph.Inductive.Query.Monad: getContext :: forall (m :: Type -> Type) gr a b. GraphM m gr => GT m (gr a b) (Context a b)
- Data.Graph.Inductive.Query.Monad: getNode :: GraphM m gr => GT m (gr a b) Node
+ Data.Graph.Inductive.Query.Monad: getNode :: forall (m :: Type -> Type) gr a b. GraphM m gr => GT m (gr a b) Node
- Data.Graph.Inductive.Query.Monad: getNodes :: GraphM m gr => GT m (gr a b) [Node]
+ Data.Graph.Inductive.Query.Monad: getNodes :: forall (m :: Type -> Type) gr a b. GraphM m gr => GT m (gr a b) [Node]
- Data.Graph.Inductive.Query.Monad: getNodes' :: (Graph gr, GraphM m gr) => GT m (gr a b) [Node]
+ Data.Graph.Inductive.Query.Monad: getNodes' :: forall gr (m :: Type -> Type) a b. (Graph gr, GraphM m gr) => GT m (gr a b) [Node]
- Data.Graph.Inductive.Query.Monad: graphFilterM :: GraphM m gr => (Context a b -> Bool) -> GT m (gr a b) [Context a b]
+ Data.Graph.Inductive.Query.Monad: graphFilterM :: forall (m :: Type -> Type) gr a b. GraphM m gr => (Context a b -> Bool) -> GT m (gr a b) [Context a b]
- Data.Graph.Inductive.Query.Monad: graphNodesM :: GraphM m gr => GT m (gr a b) [Node]
+ Data.Graph.Inductive.Query.Monad: graphNodesM :: forall (m :: Type -> Type) gr a b. GraphM m gr => GT m (gr a b) [Node]
- Data.Graph.Inductive.Query.Monad: graphNodesM0 :: GraphM m gr => GT m (gr a b) [Node]
+ Data.Graph.Inductive.Query.Monad: graphNodesM0 :: forall (m :: Type -> Type) gr a b. GraphM m gr => GT m (gr a b) [Node]
- Data.Graph.Inductive.Query.Monad: graphRec :: GraphM m gr => GT m (gr a b) c -> (c -> d -> d) -> d -> GT m (gr a b) d
+ Data.Graph.Inductive.Query.Monad: graphRec :: forall (m :: Type -> Type) gr a b c d. GraphM m gr => GT m (gr a b) c -> (c -> d -> d) -> d -> GT m (gr a b) d
- Data.Graph.Inductive.Query.Monad: graphRec' :: (Graph gr, GraphM m gr) => GT m (gr a b) c -> (c -> d -> d) -> d -> GT m (gr a b) d
+ Data.Graph.Inductive.Query.Monad: graphRec' :: forall gr (m :: Type -> Type) a b c d. (Graph gr, GraphM m gr) => GT m (gr a b) c -> (c -> d -> d) -> d -> GT m (gr a b) d
- Data.Graph.Inductive.Query.Monad: graphUFold :: GraphM m gr => (Context a b -> c -> c) -> c -> GT m (gr a b) c
+ Data.Graph.Inductive.Query.Monad: graphUFold :: forall (m :: Type -> Type) gr a b c. GraphM m gr => (Context a b -> c -> c) -> c -> GT m (gr a b) c
- Data.Graph.Inductive.Query.Monad: newtype GT m g a
+ Data.Graph.Inductive.Query.Monad: newtype GT (m :: Type -> Type) g a
- Data.Graph.Inductive.Query.Monad: recMGT' :: Monad m => (s -> Bool) -> GT m s a -> (a -> b -> b) -> b -> GT m s b
+ Data.Graph.Inductive.Query.Monad: recMGT' :: forall (m :: Type -> Type) s a b. Monad m => (s -> Bool) -> GT m s a -> (a -> b -> b) -> b -> GT m s b
- Data.Graph.Inductive.Query.Monad: sucGT :: GraphM m gr => Node -> GT m (gr a b) (Maybe [Node])
+ Data.Graph.Inductive.Query.Monad: sucGT :: forall (m :: Type -> Type) gr a b. GraphM m gr => Node -> GT m (gr a b) (Maybe [Node])
Files
- ChangeLog +7/−0
- Data/Graph/Inductive/Monad.hs +0/−2
- Data/Graph/Inductive/Query/Dominators.hs +0/−1
- fgl.cabal +14/−22
ChangeLog view
@@ -1,3 +1,10 @@+5.8.3.1+-------++* Support QuickCheck 2.17.++* Removed HLint ANN pragmas.+ 5.8.3.0 -------
Data/Graph/Inductive/Monad.hs view
@@ -20,8 +20,6 @@ import Data.Graph.Inductive.Graph -{-# ANN module "HLint: ignore Redundant lambda" #-}- ---------------------------------------------------------------------- -- MONADIC GRAPH CLASS ----------------------------------------------------------------------
Data/Graph/Inductive/Query/Dominators.hs view
@@ -21,7 +21,6 @@ import Data.Tree (Tree (..)) import qualified Data.Tree as T -{-# ANN iDom "HLint: ignore Use ***" #-} -- | return immediate dominators for each reachable node of a graph, given a root iDom :: (Graph gr) => gr a b -> Node -> [(Node,Node)] iDom g root = let (result, toNode, _) = idomWork g root
fgl.cabal view
@@ -1,5 +1,5 @@ name: fgl-version: 5.8.3.0+version: 5.8.3.1 license: BSD3 license-file: LICENSE author: Martin Erwig, Ivan Lazar Miljenovic@@ -7,31 +7,29 @@ category: Data Structures, Graphs synopsis: Martin Erwig's Functional Graph Library -description: {-An inductive representation of manipulating graph data structures.-.-Original website can be found at <http://web.engr.oregonstate.edu/~erwig/fgl/haskell>.-}+description:+ An inductive representation of manipulating graph data structures.+ .+ Original website can be found at <http://web.engr.oregonstate.edu/~erwig/fgl/haskell>. cabal-version: >= 1.10 build-type: Simple extra-source-files: ChangeLog -tested-with: GHC == 7.2.2, GHC == 7.4.2, GHC == 7.6.3, GHC == 7.8.4,- GHC == 7.10.3, GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.3,- GHC == 8.6.2, GHC == 8.8.2, GHC == 8.10.7, GHC == 9.0.2,- GHC == 9.2.4, GHC == 9.4.4, GHC == 9.6.3, GHC == 9.8.1+tested-with: GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.4,+ GHC == 8.6.5, GHC == 8.8.4, GHC == 8.10.7, GHC == 9.0.2,+ GHC == 9.2.8, GHC == 9.4.8, GHC == 9.6.7, GHC == 9.8.4,+ GHC == 9.10.3, GHC == 9.12.2 source-repository head type: git location: https://github.com/haskell/fgl.git -flag containers042 {+flag containers042 manual: False default: True-} -library {+library default-language: Haskell98 exposed-modules:@@ -83,16 +81,14 @@ ghc-options: -Wall -}--test-suite fgl-tests {+test-suite fgl-tests default-language: Haskell98 type: exitcode-stdio-1.0 build-depends: fgl , base- , QuickCheck >= 2.8 && < 2.15+ , QuickCheck >= 2.8 && < 2.17 , hspec >= 2.1 && < 2.12 , containers @@ -110,9 +106,7 @@ if impl(ghc >= 8.0) ghc-options: -Wall -Wno-star-is-type -}--benchmark fgl-benchmark {+benchmark fgl-benchmark if flag(containers042) buildable: True else@@ -134,5 +128,3 @@ , deepseq ghc-options: -Wall--}