ImmutableArrayT

abstract val base: Array[AnyRef]

abstract def len: Int

abstract def offset: Int

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

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

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

def :\[B](z: B)(op: (A, 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, A) ⇒ B, combop: (B, B) ⇒ B): B

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

def apply(idx: Int): A

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

def ar: ImmutableArrayT[A]

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

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

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

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

def companion: GenericCompanion[ImmutableArrayProxy]

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

def contains[A1 >: A](elem: A1): 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: GenSeq[B])(p: (A, B) ⇒ Boolean): Boolean

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

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

def distinct: ImmutableArrayProxy[A]

def drop(n: Int): ImmutableArray[Nothing]

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

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

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

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

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

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

def finalize(): Unit

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

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

def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): ImmutableArrayProxy[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, ImmutableArrayProxy[B]]

final def getClass(): Class[_]

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

def grouped(size: Int): Iterator[ImmutableArrayProxy[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: GenSeq[B], from: Int): 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: ImmutableArrayProxy[A]

def inits: Iterator[ImmutableArrayProxy[A]]

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

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final 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: GenSeq[B], end: Int): 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 length: Int

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[A]

def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[ImmutableArrayProxy[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

final def ne(arg0: AnyRef): Boolean

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

def nonEmpty: Boolean

final def notify(): Unit

final 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[ImmutableArrayProxy[A], B, That]): That

def par: ParSeq[A]

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

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

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

def permutations: Iterator[ImmutableArrayProxy[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: ImmutableArrayProxy[A]

def reverse: ImmutableArrayProxy[A]

def reverseIterator: Iterator[A]

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

def reversed: List[A]

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

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

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

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

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

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

def seq: IndexedSeq[A]

def size: Int

def slice(from: Int, until: Int): ImmutableArray[Nothing]

we can do better - slice used by many functions in Optimized

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

def sliding(size: Int): Iterator[ImmutableArrayProxy[A]]

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

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

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

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

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

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

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

def stringPrefix: String

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

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

def tail: ImmutableArray[Nothing]

def tails: Iterator[ImmutableArrayProxy[A]]

def take(n: Int): ImmutableArray[Nothing]

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

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

def thisCollection: IndexedSeq[A]

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

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

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

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

def toIndexedSeq: IndexedSeq[A]

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 toVector: Vector[A]

def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): ImmutableArrayProxy[ImmutableArrayProxy[B]]

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

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

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

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

Basically optimised version for back, hint used directly, one new array creation

def view(from: Int, until: Int): SeqView[A, ImmutableArrayProxy[A]]

def view: SeqView[A, ImmutableArrayProxy[A]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

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

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

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