Skip to content
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

TreeOps: consistency for apply/infix lookalikes #3398

Merged
merged 1 commit into from
Dec 5, 2022

Conversation

kitbellew
Copy link
Collaborator

Use an equivalent rule for Pat.ExtractInfix as for Term.ApplyInfix; similarly, treat arguments to Init the same as Term.Apply.

Use an equivalent rule for Pat.ExtractInfix as for Term.ApplyInfix;
similarly, treat arguments to Init the same as Term.Apply.
@kitbellew kitbellew requested a review from tgodzik December 4, 2022 06:52
@@ -925,7 +925,8 @@ object a {
>>>
object a {
a match {
case foo bar (baz @ qux) =>
case foo bar (
Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

the break here is needed, as previous formatting exceeded maxColumn

@@ -1327,7 +1328,8 @@ object WrapperToHaveStatTestCaseParserWorking {
someInt = 5
) @annot3
@deprecated(value =
"bar") def bar2 = 1
"bar"
Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

break here is needed because of dangling parentheses setting, and consistent with the expression just above.

Copy link
Contributor

@tgodzik tgodzik left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LGTM!

@kitbellew kitbellew merged commit 1d711d4 into scalameta:master Dec 5, 2022
@kitbellew kitbellew deleted the 3398 branch December 5, 2022 17:48
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants