fgl 5.4.2.3 → 5.4.2.4
raw patch · 2 files changed
+51/−43 lines, 2 filesdep ~basePVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: base
API changes (from Hackage documentation)
- Data.Graph.Inductive.Example: a :: Gr Char ()
- Data.Graph.Inductive.Example: a' :: IO (SGr Char ())
- Data.Graph.Inductive.Example: ab :: Gr Char ()
- Data.Graph.Inductive.Example: ab' :: IO (SGr Char ())
- Data.Graph.Inductive.Example: abb :: Gr Char ()
- Data.Graph.Inductive.Example: abb' :: IO (SGr Char ())
- Data.Graph.Inductive.Example: b :: Gr Char ()
- Data.Graph.Inductive.Example: b' :: IO (SGr Char ())
- Data.Graph.Inductive.Example: c :: Gr Char ()
- Data.Graph.Inductive.Example: c' :: IO (SGr Char ())
- Data.Graph.Inductive.Example: clr479 :: Gr Char ()
- Data.Graph.Inductive.Example: clr479' :: IO (SGr Char ())
- Data.Graph.Inductive.Example: clr489 :: Gr Char ()
- Data.Graph.Inductive.Example: clr489' :: IO (SGr Char ())
- Data.Graph.Inductive.Example: clr508 :: Gr Char Int
- Data.Graph.Inductive.Example: clr508' :: IO (SGr Char Int)
- Data.Graph.Inductive.Example: clr528 :: Gr Char Int
- Data.Graph.Inductive.Example: clr528' :: IO (SGr Char Int)
- Data.Graph.Inductive.Example: clr595 :: Gr Int Int
- Data.Graph.Inductive.Example: cyc3 :: Gr Char String
- Data.Graph.Inductive.Example: d1 :: Gr Int Int
- Data.Graph.Inductive.Example: d1' :: IO (SGr Int Int)
- Data.Graph.Inductive.Example: d3 :: Gr Int Int
- Data.Graph.Inductive.Example: d3' :: IO (SGr Int Int)
- Data.Graph.Inductive.Example: dag3 :: Gr Char ()
- Data.Graph.Inductive.Example: dag3' :: IO (SGr Char ())
- Data.Graph.Inductive.Example: e :: Gr Char ()
- Data.Graph.Inductive.Example: e' :: IO (SGr Char ())
- Data.Graph.Inductive.Example: g3 :: Gr Char String
- Data.Graph.Inductive.Example: g3b :: Gr Char String
- Data.Graph.Inductive.Example: gr1 :: Gr Int Int
- Data.Graph.Inductive.Example: loop :: Gr Char ()
- Data.Graph.Inductive.Example: loop' :: IO (SGr Char ())
+ Data.Graph.Inductive.Example: a', dag3', abb', ab', loop', e', c', b' :: IO (SGr Char ())
+ Data.Graph.Inductive.Example: a, dag3, abb, ab, loop, e, c, b :: Gr Char ()
+ Data.Graph.Inductive.Example: clr479', clr489' :: IO (SGr Char ())
+ Data.Graph.Inductive.Example: clr479, clr489 :: Gr Char ()
+ Data.Graph.Inductive.Example: clr508', clr528' :: IO (SGr Char Int)
+ Data.Graph.Inductive.Example: clr508, clr528 :: Gr Char Int
+ Data.Graph.Inductive.Example: clr595, gr1 :: Gr Int Int
+ Data.Graph.Inductive.Example: cyc3, g3b, g3 :: Gr Char String
+ Data.Graph.Inductive.Example: d1', d3' :: IO (SGr Int Int)
+ Data.Graph.Inductive.Example: d1, d3 :: Gr Int Int
Files
- Data/Graph/Inductive/PatriciaTree.hs +1/−1
- fgl.cabal +50/−42
Data/Graph/Inductive/PatriciaTree.hs view
@@ -1,4 +1,4 @@-{-# LANGUAGE ScopedTypeVariables #-}+{-# LANGUAGE BangPatterns, ScopedTypeVariables #-} -- |An efficient implementation of 'Data.Graph.Inductive.Graph.Graph' -- using big-endian patricia tree (i.e. "Data.IntMap").
fgl.cabal view
@@ -1,42 +1,50 @@-name: fgl-version: 5.4.2.3-license: BSD3-license-file: LICENSE-author: Martin Erwig, Ivan Lazar Miljenovic-maintainer: Ivan.Miljenovic@gmail.com, tomberek@gmail.com-homepage: http://web.engr.oregonstate.edu/~erwig/fgl/haskell-category: Data Structures-synopsis: Martin Erwig's Functional Graph Library-exposed-modules:- Data.Graph.Inductive.Internal.FiniteMap,- Data.Graph.Inductive.Internal.Heap,- Data.Graph.Inductive.Internal.Queue,- Data.Graph.Inductive.Internal.RootPath,- Data.Graph.Inductive.Internal.Thread,- Data.Graph.Inductive.Basic,- Data.Graph.Inductive.Example,- Data.Graph.Inductive.Graph,- Data.Graph.Inductive.Graphviz,- Data.Graph.Inductive.Monad,- Data.Graph.Inductive.NodeMap,- Data.Graph.Inductive.PatriciaTree,- Data.Graph.Inductive.Query,- Data.Graph.Inductive.Tree,- Data.Graph.Inductive.Monad.IOArray,- Data.Graph.Inductive.Query.ArtPoint,- Data.Graph.Inductive.Query.BCC,- Data.Graph.Inductive.Query.BFS,- Data.Graph.Inductive.Query.DFS,- Data.Graph.Inductive.Query.Dominators,- Data.Graph.Inductive.Query.GVD,- Data.Graph.Inductive.Query.Indep,- Data.Graph.Inductive.Query.MST,- Data.Graph.Inductive.Query.MaxFlow,- Data.Graph.Inductive.Query.MaxFlow2,- Data.Graph.Inductive.Query.Monad,- Data.Graph.Inductive.Query.SP,- Data.Graph.Inductive.Query.TransClos,- Data.Graph.Inductive-build-depends: base < 5, mtl, containers, array-extensions: MultiParamTypeClasses, OverlappingInstances, FlexibleInstances, ScopedTypeVariables-build-type: Simple+name: fgl+version: 5.4.2.4+license: BSD3+license-file: LICENSE+author: Martin Erwig, Ivan Lazar Miljenovic+maintainer: Ivan.Miljenovic@gmail.com, tomberek@gmail.com+homepage: http://web.engr.oregonstate.edu/~erwig/fgl/haskell+category: Data Structures, Graphs+synopsis: Martin Erwig's Functional Graph Library+cabal-version: >= 1.6+build-type: Simple++source-repository head+ type: darcs+ location: http://code.haskell.org/FGL/fgl-5++library {+ exposed-modules:+ Data.Graph.Inductive.Internal.FiniteMap,+ Data.Graph.Inductive.Internal.Heap,+ Data.Graph.Inductive.Internal.Queue,+ Data.Graph.Inductive.Internal.RootPath,+ Data.Graph.Inductive.Internal.Thread,+ Data.Graph.Inductive.Basic,+ Data.Graph.Inductive.Example,+ Data.Graph.Inductive.Graph,+ Data.Graph.Inductive.Graphviz,+ Data.Graph.Inductive.Monad,+ Data.Graph.Inductive.NodeMap,+ Data.Graph.Inductive.PatriciaTree,+ Data.Graph.Inductive.Query,+ Data.Graph.Inductive.Tree,+ Data.Graph.Inductive.Monad.IOArray,+ Data.Graph.Inductive.Query.ArtPoint,+ Data.Graph.Inductive.Query.BCC,+ Data.Graph.Inductive.Query.BFS,+ Data.Graph.Inductive.Query.DFS,+ Data.Graph.Inductive.Query.Dominators,+ Data.Graph.Inductive.Query.GVD,+ Data.Graph.Inductive.Query.Indep,+ Data.Graph.Inductive.Query.MST,+ Data.Graph.Inductive.Query.MaxFlow,+ Data.Graph.Inductive.Query.MaxFlow2,+ Data.Graph.Inductive.Query.Monad,+ Data.Graph.Inductive.Query.SP,+ Data.Graph.Inductive.Query.TransClos,+ Data.Graph.Inductive+ build-depends: base < 5, mtl, containers, array+ extensions: MultiParamTypeClasses, OverlappingInstances, FlexibleInstances, ScopedTypeVariables+}