c

cats

NonEmptyReducible

abstract class NonEmptyReducible[F[_], G[_]] extends Reducible[F]

This class defines a Reducible[F] in terms of a Foldable[G] together with a split method, F[A] => (A, G[A]).

This class can be used on any type where the first value (A) and the "rest" of the values (G[A]) can be easily found.

Source
Reducible.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NonEmptyReducible
  2. Reducible
  3. Foldable
  4. UnorderedFoldable
  5. Serializable
  6. Serializable
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NonEmptyReducible()(implicit G: Foldable[G])

Abstract Value Members

  1. abstract def split[A](fa: F[A]): (A, G[A])

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. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  6. def collectFirst[A, B](fa: F[A])(pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    Foldable
  7. def collectFirstSome[A, B](fa: F[A])(f: (A) ⇒ Option[B]): Option[B]

    Like collectFirst from scala.collection.Traversable but takes A => Option[B] instead of PartialFunctions.

    Like collectFirst from scala.collection.Traversable but takes A => Option[B] instead of PartialFunctions.

    scala> import cats.implicits._
    scala> val keys = List(1, 2, 4, 5)
    scala> val map = Map(4 -> "Four", 5 -> "Five")
    scala> keys.collectFirstSome(map.get)
    res0: Option[String] = Some(Four)
    scala> val map2 = Map(6 -> "Six", 7 -> "Seven")
    scala> keys.collectFirstSome(map2.get)
    res1: Option[String] = None
    Definition Classes
    Foldable
  8. def combineAll[A](fa: F[A])(implicit arg0: Monoid[A]): A

    Alias for fold.

    Alias for fold.

    Definition Classes
    Foldable
  9. def compose[G[_]](implicit arg0: Reducible[G]): Reducible[[α]F[G[α]]]
    Definition Classes
    Reducible
  10. def compose[G[_]](implicit arg0: Foldable[G]): Foldable[[α]F[G[α]]]
    Definition Classes
    Foldable
  11. def dropWhile_[A](fa: F[A])(p: (A) ⇒ Boolean): List[A]

    Convert F[A] to a List[A], dropping all initial elements which match p.

    Convert F[A] to a List[A], dropping all initial elements which match p.

    Definition Classes
    NonEmptyReducibleFoldable
  12. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  14. def exists[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean

    Check whether at least one element satisfies the predicate.

    Check whether at least one element satisfies the predicate.

    If there are no elements, the result is false.

    Definition Classes
    NonEmptyReducibleFoldableUnorderedFoldable
  15. def existsM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]

    Check whether at least one element satisfies the effectful predicate.

    Check whether at least one element satisfies the effectful predicate.

    If there are no elements, the result is false. existsM short-circuits, i.e. once a true result is encountered, no further effects are produced.

    For example:

    scala> import cats.implicits._
    scala> val F = Foldable[List]
    scala> F.existsM(List(1,2,3,4))(n => Option(n <= 4))
    res0: Option[Boolean] = Some(true)
    
    scala> F.existsM(List(1,2,3,4))(n => Option(n > 4))
    res1: Option[Boolean] = Some(false)
    
    scala> F.existsM(List(1,2,3,4))(n => if (n <= 2) Option(true) else Option(false))
    res2: Option[Boolean] = Some(true)
    
    scala> F.existsM(List(1,2,3,4))(n => if (n <= 2) Option(true) else None)
    res3: Option[Boolean] = Some(true)
    
    scala> F.existsM(List(1,2,3,4))(n => if (n <= 2) None else Option(true))
    res4: Option[Boolean] = None
    Definition Classes
    Foldable
  16. def filter_[A](fa: F[A])(p: (A) ⇒ Boolean): List[A]

    Convert F[A] to a List[A], only including elements which match p.

    Convert F[A] to a List[A], only including elements which match p.

    Definition Classes
    NonEmptyReducibleFoldable
  17. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  18. def find[A](fa: F[A])(f: (A) ⇒ Boolean): Option[A]

    Find the first element matching the predicate, if one exists.

    Find the first element matching the predicate, if one exists.

    Definition Classes
    NonEmptyReducibleFoldable
  19. def fold[A](fa: F[A])(implicit A: Monoid[A]): A

    Fold implemented using the given Monoid[A] instance.

    Fold implemented using the given Monoid[A] instance.

    Definition Classes
    NonEmptyReducibleFoldable
  20. def foldK[G[_], A](fga: F[G[A]])(implicit G: MonoidK[G]): G[A]

    Fold implemented using the given MonoidK[G] instance.

    Fold implemented using the given MonoidK[G] instance.

    This method is identical to fold, except that we use the universal monoid (MonoidK[G]) to get a Monoid[G[A]] instance.

    For example:

    scala> import cats.implicits._
    scala> val F = Foldable[List]
    scala> F.foldK(List(1 :: 2 :: Nil, 3 :: 4 :: 5 :: Nil))
    res0: List[Int] = List(1, 2, 3, 4, 5)
    Definition Classes
    Foldable
  21. def foldLeft[A, B](fa: F[A], b: B)(f: (B, A) ⇒ B): B

    Left associative fold on 'F' using the function 'f'.

    Left associative fold on 'F' using the function 'f'.

    Example:

    scala> import cats.Foldable, cats.implicits._
    scala> val fa = Option(1)
    
    Folding by addition to zero:
    scala> Foldable[Option].foldLeft(fa, Option(0))((a, n) => a.map(_ + n))
    res0: Option[Int] = Some(1)

    With syntax extensions, foldLeft can be used like:

    Folding `Option` with addition from zero:
    scala> fa.foldLeft(Option(0))((a, n) => a.map(_ + n))
    res1: Option[Int] = Some(1)
    
    There's also an alias `foldl` which is equivalent:
    scala> fa.foldl(Option(0))((a, n) => a.map(_ + n))
    res2: Option[Int] = Some(1)
    Definition Classes
    NonEmptyReducibleFoldable
  22. final def foldLeftM[G[_], A, B](fa: F[A], z: B)(f: (B, A) ⇒ G[B])(implicit G: Monad[G]): G[B]

    Alias for foldM.

    Alias for foldM.

    Definition Classes
    Foldable
  23. def foldM[H[_], A, B](fa: F[A], z: B)(f: (B, A) ⇒ H[B])(implicit H: Monad[H]): H[B]

    Perform a stack-safe monadic left fold from the source context F into the target monad G.

    Perform a stack-safe monadic left fold from the source context F into the target monad G.

    This method can express short-circuiting semantics. Even when fa is an infinite structure, this method can potentially terminate if the foldRight implementation for F and the tailRecM implementation for G are sufficiently lazy.

    Instances for concrete structures (e.g. List) will often have a more efficient implementation than the default one in terms of foldRight.

    Definition Classes
    NonEmptyReducibleFoldable
  24. def foldMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit B: Monoid[B]): B

    Fold implemented by mapping A values into B and then combining them using the given Monoid[B] instance.

    Fold implemented by mapping A values into B and then combining them using the given Monoid[B] instance.

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

    Monadic folding on F by mapping A values to G[B], combining the B values using the given Monoid[B] instance.

    Monadic folding on F by mapping A values to G[B], combining the B values using the given Monoid[B] instance.

    Similar to foldM, but using a Monoid[B].

    scala> import cats.Foldable
    scala> import cats.implicits._
    scala> val evenNumbers = List(2,4,6,8,10)
    scala> val evenOpt: Int => Option[Int] =
         |   i => if (i % 2 == 0) Some(i) else None
    scala> Foldable[List].foldMapM(evenNumbers)(evenOpt)
    res0: Option[Int] = Some(30)
    scala> Foldable[List].foldMapM(evenNumbers :+ 11)(evenOpt)
    res1: Option[Int] = None
    Definition Classes
    Foldable
  26. def foldRight[A, B](fa: F[A], lb: Eval[B])(f: (A, Eval[B]) ⇒ Eval[B]): Eval[B]

    Right associative lazy fold on F using the folding function 'f'.

    Right associative lazy fold on F using the folding function 'f'.

    This method evaluates lb lazily (in some cases it will not be needed), and returns a lazy value. We are using (A, Eval[B]) => Eval[B] to support laziness in a stack-safe way. Chained computation should be performed via .map and .flatMap.

    For more detailed information about how this method works see the documentation for Eval[_].

    Example:

    scala> import cats.Foldable, cats.Eval, cats.implicits._
    scala> val fa = Option(1)
    
    Folding by addition to zero:
    scala> val folded1 = Foldable[Option].foldRight(fa, Eval.now(0))((n, a) => a.map(_ + n))
    Since `foldRight` yields a lazy computation, we need to force it to inspect the result:
    scala> folded1.value
    res0: Int = 1
    
    With syntax extensions, we can write the same thing like this:
    scala> val folded2 = fa.foldRight(Eval.now(0))((n, a) => a.map(_ + n))
    scala> folded2.value
    res1: Int = 1
    
    Unfortunately, since `foldRight` is defined on many collections - this
    extension clashes with the operation defined in `Foldable`.
    
    To get past this and make sure you're getting the lazy `foldRight` defined
    in `Foldable`, there's an alias `foldr`:
    scala> val folded3 = fa.foldr(Eval.now(0))((n, a) => a.map(_ + n))
    scala> folded3.value
    res1: Int = 1
    Definition Classes
    NonEmptyReducibleFoldable
  27. def forall[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean

    Check whether all elements satisfy the predicate.

    Check whether all elements satisfy the predicate.

    If there are no elements, the result is true.

    Definition Classes
    NonEmptyReducibleFoldableUnorderedFoldable
  28. def forallM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]

    Check whether all elements satisfy the effectful predicate.

    Check whether all elements satisfy the effectful predicate.

    If there are no elements, the result is true. forallM short-circuits, i.e. once a false result is encountered, no further effects are produced.

    For example:

    scala> import cats.implicits._
    scala> val F = Foldable[List]
    scala> F.forallM(List(1,2,3,4))(n => Option(n <= 4))
    res0: Option[Boolean] = Some(true)
    
    scala> F.forallM(List(1,2,3,4))(n => Option(n <= 1))
    res1: Option[Boolean] = Some(false)
    
    scala> F.forallM(List(1,2,3,4))(n => if (n <= 2) Option(true) else Option(false))
    res2: Option[Boolean] = Some(false)
    
    scala> F.forallM(List(1,2,3,4))(n => if (n <= 2) Option(false) else None)
    res3: Option[Boolean] = Some(false)
    
    scala> F.forallM(List(1,2,3,4))(n => if (n <= 2) None else Option(false))
    res4: Option[Boolean] = None
    Definition Classes
    Foldable
  29. def get[A](fa: F[A])(idx: Long): Option[A]

    Get the element at the index of the Foldable.

    Get the element at the index of the Foldable.

    Definition Classes
    NonEmptyReducibleFoldable
  30. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  31. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  32. def intercalate[A](fa: F[A], a: A)(implicit A: Monoid[A]): A

    Intercalate/insert an element between the existing elements while folding.

    Intercalate/insert an element between the existing elements while folding.

    scala> import cats.implicits._
    scala> Foldable[List].intercalate(List("a","b","c"), "-")
    res0: String = a-b-c
    scala> Foldable[List].intercalate(List("a"), "-")
    res1: String = a
    scala> Foldable[List].intercalate(List.empty[String], "-")
    res2: String = ""
    scala> Foldable[Vector].intercalate(Vector(1,2,3), 1)
    res3: Int = 8
    Definition Classes
    Foldable
  33. def intersperseList[A](xs: List[A], x: A): List[A]
    Attributes
    protected
    Definition Classes
    Foldable
  34. def isEmpty[A](fa: F[A]): Boolean

    Returns true if there are no elements.

    Returns true if there are no elements. Otherwise false.

    Definition Classes
    ReducibleFoldableUnorderedFoldable
  35. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  36. def maximum[A](fa: F[A])(implicit A: Order[A]): A
    Definition Classes
    Reducible
  37. def maximumOption[A](fa: F[A])(implicit A: Order[A]): Option[A]

    Find the maximum A item in this structure according to the Order[A].

    Find the maximum A item in this structure according to the Order[A].

    returns

    None if the structure is empty, otherwise the maximum element wrapped in a Some.

    Definition Classes
    ReducibleFoldable
    See also

    Reducible#maximum for a version that doesn't need to return an Option for structures that are guaranteed to be non-empty.

    minimumOption for minimum instead of maximum.

  38. def minimum[A](fa: F[A])(implicit A: Order[A]): A
    Definition Classes
    Reducible
  39. def minimumOption[A](fa: F[A])(implicit A: Order[A]): Option[A]

    Find the minimum A item in this structure according to the Order[A].

    Find the minimum A item in this structure according to the Order[A].

    returns

    None if the structure is empty, otherwise the minimum element wrapped in a Some.

    Definition Classes
    ReducibleFoldable
    See also

    Reducible#minimum for a version that doesn't need to return an Option for structures that are guaranteed to be non-empty.

    maximumOption for maximum instead of minimum.

  40. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  41. def nonEmpty[A](fa: F[A]): Boolean
    Definition Classes
    ReducibleFoldableUnorderedFoldable
  42. def nonEmptyIntercalate[A](fa: F[A], a: A)(implicit A: Semigroup[A]): A

    Intercalate/insert an element between the existing elements while reducing.

    Intercalate/insert an element between the existing elements while reducing.

    scala> import cats.implicits._
    scala> import cats.data.NonEmptyList
    scala> val nel = NonEmptyList.of("a", "b", "c")
    scala> Reducible[NonEmptyList].nonEmptyIntercalate(nel, "-")
    res0: String = a-b-c
    scala> Reducible[NonEmptyList].nonEmptyIntercalate(NonEmptyList.of("a"), "-")
    res1: String = a
    Definition Classes
    Reducible
  43. def nonEmptyPartition[A, B, C](fa: F[A])(f: (A) ⇒ Either[B, C]): Ior[NonEmptyList[B], NonEmptyList[C]]

    Partition this Reducible by a separating function A => Either[B, C]

    Partition this Reducible by a separating function A => Either[B, C]

    scala> import cats.data.NonEmptyList
    scala> val nel = NonEmptyList.of(1,2,3,4)
    scala> Reducible[NonEmptyList].nonEmptyPartition(nel)(a => if (a % 2 == 0) Left(a.toString) else Right(a))
    res0: cats.data.Ior[cats.data.NonEmptyList[String],cats.data.NonEmptyList[Int]] = Both(NonEmptyList(2, 4),NonEmptyList(1, 3))
    scala> Reducible[NonEmptyList].nonEmptyPartition(nel)(a => Right(a * 4))
    res1: cats.data.Ior[cats.data.NonEmptyList[Nothing],cats.data.NonEmptyList[Int]] = Right(NonEmptyList(4, 8, 12, 16))
    Definition Classes
    Reducible
  44. def nonEmptySequence_[G[_], A](fga: F[G[A]])(implicit G: Apply[G]): G[Unit]

    Sequence F[G[A]] using Apply[G].

    Sequence F[G[A]] using Apply[G].

    This method is similar to Foldable.sequence_ but requires only an Apply instance for G instead of Applicative. See the nonEmptyTraverse_ documentation for a description of the differences.

    Definition Classes
    Reducible
  45. def nonEmptyTraverse_[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit G: Apply[G]): G[Unit]

    Traverse F[A] using Apply[G].

    Traverse F[A] using Apply[G].

    A values will be mapped into G[B] and combined using Apply#map2.

    This method is similar to Foldable.traverse_. There are two main differences:

    1. We only need an Apply instance for G here, since we don't need to call Applicative.pure for a starting value. 2. This performs a strict left-associative traversal and thus must always traverse the entire data structure. Prefer Foldable.traverse_ if you have an Applicative instance available for G and want to take advantage of short-circuiting the traversal.

    Definition Classes
    Reducible
  46. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  47. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  48. def partitionEither[A, B, C](fa: F[A])(f: (A) ⇒ Either[B, C])(implicit A: Alternative[F]): (F[B], F[C])

    Separate this Foldable into a Tuple by a separating function A => Either[B, C] Equivalent to Functor#map and then Alternative#separate.

    Separate this Foldable into a Tuple by a separating function A => Either[B, C] Equivalent to Functor#map and then Alternative#separate.

    scala> import cats.implicits._
    scala> val list = List(1,2,3,4)
    scala> Foldable[List].partitionEither(list)(a => if (a % 2 == 0) Left(a.toString) else Right(a))
    res0: (List[String], List[Int]) = (List(2, 4),List(1, 3))
    scala> Foldable[List].partitionEither(list)(a => Right(a * 4))
    res1: (List[Nothing], List[Int]) = (List(),List(4, 8, 12, 16))
    Definition Classes
    Foldable
  49. def reduce[A](fa: F[A])(implicit A: Semigroup[A]): A

    Reduce a F[A] value using the given Semigroup[A].

    Reduce a F[A] value using the given Semigroup[A].

    Definition Classes
    Reducible
  50. def reduceK[G[_], A](fga: F[G[A]])(implicit G: SemigroupK[G]): G[A]

    Reduce a F[G[A]] value using SemigroupK[G], a universal semigroup for G[_].

    Reduce a F[G[A]] value using SemigroupK[G], a universal semigroup for G[_].

    This method is a generalization of reduce.

    Definition Classes
    Reducible
  51. def reduceLeft[A](fa: F[A])(f: (A, A) ⇒ A): A

    Left-associative reduction on F using the function f.

    Left-associative reduction on F using the function f.

    Implementations should override this method when possible.

    Definition Classes
    Reducible
  52. def reduceLeftM[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(g: (B, A) ⇒ G[B])(implicit G: FlatMap[G]): G[B]

    Monadic variant of reduceLeftTo

    Monadic variant of reduceLeftTo

    Definition Classes
    Reducible
  53. def reduceLeftOption[A](fa: F[A])(f: (A, A) ⇒ A): Option[A]

    Reduce the elements of this structure down to a single value by applying the provided aggregation function in a left-associative manner.

    Reduce the elements of this structure down to a single value by applying the provided aggregation function in a left-associative manner.

    returns

    None if the structure is empty, otherwise the result of combining the cumulative left-associative result of the f operation over all of the elements.

    Definition Classes
    Foldable
    See also

    reduceRightOption for a right-associative alternative.

    Reducible#reduceLeft for a version that doesn't need to return an Option for structures that are guaranteed to be non-empty. Example:

    scala> import cats.implicits._
    scala> val l = List(6, 3, 2)
    This is equivalent to (6 - 3) - 2
    scala> Foldable[List].reduceLeftOption(l)(_ - _)
    res0: Option[Int] = Some(1)
    
    scala> Foldable[List].reduceLeftOption(List.empty[Int])(_ - _)
    res1: Option[Int] = None
  54. def reduceLeftTo[A, B](fa: F[A])(f: (A) ⇒ B)(g: (B, A) ⇒ B): B

    Apply f to the "initial element" of fa and combine it with every other value using the given function g.

    Apply f to the "initial element" of fa and combine it with every other value using the given function g.

    Definition Classes
    NonEmptyReducibleReducible
  55. def reduceLeftToOption[A, B](fa: F[A])(f: (A) ⇒ B)(g: (B, A) ⇒ B): Option[B]

    Overridden from Foldable for efficiency.

    Overridden from Foldable for efficiency.

    Definition Classes
    ReducibleFoldable
  56. def reduceMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit B: Semigroup[B]): B

    Apply f to each element of fa and combine them using the given Semigroup[B].

    Apply f to each element of fa and combine them using the given Semigroup[B].

    Definition Classes
    Reducible
  57. def reduceMapM[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit G: FlatMap[G], B: Semigroup[B]): G[B]

    Monadic reducing by mapping the A values to G[B].

    Monadic reducing by mapping the A values to G[B]. combining the B values using the given Semigroup[B] instance.

    Similar to reduceLeftM, but using a Semigroup[B].

    scala> import cats.Reducible
    scala> import cats.data.NonEmptyList
    scala> import cats.implicits._
    scala> val evenOpt: Int => Option[Int] =
         |   i => if (i % 2 == 0) Some(i) else None
    scala> val allEven = NonEmptyList.of(2,4,6,8,10)
    allEven: cats.data.NonEmptyList[Int] = NonEmptyList(2, 4, 6, 8, 10)
    scala> val notAllEven = allEven ++ List(11)
    notAllEven: cats.data.NonEmptyList[Int] = NonEmptyList(2, 4, 6, 8, 10, 11)
    scala> Reducible[NonEmptyList].reduceMapM(allEven)(evenOpt)
    res0: Option[Int] = Some(30)
    scala> Reducible[NonEmptyList].reduceMapM(notAllEven)(evenOpt)
    res1: Option[Int] = None
    Definition Classes
    Reducible
  58. def reduceRight[A](fa: F[A])(f: (A, Eval[A]) ⇒ Eval[A]): Eval[A]

    Right-associative reduction on F using the function f.

    Right-associative reduction on F using the function f.

    Definition Classes
    Reducible
  59. def reduceRightOption[A](fa: F[A])(f: (A, Eval[A]) ⇒ Eval[A]): Eval[Option[A]]

    Reduce the elements of this structure down to a single value by applying the provided aggregation function in a right-associative manner.

    Reduce the elements of this structure down to a single value by applying the provided aggregation function in a right-associative manner.

    returns

    None if the structure is empty, otherwise the result of combining the cumulative right-associative result of the f operation over the A elements.

    Definition Classes
    Foldable
    See also

    reduceLeftOption for a left-associative alternative

    Reducible#reduceRight for a version that doesn't need to return an Option for structures that are guaranteed to be non-empty. Example:

    scala> import cats.implicits._
    scala> val l = List(6, 3, 2)
    This is eqivalent to 6 - (3 - 2)
    scala> Foldable[List].reduceRightOption(l)((current, rest) => rest.map(current - _)).value
    res0: Option[Int] = Some(5)
    
    scala> Foldable[List].reduceRightOption(List.empty[Int])((current, rest) => rest.map(current - _)).value
    res1: Option[Int] = None
  60. def reduceRightTo[A, B](fa: F[A])(f: (A) ⇒ B)(g: (A, Eval[B]) ⇒ Eval[B]): Eval[B]

    Apply f to the "initial element" of fa and lazily combine it with every other value using the given function g.

    Apply f to the "initial element" of fa and lazily combine it with every other value using the given function g.

    Definition Classes
    NonEmptyReducibleReducible
  61. def reduceRightToOption[A, B](fa: F[A])(f: (A) ⇒ B)(g: (A, Eval[B]) ⇒ Eval[B]): Eval[Option[B]]

    Overridden from Foldable for efficiency.

    Overridden from Foldable for efficiency.

    Definition Classes
    ReducibleFoldable
  62. def sequence_[G[_], A](fga: F[G[A]])(implicit arg0: Applicative[G]): G[Unit]

    Sequence F[G[A]] using Applicative[G].

    Sequence F[G[A]] using Applicative[G].

    This is similar to traverse_ except it operates on F[G[A]] values, so no additional functions are needed.

    For example:

    scala> import cats.implicits._
    scala> val F = Foldable[List]
    scala> F.sequence_(List(Option(1), Option(2), Option(3)))
    res0: Option[Unit] = Some(())
    scala> F.sequence_(List(Option(1), None, Option(3)))
    res1: Option[Unit] = None
    Definition Classes
    Foldable
  63. def size[A](fa: F[A]): Long

    The size of this UnorderedFoldable.

    The size of this UnorderedFoldable.

    This is overridden in structures that have more efficient size implementations (e.g. Vector, Set, Map).

    Note: will not terminate for infinite-sized collections.

    Definition Classes
    NonEmptyReducibleUnorderedFoldable
  64. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  65. def takeWhile_[A](fa: F[A])(p: (A) ⇒ Boolean): List[A]

    Convert F[A] to a List[A], retaining only initial elements which match p.

    Convert F[A] to a List[A], retaining only initial elements which match p.

    Definition Classes
    NonEmptyReducibleFoldable
  66. def toList[A](fa: F[A]): List[A]

    Convert F[A] to a List[A].

    Convert F[A] to a List[A].

    Definition Classes
    NonEmptyReducibleFoldable
  67. def toNonEmptyList[A](fa: F[A]): NonEmptyList[A]
    Definition Classes
    NonEmptyReducibleReducible
  68. def toString(): String
    Definition Classes
    AnyRef → Any
  69. def traverse_[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit G: Applicative[G]): G[Unit]

    Traverse F[A] using Applicative[G].

    Traverse F[A] using Applicative[G].

    A values will be mapped into G[B] and combined using Applicative#map2.

    For example:

    scala> import cats.implicits._
    scala> def parseInt(s: String): Option[Int] = Either.catchOnly[NumberFormatException](s.toInt).toOption
    scala> val F = Foldable[List]
    scala> F.traverse_(List("333", "444"))(parseInt)
    res0: Option[Unit] = Some(())
    scala> F.traverse_(List("333", "zzz"))(parseInt)
    res1: Option[Unit] = None

    This method is primarily useful when G[_] represents an action or effect, and the specific A aspect of G[A] is not otherwise needed.

    Definition Classes
    Foldable
  70. def unorderedFold[A](fa: F[A])(implicit arg0: CommutativeMonoid[A]): A
    Definition Classes
    FoldableUnorderedFoldable
  71. def unorderedFoldMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: CommutativeMonoid[B]): B
    Definition Classes
    FoldableUnorderedFoldable
  72. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  73. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  74. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from Reducible[F]

Inherited from Foldable[F]

Inherited from UnorderedFoldable[F]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped