Radeity commented on PR #14053: URL: https://github.com/apache/dolphinscheduler/pull/14053#issuecomment-1535916789
> If there are a total of `N` lines in the log, and `M` lines have yarn app id. Then the previous complexity is `O(N+M)`, and now is `O(N)`, WDYT? For such a streaming execution, i think complexity should be considered `O(N)`. Maybe we should compare the overhead brought from `N` more times regular matches with wrong branch prediction, i have no ideas which one is more efficient... -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
