ofDouble

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

def +:[B >: Double, That](elem: B)(implicit bf: CanBuildFrom[ArraySeq[Double], B, That]): That

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

def :+[B >: Double, That](elem: B)(implicit bf: CanBuildFrom[ArraySeq[Double], B, That]): That

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

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

def apply(index: Int): Double

The element at given index

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

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): ArraySeq[Double]

Clones this object, including the underlying Array.

def collect[B, That](pf: PartialFunction[Double, B])(implicit bf: CanBuildFrom[ArraySeq[Double], B, That]): That

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

def combinations(n: Int): Iterator[ArraySeq[Double]]

def companion: GenericCompanion[immutable.IndexedSeq]

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

def contains[A1 >: Double](elem: A1): Boolean

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

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

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

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

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

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

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

def diff[B >: Double](that: GenSeq[B]): ArraySeq[Double]

def distinct: ArraySeq[Double]

def drop(n: Int): ArraySeq[Double]

def dropRight(n: Int): ArraySeq[Double]

def dropWhile(p: (Double) ⇒ Boolean): ArraySeq[Double]

def elemTag: ClassTag[Double]

The tag of the element type

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

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

def filter(p: (Double) ⇒ Boolean): ArraySeq[Double]

def filterNot(p: (Double) ⇒ Boolean): ArraySeq[Double]

def finalize(): Unit

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

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

def flatten[B](implicit asTraversable: (Double) ⇒ GenTraversableOnce[B]): immutable.IndexedSeq[B]

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

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

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

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

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

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

final def getClass(): Class[_]

def groupBy[K](f: (Double) ⇒ K): immutable.Map[K, ArraySeq[Double]]

def grouped(size: Int): Iterator[ArraySeq[Double]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Double

def headOption: Option[Double]

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

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

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

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

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

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

def indices: immutable.Range

def init: ArraySeq[Double]

def inits: Iterator[ArraySeq[Double]]

def intersect[B >: Double](that: GenSeq[B]): ArraySeq[Double]

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Double]

def last: Double

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

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

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

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

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

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

def lastOption: Option[Double]

def length: Int

The length of the array

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[Double]

def map[B, That](f: (Double) ⇒ B)(implicit bf: CanBuildFrom[ArraySeq[Double], B, That]): That

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

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

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

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

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[Double, ArraySeq[Double]]

Creates new builder for this collection ==> move to subclasses

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

def par: ParSeq[Double]

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

def partition(p: (Double) ⇒ Boolean): (ArraySeq[Double], ArraySeq[Double])

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

def permutations: Iterator[ArraySeq[Double]]

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

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

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

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

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

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

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

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

def repr: ArraySeq[Double]

def reverse: ArraySeq[Double]

def reverseIterator: Iterator[Double]

def reverseMap[B, That](f: (Double) ⇒ B)(implicit bf: CanBuildFrom[ArraySeq[Double], B, That]): That

def reversed: List[Double]

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

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

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

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

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

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

def seq: immutable.IndexedSeq[Double]

def size: Int

def slice(from: Int, until: Int): ArraySeq[Double]

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

def sliding(size: Int): Iterator[ArraySeq[Double]]

def sortBy[B](f: (Double) ⇒ B)(implicit ord: math.Ordering[B]): ArraySeq[Double]

def sortWith(lt: (Double, Double) ⇒ Boolean): ArraySeq[Double]

def sorted[B >: Double](implicit ord: math.Ordering[B]): ArraySeq[Double]

def span(p: (Double) ⇒ Boolean): (ArraySeq[Double], ArraySeq[Double])

def splitAt(n: Int): (ArraySeq[Double], ArraySeq[Double])

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

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

def stringPrefix: String

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

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

def tail: ArraySeq[Double]

def tails: Iterator[ArraySeq[Double]]

def take(n: Int): ArraySeq[Double]

def takeRight(n: Int): ArraySeq[Double]

def takeWhile(p: (Double) ⇒ Boolean): ArraySeq[Double]

def thisCollection: ArraySeq[Double]

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

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

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

def toCollection(repr: ArraySeq[Double]): IndexedSeq[Double]

def toIndexedSeq: immutable.IndexedSeq[Double]

def toIterable: Iterable[Double]

def toIterator: Iterator[Double]

def toList: List[Double]

def toMap[T, U](implicit ev: <:<[Double, (T, U)]): immutable.Map[T, U]

def toSeq: immutable.Seq[Double]

def toSet[B >: Double]: immutable.Set[B]

def toStream: immutable.Stream[Double]

def toString(): String

def toTraversable: Traversable[Double]

def toVector: Vector[Double]

def transpose[B](implicit asTraversable: (Double) ⇒ GenTraversableOnce[B]): immutable.IndexedSeq[immutable.IndexedSeq[B]]

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

val unsafeArray: Array[Double]

The underlying array

def unzip[A1, A2](implicit asPair: (Double) ⇒ (A1, A2)): (immutable.IndexedSeq[A1], immutable.IndexedSeq[A2])

def unzip3[A1, A2, A3](implicit asTriple: (Double) ⇒ (A1, A2, A3)): (immutable.IndexedSeq[A1], immutable.IndexedSeq[A2], immutable.IndexedSeq[A3])

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

def view(from: Int, until: Int): SeqView[Double, ArraySeq[Double]]

def view: SeqView[Double, ArraySeq[Double]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (Double) ⇒ Boolean): FilterMonadic[Double, ArraySeq[Double]]

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

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

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

def update(index: Int, elem: Double): Unit