Index

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

def +:[B >: Any, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Any], B, That]): That

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

def :+[B >: Any, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Any], B, That]): That

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def _entries: IndexedSeq[Any]

Allow subclasses to access the list objects.

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, Any) ⇒ B, combop: (B, B) ⇒ B): B

def allocSize0: Int

The size others might want to allocate to hold data relevant to this Index.

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

def apply[T](iterable: Iterable[T]): Index[T]

Constructs an Index from some elements.

def apply[T](elements: Iterator[T]): Index[T]

Constructs an Index from some elements.

def apply[T](): Index[T]

Constructs an empty index.

def apply(index: Int): Any

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

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clear(): Unit

Clears the index.

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[Any, B])(implicit bf: CanBuildFrom[IndexedSeq[Any], B, That]): That

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

def combinations(n: Int): Iterator[IndexedSeq[Any]]

def companion: GenericCompanion[IndexedSeq]

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

def contains(entry: Any): Boolean

def containsSlice[B](that: GenSeq[B]): Boolean

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

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

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

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

def corresponds[B](that: GenSeq[B])(p: (Any, B) ⇒ Boolean): Boolean

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

def diff[B >: Any](that: GenSeq[B]): IndexedSeq[Any]

def distinct: IndexedSeq[Any]

def drop(n: Int): IndexedSeq[Any]

def dropRight(n: Int): IndexedSeq[Any]

def dropWhile(p: (Any) ⇒ Boolean): IndexedSeq[Any]

def endsWith[B](that: GenSeq[B]): Boolean

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

def filter(p: (Any) ⇒ Boolean): IndexedSeq[Any]

def filterNot(p: (Any) ⇒ Boolean): IndexedSeq[Any]

def finalize(): Unit

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

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

def flatten[B](implicit asTraversable: (Any) ⇒ GenTraversableOnce[B]): IndexedSeq[B]

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

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

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

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

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

def freeze0(): Unit

def frozen: Boolean

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

def get(pos: Int): Any

Return an object at the given position or throws an exception if it's not found.

def getAll(c: Set[Int]): Set[Any]

def getAll(c: Array[Int]): ArraySeq[Any]

def getAll(c: List[Int]): List[Any]

def getAll(c: Iterator[Int]): Iterator[Any]

final def getClass(): Class[_]

def getIndex(entry: Any): Int

Like index, but throw an exception if the entry is not already there.

def groupBy[K](f: (Any) ⇒ K): Map[K, IndexedSeq[Any]]

def grouped(size: Int): Iterator[IndexedSeq[Any]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Any

def headOption: Option[Any]

def immutable: Index[Any]

Returns an immutable view of the index.

def index(entry: Any): Int

Return a densely-packed positive integer index for the given object.

def indexAll(c: Set[Any]): Set[Int]

def indexAll(c: Array[Any]): Array[Int]

def indexAll(c: List[Any]): List[Int]

def indexAll(c: Iterator[Any]): Iterator[Int]

def indexKeys[V](c: Map[Any, V]): Map[Any, V]

def indexOf[B >: Any](elem: B, from: Int): Int

def indexOf[B >: Any](elem: B): Int

def indexOfSlice[B >: Any](that: GenSeq[B], from: Int): Int

def indexOfSlice[B >: Any](that: GenSeq[B]): Int

def indexValues[K](c: Map[K, Any]): Map[K, Any]

def indexWhere(p: (Any) ⇒ Boolean, from: Int): Int

def indexWhere(p: (Any) ⇒ Boolean): Int

def indices: Range

def init: IndexedSeq[Any]

def inits: Iterator[IndexedSeq[Any]]

def intersect[B >: Any](that: GenSeq[B]): IndexedSeq[Any]

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Any]

def last: Any

def lastIndexOf[B >: Any](elem: B, end: Int): Int

def lastIndexOf[B >: Any](elem: B): Int

