trait SyncLaws[F[_]] extends MonadCancelLaws[F, Throwable] with ClockLaws[F] with UniqueLaws[F]

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

Abstract Value Members

  1. implicit abstract val F: kernel.Sync[F]
    Definition Classes
    SyncLaws → UniqueLaws → ClockLaws → 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: (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 attemptConsistentWithAttemptT[A](fa: F[A]): laws.IsEq[EitherT[F, Throwable, A]]
    Definition Classes
    ApplicativeErrorLaws
  18. def attemptFromEitherConsistentWithPure[A](eab: Either[Throwable, A]): laws.IsEq[F[Either[Throwable, 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 finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  28. def flatMapAssociativity[A, B, C](fa: F[A], f: (A) => F[B], g: (B) => F[C]): laws.IsEq[F[C]]
    Definition Classes
    FlatMapLaws
  29. def flatMapConsistentApply[A, B](fa: F[A], fab: F[(A) => B]): laws.IsEq[F[B]]
    Definition Classes
    FlatMapLaws
  30. def flatMapFromTailRecMConsistency[A, B](fa: F[A], fn: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    FlatMapLaws
  31. def flatMapOrKeepToFlatMapCoherence[A, A1 >: A](fa: F[A], pfa: PartialFunction[A, F[A1]]): laws.IsEq[F[A1]]
    Definition Classes
    MonadLaws
  32. def forceRAssociativity[A, B, C](fa: F[A], fb: F[B], fc: F[C]): IsEq[F[C]]
    Definition Classes
    MonadCancelLaws
  33. def forceRCanceledShortCircuits[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  34. def forceRDiscardsError[A](e: Throwable, fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  35. def forceRDiscardsPure[A, B](a: A, fa: F[B]): IsEq[F[B]]
    Definition Classes
    MonadCancelLaws
  36. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  37. def guaranteeIsGuaranteeCase[A](fa: F[A], fin: F[Unit]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  38. def handleErrorConsistentWithRecover[A](fa: F[A], f: (Throwable) => A): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  39. def handleErrorPure[A](a: A, f: (Throwable) => A): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  40. def handleErrorWithConsistentWithRecoverWith[A](fa: F[A], f: (Throwable) => F[A]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  41. def handleErrorWithPure[A](a: A, f: (Throwable) => F[A]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  42. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  43. 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
  44. def invariantIdentity[A](fa: F[A]): laws.IsEq[F[A]]
    Definition Classes
    InvariantLaws
  45. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  46. 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
  47. def kleisliLeftIdentity[A, B](a: A, f: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadLaws
  48. def kleisliRightIdentity[A, B](a: A, f: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadLaws
  49. def map2EvalConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) => C): laws.IsEq[F[C]]
    Definition Classes
    ApplyLaws
  50. def map2ProductConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) => C): laws.IsEq[F[C]]
    Definition Classes
    ApplyLaws
  51. def mapFlatMapCoherence[A, B](fa: F[A], f: (A) => B): laws.IsEq[F[B]]
    Definition Classes
    MonadLaws
  52. def mapOrKeepToMapEquivalence[A, A1 >: A](fa: F[A], pf: PartialFunction[A, A1]): laws.IsEq[F[A1]]
    Definition Classes
    FunctorLaws
  53. def monadErrorEnsureConsistency[A](fa: F[A], e: Throwable, p: (A) => Boolean): laws.IsEq[F[A]]
    Definition Classes
    MonadErrorLaws
  54. def monadErrorEnsureOrConsistency[A](fa: F[A], e: (A) => Throwable, p: (A) => Boolean): laws.IsEq[F[A]]
    Definition Classes
    MonadErrorLaws
  55. def monadErrorLeftZero[A, B](e: Throwable, f: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadErrorLaws
  56. def monadLeftIdentity[A, B](a: A, f: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadLaws
  57. def monadRightIdentity[A](fa: F[A]): laws.IsEq[F[A]]
    Definition Classes
    MonadLaws
  58. def monoidalLeftIdentity[A](fa: F[A]): (F[(Unit, A)], F[A])
    Definition Classes
    ApplicativeLaws
  59. def monoidalRightIdentity[A](fa: F[A]): (F[(A, Unit)], F[A])
    Definition Classes
    ApplicativeLaws
  60. def monotonicity: F[Boolean]
    Definition Classes
    ClockLaws
  61. def mproductConsistency[A, B](fa: F[A], fb: (A) => F[B]): laws.IsEq[F[(A, B)]]
    Definition Classes
    FlatMapLaws
  62. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  63. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  64. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  65. def onCancelAssociatesOverUncancelableBoundary[A](fa: F[A], fin: F[Unit]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  66. def onCancelImpliesUncancelable[A](fa: F[A], fin1: F[Unit], fin2: F[Unit]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  67. def onErrorPure[A](a: A, f: (Throwable) => F[Unit]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  68. def onErrorRaise[A](fa: F[A], e: Throwable, fb: F[Unit]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  69. def productLConsistency[A, B](fa: F[A], fb: F[B]): laws.IsEq[F[A]]
    Definition Classes
    ApplyLaws
  70. def productRConsistency[A, B](fa: F[A], fb: F[B]): laws.IsEq[F[B]]
    Definition Classes
    ApplyLaws
  71. def pureAttempt[A](a: A): laws.IsEq[F[Either[Throwable, A]]]
    Definition Classes
    ApplicativeErrorLaws
  72. def raiseErrorAttempt(e: Throwable): laws.IsEq[F[Either[Throwable, Unit]]]
    Definition Classes
    ApplicativeErrorLaws
  73. def raiseErrorDistributesOverApLeft[A](h: (Throwable) => F[A], e: Throwable): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  74. def raiseErrorDistributesOverApRight[A](h: (Throwable) => F[A], e: Throwable): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  75. def recoverConsistentWithRecoverWith[A](fa: F[A], pf: PartialFunction[Throwable, A]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  76. def redeemDerivedFromAttemptMap[A, B](fa: F[A], fe: (Throwable) => B, fs: (A) => B): laws.IsEq[F[B]]
    Definition Classes
    ApplicativeErrorLaws
  77. def redeemWithDerivedFromAttemptFlatMap[A, B](fa: F[A], fe: (Throwable) => F[B], fs: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadErrorLaws
  78. def repeatedSuspendNotMemoized[A](a: A, f: (A) => A, hint: Type): IsEq[F[A]]
  79. def replicateAVoidReplicateA_Consistent[A](n: Int, fa: F[A]): laws.IsEq[F[Unit]]
    Definition Classes
    ApplicativeLaws
  80. def rethrowAttempt[A](fa: F[A]): laws.IsEq[F[A]]
    Definition Classes
    MonadErrorLaws
  81. 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
  82. def suspendThrowIsRaiseError[A](e: Throwable, hint: Type): IsEq[F[A]]
  83. def suspendValueIsPure[A](a: A, hint: Type): IsEq[F[A]]
  84. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  85. def tailRecMConsistentFlatMap[A](a: A, f: (A) => F[A]): laws.IsEq[F[A]]
    Definition Classes
    FlatMapLaws
  86. lazy val tailRecMStackSafety: laws.IsEq[F[Int]]
    Definition Classes
    MonadLaws
  87. def toString(): String
    Definition Classes
    AnyRef → Any
  88. def uncancelableCanceledAssociatesRightOverFlatMapAttempt[A](fa: F[A]): IsEq[F[Unit]]
    Definition Classes
    MonadCancelLaws
  89. def uncancelableEliminatesOnCancel[A](fa: F[A], fin: F[Unit]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  90. def uncancelableFinalizers[A](fin: F[Unit]): IsEq[F[Unit]]
    Definition Classes
    MonadCancelLaws
  91. def uncancelableIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  92. def uncancelableIgnoredPollEliminatesNesting[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  93. def uncancelablePollInverseNestIsUncancelable[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  94. def uncancelablePollIsIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  95. def uniqueness: F[Boolean]
    Definition Classes
    UniqueLaws
  96. def unsequencedSuspendIsNoop[A](a: A, f: (A) => A, hint: Type): IsEq[F[A]]
  97. def voidErrorConsistentWithHandleError(fu: F[Unit]): laws.IsEq[F[Unit]]
    Definition Classes
    ApplicativeErrorLaws
  98. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  99. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  100. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from UniqueLaws[F]

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