Vector2AArray

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

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

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

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

final def ==(arg0: AnyRef): Boolean

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

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

def apply(index: Int): Vector2A[A]

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

final def asInstanceOf[T0]: T0

def avg: Vector2A[A]

The average of all values in the array

def canEqual(that: Any): Boolean

def clone(): Seq[Vector2A[A]]

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

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

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

def companion: GenericCompanion[IndexedSeq]

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

def contains(elem: Any): Boolean

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

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

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

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

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

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

def count(p: (Vector2A[A]) ⇒ Boolean): Int

def deep: IndexedSeq[Any]

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

def distinct: Vector2AArray[A]

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

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

def dropWhile(p: (Vector2A[A]) ⇒ Boolean): Vector2AArray[A]

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

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: (Vector2A[A]) ⇒ Boolean): Boolean

def filter(p: (Vector2A[A]) ⇒ Boolean): Vector2AArray[A]

def filterNot(p: (Vector2A[A]) ⇒ Boolean): Vector2AArray[A]

def finalize(): Unit

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

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

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

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

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

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

def forall(p: (Vector2A[A]) ⇒ Boolean): Boolean

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

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

final def getClass(): Class[_]

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

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

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Vector2A[A]

def headOption: Option[Vector2A[A]]

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

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

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

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

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

def indexWhere(p: (Vector2A[A]) ⇒ Boolean): Int

def indices: Range

def init: Vector2AArray[A]

def inits: Iterator[Vector2AArray[A]]

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

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Vector2A[A]]

def last: Vector2A[A]

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

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

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

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

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

def lastIndexWhere(p: (Vector2A[A]) ⇒ Boolean): Int

def lastOption: Option[Vector2A[A]]

val length: Int

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[Vector2A[A]]

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

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

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

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

def minBy[B](f: (Vector2A[A]) ⇒ B)(implicit cmp: Ordering[B]): Vector2A[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: Vector2AArrayBuilder[A]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

def par: ParSeq[Vector2A[A]]

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

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

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

def permutations: Iterator[Vector2AArray[A]]

def prefixLength(p: (Vector2A[A]) ⇒ Boolean): Int

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

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

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

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

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

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

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

def repr: Vector2AArray[A]

def reverse: Vector2AArray[A]

def reverseIterator: Iterator[Vector2A[A]]

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

def reversed: List[Vector2A[A]]

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

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

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

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

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

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

def seq: IndexedSeq[Vector2A[A]]

def size: Int

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

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

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

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

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

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

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

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

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

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

def stringPrefix: String

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

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

def tail: Vector2AArray[A]

def tails: Iterator[Vector2AArray[A]]

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

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

def takeWhile(p: (Vector2A[A]) ⇒ Boolean): Vector2AArray[A]

def thisCollection: IndexedSeq[Vector2A[A]]

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

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

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

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

def toIndexedSeq: IndexedSeq[Vector2A[A]]

def toIterable: Iterable[Vector2A[A]]

def toIterator: Iterator[Vector2A[A]]

def toList: List[Vector2A[A]]

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

def toSeq: Seq[Vector2A[A]]

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

def toStream: Stream[Vector2A[A]]

def toString(): String

def toTraversable: Traversable[Vector2A[A]]

def toVector: Vector[Vector2A[A]]

def transform(f: (Vector2A[A]) ⇒ Vector2A[A]): Vector2AArray.this.type

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

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

def unzip: (DoubleAArray[A], DoubleAArray[A])

Returns separate arrays for each coordinate.

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

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

def update(index: Int, elem: Vector2A[A]): Unit

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

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

def view: IndexedSeqView[Vector2A[A], Vector2AArray[A]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

def x(index: Int): DoubleA[A]

Returns the value of the X coordinate of given element.

def xs: DoubleAArray[A]

Returns an array of values of the X coordinate.

def y(index: Int): DoubleA[A]

Returns the value of the Y coordinate of given element.

def ys: DoubleAArray[A]

Returns an array of values of the Y coordinate.

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

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

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

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