trait AsyncLaws[F[_]] extends GenTemporalLaws[F, Throwable] with SyncLaws[F]

Source
AsyncLaws.scala
Linear Supertypes
SyncLaws[F], GenTemporalLaws[F, Throwable], ClockLaws[F], GenSpawnLaws[F, Throwable], UniqueLaws[F], MonadCancelLaws[F, Throwable], 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. AsyncLaws
  2. SyncLaws
  3. GenTemporalLaws
  4. ClockLaws
  5. GenSpawnLaws
  6. UniqueLaws
  7. MonadCancelLaws
  8. MonadErrorLaws
  9. MonadLaws
  10. FlatMapLaws
  11. ApplicativeErrorLaws
  12. ApplicativeLaws
  13. ApplyLaws
  14. SemigroupalLaws
  15. FunctorLaws
  16. InvariantLaws
  17. AnyRef
  18. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. implicit abstract val F: kernel.Async[F]
    Definition Classes
    AsyncLawsSyncLawsGenTemporalLawsClockLawsGenSpawnLawsUniqueLawsMonadCancelLaws → MonadErrorLaws → MonadLaws → FlatMapLaws → 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 adaptErrorPure[A](a: A, f: (Throwable) => Throwable): laws.IsEq[F[A]]
    Definition Classes
    MonadErrorLaws → ApplicativeErrorLaws
  5. def adaptErrorRaise[A](e: Throwable, f: (Throwable) => Throwable): laws.IsEq[F[A]]
    Definition Classes
    MonadErrorLaws → ApplicativeErrorLaws
  6. def apProductConsistent[A, B](fa: F[A], f: F[(A) => B]): laws.IsEq[F[B]]
    Definition Classes
    ApplicativeLaws
  7. def applicativeComposition[A, B, C](fa: F[A], fab: F[(A) => B], fbc: F[(B) => C]): laws.IsEq[F[C]]
    Definition Classes
    ApplicativeLaws
  8. def applicativeErrorHandle[A](e: Throwable, f: (Throwable) => A): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  9. def applicativeErrorHandleWith[A](e: Throwable, f: (Throwable) => F[A]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  10. def applicativeHomomorphism[A, B](a: A, f: (A) => B): laws.IsEq[F[B]]
    Definition Classes
    ApplicativeLaws
  11. def applicativeIdentity[A](fa: F[A]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeLaws
  12. def applicativeInterchange[A, B](a: A, ff: F[(A) => B]): laws.IsEq[F[B]]
    Definition Classes
    ApplicativeLaws
  13. def applicativeMap[A, B](fa: F[A], f: (A) => B): laws.IsEq[F[B]]
    Definition Classes
    ApplicativeLaws
  14. def applicativeUnit[A](a: A): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeLaws
  15. def applyComposition[A, B, C](fa: F[A], fab: F[(A) => B], fbc: F[(B) => C]): laws.IsEq[F[C]]
    Definition Classes
    ApplyLaws
  16. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  17. def asyncCancelTokenIsUnsequencedOnCompletion[A](a: A, fu: F[Unit]): IsEq[F[A]]
  18. def asyncCancelTokenIsUnsequencedOnError[A](e: Throwable, fu: F[Unit]): IsEq[F[A]]
  19. def asyncCheckAttemptImmediateIsPure[A](a: A): IsEq[F[A]]
  20. def asyncCheckAttemptSuspendedLeftIsAsyncLeft[A](e: Throwable, fu: F[Unit]): IsEq[F[A]]
  21. def asyncCheckAttemptSuspendedRightIsAsyncRight[A](a: A, fu: F[Unit]): IsEq[F[A]]
  22. def asyncLeftIsUncancelableSequencedRaiseError[A](e: Throwable, fu: F[Unit]): IsEq[F[A]]
  23. def asyncRepeatedCallbackIgnored[A](a: A): IsEq[F[A]]
  24. def asyncRightIsUncancelableSequencedPure[A](a: A, fu: F[Unit]): IsEq[F[A]]
  25. def attemptConsistentWithAttemptT[A](fa: F[A]): laws.IsEq[EitherT[F, Throwable, A]]
    Definition Classes
    ApplicativeErrorLaws
  26. def attemptFromEitherConsistentWithPure[A](eab: Either[Throwable, A]): laws.IsEq[F[Either[Throwable, A]]]
    Definition Classes
    ApplicativeErrorLaws
  27. def canceledAssociatesLeftOverFlatMap[A](fa: F[A]): IsEq[F[Unit]]
    Definition Classes
    MonadCancelLaws
  28. def canceledSequencesOnCancelInOrder(fin1: F[Unit], fin2: F[Unit]): IsEq[F[Unit]]
    Definition Classes
    MonadCancelLaws
  29. def canceledUnitIdentity: IsEq[F[Unit]]
    Definition Classes
    MonadCancelLaws
  30. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  31. def covariantComposition[A, B, C](fa: F[A], f: (A) => B, g: (B) => C): laws.IsEq[F[C]]
    Definition Classes
    FunctorLaws
  32. def covariantIdentity[A](fa: F[A]): laws.IsEq[F[A]]
    Definition Classes
    FunctorLaws
  33. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  34. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  35. def evalOnCanceledIdentity(ec: ExecutionContext): IsEq[F[Unit]]
  36. def evalOnLocalPure(ec: ExecutionContext): IsEq[F[ExecutionContext]]
  37. def evalOnNeverIdentity(ec: ExecutionContext): IsEq[F[Unit]]
  38. def evalOnPureIdentity[A](a: A, ec: ExecutionContext): IsEq[F[A]]
  39. def evalOnRaiseErrorIdentity(e: Throwable, ec: ExecutionContext): IsEq[F[Unit]]
  40. def executionContextCommutativity[A](fa: F[A]): IsEq[F[ExecutionContext]]
  41. def fiberCancelationIsOutcomeCanceled: IsEq[F[kernel.Outcome[F, Throwable, Unit]]]
    Definition Classes
    GenSpawnLaws
  42. def fiberCanceledIsOutcomeCanceled: IsEq[F[kernel.Outcome[F, Throwable, Unit]]]
    Definition Classes
    GenSpawnLaws
  43. def fiberErrorIsOutcomeErrored(e: Throwable): IsEq[F[kernel.Outcome[F, Throwable, Unit]]]
    Definition Classes
    GenSpawnLaws
  44. def fiberJoinIsGuaranteeCase[A](fa0: F[A], f: (kernel.Outcome[F, Throwable, A]) => F[Unit]): IsEq[F[A]]
    Definition Classes
    GenSpawnLaws
  45. def fiberNeverIsNever: IsEq[F[kernel.Outcome[F, Throwable, Unit]]]
    Definition Classes
    GenSpawnLaws
  46. def fiberPureIsOutcomeCompletedPure[A](a: A): IsEq[F[kernel.Outcome[F, Throwable, A]]]
    Definition Classes
    GenSpawnLaws
  47. def fiberStartOfNeverIsUnit: IsEq[F[Unit]]
    Definition Classes
    GenSpawnLaws
  48. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  49. def flatMapAssociativity[A, B, C](fa: F[A], f: (A) => F[B], g: (B) => F[C]): laws.IsEq[F[C]]
    Definition Classes
    FlatMapLaws
  50. def flatMapConsistentApply[A, B](fa: F[A], fab: F[(A) => B]): laws.IsEq[F[B]]
    Definition Classes
    FlatMapLaws
  51. def flatMapFromTailRecMConsistency[A, B](fa: F[A], fn: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    FlatMapLaws
  52. def forceRAssociativity[A, B, C](fa: F[A], fb: F[B], fc: F[C]): IsEq[F[C]]
    Definition Classes
    MonadCancelLaws
  53. def forceRCanceledShortCircuits[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  54. def forceRDiscardsError[A](e: Throwable, fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  55. def forceRDiscardsPure[A, B](a: A, fa: F[B]): IsEq[F[B]]
    Definition Classes
    MonadCancelLaws
  56. def forceRNeverIsNever[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    GenSpawnLaws
  57. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  58. def guaranteeIsGuaranteeCase[A](fa: F[A], fin: F[Unit]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  59. def handleErrorConsistentWithRecover[A](fa: F[A], f: (Throwable) => A): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  60. def handleErrorPure[A](a: A, f: (Throwable) => A): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  61. def handleErrorWithConsistentWithRecoverWith[A](fa: F[A], f: (Throwable) => F[A]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  62. def handleErrorWithPure[A](a: A, f: (Throwable) => F[A]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  63. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  64. def invariantComposition[A, B, C](fa: F[A], f1: (A) => B, f2: (B) => A, g1: (B) => C, g2: (C) => B): laws.IsEq[F[C]]
    Definition Classes
    InvariantLaws
  65. def invariantIdentity[A](fa: F[A]): laws.IsEq[F[A]]
    Definition Classes
    InvariantLaws
  66. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  67. def kleisliAssociativity[A, B, C, D](f: (A) => F[B], g: (B) => F[C], h: (C) => F[D], a: A): laws.IsEq[F[D]]
    Definition Classes
    FlatMapLaws
  68. def kleisliLeftIdentity[A, B](a: A, f: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadLaws
  69. def kleisliRightIdentity[A, B](a: A, f: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadLaws
  70. def map2EvalConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) => C): laws.IsEq[F[C]]
    Definition Classes
    ApplyLaws
  71. def map2ProductConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) => C): laws.IsEq[F[C]]
    Definition Classes
    ApplyLaws
  72. def mapFlatMapCoherence[A, B](fa: F[A], f: (A) => B): laws.IsEq[F[B]]
    Definition Classes
    MonadLaws
  73. def mapOrKeepToMapEquivalence[A, A1 >: A](fa: F[A], pf: PartialFunction[A, A1]): laws.IsEq[F[A1]]
    Definition Classes
    FunctorLaws
  74. def monadErrorEnsureConsistency[A](fa: F[A], e: Throwable, p: (A) => Boolean): laws.IsEq[F[A]]
    Definition Classes
    MonadErrorLaws
  75. def monadErrorEnsureOrConsistency[A](fa: F[A], e: (A) => Throwable, p: (A) => Boolean): laws.IsEq[F[A]]
    Definition Classes
    MonadErrorLaws
  76. def monadErrorLeftZero[A, B](e: Throwable, f: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadErrorLaws
  77. def monadLeftIdentity[A, B](a: A, f: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadLaws
  78. def monadRightIdentity[A](fa: F[A]): laws.IsEq[F[A]]
    Definition Classes
    MonadLaws
  79. def monoidalLeftIdentity[A](fa: F[A]): (F[(Unit, A)], F[A])
    Definition Classes
    ApplicativeLaws
  80. def monoidalRightIdentity[A](fa: F[A]): (F[(A, Unit)], F[A])
    Definition Classes
    ApplicativeLaws
  81. def monotonicSleepSumIdentity(delta: FiniteDuration): IsEq[F[FiniteDuration]]
    Definition Classes
    GenTemporalLaws
  82. def monotonicity: F[Boolean]
    Definition Classes
    ClockLaws
  83. def mproductConsistency[A, B](fa: F[A], fb: (A) => F[B]): laws.IsEq[F[(A, B)]]
    Definition Classes
    FlatMapLaws
  84. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  85. def neverDominatesOverFlatMap[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    GenSpawnLaws
  86. def neverIsDerivedFromAsync[A]: IsEq[F[A]]
  87. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  88. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  89. def onCancelAssociatesOverUncancelableBoundary[A](fa: F[A], fin: F[Unit]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  90. def onCancelImpliesUncancelable[A](fa: F[A], fin1: F[Unit], fin2: F[Unit]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  91. def onErrorPure[A](a: A, f: (Throwable) => F[Unit]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  92. def onErrorRaise[A](fa: F[A], e: Throwable, fb: F[Unit]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  93. def productLConsistency[A, B](fa: F[A], fb: F[B]): laws.IsEq[F[A]]
    Definition Classes
    ApplyLaws
  94. def productRConsistency[A, B](fa: F[A], fb: F[B]): laws.IsEq[F[B]]
    Definition Classes
    ApplyLaws
  95. def pureAttempt[A](a: A): laws.IsEq[F[Either[Throwable, A]]]
    Definition Classes
    ApplicativeErrorLaws
  96. def raceDerivesFromRacePairLeft[A, B](fa: F[A]): IsEq[F[Either[A, B]]]
    Definition Classes
    GenSpawnLaws
  97. def raceDerivesFromRacePairRight[A, B](fb: F[B]): IsEq[F[Either[A, B]]]
    Definition Classes
    GenSpawnLaws
  98. def raceNeverNoncanceledIdentityLeft[A](fa: F[A]): IsEq[F[Either[Unit, A]]]
    Definition Classes
    GenSpawnLaws
  99. def raceNeverNoncanceledIdentityRight[A](fa: F[A]): IsEq[F[Either[A, Unit]]]
    Definition Classes
    GenSpawnLaws
  100. def raiseErrorAttempt(e: Throwable): laws.IsEq[F[Either[Throwable, Unit]]]
    Definition Classes
    ApplicativeErrorLaws
  101. def raiseErrorDistributesOverApLeft[A](h: (Throwable) => F[A], e: Throwable): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  102. def raiseErrorDistributesOverApRight[A](h: (Throwable) => F[A], e: Throwable): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  103. def recoverConsistentWithRecoverWith[A](fa: F[A], pf: PartialFunction[Throwable, A]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  104. def redeemDerivedFromAttemptMap[A, B](fa: F[A], fe: (Throwable) => B, fs: (A) => B): laws.IsEq[F[B]]
    Definition Classes
    ApplicativeErrorLaws
  105. def redeemWithDerivedFromAttemptFlatMap[A, B](fa: F[A], fe: (Throwable) => F[B], fs: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadErrorLaws
  106. def repeatedSuspendNotMemoized[A](a: A, f: (A) => A, hint: Type): IsEq[F[A]]
    Definition Classes
    SyncLaws
  107. def replicateAVoidReplicateA_Consistent[A](n: Int, fa: F[A]): laws.IsEq[F[Unit]]
    Definition Classes
    ApplicativeLaws
  108. def rethrowAttempt[A](fa: F[A]): laws.IsEq[F[A]]
    Definition Classes
    MonadErrorLaws
  109. 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
  110. def sleepRaceMinimum(d1: FiniteDuration, d2: FiniteDuration): IsEq[F[FiniteDuration]]
    Definition Classes
    GenTemporalLaws
  111. def startSleepMaximum(d1: FiniteDuration, d2: FiniteDuration): IsEq[F[FiniteDuration]]
    Definition Classes
    GenTemporalLaws
  112. def suspendThrowIsRaiseError[A](e: Throwable, hint: Type): IsEq[F[A]]
    Definition Classes
    SyncLaws
  113. def suspendValueIsPure[A](a: A, hint: Type): IsEq[F[A]]
    Definition Classes
    SyncLaws
  114. def syncStepIdentity[A](fa: F[A], limit: Int): IsEq[F[A]]
  115. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  116. def tailRecMConsistentFlatMap[A](a: A, f: (A) => F[A]): laws.IsEq[F[A]]
    Definition Classes
    FlatMapLaws
  117. lazy val tailRecMStackSafety: laws.IsEq[F[Int]]
    Definition Classes
    MonadLaws
  118. def toString(): String
    Definition Classes
    AnyRef → Any
  119. def uncancelableCancelCancels: IsEq[F[kernel.Outcome[F, Throwable, Unit]]]
    Definition Classes
    GenSpawnLaws
  120. def uncancelableCanceledAssociatesRightOverFlatMapAttempt[A](fa: F[A]): IsEq[F[Unit]]
    Definition Classes
    MonadCancelLaws
  121. def uncancelableEliminatesOnCancel[A](fa: F[A], fin: F[Unit]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  122. def uncancelableFinalizers[A](fin: F[Unit]): IsEq[F[Unit]]
    Definition Classes
    MonadCancelLaws
  123. def uncancelableIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  124. def uncancelableIgnoredPollEliminatesNesting[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  125. def uncancelablePollInverseNestIsUncancelable[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  126. def uncancelablePollIsIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  127. def uncancelableRaceNotInherited: IsEq[F[Unit]]
    Definition Classes
    GenSpawnLaws
  128. def uncancelableStartIsCancelable: IsEq[F[kernel.Outcome[F, Throwable, Unit]]]
    Definition Classes
    GenSpawnLaws
  129. def uniqueness: F[Boolean]
    Definition Classes
    UniqueLaws
  130. def unsequencedSuspendIsNoop[A](a: A, f: (A) => A, hint: Type): IsEq[F[A]]
    Definition Classes
    SyncLaws
  131. def voidErrorConsistentWithHandleError(fu: F[Unit]): laws.IsEq[F[Unit]]
    Definition Classes
    ApplicativeErrorLaws
  132. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  133. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  134. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Deprecated Value Members

  1. def raceCanceledIdentityLeft[A](fa: F[A]): IsEq[F[Either[Unit, A]]]
    Definition Classes
    GenSpawnLaws
    Annotations
    @deprecated
    Deprecated

    (Since version 3.5.0) law is no longer applicable (or correct)

  2. def raceCanceledIdentityRight[A](fa: F[A]): IsEq[F[Either[A, Unit]]]
    Definition Classes
    GenSpawnLaws
    Annotations
    @deprecated
    Deprecated

    (Since version 3.5.0) law is no longer applicable (or correct)

Inherited from SyncLaws[F]

Inherited from GenTemporalLaws[F, Throwable]

Inherited from ClockLaws[F]

Inherited from GenSpawnLaws[F, Throwable]

Inherited from UniqueLaws[F]

Inherited from MonadCancelLaws[F, Throwable]

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