Data.Fold.M

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

Documentation

data M a b

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

Constructors

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

Instances

Corepresentable M

Associated Types

type Corep (M :: * -> * -> *) :: * -> *

Methods

cotabulate :: (Corep M d -> c) -> M d c

Profunctor 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 => (b -> c) -> M a b -> M a c

(.#) :: Coercible * b a => M b c -> (a -> b) -> M a c

Choice 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

Methods

closed :: M a b -> M (x -> a) (x -> b)

Costrong 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

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

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

Methods

asM :: M a b -> M a b

asR :: M a b -> R a b

AsRM1 M

Methods

asM1 :: M a b -> M1 a b

asR1 :: M a b -> R1 a b

Cosieve M FreeMonoid

Methods

cosieve :: M a b -> FreeMonoid a -> b

Monad (M a)

Methods

(>>=) :: M a b -> (b -> M a c) -> M a c

(>>) :: M a b -> M a c -> M a c

return :: b -> M a b

fail :: String -> M a b

Functor (M a)

Methods

fmap :: (b -> c) -> M a b -> M a c

(<$) :: b -> M a c -> M a b

MonadFix (M a)

Methods

mfix :: (b -> M a b) -> M a b

Applicative (M a)

Methods

pure :: b -> M a b

(<*>) :: M a (b -> c) -> M a b -> M a c

(*>) :: M a b -> M a c -> M a c

(<*) :: M a b -> M a c -> M a b

Distributive (M a)

Methods

distribute :: Functor f => f (M a b) -> M a (f b)

collect :: Functor f => (b -> M a c) -> f b -> M a (f c)

distributeM :: Monad m => m (M a b) -> M a (m b)

collectM :: Monad m => (b -> M a c) -> m b -> M a (m c)

Representable (M a)

Associated Types

type Rep (M a :: * -> *) :: *

Methods

tabulate :: (Rep (M a) -> b) -> M a b

index :: M a b -> Rep (M a) -> b

MonadZip (M a)

Methods

mzip :: M a b -> M a c -> M a (b, c)

mzipWith :: (b -> c -> d) -> M a b -> M a c -> M a d

munzip :: M a (b, c) -> (M a b, M a c)

Comonad (M a)

Methods

extract :: M a b -> b

duplicate :: M a b -> M a (M a b)

extend :: (M a b -> c) -> M a b -> M a c

ComonadApply (M a)

Methods

(<@>) :: M a (b -> c) -> M a b -> M a c

(@>) :: M a b -> M a c -> M a c

(<@) :: M a b -> M a c -> M a b

Apply (M a)

Methods

(<.>) :: M a (b -> c) -> M a b -> M a c

(.>) :: M a b -> M a c -> M a c

(<.) :: M a b -> M a c -> M a b

Bind (M a)

Methods

(>>-) :: M a b -> (b -> M a c) -> M a c

join :: M a (M a b) -> M a b

Extend (M a)

Methods

duplicated :: M a b -> M a (M a b)

extended :: (M a b -> c) -> M a b -> M a c

MonadReader (FreeMonoid a) (M a)

Methods

ask :: M a (FreeMonoid a)

local :: (FreeMonoid a -> FreeMonoid a) -> M a b -> M a b

reader :: (FreeMonoid a -> b) -> M a b

type Corep M = FreeMonoid

type Rep (M a) = FreeMonoid a