SubclassBijection

abstract def applyfn(a: A): B

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def andThen[C](g: (B) ⇒ C): (A) ⇒ C

def andThen[C](g: Injection[B, C]): Injection[A, C]

def andThen[C](g: Bijection[B, C]): Bijection[A, C]

Composes two instances of Bijection in a new Bijection, with this one applied first.

def apply(a: A): B

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def compose[T](g: (T) ⇒ A): (T) ⇒ B

def compose[T](g: Injection[T, A]): Injection[T, B]

def compose[T](g: Bijection[T, A]): Bijection[T, B]

Composes two instances of Bijection in a new Bijection, with this one applied last.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def inverse: Bijection[B, A]

def invert(b: B): A

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 toFunction: (A) ⇒ B

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit