Simple streaming data structure for elements of type A and effects F
Attributes
- Companion:
- object
- Graph
- Supertypes
- trait Serializabletrait Producttrait Equalsclass Objecttrait Matchableclass Any
Members list
Value members
Concrete methods
run the stream and add a finalizer to run finally
run the stream and add a finalizer to run finally
Attributes
run the stream and add a finalizer to run finally
run the stream and add a finalizer to run finally
Attributes
attempt to run each effect of the stream
attempt to run each effect of the stream
Attributes
accumulate chunks of size n inside More nodes
accumulate chunks of size n inside More nodes
Attributes
flatMap a Producer similar to how flatMap works on lists
flatMap a Producer similar to how flatMap works on lists
Attributes
SPECIALIZED OPERATIONS BASED ON THE STREAM ELEMENTS
SPECIALIZED OPERATIONS BASED ON THE STREAM ELEMENTS
Attributes
run a stream with a Fold
run a stream with a Fold
Attributes
insert an element in between every element of the stream
insert an element in between every element of the stream
Attributes
run some state changes on each element and run an action on the last state
run some state changes on each element and run an action on the last state
Attributes
produce the next element if there is one + the remaining of the stream
produce the next element if there is one + the remaining of the stream
Attributes
produce the first n elements + the remaining of the stream
produce the first n elements + the remaining of the stream
Attributes
TRANSDUCER OPERATIONS
TRANSDUCER OPERATIONS
When it is easier to compose stream transformations
Attributes
map the stream elements with a stateful function returning a full stream Then run one last function based on the latest state
map the stream elements with a stateful function returning a full stream Then run one last function based on the latest state
Attributes
map the stream elements with a stateful and effectful function returning a full stream Then run one last function based on the latest state
map the stream elements with a stateful and effectful function returning a full stream Then run one last function based on the latest state
Attributes
scan with a semigroup operation
scan with a semigroup operation
Attributes
map and scan with a Monoid operation
map and scan with a Monoid operation
Attributes
map with an effectful function and scan with a Monoid operation
map with an effectful function and scan with a Monoid operation
Attributes
scan with a Monoid operation
scan with a Monoid operation
Attributes
scan with a semigroup operation
scan with a semigroup operation
Attributes
get the last element
get the last element
Attributes
get all the elements as a List
get all the elements as a List
Attributes
run a stateful function on each element and stream the new state
run a stateful function on each element and stream the new state
Attributes
scan without an initial state
scan without an initial state
Attributes
produce non overlapping windows of 'size' elements
produce non overlapping windows of 'size' elements
Attributes
map the stream elements with a stateful function and return the mapped elements
map the stream elements with a stateful function and return the mapped elements
Attributes
map the stream elements with a stateful and effectful function
map the stream elements with a stateful and effectful function
Attributes
zip 2 streams together
zip 2 streams together
Attributes
zip each element with its index in the stream
zip each element with its index in the stream
Attributes
zip each element with the next one in the stream (which will not exist for the last element)
zip each element with the next one in the stream (which will not exist for the last element)
Attributes
zip each element with the next n elements in the stream which will not exist for the last element, but we take as many elements to fill the "next" list as we can
zip each element with the next n elements in the stream which will not exist for the last element, but we take as many elements to fill the "next" list as we can
Attributes
zip each element with the previous one in the stream (which will not exist for the first element)
zip each element with the previous one in the stream (which will not exist for the first element)
Attributes
zip each element with the previous and next one in the stream (which will not exist for the first and last element
zip each element with the previous and next one in the stream (which will not exist for the first and last element
Attributes
zip each element with the previous and next N elements in the stream
zip each element with the previous and next N elements in the stream
Attributes
zip each element with the previous n elements in the stream which will not exist for the first element, but we take as many elements to fill the "previous" list as we can
zip each element with the previous n elements in the stream which will not exist for the first element, but we take as many elements to fill the "previous" list as we can
Attributes
zip each element with a running state computed from a function
zip each element with a running state computed from a function
Attributes
Inherited methods
Attributes
- Inherited from:
- Product
Attributes
- Inherited from:
- Product