comfort-graph 0.0.0.3 → 0.0.1
raw patch · 2 files changed
+8/−5 lines, 2 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Data.Graph.Comfort: from, to :: Edge edge => edge node -> node
- Data.Graph.Comfort: instance (Arbitrary n, Ord n) => Arbitrary (UndirEdge n)
- Data.Graph.Comfort: instance (Edge e, Ord n, Show1 e, Show n, Show el, Show nl) => Show (Graph e n el nl)
- Data.Graph.Comfort: instance (Edge edge, Ord node) => Monoid (Graph edge node edgeLabel nodeLabel)
- Data.Graph.Comfort: instance (Eq node, Eq edgeLabel, Eq nodeLabel, Eq1 edge) => Eq (Graph edge node edgeLabel nodeLabel)
- Data.Graph.Comfort: instance (Ord node, Ord edgeLabel, Ord nodeLabel, Ord1 edge) => Ord (Graph edge node edgeLabel nodeLabel)
- Data.Graph.Comfort: instance Arbitrary n => Arbitrary (DirEdge n)
- Data.Graph.Comfort: instance Edge DirEdge
- Data.Graph.Comfort: instance Edge EitherEdge
- Data.Graph.Comfort: instance Edge UndirEdge
- Data.Graph.Comfort: instance Eq node => Eq (DirEdge node)
- Data.Graph.Comfort: instance Eq node => Eq (EitherEdge node)
- Data.Graph.Comfort: instance Eq node => Eq (UndirEdge node)
- Data.Graph.Comfort: instance Eq1 DirEdge
- Data.Graph.Comfort: instance Eq1 EitherEdge
- Data.Graph.Comfort: instance Eq1 UndirEdge
- Data.Graph.Comfort: instance Foldable DirEdge
- Data.Graph.Comfort: instance Foldable EitherEdge
- Data.Graph.Comfort: instance Foldable UndirEdge
- Data.Graph.Comfort: instance Functor DirEdge
- Data.Graph.Comfort: instance Ord node => Ord (DirEdge node)
- Data.Graph.Comfort: instance Ord node => Ord (EitherEdge node)
- Data.Graph.Comfort: instance Ord node => Ord (UndirEdge node)
- Data.Graph.Comfort: instance Ord1 DirEdge
- Data.Graph.Comfort: instance Ord1 EitherEdge
- Data.Graph.Comfort: instance Ord1 UndirEdge
- Data.Graph.Comfort: instance Reverse DirEdge
- Data.Graph.Comfort: instance Show node => Show (DirEdge node)
- Data.Graph.Comfort: instance Show node => Show (EitherEdge node)
- Data.Graph.Comfort: instance Show node => Show (UndirEdge node)
- Data.Graph.Comfort: instance Show1 DirEdge
- Data.Graph.Comfort: instance Show1 EitherEdge
- Data.Graph.Comfort: instance Show1 UndirEdge
+ Data.Graph.Comfort: defaultEdgeFoldMap :: (Edge edge, Monoid a) => edge a -> a
+ Data.Graph.Comfort: from :: Edge edge => edge node -> node
+ Data.Graph.Comfort: instance (Data.Graph.Comfort.Edge e, GHC.Classes.Ord n, Data.Functor.Classes.Show1 e, GHC.Show.Show n, GHC.Show.Show el, GHC.Show.Show nl) => GHC.Show.Show (Data.Graph.Comfort.Graph e n el nl)
+ Data.Graph.Comfort: instance (Data.Graph.Comfort.Edge edge, GHC.Classes.Ord node) => GHC.Base.Monoid (Data.Graph.Comfort.Graph edge node edgeLabel nodeLabel)
+ Data.Graph.Comfort: instance (GHC.Classes.Eq node, GHC.Classes.Eq edgeLabel, GHC.Classes.Eq nodeLabel, Data.Functor.Classes.Eq1 edge) => GHC.Classes.Eq (Data.Graph.Comfort.Graph edge node edgeLabel nodeLabel)
+ Data.Graph.Comfort: instance (GHC.Classes.Ord node, GHC.Classes.Ord edgeLabel, GHC.Classes.Ord nodeLabel, Data.Functor.Classes.Ord1 edge) => GHC.Classes.Ord (Data.Graph.Comfort.Graph edge node edgeLabel nodeLabel)
+ Data.Graph.Comfort: instance (Test.QuickCheck.Arbitrary.Arbitrary n, GHC.Classes.Ord n) => Test.QuickCheck.Arbitrary.Arbitrary (Data.Graph.Comfort.UndirEdge n)
+ Data.Graph.Comfort: instance Data.Foldable.Foldable Data.Graph.Comfort.DirEdge
+ Data.Graph.Comfort: instance Data.Foldable.Foldable Data.Graph.Comfort.EitherEdge
+ Data.Graph.Comfort: instance Data.Foldable.Foldable Data.Graph.Comfort.UndirEdge
+ Data.Graph.Comfort: instance Data.Functor.Classes.Eq1 Data.Graph.Comfort.DirEdge
+ Data.Graph.Comfort: instance Data.Functor.Classes.Eq1 Data.Graph.Comfort.EitherEdge
+ Data.Graph.Comfort: instance Data.Functor.Classes.Eq1 Data.Graph.Comfort.UndirEdge
+ Data.Graph.Comfort: instance Data.Functor.Classes.Ord1 Data.Graph.Comfort.DirEdge
+ Data.Graph.Comfort: instance Data.Functor.Classes.Ord1 Data.Graph.Comfort.EitherEdge
+ Data.Graph.Comfort: instance Data.Functor.Classes.Ord1 Data.Graph.Comfort.UndirEdge
+ Data.Graph.Comfort: instance Data.Functor.Classes.Show1 Data.Graph.Comfort.DirEdge
+ Data.Graph.Comfort: instance Data.Functor.Classes.Show1 Data.Graph.Comfort.EitherEdge
+ Data.Graph.Comfort: instance Data.Functor.Classes.Show1 Data.Graph.Comfort.UndirEdge
+ Data.Graph.Comfort: instance Data.Graph.Comfort.Edge Data.Graph.Comfort.DirEdge
+ Data.Graph.Comfort: instance Data.Graph.Comfort.Edge Data.Graph.Comfort.EitherEdge
+ Data.Graph.Comfort: instance Data.Graph.Comfort.Edge Data.Graph.Comfort.UndirEdge
+ Data.Graph.Comfort: instance Data.Graph.Comfort.Reverse Data.Graph.Comfort.DirEdge
+ Data.Graph.Comfort: instance GHC.Base.Functor Data.Graph.Comfort.DirEdge
+ Data.Graph.Comfort: instance GHC.Classes.Eq node => GHC.Classes.Eq (Data.Graph.Comfort.DirEdge node)
+ Data.Graph.Comfort: instance GHC.Classes.Eq node => GHC.Classes.Eq (Data.Graph.Comfort.EitherEdge node)
+ Data.Graph.Comfort: instance GHC.Classes.Eq node => GHC.Classes.Eq (Data.Graph.Comfort.UndirEdge node)
+ Data.Graph.Comfort: instance GHC.Classes.Ord node => GHC.Classes.Ord (Data.Graph.Comfort.DirEdge node)
+ Data.Graph.Comfort: instance GHC.Classes.Ord node => GHC.Classes.Ord (Data.Graph.Comfort.EitherEdge node)
+ Data.Graph.Comfort: instance GHC.Classes.Ord node => GHC.Classes.Ord (Data.Graph.Comfort.UndirEdge node)
+ Data.Graph.Comfort: instance GHC.Show.Show node => GHC.Show.Show (Data.Graph.Comfort.DirEdge node)
+ Data.Graph.Comfort: instance GHC.Show.Show node => GHC.Show.Show (Data.Graph.Comfort.EitherEdge node)
+ Data.Graph.Comfort: instance GHC.Show.Show node => GHC.Show.Show (Data.Graph.Comfort.UndirEdge node)
+ Data.Graph.Comfort: instance Test.QuickCheck.Arbitrary.Arbitrary n => Test.QuickCheck.Arbitrary.Arbitrary (Data.Graph.Comfort.DirEdge n)
+ Data.Graph.Comfort: to :: Edge edge => edge node -> node
- Data.Graph.Comfort: insertNode :: Ord n => n -> nl -> Graph e n el nl -> Graph e n el nl
+ Data.Graph.Comfort: insertNode :: (Ord n) => n -> nl -> Graph e n el nl -> Graph e n el nl
- Data.Graph.Comfort: lookupNode :: Ord n => n -> Graph e n el nl -> Maybe nl
+ Data.Graph.Comfort: lookupNode :: (Ord n) => n -> Graph e n el nl -> Maybe nl
- Data.Graph.Comfort: undirEdge :: Ord node => node -> node -> UndirEdge node
+ Data.Graph.Comfort: undirEdge :: (Ord node) => node -> node -> UndirEdge node
Files
- comfort-graph.cabal +2/−2
- src/Data/Graph/Comfort.hs +6/−3
comfort-graph.cabal view
@@ -1,5 +1,5 @@ Name: comfort-graph-Version: 0.0.0.3+Version: 0.0.1 Synopsis: Graph structure with type parameters for nodes and edges Description: This graph structure is based on "Data.Map"@@ -51,7 +51,7 @@ Cabal-Version: >=1.10 Source-Repository this- Tag: 0.0.0.3+ Tag: 0.0.1 Type: darcs Location: http://hub.darcs.net/thielema/comfort-graph
src/Data/Graph/Comfort.hs view
@@ -3,7 +3,7 @@ Graph, LabeledNode, LabeledEdge,- Edge(from, to),+ Edge(from, to), defaultEdgeFoldMap, DirEdge(DirEdge), UndirEdge(UndirEdge), undirEdge, EitherEdge(EDirEdge,EUndirEdge),@@ -76,7 +76,7 @@ import Data.Ord (Ord, compare, (<), (>)) import Data.Tuple (uncurry) import Data.Function (flip, (.), ($))-import Text.Show (Show, showParen, showString, shows, showsPrec)+import Text.Show (Show, showParen, showString, showChar, shows, showsPrec) import Prelude (error) @@ -97,7 +97,7 @@ showParen (prec>10) $ showString "Graph.fromList " . shows (Map.toList $ nodeLabels g) .- showString " " .+ showChar ' ' . shows (Map.toList $ edgeLabelsWrap g) @@ -117,6 +117,9 @@ type LabeledNode n label = (n, label) ++defaultEdgeFoldMap :: (Edge edge, Monoid a) => edge a -> a+defaultEdgeFoldMap e = mappend (from e) (to e) class (Foldable edge, Ord1 edge) => Edge edge where from, to :: edge node -> node