scalaz

IsomorphismTraverse1

trait IsomorphismTraverse1[F[_], G[_]] extends Traverse1[F] with IsomorphismTraverse[F, G] with IsomorphismFoldable1[F, G]

Source
Isomorphism.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. IsomorphismTraverse1
  2. IsomorphismFoldable1
  3. IsomorphismTraverse
  4. IsomorphismFunctor
  5. IsomorphismFoldable
  6. Traverse1
  7. Foldable1
  8. Traverse
  9. Foldable
  10. Functor
  11. InvariantFunctor
  12. AnyRef
  13. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. trait Foldable1Law extends FoldableLaw

    Definition Classes
    Foldable1
  2. trait FoldableLaw extends AnyRef

    Definition Classes
    Foldable
  3. trait FunctorLaw extends InvariantFunctorLaw

    Definition Classes
    Functor
  4. trait InvariantFunctorLaw extends AnyRef

    Definition Classes
    InvariantFunctor
  5. class Traversal[G[_]] extends AnyRef

    Definition Classes
    Traverse
  6. trait Traverse1Law extends TraverseLaw

    Definition Classes
    Traverse1
  7. trait TraverseLaw extends FunctorLaw

    Definition Classes
    Traverse

Abstract Value Members

  1. implicit abstract def G: Traverse1[G]

  2. abstract def iso: Isomorphism.<~>[F, G]

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 As in fa yield true from p.

    Whether all As 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 As in fa yield true from p.

    Whether any As 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 bicompose[G[_, _]](implicit arg0: Bitraverse[G]): Bitraverse[[α, β]F[G[α, β]]]

    The composition of Traverse F and Bitraverse G, [x, y]F[G[x, y]], is a Bitraverse

    The composition of Traverse F and Bitraverse G, [x, y]F[G[x, y]], is a Bitraverse

    Definition Classes
    Traverse
  13. def bicompose[G[_, _]](implicit arg0: Bifoldable[G]): Bifoldable[[a, b]F[G[a, b]]]

    The composition of Foldable F and Bifoldable G, [x, y]F[G[x, y]], is a Bifoldable

    The composition of Foldable F and Bifoldable G, [x, y]F[G[x, y]], is a Bifoldable

    Definition Classes
    Foldable
  14. def bicompose[G[_, _]](implicit arg0: Bifunctor[G]): Bifunctor[[α, β]F[G[α, β]]]

    The composition of Functor F and Bifunctor G, [x, y]F[G[x, y]], is a Bifunctor

    The composition of Functor F and Bifunctor G, [x, y]F[G[x, y]], is a Bifunctor

    Definition Classes
    Functor
  15. def clone(): AnyRef

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

    Definition Classes
    Foldable
  17. def compose[G[_]](implicit arg0: Traverse1[G]): Traverse1[[α]F[G[α]]]

    The composition of Traverse1 F and G, [x]F[G[x]], is a Traverse1

    The composition of Traverse1 F and G, [x]F[G[x]], is a Traverse1

    Definition Classes
    Traverse1
  18. def compose[G[_]](implicit arg0: Foldable1[G]): Foldable1[[α]F[G[α]]]

    The composition of Foldable1 F and G, [x]F[G[x]], is a Foldable1

    The composition of Foldable1 F and G, [x]F[G[x]], is a Foldable1

    Definition Classes
    Foldable1
  19. 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
  20. 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
  21. 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
  22. final def count[A](fa: F[A]): Int

    Alias for length.

    Alias for length.

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

    Definition Classes
    Functor
  24. 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
  25. final def empty[A](fa: F[A]): Boolean

    always return false

    always return false

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

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

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

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

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

    Definition Classes
    Traverse
  32. 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
    IsomorphismFoldableFoldable
  33. 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
  34. def foldLeft1Opt[A](fa: F[A])(f: (A, A) ⇒ A): Option[A]

    Definition Classes
    Foldable
  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
    IsomorphismFoldableFoldable
  37. final def foldMap1[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: 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
    IsomorphismFoldable1Foldable1
  38. def foldMap1Opt[A, B](fa: F[A])(f: (A) ⇒ B)(implicit F: Semigroup[B]): Option[B]

    As foldMap but returning None if the foldable is empty and Some otherwise

    As foldMap but returning None if the foldable is empty and Some otherwise

    Definition Classes
    Foldable1Foldable
  39. final def foldMapLeft1[A, B](fa: F[A])(z: (A) ⇒ B)(f: (B, A) ⇒ B): B

    Left-associative fold of a structure.

    Left-associative fold of a structure.

    Definition Classes
    IsomorphismFoldable1Foldable1
  40. def foldMapLeft1Opt[A, B](fa: F[A])(z: (A) ⇒ B)(f: (B, A) ⇒ B): Option[B]

    Definition Classes
    Foldable1Foldable
  41. def foldMapM[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit B: Monoid[B], G: Monad[G]): G[B]

    Specialization of foldRightM when B has a Monoid.

    Specialization of foldRightM when B has a Monoid.

    Definition Classes
    Foldable
  42. final def foldMapRight1[A, B](fa: F[A])(z: (A) ⇒ B)(f: (A, ⇒ B) ⇒ B): B

    Right-associative fold of a structure.

    Right-associative fold of a structure.

    Definition Classes
    IsomorphismFoldable1Foldable1
  43. def foldMapRight1Opt[A, B](fa: F[A])(z: (A) ⇒ B)(f: (A, ⇒ B) ⇒ B): Option[B]

    Definition Classes
    Foldable1Foldable
  44. 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
    IsomorphismFoldableFoldable
  45. 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
  46. def foldRight1Opt[A](fa: F[A])(f: (A, ⇒ A) ⇒ A): Option[A]

    Definition Classes
    Foldable
  47. 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
  48. def foldable1Law: Foldable1Law

    Definition Classes
    Foldable1
  49. val foldable1Syntax: Foldable1Syntax[F]

    Definition Classes
    Foldable1
  50. def foldableLaw: FoldableLaw

    Definition Classes
    Foldable
  51. val foldableSyntax: FoldableSyntax[F]

    Definition Classes
    Foldable
  52. final def foldl[A, B](fa: F[A], z: B)(f: (B) ⇒ (A) ⇒ B): B

    Curried version of foldLeft

    Curried version of foldLeft

    Definition Classes
    Foldable
  53. final def foldl1[A](fa: F[A])(f: (A) ⇒ (A) ⇒ A): A

    Curried foldLeft1.

    Curried foldLeft1.

    Definition Classes
    Foldable1
  54. def foldl1Opt[A](fa: F[A])(f: (A) ⇒ (A) ⇒ A): Option[A]

    Definition Classes
    Foldable1Foldable
  55. 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
  56. 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
  57. final def foldr1[A](fa: F[A])(f: (A) ⇒ (⇒ A) ⇒ A): A

    Curried foldRight1.

    Curried foldRight1.

    Definition Classes
    Foldable1
  58. def foldr1Opt[A](fa: F[A])(f: (A) ⇒ (⇒ A) ⇒ A): Option[A]

    Definition Classes
    Foldable1Foldable
  59. 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
  60. def fpair[A](fa: F[A]): F[(A, A)]

    Twin all As in fa.

    Twin all As in fa.

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

    Pair all As in fa with the result of function application.

    Pair all As in fa with the result of function application.

    Definition Classes
    Functor
  62. def functorLaw: FunctorLaw

    Definition Classes
    Functor
  63. val functorSyntax: FunctorSyntax[F]

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

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

    Definition Classes
    AnyRef → Any
  66. def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]F[G[α]]]

    The composition of Functor F and Contravariant G, [x]F[G[x]], is contravariant.

    The composition of Functor F and Contravariant G, [x]F[G[x]], is contravariant.

    Definition Classes
    Functor
  67. def index[A](fa: F[A], i: Int): Option[A]

    returns

    the element at index i in a Some, or None if the given index falls outside of the range

    Definition Classes
    Foldable
  68. def indexOr[A](fa: F[A], default: ⇒ A, i: Int): A

    returns

    the element at index i, or default if the given index falls outside of the range

    Definition Classes
    Foldable
  69. def intercalate[A](fa: F[A], a: A)(implicit arg0: Monoid[A]): A

    Insert an A between every A, yielding the sum.

    Insert an A between every A, yielding the sum.

    Definition Classes
    Foldable1Foldable
  70. def intercalate1[A](fa: F[A], a: A)(implicit A: Semigroup[A]): A

    Insert an A between every A, yielding the sum.

    Insert an A between every A, yielding the sum.

    Definition Classes
    Foldable1
  71. def invariantFunctorLaw: InvariantFunctorLaw

    Definition Classes
    InvariantFunctor
  72. val invariantFunctorSyntax: InvariantFunctorSyntax[F]

    Definition Classes
    InvariantFunctor
  73. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  74. def length[A](fa: F[A]): Int

    Deforested alias for toStream(fa).size.

    Deforested alias for toStream(fa).size.

    Definition Classes
    Foldable
  75. def lift[A, B](f: (A) ⇒ B): (F[A]) ⇒ F[B]

    Lift f into F.

    Lift f into F.

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

    Definition Classes
    Foldable
  77. 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
    IsomorphismFunctorFunctor
  78. def mapAccumL[S, A, B](fa: F[A], z: S)(f: (S, A) ⇒ (S, B)): (S, F[B])

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

    Definition Classes
    Traverse
  80. 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
  81. 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
    Foldable1Foldable
  82. def maximum1[A](fa: F[A])(implicit arg0: Order[A]): A

    The greatest element of fa.

    The greatest element of fa.

    Definition Classes
    Foldable1
  83. def maximumBy[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[A]

    The element a of fa which yields the greatest value of f(a), 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.

    Definition Classes
    Foldable1Foldable
  84. def maximumBy1[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): A

    The element a of fa which yield the greatest value of f(a).

    The element a of fa which yield the greatest value of f(a).

    Definition Classes
    Foldable1
  85. def maximumOf[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[B]

    The greatest value of f(a) for each element a of fa, or None if fa is empty.

    The greatest value of f(a) for each element a of fa, or None if fa is empty.

    Definition Classes
    Foldable1Foldable
  86. def maximumOf1[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): B

    The greatest value of f(a) for each element a of fa.

    The greatest value of f(a) for each element a of fa.

    Definition Classes
    Foldable1
  87. 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
    Foldable1Foldable
  88. def minimum1[A](fa: F[A])(implicit arg0: Order[A]): A

    The smallest element of fa.

    The smallest element of fa.

    Definition Classes
    Foldable1
  89. def minimumBy[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[A]

    The element a of fa which yields the smallest value of f(a), 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.

    Definition Classes
    Foldable1Foldable
  90. def minimumBy1[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): A

    The element a of fa which yield the smallest value of f(a).

    The element a of fa which yield the smallest value of f(a).

    Definition Classes
    Foldable1
  91. def minimumOf[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[B]

    The smallest value of f(a) for each element a of fa, or None if fa is empty.

    The smallest value of f(a) for each element a of fa, or None if fa is empty.

    Definition Classes
    Foldable1Foldable
  92. def minimumOf1[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): B

    The smallest value of f(a) for each element a of fa.

    The smallest value of f(a) for each element a of fa.

    Definition Classes
    Foldable1
  93. final def naturalTrans: ~>[F, G]

    Attributes
    protected[this]
    Definition Classes
    IsomorphismTraverseIsomorphismFoldable
  94. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  95. final def notify(): Unit

    Definition Classes
    AnyRef
  96. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  97. def product[G[_]](implicit G0: Traverse1[G]): Traverse1[[α](F[α], G[α])]

    The product of Traverse1 F and G, [x](F[x], G[x]]), is a Traverse1

    The product of Traverse1 F and G, [x](F[x], G[x]]), is a Traverse1

    Definition Classes
    Traverse1
  98. def product[G[_]](implicit G0: Foldable1[G]): Foldable1[[α](F[α], G[α])]

    The product of Foldable1 F and G, [x](F[x], G[x]]), is a Foldable1

    The product of Foldable1 F and G, [x](F[x], G[x]]), is a Foldable1

    Definition Classes
    Foldable1
  99. 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
  100. 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
  101. 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
  102. def product0[G[_]](implicit G0: Traverse[G]): Traverse1[[α](F[α], G[α])]

    The product of Traverse1 F and Traverse G, [x](F[x], G[x]]), is a Traverse1

    The product of Traverse1 F and Traverse G, [x](F[x], G[x]]), is a Traverse1

    Definition Classes
    Traverse1
  103. def product0[G[_]](implicit G0: Foldable[G]): Foldable1[[α](F[α], G[α])]

    The product of Foldable1 F and Foldable G, [x](F[x], G[x]]), is a Foldable1

    The product of Foldable1 F and Foldable G, [x](F[x], G[x]]), is a Foldable1

    Definition Classes
    Foldable1
  104. def product0[G[_]](implicit G0: Traverse1[G]): Traverse1[[α](F[α], G[α])]

    The product of Traverse F and Traverse1 G, [x](F[x], G[x]]), is a Traverse1

    The product of Traverse F and Traverse1 G, [x](F[x], G[x]]), is a Traverse1

    Definition Classes
    Traverse
  105. def product0[G[_]](implicit G0: Foldable1[G]): Foldable1[[α](F[α], G[α])]

    The product of Foldable F and Foldable1 G, [x](F[x], G[x]]), is a Foldable1

    The product of Foldable F and Foldable1 G, [x](F[x], G[x]]), is a Foldable1

    Definition Classes
    Foldable
  106. def reverse[A](fa: F[A]): F[A]

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

    Definition Classes
    Traverse
  108. def selectSplit[A](fa: F[A])(p: (A) ⇒ Boolean): List[NonEmptyList[A]]

    Selects groups of elements that satisfy p and discards others.

    Selects groups of elements that satisfy p and discards others.

    Definition Classes
    Foldable
  109. 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
  110. def sequence1[G[_], A](fga: F[G[A]])(implicit arg0: Apply[G]): G[F[A]]

    Definition Classes
    Traverse1
  111. def sequence1_[M[_], A, B](fa: F[M[A]])(implicit a: Apply[M], x: Semigroup[M[A]]): M[Unit]

    Definition Classes
    Foldable1
  112. def sequenceF_[M[_], A](ffa: F[Free[M, A]]): Free[M, Unit]

    sequence_ for Free.

    sequence_ for Free. collapses into a single Free *

    Definition Classes
    Foldable
  113. def sequenceS[S, A](fga: F[State[S, A]]): State[S, F[A]]

    Traverse with State.

    Traverse with State.

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

    sequence_ specialized to State *

    sequence_ specialized to State *

    Definition Classes
    Foldable
  115. 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
  116. def sequence_[M[_], A](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
  117. def splitWith[A](fa: F[A])(p: (A) ⇒ Boolean): List[NonEmptyList[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
  118. def strengthL[A, B](a: A, f: F[B]): F[(A, B)]

    Inject a to the left of Bs in f.

    Inject a to the left of Bs in f.

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

    Inject b to the right of As in f.

    Inject b to the right of As in f.

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

    Definition Classes
    AnyRef
  121. def to[A, G[_]](fa: F[A])(implicit c: CanBuildFrom[Nothing, A, G[A]]): G[A]

    Definition Classes
    Foldable
  122. def toEphemeralStream[A](fa: F[A]): EphemeralStream[A]

    Definition Classes
    Foldable
  123. def toIList[A](fa: F[A]): IList[A]

    Definition Classes
    Foldable
  124. def toIndexedSeq[A](fa: F[A]): IndexedSeq[A]

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

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

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

    Definition Classes
    Foldable
  128. def toString(): String

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

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

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

    Definition Classes
    Traverse
  132. def traverse1[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit a: Apply[G]): G[F[B]]

    Definition Classes
    Traverse1
  133. def traverse1Impl[H[_], A, B](fa: F[A])(f: (A) ⇒ H[B])(implicit arg0: Apply[H]): H[F[B]]

    Transform fa using f, collecting all the Gs with ap.

    Transform fa using f, collecting all the Gs with ap.

    Definition Classes
    IsomorphismTraverse1Traverse1
  134. def traverse1Law: Traverse1Law

    Definition Classes
    Traverse1
  135. val traverse1Syntax: Traverse1Syntax[F]

    Definition Classes
    Traverse1
  136. 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
  137. def traverseImpl[H[_], A, B](fa: F[A])(f: (A) ⇒ H[B])(implicit arg0: Applicative[H]): H[F[B]]

    Transform fa using f, collecting all the Gs with ap.

    Transform fa using f, collecting all the Gs with ap.

    Definition Classes
    IsomorphismTraverseTraverse
  138. 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
  139. def traverseLaw: TraverseLaw

    Definition Classes
    Traverse
  140. final def traverseM[A, G[_], B](fa: F[A])(f: (A) ⇒ G[F[B]])(implicit G: Applicative[G], F: Bind[F]): G[F[B]]

    A version of traverse where a subsequent monadic join is applied to the inner result.

    A version of traverse where a subsequent monadic join is applied to the inner result.

    Definition Classes
    Traverse
  141. 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
  142. 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
  143. 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
  144. val traverseSyntax: TraverseSyntax[F]

    Definition Classes
    Traverse
  145. final def traverseU[A, GB](fa: 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
  146. final def traverseU_[A, GB](fa: F[A])(f: (A) ⇒ GB)(implicit G: Unapply[Applicative, GB]): M[Unit]

    A version of traverse_ that infers the type constructor M.

    A version of traverse_ that infers the type constructor M.

    Definition Classes
    Foldable
  147. 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
  148. 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
  149. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  152. def xmap[A, B](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ A): F[B]

    Converts ma to a value of type F[B] using the provided functions f and g.

    Converts ma to a value of type F[B] using the provided functions f and g.

    Definition Classes
    FunctorInvariantFunctor
  153. def xmapb[A, B](ma: F[A])(b: BijectionT.Bijection[A, B]): F[B]

    Converts ma to a value of type F[B] using the provided bijection.

    Converts ma to a value of type F[B] using the provided bijection.

    Definition Classes
    InvariantFunctor
  154. def xmapi[A, B](ma: F[A])(iso: Isomorphism.<=>[A, B]): F[B]

    Converts ma to a value of type F[B] using the provided isomorphism.

    Converts ma to a value of type F[B] using the provided isomorphism.

    Definition Classes
    InvariantFunctor
  155. def zipL[A, B](fa: F[A], fb: F[B]): F[(A, Option[B])]

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

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

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

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

    Definition Classes
    Traverse

Deprecated Value Members

  1. def foldMapIdentity[A](fa: F[A])(implicit F: Monoid[A]): A

    Unbiased sum of monoidal values.

    Unbiased sum of monoidal values.

    Definition Classes
    Foldable
    Annotations
    @deprecated
    Deprecated

    (Since version 7.1) use fold, it has the exact same signature and implementation

Inherited from IsomorphismFoldable1[F, G]

Inherited from IsomorphismTraverse[F, G]

Inherited from IsomorphismFunctor[F, G]

Inherited from IsomorphismFoldable[F, G]

Inherited from Traverse1[F]

Inherited from Foldable1[F]

Inherited from Traverse[F]

Inherited from Foldable[F]

Inherited from Functor[F]

Inherited from InvariantFunctor[F]

Inherited from AnyRef

Inherited from Any

Ungrouped