Data.Fold.R

Documentation

data R a b

right folds / a reversed Moore machine

Constructors

forall r . R (r -> b) (a -> r -> r) r

Instances

Corepresentable R

Associated Types

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

Methods

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

Profunctor R

Methods

dimap :: (a -> b) -> (c -> d) -> R b c -> R a d

lmap :: (a -> b) -> R b c -> R a c

rmap :: (b -> c) -> R a b -> R a c

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

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

Choice R

Methods

left' :: R a b -> R (Either a c) (Either b c)

right' :: R a b -> R (Either c a) (Either c b)

Closed R

Methods

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

Costrong R

Methods

unfirst :: R (a, d) (b, d) -> R a b

unsecond :: R (d, a) (d, b) -> R a b

Folding R

leaky prefix, efficient postfix

Methods

prefix :: Foldable t => t a -> R a b -> R a b

prefixOf :: Fold s a -> s -> R a b -> R a b

postfix :: Foldable t => R a b -> t a -> R a b

postfixOf :: Fold s a -> R a b -> s -> R a b

run :: Foldable t => t a -> R a b -> b

runOf :: Fold s a -> s -> R a b -> b

filtering :: (a -> Bool) -> R a b -> R a b

Scan R

Methods

prefix1 :: a -> R a b -> R a b

postfix1 :: R a b -> a -> R a b

run1 :: a -> R a b -> b

interspersing :: a -> R a b -> R a b

AsRM R

We can convert from a lazy right fold to a monoidal fold

Methods

asM :: R a b -> M a b

asR :: R a b -> R a b

AsRM1 R

Methods

asM1 :: R a b -> M1 a b

asR1 :: R a b -> R1 a b

Cosieve R []

Methods

cosieve :: R a b -> [a] -> b

Monad (R a)

Methods

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

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

return :: b -> R a b

fail :: String -> R a b

Functor (R a)

Methods

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

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

MonadFix (R a)

Methods

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

Applicative (R a)

Methods

pure :: b -> R a b

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

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

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

Distributive (R a)

Methods

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

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

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

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

Representable (R a)

Associated Types

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

Methods

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

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

MonadZip (R a)

Methods

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

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

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

Comonad (R a)

Methods

extract :: R a b -> b

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

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

ComonadApply (R a)

Methods

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

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

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

Apply (R a)

Methods

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

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

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

Bind (R a)

Methods

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

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

Extend (R a)

Methods

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

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

MonadReader [a] (R a)

Methods

ask :: R a [a]

local :: ([a] -> [a]) -> R a b -> R a b

reader :: ([a] -> b) -> R a b

type Corep R = []

type Rep (R a) = [a]