class ObservableHashMap[K, V] extends ObservableMap[K, V]
scalafx.collections.ObservableMap implementation backed for a
HashMap
from Java Collection.
- Source
- ObservableMap.scala
- Alphabetic
- By Inheritance
- ObservableHashMap
- ObservableMap
- Observable
- SFXDelegate
- Map
- MapLike
- Cloneable
- Cloneable
- Cloneable
- Shrinkable
- Builder
- Growable
- Clearable
- Map
- MapLike
- Subtractable
- PartialFunction
- Function1
- GenMap
- GenMapLike
- Iterable
- Iterable
- IterableLike
- Equals
- GenIterable
- GenIterableLike
- Traversable
- Mutable
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
ObservableHashMap(delegate: javafx.collections.ObservableMap[K, V] = ...)
- delegate
JavaFX
ObservableMap
instance to be wrapped by this class. By default it is aHashMap
wrapped byobservableMap
method fromFXCollections
.
Type Members
-
class
DefaultKeySet extends AbstractSet[K] with Set[K] with Serializable
- Attributes
- protected
- Definition Classes
- MapLike
-
class
DefaultValuesIterable extends AbstractIterable[V] with Iterable[V] with Serializable
- Attributes
- protected
- Definition Classes
- MapLike
-
class
FilteredKeys extends AbstractMap[K, V] with DefaultMap[K, V]
- Attributes
- protected
- Definition Classes
- MapLike
-
class
MappedValues[W] extends AbstractMap[K, W] with DefaultMap[K, W]
- Attributes
- protected
- Definition Classes
- MapLike
-
type
Self = ObservableMap[K, V]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
+[V1 >: V](elem1: (K, V1), elem2: (K, V1), elems: (K, V1)*): Map[K, V1]
- Definition Classes
- MapLike → MapLike
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
+
creates a new map. Use+=
to add an element to this map and return that map itself.
-
def
+[V1 >: V](kv: (K, V1)): Map[K, V1]
- Definition Classes
- MapLike → MapLike → GenMapLike
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
+
creates a new map. Use+=
to add an element to this map and return that map itself.
-
def
++[V1 >: V](xs: GenTraversableOnce[(K, V1)]): Map[K, V1]
- Definition Classes
- MapLike → MapLike
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
++
creates a new map. Use++=
to add an element to this map and return that map itself.
-
def
++[B >: (K, V), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[ObservableMap[K, V], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: (K, V), That](that: Traversable[B])(implicit bf: CanBuildFrom[ObservableMap[K, V], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: (K, V), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[ObservableMap[K, V], B, That]): That
- Definition Classes
- TraversableLike
-
def
++=(xs: TraversableOnce[(K, V)]): ObservableHashMap.this.type
- Definition Classes
- Growable
-
def
+=(kv: (K, V)): ObservableHashMap.this.type
Adds a new key/value pair to this
Map
.Adds a new key/value pair to this
Map
.- kv
the key/value pair.
- returns
The
ObservableMap
itself
- Definition Classes
- ObservableMap → MapLike → Builder → Growable
-
def
+=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): ObservableHashMap.this.type
- Definition Classes
- Growable
-
def
-(elem1: K, elem2: K, elems: K*): ObservableMap[K, V]
- Definition Classes
- MapLike → Subtractable
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
-
creates a new map. Use-=
to remove an element from this map and return that map itself.
-
def
-(key: K): ObservableMap[K, V]
- Definition Classes
- MapLike → MapLike → Subtractable → GenMapLike
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
-
creates a new map. Use-=
to remove an element from this map and return that map itself.
-
def
--(xs: GenTraversableOnce[K]): ObservableMap[K, V]
- Definition Classes
- MapLike → Subtractable
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
--
creates a new map. Use--=
to remove an element from this map and return that map itself.
-
def
--=(xs: TraversableOnce[K]): ObservableHashMap.this.type
- Definition Classes
- Shrinkable
-
def
-=(key: K): ObservableHashMap.this.type
Removes a key from this
Map
.Removes a key from this
Map
.- key
the key to be removed
- returns
The
ObservableMap
itself.
- Definition Classes
- ObservableMap → MapLike → Shrinkable
-
def
-=(elem1: K, elem2: K, elems: K*): ObservableHashMap.this.type
- Definition Classes
- Shrinkable
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- MapLike → TraversableOnce
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, (K, V)) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
andThen[C](k: (V) ⇒ C): PartialFunction[K, C]
- Definition Classes
- PartialFunction → Function1
-
def
apply(key: K): V
- Definition Classes
- MapLike → GenMapLike → Function1
-
def
applyOrElse[K1 <: K, V1 >: V](x: K1, default: (K1) ⇒ V1): V1
- Definition Classes
- MapLike → PartialFunction
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
canEqual(that: Any): Boolean
- Definition Classes
- IterableLike → Equals
-
def
clear(): Unit
Removes all elements from the
Map
.Removes all elements from the
Map
. After this operation has completed, theMap
will be empty.- Definition Classes
- ObservableMap → MapLike → Builder → Growable → Clearable
-
def
clone(): ObservableMap[K, V]
- Definition Classes
- MapLike → Cloneable → AnyRef
-
def
collect[B, That](pf: PartialFunction[(K, V), B])(implicit bf: CanBuildFrom[ObservableMap[K, V], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
companion: GenericCompanion[Iterable]
- Definition Classes
- Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
-
def
compose[A](g: (A) ⇒ K): (A) ⇒ V
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
contains(key: K): Boolean
- Definition Classes
- MapLike → GenMapLike
-
def
copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: (K, V)](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: (K, V)](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: ((K, V)) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
default(key: K): V
- Definition Classes
- MapLike → GenMapLike
-
val
delegate: javafx.collections.ObservableMap[K, V]
JavaFX object to be wrapped.
JavaFX object to be wrapped.
- Definition Classes
- ObservableHashMap → SFXDelegate
-
def
drop(n: Int): ObservableMap[K, V]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
dropRight(n: Int): ObservableMap[K, V]
- Definition Classes
- IterableLike
-
def
dropWhile(p: ((K, V)) ⇒ Boolean): ObservableMap[K, V]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
empty: ObservableHashMap[K, V]
The empty map of the same type as this
Map
.The empty map of the same type as this
Map
.- returns
An empty
ObservableMap
- Definition Classes
- ObservableMap → Map → Map → MapLike
-
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: ((K, V)) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: ((K, V)) ⇒ Boolean): ObservableMap[K, V]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterKeys(p: (K) ⇒ Boolean): Map[K, V]
- Definition Classes
- MapLike → GenMapLike
-
def
filterNot(p: ((K, V)) ⇒ Boolean): ObservableMap[K, V]
- Definition Classes
- MapLike → TraversableLike → GenTraversableLike
-
def
find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
flatMap[B, That](f: ((K, V)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[ObservableMap[K, V], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): Iterable[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: (K, V)](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
forall(p: ((K, V)) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: ((K, V)) ⇒ U): Unit
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
genericBuilder[B]: Builder[B, Iterable[B]]
- Definition Classes
- GenericTraversableTemplate
-
def
get(key: K): Option[V]
Optionally returns the value associated with a key.
Optionally returns the value associated with a key.
- key
the key value
- returns
an option value containing the value associated with key in this
Map
, or None if none exists.
- Definition Classes
- ObservableMap → MapLike → GenMapLike
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
getOrElse[V1 >: V](key: K, default: ⇒ V1): V1
- Definition Classes
- MapLike → GenMapLike
-
def
getOrElseUpdate(key: K, op: ⇒ V): V
- Definition Classes
- MapLike
-
def
groupBy[K](f: ((K, V)) ⇒ K): Map[K, ObservableMap[K, V]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): Iterator[ObservableMap[K, V]]
- Definition Classes
- IterableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
- returns
The delegate hashcode
- Definition Classes
- SFXDelegate → AnyRef → Any
-
def
head: (K, V)
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
headOption: Option[(K, V)]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
init: ObservableMap[K, V]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: Iterator[ObservableMap[K, V]]
- Definition Classes
- TraversableLike
-
def
isDefinedAt(key: K): Boolean
- Definition Classes
- MapLike → GenMapLike → PartialFunction
-
def
isEmpty: Boolean
- Definition Classes
- MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
iterator: Iterator[(K, V)]
Creates a new
Iterator
over all key/value pairs of thisObservableMap
.Creates a new
Iterator
over all key/value pairs of thisObservableMap
.- returns
The new
iterator
.
- Definition Classes
- ObservableMap → MapLike → IterableLike → GenIterableLike
-
def
keySet: Set[K]
- Definition Classes
- MapLike → GenMapLike
-
def
keys: Iterable[K]
- Definition Classes
- MapLike → GenMapLike
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
keys
returnsIterable[K]
rather thanIterator[K]
.
-
def
keysIterator: Iterator[K]
- Definition Classes
- MapLike → GenMapLike
-
def
last: (K, V)
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[(K, V)]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lift: (K) ⇒ Option[V]
- Definition Classes
- PartialFunction
-
def
map[B, That](f: ((K, V)) ⇒ B)(implicit bf: CanBuildFrom[ObservableMap[K, V], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
mapResult[NewTo](f: (ObservableMap[K, V]) ⇒ NewTo): Builder[(K, V), NewTo]
- Definition Classes
- Builder
-
def
mapValues[W](f: (V) ⇒ W): Map[K, W]
- Definition Classes
- MapLike → GenMapLike
-
def
max[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[(K, V), ObservableMap[K, V]]
- Attributes
- protected[this]
- Definition Classes
- MapLike → MapLike → TraversableLike → HasNewBuilder
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
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
Map
's changes.Add a listener function to
Map
's changes. This function will not handle thisMap
's modifications data.- op
No-argument function to be activated when some change in this
ObservableMap
was made.
- Definition Classes
- ObservableMap
-
def
onChange(op: (ObservableMap[K, V], Change[K, V]) ⇒ Unit): Subscription
Add a listener function to
Map
's changes.Add a listener function to
Map
's changes. This function will handle this map's modifications data.- op
Function that will handle this
ObservableMap
's modifications data to be activated when some change was made.
- Definition Classes
- ObservableMap
-
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
orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
-
def
par: ParMap[K, V]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[(K, V), ParMap[K, V]]
- Attributes
- protected[this]
- Definition Classes
- MapLike → MapLike → TraversableLike → Parallelizable
-
def
partition(p: ((K, V)) ⇒ Boolean): (ObservableMap[K, V], ObservableMap[K, V])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
product[B >: (K, V)](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
put(key: K, value: V): Option[V]
- Definition Classes
- MapLike
-
def
reduce[A1 >: (K, V)](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: (K, V)](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: (K, V)](op: ((K, V), B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
remove(key: K): Option[V]
- Definition Classes
- MapLike
-
def
repr: ObservableMap[K, V]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
result(): ObservableMap[K, V]
The result when this
Map
is used as a builder.The result when this
Map
is used as a builder.- Definition Classes
- ObservableMap → MapLike → Builder
-
def
retain(p: (K, V) ⇒ Boolean): ObservableHashMap.this.type
- Definition Classes
- MapLike
-
def
reversed: List[(K, V)]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
runWith[U](action: (V) ⇒ U): (K) ⇒ Boolean
- Definition Classes
- PartialFunction
-
def
sameElements[B >: (K, V)](that: GenIterable[B]): Boolean
- Definition Classes
- IterableLike → GenIterableLike
-
def
scan[B >: (K, V), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[ObservableMap[K, V], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, (K, V)) ⇒ B)(implicit bf: CanBuildFrom[ObservableMap[K, V], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: ((K, V), B) ⇒ B)(implicit bf: CanBuildFrom[ObservableMap[K, V], 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.
-
def
seq: Map[K, V]
- Definition Classes
- Map → Map → GenMap → GenMapLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
size: Int
This
Map
's size.This
Map
's size.- returns
This
Map
's size.
- Definition Classes
- ObservableMap → GenTraversableLike → TraversableOnce → GenTraversableOnce
-
def
sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
- Definition Classes
- Builder
-
def
sizeHint(coll: TraversableLike[_, _]): Unit
- Definition Classes
- Builder
-
def
sizeHint(size: Int): Unit
- Definition Classes
- Builder
-
def
sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
- Definition Classes
- Builder
-
def
sizeHintIfCheap: Int
- Attributes
- protected[collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): ObservableMap[K, V]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): Iterator[ObservableMap[K, V]]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): Iterator[ObservableMap[K, V]]
- Definition Classes
- IterableLike
-
def
span(p: ((K, V)) ⇒ Boolean): (ObservableMap[K, V], ObservableMap[K, V])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (ObservableMap[K, V], ObservableMap[K, V])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
stringPrefix: String
- Definition Classes
- MapLike → TraversableLike → GenTraversableLike
-
def
sum[B >: (K, V)](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: ObservableMap[K, V]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[ObservableMap[K, V]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): ObservableMap[K, V]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
takeRight(n: Int): ObservableMap[K, V]
- Definition Classes
- IterableLike
-
def
takeWhile(p: ((K, V)) ⇒ Boolean): ObservableMap[K, V]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
thisCollection: Iterable[(K, V)]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, V), Col[(K, V)]]): Col[(K, V)]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[E >: (K, V)]: Buffer[E]
- Definition Classes
- MapLike → TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: ObservableMap[K, V]): Iterable[(K, V)]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
def
toIndexedSeq: IndexedSeq[(K, V)]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[(K, V)]
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[(K, V)]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toList: List[(K, V)]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[(K, V), (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSeq: Seq[(K, V)]
- Definition Classes
- MapLike → MapLike → TraversableOnce → GenTraversableOnce
-
def
toSet[B >: (K, V)]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[(K, V)]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
-
def
toString(): String
- returns
Returns the original delegate's
toString()
adding a[SFX]
prefix.
- Definition Classes
- SFXDelegate → AnyRef → Any
-
def
toTraversable: Traversable[(K, V)]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[(K, V)]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transform(f: (K, V) ⇒ V): ObservableHashMap.this.type
- Definition Classes
- MapLike
-
def
transpose[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transpose
throws anIllegalArgumentException
if collections are not uniformly sized.
-
def
unzip[A1, A2](implicit asPair: ((K, V)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: ((K, V)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
- Definition Classes
- GenericTraversableTemplate
-
def
update(key: K, value: V): Unit
- Definition Classes
- MapLike
-
def
updated[V1 >: V](key: K, value: V1): Map[K, V1]
- Definition Classes
- MapLike → MapLike
-
def
values: Iterable[V]
- Definition Classes
- MapLike → GenMapLike
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
values
returnsIterable[V]
rather thanIterator[V]
.
-
def
valuesIterator: Iterator[V]
- Definition Classes
- MapLike → GenMapLike
-
def
view(from: Int, until: Int): IterableView[(K, V), ObservableMap[K, V]]
- Definition Classes
- IterableLike → TraversableLike
-
def
view: IterableView[(K, V), ObservableMap[K, V]]
- Definition Classes
- IterableLike → TraversableLike
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
withDefault(d: (K) ⇒ V): Map[K, V]
- Definition Classes
- Map
-
def
withDefaultValue(d: V): Map[K, V]
- Definition Classes
- Map
-
def
withFilter(p: ((K, V)) ⇒ Boolean): FilterMonadic[(K, V), ObservableMap[K, V]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
zip[A1 >: (K, V), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[ObservableMap[K, V], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipAll[B, A1 >: (K, V), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[ObservableMap[K, V], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipWithIndex[A1 >: (K, V), That](implicit bf: CanBuildFrom[ObservableMap[K, V], (A1, Int), That]): That
- Definition Classes
- IterableLike → GenIterableLike
Deprecated Value Members
-
def
/:[B](z: B)(op: (B, (K, V)) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
- Annotations
- @deprecated
- Deprecated
(Since version 2.12.10) Use foldLeft instead of /:
-
def
:\[B](z: B)(op: ((K, V), B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
- Annotations
- @deprecated
- Deprecated
(Since version 2.12.10) Use foldRight instead of :\
-
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.
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
JFXApp
. 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.