io.reactors.container.RFlatHashMap
AsMap
Returns the value associated with the specified key.
Incrementally collects and transforms elements on which the function is defined.
Incrementally collects and transforms elements on which the function is defined.
The partial function must be an injection.
Filters and maps the values for which the partial function is defined.
Filters and maps the values for which the partial function is defined.
Stream with the current number of elements satisfying a predicate.
Stream with the current number of elements satisfying a predicate.
Stream with boolean values indicating if some element satisfied a predicate.
Stream with boolean values indicating if some element satisfied a predicate.
Incrementally filters elements from the current container.
Incrementally filters elements from the current container.
Stream with boolean values indicating if all elements satisfy a predicate.
Stream with boolean values indicating if all elements satisfy a predicate.
Traverses the elements of the container.
Traverses the elements of the container.
Event stream with inserted elements.
Event stream with inserted elements.
Incrementally maps elements from the current container.
Incrementally maps elements from the current container.
Function f for the map must be an injection, that is, for any two elements
x and y that are not equal (x != y), f(x) **cannot be equal to** f(y).
Converts this map into a container of key-value pairs.
Converts this map into a container of key-value pairs.
Stream with the reduction of the current set of elements in this container.
Stream with the reduction of the current set of elements in this container.
Parameters op, inv and z must for an Abelian group, that is, z is the
neutral element, and inv is the inverse operation of op, in the sense that
inv(op(s, t), t) == op(inv(s, t), t) == s is always true.
Event stream with removed elements.
Event stream with removed elements.
Returns the number of elements in the container.
Returns the number of elements in the container.
Stream with the sizes of this container.
Stream with the sizes of this container.
Incrementally copies this container to another container type.
Incrementally copies this container to another container type.
Materializes another container, such that all the elements from this container are visible in the target container.
Users may call unsubscribe on the resulting container to stop incremental
updates. Losing the container and failing to call unsubscribe may result in a
time leak.
Creates a signal that is the fold of the elements in the container.
Creates a signal that is the fold of the elements in the container.
Neutral element z and the associative operator op must form a monoid.
Creates a signal that is the commutative fold of the elements in the container.
Creates a signal that is the commutative fold of the elements in the container.
Neutral element z and the commutative, associative operator op must for a
monoid.
Converts this reactive map into another reactive map.
Converts this reactive map into another reactive map.
Incrementally produces a union of the elements in the two containers.
Incrementally produces a union of the elements in the two containers.
This container combinator creates a subscription on the source combinators, so
calling unsubscribe will stop incremental updates.
Unsubscribes the container from its input event streams.
Unsubscribes the container from its input event streams.