packages feed

data-easy 0.6.1 → 0.7.0

raw patch · 2 files changed

+5/−26 lines, 2 filesdep ~basePVP ok

version bump matches the API change (PVP)

Dependency ranges changed: base

API changes (from Hackage documentation)

- Data.Easy: allCond' :: [a -> Bool] -> a -> Bool
- Data.Easy: anyCond' :: [a -> Bool] -> a -> Bool
+ Data.Easy: infixl 1 ?&&\
+ Data.Easy: infixl 3 <!>
+ Data.Easy: infixl 9 @@
+ Data.Easy: infixr 1 ?|
- Data.Easy: (?&&) :: Monoid a => a -> Bool -> a
+ Data.Easy: (?&&) :: (Monoid a) => a -> Bool -> a
- Data.Easy: (?&&\) :: Monoid a => a -> (a -> Bool) -> a
+ Data.Easy: (?&&\) :: (Monoid a) => a -> (a -> Bool) -> a
- Data.Easy: boolCToMonoid :: Monoid a => a -> (a -> Bool) -> a
+ Data.Easy: boolCToMonoid :: (Monoid a) => a -> (a -> Bool) -> a
- Data.Easy: boolToMonoid :: Monoid a => a -> Bool -> a
+ Data.Easy: boolToMonoid :: (Monoid a) => a -> Bool -> a
- Data.Easy: catLists :: Eq a => [[a]] -> [[a]]
+ Data.Easy: catLists :: (Eq a) => [[a]] -> [[a]]
- Data.Easy: eitherToMonoid :: Monoid b => Either a b -> b
+ Data.Easy: eitherToMonoid :: (Monoid b) => Either a b -> b
- Data.Easy: listToMonoid :: (Eq a, Monoid a) => [a] -> a
+ Data.Easy: listToMonoid :: (Monoid a) => [a] -> a
- Data.Easy: maybeToMonoid :: Monoid a => Maybe a -> a
+ Data.Easy: maybeToMonoid :: (Monoid a) => Maybe a -> a
- Data.Easy: nubSort :: (Eq a, Ord a) => [a] -> [a]
+ Data.Easy: nubSort :: (Ord a) => [a] -> [a]
- Data.Easy: nubSort' :: (Eq a, Ord a, Monoid a) => [a] -> [a]
+ Data.Easy: nubSort' :: (Ord a, Monoid a) => [a] -> [a]
- Data.Easy: pair :: Monoid c => (a -> c) -> (b -> c) -> (a, b) -> c
+ Data.Easy: pair :: (Monoid c) => (a -> c) -> (b -> c) -> (a, b) -> c
- Data.Easy: pairS :: Monoid b => (a -> b) -> (a, a) -> b
+ Data.Easy: pairS :: (Monoid b) => (a -> b) -> (a, a) -> b
- Data.Easy: triple :: Monoid d => (a -> d) -> (b -> d) -> (c -> d) -> (a, b, c) -> d
+ Data.Easy: triple :: (Monoid d) => (a -> d) -> (b -> d) -> (c -> d) -> (a, b, c) -> d
- Data.Easy: tripleS :: Monoid b => (a -> b) -> (a, a, a) -> b
+ Data.Easy: tripleS :: (Monoid b) => (a -> b) -> (a, a, a) -> b

Files

data-easy.cabal view
@@ -1,5 +1,5 @@ name:                data-easy-version:             0.6.1+version:             0.7.0 synopsis:            Consistent set of utility functions for Maybe, Either, List and Monoids. description:         Easy to use set of utility functions, implementing a Data.Maybe like                      interface for other common types, like Either, List, Bool, Tuple, @@ -35,7 +35,7 @@   -- other-modules:             -- Other library packages from which modules are imported.-  build-depends   : base          >= 4.6 && < 4.9+  build-depends   : base          >= 4.6 && < 4.11                   , safe          >= 0.3.3                   , containers    >= 0.5.0.0
src/Data/Easy.hs view
@@ -257,9 +257,7 @@   , (?&&)   , (?&&\)   , allCond-  , allCond'   , anyCond-  , anyCond'    ) where @@ -270,11 +268,6 @@ -- #else -- import Data.Either.Combinators -- #endif-import Control.Applicative-{-import Data.Tuple-}-{-import Data.Ord-}-{-import Data.Function-}-import Data.Monoid import Safe import qualified Data.List as L import qualified Data.Set as Set@@ -703,12 +696,12 @@ -- -- > nubSort = Set.toAscList . Set.fromList ---nubSort :: (Eq a, Ord a) => [a] -> [a]+nubSort :: (Ord a) => [a] -> [a] nubSort = Set.toAscList . Set.fromList  -- | Sort, nub (remove duplicates) and remove initial empty value, if it -- exists. See 'nubSort'.-nubSort' :: (Eq a, Ord a, Monoid a) => [a] -> [a]+nubSort' :: (Ord a, Monoid a) => [a] -> [a] nubSort' lst = case nubSort lst of   []     -> []   (x:xs) -> if isEmpty x then xs else x:xs@@ -1152,7 +1145,7 @@ -- to promote values into a monoid -- -- > listToMonoid = headDef mempty-listToMonoid :: (Eq a, Monoid a) => [a] -> a+listToMonoid :: (Monoid a) => [a] -> a listToMonoid = headDef mempty  -- | monoidToList convert an empty monoid into an empty list,@@ -1398,12 +1391,6 @@ allCond _ [] = False allCond value lst = and . mapV value $ lst --- | Flipped allCond------ > flip allCond-allCond' :: [a -> Bool] -> a -> Bool-allCond' = flip allCond- -- | Apply a list of boolean checks/tests to a variable, and return (True) -- if /any/ of them passed. --@@ -1414,11 +1401,3 @@ anyCond :: a -> [a -> Bool] -> Bool anyCond _ [] = False anyCond value lst = or . mapV value $ lst---- | Flipped anyCond------ > flip anyCond-anyCond' :: [a -> Bool] -> a -> Bool-anyCond' = flip anyCond--