Hello community,
here is the log from the commit of package ghc-bifunctors for
openSUSE:Leap:15.2 checked in at 2020-03-13 10:56:44
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Comparing /work/SRC/openSUSE:Leap:15.2/ghc-bifunctors (Old)
and /work/SRC/openSUSE:Leap:15.2/.ghc-bifunctors.new.3160 (New)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "ghc-bifunctors"
Fri Mar 13 10:56:44 2020 rev:12 rq:782957 version:5.5.7
Changes:
--------
--- /work/SRC/openSUSE:Leap:15.2/ghc-bifunctors/ghc-bifunctors.changes
2020-02-19 18:37:55.977883046 +0100
+++
/work/SRC/openSUSE:Leap:15.2/.ghc-bifunctors.new.3160/ghc-bifunctors.changes
2020-03-13 10:56:45.676408416 +0100
@@ -1,0 +2,8 @@
+Fri Feb 7 08:04:05 UTC 2020 - [email protected]
+
+- Update bifunctors to version 5.5.7.
+ 5.5.7 [2020.01.29]
+ ------------------
+ * Add `Data.Bifunctor.Biap`.
+
+-------------------------------------------------------------------
Old:
----
bifunctors-5.5.6.tar.gz
New:
----
bifunctors-5.5.7.tar.gz
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Other differences:
------------------
++++++ ghc-bifunctors.spec ++++++
--- /var/tmp/diff_new_pack.Mzr8DC/_old 2020-03-13 10:56:46.416408944 +0100
+++ /var/tmp/diff_new_pack.Mzr8DC/_new 2020-03-13 10:56:46.420408947 +0100
@@ -1,7 +1,7 @@
#
# spec file for package ghc-bifunctors
#
-# 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
@@ -19,7 +19,7 @@
%global pkg_name bifunctors
%bcond_with tests
Name: ghc-%{pkg_name}
-Version: 5.5.6
+Version: 5.5.7
Release: 0
Summary: Collection Haskell 98 bifunctors, bifoldables and
bitraversables
License: BSD-2-Clause
++++++ bifunctors-5.5.6.tar.gz -> bifunctors-5.5.7.tar.gz ++++++
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/bifunctors-5.5.6/CHANGELOG.markdown
new/bifunctors-5.5.7/CHANGELOG.markdown
--- old/bifunctors-5.5.6/CHANGELOG.markdown 2001-09-09 03:46:40.000000000
+0200
+++ new/bifunctors-5.5.7/CHANGELOG.markdown 2001-09-09 03:46:40.000000000
+0200
@@ -1,3 +1,7 @@
+5.5.7 [2020.01.29]
+------------------
+* Add `Data.Bifunctor.Biap`.
+
5.5.6 [2019.11.26]
------------------
* Add `Category`, `Arrow`, `ArrowChoice`, `ArrowLoop`, `ArrowZero`, and
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/bifunctors-5.5.6/bifunctors.cabal
new/bifunctors-5.5.7/bifunctors.cabal
--- old/bifunctors-5.5.6/bifunctors.cabal 2001-09-09 03:46:40.000000000
+0200
+++ new/bifunctors-5.5.7/bifunctors.cabal 2001-09-09 03:46:40.000000000
+0200
@@ -1,6 +1,6 @@
name: bifunctors
category: Data, Functors
-version: 5.5.6
+version: 5.5.7
license: BSD3
cabal-version: >= 1.8
license-file: LICENSE
@@ -67,6 +67,9 @@
if !impl(ghc > 8.2)
build-depends: transformers-compat >= 0.5 && < 0.7
+ if !impl(ghc >= 8.0)
+ build-depends: fail == 4.9.*
+
if flag(tagged)
build-depends: tagged >= 0.7.3 && < 1
@@ -88,6 +91,7 @@
exposed-modules:
Data.Biapplicative
+ Data.Bifunctor.Biap
Data.Bifunctor.Biff
Data.Bifunctor.Clown
Data.Bifunctor.Fix
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/bifunctors-5.5.6/src/Data/Biapplicative.hs
new/bifunctors-5.5.7/src/Data/Biapplicative.hs
--- old/bifunctors-5.5.6/src/Data/Biapplicative.hs 2001-09-09
03:46:40.000000000 +0200
+++ new/bifunctors-5.5.7/src/Data/Biapplicative.hs 2001-09-09
03:46:40.000000000 +0200
@@ -56,7 +56,9 @@
{-# INLINE (<<$>>) #-}
class Bifunctor p => Biapplicative p where
+#if __GLASGOW_HASKELL__ >= 708
{-# MINIMAL bipure, ((<<*>>) | biliftA2 ) #-}
+#endif
bipure :: a -> b -> p a b
(<<*>>) :: p (a -> b) (c -> d) -> p a c -> p b d
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/bifunctors-5.5.6/src/Data/Bifunctor/Biap.hs
new/bifunctors-5.5.7/src/Data/Bifunctor/Biap.hs
--- old/bifunctors-5.5.6/src/Data/Bifunctor/Biap.hs 1970-01-01
01:00:00.000000000 +0100
+++ new/bifunctors-5.5.7/src/Data/Bifunctor/Biap.hs 2001-09-09
03:46:40.000000000 +0200
@@ -0,0 +1,170 @@
+{-# LANGUAGE CPP #-}
+{-# LANGUAGE EmptyDataDecls #-}
+{-# LANGUAGE FlexibleContexts #-}
+{-# LANGUAGE DeriveTraversable #-}
+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
+{-# LANGUAGE ScopedTypeVariables #-}
+{-# LANGUAGE TypeFamilies #-}
+
+#if __GLASGOW_HASKELL__ >= 702
+{-# LANGUAGE DeriveGeneric #-}
+#endif
+
+#include "bifunctors-common.h"
+#ifndef MIN_VERSION_semigroups
+#define MIN_VERSION_semigroups(x,y,z) 0
+#endif
+
+-----------------------------------------------------------------------------
+-- |
+-- Copyright : (C) 2008-2016 Edward Kmett
+-- License : BSD-style (see the file LICENSE)
+--
+-- Maintainer : Edward Kmett <[email protected]>
+-- Stability : provisional
+-- Portability : portable
+--
+----------------------------------------------------------------------------
+module Data.Bifunctor.Biap
+ ( Biap(..)
+ ) where
+
+import Control.Applicative
+import Control.Monad
+import qualified Control.Monad.Fail as Fail (MonadFail)
+import Data.Biapplicative
+import Data.Bifoldable
+import Data.Bitraversable
+import Data.Functor.Classes
+
+#if __GLASGOW_HASKELL__ >= 702
+import GHC.Generics
+#endif
+
+#if !(MIN_VERSION_base(4,8,0))
+import Data.Foldable
+import Data.Monoid
+import Data.Traversable
+#endif
+
+#if MIN_VERSION_base(4,9,0) || MIN_VERSION_semigroups(0,16,2)
+import qualified Data.Semigroup as S
+#endif
+
+-- | Pointwise lifting of a class over two arguments, using
+-- 'Biapplicative'.
+--
+-- Classes that can be lifted include 'Monoid', 'Num' and
+-- 'Bounded'. Each method of those classes can be defined as lifting
+-- themselves over each argument of 'Biapplicative'.
+--
+-- @
+-- mempty = bipure mempty mempty
+-- minBound = bipure minBound minBound
+-- maxBound = bipure maxBound maxBound
+-- fromInteger n = bipure (fromInteger n) (fromInteger n)
+--
+-- negate = bimap negate negate
+--
+-- (+) = biliftA2 (+) (+)
+-- (<>) = biliftA2 (<>) (<>)
+-- @
+--
+-- 'Biap' is to 'Biapplicative' as 'Data.Monoid.Ap' is to
+-- 'Applicative'.
+--
+-- 'Biap' can be used with @DerivingVia@ to derive a numeric instance
+-- for pairs:
+--
+-- @
+-- newtype Numpair a = Np (a, a)
+-- deriving (S.Semigroup, Monoid, Num, Bounded)
+-- via Biap (,) a a
+-- @
+--
+newtype Biap bi a b = Biap { getBiap :: bi a b }
+ deriving ( Eq
+ , Ord
+ , Show
+ , Read
+ , Enum
+ , Functor
+ , Foldable
+ , Traversable
+ , Alternative
+ , Applicative
+#if __GLASGOW_HASKELL__ >= 702
+ , Generic
+#endif
+#if __GLASGOW_HASKELL__ >= 706
+ , Generic1
+#endif
+ , Monad
+ , Fail.MonadFail
+ , MonadPlus
+ , Eq1
+ , Ord1
+
+ , Bifunctor
+ , Biapplicative
+ , Bifoldable
+#if LIFTED_FUNCTOR_CLASSES
+ , Eq2
+ , Ord2
+#endif
+ )
+
+instance Bitraversable bi => Bitraversable (Biap bi) where
+ bitraverse f g (Biap as) = Biap <$> bitraverse f g as
+
+instance (Biapplicative bi, S.Semigroup a, S.Semigroup b) => S.Semigroup (Biap
bi a b) where
+ (<>) = biliftA2 (S.<>) (S.<>)
+
+instance (Biapplicative bi, Monoid a, Monoid b) => Monoid (Biap bi a b) where
+ mempty = bipure mempty mempty
+#if !(MIN_VERSION_base(4,11,0))
+ mappend = biliftA2 mappend mappend
+#endif
+
+instance (Biapplicative bi, Bounded a, Bounded b) => Bounded (Biap bi a b)
where
+ minBound = bipure minBound minBound
+ maxBound = bipure maxBound maxBound
+
+instance ( Biapplicative bi, Num a, Num b
+#if !(MIN_VERSION_base(4,5,0))
+ -- Old versions of Num have Eq and Show as superclasses. Sigh.
+ , Eq (bi a b), Show (bi a b)
+#endif
+ ) => Num (Biap bi a b) where
+ (+) = biliftA2 (+) (+)
+ (*) = biliftA2 (*) (*)
+
+ negate = bimap negate negate
+ abs = bimap abs abs
+ signum = bimap signum signum
+
+ fromInteger n = bipure (fromInteger n) (fromInteger n)
+
+#if __GLASGOW_HASKELL__ >= 702 && __GLASGOW_HASKELL__ < 706
+data BiapMetaData
+data BiapMetaCons
+data BiapMetaSel
+
+instance Datatype BiapMetaData where
+ datatypeName = const "Biap"
+ moduleName = const "Data.Bifunctor.Wrapped"
+
+instance Constructor BiapMetaCons where
+ conName = const "Biap"
+ conIsRecord = const True
+
+instance Selector BiapMetaSel where
+ selName = const "getBiap"
+
+instance Generic1 (Biap p a) where
+ type Rep1 (Biap p a) = D1 BiapMetaData
+ (C1 BiapMetaCons
+ (S1 BiapMetaSel (Rec1 (p a))))
+ from1 = M1 . M1 . M1 . Rec1 . getBiap
+ to1 = Biap . unRec1 . unM1 . unM1 . unM1
+#endif
