Packages

t

scalaz.MonadReader

MonadReaderLaw

trait MonadReaderLaw extends MonadLaw

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MonadReaderLaw
  2. MonadLaw
  3. BindLaw
  4. ApplicativeLaw
  5. ApplyLaw
  6. FunctorLaw
  7. InvariantFunctorLaw
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

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 apLikeDerived[A, B](fa: F[A], f: F[(A) ⇒ B])(implicit FB: Equal[F[B]]): Boolean

    ap is consistent with bind.

    ap is consistent with bind.

    Definition Classes
    BindLaw
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def askFALeft[A](fa: F[A])(implicit FA: Equal[F[A]]): Boolean
  7. def askFARight[A](fa: F[A])(implicit FA: Equal[F[A]]): Boolean
  8. def askIdempotence(implicit FS: Equal[F[S]]): Boolean
  9. def associativeBind[A, B, C](fa: F[A], f: (A) ⇒ F[B], g: (B) ⇒ F[C])(implicit FC: Equal[F[C]]): Boolean

    As with semigroups, monadic effects only change when their order is changed, not when the order in which they're combined changes.

    As with semigroups, monadic effects only change when their order is changed, not when the order in which they're combined changes.

    Definition Classes
    BindLaw
  10. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  11. def composite[A, B, C](fa: F[A], f1: (A) ⇒ B, f2: (B) ⇒ C)(implicit FC: Equal[F[C]]): Boolean

    A series of maps may be freely rewritten as a single map on a composed function.

    A series of maps may be freely rewritten as a single map on a composed function.

    Definition Classes
    FunctorLaw
  12. def composition[A, B, C](fbc: F[(B) ⇒ C], fab: F[(A) ⇒ B], fa: F[A])(implicit FC: Equal[F[C]]): Boolean

    Lifted functions can be fused.

    Lifted functions can be fused.

    Definition Classes
    ApplyLaw
  13. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  15. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  17. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  18. def homomorphism[A, B](ab: (A) ⇒ B, a: A)(implicit FB: Equal[F[B]]): Boolean

    point distributes over function applications.

    point distributes over function applications.

    Definition Classes
    ApplicativeLaw
  19. def identity[A](fa: F[A])(implicit FA: Equal[F[A]]): Boolean

    The identity function, lifted, is a no-op.

    The identity function, lifted, is a no-op.

    Definition Classes
    FunctorLaw
  20. def identityAp[A](fa: F[A])(implicit FA: Equal[F[A]]): Boolean

    point(identity) is a no-op.

    point(identity) is a no-op.

    Definition Classes
    ApplicativeLaw
  21. def interchange[A, B](f: F[(A) ⇒ B], a: A)(implicit FB: Equal[F[B]]): Boolean

    point is a left and right identity, F-wise.

    point is a left and right identity, F-wise.

    Definition Classes
    ApplicativeLaw
  22. def invariantComposite[A, B, C](fa: F[A], f1: (A) ⇒ B, g1: (B) ⇒ A, f2: (B) ⇒ C, g2: (C) ⇒ B)(implicit FC: Equal[F[C]]): Boolean
    Definition Classes
    InvariantFunctorLaw
  23. def invariantIdentity[A](fa: F[A])(implicit FA: Equal[F[A]]): Boolean
    Definition Classes
    InvariantFunctorLaw
  24. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  25. def leftIdentity[A, B](a: A, f: (A) ⇒ F[B])(implicit FB: Equal[F[B]]): Boolean

    Lifted f applied to pure a is just f(a).

    Lifted f applied to pure a is just f(a).

    Definition Classes
    MonadLaw
  26. def localComposition[A](f: (S) ⇒ S, g: (S) ⇒ S)(fa: F[A])(implicit FA: Equal[F[A]]): Boolean
  27. def localFAsk(f: (S) ⇒ S)(implicit FS: Equal[F[S]]): Boolean
  28. def localPoint[A](f: (S) ⇒ S)(a: A)(implicit FA: Equal[F[A]]): Boolean
  29. def mapLikeDerived[A, B](f: (A) ⇒ B, fa: F[A])(implicit FB: Equal[F[B]]): Boolean

    map is like the one derived from point and ap.

    map is like the one derived from point and ap.

    Definition Classes
    ApplicativeLaw
  30. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  31. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  32. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  33. def rightIdentity[A](a: F[A])(implicit FA: Equal[F[A]]): Boolean

    Lifted point is a no-op.

    Lifted point is a no-op.

    Definition Classes
    MonadLaw
  34. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  35. def toString(): String
    Definition Classes
    AnyRef → Any
  36. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  37. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from MonadReader.MonadLaw

Inherited from MonadReader.BindLaw

Inherited from MonadReader.ApplyLaw

Inherited from MonadReader.FunctorLaw

Inherited from AnyRef

Inherited from Any

Ungrouped