From 6fa508095d8954d570b93cb4998961cae1417db4 Mon Sep 17 00:00:00 2001 From: Bernhard M. Wiedemann Date: Jan 17 2024 17:09:22 +0000 Subject: update --- diff --git a/.files b/.files index efe0e81..e64434d 100644 Binary files a/.files and b/.files differ diff --git a/.rev b/.rev index d3977c6..c9d3e1e 100644 --- a/.rev +++ b/.rev @@ -63,4 +63,12 @@ Automatic submission by obs-autosubmit 1096037 + + 54059976d5dbca7953f0d54692e2c668 + 5.8.2.0 + + anag+factory + version update + 1128071 + diff --git a/fgl-5.8.0.0.tar.gz b/fgl-5.8.0.0.tar.gz deleted file mode 120000 index b61366b..0000000 --- a/fgl-5.8.0.0.tar.gz +++ /dev/null @@ -1 +0,0 @@ -/ipfs/bafkreigwb3aji4xzxlaoksr3kwrhjnmhfljiubenkiyoabvcrrnnzc4nbe \ No newline at end of file diff --git a/fgl-5.8.2.0.tar.gz b/fgl-5.8.2.0.tar.gz new file mode 120000 index 0000000..2ccf9f2 --- /dev/null +++ b/fgl-5.8.2.0.tar.gz @@ -0,0 +1 @@ +/ipfs/bafkreicez4gpoihr2p5tc2e4vmqzvx43djjwpm736s6wm6hu2flph2gdwy \ No newline at end of file diff --git a/fgl.cabal b/fgl.cabal deleted file mode 100644 index 03e6acc..0000000 --- a/fgl.cabal +++ /dev/null @@ -1,137 +0,0 @@ -name: fgl -version: 5.8.0.0 -x-revision: 1 -license: BSD3 -license-file: LICENSE -author: Martin Erwig, Ivan Lazar Miljenovic -maintainer: Ivan.Miljenovic@gmail.com -category: Data Structures, Graphs -synopsis: Martin Erwig's Functional Graph Library - -description: { -An inductive representation of manipulating graph data structures. -. -Original website can be found at . -} -cabal-version: >= 1.10 -build-type: Simple -extra-source-files: - ChangeLog - -tested-with: GHC == 7.2.2, GHC == 7.4.2, GHC == 7.6.3, GHC == 7.8.4, - GHC == 7.10.3, GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.3, - GHC == 8.6.2, GHC == 8.8.2, GHC == 8.10.7, GHC == 9.0.2, - GHC == 9.2.3, GHC == 9.4.2 - -source-repository head - type: git - location: https://github.com/haskell/fgl.git - -flag containers042 { - manual: False - default: True -} - -library { - default-language: Haskell98 - - exposed-modules: - 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.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.Monad.STArray, - 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 - - other-modules: - Paths_fgl - - build-depends: base >= 4.3 && < 4.18 - , transformers - , array - - if flag(containers042) - build-depends: containers >= 0.4.2 - , deepseq >= 1.1.0.0 && < 1.5 - else - build-depends: containers < 0.4.2 - - if impl(ghc >= 7.2) && impl(ghc < 7.6) - build-depends: - ghc-prim - - ghc-options: -Wall - -} - -test-suite fgl-tests { - default-language: Haskell98 - - type: exitcode-stdio-1.0 - - build-depends: fgl - , base - , QuickCheck >= 2.8 && < 2.15 - , hspec >= 2.1 && < 2.11 - , containers - - hs-source-dirs: test - fgl-arbitrary - - main-is: TestSuite.hs - - other-modules: Data.Graph.Inductive.Arbitrary - , Data.Graph.Inductive.Graph.Properties - , Data.Graph.Inductive.Proxy - , Data.Graph.Inductive.Query.Properties - - ghc-options: -Wall - -} - -benchmark fgl-benchmark { - if flag(containers042) - buildable: True - else - buildable: False - - default-language: Haskell98 - - type: exitcode-stdio-1.0 - - hs-source-dirs: test - - main-is: benchmark.hs - - other-modules: Data.Graph.Inductive.Proxy - - build-depends: fgl - , base - , microbench - , deepseq - - ghc-options: -Wall - -} diff --git a/ghc-fgl.changes b/ghc-fgl.changes index 443ab3a..854d390 100644 --- a/ghc-fgl.changes +++ b/ghc-fgl.changes @@ -1,4 +1,32 @@ ------------------------------------------------------------------- +Wed Oct 18 08:42:49 UTC 2023 - Peter Simons + +- Update fgl to version 5.8.2.0. + 5.8.2.0 + ------- + + * Data.Graph.Inductive.Graph now only requires Graph, not DynGraph + (issue #100). + + * Documented that some functions are partial (issue #98). + + * Add `insert` function as synonym for `&` (issue #90). + + 5.8.1.1 + ------- + + * Data.Graph.Inductive.Query.Dominators.{dom,iDom} could fail for some + graphs (issue #109, regression in 5.8.1.0). + + 5.8.1.0 + ------- + + * Data.Graph.Inductive.PatriciaTree.Gr and + Data.Graph.Inductive.Tree.Gr now have Functor instances. + + * 'Gr a' is now an instance of Functor. + +------------------------------------------------------------------- Thu Jun 22 19:46:07 UTC 2023 - Peter Simons - Update fgl to version 5.8.0.0 revision 1. diff --git a/ghc-fgl.spec b/ghc-fgl.spec index 78833a2..2971acc 100644 --- a/ghc-fgl.spec +++ b/ghc-fgl.spec @@ -20,13 +20,12 @@ %global pkgver %{pkg_name}-%{version} %bcond_with tests Name: ghc-%{pkg_name} -Version: 5.8.0.0 +Version: 5.8.2.0 Release: 0 Summary: Martin Erwig's Functional Graph Library License: BSD-3-Clause URL: https://hackage.haskell.org/package/%{pkg_name} Source0: https://hackage.haskell.org/package/%{pkg_name}-%{version}/%{pkg_name}-%{version}.tar.gz -Source1: https://hackage.haskell.org/package/%{pkg_name}-%{version}/revision/1.cabal#/%{pkg_name}.cabal BuildRequires: ghc-Cabal-devel BuildRequires: ghc-array-devel BuildRequires: ghc-array-prof @@ -81,7 +80,6 @@ This package provides the Haskell %{pkg_name} profiling library. %prep %autosetup -n %{pkg_name}-%{version} -cp -p %{SOURCE1} %{pkg_name}.cabal %build %ghc_lib_build