Data.Fold.L'

Documentation

data L' a b

A strict left fold / strict Moore machine

Constructors

L' (r -> b) (r -> a -> r) r

Instances

Corepresentable L'

Associated Types

type Corep (L' :: * -> * -> *) :: * -> *

Methods

cotabulate :: (Corep L' d -> c) -> L' d c

Profunctor L'

Methods

dimap :: (a -> b) -> (c -> d) -> L' b c -> L' a d

lmap :: (a -> b) -> L' b c -> L' a c

rmap :: (b -> c) -> L' a b -> L' a c

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

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

Choice L'

Methods

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

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

Closed L'

Methods

closed :: L' a b -> L' (x -> a) (x -> b)

Costrong L'

Methods

unfirst :: L' (a, d) (b, d) -> L' a b

unsecond :: L' (d, a) (d, b) -> L' a b

Folding L'

efficient prefix, leaky postfix

Methods

prefix :: Foldable t => t a -> L' a b -> L' a b

prefixOf :: Fold s a -> s -> L' a b -> L' a b

postfix :: Foldable t => L' a b -> t a -> L' a b

postfixOf :: Fold s a -> L' a b -> s -> L' a b

run :: Foldable t => t a -> L' a b -> b

runOf :: Fold s a -> s -> L' a b -> b

filtering :: (a -> Bool) -> L' a b -> L' a b

Scan L'

Methods

prefix1 :: a -> L' a b -> L' a b

postfix1 :: L' a b -> a -> L' a b

run1 :: a -> L' a b -> b

interspersing :: a -> L' a b -> L' a b

AsL' L'

We can convert a lazy fold to itself

Methods

asL' :: L' a b -> L' a b

AsL1' L'

Methods

asL1' :: L' a b -> L1' a b

AsRM L'

We can convert from a strict left folding to a right or monoidal fold

Methods

asM :: L' a b -> M a b

asR :: L' a b -> R a b

AsRM1 L'

Methods

asM1 :: L' a b -> M1 a b

asR1 :: L' a b -> R1 a b

Cosieve L' []

Methods

cosieve :: L' a b -> [a] -> b

Monad (L' a)

Methods

(>>=) :: L' a a -> (a -> L' a b) -> L' a b

(>>) :: L' a a -> L' a b -> L' a b

return :: a -> L' a a

fail :: String -> L' a a

Functor (L' a)

Methods

fmap :: (a -> b) -> L' a a -> L' a b

(<$) :: a -> L' a b -> L' a a

MonadFix (L' a)

Methods

mfix :: (a -> L' a a) -> L' a a

Applicative (L' a)

Methods

pure :: a -> L' a a

(<*>) :: L' a (a -> b) -> L' a a -> L' a b

(*>) :: L' a a -> L' a b -> L' a b

(<*) :: L' a a -> L' a b -> L' a a

Distributive (L' a)

Methods

distribute :: Functor f => f (L' a a) -> L' a (f a)

collect :: Functor f => (a -> L' a b) -> f a -> L' a (f b)

distributeM :: Monad m => m (L' a a) -> L' a (m a)

collectM :: Monad m => (a -> L' a b) -> m a -> L' a (m b)

Representable (L' a)

Associated Types

type Rep (L' a :: * -> *) :: *

Methods

tabulate :: (Rep (L' a) -> a) -> L' a a

index :: L' a a -> Rep (L' a) -> a

MonadZip (L' a)

Methods

mzip :: L' a a -> L' a b -> L' a (a, b)

mzipWith :: (a -> b -> c) -> L' a a -> L' a b -> L' a c

munzip :: L' a (a, b) -> (L' a a, L' a b)

Comonad (L' a)

Methods

extract :: L' a a -> a

duplicate :: L' a a -> L' a (L' a a)

extend :: (L' a a -> b) -> L' a a -> L' a b

ComonadApply (L' a)

Methods

(<@>) :: L' a (a -> b) -> L' a a -> L' a b

(@>) :: L' a a -> L' a b -> L' a b

(<@) :: L' a a -> L' a b -> L' a a

Apply (L' a)

Methods

(<.>) :: L' a (a -> b) -> L' a a -> L' a b

(.>) :: L' a a -> L' a b -> L' a b

(<.) :: L' a a -> L' a b -> L' a a

Bind (L' a)

Methods

(>>-) :: L' a a -> (a -> L' a b) -> L' a b

join :: L' a (L' a a) -> L' a a

Extend (L' a)

Methods

duplicated :: L' a a -> L' a (L' a a)

extended :: (L' a a -> b) -> L' a a -> L' a b

MonadReader [a] (L' a)

Methods

ask :: L' a [a]

local :: ([a] -> [a]) -> L' a a -> L' a a

reader :: ([a] -> a) -> L' a a

type Corep L'

type Corep L' = []

type Rep (L' a)

type Rep (L' a) = [a]

unfoldL' :: (s -> (b, a -> s)) -> s -> L' a b

Construct a strict Moore machine from a state valuation and transition function