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]]

Wraps a JavaFX SortedList.

Source
SortedBuffer.scala
Linear Supertypes
TransformationBuffer[E, E], ObservableBufferBase[E], ObservableBuffer[E], Observable, SFXDelegate[SortedList[E]], StrictOptimizedSeqOps[E, ObservableBuffer, ObservableBuffer[E]], StrictOptimizedIterableOps[E, ObservableBuffer, ObservableBuffer[E]], IndexedBuffer[E], IndexedSeq[E], IndexedSeqOps[E, [_]ObservableBuffer[_], ObservableBuffer[E]], IndexedSeq[E], IndexedSeqOps[E, [_]ObservableBuffer[_], ObservableBuffer[E]], AbstractBuffer[E], Buffer[E], Shrinkable[E], Growable[E], Clearable, AbstractSeq[E], Seq[E], SeqOps[E, [_]ObservableBuffer[_], ObservableBuffer[E]], Cloneable[ObservableBuffer[E]], Cloneable, Iterable[E], AbstractSeq[E], Seq[E], Equals, SeqOps[E, [_]ObservableBuffer[_], ObservableBuffer[E]], PartialFunction[Int, E], (Int) => E, AbstractIterable[E], Iterable[E], IterableFactoryDefaults[E, [x]ObservableBuffer[x]], IterableOps[E, [_]ObservableBuffer[_], ObservableBuffer[E]], IterableOnceOps[E, [_]ObservableBuffer[_], ObservableBuffer[E]], IterableOnce[E], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SortedBuffer
  2. TransformationBuffer
  3. ObservableBufferBase
  4. ObservableBuffer
  5. Observable
  6. SFXDelegate
  7. StrictOptimizedSeqOps
  8. StrictOptimizedIterableOps
  9. IndexedBuffer
  10. IndexedSeq
  11. IndexedSeqOps
  12. IndexedSeq
  13. IndexedSeqOps
  14. AbstractBuffer
  15. Buffer
  16. Shrinkable
  17. Growable
  18. Clearable
  19. AbstractSeq
  20. Seq
  21. SeqOps
  22. Cloneable
  23. Cloneable
  24. Iterable
  25. AbstractSeq
  26. Seq
  27. Equals
  28. SeqOps
  29. PartialFunction
  30. Function1
  31. AbstractIterable
  32. Iterable
  33. IterableFactoryDefaults
  34. IterableOps
  35. IterableOnceOps
  36. IterableOnce
  37. AnyRef
  38. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

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])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ++[B >: E](suffix: IterableOnce[B]): ObservableBuffer[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  4. final def ++:[B >: E](prefix: IterableOnce[B]): ObservableBuffer[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  5. final def ++=(xs: IterableOnce[E]): SortedBuffer.this.type
    Definition Classes
    Growable
    Annotations
    @inline()
  6. final def ++=:(elems: IterableOnce[E]): SortedBuffer.this.type
    Definition Classes
    Buffer
    Annotations
    @inline()
  7. final def +:[B >: E](elem: B): ObservableBuffer[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  8. final def +=(elem: E): SortedBuffer.this.type
    Definition Classes
    Growable
    Annotations
    @inline()
  9. final def +=:(elem: E): SortedBuffer.this.type
    Definition Classes
    Buffer
    Annotations
    @inline()
  10. 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
  11. def --(xs: IterableOnce[E]): ObservableBuffer[E]

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

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

    xs

    The iterable 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
  12. final def --=(xs: IterableOnce[E]): SortedBuffer.this.type
    Definition Classes
    Shrinkable
    Annotations
    @inline()
  13. 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
  14. final def -=(elem: E): SortedBuffer.this.type
    Definition Classes
    Shrinkable
    Annotations
    @inline()
  15. final def :+[B >: E](elem: B): ObservableBuffer[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  16. final def :++[B >: E](suffix: IterableOnce[B]): ObservableBuffer[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  17. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  18. def addAll(elem: E*): SortedBuffer.this.type

    A convenience method for var-arg addition of elements.

    A convenience method for var-arg addition of elements.

    elem

    elements the elements to add

    returns

    The ObservableBuffer itself.

    Definition Classes
    ObservableBuffer
  19. def addAll(xs: IterableOnce[E]): SortedBuffer.this.type

    Adds all elements produced by a IterableOnce to this ObservableBuffer.

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

    xs

    iterable object.

    returns

    The ObservableBuffer itself.

    Definition Classes
    ObservableBuffer → Growable
  20. def addOne(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 → Growable
  21. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  22. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  23. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  24. def andThen[C](k: PartialFunction[E, C]): PartialFunction[Int, C]
    Definition Classes
    PartialFunction
  25. def andThen[C](k: (E) => C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  26. final def append(elem: E): SortedBuffer.this.type
    Definition Classes
    Buffer
    Annotations
    @inline()
  27. final def appendAll(xs: IterableOnce[E]): SortedBuffer.this.type
    Definition Classes
    Buffer
    Annotations
    @inline()
  28. def appended[B >: E](elem: B): ObservableBuffer[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  29. def appendedAll[B >: E](suffix: IterableOnce[B]): ObservableBuffer[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  30. 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 → SeqOps → Function1
  31. def applyOrElse[A1 <: Int, B1 >: E](x: A1, default: (A1) => B1): B1
    Definition Classes
    PartialFunction
  32. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  33. def canEqual(that: Any): Boolean
    Definition Classes
    Seq → Equals
  34. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  35. def clear(): Unit

    Clears the ObservableBuffer's contents.

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

    Definition Classes
    ObservableBuffer → Clearable
  36. def clone(): ObservableBuffer[E]
    Definition Classes
    SeqOps → Cloneable → AnyRef
  37. final def coll: SortedBuffer.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  38. def collect[B](pf: PartialFunction[E, B]): ObservableBuffer[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  39. def collectFirst[B](pf: PartialFunction[E, B]): Option[B]
    Definition Classes
    IterableOnceOps
  40. def combinations(n: Int): Iterator[ObservableBuffer[E]]
    Definition Classes
    SeqOps
  41. def comparator: ObjectProperty[Comparator[_ >: E]]

    The comparator that denotes the order of this SortedList.

  42. 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.

  43. def comparator_=(v: Ordering[_ >: E]): Unit
  44. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, E]
    Definition Classes
    PartialFunction
  45. def compose[A](g: (A) => Int): (A) => E
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  46. final def concat[B >: E](suffix: IterableOnce[B]): ObservableBuffer[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  47. def contains[A1 >: E](elem: A1): Boolean
    Definition Classes
    SeqOps
  48. def containsSlice[B](that: Seq[B]): Boolean
    Definition Classes
    SeqOps
  49. def copyToArray[B >: E](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  50. def copyToArray[B >: E](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
  51. def copyToArray[B >: E](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
  52. def corresponds[B](that: Seq[B])(p: (E, B) => Boolean): Boolean
    Definition Classes
    SeqOps
  53. def corresponds[B](that: IterableOnce[B])(p: (E, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  54. def count(p: (E) => Boolean): Int
    Definition Classes
    IterableOnceOps
  55. val delegate: SortedList[E]

    JavaFX object to be wrapped.

    JavaFX object to be wrapped.

    Definition Classes
    SortedBuffer → TransformationBuffer → ObservableBufferBase → ObservableBuffer → SFXDelegate
  56. def diff[B >: E](that: Seq[B]): ObservableBuffer[E]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  57. def distinct: ObservableBuffer[E]
    Definition Classes
    SeqOps
  58. def distinctBy[B](f: (E) => B): ObservableBuffer[E]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  59. def drop(n: Int): ObservableBuffer[E]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  60. def dropInPlace(n: Int): SortedBuffer.this.type
    Definition Classes
    Buffer
  61. def dropRight(n: Int): ObservableBuffer[E]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  62. def dropRightInPlace(n: Int): SortedBuffer.this.type
    Definition Classes
    Buffer
  63. def dropWhile(p: (E) => Boolean): ObservableBuffer[E]
    Definition Classes
    IterableOps → IterableOnceOps
  64. def dropWhileInPlace(p: (E) => Boolean): SortedBuffer.this.type
    Definition Classes
    Buffer
  65. def elementWise: ElementWiseExtractor[Int, E]
    Definition Classes
    PartialFunction
  66. def empty: ObservableBuffer[E]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  67. def endsWith[B >: E](that: Iterable[B]): Boolean
    Definition Classes
    SeqOps
  68. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  69. 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
  70. def exists(p: (E) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  71. def filter(pred: (E) => Boolean): ObservableBuffer[E]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  72. def filterImpl(pred: (E) => Boolean, isFlipped: Boolean): ObservableBuffer[E]
    Attributes
    protected[collection]
    Definition Classes
    StrictOptimizedIterableOps
  73. def filterInPlace(p: (E) => Boolean): SortedBuffer.this.type
    Definition Classes
    IndexedBuffer
  74. def filterNot(pred: (E) => Boolean): ObservableBuffer[E]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  75. def find(p: (E) => Boolean): Option[E]
    Definition Classes
    IterableOnceOps
  76. def findLast(p: (E) => Boolean): Option[E]
    Definition Classes
    SeqOps
  77. def flatMap[B](f: (E) => IterableOnce[B]): ObservableBuffer[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  78. def flatMapInPlace(f: (E) => IterableOnce[E]): SortedBuffer.this.type
    Definition Classes
    IndexedBuffer
  79. def flatten[B](implicit toIterableOnce: (E) => IterableOnce[B]): ObservableBuffer[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  80. def fold[A1 >: E](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  81. def foldLeft[B](z: B)(op: (B, E) => B): B
    Definition Classes
    IterableOnceOps
  82. def foldRight[B](z: B)(op: (E, B) => B): B
    Definition Classes
    IterableOnceOps
  83. def forall(p: (E) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  84. def foreach[U](f: (E) => U): Unit
    Definition Classes
    IterableOnceOps
  85. def fromSpecific(coll: IterableOnce[E]): ObservableBuffer[E]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  86. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  87. 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
  88. 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
  89. def groupBy[K](f: (E) => K): Map[K, ObservableBuffer[E]]
    Definition Classes
    IterableOps
  90. def groupMap[K, B](key: (E) => K)(f: (E) => B): Map[K, ObservableBuffer[B]]
    Definition Classes
    IterableOps
  91. def groupMapReduce[K, B](key: (E) => K)(f: (E) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  92. def grouped(size: Int): Iterator[ObservableBuffer[E]]
    Definition Classes
    IterableOps
  93. def hashCode(): Int

    returns

    The delegate hashcode

    Definition Classes
    SFXDelegate → AnyRef → Any
  94. def head: E
    Definition Classes
    IterableOps
  95. def headOption: Option[E]
    Definition Classes
    IterableOps
  96. def indexOf[B >: E](elem: B): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexOf(elem, from) instead - indexOf(elem) calls indexOf(elem, 0)", "2.13.0")
  97. def indexOf[B >: E](elem: B, from: Int): Int
    Definition Classes
    SeqOps
  98. def indexOfSlice[B >: E](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexOfSlice(that, from) instead - indexOfSlice(that) calls indexOfSlice(that, 0)", "2.13.0")
  99. def indexOfSlice[B >: E](that: Seq[B], from: Int): Int
    Definition Classes
    SeqOps
  100. def indexWhere(p: (E) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexWhere(p, from) instead - indexWhere(p) calls indexWhere(p, 0)", "2.13.0")
  101. def indexWhere(p: (E) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  102. def indices: Range
    Definition Classes
    SeqOps
  103. def init: ObservableBuffer[E]
    Definition Classes
    IterableOps
  104. def inits: Iterator[ObservableBuffer[E]]
    Definition Classes
    IterableOps
  105. def insert(idx: Int, elem: E): Unit
    Definition Classes
    ObservableBuffer → Buffer
  106. def insertAll(n: Int, elems: IterableOnce[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 iterable collection containing the elements to insert.

    Definition Classes
    ObservableBuffer → Buffer
  107. def intersect[B >: E](that: Seq[B]): ObservableBuffer[E]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  108. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    SeqOps
  109. def isEmpty: Boolean
    Definition Classes
    SeqOps → IterableOnceOps
  110. 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
  111. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  112. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  113. val iterableFactory: SeqFactory[ObservableBuffer]
    Definition Classes
    ObservableBuffer → IndexedBuffer → IndexedSeq → IndexedSeq → Buffer → Seq → Iterable → Seq → Iterable → IterableOps
  114. def iterator: Iterator[E]

    Creates a new Iterator.

    Creates a new Iterator.

    Definition Classes
    ObservableBuffer → IndexedSeqOps → IterableOnce
  115. def knownSize: Int

    The number of elements in this collection.

    The number of elements in this collection.

    Definition Classes
    ObservableBuffer → IndexedSeqOps → Buffer → Growable → IterableOnce
  116. def last: E
    Definition Classes
    IndexedSeqOps → IterableOps
  117. def lastIndexOf[B >: E](elem: B, end: Int): Int
    Definition Classes
    SeqOps
  118. def lastIndexOfSlice[B >: E](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override lastIndexOfSlice(that, end) instead - lastIndexOfSlice(that) calls lastIndexOfSlice(that, Int.MaxValue)", "2.13.0")
  119. def lastIndexOfSlice[B >: E](that: Seq[B], end: Int): Int
    Definition Classes
    SeqOps
  120. def lastIndexWhere(p: (E) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override lastIndexWhere(p, end) instead - lastIndexWhere(p) calls lastIndexWhere(p, Int.MaxValue)", "2.13.0")
  121. def lastIndexWhere(p: (E) => Boolean, end: Int): Int
    Definition Classes
    SeqOps
  122. def lastOption: Option[E]
    Definition Classes
    IterableOps
  123. def lazyZip[B](that: Iterable[B]): LazyZip2[E, B, SortedBuffer.this.type]
    Definition Classes
    Iterable
  124. def length: Int

    Length of this ObservableBuffer.

    Length of this ObservableBuffer.

    Definition Classes
    ObservableBuffer → SeqOps
  125. final def lengthCompare(that: Iterable[_]): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  126. final def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  127. final def lengthIs: SizeCompareOps
    Definition Classes
    SeqOps
    Annotations
    @inline()
  128. def lift: (Int) => Option[E]
    Definition Classes
    PartialFunction
  129. def map[B](f: (E) => B): ObservableBuffer[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  130. def mapInPlace(f: (E) => E): SortedBuffer.this.type
    Definition Classes
    IndexedSeqOps
  131. def max[B >: E](implicit ord: Ordering[B]): E
    Definition Classes
    IterableOnceOps
  132. def maxBy[B](f: (E) => B)(implicit cmp: Ordering[B]): E
    Definition Classes
    IterableOnceOps
  133. def maxByOption[B](f: (E) => B)(implicit cmp: Ordering[B]): Option[E]
    Definition Classes
    IterableOnceOps
  134. def maxOption[B >: E](implicit ord: Ordering[B]): Option[E]
    Definition Classes
    IterableOnceOps
  135. def min[B >: E](implicit ord: Ordering[B]): E
    Definition Classes
    IterableOnceOps
  136. def minBy[B](f: (E) => B)(implicit cmp: Ordering[B]): E
    Definition Classes
    IterableOnceOps
  137. def minByOption[B](f: (E) => B)(implicit cmp: Ordering[B]): Option[E]
    Definition Classes
    IterableOnceOps
  138. def minOption[B >: E](implicit ord: Ordering[B]): Option[E]
    Definition Classes
    IterableOnceOps
  139. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  140. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  141. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  142. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  143. def newSpecificBuilder: Builder[E, ObservableBuffer[E]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  144. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
  145. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  146. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  147. def occCounts[B](sq: Seq[B]): Map[B, Int]
    Attributes
    protected[collection]
    Definition Classes
    SeqOps
  148. 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
  149. 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
  150. 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
  151. 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
  152. def orElse[A1 <: Int, B1 >: E](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  153. def padTo[B >: E](len: Int, elem: B): ObservableBuffer[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  154. def padToInPlace(len: Int, elem: E): SortedBuffer.this.type
    Definition Classes
    Buffer
  155. def partition(p: (E) => Boolean): (ObservableBuffer[E], ObservableBuffer[E])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  156. def partitionMap[A1, A2](f: (E) => Either[A1, A2]): (ObservableBuffer[A1], ObservableBuffer[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  157. def patch[B >: E](from: Int, other: IterableOnce[B], replaced: Int): ObservableBuffer[B]
    Definition Classes
    SeqOps
  158. def patchInPlace(from: Int, patch: IterableOnce[E], replaced: Int): SortedBuffer.this.type
    Definition Classes
    IndexedBuffer → Buffer
  159. def permutations: Iterator[ObservableBuffer[E]]
    Definition Classes
    SeqOps
  160. def prepend(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 → Buffer
  161. def prependAll(elems: IterableOnce[E]): SortedBuffer.this.type
    Definition Classes
    Buffer
  162. def prepended[B >: E](elem: B): ObservableBuffer[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  163. def prependedAll[B >: E](prefix: IterableOnce[B]): ObservableBuffer[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  164. def product[B >: E](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  165. def reduce[B >: E](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  166. def reduceLeft[B >: E](op: (B, E) => B): B
    Definition Classes
    IterableOnceOps
  167. def reduceLeftOption[B >: E](op: (B, E) => B): Option[B]
    Definition Classes
    IterableOnceOps
  168. def reduceOption[B >: E](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  169. def reduceRight[B >: E](op: (E, B) => B): B
    Definition Classes
    IterableOnceOps
  170. def reduceRightOption[B >: E](op: (E, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  171. 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 → Buffer
  172. 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 → Buffer
  173. 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
  174. 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
  175. 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 iterable collection containing elements to be retained in this list

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

    Retains only the provided elements.

    Retains only the provided elements. In other words, removes from this list all the elements that are not listed.

    elems

    the elements to be retained in this list

    Definition Classes
    ObservableBuffer
  177. def reverse: ObservableBuffer[E]
    Definition Classes
    IndexedSeqOps → SeqOps
  178. def reverseIterator: Iterator[E]
    Definition Classes
    IndexedSeqOps → SeqOps
  179. def reversed: Iterable[E]
    Attributes
    protected
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  180. def runWith[U](action: (E) => U): (Int) => Boolean
    Definition Classes
    PartialFunction
  181. def sameElements[B >: E](that: IterableOnce[B]): Boolean
    Definition Classes
    SeqOps
  182. def scan[B >: E](z: B)(op: (B, B) => B): ObservableBuffer[B]
    Definition Classes
    IterableOps
  183. def scanLeft[B](z: B)(op: (B, E) => B): ObservableBuffer[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  184. def scanRight[B](z: B)(op: (E, B) => B): ObservableBuffer[B]
    Definition Classes
    IterableOps
  185. def search[B >: E](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  186. def search[B >: E](elem: B)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  187. def segmentLength(p: (E) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  188. final def segmentLength(p: (E) => Boolean): Int
    Definition Classes
    SeqOps
  189. final def size: Int
    Definition Classes
    SeqOps → IterableOnceOps
  190. final def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    SeqOps → IterableOps
  191. final def sizeCompare(otherSize: Int): Int
    Definition Classes
    SeqOps → IterableOps
  192. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  193. def slice(from: Int, until: Int): ObservableBuffer[E]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  194. def sliceInPlace(start: Int, end: Int): SortedBuffer.this.type
    Definition Classes
    Buffer
  195. def sliding(size: Int, step: Int): Iterator[ObservableBuffer[E]]
    Definition Classes
    IterableOps
  196. def sliding(size: Int): Iterator[ObservableBuffer[E]]
    Definition Classes
    IterableOps
  197. 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
  198. 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
  199. def sortBy[B](f: (E) => B)(implicit ord: Ordering[B]): ObservableBuffer[E]
    Definition Classes
    SeqOps
  200. def sortInPlace[B >: E]()(implicit ord: Ordering[B]): SortedBuffer.this.type
    Definition Classes
    IndexedSeqOps
  201. def sortInPlaceBy[B](f: (E) => B)(implicit ord: Ordering[B]): SortedBuffer.this.type
    Definition Classes
    IndexedSeqOps
  202. def sortInPlaceWith(lt: (E, E) => Boolean): SortedBuffer.this.type
    Definition Classes
    IndexedSeqOps
  203. def sortWith(lt: (E, E) => Boolean): ObservableBuffer[E]
    Definition Classes
    SeqOps
  204. def sorted[B >: E](implicit ord: Ordering[B]): ObservableBuffer[E]
    Definition Classes
    SeqOps
  205. 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
  206. def span(p: (E) => Boolean): (ObservableBuffer[E], ObservableBuffer[E])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  207. def splitAt(n: Int): (ObservableBuffer[E], ObservableBuffer[E])
    Definition Classes
    IterableOps → IterableOnceOps
  208. def startsWith[B >: E](that: IterableOnce[B], offset: Int): Boolean
    Definition Classes
    SeqOps
  209. def stepper[S <: Stepper[_]](implicit shape: StepperShape[E, S]): S with EfficientSplit
    Definition Classes
    IndexedSeqOps → IterableOnce
  210. final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[E, B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  211. final def strictOptimizedConcat[B >: E, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  212. final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (E) => IterableOnce[B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  213. final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (E) => IterableOnce[B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  214. final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (E) => B): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  215. final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(E, B), C2]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  216. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    IndexedSeq → Seq → Iterable
  217. def subtractAll(xs: IterableOnce[E]): SortedBuffer.this.type
    Definition Classes
    ObservableBuffer → Shrinkable
  218. def subtractOne(x: E): SortedBuffer.this.type
    Definition Classes
    Buffer → Shrinkable
  219. def sum[B >: E](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  220. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  221. def tail: ObservableBuffer[E]
    Definition Classes
    IterableOps
  222. def tails: Iterator[ObservableBuffer[E]]
    Definition Classes
    IterableOps
  223. def take(n: Int): ObservableBuffer[E]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  224. def takeInPlace(n: Int): SortedBuffer.this.type
    Definition Classes
    Buffer
  225. def takeRight(n: Int): ObservableBuffer[E]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  226. def takeRightInPlace(n: Int): SortedBuffer.this.type
    Definition Classes
    Buffer
  227. def takeWhile(p: (E) => Boolean): ObservableBuffer[E]
    Definition Classes
    IterableOps → IterableOnceOps
  228. def takeWhileInPlace(p: (E) => Boolean): SortedBuffer.this.type
    Definition Classes
    Buffer
  229. def tapEach[U](f: (E) => U): ObservableBuffer[E]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  230. def to[C1](factory: Factory[E, C1]): C1
    Definition Classes
    IterableOnceOps
  231. def toArray[B >: E](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  232. final def toBuffer[B >: E]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  233. def toIndexedSeq: IndexedSeq[E]
    Definition Classes
    IterableOnceOps
  234. final def toIterable: SortedBuffer.this.type
    Definition Classes
    Iterable → IterableOps
  235. def toList: List[E]
    Definition Classes
    IterableOnceOps
  236. def toMap[K, V](implicit ev: <:<[E, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  237. def toSeq: Seq[E]
    Definition Classes
    IterableOnceOps
  238. def toSet[B >: E]: Set[B]
    Definition Classes
    IterableOnceOps
  239. def toString(): String

    returns

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

    Definition Classes
    SFXDelegate → AnyRef → Any
  240. def toVector: Vector[E]
    Definition Classes
    IterableOnceOps
  241. def transpose[B](implicit asIterable: (E) => Iterable[B]): ObservableBuffer[ObservableBuffer[B]]
    Definition Classes
    IterableOps
  242. def trimEnd(n: Int): Unit
    Definition Classes
    Buffer
  243. def trimStart(n: Int): Unit
    Definition Classes
    Buffer
  244. def unapply(a: Int): Option[E]
    Definition Classes
    PartialFunction
  245. def unzip[A1, A2](implicit asPair: (E) => (A1, A2)): (ObservableBuffer[A1], ObservableBuffer[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  246. def unzip3[A1, A2, A3](implicit asTriple: (E) => (A1, A2, A3)): (ObservableBuffer[A1], ObservableBuffer[A2], ObservableBuffer[A3])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  247. 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 → SeqOps
  248. def updated[B >: E](index: Int, elem: B): ObservableBuffer[B]
    Definition Classes
    SeqOps
  249. def view: IndexedSeqView[E]
    Definition Classes
    IndexedSeqOps → SeqOps → IterableOps
  250. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  251. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  252. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  253. def withFilter(p: (E) => Boolean): WithFilter[E, [_]ObservableBuffer[_]]
    Definition Classes
    IterableOps
  254. def zip[B](that: IterableOnce[B]): ObservableBuffer[(E, B)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  255. def zipAll[A1 >: E, B](that: Iterable[B], thisElem: A1, thatElem: B): ObservableBuffer[(A1, B)]
    Definition Classes
    IterableOps
  256. def zipWithIndex: ObservableBuffer[(E, Int)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps

Deprecated Value Members

  1. final def +=(elem1: E, elem2: E, elems: E*): SortedBuffer.this.type
    Definition Classes
    Growable
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use ++= (addAll) instead of varargs +=

  2. final def /:[B](z: B)(op: (B, E) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  3. final def :\[B](z: B)(op: (E, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  4. def aggregate[B](z: => B)(seqop: (B, E) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  5. final def append(elems: E*): SortedBuffer.this.type
    Definition Classes
    Buffer
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use appendAll instead

  6. def companion: IterableFactory[[_]ObservableBuffer[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding("Use iterableFactory instead", "2.13.0") @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  7. final def copyToBuffer[B >: E](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  8. 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.

  9. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  10. final def prefixLength(p: (E) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use segmentLength instead of prefixLength

  11. final def prepend(elems: E*): SortedBuffer.this.type
    Definition Classes
    Buffer
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use prependAll instead

  12. final def repr: ObservableBuffer[E]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  13. def reverseMap[B](f: (E) => B): ObservableBuffer[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)

  14. def seq: SortedBuffer.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  15. final def toIterator: Iterator[E]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  16. final def toStream: Stream[E]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  17. final def toTraversable: Traversable[E]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use toIterable instead

  18. final def transform(f: (E) => E): SortedBuffer.this.type
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use mapInPlace on an IndexedSeq instead

  19. final def union[B >: E](that: Seq[B]): ObservableBuffer[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use concat instead

  20. def view(from: Int, until: Int): IndexedSeqView[E]
    Definition Classes
    IndexedSeqOps → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Inherited from TransformationBuffer[E, E]

Inherited from ObservableBufferBase[E]

Inherited from ObservableBuffer[E]

Inherited from Observable

Inherited from SFXDelegate[SortedList[E]]

Inherited from StrictOptimizedSeqOps[E, ObservableBuffer, ObservableBuffer[E]]

Inherited from StrictOptimizedIterableOps[E, ObservableBuffer, ObservableBuffer[E]]

Inherited from IndexedBuffer[E]

Inherited from IndexedSeq[E]

Inherited from IndexedSeqOps[E, [_]ObservableBuffer[_], ObservableBuffer[E]]

Inherited from IndexedSeq[E]

Inherited from IndexedSeqOps[E, [_]ObservableBuffer[_], ObservableBuffer[E]]

Inherited from AbstractBuffer[E]

Inherited from Buffer[E]

Inherited from Shrinkable[E]

Inherited from Growable[E]

Inherited from Clearable

Inherited from AbstractSeq[E]

Inherited from Seq[E]

Inherited from SeqOps[E, [_]ObservableBuffer[_], ObservableBuffer[E]]

Inherited from Cloneable[ObservableBuffer[E]]

Inherited from Cloneable

Inherited from Iterable[E]

Inherited from AbstractSeq[E]

Inherited from Seq[E]

Inherited from Equals

Inherited from SeqOps[E, [_]ObservableBuffer[_], ObservableBuffer[E]]

Inherited from PartialFunction[Int, E]

Inherited from (Int) => E

Inherited from AbstractIterable[E]

Inherited from Iterable[E]

Inherited from IterableFactoryDefaults[E, [x]ObservableBuffer[x]]

Inherited from IterableOps[E, [_]ObservableBuffer[_], ObservableBuffer[E]]

Inherited from IterableOnceOps[E, [_]ObservableBuffer[_], ObservableBuffer[E]]

Inherited from IterableOnce[E]

Inherited from AnyRef

Inherited from Any

Ungrouped