IsomorphismContravariant

implicit abstract def G: Contravariant[G]

abstract def iso: Isomorphism.<~>[F, G]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def compose[G[_]](implicit G0: Contravariant[G]): Functor[[α]F[G[α]]]

The composition of Contravariant F and G, [x]F[G[x]], is covariant.

def contramap[A, B](r: F[A])(f: (B) ⇒ A): F[B]

Transform A.

def contravariantLaw: ContravariantLaw

val contravariantSyntax: ContravariantSyntax[F]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def icompose[G[_]](implicit G0: Functor[G]): Contravariant[[α]F[G[α]]]

The composition of Contravariant F and Functor G, [x]F[G[x]], is contravariant.

def invariantFunctorLaw: InvariantFunctorLaw

val invariantFunctorSyntax: InvariantFunctorSyntax[F]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def product[G[_]](implicit G0: Contravariant[G]): Contravariant[[α](F[α], G[α])]

The product of Contravariant F and G, [x](F[x], G[x]]), is contravariant.

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

def xmap[A, B](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ A): F[B]

Converts ma to a value of type F[B] using the provided functions f and g.

def xmapb[A, B](ma: F[A])(b: Bijection[A, B]): F[B]

Converts ma to a value of type F[B] using the provided bijection.

def xmapi[A, B](ma: F[A])(iso: Isomorphism.<=>[A, B]): F[B]

Converts ma to a value of type F[B] using the provided isomorphism.