Packages

  • package root

    ScalaFX is a UI DSL written within the Scala Language that sits on top of JavaFX 2.x and and JavaFX 8.

    ScalaFX is a UI DSL written within the Scala Language that sits on top of JavaFX 2.x and and JavaFX 8. This means that every ScalaFX application is also a valid Scala application. By extension it supports full interoperability with Java and can run anywhere the Java Virtual Machine (JVM) and JavaFX 2.0 or JavaFX 8 are supported.

    Package Structure

    ScalaFX package structure corresponds to JavaFX package structure, for instance scalafx.animation corresponds to javafx.animation.

    Example Usage

    A basic ScalaFX application is created creating an object that is an instance of JFXApp. Following Java FX theatre metaphor, it contains a stage that contains a scene. A stage roughly corresponds to a window in a typical UI environment. The scene holds UI content presented to the user. In the example below, the content is a pane with a single label component.

    package hello

import scalafx.application.JFXApp
import scalafx.application.JFXApp.PrimaryStage
import scalafx.geometry.Insets
import scalafx.scene.Scene
import scalafx.scene.control.Label
import scalafx.scene.layout.BorderPane

object HelloWorld extends JFXApp {
  stage = new PrimaryStage {
    title = "Hello"
    scene = new Scene {
      root = new BorderPane {
        padding = Insets(25)
        center = new Label("Hello World")
      }
    }
  }
}
    Definition Classes
    root
  • package scalafx

    Base package for ScalaFX classes.

    Base package for ScalaFX classes.

    Definition Classes
    root
  • package collections

    Wraps javafx.collections package, adding Scala's collections features to original JavaFX collections.

    Wraps javafx.collections package, adding Scala's collections features to original JavaFX collections.

    Definition Classes
    scalafx
  • package transformation
    Definition Classes
    collections
  • FilteredBuffer
  • SortedBuffer
  • TransformationBuffer
  • TransformationIncludes

class SortedBuffer[E] extends TransformationBuffer[E, E] with SFXDelegate[SortedList[E]]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SortedBuffer
  2. TransformationBuffer
  3. ObservableBufferBase
  4. ObservableBuffer
  5. Observable
  6. SFXDelegate
  7. Builder
  8. Buffer
  9. BufferLike
  10. Subtractable
  11. Scriptable
  12. Shrinkable
  13. Growable
  14. Clearable
  15. Seq
  16. SeqLike
  17. Cloneable
  18. Cloneable
  19. Cloneable
  20. Seq
  21. SeqLike
  22. GenSeq
  23. GenSeqLike
  24. PartialFunction
  25. Function1
  26. Iterable
  27. Iterable
  28. IterableLike
  29. Equals
  30. GenIterable
  31. GenIterableLike
  32. Traversable
  33. Mutable
  34. Traversable
  35. GenTraversable
  36. GenericTraversableTemplate
  37. TraversableLike
  38. GenTraversableLike
  39. Parallelizable
  40. TraversableOnce
  41. GenTraversableOnce
  42. FilterMonadic
  43. HasNewBuilder
  44. AnyRef
  45. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SortedBuffer(source: ObservableBuffer[E], lessThan: Function2[_ >: E, _ >: E, Boolean])
  2. new SortedBuffer(source: ObservableBuffer[E], ordering: Ordering[_ >: E])

    Constructs a new unordered SortedList wrapper around the source list.

    Constructs a new unordered SortedList wrapper around the source list.

    source

    the source list.

  3. new SortedBuffer(source: ObservableBuffer[E])

    Constructs a new unordered SortedList wrapper around the source list.

    Constructs a new unordered SortedList wrapper around the source list.

    source

    the source list.

  4. new SortedBuffer(delegate: SortedList[E])

Type Members

  1. type Self = ObservableBuffer[E]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++(xs: GenTraversableOnce[E]): ObservableBuffer[E]

    Creates a new ObservableBuffer containing both the elements of this Buffer and the provided traversable object.

    Creates a new ObservableBuffer containing both the elements of this Buffer and the provided traversable object. Overridden method to make it behave like a wrapped ObservableList. The new ObservableBuffer won't have Change and Invalidation Listeners from original Buffer.

    xs

    The traversable object.

    returns

    A new ObservableBuffer consisting of all the elements of this Buffer and xs. The new ObservableBuffer won't have Change and Invalidation Listeners from original Buffer.

    Definition Classes
    ObservableBuffer → BufferLike
  4. def ++[B >: E, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[ObservableBuffer[E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: E, That](that: Traversable[B])(implicit bf: CanBuildFrom[ObservableBuffer[E], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: E, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[ObservableBuffer[E], B, That]): That
    Definition Classes
    TraversableLike
  7. def ++=(xs: TraversableOnce[E]): SortedBuffer.this.type

    Adds all elements produced by a TraversableOnce to this ObservableBuffer.

    Adds all elements produced by a TraversableOnce to this ObservableBuffer. Overridden method to make it behave like a wrapped ObservableList.

    xs

    traversable object.

    returns

    The ObservableBuffer itself.

    Definition Classes
    ObservableBuffer → Growable
  8. def ++=:(xs: TraversableOnce[E]): SortedBuffer.this.type
    Definition Classes
    BufferLike
  9. def +:[B >: E, That](elem: B)(implicit bf: CanBuildFrom[ObservableBuffer[E], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  10. def +=(elem1: E, elem2: E, elems: E*): SortedBuffer.this.type

    Appends two or more elements to this ObservableBuffer.

    Appends two or more elements to this ObservableBuffer. Overridden method to make it behave like a wrapped ObservableList.

    elem1

    First element to add

    elem2

    Second element to add

    elems

    Other elements to add

    returns

    The ObservableBuffer itself.

    Definition Classes
    ObservableBuffer → Growable
  11. def +=(elem: E): SortedBuffer.this.type

    Appends a single element to this ObservableBuffer.

    Appends a single element to this ObservableBuffer. Overridden method to make it behave like a wrapped ObservableList.

    elem

    the element to add.

    returns

    The ObservableBuffer itself.

    Definition Classes
    ObservableBuffer → Builder → BufferLike → Growable
  12. def +=:(elem: E): SortedBuffer.this.type

    Prepends a single element to this buffer.

    Prepends a single element to this buffer. Overridden method to make it behave like a wrapped ObservableList.

    elem

    Element to prepend

    returns

    The ObservableBuffer itself.

    Definition Classes
    ObservableBuffer → BufferLike
  13. def -(elem1: E, elem2: E, elems: E*): ObservableBuffer[E]

    Creates a new collection with all the elements of this collection except the two or more specified elements.

    Creates a new collection with all the elements of this collection except the two or more specified elements. The new ObservableBuffer won't have Change and Invalidation Listeners from original Buffer.

    elem1

    First element to remove

    elem2

    Second element to remove

    elems

    Other elements to remove

    returns

    a new ObservableBuffer consisting of all the elements of this Buffer except elem1, elem2 and those in elems. The new ObservableBuffer won't have Change and Invalidation Listeners from original Buffer.

    Definition Classes
    ObservableBuffer → BufferLike → Subtractable
  14. def -(elem: E): ObservableBuffer[E]

    Creates a new ObservableBuffer with all the elements of this collection except elem.

    Creates a new ObservableBuffer with all the elements of this collection except elem. The new ObservableBuffer won't have Change and Invalidation Listeners from original Buffer.

    elem

    Element to remove

    returns

    A new ObservableBuffer consisting of all the elements of this Buffer except elem. The new ObservableBuffer won't have Change and Invalidation Listeners from original Buffer.

    Definition Classes
    ObservableBuffer → BufferLike → Subtractable
  15. def --(xs: GenTraversableOnce[E]): ObservableBuffer[E]

    Creates a new ObservableBuffer with all the elements of this Buffer except those provided by the specified traversable object.

    Creates a new ObservableBuffer with all the elements of this Buffer except those provided by the specified traversable object. The new ObservableBuffer won't have Change and Invalidation Listeners from original Buffer.

    xs

    The traversable object.

    returns

    A new ObservableBuffer with all the elements of this Buffer except those in xs. The new ObservableBuffer won't have Change and Invalidation Listeners from original Buffer.

    Definition Classes
    ObservableBuffer → BufferLike → Subtractable
  16. def --=(xs: TraversableOnce[E]): SortedBuffer.this.type

    Removes all elements produced by an iterator from this buffer.

    Removes all elements produced by an iterator from this buffer.

    xs

    the traversable object with elements to remove.

    returns

    The ObservableBuffer itself.

    Definition Classes
    ObservableBuffer → Shrinkable
  17. def -=(elem1: E, elem2: E, elems: E*): SortedBuffer.this.type

    Removes two or more elements from this ObservableBuffer.

    Removes two or more elements from this ObservableBuffer.

    elem1

    First element to remove

    elem2

    Second element to remove

    elems

    Other elements to remove

    returns

    The ObservableBuffer itself.

    Definition Classes
    ObservableBuffer → Shrinkable
  18. def -=(x: E): SortedBuffer.this.type
    Definition Classes
    BufferLike → Shrinkable
  19. def :+[B >: E, That](elem: B)(implicit bf: CanBuildFrom[ObservableBuffer[E], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  20. def :+=(elem: E): SortedBuffer.this.type

    Appends a single element to this buffer.

    Appends a single element to this buffer. Overridden method to make it behave like a wrapped ObservableList.

    elem

    Element to append

    returns

    The ObservableBuffer itself.

    Definition Classes
    ObservableBuffer
  21. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  22. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  23. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  24. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  25. def aggregate[B](z: ⇒ B)(seqop: (B, E) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  26. def andThen[C](k: (E) ⇒ C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  27. def append(elems: E*): Unit
    Definition Classes
    BufferLike
  28. def appendAll(xs: TraversableOnce[E]): Unit
    Definition Classes
    BufferLike
  29. def apply(n: Int): E

    Selects an element by its index in the buffer.

    Selects an element by its index in the buffer.

    n

    index

    returns

    Element at position n

    Definition Classes
    ObservableBuffer → BufferLike → SeqLike → GenSeqLike → Function1
  30. def applyOrElse[A1 <: Int, B1 >: E](x: A1, default: (A1) ⇒ B1): B1
    Definition Classes
    PartialFunction
  31. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  32. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  33. def clear(): Unit

    Clears the ObservableBuffer's contents.

    Clears the ObservableBuffer's contents. After this operation, the Buffer is empty.

    Definition Classes
    ObservableBuffer → Builder → BufferLike → Growable → Clearable
  34. def clone(): ObservableBuffer[E]
    Definition Classes
    BufferLike → Cloneable → AnyRef
  35. def collect[B, That](pf: PartialFunction[E, B])(implicit bf: CanBuildFrom[ObservableBuffer[E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  36. def collectFirst[B](pf: PartialFunction[E, B]): Option[B]
    Definition Classes
    TraversableOnce
  37. def combinations(n: Int): Iterator[ObservableBuffer[E]]
    Definition Classes
    SeqLike
  38. def companion: GenericCompanion[ObservableBuffer]

    The factory companion object that builds instances of class ObservableBuffer.

    The factory companion object that builds instances of class ObservableBuffer.

    Definition Classes
    ObservableBuffer → Buffer → Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  39. def comparator: ObjectProperty[Comparator[_ >: E]]

    The comparator that denotes the order of this SortedList.

  40. def comparator_[T >: E](lessThan: (T, T) ⇒ Boolean): Unit

    Creates and align new comparator value using provided comparison function lessThan.

    Creates and align new comparator value using provided comparison function lessThan.

    lessThan

    Comparison function that returns true if first element was lesser than second or false otherwise.

  41. def comparator_=(v: Ordering[_ >: E]): Unit
  42. def compose[A](g: (A) ⇒ Int): (A) ⇒ E
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  43. def contains[A1 >: E](elem: A1): Boolean
    Definition Classes
    SeqLike
  44. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  45. def copyToArray[B >: E](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  46. def copyToArray[B >: E](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  47. def copyToArray[B >: E](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  48. def copyToBuffer[B >: E](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  49. def corresponds[B](that: GenSeq[B])(p: (E, B) ⇒ Boolean): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  50. def count(p: (E) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  51. val delegate: SortedList[E]

    JavaFX object to be wrapped.

    JavaFX object to be wrapped.

    Definition Classes
    SortedBuffer → TransformationBuffer → ObservableBufferBase → ObservableBuffer → SFXDelegate
  52. def diff[B >: E](that: GenSeq[B]): ObservableBuffer[E]
    Definition Classes
    SeqLike → GenSeqLike
  53. def distinct: ObservableBuffer[E]
    Definition Classes
    SeqLike → GenSeqLike
  54. def drop(n: Int): ObservableBuffer[E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  55. def dropRight(n: Int): ObservableBuffer[E]
    Definition Classes
    IterableLike
  56. def dropWhile(p: (E) ⇒ Boolean): ObservableBuffer[E]
    Definition Classes
    TraversableLike → GenTraversableLike
  57. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  58. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  59. def equals(ref: Any): Boolean

    Verifies if a object is equals to this delegate.

    Verifies if a object is equals to this delegate.

    ref

    Object to be compared.

    returns

    if the other object is equals to this delegate or not.

    Definition Classes
    SFXDelegate → AnyRef → Any
  60. def exists(p: (E) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  61. def filter(p: (E) ⇒ Boolean): ObservableBuffer[E]
    Definition Classes
    TraversableLike → GenTraversableLike
  62. def filterNot(p: (E) ⇒ Boolean): ObservableBuffer[E]
    Definition Classes
    TraversableLike → GenTraversableLike
  63. def find(p: (E) ⇒ Boolean): Option[E]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  64. def flatMap[B, That](f: (E) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[ObservableBuffer[E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  65. def flatten[B](implicit asTraversable: (E) ⇒ GenTraversableOnce[B]): ObservableBuffer[B]
    Definition Classes
    GenericTraversableTemplate
  66. def fold[A1 >: E](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  67. def foldLeft[B](z: B)(op: (B, E) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  68. def foldRight[B](z: B)(op: (E, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  69. def forall(p: (E) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  70. def foreach[U](f: (E) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  71. def genericBuilder[B]: Builder[B, ObservableBuffer[B]]
    Definition Classes
    GenericTraversableTemplate
  72. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  73. def getSourceIndex(index: Int): Int

    Maps the index of this buffer's element to an index in the direct source buffer.

    Maps the index of this buffer's element to an index in the direct source buffer.

    index

    the index in this buffer

    returns

    the index of the element's origin in the source buffer.

    Definition Classes
    TransformationBuffer
  74. def getSourceIndexFor(buffer: ObservableBuffer[E], index: Int): Int

    Maps the index of this list's element to an index of the provided list.

    Maps the index of this list's element to an index of the provided list.

    Definition Classes
    TransformationBuffer
  75. def groupBy[K](f: (E) ⇒ K): Map[K, ObservableBuffer[E]]
    Definition Classes
    TraversableLike → GenTraversableLike
  76. def grouped(size: Int): Iterator[ObservableBuffer[E]]
    Definition Classes
    IterableLike
  77. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  78. def hashCode(): Int

    returns

    The delegate hashcode

    Definition Classes
    SFXDelegate → AnyRef → Any
  79. def head: E
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  80. def headOption: Option[E]
    Definition Classes
    TraversableLike → GenTraversableLike
  81. def indexOf[B >: E](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  82. def indexOf[B >: E](elem: B): Int
    Definition Classes
    GenSeqLike
  83. def indexOfSlice[B >: E](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  84. def indexOfSlice[B >: E](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  85. def indexWhere(p: (E) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  86. def indexWhere(p: (E) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  87. def indices: Range
    Definition Classes
    SeqLike
  88. def init: ObservableBuffer[E]
    Definition Classes
    TraversableLike → GenTraversableLike
  89. def inits: Iterator[ObservableBuffer[E]]
    Definition Classes
    TraversableLike
  90. def insert(n: Int, elems: E*): Unit
    Definition Classes
    BufferLike
  91. def insertAll(n: Int, elems: Traversable[E]): Unit

    Inserts new elements at a given index into this Buffer.

    Inserts new elements at a given index into this Buffer.

    n

    the index where new elements are inserted.

    elems

    the traversable collection containing the elements to insert.

    Definition Classes
    ObservableBuffer → BufferLike
  92. def intersect[B >: E](that: GenSeq[B]): ObservableBuffer[E]
    Definition Classes
    SeqLike → GenSeqLike
  93. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  94. def isEmpty: Boolean
    Definition Classes
    SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  95. def isInTransformationChain(buffer: ObservableBuffer[_]): Boolean

    Checks whether the provided list is in the chain under this TransformationList.

    Checks whether the provided list is in the chain under this TransformationList.

    Definition Classes
    TransformationBuffer
  96. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  97. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  98. def iterator: Iterator[E]

    Creates a new Iterator.

    Creates a new Iterator.

    Definition Classes
    ObservableBuffer → IterableLike → GenIterableLike
  99. def last: E
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def lastIndexOf[B >: E](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  101. def lastIndexOf[B >: E](elem: B): Int
    Definition Classes
    GenSeqLike
  102. def lastIndexOfSlice[B >: E](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  103. def lastIndexOfSlice[B >: E](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  104. def lastIndexWhere(p: (E) ⇒ Boolean, end: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  105. def lastIndexWhere(p: (E) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  106. def lastOption: Option[E]
    Definition Classes
    TraversableLike → GenTraversableLike
  107. def length: Int

    Length of this ObservableBuffer.

    Length of this ObservableBuffer.

    Definition Classes
    ObservableBuffer → BufferLike → SeqLike → GenSeqLike
  108. def lengthCompare(len: Int): Int
    Definition Classes
    SeqLike
  109. def lift: (Int) ⇒ Option[E]
    Definition Classes
    PartialFunction
  110. def map[B, That](f: (E) ⇒ B)(implicit bf: CanBuildFrom[ObservableBuffer[E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  111. def mapResult[NewTo](f: (ObservableBuffer[E]) ⇒ NewTo): Builder[E, NewTo]
    Definition Classes
    Builder
  112. def max[B >: E](implicit cmp: Ordering[B]): E
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def maxBy[B](f: (E) ⇒ B)(implicit cmp: Ordering[B]): E
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def min[B >: E](implicit cmp: Ordering[B]): E
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def minBy[B](f: (E) ⇒ B)(implicit cmp: Ordering[B]): E
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  120. def newBuilder: Builder[E, ObservableBuffer[E]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  121. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  122. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  123. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  124. def onChange[T1 >: E](op: ⇒ Unit): Subscription

    Add a listener function to list's changes.

    Add a listener function to list's changes. This function will not handle this buffer's modifications data.

    op

    No-argument function to be activated when some change in this ObservableBuffer was made.

    returns

    A subscription object

    Definition Classes
    ObservableBuffer
  125. def onChange[T1 >: E](op: (ObservableBuffer[E], Seq[Change[T1]]) ⇒ Unit): Subscription

    Add a listener function to list's changes.

    Add a listener function to list's changes. This function will handle this buffer's modifications data.

    op

    Function that will handle this ObservableBuffer's modifications data to be activated when some change was made.

    returns

    A subscription object

    Definition Classes
    ObservableBuffer
  126. def onInvalidate(op: ⇒ Unit): Subscription

    Adds a no argument function as a JavaFX InvalidationListener.

    Adds a no argument function as a JavaFX InvalidationListener. This function has no arguments because it will not handle invalidated values.

    op

    A Function with no arguments. It will be called when value was invalidated.

    returns

    A new scalafx.event.subscriptions.Subscription to remove JavaFX InvalidationListener.

    Definition Classes
    Observable
  127. def onInvalidate(op: (Observable) ⇒ Unit): Subscription

    Adds a function as a JavaFX InvalidationListener.

    Adds a function as a JavaFX InvalidationListener. This function has all arguments from invalidated method from InvalidationListener.

    op

    Function that receives a ScalaFX Observable. It will be called when value was invalidated.

    returns

    A new scalafx.event.subscriptions.Subscription to remove JavaFX InvalidationListener.

    Definition Classes
    Observable
  128. def orElse[A1 <: Int, B1 >: E](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  129. def padTo[B >: E, That](len: Int, elem: B)(implicit bf: CanBuildFrom[ObservableBuffer[E], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  130. def par: ParSeq[E]
    Definition Classes
    Parallelizable
  131. def parCombiner: Combiner[E, ParSeq[E]]
    Attributes
    protected[this]
    Definition Classes
    SeqLike → SeqLike → TraversableLike → Parallelizable
  132. def partition(p: (E) ⇒ Boolean): (ObservableBuffer[E], ObservableBuffer[E])
    Definition Classes
    TraversableLike → GenTraversableLike
  133. def patch[B >: E, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[ObservableBuffer[E], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  134. def permutations: Iterator[ObservableBuffer[E]]
    Definition Classes
    SeqLike
  135. def prefixLength(p: (E) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  136. def prepend(elems: E*): Unit
    Definition Classes
    BufferLike
  137. def prependAll(xs: TraversableOnce[E]): Unit
    Definition Classes
    BufferLike
  138. def product[B >: E](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def reduce[A1 >: E](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. def reduceLeft[B >: E](op: (B, E) ⇒ B): B
    Definition Classes
    TraversableOnce
  141. def reduceLeftOption[B >: E](op: (B, E) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  142. def reduceOption[A1 >: E](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. def reduceRight[B >: E](op: (E, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  144. def reduceRightOption[B >: E](op: (E, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  145. def remove(n: Int, count: Int): Unit

    Removes a number of elements from a given index position.

    Removes a number of elements from a given index position. Overridden method to make it behave like a wrapped ObservableList.

    Note: This method conflicts with method with same signature in ObservableList. There the arguments indicate a range of index of elements to be removed. Here the arguments indicate the first index of range and the quantity of elements to be removed. If you want a functionality equivalent to JavaFX ObservableList, use removeRange.

    n

    the index which refers to the first element to remove.

    count

    the number of elements to remove.

    Definition Classes
    ObservableBuffer → BufferLike
  146. def remove(n: Int): E

    Removes the element at a given index from this ObservableBuffer.

    Removes the element at a given index from this ObservableBuffer.

    n

    index the index of the element to be removed

    returns

    Removed element

    Definition Classes
    ObservableBuffer → BufferLike
  147. def removeRange(from: Int, to: Int): Unit

    Remove a range of elements.

    Remove a range of elements. Use this method if you want a functionality such as the method with same signature in ObservableList.

    from

    the start of the range to remove (inclusive)

    to

    the end of the range to remove (exclusive)

    Definition Classes
    ObservableBuffer
  148. def replaceAll(oldVal: E, newVal: E): Boolean

    Replace all oldVal elements in the list with newVal element.

    Replace all oldVal elements in the list with newVal element. Fires only one change notification on the list.

    oldVal

    The element that is going to be replace

    newVal

    The replacement

    returns

    true if the list was modified

    Definition Classes
    ObservableBuffer
  149. def repr: ObservableBuffer[E]
    Definition Classes
    TraversableLike → GenTraversableLike
  150. def result(): ObservableBuffer[E]

    Produces an ObservableBuffer from the added elements.

    Produces an ObservableBuffer from the added elements.

    Definition Classes
    ObservableBuffer → Builder
  151. def retainAll(elems: Iterable[E]): Unit

    Retains only the elements in this list that are contained in the specified collection.

    Retains only the elements in this list that are contained in the specified collection. In other words, removes from this list all the elements that are not contained in the specified collection.

    elems

    the traversable collection containing elements to be retained in this list

    Definition Classes
    ObservableBuffer
  152. def retainAll(elems: E*): Unit

    Retains only the elements in this list that are contained in the specified collection.

    Retains only the elements in this list that are contained in the specified collection. In other words, removes from this list all the elements that are not contained in the specified collection.

    elems

    the traversable collection containing elements to be retained in this list

    Definition Classes
    ObservableBuffer
  153. def reverse: ObservableBuffer[E]
    Definition Classes
    SeqLike → GenSeqLike
  154. def reverseIterator: Iterator[E]
    Definition Classes
    SeqLike
  155. def reverseMap[B, That](f: (E) ⇒ B)(implicit bf: CanBuildFrom[ObservableBuffer[E], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  156. def reversed: List[E]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  157. def runWith[U](action: (E) ⇒ U): (Int) ⇒ Boolean
    Definition Classes
    PartialFunction
  158. def sameElements[B >: E](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  159. def scan[B >: E, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[ObservableBuffer[E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  160. def scanLeft[B, That](z: B)(op: (B, E) ⇒ B)(implicit bf: CanBuildFrom[ObservableBuffer[E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  161. def scanRight[B, That](z: B)(op: (E, B) ⇒ B)(implicit bf: CanBuildFrom[ObservableBuffer[E], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  162. def segmentLength(p: (E) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  163. def seq: Seq[E]
    Definition Classes
    Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  164. def size: Int
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  165. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  166. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  167. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  168. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  169. def sizeHintIfCheap: Int
    Attributes
    protected[collection]
    Definition Classes
    GenTraversableOnce
  170. def slice(from: Int, until: Int): ObservableBuffer[E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  171. def sliding(size: Int, step: Int): Iterator[ObservableBuffer[E]]
    Definition Classes
    IterableLike
  172. def sliding(size: Int): Iterator[ObservableBuffer[E]]
    Definition Classes
    IterableLike
  173. def sort(lt: (E, E) ⇒ Boolean): Unit

    Sorts this ObservableBuffer using a Comparator function

    Sorts this ObservableBuffer using a Comparator function

    lt

    Comparator function that returns true if first element was lesser than second or false otherwise.

    Definition Classes
    ObservableBuffer
  174. def sort()(implicit typeTag: scala.reflect.api.JavaUniverse.WeakTypeTag[E]): Unit

    Sorts this ObservableBuffer if its type implements natural ordering.

    Sorts this ObservableBuffer if its type implements natural ordering. This type must be a java.util.Comparable subclass. Otherwise it will throws a IllegalStateException.

    typeTag

    information about if this type is a Comparable subclass or not.

    Definition Classes
    ObservableBuffer
  175. def sortBy[B](f: (E) ⇒ B)(implicit ord: Ordering[B]): ObservableBuffer[E]
    Definition Classes
    SeqLike
  176. def sortWith(lt: (E, E) ⇒ Boolean): ObservableBuffer[E]
    Definition Classes
    SeqLike
  177. def sorted[B >: E](implicit ord: Ordering[B]): ObservableBuffer[E]
    Definition Classes
    SeqLike
  178. def source: ObservableBuffer[_ <: E]

    The source list specified in the constructor of this transformation list.

    The source list specified in the constructor of this transformation list.

    Definition Classes
    TransformationBuffer
  179. def span(p: (E) ⇒ Boolean): (ObservableBuffer[E], ObservableBuffer[E])
    Definition Classes
    TraversableLike → GenTraversableLike
  180. def splitAt(n: Int): (ObservableBuffer[E], ObservableBuffer[E])
    Definition Classes
    TraversableLike → GenTraversableLike
  181. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  182. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  183. def stringPrefix: String
    Definition Classes
    BufferLike → TraversableLike → GenTraversableLike
  184. def sum[B >: E](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  185. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  186. def tail: ObservableBuffer[E]
    Definition Classes
    TraversableLike → GenTraversableLike
  187. def tails: Iterator[ObservableBuffer[E]]
    Definition Classes
    TraversableLike
  188. def take(n: Int): ObservableBuffer[E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  189. def takeRight(n: Int): ObservableBuffer[E]
    Definition Classes
    IterableLike
  190. def takeWhile(p: (E) ⇒ Boolean): ObservableBuffer[E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  191. def thisCollection: Seq[E]
    Attributes
    protected[this]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  192. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, E, Col[E]]): Col[E]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  193. def toArray[B >: E](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  194. def toBuffer[B >: E]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  195. def toCollection(repr: ObservableBuffer[E]): Seq[E]
    Attributes
    protected[this]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  196. def toIndexedSeq: IndexedSeq[E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  197. def toIterable: Iterable[E]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  198. def toIterator: Iterator[E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  199. def toList: List[E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  200. def toMap[T, U](implicit ev: <:<[E, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  201. def toSeq: Seq[E]
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  202. def toSet[B >: E]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  203. def toStream: Stream[E]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  204. def toString(): String

    returns

    Returns the original delegate's toString() adding a [SFX] prefix.

    Definition Classes
    SFXDelegate → AnyRef → Any
  205. def toTraversable: Traversable[E]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  206. def toVector: Vector[E]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  207. def transform(f: (E) ⇒ E): SortedBuffer.this.type
    Definition Classes
    SeqLike
  208. def transpose[B](implicit asTraversable: (E) ⇒ GenTraversableOnce[B]): ObservableBuffer[ObservableBuffer[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  209. def trimEnd(n: Int): Unit
    Definition Classes
    BufferLike
  210. def trimStart(n: Int): Unit
    Definition Classes
    BufferLike
  211. def union[B >: E, That](that: GenSeq[B])(implicit bf: CanBuildFrom[ObservableBuffer[E], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  212. def unzip[A1, A2](implicit asPair: (E) ⇒ (A1, A2)): (ObservableBuffer[A1], ObservableBuffer[A2])
    Definition Classes
    GenericTraversableTemplate
  213. def unzip3[A1, A2, A3](implicit asTriple: (E) ⇒ (A1, A2, A3)): (ObservableBuffer[A1], ObservableBuffer[A2], ObservableBuffer[A3])
    Definition Classes
    GenericTraversableTemplate
  214. def update(n: Int, newelem: E): Unit

    Replaces element at given index with a new value.

    Replaces element at given index with a new value.

    n

    the index of the element to replace.

    newelem

    new value to be positioned at position n.

    Definition Classes
    ObservableBuffer → BufferLike → SeqLike
  215. def updated[B >: E, That](index: Int, elem: B)(implicit bf: CanBuildFrom[ObservableBuffer[E], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  216. def view(from: Int, until: Int): SeqView[E, ObservableBuffer[E]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  217. def view: SeqView[E, ObservableBuffer[E]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  218. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  219. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  220. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  221. def withFilter(p: (E) ⇒ Boolean): FilterMonadic[E, ObservableBuffer[E]]
    Definition Classes
    TraversableLike → FilterMonadic
  222. def zip[A1 >: E, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[ObservableBuffer[E], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  223. def zipAll[B, A1 >: E, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[ObservableBuffer[E], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  224. def zipWithIndex[A1 >: E, That](implicit bf: CanBuildFrom[ObservableBuffer[E], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Deprecated Value Members

  1. def /:[B](z: B)(op: (B, E) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def :\[B](z: B)(op: (E, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\

  3. def <<(cmd: Message[E]): Unit
    Definition Classes
    BufferLike → Scriptable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) scripting is deprecated

  4. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated @deprecated
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from TransformationBuffer[E, E]

Inherited from ObservableBufferBase[E]

Inherited from ObservableBuffer[E]

Inherited from Observable

Inherited from SFXDelegate[SortedList[E]]

Inherited from Builder[E, ObservableBuffer[E]]

Inherited from Buffer[E]

Inherited from BufferLike[E, ObservableBuffer[E]]

Inherited from Subtractable[E, ObservableBuffer[E]]

Inherited from Scriptable[E]

Inherited from Shrinkable[E]

Inherited from Growable[E]

Inherited from Clearable

Inherited from Seq[E]

Inherited from SeqLike[E, ObservableBuffer[E]]

Inherited from Cloneable[ObservableBuffer[E]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Seq[E]

Inherited from SeqLike[E, ObservableBuffer[E]]

Inherited from GenSeq[E]

Inherited from GenSeqLike[E, ObservableBuffer[E]]

Inherited from PartialFunction[Int, E]

Inherited from (Int) ⇒ E

Inherited from Iterable[E]

Inherited from Iterable[E]

Inherited from IterableLike[E, ObservableBuffer[E]]

Inherited from Equals

Inherited from GenIterable[E]

Inherited from GenIterableLike[E, ObservableBuffer[E]]

Inherited from Traversable[E]

Inherited from Mutable

Inherited from Traversable[E]

Inherited from GenTraversable[E]

Inherited from GenericTraversableTemplate[E, ObservableBuffer]

Inherited from TraversableLike[E, ObservableBuffer[E]]

Inherited from GenTraversableLike[E, ObservableBuffer[E]]

Inherited from Parallelizable[E, ParSeq[E]]

Inherited from TraversableOnce[E]

Inherited from GenTraversableOnce[E]

Inherited from FilterMonadic[E, ObservableBuffer[E]]

Inherited from HasNewBuilder[E, ObservableBuffer[E]]

Inherited from AnyRef

Inherited from Any

Ungrouped