Coyoneda

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

implicit def coyonedaFunctor[F[_]]: Functor[[α]Coyoneda[F, α]]

Coyoneda[F,_] is a functor for any F

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def iso[F[_]](implicit arg0: Functor[F]): Isomorphism.<~>[[α]Coyoneda[F, α], F]

def lift[F[_], A](fa: F[A]): Aux[F, A, A]

F[A] converts to Coyoneda[F,A] for any F

def liftT[F[_], G[_]](fg: ~>[F, G]): ~>[[α]Coyoneda[F, α], [α]Coyoneda[G, α]]

Turns a natural transformation F ~> G into CF ~> CG

def liftTF[F[_], G[_]](fg: ~>[F, G])(implicit arg0: Functor[G]): ~>[[α]Coyoneda[F, α], G]

Turns a natural transformation F ~> G into CF ~> G

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

def apply[F[_], A](fa: F[A]): Aux[F, A, A]

Old name for lift.