Data.Monoid.Lifted

Documentation

class Semigroup1 f where

Laws for this typeclass:

• liftAppend f a (liftAppend f b c) = liftAppend f (liftAppend f a b) c

Minimal complete definition

liftAppend

Methods

liftAppend :: (a -> a -> a) -> f a -> f a -> f a

Instances

Semigroup1 []

Methods

liftAppend :: (a -> a -> a) -> [a] -> [a] -> [a]

Semigroup1 Maybe

Methods

liftAppend :: (a -> a -> a) -> Maybe a -> Maybe a -> Maybe a

Semigroup1 IO

Methods

liftAppend :: (a -> a -> a) -> IO a -> IO a -> IO a

Semigroup1 Identity

Methods

liftAppend :: (a -> a -> a) -> Identity a -> Identity a -> Identity a

Semigroup1 Dual

Methods

liftAppend :: (a -> a -> a) -> Dual a -> Dual a -> Dual a

Semigroup1 ((->) a)

Methods

liftAppend :: (a -> a -> a) -> (a -> a) -> (a -> a) -> a -> a

Semigroup a => Semigroup1 ((,) a)

Methods

liftAppend :: (a -> a -> a) -> (a, a) -> (a, a) -> (a, a)

(Hashable k, Eq k) => Semigroup1 (HashMap k)

Disagrees with Semigroup instance for HashMap

Methods

liftAppend :: (a -> a -> a) -> HashMap k a -> HashMap k a -> HashMap k a

Ord k => Semigroup1 (Map k)

Disagrees with Semigroup instance for Map

Methods

liftAppend :: (a -> a -> a) -> Map k a -> Map k a -> Map k a

Semigroup1 (Proxy *)

Methods

liftAppend :: (a -> a -> a) -> Proxy * a -> Proxy * a -> Proxy * a

(Semigroup1 f, Semigroup1 g) => Semigroup1 (Product * f g)

Methods

liftAppend :: (a -> a -> a) -> Product * f g a -> Product * f g a -> Product * f g a

(Semigroup1 f, Semigroup1 g) => Semigroup1 (Compose * * f g)

Methods

liftAppend :: (a -> a -> a) -> Compose * * f g a -> Compose * * f g a -> Compose * * f g a

class Semigroup1 f => Monoid1 f where

Laws for this typeclass:

• liftAppend f a (liftEmpty mempty) = a

Minimal complete definition

liftEmpty

Methods

liftEmpty :: a -> f a

Instances

Monoid1 []

Methods

liftEmpty :: a -> [a]

Monoid1 IO

Methods

liftEmpty :: a -> IO a

Monoid1 Identity

Methods

liftEmpty :: a -> Identity a

Monoid1 Dual

Methods

liftEmpty :: a -> Dual a

Monoid1 ((->) a)

Methods

liftEmpty :: a -> a -> a

(Semigroup a, Monoid a) => Monoid1 ((,) a)

Methods

liftEmpty :: a -> (a, a)

(Hashable k, Eq k) => Monoid1 (HashMap k)

Methods

liftEmpty :: a -> HashMap k a

Monoid1 (Proxy *)

Methods

liftEmpty :: a -> Proxy * a

(Monoid1 f, Monoid1 g) => Monoid1 (Product * f g)

Methods

liftEmpty :: a -> Product * f g a

(Monoid1 f, Monoid1 g) => Monoid1 (Compose * * f g)

Methods

liftEmpty :: a -> Compose * * f g a

append1 :: (Semigroup1 f, Semigroup a) => f a -> f a -> f a

empty1 :: (Monoid1 f, Monoid a) => f a