Hello community,

here is the log from the commit of package ghc-profunctors for openSUSE:Factory 
checked in at 2019-12-27 13:56:19
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Comparing /work/SRC/openSUSE:Factory/ghc-profunctors (Old)
 and      /work/SRC/openSUSE:Factory/.ghc-profunctors.new.6675 (New)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Package is "ghc-profunctors"

Fri Dec 27 13:56:19 2019 rev:12 rq:759479 version:5.5.1

Changes:
--------
--- /work/SRC/openSUSE:Factory/ghc-profunctors/ghc-profunctors.changes  
2019-10-18 14:34:33.996062326 +0200
+++ 
/work/SRC/openSUSE:Factory/.ghc-profunctors.new.6675/ghc-profunctors.changes    
    2019-12-27 13:56:21.320744898 +0100
@@ -1,0 +2,14 @@
+Wed Nov 27 03:00:49 UTC 2019 - [email protected]
+
+- Update profunctors to version 5.5.1.
+  5.5.1 [2019.11.26]
+  ------------------
+  * Add `Choice`, `Cochoice`, `Closed`, `Strong`, and `Costrong` instances for
+    `Data.Bifunctor.Sum`.
+
+-------------------------------------------------------------------
+Fri Nov  8 16:14:28 UTC 2019 - Peter Simons <[email protected]>
+
+- Drop obsolete group attributes.
+
+-------------------------------------------------------------------

Old:
----
  profunctors-5.5.tar.gz

New:
----
  profunctors-5.5.1.tar.gz

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

Other differences:
------------------
++++++ ghc-profunctors.spec ++++++
--- /var/tmp/diff_new_pack.g5S3PJ/_old  2019-12-27 13:56:21.880745169 +0100
+++ /var/tmp/diff_new_pack.g5S3PJ/_new  2019-12-27 13:56:21.888745173 +0100
@@ -18,11 +18,10 @@
 
 %global pkg_name profunctors
 Name:           ghc-%{pkg_name}
-Version:        5.5
+Version:        5.5.1
 Release:        0
 Summary:        Profunctors
 License:        BSD-3-Clause
-Group:          Development/Libraries/Haskell
 URL:            https://hackage.haskell.org/package/%{pkg_name}
 Source0:        
https://hackage.haskell.org/package/%{pkg_name}-%{version}/%{pkg_name}-%{version}.tar.gz
 BuildRequires:  ghc-Cabal-devel
@@ -40,7 +39,6 @@
 
 %package devel
 Summary:        Haskell %{pkg_name} library development files
-Group:          Development/Libraries/Haskell
 Requires:       %{name} = %{version}-%{release}
 Requires:       ghc-compiler = %{ghc_version}
 Requires(post): ghc-compiler = %{ghc_version}

++++++ profunctors-5.5.tar.gz -> profunctors-5.5.1.tar.gz ++++++
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/profunctors-5.5/CHANGELOG.markdown 
new/profunctors-5.5.1/CHANGELOG.markdown
--- old/profunctors-5.5/CHANGELOG.markdown      2001-09-09 03:46:40.000000000 
+0200
+++ new/profunctors-5.5.1/CHANGELOG.markdown    2001-09-09 03:46:40.000000000 
+0200
@@ -1,3 +1,8 @@
+5.5.1 [2019.11.26]
+------------------
+* Add `Choice`, `Cochoice`, `Closed`, `Strong`, and `Costrong` instances for
+  `Data.Bifunctor.Sum`.
+
 5.5 [2019.09.06]
 ----------------
 * Change the type of `roam` to make it actually useful.
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/profunctors-5.5/profunctors.cabal 
new/profunctors-5.5.1/profunctors.cabal
--- old/profunctors-5.5/profunctors.cabal       2001-09-09 03:46:40.000000000 
+0200
+++ new/profunctors-5.5.1/profunctors.cabal     2001-09-09 03:46:40.000000000 
+0200
@@ -1,6 +1,6 @@
 name:          profunctors
 category:      Control, Categories
-version:       5.5
+version:       5.5.1
 license:       BSD3
 cabal-version: >= 1.10
 license-file:  LICENSE
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/profunctors-5.5/src/Data/Profunctor/Choice.hs 
new/profunctors-5.5.1/src/Data/Profunctor/Choice.hs
--- old/profunctors-5.5/src/Data/Profunctor/Choice.hs   2001-09-09 
03:46:40.000000000 +0200
+++ new/profunctors-5.5.1/src/Data/Profunctor/Choice.hs 2001-09-09 
03:46:40.000000000 +0200
@@ -33,8 +33,9 @@
 import Control.Comonad
 import Data.Bifunctor.Joker (Joker(..))
 import Data.Bifunctor.Product (Product(..))
+import Data.Bifunctor.Sum (Sum(..))
 import Data.Bifunctor.Tannen (Tannen(..))
-import Data.Monoid hiding (Product)
+import Data.Monoid hiding (Product, Sum)
 import Data.Profunctor.Adjunction
 import Data.Profunctor.Monad
 import Data.Profunctor.Strong
