monoid-subclasses 1.0 → 1.0.1
raw patch · 6 files changed
+26/−21 lines, 6 filesdep ~basePVP ok
version bump matches the API change (PVP)
Dependency ranges changed: base
API changes (from Hackage documentation)
Files
- CHANGELOG.md +5/−0
- monoid-subclasses.cabal +3/−3
- src/Data/Monoid/Cancellative.hs +9/−9
- src/Data/Monoid/Factorial.hs +2/−2
- src/Data/Monoid/Textual.hs +1/−1
- src/Data/Semigroup/Factorial.hs +6/−6
CHANGELOG.md view
@@ -1,4 +1,9 @@ +Version 1.0.1+---------------+* Incremented the lower bound of the base dependency+* Fixed Haddock links+ Version 1.0 --------------- * Fixed issue #24, unlawful LeftReductiveMonoid instance for Map
monoid-subclasses.cabal view
@@ -1,5 +1,5 @@ Name: monoid-subclasses-Version: 1.0+Version: 1.0.1 Cabal-Version: >= 1.10 Build-Type: Simple Synopsis: Subclasses of Monoid@@ -29,7 +29,7 @@ Data.Monoid.Instances.ByteString.UTF8, Data.Monoid.Instances.CharVector, Data.Monoid.Instances.Concat, Data.Monoid.Instances.Measured, Data.Monoid.Instances.Positioned, Data.Monoid.Instances.Stateful- Build-Depends: base >= 4.9 && < 5,+ Build-Depends: base >= 4.11 && < 5, bytestring >= 0.9 && < 1.0, containers >= 0.5.7.0 && < 0.7, text >= 0.11 && < 1.3, primes == 0.2.*, vector >= 0.12 && < 0.13 GHC-options: -Wall@@ -37,7 +37,7 @@ test-suite Main Type: exitcode-stdio-1.0- Build-Depends: base >= 4.9 && < 5,+ Build-Depends: base >= 4.11 && < 5, bytestring >= 0.9 && < 1.0, containers >= 0.5.7.0 && < 0.7, text >= 0.11 && < 1.3, vector >= 0.12 && < 0.13, primes == 0.2.*, QuickCheck >= 2.9 && < 3, quickcheck-instances >= 0.3.12 && <0.4,
src/Data/Monoid/Cancellative.hs view
@@ -24,7 +24,7 @@ {-# LANGUAGE Haskell2010, ConstraintKinds, FlexibleInstances #-} -module Data.Monoid.Cancellative {- from 1.1 # DEPRECATED "Use \"Data.Semigroup.Cancellative\" and \"Data.Monoid.GCD\" instead" #-} (+module Data.Monoid.Cancellative {- from 1.1 DEPRECATED "Use \"Data.Semigroup.Cancellative\" and \"Data.Monoid.GCD\" instead" -} ( module Data.Semigroup.Cancellative, module Data.Monoid.GCD, -- * Symmetric, commutative monoid classes@@ -40,14 +40,14 @@ import Data.Semigroup.Cancellative import Data.Monoid.GCD -{- from 1.1 #-}-{- # DEPRECATED CommutativeMonoid "Use Data.Semigroup.Cancellative.Commutative instead." #-}-{- # DEPRECATED ReductiveMonoid "Use Data.Semigroup.Cancellative.Reductive instead." #-}-{- # DEPRECATED LeftReductiveMonoid "Use Data.Semigroup.Cancellative.LeftReductive instead." #-}-{- # DEPRECATED RightReductiveMonoid "Use Data.Semigroup.Cancellative.RightReductive instead." #-}-{- # DEPRECATED CancellativeMonoid "Use Data.Semigroup.Cancellative.Cancellative instead." #-}-{- # DEPRECATED LeftCancellativeMonoid "Use Data.Semigroup.Cancellative.LeftCancellative instead." #-}-{- # DEPRECATED RightCancellativeMonoid "Use Data.Semigroup.Cancellative.RightCancellative instead." #-}+{- from 1.1-}+{- DEPRECATED CommutativeMonoid "Use Data.Semigroup.Cancellative.Commutative instead." -}+{- DEPRECATED ReductiveMonoid "Use Data.Semigroup.Cancellative.Reductive instead." -}+{- DEPRECATED LeftReductiveMonoid "Use Data.Semigroup.Cancellative.LeftReductive instead." -}+{- DEPRECATED RightReductiveMonoid "Use Data.Semigroup.Cancellative.RightReductive instead." -}+{- DEPRECATED CancellativeMonoid "Use Data.Semigroup.Cancellative.Cancellative instead." -}+{- DEPRECATED LeftCancellativeMonoid "Use Data.Semigroup.Cancellative.LeftCancellative instead." -}+{- DEPRECATED RightCancellativeMonoid "Use Data.Semigroup.Cancellative.RightCancellative instead." -} type CommutativeMonoid m = (Monoid m, Commutative m) type ReductiveMonoid m = (Monoid m, Reductive m) type LeftReductiveMonoid m = (Monoid m, LeftReductive m)
src/Data/Monoid/Factorial.hs view
@@ -81,7 +81,7 @@ inits :: m -> [m] -- | Returns the list of all suffixes of the argument, 'mempty' last. tails :: m -> [m]- -- | Like 'List.span' from "Data.List" on the list of 'primes'.+ -- | Like 'List.span' from "Data.List" on the list of prime 'factors'. span :: (m -> Bool) -> m -> (m, m) -- | Equivalent to 'List.break' from "Data.List". break :: (m -> Bool) -> m -> (m, m)@@ -96,7 +96,7 @@ spanMaybe :: s -> (s -> m -> Maybe s) -> m -> (m, m, s) -- | Strict version of 'spanMaybe'. spanMaybe' :: s -> (s -> m -> Maybe s) -> m -> (m, m, s)- -- | Like 'List.splitAt' from "Data.List" on the list of 'primes'.+ -- | Like 'List.splitAt' from "Data.List" on the list of prime 'factors'. splitAt :: Int -> m -> (m, m) -- | Equivalent to 'List.drop' from "Data.List". drop :: Int -> m -> m
src/Data/Monoid/Textual.hs view
@@ -90,7 +90,7 @@ -- -- > singleton c == fromString [c] singleton :: Char -> t- -- | Specialized version of 'Factorial.splitPrimePrefix'. Every prime factor of a 'Textual' monoid must consist of a+ -- | Specialized version of 'Factorial.splitPrimePrefix'. Every prime factor of a textual monoid must consist of a -- single character or no character at all. splitCharacterPrefix :: t -> Maybe (Char, t) -- | Extracts a single character that prefixes the monoid, if the monoid begins with a character. Otherwise returns
src/Data/Semigroup/Factorial.hs view
@@ -68,16 +68,16 @@ primePrefix :: m -> m -- | The prime suffix; @primeSuffix mempty == mempty@ for monoids. primeSuffix :: m -> m- -- | Like 'List.foldl' from "Data.List" on the list of 'primes'.+ -- | Like 'List.foldl' from "Data.List" on the list of prime 'factors'. foldl :: (a -> m -> a) -> a -> m -> a- -- | Like 'List.foldl'' from "Data.List" on the list of 'primes'.+ -- | Like 'List.foldl'' from "Data.List" on the list of prime 'factors'. foldl' :: (a -> m -> a) -> a -> m -> a- -- | Like 'List.foldr' from "Data.List" on the list of 'primes'.+ -- | Like 'List.foldr' from "Data.List" on the list of prime 'factors'. foldr :: (m -> a -> a) -> a -> m -> a- -- | The 'length' of the list of 'primes'.+ -- | The 'length' of the list of prime 'factors'. length :: m -> Int- -- | Generalizes 'foldMap' from "Data.Foldable", except the function arguments are prime factors rather than the- -- structure elements.+ -- | Generalizes 'Foldable.foldMap' from "Data.Foldable", except the function arguments are prime 'factors' rather+ -- than the structure elements. foldMap :: Monoid n => (m -> n) -> m -> n -- | Equivalent to 'List.reverse' from "Data.List". reverse :: m -> m