Radeity commented on PR #14053: URL: https://github.com/apache/dolphinscheduler/pull/14053#issuecomment-1535930140
> I don't think this question is about branch prediction. > Since in any case, there are a total of N+M times `matcher.find()` before, now it becomes N. If only consider about matching times, i agree that use `forEach` only is more efficient, my point is that maybe original way can bring some other benefits, such as avoid branch prediction overhead. -- 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]
