Flipped variant of ap
.
Flipped variant of ap
.
Alias for map
.
Alias for map
.
Equivalent to join(map(fa)(f))
.
Equivalent to join(map(fa)(f))
.
The composition of ApplicativePlus F
and G
, [x]F[G[x]]
, is a ApplicativePlus
The composition of ApplicativePlus F
and G
, [x]F[G[x]]
, is a ApplicativePlus
The composition of Applicatives F
and G
, [x]F[G[x]]
, is an Applicative
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 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
Remove f
-failing A
s in fa
, by which we mean: in the
expression filter(filter(fa)(f))(g)
, g
will never be invoked
for any a
where f(a)
returns false.
Remove f
-failing A
s in fa
, by which we mean: in the
expression filter(filter(fa)(f))(g)
, g
will never be invoked
for any a
where f(a)
returns false.
Filter l
according to an applicative predicate.
Filter l
according to an applicative predicate.
An Applicative
for F
in which effects happen in the opposite order.
An Applicative
for F
in which effects happen in the opposite order.
Twin all A
s in fa
.
Twin all A
s in fa
.
Pair all A
s in fa
with the result of function application.
Pair all A
s in fa
with the result of function application.
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
.
A list of results acquired by repeating a
.
A list of results acquired by repeating a
. Never empty
;
initial failure is an empty list instead.
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
.
The product of ApplicativePlus F
and G
, [x](F[x], G[x]])
, is a ApplicativePlus
The product of ApplicativePlus F
and G
, [x](F[x], G[x]])
, is a ApplicativePlus
The product of Applicatives F
and G
, [x](F[x], G[x]])
, is an Applicative
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 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
Performs the action n
times, returning the list of results.
Performs the action n
times, returning the list of results.
Performs the action n
times, returning nothing.
Performs the action n
times, returning nothing.
empty
or a non-empty list of results acquired by repeating a
.
empty
or a non-empty list of results acquired by repeating a
.
Inject a
to the left of B
s in f
.
Inject a
to the left of B
s in f
.
Inject b
to the right of A
s in f
.
Inject b
to the right of A
s in f
.
Generalized version of Haskell's catMaybes
Generalized version of Haskell's catMaybes
Empty fa
of meaningful pure values, preserving its
structure.
Empty fa
of meaningful pure values, preserving its
structure.
(Since version 7) given F: Apply[F]
use F.apply2(a,b)(f)
instead, or given implicitly[Apply[F]]
, use ^(a,b)(f)
(Since version 7) given F: Apply[F]
use F.apply3(a,b,c)(f)
instead, or given implicitly[Apply[F]]
, use ^^(a,b,c)(f)
(Since version 7) given F: Apply[F]
use F.apply4(a,b,c,d)(f)
instead, or given implicitly[Apply[F]]
, use ^^^(a,b,c,d)(f)
Zip derived from tuple2
.