Safe Haskell	Trustworthy
Language	Haskell98

Data.Fold.M

Description

Unlike L and R this Comonad is based on a (->) r Comonad for a Monoid r rather than than on the Store r Comonad.

Synopsis

data M a b = M (m -> b) (a -> m) (m -> m -> m) m

Documentation

data M a b #

A foldMap caught in amber. a.k.a. a monoidal reducer

Constructors

M (m -> b) (a -> m) (m -> m -> m) m

Instances

Profunctor M #
Instance details Defined in Data.Fold.M Methods dimap :: (a -> b) -> (c -> d) -> M b c -> M a d # lmap :: (a -> b) -> M b c -> M a c # rmap :: (b -> c) -> M a b -> M a c # (#.) :: Coercible c b => q b c -> M a b -> M a c # (.#) :: Coercible b a => M b c -> q a b -> M a c #
Corepresentable M #
Instance details Defined in Data.Fold.M Associated Types type Corep M :: * -> * # Methods cotabulate :: (Corep M d -> c) -> M d c #
Choice M #
Instance details Defined in Data.Fold.M Methods left' :: M a b -> M (Either a c) (Either b c) # right' :: M a b -> M (Either c a) (Either c b) #
Closed M #
Instance details Defined in Data.Fold.M Methods closed :: M a b -> M (x -> a) (x -> b) #
Costrong M #
Instance details Defined in Data.Fold.M Methods unfirst :: M (a, d) (b, d) -> M a b # unsecond :: M (d, a) (d, b) -> M a b #
Folding M #	efficient `prefix`, efficient `postfix`
Instance details Defined in Data.Fold.M Methods prefix :: Foldable t => t a -> M a b -> M a b # prefixOf :: Fold s a -> s -> M a b -> M a b # postfix :: Foldable t => M a b -> t a -> M a b # postfixOf :: Fold s a -> M a b -> s -> M a b # run :: Foldable t => t a -> M a b -> b # runOf :: Fold s a -> s -> M a b -> b # filtering :: (a -> Bool) -> M a b -> M a b #
Scan M #
Instance details Defined in Data.Fold.M Methods prefix1 :: a -> M a b -> M a b # postfix1 :: M a b -> a -> M a b # run1 :: a -> M a b -> b # interspersing :: a -> M a b -> M a b #
AsRM M #	We can convert from a monoidal fold to a lazy right fold
Instance details Defined in Data.Fold Methods asM :: M a b -> M a b # asR :: M a b -> R a b #
AsRM1 M #
Instance details Defined in Data.Fold Methods asM1 :: M a b -> M1 a b # asR1 :: M a b -> R1 a b #
Cosieve M FreeMonoid #
Instance details Defined in Data.Fold.M Methods cosieve :: M a b -> FreeMonoid a -> b #
Monad (M a) #
Instance details Defined in Data.Fold.M Methods (>>=) :: M a a0 -> (a0 -> M a b) -> M a b # (>>) :: M a a0 -> M a b -> M a b # return :: a0 -> M a a0 # fail :: String -> M a a0 #
Functor (M a) #
Instance details Defined in Data.Fold.M Methods fmap :: (a0 -> b) -> M a a0 -> M a b # (<$) :: a0 -> M a b -> M a a0 #
MonadFix (M a) #
Instance details Defined in Data.Fold.M Methods mfix :: (a0 -> M a a0) -> M a a0 #
Applicative (M a) #
Instance details Defined in Data.Fold.M Methods pure :: a0 -> M a a0 # (<>) :: M a (a0 -> b) -> M a a0 -> M a b # liftA2 :: (a0 -> b -> c) -> M a a0 -> M a b -> M a c # (>) :: M a a0 -> M a b -> M a b # (<*) :: M a a0 -> M a b -> M a a0 #
Distributive (M a) #
Instance details Defined in Data.Fold.M Methods distribute :: Functor f => f (M a a0) -> M a (f a0) # collect :: Functor f => (a0 -> M a b) -> f a0 -> M a (f b) # distributeM :: Monad m => m (M a a0) -> M a (m a0) # collectM :: Monad m => (a0 -> M a b) -> m a0 -> M a (m b) #
Representable (M a) #
Instance details Defined in Data.Fold.M Associated Types type Rep (M a) :: * # Methods tabulate :: (Rep (M a) -> a0) -> M a a0 # index :: M a a0 -> Rep (M a) -> a0 #
MonadZip (M a) #
Instance details Defined in Data.Fold.M Methods mzip :: M a a0 -> M a b -> M a (a0, b) # mzipWith :: (a0 -> b -> c) -> M a a0 -> M a b -> M a c # munzip :: M a (a0, b) -> (M a a0, M a b) #
Comonad (M a) #
Instance details Defined in Data.Fold.M Methods extract :: M a a0 -> a0 # duplicate :: M a a0 -> M a (M a a0) # extend :: (M a a0 -> b) -> M a a0 -> M a b #
ComonadApply (M a) #
Instance details Defined in Data.Fold.M Methods (<@>) :: M a (a0 -> b) -> M a a0 -> M a b # (@>) :: M a a0 -> M a b -> M a b # (<@) :: M a a0 -> M a b -> M a a0 #
Apply (M a) #
Instance details Defined in Data.Fold.M Methods (<.>) :: M a (a0 -> b) -> M a a0 -> M a b # (.>) :: M a a0 -> M a b -> M a b # (<.) :: M a a0 -> M a b -> M a a0 # liftF2 :: (a0 -> b -> c) -> M a a0 -> M a b -> M a c #
Bind (M a) #
Instance details Defined in Data.Fold.M Methods (>>-) :: M a a0 -> (a0 -> M a b) -> M a b # join :: M a (M a a0) -> M a a0 #
Extend (M a) #
Instance details Defined in Data.Fold.M Methods duplicated :: M a a0 -> M a (M a a0) # extended :: (M a a0 -> b) -> M a a0 -> M a b #
MonadReader (FreeMonoid a) (M a) #
Instance details Defined in Data.Fold.M Methods ask :: M a (FreeMonoid a) # local :: (FreeMonoid a -> FreeMonoid a) -> M a a0 -> M a a0 # reader :: (FreeMonoid a -> a0) -> M a a0 #
type Corep M #
Instance details Defined in Data.Fold.M type Corep M = FreeMonoid
type Rep (M a) #
Instance details Defined in Data.Fold.M type Rep (M a) = FreeMonoid a