MonadLaw

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

   ap is consistent with bind.

7. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

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

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

    ApplicativeLaw

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

    Definition Classes

    AnyRef

13. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

14. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

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

    Definition Classes

    AnyRef → Any

16. def hashCode(): Int

    Definition Classes

    AnyRef → Any

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

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

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

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

21. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

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

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

    Definition Classes

    AnyRef

25. final def notify(): Unit

    Definition Classes

    AnyRef

26. final def notifyAll(): Unit

    Definition Classes

    AnyRef

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

    Lifted point is a no-op.

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

    Definition Classes

    AnyRef

29. def toString(): String

    Definition Classes

    AnyRef → Any

30. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )