osc copypac from project:devel:languages:haskell:ghc-9.6.x package:ghc-fgl revision:2, using keep-link
OBS-URL: https://build.opensuse.org/package/show/devel:languages:haskell/ghc-fgl?expand=0&rev=21
This commit is contained in:
parent
edd15da7c9
commit
5d69d22d2e
@ -1,3 +0,0 @@
|
|||||||
version https://git-lfs.github.com/spec/v1
|
|
||||||
oid sha256:d60ec09472f9bac0e54a3b55a274b5872ad28a048d5230e006a28c5adc8b8d09
|
|
||||||
size 56445
|
|
3
fgl-5.8.2.0.tar.gz
Normal file
3
fgl-5.8.2.0.tar.gz
Normal file
@ -0,0 +1,3 @@
|
|||||||
|
version https://git-lfs.github.com/spec/v1
|
||||||
|
oid sha256:44cf0cf720f1d3fb31689cab219adf9b1a5367b3fbf4bd6678f4d156f3e8c3b6
|
||||||
|
size 57401
|
137
fgl.cabal
137
fgl.cabal
@ -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 <http://web.engr.oregonstate.edu/~erwig/fgl/haskell>.
|
|
||||||
}
|
|
||||||
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
|
|
||||||
|
|
||||||
}
|
|
@ -1,3 +1,31 @@
|
|||||||
|
-------------------------------------------------------------------
|
||||||
|
Wed Oct 18 08:42:49 UTC 2023 - Peter Simons <psimons@suse.com>
|
||||||
|
|
||||||
|
- 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 <psimons@suse.com>
|
Thu Jun 22 19:46:07 UTC 2023 - Peter Simons <psimons@suse.com>
|
||||||
|
|
||||||
|
@ -20,13 +20,12 @@
|
|||||||
%global pkgver %{pkg_name}-%{version}
|
%global pkgver %{pkg_name}-%{version}
|
||||||
%bcond_with tests
|
%bcond_with tests
|
||||||
Name: ghc-%{pkg_name}
|
Name: ghc-%{pkg_name}
|
||||||
Version: 5.8.0.0
|
Version: 5.8.2.0
|
||||||
Release: 0
|
Release: 0
|
||||||
Summary: Martin Erwig's Functional Graph Library
|
Summary: Martin Erwig's Functional Graph Library
|
||||||
License: BSD-3-Clause
|
License: BSD-3-Clause
|
||||||
URL: https://hackage.haskell.org/package/%{pkg_name}
|
URL: https://hackage.haskell.org/package/%{pkg_name}
|
||||||
Source0: https://hackage.haskell.org/package/%{pkg_name}-%{version}/%{pkg_name}-%{version}.tar.gz
|
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-Cabal-devel
|
||||||
BuildRequires: ghc-array-devel
|
BuildRequires: ghc-array-devel
|
||||||
BuildRequires: ghc-array-prof
|
BuildRequires: ghc-array-prof
|
||||||
@ -81,7 +80,6 @@ This package provides the Haskell %{pkg_name} profiling library.
|
|||||||
|
|
||||||
%prep
|
%prep
|
||||||
%autosetup -n %{pkg_name}-%{version}
|
%autosetup -n %{pkg_name}-%{version}
|
||||||
cp -p %{SOURCE1} %{pkg_name}.cabal
|
|
||||||
|
|
||||||
%build
|
%build
|
||||||
%ghc_lib_build
|
%ghc_lib_build
|
||||||
|
Loading…
Reference in New Issue
Block a user