trait ContravariantDeriveEqual[F[-_]] extends Contravariant[F] with DeriveEqual[F]
Abstract Value Members
- abstract def contramap[A, B](f: (B) => A): (F[A]) => F[B]
- abstract def derive[A](implicit arg0: Equal[A]): Equal[F[A]]
Concrete Value Members
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- final def compose[G[+_]](implicit g: Covariant[G]): Contravariant[[-A]F[G[A]]]
- final def compose[G[-_]](implicit g: Contravariant[G]): Covariant[[+A]F[G[A]]]
- final def compose[G[_]](implicit g: Invariant[G]): Invariant[[A]F[G[A]]]
- def compositionLaw[A, B, C](fa: F[A], f: <=>[A, B], g: <=>[B, C])(implicit equal: Equal[F[C]]): Boolean
- final def contramapSubset[A, B](f: (B) => A)(implicit arg0: AnyType[B]): (F[A]) => F[B]
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- def finalize(): Unit
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- def identityLaw1[A](fa: F[A])(implicit equal: Equal[F[A]]): Boolean
- final def invmap[A, B](f: <=>[A, B]): <=>[F[A], F[B]]
- final def isInstanceOf[T0]: Boolean
- final def ne(arg0: AnyRef): 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
Value Members
- abstract def derive[A](implicit arg0: Equal[A]): Equal[F[A]]
Value Members
- abstract def contramap[A, B](f: (B) => A): (F[A]) => F[B]
- final def compose[G[+_]](implicit g: Covariant[G]): Contravariant[[-A]F[G[A]]]
- final def compose[G[-_]](implicit g: Contravariant[G]): Covariant[[+A]F[G[A]]]
- final def contramapSubset[A, B](f: (B) => A)(implicit arg0: AnyType[B]): (F[A]) => F[B]
- final def invmap[A, B](f: <=>[A, B]): <=>[F[A], F[B]]
Value Members
- final def compose[G[_]](implicit g: Invariant[G]): Invariant[[A]F[G[A]]]
- def compositionLaw[A, B, C](fa: F[A], f: <=>[A, B], g: <=>[B, C])(implicit equal: Equal[F[C]]): Boolean
- def identityLaw1[A](fa: F[A])(implicit equal: Equal[F[A]]): Boolean
Inherited from Any
Value Members
- final def asInstanceOf[T0]: T0
- final def isInstanceOf[T0]: Boolean
Ungrouped
- abstract def contramap[A, B](f: (B) => A): (F[A]) => F[B]
- abstract def derive[A](implicit arg0: Equal[A]): Equal[F[A]]
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- final def compose[G[+_]](implicit g: Covariant[G]): Contravariant[[-A]F[G[A]]]
- final def compose[G[-_]](implicit g: Contravariant[G]): Covariant[[+A]F[G[A]]]
- final def compose[G[_]](implicit g: Invariant[G]): Invariant[[A]F[G[A]]]
- def compositionLaw[A, B, C](fa: F[A], f: <=>[A, B], g: <=>[B, C])(implicit equal: Equal[F[C]]): Boolean
- final def contramapSubset[A, B](f: (B) => A)(implicit arg0: AnyType[B]): (F[A]) => F[B]
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- def finalize(): Unit
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- def identityLaw1[A](fa: F[A])(implicit equal: Equal[F[A]]): Boolean
- final def invmap[A, B](f: <=>[A, B]): <=>[F[A], F[B]]
- final def isInstanceOf[T0]: Boolean
- final def ne(arg0: AnyRef): 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