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 2023-01-18 13:10:21
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Comparing /work/SRC/openSUSE:Factory/ghc-recursion-schemes (Old)
 and      /work/SRC/openSUSE:Factory/.ghc-recursion-schemes.new.32243 (New)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Package is "ghc-recursion-schemes"

Wed Jan 18 13:10:21 2023 rev:7 rq:1059098 version:5.2.2.3

Changes:
--------
--- 
/work/SRC/openSUSE:Factory/ghc-recursion-schemes/ghc-recursion-schemes.changes  
    2022-10-13 15:44:46.083045134 +0200
+++ 
/work/SRC/openSUSE:Factory/.ghc-recursion-schemes.new.32243/ghc-recursion-schemes.changes
   2023-01-18 13:10:45.712803567 +0100
@@ -1,0 +2,9 @@
+Mon Dec 26 16:33:26 UTC 2022 - Peter Simons <psim...@suse.com>
+
+- Update recursion-schemes to version 5.2.2.3.
+  ## 5.2.2.3
+
+  * Workaround for https://gitlab.haskell.org/ghc/ghc/-/issues/18320, which was
+    preventing code calling makeBaseFunctor from being profiled.
+
+-------------------------------------------------------------------

Old:
----
  recursion-schemes-5.2.2.2.tar.gz
  recursion-schemes.cabal

New:
----
  recursion-schemes-5.2.2.3.tar.gz

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Other differences:
------------------
++++++ ghc-recursion-schemes.spec ++++++
--- /var/tmp/diff_new_pack.JAKFEs/_old  2023-01-18 13:10:46.452807953 +0100
+++ /var/tmp/diff_new_pack.JAKFEs/_new  2023-01-18 13:10:46.456807977 +0100
@@ -19,13 +19,12 @@
 %global pkg_name recursion-schemes
 %bcond_with tests
 Name:           ghc-%{pkg_name}
-Version:        5.2.2.2
+Version:        5.2.2.3
 Release:        0
 Summary:        Representing common recursion patterns as higher-order 
functions
 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
@@ -65,7 +64,6 @@
 
 %prep
 %autosetup -n %{pkg_name}-%{version}
-cp -p %{SOURCE1} %{pkg_name}.cabal
 
 %build
 %ghc_lib_build

++++++ recursion-schemes-5.2.2.2.tar.gz -> recursion-schemes-5.2.2.3.tar.gz 
++++++
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/recursion-schemes-5.2.2.2/CHANGELOG.markdown 
new/recursion-schemes-5.2.2.3/CHANGELOG.markdown
--- old/recursion-schemes-5.2.2.2/CHANGELOG.markdown    2001-09-09 
03:46:40.000000000 +0200
+++ new/recursion-schemes-5.2.2.3/CHANGELOG.markdown    2001-09-09 
03:46:40.000000000 +0200
@@ -1,3 +1,8 @@
+## 5.2.2.3
+
+* Workaround for https://gitlab.haskell.org/ghc/ghc/-/issues/18320, which was
+  preventing code calling makeBaseFunctor from being profiled.
+
 ## 5.2.2.2
 
 * Support GHC-9.0 and GHC-9.2
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/recursion-schemes-5.2.2.2/recursion-schemes.cabal 
new/recursion-schemes-5.2.2.3/recursion-schemes.cabal
--- old/recursion-schemes-5.2.2.2/recursion-schemes.cabal       2001-09-09 
03:46:40.000000000 +0200
+++ new/recursion-schemes-5.2.2.3/recursion-schemes.cabal       2001-09-09 
03:46:40.000000000 +0200
@@ -1,6 +1,6 @@
 name:          recursion-schemes
 category:      Control, Recursion
-version:       5.2.2.2
+version:       5.2.2.3
 license:       BSD2
 cabal-version: 1.18
 license-file:  LICENSE
@@ -15,7 +15,7 @@
 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
+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
@@ -83,7 +83,7 @@
 
   if flag(template-haskell)
     build-depends:
-      template-haskell >= 2.5.0.0 && < 2.19,
+      template-haskell >= 2.5.0.0 && < 2.20,
       base-orphans     >= 0.5.4   && < 0.9,
       th-abstraction   >= 0.4     && < 0.5
     exposed-modules:
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' 
old/recursion-schemes-5.2.2.2/src/Data/Functor/Foldable/TH.hs 
new/recursion-schemes-5.2.2.3/src/Data/Functor/Foldable/TH.hs
--- old/recursion-schemes-5.2.2.2/src/Data/Functor/Foldable/TH.hs       
2001-09-09 03:46:40.000000000 +0200
+++ new/recursion-schemes-5.2.2.3/src/Data/Functor/Foldable/TH.hs       
2001-09-09 03:46:40.000000000 +0200
@@ -1,4 +1,13 @@
 {-# LANGUAGE CPP, PatternGuards, Rank2Types #-}
+-- This OPTIONS_GHC line is a workaround for
+-- https://gitlab.haskell.org/ghc/ghc/-/issues/18320, a bug which only occurs
+-- when running specific TemplateHaskell code while both profiling and
+-- optimisations are enabled. The code in this file triggers the bug, so until
+-- it is fixed, we work around the issue by disabling optimisations in this
+-- file. The code in this file only runs at compile-time, the code _generated_
+-- by makeBaseFunctor will still get optimized if the file which calls
+-- makeBaseFunctor is optimized.
+{-# OPTIONS_GHC -O0 #-}
 module Data.Functor.Foldable.TH
   ( MakeBaseFunctor(..)
   , BaseRules
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' 
old/recursion-schemes-5.2.2.2/src/Data/Functor/Foldable.hs 
new/recursion-schemes-5.2.2.3/src/Data/Functor/Foldable.hs
--- old/recursion-schemes-5.2.2.2/src/Data/Functor/Foldable.hs  2001-09-09 
03:46:40.000000000 +0200
+++ new/recursion-schemes-5.2.2.3/src/Data/Functor/Foldable.hs  2001-09-09 
03:46:40.000000000 +0200
@@ -197,7 +197,7 @@
 -- | A recursive datatype which can be unrolled one recursion layer at a time.
 --
 -- For example, a value of type @[a]@ can be unrolled into a @'ListF' a [a]@.
--- Ifthat unrolled value is a 'Cons', it contains another @[a]@ which can be
+-- If that unrolled value is a 'Cons', it contains another @[a]@ which can be
 -- unrolled as well, and so on.
 --
 -- Typically, 'Recursive' types also have a 'Corecursive' instance, in which

Reply via email to