cloud-fan opened a new pull request, #54112: URL: https://github.com/apache/spark/pull/54112
### What changes were proposed in this pull request? This is a followup to #53658. Instead of recursively calling the entire `actualExprTransformer` to optimize new Not expressions created by De Morgan's Laws, this PR extracts a `simplifyNot` method that only handles Not simplification and calls itself recursively. ### Why are the changes needed? This is more efficient because: - We only apply the Not-specific simplifications (not the And/Or factor elimination logic) - We avoid the overhead of tree pattern matching and pruning checks - The recursion is more direct and focused ### Does this PR introduce _any_ user-facing change? No. ### How was this patch tested? Existing tests. ### Was this patch authored or co-authored using generative AI tooling? Yes. Made with [Cursor](https://cursor.com) -- 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] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
