Stores elements of an Abelian group.
Stores elements of an Abelian group.
Aggregation is computed incrementally using a binary operator and its inverse.
Stores elements that form a commutative monoid.
Stores elements that form a commutative monoid.
Elements are incrementally aggregated using a binary operator
that is associative and commutative. The value of the aggregation
can be accessed with the signal
method.
Stores elements of a monoid.
Stores elements of a monoid.
Incrementally computes an aggregation of the stored elements,
using a binary associative operator. The aggregation can be accessed
with the signal
method.
Reactive binary heap.
Reactive binary heap.
Exposes a signal head
, used to probe or subscribe to changes to
the first element in the heap.
type of the elements in the heap
Reactive catamorphs are containers that maintain the aggregation of their elements.
Reactive catamorphs are containers that maintain the aggregation of their elements.
type of the aggregation
type of the elements
Base class for reactive containers.
Base class for reactive containers.
Reactive container is a collection of elements that exposes event streams that emit events about incremental changes to the underlying containers.
Every reactive container has output event streams inserts
and removes
. When an
element is inserted or removed, these streams emit events. A container may also have
an input stream, which is not exposed, but may be unsubscribed from by calling
unsubscribe
. Finally, a container has a size
and foreach
methods. These basic
primitives are used to implement all other methods.
Other methods return event streams that generally emit the initial value after being
subscribed to. It is therefore legal to call toEmpty
on such event streams
and query them.
type of the elements in the container
A reactive hash map based on open addressing.
A reactive hash map based on open addressing.
Both type parameters are specialized. It is best to use this class when either both keys and values are primitives, or are both references.
type of the keys
type of the values
A reactive hash map.
A reactive hash map.
In addition to standard inserts
and removes
, and other container event streams,
reactive hash maps expose event streams with elements at specific keys.
type of the keys in the map, specialized
type of the values in the map, must be a reference parameter
A reactive hash matrix.
A reactive hash matrix.
type of the keys in the map, specialized
A reactive hash set.
A reactive hash set.
type of the elements in the set
Base class for reactive maps.
Base class for reactive maps.
Reactive map is a collection of pairs of elements that exposes event streams of map keys with hints that are values mapped to those keys.
type of the keys in the map
type of the values in the map
A reactive quad matrix.
A reactive quad matrix.
type of the keys in the map, specialized
Catamorph of signal values.
Catamorph of signal values.
Aggregates a bunch of signals using a regular catamorph. A regular catamorph aggregates a set of values of one type, and exposes a signal that is their aggregation. A signal catamorph aggregates a set of signals of some type, and exposes a signal that is the aggregation of the signals it contains. The difference is that when any of the signal values changes, the output signal also changes. This is not the case with a regular catamorph, which only updates itself when a value is inserted or removed.
Example:
Signal(1)--| +--Signal(3) Signal(2)--| -- after change -- Signal(3)--| +--Signal(5) -> updated! Signal(2)--|
type of values inside the signals