Hello community, here is the log from the commit of package ghc-fgl for openSUSE:Factory checked in at 2015-08-23 15:43:09 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/ghc-fgl (Old) and /work/SRC/openSUSE:Factory/.ghc-fgl.new (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "ghc-fgl" Changes: -------- --- /work/SRC/openSUSE:Factory/ghc-fgl/ghc-fgl.changes 2015-05-11 19:48:49.000000000 +0200 +++ /work/SRC/openSUSE:Factory/.ghc-fgl.new/ghc-fgl.changes 2015-08-23 17:38:55.000000000 +0200 @@ -1,0 +2,40 @@ +Fri Aug 7 07:09:38 UTC 2015 - mimi...@gmail.com + +- update to 5.5.2.1 +* Only create `NFData` instances for GHC >= 7.4.1. +* Documentation, clean-up and refactoring of various parts of the + library. + - As part of this, various types now have instances for classes + like `Show`, `Eq`, `Ord`, `NFData`, etc. where applicable. + - In particular, the various options for use with depth-first + search and shortest path queries was documented by David + Luposchainsky. +* Addition of a proper test-suite. So far it covers the + `Data.Graph.Inductive.Graph` module and all + `Data.Graph.Inductive.Query.*` modules except for `Monad`. +* Arbitrary instances for the two graph types are now available in the + new `fgl-arbitrary` sub-package. +* Now depends solely on the `transformers` library rather than `mtl`. +* Potentially breaking changes: + These changes are those where the behaviour was un-specified or + didn't match the documentation. + - `nodeRange` and `nodeRangeM` for the various graph data + structures erroneously returned `(0,0)` for empty graphs (making + them indistinguishable from graphs containing the single node + `0`). They now match the default implementation of throwing an + error. + - The behaviour of `delLEdge` when dealing with multiple edges was + unspecified; it now deletes only a single edge and the new + function `delAllLEdge` deletes all edges matching the one + provided. + - Creating sub-graphs by `Node`- and `Context`-filtering as well + as induced by a set of `Node`s. + - Graph condensation (i.e. graph of + strongly-connected-components). + - Various edge- and neighbor-based helper functions. +* The graph types now have `Generic` instances thanks to Piotr + Mlodawski. +* The `OrdGr` wrapper by Trevor Cook allows performing `Ord`-based + comparisons on graphs. + +------------------------------------------------------------------- Old: ---- fgl-5.5.1.0.tar.gz New: ---- fgl-5.5.2.1.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ ghc-fgl.spec ++++++ --- /var/tmp/diff_new_pack.WXQZBS/_old 2015-08-23 17:38:56.000000000 +0200 +++ /var/tmp/diff_new_pack.WXQZBS/_new 2015-08-23 17:38:56.000000000 +0200 @@ -20,7 +20,7 @@ %global pkg_name fgl Name: ghc-fgl -Version: 5.5.1.0 +Version: 5.5.2.1 Release: 0 Summary: Martin Erwig's Functional Graph Library License: BSD-3-Clause ++++++ fgl-5.5.1.0.tar.gz -> fgl-5.5.2.1.tar.gz ++++++ ++++ 4903 lines of diff (skipped)
