| ... | @@ -565,7 +565,10 @@ fn renderExpression(r: *Render, node: Ast.Node.Index, space: Space) Error!void { | ... | @@ -565,7 +565,10 @@ fn renderExpression(r: *Render, node: Ast.Node.Index, space: Space) Error!void { |
| 565 | if (r.fixups.insert_parentheses.contains(node)) { | 565 | if (r.fixups.insert_parentheses.contains(node)) { |
| 566 | try renderExpression(r, rhs, .none); | 566 | try renderExpression(r, rhs, .none); |
| 567 | try ais.writeByte(')'); | 567 | try ais.writeByte(')'); |
| 568 | try renderOnlySpace(r, space); | 568 | const right_most_token = tree.lastToken(rhs); |
| | 569 | const lexeme = tokenSliceForRender(tree, right_most_token); |
| | 570 | // If our space was already .none, then the line below will be redundent as above handles it. |
| | 571 | if (space != .none) try renderSpace(r, right_most_token, lexeme.len, space); |
| 569 | } else { | 572 | } else { |
| 570 | try renderExpression(r, rhs, space); | 573 | try renderExpression(r, rhs, space); |
| 571 | } | 574 | } |