trait MkNonEmptyTraverse[F[_]] extends NonEmptyTraverse[F] with MkTraverse[F] with MkReducible[F]

Annotations
@implicitNotFound( ... )
Linear Supertypes
MkReducible[F], MkTraverse[F], MkFoldable[F], NonEmptyTraverse[F], Reducible[F], Traverse[F], UnorderedTraverse[F], Foldable[F], FoldableNFunctions[F], UnorderedFoldable[F], Functor[F], Invariant[F], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MkNonEmptyTraverse
  2. MkReducible
  3. MkTraverse
  4. MkFoldable
  5. NonEmptyTraverse
  6. Reducible
  7. Traverse
  8. UnorderedTraverse
  9. Foldable
  10. FoldableNFunctions
  11. UnorderedFoldable
  12. Functor
  13. Invariant
  14. Serializable
  15. Serializable
  16. AnyRef
  17. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def foldRight[A, B](fa: F[A], lb: Eval[B])(f: (A, Eval[B]) ⇒ Eval[B]): Eval[B]
    Definition Classes
    MkTraverse → MkFoldable → Foldable
  2. abstract def reduceRightTo[A, B](fa: F[A])(f: (A) ⇒ B)(g: (A, Eval[B]) ⇒ Eval[B]): Eval[B]
    Definition Classes
    Reducible
  3. abstract def safeFoldLeft[A, B](fa: F[A], b: B)(f: (B, A) ⇒ Eval[B]): Eval[B]
    Definition Classes
    MkFoldable
  4. abstract def safeNonEmptyTraverse[G[_], A, B](fa: F[A])(f: (A) ⇒ Eval[G[B]])(implicit arg0: Apply[G]): Eval[G[F[B]]]
  5. abstract def safeReduceLeftTo[A, B](fa: F[A])(f: (A) ⇒ B)(g: (B, A) ⇒ Eval[B]): Eval[B]
    Definition Classes
    MkReducible
  6. abstract def safeTraverse[G[_], A, B](fa: F[A])(f: (A) ⇒ Eval[G[B]])(implicit arg0: Applicative[G]): Eval[G[F[B]]]
    Definition Classes
    MkTraverse

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def as[A, B](fa: F[A], b: B): F[B]
    Definition Classes
    Functor
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  7. def collectFirst[A, B](fa: F[A])(pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    Foldable
  8. def collectFirstSome[A, B](fa: F[A])(f: (A) ⇒ Option[B]): Option[B]
    Definition Classes
    Foldable
  9. def collectFirstSomeM[G[_], A, B](fa: F[A])(f: (A) ⇒ G[Option[B]])(implicit G: Monad[G]): G[Option[B]]
    Definition Classes
    Foldable
  10. def collectFold[A, B](fa: F[A])(f: PartialFunction[A, B])(implicit B: Monoid[B]): B
    Definition Classes
    Foldable
  11. def collectFoldSome[A, B](fa: F[A])(f: (A) ⇒ Option[B])(implicit B: Monoid[B]): B
    Definition Classes
    Foldable
  12. def combineAll[A](fa: F[A])(implicit arg0: Monoid[A]): A
    Definition Classes
    Foldable
  13. def combineAllOption[A](fa: F[A])(implicit ev: Semigroup[A]): Option[A]
    Definition Classes
    Foldable
  14. def compose[G[_]](implicit arg0: NonEmptyTraverse[G]): NonEmptyTraverse[[α]F[G[α]]]
    Definition Classes
    NonEmptyTraverse
  15. def compose[G[_]](implicit arg0: Reducible[G]): Reducible[[α]F[G[α]]]
    Definition Classes
    Reducible
  16. def compose[G[_]](implicit arg0: Traverse[G]): Traverse[[α]F[G[α]]]
    Definition Classes
    Traverse
  17. def compose[G[_]](implicit arg0: Foldable[G]): Foldable[[α]F[G[α]]]
    Definition Classes
    Foldable
  18. def compose[G[_]](implicit arg0: Functor[G]): Functor[[α]F[G[α]]]
    Definition Classes
    Functor
  19. def compose[G[_]](implicit arg0: Invariant[G]): Invariant[[α]F[G[α]]]
    Definition Classes
    Invariant
  20. def composeContravariant[G[_]](implicit arg0: Contravariant[G]): Contravariant[[α]F[G[α]]]
    Definition Classes
    Functor → Invariant
  21. def composeFunctor[G[_]](implicit arg0: Functor[G]): Invariant[[α]F[G[α]]]
    Definition Classes
    Invariant
  22. def count[A](fa: F[A])(p: (A) ⇒ Boolean): Long
    Definition Classes
    UnorderedFoldable
  23. def dropWhile_[A](fa: F[A])(p: (A) ⇒ Boolean): List[A]
    Definition Classes
    Foldable
  24. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  25. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  26. def exists[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    Foldable → UnorderedFoldable
  27. def existsM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]
    Definition Classes
    Foldable
  28. def filter_[A](fa: F[A])(p: (A) ⇒ Boolean): List[A]
    Definition Classes
    Foldable
  29. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  30. def find[A](fa: F[A])(f: (A) ⇒ Boolean): Option[A]
    Definition Classes
    Foldable
  31. def findM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Option[A]]
    Definition Classes
    Foldable
  32. def flatSequence[G[_], A](fgfa: F[G[F[A]]])(implicit G: Applicative[G], F: FlatMap[F]): G[F[A]]
    Definition Classes
    Traverse
  33. def flatTraverse[G[_], A, B](fa: F[A])(f: (A) ⇒ G[F[B]])(implicit G: Applicative[G], F: FlatMap[F]): G[F[B]]
    Definition Classes
    Traverse
  34. final def fmap[A, B](fa: F[A])(f: (A) ⇒ B): F[B]
    Definition Classes
    Functor
  35. def fold[A](fa: F[A])(implicit A: Monoid[A]): A
    Definition Classes
    Foldable
  36. def foldA[G[_], A](fga: F[G[A]])(implicit G: Applicative[G], A: Monoid[A]): G[A]
    Definition Classes
    Foldable
  37. def foldK[G[_], A](fga: F[G[A]])(implicit G: MonoidK[G]): G[A]
    Definition Classes
    Foldable
  38. def foldLeft[A, B](fa: F[A], b: B)(f: (B, A) ⇒ B): B
    Definition Classes
    MkNonEmptyTraverse → MkTraverse → MkFoldable → Foldable
  39. final def foldLeftM[G[_], A, B](fa: F[A], z: B)(f: (B, A) ⇒ G[B])(implicit G: Monad[G]): G[B]
    Definition Classes
    Foldable
  40. def foldM[G[_], A, B](fa: F[A], z: B)(f: (B, A) ⇒ G[B])(implicit G: Monad[G]): G[B]
    Definition Classes
    Foldable
  41. def foldMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit B: Monoid[B]): B
    Definition Classes
    Foldable
  42. def foldMapA[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit G: Applicative[G], B: Monoid[B]): G[B]
    Definition Classes
    Foldable
  43. def foldMapK[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit G: MonoidK[G]): G[B]
    Definition Classes
    Foldable
  44. def foldMapM[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit G: Monad[G], B: Monoid[B]): G[B]
    Definition Classes
    Foldable
  45. def foldRightDefer[G[_], A, B](fa: F[A], gb: G[B])(fn: (A, G[B]) ⇒ G[B])(implicit arg0: Defer[G]): G[B]
    Definition Classes
    Foldable
  46. def forall[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    Foldable → UnorderedFoldable
  47. def forallM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]
    Definition Classes
    Foldable
  48. def fproduct[A, B](fa: F[A])(f: (A) ⇒ B): F[(A, B)]
    Definition Classes
    Functor
  49. def fproductLeft[A, B](fa: F[A])(f: (A) ⇒ B): F[(B, A)]
    Definition Classes
    Functor
  50. def get[A](fa: F[A])(idx: Long): Option[A]
    Definition Classes
    Foldable
  51. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  52. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  53. def ifF[A](fb: F[Boolean])(ifTrue: ⇒ A, ifFalse: ⇒ A): F[A]
    Definition Classes
    Functor
  54. def imap[A, B](fa: F[A])(f: (A) ⇒ B)(g: (B) ⇒ A): F[B]
    Definition Classes
    Functor → Invariant
  55. def intercalate[A](fa: F[A], a: A)(implicit A: Monoid[A]): A
    Definition Classes
    Foldable
  56. def intersperseList[A](xs: List[A], x: A): List[A]
    Attributes
    protected
    Definition Classes
    Foldable
  57. def isEmpty[A](fa: F[A]): Boolean
    Definition Classes
    Reducible → Foldable → UnorderedFoldable
  58. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  59. def lift[A, B](f: (A) ⇒ B): (F[A]) ⇒ F[B]
    Definition Classes
    Functor
  60. def map[A, B](fa: F[A])(f: (A) ⇒ B): F[B]
    Definition Classes
    Traverse → Functor
  61. def mapWithIndex[A, B](fa: F[A])(f: (A, Int) ⇒ B): F[B]
    Definition Classes
    Traverse
  62. def maximum[A](fa: F[A])(implicit A: Order[A]): A
    Definition Classes
    Reducible
  63. def maximumBy[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): A
    Definition Classes
    Reducible
  64. def maximumByList[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): List[A]
    Definition Classes
    Foldable
  65. def maximumByNel[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): NonEmptyList[A]
    Definition Classes
    Reducible
  66. def maximumByOption[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[A]
    Definition Classes
    Foldable
  67. def maximumList[A](fa: F[A])(implicit A: Order[A]): List[A]
    Definition Classes
    Foldable
  68. def maximumNel[A](fa: F[A])(implicit A: Order[A]): NonEmptyList[A]
    Definition Classes
    Reducible
  69. def maximumOption[A](fa: F[A])(implicit A: Order[A]): Option[A]
    Definition Classes
    Reducible → Foldable
  70. def minimum[A](fa: F[A])(implicit A: Order[A]): A
    Definition Classes
    Reducible
  71. def minimumBy[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): A
    Definition Classes
    Reducible
  72. def minimumByList[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): List[A]
    Definition Classes
    Foldable
  73. def minimumByNel[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): NonEmptyList[A]
    Definition Classes
    Reducible
  74. def minimumByOption[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[A]
    Definition Classes
    Foldable
  75. def minimumList[A](fa: F[A])(implicit A: Order[A]): List[A]
    Definition Classes
    Foldable
  76. def minimumNel[A](fa: F[A])(implicit A: Order[A]): NonEmptyList[A]
    Definition Classes
    Reducible
  77. def minimumOption[A](fa: F[A])(implicit A: Order[A]): Option[A]
    Definition Classes
    Reducible → Foldable
  78. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  79. def nonEmpty[A](fa: F[A]): Boolean
    Definition Classes
    Reducible → Foldable → UnorderedFoldable
  80. def nonEmptyFlatSequence[G[_], A](fgfa: F[G[F[A]]])(implicit G: Apply[G], F: FlatMap[F]): G[F[A]]
    Definition Classes
    NonEmptyTraverse
  81. def nonEmptyFlatTraverse[G[_], A, B](fa: F[A])(f: (A) ⇒ G[F[B]])(implicit G: Apply[G], F: FlatMap[F]): G[F[B]]
    Definition Classes
    NonEmptyTraverse
  82. def nonEmptyIntercalate[A](fa: F[A], a: A)(implicit A: Semigroup[A]): A
    Definition Classes
    Reducible
  83. def nonEmptyPartition[A, B, C](fa: F[A])(f: (A) ⇒ Either[B, C]): Ior[NonEmptyList[B], NonEmptyList[C]]
    Definition Classes
    Reducible
  84. def nonEmptySequence[G[_], A](fga: F[G[A]])(implicit arg0: Apply[G]): G[F[A]]
    Definition Classes
    NonEmptyTraverse
  85. def nonEmptySequence_[G[_], A](fga: F[G[A]])(implicit G: Apply[G]): G[Unit]
    Definition Classes
    Reducible
  86. def nonEmptyTraverse[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit arg0: Apply[G]): G[F[B]]
    Definition Classes
    MkNonEmptyTraverse → NonEmptyTraverse
  87. def nonEmptyTraverse_[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit G: Apply[G]): G[Unit]
    Definition Classes
    Reducible
  88. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  89. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  90. def partitionBifold[H[_, _], A, B, C](fa: F[A])(f: (A) ⇒ H[B, C])(implicit A: Alternative[F], H: Bifoldable[H]): (F[B], F[C])
    Definition Classes
    Foldable
  91. def partitionBifoldM[G[_], H[_, _], A, B, C](fa: F[A])(f: (A) ⇒ G[H[B, C]])(implicit A: Alternative[F], M: Monad[G], H: Bifoldable[H]): G[(F[B], F[C])]
    Definition Classes
    Foldable
  92. def partitionEither[A, B, C](fa: F[A])(f: (A) ⇒ Either[B, C])(implicit A: Alternative[F]): (F[B], F[C])
    Definition Classes
    Foldable
  93. def partitionEitherM[G[_], A, B, C](fa: F[A])(f: (A) ⇒ G[Either[B, C]])(implicit A: Alternative[F], M: Monad[G]): G[(F[B], F[C])]
    Definition Classes
    Foldable
  94. def productAll[A](fa: F[A])(implicit A: Numeric[A]): A
    Definition Classes
    Foldable
  95. def reduce[A](fa: F[A])(implicit A: Semigroup[A]): A
    Definition Classes
    Reducible
  96. def reduceA[G[_], A](fga: F[G[A]])(implicit G: Apply[G], A: Semigroup[A]): G[A]
    Definition Classes
    Reducible
  97. def reduceK[G[_], A](fga: F[G[A]])(implicit G: SemigroupK[G]): G[A]
    Definition Classes
    Reducible
  98. def reduceLeft[A](fa: F[A])(f: (A, A) ⇒ A): A
    Definition Classes
    Reducible
  99. def reduceLeftM[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(g: (B, A) ⇒ G[B])(implicit G: FlatMap[G]): G[B]
    Definition Classes
    Reducible
  100. def reduceLeftOption[A](fa: F[A])(f: (A, A) ⇒ A): Option[A]
    Definition Classes
    Foldable
  101. def reduceLeftTo[A, B](fa: F[A])(f: (A) ⇒ B)(g: (B, A) ⇒ B): B
    Definition Classes
    MkReducible → Reducible
  102. def reduceLeftToOption[A, B](fa: F[A])(f: (A) ⇒ B)(g: (B, A) ⇒ B): Option[B]
    Definition Classes
    Reducible → Foldable
  103. def reduceMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit B: Semigroup[B]): B
    Definition Classes
    Reducible
  104. def reduceMapA[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit G: Apply[G], B: Semigroup[B]): G[B]
    Definition Classes
    Reducible
  105. def reduceMapK[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit G: SemigroupK[G]): G[B]
    Definition Classes
    Reducible
  106. def reduceMapM[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit G: FlatMap[G], B: Semigroup[B]): G[B]
    Definition Classes
    Reducible
  107. def reduceRight[A](fa: F[A])(f: (A, Eval[A]) ⇒ Eval[A]): Eval[A]
    Definition Classes
    Reducible
  108. def reduceRightOption[A](fa: F[A])(f: (A, Eval[A]) ⇒ Eval[A]): Eval[Option[A]]
    Definition Classes
    Foldable
  109. def reduceRightToOption[A, B](fa: F[A])(f: (A) ⇒ B)(g: (A, Eval[B]) ⇒ Eval[B]): Eval[Option[B]]
    Definition Classes
    Reducible → Foldable
  110. def sequence[G[_], A](fga: F[G[A]])(implicit arg0: Applicative[G]): G[F[A]]
    Definition Classes
    Traverse
  111. def sequence_[G[_], A](fga: F[G[A]])(implicit arg0: Applicative[G]): G[Unit]
    Definition Classes
    Foldable
  112. def size[A](fa: F[A]): Long
    Definition Classes
    UnorderedFoldable
  113. def sliding10[A](fa: F[A]): List[(A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  114. def sliding11[A](fa: F[A]): List[(A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  115. def sliding12[A](fa: F[A]): List[(A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  116. def sliding13[A](fa: F[A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  117. def sliding14[A](fa: F[A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  118. def sliding15[A](fa: F[A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  119. def sliding16[A](fa: F[A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  120. def sliding17[A](fa: F[A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  121. def sliding18[A](fa: F[A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  122. def sliding19[A](fa: F[A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  123. def sliding2[A](fa: F[A]): List[(A, A)]
    Definition Classes
    FoldableNFunctions
  124. def sliding20[A](fa: F[A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  125. def sliding21[A](fa: F[A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  126. def sliding22[A](fa: F[A]): List[(A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  127. def sliding3[A](fa: F[A]): List[(A, A, A)]
    Definition Classes
    FoldableNFunctions
  128. def sliding4[A](fa: F[A]): List[(A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  129. def sliding5[A](fa: F[A]): List[(A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  130. def sliding6[A](fa: F[A]): List[(A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  131. def sliding7[A](fa: F[A]): List[(A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  132. def sliding8[A](fa: F[A]): List[(A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  133. def sliding9[A](fa: F[A]): List[(A, A, A, A, A, A, A, A, A)]
    Definition Classes
    FoldableNFunctions
  134. def sumAll[A](fa: F[A])(implicit A: Numeric[A]): A
    Definition Classes
    Foldable
  135. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  136. def takeWhile_[A](fa: F[A])(p: (A) ⇒ Boolean): List[A]
    Definition Classes
    Foldable
  137. def toIterable[A](fa: F[A]): Iterable[A]
    Definition Classes
    Foldable
  138. def toList[A](fa: F[A]): List[A]
    Definition Classes
    Foldable
  139. def toNonEmptyList[A](fa: F[A]): NonEmptyList[A]
    Definition Classes
    Reducible
  140. def toString(): String
    Definition Classes
    AnyRef → Any
  141. def traverse[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): G[F[B]]
    Definition Classes
    MkNonEmptyTraverse → MkTraverse → NonEmptyTraverse → Traverse
  142. def traverseTap[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): G[F[A]]
    Definition Classes
    Traverse
  143. def traverseWithIndexM[G[_], A, B](fa: F[A])(f: (A, Int) ⇒ G[B])(implicit G: Monad[G]): G[F[B]]
    Definition Classes
    Traverse
  144. def traverse_[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit G: Applicative[G]): G[Unit]
    Definition Classes
    Foldable
  145. def tupleLeft[A, B](fa: F[A], b: B): F[(B, A)]
    Definition Classes
    Functor
  146. def tupleRight[A, B](fa: F[A], b: B): F[(A, B)]
    Definition Classes
    Functor
  147. def unorderedFold[A](fa: F[A])(implicit arg0: CommutativeMonoid[A]): A
    Definition Classes
    Foldable → UnorderedFoldable
  148. def unorderedFoldMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: CommutativeMonoid[B]): B
    Definition Classes
    Foldable → UnorderedFoldable
  149. def unorderedSequence[G[_], A](fga: F[G[A]])(implicit arg0: CommutativeApplicative[G]): G[F[A]]
    Definition Classes
    Traverse → UnorderedTraverse
  150. def unorderedTraverse[G[_], A, B](sa: F[A])(f: (A) ⇒ G[B])(implicit arg0: CommutativeApplicative[G]): G[F[B]]
    Definition Classes
    Traverse → UnorderedTraverse
  151. def unzip[A, B](fab: F[(A, B)]): (F[A], F[B])
    Definition Classes
    Functor
  152. def void[A](fa: F[A]): F[Unit]
    Definition Classes
    Functor
  153. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  154. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  155. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  156. def widen[A, B >: A](fa: F[A]): F[B]
    Definition Classes
    Functor
  157. def zipWithIndex[A](fa: F[A]): F[(A, Int)]
    Definition Classes
    Traverse

Inherited from MkReducible[F]

Inherited from MkTraverse[F]

Inherited from MkFoldable[F]

Inherited from NonEmptyTraverse[F]

Inherited from Reducible[F]

Inherited from Traverse[F]

Inherited from UnorderedTraverse[F]

Inherited from Foldable[F]

Inherited from FoldableNFunctions[F]

Inherited from UnorderedFoldable[F]

Inherited from Functor[F]

Inherited from Invariant[F]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped