* Thu Dec 17 2020 Ond?ej Súkup <mimi.vx@gmail.com>
- disable %{ix86} build
* Tue Aug 18 2020 Peter Simons <psimons@suse.com>
- Replace %setup -q with the more modern %autosetup macro.
* Tue Aug 04 2020 psimons@suse.com
- Update fgl to version 5.7.0.3.
5.7.0.3
- ------
* Bump QuickCheck dependency
* Tue Jun 09 2020 psimons@suse.com
- Add fgl at version 5.7.0.2.
Version: 5.5.3.0-2.3
* Fri Jul 22 2016 psimons@suse.com
- Update to version 5.5.3.0 revision 0 with cabal2obs.
* Sun Jul 10 2016 psimons@suse.com
- Update to version 5.5.2.3 revision 0 with cabal2obs.
This update obsoletes ghc-fgl-rpmlintrc.
* Sat Sep 26 2015 peter.trommler@ohm-hochschule.de
- remove dependency on mtl
* Sun Sep 13 2015 mimi.vx@gmail.com
- update to 5.5.2.3
* Ensure firing of specialised rules for `PatriciaTree`.
* Better way of only creating `NFData` instances when possible.
* Fri Aug 07 2015 mimi.vx@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.
* Mon Apr 13 2015 mimi.vx@gmail.com
- update to 5.5.1.0
* Support added for GHC 7.10 by Herbert Valerio Riedel.
* Additional DFS query functions added by Conrad Parker.
* Repository location changed to GitHub.
* Code cleanup:
Data.Set from the containers library.
Remove usage of data type contexts.
Use newtypes where applicable.
* Tue Sep 02 2014 peter.trommler@ohm-hochschule.de
- update to 5.5.0.1 for Haskell Platform 2014.2.0.0
* fixes for Tree and PatriciaTree classes
- regenerate spec file
* Sat Aug 23 2014 peter.trommler@ohm-hochschule.de
- enable PowerPC builds
* Thu Jul 31 2014 dimstar@opensuse.org
- Rename rpmlintrc to %{name}-rpmlintrc.
Follow the packaging guidelines.
* Mon May 06 2013 peter.trommler@ohm-hochschule.de
- more transparent packaging (fewer macros)
* Fri Jan 04 2013 peter.trommler@ohm-hochschule.de
- expand macro in name tag to help source validator
* Sat Nov 17 2012 peter.trommler@ohm-hochschule.de
- make service localonly for Factory submission
* Tue Jun 05 2012 peter.trommler@ohm-hochschule.de
- cabal2spec 0.25.5 template for spec file
* Tue May 29 2012 peter.trommler@ohm-hochschule.de
- added copyright notice
* Sat Dec 31 2011 peter.trommler@ohm-hochschule.de
- Added arch.
* Sat Dec 31 2011 peter.trommler@ohm-hochschule.de
- Initial packaging.