Trait/Object

cats.effect.laws

ConcurrentLaws

Related Docs: object ConcurrentLaws | package laws

Permalink

trait ConcurrentLaws[F[_]] extends AsyncLaws[F]

Source
ConcurrentLaws.scala
Linear Supertypes
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
Known Subclasses
ConcurrentEffectLaws
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ConcurrentLaws
  2. AsyncLaws
  3. SyncLaws
  4. DeferLaws
  5. BracketLaws
  6. MonadErrorLaws
  7. MonadLaws
  8. FlatMapLaws
  9. ApplicativeErrorLaws
  10. ApplicativeLaws
  11. ApplyLaws
  12. SemigroupalLaws
  13. FunctorLaws
  14. InvariantLaws
  15. AnyRef
  16. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. implicit abstract def F: Concurrent[F]

    Permalink
    Definition Classes
    ConcurrentLaws → AsyncLaws → SyncLaws → DeferLaws → BracketLaws → MonadErrorLaws → MonadLaws → FlatMapLaws → ApplicativeErrorLaws → ApplicativeLaws → ApplyLaws → SemigroupalLaws → FunctorLaws → InvariantLaws

  2. implicit abstract val contextShift: ContextShift[F]

    Permalink

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 acquireAndReleaseAreUncancelable[A, B](fa: F[A], use: (A) ⇒ F[B], release: (A) ⇒ F[Unit]): IsEq[F[B]]

    Permalink
    Definition Classes
    BracketLaws

  5. def acquireIsNotCancelable[A](a1: A, a2: A): IsEq[F[A]]

    Permalink

  6. def actionConcurrentWithPureValueIsJustAction[A](fa: F[A], a: A): IsEq[F[A]]

    Permalink

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

    Permalink
    Definition Classes
    MonadErrorLaws

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

    Permalink
    Definition Classes
    MonadErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    ApplyLaws

  19. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  20. def asyncCanBeDerivedFromAsyncF[A](k: ((Either[Throwable, A]) ⇒ Unit) ⇒ Unit): IsEq[F[A]]

    Permalink
    Definition Classes
    AsyncLaws

  21. def asyncCancelableCoherence[A](r: Either[Throwable, A]): IsEq[F[A]]

    Permalink

  22. def asyncCancelableReceivesCancelSignal[A](a: A): IsEq[F[A]]

    Permalink

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

    Permalink

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

    Permalink
    Definition Classes
    AsyncLaws

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

    Permalink
    Definition Classes
    AsyncLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    SyncLaws

  29. def bracketCaseFailureInAcquisitionRemainsFailure[A, B](e: Throwable, f: (A) ⇒ F[B], release: F[Unit]): IsEq[F[B]]

    Permalink
    Definition Classes
    BracketLaws

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

    Permalink
    Definition Classes
    BracketLaws

  31. def bracketCaseWithPureUnitIsUncancelable[A, B](fa: F[A], f: (A) ⇒ F[B]): IsEq[F[B]]

    Permalink
    Definition Classes
    BracketLaws

  32. def bracketIsDerivedFromBracketCase[A, B](fa: F[A], use: (A) ⇒ F[B], release: (A) ⇒ F[Unit]): IsEq[F[B]]

    Permalink
    Definition Classes
    BracketLaws

  33. def bracketReleaseIsCalledOnCompletedOrError[A, B](fa: F[A], b: B): IsEq[F[B]]

    Permalink
    Definition Classes
    AsyncLaws

  34. def cancelOnBracketReleases[A, B](a: A, f: (A, A) ⇒ B): IsEq[F[B]]

    Permalink

  35. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    FunctorLaws

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

    Permalink
    Definition Classes
    FunctorLaws

  38. def deferDoesNotEvaluate[A](fa: (Unit) ⇒ F[A]): IsEq[Boolean]

    Permalink
    Definition Classes
    DeferLaws

  39. def deferIdentity[A](fa: (Unit) ⇒ F[A]): IsEq[F[A]]

    Permalink
    Definition Classes
    DeferLaws

  40. def deferIsStackSafe[A](fa: (Unit) ⇒ F[A]): IsEq[F[A]]

    Permalink
    Definition Classes
    DeferLaws

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    AnyRef

  44. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  45. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    FlatMapLaws

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

    Permalink
    Definition Classes
    FlatMapLaws

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

    Permalink
    Definition Classes
    FlatMapLaws

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

    Permalink
    Definition Classes
    AnyRef → Any

  50. def guaranteeCaseIsDerivedFromBracketCase[A](fa: F[A], finalizer: (ExitCase[Throwable]) ⇒ F[Unit]): IsEq[F[A]]

    Permalink
    Definition Classes
    BracketLaws

  51. def guaranteeIsDerivedFromBracket[A](fa: F[A], finalizer: F[Unit]): IsEq[F[A]]

    Permalink
    Definition Classes
    BracketLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

  56. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

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

    Permalink
    Definition Classes
    InvariantLaws

  59. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  60. def joinIsIdempotent[A](a: A): IsEq[F[A]]

    Permalink

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

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

    Permalink
    Definition Classes
    MonadLaws

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

    Permalink
    Definition Classes
    MonadLaws

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

    Permalink
    Definition Classes
    ApplyLaws

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

    Permalink
    Definition Classes
    ApplyLaws

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

    Permalink
    Definition Classes
    MonadLaws

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    MonadErrorLaws

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

    Permalink
    Definition Classes
    MonadErrorLaws

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

    Permalink
    Definition Classes
    MonadErrorLaws

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

    Permalink
    Definition Classes
    MonadLaws

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

    Permalink
    Definition Classes
    MonadLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    FlatMapLaws

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

    Permalink
    Definition Classes
    AnyRef

  77. def neverIsDerivedFromAsync[A]: IsEq[F[A]]

    Permalink
    Definition Classes
    AsyncLaws

  78. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  79. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplyLaws

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

    Permalink
    Definition Classes
    ApplyLaws

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

    Permalink
    Definition Classes
    AsyncLaws

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

  87. def raceCancelsBoth[A, B, C](a: A, b: B, f: (A, B) ⇒ C): IsEq[F[C]]

    Permalink

  88. def raceCancelsLoser[A, B](r: Either[Throwable, A], leftWinner: Boolean, b: B): IsEq[F[B]]

    Permalink

  89. def raceMirrorsLeftWinner[A](fa: F[A], default: A): IsEq[F[A]]

    Permalink

  90. def raceMirrorsRightWinner[A](fa: F[A], default: A): IsEq[F[A]]

    Permalink

  91. def racePairCanJoinLeft[A](a: A): IsEq[F[A]]

    Permalink

  92. def racePairCanJoinRight[A](a: A): IsEq[F[A]]

    Permalink

  93. def racePairCancelsBoth[A, B, C](a: A, b: B, f: (A, B) ⇒ C): IsEq[F[C]]

    Permalink

  94. def racePairCancelsLoser[A, B](r: Either[Throwable, A], leftWinner: Boolean, b: B): IsEq[F[B]]

    Permalink

  95. def racePairMirrorsLeftWinner[A](fa: F[A]): IsEq[F[A]]

    Permalink

  96. def racePairMirrorsRightWinner[B](fb: F[B]): IsEq[F[B]]

    Permalink

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

  99. def releaseIsNotCancelable[A](a1: A, a2: A): IsEq[F[A]]

    Permalink

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

    Permalink
    Definition Classes
    AsyncLaws

  101. def repeatedCallbackIgnored[A](a: A, f: (A) ⇒ A): IsEq[F[A]]

    Permalink
    Definition Classes
    AsyncLaws

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    MonadErrorLaws

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

  105. def stackSafetyOfBracketOnRepeatedLeftBinds(iterations: Int): IsEq[F[Unit]]

    Permalink
    Definition Classes
    SyncLaws

  106. def stackSafetyOfBracketOnRepeatedRightBinds(iterations: Int): IsEq[F[Unit]]

    Permalink
    Definition Classes
    SyncLaws

  107. def stackSafetyOfGuaranteeOnRepeatedLeftBinds(iterations: Int): IsEq[F[Unit]]

    Permalink
    Definition Classes
    SyncLaws

  108. def stackSafetyOfGuaranteeOnRepeatedRightBinds(iterations: Int): IsEq[F[Unit]]

    Permalink
    Definition Classes
    SyncLaws

  109. def stackSafetyOnRepeatedAttempts(iterations: Int): IsEq[F[Unit]]

    Permalink
    Definition Classes
    SyncLaws

  110. def stackSafetyOnRepeatedLeftBinds(iterations: Int): IsEq[F[Unit]]

    Permalink
    Definition Classes
    SyncLaws

  111. def stackSafetyOnRepeatedMaps(iterations: Int): IsEq[F[Int]]

    Permalink
    Definition Classes
    SyncLaws

  112. def stackSafetyOnRepeatedRightBinds(iterations: Int): IsEq[F[Unit]]

    Permalink
    Definition Classes
    SyncLaws

  113. def startCancelIsUnit[A](fa: F[A]): IsEq[F[Unit]]

    Permalink

  114. def startJoinIsIdentity[A](fa: F[A]): IsEq[F[A]]

    Permalink

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    FlatMapLaws

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

    Permalink
    Definition Classes
    MonadLaws

  120. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  121. def uncancelableMirrorsSource[A](fa: F[A]): IsEq[F[A]]

    Permalink

  122. def uncancelablePreventsCancelation[A](a: A): IsEq[F[A]]

    Permalink

  123. def uncancelablePreventsCanceledCase[A](fa: F[A], onCancel: F[Unit], onFinish: F[Unit]): IsEq[F[A]]

    Permalink
    Definition Classes
    BracketLaws

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

    Permalink
    Definition Classes
    SyncLaws

  125. final def wait(): Unit

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

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

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

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

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

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