Sequence f, then fa, combining their results by function
application.
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.
Flipped variant of ap.
Alias for map.
Alias for map.
Add a unit to any Apply to form an Applicative.
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 Functor F and Bifunctor G, [x, y]F[G[x, y]], is a Bifunctor
Equivalent to join(map(fa)(f)).
Equivalent to join(map(fa)(f)).
The composition of Applys F and G, [x]F[G[x]], is a Apply
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
The composition of Functors F and G, [x]F[G[x]], is a Functor
Repeats a monadic action infinitely
Repeats a monadic action infinitely
Twin all As in fa.
Twin all As in fa.
Pair all As in fa with the result of function application.
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.
The composition of Functor F and Contravariant G, [x]F[G[x]],
is contravariant.
if lifted into a binding.
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.
Sequence the inner F of FFA after the outer F, forming a
single F[A].
Sequence the inner F of FFA after the outer F, forming a
single F[A].
Lift f into F.
Lift f into F.
Lift f into F and apply to F[A].
Lift f into F and apply to F[A].
Lift apply(a), and apply the result to f.
Lift apply(a), and apply the result to f.
Pair A with the result of function application.
Pair A with the result of function application.
The product of Bind F and G, [x](F[x], G[x]]), is a Bind
The product of Bind F and G, [x](F[x], G[x]]), is a Bind
The product of Applys F and G, [x](F[x], G[x]]), is a Apply
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
The product of Functors F and G, [x](F[x], G[x]]), is a Functor
Inject a to the left of Bs in f.
Inject a to the left of Bs in f.
Inject b to the right of As in f.
Inject b to the right of As in f.
Empty fa of meaningful pure values, preserving its
structure.
Empty fa of meaningful pure values, preserving its
structure.
Functors are covariant by nature, so we can treat an F[A] as
an F[B] if A is a subtype of B.
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 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 bijection.
Converts ma to a value of type F[B] using the provided isomorphism.
Converts ma to a value of type F[B] using the provided isomorphism.