trait CommutativeApplicativeLaws[F[_]] extends CommutativeApplyLaws[F] with ApplicativeLaws[F]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. CommutativeApplicativeLaws
  2. ApplicativeLaws
  3. CommutativeApplyLaws
  4. ApplyLaws
  5. SemigroupalLaws
  6. FunctorLaws
  7. InvariantLaws
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. implicit abstract def F: CommutativeApplicative[F]
    Definition Classes
    CommutativeApplicativeLaws → ApplicativeLaws → CommutativeApplyLaws → ApplyLaws → SemigroupalLaws → FunctorLaws → InvariantLaws

Concrete 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 apProductConsistent[A, B](fa: F[A], f: F[(A) ⇒ B]): IsEq[F[B]]
    Definition Classes
    ApplicativeLaws
  5. def applicativeComposition[A, B, C](fa: F[A], fab: F[(A) ⇒ B], fbc: F[(B) ⇒ C]): IsEq[F[C]]

    This law is applyComposition stated in terms of pure.

    This law is applyComposition stated in terms of pure. It is a combination of applyComposition and applicativeMap and hence not strictly necessary.

    Definition Classes
    ApplicativeLaws
  6. def applicativeHomomorphism[A, B](a: A, f: (A) ⇒ B): IsEq[F[B]]
    Definition Classes
    ApplicativeLaws
  7. def applicativeIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    ApplicativeLaws
  8. def applicativeInterchange[A, B](a: A, ff: F[(A) ⇒ B]): IsEq[F[B]]
    Definition Classes
    ApplicativeLaws
  9. def applicativeMap[A, B](fa: F[A], f: (A) ⇒ B): IsEq[F[B]]
    Definition Classes
    ApplicativeLaws
  10. def applicativeUnit[A](a: A): IsEq[F[A]]
    Definition Classes
    ApplicativeLaws
  11. def applyCommutative[A, B, C](fa: F[A], fb: F[B], f: (A, B) ⇒ C): IsEq[F[C]]
    Definition Classes
    CommutativeApplyLaws
  12. def applyComposition[A, B, C](fa: F[A], fab: F[(A) ⇒ B], fbc: F[(B) ⇒ C]): IsEq[F[C]]
    Definition Classes
    ApplyLaws
  13. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  14. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  15. def covariantComposition[A, B, C](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ C): IsEq[F[C]]
    Definition Classes
    FunctorLaws
  16. def covariantIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    FunctorLaws
  17. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  19. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  20. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  21. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  22. def invariantComposition[A, B, C](fa: F[A], f1: (A) ⇒ B, f2: (B) ⇒ A, g1: (B) ⇒ C, g2: (C) ⇒ B): IsEq[F[C]]
    Definition Classes
    InvariantLaws
  23. def invariantIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    InvariantLaws
  24. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  25. def map2EvalConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) ⇒ C): IsEq[F[C]]
    Definition Classes
    ApplyLaws
  26. def map2ProductConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) ⇒ C): IsEq[F[C]]
    Definition Classes
    ApplyLaws
  27. def monoidalLeftIdentity[A](fa: F[A]): (F[(Unit, A)], F[A])
    Definition Classes
    ApplicativeLaws
  28. def monoidalRightIdentity[A](fa: F[A]): (F[(A, Unit)], F[A])
    Definition Classes
    ApplicativeLaws
  29. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  30. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  31. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  32. def productLConsistency[A, B](fa: F[A], fb: F[B]): IsEq[F[A]]
    Definition Classes
    ApplyLaws
  33. def productRConsistency[A, B](fa: F[A], fb: F[B]): IsEq[F[B]]
    Definition Classes
    ApplyLaws
  34. def semigroupalAssociativity[A, B, C](fa: F[A], fb: F[B], fc: F[C]): (F[(A, (B, C))], F[((A, B), C)])
    Definition Classes
    SemigroupalLaws
  35. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  36. def toString(): String
    Definition Classes
    AnyRef → Any
  37. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from ApplicativeLaws[F]

Inherited from CommutativeApplyLaws[F]

Inherited from ApplyLaws[F]

Inherited from SemigroupalLaws[F]

Inherited from FunctorLaws[F]

Inherited from InvariantLaws[F]

Inherited from AnyRef

Inherited from Any

Ungrouped