Hi, https://beam.apache.org/blog/2017/02/13/stateful-processing.html gives an example of assigning an arbitrary-but-consistent index to each element on a per key-and-window basis.
If the Stateful ParDo is applied on a Non-Keyed PCollection, say, PCollection<Row> with Fixed Windows, the state is maintained per window and every element in the window will be assigned a consistent index? Does this mean every element belonging to the window will be processed in a single DoFn Instance, which otherwise could have been done in multiple parallel instances, limiting performance? Similarly, How does Stateful ParDo behave on Bounded Non-Keyed PCollection? Thanks, Rahul
