Simple streaming data structure for elements of type A and effects F
- Companion:
- object
Value members
Concrete methods
flatMap a Producer similar to how flatMap works on lists
flatMap a Producer similar to how flatMap works on lists
SPECIALIZED OPERATIONS BASED ON THE STREAM ELEMENTS
SPECIALIZED OPERATIONS BASED ON THE STREAM ELEMENTS
insert an element in between every element of the stream
insert an element in between every element of the stream
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
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
produce the first n elements + the remaining of the stream
produce the first n elements + the remaining of the stream
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
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
map with an effectful function and scan with a Monoid operation
map with an effectful function and scan with a Monoid operation
run a stateful function on each element and stream the new state
run a stateful function on each element and stream the new state
produce non overlapping windows of 'size' elements
produce non overlapping windows of 'size' elements
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
map the stream elements with a stateful and effectful function
map the stream elements with a stateful and effectful function
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)
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
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)
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
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
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