digraph 0.1.0.1 → 0.1.0.2

raw patch · 4 files changed

+26/−25 lines, 4 filesdep ~basesetup-changednew-uploaderPVP ok

version bump matches the API change (PVP)

Dependency ranges changed: base

API changes (from Hackage documentation)

Files

• CHANGELOG.md +4/−0
• Setup.hs +0/−2
• digraph.cabal +1/−2
• src/Data/DiGraph.hs +21/−21

@@ -1,5 +1,9 @@ # Revision history for digraph +## 0.1.0.2 -- 2019-06-03++* Haddocks fixed for older Haddock versions.+ ## 0.1.0.1 -- 2019-05-31  * Support for `hashable >=1.2`.

@@ -1,2 +0,0 @@-import Distribution.Simple-main = defaultMain

@@ -1,6 +1,6 @@ cabal-version: 2.2 name: digraph-version: 0.1.0.1+version: 0.1.0.2 synopsis: Directed Graphs description: Directed graphs implementation that is based on unordered-containers homepage: https://github.com/kadena-io/digraph@@ -65,4 +65,3 @@         , fgl >=5.7         , hashable >=1.2         , massiv >=0.3-

@@ -1,8 +1,8 @@-{-# LANGUAGE DeriveAnyClass #-}-{-# LANGUAGE DeriveGeneric #-}-{-# LANGUAGE DerivingStrategies #-}-{-# LANGUAGE LambdaCase #-}-{-# LANGUAGE OverloadedLists #-}+{-# LANGUAGE DeriveAnyClass      #-}+{-# LANGUAGE DeriveGeneric       #-}+{-# LANGUAGE DerivingStrategies  #-}+{-# LANGUAGE LambdaCase          #-}+{-# LANGUAGE OverloadedLists     #-} {-# LANGUAGE ScopedTypeVariables #-}  -- |@@ -85,25 +85,25 @@  ) where -import Control.Arrow-import Control.DeepSeq-import Control.Monad+import           Control.Arrow+import           Control.DeepSeq+import           Control.Monad -import Data.Foldable-import Data.Hashable (Hashable)+import           Data.Foldable+import           Data.Hashable (Hashable) import qualified Data.HashMap.Strict as HM import qualified Data.HashSet as HS import qualified Data.List as L-import Data.Maybe-import Data.Semigroup-import Data.Traversable-import Data.Tuple+import           Data.Maybe+import           Data.Semigroup+import           Data.Traversable+import           Data.Tuple -import GHC.Generics+import           GHC.Generics -import Numeric.Natural+import           Numeric.Natural -import Prelude hiding (cycle)+import           Prelude hiding (cycle)  -- internal modules @@ -384,14 +384,15 @@ -- nodes of the graph. -- data ShortestPathCache a = ShortestPathCache-    {-# UNPACK #-} !FW.ShortestPathMatrix+    { _spcMatrix   :: {-# UNPACK #-} !FW.ShortestPathMatrix         -- ^ The shortest path matrix of a graph.-    !(HM.HashMap a Int)+    , _spcIndices  :: !(HM.HashMap a Int)         -- ^ mapping from vertices of the graph to indices in the shortest path         -- matrix.-    !(HM.HashMap Int a)+    , _spcVertices :: !(HM.HashMap Int a)         -- ^ mapping from indices in the shortest path matrix to vertices in the         -- graph.+    }     deriving (Show, Eq, Ord, Generic)     deriving anyclass (NFData) @@ -602,4 +603,3 @@         , i <- [0 .. 4]         , let b = q_off i ((h * i + j) `mod` 5)         ]-