Packages

trait ConcurrentEffectLaws[F[_]] extends ConcurrentLaws[F] with EffectLaws[F]

Source
ConcurrentEffectLaws.scala
Linear Supertypes
EffectLaws[F], ConcurrentLaws[F], AsyncLaws[F], SyncLaws[F], DeferLaws[F], BracketLaws[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. ConcurrentEffectLaws
  2. EffectLaws
  3. ConcurrentLaws
  4. AsyncLaws
  5. SyncLaws
  6. DeferLaws
  7. BracketLaws
  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 def F: ConcurrentEffect[F]
    Definition Classes
    ConcurrentEffectLaws → EffectLaws → ConcurrentLaws → AsyncLaws → SyncLaws → DeferLaws → BracketLaws → MonadErrorLaws → MonadLaws → FlatMapLaws → ApplicativeErrorLaws → ApplicativeLaws → ApplyLaws → SemigroupalLaws → FunctorLaws → InvariantLaws
  2. implicit abstract val contextShift: ContextShift[F]
    Definition Classes
    ConcurrentLaws

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 acquireAndReleaseAreUncancelable[A, B](fa: F[A], use: (A) => F[B], release: (A) => F[Unit]): IsEq[F[B]]
    Definition Classes
    BracketLaws
  5. def acquireIsNotCancelable[A](a1: A, a2: A): IsEq[F[A]]
    Definition Classes
    ConcurrentLaws
  6. def actionConcurrentWithPureValueIsJustAction[A](fa: F[A], a: A): IsEq[F[A]]
    Definition Classes
    ConcurrentLaws
  7. def adaptErrorPure[A](a: A, f: (Throwable) => Throwable): IsEq[F[A]]
    Definition Classes
    MonadErrorLaws → ApplicativeErrorLaws
  8. def adaptErrorRaise[A](e: Throwable, f: (Throwable) => Throwable): IsEq[F[A]]
    Definition Classes
    MonadErrorLaws → ApplicativeErrorLaws
  9. def apProductConsistent[A, B](fa: F[A], f: F[(A) => B]): IsEq[F[B]]
    Definition Classes
    ApplicativeLaws
  10. def applicativeComposition[A, B, C](fa: F[A], fab: F[(A) => B], fbc: F[(B) => C]): IsEq[F[C]]
    Definition Classes
    ApplicativeLaws
  11. def applicativeErrorHandle[A](e: Throwable, f: (Throwable) => A): IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  12. def applicativeErrorHandleWith[A](e: Throwable, f: (Throwable) => F[A]): IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  13. def applicativeHomomorphism[A, B](a: A, f: (A) => B): IsEq[F[B]]
    Definition Classes
    ApplicativeLaws
  14. def applicativeIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    ApplicativeLaws
  15. def applicativeInterchange[A, B](a: A, ff: F[(A) => B]): IsEq[F[B]]
    Definition Classes
    ApplicativeLaws
  16. def applicativeMap[A, B](fa: F[A], f: (A) => B): IsEq[F[B]]
    Definition Classes
    ApplicativeLaws
  17. def applicativeUnit[A](a: A): IsEq[F[A]]
    Definition Classes
    ApplicativeLaws
  18. def applyComposition[A, B, C](fa: F[A], fab: F[(A) => B], fbc: F[(B) => C]): IsEq[F[C]]
    Definition Classes
    ApplyLaws
  19. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  20. def asyncCanBeDerivedFromAsyncF[A](k: ((Either[Throwable, A]) => Unit) => Unit): IsEq[F[A]]
    Definition Classes
    AsyncLaws
  21. def asyncCancelableCoherence[A](r: Either[Throwable, A]): IsEq[F[A]]
    Definition Classes
    ConcurrentLaws
  22. def asyncCancelableReceivesCancelSignal[A](a: A): IsEq[F[A]]
    Definition Classes
    ConcurrentLaws
  23. def asyncFRegisterCanBeCancelled[A](a: A): IsEq[F[A]]
    Definition Classes
    ConcurrentLaws
  24. def asyncLeftIsRaiseError[A](e: Throwable): IsEq[F[A]]
    Definition Classes
    AsyncLaws
  25. def asyncRightIsPure[A](a: A): IsEq[F[A]]
    Definition Classes
    AsyncLaws
  26. def attemptConsistentWithAttemptT[A](fa: F[A]): IsEq[EitherT[F, Throwable, A]]
    Definition Classes
    ApplicativeErrorLaws
  27. def attemptFromEitherConsistentWithPure[A](eab: Either[Throwable, A]): IsEq[F[Either[Throwable, A]]]
    Definition Classes
    ApplicativeErrorLaws
  28. def bindSuspendsEvaluation[A](fa: F[A], a1: A, f: (A, A) => A): IsEq[F[A]]
    Definition Classes
    SyncLaws
  29. def bracketCaseFailureInAcquisitionRemainsFailure[A, B](e: Throwable, f: (A) => F[B], release: F[Unit]): IsEq[F[B]]
    Definition Classes
    BracketLaws
  30. def bracketCaseWithPureUnitIsEqvMap[A, B](fa: F[A], f: (A) => B): IsEq[F[B]]
    Definition Classes
    BracketLaws
  31. def bracketCaseWithPureUnitIsUncancelable[A, B](fa: F[A], f: (A) => F[B]): IsEq[F[B]]
    Definition Classes
    BracketLaws
  32. def bracketIsDerivedFromBracketCase[A, B](fa: F[A], use: (A) => F[B], release: (A) => F[Unit]): IsEq[F[B]]
    Definition Classes
    BracketLaws
  33. def bracketPropagatesTransformerEffects[M[_], A, B](fromM: ~>[M, F])(acquire: F[A], use: (A) => F[B], release: (A) => M[Unit]): IsEq[F[B]]
    Definition Classes
    BracketLaws
  34. def bracketReleaseIsCalledOnCompletedOrError[A, B](fa: F[A], b: B): IsEq[F[B]]
    Definition Classes
    AsyncLaws
  35. def cancelOnBracketReleases[A, B](a: A, f: (A, A) => B): IsEq[F[B]]
    Definition Classes
    ConcurrentLaws
  36. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  37. def covariantComposition[A, B, C](fa: F[A], f: (A) => B, g: (B) => C): IsEq[F[C]]
    Definition Classes
    FunctorLaws
  38. def covariantIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    FunctorLaws
  39. def deferDoesNotEvaluate[A](fa: (Unit) => F[A]): IsEq[Boolean]
    Definition Classes
    DeferLaws
  40. def deferIdentity[A](fa: (Unit) => F[A]): IsEq[F[A]]
    Definition Classes
    DeferLaws
  41. def deferIsStackSafe[A](fa: (Unit) => F[A]): IsEq[F[A]]
    Definition Classes
    DeferLaws
  42. def delayConstantIsPure[A](a: A): IsEq[F[A]]
    Definition Classes
    SyncLaws
  43. def delayThrowIsRaiseError[A](e: Throwable): IsEq[F[A]]
    Definition Classes
    SyncLaws
  44. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  45. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  46. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  47. def flatMapAssociativity[A, B, C](fa: F[A], f: (A) => F[B], g: (B) => F[C]): IsEq[F[C]]
    Definition Classes
    FlatMapLaws
  48. def flatMapConsistentApply[A, B](fa: F[A], fab: F[(A) => B]): IsEq[F[B]]
    Definition Classes
    FlatMapLaws
  49. def flatMapFromTailRecMConsistency[A, B](fa: F[A], fn: (A) => F[B]): IsEq[F[B]]
    Definition Classes
    FlatMapLaws
  50. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  51. def guaranteeCaseIsDerivedFromBracketCase[A](fa: F[A], finalizer: (ExitCase[Throwable]) => F[Unit]): IsEq[F[A]]
    Definition Classes
    BracketLaws
  52. def guaranteeIsDerivedFromBracket[A](fa: F[A], finalizer: F[Unit]): IsEq[F[A]]
    Definition Classes
    BracketLaws
  53. def handleErrorConsistentWithRecover[A](fa: F[A], f: (Throwable) => A): IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  54. def handleErrorPure[A](a: A, f: (Throwable) => A): IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  55. def handleErrorWithConsistentWithRecoverWith[A](fa: F[A], f: (Throwable) => F[A]): IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  56. def handleErrorWithPure[A](a: A, f: (Throwable) => F[A]): IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  57. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  58. 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
  59. def invariantIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    InvariantLaws
  60. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  61. def joinIsIdempotent[A](a: A): IsEq[F[A]]
    Definition Classes
    ConcurrentLaws
  62. 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
  63. def kleisliLeftIdentity[A, B](a: A, f: (A) => F[B]): IsEq[F[B]]
    Definition Classes
    MonadLaws
  64. def kleisliRightIdentity[A, B](a: A, f: (A) => F[B]): IsEq[F[B]]
    Definition Classes
    MonadLaws
  65. def map2EvalConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) => C): IsEq[F[C]]
    Definition Classes
    ApplyLaws
  66. def map2ProductConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) => C): IsEq[F[C]]
    Definition Classes
    ApplyLaws
  67. def mapFlatMapCoherence[A, B](fa: F[A], f: (A) => B): IsEq[F[B]]
    Definition Classes
    MonadLaws
  68. def mapSuspendsEvaluation[A](fa: F[A], a1: A, f: (A, A) => A): IsEq[F[A]]
    Definition Classes
    SyncLaws
  69. def monadErrorEnsureConsistency[A](fa: F[A], e: Throwable, p: (A) => Boolean): IsEq[F[A]]
    Definition Classes
    MonadErrorLaws
  70. def monadErrorEnsureOrConsistency[A](fa: F[A], e: (A) => Throwable, p: (A) => Boolean): IsEq[F[A]]
    Definition Classes
    MonadErrorLaws
  71. def monadErrorLeftZero[A, B](e: Throwable, f: (A) => F[B]): IsEq[F[B]]
    Definition Classes
    MonadErrorLaws
  72. def monadLeftIdentity[A, B](a: A, f: (A) => F[B]): IsEq[F[B]]
    Definition Classes
    MonadLaws
  73. def monadRightIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadLaws
  74. def monoidalLeftIdentity[A](fa: F[A]): (F[(Unit, A)], F[A])
    Definition Classes
    ApplicativeLaws
  75. def monoidalRightIdentity[A](fa: F[A]): (F[(A, Unit)], F[A])
    Definition Classes
    ApplicativeLaws
  76. def mproductConsistency[A, B](fa: F[A], fb: (A) => F[B]): IsEq[F[(A, B)]]
    Definition Classes
    FlatMapLaws
  77. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  78. def neverIsDerivedFromAsync[A]: IsEq[F[A]]
    Definition Classes
    AsyncLaws
  79. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  80. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  81. def onCancelIsDerivedFromGuaranteeCase[A](fa: F[A], finalizer: F[Unit]): IsEq[F[A]]
    Definition Classes
    BracketLaws
  82. def onErrorPure[A](a: A, f: (Throwable) => F[Unit]): IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  83. def onErrorRaise[A](fa: F[A], e: Throwable, fb: F[Unit]): IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  84. def productLConsistency[A, B](fa: F[A], fb: F[B]): IsEq[F[A]]
    Definition Classes
    ApplyLaws
  85. def productRConsistency[A, B](fa: F[A], fb: F[B]): IsEq[F[B]]
    Definition Classes
    ApplyLaws
  86. def propagateErrorsThroughBindAsync[A](t: Throwable): IsEq[F[Either[Throwable, A]]]
    Definition Classes
    AsyncLaws
  87. def propagateErrorsThroughBindSuspend[A](t: Throwable): IsEq[F[A]]
    Definition Classes
    SyncLaws
  88. def pureAttempt[A](a: A): IsEq[F[Either[Throwable, A]]]
    Definition Classes
    ApplicativeErrorLaws
  89. def raceCancelsBoth[A, B, C](a: A, b: B, f: (A, B) => C): IsEq[F[C]]
    Definition Classes
    ConcurrentLaws
  90. def raceCancelsLoser[A, B](r: Either[Throwable, A], leftWinner: Boolean, b: B): IsEq[F[B]]
    Definition Classes
    ConcurrentLaws
  91. def raceMirrorsLeftWinner[A](fa: F[A], default: A): IsEq[F[A]]
    Definition Classes
    ConcurrentLaws
  92. def raceMirrorsRightWinner[A](fa: F[A], default: A): IsEq[F[A]]
    Definition Classes
    ConcurrentLaws
  93. def racePairCanJoinLeft[A](a: A): IsEq[F[A]]
    Definition Classes
    ConcurrentLaws
  94. def racePairCanJoinRight[A](a: A): IsEq[F[A]]
    Definition Classes
    ConcurrentLaws
  95. def racePairCancelsBoth[A, B, C](a: A, b: B, f: (A, B) => C): IsEq[F[C]]
    Definition Classes
    ConcurrentLaws
  96. def racePairCancelsLoser[A, B](r: Either[Throwable, A], leftWinner: Boolean, b: B): IsEq[F[B]]
    Definition Classes
    ConcurrentLaws
  97. def racePairMirrorsLeftWinner[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    ConcurrentLaws
  98. def racePairMirrorsRightWinner[B](fb: F[B]): IsEq[F[B]]
    Definition Classes
    ConcurrentLaws
  99. def raiseErrorAttempt(e: Throwable): IsEq[F[Either[Throwable, Unit]]]
    Definition Classes
    ApplicativeErrorLaws
  100. def raiseErrorDistributesOverApLeft[A](h: (Throwable) => F[A], e: Throwable): IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  101. def raiseErrorDistributesOverApRight[A](h: (Throwable) => F[A], e: Throwable): IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  102. def recoverConsistentWithRecoverWith[A](fa: F[A], pf: PartialFunction[Throwable, A]): IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  103. def redeemDerivedFromAttemptMap[A, B](fa: F[A], fe: (Throwable) => B, fs: (A) => B): IsEq[F[B]]
    Definition Classes
    ApplicativeErrorLaws
  104. def redeemWithDerivedFromAttemptFlatMap[A, B](fa: F[A], fe: (Throwable) => F[B], fs: (A) => F[B]): IsEq[F[B]]
    Definition Classes
    MonadErrorLaws
  105. def releaseIsNotCancelable[A](a1: A, a2: A): IsEq[F[A]]
    Definition Classes
    ConcurrentLaws
  106. def repeatedAsyncEvaluationNotMemoized[A](a: A, f: (A) => A): IsEq[F[A]]
    Definition Classes
    AsyncLaws
  107. def repeatedAsyncFEvaluationNotMemoized[A](a: A, f: (A) => A): IsEq[F[A]]
    Definition Classes
    AsyncLaws
  108. def repeatedCallbackIgnored[A](a: A, f: (A) => A): IsEq[F[A]]
    Definition Classes
    AsyncLaws
  109. def repeatedSyncEvaluationNotMemoized[A](a: A, f: (A) => A): IsEq[F[A]]
    Definition Classes
    SyncLaws
  110. def rethrowAttempt[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadErrorLaws
  111. def runAsyncIgnoresErrorInHandler[A](e: Throwable): IsEq[IO[Unit]]
    Definition Classes
    EffectLaws
  112. def runAsyncPureProducesRightIO[A](a: A): IsEq[IO[Either[Throwable, A]]]
    Definition Classes
    EffectLaws
  113. def runAsyncRaiseErrorProducesLeftIO[A](e: Throwable): IsEq[IO[Either[Throwable, A]]]
    Definition Classes
    EffectLaws
  114. def runAsyncRunCancelableCoherence[A](fa: F[A]): IsEq[IO[A]]
  115. def runCancelableIsSynchronous[A]: IsEq[F[Unit]]
  116. def runCancelableStartCancelCoherence[A](a: A): IsEq[F[A]]
  117. 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
  118. def stackSafetyOfBracketOnRepeatedLeftBinds(iterations: Int): IsEq[F[Unit]]
    Definition Classes
    SyncLaws
  119. def stackSafetyOfBracketOnRepeatedRightBinds(iterations: Int): IsEq[F[Unit]]
    Definition Classes
    SyncLaws
  120. def stackSafetyOfGuaranteeOnRepeatedLeftBinds(iterations: Int): IsEq[F[Unit]]
    Definition Classes
    SyncLaws
  121. def stackSafetyOfGuaranteeOnRepeatedRightBinds(iterations: Int): IsEq[F[Unit]]
    Definition Classes
    SyncLaws
  122. def stackSafetyOnRepeatedAttempts(iterations: Int): IsEq[F[Unit]]
    Definition Classes
    SyncLaws
  123. def stackSafetyOnRepeatedLeftBinds(iterations: Int): IsEq[F[Unit]]
    Definition Classes
    SyncLaws
  124. def stackSafetyOnRepeatedMaps(iterations: Int): IsEq[F[Int]]
    Definition Classes
    SyncLaws
  125. def stackSafetyOnRepeatedRightBinds(iterations: Int): IsEq[F[Unit]]
    Definition Classes
    SyncLaws
  126. def startCancelIsUnit[A](fa: F[A]): IsEq[F[Unit]]
    Definition Classes
    ConcurrentLaws
  127. def startJoinIsIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    ConcurrentLaws
  128. def suspendConstantIsPureJoin[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    SyncLaws
  129. def suspendThrowIsRaiseError[A](e: Throwable): IsEq[F[A]]
    Definition Classes
    SyncLaws
  130. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  131. def tailRecMConsistentFlatMap[A](a: A, f: (A) => F[A]): IsEq[F[A]]
    Definition Classes
    FlatMapLaws
  132. lazy val tailRecMStackSafety: IsEq[F[Int]]
    Definition Classes
    MonadLaws
  133. def toIORunAsyncConsistency[A](fa: F[A]): IsEq[IO[A]]
    Definition Classes
    EffectLaws
  134. def toIORunCancelableConsistency[A](fa: F[A]): IsEq[IO[A]]
  135. def toIOStackSafety[A](iterations: Int)(fa: F[A]): IsEq[IO[A]]
    Definition Classes
    EffectLaws
  136. def toIOinverseOfLiftIO[A](ioa: IO[A]): IsEq[IO[A]]
    Definition Classes
    EffectLaws
  137. def toString(): String
    Definition Classes
    AnyRef → Any
  138. def uncancelableMirrorsSource[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    ConcurrentLaws
  139. def uncancelablePreventsCancelation[A](a: A): IsEq[F[A]]
    Definition Classes
    ConcurrentLaws
  140. def uncancelablePreventsCanceledCase[A](fa: F[A], onCancel: F[Unit], onFinish: F[Unit]): IsEq[F[A]]
    Definition Classes
    BracketLaws
  141. def unsequencedDelayIsNoop[A](a: A, f: (A) => A): IsEq[F[A]]
    Definition Classes
    SyncLaws
  142. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  143. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  144. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from EffectLaws[F]

Inherited from ConcurrentLaws[F]

Inherited from AsyncLaws[F]

Inherited from SyncLaws[F]

Inherited from DeferLaws[F]

Inherited from BracketLaws[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