Github user kl0u commented on the issue:
https://github.com/apache/flink/pull/3390
I agree that the solution is temporary but the new version (with the richer
pattern support) could take some time. As for the sorting, we could have a
"pre-traversal" of the transitions, as you had in your previous version of this
PR.
It could be a separate method that copies the state transitions list and
sorts it on the `action` field (make the `StateTransition` comparable) before
the for-loop in the `computeNextStates`.
This is not the most efficient solution, as it creates copies and sorts
every time, but it is enough until we update the whole `NFA`/`NFACompiler`.
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
