Packages

implicit class ForEachOps[F[+_], A] extends AnyRef

Provides infix syntax for traversing collections.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ForEachOps
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ForEachOps(self: F[A])

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. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @HotSpotIntrinsicCandidate()
  6. def collect[B](pf: PartialFunction[A, B])(implicit F: ForEach[F], I: IdentityEither[F], B: IdentityBoth[F]): F[B]
  7. def collectM[G[+_], B](f: (A) ⇒ G[Option[B]])(implicit arg0: IdentityBoth[G], arg1: Covariant[G], F: ForEach[F], I: IdentityEither[F], B: IdentityBoth[F]): G[F[B]]
  8. def concatenate(implicit F: ForEach[F], A: Identity[A]): A
  9. def contains[A1 >: A](a: A1)(implicit A: Equal[A1], F: ForEach[F]): Boolean
  10. def count(f: (A) ⇒ Boolean)(implicit F: ForEach[F]): Int
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  13. def exists(f: (A) ⇒ Boolean)(implicit F: ForEach[F]): Boolean
  14. def filter(f: (A) ⇒ Boolean)(implicit F: ForEach[F], I: IdentityEither[F], B: IdentityBoth[F]): F[A]
  15. def filterM[G[+_]](f: (A) ⇒ G[Boolean])(implicit arg0: IdentityBoth[G], arg1: Covariant[G], F: ForEach[F], I: IdentityEither[F], B: IdentityBoth[F]): G[F[A]]
  16. def find(f: (A) ⇒ Boolean)(implicit F: ForEach[F]): Option[A]
  17. def foldLeft[S](s: S)(f: (S, A) ⇒ S)(implicit F: ForEach[F]): S
  18. def foldLeftM[G[+_], S](s: S)(f: (S, A) ⇒ G[S])(implicit arg0: IdentityFlatten[G], arg1: Covariant[G], F: ForEach[F]): G[S]
  19. def foldMap[B](f: (A) ⇒ B)(implicit arg0: Identity[B], F: ForEach[F]): B
  20. def foldMapM[G[+_], B](f: (A) ⇒ G[B])(implicit arg0: Covariant[G], arg1: IdentityBoth[G], arg2: Identity[B], F: ForEach[F]): G[B]
  21. def foldRight[S](s: S)(f: (A, S) ⇒ S)(implicit F: ForEach[F]): S
  22. def foldRightM[G[+_], S](s: S)(f: (A, S) ⇒ G[S])(implicit arg0: IdentityFlatten[G], arg1: Covariant[G], F: ForEach[F]): G[S]
  23. def forEach[G[+_], B](f: (A) ⇒ G[B])(implicit arg0: IdentityBoth[G], arg1: Covariant[G], F: ForEach[F]): G[F[B]]
  24. def forEachFlatten[G[+_], B](f: (A) ⇒ G[F[B]])(implicit arg0: IdentityBoth[G], arg1: Covariant[G], F: ForEach[F], AF: AssociativeFlatten[F]): G[F[B]]
  25. def forEach_[G[+_]](f: (A) ⇒ G[Any])(implicit arg0: IdentityBoth[G], arg1: Covariant[G], F: ForEach[F]): G[Unit]
  26. def forall(f: (A) ⇒ Boolean)(implicit F: ForEach[F]): Boolean
  27. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  28. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  29. def intersperse[A1 >: A](middle: A1)(implicit F: ForEach[F], I: Identity[A1]): A1
  30. def isEmpty(implicit F: ForEach[F]): Boolean
  31. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  32. def mapAccum[S, B](s: S)(f: (S, A) ⇒ (S, B))(implicit F: ForEach[F]): (S, F[B])
  33. def maxByOption[B](f: (A) ⇒ B)(implicit arg0: Ord[B], F: ForEach[F]): Option[A]
  34. def maxOption(implicit A: Ord[A], F: ForEach[F]): Option[A]
  35. def minByOption[B](f: (A) ⇒ B)(implicit arg0: Ord[B], F: ForEach[F]): Option[A]
  36. def minOption(implicit A: Ord[A], F: ForEach[F]): Option[A]
  37. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  38. def nonEmpty(implicit F: ForEach[F]): Boolean
  39. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  40. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  41. def product(implicit A: Identity[Prod[A]], F: ForEach[F]): A
  42. def reduceAssociative(implicit F: ForEach[F], A: Associative[A]): Option[A]
  43. def reduceIdempotent(implicit F: ForEach[F], ia: Idempotent[A], ea: Equal[A]): Option[A]
  44. def reduceIdentity(implicit F: ForEach[F], A: Identity[A]): A
  45. def reduceMapOption[B](f: (A) ⇒ B)(implicit arg0: Associative[B], F: ForEach[F]): Option[B]
  46. def reduceOption(f: (A, A) ⇒ A)(implicit F: ForEach[F]): Option[A]
  47. def reverse(implicit F: ForEach[F]): F[A]
  48. def size(implicit F: ForEach[F]): Int
  49. def sum(implicit A: Identity[Sum[A]], F: ForEach[F]): A
  50. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  51. def toChunk(implicit F: ForEach[F]): Chunk[A]
  52. def toString(): String
    Definition Classes
    AnyRef → Any
  53. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  54. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  55. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  56. def withFilter(f: (A) ⇒ Boolean)(implicit F: ForEach[F], I: IdentityEither[F], B: IdentityBoth[F]): F[A]
  57. def zipAll[B](that: F[B])(implicit F: ForEach[F], both: IdentityBoth[F], either: IdentityEither[F]): F[These[A, B]]
  58. def zipAllWith[B, C](that: F[B])(f: (These[A, B]) ⇒ C)(implicit F: ForEach[F], both: IdentityBoth[F], either: IdentityEither[F]): F[C]
  59. def zipWithIndex(implicit F: ForEach[F]): F[(A, Int)]

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated
    Deprecated

Inherited from AnyRef

Inherited from Any

Ungrouped