Hello community,
here is the log from the commit of package ghc-profunctors for
openSUSE:Leap:15.2 checked in at 2020-03-13 10:57:10
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Comparing /work/SRC/openSUSE:Leap:15.2/ghc-profunctors (Old)
and /work/SRC/openSUSE:Leap:15.2/.ghc-profunctors.new.3160 (New)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "ghc-profunctors"
Fri Mar 13 10:57:10 2020 rev:14 rq:783257 version:5.5.2
Changes:
--------
--- /work/SRC/openSUSE:Leap:15.2/ghc-profunctors/ghc-profunctors.changes
2020-02-19 18:40:39.146149162 +0100
+++
/work/SRC/openSUSE:Leap:15.2/.ghc-profunctors.new.3160/ghc-profunctors.changes
2020-03-13 10:57:10.448426079 +0100
@@ -1,0 +2,10 @@
+Thu Feb 27 14:17:45 UTC 2020 - [email protected]
+
+- Update profunctors to version 5.5.2.
+ 5.5.2 [2020.02.13]
+ ------------------
+ * Add `Cochoice`, `Costrong`, `Closed`, `Traversing`, and `Mapping` instances
+ for `Cayley`.
+ * Add `Mapping` and `Traversing` instances for `Tannen`.
+
+-------------------------------------------------------------------
Old:
----
profunctors-5.5.1.tar.gz
New:
----
profunctors-5.5.2.tar.gz
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Other differences:
------------------
++++++ ghc-profunctors.spec ++++++
--- /var/tmp/diff_new_pack.OyTF2n/_old 2020-03-13 10:57:10.780426315 +0100
+++ /var/tmp/diff_new_pack.OyTF2n/_new 2020-03-13 10:57:10.784426318 +0100
@@ -1,7 +1,7 @@
#
# spec file for package ghc-profunctors
#
-# Copyright (c) 2019 SUSE LINUX GmbH, Nuernberg, Germany.
+# Copyright (c) 2020 SUSE LINUX GmbH, Nuernberg, Germany.
#
# All modifications and additions to the file contributed by third parties
# remain the property of their copyright owners, unless otherwise agreed
@@ -18,7 +18,7 @@
%global pkg_name profunctors
Name: ghc-%{pkg_name}
-Version: 5.5.1
+Version: 5.5.2
Release: 0
Summary: Profunctors
License: BSD-3-Clause
++++++ profunctors-5.5.1.tar.gz -> profunctors-5.5.2.tar.gz ++++++
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/profunctors-5.5.1/CHANGELOG.markdown
new/profunctors-5.5.2/CHANGELOG.markdown
--- old/profunctors-5.5.1/CHANGELOG.markdown 2001-09-09 03:46:40.000000000
+0200
+++ new/profunctors-5.5.2/CHANGELOG.markdown 2001-09-09 03:46:40.000000000
+0200
@@ -1,3 +1,9 @@
+5.5.2 [2020.02.13]
+------------------
+* Add `Cochoice`, `Costrong`, `Closed`, `Traversing`, and `Mapping` instances
+ for `Cayley`.
+* Add `Mapping` and `Traversing` instances for `Tannen`.
+
5.5.1 [2019.11.26]
------------------
* Add `Choice`, `Cochoice`, `Closed`, `Strong`, and `Costrong` instances for
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/profunctors-5.5.1/profunctors.cabal
new/profunctors-5.5.2/profunctors.cabal
--- old/profunctors-5.5.1/profunctors.cabal 2001-09-09 03:46:40.000000000
+0200
+++ new/profunctors-5.5.2/profunctors.cabal 2001-09-09 03:46:40.000000000
+0200
@@ -1,6 +1,6 @@
name: profunctors
category: Control, Categories
-version: 5.5.1
+version: 5.5.2
license: BSD3
cabal-version: >= 1.10
license-file: LICENSE
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/profunctors-5.5.1/src/Data/Profunctor/Cayley.hs
new/profunctors-5.5.2/src/Data/Profunctor/Cayley.hs
--- old/profunctors-5.5.1/src/Data/Profunctor/Cayley.hs 2001-09-09
03:46:40.000000000 +0200
+++ new/profunctors-5.5.2/src/Data/Profunctor/Cayley.hs 2001-09-09
03:46:40.000000000 +0200
@@ -19,6 +19,7 @@
import Control.Comonad
import Data.Profunctor
import Data.Profunctor.Monad
+import Data.Profunctor.Traversing
import Data.Profunctor.Unsafe
import Prelude hiding ((.), id)
@@ -49,10 +50,29 @@
first' = Cayley . fmap first' . runCayley
second' = Cayley . fmap second' . runCayley
+instance (Functor f, Costrong p) => Costrong (Cayley f p) where
+ unfirst (Cayley fp) = Cayley (fmap unfirst fp)
+ unsecond (Cayley fp) = Cayley (fmap unsecond fp)
+
instance (Functor f, Choice p) => Choice (Cayley f p) where
left' = Cayley . fmap left' . runCayley
right' = Cayley . fmap right' . runCayley
+instance (Functor f, Cochoice p) => Cochoice (Cayley f p) where
+ unleft (Cayley fp) = Cayley (fmap unleft fp)
+ {-# INLINE unleft #-}
+ unright (Cayley fp) = Cayley (fmap unright fp)
+ {-# INLINE unright #-}
+
+instance (Functor f, Closed p) => Closed (Cayley f p) where
+ closed = Cayley . fmap closed . runCayley
+
+instance (Functor f, Traversing p) => Traversing (Cayley f p) where
+ traverse' = Cayley . fmap traverse' . runCayley
+
+instance (Functor f, Mapping p) => Mapping (Cayley f p) where
+ map' = Cayley . fmap map' . runCayley
+
instance (Applicative f, Category p) => Category (Cayley f p) where
id = Cayley $ pure id
Cayley fpbc . Cayley fpab = Cayley $ liftA2 (.) fpbc fpab
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/profunctors-5.5.1/src/Data/Profunctor/Mapping.hs
new/profunctors-5.5.2/src/Data/Profunctor/Mapping.hs
--- old/profunctors-5.5.1/src/Data/Profunctor/Mapping.hs 2001-09-09
03:46:40.000000000 +0200
+++ new/profunctors-5.5.2/src/Data/Profunctor/Mapping.hs 2001-09-09
03:46:40.000000000 +0200
@@ -24,6 +24,7 @@
) where
import Control.Arrow (Kleisli(..))
+import Data.Bifunctor.Tannen
import Data.Distributive
import Data.Functor.Compose
import Data.Functor.Identity
@@ -90,6 +91,9 @@
map' (Star f) = Star (collect f)
roam f = Star #. genMap f .# runStar
+instance (Functor f, Mapping p) => Mapping (Tannen f p) where
+ map' = Tannen . fmap map' . runTannen
+
wanderMapping :: Mapping p => (forall f. Applicative f => (a -> f b) -> s -> f
t) -> p a b -> p s t
wanderMapping f = roam ((runIdentity .) #. f .# (Identity .))
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/profunctors-5.5.1/src/Data/Profunctor/Traversing.hs
new/profunctors-5.5.2/src/Data/Profunctor/Traversing.hs
--- old/profunctors-5.5.1/src/Data/Profunctor/Traversing.hs 2001-09-09
03:46:40.000000000 +0200
+++ new/profunctors-5.5.2/src/Data/Profunctor/Traversing.hs 2001-09-09
03:46:40.000000000 +0200
@@ -20,6 +20,7 @@
import Control.Applicative
import Control.Arrow (Kleisli(..))
+import Data.Bifunctor.Tannen
import Data.Functor.Compose
import Data.Functor.Identity
import Data.Orphans ()
@@ -136,6 +137,9 @@
traverse' (Star m) = Star (traverse m)
wander f (Star amb) = Star (f amb)
+instance (Functor f, Traversing p) => Traversing (Tannen f p) where
+ traverse' = Tannen . fmap traverse' . runTannen
+
newtype CofreeTraversing p a b = CofreeTraversing { runCofreeTraversing ::
forall f. Traversable f => p (f a) (f b) }
instance Profunctor p => Profunctor (CofreeTraversing p) where
