monoids 0.2.0.2 → 0.2.0.3
raw patch · 1 files changed
+5/−5 lines, 1 filesdep ~arraydep ~containersdep ~parallelnew-uploaderPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: array, containers, parallel, text
API changes (from Hackage documentation)
- Data.Generator: instance (Ix i) => Generator (Array i e)
- Data.Generator: instance (Ix i) => Generator (Keys (Array i e))
- Data.Generator: instance (Ix i) => Generator (Values (Array i e))
- Data.Generator: instance (Measured v e) => Generator (FingerTree v e)
- Data.Group: instance (Fractional a) => Group (Product a)
- Data.Group: instance (Group a) => Group (Dual a)
- Data.Group: instance (Group a) => Group (Self a)
- Data.Group: instance (Group g) => MultiplicativeGroup (Exp g)
- Data.Group: instance (MultiplicativeGroup a) => MultiplicativeGroup (Dual a)
- Data.Group: instance (MultiplicativeGroup g) => Group (Log g)
- Data.Group: instance (MultiplicativeGroup g) => MultiplicativeGroup (Self g)
- Data.Group: instance (Num a) => Group (Sum a)
- Data.Monoid.Applicative: instance (Alternative f) => Alternative (Alt f)
- Data.Monoid.Applicative: instance (Alternative f) => Alternative (App f)
- Data.Monoid.Applicative: instance (Alternative f) => Monoid (Alt f a)
- Data.Monoid.Applicative: instance (Alternative f) => Reducer (f a) (Alt f a)
- Data.Monoid.Applicative: instance (Applicative f) => Applicative (Alt f)
- Data.Monoid.Applicative: instance (Applicative f) => Applicative (App f)
- Data.Monoid.Applicative: instance (Applicative f) => Monoid (Traversal f)
- Data.Monoid.Applicative: instance (Applicative f) => Reducer (f a) (Traversal f)
- Data.Monoid.Applicative: instance (Eq (f a)) => Eq (Alt f a)
- Data.Monoid.Applicative: instance (Eq (f m)) => Eq (App f m)
- Data.Monoid.Applicative: instance (Functor f) => Functor (Alt f)
- Data.Monoid.Applicative: instance (Functor f) => Functor (App f)
- Data.Monoid.Applicative: instance (Ord (f a)) => Ord (Alt f a)
- Data.Monoid.Applicative: instance (Ord (f m)) => Ord (App f m)
- Data.Monoid.Applicative: instance (Read (f a)) => Read (Alt f a)
- Data.Monoid.Applicative: instance (Read (f m)) => Read (App f m)
- Data.Monoid.Applicative: instance (Show (f a)) => Show (Alt f a)
- Data.Monoid.Applicative: instance (Show (f m)) => Show (App f m)
- Data.Monoid.Monad: instance (Eq (f m)) => Eq (Mon f m)
- Data.Monoid.Monad: instance (Eq (m a)) => Eq (MonadSum m a)
- Data.Monoid.Monad: instance (Functor f) => Functor (Mon f)
- Data.Monoid.Monad: instance (Monad f) => Monad (Mon f)
- Data.Monoid.Monad: instance (Monad m) => Applicative (MonadSum m)
- Data.Monoid.Monad: instance (Monad m) => Functor (MonadSum m)
- Data.Monoid.Monad: instance (Monad m) => Monad (MonadSum m)
- Data.Monoid.Monad: instance (Monad m) => Monoid (Action m)
- Data.Monoid.Monad: instance (Monad m) => Reducer (m a) (Action m)
- Data.Monoid.Monad: instance (MonadPlus f) => MonadPlus (Mon f)
- Data.Monoid.Monad: instance (MonadPlus m) => MonadPlus (MonadSum m)
- Data.Monoid.Monad: instance (MonadPlus m) => Monoid (MonadSum m a)
- Data.Monoid.Monad: instance (MonadPlus m) => Reducer (m a) (MonadSum m a)
- Data.Monoid.Monad: instance (Ord (f m)) => Ord (Mon f m)
- Data.Monoid.Monad: instance (Ord (m a)) => Ord (MonadSum m a)
- Data.Monoid.Monad: instance (Read (f m)) => Read (Mon f m)
- Data.Monoid.Monad: instance (Read (m a)) => Read (MonadSum m a)
- Data.Monoid.Monad: instance (Show (f m)) => Show (Mon f m)
- Data.Monoid.Monad: instance (Show (m a)) => Show (MonadSum m a)
- Data.Monoid.Multiplicative: instance (Integral m) => Multiplicative (Ratio m)
- Data.Monoid.Multiplicative: instance (Monoid m) => Multiplicative (Const m a)
- Data.Monoid.Multiplicative: instance (Monoid m) => Multiplicative (Exp m)
- Data.Monoid.Multiplicative: instance (Monoid m) => Multiplicative (Maybe m)
- Data.Monoid.Multiplicative: instance (Monoid m) => Multiplicative (Seq m)
- Data.Monoid.Multiplicative: instance (Monoid m) => Multiplicative [m]
- Data.Monoid.Multiplicative: instance (Monoid n) => Multiplicative (IO n)
- Data.Monoid.Multiplicative: instance (Monoid n) => Multiplicative (ZipList n)
- Data.Monoid.Multiplicative: instance (Multiplicative m) => Monoid (Log m)
- Data.Monoid.Multiplicative: instance (Multiplicative m) => Multiplicative (Dual m)
- Data.Monoid.Multiplicative: instance (Multiplicative m) => Multiplicative (Self m)
- Data.Monoid.Ord: instance (Bounded a) => Bounded (Max a)
- Data.Monoid.Ord: instance (Bounded a) => Bounded (Min a)
- Data.Monoid.Ord: instance (Eq a) => Eq (Max a)
- Data.Monoid.Ord: instance (Eq a) => Eq (MaxPriority a)
- Data.Monoid.Ord: instance (Eq a) => Eq (Min a)
- Data.Monoid.Ord: instance (Eq a) => Eq (MinPriority a)
- Data.Monoid.Ord: instance (Ord a) => Monoid (MaxPriority a)
- Data.Monoid.Ord: instance (Ord a) => Monoid (MinPriority a)
- Data.Monoid.Ord: instance (Ord a) => Ord (Max a)
- Data.Monoid.Ord: instance (Ord a) => Ord (MaxPriority a)
- Data.Monoid.Ord: instance (Ord a) => Ord (Min a)
- Data.Monoid.Ord: instance (Ord a) => Ord (MinPriority a)
- Data.Monoid.Ord: instance (Ord a) => Reducer (Maybe a) (MaxPriority a)
- Data.Monoid.Ord: instance (Ord a) => Reducer (Maybe a) (MinPriority a)
- Data.Monoid.Ord: instance (Read a) => Read (Max a)
- Data.Monoid.Ord: instance (Read a) => Read (MaxPriority a)
- Data.Monoid.Ord: instance (Read a) => Read (Min a)
- Data.Monoid.Ord: instance (Read a) => Read (MinPriority a)
- Data.Monoid.Ord: instance (Show a) => Show (Max a)
- Data.Monoid.Ord: instance (Show a) => Show (MaxPriority a)
- Data.Monoid.Ord: instance (Show a) => Show (Min a)
- Data.Monoid.Ord: instance (Show a) => Show (MinPriority a)
- Data.Monoid.Reducer: instance (Monoid a) => Reducer a (Dual a)
- Data.Monoid.Reducer: instance (Num a) => Reducer a (Product a)
- Data.Monoid.Reducer: instance (Num a) => Reducer a (Sum a)
- Data.Monoid.Self: instance (Monoid m) => Monoid (Self m)
- Data.Monoid.Self: instance (Monoid m) => Reducer m (Self m)
- Data.Monoid.Union: instance (Eq (f m)) => Eq (UnionWith f m)
- Data.Monoid.Union: instance (Eq a) => HasUnion [a]
- Data.Monoid.Union: instance (Eq f) => Eq (Union f)
- Data.Monoid.Union: instance (Functor f) => Functor (UnionWith f)
- Data.Monoid.Union: instance (HasUnion f) => Monoid (Union f)
- Data.Monoid.Union: instance (HasUnion f) => Reducer f (Union f)
- Data.Monoid.Union: instance (Monad f) => Monad (UnionWith f)
- Data.Monoid.Union: instance (Ord (f m)) => Ord (UnionWith f m)
- Data.Monoid.Union: instance (Ord a) => HasUnion (Set a)
- Data.Monoid.Union: instance (Ord f) => Ord (Union f)
- Data.Monoid.Union: instance (Ord k) => HasUnion (Map k a)
- Data.Monoid.Union: instance (Ord k) => HasUnionWith (Map k)
- Data.Monoid.Union: instance (Read (f m)) => Read (UnionWith f m)
- Data.Monoid.Union: instance (Read f) => Read (Union f)
- Data.Monoid.Union: instance (Show (f m)) => Show (UnionWith f m)
- Data.Monoid.Union: instance (Show f) => Show (Union f)
+ Data.Generator: instance Ix i => Generator (Array i e)
+ Data.Generator: instance Ix i => Generator (Keys (Array i e))
+ Data.Generator: instance Ix i => Generator (Values (Array i e))
+ Data.Generator: instance Measured v e => Generator (FingerTree v e)
+ Data.Group: instance Fractional a => Group (Product a)
+ Data.Group: instance Group a => Group (Dual a)
+ Data.Group: instance Group a => Group (Self a)
+ Data.Group: instance Group g => MultiplicativeGroup (Exp g)
+ Data.Group: instance MultiplicativeGroup a => MultiplicativeGroup (Dual a)
+ Data.Group: instance MultiplicativeGroup g => Group (Log g)
+ Data.Group: instance MultiplicativeGroup g => MultiplicativeGroup (Self g)
+ Data.Group: instance Num a => Group (Sum a)
+ Data.Monoid.Applicative: instance Alternative f => Alternative (Alt f)
+ Data.Monoid.Applicative: instance Alternative f => Alternative (App f)
+ Data.Monoid.Applicative: instance Alternative f => Monoid (Alt f a)
+ Data.Monoid.Applicative: instance Alternative f => Reducer (f a) (Alt f a)
+ Data.Monoid.Applicative: instance Applicative f => Applicative (Alt f)
+ Data.Monoid.Applicative: instance Applicative f => Applicative (App f)
+ Data.Monoid.Applicative: instance Applicative f => Monoid (Traversal f)
+ Data.Monoid.Applicative: instance Applicative f => Reducer (f a) (Traversal f)
+ Data.Monoid.Applicative: instance Eq (f a) => Eq (Alt f a)
+ Data.Monoid.Applicative: instance Eq (f m) => Eq (App f m)
+ Data.Monoid.Applicative: instance Functor f => Functor (Alt f)
+ Data.Monoid.Applicative: instance Functor f => Functor (App f)
+ Data.Monoid.Applicative: instance Ord (f a) => Ord (Alt f a)
+ Data.Monoid.Applicative: instance Ord (f m) => Ord (App f m)
+ Data.Monoid.Applicative: instance Read (f a) => Read (Alt f a)
+ Data.Monoid.Applicative: instance Read (f m) => Read (App f m)
+ Data.Monoid.Applicative: instance Show (f a) => Show (Alt f a)
+ Data.Monoid.Applicative: instance Show (f m) => Show (App f m)
+ Data.Monoid.Monad: instance Eq (f m) => Eq (Mon f m)
+ Data.Monoid.Monad: instance Eq (m a) => Eq (MonadSum m a)
+ Data.Monoid.Monad: instance Functor f => Functor (Mon f)
+ Data.Monoid.Monad: instance Monad f => Monad (Mon f)
+ Data.Monoid.Monad: instance Monad m => Applicative (MonadSum m)
+ Data.Monoid.Monad: instance Monad m => Functor (MonadSum m)
+ Data.Monoid.Monad: instance Monad m => Monad (MonadSum m)
+ Data.Monoid.Monad: instance Monad m => Monoid (Action m)
+ Data.Monoid.Monad: instance Monad m => Reducer (m a) (Action m)
+ Data.Monoid.Monad: instance MonadPlus f => MonadPlus (Mon f)
+ Data.Monoid.Monad: instance MonadPlus m => MonadPlus (MonadSum m)
+ Data.Monoid.Monad: instance MonadPlus m => Monoid (MonadSum m a)
+ Data.Monoid.Monad: instance MonadPlus m => Reducer (m a) (MonadSum m a)
+ Data.Monoid.Monad: instance Ord (f m) => Ord (Mon f m)
+ Data.Monoid.Monad: instance Ord (m a) => Ord (MonadSum m a)
+ Data.Monoid.Monad: instance Read (f m) => Read (Mon f m)
+ Data.Monoid.Monad: instance Read (m a) => Read (MonadSum m a)
+ Data.Monoid.Monad: instance Show (f m) => Show (Mon f m)
+ Data.Monoid.Monad: instance Show (m a) => Show (MonadSum m a)
+ Data.Monoid.Multiplicative: instance Integral m => Multiplicative (Ratio m)
+ Data.Monoid.Multiplicative: instance Monoid m => Multiplicative (Const m a)
+ Data.Monoid.Multiplicative: instance Monoid m => Multiplicative (Exp m)
+ Data.Monoid.Multiplicative: instance Monoid m => Multiplicative (Maybe m)
+ Data.Monoid.Multiplicative: instance Monoid m => Multiplicative (Seq m)
+ Data.Monoid.Multiplicative: instance Monoid m => Multiplicative [m]
+ Data.Monoid.Multiplicative: instance Monoid n => Multiplicative (IO n)
+ Data.Monoid.Multiplicative: instance Monoid n => Multiplicative (ZipList n)
+ Data.Monoid.Multiplicative: instance Multiplicative m => Monoid (Log m)
+ Data.Monoid.Multiplicative: instance Multiplicative m => Multiplicative (Dual m)
+ Data.Monoid.Multiplicative: instance Multiplicative m => Multiplicative (Self m)
+ Data.Monoid.Ord: instance Bounded a => Bounded (Max a)
+ Data.Monoid.Ord: instance Bounded a => Bounded (Min a)
+ Data.Monoid.Ord: instance Eq a => Eq (Max a)
+ Data.Monoid.Ord: instance Eq a => Eq (MaxPriority a)
+ Data.Monoid.Ord: instance Eq a => Eq (Min a)
+ Data.Monoid.Ord: instance Eq a => Eq (MinPriority a)
+ Data.Monoid.Ord: instance Ord a => Monoid (MaxPriority a)
+ Data.Monoid.Ord: instance Ord a => Monoid (MinPriority a)
+ Data.Monoid.Ord: instance Ord a => Ord (Max a)
+ Data.Monoid.Ord: instance Ord a => Ord (MaxPriority a)
+ Data.Monoid.Ord: instance Ord a => Ord (Min a)
+ Data.Monoid.Ord: instance Ord a => Ord (MinPriority a)
+ Data.Monoid.Ord: instance Ord a => Reducer (Maybe a) (MaxPriority a)
+ Data.Monoid.Ord: instance Ord a => Reducer (Maybe a) (MinPriority a)
+ Data.Monoid.Ord: instance Read a => Read (Max a)
+ Data.Monoid.Ord: instance Read a => Read (MaxPriority a)
+ Data.Monoid.Ord: instance Read a => Read (Min a)
+ Data.Monoid.Ord: instance Read a => Read (MinPriority a)
+ Data.Monoid.Ord: instance Show a => Show (Max a)
+ Data.Monoid.Ord: instance Show a => Show (MaxPriority a)
+ Data.Monoid.Ord: instance Show a => Show (Min a)
+ Data.Monoid.Ord: instance Show a => Show (MinPriority a)
+ Data.Monoid.Reducer: instance Monoid a => Reducer a (Dual a)
+ Data.Monoid.Reducer: instance Num a => Reducer a (Product a)
+ Data.Monoid.Reducer: instance Num a => Reducer a (Sum a)
+ Data.Monoid.Self: instance Monoid m => Monoid (Self m)
+ Data.Monoid.Self: instance Monoid m => Reducer m (Self m)
+ Data.Monoid.Union: instance Eq (f m) => Eq (UnionWith f m)
+ Data.Monoid.Union: instance Eq a => HasUnion [a]
+ Data.Monoid.Union: instance Eq f => Eq (Union f)
+ Data.Monoid.Union: instance Functor f => Functor (UnionWith f)
+ Data.Monoid.Union: instance HasUnion f => Monoid (Union f)
+ Data.Monoid.Union: instance HasUnion f => Reducer f (Union f)
+ Data.Monoid.Union: instance Monad f => Monad (UnionWith f)
+ Data.Monoid.Union: instance Ord (f m) => Ord (UnionWith f m)
+ Data.Monoid.Union: instance Ord a => HasUnion (Set a)
+ Data.Monoid.Union: instance Ord f => Ord (Union f)
+ Data.Monoid.Union: instance Ord k => HasUnion (Map k a)
+ Data.Monoid.Union: instance Ord k => HasUnionWith (Map k)
+ Data.Monoid.Union: instance Read (f m) => Read (UnionWith f m)
+ Data.Monoid.Union: instance Read f => Read (Union f)
+ Data.Monoid.Union: instance Show (f m) => Show (UnionWith f m)
+ Data.Monoid.Union: instance Show f => Show (Union f)
- Data.Generator: class Generator c where { type family Elem c :: *; { mapFrom f = mappend . mapReduce f mapTo f m = mappend m . mapReduce f mapReduce f = mapTo f mempty } }
+ Data.Generator: class Generator c where { type family Elem c :: *; { mapReduce f = mapTo f mempty mapTo f m = mappend m . mapReduce f mapFrom f = mappend . mapReduce f } }
- Data.Generator.Combinators: all :: (Generator c) => (Elem c -> Bool) -> c -> Bool
+ Data.Generator.Combinators: all :: Generator c => (Elem c -> Bool) -> c -> Bool
- Data.Generator.Combinators: any :: (Generator c) => (Elem c -> Bool) -> c -> Bool
+ Data.Generator.Combinators: any :: Generator c => (Elem c -> Bool) -> c -> Bool
- Data.Generator.Combinators: concatMap :: (Generator c) => (Elem c -> [b]) -> c -> [b]
+ Data.Generator.Combinators: concatMap :: Generator c => (Elem c -> [b]) -> c -> [b]
- Data.Generator.Combinators: find :: (Generator c) => (Elem c -> Bool) -> c -> Maybe (Elem c)
+ Data.Generator.Combinators: find :: Generator c => (Elem c -> Bool) -> c -> Maybe (Elem c)
- Data.Generator.Combinators: toList :: (Generator c) => c -> [Elem c]
+ Data.Generator.Combinators: toList :: Generator c => c -> [Elem c]
- Data.Group: class (Monoid a) => Group a
+ Data.Group: class Monoid a => Group a
- Data.Group: class (Multiplicative g) => MultiplicativeGroup g
+ Data.Group: class Multiplicative g => MultiplicativeGroup g
- Data.Group: gnegate :: (Group a) => a -> a
+ Data.Group: gnegate :: Group a => a -> a
- Data.Group: grecip :: (MultiplicativeGroup g) => g -> g
+ Data.Group: grecip :: MultiplicativeGroup g => g -> g
- Data.Group: gsubtract :: (Group a) => a -> a -> a
+ Data.Group: gsubtract :: Group a => a -> a -> a
- Data.Group: minus :: (Group a) => a -> a -> a
+ Data.Group: minus :: Group a => a -> a -> a
- Data.Group: over :: (MultiplicativeGroup g) => g -> g -> g
+ Data.Group: over :: MultiplicativeGroup g => g -> g -> g
- Data.Group: under :: (MultiplicativeGroup g) => g -> g -> g
+ Data.Group: under :: MultiplicativeGroup g => g -> g -> g
- Data.Group.Sugar: (-) :: (Group g) => g -> g -> g
+ Data.Group.Sugar: (-) :: Group g => g -> g -> g
- Data.Group.Sugar: (.\.) :: (MultiplicativeGroup g) => g -> g -> g
+ Data.Group.Sugar: (.\.) :: MultiplicativeGroup g => g -> g -> g
- Data.Group.Sugar: (/) :: (MultiplicativeGroup g) => g -> g -> g
+ Data.Group.Sugar: (/) :: MultiplicativeGroup g => g -> g -> g
- Data.Group.Sugar: (^^) :: (MultiplicativeGroup g) => g -> Integer -> g
+ Data.Group.Sugar: (^^) :: MultiplicativeGroup g => g -> Integer -> g
- Data.Group.Sugar: negate :: (Group g) => g -> g
+ Data.Group.Sugar: negate :: Group g => g -> g
- Data.Group.Sugar: recip :: (MultiplicativeGroup g) => g -> g
+ Data.Group.Sugar: recip :: MultiplicativeGroup g => g -> g
- Data.Group.Sugar: subtract :: (Group g) => g -> g -> g
+ Data.Group.Sugar: subtract :: Group g => g -> g -> g
- Data.Monoid.Additive: plus :: (Monoid m) => m -> m -> m
+ Data.Monoid.Additive: plus :: Monoid m => m -> m -> m
- Data.Monoid.Additive: zero :: (Monoid m) => m
+ Data.Monoid.Additive: zero :: Monoid m => m
- Data.Monoid.Applicative: snocTraversal :: (Reducer (f ()) (Traversal f)) => Traversal f -> f () -> Traversal f
+ Data.Monoid.Applicative: snocTraversal :: Reducer (f ()) (Traversal f) => Traversal f -> f () -> Traversal f
- Data.Monoid.Combinators: cycle :: (Monoid m) => m -> m
+ Data.Monoid.Combinators: cycle :: Monoid m => m -> m
- Data.Monoid.Combinators: repeat :: (Reducer e m) => e -> m
+ Data.Monoid.Combinators: repeat :: Reducer e m => e -> m
- Data.Monoid.Monad: snocAction :: (Reducer (m ()) (Action m)) => Action m -> m () -> Action m
+ Data.Monoid.Monad: snocAction :: Reducer (m ()) (Action m) => Action m -> m () -> Action m
- Data.Monoid.Multiplicative: one :: (Multiplicative m) => m
+ Data.Monoid.Multiplicative: one :: Multiplicative m => m
- Data.Monoid.Multiplicative: times :: (Multiplicative m) => m -> m -> m
+ Data.Monoid.Multiplicative: times :: Multiplicative m => m -> m -> m
- Data.Monoid.Reducer: class (Monoid m) => Reducer c m
+ Data.Monoid.Reducer: class Monoid m => Reducer c m
- Data.Monoid.Reducer: cons :: (Reducer c m) => c -> m -> m
+ Data.Monoid.Reducer: cons :: Reducer c m => c -> m -> m
- Data.Monoid.Reducer: snoc :: (Reducer c m) => m -> c -> m
+ Data.Monoid.Reducer: snoc :: Reducer c m => m -> c -> m
- Data.Monoid.Reducer: unit :: (Reducer c m) => c -> m
+ Data.Monoid.Reducer: unit :: Reducer c m => c -> m
- Data.Monoid.Sugar: (*) :: (Multiplicative r) => r -> r -> r
+ Data.Monoid.Sugar: (*) :: Multiplicative r => r -> r -> r
- Data.Monoid.Sugar: (+) :: (Monoid m) => m -> m -> m
+ Data.Monoid.Sugar: (+) :: Monoid m => m -> m -> m
- Data.Monoid.Union: class (Functor f) => HasUnionWith f
+ Data.Monoid.Union: class Functor f => HasUnionWith f
- Data.Monoid.Union: empty :: (HasUnion f) => f
+ Data.Monoid.Union: empty :: HasUnion f => f
- Data.Monoid.Union: emptyWith :: (HasUnionWith f) => f a
+ Data.Monoid.Union: emptyWith :: HasUnionWith f => f a
- Data.Monoid.Union: union :: (HasUnion f) => f -> f -> f
+ Data.Monoid.Union: union :: HasUnion f => f -> f -> f
- Data.Monoid.Union: unionWith :: (HasUnionWith f) => (a -> a -> a) -> f a -> f a -> f a
+ Data.Monoid.Union: unionWith :: HasUnionWith f => (a -> a -> a) -> f a -> f a -> f a
Files
- monoids.cabal +5/−5
monoids.cabal view
@@ -1,5 +1,5 @@ name: monoids-version: 0.2.0.2+version: 0.2.0.3 license: BSD3 license-file: LICENSE author: Edward A. Kmett@@ -20,12 +20,12 @@ library build-depends: base >= 4 && < 5,- array >= 0.2 && < 0.3,- containers >= 0.2 && < 0.3,+ array >= 0.2 && < 0.4,+ containers >= 0.2 && < 0.5, bytestring >= 0.9 && < 1.0, fingertree >= 0.0.1 && < 0.2,- text >= 0.1 && < 0.5,- parallel >= 1.1 && < 1.2+ text >= 0.1 && < 0.12,+ parallel >= 1.1 && < 3.2 exposed-modules: Data.Generator