trait GenSpawnLaws[F[_], E] extends MonadCancelLaws[F, E] with UniqueLaws[F]

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

Abstract Value Members

  1. implicit abstract val F: kernel.GenSpawn[F, E]
    Definition Classes
    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]]]
  28. def fiberCanceledIsOutcomeCanceled: IsEq[F[kernel.Outcome[F, E, Unit]]]
  29. def fiberErrorIsOutcomeErrored(e: E): IsEq[F[kernel.Outcome[F, E, Unit]]]
  30. def fiberJoinIsGuaranteeCase[A](fa0: F[A], f: (kernel.Outcome[F, E, A]) => F[Unit]): IsEq[F[A]]
  31. def fiberNeverIsNever: IsEq[F[kernel.Outcome[F, E, Unit]]]
  32. def fiberPureIsOutcomeCompletedPure[A](a: A): IsEq[F[kernel.Outcome[F, E, A]]]
  33. def fiberStartOfNeverIsUnit: IsEq[F[Unit]]
  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 forceRAssociativity[A, B, C](fa: F[A], fb: F[B], fc: F[C]): IsEq[F[C]]
    Definition Classes
    MonadCancelLaws
  39. def forceRCanceledShortCircuits[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  40. def forceRDiscardsError[A](e: E, fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  41. def forceRDiscardsPure[A, B](a: A, fa: F[B]): IsEq[F[B]]
    Definition Classes
    MonadCancelLaws
  42. def forceRNeverIsNever[A](fa: F[A]): IsEq[F[A]]
  43. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  44. def guaranteeIsGuaranteeCase[A](fa: F[A], fin: F[Unit]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  45. def handleErrorConsistentWithRecover[A](fa: F[A], f: (E) => A): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  46. def handleErrorPure[A](a: A, f: (E) => A): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  47. def handleErrorWithConsistentWithRecoverWith[A](fa: F[A], f: (E) => F[A]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  48. def handleErrorWithPure[A](a: A, f: (E) => F[A]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  49. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  50. 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
  51. def invariantIdentity[A](fa: F[A]): laws.IsEq[F[A]]
    Definition Classes
    InvariantLaws
  52. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  53. 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
  54. def kleisliLeftIdentity[A, B](a: A, f: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadLaws
  55. def kleisliRightIdentity[A, B](a: A, f: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadLaws
  56. def map2EvalConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) => C): laws.IsEq[F[C]]
    Definition Classes
    ApplyLaws
  57. def map2ProductConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) => C): laws.IsEq[F[C]]
    Definition Classes
    ApplyLaws
  58. def mapFlatMapCoherence[A, B](fa: F[A], f: (A) => B): laws.IsEq[F[B]]
    Definition Classes
    MonadLaws
  59. def mapOrKeepToMapEquivalence[A, A1 >: A](fa: F[A], pf: PartialFunction[A, A1]): laws.IsEq[F[A1]]
    Definition Classes
    FunctorLaws
  60. def monadErrorEnsureConsistency[A](fa: F[A], e: E, p: (A) => Boolean): laws.IsEq[F[A]]
    Definition Classes
    MonadErrorLaws
  61. def monadErrorEnsureOrConsistency[A](fa: F[A], e: (A) => E, p: (A) => Boolean): laws.IsEq[F[A]]
    Definition Classes
    MonadErrorLaws
  62. def monadErrorLeftZero[A, B](e: E, f: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadErrorLaws
  63. def monadLeftIdentity[A, B](a: A, f: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadLaws
  64. def monadRightIdentity[A](fa: F[A]): laws.IsEq[F[A]]
    Definition Classes
    MonadLaws
  65. def monoidalLeftIdentity[A](fa: F[A]): (F[(Unit, A)], F[A])
    Definition Classes
    ApplicativeLaws
  66. def monoidalRightIdentity[A](fa: F[A]): (F[(A, Unit)], F[A])
    Definition Classes
    ApplicativeLaws
  67. def mproductConsistency[A, B](fa: F[A], fb: (A) => F[B]): laws.IsEq[F[(A, B)]]
    Definition Classes
    FlatMapLaws
  68. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  69. def neverDominatesOverFlatMap[A](fa: F[A]): IsEq[F[A]]
  70. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  71. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  72. def onCancelAssociatesOverUncancelableBoundary[A](fa: F[A], fin: F[Unit]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  73. def onCancelImpliesUncancelable[A](fa: F[A], fin1: F[Unit], fin2: F[Unit]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  74. def onErrorPure[A](a: A, f: (E) => F[Unit]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  75. def onErrorRaise[A](fa: F[A], e: E, fb: F[Unit]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  76. def productLConsistency[A, B](fa: F[A], fb: F[B]): laws.IsEq[F[A]]
    Definition Classes
    ApplyLaws
  77. def productRConsistency[A, B](fa: F[A], fb: F[B]): laws.IsEq[F[B]]
    Definition Classes
    ApplyLaws
  78. def pureAttempt[A](a: A): laws.IsEq[F[Either[E, A]]]
    Definition Classes
    ApplicativeErrorLaws
  79. def raceDerivesFromRacePairLeft[A, B](fa: F[A]): IsEq[F[Either[A, B]]]
  80. def raceDerivesFromRacePairRight[A, B](fb: F[B]): IsEq[F[Either[A, B]]]
  81. def raceNeverNoncanceledIdentityLeft[A](fa: F[A]): IsEq[F[Either[Unit, A]]]
  82. def raceNeverNoncanceledIdentityRight[A](fa: F[A]): IsEq[F[Either[A, Unit]]]
  83. def raiseErrorAttempt(e: E): laws.IsEq[F[Either[E, Unit]]]
    Definition Classes
    ApplicativeErrorLaws
  84. def raiseErrorDistributesOverApLeft[A](h: (E) => F[A], e: E): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  85. def raiseErrorDistributesOverApRight[A](h: (E) => F[A], e: E): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  86. def recoverConsistentWithRecoverWith[A](fa: F[A], pf: PartialFunction[E, A]): laws.IsEq[F[A]]
    Definition Classes
    ApplicativeErrorLaws
  87. def redeemDerivedFromAttemptMap[A, B](fa: F[A], fe: (E) => B, fs: (A) => B): laws.IsEq[F[B]]
    Definition Classes
    ApplicativeErrorLaws
  88. def redeemWithDerivedFromAttemptFlatMap[A, B](fa: F[A], fe: (E) => F[B], fs: (A) => F[B]): laws.IsEq[F[B]]
    Definition Classes
    MonadErrorLaws
  89. def replicateAVoidReplicateA_Consistent[A](n: Int, fa: F[A]): laws.IsEq[F[Unit]]
    Definition Classes
    ApplicativeLaws
  90. def rethrowAttempt[A](fa: F[A]): laws.IsEq[F[A]]
    Definition Classes
    MonadErrorLaws
  91. 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
  92. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  93. def tailRecMConsistentFlatMap[A](a: A, f: (A) => F[A]): laws.IsEq[F[A]]
    Definition Classes
    FlatMapLaws
  94. lazy val tailRecMStackSafety: laws.IsEq[F[Int]]
    Definition Classes
    MonadLaws
  95. def toString(): String
    Definition Classes
    AnyRef → Any
  96. def uncancelableCancelCancels: IsEq[F[kernel.Outcome[F, E, Unit]]]
  97. def uncancelableCanceledAssociatesRightOverFlatMapAttempt[A](fa: F[A]): IsEq[F[Unit]]
    Definition Classes
    MonadCancelLaws
  98. def uncancelableEliminatesOnCancel[A](fa: F[A], fin: F[Unit]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  99. def uncancelableFinalizers[A](fin: F[Unit]): IsEq[F[Unit]]
    Definition Classes
    MonadCancelLaws
  100. def uncancelableIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  101. def uncancelableIgnoredPollEliminatesNesting[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  102. def uncancelablePollInverseNestIsUncancelable[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  103. def uncancelablePollIsIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    MonadCancelLaws
  104. def uncancelableRaceNotInherited: IsEq[F[Unit]]
  105. def uncancelableStartIsCancelable: IsEq[F[kernel.Outcome[F, E, Unit]]]
  106. def uniqueness: F[Boolean]
    Definition Classes
    UniqueLaws
  107. def voidErrorConsistentWithHandleError(fu: F[Unit]): laws.IsEq[F[Unit]]
    Definition Classes
    ApplicativeErrorLaws
  108. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  109. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  110. 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]]]
    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]]]
    Annotations
    @deprecated
    Deprecated

    (Since version 3.5.0) law is no longer applicable (or correct)

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