trait Traverse[F[_]] extends Functor[F] with Foldable[F]
Idiomatic traversal of a structure, as described in The Essence of the Iterator Pattern.
- Self Type
- Traverse[F]
- Source
- Traverse.scala
- See also
- Alphabetic
- By Inheritance
- Traverse
- Foldable
- Functor
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
trait
FunctorLaw
extends AnyRef
- Definition Classes
- Functor
- class Traversal [G[_]] extends AnyRef
- trait TraverseLaw extends FunctorLaw
Abstract Value Members
-
abstract
def
traverseImpl[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): G[F[B]]
Transform
fa
usingf
, collecting all theG
s withap
.
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
all[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean
Whether all
A
s infa
yield true fromp
.Whether all
A
s infa
yield true fromp
.- Definition Classes
- Foldable
-
def
allM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]
all
with monadic traversal.all
with monadic traversal.- Definition Classes
- Foldable
-
def
any[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean
Whether any
A
s infa
yield true fromp
.Whether any
A
s infa
yield true fromp
.- Definition Classes
- Foldable
-
def
anyM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]
any
with monadic traversal.any
with monadic traversal.- Definition Classes
- Foldable
-
def
apply[A, B](fa: F[A])(f: (A) ⇒ B): F[B]
Alias for
map
.Alias for
map
.- Definition Classes
- Functor
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
collapse[X[_], A](x: F[A])(implicit F: Foldable[F], A: ApplicativePlus[X]): X[A]
- Definition Classes
- Foldable
-
def
collapse2[G[_], X[_], A](x: F[G[A]])(implicit F: Foldable[F], G: Foldable[G], A: ApplicativePlus[X]): X[A]
- Definition Classes
- Foldable
-
def
collapse3[G[_], H[_], X[_], A](x: F[G[H[A]]])(implicit F: Foldable[F], G: Foldable[G], H: Foldable[H], A: ApplicativePlus[X]): X[A]
- Definition Classes
- Foldable
-
def
collapse4[G[_], H[_], I[_], X[_], A](x: F[G[H[I[A]]]])(implicit F: Foldable[F], G: Foldable[G], H: Foldable[H], I: Foldable[I], A: ApplicativePlus[X]): X[A]
- Definition Classes
- Foldable
-
def
collapse5[G[_], H[_], I[_], J[_], X[_], A](x: F[G[H[I[J[A]]]]])(implicit F: Foldable[F], G: Foldable[G], H: Foldable[H], I: Foldable[I], J: Foldable[J], A: ApplicativePlus[X]): X[A]
- Definition Classes
- Foldable
-
def
collapse6[G[_], H[_], I[_], J[_], K[_], X[_], A](x: F[G[H[I[J[K[A]]]]]])(implicit F: Foldable[F], G: Foldable[G], H: Foldable[H], I: Foldable[I], J: Foldable[J], K: Foldable[K], A: ApplicativePlus[X]): X[A]
- Definition Classes
- Foldable
-
def
collapse7[G[_], H[_], I[_], J[_], K[_], L[_], X[_], A](x: F[G[H[I[J[K[L[A]]]]]]])(implicit F: Foldable[F], G: Foldable[G], H: Foldable[H], I: Foldable[I], J: Foldable[J], K: Foldable[K], L: Foldable[L], A: ApplicativePlus[X]): X[A]
- Definition Classes
- Foldable
-
def
compose[G[_]](implicit G0: Traverse[G]): Traverse[[α]F[G[α]]]
The composition of Traverses
F
andG
,[x]F[G[x]]
, is a Traverse -
def
compose[G[_]](implicit G0: Foldable[G]): Foldable[[α]F[G[α]]]
The composition of Foldables
F
andG
,[x]F[G[x]]
, is a FoldableThe composition of Foldables
F
andG
,[x]F[G[x]]
, is a Foldable- Definition Classes
- Foldable
-
def
compose[G[_]](implicit G0: Functor[G]): Functor[[α]F[G[α]]]
The composition of Functors
F
andG
,[x]F[G[x]]
, is a FunctorThe composition of Functors
F
andG
,[x]F[G[x]]
, is a Functor- Definition Classes
- Functor
-
def
count[A](fa: F[A]): Int
Deforested alias for
toStream(fa).size
.Deforested alias for
toStream(fa).size
.- Definition Classes
- Foldable
-
def
counzip[A, B](a: \/[F[A], F[B]]): F[\/[A, B]]
- Definition Classes
- Functor
-
def
element[A](fa: F[A], a: A)(implicit arg0: Equal[A]): Boolean
Whether
a
is an element offa
.Whether
a
is an element offa
.- Definition Classes
- Foldable
-
def
empty[A](fa: F[A]): Boolean
Deforested alias for
toStream(fa).isEmpty
.Deforested alias for
toStream(fa).isEmpty
.- Definition Classes
- Foldable
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
fold[M](t: F[M])(implicit arg0: Monoid[M]): M
Combine the elements of a structure using a monoid.
Combine the elements of a structure using a monoid.
- Definition Classes
- Foldable
- def foldLShape[A, B](fa: F[A], z: B)(f: (B, A) ⇒ B): (B, F[Unit])
-
def
foldLeft[A, B](fa: F[A], z: B)(f: (B, A) ⇒ B): B
Left-associative fold of a structure.
-
def
foldLeftM[G[_], A, B](fa: F[A], z: B)(f: (B, A) ⇒ G[B])(implicit M: Monad[G]): G[B]
Left-associative, monadic fold of a structure.
Left-associative, monadic fold of a structure.
- Definition Classes
- Foldable
-
def
foldMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit F: Monoid[B]): B
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.
-
def
foldMapIdentity[A, B](fa: F[A])(implicit F: Monoid[A]): A
Unbiased sum of monoidal values.
Unbiased sum of monoidal values.
- Definition Classes
- Foldable
-
def
foldRight[A, B](fa: F[A], z: ⇒ B)(f: (A, ⇒ B) ⇒ B): B
Right-associative fold of a structure.
-
def
foldRightM[G[_], A, B](fa: F[A], z: ⇒ B)(f: (A, ⇒ B) ⇒ G[B])(implicit M: Monad[G]): G[B]
Right-associative, monadic fold of a structure.
Right-associative, monadic fold of a structure.
- Definition Classes
- Foldable
-
val
foldableSyntax: FoldableSyntax[F]
- Definition Classes
- Foldable
-
final
def
foldl[A, B](fa: F[A], z: B)(f: (B) ⇒ (A) ⇒ B): B
Curred version of
foldLeft
Curred version of
foldLeft
- Definition Classes
- Foldable
-
final
def
foldlM[G[_], A, B](fa: F[A], z: ⇒ B)(f: (B) ⇒ (A) ⇒ G[B])(implicit M: Monad[G]): G[B]
Curried version of
foldLeftM
Curried version of
foldLeftM
- Definition Classes
- Foldable
-
final
def
foldr[A, B](fa: F[A], z: ⇒ B)(f: (A) ⇒ (⇒ B) ⇒ B): B
Curried version of
foldRight
Curried version of
foldRight
- Definition Classes
- Foldable
-
final
def
foldrM[G[_], A, B](fa: F[A], z: ⇒ B)(f: (A) ⇒ (⇒ B) ⇒ G[B])(implicit M: Monad[G]): G[B]
Curried version of
foldRightM
Curried version of
foldRightM
- Definition Classes
- Foldable
-
def
fpair[A](fa: F[A]): F[(A, A)]
Twin all
A
s infa
.Twin all
A
s infa
.- Definition Classes
- Functor
-
def
fproduct[A, B](fa: F[A])(f: (A) ⇒ B): F[(A, B)]
Pair all
A
s infa
with the result of function application.Pair all
A
s infa
with the result of function application.- Definition Classes
- Functor
-
def
functorLaw: FunctorLaw
- Definition Classes
- Functor
-
val
functorSyntax: FunctorSyntax[F]
- Definition Classes
- Functor
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
def
intercalate[A](fa: F[A], a: A)(implicit A: Monoid[A]): A
Insert an
A
between every A, yielding the sum.Insert an
A
between every A, yielding the sum.- Definition Classes
- Foldable
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
lift[A, B](f: (A) ⇒ B): (F[A]) ⇒ F[B]
Lift
f
intoF
.Lift
f
intoF
.- Definition Classes
- Functor
-
def
longDigits[A](fa: F[A])(implicit d: <:<[A, Digit]): Long
- Definition Classes
- Foldable
-
def
map[A, B](fa: F[A])(f: (A) ⇒ B): F[B]
Lift
f
intoF
and apply toF[A]
. - def mapAccumL[S, A, B](fa: F[A], z: S)(f: (S, A) ⇒ (S, B)): (S, F[B])
- def mapAccumR[S, A, B](fa: F[A], z: S)(f: (S, A) ⇒ (S, B)): (S, F[B])
-
def
mapply[A, B](a: A)(f: F[(A) ⇒ B]): F[B]
Lift
apply(a)
, and apply the result tof
.Lift
apply(a)
, and apply the result tof
.- Definition Classes
- Functor
-
def
maximum[A](fa: F[A])(implicit arg0: Order[A]): Option[A]
The greatest element of
fa
, or None iffa
is empty.The greatest element of
fa
, or None iffa
is empty.- Definition Classes
- Foldable
-
def
minimum[A](fa: F[A])(implicit arg0: Order[A]): Option[A]
The smallest element of
fa
, or None iffa
is empty.The smallest element of
fa
, or None iffa
is empty.- Definition Classes
- Foldable
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
product[G[_]](implicit G0: Traverse[G]): Traverse[[α](F[α], G[α])]
The product of Traverses
F
andG
,[x](F[x], G[x]])
, is a Traverse -
def
product[G[_]](implicit G0: Foldable[G]): Foldable[[α](F[α], G[α])]
The product of Foldables
F
andG
,[x](F[x], G[x]])
, is a FoldableThe product of Foldables
F
andG
,[x](F[x], G[x]])
, is a Foldable- Definition Classes
- Foldable
-
def
product[G[_]](implicit G0: Functor[G]): Functor[[α](F[α], G[α])]
The product of Functors
F
andG
,[x](F[x], G[x]])
, is a FunctorThe product of Functors
F
andG
,[x](F[x], G[x]])
, is a Functor- Definition Classes
- Functor
- def reverse[A](fa: F[A]): F[A]
- def runTraverseS[S, A, B](fa: F[A], s: S)(f: (A) ⇒ State[S, B]): (S, F[B])
-
def
selectSplit[A](fa: F[A])(p: (A) ⇒ Boolean): List[List[A]]
Selects groups of elements that satisfy p and discards others.
Selects groups of elements that satisfy p and discards others.
- Definition Classes
- Foldable
-
def
sequence[G[_], A](fga: F[G[A]])(implicit arg0: Applicative[G]): G[F[A]]
Traverse with the identity function.
-
def
sequenceS[S, A](fga: F[State[S, A]]): State[S, F[A]]
Traverse with
State
. -
def
sequenceS_[S, A](fga: F[State[S, A]]): State[S, Unit]
sequence_
specialized toState
*sequence_
specialized toState
*- Definition Classes
- Foldable
-
final
def
sequenceU[A](self: F[A])(implicit G: Unapply[Applicative, A]): M[F[A]]
A version of
sequence
that infers the nested type constructor. -
def
sequence_[M[_], A, B](fa: F[M[A]])(implicit a: Applicative[M]): M[Unit]
Strict sequencing in an applicative functor
M
that ignores the value infa
.Strict sequencing in an applicative functor
M
that ignores the value infa
.- Definition Classes
- Foldable
-
def
splitWith[A](fa: F[A])(p: (A) ⇒ Boolean): List[List[A]]
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.
- Definition Classes
- Foldable
-
def
strengthL[A, B](a: A, f: F[B]): F[(A, B)]
Inject
a
to the left ofB
s inf
.Inject
a
to the left ofB
s inf
.- Definition Classes
- Functor
-
def
strengthR[A, B](f: F[A], b: B): F[(A, B)]
Inject
b
to the right ofA
s inf
.Inject
b
to the right ofA
s inf
.- Definition Classes
- Functor
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toIndexedSeq[A](fa: F[A]): IndexedSeq[A]
- Definition Classes
- Foldable
-
def
toList[A](fa: F[A]): List[A]
- Definition Classes
- Foldable
-
def
toSet[A](fa: F[A]): Set[A]
- Definition Classes
- Foldable
-
def
toStream[A](fa: F[A]): Stream[A]
- Definition Classes
- Foldable
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- def traversal[G[_]](implicit arg0: Applicative[G]): Traversal[G]
- def traversalS[S]: Traversal[[x]IndexedStateT[[+X]X, S, S, x]]
- def traverse[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): G[F[B]]
-
def
traverseKTrampoline[S, G[+_], A, B](fa: F[A])(f: (A) ⇒ Kleisli[G, S, B])(implicit arg0: Applicative[G]): Kleisli[G, S, F[B]]
Traverse
fa
with aKleisli[G, S, B]
, internally using aTrampoline
to avoid stack overflow. - def traverseLaw: TraverseLaw
-
def
traverseS[S, A, B](fa: F[A])(f: (A) ⇒ State[S, B]): State[S, F[B]]
Traverse with
State
. -
def
traverseSTrampoline[S, G[+_], A, B](fa: F[A])(f: (A) ⇒ State[S, G[B]])(implicit arg0: Applicative[G]): State[S, G[F[B]]]
Traverse
fa
with aState[S, G[B]]
, internally using aTrampoline
to avoid stack overflow. -
def
traverseS_[S, A, B](fa: F[A])(f: (A) ⇒ State[S, B]): State[S, Unit]
traverse_
specialized toState
*traverse_
specialized toState
*- Definition Classes
- Foldable
- val traverseSyntax: TraverseSyntax[F]
-
final
def
traverseU[A, GB](self: F[A])(f: (A) ⇒ GB)(implicit G: Unapply[Applicative, GB]): M[F[A]]
A version of
traverse
that infers the type constructorG
. -
def
traverse_[M[_], A, B](fa: F[A])(f: (A) ⇒ M[B])(implicit a: Applicative[M]): M[Unit]
Strict traversal in an applicative functor
M
that ignores the result off
.Strict traversal in an applicative functor
M
that ignores the result off
.- Definition Classes
- Foldable
-
def
void[A](fa: F[A]): F[Unit]
Empty
fa
of meaningful pure values, preserving its structure.Empty
fa
of meaningful pure values, preserving its structure.- Definition Classes
- Functor
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def zipL[A, B](fa: F[A], fb: F[B]): F[(A, Option[B])]
- def zipR[A, B](fa: F[A], fb: F[B]): F[(Option[A], B)]
- def zipWith[A, B, C](fa: F[A], fb: F[B])(f: (A, Option[B]) ⇒ C): (List[B], F[C])
- def zipWithL[A, B, C](fa: F[A], fb: F[B])(f: (A, Option[B]) ⇒ C): F[C]
- def zipWithR[A, B, C](fa: F[A], fb: F[B])(f: (Option[A], B) ⇒ C): F[C]