Trait

monix.types.Suspendable

Laws

Related Doc: package Suspendable

Permalink

trait Laws[F[_]] extends MonadEval.Laws[F] with Type[F]

Laws for Suspendable.

Linear Supertypes
Type[F], MonadEval.Laws[F], MonadEval.Type[F], Monad.Laws[F], Monad.Type[F], Applicative.Laws[F], Applicative.Type[F], Functor.Laws[F], Functor.Type[F], AnyRef, Any
Known Subclasses
Laws
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Laws
  2. Type
  3. Laws
  4. Type
  5. Laws
  6. Type
  7. Laws
  8. Type
  9. Laws
  10. Type
  11. AnyRef
  12. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. implicit abstract def applicative: Applicative[F]

    Permalink
    Definition Classes
    Type

  2. implicit abstract def functor: Functor[F]

    Permalink
    Definition Classes
    Type

  3. implicit abstract def monad: Monad[F]

    Permalink
    Definition Classes
    Type

  4. implicit abstract def monadEval: MonadEval[F]

    Permalink
    Definition Classes
    Type

  5. implicit abstract def suspendable: Suspendable[F]

    Permalink
    Definition Classes
    Type

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 applicativeComposition[A, B, C](fa: F[A], fab: F[(A) ⇒ B], fbc: F[(B) ⇒ C]): IsEquiv[F[C]]

    Permalink
    Definition Classes
    Laws

  5. def applicativeHomomorphism[A, B](a: A, f: (A) ⇒ B): IsEquiv[F[B]]

    Permalink
    Definition Classes
    Laws

  6. def applicativeIdentity[A](fa: F[A]): IsEquiv[F[A]]

    Permalink
    Definition Classes
    Laws

  7. def applicativeInterchange[A, B](a: A, ff: F[(A) ⇒ B]): IsEquiv[F[B]]

    Permalink
    Definition Classes
    Laws

  8. def applicativeMap[A, B](fa: F[A], f: (A) ⇒ B): IsEquiv[F[B]]

    Permalink
    Definition Classes
    Laws

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

    Permalink
    Definition Classes
    Laws

  10. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  11. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    Laws

  13. def covariantIdentity[A](fa: F[A]): IsEquiv[F[A]]

    Permalink
    Definition Classes
    Laws

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

    Permalink
    Definition Classes
    AnyRef

  15. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  16. def evalDelaysEffects[A](seed: A, effect: (A) ⇒ A): IsEquiv[F[A]]

    Permalink

  17. def evalEquivalenceWithPure[A](a: A): IsEquiv[F[A]]

    Permalink
    Definition Classes
    Laws

  18. def evalEquivalenceWithRaiseError[A](ex: Throwable)(implicit M: MonadError[F, Throwable]): IsEquiv[F[A]]

    Permalink
    Definition Classes
    Laws

  19. def evalEquivalenceWithSuspend[A](fa: F[A]): IsEquiv[F[A]]

    Permalink

  20. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    Laws

  22. def flatMapConsistentApply[A, B](fa: F[A], fab: F[(A) ⇒ B]): IsEquiv[F[B]]

    Permalink
    Definition Classes
    Laws

  23. def flatMapConsistentMap2[A, B, C](fa: F[A], fb: F[B], f: (A, B) ⇒ C): IsEquiv[F[C]]

    Permalink
    Definition Classes
    Laws

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

    Permalink
    Definition Classes
    AnyRef → Any

  25. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  26. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  28. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  29. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  30. def suspendDelaysEffects[A](seed: A, effect: (A) ⇒ A): IsEquiv[F[A]]

    Permalink

  31. def suspendEquivalenceWithEval[A](a: A): IsEquiv[F[A]]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  33. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  34. final def wait(): Unit

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

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

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

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

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

Inherited from Type[F]

Inherited from MonadEval.Laws[F]

Inherited from MonadEval.Type[F]

Inherited from Monad.Laws[F]

Inherited from Monad.Type[F]

Inherited from Applicative.Laws[F]

Inherited from Applicative.Type[F]

Inherited from Functor.Laws[F]

Inherited from Functor.Type[F]

Inherited from AnyRef

Inherited from Any

Ungrouped