ApplicativeLaw

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 clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

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

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

    Definition Classes

    AnyRef

11. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

12. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    AnyRef → Any

14. def hashCode(): Int

    Definition Classes

    AnyRef → Any

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

    point distributes over function applications.

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

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

    point(identity) is a no-op.

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

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

20. def invariantIdentity[A](fa: F[A])(implicit FA: Equal[F[A]]): Boolean

    Definition Classes

    InvariantFunctorLaw

21. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

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

    Definition Classes

    AnyRef

24. final def notify(): Unit

    Definition Classes

    AnyRef

25. final def notifyAll(): Unit

    Definition Classes

    AnyRef

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