scalafx-utils/src/main/scala/org/gerweck/scalafx/util/observable.scala

222 lines
6.7 KiB
Scala
Raw Normal View History

package org.gerweck.scalafx.util
import language.implicitConversions
import scalaz._
import scalafx.beans.property._
import scalafx.beans.value._
2015-08-15 09:09:45 +00:00
import scalafx.collections._
trait ObservableImplicits {
/* NOTE: (Sarah) I believe that the synchronization in these helpers is not
* _really_ required in the JavaFX threading model. However, the overhead of
* uncontended synchronization is relatively low, and typical UIs won't have
* enough change events for it to be a serious issue. (If you're updating
* a property in a tight loop, I expect you'll have bigger performance
* issues.)
*/
implicit val observableInstances = new Applicative[Observable] with Functor[Observable] with Monad[Observable] {
/* Map can be derived from `ap`, but this adds less overhead. */
override def map[A, B](a: Observable[A])(f: A => B): ObservableValue[B, B] = {
@inline def recalculate(): B = f(a.value)
val originalValue = recalculate()
val prop = ObjectProperty[B](originalValue)
var prevValue = originalValue
def changeHandler = prop.synchronized {
val newVal = recalculate()
if (prevValue != newVal) {
prop.value = recalculate()
prevValue = newVal
}
}
a onChange changeHandler
prop
}
def point[A](a: => A): ObservableValue[A, A] = {
ObjectProperty[A](a)
}
/* Ap can be derived from `point` and `bind`, but this has less overhead. */
override def ap[A, B](fa: => Observable[A])(f: => Observable[A => B]): ObservableValue[B, B] = {
@inline def recalculate(): B = (f.value)(fa.value)
val originalValue = recalculate()
val prop = ObjectProperty[B](originalValue)
var prevValue = originalValue
def changeHandler = prop.synchronized {
val newVal = recalculate()
if (prevValue != newVal) {
prop.value = newVal
prevValue = newVal
}
}
fa onChange changeHandler
f onChange changeHandler
prop
}
/* Aka `flatMap` */
override def bind[A, B](fa: Observable[A])(f: A => Observable[B]): ObservableValue[B, B] = {
join(map(fa)(f))
}
/* Aka `flatten` */
override def join[A](ooa: Observable[Observable[A]]): ObservableValue[A, A] = {
@inline def oa() = ooa.value
@inline def calc(): A = oa().value
val originalValue = calc()
val prop = ObjectProperty[A](originalValue)
var prevValue = originalValue
def innerHandle() = prop.synchronized {
val newVal = calc()
if (prevValue != newVal) {
prop.value = newVal
prevValue = newVal
}
}
var innerSub = oa() onChange innerHandle
var prevOuter = oa()
def outerHandle() = prop.synchronized {
val newOuter = oa()
/* We need reference equality here: we're subscribing to a specific object. */
if (prevOuter ne newOuter) {
innerSub.cancel()
innerSub = newOuter onChange innerHandle
prevOuter = newOuter
innerHandle()
}
}
ooa onChange outerHandle
prop
}
}
implicit def enrichObservable[A, B](o: ObservableValue[A, B]) = new RichObservable(o)
2015-08-15 10:48:14 +00:00
implicit def enrichObservableOfIterable[A, B <% Iterable[A]](ooi: ObservableValue[B, B]) = new ObservableOfIterable[A, B](ooi)
implicit def enrichObservableOfMapLike[A, B, C <% Iterable[(A, B)]](ooml: ObservableValue[C, C]) = new ObservableOfMapLike[A, B, C](ooml)
implicit def enrichProperty[A, B](o: Property[A, B]) = new RichProperty(o)
implicit def enrichTuple[A <: Product](a: A) = new RichTuple(a)
}
2015-08-15 09:18:37 +00:00
final class RichTuple[A <: Product](val self: A) extends AnyVal {
import shapeless._
import shapeless.ops.hlist._
/* It's possible to do this operation without conversion directly using
* Shapeless's `tuple` package, but it can't infer the exact output type,
* which is far less useful.
*/
def observe
[L <: HList, Unwrapped <: HList, Tupled <: Product]
(implicit tohl: Generic.Aux[A, L],
lister: ToTraversable.Aux[L, List, Observable[_]],
uw: Mapper.Aux[ObservableUnwrapper.type, L, Unwrapped],
tplr: Tupler.Aux[Unwrapped, Tupled]): ObservableValue[Tupled, Tupled] = {
val asHList: L = tohl.to(self)
def calculate(): Tupled = uw(asHList).tupled
val original = calculate()
val prop = ObjectProperty[Tupled](original)
for {
component <- asHList.to[List]
} {
component onChange {
prop.value = calculate()
}
}
prop
}
// def omap[B]
}
2015-08-15 09:18:37 +00:00
final class RichObservable[A, C](val self: ObservableValue[A, C]) extends AnyVal {
private type ObjObs[X] = ObservableValue[X, X]
@inline private def oapp = observableInstances
def map[B](f: A => B) = oapp.map(self)(f)
def flatMap[B](f: A => Observable[B]) = oapp.bind(self)(f)
2015-08-10 11:49:42 +00:00
def <*>[B](f: Observable[A => B]): ObservableValue[B, B] = oapp.ap(self)(f)
def tuple[B](f: Observable[B]): Observable[(A,B)] = oapp.tuple2(self, f)
final def *>[B](fb: ObjObs[B]): Observable[B] = oapp.apply2(self,fb)((_,b) => b)
final def <*[B](fb: ObjObs[B]): Observable[A] = oapp.apply2(self,fb)((a,_) => a)
final def |@|[B, B1](fb: ObservableValue[B, B1]) = ObservableTupler(self, fb)
/** Alias for `|@|` */
final def [B, B1](fb: ObservableValue[B, B1]) = |@|(fb)
}
2015-08-15 10:48:14 +00:00
final class ObservableOfIterable[A, B <% Iterable[A]](val self: ObservableValue[B, B]) {
def observeBuffer: ObservableBuffer[A] = {
2015-08-15 09:09:45 +00:00
val buff = ObservableBuffer(self.value.toSeq)
self onChange { (_, oldV, newV) => fillCollection(buff.delegate, newV) }
buff
}
2015-08-15 10:48:14 +00:00
def observeSet: ObservableSet[A] = {
val set = ObservableSet[A](self.value.toSet.toSeq: _*)
self onChange { (_, oldV, newV) =>
val newSet = newV.toSet
if (oldV.toSet != newSet) {
set.clear()
set ++= newSet
}
}
set
}
}
final class ObservableOfMapLike[A, B, C <% Iterable[(A, B)]](val self: ObservableValue[C, C]) {
def observeMap: ObservableMap[A, B] = {
val map = ObservableMap[A, B](self.value.toMap.toSeq: _*)
self onChange { (_, oldV, newV) =>
val newMap = newV.toMap
if (oldV.toMap != newV.toMap) {
map.clear()
map ++= newMap
}
}
map
}
2015-08-15 09:09:45 +00:00
}
2015-08-15 09:18:37 +00:00
final class RichProperty[A, B](val inner: Property[A, B]) extends AnyVal {
def biMap[B <: AnyRef](push: A => B, pull: B => A): ObjectProperty[B] = {
val original = push(inner.value)
val op = ObjectProperty[B](original)
inner onChange {
val oldVal = op.value
val newVal = push(inner.value)
if (oldVal != newVal) {
op.value = push(inner.value)
}
}
op onChange {
val oldVal = inner.value
val newVal = pull(op.value)
if (oldVal != newVal) {
inner.value = newVal
}
}
op
}
}