| ... | @@ -510,11 +510,6 @@ fn renderExpression(r: *Render, node: Ast.Node.Index, space: Space) Error!void { | ... | @@ -510,11 +510,6 @@ fn renderExpression(r: *Render, node: Ast.Node.Index, space: Space) Error!void { |
| 510 | } | 510 | } |
| 511 | }, | 511 | }, |
| 512 | | 512 | |
| 513 | .add, | | |
| 514 | .add_wrap, | | |
| 515 | .add_sat, | | |
| 516 | .array_cat, | | |
| 517 | .array_mult, | | |
| 518 | .assign, | 513 | .assign, |
| 519 | .assign_bit_and, | 514 | .assign_bit_and, |
| 520 | .assign_bit_or, | 515 | .assign_bit_or, |
| ... | @@ -533,6 +528,25 @@ fn renderExpression(r: *Render, node: Ast.Node.Index, space: Space) Error!void { | ... | @@ -533,6 +528,25 @@ fn renderExpression(r: *Render, node: Ast.Node.Index, space: Space) Error!void { |
| 533 | .assign_mul, | 528 | .assign_mul, |
| 534 | .assign_mul_wrap, | 529 | .assign_mul_wrap, |
| 535 | .assign_mul_sat, | 530 | .assign_mul_sat, |
| | 531 | => { |
| | 532 | const infix = datas[node]; |
| | 533 | try renderExpression(r, infix.lhs, .space); |
| | 534 | const op_token = main_tokens[node]; |
| | 535 | try ais.pushIndent(.after_equals); |
| | 536 | if (tree.tokensOnSameLine(op_token, op_token + 1)) { |
| | 537 | try renderToken(r, op_token, .space); |
| | 538 | } else { |
| | 539 | try renderToken(r, op_token, .newline); |
| | 540 | } |
| | 541 | try renderExpression(r, infix.rhs, space); |
| | 542 | ais.popIndent(); |
| | 543 | }, |
| | 544 | |
| | 545 | .add, |
| | 546 | .add_wrap, |
| | 547 | .add_sat, |
| | 548 | .array_cat, |
| | 549 | .array_mult, |
| 536 | .bang_equal, | 550 | .bang_equal, |
| 537 | .bit_and, | 551 | .bit_and, |
| 538 | .bit_or, | 552 | .bit_or, |