def lastIndexOfSlice[B >: Any](that: GenSeq[B], end: Int): Int

def lastIndexOfSlice[B >: Any](that: GenSeq[B]): Int

def lastIndexWhere(p: (Any) ⇒ Boolean, end: Int): Int

def lastIndexWhere(p: (Any) ⇒ Boolean): Int

def lastOption: Option[Any]

def length: Int

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[Any]

def load(source: AnyRef { def getLines: Iterator[String] }): Index[String]

def map[B, That](f: (Any) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Any], B, That]): That

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

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

var maxSize: Int

If positive, throw error if Index reaches size larger than this.

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

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

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[Any, IndexedSeq[Any]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def padTo[B >: Any, That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Any], B, That]): That

def par: ParSeq[Any]

def parCombiner: Combiner[Any, ParSeq[Any]]

def partition(p: (Any) ⇒ Boolean): (IndexedSeq[Any], IndexedSeq[Any])

def patch[B >: Any, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[Any], B, That]): That

def permutations: Iterator[IndexedSeq[Any]]

def prefixLength(p: (Any) ⇒ Boolean): Int

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

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

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

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

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

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

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

def repr: IndexedSeq[Any]

def reset(): Unit

Wipe the Index clean

def reverse: IndexedSeq[Any]

def reverseIterator: Iterator[Any]

def reverseMap[B, That](f: (Any) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Any], B, That]): That

def reversed: List[Any]

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

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

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

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

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

def segmentLength(p: (Any) ⇒ Boolean, from: Int): Int

def seq: IndexedSeq[Any]

def size: Int

def size0: Int

def slice(from: Int, until: Int): IndexedSeq[Any]

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

def sliding(size: Int): Iterator[IndexedSeq[Any]]

def sortBy[B](f: (Any) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[Any]

def sortWith(lt: (Any, Any) ⇒ Boolean): IndexedSeq[Any]

def sorted[B >: Any](implicit ord: Ordering[B]): IndexedSeq[Any]

def span(p: (Any) ⇒ Boolean): (IndexedSeq[Any], IndexedSeq[Any])

def splitAt(n: Int): (IndexedSeq[Any], IndexedSeq[Any])

def startsWith[B](that: GenSeq[B], offset: Int): Boolean

def startsWith[B](that: GenSeq[B]): Boolean

def stringPrefix: String

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

def synchronized: Index[Any]

Returns a synchronized view of the index.

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

def tail: IndexedSeq[Any]

def tails: Iterator[IndexedSeq[Any]]

def take(n: Int): IndexedSeq[Any]

def takeRight(n: Int): IndexedSeq[Any]

def takeWhile(p: (Any) ⇒ Boolean): IndexedSeq[Any]

def thisCollection: IndexedSeq[Any]

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

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

def toBuffer[A1 >: Any]: Buffer[A1]

def toCollection(repr: IndexedSeq[Any]): IndexedSeq[Any]

def toIndexedSeq: IndexedSeq[Any]

def toIterable: Iterable[Any]

def toIterator: Iterator[Any]

def toList: List[Any]

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

def toSeq: Seq[Any]

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

def toStream: Stream[Any]

def toString(): String

def toTraversable: Traversable[Any]

def toVector: Vector[Any]

def transpose[B](implicit asTraversable: (Any) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]

def union[B >: Any, That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[Any], B, That]): That

def unzip[A1, A2](implicit asPair: (Any) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

def unzip3[A1, A2, A3](implicit asTriple: (Any) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

def updated[B >: Any, That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Any], B, That]): That

def view(from: Int, until: Int): SeqView[Any, IndexedSeq[Any]]

def view: SeqView[Any, IndexedSeq[Any]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (Any) ⇒ Boolean): FilterMonadic[Any, IndexedSeq[Any]]

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

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

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

def /:\[A1 >: Any](z: A1)(op: (A1, A1) ⇒ A1): A1