Hello community, here is the log from the commit of package ghc-utility-ht for openSUSE:Factory checked in at 2017-06-22 10:39:29 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/ghc-utility-ht (Old) and /work/SRC/openSUSE:Factory/.ghc-utility-ht.new (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "ghc-utility-ht" Thu Jun 22 10:39:29 2017 rev:4 rq:504117 version:0.0.14 Changes: -------- --- /work/SRC/openSUSE:Factory/ghc-utility-ht/ghc-utility-ht.changes 2017-04-14 13:39:07.699458083 +0200 +++ /work/SRC/openSUSE:Factory/.ghc-utility-ht.new/ghc-utility-ht.changes 2017-06-22 10:39:33.540677641 +0200 @@ -1,0 +2,5 @@ +Thu Jun 8 11:08:13 UTC 2017 - psim...@suse.com + +- Update to version 0.0.14. + +------------------------------------------------------------------- Old: ---- utility-ht-0.0.13.tar.gz New: ---- utility-ht-0.0.14.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ ghc-utility-ht.spec ++++++ --- /var/tmp/diff_new_pack.JRWkF2/_old 2017-06-22 10:39:34.692515248 +0200 +++ /var/tmp/diff_new_pack.JRWkF2/_new 2017-06-22 10:39:34.696514684 +0200 @@ -19,7 +19,7 @@ %global pkg_name utility-ht %bcond_with tests Name: ghc-%{pkg_name} -Version: 0.0.13 +Version: 0.0.14 Release: 0 Summary: Various small helper functions for Lists, Maybes, Tuples, Functions License: BSD-3-Clause ++++++ utility-ht-0.0.13.tar.gz -> utility-ht-0.0.14.tar.gz ++++++ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/utility-ht-0.0.13/src/Control/Applicative/HT.hs new/utility-ht-0.0.14/src/Control/Applicative/HT.hs --- old/utility-ht-0.0.13/src/Control/Applicative/HT.hs 2017-03-25 09:21:36.000000000 +0100 +++ new/utility-ht-0.0.14/src/Control/Applicative/HT.hs 2017-06-03 10:13:46.000000000 +0200 @@ -12,18 +12,56 @@ mapTriple fgh = Tuple.uncurry3 (liftA3 (,,)) . Tuple.mapTriple fgh +{-# INLINE lift #-} +lift :: Applicative m => (a -> r) -> m a -> m r +lift = fmap + +{-# INLINE lift2 #-} +lift2 :: + Applicative m => (a -> b -> r) -> m a -> m b -> m r +lift2 = liftA2 + +{-# INLINE lift3 #-} +lift3 :: + Applicative m => (a -> b -> c -> r) -> m a -> m b -> m c -> m r +lift3 = liftA3 + +{-# INLINE lift4 #-} +lift4 :: + Applicative m => + (a -> b -> c -> d -> r) -> m a -> m b -> m c -> m d -> m r +lift4 fn a b c d = fn <$> a <*> b <*> c <*> d + +{-# INLINE lift5 #-} +lift5 :: + Applicative m => + (a -> b -> c -> d -> e -> r) -> + m a -> m b -> m c -> m d -> m e -> m r +lift5 fn a b c d e = fn <$> a <*> b <*> c <*> d <*> e + +{-# INLINE lift6 #-} +lift6 :: + Applicative m => + (a -> b -> c -> d -> e -> f -> r) -> + m a -> m b -> m c -> m d -> m e -> m f -> m r +lift6 fn a b c d e f = fn <$> a <*> b <*> c <*> d <*> e <*> f + + +{-# DEPRECATED liftA4 "use App.lift4" #-} {-# INLINE liftA4 #-} liftA4 :: Applicative f => (a -> b -> c -> d -> e) -> f a -> f b -> f c -> f d -> f e liftA4 f a b c d = f <$> a <*> b <*> c <*> d +{-# DEPRECATED liftA5 "use App.lift5" #-} {-# INLINE liftA5 #-} liftA5 :: Applicative f => (a -> b -> c -> d -> e -> g) -> f a -> f b -> f c -> f d -> f e -> f g liftA5 f a b c d e = f <$> a <*> b <*> c <*> d <*> e +{-# DEPRECATED liftA6 "use App.lift6" #-} {-# INLINE liftA6 #-} liftA6 :: Applicative f => (a -> b -> c -> d -> e -> g -> h) -> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/utility-ht-0.0.13/src/Data/List/HT/Private.hs new/utility-ht-0.0.14/src/Data/List/HT/Private.hs --- old/utility-ht-0.0.13/src/Data/List/HT/Private.hs 2017-03-25 09:21:36.000000000 +0100 +++ new/utility-ht-0.0.14/src/Data/List/HT/Private.hs 2017-06-03 10:13:46.000000000 +0200 @@ -566,6 +566,17 @@ Example: Keep the heads of sublists until an empty list occurs. > takeWhileJust $ map (fmap fst . viewL) xs + + +For consistency with 'takeWhile', +'partitionMaybe' and 'dropWhileNothing' it should have been: + +> takeWhileJust_ :: (a -> Maybe b) -> a -> [b] + +However, both variants are interchangeable: + +> takeWhileJust_ f == takeWhileJust . map f +> takeWhileJust == takeWhileJust_ id -} takeWhileJust :: [Maybe a] -> [a] takeWhileJust = diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/utility-ht-0.0.13/src/Data/List/HT.hs new/utility-ht-0.0.14/src/Data/List/HT.hs --- old/utility-ht-0.0.13/src/Data/List/HT.hs 2017-03-25 09:21:36.000000000 +0100 +++ new/utility-ht-0.0.14/src/Data/List/HT.hs 2017-06-03 10:13:46.000000000 +0200 @@ -35,6 +35,7 @@ L.maybeSuffixOf, L.partitionMaybe, L.takeWhileJust, + L.dropWhileNothing, L.unzipEithers, -- * Sieve and slice L.sieve, diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/utility-ht-0.0.13/src/Data/Tuple/HT.hs new/utility-ht-0.0.14/src/Data/Tuple/HT.hs --- old/utility-ht-0.0.13/src/Data/Tuple/HT.hs 2017-03-25 09:21:36.000000000 +0100 +++ new/utility-ht-0.0.14/src/Data/Tuple/HT.hs 2017-06-03 10:13:46.000000000 +0200 @@ -48,6 +48,12 @@ curry3 :: ((a, b, c) -> d) -> a -> b -> c -> d curry3 f a b c = f (a,b,c) +{- | +This is convenient for quick hacks +but I suggest that you better define a type for an ordered pair +for your application at hand. +This way, you can clearly see from the type that a pair is ordered. +-} sortPair, _sortPairMinMax :: (Ord a) => (a,a) -> (a,a) sortPair (x,y) = if x<=y then (x,y) else (y,x) _sortPairMinMax (x,y) = (min x y, max x y) diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/utility-ht-0.0.13/utility-ht.cabal new/utility-ht-0.0.14/utility-ht.cabal --- old/utility-ht-0.0.13/utility-ht.cabal 2017-03-25 09:21:36.000000000 +0100 +++ new/utility-ht-0.0.14/utility-ht.cabal 2017-06-03 10:13:46.000000000 +0200 @@ -1,10 +1,9 @@ Name: utility-ht -Version: 0.0.13 +Version: 0.0.14 License: BSD3 License-File: LICENSE Author: Henning Thielemann <hask...@henning-thielemann.de> Maintainer: Henning Thielemann <hask...@henning-thielemann.de> --- Homepage: http://www.haskell.org/haskellwiki/Utility-HT Category: Data, List Synopsis: Various small helper functions for Lists, Maybes, Tuples, Functions Description: @@ -45,7 +44,7 @@ Source-Repository this type: darcs location: http://code.haskell.org/~thielema/utility/ - tag: 0.0.13 + tag: 0.0.14 Library Build-Depends: