Trait

monix.types.Memoizable

Laws

Related Doc: package Memoizable

Permalink

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

Laws for Memoizable.

Linear Supertypes
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. Laws
  12. Type
  13. AnyRef
  14. 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 memoizable: Memoizable[F]

    Permalink
    Definition Classes
    Type
  4. implicit abstract def monad: Monad[F]

    Permalink
    Definition Classes
    Type
  5. implicit abstract def monadEval: MonadEval[F]

    Permalink
    Definition Classes
    Type
  6. 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
    Definition Classes
    Laws
  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
    Definition Classes
    Laws
  20. def evalOnceEquivalenceWithEval[A](seed: A, effect: (A) ⇒ A): IsEquiv[F[A]]

    Permalink
  21. def evalOnceIsIdempotent[A](seed: A, effect: (A) ⇒ A): IsEquiv[F[A]]

    Permalink
  22. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  23. def flatMapAssociativity[A, B, C](fa: F[A], f: (A) ⇒ F[B], g: (B) ⇒ F[C]): IsEquiv[F[C]]

    Permalink
    Definition Classes
    Laws
  24. def flatMapConsistentApply[A, B](fa: F[A], fab: F[(A) ⇒ B]): IsEquiv[F[B]]

    Permalink
    Definition Classes
    Laws
  25. def flatMapConsistentMap2[A, B, C](fa: F[A], fb: F[B], f: (A, B) ⇒ C): IsEquiv[F[C]]

    Permalink
    Definition Classes
    Laws
  26. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  27. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  28. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  29. def memoizeIsIdempotent[A](seed: A, effect: (A) ⇒ A): IsEquiv[F[A]]

    Permalink
  30. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  31. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  32. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  33. def suspendDelaysEffects[A](seed: A, effect: (A) ⇒ A): IsEquiv[F[A]]

    Permalink
    Definition Classes
    Laws
  34. def suspendEquivalenceWithEval[A](a: A): IsEquiv[F[A]]

    Permalink
    Definition Classes
    Laws
  35. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  36. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  37. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. final def wait(arg0: Long): Unit

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

Inherited from Type[F]

Inherited from Suspendable.Laws[F]

Inherited from Suspendable.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