Right-associative fold of a structure.
Right-associative fold of a structure.
Transform fa
using f
, collecting all the G
s with ap
.
Whether all A
s in fa
yield true from p
.
Whether all A
s in fa
yield true from p
.
all
with monadic traversal.
all
with monadic traversal.
Whether any A
s in fa
yield true from p
.
Whether any A
s in fa
yield true from p
.
any
with monadic traversal.
any
with monadic traversal.
Alias for map
.
Alias for map
.
The composition of Traverses F
and G
, [x]F[G[x]]
, is a Traverse
The composition of Traverses F
and G
, [x]F[G[x]]
, is a Traverse
The composition of Foldables F
and G
, [x]F[G[x]]
, is a Foldable
The composition of Foldables F
and G
, [x]F[G[x]]
, is a Foldable
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
Deforested alias for toStream(fa).size
.
Deforested alias for toStream(fa).size
.
Whether a
is an element of fa
.
Whether a
is an element of fa
.
Deforested alias for toStream(fa).isEmpty
.
Deforested alias for toStream(fa).isEmpty
.
Combine the elements of a structure using a monoid.
Combine the elements of a structure using a monoid.
Left-associative fold of a structure.
Left-associative fold of a structure.
Left-associative fold of a structure.
Left-associative, monadic fold of a structure.
Left-associative, monadic fold of a structure.
Map each element of the structure to a scalaz.Monoid, and combine the results.
Map each element of the structure to a scalaz.Monoid, and combine the results.
Map each element of the structure to a scalaz.Semigroup, and combine the results.
Map each element of the structure to a scalaz.Semigroup, and combine the results.
Unbiased sum of monoidal values.
Unbiased sum of monoidal values.
Right-associative fold of a structure.
Right-associative, monadic fold of a structure.
Right-associative, monadic fold of a structure.
Curred version of foldLeft
Curred version of foldLeft
Curried foldLeft1
.
Curried foldLeft1
.
Curried version of foldLeftM
Curried version of foldLeftM
Curried version of foldRight
Curried version of foldRight
Curried foldRight1
.
Curried foldRight1
.
Curried version of foldRightM
Curried version of foldRightM
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.
Insert an A
between every A, yielding the sum.
Insert an A
between every A, yielding the sum.
Lift f
into F
.
Lift f
into F
.
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 greatest element of fa
, or None if fa
is empty.
The greatest element of fa
, or None if fa
is empty.
The greatest element of fa
.
The greatest element of fa
.
The smallest element of fa
, or None if fa
is empty.
The smallest element of fa
, or None if fa
is empty.
The smallest element of fa
.
The smallest element of fa
.
The product of Traverses F
and G
, [x](F[x], G[x]])
, is a Traverse
The product of Traverses F
and G
, [x](F[x], G[x]])
, is a Traverse
The product of Foldables F
and G
, [x](F[x], G[x]])
, is a Foldable
The product of Foldables F
and G
, [x](F[x], G[x]])
, is a Foldable
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
Selects groups of elements that satisfy p and discards others.
Selects groups of elements that satisfy p and discards others.
Traverse with the identity function.
Traverse with the identity function.
Traverse with State
.
Traverse with State
.
sequence_
specialized to State
*
sequence_
specialized to State
*
A version of sequence
that infers the nested type constructor.
A version of sequence
that infers the nested type constructor.
Strict sequencing in an applicative functor M
that ignores the value in fa
.
Strict sequencing in an applicative functor M
that ignores the value in fa
.
Splits the elements into groups that alternatively satisfy and don't satisfy the predicate p.
Splits the elements into groups that alternatively satisfy and don't satisfy the predicate p.
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
.
Transform fa
using f
, collecting all the G
s with ap
.
Traverse fa
with a Kleisli[G, S, B]
, internally using a Trampoline
to avoid stack overflow.
Traverse fa
with a Kleisli[G, S, B]
, internally using a Trampoline
to avoid stack overflow.
Traverse with State
.
Traverse with State
.
Traverse fa
with a State[S, G[B]]
, internally using a Trampoline
to avoid stack overflow.
Traverse fa
with a State[S, G[B]]
, internally using a Trampoline
to avoid stack overflow.
traverse_
specialized to State
*
traverse_
specialized to State
*
A version of traverse
that infers the type constructor G
.
A version of traverse
that infers the type constructor G
.
Strict traversal in an applicative functor M
that ignores the result of f
.
Strict traversal in an applicative functor M
that ignores the result of f
.
Empty fa
of meaningful pure values, preserving its
structure.
Empty fa
of meaningful pure values, preserving its
structure.
A scalaz.Traverse where
traverse
is total over scalaz.Applys. That is,toList
cannot return an empty list.