ReadBuffer
Related Doc:
package metarx
Channels: Value that is produced right after each value
Buffers: Current row after value
Row after value
Row after value
Row after value with the possibility of non-existence
Row after value with the possibility of non-existence
All elements are equal to value
At least one element is equal to value
Channels: Value that is produced right before each value
Buffers: Current row before value
Row before value
Row before value
Row before value with the possibility of non-existence
Row before value with the possibility of non-existence
Applies partial function f on each element; if the function is not
defined for the current input, it is filtered out
Applies partial function f on each element; if the function is not
defined for the current input, it is filtered out
Count number of occurrence of value.
Count number of occurrence of value.
Channels: With every matching element, the counter is increased.
,Buffers: When the element is removed, the counter is decreased.
Remove all elements from other
Remove all elements from other
Filters out (merges) duplicates
Filters out (merges) duplicates
Filters out duplicates
Filters out duplicates
Checks for existence of a value for which f is true
TODO Could this be implemented more efficiently without iterating over elements?
TODO Could this be implemented more efficiently without iterating over elements?
Only include elements for which f is true
Only include elements for which f is true
Returns first matching row; if it gets deleted, returns next match.
Returns first matching row; if it gets deleted, returns next match.
Finds first value for which f is true
Finds first value for which f is true
Applies f on each element and flatten its result into the stream
Applies f on each element and flatten its result into the stream
flatMap
Checks whether f is true for all elements
Iterates over all row values with the given function f
Iterates over all row values with the given function f
All rows as a native type
All rows as a native type
Stream contains at least one occurrence of value.
Stream contains at least one occurrence of value.
Channels: Once true, will never produce any other value.
,Buffers: When the item is removed, it will produce false.
Wraps first element in a channel
Wraps first element in a channel
Produce a value for the first row. If the list is empty, head does not produce any value. When the first row is deleted, the next row will be produced.
First element with the possibility of non-existence
First element with the possibility of non-existence
scala.Some with first row, or scala.None if the list is empty
Index of handle
Index of handle
Partial channels: Produce true if the current value is cleared.
,Channels: Produce false with the first received value.
,Buffers: Produce a new value once a row is added or removed.
Last element with the possibility of non-existence
Last element with the possibility of non-existence
scala.Some with first row, or scala.None if the list is empty
Unlike mapPure, stores mapping locally.
Unlike mapPure, stores mapping locally. This is currently needed as
widget objects are not immutable.
f must not be side-effecting
Negation of isEmpty
Partitions stream into two sub-stream
Partitions stream into two sub-stream
The left stream contains all elements for which f is true, all other
elements go to the right stream.
Partitions stream into two sub-stream
Partitions stream into two sub-stream
The left stream contains all elements for which f is true, all other
elements go to the right stream.
State channels: Produce when a new child is attached and if the size changes. In Opt the size is reset if the value is cleared.
,Channels: The size is only produced in response to each received value on the channel.
,Buffers: Produce the row count once a row is added or removed.
Splits stream into two sub-streams
Splits stream into two sub-streams
The left stream contains all elements as long as f is true, all
subsequent elements go to the right stream.
Split container into two sub-containers
Split container into two sub-containers
The left container contains all elements if f is true, all subsequent
elements go to the right container.
N-th row
N-th row