Trait/Object

cats.effect.laws

EffectLaws

Related Docs: object EffectLaws | package laws

Permalink

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

Source
EffectLaws.scala
Linear Supertypes
AsyncLaws[F], SyncLaws[F], MonadErrorLaws[F, Throwable], MonadLaws[F], FlatMapLaws[F], ApplicativeErrorLaws[F, Throwable], ApplicativeLaws[F], ApplyLaws[F], SemigroupalLaws[F], FunctorLaws[F], InvariantLaws[F], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EffectLaws
  2. AsyncLaws
  3. SyncLaws
  4. MonadErrorLaws
  5. MonadLaws
  6. FlatMapLaws
  7. ApplicativeErrorLaws
  8. ApplicativeLaws
  9. ApplyLaws
  10. SemigroupalLaws
  11. FunctorLaws
  12. InvariantLaws
  13. AnyRef
  14. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. implicit abstract def F: Effect[F]

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

Concrete Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any

  4. def adaptErrorPure[A](a: A, f: (Throwable) ⇒ Throwable): IsEq[F[A]]

    Permalink
    Definition Classes
    MonadErrorLaws

  5. def adaptErrorRaise[A](e: Throwable, f: (Throwable) ⇒ Throwable): IsEq[F[A]]

    Permalink
    Definition Classes
    MonadErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

  14. def applicativeUnit[A](a: A): IsEq[F[A]]

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    ApplyLaws

  16. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  17. def asyncLeftIsRaiseError[A](e: Throwable): IsEq[F[A]]

    Permalink
    Definition Classes
    AsyncLaws

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

    Permalink
    Definition Classes
    AsyncLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

  20. def attemptFromEitherConsistentWithPure[A](eab: Either[Throwable, A]): IsEq[F[Either[Throwable, A]]]

    Permalink
    Definition Classes
    ApplicativeErrorLaws

  21. def bindSuspendsEvaluation[A](fa: F[A], a1: A, f: (A, A) ⇒ A): IsEq[F[A]]

    Permalink
    Definition Classes
    SyncLaws

  22. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    FunctorLaws

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

    Permalink
    Definition Classes
    FunctorLaws

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

    Permalink
    Definition Classes
    SyncLaws

  26. def delayThrowIsRaiseError[A](e: Throwable): IsEq[F[A]]

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    AnyRef

  28. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  29. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    FlatMapLaws

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

    Permalink
    Definition Classes
    FlatMapLaws

  32. def flatMapFromTailRecMConsistency[A, B](fa: F[A], fn: (A) ⇒ F[B]): IsEq[F[B]]

    Permalink
    Definition Classes
    FlatMapLaws

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

  38. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  39. def invariantComposition[A, B, C](fa: F[A], f1: (A) ⇒ B, f2: (B) ⇒ A, g1: (B) ⇒ C, g2: (C) ⇒ B): IsEq[F[C]]

    Permalink
    Definition Classes
    InvariantLaws

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

    Permalink
    Definition Classes
    InvariantLaws

  41. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    FlatMapLaws

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

    Permalink
    Definition Classes
    MonadLaws

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

    Permalink
    Definition Classes
    MonadLaws

  45. def map2EvalConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) ⇒ C): IsEq[F[C]]

    Permalink
    Definition Classes
    ApplyLaws

  46. def map2ProductConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) ⇒ C): IsEq[F[C]]

    Permalink
    Definition Classes
    ApplyLaws

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

    Permalink
    Definition Classes
    MonadLaws

  48. def mapSuspendsEvaluation[A](fa: F[A], a1: A, f: (A, A) ⇒ A): IsEq[F[A]]

    Permalink
    Definition Classes
    SyncLaws

  49. def monadErrorEnsureConsistency[A](fa: F[A], e: Throwable, p: (A) ⇒ Boolean): IsEq[F[A]]

    Permalink
    Definition Classes
    MonadErrorLaws

  50. def monadErrorEnsureOrConsistency[A](fa: F[A], e: (A) ⇒ Throwable, p: (A) ⇒ Boolean): IsEq[F[A]]

    Permalink
    Definition Classes
    MonadErrorLaws

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

    Permalink
    Definition Classes
    MonadErrorLaws

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

    Permalink
    Definition Classes
    MonadLaws

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

    Permalink
    Definition Classes
    MonadLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    FlatMapLaws

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

    Permalink
    Definition Classes
    AnyRef

  58. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  59. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  60. def onErrorPure[A](a: A, f: (Throwable) ⇒ F[Unit]): IsEq[F[A]]

    Permalink
    Definition Classes
    ApplicativeErrorLaws

  61. def onErrorRaise[A](fa: F[A], e: Throwable, fb: F[Unit]): IsEq[F[A]]

    Permalink
    Definition Classes
    ApplicativeErrorLaws

  62. def productLConsistency[A, B](fa: F[A], fb: F[B]): IsEq[F[A]]

    Permalink
    Definition Classes
    ApplyLaws

  63. def productRConsistency[A, B](fa: F[A], fb: F[B]): IsEq[F[B]]

    Permalink
    Definition Classes
    ApplyLaws

  64. def propagateErrorsThroughBindAsync[A](t: Throwable): IsEq[F[Either[Throwable, A]]]

    Permalink
    Definition Classes
    AsyncLaws

  65. def propagateErrorsThroughBindSuspend[A](t: Throwable): IsEq[F[A]]

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    AsyncLaws

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

    Permalink

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

    Permalink
    Definition Classes
    SyncLaws

  72. def rethrowAttempt[A](fa: F[A]): IsEq[F[A]]

    Permalink
    Definition Classes
    MonadErrorLaws

  73. def runAsyncIgnoresErrorInHandler[A](e: Throwable): IsEq[IO[Unit]]

    Permalink

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

    Permalink

  75. def runAsyncRaiseErrorProducesLeftIO[A](e: Throwable): IsEq[IO[Either[Throwable, A]]]

    Permalink

  76. def semigroupalAssociativity[A, B, C](fa: F[A], fb: F[B], fc: F[C]): (F[(A, (B, C))], F[((A, B), C)])

    Permalink
    Definition Classes
    SemigroupalLaws

  77. lazy val stackSafetyOnRepeatedAttempts: IsEq[F[Unit]]

    Permalink
    Definition Classes
    SyncLaws

  78. lazy val stackSafetyOnRepeatedLeftBinds: IsEq[F[Unit]]

    Permalink
    Definition Classes
    SyncLaws

  79. lazy val stackSafetyOnRepeatedMaps: IsEq[F[Int]]

    Permalink
    Definition Classes
    SyncLaws

  80. lazy val stackSafetyOnRepeatedRightBinds: IsEq[F[Unit]]

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    SyncLaws

  82. def suspendThrowIsRaiseError[A](e: Throwable): IsEq[F[A]]

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    FlatMapLaws

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

    Permalink
    Definition Classes
    MonadLaws

  86. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    SyncLaws

  88. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AsyncLaws[F]

Inherited from SyncLaws[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 SemigroupalLaws[F]

Inherited from FunctorLaws[F]

Inherited from InvariantLaws[F]

Inherited from AnyRef

Inherited from Any

Ungrouped