Copyright	(c) Justin Le 2018
License	BSD-3
Maintainer	justin@jle.im
Stability	unstable
Portability	portable
Safe Haskell	None
Language	Haskell2010

Data.Monoid.OneLiner

Contents

Newtype wrapper
Generics-derived methods
- Semigroup
- Monoid

Description

Derived methods for Semigroup and Monoid, using Generics.OneLiner and GHC.Generics.

Can be used for any types (deriving Generic) made with a single constructor, where every field is an instance of Semigroup (or Monoid, depending on the function).

Also includes a newtype wrapper that imbues any such data type with instant Semigroup and Monoid instances, which can one day be used with DerivingVia syntax to derive instances automatically.

Synopsis

Newtype wrapper

newtype GMonoid a #

If a is a data type with a single constructor whose fields are all instances of Semigroup, then GMonoid a has a Semigroup instance.

If a is a data type with a single constructor whose fields are all instances of Monoid, then GMonoid a has a Monoid instance.

Will one day be able to be used with DerivingVia syntax, to derive instances automatically.

Constructors

GMonoid
Fields getGMonoid :: a

Instances

Functor GMonoid #
Methods fmap :: (a -> b) -> GMonoid a -> GMonoid b # (<$) :: a -> GMonoid b -> GMonoid a #
Foldable GMonoid #
Methods fold :: Monoid m => GMonoid m -> m # foldMap :: Monoid m => (a -> m) -> GMonoid a -> m # foldr :: (a -> b -> b) -> b -> GMonoid a -> b # foldr' :: (a -> b -> b) -> b -> GMonoid a -> b # foldl :: (b -> a -> b) -> b -> GMonoid a -> b # foldl' :: (b -> a -> b) -> b -> GMonoid a -> b # foldr1 :: (a -> a -> a) -> GMonoid a -> a # foldl1 :: (a -> a -> a) -> GMonoid a -> a # toList :: GMonoid a -> [a] # null :: GMonoid a -> Bool # length :: GMonoid a -> Int # elem :: Eq a => a -> GMonoid a -> Bool # maximum :: Ord a => GMonoid a -> a # minimum :: Ord a => GMonoid a -> a # sum :: Num a => GMonoid a -> a # product :: Num a => GMonoid a -> a #
Traversable GMonoid #
Methods traverse :: Applicative f => (a -> f b) -> GMonoid a -> f (GMonoid b) # sequenceA :: Applicative f => GMonoid (f a) -> f (GMonoid a) # mapM :: Monad m => (a -> m b) -> GMonoid a -> m (GMonoid b) # sequence :: Monad m => GMonoid (m a) -> m (GMonoid a) #
Eq a => Eq (GMonoid a) #
Methods (==) :: GMonoid a -> GMonoid a -> Bool # (/=) :: GMonoid a -> GMonoid a -> Bool #
Data a => Data (GMonoid a) #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GMonoid a -> c (GMonoid a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (GMonoid a) # toConstr :: GMonoid a -> Constr # dataTypeOf :: GMonoid a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (GMonoid a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (GMonoid a)) # gmapT :: (forall b. Data b => b -> b) -> GMonoid a -> GMonoid a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GMonoid a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GMonoid a -> r # gmapQ :: (forall d. Data d => d -> u) -> GMonoid a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> GMonoid a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> GMonoid a -> m (GMonoid a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GMonoid a -> m (GMonoid a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GMonoid a -> m (GMonoid a) #
Ord a => Ord (GMonoid a) #
Methods compare :: GMonoid a -> GMonoid a -> Ordering # (<) :: GMonoid a -> GMonoid a -> Bool # (<=) :: GMonoid a -> GMonoid a -> Bool # (>) :: GMonoid a -> GMonoid a -> Bool # (>=) :: GMonoid a -> GMonoid a -> Bool # max :: GMonoid a -> GMonoid a -> GMonoid a # min :: GMonoid a -> GMonoid a -> GMonoid a #
Read a => Read (GMonoid a) #
Methods readsPrec :: Int -> ReadS (GMonoid a) # readList :: ReadS [GMonoid a] # readPrec :: ReadPrec (GMonoid a) # readListPrec :: ReadPrec [GMonoid a] #
Show a => Show (GMonoid a) #
Methods showsPrec :: Int -> GMonoid a -> ShowS # show :: GMonoid a -> String # showList :: [GMonoid a] -> ShowS #
Generic (GMonoid a) #
Associated Types type Rep (GMonoid a) :: * -> * # Methods from :: GMonoid a -> Rep (GMonoid a) x # to :: Rep (GMonoid a) x -> GMonoid a #
(ADTRecord a, Constraints a Semigroup) => Semigroup (GMonoid a) #
Methods (<>) :: GMonoid a -> GMonoid a -> GMonoid a # sconcat :: NonEmpty (GMonoid a) -> GMonoid a # stimes :: Integral b => b -> GMonoid a -> GMonoid a #
(ADTRecord a, Constraints a Semigroup, Constraints a Monoid) => Monoid (GMonoid a) #
Methods mempty :: GMonoid a # mappend :: GMonoid a -> GMonoid a -> GMonoid a # mconcat :: [GMonoid a] -> GMonoid a #
type Rep (GMonoid a) #
type Rep (GMonoid a) = D1 * (MetaData "GMonoid" "Data.Monoid.OneLiner" "one-liner-instances-0.1.2.1-3SuKe5oF2B0EZMEx3jza8s" True) (C1 * (MetaCons "GMonoid" PrefixI True) (S1 * (MetaSel (Just Symbol "getGMonoid") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)))

Generics-derived methods

Semigroup

gSemigroup :: forall a. (ADTRecord a, Constraints a Semigroup) => a -> a -> a #

Semigroup append (<>) implemented by calling <> on the components.

Monoid

gMappend :: forall a. (ADTRecord a, Constraints a Monoid) => a -> a -> a #

Monoid append (mappend) implemented by calling <> on the components.

gMempty :: forall a. (ADTRecord a, Constraints a Monoid) => a #

Monoid identity (mempty) implemented by using mempty for all of the components.