Progressively build a collection of events using the passed-in builder.
Progressively build a collection of events using the passed-in builder. A value containing the current version of the collection is notified for each incoming event.
Build a new Event by applying the given function to each value observed.
Build a new Event by applying the given function to each value
observed. Event values for which the partial function f does
not apply are dropped; other values are transformed by f.
The Event that stores the difference between successive updates to the parent event.
Build a new Event by keeping only those Event values that match
the predicate p.
Build a new Event by keeping only those Event values that match
the predicate p.
Build a new Event by incrementally accumulating over events,
starting with value z.
Build a new Event by incrementally accumulating over events,
starting with value z. Each intermediate aggregate is notified
to the derived event.
Join two events into a new Event which notifies a tuple of the last value in each underlying event.
Join two events into a new Event which notifies a tuple of the last value in each underlying event.
Build a new Event by transforming each new event value with f.
Build a new Event by transforming each new event value with f.
Merge two events; the resulting event interleaves events
from this and other.
Merge two events; the resulting event interleaves events
from this and other.
The Event which merges the events resulting from f applied
to each element in this Event.
The Event which merges the events resulting from f applied
to each element in this Event.
Patch up an Event of differences (like those produced by Event.diff) into an Event that reflects the current version of a data structure.
Patch up an Event of differences (like those produced by
Event.diff) into an Event that reflects the current
version of a data structure. That is: (event:
Event[CC[T]]).diff.patch is equivalent to event
Observe this event with function f.
Observe this event with function f. Equivalent to
register(Witness(f)).
Merge two Events of different types.
Merge two Events of different types.
Build a new Event representing a sliding window of at-most n.
Build a new Event representing a sliding window of at-most n.
Each event notified by the parent are added to a queue of size
at-most n. This queue is in turn notified to register of
the returned event.
An event which consists of the first howmany values
in the parent Event.
An event which consists of the first howmany values
in the parent Event.
A Future which is satisfied by the first value observed.
A Future which is satisfied by the first value observed.
Merge two event streams in lock-step, combining corresponding event values.
Merge two event streams in lock-step, combining corresponding event values.
This can be dangerous! Since the implementation needs to queue outstanding Event-values from the slower producer, if one Event outpaces another, this queue can grow in an unbounded fashion.
Abstract
Eventclass for Java compatibility.