trait ContravariantMonoidalLaws[F[_]] extends ContravariantSemigroupalLaws[F]
Laws that must hold for any cats.ContravariantMonoidal
.
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- ContravariantMonoidalLaws
- ContravariantSemigroupalLaws
- SemigroupalLaws
- ContravariantLaws
- InvariantLaws
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Abstract Value Members
-
implicit abstract
def
F: ContravariantMonoidal[F]
- Definition Classes
- ContravariantMonoidalLaws → ContravariantSemigroupalLaws → SemigroupalLaws → ContravariantLaws → InvariantLaws
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
contravariantComposition[A, B, C](fa: F[A], f: (B) ⇒ A, g: (C) ⇒ B): IsEq[F[C]]
- Definition Classes
- ContravariantLaws
-
def
contravariantIdentity[A](fa: F[A]): IsEq[F[A]]
- Definition Classes
- ContravariantLaws
- def contravariantMonoidalContramap2CompatibleContramapLeft[A, B, C](fa: F[A], f: (B) ⇒ (A, C)): IsEq[F[B]]
- def contravariantMonoidalContramap2CompatibleContramapRight[A, B, C](fa: F[A], f: (C) ⇒ (B, A)): IsEq[F[C]]
- def contravariantMonoidalUnitLeft[A](fa: F[A]): IsEq[F[A]]
- def contravariantMonoidalUnitRight[A](fa: F[A]): IsEq[F[A]]
-
def
contravariantSemigroupalContramap2DiagonalAssociates[A](m: F[A], n: F[A], o: F[A]): IsEq[F[A]]
- Definition Classes
- ContravariantSemigroupalLaws
-
def
delta[A](a: A): (A, A)
- Definition Classes
- ContravariantSemigroupalLaws
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
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
-
def
invariantIdentity[A](fa: F[A]): IsEq[F[A]]
- Definition Classes
- InvariantLaws
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
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
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )