trait GenTemporalLaws[F[_], E] extends GenSpawnLaws[F, E] with ClockLaws[F]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GenTemporalLaws
  2. ClockLaws
  3. GenSpawnLaws
  4. UniqueLaws
  5. MonadCancelLaws
  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. Protected

Abstract Value Members

  1. implicit abstract val F: kernel.GenTemporal[F, E]
    Definition Classes
    GenTemporalLaws → ClockLaws → GenSpawnLaws → UniqueLaws → MonadCancelLaws → 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: (E) => E): laws.IsEq[F[A]]
    Definition Classes
    MonadErrorLaws → ApplicativeErrorLaws
  5. def adaptErrorRaise[A](e: E, f: (E) => E): 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: E, f: (E) => A): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  9. def applicativeErrorHandleWith[A](e: E, f: (E) => 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 attemptConsistentWithAttemptT[A](fa: F[A]): laws.IsEq[EitherT[F, E, A]]
    Definition Classes
    ApplicativeErrorLaws
  18. def attemptFromEitherConsistentWithPure[A](eab: Either[E, A]): laws.IsEq[F[Either[E, A]]]
    Definition Classes
    ApplicativeErrorLaws
  19. def canceledAssociatesLeftOverFlatMap[A](fa: F[A]): IsEq[F[Unit]]
    Definition Classes
    MonadCancelLaws
  20. def canceledSequencesOnCancelInOrder(fin1: F[Unit], fin2: F[Unit]): IsEq[F[Unit]]
    Definition Classes
    MonadCancelLaws
  21. def canceledUnitIdentity: IsEq[F[Unit]]
    Definition Classes
    MonadCancelLaws
  22. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  23. def covariantComposition[A, B, C](fa: F[A], f: (A) => B, g: (B) => C): laws.IsEq[F[C]]
    Definition Classes
    FunctorLaws
  24. def covariantIdentity[A](fa: F[A]): laws.IsEq[F[A]]
    Definition Classes
    FunctorLaws
  25. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  26. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  27. def fiberCancelationIsOutcomeCanceled: IsEq[F[kernel.Outcome[F, E, Unit]]]
    Definition Classes
    GenSpawnLaws
  28. def fiberCanceledIsOutcomeCanceled: IsEq[F[kernel.Outcome[F, E, Unit]]]
    Definition Classes
    GenSpawnLaws
  29. def fiberErrorIsOutcomeErrored(e: E): IsEq[F[kernel.Outcome[F, E, Unit]]]
    Definition Classes
    GenSpawnLaws
  30. def fiberJoinIsGuaranteeCase[A](fa0: F[A], f: (kernel.Outcome[F, E, A]) => F[Unit]): IsEq[F[A]]
    Definition Classes
    GenSpawnLaws
  31. def fiberNeverIsNever: IsEq[F[kernel.Outcome[F, E, Unit]]]
    Definition Classes
    GenSpawnLaws
  32. def fiberPureIsOutcomeCompletedPure[A](a: A): IsEq[F[kernel.Outcome[F, E, A]]]
    Definition Classes
    GenSpawnLaws
  33. def fiberStartOfNeverIsUnit: IsEq[F[Unit]]
    Definition Classes
    GenSpawnLaws
  34. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  35. def flatMapAssociativity[A, B, C](fa: F[A], f: (A) => F[B], g: (B) => F[C]): laws.IsEq[F[C]]
    Definition Classes
    FlatMapLaws
  36. def flatMapConsistentApply[A, B](fa: F[A], fab: F[(A) => B]): laws.IsEq[F[B]]
    Definition Classes
    FlatMapLaws
  37. def flatMapFromTailRecMConsistency[A, B](fa: F[A], fn: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    FlatMapLaws
  38. def flatMapOrKeepToFlatMapCoherence[A, A1 >: A](fa: F[A], pfa: PartialFunction[A, F[A1]]): laws.IsEq[F[A1]]
    Definition Classes
    MonadLaws
  39. def forceRAssociativity[A, B, C](fa: F[A], fb: F[B], fc: F[C]): IsEq[F[C]]
    Definition Classes
    MonadCancelLaws
  40. def forceRCanceledShortCircuits[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  41. def forceRDiscardsError[A](e: E, fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  42. def forceRDiscardsPure[A, B](a: A, fa: F[B]): IsEq[F[B]]
    Definition Classes
    MonadCancelLaws
  43. def forceRNeverIsNever[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    GenSpawnLaws
  44. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  45. def guaranteeIsGuaranteeCase[A](fa: F[A], fin: F[Unit]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  46. def handleErrorConsistentWithRecover[A](fa: F[A], f: (E) => A): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  47. def handleErrorPure[A](a: A, f: (E) => A): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  48. def handleErrorWithConsistentWithRecoverWith[A](fa: F[A], f: (E) => F[A]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  49. def handleErrorWithPure[A](a: A, f: (E) => F[A]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  50. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  51. 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
  52. def invariantIdentity[A](fa: F[A]): laws.IsEq[F[A]]
    Definition Classes
    InvariantLaws
  53. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  54. 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
  55. def kleisliLeftIdentity[A, B](a: A, f: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadLaws
  56. def kleisliRightIdentity[A, B](a: A, f: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadLaws
  57. def map2EvalConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) => C): laws.IsEq[F[C]]
    Definition Classes
    ApplyLaws
  58. def map2ProductConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) => C): laws.IsEq[F[C]]
    Definition Classes
    ApplyLaws
  59. def mapFlatMapCoherence[A, B](fa: F[A], f: (A) => B): laws.IsEq[F[B]]
    Definition Classes
    MonadLaws
  60. def mapOrKeepToMapEquivalence[A, A1 >: A](fa: F[A], pf: PartialFunction[A, A1]): laws.IsEq[F[A1]]
    Definition Classes
    FunctorLaws
  61. def monadErrorEnsureConsistency[A](fa: F[A], e: E, p: (A) => Boolean): laws.IsEq[F[A]]
    Definition Classes
    MonadErrorLaws
  62. def monadErrorEnsureOrConsistency[A](fa: F[A], e: (A) => E, p: (A) => Boolean): laws.IsEq[F[A]]
    Definition Classes
    MonadErrorLaws
  63. def monadErrorLeftZero[A, B](e: E, f: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadErrorLaws
  64. def monadLeftIdentity[A, B](a: A, f: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadLaws
  65. def monadRightIdentity[A](fa: F[A]): laws.IsEq[F[A]]
    Definition Classes
    MonadLaws
  66. def monoidalLeftIdentity[A](fa: F[A]): (F[(Unit, A)], F[A])
    Definition Classes
    ApplicativeLaws
  67. def monoidalRightIdentity[A](fa: F[A]): (F[(A, Unit)], F[A])
    Definition Classes
    ApplicativeLaws
  68. def monotonicSleepSumIdentity(delta: FiniteDuration): IsEq[F[FiniteDuration]]
  69. def monotonicity: F[Boolean]
    Definition Classes
    ClockLaws
  70. def mproductConsistency[A, B](fa: F[A], fb: (A) => F[B]): laws.IsEq[F[(A, B)]]
    Definition Classes
    FlatMapLaws
  71. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  72. def neverDominatesOverFlatMap[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    GenSpawnLaws
  73. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  74. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  75. def onCancelAssociatesOverUncancelableBoundary[A](fa: F[A], fin: F[Unit]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  76. def onCancelImpliesUncancelable[A](fa: F[A], fin1: F[Unit], fin2: F[Unit]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  77. def onErrorPure[A](a: A, f: (E) => F[Unit]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  78. def onErrorRaise[A](fa: F[A], e: E, fb: F[Unit]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  79. def productLConsistency[A, B](fa: F[A], fb: F[B]): laws.IsEq[F[A]]
    Definition Classes
    ApplyLaws
  80. def productRConsistency[A, B](fa: F[A], fb: F[B]): laws.IsEq[F[B]]
    Definition Classes
    ApplyLaws
  81. def pureAttempt[A](a: A): laws.IsEq[F[Either[E, A]]]
    Definition Classes
    ApplicativeErrorLaws
  82. def raceDerivesFromRacePairLeft[A, B](fa: F[A]): IsEq[F[Either[A, B]]]
    Definition Classes
    GenSpawnLaws
  83. def raceDerivesFromRacePairRight[A, B](fb: F[B]): IsEq[F[Either[A, B]]]
    Definition Classes
    GenSpawnLaws
  84. def raceNeverNoncanceledIdentityLeft[A](fa: F[A]): IsEq[F[Either[Unit, A]]]
    Definition Classes
    GenSpawnLaws
  85. def raceNeverNoncanceledIdentityRight[A](fa: F[A]): IsEq[F[Either[A, Unit]]]
    Definition Classes
    GenSpawnLaws
  86. def raiseErrorAttempt(e: E): laws.IsEq[F[Either[E, Unit]]]
    Definition Classes
    ApplicativeErrorLaws
  87. def raiseErrorDistributesOverApLeft[A](h: (E) => F[A], e: E): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  88. def raiseErrorDistributesOverApRight[A](h: (E) => F[A], e: E): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  89. def recoverConsistentWithRecoverWith[A](fa: F[A], pf: PartialFunction[E, A]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  90. def redeemDerivedFromAttemptMap[A, B](fa: F[A], fe: (E) => B, fs: (A) => B): laws.IsEq[F[B]]
    Definition Classes
    ApplicativeErrorLaws
  91. def redeemWithDerivedFromAttemptFlatMap[A, B](fa: F[A], fe: (E) => F[B], fs: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadErrorLaws
  92. def replicateAVoidReplicateA_Consistent[A](n: Int, fa: F[A]): laws.IsEq[F[Unit]]
    Definition Classes
    ApplicativeLaws
  93. def rethrowAttempt[A](fa: F[A]): laws.IsEq[F[A]]
    Definition Classes
    MonadErrorLaws
  94. 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
  95. def sleepRaceMinimum(d1: FiniteDuration, d2: FiniteDuration): IsEq[F[FiniteDuration]]
  96. def startSleepMaximum(d1: FiniteDuration, d2: FiniteDuration): IsEq[F[FiniteDuration]]
  97. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  98. def tailRecMConsistentFlatMap[A](a: A, f: (A) => F[A]): laws.IsEq[F[A]]
    Definition Classes
    FlatMapLaws
  99. lazy val tailRecMStackSafety: laws.IsEq[F[Int]]
    Definition Classes
    MonadLaws
  100. def toString(): String
    Definition Classes
    AnyRef → Any
  101. def uncancelableCancelCancels: IsEq[F[kernel.Outcome[F, E, Unit]]]
    Definition Classes
    GenSpawnLaws
  102. def uncancelableCanceledAssociatesRightOverFlatMapAttempt[A](fa: F[A]): IsEq[F[Unit]]
    Definition Classes
    MonadCancelLaws
  103. def uncancelableEliminatesOnCancel[A](fa: F[A], fin: F[Unit]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  104. def uncancelableFinalizers[A](fin: F[Unit]): IsEq[F[Unit]]
    Definition Classes
    MonadCancelLaws
  105. def uncancelableIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  106. def uncancelableIgnoredPollEliminatesNesting[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  107. def uncancelablePollInverseNestIsUncancelable[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  108. def uncancelablePollIsIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  109. def uncancelableRaceNotInherited: IsEq[F[Unit]]
    Definition Classes
    GenSpawnLaws
  110. def uncancelableStartIsCancelable: IsEq[F[kernel.Outcome[F, E, Unit]]]
    Definition Classes
    GenSpawnLaws
  111. def uniqueness: F[Boolean]
    Definition Classes
    UniqueLaws
  112. def voidErrorConsistentWithHandleError(fu: F[Unit]): laws.IsEq[F[Unit]]
    Definition Classes
    ApplicativeErrorLaws
  113. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  114. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  115. 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 ClockLaws[F]

Inherited from GenSpawnLaws[F, E]

Inherited from UniqueLaws[F]

Inherited from MonadCancelLaws[F, E]

Inherited from MonadErrorLaws[F, E]

Inherited from MonadLaws[F]

Inherited from FlatMapLaws[F]

Inherited from ApplicativeErrorLaws[F, E]

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