EventImpl

final def !=(arg0: Any): Boolean

final def ##(): Int

final macro def &&(expression: (T) ⇒ Boolean)(implicit ticket: CreationTicket): Operators.Event[T]

Filters the event, only propagating the value when the filter is true.

final def +=(handler: (T) ⇒ Unit)(implicit ticket: CreationTicket): Disconnectable

Adds an observer.

final def ==(arg0: Any): Boolean

final def \[U](except: Operators.Event[U])(implicit ticket: CreationTicket): Operators.Event[T]

Propagates the event only when except does not fire.

final def and[U, R](other: Operators.Event[U])(merger: (T, U) ⇒ R)(implicit ticket: CreationTicket): Operators.Event[R]

Merge the event with the other, if both fire simultaneously.

final def apply(): Option[T]

Makes the enclosing reactive expression depend on the current value of the reactive.

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final macro def collect[U](expression: PartialFunction[T, U])(implicit ticket: CreationTicket): Operators.Event[U]

Collects the results from a partial function

def commit(base: Pulse[T]): Pulse[T]

def computePulse(rein: ReevTicket[State, Pulse[T]]): Pulse[T]

final def count()(implicit ticket: CreationTicket): Operators.Signal[Int]

Counts the occurrences of the event.

final def disconnect(): Unit

final def dropParam(implicit ticket: CreationTicket): Operators.Event[Unit]

Drop the event parameter; equivalent to map((_: Any) => ())

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final macro def filter(expression: (T) ⇒ Boolean)(implicit ticket: CreationTicket): Operators.Event[T]

Filters the event, only propagating the value when the filter is true.

final def flatten[R](implicit flatten: Operators.Flatten[Operators.Event[T], R]): R

Flattens the inner value.

final macro def fold[A](init: A)(op: (A, T) ⇒ A)(implicit ticket: CreationTicket): Operators.Signal[A]

Folds events with a given operation to create a Signal.

final def getClass(): Class[_]

def guardedReevaluate(rein: ReIn): Rout

def hashCode(): Int

val info: ReInfo

the name of the reactive, useful for debugging as it often contains positional information

def internalAccess(v: Pulse[T]): Pulse[T]

final def isInstanceOf[T0]: Boolean

final def iterate[A](init: A)(f: (A) ⇒ A)(implicit ticket: CreationTicket): Operators.Signal[A]

Applies a function on the current value of the signal every time the event occurs, starting with the init value before the first event occurrence

final def last[A >: T](n: Int)(implicit ticket: CreationTicket): Operators.Signal[LinearSeq[A]]

Returns a signal which holds the last n events in a list.

final def latest[A >: T]()(implicit ticket: CreationTicket): Operators.Signal[A]

returns a signal holding the latest value of the event.

final def latest[A >: T](init: A)(implicit ticket: CreationTicket): Operators.Signal[A]

returns a signal holding the latest value of the event.

final def latestOption[A >: T]()(implicit ticket: CreationTicket): Operators.Signal[Option[A]]

Holds the latest value of an event as an Option, None before the first event occured

final def list[A >: T]()(implicit ticket: CreationTicket): Operators.Signal[List[A]]

collects events resulting in a variable holding a list of all values.

final macro def map[A](expression: (T) ⇒ A)(implicit ticket: CreationTicket): Operators.Event[A]

Transform the event.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def observe(onValue: (T) ⇒ Unit, onError: (Throwable) ⇒ Unit = null, fireImmediately: Boolean = false)(implicit ticket: CreationTicket): Disconnectable

Add an observer.

def read(v: Value): Option[T]

Interprets the pulse of the event by converting to an option

final def recover[R >: T](onFailure: PartialFunction[Throwable, Option[R]])(implicit ticket: CreationTicket): Operators.Event[R]

Uses a partial function onFailure to recover an error carried by the event into a value when returning Some(value), or filters the error when returning None

final def reduce[A](reducer: (⇒ A, ⇒ T) ⇒ A)(implicit ticket: CreationTicket): Operators.Signal[A]

reduces events with a given reduce function to create a Signal

final def reevaluate(rein: ReIn): Rout

called if any of the dependencies (rescala.core.Core.ReSources) changed in the current update turn, after all (known) dependencies are updated

def resource: of[State, Option[T]]

val state: Operators.State[Pulse[T]]

the state passed by the scheduler

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def toggle[A](a: Operators.Signal[A], b: Operators.Signal[A])(implicit ticket: CreationTicket): Operators.Signal[A]

Switch back and forth between two signals on occurrence of event e

final def value: Option[T]

Makes the enclosing reactive expression depend on the current value of the reactive.

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

final def zip[U](other: Operators.Event[U])(implicit ticket: CreationTicket): Operators.Event[(T, U)]

Merge the event with the other into a tuple, if both fire simultaneously.

final def zipOuter[U](other: Operators.Event[U])(implicit ticket: CreationTicket): Operators.Event[(Option[T], Option[U])]

Merge the event with the other into a tuple, even if only one of them fired.

final def ||[U >: T](other: Operators.Event[U])(implicit ticket: CreationTicket): Operators.Event[U]

Events disjunction.

def finalize(): Unit