-
Notifications
You must be signed in to change notification settings - Fork 3.2k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Simplify TRUE = expr
in filtering contexts
#33776
Merged
Merged
Changes from all commits
Commits
Show all changes
4 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -4107,8 +4107,27 @@ INNER JOIN ( | |
FROM [LevelTwo] AS [l0] | ||
) AS [l1] | ||
GROUP BY [l1].[Key] | ||
) AS [l2] ON [l].[Id] = [l2].[Key] AND CAST(1 AS bit) = CASE | ||
WHEN [l2].[Sum] > 10 THEN CAST(1 AS bit) | ||
) AS [l2] ON [l].[Id] = [l2].[Key] AND [l2].[Sum] > 10 | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. also add a test case for the opposite:
It will generate CASE for now, but it will be interesting to see what comes out of #33757 |
||
"""); | ||
} | ||
|
||
public override async Task Composite_key_join_on_groupby_aggregate_projecting_only_grouping_key2(bool async) | ||
{ | ||
await base.Composite_key_join_on_groupby_aggregate_projecting_only_grouping_key2(async); | ||
|
||
AssertSql( | ||
""" | ||
SELECT [l2].[Key] | ||
FROM [LevelOne] AS [l] | ||
INNER JOIN ( | ||
SELECT [l1].[Key], COALESCE(SUM([l1].[Id]), 0) AS [Sum] | ||
FROM ( | ||
SELECT [l0].[Id], [l0].[Id] % 3 AS [Key] | ||
FROM [LevelTwo] AS [l0] | ||
) AS [l1] | ||
GROUP BY [l1].[Key] | ||
) AS [l2] ON [l].[Id] = [l2].[Key] AND CAST(0 AS bit) = CASE | ||
WHEN [l2].[Sum] <= 10 THEN CAST(1 AS bit) | ||
ELSE CAST(0 AS bit) | ||
END | ||
"""); | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
maybe add a comment for the future reader why we do the optimization here rather than rely on OptimizeComparison.
Something like:
// Most optimizations are done in OptimizeComparison below, but this one benefits from being done early.
// Consider query: (x.NullableString == "Foo") == true
// We recursively visit Left and Right, but when processing the left side, allowOptimizedExpansion would be set to false (we only allow it to trickle down to child nodes for AndAlso & OrElse operations), so the comparison would get unnecessarily expanded. In order to avoid this, we would need to modify the allowOptimizedExpansion calculation to capture this scenario and then flow allowOptimizedExpansion to OptimizeComparison. Instead, we just do the optimization right away and the resulting code is clearer.