BijectionT

abstract def from(b: B): G[A]

abstract def to(a: A): F[B]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def ***[C, D](g: BijectionT.Bijection[C, D])(implicit evF: =:=[F[B], Id.Id[B]], evG: =:=[G[A], Id.Id[A]]): BijectionT.Bijection[(A, C), (B, D)]

def <=<[C](that: BijectionT[F, G, C, A])(implicit FM: Bind[F], GM: Bind[G]): BijectionT[F, G, C, B]

alias for compose

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def >=>[C](that: BijectionT[F, G, B, C])(implicit M: Bind[F], GM: Bind[G]): BijectionT[F, G, A, C]

alias for andThen

def ^^^[C, D](g: BijectionT.Bijection[C, D])(implicit evF: =:=[F[B], Id.Id[B]], evG: =:=[G[A], Id.Id[A]]): BijectionT.Bijection[\/[A, C], \/[B, D]]

def andThen[C](that: BijectionT[F, G, B, C])(implicit M: Bind[F], GM: Bind[G]): BijectionT[F, G, A, C]

final def asInstanceOf[T0]: T0

def bimap[C, X[_, _], D](g: BijectionT.Bijection[C, D])(implicit F: Bifunctor[X], evF: =:=[F[B], Id.Id[B]], evG: =:=[G[A], Id.Id[A]]): BijectionT.Bijection[X[A, C], X[B, D]]

def clone(): AnyRef

def compose[C](g: BijectionT[F, G, C, A])(implicit FM: Bind[F], GM: Bind[G]): BijectionT[F, G, C, B]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def flip: BijectionT[G, F, B, A]

def fromK: Kleisli[G, B, A]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def lens(implicit evF: =:=[F[B], Id.Id[B]], evG: =:=[G[A], Id.Id[A]]): Lens[A, B]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def partial(implicit evF: =:=[F[B], Id.Id[B]], evG: =:=[G[A], Id.Id[A]]): PLens[A, B]

final def synchronized[T0](arg0: ⇒ T0): T0

def toK: Kleisli[F, A, B]

def toString(): String

def unary_~(implicit evF: =:=[F[B], Id.Id[B]], evG: =:=[G[A], Id.Id[A]]): PLens[A, B]

alias for partial

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit