scalaz.Monad

MonadLaw

trait MonadLaw extends ApplicativeLaw

Source
Monad.scala
Linear Supertypes
Monad.ApplicativeLaw, Monad.FunctorLaw, AnyRef, Any
Known Subclasses
MonadPlusLaw, StrongMonadPlusLaw
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. MonadLaw
  2. ApplicativeLaw
  3. FunctorLaw
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

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. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def associative[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

  8. 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.

  9. def clone(): AnyRef

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

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

    Definition Classes
    ApplicativeLaw

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

    Definition Classes
    AnyRef

  12. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  13. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  15. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  16. def homomorphism[A, B](ab: (A) ⇒ B, a: A)(implicit FB: Equal[F[B]]): Boolean

    Definition Classes
    ApplicativeLaw

  17. 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

  18. def identityAp[A](fa: F[A])(implicit FA: Equal[F[A]]): Boolean

    Definition Classes
    ApplicativeLaw

  19. def interchange[A, B](f: F[(A) ⇒ B], a: A)(implicit FB: Equal[F[B]]): Boolean

    Definition Classes
    ApplicativeLaw

  20. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  21. 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).

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

    Definition Classes
    AnyRef

  23. final def notify(): Unit

    Definition Classes
    AnyRef

  24. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  25. def rightIdentity[A](a: F[A])(implicit FA: Equal[F[A]]): Boolean

    Lifted point is a no-op.

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

    Definition Classes
    AnyRef

  27. def toString(): String

    Definition Classes
    AnyRef → Any

  28. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from Monad.ApplicativeLaw

Inherited from Monad.FunctorLaw

Inherited from AnyRef

Inherited from Any

Ungrouped