View

def apply (index: Int): A

Performs an atomic read of the indexth element of array.

def length : Int

def refViews : IndexedSeq[View[A]]

Returns a sequence of Ref.View that are backed by the elements of array.

def tarray : TArray[A]

The TArray from which this view was created.

def update (index: Int, v: A): Unit

Performs an atomic write of the indexth element of array.

def != (arg0: AnyRef): Boolean

def != (arg0: Any): Boolean

def ## (): Int

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

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

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

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

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

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

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

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

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

def == (arg0: AnyRef): Boolean

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

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

def asInstanceOf [T0] : T0

def canEqual (that: Any): Boolean

def clone (): Seq[A]

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

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

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

def companion : GenericCompanion[IndexedSeq]

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

def contains (elem: Any): Boolean

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

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

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

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

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

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

def corresponds [B] (that: Seq[B])(p: (A, B) ⇒ Boolean): Boolean

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

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

def diff [B >: A] (that: Seq[B]): IndexedSeq[A]

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

def distinct : IndexedSeq[A]

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

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

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

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

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

def eq (arg0: AnyRef): Boolean

def equals (that: Any): Boolean

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

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

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

def finalize (): Unit

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

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

def flatten [B] (implicit asTraversable: (A) ⇒ TraversableOnce[B]): Traversable[B]

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

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

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

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

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

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

def getClass (): java.lang.Class[_]

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

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

def hasDefiniteSize : Boolean

def hashCode (): Int

def head : A

def headOption : Option[A]

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

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

def indexOfSlice [B >: A] (that: Seq[B], from: Int): Int

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

def indexOfSlice [B >: A] (that: Seq[B]): Int

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

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

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

def indices : Range

def init : IndexedSeq[A]

def inits : Iterator[IndexedSeq[A]]

def intersect [B >: A] (that: Seq[B]): IndexedSeq[A]

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

def isDefinedAt (idx: Int): Boolean

def isEmpty : Boolean

def isInstanceOf [T0] : Boolean

def isTraversableAgain : Boolean

def iterator : Iterator[A]

def last : A

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

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

def lastIndexOfSlice [B >: A] (that: Seq[B], end: Int): Int

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

def lastIndexOfSlice [B >: A] (that: Seq[B]): Int

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

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

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

def lastOption : Option[A]

def lengthCompare (len: Int): Int

def lift : (Int) ⇒ Option[A]

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

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

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

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

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

def mkString : String

def mkString (sep: String): String

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

def ne (arg0: AnyRef): Boolean

def newBuilder : Builder[A, IndexedSeq[A]]

def nonEmpty : Boolean

def notify (): Unit

def notifyAll (): Unit

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

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

def par : ParSeq[A]

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

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

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

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

def permutations : Iterator[IndexedSeq[A]]

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

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

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

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

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

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

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

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

def repr : IndexedSeq[A]

def reverse : IndexedSeq[A]

def reverseIterator : Iterator[A]

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

def reversed : List[A]

def sameElements [B >: A] (that: Iterable[B]): Boolean

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

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

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

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

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

def seq : Seq[A]

def size : Int

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

def sliding [B >: A] (size: Int, step: Int): Iterator[IndexedSeq[A]]

def sliding [B >: A] (size: Int): Iterator[IndexedSeq[A]]

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

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

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

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

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

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

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

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

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

def stringPrefix : String

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

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

def tail : IndexedSeq[A]

def tails : Iterator[IndexedSeq[A]]

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

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

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

def thisCollection : IndexedSeq[A]

def toArray [B >: A] (implicit arg0: ClassManifest[B]): Array[B]

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

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

def toIndexedSeq [B >: A] : IndexedSeq[B]

def toIterable : Iterable[A]

def toIterator : Iterator[A]

def toList : List[A]

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

def toSeq : Seq[A]

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

def toStream : Stream[A]

def toString (): String

def toTraversable : Traversable[A]

def transform (f: (A) ⇒ A): View.this.type

def transpose [B] (implicit asTraversable: (A) ⇒ TraversableOnce[B]): Traversable[Traversable[B]]

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

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

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

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

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

def view (from: Int, until: Int): IndexedSeqView[A, IndexedSeq[A]]

def view : IndexedSeqView[A, IndexedSeq[A]]

def wait (): Unit

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

def wait (arg0: Long): Unit

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

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

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

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

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

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

def elements : Iterator[A]

def equalsWith [B] (that: Seq[B])(f: (A, B) ⇒ Boolean): Boolean

def findIndexOf (p: (A) ⇒ Boolean): Int

def findLastIndexOf (p: (A) ⇒ Boolean): Int

def first : A

def firstOption : Option[A]

def projection : SeqView[A, IndexedSeq[A]]

def reversedElements : Iterator[A]