cats.effect.laws

SyncLaws

trait SyncLaws[F[_]] extends MonadErrorLaws[F, Throwable]

Linear Supertypes
MonadErrorLaws[F, Throwable], MonadLaws[F], FlatMapLaws[F], ApplicativeErrorLaws[F, Throwable], ApplicativeLaws[F], ApplyLaws[F], CartesianLaws[F], FunctorLaws[F], InvariantLaws[F], AnyRef, Any
Known Subclasses
EffectLaws
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. SyncLaws
  2. MonadErrorLaws
  3. MonadLaws
  4. FlatMapLaws
  5. ApplicativeErrorLaws
  6. ApplicativeLaws
  7. ApplyLaws
  8. CartesianLaws
  9. FunctorLaws
  10. InvariantLaws
  11. AnyRef
  12. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. implicit abstract def F: Sync[F]

    Definition Classes
    SyncLaws → MonadErrorLaws → MonadLaws → FlatMapLaws → ApplicativeErrorLaws → ApplicativeLaws → ApplyLaws → CartesianLaws → FunctorLaws → InvariantLaws

Concrete Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

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

    Definition Classes
    ApplicativeLaws

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

    Definition Classes
    ApplicativeLaws

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

    Definition Classes
    ApplicativeErrorLaws

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

    Definition Classes
    ApplicativeErrorLaws

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

    Definition Classes
    ApplicativeLaws

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

    Definition Classes
    ApplicativeLaws

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

    Definition Classes
    ApplicativeLaws

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

    Definition Classes
    ApplicativeLaws

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

    Definition Classes
    ApplyLaws

  15. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

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

    Definition Classes
    ApplicativeErrorLaws

  17. def cartesianAssociativity[A, B, C](fa: F[A], fb: F[B], fc: F[C]): (F[(A, (B, C))], F[((A, B), C)])

    Definition Classes
    CartesianLaws

  18. def clone(): AnyRef

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

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

    Definition Classes
    FunctorLaws

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

    Definition Classes
    FunctorLaws

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

  22. def delayThrowIsRaiseError[A](t: Throwable): IsEq[F[A]]

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

    Definition Classes
    AnyRef

  24. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  25. def finalize(): Unit

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

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

    Definition Classes
    FlatMapLaws

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

    Definition Classes
    FlatMapLaws

  28. def followedByConsistency[A, B](fa: F[A], fb: F[B]): IsEq[F[B]]

    Definition Classes
    FlatMapLaws

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

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    ApplicativeErrorLaws

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

    Definition Classes
    ApplicativeErrorLaws

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

    Definition Classes
    ApplicativeErrorLaws

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

    Definition Classes
    ApplicativeErrorLaws

  34. def hashCode(): Int

    Definition Classes
    AnyRef → Any

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

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

    Definition Classes
    InvariantLaws

  37. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

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

    Definition Classes
    MonadLaws

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

    Definition Classes
    MonadLaws

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

    Definition Classes
    MonadLaws

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

    Definition Classes
    MonadErrorLaws

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

    Definition Classes
    MonadLaws

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

    Definition Classes
    MonadLaws

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

    Definition Classes
    ApplicativeLaws

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

    Definition Classes
    ApplicativeLaws

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

    Definition Classes
    FlatMapLaws

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

    Definition Classes
    AnyRef

  49. final def notify(): Unit

    Definition Classes
    AnyRef

  50. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    ApplicativeErrorLaws

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

    Definition Classes
    ApplicativeErrorLaws

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

    Definition Classes
    ApplicativeErrorLaws

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

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

  56. def suspendThrowIsRaiseError[A](t: Throwable): IsEq[F[A]]

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

    Definition Classes
    AnyRef

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

    Definition Classes
    FlatMapLaws

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

    Definition Classes
    MonadLaws

  60. def toString(): String

    Definition Classes
    AnyRef → Any

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

  62. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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 CartesianLaws[F]

Inherited from FunctorLaws[F]

Inherited from InvariantLaws[F]

Inherited from AnyRef

Inherited from Any

Ungrouped