fgl-arbitrary 0.2.0.1 → 0.2.0.2
raw patch · 2 files changed
+8/−7 lines, 2 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.Arbitrary: connArbGraph :: Connected ag a b -> ag a b
- Data.Graph.Inductive.Arbitrary: connNode :: Connected ag a b -> Node
- Data.Graph.Inductive.Arbitrary: graphEdges :: GraphNodesEdges a b -> [LEdge b]
- Data.Graph.Inductive.Arbitrary: graphNodes :: GraphNodesEdges a b -> [LNode a]
- Data.Graph.Inductive.Arbitrary: instance (ArbGraph ag, Arbitrary a, Arbitrary b) => Arbitrary (Connected ag a b)
- Data.Graph.Inductive.Arbitrary: instance (ArbGraph gr, Arbitrary a, Arbitrary b) => Arbitrary (NoLoops gr a b)
- Data.Graph.Inductive.Arbitrary: instance (ArbGraph gr, Arbitrary a, Arbitrary b) => Arbitrary (NoMultipleEdges gr a b)
- Data.Graph.Inductive.Arbitrary: instance (ArbGraph gr, Arbitrary a, Arbitrary b) => Arbitrary (Undirected gr a b)
- Data.Graph.Inductive.Arbitrary: instance (Arbitrary a, Arbitrary b) => Arbitrary (Gr a b)
- Data.Graph.Inductive.Arbitrary: instance (Arbitrary a, Arbitrary b) => Arbitrary (GraphNodesEdges a b)
- Data.Graph.Inductive.Arbitrary: instance (Eq a, Eq b) => Eq (GraphNodesEdges a b)
- Data.Graph.Inductive.Arbitrary: instance (Ord a, Ord b) => Ord (GraphNodesEdges a b)
- Data.Graph.Inductive.Arbitrary: instance (Read a, Read b) => Read (GraphNodesEdges a b)
- Data.Graph.Inductive.Arbitrary: instance (Show a, Show b) => Show (GraphNodesEdges a b)
- Data.Graph.Inductive.Arbitrary: instance ArbGraph Gr
- Data.Graph.Inductive.Arbitrary: instance ArbGraph gr => ArbGraph (NoLoops gr)
- Data.Graph.Inductive.Arbitrary: instance ArbGraph gr => ArbGraph (NoMultipleEdges gr)
- Data.Graph.Inductive.Arbitrary: instance ArbGraph gr => ArbGraph (Undirected gr)
- Data.Graph.Inductive.Arbitrary: instance Eq (GrProxy gr)
- Data.Graph.Inductive.Arbitrary: instance Eq (ag a b) => Eq (Connected ag a b)
- Data.Graph.Inductive.Arbitrary: instance Eq (gr a b) => Eq (NoLoops gr a b)
- Data.Graph.Inductive.Arbitrary: instance Eq (gr a b) => Eq (NoMultipleEdges gr a b)
- Data.Graph.Inductive.Arbitrary: instance Eq (gr a b) => Eq (Undirected gr a b)
- Data.Graph.Inductive.Arbitrary: instance Ord (GrProxy gr)
- Data.Graph.Inductive.Arbitrary: instance Read (GrProxy gr)
- Data.Graph.Inductive.Arbitrary: instance Read (ag a b) => Read (Connected ag a b)
- Data.Graph.Inductive.Arbitrary: instance Read (gr a b) => Read (NoLoops gr a b)
- Data.Graph.Inductive.Arbitrary: instance Read (gr a b) => Read (NoMultipleEdges gr a b)
- Data.Graph.Inductive.Arbitrary: instance Read (gr a b) => Read (Undirected gr a b)
- Data.Graph.Inductive.Arbitrary: instance Show (GrProxy gr)
- Data.Graph.Inductive.Arbitrary: instance Show (ag a b) => Show (Connected ag a b)
- Data.Graph.Inductive.Arbitrary: instance Show (gr a b) => Show (NoLoops gr a b)
- Data.Graph.Inductive.Arbitrary: instance Show (gr a b) => Show (NoMultipleEdges gr a b)
- Data.Graph.Inductive.Arbitrary: instance Show (gr a b) => Show (Undirected gr a b)
- Data.Graph.Inductive.Arbitrary: looplessGraph :: NoLoops gr a b -> gr a b
- Data.Graph.Inductive.Arbitrary: nmeGraph :: NoMultipleEdges gr a b -> gr a b
- Data.Graph.Inductive.Arbitrary: undirGraph :: Undirected gr a b -> gr a b
+ Data.Graph.Inductive.Arbitrary: [connArbGraph] :: Connected ag a b -> ag a b
+ Data.Graph.Inductive.Arbitrary: [connNode] :: Connected ag a b -> Node
+ Data.Graph.Inductive.Arbitrary: [graphEdges] :: GraphNodesEdges a b -> [LEdge b]
+ Data.Graph.Inductive.Arbitrary: [graphNodes] :: GraphNodesEdges a b -> [LNode a]
+ Data.Graph.Inductive.Arbitrary: [looplessGraph] :: NoLoops gr a b -> gr a b
+ Data.Graph.Inductive.Arbitrary: [nmeGraph] :: NoMultipleEdges gr a b -> gr a b
+ Data.Graph.Inductive.Arbitrary: [undirGraph] :: Undirected gr a b -> gr a b
+ Data.Graph.Inductive.Arbitrary: instance (Data.Graph.Inductive.Arbitrary.ArbGraph ag, Test.QuickCheck.Arbitrary.Arbitrary a, Test.QuickCheck.Arbitrary.Arbitrary b) => Test.QuickCheck.Arbitrary.Arbitrary (Data.Graph.Inductive.Arbitrary.Connected ag a b)
+ Data.Graph.Inductive.Arbitrary: instance (Data.Graph.Inductive.Arbitrary.ArbGraph gr, Test.QuickCheck.Arbitrary.Arbitrary a, Test.QuickCheck.Arbitrary.Arbitrary b) => Test.QuickCheck.Arbitrary.Arbitrary (Data.Graph.Inductive.Arbitrary.NoLoops gr a b)
+ Data.Graph.Inductive.Arbitrary: instance (Data.Graph.Inductive.Arbitrary.ArbGraph gr, Test.QuickCheck.Arbitrary.Arbitrary a, Test.QuickCheck.Arbitrary.Arbitrary b) => Test.QuickCheck.Arbitrary.Arbitrary (Data.Graph.Inductive.Arbitrary.NoMultipleEdges gr a b)
+ Data.Graph.Inductive.Arbitrary: instance (Data.Graph.Inductive.Arbitrary.ArbGraph gr, Test.QuickCheck.Arbitrary.Arbitrary a, Test.QuickCheck.Arbitrary.Arbitrary b) => Test.QuickCheck.Arbitrary.Arbitrary (Data.Graph.Inductive.Arbitrary.Undirected gr a b)
+ Data.Graph.Inductive.Arbitrary: instance (GHC.Classes.Eq a, GHC.Classes.Eq b) => GHC.Classes.Eq (Data.Graph.Inductive.Arbitrary.GraphNodesEdges a b)
+ Data.Graph.Inductive.Arbitrary: instance (GHC.Classes.Ord a, GHC.Classes.Ord b) => GHC.Classes.Ord (Data.Graph.Inductive.Arbitrary.GraphNodesEdges a b)
+ Data.Graph.Inductive.Arbitrary: instance (GHC.Read.Read a, GHC.Read.Read b) => GHC.Read.Read (Data.Graph.Inductive.Arbitrary.GraphNodesEdges a b)
+ Data.Graph.Inductive.Arbitrary: instance (GHC.Show.Show a, GHC.Show.Show b) => GHC.Show.Show (Data.Graph.Inductive.Arbitrary.GraphNodesEdges a b)
+ Data.Graph.Inductive.Arbitrary: instance (Test.QuickCheck.Arbitrary.Arbitrary a, Test.QuickCheck.Arbitrary.Arbitrary b) => Test.QuickCheck.Arbitrary.Arbitrary (Data.Graph.Inductive.Arbitrary.GraphNodesEdges a b)
+ Data.Graph.Inductive.Arbitrary: instance (Test.QuickCheck.Arbitrary.Arbitrary a, Test.QuickCheck.Arbitrary.Arbitrary b) => Test.QuickCheck.Arbitrary.Arbitrary (Data.Graph.Inductive.PatriciaTree.Gr a b)
+ Data.Graph.Inductive.Arbitrary: instance (Test.QuickCheck.Arbitrary.Arbitrary a, Test.QuickCheck.Arbitrary.Arbitrary b) => Test.QuickCheck.Arbitrary.Arbitrary (Data.Graph.Inductive.Tree.Gr a b)
+ Data.Graph.Inductive.Arbitrary: instance Data.Graph.Inductive.Arbitrary.ArbGraph Data.Graph.Inductive.PatriciaTree.Gr
+ Data.Graph.Inductive.Arbitrary: instance Data.Graph.Inductive.Arbitrary.ArbGraph Data.Graph.Inductive.Tree.Gr
+ Data.Graph.Inductive.Arbitrary: instance Data.Graph.Inductive.Arbitrary.ArbGraph gr => Data.Graph.Inductive.Arbitrary.ArbGraph (Data.Graph.Inductive.Arbitrary.NoLoops gr)
+ Data.Graph.Inductive.Arbitrary: instance Data.Graph.Inductive.Arbitrary.ArbGraph gr => Data.Graph.Inductive.Arbitrary.ArbGraph (Data.Graph.Inductive.Arbitrary.NoMultipleEdges gr)
+ Data.Graph.Inductive.Arbitrary: instance Data.Graph.Inductive.Arbitrary.ArbGraph gr => Data.Graph.Inductive.Arbitrary.ArbGraph (Data.Graph.Inductive.Arbitrary.Undirected gr)
+ Data.Graph.Inductive.Arbitrary: instance GHC.Classes.Eq (Data.Graph.Inductive.Arbitrary.GrProxy gr)
+ Data.Graph.Inductive.Arbitrary: instance GHC.Classes.Eq (ag a b) => GHC.Classes.Eq (Data.Graph.Inductive.Arbitrary.Connected ag a b)
+ Data.Graph.Inductive.Arbitrary: instance GHC.Classes.Eq (gr a b) => GHC.Classes.Eq (Data.Graph.Inductive.Arbitrary.NoLoops gr a b)
+ Data.Graph.Inductive.Arbitrary: instance GHC.Classes.Eq (gr a b) => GHC.Classes.Eq (Data.Graph.Inductive.Arbitrary.NoMultipleEdges gr a b)
+ Data.Graph.Inductive.Arbitrary: instance GHC.Classes.Eq (gr a b) => GHC.Classes.Eq (Data.Graph.Inductive.Arbitrary.Undirected gr a b)
+ Data.Graph.Inductive.Arbitrary: instance GHC.Classes.Ord (Data.Graph.Inductive.Arbitrary.GrProxy gr)
+ Data.Graph.Inductive.Arbitrary: instance GHC.Read.Read (Data.Graph.Inductive.Arbitrary.GrProxy gr)
+ Data.Graph.Inductive.Arbitrary: instance GHC.Read.Read (ag a b) => GHC.Read.Read (Data.Graph.Inductive.Arbitrary.Connected ag a b)
+ Data.Graph.Inductive.Arbitrary: instance GHC.Read.Read (gr a b) => GHC.Read.Read (Data.Graph.Inductive.Arbitrary.NoLoops gr a b)
+ Data.Graph.Inductive.Arbitrary: instance GHC.Read.Read (gr a b) => GHC.Read.Read (Data.Graph.Inductive.Arbitrary.NoMultipleEdges gr a b)
+ Data.Graph.Inductive.Arbitrary: instance GHC.Read.Read (gr a b) => GHC.Read.Read (Data.Graph.Inductive.Arbitrary.Undirected gr a b)
+ Data.Graph.Inductive.Arbitrary: instance GHC.Show.Show (Data.Graph.Inductive.Arbitrary.GrProxy gr)
+ Data.Graph.Inductive.Arbitrary: instance GHC.Show.Show (ag a b) => GHC.Show.Show (Data.Graph.Inductive.Arbitrary.Connected ag a b)
+ Data.Graph.Inductive.Arbitrary: instance GHC.Show.Show (gr a b) => GHC.Show.Show (Data.Graph.Inductive.Arbitrary.NoLoops gr a b)
+ Data.Graph.Inductive.Arbitrary: instance GHC.Show.Show (gr a b) => GHC.Show.Show (Data.Graph.Inductive.Arbitrary.NoMultipleEdges gr a b)
+ Data.Graph.Inductive.Arbitrary: instance GHC.Show.Show (gr a b) => GHC.Show.Show (Data.Graph.Inductive.Arbitrary.Undirected gr a b)
+ Data.Graph.Inductive.Arbitrary: type family BaseGraph ag :: * -> * -> *;
+ Data.Graph.Inductive.Arbitrary: }
- Data.Graph.Inductive.Arbitrary: arbitraryEdges :: Arbitrary b => [LNode a] -> Gen [LEdge b]
+ Data.Graph.Inductive.Arbitrary: arbitraryEdges :: (Arbitrary b) => [LNode a] -> Gen [LEdge b]
- Data.Graph.Inductive.Arbitrary: arbitraryGraphBy :: (ArbGraph ag, Arbitrary a, Arbitrary b) => Gen (ag a b)
+ Data.Graph.Inductive.Arbitrary: arbitraryGraphBy :: forall ag a b. (ArbGraph ag, Arbitrary a, Arbitrary b) => Gen (ag a b)
- Data.Graph.Inductive.Arbitrary: arbitraryNodes :: Arbitrary a => Gen [LNode a]
+ Data.Graph.Inductive.Arbitrary: arbitraryNodes :: (Arbitrary a) => Gen [LNode a]
- Data.Graph.Inductive.Arbitrary: class DynGraph (BaseGraph ag) => ArbGraph ag where type family BaseGraph ag :: * -> * -> *
+ Data.Graph.Inductive.Arbitrary: class (DynGraph (BaseGraph ag)) => ArbGraph ag where type BaseGraph ag :: * -> * -> * where {
- Data.Graph.Inductive.Arbitrary: connGraph :: ArbGraph ag => Connected ag a b -> BaseGraph ag a b
+ Data.Graph.Inductive.Arbitrary: connGraph :: (ArbGraph ag) => Connected ag a b -> BaseGraph ag a b
- Data.Graph.Inductive.Arbitrary: shrinkF :: ArbGraph ag => ag a b -> [ag a b]
+ Data.Graph.Inductive.Arbitrary: shrinkF :: (ArbGraph ag) => ag a b -> [ag a b]
- Data.Graph.Inductive.Arbitrary: shrinkGraph :: Graph gr => gr a b -> [gr a b]
+ Data.Graph.Inductive.Arbitrary: shrinkGraph :: (Graph gr) => gr a b -> [gr a b]
- Data.Graph.Inductive.Arbitrary: shrinkGraphWith :: Graph gr => gr a b -> [(Node, gr a b)]
+ Data.Graph.Inductive.Arbitrary: shrinkGraphWith :: (Graph gr) => gr a b -> [(Node, gr a b)]
Files
- ChangeLog +5/−0
- fgl-arbitrary.cabal +3/−7
ChangeLog view
@@ -1,3 +1,8 @@+0.2.0.2+-------++* QuickCheck dependency bump+ 0.2.0.1 -------
fgl-arbitrary.cabal view
@@ -1,5 +1,5 @@ name: fgl-arbitrary-version: 0.2.0.1+version: 0.2.0.2 synopsis: QuickCheck support for fgl description: Provides Arbitrary instances for fgl graphs (to avoid adding a@@ -29,14 +29,12 @@ -- other-extensions: build-depends: base < 5 , fgl >= 5.5.2.0 && < 6- , QuickCheck >= 2.3 && < 2.9+ , QuickCheck >= 2.3 && < 2.10 -- hs-source-dirs: default-language: Haskell2010 ghc-options: -Wall - ghc-prof-options: -prof -auto- test-suite fgl-arbitrary-tests default-language: Haskell2010 @@ -45,7 +43,7 @@ build-depends: fgl-arbitrary , fgl , base- , QuickCheck >= 2.3 && < 2.9+ , QuickCheck >= 2.3 && < 2.10 , hspec >= 2.1 && < 2.3 , containers @@ -54,5 +52,3 @@ main-is: TestSuite.hs ghc-options: -Wall-- ghc-prof-options: -prof -auto