distribution-opensuse 1.1.1 → 1.1.2
raw patch · 3 files changed
+16/−15 lines, 3 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- OpenSuse.Prelude: type CharParser st input (m :: * -> *) a = Stream st m Char -> ParsecT st input m a
+ OpenSuse.Prelude: class Monad m => MonadFail (m :: Type -> Type)
+ OpenSuse.Prelude: fromMaybeM :: Monad m => m a -> m (Maybe a) -> m a
+ OpenSuse.Prelude: infixl 1 >>
+ OpenSuse.Prelude: infixl 6 +
+ OpenSuse.Prelude: infixl 7 *
+ OpenSuse.Prelude: infixr 6 <>
+ OpenSuse.Prelude: pureIf :: Alternative m => Bool -> a -> m a
+ OpenSuse.Prelude: type CharParser st input (m :: Type -> Type) a = Stream st m Char => ParsecT st input m a
+ OpenSuse.Prelude: untilJustM :: Monad m => m (Maybe a) -> m a
+ OpenSuse.Prelude: whileJustM :: (Monad m, Monoid a) => m (Maybe a) -> m a
- OpenSuse.GuessChangeLog: MoreThanOneChangeLogFile :: (Set FilePath) -> GuessedChangeLog
+ OpenSuse.GuessChangeLog: MoreThanOneChangeLogFile :: Set FilePath -> GuessedChangeLog
- OpenSuse.GuessChangeLog: NoCommonChangeLogFiles :: (Set FilePath) -> (Set FilePath) -> GuessedChangeLog
+ OpenSuse.GuessChangeLog: NoCommonChangeLogFiles :: Set FilePath -> Set FilePath -> GuessedChangeLog
- OpenSuse.Prelude: (!!) :: () => [a] -> Int -> a
+ OpenSuse.Prelude: (!!) :: [a] -> Int -> a
- OpenSuse.Prelude: ($!) :: () => a -> b -> a -> b
+ OpenSuse.Prelude: ($!) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
- OpenSuse.Prelude: ($) :: () => a -> b -> a -> b
+ OpenSuse.Prelude: ($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
- OpenSuse.Prelude: (++) :: () => [a] -> [a] -> [a]
+ OpenSuse.Prelude: (++) :: [a] -> [a] -> [a]
- OpenSuse.Prelude: (.) :: () => b -> c -> a -> b -> a -> c
+ OpenSuse.Prelude: (.) :: (b -> c) -> (a -> b) -> a -> c
- OpenSuse.Prelude: (<$!>) :: Monad m => a -> b -> m a -> m b
+ OpenSuse.Prelude: (<$!>) :: Monad m => (a -> b) -> m a -> m b
- OpenSuse.Prelude: (<$>) :: Functor f => a -> b -> f a -> f b
+ OpenSuse.Prelude: (<$>) :: Functor f => (a -> b) -> f a -> f b
- OpenSuse.Prelude: (<*>) :: Applicative f => f a -> b -> f a -> f b
+ OpenSuse.Prelude: (<*>) :: Applicative f => f (a -> b) -> f a -> f b
- OpenSuse.Prelude: (<=<) :: Monad m => b -> m c -> a -> m b -> a -> m c
+ OpenSuse.Prelude: (<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c
- OpenSuse.Prelude: (=<<) :: Monad m => a -> m b -> m a -> m b
+ OpenSuse.Prelude: (=<<) :: Monad m => (a -> m b) -> m a -> m b
- OpenSuse.Prelude: (>=>) :: Monad m => a -> m b -> b -> m c -> a -> m c
+ OpenSuse.Prelude: (>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c
- OpenSuse.Prelude: (>>=) :: Monad m => m a -> a -> m b -> m b
+ OpenSuse.Prelude: (>>=) :: Monad m => m a -> (a -> m b) -> m b
- OpenSuse.Prelude: all :: Foldable t => a -> Bool -> t a -> Bool
+ OpenSuse.Prelude: all :: Foldable t => (a -> Bool) -> t a -> Bool
- OpenSuse.Prelude: allM :: Monad m => a -> m Bool -> [a] -> m Bool
+ OpenSuse.Prelude: allM :: Monad m => (a -> m Bool) -> [a] -> m Bool
- OpenSuse.Prelude: any :: Foldable t => a -> Bool -> t a -> Bool
+ OpenSuse.Prelude: any :: Foldable t => (a -> Bool) -> t a -> Bool
- OpenSuse.Prelude: anyM :: Monad m => a -> m Bool -> [a] -> m Bool
+ OpenSuse.Prelude: anyM :: Monad m => (a -> m Bool) -> [a] -> m Bool
- OpenSuse.Prelude: ap :: Monad m => m a -> b -> m a -> m b
+ OpenSuse.Prelude: ap :: Monad m => m (a -> b) -> m a -> m b
- OpenSuse.Prelude: asTypeOf :: () => a -> a -> a
+ OpenSuse.Prelude: asTypeOf :: a -> a -> a
- OpenSuse.Prelude: break :: () => a -> Bool -> [a] -> ([a], [a])
+ OpenSuse.Prelude: break :: (a -> Bool) -> [a] -> ([a], [a])
- OpenSuse.Prelude: class Functor f => Applicative (f :: * -> *)
+ OpenSuse.Prelude: class Functor f => Applicative (f :: Type -> Type)
- OpenSuse.Prelude: class Foldable (t :: * -> *)
+ OpenSuse.Prelude: class Foldable (t :: Type -> Type)
- OpenSuse.Prelude: class Functor (f :: * -> *)
+ OpenSuse.Prelude: class Functor (f :: Type -> Type)
- OpenSuse.Prelude: class Hashable a
+ OpenSuse.Prelude: class Eq a => Hashable a
- OpenSuse.Prelude: class Applicative m => Monad (m :: * -> *)
+ OpenSuse.Prelude: class Applicative m => Monad (m :: Type -> Type)
- OpenSuse.Prelude: class Monad m => MonadIO (m :: * -> *)
+ OpenSuse.Prelude: class Monad m => MonadIO (m :: Type -> Type)
- OpenSuse.Prelude: class (Alternative m, Monad m) => MonadPlus (m :: * -> *)
+ OpenSuse.Prelude: class (Alternative m, Monad m) => MonadPlus (m :: Type -> Type)
- OpenSuse.Prelude: class (Functor t, Foldable t) => Traversable (t :: * -> *)
+ OpenSuse.Prelude: class (Functor t, Foldable t) => Traversable (t :: Type -> Type)
- OpenSuse.Prelude: concatForM :: Monad m => [a] -> a -> m [b] -> m [b]
+ OpenSuse.Prelude: concatForM :: Monad m => [a] -> (a -> m [b]) -> m [b]
- OpenSuse.Prelude: concatMap :: Foldable t => a -> [b] -> t a -> [b]
+ OpenSuse.Prelude: concatMap :: Foldable t => (a -> [b]) -> t a -> [b]
- OpenSuse.Prelude: concatMapM :: Monad m => a -> m [b] -> [a] -> m [b]
+ OpenSuse.Prelude: concatMapM :: Monad m => (a -> m [b]) -> [a] -> m [b]
- OpenSuse.Prelude: const :: () => a -> b -> a
+ OpenSuse.Prelude: const :: a -> b -> a
- OpenSuse.Prelude: curry :: () => (a, b) -> c -> a -> b -> c
+ OpenSuse.Prelude: curry :: ((a, b) -> c) -> a -> b -> c
- OpenSuse.Prelude: cycle :: () => [a] -> [a]
+ OpenSuse.Prelude: cycle :: [a] -> [a]
- OpenSuse.Prelude: drop :: () => Int -> [a] -> [a]
+ OpenSuse.Prelude: drop :: Int -> [a] -> [a]
- OpenSuse.Prelude: dropWhile :: () => a -> Bool -> [a] -> [a]
+ OpenSuse.Prelude: dropWhile :: (a -> Bool) -> [a] -> [a]
- OpenSuse.Prelude: either :: () => a -> c -> b -> c -> Either a b -> c
+ OpenSuse.Prelude: either :: (a -> c) -> (b -> c) -> Either a b -> c
- OpenSuse.Prelude: eitherM :: Monad m => a -> m c -> b -> m c -> m Either a b -> m c
+ OpenSuse.Prelude: eitherM :: Monad m => (a -> m c) -> (b -> m c) -> m (Either a b) -> m c
- OpenSuse.Prelude: error :: HasCallStack => [Char] -> a
+ OpenSuse.Prelude: error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => [Char] -> a
- OpenSuse.Prelude: errorWithoutStackTrace :: () => [Char] -> a
+ OpenSuse.Prelude: errorWithoutStackTrace :: forall (r :: RuntimeRep) (a :: TYPE r). [Char] -> a
- OpenSuse.Prelude: filter :: () => a -> Bool -> [a] -> [a]
+ OpenSuse.Prelude: filter :: (a -> Bool) -> [a] -> [a]
- OpenSuse.Prelude: filterM :: Applicative m => a -> m Bool -> [a] -> m [a]
+ OpenSuse.Prelude: filterM :: Applicative m => (a -> m Bool) -> [a] -> m [a]
- OpenSuse.Prelude: findM :: Monad m => a -> m Bool -> [a] -> m Maybe a
+ OpenSuse.Prelude: findM :: Monad m => (a -> m Bool) -> [a] -> m (Maybe a)
- OpenSuse.Prelude: firstJustM :: Monad m => a -> m Maybe b -> [a] -> m Maybe b
+ OpenSuse.Prelude: firstJustM :: Monad m => (a -> m (Maybe b)) -> [a] -> m (Maybe b)
- OpenSuse.Prelude: flip :: () => a -> b -> c -> b -> a -> c
+ OpenSuse.Prelude: flip :: (a -> b -> c) -> b -> a -> c
- OpenSuse.Prelude: fmap :: Functor f => a -> b -> f a -> f b
+ OpenSuse.Prelude: fmap :: Functor f => (a -> b) -> f a -> f b
- OpenSuse.Prelude: fold1M :: (Partial, Monad m) => a -> a -> m a -> [a] -> m a
+ OpenSuse.Prelude: fold1M :: (Partial, Monad m) => (a -> a -> m a) -> [a] -> m a
- OpenSuse.Prelude: fold1M_ :: (Partial, Monad m) => a -> a -> m a -> [a] -> m ()
+ OpenSuse.Prelude: fold1M_ :: (Partial, Monad m) => (a -> a -> m a) -> [a] -> m ()
- OpenSuse.Prelude: foldM :: (Foldable t, Monad m) => b -> a -> m b -> b -> t a -> m b
+ OpenSuse.Prelude: foldM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b
- OpenSuse.Prelude: foldM_ :: (Foldable t, Monad m) => b -> a -> m b -> b -> t a -> m ()
+ OpenSuse.Prelude: foldM_ :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m ()
- OpenSuse.Prelude: foldMap :: (Foldable t, Monoid m) => a -> m -> t a -> m
+ OpenSuse.Prelude: foldMap :: (Foldable t, Monoid m) => (a -> m) -> t a -> m
- OpenSuse.Prelude: foldl :: Foldable t => b -> a -> b -> b -> t a -> b
+ OpenSuse.Prelude: foldl :: Foldable t => (b -> a -> b) -> b -> t a -> b
- OpenSuse.Prelude: foldl1 :: Foldable t => a -> a -> a -> t a -> a
+ OpenSuse.Prelude: foldl1 :: Foldable t => (a -> a -> a) -> t a -> a
- OpenSuse.Prelude: foldr :: Foldable t => a -> b -> b -> b -> t a -> b
+ OpenSuse.Prelude: foldr :: Foldable t => (a -> b -> b) -> b -> t a -> b
- OpenSuse.Prelude: foldr1 :: Foldable t => a -> a -> a -> t a -> a
+ OpenSuse.Prelude: foldr1 :: Foldable t => (a -> a -> a) -> t a -> a
- OpenSuse.Prelude: forM :: (Traversable t, Monad m) => t a -> a -> m b -> m t b
+ OpenSuse.Prelude: forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b)
- OpenSuse.Prelude: forM_ :: (Foldable t, Monad m) => t a -> a -> m b -> m ()
+ OpenSuse.Prelude: forM_ :: (Foldable t, Monad m) => t a -> (a -> m b) -> m ()
- OpenSuse.Prelude: fromMaybe :: () => a -> Maybe a -> a
+ OpenSuse.Prelude: fromMaybe :: a -> Maybe a -> a
- OpenSuse.Prelude: fst :: () => (a, b) -> a
+ OpenSuse.Prelude: fst :: (a, b) -> a
- OpenSuse.Prelude: head :: () => [a] -> a
+ OpenSuse.Prelude: head :: [a] -> a
- OpenSuse.Prelude: id :: () => a -> a
+ OpenSuse.Prelude: id :: a -> a
- OpenSuse.Prelude: init :: () => [a] -> [a]
+ OpenSuse.Prelude: init :: [a] -> [a]
- OpenSuse.Prelude: interact :: String -> String -> IO ()
+ OpenSuse.Prelude: interact :: (String -> String) -> IO ()
- OpenSuse.Prelude: ioError :: () => IOError -> IO a
+ OpenSuse.Prelude: ioError :: IOError -> IO a
- OpenSuse.Prelude: iterate :: () => a -> a -> a -> [a]
+ OpenSuse.Prelude: iterate :: (a -> a) -> a -> [a]
- OpenSuse.Prelude: join :: Monad m => m m a -> m a
+ OpenSuse.Prelude: join :: Monad m => m (m a) -> m a
- OpenSuse.Prelude: last :: () => [a] -> a
+ OpenSuse.Prelude: last :: [a] -> a
- OpenSuse.Prelude: liftM :: Monad m => a1 -> r -> m a1 -> m r
+ OpenSuse.Prelude: liftM :: Monad m => (a1 -> r) -> m a1 -> m r
- OpenSuse.Prelude: liftM2 :: Monad m => a1 -> a2 -> r -> m a1 -> m a2 -> m r
+ OpenSuse.Prelude: liftM2 :: Monad m => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r
- OpenSuse.Prelude: liftM3 :: Monad m => a1 -> a2 -> a3 -> r -> m a1 -> m a2 -> m a3 -> m r
+ OpenSuse.Prelude: liftM3 :: Monad m => (a1 -> a2 -> a3 -> r) -> m a1 -> m a2 -> m a3 -> m r
- OpenSuse.Prelude: liftM4 :: Monad m => a1 -> a2 -> a3 -> a4 -> r -> m a1 -> m a2 -> m a3 -> m a4 -> m r
+ OpenSuse.Prelude: liftM4 :: Monad m => (a1 -> a2 -> a3 -> a4 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m r
- OpenSuse.Prelude: liftM5 :: Monad m => a1 -> a2 -> a3 -> a4 -> a5 -> r -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r
+ OpenSuse.Prelude: liftM5 :: Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r
- OpenSuse.Prelude: loop :: () => a -> Either a b -> a -> b
+ OpenSuse.Prelude: loop :: (a -> Either a b) -> a -> b
- OpenSuse.Prelude: loopM :: Monad m => a -> m Either a b -> a -> m b
+ OpenSuse.Prelude: loopM :: Monad m => (a -> m (Either a b)) -> a -> m b
- OpenSuse.Prelude: map :: () => a -> b -> [a] -> [b]
+ OpenSuse.Prelude: map :: (a -> b) -> [a] -> [b]
- OpenSuse.Prelude: mapAndUnzipM :: Applicative m => a -> m (b, c) -> [a] -> m ([b], [c])
+ OpenSuse.Prelude: mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])
- OpenSuse.Prelude: mapM :: (Traversable t, Monad m) => a -> m b -> t a -> m t b
+ OpenSuse.Prelude: mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)
- OpenSuse.Prelude: mapM_ :: (Foldable t, Monad m) => a -> m b -> t a -> m ()
+ OpenSuse.Prelude: mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()
- OpenSuse.Prelude: mapMaybeM :: Monad m => a -> m Maybe b -> [a] -> m [b]
+ OpenSuse.Prelude: mapMaybeM :: Monad m => (a -> m (Maybe b)) -> [a] -> m [b]
- OpenSuse.Prelude: maybe :: () => b -> a -> b -> Maybe a -> b
+ OpenSuse.Prelude: maybe :: b -> (a -> b) -> Maybe a -> b
- OpenSuse.Prelude: maybeM :: Monad m => m b -> a -> m b -> m Maybe a -> m b
+ OpenSuse.Prelude: maybeM :: Monad m => m b -> (a -> m b) -> m (Maybe a) -> m b
- OpenSuse.Prelude: mconcatMapM :: (Monad m, Monoid b) => a -> m b -> [a] -> m b
+ OpenSuse.Prelude: mconcatMapM :: (Monad m, Monoid b) => (a -> m b) -> [a] -> m b
- OpenSuse.Prelude: mfilter :: MonadPlus m => a -> Bool -> m a -> m a
+ OpenSuse.Prelude: mfilter :: MonadPlus m => (a -> Bool) -> m a -> m a
- OpenSuse.Prelude: msum :: (Foldable t, MonadPlus m) => t m a -> m a
+ OpenSuse.Prelude: msum :: (Foldable t, MonadPlus m) => t (m a) -> m a
- OpenSuse.Prelude: parser :: (HasParser a, Stream st m Char) => ParsecT st input m a
+ OpenSuse.Prelude: parser :: forall st input (m :: Type -> Type). HasParser a => CharParser st input m a
- OpenSuse.Prelude: partitionM :: Monad m => a -> m Bool -> [a] -> m ([a], [a])
+ OpenSuse.Prelude: partitionM :: Monad m => (a -> m Bool) -> [a] -> m ([a], [a])
- OpenSuse.Prelude: readParen :: () => Bool -> ReadS a -> ReadS a
+ OpenSuse.Prelude: readParen :: Bool -> ReadS a -> ReadS a
- OpenSuse.Prelude: repeat :: () => a -> [a]
+ OpenSuse.Prelude: repeat :: a -> [a]
- OpenSuse.Prelude: replicate :: () => Int -> a -> [a]
+ OpenSuse.Prelude: replicate :: Int -> a -> [a]
- OpenSuse.Prelude: reverse :: () => [a] -> [a]
+ OpenSuse.Prelude: reverse :: [a] -> [a]
- OpenSuse.Prelude: runParserT :: Stream s m t => ParsecT s u m a -> u -> SourceName -> s -> m Either ParseError a
+ OpenSuse.Prelude: runParserT :: Stream s m t => ParsecT s u m a -> u -> SourceName -> s -> m (Either ParseError a)
- OpenSuse.Prelude: scanl :: () => b -> a -> b -> b -> [a] -> [b]
+ OpenSuse.Prelude: scanl :: (b -> a -> b) -> b -> [a] -> [b]
- OpenSuse.Prelude: scanl1 :: () => a -> a -> a -> [a] -> [a]
+ OpenSuse.Prelude: scanl1 :: (a -> a -> a) -> [a] -> [a]
- OpenSuse.Prelude: scanr :: () => a -> b -> b -> b -> [a] -> [b]
+ OpenSuse.Prelude: scanr :: (a -> b -> b) -> b -> [a] -> [b]
- OpenSuse.Prelude: scanr1 :: () => a -> a -> a -> [a] -> [a]
+ OpenSuse.Prelude: scanr1 :: (a -> a -> a) -> [a] -> [a]
- OpenSuse.Prelude: seq :: () => a -> b -> b
+ OpenSuse.Prelude: seq :: forall (r :: RuntimeRep) a (b :: TYPE r). a -> b -> b
- OpenSuse.Prelude: sequence :: (Traversable t, Monad m) => t m a -> m t a
+ OpenSuse.Prelude: sequence :: (Traversable t, Monad m) => t (m a) -> m (t a)
- OpenSuse.Prelude: sequenceA :: (Traversable t, Applicative f) => t f a -> f t a
+ OpenSuse.Prelude: sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)
- OpenSuse.Prelude: sequence_ :: (Foldable t, Monad m) => t m a -> m ()
+ OpenSuse.Prelude: sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()
- OpenSuse.Prelude: snd :: () => (a, b) -> b
+ OpenSuse.Prelude: snd :: (a, b) -> b
- OpenSuse.Prelude: span :: () => a -> Bool -> [a] -> ([a], [a])
+ OpenSuse.Prelude: span :: (a -> Bool) -> [a] -> ([a], [a])
- OpenSuse.Prelude: splitAt :: () => Int -> [a] -> ([a], [a])
+ OpenSuse.Prelude: splitAt :: Int -> [a] -> ([a], [a])
- OpenSuse.Prelude: tail :: () => [a] -> [a]
+ OpenSuse.Prelude: tail :: [a] -> [a]
- OpenSuse.Prelude: take :: () => Int -> [a] -> [a]
+ OpenSuse.Prelude: take :: Int -> [a] -> [a]
- OpenSuse.Prelude: takeWhile :: () => a -> Bool -> [a] -> [a]
+ OpenSuse.Prelude: takeWhile :: (a -> Bool) -> [a] -> [a]
- OpenSuse.Prelude: traverse :: (Traversable t, Applicative f) => a -> f b -> t a -> f t b
+ OpenSuse.Prelude: traverse :: (Traversable t, Applicative f) => (a -> f b) -> t a -> f (t b)
- OpenSuse.Prelude: uncurry :: () => a -> b -> c -> (a, b) -> c
+ OpenSuse.Prelude: uncurry :: (a -> b -> c) -> (a, b) -> c
- OpenSuse.Prelude: undefined :: HasCallStack => a
+ OpenSuse.Prelude: undefined :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => a
- OpenSuse.Prelude: unit :: () => m () -> m ()
+ OpenSuse.Prelude: unit :: m () -> m ()
- OpenSuse.Prelude: until :: () => a -> Bool -> a -> a -> a -> a
+ OpenSuse.Prelude: until :: (a -> Bool) -> (a -> a) -> a -> a
- OpenSuse.Prelude: unzip :: () => [(a, b)] -> ([a], [b])
+ OpenSuse.Prelude: unzip :: [(a, b)] -> ([a], [b])
- OpenSuse.Prelude: unzip3 :: () => [(a, b, c)] -> ([a], [b], [c])
+ OpenSuse.Prelude: unzip3 :: [(a, b, c)] -> ([a], [b], [c])
- OpenSuse.Prelude: whenJust :: Applicative m => Maybe a -> a -> m () -> m ()
+ OpenSuse.Prelude: whenJust :: Applicative m => Maybe a -> (a -> m ()) -> m ()
- OpenSuse.Prelude: whenJustM :: Monad m => m Maybe a -> a -> m () -> m ()
+ OpenSuse.Prelude: whenJustM :: Monad m => m (Maybe a) -> (a -> m ()) -> m ()
- OpenSuse.Prelude: whenMaybe :: Applicative m => Bool -> m a -> m Maybe a
+ OpenSuse.Prelude: whenMaybe :: Applicative m => Bool -> m a -> m (Maybe a)
- OpenSuse.Prelude: whenMaybeM :: Monad m => m Bool -> m a -> m Maybe a
+ OpenSuse.Prelude: whenMaybeM :: Monad m => m Bool -> m a -> m (Maybe a)
- OpenSuse.Prelude: zip :: () => [a] -> [b] -> [(a, b)]
+ OpenSuse.Prelude: zip :: [a] -> [b] -> [(a, b)]
- OpenSuse.Prelude: zip3 :: () => [a] -> [b] -> [c] -> [(a, b, c)]
+ OpenSuse.Prelude: zip3 :: [a] -> [b] -> [c] -> [(a, b, c)]
- OpenSuse.Prelude: zipWith :: () => a -> b -> c -> [a] -> [b] -> [c]
+ OpenSuse.Prelude: zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]
- OpenSuse.Prelude: zipWith3 :: () => a -> b -> c -> d -> [a] -> [b] -> [c] -> [d]
+ OpenSuse.Prelude: zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]
- OpenSuse.Prelude: zipWithM :: Applicative m => a -> b -> m c -> [a] -> [b] -> m [c]
+ OpenSuse.Prelude: zipWithM :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m [c]
- OpenSuse.Prelude: zipWithM_ :: Applicative m => a -> b -> m c -> [a] -> [b] -> m ()
+ OpenSuse.Prelude: zipWithM_ :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m ()
Files
- distribution-opensuse.cabal +5/−11
- src/OpenSuse/GuessChangeLog.hs +7/−0
- src/OpenSuse/Types/Issue.hs +4/−4
distribution-opensuse.cabal view
@@ -1,5 +1,5 @@ name: distribution-opensuse-version: 1.1.1+version: 1.1.2 synopsis: Types, functions, and tools to manipulate the openSUSE distribution description: This library is a loose collection of types, functions, and tools that users and developers of the@@ -8,7 +8,8 @@ license-file: LICENSE author: Peter Simons maintainer: simons@cryp.to-tested-with: GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.3+tested-with: GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.4, GHC == 8.6.5, GHC == 8.8.4, GHC == 8.10.7+ , GHC == 9.0.2, GHC == 9.2.1 category: Distribution homepage: https://github.com/peti/distribution-opensuse/ bug-reports: https://github.com/peti/distribution-opensuse/issues@@ -55,17 +56,12 @@ , time , turtle default-language: Haskell2010- default-extensions: MonadFailDesugaring- ghc-options: -Wall -Wcompat -Wincomplete-uni-patterns -Wincomplete-record-updates- -Wredundant-constraints executable guess-changelog main-is: guess-changelog.hs build-depends: base, containers, distribution-opensuse, text, turtle default-language: Haskell2010- default-extensions: MonadFailDesugaring- ghc-options: -Wall -Wcompat -Wincomplete-uni-patterns -Wincomplete-record-updates- -Wredundant-constraints -threaded+ ghc-options: -threaded test-suite test-strip-space type: exitcode-stdio-1.0@@ -73,6 +69,4 @@ hs-source-dirs: tests build-depends: base, distribution-opensuse default-language: Haskell2010- default-extensions: MonadFailDesugaring- ghc-options: -Wall -Wcompat -Wincomplete-uni-patterns -Wincomplete-record-updates- -Wredundant-constraints -threaded+ ghc-options: -threaded
src/OpenSuse/GuessChangeLog.hs view
@@ -112,6 +112,13 @@ unDiff (Both txt _) = txt unDiff (Second txt) = txt +-- |+--+-- TODO:+--+-- * Don't match @guess-changelog.hs@. We should probably avoid a couple of+-- suffixes that we know to be associated with code rather than text.+ findChangeLogFiles :: FilePath -> Shell FilePath findChangeLogFiles dirPath = onFiles (grepText changelogFilePattern) (filename <$> ls dirPath)
src/OpenSuse/Types/Issue.hs view
@@ -9,9 +9,8 @@ import OpenSuse.Prelude import Data.Aeson-import Data.List+import Data.List ( isSuffixOf ) import Data.Text ( unpack )-import GHC.Generics ( Generic ) import Text.Read data Issue = Bsc Natural@@ -32,8 +31,9 @@ showIssue (Bsc n) = "bsc#" ++ show n parseCve :: String -> Issue-parseCve cve = Cve (safeRead "cve-year" y) (safeRead "cve-number" n)- where (y,'-':n) = break (=='-') cve+parseCve cve = case break (=='-') cve of+ (y,'-':n) -> Cve (safeRead "cve-year" y) (safeRead "cve-number" n)+ _ -> error ("malformed CVE: " ++ show cve) parseBsc :: String -> Issue -- TODO: https://gitlab.suse.de/l3ms/smelt/issues/184 parseBsc bsc = Bsc (safeRead "bsc number" (stripFixmeSuffix bsc))