MonadPlusLaw

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 associative[A](f1: F[A], f2: F[A], f3: F[A])(implicit FA: Equal[F[A]]): Boolean

   Definition Classes

   PlusLaw

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

   MonadLaw

10. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

12. def emptyMap[A](f1: (A) ⇒ A)(implicit FA: Equal[F[A]]): Boolean

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[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef → Any

17. def hashCode(): Int

    Definition Classes

    AnyRef → Any

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

    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

    Definition Classes

    ApplicativeLaw

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

    Definition Classes

    ApplicativeLaw

22. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

24. def leftPlusIdentity[A](f1: F[A])(implicit FA: Equal[F[A]]): Boolean

    Definition Classes

    EmptyLaw

25. def leftZero[A](f: (A) ⇒ F[A])(implicit FA: Equal[F[A]]): Boolean

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

    Definition Classes

    AnyRef

27. final def notify(): Unit

    Definition Classes

    AnyRef

28. final def notifyAll(): Unit

    Definition Classes

    AnyRef

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

30. def rightPlusIdentity[A](f1: F[A])(implicit FA: Equal[F[A]]): Boolean

    Definition Classes

    EmptyLaw

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

    Definition Classes

    AnyRef

32. def toString(): String

    Definition Classes

    AnyRef → Any

33. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()