Safe Haskell	Safe
Language	Haskell2010

Data.Monoid.Lifted

Synopsis

class Semigroup1 f where
class Semigroup1 f => Monoid1 f where
append1 :: (Semigroup1 f, Semigroup a) => f a -> f a -> f a
empty1 :: (Monoid1 f, Monoid a) => f a

Documentation

class Semigroup1 f where Source #

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 Source #

Instances

Semigroup1 [] Source #
Instance details Defined in Data.Monoid.Lifted Methods liftAppend :: (a -> a -> a) -> [a] -> [a] -> [a] Source #
Semigroup1 Maybe Source #
Instance details Defined in Data.Monoid.Lifted Methods liftAppend :: (a -> a -> a) -> Maybe a -> Maybe a -> Maybe a Source #
Semigroup1 IO Source #
Instance details Defined in Data.Monoid.Lifted Methods liftAppend :: (a -> a -> a) -> IO a -> IO a -> IO a Source #
Semigroup1 Identity Source #
Instance details Defined in Data.Monoid.Lifted Methods liftAppend :: (a -> a -> a) -> Identity a -> Identity a -> Identity a Source #
Semigroup1 Dual Source #
Instance details Defined in Data.Monoid.Lifted Methods liftAppend :: (a -> a -> a) -> Dual a -> Dual a -> Dual a Source #
Semigroup a => Semigroup1 ((,) a) Source #
Instance details Defined in Data.Monoid.Lifted Methods liftAppend :: (a0 -> a0 -> a0) -> (a, a0) -> (a, a0) -> (a, a0) Source #
(Hashable k, Eq k) => Semigroup1 (HashMap k) Source #	Disagrees with `Semigroup` instance for `HashMap`
Instance details Defined in Data.Monoid.Lifted Methods liftAppend :: (a -> a -> a) -> HashMap k a -> HashMap k a -> HashMap k a Source #
Ord k => Semigroup1 (Map k) Source #	Disagrees with `Semigroup` instance for `Map`
Instance details Defined in Data.Monoid.Lifted Methods liftAppend :: (a -> a -> a) -> Map k a -> Map k a -> Map k a Source #
Semigroup1 (Proxy :: * -> *) Source #
Instance details Defined in Data.Monoid.Lifted Methods liftAppend :: (a -> a -> a) -> Proxy a -> Proxy a -> Proxy a Source #
Semigroup a => Semigroup1 (Const a :: * -> *) Source #
Instance details Defined in Data.Monoid.Lifted Methods liftAppend :: (a0 -> a0 -> a0) -> Const a a0 -> Const a a0 -> Const a a0 Source #
Semigroup1 f => Semigroup1 (ApplyLifted f) Source #
Instance details Defined in Data.Exists Methods liftAppend :: (a -> a -> a) -> ApplyLifted f a -> ApplyLifted f a -> ApplyLifted f a Source #
Semigroup1 ((->) a :: * -> *) Source #
Instance details Defined in Data.Monoid.Lifted Methods liftAppend :: (a0 -> a0 -> a0) -> (a -> a0) -> (a -> a0) -> a -> a0 Source #
(Semigroup1 f, Semigroup1 g) => Semigroup1 (Product f g) Source #
Instance details Defined in Data.Monoid.Lifted Methods liftAppend :: (a -> a -> a) -> Product f g a -> Product f g a -> Product f g a Source #
(Semigroup1 f, Semigroup1 g) => Semigroup1 (Compose f g) Source #
Instance details Defined in Data.Monoid.Lifted Methods liftAppend :: (a -> a -> a) -> Compose f g a -> Compose f g a -> Compose f g a Source #

class Semigroup1 f => Monoid1 f where Source #

Laws for this typeclass:

```
liftAppend f a (liftEmpty mempty) = a
```

Minimal complete definition

liftEmpty

Methods

liftEmpty :: a -> f a Source #

Instances

Monoid1 [] Source #
Instance details Defined in Data.Monoid.Lifted Methods liftEmpty :: a -> [a] Source #
Monoid1 IO Source #
Instance details Defined in Data.Monoid.Lifted Methods liftEmpty :: a -> IO a Source #
Monoid1 Identity Source #
Instance details Defined in Data.Monoid.Lifted Methods liftEmpty :: a -> Identity a Source #
Monoid1 Dual Source #
Instance details Defined in Data.Monoid.Lifted Methods liftEmpty :: a -> Dual a Source #
(Semigroup a, Monoid a) => Monoid1 ((,) a) Source #
Instance details Defined in Data.Monoid.Lifted Methods liftEmpty :: a0 -> (a, a0) Source #
(Hashable k, Eq k) => Monoid1 (HashMap k) Source #
Instance details Defined in Data.Monoid.Lifted Methods liftEmpty :: a -> HashMap k a Source #
Ord k => Monoid1 (Map k) Source #
Instance details Defined in Data.Monoid.Lifted Methods liftEmpty :: a -> Map k a Source #
Monoid1 (Proxy :: * -> *) Source #
Instance details Defined in Data.Monoid.Lifted Methods liftEmpty :: a -> Proxy a Source #
Monoid1 f => Monoid1 (ApplyLifted f) Source #
Instance details Defined in Data.Exists Methods liftEmpty :: a -> ApplyLifted f a Source #
Monoid1 ((->) a :: * -> *) Source #
Instance details Defined in Data.Monoid.Lifted Methods liftEmpty :: a0 -> a -> a0 Source #
(Monoid1 f, Monoid1 g) => Monoid1 (Product f g) Source #
Instance details Defined in Data.Monoid.Lifted Methods liftEmpty :: a -> Product f g a Source #
(Monoid1 f, Monoid1 g) => Monoid1 (Compose f g) Source #
Instance details Defined in Data.Monoid.Lifted Methods liftEmpty :: a -> Compose f g a Source #

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

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