Hello community, here is the log from the commit of package ghc-mono-traversable for openSUSE:Factory checked in at 2017-03-20 17:07:35 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/ghc-mono-traversable (Old) and /work/SRC/openSUSE:Factory/.ghc-mono-traversable.new (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "ghc-mono-traversable" Mon Mar 20 17:07:35 2017 rev:10 rq:477459 version:1.0.1.3 Changes: -------- --- /work/SRC/openSUSE:Factory/ghc-mono-traversable/ghc-mono-traversable.changes 2017-02-08 12:07:05.397120320 +0100 +++ /work/SRC/openSUSE:Factory/.ghc-mono-traversable.new/ghc-mono-traversable.changes 2017-03-20 17:07:36.398442731 +0100 @@ -1,0 +2,10 @@ +Mon Feb 27 10:12:21 UTC 2017 - psim...@suse.com + +- Update to version 1.0.1.3 with cabal2obs. + +------------------------------------------------------------------- +Mon Feb 20 08:43:05 UTC 2017 - psim...@suse.com + +- Update to version 1.0.1.2 with cabal2obs. + +------------------------------------------------------------------- Old: ---- mono-traversable-1.0.1.1.tar.gz New: ---- mono-traversable-1.0.1.3.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ ghc-mono-traversable.spec ++++++ --- /var/tmp/diff_new_pack.SvMe0Q/_old 2017-03-20 17:07:37.214327528 +0100 +++ /var/tmp/diff_new_pack.SvMe0Q/_new 2017-03-20 17:07:37.214327528 +0100 @@ -19,7 +19,7 @@ %global pkg_name mono-traversable %bcond_with tests Name: ghc-%{pkg_name} -Version: 1.0.1.1 +Version: 1.0.1.3 Release: 0 Summary: Type classes for mapping, folding, and traversing monomorphic containers License: MIT ++++++ mono-traversable-1.0.1.1.tar.gz -> mono-traversable-1.0.1.3.tar.gz ++++++ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/mono-traversable-1.0.1.1/ChangeLog.md new/mono-traversable-1.0.1.3/ChangeLog.md --- old/mono-traversable-1.0.1.1/ChangeLog.md 2017-01-20 08:53:47.000000000 +0100 +++ new/mono-traversable-1.0.1.3/ChangeLog.md 2017-02-21 09:04:38.000000000 +0100 @@ -1,3 +1,11 @@ +## 1.0.1.3 + +* Make 'olength' for Set and Map O(1) [#125](https://github.com/snoyberg/mono-traversable/pull/125) + +## 1.0.1.2 + +* Support for GHC 8.2 + ## 1.0.1.1 * Fix typo in rewrite rule diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/mono-traversable-1.0.1.1/mono-traversable.cabal new/mono-traversable-1.0.1.3/mono-traversable.cabal --- old/mono-traversable-1.0.1.1/mono-traversable.cabal 2017-01-20 08:53:47.000000000 +0100 +++ new/mono-traversable-1.0.1.3/mono-traversable.cabal 2017-02-21 09:04:45.000000000 +0100 @@ -1,5 +1,5 @@ name: mono-traversable -version: 1.0.1.1 +version: 1.0.1.3 synopsis: Type classes for mapping, folding, and traversing monomorphic containers description: Monomorphic variants of the Functor, Foldable, and Traversable typeclasses. If you understand Haskell's basic typeclasses, you understand mono-traversable. In addition to what you are used to, it adds on an IsSequence typeclass and has code for marking data structures as non-empty. homepage: https://github.com/snoyberg/mono-traversable diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/mono-traversable-1.0.1.1/src/Data/MonoTraversable.hs new/mono-traversable-1.0.1.3/src/Data/MonoTraversable.hs --- old/mono-traversable-1.0.1.1/src/Data/MonoTraversable.hs 2017-01-20 08:53:47.000000000 +0100 +++ new/mono-traversable-1.0.1.3/src/Data/MonoTraversable.hs 2017-02-21 09:04:24.000000000 +0100 @@ -62,6 +62,7 @@ import Data.List.NonEmpty (NonEmpty) import Data.Functor.Identity (Identity) import Data.Map (Map) +import qualified Data.Map.Strict as Map import Data.HashMap.Strict (HashMap) import Data.Vector (Vector) import Control.Monad.Trans.Maybe (MaybeT (..)) @@ -141,7 +142,8 @@ class MonoFunctor mono where -- | Map over a monomorphic container omap :: (Element mono -> Element mono) -> mono -> mono - default omap :: (Functor f, Element (f a) ~ a, f a ~ mono) => (a -> a) -> f a -> f a + default omap :: (Functor f, Element (f a) ~ a, f a ~ mono) + => (Element mono -> Element mono) -> mono -> mono omap = fmap {-# INLINE omap #-} @@ -332,7 +334,7 @@ -- /See 'Data.NonNull.ofoldr1Ex' from "Data.NonNull" for a total version of this function./ ofoldr1Ex :: (Element mono -> Element mono -> Element mono) -> mono -> Element mono default ofoldr1Ex :: (t a ~ mono, a ~ Element (t a), F.Foldable t) - => (a -> a -> a) -> mono -> a + => (Element mono -> Element mono -> Element mono) -> mono -> Element mono ofoldr1Ex = F.foldr1 {-# INLINE ofoldr1Ex #-} @@ -345,7 +347,7 @@ -- /See 'Data.NonNull.ofoldl1Ex'' from "Data.NonNull" for a total version of this function./ ofoldl1Ex' :: (Element mono -> Element mono -> Element mono) -> mono -> Element mono default ofoldl1Ex' :: (t a ~ mono, a ~ Element (t a), F.Foldable t) - => (a -> a -> a) -> mono -> a + => (Element mono -> Element mono -> Element mono) -> mono -> Element mono ofoldl1Ex' = F.foldl1 {-# INLINE ofoldl1Ex' #-} @@ -597,7 +599,9 @@ instance MonoFoldable (Option a) instance MonoFoldable (NonEmpty a) instance MonoFoldable (Identity a) -instance MonoFoldable (Map k v) +instance MonoFoldable (Map k v) where + olength = Map.size + {-# INLINE olength #-} instance MonoFoldable (HashMap k v) instance MonoFoldable (Vector a) where ofoldr = V.foldr @@ -629,7 +633,9 @@ {-# INLINE unsafeHead #-} {-# INLINE maximumByEx #-} {-# INLINE minimumByEx #-} -instance MonoFoldable (Set e) +instance MonoFoldable (Set e) where + olength = Set.size + {-# INLINE olength #-} instance MonoFoldable (HashSet e) instance U.Unbox a => MonoFoldable (U.Vector a) where