papa-base-export 0.3.1 → 0.4
raw patch · 3 files changed
+5/−6 lines, 3 filesdep ~basePVP ok
version bump matches the API change (PVP)
Dependency ranges changed: base
API changes (from Hackage documentation)
- Papa.Base.Export.Control.Applicative: data Const k a (b :: k) :: forall k. * -> k -> *
- Papa.Base.Export.Data.Semigroup: class Monoid a
- Papa.Base.Export.Data.Semigroup: mappend :: Monoid a => a -> a -> a
- Papa.Base.Export.Data.Semigroup: mempty :: Monoid a => a
+ Papa.Base.Export.Control.Applicative: data Const k a (b :: k) :: forall k. () => * -> k -> *
+ Papa.Base.Export.Prelude: infixl 6 -
+ Papa.Base.Export.Prelude: infixl 7 `rem`
- Papa.Base.Export.Control.Applicative: (<$) :: Functor f => forall a b. a -> f b -> f a
+ Papa.Base.Export.Control.Applicative: (<$) :: Functor f => forall a b. () => a -> f b -> f a
- Papa.Base.Export.Control.Applicative: liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c
+ Papa.Base.Export.Control.Applicative: liftA2 :: Applicative f => forall a b c. () => (a -> b -> c) -> f a -> f b -> f c
- Papa.Base.Export.Control.Applicative: optional :: Alternative f => f a -> f (Maybe a)
+ Papa.Base.Export.Control.Applicative: optional :: Alternative f => f a -> f Maybe a
- Papa.Base.Export.Control.Monad: msum :: (Foldable t, MonadPlus m) => t (m a) -> m a
+ Papa.Base.Export.Control.Monad: msum :: (Foldable t, MonadPlus m) => t m a -> m a
- Papa.Base.Export.Data.Bool: bool :: a -> a -> Bool -> a
+ Papa.Base.Export.Data.Bool: bool :: () => a -> a -> Bool -> a
- Papa.Base.Export.Data.Either: either :: (a -> c) -> (b -> c) -> Either a b -> c
+ Papa.Base.Export.Data.Either: either :: () => (a -> c) -> (b -> c) -> Either a b -> c
- Papa.Base.Export.Data.Either: isLeft :: Either a b -> Bool
+ Papa.Base.Export.Data.Either: isLeft :: () => Either a b -> Bool
- Papa.Base.Export.Data.Either: isRight :: Either a b -> Bool
+ Papa.Base.Export.Data.Either: isRight :: () => Either a b -> Bool
- Papa.Base.Export.Data.Either: partitionEithers :: [Either a b] -> ([a], [b])
+ Papa.Base.Export.Data.Either: partitionEithers :: () => [Either a b] -> ([a], [b])
- Papa.Base.Export.Data.Foldable: asum :: (Foldable t, Alternative f) => t (f a) -> f a
+ Papa.Base.Export.Data.Foldable: asum :: (Foldable t, Alternative f) => t f a -> f a
- Papa.Base.Export.Data.Foldable: sequenceA_ :: (Foldable t, Applicative f) => t (f a) -> f ()
+ Papa.Base.Export.Data.Foldable: sequenceA_ :: (Foldable t, Applicative f) => t f a -> f ()
- Papa.Base.Export.Data.Function: ($) :: (a -> b) -> a -> b
+ Papa.Base.Export.Data.Function: ($) :: () => (a -> b) -> a -> b
- Papa.Base.Export.Data.Function: (&) :: a -> (a -> b) -> b
+ Papa.Base.Export.Data.Function: (&) :: () => a -> (a -> b) -> b
- Papa.Base.Export.Data.Function: fix :: (a -> a) -> a
+ Papa.Base.Export.Data.Function: fix :: () => (a -> a) -> a
- Papa.Base.Export.Data.Function: on :: (b -> b -> c) -> (a -> b) -> a -> a -> c
+ Papa.Base.Export.Data.Function: on :: () => (b -> b -> c) -> (a -> b) -> a -> a -> c
- Papa.Base.Export.Data.List: break :: (a -> Bool) -> [a] -> ([a], [a])
+ Papa.Base.Export.Data.List: break :: () => (a -> Bool) -> [a] -> ([a], [a])
- Papa.Base.Export.Data.List: cycle :: [a] -> [a]
+ Papa.Base.Export.Data.List: cycle :: () => [a] -> [a]
- Papa.Base.Export.Data.List: deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]
+ Papa.Base.Export.Data.List: deleteBy :: () => (a -> a -> Bool) -> a -> [a] -> [a]
- Papa.Base.Export.Data.List: deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
+ Papa.Base.Export.Data.List: deleteFirstsBy :: () => (a -> a -> Bool) -> [a] -> [a] -> [a]
- Papa.Base.Export.Data.List: drop :: Int -> [a] -> [a]
+ Papa.Base.Export.Data.List: drop :: () => Int -> [a] -> [a]
- Papa.Base.Export.Data.List: dropWhile :: (a -> Bool) -> [a] -> [a]
+ Papa.Base.Export.Data.List: dropWhile :: () => (a -> Bool) -> [a] -> [a]
- Papa.Base.Export.Data.List: dropWhileEnd :: (a -> Bool) -> [a] -> [a]
+ Papa.Base.Export.Data.List: dropWhileEnd :: () => (a -> Bool) -> [a] -> [a]
- Papa.Base.Export.Data.List: foldl :: Foldable t => forall b a. (b -> a -> b) -> b -> t a -> b
+ Papa.Base.Export.Data.List: foldl :: Foldable t => forall b a. () => (b -> a -> b) -> b -> t a -> b
- Papa.Base.Export.Data.List: foldl' :: Foldable t => forall b a. (b -> a -> b) -> b -> t a -> b
+ Papa.Base.Export.Data.List: foldl' :: Foldable t => forall b a. () => (b -> a -> b) -> b -> t a -> b
- Papa.Base.Export.Data.List: foldr :: Foldable t => forall a b. (a -> b -> b) -> b -> t a -> b
+ Papa.Base.Export.Data.List: foldr :: Foldable t => forall a b. () => (a -> b -> b) -> b -> t a -> b
- Papa.Base.Export.Data.List: insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a]
+ Papa.Base.Export.Data.List: insertBy :: () => (a -> a -> Ordering) -> a -> [a] -> [a]
- Papa.Base.Export.Data.List: intercalate :: [a] -> [[a]] -> [a]
+ Papa.Base.Export.Data.List: intercalate :: () => [a] -> [[a]] -> [a]
- Papa.Base.Export.Data.List: intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
+ Papa.Base.Export.Data.List: intersectBy :: () => (a -> a -> Bool) -> [a] -> [a] -> [a]
- Papa.Base.Export.Data.List: intersperse :: a -> [a] -> [a]
+ Papa.Base.Export.Data.List: intersperse :: () => a -> [a] -> [a]
- Papa.Base.Export.Data.List: length :: Foldable t => forall a. t a -> Int
+ Papa.Base.Export.Data.List: length :: Foldable t => forall a. () => t a -> Int
- Papa.Base.Export.Data.List: nubBy :: (a -> a -> Bool) -> [a] -> [a]
+ Papa.Base.Export.Data.List: nubBy :: () => (a -> a -> Bool) -> [a] -> [a]
- Papa.Base.Export.Data.List: null :: Foldable t => forall a. t a -> Bool
+ Papa.Base.Export.Data.List: null :: Foldable t => forall a. () => t a -> Bool
- Papa.Base.Export.Data.List: partition :: (a -> Bool) -> [a] -> ([a], [a])
+ Papa.Base.Export.Data.List: partition :: () => (a -> Bool) -> [a] -> ([a], [a])
- Papa.Base.Export.Data.List: permutations :: [a] -> [[a]]
+ Papa.Base.Export.Data.List: permutations :: () => [a] -> [[a]]
- Papa.Base.Export.Data.List: replicate :: Int -> a -> [a]
+ Papa.Base.Export.Data.List: replicate :: () => Int -> a -> [a]
- Papa.Base.Export.Data.List: reverse :: [a] -> [a]
+ Papa.Base.Export.Data.List: reverse :: () => [a] -> [a]
- Papa.Base.Export.Data.List: sortBy :: (a -> a -> Ordering) -> [a] -> [a]
+ Papa.Base.Export.Data.List: sortBy :: () => (a -> a -> Ordering) -> [a] -> [a]
- Papa.Base.Export.Data.List: span :: (a -> Bool) -> [a] -> ([a], [a])
+ Papa.Base.Export.Data.List: span :: () => (a -> Bool) -> [a] -> ([a], [a])
- Papa.Base.Export.Data.List: splitAt :: Int -> [a] -> ([a], [a])
+ Papa.Base.Export.Data.List: splitAt :: () => Int -> [a] -> ([a], [a])
- Papa.Base.Export.Data.List: subsequences :: [a] -> [[a]]
+ Papa.Base.Export.Data.List: subsequences :: () => [a] -> [[a]]
- Papa.Base.Export.Data.List: take :: Int -> [a] -> [a]
+ Papa.Base.Export.Data.List: take :: () => Int -> [a] -> [a]
- Papa.Base.Export.Data.List: takeWhile :: (a -> Bool) -> [a] -> [a]
+ Papa.Base.Export.Data.List: takeWhile :: () => (a -> Bool) -> [a] -> [a]
- Papa.Base.Export.Data.List: transpose :: [[a]] -> [[a]]
+ Papa.Base.Export.Data.List: transpose :: () => [[a]] -> [[a]]
- Papa.Base.Export.Data.List: unionBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
+ Papa.Base.Export.Data.List: unionBy :: () => (a -> a -> Bool) -> [a] -> [a] -> [a]
- Papa.Base.Export.Data.List.NonEmpty: group1 :: Eq a => NonEmpty a -> NonEmpty (NonEmpty a)
+ Papa.Base.Export.Data.List.NonEmpty: group1 :: Eq a => NonEmpty a -> NonEmpty NonEmpty a
- Papa.Base.Export.Data.List.NonEmpty: groupAllWith1 :: Ord b => (a -> b) -> NonEmpty a -> NonEmpty (NonEmpty a)
+ Papa.Base.Export.Data.List.NonEmpty: groupAllWith1 :: Ord b => (a -> b) -> NonEmpty a -> NonEmpty NonEmpty a
- Papa.Base.Export.Data.List.NonEmpty: groupBy1 :: (a -> a -> Bool) -> NonEmpty a -> NonEmpty (NonEmpty a)
+ Papa.Base.Export.Data.List.NonEmpty: groupBy1 :: () => (a -> a -> Bool) -> NonEmpty a -> NonEmpty NonEmpty a
- Papa.Base.Export.Data.List.NonEmpty: groupWith1 :: Eq b => (a -> b) -> NonEmpty a -> NonEmpty (NonEmpty a)
+ Papa.Base.Export.Data.List.NonEmpty: groupWith1 :: Eq b => (a -> b) -> NonEmpty a -> NonEmpty NonEmpty a
- Papa.Base.Export.Data.List.NonEmpty: iterate :: (a -> a) -> a -> NonEmpty a
+ Papa.Base.Export.Data.List.NonEmpty: iterate :: () => (a -> a) -> a -> NonEmpty a
- Papa.Base.Export.Data.List.NonEmpty: nonEmpty :: [a] -> Maybe (NonEmpty a)
+ Papa.Base.Export.Data.List.NonEmpty: nonEmpty :: () => [a] -> Maybe NonEmpty a
- Papa.Base.Export.Data.List.NonEmpty: repeat :: a -> NonEmpty a
+ Papa.Base.Export.Data.List.NonEmpty: repeat :: () => a -> NonEmpty a
- Papa.Base.Export.Data.List.NonEmpty: scanl1 :: (a -> a -> a) -> NonEmpty a -> NonEmpty a
+ Papa.Base.Export.Data.List.NonEmpty: scanl1 :: () => (a -> a -> a) -> NonEmpty a -> NonEmpty a
- Papa.Base.Export.Data.List.NonEmpty: scanr1 :: (a -> a -> a) -> NonEmpty a -> NonEmpty a
+ Papa.Base.Export.Data.List.NonEmpty: scanr1 :: () => (a -> a -> a) -> NonEmpty a -> NonEmpty a
- Papa.Base.Export.Data.List.NonEmpty: some1 :: Alternative f => f a -> f (NonEmpty a)
+ Papa.Base.Export.Data.List.NonEmpty: some1 :: Alternative f => f a -> f NonEmpty a
- Papa.Base.Export.Data.List.NonEmpty: unfold :: (a -> (b, Maybe a)) -> a -> NonEmpty b
+ Papa.Base.Export.Data.List.NonEmpty: unfold :: () => (a -> (b, Maybe a)) -> a -> NonEmpty b
- Papa.Base.Export.Data.Maybe: fromMaybe :: a -> Maybe a -> a
+ Papa.Base.Export.Data.Maybe: fromMaybe :: () => a -> Maybe a -> a
- Papa.Base.Export.Data.Maybe: isJust :: Maybe a -> Bool
+ Papa.Base.Export.Data.Maybe: isJust :: () => Maybe a -> Bool
- Papa.Base.Export.Data.Maybe: isNothing :: Maybe a -> Bool
+ Papa.Base.Export.Data.Maybe: isNothing :: () => Maybe a -> Bool
- Papa.Base.Export.Data.Maybe: maybe :: b -> (a -> b) -> Maybe a -> b
+ Papa.Base.Export.Data.Maybe: maybe :: () => b -> (a -> b) -> Maybe a -> b
- Papa.Base.Export.Data.Ratio: denominator :: Ratio a -> a
+ Papa.Base.Export.Data.Ratio: denominator :: () => Ratio a -> a
- Papa.Base.Export.Data.Ratio: numerator :: Ratio a -> a
+ Papa.Base.Export.Data.Ratio: numerator :: () => Ratio a -> a
- Papa.Base.Export.Data.Semigroup: option :: b -> (a -> b) -> Option a -> b
+ Papa.Base.Export.Data.Semigroup: option :: () => b -> (a -> b) -> Option a -> b
- Papa.Base.Export.Data.Semigroup: type ArgMax a b = Max (Arg a b)
+ Papa.Base.Export.Data.Semigroup: type ArgMax a b = Max Arg a b
- Papa.Base.Export.Data.Semigroup: type ArgMin a b = Min (Arg a b)
+ Papa.Base.Export.Data.Semigroup: type ArgMin a b = Min Arg a b
- Papa.Base.Export.Data.Traversable: for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b)
+ Papa.Base.Export.Data.Traversable: for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f t b
- Papa.Base.Export.Data.Traversable: sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)
+ Papa.Base.Export.Data.Traversable: sequenceA :: (Traversable t, Applicative f) => t f a -> f t a
- Papa.Base.Export.Data.Traversable: traverse :: (Traversable t, Applicative f) => (a -> f b) -> t a -> f (t b)
+ Papa.Base.Export.Data.Traversable: traverse :: (Traversable t, Applicative f) => (a -> f b) -> t a -> f t b
- Papa.Base.Export.Data.Void: absurd :: Void -> a
+ Papa.Base.Export.Data.Void: absurd :: () => Void -> a
- Papa.Base.Export.Prelude: ($) :: (a -> b) -> a -> b
+ Papa.Base.Export.Prelude: ($) :: () => (a -> b) -> a -> b
- Papa.Base.Export.Prelude: break :: (a -> Bool) -> [a] -> ([a], [a])
+ Papa.Base.Export.Prelude: break :: () => (a -> Bool) -> [a] -> ([a], [a])
- Papa.Base.Export.Prelude: curry :: ((a, b) -> c) -> a -> b -> c
+ Papa.Base.Export.Prelude: curry :: () => ((a, b) -> c) -> a -> b -> c
- Papa.Base.Export.Prelude: cycle :: [a] -> [a]
+ Papa.Base.Export.Prelude: cycle :: () => [a] -> [a]
- Papa.Base.Export.Prelude: drop :: Int -> [a] -> [a]
+ Papa.Base.Export.Prelude: drop :: () => Int -> [a] -> [a]
- Papa.Base.Export.Prelude: dropWhile :: (a -> Bool) -> [a] -> [a]
+ Papa.Base.Export.Prelude: dropWhile :: () => (a -> Bool) -> [a] -> [a]
- Papa.Base.Export.Prelude: either :: (a -> c) -> (b -> c) -> Either a b -> c
+ Papa.Base.Export.Prelude: either :: () => (a -> c) -> (b -> c) -> Either a b -> c
- Papa.Base.Export.Prelude: filter :: (a -> Bool) -> [a] -> [a]
+ Papa.Base.Export.Prelude: filter :: () => (a -> Bool) -> [a] -> [a]
- Papa.Base.Export.Prelude: infix 4 `notElem`
+ Papa.Base.Export.Prelude: infix 4 `elem`
- Papa.Base.Export.Prelude: infixl 4 <$>
+ Papa.Base.Export.Prelude: infixl 4 <*>
- Papa.Base.Export.Prelude: ioError :: IOError -> IO a
+ Papa.Base.Export.Prelude: ioError :: () => IOError -> IO a
- Papa.Base.Export.Prelude: maybe :: b -> (a -> b) -> Maybe a -> b
+ Papa.Base.Export.Prelude: maybe :: () => b -> (a -> b) -> Maybe a -> b
- Papa.Base.Export.Prelude: pure :: Applicative f => forall a. a -> f a
+ Papa.Base.Export.Prelude: pure :: Applicative f => forall a. () => a -> f a
- Papa.Base.Export.Prelude: replicate :: Int -> a -> [a]
+ Papa.Base.Export.Prelude: replicate :: () => Int -> a -> [a]
- Papa.Base.Export.Prelude: sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)
+ Papa.Base.Export.Prelude: sequenceA :: (Traversable t, Applicative f) => t f a -> f t a
- Papa.Base.Export.Prelude: span :: (a -> Bool) -> [a] -> ([a], [a])
+ Papa.Base.Export.Prelude: span :: () => (a -> Bool) -> [a] -> ([a], [a])
- Papa.Base.Export.Prelude: splitAt :: Int -> [a] -> ([a], [a])
+ Papa.Base.Export.Prelude: splitAt :: () => Int -> [a] -> ([a], [a])
- Papa.Base.Export.Prelude: take :: Int -> [a] -> [a]
+ Papa.Base.Export.Prelude: take :: () => Int -> [a] -> [a]
- Papa.Base.Export.Prelude: takeWhile :: (a -> Bool) -> [a] -> [a]
+ Papa.Base.Export.Prelude: takeWhile :: () => (a -> Bool) -> [a] -> [a]
- Papa.Base.Export.Prelude: traverse :: Traversable t => forall (f :: * -> *) a b. Applicative f => (a -> f b) -> t a -> f (t b)
+ Papa.Base.Export.Prelude: traverse :: Traversable t => forall (f :: * -> *) a b. Applicative f => (a -> f b) -> t a -> f t b
- Papa.Base.Export.Prelude: uncurry :: (a -> b -> c) -> (a, b) -> c
+ Papa.Base.Export.Prelude: uncurry :: () => (a -> b -> c) -> (a, b) -> c
- Papa.Base.Export.Prelude: until :: (a -> Bool) -> (a -> a) -> a -> a
+ Papa.Base.Export.Prelude: until :: () => (a -> Bool) -> (a -> a) -> a -> a
- Papa.Base.Export.Prelude: unzip3 :: [(a, b, c)] -> ([a], [b], [c])
+ Papa.Base.Export.Prelude: unzip3 :: () => [(a, b, c)] -> ([a], [b], [c])
- Papa.Base.Export.Prelude: zip :: [a] -> [b] -> [(a, b)]
+ Papa.Base.Export.Prelude: zip :: () => [a] -> [b] -> [(a, b)]
- Papa.Base.Export.Prelude: zip3 :: [a] -> [b] -> [c] -> [(a, b, c)]
+ Papa.Base.Export.Prelude: zip3 :: () => [a] -> [b] -> [c] -> [(a, b, c)]
- Papa.Base.Export.Prelude: zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]
+ Papa.Base.Export.Prelude: zipWith :: () => (a -> b -> c) -> [a] -> [b] -> [c]
- Papa.Base.Export.Prelude: zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]
+ Papa.Base.Export.Prelude: zipWith3 :: () => (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]
Files
- changelog.md +4/−0
- papa-base-export.cabal +1/−4
- src/Papa/Base/Export/Data/Semigroup.hs +0/−2
changelog.md view
@@ -1,3 +1,7 @@+0.3.1++* Remove doctests test target and setup+ 0.2.0 * Initial release.
papa-base-export.cabal view
@@ -1,5 +1,5 @@ name: papa-base-export-version: 0.3.1+version: 0.4 license: BSD3 license-file: LICENCE author: Queensland Functional Programming Lab <oᴉ˙ldɟb@llǝʞsɐɥ>@@ -20,9 +20,6 @@ source-repository head type: git location: git@github.com:qfpl/papa.git--flag small_base- description: Choose the new, split-up base package. library default-language:
src/Papa/Base/Export/Data/Semigroup.hs view
@@ -11,7 +11,6 @@ , First(getFirst) , Last(getLast) , WrappedMonoid(unwrapMonoid)- , Monoid(mempty, mappend) , Dual(getDual) , Endo(appEndo) , All(getAll)@@ -39,7 +38,6 @@ , First(getFirst) , Last(getLast) , WrappedMonoid(unwrapMonoid)- , Monoid(mempty, mappend) , Dual(getDual) , Endo(appEndo) , All(getAll)