DenseIntIndex

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++[B >: Int, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Int], B, That]): That

def ++:[B >: Int, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[Int], B, That]): That

def ++:[B >: Int, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Int], B, That]): That

def /:[B](z: B)(op: (B, Int) ⇒ B): B

def :\[B](z: B)(op: (Int, B) ⇒ B): B

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def aggregate[B](z: ⇒ B)(seqop: (B, Int) ⇒ B, combop: (B, B) ⇒ B): B

def andThen[A](g: (Int) ⇒ A): (Int) ⇒ A

def apply(t: Int): Int

Returns the int id of the given element (0-based) or -1 if not found in the index.

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[Int, B])(implicit bf: CanBuildFrom[Iterable[Int], B, That]): That

def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]

def companion: GenericCompanion[Iterable]

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

def contains(t: Int): Boolean

Returns true if this index contains the element t.

def copyToArray[B >: Int](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: Int](xs: Array[B]): Unit

def copyToArray[B >: Int](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: Int](dest: Buffer[B]): Unit

def count(p: (Int) ⇒ Boolean): Int

lazy val defaultHashCode: Int

def drop(n: Int): Iterable[Int]

def dropRight(n: Int): Iterable[Int]

def dropWhile(p: (Int) ⇒ Boolean): Iterable[Int]

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

def exists(p: (Int) ⇒ Boolean): Boolean

def filter(p: (Int) ⇒ Boolean): Iterable[Int]

def filterNot(p: (Int) ⇒ Boolean): Iterable[Int]

def find(p: (Int) ⇒ Boolean): Option[Int]

def flatMap[B, That](f: (Int) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Int], B, That]): That

def flatten[B](implicit asTraversable: (Int) ⇒ GenTraversableOnce[B]): Iterable[B]

def fold[A1 >: Int](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, Int) ⇒ B): B

def foldRight[B](z: B)(op: (Int, B) ⇒ B): B

def forall(p: (Int) ⇒ Boolean): Boolean

def foreach[U](f: (Int) ⇒ U): Unit

def genericBuilder[B]: Builder[B, Iterable[B]]

def get(i: Int): Int

Returns an object at the given position or throws IndexOutOfBoundsException if it's not found.

final def getClass(): Class[_]

def groupBy[K](f: (Int) ⇒ K): Map[K, Iterable[Int]]

def grouped(size: Int): Iterator[Iterable[Int]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Int

def headOption: Option[Int]

def indexOf(t: Int): Int

Override Iterable's linear-scan indexOf to use our apply method.

def indexOpt(t: Int): Option[Int]

Returns Some(i) if the object has been indexed, or None.

def init: Iterable[Int]

def inits: Iterator[Iterable[Int]]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Int]

def last: Int

def lastOption: Option[Int]

def map[B, That](f: (Int) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Int], B, That]): That

def max[B >: Int](implicit cmp: Ordering[B]): Int

def maxBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int

def min[B >: Int](implicit cmp: Ordering[B]): Int

def minBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[Int, Iterable[Int]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def pairs: Iterator[(Int, Int)]

Returns the indexed items along with their indicies

def par: ParIterable[Int]

def parCombiner: Combiner[Int, ParIterable[Int]]

def partition(p: (Int) ⇒ Boolean): (Iterable[Int], Iterable[Int])

def product[B >: Int](implicit num: Numeric[B]): B

def reduce[A1 >: Int](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: Int](op: (B, Int) ⇒ B): B

def reduceLeftOption[B >: Int](op: (B, Int) ⇒ B): Option[B]

def reduceOption[A1 >: Int](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: Int](op: (Int, B) ⇒ B): B

def reduceRightOption[B >: Int](op: (Int, B) ⇒ B): Option[B]

def repr: Iterable[Int]

def reversed: List[Int]

def sameElements[B >: Int](that: GenIterable[B]): Boolean

def scan[B >: Int, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[Int], B, That]): That

def scanLeft[B, That](z: B)(op: (B, Int) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Int], B, That]): That

def scanRight[B, That](z: B)(op: (Int, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Int], B, That]): That

def seq: Iterable[Int]

def size: Int

Number of elements in this index.

def slice(from: Int, until: Int): Iterable[Int]

def sliding(size: Int, step: Int): Iterator[Iterable[Int]]

def sliding(size: Int): Iterator[Iterable[Int]]

def span(p: (Int) ⇒ Boolean): (Iterable[Int], Iterable[Int])

def splitAt(n: Int): (Iterable[Int], Iterable[Int])

def stringPrefix: String

def sum[B >: Int](implicit num: Numeric[B]): B

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

def tail: Iterable[Int]

def tails: Iterator[Iterable[Int]]

def take(n: Int): Iterable[Int]

def takeRight(n: Int): Iterable[Int]

def takeWhile(p: (Int) ⇒ Boolean): Iterable[Int]

def thisCollection: Iterable[Int]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Int, Col[Int]]): Col[Int]

def toArray[B >: Int](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: Int]: Buffer[B]

def toCollection(repr: Iterable[Int]): Iterable[Int]

def toIndexedSeq: IndexedSeq[Int]

def toIterable: Iterable[Int]

def toIterator: Iterator[Int]

def toList: List[Int]

def toMap[T, U](implicit ev: <:<[Int, (T, U)]): Map[T, U]

def toSeq: Seq[Int]

def toSet[B >: Int]: Set[B]

def toStream: Stream[Int]

def toString(): String

def toTraversable: Traversable[Int]

def toVector: Vector[Int]

def transpose[B](implicit asTraversable: (Int) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def unapply(i: Int): Option[Int]

Returns Some(t) if this int corresponds to some object, and None otherwise.

def unzip[A1, A2](implicit asPair: (Int) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (Int) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def view(from: Int, until: Int): IterableView[Int, Iterable[Int]]

def view: IterableView[Int, Iterable[Int]]

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def withFilter(p: (Int) ⇒ Boolean): FilterMonadic[Int, Iterable[Int]]

def zip[A1 >: Int, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[Int], (A1, B), That]): That

def zipAll[B, A1 >: Int, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[Int], (A1, B), That]): That

def zipWithIndex[A1 >: Int, That](implicit bf: CanBuildFrom[Iterable[Int], (A1, Int), That]): That

def |[U](right: Index[U]): EitherIndex[Int, U]

def finalize(): Unit