InverseIndexFunction

abstract def apply(v1: V): Int

abstract def domain: Iterator[V]

Obtain a new iterator over the domain of this function.

abstract def isDefinedAt(x: V): Boolean

abstract def width: Int

The width of index range.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def andThen[C](k: (Int) ⇒ C): PartialFunction[V, C]

def applyOrElse[A1 <: V, B1 >: Int](x: A1, default: (A1) ⇒ B1): B1

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def compose[A](g: (A) ⇒ V): (A) ⇒ Int

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 lift: (V) ⇒ Option[Int]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def orElse[A1 <: V, B1 >: Int](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

final def range: Iterator[Int]

Obtain a new iterator over the range values of this function.

def runWith[U](action: (Int) ⇒ U): (V) ⇒ Boolean

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

final def toMap: Map[V, Int]

Obtain a Scala Map that is equivalent to this function.

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit