CovariantComposite

abstract def F: Contravariant[F]

abstract def G: Functor[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 G: Contravariant[G]): Functor[[X]F[G[G[X]]]]

def compose[G[_]](implicit arg0: Invariant[G], GG: Invariant[G]): Invariant[[X]F[G[G[X]]]]

Compose 2 invariant Functors F and G to get a new Invariant Functor for F[G[_]].

def composeWithContravariant[G[_]](implicit GG: Contravariant[G]): Invariant[[X]F[G[G[X]]]]

Compose the Invariant Functor F with a Contravariant Functor to get a new Invariant Functor for [F[G[_]]].

def composeWithFunctor[G[_]](implicit G: Functor[G]): Contravariant[[X]F[G[G[X]]]]

Compose the Invariant Functor F with a normal (Covariant) Functor to get a new Invariant Functor for [F[G[_]].

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def imap[A, B](fa: F[G[A]])(f: (A) ⇒ B)(fi: (B) ⇒ A): F[G[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