graph-wrapper 0.2.3 → 0.2.4

raw patch · 3 files changed

+13/−2 lines, 3 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• Data/Graph/Wrapper.hs +3/−1
• Data/Graph/Wrapper/Internal.hs +9/−0
• graph-wrapper.cabal +1/−1

@@ -27,7 +27,9 @@          topologicalSort, depthNumbering,     -    SCC(..), stronglyConnectedComponents, sccGraph+    SCC(..), stronglyConnectedComponents, sccGraph,+    +    traverseWithKey   ) where  import Data.Graph.Wrapper.Internal

@@ -5,6 +5,8 @@ {-# OPTIONS_HADDOCK not-home #-} module Data.Graph.Wrapper.Internal where +import Control.Applicative (Applicative)+ import Data.Array import Data.Maybe (fromMaybe) import qualified Data.Graph as G@@ -39,6 +41,13 @@  instance Traversable.Traversable (Graph i) where     traverse f g = fmap (\gvva -> g { gVertexVertexArray = gvva }) (Traversable.traverse f (gVertexVertexArray g))+++traverseWithKey :: Applicative t => (i -> a -> t b) -> Graph i a -> t (Graph i b)+traverseWithKey f g = fmap (\gvva -> g { gVertexVertexArray = gvva }) (traverseWithIndex (\gv -> f (gVertexIndex g gv)) (gVertexVertexArray g))+  where+    traverseWithIndex :: Applicative t => (G.Vertex -> a -> t b) -> Array G.Vertex a -> t (Array G.Vertex b)+    traverseWithIndex f a = fmap (array (bounds a)) $ flip Traversable.traverse (assocs a) $ \(k, v) -> fmap ((,) k) $ f k v   {-# RULES "indexGVertex/gVertexIndex" forall g i. gVertexIndex g (indexGVertex g i) = i #-}

@@ -1,7 +1,7 @@ Cabal-Version:      >= 1.2 Build-Type:         Simple Name:               graph-wrapper-Version:            0.2.3+Version:            0.2.4 Maintainer:         Max Bolingbroke <batterseapower@hotmail.com> Homepage:           http://www.github.com/batterseapower/graph-wrapper License:            BSD3