trait ApplicativeErrorLaws[F[_], E] extends ApplicativeLaws[F]

Linear Supertypes
ApplicativeLaws[F], ApplyLaws[F], SemigroupalLaws[F], FunctorLaws[F], InvariantLaws[F], AnyRef, Any
Known Subclasses
MonadErrorLaws
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ApplicativeErrorLaws
  2. ApplicativeLaws
  3. ApplyLaws
  4. SemigroupalLaws
  5. FunctorLaws
  6. InvariantLaws
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. implicit abstract def F: ApplicativeError[F, E]
    Definition Classes
    ApplicativeErrorLaws → ApplicativeLaws → ApplyLaws → SemigroupalLaws → FunctorLaws → InvariantLaws

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 apProductConsistent[A, B](fa: F[A], f: F[(A) ⇒ B]): IsEq[F[B]]
    Definition Classes
    ApplicativeLaws
  5. def applicativeComposition[A, B, C](fa: F[A], fab: F[(A) ⇒ B], fbc: F[(B) ⇒ C]): IsEq[F[C]]

    This law is applyComposition stated in terms of pure.

    This law is applyComposition stated in terms of pure. It is a combination of applyComposition and applicativeMap and hence not strictly necessary.

    Definition Classes
    ApplicativeLaws
  6. def applicativeErrorHandle[A](e: E, f: (E) ⇒ A): IsEq[F[A]]
  7. def applicativeErrorHandleWith[A](e: E, f: (E) ⇒ F[A]): IsEq[F[A]]
  8. def applicativeHomomorphism[A, B](a: A, f: (A) ⇒ B): IsEq[F[B]]
    Definition Classes
    ApplicativeLaws
  9. def applicativeIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    ApplicativeLaws
  10. def applicativeInterchange[A, B](a: A, ff: F[(A) ⇒ B]): IsEq[F[B]]
    Definition Classes
    ApplicativeLaws
  11. def applicativeMap[A, B](fa: F[A], f: (A) ⇒ B): IsEq[F[B]]
    Definition Classes
    ApplicativeLaws
  12. def applicativeUnit[A](a: A): IsEq[F[A]]
    Definition Classes
    ApplicativeLaws
  13. def applyComposition[A, B, C](fa: F[A], fab: F[(A) ⇒ B], fbc: F[(B) ⇒ C]): IsEq[F[C]]
    Definition Classes
    ApplyLaws
  14. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  15. def attemptConsistentWithAttemptT[A](fa: F[A]): IsEq[EitherT[F, E, A]]
  16. def attemptFromEitherConsistentWithPure[A](eab: Either[E, A]): IsEq[F[Either[E, A]]]
  17. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  18. def covariantComposition[A, B, C](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ C): IsEq[F[C]]
    Definition Classes
    FunctorLaws
  19. def covariantIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    FunctorLaws
  20. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  21. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  22. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  23. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  24. def handleErrorConsistentWithRecover[A](fa: F[A], f: (E) ⇒ A): IsEq[F[A]]
  25. def handleErrorPure[A](a: A, f: (E) ⇒ A): IsEq[F[A]]
  26. def handleErrorWithConsistentWithRecoverWith[A](fa: F[A], f: (E) ⇒ F[A]): IsEq[F[A]]
  27. def handleErrorWithPure[A](a: A, f: (E) ⇒ F[A]): IsEq[F[A]]
  28. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  29. def invariantComposition[A, B, C](fa: F[A], f1: (A) ⇒ B, f2: (B) ⇒ A, g1: (B) ⇒ C, g2: (C) ⇒ B): IsEq[F[C]]
    Definition Classes
    InvariantLaws
  30. def invariantIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    InvariantLaws
  31. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  32. def map2EvalConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) ⇒ C): IsEq[F[C]]
    Definition Classes
    ApplyLaws
  33. def map2ProductConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) ⇒ C): IsEq[F[C]]
    Definition Classes
    ApplyLaws
  34. def monoidalLeftIdentity[A](fa: F[A]): (F[(Unit, A)], F[A])
    Definition Classes
    ApplicativeLaws
  35. def monoidalRightIdentity[A](fa: F[A]): (F[(A, Unit)], F[A])
    Definition Classes
    ApplicativeLaws
  36. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  37. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  38. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  39. def onErrorPure[A](a: A, f: (E) ⇒ F[Unit]): IsEq[F[A]]
  40. def onErrorRaise[A](fa: F[A], e: E, fb: F[Unit]): IsEq[F[A]]
  41. def productLConsistency[A, B](fa: F[A], fb: F[B]): IsEq[F[A]]
    Definition Classes
    ApplyLaws
  42. def productRConsistency[A, B](fa: F[A], fb: F[B]): IsEq[F[B]]
    Definition Classes
    ApplyLaws
  43. def pureAttempt[A](a: A): IsEq[F[Either[E, A]]]
  44. def raiseErrorAttempt(e: E): IsEq[F[Either[E, Unit]]]
  45. def recoverConsistentWithRecoverWith[A](fa: F[A], pf: PartialFunction[E, A]): IsEq[F[A]]
  46. def semigroupalAssociativity[A, B, C](fa: F[A], fb: F[B], fc: F[C]): (F[(A, (B, C))], F[((A, B), C)])
    Definition Classes
    SemigroupalLaws
  47. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  48. def toString(): String
    Definition Classes
    AnyRef → Any
  49. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  50. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  51. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from ApplicativeLaws[F]

Inherited from ApplyLaws[F]

Inherited from SemigroupalLaws[F]

Inherited from FunctorLaws[F]

Inherited from InvariantLaws[F]

Inherited from AnyRef

Inherited from Any

Ungrouped