scalaz

# Traverse1

#### trait Traverse1[F[_]] extends Traverse[F] with Foldable1[F]

A scalaz.Traverse where `traverse` is total over scalaz.Applys. That is, `toList` cannot return an empty list.

Self Type
Traverse1[F]
Source
Traverse1.scala
Linear Supertypes
Foldable1[F], Traverse[F], Foldable[F], Functor[F], AnyRef, Any
Ordering
1. Alphabetic
2. By inheritance
Inherited
1. Traverse1
2. Foldable1
3. Traverse
4. Foldable
5. Functor
6. AnyRef
7. Any
1. Hide All
2. Show all
Visibility
1. Public
2. All

### Type Members

1. #### trait FunctorLaw extends AnyRef

Definition Classes
Functor
2. #### class Traversal[G[_]] extends AnyRef

Definition Classes
Traverse
3. #### trait TraverseLaw extends FunctorLaw

Definition Classes
Traverse

### Abstract Value Members

1. #### abstract def foldRight1[A](fa: F[A])(f: (A, ⇒ A) ⇒ A): A

Right-associative fold of a structure.

Right-associative fold of a structure.

Definition Classes
Foldable1
2. #### abstract def traverse1Impl[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit arg0: Apply[G]): G[F[B]]

Transform `fa` using `f`, collecting all the `G`s with `ap`.

### Concrete Value Members

1. #### final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
2. #### final def !=(arg0: Any): Boolean

Definition Classes
Any
3. #### final def ##(): Int

Definition Classes
AnyRef → Any
4. #### final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
5. #### final def ==(arg0: Any): Boolean

Definition Classes
Any
6. #### def all[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean

Whether all `A`s in `fa` yield true from `p`.

Whether all `A`s in `fa` yield true from `p`.

Definition Classes
Foldable
7. #### 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
8. #### def any[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean

Whether any `A`s in `fa` yield true from `p`.

Whether any `A`s in `fa` yield true from `p`.

Definition Classes
Foldable
9. #### 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
10. #### def apply[A, B](fa: F[A])(f: (A) ⇒ B): F[B]

Alias for `map`.

Alias for `map`.

Definition Classes
Functor
11. #### final def asInstanceOf[T0]: T0

Definition Classes
Any
12. #### def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
13. #### def collapse[X[_], A](x: F[A])(implicit F: Foldable[F], A: ApplicativePlus[X]): X[A]

Definition Classes
Foldable
14. #### def collapse2[G[_], X[_], A](x: F[G[A]])(implicit F: Foldable[F], G: Foldable[G], A: ApplicativePlus[X]): X[A]

Definition Classes
Foldable
15. #### 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
16. #### 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
17. #### 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
18. #### 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
19. #### 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
20. #### def compose[G[_]](implicit G0: Traverse[G]): Traverse[[α]F[G[α]]]

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

Definition Classes
Traverse
21. #### def compose[G[_]](implicit G0: Foldable[G]): Foldable[[α]F[G[α]]]

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

Definition Classes
Foldable
22. #### def compose[G[_]](implicit G0: Functor[G]): Functor[[α]F[G[α]]]

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

Definition Classes
Functor
23. #### def count[A](fa: F[A]): Int

Deforested alias for `toStream(fa).size`.

Deforested alias for `toStream(fa).size`.

Definition Classes
Foldable
24. #### def counzip[A, B](a: \/[F[A], F[B]]): F[\/[A, B]]

Definition Classes
Functor
25. #### def element[A](fa: F[A], a: A)(implicit arg0: Equal[A]): Boolean

Whether `a` is an element of `fa`.

Whether `a` is an element of `fa`.

Definition Classes
Foldable
26. #### final def empty[A](fa: F[A]): Boolean

always return `false`

always return `false`

Definition Classes
Foldable1Foldable
27. #### final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
28. #### def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
29. #### def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
30. #### 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
31. #### def fold1[M](t: F[M])(implicit arg0: Semigroup[M]): M

Definition Classes
Foldable1
32. #### def foldLShape[A, B](fa: F[A], z: B)(f: (B, A) ⇒ B): (B, F[Unit])

Definition Classes
Traverse
33. #### def foldLeft[A, B](fa: F[A], z: B)(f: (B, A) ⇒ B): B

Left-associative fold of a structure.

Left-associative fold of a structure.

Definition Classes
TraverseFoldable
34. #### def foldLeft1[A](fa: F[A])(f: (A, A) ⇒ A): A

Left-associative fold of a structure.

Left-associative fold of a structure.

Definition Classes
Foldable1
35. #### 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
36. #### 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.

