Sequence f, then fa, combining their results by function application.

NB: with respect to apply2 and all other combinators, as well as scalaz.Bind, the f action appears to the *left*. So f should be the "first" F-action to perform. This is in accordance with all other implementations of this typeclass in common use, which are "function first".

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

Equivalent to join(map(fa)(f)).

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

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

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

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 a monadic 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.

if lifted into a binding. Unlike lift3((t,c,a)=>if(t)c else a), this will only include context from the chosen of ifTrue and ifFalse, not the other.

Execute an action repeatedly until its result satisfies the given predicate and return that result, discarding all others.

Execute an action repeatedly until its result fails to satisfy the given predicate and return that result, discarding all others.

Sequence the inner F of FFA after the outer F, forming a single F[A].

Lift f into F.

Lift f into F and apply to F[A].

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

Pair A with the result of function application.

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 Monad F and G, [x](F[x], G[x]]), is a Monad

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

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

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

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

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.

Execute an action repeatedly until the Boolean condition returns true. The condition is evaluated after the loop body. Collects results into an arbitrary MonadPlus value, such as a List.

Execute an action repeatedly until the Boolean condition returns true. The condition is evaluated after the loop body. Discards results.

Empty fa of meaningful pure values, preserving its structure.

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

Execute an action repeatedly as long as the given Boolean expression returns true. The condition is evaluated before the loop body. Collects the results into an arbitrary MonadPlus value, such as a List.

Execute an action repeatedly as long as the given Boolean expression returns true. The condition is evaluated before the loop body. Discards results.

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 functions f and g.

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.