trait
InvariantMonoidalLaws[F[_]] extends InvariantLaws[F] with CartesianLaws[F]
Abstract Value Members
-
implicit abstract
def
F: InvariantMonoidal[F]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
cartesianAssociativity[A, B, C](fa: F[A], fb: F[B], fc: F[C]): (F[(A, (B, C))], F[((A, B), C)])
-
def
clone(): AnyRef
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
invariantComposition[A, B, C](fa: F[A], f1: (A) ⇒ B, f2: (B) ⇒ A, g1: (B) ⇒ C, g2: (C) ⇒ B): IsEq[F[C]]
-
def
invariantIdentity[A](fa: F[A]): IsEq[F[A]]
-
def
invariantMonoidalAssociativity[A, B, C](fa: F[A], fb: F[B], fc: F[C]): IsEq[F[(A, (B, C))]]
-
def
invariantMonoidalLeftIdentity[A, B](fa: F[A], b: B): IsEq[F[A]]
-
def
invariantMonoidalRightIdentity[A, B](fa: F[A], b: B): IsEq[F[A]]
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Laws that must be obeyed by any
cats.InvariantMonoidal.