@@ -158,6 +159,14 @@
   right' (Pair p q) = Pair (right' p) (right' q)
   {-# INLINE right' #-}
 
+instance (Choice p, Choice q) => Choice (Sum p q) where
+  left' (L2 p) = L2 (left' p)
+  left' (R2 q) = R2 (left' q)
+  {-# INLINE left' #-}
+  right' (L2 p) = L2 (right' p)
+  right' (R2 q) = R2 (right' q)
+  {-# INLINE right' #-}
+
 instance (Functor f, Choice p) => Choice (Tannen f p) where
   left' (Tannen fp) = Tannen (fmap left' fp)
   {-# INLINE left' #-}
@@ -349,6 +358,12 @@
   unleft (Pair p q) = Pair (unleft p) (unleft q)
   unright (Pair p q) = Pair (unright p) (unright q)
 
+instance (Cochoice p, Cochoice q) => Cochoice (Sum p q) where
+  unleft (L2 p) = L2 (unleft p)
+  unleft (R2 q) = R2 (unleft q)
+  unright (L2 p) = L2 (unright p)
+  unright (R2 q) = R2 (unright q)
+
 instance Cochoice (Forget r) where
   unleft (Forget f) = Forget (f . Left)
   unright (Forget f) = Forget (f . Right)
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/profunctors-5.5/src/Data/Profunctor/Closed.hs 
new/profunctors-5.5.1/src/Data/Profunctor/Closed.hs
--- old/profunctors-5.5/src/Data/Profunctor/Closed.hs   2001-09-09 
03:46:40.000000000 +0200
+++ new/profunctors-5.5.1/src/Data/Profunctor/Closed.hs 2001-09-09 
03:46:40.000000000 +0200
@@ -30,6 +30,7 @@
 import Control.Category
 import Control.Comonad
 import Data.Bifunctor.Product (Product(..))
+import Data.Bifunctor.Sum (Sum(..))
 import Data.Bifunctor.Tannen (Tannen(..))
 import Data.Coerce (Coercible, coerce)
 import Data.Distributive
@@ -38,7 +39,7 @@
 import Data.Profunctor.Strong
 import Data.Profunctor.Types
 import Data.Profunctor.Unsafe
-import Data.Semigroup hiding (Product)
+import Data.Semigroup hiding (Product, Sum)
 import Data.Tagged
 import Data.Tuple
 import Prelude hiding ((.),id)
@@ -81,6 +82,10 @@
 instance (Closed p, Closed q) => Closed (Product p q) where
   closed (Pair p q) = Pair (closed p) (closed q)
 
+instance (Closed p, Closed q) => Closed (Sum p q) where
+  closed (L2 p) = L2 (closed p)
+  closed (R2 q) = R2 (closed q)
+
 instance (Functor f, Closed p) => Closed (Tannen f p) where
   closed (Tannen fp) = Tannen (fmap closed fp)
 
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/profunctors-5.5/src/Data/Profunctor/Strong.hs 
new/profunctors-5.5.1/src/Data/Profunctor/Strong.hs
--- old/profunctors-5.5/src/Data/Profunctor/Strong.hs   2001-09-09 
03:46:40.000000000 +0200
+++ new/profunctors-5.5.1/src/Data/Profunctor/Strong.hs 2001-09-09 
03:46:40.000000000 +0200
@@ -39,13 +39,14 @@
 import Control.Monad.Fix
 import Data.Bifunctor.Clown (Clown(..))
 import Data.Bifunctor.Product (Product(..))
+import Data.Bifunctor.Sum (Sum(..))
 import Data.Bifunctor.Tannen (Tannen(..))
 import Data.Functor.Contravariant (Contravariant(..))
 import Data.Profunctor.Adjunction
 import Data.Profunctor.Monad
 import Data.Profunctor.Types
 import Data.Profunctor.Unsafe
-import Data.Semigroup hiding (Product)
+import Data.Semigroup hiding (Product, Sum)
 import Data.Tagged
 import Data.Tuple
 import Prelude hiding (id,(.))
@@ -146,6 +147,14 @@
   second' (Pair p q) = Pair (second' p) (second' q)
   {-# INLINE second' #-}
 
+instance (Strong p, Strong q) => Strong (Sum p q) where
+  first' (L2 p) = L2 (first' p)
+  first' (R2 q) = R2 (first' q)
+  {-# INLINE first' #-}
+  second' (L2 p) = L2 (second' p)
+  second' (R2 q) = R2 (second' q)
+  {-# INLINE second' #-}
+
 instance (Functor f, Strong p) => Strong (Tannen f p) where
   first' (Tannen fp) = Tannen (fmap first' fp)
   {-# INLINE first' #-}
@@ -378,6 +387,12 @@
   unfirst (Pair p q) = Pair (unfirst p) (unfirst q)
   unsecond (Pair p q) = Pair (unsecond p) (unsecond q)
 
+instance (Costrong p, Costrong q) => Costrong (Sum p q) where
+  unfirst (L2 p) = L2 (unfirst p)
+  unfirst (R2 q) = R2 (unfirst q)
+  unsecond (L2 p) = L2 (unsecond p)
+  unsecond (R2 q) = R2 (unsecond q)
+
 ----------------------------------------------------------------------------
 -- * Cotambara
 ----------------------------------------------------------------------------


Reply via email to