packages feed

graphite 0.9.8.0 → 0.10.0.0

raw patch · 6 files changed

+12/−10 lines, 6 filesnew-uploaderPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

- Data.Graph.DGraph: instance (Data.Hashable.Class.Hashable v, GHC.Classes.Eq v) => Data.Semigroup.Semigroup (Data.Graph.DGraph.DGraph v e)
- Data.Graph.DGraph: instance (GHC.Classes.Eq e, GHC.Classes.Eq v) => GHC.Classes.Eq (Data.Graph.DGraph.DGraph v e)
- Data.Graph.DGraph: isOriented :: DGraph v e -> Bool
- Data.Graph.DGraph: isRegular :: DGraph v e -> Bool
- Data.Graph.DGraph: isSymmetric :: DGraph v e -> Bool
- Data.Graph.Morphisms: areIsomorphic :: Graph g => g v e -> g v' e' -> Bool
- Data.Graph.Morphisms: isDRegular :: DGraph v e -> Bool
- Data.Graph.Morphisms: isURegular :: UGraph v e -> Bool
- Data.Graph.Morphisms: isomorphism :: Graph g => g v e -> g v' e' -> (v -> v')
- Data.Graph.Types: instance (GHC.Classes.Ord e, GHC.Classes.Ord v) => GHC.Classes.Ord (Data.Graph.Types.Arc v e)
- Data.Graph.Types: instance (GHC.Classes.Ord e, GHC.Classes.Ord v) => GHC.Classes.Ord (Data.Graph.Types.Edge v e)
- Data.Graph.Types: instance (GHC.Read.Read e, GHC.Read.Read v) => GHC.Read.Read (Data.Graph.Types.Arc v e)
- Data.Graph.Types: instance (GHC.Read.Read e, GHC.Read.Read v) => GHC.Read.Read (Data.Graph.Types.Edge v e)
- Data.Graph.Types: instance (GHC.Show.Show e, GHC.Show.Show v) => GHC.Show.Show (Data.Graph.Types.Arc v e)
- Data.Graph.Types: instance (GHC.Show.Show e, GHC.Show.Show v) => GHC.Show.Show (Data.Graph.Types.Edge v e)
- Data.Graph.Types: toAdjacencyMatrix :: Graph g => g v e -> [[Int]]
- Data.Graph.UGraph: instance (Data.Hashable.Class.Hashable v, GHC.Classes.Eq v) => Data.Semigroup.Semigroup (Data.Graph.UGraph.UGraph v e)
- Data.Graph.UGraph: instance (GHC.Classes.Eq e, GHC.Classes.Eq v) => GHC.Classes.Eq (Data.Graph.UGraph.UGraph v e)
- Data.Graph.UGraph.DegreeSequence: fromGraphicalSequence :: DegreeSequence -> Maybe (UGraph Int ())
- Data.Graph.UGraph.DegreeSequence: isDirectedGraphic :: DegreeSequence -> Bool
+ Data.Graph.DGraph: instance (Data.Hashable.Class.Hashable v, GHC.Classes.Eq v) => GHC.Base.Semigroup (Data.Graph.DGraph.DGraph v e)
+ Data.Graph.DGraph: instance (GHC.Classes.Eq v, GHC.Classes.Eq e) => GHC.Classes.Eq (Data.Graph.DGraph.DGraph v e)
+ Data.Graph.Types: instance (GHC.Classes.Ord v, GHC.Classes.Ord e) => GHC.Classes.Ord (Data.Graph.Types.Arc v e)
+ Data.Graph.Types: instance (GHC.Classes.Ord v, GHC.Classes.Ord e) => GHC.Classes.Ord (Data.Graph.Types.Edge v e)
+ Data.Graph.Types: instance (GHC.Read.Read v, GHC.Read.Read e) => GHC.Read.Read (Data.Graph.Types.Arc v e)
+ Data.Graph.Types: instance (GHC.Read.Read v, GHC.Read.Read e) => GHC.Read.Read (Data.Graph.Types.Edge v e)
+ Data.Graph.Types: instance (GHC.Show.Show v, GHC.Show.Show e) => GHC.Show.Show (Data.Graph.Types.Arc v e)
+ Data.Graph.Types: instance (GHC.Show.Show v, GHC.Show.Show e) => GHC.Show.Show (Data.Graph.Types.Edge v e)
+ Data.Graph.UGraph: instance (Data.Hashable.Class.Hashable v, GHC.Classes.Eq v) => GHC.Base.Semigroup (Data.Graph.UGraph.UGraph v e)
+ Data.Graph.UGraph: instance (GHC.Classes.Eq v, GHC.Classes.Eq e) => GHC.Classes.Eq (Data.Graph.UGraph.UGraph v e)
- Data.Graph.Types: (-->) :: (Hashable v) => v -> v -> Arc v ()
+ Data.Graph.Types: (-->) :: Hashable v => v -> v -> Arc v ()
- Data.Graph.Types: (<->) :: (Hashable v) => v -> v -> Edge v ()
+ Data.Graph.Types: (<->) :: Hashable v => v -> v -> Edge v ()
- Data.Graph.Types: empty :: (Graph g, (Hashable v)) => g v e
+ Data.Graph.Types: empty :: (Graph g, Hashable v) => g v e
- Data.Graph.Types: isLoop :: (IsEdge e, (Eq v)) => e v a -> Bool
+ Data.Graph.Types: isLoop :: (IsEdge e, Eq v) => e v a -> Bool

Files

graphite.cabal view
@@ -1,5 +1,5 @@ name:                graphite-version:             0.9.8.0+version:             0.10.0.0 synopsis:            Graphs and networks library description:         Represent, analyze and visualize graphs homepage:            https://github.com/alx741/graphite#readme
src/Data/Graph/DGraph.hs view
@@ -23,10 +23,10 @@     , indegrees     , outdegrees     -- ** Query graph properties and characteristics-    , isSymmetric-    , isOriented+    -- , isSymmetric+    -- , isOriented     , isBalanced-    , isRegular+    -- , isRegular     , isSource     , isSink     , isInternal@@ -167,7 +167,7 @@                 genArcs as (i, vs) = as ++ fmap (\v -> Arc i v ()) connected                     where connected = fst <$> filter (\(_, v) -> v /= 0) vs -    toAdjacencyMatrix = undefined+    -- toAdjacencyMatrix = undefined  instance (Arbitrary v, Arbitrary e, Hashable v, Num v, Ord v)  => Arbitrary (DGraph v e) where
src/Data/Graph/Morphisms.hs view
@@ -1,4 +1,6 @@-module Data.Graph.Morphisms where+module Data.Graph.Morphisms+    ()+    where  import Data.Graph.DGraph import Data.Graph.Types
src/Data/Graph/Types.hs view
@@ -226,7 +226,7 @@      -- TODO: make this [[Bool]]     -- | Get the adjacency binary matrix representation of a graph-    toAdjacencyMatrix :: g v e -> [[Int]]+    -- toAdjacencyMatrix :: g v e -> [[Int]]      -- | Generate a graph of Int vertices from an adjacency square binary matrix     fromAdjacencyMatrix :: [[Int]] -> Maybe (g Int ())
src/Data/Graph/UGraph.hs view
@@ -144,7 +144,7 @@                 genEdges es (i, vs) = es ++ fmap (\v -> Edge i v ()) connected                     where connected = fst <$> filter (\(_, v) -> v /= 0) vs -    toAdjacencyMatrix = undefined+    -- toAdjacencyMatrix = undefined
src/Data/Graph/UGraph/DegreeSequence.hs view
@@ -8,11 +8,11 @@      -- * Queries     , isGraphicalSequence-    , isDirectedGraphic+    -- , isDirectedGraphic     , holdsHandshakingLemma      -- * Graph generation-    , fromGraphicalSequence+    -- , fromGraphicalSequence     ) where  import Data.List (reverse, sort)