ObservableArray

abstract def addAll(src: T, srcIdx: Int, length: Int): Unit

Append portion of given regular array to the end of this array.

abstract def addAll(src: Array[V], srcIdx: Int, length: Int): Unit

Append portion of given regular array to the end of this array.

abstract def addAll(elems: V*): Unit

Append given elements to the end of this array.

abstract def addAll(src: T): Unit

Append given observable array to the end of this array.

abstract def copyTo(srcIdx: Int, dest: T, destIdx: Int, length: Int): Unit

Copy specified portion of this observable array to dest observable array.

abstract def copyTo(srcIdx: Int, dest: Array[V], destIdx: Int, length: Int): Unit

Copy specified portion of this observable array to dest regular array.

abstract def get(idx: Int): V

Select the element at idx in the array.

abstract def newBuilder: Builder[V, T]

abstract def set(destIdx: Int, src: T, srcIdx: Int, length: Int): Unit

Copy a portion of given observable array into this array, replacing affected contents.

abstract def set(destIdx: Int, src: Array[V], srcIdx: Int, length: Int): Unit

Copy a portion of given regular array into this array, replacing affected contents.

abstract def set(idx: Int, value: V): Unit

Set the element at idx in the array to value.

abstract def setAll(src: T, srcIdx: Int, length: Int): Unit

Replace the contents of this array with portion of the given observable array.

abstract def setAll(src: Array[V], srcIdx: Int, length: Int): Unit

Replace the contents of this array with portion of the given regular array.

abstract def setAll(src: T): Unit

Replace the contents of this array with the given observable array.

abstract def setAll(elems: V*): Unit

Replace the contents of this array with the given elements.

abstract def toArray(srcIdx: Int, dest: Array[V], length: Int): Array[V]

Write a portion of this array's contents into the specified array, if it is large enough, or a new array if it is not.

abstract def toArray(dest: Array[V]): Array[V]

Write the contents of this array into the specified array, if it is large enough, or a new array if it is not.

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++(src: T): T

Append another observable array to this array.

def ++(src: Array[V]): T

Append another array to this array.

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

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

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

def ++=(xs: TraversableOnce[V]): ObservableArray.this.type

def +:[B >: V, That](elem: B)(implicit bf: CanBuildFrom[T, B, That]): That

def +=(elem: V): ObservableArray.this.type

Append new element to this ObservableArray.

def +=(elem1: V, elem2: V, elems: V*): ObservableArray.this.type

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

def :+[B >: V, That](elem: B)(implicit bf: CanBuildFrom[T, B, That]): That

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

def apply(idx: Int): V

Select an element by its index in the array.

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clear(): Unit

Empty array, clearing builder contents, resizing it to zero.

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[V, B])(implicit bf: CanBuildFrom[T, B, That]): That

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

def combinations(n: Int): Iterator[T]

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

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

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

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

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

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

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

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

def deep: IndexedSeq[Any]

val delegate: D

JavaFX object to be wrapped.

def diff[B >: V](that: GenSeq[B]): T

def distinct: T

def drop(n: Int): T

def dropRight(n: Int): T

def dropWhile(p: (V) ⇒ Boolean): T

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

def ensureCapacity(capacity: Int): Unit

Grow array capacity if currently smaller than given capacity; do nothing otherwise.

final def eq(arg0: AnyRef): Boolean

def equals(ref: Any): Boolean

Verifies if a object is equals to this delegate.

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

def filter(p: (V) ⇒ Boolean): T

def filterNot(p: (V) ⇒ Boolean): T

def finalize(): Unit

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

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

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

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

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

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

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

final def getClass(): Class[_]

def groupBy[K](f: (V) ⇒ K): Map[K, T]

def grouped(size: Int): Iterator[T]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: V

def headOption: Option[V]

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

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

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

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

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

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

def indices: Range

def init: T

def inits: Iterator[T]

def intersect[B >: V](that: GenSeq[B]): T

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[V]

def last: V

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

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

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

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

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

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

def lastOption: Option[V]

def length: Int

Retrieve length of data in this array.

def lengthCompare(len: Int): Int

def map[B, That](f: (V) ⇒ B)(implicit bf: CanBuildFrom[T, B, That]): That

def mapResult[NewTo](f: (T) ⇒ NewTo): Builder[V, NewTo]

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

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

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

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

def mkString: String

def mkString(sep: String): String

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

final def ne(arg0: AnyRef): Boolean

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def onChange(op: ⇒ Unit): Subscription

Add a listener function to Array 's changes.

def onChange(op: (T, Change) ⇒ Unit): Subscription

Add a listener function to Array 's changes.

def onInvalidate(op: ⇒ Unit): Subscription

Adds a no argument function as a JavaFX InvalidationListener.

def onInvalidate(op: (Observable) ⇒ Unit): Subscription

Adds a function as a JavaFX InvalidationListener.

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

def par: ParSeq[V]

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

def partition(p: (V) ⇒ Boolean): (T, T)

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

def permutations: Iterator[T]

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

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

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

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

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

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

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

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

def repr: T

def result(): T

Produces collection from builder.

def reverse: T

def reverseIterator: Iterator[V]

def reverseMap[B, That](f: (V) ⇒ B)(implicit bf: CanBuildFrom[T, B, That]): That

def reversed: List[V]

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

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

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

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

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

def seq: IndexedSeq[V]

Convert to a sequence in which all elements are implemented sequentially.

def size: Int

Retrieve length of data in this array.

def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

def sizeHint(coll: TraversableLike[_, _]): Unit

def sizeHint(size: Int): Unit

def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit

def slice(from: Int, until: Int): T

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

def sliding(size: Int): Iterator[T]

def sortBy[B](f: (V) ⇒ B)(implicit ord: Ordering[B]): T

def sortWith(lt: (V, V) ⇒ Boolean): T

def sorted[B >: V](implicit ord: Ordering[B]): T

def span(p: (V) ⇒ Boolean): (T, T)

def splitAt(n: Int): (T, T)

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

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

def stringPrefix: String

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

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

def tail: T

def tails: Iterator[T]

def take(n: Int): T

def takeRight(n: Int): T

def takeWhile(p: (V) ⇒ Boolean): T

def thisCollection: IndexedSeq[V]

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

def toArray: Array[V]

Translate this observable array to a regular array.

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

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

def toCollection(repr: T): IndexedSeq[V]

def toIndexedSeq: IndexedSeq[V]

def toIterable: Iterable[V]

def toIterator: Iterator[V]

def toList: List[V]

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

def toSeq: Seq[V]

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

def toStream: Stream[V]

def toString(): String

def toTraversable: Traversable[V]

def toVector: Vector[V]

def trimToSize(): Unit

Shrinks capacity to current length of data in this array.

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

def update(idx: Int, value: V): Unit

Set the element at idx in the array to value.

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

def view(from: Int, until: Int): IndexedSeqView[V, T]

def view: IndexedSeqView[V, T]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (V) ⇒ Boolean): FilterMonadic[V, T]

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

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

def zipWithIndex[A1 >: V, That](implicit bf: CanBuildFrom[T, (A1, Int), That]): That