Packages

trait Error2[F[+_, +_]] extends ApplicativeError2[F] with Monad2[F] with ErrorAccumulatingOps2[F]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Error2
  2. ErrorAccumulatingOps2
  3. Monad2
  4. ApplicativeError2
  5. Bifunctor2
  6. Guarantee2
  7. Applicative2
  8. Functor2
  9. RootBifunctor
  10. Root
  11. PredefinedHelper
  12. DivergenceHelper
  13. AnyRef
  14. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. type Divergence = Nondivergent
    Definition Classes
    DivergenceHelper
  2. type IsPredefined = NotPredefined
    Definition Classes
    PredefinedHelper

Abstract Value Members

  1. abstract def catchAll[E, A, E2](r: F[E, A])(f: (E) => F[E2, A]): F[E2, A]
  2. abstract def fail[E](v: => E): F[E, Nothing]
    Definition Classes
    ApplicativeError2
  3. abstract def flatMap[E, A, B](r: F[E, A])(f: (A) => F[E, B]): F[E, B]
    Definition Classes
    Monad2
  4. abstract def fromAttempt[A](effect: => A): F[Throwable, A]

    For lazy monads: alias for IO2#syncThrowable.

    For lazy monads: alias for IO2#syncThrowable. For strict monads, shorthand for F.fromTry(Try(effect))

    Definition Classes
    ApplicativeError2
  5. abstract def fromEither[E, V](effect: => Either[E, V]): F[E, V]
    Definition Classes
    ApplicativeError2
  6. abstract def fromOption[E, A](errorOnNone: => E)(effect: => Option[A]): F[E, A]
    Definition Classes
    ApplicativeError2
  7. abstract def fromTry[A](effect: => Try[A]): F[Throwable, A]
    Definition Classes
    ApplicativeError2
  8. abstract def guarantee[E, A](f: F[E, A], cleanup: F[Nothing, Unit]): F[E, A]
    Definition Classes
    Guarantee2
  9. abstract def pure[A](a: A): F[Nothing, A]
    Definition Classes
    Applicative2

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def *>[E, A, B](f: F[E, A], next: => F[E, B]): F[E, B]

    execute two operations in order, return result of second operation

    execute two operations in order, return result of second operation

    Definition Classes
    Monad2 → Applicative2
  4. def <*[E, A, B](f: F[E, A], next: => F[E, B]): F[E, A]

    execute two operations in order, same as *>, but return result of first operation

    execute two operations in order, same as *>, but return result of first operation

    Definition Classes
    Monad2 → Applicative2
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def InnerF: Functor2[F]
    Definition Classes
    ApplicativeError2 → Bifunctor2
  7. def accumulateErrorsImpl[ColL[_], ColR[x] <: IterableOnce[x], E, E1, A, B, B1, AC](col: ColR[A])(effect: (A) => F[E, B], onLeft: (E) => IterableOnce[E1], init: AC, onRight: (AC, B) => AC, end: (AC) => B1)(implicit buildL: Factory[E1, ColL[E1]]): F[ColL[E1], B1]
    Attributes
    protected
    Definition Classes
    ErrorAccumulatingOps2
  8. def as[E, A, B](r: F[E, A])(v: => B): F[E, B]
    Definition Classes
    Functor2
  9. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  10. def attempt[E, A](r: F[E, A]): F[Nothing, Either[E, A]]
  11. def bimap[E, A, E2, B](r: F[E, A])(f: (E) => E2, g: (A) => B): F[E2, B]
    Definition Classes
    Error2 → Bifunctor2
  12. def catchSome[E, A, E1 >: E](r: F[E, A])(f: PartialFunction[E, F[E1, A]]): F[E1, A]
  13. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  14. def collect[E, A, B](l: Iterable[A])(f: (A) => F[E, Option[B]]): F[E, List[B]]
    Definition Classes
    Applicative2
  15. def collectFirst[E, A, B](l: Iterable[A])(f: (A) => F[E, Option[B]]): F[E, Option[B]]
    Definition Classes
    Monad2
  16. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  18. def filter[E, A](l: Iterable[A])(f: (A) => F[E, Boolean]): F[E, List[A]]
    Definition Classes
    Applicative2
  19. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  20. def find[E, A](l: Iterable[A])(f: (A) => F[E, Boolean]): F[E, Option[A]]
    Definition Classes
    Monad2
  21. def flatSequence[E, A](l: Iterable[F[E, Iterable[A]]]): F[E, List[A]]
    Definition Classes
    Applicative2
  22. def flatSequenceAccumErrors[ColR[x] <: IterableOnce[x], ColIn[x] <: IterableOnce[x], ColL[_], E, A](col: ColR[F[ColL[E], ColIn[A]]])(implicit buildR: Factory[A, ColR[A]], buildL: Factory[E, ColL[E]], iterL: (ColL[E]) => IterableOnce[E]): F[ColL[E], ColR[A]]

    flatSequence with error accumulation

    flatSequence with error accumulation

    Definition Classes
    ErrorAccumulatingOps2
  23. def flatTraverse[E, A, B](l: Iterable[A])(f: (A) => F[E, Iterable[B]]): F[E, List[B]]
    Definition Classes
    Applicative2
  24. def flatTraverseAccumErrors[ColR[x] <: IterableOnce[x], ColIn[x] <: IterableOnce[x], ColL[_], E, A, B](col: ColR[A])(f: (A) => F[ColL[E], ColIn[B]])(implicit buildR: Factory[B, ColR[B]], buildL: Factory[E, ColL[E]], iterL: (ColL[E]) => IterableOnce[E]): F[ColL[E], ColR[B]]

    flatTraverse with error accumulation

    flatTraverse with error accumulation

    Definition Classes
    ErrorAccumulatingOps2
  25. def flatten[E, A](r: F[E, F[E, A]]): F[E, A]
    Definition Classes
    Monad2
  26. def flip[E, A](r: F[E, A]): F[A, E]
  27. def foldLeft[E, A, AC](l: Iterable[A])(z: AC)(f: (AC, A) => F[E, AC]): F[E, AC]
    Definition Classes
    Monad2
  28. final def forever[E, A](r: F[E, A]): F[E, Nothing]
    Definition Classes
    Applicative2
    Annotations
    @inline()
  29. def fromOption[E, A](errorOnNone: => E, r: F[E, Option[A]]): F[E, A]

    Extracts the optional value or fails with the errorOnNone error

  30. def fromOptionF[E, A](fallbackOnNone: => F[E, A], r: F[E, Option[A]]): F[E, A]

    Extracts the optional value, or executes the fallbackOnNone effect

    Extracts the optional value, or executes the fallbackOnNone effect

    Definition Classes
    Monad2
  31. def fromOptionOr[E, A](valueOnNone: => A, r: F[E, Option[A]]): F[E, A]

    Extracts the optional value, or returns the given valueOnNone value

    Extracts the optional value, or returns the given valueOnNone value

    Definition Classes
    Functor2
  32. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  33. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  34. final def ifThenElse[E, E1, A](cond: F[E, Boolean])(ifTrue: => F[E1, A], ifFalse: => F[E1, A])(implicit ev: <:<[E, E1]): F[E1, A]
    Definition Classes
    Monad2
    Annotations
    @inline()
  35. final def ifThenElse[E, A](cond: Boolean)(ifTrue: => F[E, A], ifFalse: => F[E, A]): F[E, A]
    Definition Classes
    Applicative2
    Annotations
    @inline()
  36. final def ifThenFail[E](cond: Boolean)(errorIfTrue: => E): F[E, Unit]
    Definition Classes
    ApplicativeError2
    Annotations
    @inline()
  37. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  38. def iterateUntil[E, A](r: F[E, A])(p: (A) => Boolean): F[E, A]

    Execute an action repeatedly until its result satisfies the given predicate and return that result, discarding all others.

    Execute an action repeatedly until its result satisfies the given predicate and return that result, discarding all others.

    Definition Classes
    Monad2
  39. def iterateUntilF[E, A](init: A)(f: (A) => F[E, A])(p: (A) => Boolean): F[E, A]

    Apply an effectful function iteratively until its result satisfies the given predicate and return that result.

    Apply an effectful function iteratively until its result satisfies the given predicate and return that result.

    Definition Classes
    Monad2
  40. def iterateWhile[E, A](r: F[E, A])(p: (A) => Boolean): F[E, A]

    Execute an action repeatedly until its result fails to satisfy the given predicate and return that result, discarding all others.

    Execute an action repeatedly until its result fails to satisfy the given predicate and return that result, discarding all others.

    Definition Classes
    Monad2
  41. def iterateWhileF[E, A](init: A)(f: (A) => F[E, A])(p: (A) => Boolean): F[E, A]

    Apply an effectful function iteratively until its result fails to satisfy the given predicate and return that result.

    Apply an effectful function iteratively until its result fails to satisfy the given predicate and return that result.

    Definition Classes
    Monad2
  42. def leftFlatMap[E, A, E2](r: F[E, A])(f: (E) => F[Nothing, E2]): F[E2, A]
  43. def leftMap[E, A, E2](r: F[E, A])(f: (E) => E2): F[E2, A]
    Definition Classes
    Bifunctor2
  44. def leftMap2[E, A, E2, E3](firstOp: F[E, A], secondOp: => F[E2, A])(f: (E, E2) => E3): F[E3, A]

    map errors from two operations into a new error if both fail

    map errors from two operations into a new error if both fail

    Definition Classes
    Error2 → ApplicativeError2
  45. def map[E, A, B](r: F[E, A])(f: (A) => B): F[E, B]
    Definition Classes
    Monad2 → Functor2
  46. def map2[E, A, B, C](r1: F[E, A], r2: => F[E, B])(f: (A, B) => C): F[E, C]

    execute two operations in order, map their results

    execute two operations in order, map their results

    Definition Classes
    Monad2 → Applicative2
  47. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  48. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  49. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  50. def orElse[E, A, E2](r: F[E, A], f: => F[E2, A]): F[E2, A]

    execute second operation only if the first one fails

    execute second operation only if the first one fails

    Definition Classes
    Error2 → ApplicativeError2
  51. def partition[E, A](l: Iterable[F[E, A]]): F[Nothing, (List[E], List[A])]
    Annotations
    @nowarn()
  52. def redeem[E, A, E2, B](r: F[E, A])(err: (E) => F[E2, B], succ: (A) => F[E2, B]): F[E2, B]
  53. def redeemPure[E, A, B](r: F[E, A])(err: (E) => B, succ: (A) => B): F[Nothing, B]
  54. def retryUntil[E, A](r: F[E, A])(f: (E) => Boolean): F[E, A]

    Retries this effect until its error satisfies the specified predicate.

  55. def retryUntilF[E, A](r: F[E, A])(f: (E) => F[Nothing, Boolean]): F[E, A]

    Retries this effect until its error satisfies the specified effectful predicate.

  56. def retryWhile[E, A](r: F[E, A])(f: (E) => Boolean): F[E, A]

    Retries this effect while its error satisfies the specified predicate.

  57. def retryWhileF[E, A](r: F[E, A])(f: (E) => F[Nothing, Boolean]): F[E, A]

    Retries this effect while its error satisfies the specified effectful predicate.

  58. def sequence[E, A](l: Iterable[F[E, A]]): F[E, List[A]]
    Definition Classes
    Applicative2
  59. def sequenceAccumErrors[ColR[x] <: IterableOnce[x], ColL[_], E, A](col: ColR[F[ColL[E], A]])(implicit buildR: Factory[A, ColR[A]], buildL: Factory[E, ColL[E]], iterL: (ColL[E]) => IterableOnce[E]): F[ColL[E], ColR[A]]

    sequence with error accumulation

    sequence with error accumulation

    Definition Classes
    ErrorAccumulatingOps2
  60. def sequenceAccumErrorsNEList[ColR[x] <: IterableOnce[x], E, A](col: ColR[F[E, A]])(implicit buildR: Factory[A, ColR[A]]): F[NEList[E], ColR[A]]

    sequence with error accumulation

    sequence with error accumulation

    Definition Classes
    ErrorAccumulatingOps2
  61. def sequenceAccumErrors_[ColR[x] <: IterableOnce[x], ColL[_], E, A](col: ColR[F[ColL[E], A]])(implicit buildL: Factory[E, ColL[E]], iterL: (ColL[E]) => IterableOnce[E]): F[ColL[E], Unit]

    sequence_ with error accumulation

    sequence_ with error accumulation

    Definition Classes
    ErrorAccumulatingOps2
  62. def sequence_[E](l: Iterable[F[E, Unit]]): F[E, Unit]
    Definition Classes
    Applicative2
  63. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  64. def tailRecM[E, A, B](a: A)(f: (A) => F[E, Either[A, B]]): F[E, B]
    Definition Classes
    Monad2
  65. def tap[E, A](r: F[E, A], f: (A) => F[E, Unit]): F[E, A]
    Definition Classes
    Monad2
  66. def tapBoth[E, A, E1 >: E](r: F[E, A])(err: (E) => F[E1, Unit], succ: (A) => F[E1, Unit]): F[E1, A]
  67. def tapError[E, A, E1 >: E](r: F[E, A])(f: (E) => F[E1, Unit]): F[E1, A]
  68. def toString(): String
    Definition Classes
    AnyRef → Any
  69. final def traverse[E, A, B](o: Option[A])(f: (A) => F[E, B]): F[E, Option[B]]
    Definition Classes
    Applicative2
    Annotations
    @inline()
  70. def traverse[E, A, B](l: Iterable[A])(f: (A) => F[E, B]): F[E, List[B]]
    Definition Classes
    Applicative2
  71. def traverseAccumErrors[ColR[x] <: IterableOnce[x], ColL[_], E, A, B](col: ColR[A])(f: (A) => F[ColL[E], B])(implicit buildR: Factory[B, ColR[B]], buildL: Factory[E, ColL[E]], iterL: (ColL[E]) => IterableOnce[E]): F[ColL[E], ColR[B]]

    traverse with error accumulation

    traverse with error accumulation

    Definition Classes
    ErrorAccumulatingOps2
  72. def traverseAccumErrors_[ColR[x] <: IterableOnce[x], ColL[_], E, A](col: ColR[A])(f: (A) => F[ColL[E], Unit])(implicit buildL: Factory[E, ColL[E]], iterL: (ColL[E]) => IterableOnce[E]): F[ColL[E], Unit]

    traverse_ with error accumulation

    traverse_ with error accumulation

    Definition Classes
    ErrorAccumulatingOps2
  73. def traverse_[E, A](l: Iterable[A])(f: (A) => F[E, Unit]): F[E, Unit]
    Definition Classes
    Applicative2
  74. def unit: F[Nothing, Unit]
    Definition Classes
    Applicative2
  75. final def unless[E, E1](cond: F[E, Boolean])(ifFalse: => F[E1, Unit])(implicit ev: <:<[E, E1]): F[E1, Unit]
    Definition Classes
    Monad2
    Annotations
    @inline()
  76. final def unless[E](cond: Boolean)(ifFalse: => F[E, Unit]): F[E, Unit]
    Definition Classes
    Applicative2
    Annotations
    @inline()
  77. def void[E, A](r: F[E, A]): F[E, Unit]
    Definition Classes
    Functor2
  78. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  79. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  80. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  81. final def when[E, E1](cond: F[E, Boolean])(ifTrue: => F[E1, Unit])(implicit ev: <:<[E, E1]): F[E1, Unit]
    Definition Classes
    Monad2
    Annotations
    @inline()
  82. final def when[E](cond: Boolean)(ifTrue: => F[E, Unit]): F[E, Unit]
    Definition Classes
    Applicative2
    Annotations
    @inline()
  83. final def widen[E, A, A1](r: F[E, A])(implicit ev: <:<[A, A1]): F[E, A1]
    Definition Classes
    Functor2
    Annotations
    @inline()
  84. final def widenBoth[E, A, E1, A1](r: F[E, A])(implicit ev: <:<[E, E1], ev2: <:<[A, A1]): F[E1, A1]
    Definition Classes
    Bifunctor2
    Annotations
    @inline()
  85. final def widenError[E, A, E1](r: F[E, A])(implicit ev: <:<[E, E1]): F[E1, A]
    Definition Classes
    Bifunctor2
    Annotations
    @inline()
  86. final def withFilter[E, A](r: F[E, A])(predicate: (A) => Boolean)(implicit filter: WithFilter[E], pos: SourceFilePositionMaterializer): F[E, A]

    for-comprehensions sugar:

    for-comprehensions sugar:

    for {
  (1, 2) <- F.pure((2, 1))
} yield ()

    Use widenError to for pattern matching with non-Throwable errors:

    val f = for {
  (1, 2) <- F.pure((2, 1)).widenError[Option[Unit]]
} yield ()
// f: F[Option[Unit], Unit] = F.fail(Some(())
    Annotations
    @inline()

Inherited from ErrorAccumulatingOps2[F]

Inherited from Monad2[F]

Inherited from ApplicativeError2[F]

Inherited from Bifunctor2[F]

Inherited from Guarantee2[F]

Inherited from Applicative2[F]

Inherited from Functor2[F]

Inherited from RootBifunctor[F]

Inherited from Root

Inherited from PredefinedHelper

Inherited from DivergenceHelper

Inherited from AnyRef

Inherited from Any

Ungrouped