Definition Classes
Foldable1Foldable
37. #### def foldMap1[A, B](fa: F[A])(f: (A) ⇒ B)(implicit F: Semigroup[B]): B

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.

Definition Classes
Traverse1Foldable1
38. #### 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
39. #### def foldRight[A, B](fa: F[A], z: ⇒ B)(f: (A, ⇒ B) ⇒ B): B

Right-associative fold of a structure.

Right-associative fold of a structure.

Definition Classes
TraverseFoldable
40. #### 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
41. #### val foldable1Syntax: Foldable1Syntax[F]

Definition Classes
Foldable1
42. #### val foldableSyntax: FoldableSyntax[F]

Definition Classes
Foldable
43. #### 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
44. #### final def foldl1[A](fa: F[A])(f: (A) ⇒ (A) ⇒ A): A

Curried `foldLeft1`.

Curried `foldLeft1`.

Definition Classes
Foldable1
45. #### 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
46. #### 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
47. #### final def foldr1[A](fa: F[A])(f: (A) ⇒ (⇒ A) ⇒ A): A

Curried `foldRight1`.

Curried `foldRight1`.

Definition Classes
Foldable1
48. #### 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
49. #### def fpair[A](fa: F[A]): F[(A, A)]

Twin all `A`s in `fa`.

Twin all `A`s in `fa`.

Definition Classes
Functor
50. #### def fproduct[A, B](fa: F[A])(f: (A) ⇒ B): F[(A, B)]

Pair all `A`s in `fa` with the result of function application.

Pair all `A`s in `fa` with the result of function application.

Definition Classes
Functor
51. #### def functorLaw: FunctorLaw

Definition Classes
Functor
52. #### val functorSyntax: FunctorSyntax[F]

Definition Classes
Functor
53. #### final def getClass(): Class[_]

Definition Classes
AnyRef → Any
54. #### def hashCode(): Int

Definition Classes
AnyRef → Any
55. #### 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
56. #### final def isInstanceOf[T0]: Boolean

Definition Classes
Any
57. #### def lift[A, B](f: (A) ⇒ B): (F[A]) ⇒ F[B]

Lift `f` into `F`.

Lift `f` into `F`.

Definition Classes
Functor
58. #### def longDigits[A](fa: F[A])(implicit d: <:<[A, Digit]): Long

Definition Classes
Foldable
59. #### def map[A, B](fa: F[A])(f: (A) ⇒ B): F[B]

Lift `f` into `F` and apply to `F[A]`.

Lift `f` into `F` and apply to `F[A]`.

Definition Classes
TraverseFunctor
60. #### def mapAccumL[S, A, B](fa: F[A], z: S)(f: (S, A) ⇒ (S, B)): (S, F[B])

Definition Classes
Traverse
61. #### def mapAccumR[S, A, B](fa: F[A], z: S)(f: (S, A) ⇒ (S, B)): (S, F[B])

Definition Classes
Traverse
62. #### def mapply[A, B](a: A)(f: F[(A) ⇒ B]): F[B]

Lift `apply(a)`, and apply the result to `f`.

Lift `apply(a)`, and apply the result to `f`.

Definition Classes
Functor
63. #### def maximum[A](fa: F[A])(implicit arg0: Order[A]): Option[A]

The greatest element of `fa`, or None if `fa` is empty.

The greatest element of `fa`, or None if `fa` is empty.

Definition Classes
Foldable
64. #### def maximum1[A](fa: F[A])(implicit arg0: Order[A]): A

The greatest element of `fa`.

The greatest element of `fa`.

Definition Classes
Foldable1
65. #### def minimum[A](fa: F[A])(implicit arg0: Order[A]): Option[A]

The smallest element of `fa`, or None if `fa` is empty.

The smallest element of `fa`, or None if `fa` is empty.

Definition Classes
Foldable
66. #### def minimum1[A](fa: F[A])(implicit arg0: Order[A]): A

The smallest element of `fa`.

The smallest element of `fa`.

Definition Classes
Foldable1
67. #### final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
68. #### final def notify(): Unit

Definition Classes
AnyRef
69. #### final def notifyAll(): Unit

Definition Classes
AnyRef
70. #### def product[G[_]](implicit G0: Traverse[G]): Traverse[[α](F[α], G[α])]

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

Definition Classes
Traverse
71. #### def product[G[_]](implicit G0: Foldable[G]): Foldable[[α](F[α], G[α])]

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

Definition Classes
Foldable
72. #### def product[G[_]](implicit G0: Functor[G]): Functor[[α](F[α], G[α])]

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

Definition Classes
Functor
73. #### def reverse[A](fa: F[A]): F[A]

Definition Classes
Traverse
74. #### def runTraverseS[S, A, B](fa: F[A], s: S)(f: (A) ⇒ State[S, B]): (S, F[B])

Definition Classes
Traverse
75. #### 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
76. #### def sequence[G[_], A](fga: F[G[A]])(implicit arg0: Applicative[G]): G[F[A]]

Traverse with the identity function.

Traverse with the identity function.

Definition Classes
Traverse

78. #### def sequence1_[M[_], A, B](fa: F[M[A]])(implicit a: Apply[M], x: Semigroup[M[A]]): M[Unit]

Definition Classes
Foldable1
79. #### def sequenceS[S, A](fga: F[State[S, A]]): State[S, F[A]]

Traverse with `State`.

Traverse with `State`.

Definition Classes
Traverse
80. #### def sequenceS_[S, A](fga: F[State[S, A]]): State[S, Unit]

`sequence_` specialized to `State` *

`sequence_` specialized to `State` *

Definition Classes
Foldable
81. #### 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.

A version of `sequence` that infers the nested type constructor.

Definition Classes
Traverse
82. #### 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 in `fa`.

Strict sequencing in an applicative functor `M` that ignores the value in `fa`.

Definition Classes
Foldable
83. #### 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
84. #### def strengthL[A, B](a: A, f: F[B]): F[(A, B)]

Inject `a` to the left of `B`s in `f`.

Inject `a` to the left of `B`s in `f`.

Definition Classes
Functor
85. #### def strengthR[A, B](f: F[A], b: B): F[(A, B)]

Inject `b` to the right of `A`s in `f`.

Inject `b` to the right of `A`s in `f`.

Definition Classes
Functor
86. #### final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
87. #### def toIndexedSeq[A](fa: F[A]): IndexedSeq[A]

Definition Classes
Foldable
88. #### def toList[A](fa: F[A]): List[A]

Definition Classes
Foldable
89. #### def toSet[A](fa: F[A]): Set[A]

Definition Classes
Foldable
90. #### def toStream[A](fa: F[A]): Stream[A]

Definition Classes
Foldable
91. #### def toString(): String

Definition Classes
AnyRef → Any
92. #### def traversal[G[_]](implicit arg0: Applicative[G]): Traversal[G]

Definition Classes
Traverse
93. #### def traversalS[S]: Traversal[[x]IndexedStateT[[+X]X, S, S, x]]

Definition Classes
Traverse
94. #### def traverse[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): G[F[B]]

Definition Classes
Traverse

97. #### def traverse1_[M[_], A, B](fa: F[A])(f: (A) ⇒ M[B])(implicit a: Apply[M], x: Semigroup[M[B]]): M[Unit]

Definition Classes
Foldable1
98. #### def traverseImpl[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): G[F[B]]

Transform `fa` using `f`, collecting all the `G`s with `ap`.

Transform `fa` using `f`, collecting all the `G`s with `ap`.

Definition Classes
Traverse1Traverse
99. #### 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 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.

Definition Classes
Traverse
100. #### def traverseLaw: TraverseLaw

Definition Classes
Traverse
101. #### def traverseS[S, A, B](fa: F[A])(f: (A) ⇒ State[S, B]): State[S, F[B]]

Traverse with `State`.

Traverse with `State`.

Definition Classes
Traverse
102. #### 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 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.

Definition Classes
Traverse
103. #### def traverseS_[S, A, B](fa: F[A])(f: (A) ⇒ State[S, B]): State[S, Unit]

`traverse_` specialized to `State` *

`traverse_` specialized to `State` *

Definition Classes
Foldable
104. #### val traverseSyntax: TraverseSyntax[F]

Definition Classes
Traverse
105. #### 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 constructor `G`.

A version of `traverse` that infers the type constructor `G`.

Definition Classes
Traverse
106. #### 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 of `f`.

Strict traversal in an applicative functor `M` that ignores the result of `f`.

Definition Classes
Foldable
107. #### 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
108. #### final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
109. #### final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
110. #### final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
111. #### def zipL[A, B](fa: F[A], fb: F[B]): F[(A, Option[B])]

Definition Classes
Traverse
112. #### def zipR[A, B](fa: F[A], fb: F[B]): F[(Option[A], B)]

Definition Classes
Traverse
113. #### def zipWith[A, B, C](fa: F[A], fb: F[B])(f: (A, Option[B]) ⇒ C): (List[B], F[C])

Definition Classes
Traverse
114. #### def zipWithL[A, B, C](fa: F[A], fb: F[B])(f: (A, Option[B]) ⇒ C): F[C]

Definition Classes
Traverse
115. #### def zipWithR[A, B, C](fa: F[A], fb: F[B])(f: (Option[A], B) ⇒ C): F[C]

Definition Classes
Traverse