IsomorphismApplicative

Flipped variant of ap.

Alias for map.

Add a unit to any Apply to form an Applicative.

The composition of Functor F and Bifunctor G, [x, y]F[G[x, y]], is a Bifunctor

The composition of Functors F and G, [x]F[G[x]], is a Functor

The composition of Applys F and G, [x]F[G[x]], is a Apply

The composition of Applicatives F and G, [x]F[G[x]], is an Applicative

Combine fa and fb according to Apply[F] with a function that discards the A(s)

Combine fa and fb according to Apply[F] with a function that discards the B(s)

Filter l according to an applicative predicate.

An Applicative for F in which effects happen in the opposite order.

Repeats an applicative action infinitely

Twin all As in fa.

Pair all As in fa with the result of function application.

The composition of Functor F and Contravariant G, [x]F[G[x]], is contravariant.

Lift f into F.

Lift apply(a), and apply the result to f.

A lawful implementation of this that is isomorphic up to the methods defined on Applicative allowing for optimised parallel implementations that would otherwise violate laws of more specific typeclasses (e.g. Monad).

The product of Functors F and G, [x](F[x], G[x]]), is a Functor

The product of Applys F and G, [x](F[x], G[x]]), is a Apply

The product of Applicatives F and G, [x](F[x], G[x]]), is an Applicative

Performs the action n times, returning the list of results.

Performs the action n times, returning nothing.

Inject a to the left of Bs in f.

Inject b to the right of As in f.

Returns the given argument if cond is false, otherwise, unit lifted into F.

Empty fa of meaningful pure values, preserving its structure.

Returns the given argument if cond is true, otherwise, unit lifted into F.

Functors are covariant by nature, so we can treat an F[A] as an F[B] if A is a subtype of B.

Converts ma to a value of type F[B] using the provided bijection.

Converts ma to a value of type F[B] using the provided isomorphism.