trait DeriveEqualNonEmptyForEach[F[+_]] extends DeriveEqualForEach[F] with NonEmptyForEach[F]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DeriveEqualNonEmptyForEach
  2. NonEmptyForEach
  3. DeriveEqualForEach
  4. ForEach
  5. CovariantDeriveEqual
  6. Derive
  7. Covariant
  8. Invariant
  9. CovariantSubset
  10. AnyRef
  11. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract def derive[A](implicit arg0: Equal[A]): Equal[F[A]]
    Definition Classes
    Derive
  2. abstract def forEach1[G[+_], A, B](fa: F[A])(f: (A) => G[B])(implicit arg0: AssociativeBoth[G], arg1: Covariant[G]): G[F[B]]

    Traverse each element in the collection using the specified effectual function f, returning a new collection with the results in the context of the effect.

    Traverse each element in the collection using the specified effectual function f, returning a new collection with the results in the context of the effect.

    Definition Classes
    NonEmptyForEach

Concrete Value Members

  1. final def compose[G[+_]](implicit arg0: ForEach[G]): ForEach[[+A]F[G[A]]]
    Definition Classes
    ForEach
  2. final def compose[G[-_]](implicit g: Contravariant[G]): Contravariant[[-A]F[G[A]]]

    Compose covariant and contravariant functors.

    Compose covariant and contravariant functors.

    Definition Classes
    Covariant
  3. final def compose[G[+_]](implicit g: Covariant[G]): Covariant[[+A]F[G[A]]]

    Compose two covariant functors.

    Compose two covariant functors.

    Definition Classes
    Covariant
  4. final def compose[G[_]](implicit g: Invariant[G]): Invariant[[A]F[G[A]]]

    Compose two invariant functors.

    Compose two invariant functors.

    Definition Classes
    Invariant
  5. def compositionLaw[A, B, C](fa: F[A], f: <=>[A, B], g: <=>[B, C])(implicit equal: Equal[F[C]]): Boolean
    Definition Classes
    Invariant
  6. def concatenate[A](fa: F[A])(implicit arg0: Identity[A]): A

    Reduces the collection to a summary value using the associative operation.

    Reduces the collection to a summary value using the associative operation. Alias for fold.

    Definition Classes
    ForEach
  7. def contains[A, A1 >: A](fa: F[A])(a: A1)(implicit A: Equal[A1]): Boolean

    Returns whether the collection contains the specified element.

    Returns whether the collection contains the specified element.

    Definition Classes
    ForEach
  8. def count[A](fa: F[A])(f: (A) => Boolean): Int

    Returns the number of elements in the collection that satisfy the specified predicate.

    Returns the number of elements in the collection that satisfy the specified predicate.

    Definition Classes
    ForEach
  9. def exists[A](fa: F[A])(f: (A) => Boolean): Boolean

    Returns whether any element of the collection satisfies the specified predicate.

    Returns whether any element of the collection satisfies the specified predicate.

    Definition Classes
    ForEach
  10. def find[A](fa: F[A])(f: (A) => Boolean): Option[A]

    Returns the first element in the collection satisfying the specified predicate if one exists or None otherwise.

    Returns the first element in the collection satisfying the specified predicate if one exists or None otherwise.

    Definition Classes
    ForEach
  11. def flip[G[+_], A](fa: F[G[A]])(implicit arg0: IdentityBoth[G], arg1: Covariant[G]): G[F[A]]

    Converts a collection with elements that are in the context of effects to a collection of elements in the context of an effect.

    Converts a collection with elements that are in the context of effects to a collection of elements in the context of an effect.

    Definition Classes
    ForEach
  12. def flip1[G[+_], A](fa: F[G[A]])(implicit arg0: AssociativeBoth[G], arg1: Covariant[G]): G[F[A]]

    Converts a collection with elements that are in the context of effects to a collection of elements in the context of an effect.

    Converts a collection with elements that are in the context of effects to a collection of elements in the context of an effect.

    Definition Classes
    NonEmptyForEach
  13. def fold[A](fa: F[A])(implicit arg0: Identity[A]): A

    Folds over the elements of this collection using an associative operation and an identity.

    Folds over the elements of this collection using an associative operation and an identity. Alias for reduceIdentity.

    Definition Classes
    ForEach
  14. def foldLeft[S, A](fa: F[A])(s: S)(f: (S, A) => S): S

    Folds over the elements of this collection from left to right to produce a summary value, maintaining some internal state along the way.

    Folds over the elements of this collection from left to right to produce a summary value, maintaining some internal state along the way.

    Definition Classes
    ForEach
  15. def foldLeftM[G[+_], S, A](fa: F[A])(s: S)(f: (S, A) => G[S])(implicit arg0: IdentityFlatten[G], arg1: Covariant[G]): G[S]

    Effectually fold over the elements of this collection from left to right to produce a summary value, maintaining some internal state along the way.

    Effectually fold over the elements of this collection from left to right to produce a summary value, maintaining some internal state along the way.

    Definition Classes
    ForEach
  16. def foldMap[A, B](fa: F[A])(f: (A) => B)(implicit arg0: Identity[B]): B

    Maps each element of the collection to a type B for which an Identity is defined using the function f, then reduces those values to a single summary using the combine operation of Identity, or the identity element if the collection is empty.

    Maps each element of the collection to a type B for which an Identity is defined using the function f, then reduces those values to a single summary using the combine operation of Identity, or the identity element if the collection is empty.

    Definition Classes
    ForEach
  17. def foldMapM[G[+_], A, B](fa: F[A])(f: (A) => G[B])(implicit arg0: Covariant[G], arg1: IdentityFlatten[G], arg2: Identity[B]): G[B]

    Effectfully maps each element of the collection to a type B for which an Identity is defined using the function f, then reduces those values to a single summary using the combine operation of Identity, or the identity element if the collection is empty.

    Effectfully maps each element of the collection to a type B for which an Identity is defined using the function f, then reduces those values to a single summary using the combine operation of Identity, or the identity element if the collection is empty.

    Definition Classes
    ForEach
  18. def foldRight[S, A](fa: F[A])(s: S)(f: (A, S) => S): S

    Folds over the elements of this collection from right to left to produce a summary value, maintaining some internal state along the way.

    Folds over the elements of this collection from right to left to produce a summary value, maintaining some internal state along the way.

    Definition Classes
    ForEach
  19. def foldRightM[G[+_], S, A](fa: F[A])(s: S)(f: (A, S) => G[S])(implicit arg0: IdentityFlatten[G], arg1: Covariant[G]): G[S]

    Effectually fold over the elements of this collection from right to left to produce a summary value, maintaining some internal state along the way.

    Effectually fold over the elements of this collection from right to left to produce a summary value, maintaining some internal state along the way.

    Definition Classes
    ForEach
  20. def forEach[G[+_], A, B](fa: F[A])(f: (A) => G[B])(implicit arg0: IdentityBoth[G], arg1: Covariant[G]): G[F[B]]

    Traverse each element in the collection using the specified effectual function f, returning a new collection with the results in the context of the effect.

    Traverse each element in the collection using the specified effectual function f, returning a new collection with the results in the context of the effect.

    Definition Classes
    NonEmptyForEach → ForEach
  21. def forEach1_[G[+_], A](fa: F[A])(f: (A) => G[Any])(implicit arg0: AssociativeBoth[G], arg1: Covariant[G]): G[Unit]

    Traverses each element in the collection with the specified effectual function f purely for its effects.

    Traverses each element in the collection with the specified effectual function f purely for its effects.

    Definition Classes
    NonEmptyForEach
  22. def forEach_[G[+_], A](fa: F[A])(f: (A) => G[Any])(implicit arg0: IdentityBoth[G], arg1: Covariant[G]): G[Unit]

    Traverses each element in the collection with the specified effectual function f purely for its effects.

    Traverses each element in the collection with the specified effectual function f purely for its effects.

    Definition Classes
    ForEach
  23. def forall[A](fa: F[A])(f: (A) => Boolean): Boolean

    Returns whether any element of the collection satisfies the specified predicate.

    Returns whether any element of the collection satisfies the specified predicate.

    Definition Classes
    ForEach
  24. def fproduct[A, B](f: (A) => B): (F[A]) => F[(A, B)]
    Definition Classes
    Covariant
  25. def fproductLeft[A, B](f: (A) => B): (F[A]) => F[(B, A)]
    Definition Classes
    Covariant
  26. def groupByNonEmpty[V, K](fa: F[V])(f: (V) => K): Map[K, NonEmptyChunk[V]]
    Definition Classes
    ForEach
  27. def groupByNonEmptyM[G[+_], V, K](fa: F[V])(f: (V) => G[K])(implicit arg0: IdentityBoth[G], arg1: Covariant[G]): G[Map[K, NonEmptyChunk[V]]]
    Definition Classes
    ForEach
  28. def identityLaw1[A](fa: F[A])(implicit equal: Equal[F[A]]): Boolean
    Definition Classes
    Invariant
  29. def intersperse[A](fa: F[A], middle: A)(implicit I: Identity[A]): A

    Folds over the elements of this collection using an associative operation with the middle element interspersed between every element.

    Folds over the elements of this collection using an associative operation with the middle element interspersed between every element.

    Definition Classes
    ForEach
  30. final def invmap[A, B](f: <=>[A, B]): <=>[F[A], F[B]]
    Definition Classes
    Covariant → Invariant
  31. def isEmpty[A](fa: F[A]): Boolean

    Returns whether the collection is empty.

    Returns whether the collection is empty.

    Definition Classes
    ForEach
  32. def map[A, B](f: (A) => B): (F[A]) => F[B]

    Lifts a function operating on values to a function that operates on each element of a collection.

    Lifts a function operating on values to a function that operates on each element of a collection.

    Definition Classes
    ForEach → Covariant
  33. def mapAccum[S, A, B](fa: F[A])(s: S)(f: (S, A) => (S, B)): (S, F[B])

    Statefully maps over the elements of the collection, maintaining some state along the way and returning the final state along with the new collection.

    Statefully maps over the elements of the collection, maintaining some state along the way and returning the final state along with the new collection.

    Definition Classes
    ForEach
  34. final def mapSubset[A, B](f: (A) => B)(implicit arg0: AnyType[B]): (F[A]) => F[B]
    Definition Classes
    Covariant → CovariantSubset
  35. def max[A](fa: F[A])(implicit arg0: Ord[A]): A

    Returns the largest value in the collection if one exists or None otherwise.

    Returns the largest value in the collection if one exists or None otherwise.

    Definition Classes
    NonEmptyForEach
  36. def maxBy[A, B](fa: F[A])(f: (A) => B)(implicit arg0: Ord[B]): A

    Returns the largest element in the collection if one exists, using the function f to map each element to a type for which an Ord is defined, or None otherwise.

    Returns the largest element in the collection if one exists, using the function f to map each element to a type for which an Ord is defined, or None otherwise.

    Definition Classes
    NonEmptyForEach
  37. def maxByOption[A, B](fa: F[A])(f: (A) => B)(implicit arg0: Ord[B]): Option[A]

    Returns the largest element in the collection if one exists, using the function f to map each element to a type for which an Ord is defined, or None otherwise.

    Returns the largest element in the collection if one exists, using the function f to map each element to a type for which an Ord is defined, or None otherwise.

    Definition Classes
    ForEach
  38. def maxOption[A](fa: F[A])(implicit arg0: Ord[A]): Option[A]

    Returns the largest value in the collection if one exists or None otherwise.

    Returns the largest value in the collection if one exists or None otherwise.

    Definition Classes
    ForEach
  39. def min[A](fa: F[A])(implicit arg0: Ord[A]): A

    Returns the smallest value in the collection if one exists or None otherwise.

    Returns the smallest value in the collection if one exists or None otherwise.

    Definition Classes
    NonEmptyForEach
  40. def minBy[A, B](fa: F[A])(f: (A) => B)(implicit arg0: Ord[B]): A

    Returns the smallest element in the collection if one exists, using the function f to map each element to a type for which an Ord is defined, or None otherwise.

    Returns the smallest element in the collection if one exists, using the function f to map each element to a type for which an Ord is defined, or None otherwise.

    Definition Classes
    NonEmptyForEach
  41. def minByOption[A, B](fa: F[A])(f: (A) => B)(implicit arg0: Ord[B]): Option[A]

    Returns the smallest element in the collection if one exists, using the function f to map each element to a type for which an Ord is defined, or None otherwise.

    Returns the smallest element in the collection if one exists, using the function f to map each element to a type for which an Ord is defined, or None otherwise.

    Definition Classes
    ForEach
  42. def minOption[A](fa: F[A])(implicit arg0: Ord[A]): Option[A]

    Returns the smallest value in the collection if one exists or None otherwise.

    Returns the smallest value in the collection if one exists or None otherwise.

    Definition Classes
    ForEach
  43. def nonEmpty[A](fa: F[A]): Boolean

    Returns whether the collection contains at least one element

    Returns whether the collection contains at least one element

    Definition Classes
    ForEach
  44. def partitionMap[A, B, C](fa: F[A])(f: (A) => Either[B, C])(implicit both: IdentityBoth[F], either: IdentityEither[F]): (F[B], F[C])

    Partitions the collection based on the specified function.

    Partitions the collection based on the specified function.

    Definition Classes
    ForEach
  45. def partitionMapM[G[+_], A, B, C](fa: F[A])(f: (A) => G[Either[B, C]])(implicit arg0: IdentityFlatten[G], arg1: Covariant[G], both: IdentityBoth[F], either: IdentityEither[F]): G[(F[B], F[C])]

    Partitions the collection based on the specified effectual function.

    Partitions the collection based on the specified effectual function.

    Definition Classes
    ForEach
  46. def partitionMapV[W, E, A, B](fa: F[A])(f: (A) => ZValidation[W, E, B])(implicit both: IdentityBoth[F], either: IdentityEither[F]): (F[E], F[B])

    Partitions the collection based on the specified validation function.

    Partitions the collection based on the specified validation function.

    Definition Classes
    ForEach
  47. def product[A](fa: F[A])(implicit ev: Identity[Prod[A]]): A

    Returns the product of all elements in the collection.

    Returns the product of all elements in the collection.

    Definition Classes
    ForEach
  48. def reduce1[A](fa: F[A])(implicit arg0: Associative[A]): A

    Reduces the non-empty collection of associative elements.

    Reduces the non-empty collection of associative elements.

    Definition Classes
    NonEmptyForEach
  49. def reduceAll[A](fa: F[A])(f: (A, A) => A): A

    Reduces the collection to a summary value using the binary function f.

    Reduces the collection to a summary value using the binary function f.

    Definition Classes
    NonEmptyForEach
  50. def reduceAssociative[A](fa: F[A])(implicit arg0: Associative[A]): Option[A]

    Reduces the collection to a summary value using the associative operation, returning None if the collection is empty.

    Reduces the collection to a summary value using the associative operation, returning None if the collection is empty.

    Definition Classes
    ForEach
  51. def reduceIdempotent[A](fa: F[A])(implicit arg0: Idempotent[A], arg1: Equal[A]): Option[A]

    Reduces the collection to a summary value using the idempotent operation, returning None if the collection is empty.

    Reduces the collection to a summary value using the idempotent operation, returning None if the collection is empty.

    Definition Classes
    ForEach
  52. def reduceIdempotent1[A](fa: F[A])(implicit arg0: Idempotent[A], arg1: Equal[A]): A

    Reduces the collection to a summary value using the idempotent operation, returning None if the collection is empty.

    Reduces the collection to a summary value using the idempotent operation, returning None if the collection is empty.

    Definition Classes
    NonEmptyForEach
  53. def reduceIdentity[A](fa: F[A])(implicit arg0: Identity[A]): A

    Reduces the collection to a summary value using the associative operation.

    Reduces the collection to a summary value using the associative operation. Alias for fold.

    Definition Classes
    ForEach
  54. def reduceMap[A, B](fa: F[A])(f: (A) => B)(implicit arg0: Associative[B]): B

    Maps each element of the collection to a type B for which a combine operation is defined using the function f and then reduces those values to a single summary using the combine operation.

    Maps each element of the collection to a type B for which a combine operation is defined using the function f and then reduces those values to a single summary using the combine operation.

    Definition Classes
    NonEmptyForEach
  55. def reduceMapLeft[A, B](fa: F[A])(map: (A) => B)(reduce: (B, A) => B): B

    Reduces the elements of this collection from left to right using the function map to transform the first value to the type B and then the function reduceAll to combine the B value with each other A value.

    Reduces the elements of this collection from left to right using the function map to transform the first value to the type B and then the function reduceAll to combine the B value with each other A value.

    Definition Classes
    NonEmptyForEach
  56. def reduceMapOption[A, B](fa: F[A])(f: (A) => B)(implicit arg0: Associative[B]): Option[B]

    Maps each element of the collection to a type B for which an associative operation exists and then reduces the values using the associative operation, returning None if the collection is empty.

    Maps each element of the collection to a type B for which an associative operation exists and then reduces the values using the associative operation, returning None if the collection is empty.

    Definition Classes
    ForEach
  57. def reduceMapRight[A, B](fa: F[A])(map: (A) => B)(reduce: (A, B) => B): B

    Reduces the elements of this colection from right to left using the function map to transform the first value to the type B and then the function reduceAll to combine the B value with each other A value.

    Reduces the elements of this colection from right to left using the function map to transform the first value to the type B and then the function reduceAll to combine the B value with each other A value.

    Definition Classes
    NonEmptyForEach
  58. def reduceOption[A](fa: F[A])(f: (A, A) => A): Option[A]

    Reduces the collection to a summary value using the binary function f, returning None if the collection is empty.

    Reduces the collection to a summary value using the binary function f, returning None if the collection is empty.

    Definition Classes
    ForEach
  59. def reverse[A](fa: F[A]): F[A]

    Reverses the order of elements in the collection.

    Reverses the order of elements in the collection.

    Definition Classes
    ForEach
  60. def size[A](fa: F[A]): Int

    Returns the number of elements in the collection.

    Returns the number of elements in the collection.

    Definition Classes
    ForEach
  61. def sum[A](fa: F[A])(implicit ev: Identity[Sum[A]]): A

    Returns the sum of all elements in the collection.

    Returns the sum of all elements in the collection.

    Definition Classes
    ForEach
  62. def toChunk[A](fa: F[A]): Chunk[A]

    Converts the collection to a Chunk.

    Converts the collection to a Chunk.

    Definition Classes
    ForEach
  63. def toList[A](fa: F[A]): List[A]

    Converts the collection to a List.

    Converts the collection to a List.

    Definition Classes
    ForEach
  64. def toNonEmptyChunk[A](fa: F[A]): NonEmptyChunk[A]

    Converts the collection to a NonEmptyChunk.

    Converts the collection to a NonEmptyChunk.

    Definition Classes
    NonEmptyForEach
  65. def toNonEmptyList[A](fa: F[A]): NonEmptyList[A]

    Converts the collection to a NonEmptyList.

    Converts the collection to a NonEmptyList.

    Definition Classes
    NonEmptyForEach
  66. def zipAll[A, B, C](fa: F[A], fb: F[B])(implicit both: IdentityBoth[F], either: IdentityEither[F]): F[These[A, B]]

    Zips the left collection and right collection together, using None to handle the case where one collection is larger than the other.

    Zips the left collection and right collection together, using None to handle the case where one collection is larger than the other.

    Definition Classes
    ForEach
  67. def zipAllWith[A, B, C](fa: F[A], fb: F[B])(f: (These[A, B]) => C)(implicit both: IdentityBoth[F], either: IdentityEither[F]): F[C]

    Zips the left collection and right collection together, using the specified function to handle the cases where one collection is larger than the other.

    Zips the left collection and right collection together, using the specified function to handle the cases where one collection is larger than the other.

    Definition Classes
    ForEach
  68. def zipWithIndex[A](fa: F[A]): F[(A, Int)]

    Zips each element of the collection with its index.

    Zips each element of the collection with its index.

    Definition Classes
    ForEach