| ... | ... | @@ -5097,18 +5097,16 @@ fn structDeclInner( |
| 5097 | 5097 | const gpa = astgen.gpa; |
| 5098 | 5098 | const tree = astgen.tree; |
| 5099 | 5099 | |
| 5100 | | { |
| 5101 | | const is_tuple = for (container_decl.ast.members) |member_node| { |
| 5100 | is_tuple: { |
| 5101 | const tuple_field_node = for (container_decl.ast.members) |member_node| { |
| 5102 | 5102 | const container_field = tree.fullContainerField(member_node) orelse continue; |
| 5103 | | if (container_field.ast.tuple_like) break true; |
| 5104 | | } else false; |
| 5103 | if (container_field.ast.tuple_like) break member_node; |
| 5104 | } else break :is_tuple; |
| 5105 | 5105 | |
| 5106 | | if (is_tuple) { |
| 5107 | | if (node == 0) { |
| 5108 | | return astgen.failTok(0, "file cannot be a tuple", .{}); |
| 5109 | | } else { |
| 5110 | | return tupleDecl(gz, scope, node, container_decl, layout, backing_int_node); |
| 5111 | | } |
| 5106 | if (node == 0) { |
| 5107 | return astgen.failNode(tuple_field_node, "file cannot be a tuple", .{}); |
| 5108 | } else { |
| 5109 | return tupleDecl(gz, scope, node, container_decl, layout, backing_int_node); |
| 5112 | 5110 | } |
| 5113 | 5111 | } |
| 5114 | 5112 | |
Matthew Lugg <mlugg@mlugg.co.uk> 2025-02-24 14:37:18+00:00
lib