Script 'mail_helper' called by obssrc
Hello community,
here is the log from the commit of package ghc-recursion-schemes for
openSUSE:Factory checked in at 2022-10-13 15:44:12
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Comparing /work/SRC/openSUSE:Factory/ghc-recursion-schemes (Old)
and /work/SRC/openSUSE:Factory/.ghc-recursion-schemes.new.2275 (New)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "ghc-recursion-schemes"
Thu Oct 13 15:44:12 2022 rev:6 rq:1009712 version:5.2.2.2
Changes:
--------
---
/work/SRC/openSUSE:Factory/ghc-recursion-schemes/ghc-recursion-schemes.changes
2021-11-11 21:37:07.636919514 +0100
+++
/work/SRC/openSUSE:Factory/.ghc-recursion-schemes.new.2275/ghc-recursion-schemes.changes
2022-10-13 15:44:46.083045134 +0200
@@ -1,0 +2,6 @@
+Mon Aug 22 20:43:33 UTC 2022 - Peter Simons <[email protected]>
+
+- Update recursion-schemes to version 5.2.2.2 revision 1.
+ Upstream has revised the Cabal build instructions on Hackage.
+
+-------------------------------------------------------------------
New:
----
recursion-schemes.cabal
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Other differences:
------------------
++++++ ghc-recursion-schemes.spec ++++++
--- /var/tmp/diff_new_pack.FNEL7a/_old 2022-10-13 15:44:47.351047610 +0200
+++ /var/tmp/diff_new_pack.FNEL7a/_new 2022-10-13 15:44:47.363047633 +0200
@@ -1,7 +1,7 @@
#
# spec file for package ghc-recursion-schemes
#
-# Copyright (c) 2021 SUSE LLC
+# Copyright (c) 2022 SUSE LLC
#
# All modifications and additions to the file contributed by third parties
# remain the property of their copyright owners, unless otherwise agreed
@@ -25,6 +25,7 @@
License: BSD-2-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-base-orphans-devel
BuildRequires: ghc-cabal-doctest-devel
@@ -64,6 +65,7 @@
%prep
%autosetup -n %{pkg_name}-%{version}
+cp -p %{SOURCE1} %{pkg_name}.cabal
%build
%ghc_lib_build
++++++ recursion-schemes.cabal ++++++
name: recursion-schemes
category: Control, Recursion
version: 5.2.2.2
x-revision: 1
license: BSD2
cabal-version: 1.18
license-file: LICENSE
author: Edward A. Kmett
maintainer: "Samuel G??lineau" <[email protected]>,
"Ryan Scott" <[email protected]>,
"Luc Tielen" <[email protected]>
stability: provisional
homepage: http://github.com/ekmett/recursion-schemes/
bug-reports: http://github.com/ekmett/recursion-schemes/issues
copyright: Copyright (C) 2008-2015 Edward A. Kmett
synopsis: Representing common recursion patterns as higher-order functions
description: Many recursive functions share the same structure, e.g.
pattern-match on the input and, depending on the data constructor, either recur
on a smaller input or terminate the recursion with the base case. Another one:
start with a seed value, use it to produce the first element of an infinite
list, and recur on a modified seed in order to produce the rest of the list.
Such a structure is called a recursion scheme. Using higher-order functions to
implement those recursion schemes makes your code clearer, faster, and safer.
See README for details.
tested-with: 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.4, GHC==8.6.5, GHC==8.8.4, GHC==8.10.7, GHC==9.0.1,
GHC==9.2.1, GHC==9.4.1
build-type: Simple
extra-doc-files: docs/github-compression.png docs/flowchart.svg
extra-source-files: CHANGELOG.markdown .gitignore README.markdown
include/recursion-schemes-common.h
source-repository head
type: git
location: git://github.com/ekmett/recursion-schemes.git
flag template-haskell
description: About Template Haskell derivations
manual: True
default: True
library
other-extensions:
CPP
TypeFamilies
Rank2Types
FlexibleContexts
FlexibleInstances
GADTs
StandaloneDeriving
UndecidableInstances
hs-source-dirs: src
include-dirs: include
-- includes: recursion-schemes-common.h
build-depends:
base >= 4.5 && < 5,
containers >= 0.4.2.1 && < 0.7,
comonad >= 4 && < 6,
data-fix >= 0.3.0 && < 0.4,
free >= 4 && < 6,
transformers >= 0.3.0.0 && < 1
if !impl(ghc >= 8.2)
build-depends: bifunctors >= 4 && < 6
if !impl(ghc >= 8.0)
build-depends: semigroups >= 0.10 && < 1
if impl(ghc < 7.5)
build-depends: ghc-prim
-- Following two conditionals aren't inverses (there are other compilers than
GHC)
--
-- We enforce the fact that with GHC-7.10
-- we have at least transformers-0.4.2.0 (the bundled one)
-- which has 'Data.Functor.Classes' module. (transformers-0.3 doesn't have)
if impl(ghc >= 7.10)
build-depends:
transformers >= 0.4.2.0
if !impl(ghc >= 7.10)
build-depends:
nats,
transformers-compat >= 0.3 && < 1
-- Foldable module is first, so cabal repl loads it!
exposed-modules:
Data.Functor.Foldable
Data.Functor.Base
if flag(template-haskell)
build-depends:
template-haskell >= 2.5.0.0 && < 2.20,
base-orphans >= 0.5.4 && < 0.9,
th-abstraction >= 0.4 && < 0.5
exposed-modules:
Data.Functor.Foldable.TH
other-modules:
Paths_recursion_schemes
ghc-options: -Wall
if impl(ghc >= 8.6)
ghc-options: -Wno-star-is-type
default-language: Haskell2010
test-suite Expr
type: exitcode-stdio-1.0
main-is: Expr.hs
hs-source-dirs: examples
ghc-options: -Wall -threaded
default-language: Haskell2010
build-depends:
base,
HUnit <1.7,
recursion-schemes,
template-haskell,
transformers >= 0.2 && < 1
if impl(ghc < 7.5)
build-depends: ghc-prim
