Packages

trait AllOps[F[_], C] extends Ops[F, C] with Traverse.AllOps[F, C] with Reducible.AllOps[F, C]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AllOps
  2. AllOps
  3. Ops
  4. AllOps
  5. AllOps
  6. Ops
  7. AllOps
  8. AllOps
  9. Ops
  10. Ops
  11. AllOps
  12. AllOps
  13. Ops
  14. Ops
  15. Ops
  16. Ops
  17. AnyRef
  18. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. abstract type TypeClassType <: NonEmptyTraverse[F]
    Definition Classes
    AllOpsAllOpsOpsAllOpsAllOpsOpsAllOpsAllOpsOpsOpsAllOpsAllOpsOpsOpsOpsOps

Abstract Value Members

  1. abstract def self: F[C]
    Definition Classes
    Ops
  2. abstract val typeClassInstance: TypeClassType
    Definition Classes
    AllOpsAllOpsOpsAllOpsAllOpsOpsAllOpsAllOpsOpsOpsAllOpsAllOpsOpsOpsOpsOps

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[B](b: B): F[B]
    Definition Classes
    Ops
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  7. def collectFirst[B](pf: PartialFunction[C, B]): Option[B]
    Definition Classes
    Ops
  8. def collectFirstSome[B](f: (C) ⇒ Option[B]): Option[B]
    Definition Classes
    Ops
  9. def combineAll(implicit arg0: Monoid[C]): C
    Definition Classes
    Ops
  10. def dropWhile_(p: (C) ⇒ Boolean): List[C]
    Definition Classes
    Ops
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  13. def exists(p: (C) ⇒ Boolean): Boolean
    Definition Classes
    Ops
  14. def existsM[G[_]](p: (C) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]
    Definition Classes
    Ops
  15. def filter_(p: (C) ⇒ Boolean): List[C]
    Definition Classes
    Ops
  16. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. def find(f: (C) ⇒ Boolean): Option[C]
    Definition Classes
    Ops
  18. def flatSequence[G[_], A](implicit arg0: <:<[C, G[F[A]]], G: Applicative[G], F: FlatMap[F]): G[F[A]]
    Definition Classes
    Ops
  19. def flatTraverse[G[_], B](f: (C) ⇒ G[F[B]])(implicit G: Applicative[G], F: FlatMap[F]): G[F[B]]
    Definition Classes
    Ops
  20. def fmap[B](f: (C) ⇒ B): F[B]
    Definition Classes
    Ops
  21. def fold(implicit A: Monoid[C]): C
    Definition Classes
    Ops
  22. def foldK[G[_], A](implicit arg0: <:<[C, G[A]], G: MonoidK[G]): G[A]
    Definition Classes
    Ops
  23. def foldLeft[B](b: B)(f: (B, C) ⇒ B): B
    Definition Classes
    Ops
  24. def foldLeftM[G[_], B](z: B)(f: (B, C) ⇒ G[B])(implicit G: Monad[G]): G[B]
    Definition Classes
    Ops
  25. def foldM[G[_], B](z: B)(f: (B, C) ⇒ G[B])(implicit G: Monad[G]): G[B]
    Definition Classes
    Ops
  26. def foldMap[B](f: (C) ⇒ B)(implicit B: Monoid[B]): B
    Definition Classes
    Ops
  27. def foldMapM[G[_], B](f: (C) ⇒ G[B])(implicit G: Monad[G], B: Monoid[B]): G[B]
    Definition Classes
    Ops
  28. def foldRight[B](lb: Eval[B])(f: (C, Eval[B]) ⇒ Eval[B]): Eval[B]
    Definition Classes
    Ops
  29. def forall(p: (C) ⇒ Boolean): Boolean
    Definition Classes
    Ops
  30. def forallM[G[_]](p: (C) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]
    Definition Classes
    Ops
  31. def fproduct[B](f: (C) ⇒ B): F[(C, B)]
    Definition Classes
    Ops
  32. def get(idx: Long): Option[C]
    Definition Classes
    Ops
  33. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  34. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  35. def imap[B](f: (C) ⇒ B)(g: (B) ⇒ C): F[B]
    Definition Classes
    Ops
  36. def intercalate(a: C)(implicit A: Monoid[C]): C
    Definition Classes
    Ops
  37. def isEmpty: Boolean
    Definition Classes
    Ops
  38. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  39. def map[B](f: (C) ⇒ B): F[B]
    Definition Classes
    Ops
  40. def mapWithIndex[B](f: (C, Int) ⇒ B): F[B]
    Definition Classes
    Ops
  41. def maximum(implicit A: Order[C]): C
    Definition Classes
    Ops
  42. def maximumOption(implicit A: Order[C]): Option[C]
    Definition Classes
    Ops
  43. def minimum(implicit A: Order[C]): C
    Definition Classes
    Ops
  44. def minimumOption(implicit A: Order[C]): Option[C]
    Definition Classes
    Ops
  45. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  46. def nonEmpty: Boolean
    Definition Classes
    Ops
  47. def nonEmptyFlatSequence[G[_], A](implicit arg0: <:<[C, G[F[A]]], G: Apply[G], F: FlatMap[F]): G[F[A]]
    Definition Classes
    Ops
  48. def nonEmptyFlatTraverse[G[_], B](f: (C) ⇒ G[F[B]])(implicit G: Apply[G], F: FlatMap[F]): G[F[B]]
    Definition Classes
    Ops
  49. def nonEmptyIntercalate(a: C)(implicit A: Semigroup[C]): C
    Definition Classes
    Ops
  50. def nonEmptyPartition[B, C](f: (C) ⇒ Either[B, C]): Ior[NonEmptyList[B], NonEmptyList[C]]
    Definition Classes
    Ops
  51. def nonEmptySequence[G[_], A](implicit arg0: <:<[C, G[A]], arg1: Apply[G]): G[F[A]]
    Definition Classes
    Ops
  52. def nonEmptySequence_[G[_], A](implicit arg0: <:<[C, G[A]], G: Apply[G]): G[Unit]
    Definition Classes
    Ops
  53. def nonEmptyTraverse[G[_], B](f: (C) ⇒ G[B])(implicit arg0: Apply[G]): G[F[B]]
    Definition Classes
    Ops
  54. def nonEmptyTraverse_[G[_], B](f: (C) ⇒ G[B])(implicit G: Apply[G]): G[Unit]
    Definition Classes
    Ops
  55. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  56. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  57. def partitionEither[B, C](f: (C) ⇒ Either[B, C])(implicit A: Alternative[F]): (F[B], F[C])
    Definition Classes
    Ops
  58. def reduce(implicit A: Semigroup[C]): C
    Definition Classes
    Ops
  59. def reduceK[G[_], A](implicit arg0: <:<[C, G[A]], G: SemigroupK[G]): G[A]
    Definition Classes
    Ops
  60. def reduceLeft(f: (C, C) ⇒ C): C
    Definition Classes
    Ops
  61. def reduceLeftM[G[_], B](f: (C) ⇒ G[B])(g: (B, C) ⇒ G[B])(implicit G: FlatMap[G]): G[B]
    Definition Classes
    Ops
  62. def reduceLeftOption(f: (C, C) ⇒ C): Option[C]
    Definition Classes
    Ops
  63. def reduceLeftTo[B](f: (C) ⇒ B)(g: (B, C) ⇒ B): B
    Definition Classes
    Ops
  64. def reduceLeftToOption[B](f: (C) ⇒ B)(g: (B, C) ⇒ B): Option[B]
    Definition Classes
    Ops
  65. def reduceMap[B](f: (C) ⇒ B)(implicit B: Semigroup[B]): B
    Definition Classes
    Ops
  66. def reduceMapM[G[_], B](f: (C) ⇒ G[B])(implicit G: FlatMap[G], B: Semigroup[B]): G[B]
    Definition Classes
    Ops
  67. def reduceRight(f: (C, Eval[C]) ⇒ Eval[C]): Eval[C]
    Definition Classes
    Ops
  68. def reduceRightOption(f: (C, Eval[C]) ⇒ Eval[C]): Eval[Option[C]]
    Definition Classes
    Ops
  69. def reduceRightTo[B](f: (C) ⇒ B)(g: (C, Eval[B]) ⇒ Eval[B]): Eval[B]
    Definition Classes
    Ops
  70. def reduceRightToOption[B](f: (C) ⇒ B)(g: (C, Eval[B]) ⇒ Eval[B]): Eval[Option[B]]
    Definition Classes
    Ops
  71. def sequence[G[_], A](implicit arg0: <:<[C, G[A]], arg1: Applicative[G]): G[F[A]]
    Definition Classes
    Ops
  72. def sequence_[G[_], A](implicit arg0: <:<[C, G[A]], arg1: Applicative[G]): G[Unit]
    Definition Classes
    Ops
  73. def size: Long
    Definition Classes
    Ops
  74. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  75. def takeWhile_(p: (C) ⇒ Boolean): List[C]
    Definition Classes
    Ops
  76. def toList: List[C]
    Definition Classes
    Ops
  77. def toNonEmptyList: NonEmptyList[C]
    Definition Classes
    Ops
  78. def toString(): String
    Definition Classes
    AnyRef → Any
  79. def traverse[G[_], B](f: (C) ⇒ G[B])(implicit arg0: Applicative[G]): G[F[B]]
    Definition Classes
    Ops
  80. def traverseWithIndexM[G[_], B](f: (C, Int) ⇒ G[B])(implicit G: Monad[G]): G[F[B]]
    Definition Classes
    Ops
  81. def traverse_[G[_], B](f: (C) ⇒ G[B])(implicit G: Applicative[G]): G[Unit]
    Definition Classes
    Ops
  82. def tupleLeft[B](b: B): F[(B, C)]
    Definition Classes
    Ops
  83. def tupleRight[B](b: B): F[(C, B)]
    Definition Classes
    Ops
  84. def unorderedFold(implicit arg0: CommutativeMonoid[C]): C
    Definition Classes
    Ops
  85. def unorderedFoldMap[B](f: (C) ⇒ B)(implicit arg0: CommutativeMonoid[B]): B
    Definition Classes
    Ops
  86. def unorderedSequence[G[_], A](implicit arg0: <:<[C, G[A]], arg1: CommutativeApplicative[G]): G[F[A]]
    Definition Classes
    Ops
  87. def unorderedTraverse[G[_], B](f: (C) ⇒ G[B])(implicit arg0: CommutativeApplicative[G]): G[F[B]]
    Definition Classes
    Ops
  88. def void: F[Unit]
    Definition Classes
    Ops
  89. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  90. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  91. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  92. def widen[B >: C]: F[B]
    Definition Classes
    Ops
  93. def zipWithIndex: F[(C, Int)]
    Definition Classes
    Ops

Inherited from Reducible.AllOps[F, C]

Inherited from Reducible.Ops[F, C]

Inherited from Traverse.AllOps[F, C]

Inherited from UnorderedTraverse.AllOps[F, C]

Inherited from UnorderedTraverse.Ops[F, C]

Inherited from Foldable.AllOps[F, C]

Inherited from UnorderedFoldable.AllOps[F, C]

Inherited from UnorderedFoldable.Ops[F, C]

Inherited from Foldable.Ops[F, C]

Inherited from Functor.AllOps[F, C]

Inherited from Invariant.AllOps[F, C]

Inherited from Invariant.Ops[F, C]

Inherited from Functor.Ops[F, C]

Inherited from Traverse.Ops[F, C]

Inherited from Ops[F, C]

Inherited from AnyRef

Inherited from Any

Ungrouped