Map each element of the structure to a scalaz.Monoid, and combine the results.
Right-associative fold of a structure.
Whether all A
s in fa
yield true from p
.
all
with monadic traversal.
Whether any A
s in fa
yield true from p
.
any
with monadic traversal.
The composition of Foldable F
and Bifoldable G
, [x, y]F[G[x, y]]
, is a Bifoldable
The composition of Foldables F
and G
, [x]F[G[x]]
, is a Foldable
Alias for length
.
Whether a
is an element of fa
.
Deforested alias for toStream(fa).isEmpty
.
Combine the elements of a structure using a monoid.
Left-associative fold of a structure.
Left-associative, monadic fold of a structure.
As foldMap
but returning None
if the foldable is empty and Some
otherwise
Specialization of foldRightM when B
has a Monoid
.
Right-associative, monadic fold of a structure.
Curried version of foldLeft
Curried version of foldLeftM
Curried version of foldRight
Curried version of foldRightM
the element at index i
in a Some
, or None
if the given index falls outside of the range
the element at index i
, or default
if the given index falls outside of the range
Insert an A
between every A, yielding the sum.
Deforested alias for toStream(fa).size
.
The greatest element of fa
, or None if fa
is empty.
The element a
of fa
which yields the greatest value of f(a)
, or None if fa
is empty.
The greatest value of f(a)
for each element a
of fa
, or None if fa
is empty.
The smallest element of fa
, or None if fa
is empty.
The element a
of fa
which yields the smallest value of f(a)
, or None if fa
is empty.
The smallest value of f(a)
for each element a
of fa
, or None if fa
is empty.
The product of Foldables F
and G
, [x](F[x], G[x]])
, is a Foldable
The product of Foldable F
and Foldable1 G
, [x](F[x], G[x]])
, is a Foldable1
Selects groups of elements that satisfy p and discards others.
sequence_
for Free.
sequence_
for Free. collapses into a single Free *
sequence_
specialized to State
*
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.
traverse_
specialized to State
*
A version of traverse_
that infers the type constructor M
.
Strict traversal in an applicative functor M
that ignores the result of f
.
Unbiased sum of monoidal values.
Unbiased sum of monoidal values.
(Since version 7.1) use fold
, it has the exact same signature and implementation
A type parameter implying the ability to extract zero or more values of that type.