class ObservableHashSet[T] extends AbstractSet[T] with ObservableSet[T]
scalafx.collections.ObservableSet implementation backed for a
HashSet
from Java Collection.
- Source
- ObservableSet.scala
- Alphabetic
- By Inheritance
- ObservableHashSet
- ObservableSet
- Observable
- SFXDelegate
- AbstractSet
- Set
- SetOps
- Shrinkable
- Builder
- Growable
- Clearable
- Cloneable
- Cloneable
- Iterable
- AbstractSet
- Set
- Equals
- SetOps
- Function1
- AbstractIterable
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new ObservableHashSet(delegate: javafx.collections.ObservableSet[T] = jfxc.FXCollections.observableSet(new ju.HashSet[T]))
- delegate
JavaFX ObservableSet instance to be wrapped by this class. By default it is a HashSet wrapped by observableSet method from FXCollections.
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def &(that: Set[T]): Set[T]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def &~(that: Set[T]): Set[T]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def ++(that: IterableOnce[T]): Set[T]
- Definition Classes
- SetOps
- Annotations
- @inline()
- final def ++[B >: T](suffix: IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- final def ++=(xs: IterableOnce[T]): ObservableHashSet.this.type
- Definition Classes
- Growable
- Annotations
- @inline()
- final def +=(elem: T): ObservableHashSet.this.type
- Definition Classes
- Growable
- Annotations
- @inline()
- final def --=(xs: IterableOnce[T]): ObservableHashSet.this.type
- Definition Classes
- Shrinkable
- Annotations
- @inline()
- final def -=(elem: T): ObservableHashSet.this.type
- Definition Classes
- Shrinkable
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def add(elem: T): Boolean
- Definition Classes
- SetOps
- def addAll(xs: IterableOnce[T]): ObservableHashSet.this.type
- Definition Classes
- Growable
- def addOne(elem: T): ObservableHashSet.this.type
Adds a single element to the set.
Adds a single element to the set.
- elem
the element to be added.
- returns
The
Set
itself
- Definition Classes
- ObservableSet → Growable
- final def addString(b: StringBuilder): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- IterableOnceOps
- def andThen[A](g: (Boolean) => A): (T) => A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- final def apply(elem: T): Boolean
- Definition Classes
- SetOps → Function1
- Annotations
- @inline()
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def canEqual(that: Any): Boolean
- Definition Classes
- Set → Equals
- def className: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- def clear(): Unit
Removes all elements from the
Set
.Removes all elements from the
Set
. After this operation has completed, theSet
will be empty.- Definition Classes
- ObservableSet → Builder → Clearable
- def clone(): Set[T]
- Definition Classes
- SetOps → Cloneable → AnyRef
- final def coll: ObservableHashSet.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[T, B]): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
- Definition Classes
- IterableOnceOps
- def compose[A](g: (A) => T): (A) => Boolean
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def concat(that: IterableOnce[T]): Set[T]
- Definition Classes
- SetOps
- def concat[B >: T](suffix: IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps
- def contains(elem: T): Boolean
Tests if some element is contained in this
Set
.Tests if some element is contained in this
Set
.- elem
the element to test for membership.
- returns
true
ifelem
is contained in thisSet
,false
otherwise.
- Definition Classes
- ObservableSet → SetOps
- def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: T](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def copyToArray[B >: T](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def corresponds[B](that: IterableOnce[B])(p: (T, B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: (T) => Boolean): Int
- Definition Classes
- IterableOnceOps
- val delegate: javafx.collections.ObservableSet[T]
JavaFX object to be wrapped.
JavaFX object to be wrapped.
- Definition Classes
- ObservableHashSet → SFXDelegate
- def diff(that: Set[T]): Set[T]
- Definition Classes
- SetOps → SetOps
- def drop(n: Int): Set[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropRight(n: Int): Set[T]
- Definition Classes
- IterableOps
- def dropWhile(p: (T) => Boolean): Set[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def empty: ObservableHashSet[T]
Generates a empty
ObservableSet
.Generates a empty
ObservableSet
.- returns
- Definition Classes
- ObservableSet → IterableFactoryDefaults → IterableOps
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- 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
- def exists(p: (T) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(pred: (T) => Boolean): Set[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def filterInPlace(p: (T) => Boolean): ObservableHashSet.this.type
- Definition Classes
- SetOps
- def filterNot(pred: (T) => Boolean): Set[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def find(p: (T) => Boolean): Option[T]
- Definition Classes
- IterableOnceOps
- def flatMap[B](f: (T) => IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: (T) => IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def fold[A1 >: T](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, T) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (T, B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: (T) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (T) => U): Unit
- Definition Classes
- IterableOnceOps
- def fromSpecific(coll: IterableOnce[T]): Set[T]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def groupBy[K](f: (T) => K): Map[K, Set[T]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (T) => K)(f: (T) => B): Map[K, Set[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (T) => K)(f: (T) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[Set[T]]
- Definition Classes
- IterableOps
- def hashCode(): Int
- returns
The delegate hashcode
- Definition Classes
- SFXDelegate → AnyRef → Any
- def head: T
- Definition Classes
- IterableOps
- def headOption: Option[T]
- Definition Classes
- IterableOps
- def init: Set[T]
- Definition Classes
- IterableOps
- def inits: Iterator[Set[T]]
- Definition Classes
- IterableOps
- def intersect(that: Set[T]): Set[T]
- Definition Classes
- SetOps
- def isEmpty: Boolean
- Definition Classes
- IterableOnceOps
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- val iterableFactory: IterableFactory[ObservableSet]
- Definition Classes
- ObservableSet → Set → Iterable → Set → Iterable → IterableOps
- def iterator: Iterator[T]
Creates a new iterator over elements of this set
Creates a new iterator over elements of this set
- Definition Classes
- ObservableSet → IterableOnce
- def knownSize: Int
- Definition Classes
- SetOps → Growable → IterableOnce
- def last: T
- Definition Classes
- IterableOps
- def lastOption: Option[T]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[T, B, ObservableHashSet.this.type]
- Definition Classes
- Iterable
- def map[B](f: (T) => B): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def mapResult[NewTo](f: (Set[T]) => NewTo): Builder[T, NewTo]
- Definition Classes
- Builder
- def max[B >: T](implicit ord: Ordering[B]): T
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: (T) => B)(implicit cmp: Ordering[B]): T
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: (T) => B)(implicit cmp: Ordering[B]): Option[T]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: T](implicit ord: Ordering[B]): Option[T]
- Definition Classes
- IterableOnceOps
- def min[B >: T](implicit ord: Ordering[B]): T
- Definition Classes
- IterableOnceOps
- def minBy[B](f: (T) => B)(implicit cmp: Ordering[B]): T
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: (T) => B)(implicit cmp: Ordering[B]): Option[T]
- Definition Classes
- IterableOnceOps
- def minOption[B >: T](implicit ord: Ordering[B]): Option[T]
- Definition Classes
- IterableOnceOps
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: Builder[T, Set[T]]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def onChange(op: => Unit): Subscription
Add a listener function to
Set
's changes.Add a listener function to
Set
's changes. This function will not handle thisSet
's modifications data.- op
No-argument function to be activated when some change in this
ObservableSet
was made.
- Definition Classes
- ObservableSet
- def onChange[J >: T](op: (ObservableSet[T], Change[J]) => Unit): Subscription
Add a listener function to
Set
's changes.Add a listener function to
Set
's changes. This function will handle this map's modifications data.- op
Function that will handle this
ObservableSet
's modifications data to be activated when some change was made.
- Definition Classes
- ObservableSet
- 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
- 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 frominvalidated
method fromInvalidationListener
.- 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
- def partition(p: (T) => Boolean): (Set[T], Set[T])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: (T) => Either[A1, A2]): (Set[A1], Set[A2])
- Definition Classes
- IterableOps
- def product[B >: T](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def reduce[B >: T](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: T](op: (B, T) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: T](op: (B, T) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: T](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: T](op: (T, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: T](op: (T, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def remove(elem: T): Boolean
- Definition Classes
- SetOps
- def result(): ObservableSet[T]
The result when this set is used as a builder
The result when this set is used as a builder
- Definition Classes
- ObservableSet → SetOps → Builder
- def reversed: Iterable[T]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- def scan[B >: T](z: B)(op: (B, B) => B): Set[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, T) => B): Set[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: (T, B) => B): Set[B]
- Definition Classes
- IterableOps
- def size: Int
- returns
This
Set
's size.
- Definition Classes
- ObservableSet → IterableOnceOps
- def sizeCompare(that: Iterable[_]): Int
- Definition Classes
- IterableOps
- def sizeCompare(otherSize: Int): Int
- Definition Classes
- IterableOps
- final def sizeHint(coll: IterableOnce[_], delta: Int): Unit
- Definition Classes
- Builder
- def sizeHint(size: Int): Unit
- Definition Classes
- Builder
- final def sizeHintBounded(size: Int, boundingColl: Iterable[_]): Unit
- Definition Classes
- Builder
- final def sizeIs: SizeCompareOps
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def slice(from: Int, until: Int): Set[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def sliding(size: Int, step: Int): Iterator[Set[T]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[Set[T]]
- Definition Classes
- IterableOps
- def span(p: (T) => Boolean): (Set[T], Set[T])
- Definition Classes
- IterableOps → IterableOnceOps
- def splitAt(n: Int): (Set[T], Set[T])
- Definition Classes
- IterableOps → IterableOnceOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[T, S]): S
- Definition Classes
- IterableOnce
- def stringPrefix: String
- Attributes
- protected[this]
- Definition Classes
- Set → Iterable
- def subsetOf(that: Set[T]): Boolean
- Definition Classes
- SetOps
- def subsets(): Iterator[Set[T]]
- Definition Classes
- SetOps
- def subsets(len: Int): Iterator[Set[T]]
- Definition Classes
- SetOps
- def subtractAll(xs: IterableOnce[T]): ObservableHashSet.this.type
- Definition Classes
- Shrinkable
- def subtractOne(elem: T): ObservableHashSet.this.type
Removes a single element from this mutable set.
Removes a single element from this mutable set.
- elem
the element to be removed.
- returns
The
Set
itself
- Definition Classes
- ObservableSet → Shrinkable
- def sum[B >: T](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tail: Set[T]
- Definition Classes
- IterableOps
- def tails: Iterator[Set[T]]
- Definition Classes
- IterableOps
- def take(n: Int): Set[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeRight(n: Int): Set[T]
- Definition Classes
- IterableOps
- def takeWhile(p: (T) => Boolean): Set[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def tapEach[U](f: (T) => U): Set[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def to[C1](factory: Factory[T, C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: T]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[T]
- Definition Classes
- IterableOnceOps
- final def toIterable: ObservableHashSet.this.type
- Definition Classes
- Iterable → IterableOps
- def toList: List[T]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: Seq[T]
- Definition Classes
- IterableOnceOps
- def toSet[B >: T]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
- returns
Returns the original delegate's
toString()
adding a[SFX]
prefix.
- Definition Classes
- SFXDelegate → AnyRef → Any
- def toVector: Vector[T]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: (T) => Iterable[B]): Set[Set[B]]
- Definition Classes
- IterableOps
- final def union(that: Set[T]): Set[T]
- Definition Classes
- SetOps
- Annotations
- @inline()
- def unzip[A1, A2](implicit asPair: (T) => (A1, A2)): (Set[A1], Set[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (T) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
- Definition Classes
- IterableOps
- def update(elem: T, included: Boolean): Unit
- Definition Classes
- SetOps
- def view: View[T]
- Definition Classes
- IterableOps
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def withFilter(p: (T) => Boolean): WithFilter[T, [_]Set[_]]
- Definition Classes
- IterableOps
- def zip[B](that: IterableOnce[B]): Set[(T, B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: T, B](that: Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: Set[(T, Int)]
- Definition Classes
- IterableOps → IterableOnceOps
- final def |(that: Set[T]): Set[T]
- Definition Classes
- SetOps
- Annotations
- @inline()
Deprecated Value Members
- def +(elem1: T, elem2: T, elems: T*): Set[T]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs
- def +(elem: T): Set[T]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Consider requiring an immutable Set or fall back to Set.union
- def ++:[B >: T](that: IterableOnce[B]): Set[B]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable
- final def +=(elem1: T, elem2: T, elems: T*): ObservableHashSet.this.type
- Definition Classes
- Growable
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
++=
akaaddAll
instead of varargs+=
; infix operations with an operand of multiple args will be deprecated
- def -(elem1: T, elem2: T, elems: T*): Set[T]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs
- def -(elem: T): Set[T]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Consider requiring an immutable Set or fall back to Set.diff
- def --(that: IterableOnce[T]): Set[T]
- Definition Classes
- SetOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Consider requiring an immutable Set
- def -=(elem1: T, elem2: T, elems: T*): ObservableHashSet.this.type
- Definition Classes
- Shrinkable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.3) Use
--=
akasubtractAll
instead of varargs-=
; infix operations with an operand of multiple args will be deprecated
- final def /:[B](z: B)(op: (B, T) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- final def :\[B](z: B)(op: (T, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
- def aggregate[B](z: => B)(seqop: (B, T) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregate
is not relevant for sequential collections. UsefoldLeft(z)(seqop)
instead.
- def companion: IterableFactory[[_]Set[_]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding() @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- final def copyToBuffer[B >: T](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= coll
instead
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- 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)
- final def repr: Set[T]
- 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
- final def retain(p: (T) => Boolean): Unit
- Definition Classes
- SetOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use filterInPlace instead
- def seq: ObservableHashSet.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- final def toIterator: Iterator[T]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- final def toStream: Stream[T]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[T]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use toIterable instead
- def view(from: Int, until: Int): View[T]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)
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 tojavafx.animation
.Example Usage
A basic ScalaFX application is created creating an object that is an instance of
JFXApp3
. Following Java FX theatre metaphor, it contains astage
that contains ascene
. Astage
roughly corresponds to a window in a typical UI environment. Thescene
holds UI content presented to the user. In the example below, the content is a pane with a singlelabel
component.