monix.types.Memoizable

Laws

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

Laws for Memoizable.

Linear Supertypes
Type[F], Suspendable.Laws[F], Suspendable.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
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
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. implicit abstract def applicative: Applicative[F]

    Definition Classes
    Type

  2. implicit abstract def functor: Functor[F]

    Definition Classes
    Type

  3. implicit abstract def memoizable: Memoizable[F]

    Definition Classes
    Type

  4. implicit abstract def monad: Monad[F]

    Definition Classes
    Type

  5. implicit abstract def monadEval: MonadEval[F]

    Definition Classes
    Type

  6. implicit abstract def suspendable: Suspendable[F]

    Definition Classes
    Type

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

    Definition Classes
    Laws

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

    Definition Classes
    Laws

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

    Definition Classes
    Laws

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

    Definition Classes
    Laws

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

    Definition Classes
    Laws

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

    Definition Classes
    Laws

  12. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  13. def clone(): AnyRef

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

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

    Definition Classes
    Laws

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

    Definition Classes
    Laws

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

    Definition Classes
    AnyRef

  17. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    Laws

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

    Definition Classes
    Laws

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

    Definition Classes
    Laws

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

    Definition Classes
    Laws

  22. def evalOnceEquivalenceWithEval[A](seed: A, effect: (A) ⇒ A): IsEquiv[F[A]]

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

  24. def finalize(): Unit

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

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

    Definition Classes
    Laws

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

    Definition Classes
    Laws

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

    Definition Classes
    Laws

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

    Definition Classes
    AnyRef → Any

  29. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  30. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  31. def memoizeIsIdempotent[A](seed: A, effect: (A) ⇒ A): IsEquiv[F[A]]

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

    Definition Classes
    AnyRef

  33. final def notify(): Unit

    Definition Classes
    AnyRef

  34. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    Laws

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

    Definition Classes
    Laws

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

    Definition Classes
    AnyRef

  38. def toString(): String

    Definition Classes
    AnyRef → Any

  39. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    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