Control.Applicative.Lift · rerebase-1.21.2

datadata Lift (f :: Type -> Type) a

#

Applicative functor formed by adding pure computations to a given applicative functor.

Constructors

Pure a
Other (f a)

Instances26Generic1, Functor, Applicative, Foldable, Traversable, Alternative, …

Generic1 (Lift f)Defined in transformers-0.6.1.1 · Control.Applicative.Lift
Functor f => Functor (Lift f)Defined in transformers-0.6.1.1 · Control.Applicative.Lift
Applicative f => Applicative (Lift f)Defined in transformers-0.6.1.1 · Control.Applicative.Lift
A combination is Pure only if both parts are.
Foldable f => Foldable (Lift f)Defined in transformers-0.6.1.1 · Control.Applicative.Lift
Traversable f => Traversable (Lift f)Defined in transformers-0.6.1.1 · Control.Applicative.Lift
Alternative f => Alternative (Lift f)Defined in transformers-0.6.1.1 · Control.Applicative.Lift
A combination is Pure only either part is.
Foldable1 f => Foldable1 (Lift f)Defined in transformers-0.6.1.1 · Control.Applicative.Lift
Eq1 f => Eq1 (Lift f)Defined in transformers-0.6.1.1 · Control.Applicative.Lift
Ord1 f => Ord1 (Lift f)Defined in transformers-0.6.1.1 · Control.Applicative.Lift
Read1 f => Read1 (Lift f)Defined in transformers-0.6.1.1 · Control.Applicative.Lift
Show1 f => Show1 (Lift f)Defined in transformers-0.6.1.1 · Control.Applicative.Lift
Alt f => Alt (Lift f)Defined in semigroupoids-6.0.1 · Data.Functor.Alt
Apply f => Apply (Lift f)Defined in semigroupoids-6.0.1 · Data.Functor.Bind.Class
Plus f => Plus (Lift f)Defined in semigroupoids-6.0.1 · Data.Functor.Plus
Traversable1 f => Traversable1 (Lift f)Defined in semigroupoids-6.0.1 · Data.Semigroup.Traversable.Class
Invariant f => Invariant (Lift f)Defined in invariant-0.6.4 · Data.Functor.Invariant
from the transformers package
Selective f => Selective (Lift f)Defined in selective-0.7.0.1 · Control.Selective
Copointed f => Copointed (Lift f)Defined in pointed-5.0.4 · Data.Copointed
Pointed (Lift f)Defined in pointed-5.0.4 · Data.Pointed
(Eq1 f, Eq a) => Eq (Lift f a)Defined in transformers-0.6.1.1 · Control.Applicative.Lift
(Ord1 f, Ord a) => Ord (Lift f a)Defined in transformers-0.6.1.1 · Control.Applicative.Lift
(Read1 f, Read a) => Read (Lift f a)Defined in transformers-0.6.1.1 · Control.Applicative.Lift
(Show1 f, Show a) => Show (Lift f a)Defined in transformers-0.6.1.1 · Control.Applicative.Lift
Generic (Lift f a)Defined in transformers-0.6.1.1 · Control.Applicative.Lift
type Rep (Lift f a) = D1 ('MetaData "Lift" "Control.Applicative.Lift" "transformers-0.6.1.1-a11a" 'False) (C1 ('MetaCons "Pure" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Other" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (f a))))Defined in transformers-0.6.1.1 · Control.Applicative.Lift
type Rep1 (Lift f) = D1 ('MetaData "Lift" "Control.Applicative.Lift" "transformers-0.6.1.1-a11a" 'False) (C1 ('MetaCons "Pure" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1) :+: C1 ('MetaCons "Other" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 f)))Defined in transformers-0.6.1.1 · Control.Applicative.Lift

valueeitherToErrors :: Either e a -> Errors e a

#

Convert from Either to Errors (inverse of runErrors).

valueelimLift :: (a -> r) -> (f a -> r) -> Lift f a -> r

#

Eliminator for Lift.

```
elimLift f g . pure = f
```
```
elimLift f g . Other = g
```

valuefailure :: e -> Errors e a

#

Report an error.

valuemapLift :: (f a -> g a) -> Lift f a -> Lift g a

#

Apply a transformation to the other computation.

valuerunErrors :: Errors e a -> Either e a

#

Extractor for computations with accumulating errors.

```
runErrors (pure x) = Right x
```
```
runErrors (failure e) = Left e
```

valueunLift :: Applicative f => Lift f a -> f a

#

Projection to the other functor.

typetype Errors e = Lift (Constant e)

#

An applicative functor that collects a monoid (e.g. lists) of errors. A sequence of computations fails if any of its components do, but unlike monads made with ExceptT from Control.Monad.Trans.Except, these computations continue after an error, collecting all the errors.

```
pure f <*> pure x = pure (f x)
```
```
pure f <*> failure e = failure e
```
```
failure e <*> pure x = failure e
```

failure e1 <*> failure e2 = failure (e1 <> e2)