cats.effect.laws

EffectLaws

trait EffectLaws[F[_]] extends AsyncLaws[F] with SyncLaws[F]

Linear Supertypes
SyncLaws[F], AsyncLaws[F], MonadErrorLaws[F, Throwable], MonadLaws[F], FlatMapLaws[F], ApplicativeErrorLaws[F, Throwable], ApplicativeLaws[F], ApplyLaws[F], CartesianLaws[F], FunctorLaws[F], InvariantLaws[F], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. EffectLaws
  2. SyncLaws
  3. AsyncLaws
  4. MonadErrorLaws
  5. MonadLaws
  6. FlatMapLaws
  7. ApplicativeErrorLaws
  8. ApplicativeLaws
  9. ApplyLaws
  10. CartesianLaws
  11. FunctorLaws
  12. InvariantLaws
  13. AnyRef
  14. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. implicit abstract def F: Effect[F]

    Definition Classes
    EffectLaws → SyncLaws → AsyncLaws → MonadErrorLaws → MonadLaws → FlatMapLaws → ApplicativeErrorLaws → ApplicativeLaws → ApplyLaws → CartesianLaws → FunctorLaws → InvariantLaws

Concrete Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. def apProductConsistent[A, B](fa: F[A], f: F[(A) ⇒ B]): IsEq[F[B]]

    Definition Classes
    ApplicativeLaws

  7. def applicativeComposition[A, B, C](fa: F[A], fab: F[(A) ⇒ B], fbc: F[(B) ⇒ C]): IsEq[F[C]]

    Definition Classes
    ApplicativeLaws

  8. def applicativeErrorHandle[A](e: Throwable, f: (Throwable) ⇒ A): IsEq[F[A]]

    Definition Classes
    ApplicativeErrorLaws

  9. def applicativeErrorHandleWith[A](e: Throwable, f: (Throwable) ⇒ F[A]): IsEq[F[A]]

    Definition Classes
    ApplicativeErrorLaws

  10. def applicativeHomomorphism[A, B](a: A, f: (A) ⇒ B): IsEq[F[B]]

    Definition Classes
    ApplicativeLaws

  11. def applicativeIdentity[A](fa: F[A]): IsEq[F[A]]

    Definition Classes
    ApplicativeLaws

  12. def applicativeInterchange[A, B](a: A, ff: F[(A) ⇒ B]): IsEq[F[B]]

    Definition Classes
    ApplicativeLaws

  13. def applicativeMap[A, B](fa: F[A], f: (A) ⇒ B): IsEq[F[B]]

    Definition Classes
    ApplicativeLaws

  14. def applyComposition[A, B, C](fa: F[A], fab: F[(A) ⇒ B], fbc: F[(B) ⇒ C]): IsEq[F[C]]

    Definition Classes
    ApplyLaws

  15. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  16. def asyncLeftIsRaiseError[A](t: Throwable): IsEq[F[A]]

    Definition Classes
    AsyncLaws

  17. def asyncRightIsPure[A](a: A): IsEq[F[A]]

    Definition Classes
    AsyncLaws

  18. def attemptConsistentWithAttemptT[A](fa: F[A]): IsEq[EitherT[F, Throwable, A]]

    Definition Classes
    ApplicativeErrorLaws

  19. def cartesianAssociativity[A, B, C](fa: F[A], fb: F[B], fc: F[C]): (F[(A, (B, C))], F[((A, B), C)])

    Definition Classes
    CartesianLaws

  20. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  21. def covariantComposition[A, B, C](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ C): IsEq[F[C]]

    Definition Classes
    FunctorLaws

  22. def covariantIdentity[A](fa: F[A]): IsEq[F[A]]

    Definition Classes
    FunctorLaws

  23. def delayConstantIsPure[A](a: A): IsEq[F[A]]

    Definition Classes
    SyncLaws

  24. def delayThrowIsRaiseError[A](t: Throwable): IsEq[F[A]]

    Definition Classes
    SyncLaws

  25. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  26. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  27. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  28. def flatMapAssociativity[A, B, C](fa: F[A], f: (A) ⇒ F[B], g: (B) ⇒ F[C]): IsEq[F[C]]

    Definition Classes
    FlatMapLaws

  29. def flatMapConsistentApply[A, B](fa: F[A], fab: F[(A) ⇒ B]): IsEq[F[B]]

    Definition Classes
    FlatMapLaws

  30. def followedByConsistency[A, B](fa: F[A], fb: F[B]): IsEq[F[B]]

    Definition Classes
    FlatMapLaws

  31. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  32. def handleErrorConsistentWithRecover[A](fa: F[A], f: (Throwable) ⇒ A): IsEq[F[A]]

    Definition Classes
    ApplicativeErrorLaws

  33. def handleErrorPure[A](a: A, f: (Throwable) ⇒ A): IsEq[F[A]]

    Definition Classes
    ApplicativeErrorLaws

  34. def handleErrorWithConsistentWithRecoverWith[A](fa: F[A], f: (Throwable) ⇒ F[A]): IsEq[F[A]]

    Definition Classes
    ApplicativeErrorLaws

  35. def handleErrorWithPure[A](a: A, f: (Throwable) ⇒ F[A]): IsEq[F[A]]

    Definition Classes
    ApplicativeErrorLaws

  36. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  37. 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

  38. def invariantIdentity[A](fa: F[A]): IsEq[F[A]]

    Definition Classes
    InvariantLaws

  39. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  40. def kleisliAssociativity[A, B, C, D](f: (A) ⇒ F[B], g: (B) ⇒ F[C], h: (C) ⇒ F[D], a: A): IsEq[F[D]]

    Definition Classes
    FlatMapLaws

  41. def kleisliLeftIdentity[A, B](a: A, f: (A) ⇒ F[B]): IsEq[F[B]]

    Definition Classes
    MonadLaws

  42. def kleisliRightIdentity[A, B](a: A, f: (A) ⇒ F[B]): IsEq[F[B]]

    Definition Classes
    MonadLaws

  43. def mapFlatMapCoherence[A, B](fa: F[A], f: (A) ⇒ B): IsEq[F[B]]

    Definition Classes
    MonadLaws

  44. def monadErrorLeftZero[A, B](e: Throwable, f: (A) ⇒ F[B]): IsEq[F[B]]

    Definition Classes
    MonadErrorLaws

  45. def monadLeftIdentity[A, B](a: A, f: (A) ⇒ F[B]): IsEq[F[B]]

    Definition Classes
    MonadLaws

  46. def monadRightIdentity[A](fa: F[A]): IsEq[F[A]]

    Definition Classes
    MonadLaws

  47. def monoidalLeftIdentity[A](fa: F[A]): (F[(Unit, A)], F[A])

    Definition Classes
    ApplicativeLaws

  48. def monoidalRightIdentity[A](fa: F[A]): (F[(A, Unit)], F[A])

    Definition Classes
    ApplicativeLaws

  49. def mproductConsistency[A, B](fa: F[A], fb: (A) ⇒ F[B]): IsEq[F[(A, B)]]

    Definition Classes
    FlatMapLaws

  50. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  51. final def notify(): Unit

    Definition Classes
    AnyRef

  52. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  53. def propagateErrorsThroughBindAsync[A](t: Throwable): IsEq[IO[Either[Throwable, Either[Throwable, A]]]]

  54. def propagateErrorsThroughBindSuspend[A](t: Throwable): IsEq[IO[Either[Throwable, Either[Throwable, A]]]]

  55. def pureAttempt[A](a: A): IsEq[F[Either[Throwable, A]]]

    Definition Classes
    ApplicativeErrorLaws

  56. def raiseErrorAttempt(e: Throwable): IsEq[F[Either[Throwable, Unit]]]

    Definition Classes
    ApplicativeErrorLaws

  57. def recoverConsistentWithRecoverWith[A](fa: F[A], pf: PartialFunction[Throwable, A]): IsEq[F[A]]

    Definition Classes
    ApplicativeErrorLaws

  58. def repeatedAsyncEvaluationNotMemoized[A](a: A, f: (A) ⇒ A): IsEq[F[A]]

    Definition Classes
    AsyncLaws

  59. def repeatedCallbackIgnored[A](a: A, f: (A) ⇒ A): IsEq[IO[A]]

  60. def repeatedSyncEvaluationNotMemoized[A](a: A, f: (A) ⇒ A): IsEq[F[A]]

    Definition Classes
    SyncLaws

  61. def runAsyncPureProducesRightIO[A](a: A): IsEq[IO[Either[Throwable, A]]]

  62. def runAsyncRaiseErrorProducesLeftIO[A](t: Throwable): IsEq[IO[Either[Throwable, A]]]

  63. lazy val stackSafetyOnRepeatedAttempts: IsEq[Unit]

  64. lazy val stackSafetyOnRepeatedLeftBinds: IsEq[Unit]

  65. lazy val stackSafetyOnRepeatedRightBinds: IsEq[Unit]

  66. def suspendConstantIsPureJoin[A](fa: F[A]): IsEq[F[A]]

    Definition Classes
    SyncLaws

  67. def suspendThrowIsRaiseError[A](t: Throwable): IsEq[F[A]]

    Definition Classes
    SyncLaws

  68. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  69. def tailRecMConsistentFlatMap[A](a: A, f: (A) ⇒ F[A]): IsEq[F[A]]

    Definition Classes
    FlatMapLaws

  70. lazy val tailRecMStackSafety: IsEq[F[Int]]

    Definition Classes
    MonadLaws

  71. def thrownInRegisterIsRaiseError[A](t: Throwable): IsEq[F[A]]

    Definition Classes
    AsyncLaws

  72. def toString(): String

    Definition Classes
    AnyRef → Any

  73. def unsequencedDelayIsNoop[A](a: A, f: (A) ⇒ A): IsEq[F[A]]

    Definition Classes
    SyncLaws

  74. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  75. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  76. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from SyncLaws[F]

Inherited from AsyncLaws[F]

Inherited from MonadErrorLaws[F, Throwable]

Inherited from MonadLaws[F]

Inherited from FlatMapLaws[F]

Inherited from ApplicativeErrorLaws[F, Throwable]

Inherited from ApplicativeLaws[F]

Inherited from ApplyLaws[F]

Inherited from CartesianLaws[F]

Inherited from FunctorLaws[F]

Inherited from InvariantLaws[F]

Inherited from AnyRef

Inherited from Any

Ungrouped