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], 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. 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: Concurrent[F]

    Permalink
    Definition Classes
    ConcurrentLaws → 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 asyncCancelableCoherence[A](r: Either[Throwable, A]): IsEq[F[A]]

    Permalink

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

    Permalink

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

    Permalink
    Definition Classes
    AsyncLaws

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

    Permalink
    Definition Classes
    AsyncLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    SyncLaws

  24. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    FunctorLaws

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

    Permalink
    Definition Classes
    FunctorLaws

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    AnyRef

  30. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  31. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    FlatMapLaws

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

    Permalink
    Definition Classes
    FlatMapLaws

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

    Permalink
    Definition Classes
    FlatMapLaws

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

  40. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

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

    Permalink
    Definition Classes
    InvariantLaws

  43. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink

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

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

    Permalink
    Definition Classes
    MonadLaws

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

    Permalink
    Definition Classes
    MonadLaws

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

    Permalink
    Definition Classes
    ApplyLaws

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

    Permalink
    Definition Classes
    ApplyLaws

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

    Permalink
    Definition Classes
    MonadLaws

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    MonadErrorLaws

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

    Permalink
    Definition Classes
    MonadErrorLaws

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

    Permalink
    Definition Classes
    MonadErrorLaws

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

    Permalink
    Definition Classes
    MonadLaws

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

    Permalink
    Definition Classes
    MonadLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    ApplicativeLaws

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

    Permalink
    Definition Classes
    FlatMapLaws

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

    Permalink
    Definition Classes
    AnyRef

  61. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  62. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  63. def onCancelRaiseErrorCanCancelSource[A](a: A, e: Throwable): IsEq[F[A]]

    Permalink

  64. def onCancelRaiseErrorMirrorsSource[A](fa: F[A], e: Throwable): IsEq[F[A]]

    Permalink

  65. def onCancelRaiseErrorTerminatesOnCancel[A](e: Throwable): IsEq[F[A]]

    Permalink

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplyLaws

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

    Permalink
    Definition Classes
    ApplyLaws

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

    Permalink
    Definition Classes
    AsyncLaws

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    ApplicativeErrorLaws

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

    Permalink
    Definition Classes
    AsyncLaws

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

    Permalink
    Definition Classes
    AsyncLaws

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    MonadErrorLaws

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

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink

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

    Permalink

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    SyncLaws

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

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    FlatMapLaws

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

    Permalink
    Definition Classes
    MonadLaws

  101. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink

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

    Permalink

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

    Permalink
    Definition Classes
    SyncLaws

  105. final def wait(): Unit

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

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

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

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