@data-vegle/rbxts-go 0.0.0-stage → 1.0.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +21 -0
- package/README.md +181 -2
- package/README.rbxtsgo.md +169 -0
- package/THIRD_PARTY_NOTICES.md +745 -0
- package/cli/cli.go +454 -0
- package/compile/compile.go +388 -0
- package/compile/declarations.go +221 -0
- package/compile/incremental.go +349 -0
- package/compile/times.go +9 -0
- package/docs/plugin-api.md +239 -0
- package/go.mod +20 -0
- package/go.sum +24 -0
- package/internal/difftest/difftest.go +530 -0
- package/internal/plugintest/plugintest.go +181 -0
- package/luau/create.go +351 -0
- package/luau/doc.go +71 -0
- package/luau/globals.go +178 -0
- package/luau/jsnum.go +188 -0
- package/luau/kinds.go +128 -0
- package/luau/list.go +227 -0
- package/luau/nodes.go +479 -0
- package/luau/operators.go +46 -0
- package/luau/render.go +134 -0
- package/luau/render_expressions.go +264 -0
- package/luau/render_fields.go +81 -0
- package/luau/render_indexable.go +81 -0
- package/luau/render_state.go +134 -0
- package/luau/render_statements.go +235 -0
- package/luau/render_util.go +296 -0
- package/luau/solve_temp_ids.go +212 -0
- package/luau/typeguards.go +175 -0
- package/luau/util.go +184 -0
- package/luau/visit.go +138 -0
- package/npm/index.d.ts +3 -0
- package/npm/rbxts-go.sh +187 -0
- package/package.json +45 -5
- package/patches/typescript/0001-checker-exports.patch +40 -0
- package/patches/typescript/0002-iterable-arity.patch +15 -0
- package/patches/typescript/0003-context-sensitive-this.patch +15 -0
- package/patches/typescript/0004-printer-keep-parse-tree-parentheses.patch +26 -0
- package/pluginapi/host.go +31 -0
- package/pluginapi/pluginapi.go +153 -0
- package/plugins/LICENSE-rbxts-transformer-setget +18 -0
- package/plugins/apply.go +342 -0
- package/plugins/config.go +431 -0
- package/plugins/fallback.go +84 -0
- package/plugins/fixemit.go +60 -0
- package/plugins/native.go +262 -0
- package/plugins/session.go +223 -0
- package/plugins/setget.go +478 -0
- package/project/copy.go +333 -0
- package/project/include/Promise.lua +2068 -0
- package/project/include/RuntimeLib.lua +260 -0
- package/project/nodepath/nodepath.go +917 -0
- package/project/pathtranslator/pathtranslator.go +214 -0
- package/project/project.go +498 -0
- package/project/rojoresolver/json.go +248 -0
- package/project/rojoresolver/rojoresolver.go +559 -0
- package/project/shared/constants.go +83 -0
- package/project/shared/diagnostic.go +238 -0
- package/project/shared/diagnostics.go +388 -0
- package/project/shared/elapsed.go +14 -0
- package/project/shared/eol_other.go +6 -0
- package/project/shared/eol_windows.go +4 -0
- package/project/shared/kleur.go +40 -0
- package/project/shared/util.go +183 -0
- package/scripts/build-with-plugins.sh +130 -0
- package/scripts/setup-third-party.sh +75 -0
- package/transformer/add_index_diagnostics.go +21 -0
- package/transformer/add_one_if_array_type.go +15 -0
- package/transformer/array_binding_pattern_contains_hoists.go +25 -0
- package/transformer/assert_never.go +24 -0
- package/transformer/assignment.go +64 -0
- package/transformer/call_macros.go +70 -0
- package/transformer/check_variable_hoist.go +125 -0
- package/transformer/clean_module_name.go +28 -0
- package/transformer/constructor_macros.go +122 -0
- package/transformer/convert_to_indexable_expression.go +12 -0
- package/transformer/create_binary_from_operator.go +86 -0
- package/transformer/create_continue_statements.go +68 -0
- package/transformer/create_get_service.go +15 -0
- package/transformer/create_hoist_declaration.go +27 -0
- package/transformer/create_import_expression.go +220 -0
- package/transformer/create_string_from_literal.go +195 -0
- package/transformer/create_truthiness_checks.go +63 -0
- package/transformer/create_type_check.go +9 -0
- package/transformer/ensure_transform_order.go +53 -0
- package/transformer/expression_chain.go +27 -0
- package/transformer/expression_might_mutate.go +60 -0
- package/transformer/find_constructor.go +15 -0
- package/transformer/fixup_whitespace_and_decode_entities.go +377 -0
- package/transformer/get_accessor_for_binding_type.go +160 -0
- package/transformer/get_add_iterable_to_array_builder.go +363 -0
- package/transformer/get_assignable_value.go +15 -0
- package/transformer/get_constant_value_literal.go +20 -0
- package/transformer/get_declared_variables.go +34 -0
- package/transformer/get_extends_node.go +23 -0
- package/transformer/get_flags.go +21 -0
- package/transformer/get_kind_name.go +18 -0
- package/transformer/get_original_symbol_of_node.go +16 -0
- package/transformer/get_source_file_from_module_specifier.go +68 -0
- package/transformer/get_statements.go +12 -0
- package/transformer/has_multiple_definitions.go +18 -0
- package/transformer/hoist_functions_past_final_statement.go +43 -0
- package/transformer/identifier_macros.go +17 -0
- package/transformer/is_blocked_by_try_statement.go +19 -0
- package/transformer/is_method.go +104 -0
- package/transformer/is_symbol_mutable.go +26 -0
- package/transformer/is_symbol_of_value.go +11 -0
- package/transformer/is_used_as_statement.go +25 -0
- package/transformer/is_valid_method_index_without_call.go +36 -0
- package/transformer/macro_manager.go +92 -0
- package/transformer/object_accessor.go +32 -0
- package/transformer/offset.go +58 -0
- package/transformer/pointer.go +53 -0
- package/transformer/property_call_macros.go +1035 -0
- package/transformer/state.go +606 -0
- package/transformer/transform_array_assignment_pattern.go +65 -0
- package/transformer/transform_array_binding_pattern.go +49 -0
- package/transformer/transform_array_literal_expression.go +97 -0
- package/transformer/transform_await_expression.go +12 -0
- package/transformer/transform_binary_expression.go +221 -0
- package/transformer/transform_binding_name.go +25 -0
- package/transformer/transform_block.go +14 -0
- package/transformer/transform_boolean_literal.go +13 -0
- package/transformer/transform_break_statement.go +26 -0
- package/transformer/transform_call_expression.go +266 -0
- package/transformer/transform_class_constructor.go +125 -0
- package/transformer/transform_class_declaration.go +12 -0
- package/transformer/transform_class_expression.go +14 -0
- package/transformer/transform_class_like_declaration.go +355 -0
- package/transformer/transform_conditional_expression.go +70 -0
- package/transformer/transform_continue_statement.go +30 -0
- package/transformer/transform_decorators.go +253 -0
- package/transformer/transform_delete_expression.go +17 -0
- package/transformer/transform_do_statement.go +39 -0
- package/transformer/transform_element_access_expression.go +114 -0
- package/transformer/transform_entity_name.go +21 -0
- package/transformer/transform_enum_declaration.go +135 -0
- package/transformer/transform_export_assignment.go +57 -0
- package/transformer/transform_export_declaration.go +150 -0
- package/transformer/transform_expression.go +120 -0
- package/transformer/transform_expression_statement.go +71 -0
- package/transformer/transform_for_of_statement.go +461 -0
- package/transformer/transform_for_statement.go +599 -0
- package/transformer/transform_function_declaration.go +84 -0
- package/transformer/transform_function_expression.go +48 -0
- package/transformer/transform_identifier.go +194 -0
- package/transformer/transform_if_statement.go +44 -0
- package/transformer/transform_import_declaration.go +146 -0
- package/transformer/transform_import_equals_declaration.go +46 -0
- package/transformer/transform_import_expression.go +36 -0
- package/transformer/transform_initializer.go +22 -0
- package/transformer/transform_interpolated_string_part.go +12 -0
- package/transformer/transform_jsx.go +41 -0
- package/transformer/transform_jsx_attributes.go +110 -0
- package/transformer/transform_jsx_children.go +50 -0
- package/transformer/transform_jsx_element.go +14 -0
- package/transformer/transform_jsx_expression.go +20 -0
- package/transformer/transform_jsx_fragment.go +42 -0
- package/transformer/transform_jsx_self_closing_element.go +13 -0
- package/transformer/transform_jsx_tag_name.go +53 -0
- package/transformer/transform_logical.go +160 -0
- package/transformer/transform_logical_or_coalescing_assignment_expression.go +103 -0
- package/transformer/transform_method_declaration.go +102 -0
- package/transformer/transform_module_declaration.go +143 -0
- package/transformer/transform_new_expression.go +27 -0
- package/transformer/transform_no_substitution_template_literal.go +16 -0
- package/transformer/transform_numeric_literal.go +15 -0
- package/transformer/transform_object_assignment_pattern.go +86 -0
- package/transformer/transform_object_binding_pattern.go +49 -0
- package/transformer/transform_object_literal_expression.go +107 -0
- package/transformer/transform_omitted_expression.go +9 -0
- package/transformer/transform_optional_chain.go +312 -0
- package/transformer/transform_parameters.go +124 -0
- package/transformer/transform_parenthesized_expression.go +17 -0
- package/transformer/transform_property_access_expression.go +37 -0
- package/transformer/transform_property_declaration.go +33 -0
- package/transformer/transform_property_name.go +20 -0
- package/transformer/transform_return_statement.go +83 -0
- package/transformer/transform_source_file.go +230 -0
- package/transformer/transform_spread_element.go +35 -0
- package/transformer/transform_statement.go +84 -0
- package/transformer/transform_statement_list.go +90 -0
- package/transformer/transform_string_literal.go +22 -0
- package/transformer/transform_super_keyword.go +9 -0
- package/transformer/transform_switch_statement.go +145 -0
- package/transformer/transform_tagged_template_expression.go +34 -0
- package/transformer/transform_template_expression.go +35 -0
- package/transformer/transform_this_expression.go +33 -0
- package/transformer/transform_throw_statement.go +18 -0
- package/transformer/transform_try_statement.go +192 -0
- package/transformer/transform_type_expression.go +12 -0
- package/transformer/transform_unary_expression.go +79 -0
- package/transformer/transform_variable_statement.go +178 -0
- package/transformer/transform_void_expression.go +13 -0
- package/transformer/transform_while_statement.go +34 -0
- package/transformer/transform_writable.go +69 -0
- package/transformer/transform_yield_expression.go +56 -0
- package/transformer/type_guards.go +30 -0
- package/transformer/types.go +381 -0
- package/transformer/validate_identifier.go +17 -0
- package/transformer/validate_method_assignment.go +106 -0
- package/transformer/validate_not_any.go +37 -0
- package/transformer/wrap_expression_statement.go +20 -0
- package/transformer/wrap_return_if_lua_tuple.go +63 -0
- package/transformer/wrap_statements_as_generator.go +22 -0
- package/tsbridge/affected.go +141 -0
- package/tsbridge/config.go +71 -0
- package/tsbridge/diagnostics.go +128 -0
- package/tsbridge/doc.go +16 -0
- package/tsbridge/macros.go +207 -0
- package/tsbridge/macrospec.go +30 -0
- package/tsbridge/pool.go +142 -0
- package/tsbridge/project.go +137 -0
- package/tsbridge/reprint.go +99 -0
- package/tsbridge/update.go +128 -0
- package/watch/poll.go +126 -0
- package/watch/session.go +651 -0
- package/watch/watch.go +180 -0
|
@@ -0,0 +1,478 @@
|
|
|
1
|
+
package plugins
|
|
2
|
+
|
|
3
|
+
// Port of out/transformer.js and out/util.js from rbxts-transformer-setget@2.0.0, which ships compiled, on the Go AST.
|
|
4
|
+
// Copyright (c) 2020, wAD4444, ISC license. The notice is in LICENSE-rbxts-transformer-setget next to this file.
|
|
5
|
+
//
|
|
6
|
+
// Keep the plugin's quirks: its output is what JS rbxtsc compiles. Most of them look like bugs, and they're on purpose
|
|
7
|
+
// here: `y = o.x` becomes `o.__setx(o.__getx())` when x has a setter, because visitBinaryExpression takes the first
|
|
8
|
+
// property access anywhere under the expression. A postfix operator reuses the untransformed object expression. Each
|
|
9
|
+
// compound assignment evaluates the object twice. See docs/setget.md.
|
|
10
|
+
|
|
11
|
+
import (
|
|
12
|
+
"strings"
|
|
13
|
+
|
|
14
|
+
"github.com/microsoft/TypeScript/tsc/internal/ast"
|
|
15
|
+
"github.com/microsoft/TypeScript/tsc/internal/checker"
|
|
16
|
+
"github.com/microsoft/TypeScript/tsc/internal/printer"
|
|
17
|
+
"github.com/microsoft/TypeScript/tsc/internal/scanner"
|
|
18
|
+
"github.com/microsoft/TypeScript/tsc/rbxtsgo/project/shared"
|
|
19
|
+
)
|
|
20
|
+
|
|
21
|
+
const (
|
|
22
|
+
defaultPrefix = "__"
|
|
23
|
+
setterPrefix = "set"
|
|
24
|
+
getterPrefix = "get"
|
|
25
|
+
)
|
|
26
|
+
|
|
27
|
+
// transformContext is TransformContext, for one file. Checker is nil when no property access in the file can be an
|
|
28
|
+
// accessor, because then nothing asks it.
|
|
29
|
+
type transformContext struct {
|
|
30
|
+
file *ast.SourceFile
|
|
31
|
+
emit *printer.EmitContext
|
|
32
|
+
factory *printer.NodeFactory
|
|
33
|
+
visitor *ast.NodeVisitor
|
|
34
|
+
checker *checker.Checker
|
|
35
|
+
prefix string
|
|
36
|
+
names *accessorNames
|
|
37
|
+
}
|
|
38
|
+
|
|
39
|
+
// pluginExit is process.exit(1) after writeLine: it unwinds out of the transform of the first file that hits it.
|
|
40
|
+
type pluginExit struct{ lines []string }
|
|
41
|
+
|
|
42
|
+
func newTransformContext(file *ast.SourceFile, c *checker.Checker, prefix string, names *accessorNames) *transformContext {
|
|
43
|
+
return newTransformContextIn(printer.NewEmitContext(), file, c, prefix, names)
|
|
44
|
+
}
|
|
45
|
+
|
|
46
|
+
// newTransformContextIn is newTransformContext on an emit context that others share: the native plugins that get the
|
|
47
|
+
// file after setget.
|
|
48
|
+
func newTransformContextIn(emit *printer.EmitContext, file *ast.SourceFile, c *checker.Checker, prefix string, names *accessorNames) *transformContext {
|
|
49
|
+
context := &transformContext{file: file, emit: emit, factory: emit.Factory, checker: c, prefix: prefix, names: names}
|
|
50
|
+
context.visitor = emit.NewNodeVisitor(context.visitNode)
|
|
51
|
+
return context
|
|
52
|
+
}
|
|
53
|
+
|
|
54
|
+
func (c *transformContext) transformFile() *ast.SourceFile { return c.visitor.VisitSourceFile(c.file) }
|
|
55
|
+
|
|
56
|
+
func (c *transformContext) transform(node *ast.Node) *ast.Node { return c.visitor.VisitEachChild(node) }
|
|
57
|
+
|
|
58
|
+
func (c *transformContext) getText(node *ast.Node) string {
|
|
59
|
+
return scanner.GetSourceTextOfNodeFromSourceFile(c.file, node, false)
|
|
60
|
+
}
|
|
61
|
+
|
|
62
|
+
// name makes the identifier that replaces original's name. The source map range does nothing to the printed text. It
|
|
63
|
+
// lets a diagnostic on the new name point at the old one.
|
|
64
|
+
func (c *transformContext) name(kind string, original *ast.Node) *ast.Node {
|
|
65
|
+
identifier := c.factory.NewIdentifier(c.prefix + kind + c.getText(original))
|
|
66
|
+
c.emit.SetSourceMapRange(identifier, original.Loc)
|
|
67
|
+
return identifier
|
|
68
|
+
}
|
|
69
|
+
|
|
70
|
+
func (c *transformContext) mapped(node *ast.Node, original *ast.Node) *ast.Node {
|
|
71
|
+
c.emit.SetSourceMapRange(node, original.Loc)
|
|
72
|
+
return node
|
|
73
|
+
}
|
|
74
|
+
|
|
75
|
+
func (c *transformContext) visitPropertyAccessExpression(node *ast.Node) *ast.Node {
|
|
76
|
+
getterDeclaration, setterDeclaration := c.getGetterSetterDeclarations(node)
|
|
77
|
+
if getterDeclaration == nil && setterDeclaration == nil {
|
|
78
|
+
return c.transform(node)
|
|
79
|
+
}
|
|
80
|
+
access := node.AsPropertyAccessExpression()
|
|
81
|
+
assignmentExpression := getAncestorOfType(node, isAssignmentExpression)
|
|
82
|
+
isSetter := setterDeclaration != nil && assignmentExpression != nil
|
|
83
|
+
if isSetter {
|
|
84
|
+
left := assignmentExpression.AsBinaryExpression().Left
|
|
85
|
+
isSetter = node == left || isChildOfNode(left, node)
|
|
86
|
+
}
|
|
87
|
+
if !isSetter {
|
|
88
|
+
updated := c.factory.UpdatePropertyAccessExpression(access, c.transform(node).Expression(), access.QuestionDotToken, c.name(getterPrefix, access.Name()), node.Flags)
|
|
89
|
+
// createCallChain marks the call as a chain even without a ?. token. That's why JS writes (a.__getb()).c, with
|
|
90
|
+
// parentheses that survive into the reparse: an access on a chain that isn't part of it needs them.
|
|
91
|
+
return c.mapped(c.factory.NewCallExpression(updated, access.QuestionDotToken, c.factory.NewNodeList(nil), c.factory.NewNodeList(nil), ast.NodeFlagsOptionalChain), node)
|
|
92
|
+
}
|
|
93
|
+
return c.factory.UpdatePropertyAccessExpression(access, c.transform(node).Expression(), access.QuestionDotToken, c.name(setterPrefix, access.Name()), node.Flags)
|
|
94
|
+
}
|
|
95
|
+
|
|
96
|
+
var assignmentTokenLookup = map[ast.Kind]ast.Kind{
|
|
97
|
+
ast.KindPlusEqualsToken: ast.KindPlusToken,
|
|
98
|
+
ast.KindMinusEqualsToken: ast.KindMinusToken,
|
|
99
|
+
ast.KindAsteriskEqualsToken: ast.KindAsteriskToken,
|
|
100
|
+
ast.KindAsteriskAsteriskEqualsToken: ast.KindAsteriskAsteriskToken,
|
|
101
|
+
ast.KindSlashEqualsToken: ast.KindSlashToken,
|
|
102
|
+
ast.KindPercentEqualsToken: ast.KindPercentToken,
|
|
103
|
+
ast.KindLessThanLessThanEqualsToken: ast.KindLessThanLessThanToken,
|
|
104
|
+
ast.KindGreaterThanGreaterThanEqualsToken: ast.KindGreaterThanGreaterThanToken,
|
|
105
|
+
ast.KindGreaterThanGreaterThanGreaterThanEqualsToken: ast.KindGreaterThanGreaterThanGreaterThanToken,
|
|
106
|
+
ast.KindAmpersandEqualsToken: ast.KindAmpersandToken,
|
|
107
|
+
ast.KindBarEqualsToken: ast.KindBarToken,
|
|
108
|
+
ast.KindBarBarEqualsToken: ast.KindBarBarToken,
|
|
109
|
+
ast.KindAmpersandAmpersandEqualsToken: ast.KindAmpersandAmpersandToken,
|
|
110
|
+
ast.KindQuestionQuestionEqualsToken: ast.KindQuestionQuestionToken,
|
|
111
|
+
ast.KindCaretEqualsToken: ast.KindCaretToken,
|
|
112
|
+
}
|
|
113
|
+
|
|
114
|
+
func (c *transformContext) newCall(expression, name *ast.Node, arguments []*ast.Node, original *ast.Node) *ast.Node {
|
|
115
|
+
access := c.factory.NewPropertyAccessExpression(expression, nil, name, ast.NodeFlagsNone)
|
|
116
|
+
var list *ast.NodeList
|
|
117
|
+
list = c.factory.NewNodeList(arguments)
|
|
118
|
+
return c.mapped(c.factory.NewCallExpression(c.mapped(access, original), nil, nil, list, ast.NodeFlagsNone), original)
|
|
119
|
+
}
|
|
120
|
+
|
|
121
|
+
func (c *transformContext) visitBinaryExpression(node *ast.Node) *ast.Node {
|
|
122
|
+
propertyAccessExpression := getChildOfType(node, ast.IsPropertyAccessExpression)
|
|
123
|
+
if propertyAccessExpression == nil {
|
|
124
|
+
return c.transform(node)
|
|
125
|
+
}
|
|
126
|
+
getterDeclaration, setterDeclaration := c.getGetterSetterDeclarations(propertyAccessExpression)
|
|
127
|
+
if setterDeclaration == nil {
|
|
128
|
+
return c.transform(node)
|
|
129
|
+
}
|
|
130
|
+
original := propertyAccessExpression
|
|
131
|
+
name := original.AsPropertyAccessExpression().Name()
|
|
132
|
+
binary := node.AsBinaryExpression()
|
|
133
|
+
operator := binary.OperatorToken.Kind
|
|
134
|
+
|
|
135
|
+
if operator == ast.KindEqualsToken {
|
|
136
|
+
expression := c.transform(original).Expression()
|
|
137
|
+
right := c.transform(node).AsBinaryExpression().Right
|
|
138
|
+
return c.newCall(expression, c.name(setterPrefix, name), []*ast.Node{right}, node)
|
|
139
|
+
}
|
|
140
|
+
if ast.IsAssignmentExpression(node, false) && ast.IsCompoundAssignment(operator) {
|
|
141
|
+
if getterDeclaration == nil {
|
|
142
|
+
c.exit(`Required getter declaration of "` + shared.Color.Yellow(c.getText(propertyAccessExpression)) + `" for compound assignment: ` + shared.Color.Yellow(c.getText(node)))
|
|
143
|
+
}
|
|
144
|
+
if len(getDescendantsOfType(original, ast.IsNewExpression)) > 0 {
|
|
145
|
+
c.exit("Cannot compile a compound assignment with a new expression inside: "+shared.Color.Yellow(c.getText(node)), shared.Color.Yellow("Suggestion:")+" extract new expression into a variable.")
|
|
146
|
+
}
|
|
147
|
+
setExpression := c.transform(original).Expression()
|
|
148
|
+
getExpression := c.transform(original).Expression()
|
|
149
|
+
getter := c.newCall(getExpression, c.name(getterPrefix, name), nil, original)
|
|
150
|
+
token := assignmentTokenLookup[operator]
|
|
151
|
+
right := parenthesizeRightSideOfBinary(c.factory, token, c.transform(node).AsBinaryExpression().Right)
|
|
152
|
+
sum := c.mapped(c.factory.NewBinaryExpression(nil, getter, nil, c.factory.NewToken(token), right), node)
|
|
153
|
+
return c.newCall(setExpression, c.name(setterPrefix, name), []*ast.Node{sum}, node)
|
|
154
|
+
}
|
|
155
|
+
return c.transform(node)
|
|
156
|
+
}
|
|
157
|
+
|
|
158
|
+
var postfixUnaryOperatorLookup = map[ast.Kind]ast.Kind{
|
|
159
|
+
ast.KindPlusPlusToken: ast.KindPlusToken,
|
|
160
|
+
ast.KindMinusMinusToken: ast.KindMinusToken,
|
|
161
|
+
}
|
|
162
|
+
|
|
163
|
+
func (c *transformContext) visitPostfixUnaryExpression(node *ast.Node) *ast.Node {
|
|
164
|
+
propertyAccessExpression := getChildOfType(node, ast.IsPropertyAccessExpression)
|
|
165
|
+
if propertyAccessExpression == nil {
|
|
166
|
+
return c.transform(node)
|
|
167
|
+
}
|
|
168
|
+
getterDeclaration, setterDeclaration := c.getGetterSetterDeclarations(propertyAccessExpression)
|
|
169
|
+
if setterDeclaration == nil {
|
|
170
|
+
return c.transform(node)
|
|
171
|
+
}
|
|
172
|
+
original := propertyAccessExpression.AsPropertyAccessExpression()
|
|
173
|
+
if getterDeclaration == nil {
|
|
174
|
+
c.exit(`Required getter declaration of "` + shared.Color.Yellow(c.getText(propertyAccessExpression)) + `" for postfix unary expression: ` + shared.Color.Yellow(c.getText(node)))
|
|
175
|
+
}
|
|
176
|
+
if len(getDescendantsOfType(propertyAccessExpression, ast.IsNewExpression)) > 0 {
|
|
177
|
+
c.exit("Cannot compile a postfix unary expression with a new expression inside: "+shared.Color.Yellow(c.getText(node)), shared.Color.Yellow("Suggestion:")+" extract new expression into a variable.")
|
|
178
|
+
}
|
|
179
|
+
getter := c.newCall(original.Expression, c.name(getterPrefix, original.Name()), nil, propertyAccessExpression)
|
|
180
|
+
token := postfixUnaryOperatorLookup[node.AsPostfixUnaryExpression().Operator]
|
|
181
|
+
one := c.factory.NewNumericLiteral("1", ast.TokenFlagsNone)
|
|
182
|
+
sum := c.mapped(c.factory.NewBinaryExpression(nil, getter, nil, c.factory.NewToken(token), one), node)
|
|
183
|
+
return c.newCall(original.Expression, c.name(setterPrefix, original.Name()), []*ast.Node{sum}, node)
|
|
184
|
+
}
|
|
185
|
+
|
|
186
|
+
func (c *transformContext) visitAccessor(node *ast.Node, kind string) *ast.Node {
|
|
187
|
+
var data *ast.FunctionLikeBase
|
|
188
|
+
var bodyData *ast.BodyBase
|
|
189
|
+
var modifiers *ast.ModifierList
|
|
190
|
+
if kind == setterPrefix {
|
|
191
|
+
accessor := node.AsSetAccessorDeclaration()
|
|
192
|
+
data, bodyData, modifiers = &accessor.FunctionLikeBase, &accessor.BodyBase, accessor.Modifiers()
|
|
193
|
+
} else {
|
|
194
|
+
accessor := node.AsGetAccessorDeclaration()
|
|
195
|
+
data, bodyData, modifiers = &accessor.FunctionLikeBase, &accessor.BodyBase, accessor.Modifiers()
|
|
196
|
+
}
|
|
197
|
+
var method *ast.Node
|
|
198
|
+
if node.Parent != nil && (ast.IsInterfaceDeclaration(node.Parent) || ast.IsTypeLiteralNode(node.Parent)) {
|
|
199
|
+
// JS makes a MethodDeclaration here too, and prints it the same way as this. The Go printer only takes signatures
|
|
200
|
+
// in an interface or a type literal.
|
|
201
|
+
method = c.factory.NewMethodSignatureDeclaration(modifiers, c.name(kind, node.Name()), node.PostfixToken(), data.TypeParameters, data.Parameters, data.Type)
|
|
202
|
+
} else {
|
|
203
|
+
method = c.factory.NewMethodDeclaration(modifiers, nil, c.name(kind, node.Name()), node.PostfixToken(), data.TypeParameters, data.Parameters, data.Type, nil, bodyData.Body)
|
|
204
|
+
}
|
|
205
|
+
return c.transform(c.mapped(method, node))
|
|
206
|
+
}
|
|
207
|
+
|
|
208
|
+
func (c *transformContext) visitNode(node *ast.Node) *ast.Node {
|
|
209
|
+
switch node.Kind {
|
|
210
|
+
case ast.KindGetAccessor:
|
|
211
|
+
return c.visitAccessor(node, getterPrefix)
|
|
212
|
+
case ast.KindSetAccessor:
|
|
213
|
+
return c.visitAccessor(node, setterPrefix)
|
|
214
|
+
case ast.KindPropertyAccessExpression:
|
|
215
|
+
return c.visitPropertyAccessExpression(node)
|
|
216
|
+
case ast.KindBinaryExpression:
|
|
217
|
+
return c.visitBinaryExpression(node)
|
|
218
|
+
case ast.KindPostfixUnaryExpression:
|
|
219
|
+
return c.visitPostfixUnaryExpression(node)
|
|
220
|
+
}
|
|
221
|
+
return c.transform(node)
|
|
222
|
+
}
|
|
223
|
+
|
|
224
|
+
func isAssignmentExpression(node *ast.Node) bool { return ast.IsAssignmentExpression(node, false) }
|
|
225
|
+
|
|
226
|
+
func getAncestorOfType(node *ast.Node, check func(*ast.Node) bool) *ast.Node {
|
|
227
|
+
currentNode := node
|
|
228
|
+
for currentNode.Parent != nil {
|
|
229
|
+
parent := currentNode.Parent
|
|
230
|
+
if check(parent) {
|
|
231
|
+
return parent
|
|
232
|
+
}
|
|
233
|
+
if (ast.IsAsExpression(parent) || ast.IsParenthesizedExpression(parent)) && parent.Expression() == currentNode {
|
|
234
|
+
currentNode = parent
|
|
235
|
+
continue
|
|
236
|
+
}
|
|
237
|
+
break
|
|
238
|
+
}
|
|
239
|
+
return nil
|
|
240
|
+
}
|
|
241
|
+
|
|
242
|
+
func getChildOfType(node *ast.Node, check func(*ast.Node) bool) *ast.Node {
|
|
243
|
+
var foundChild *ast.Node
|
|
244
|
+
node.ForEachChild(func(child *ast.Node) bool {
|
|
245
|
+
if check(child) {
|
|
246
|
+
foundChild = child
|
|
247
|
+
} else {
|
|
248
|
+
foundChild = getChildOfType(child, check)
|
|
249
|
+
}
|
|
250
|
+
return foundChild != nil
|
|
251
|
+
})
|
|
252
|
+
return foundChild
|
|
253
|
+
}
|
|
254
|
+
|
|
255
|
+
// exit is writeLine, then process.exit(1).
|
|
256
|
+
func (c *transformContext) exit(messages ...string) {
|
|
257
|
+
prefix := "[" + shared.Color.Grey("rbxts-transformer-setget") + "]: "
|
|
258
|
+
lines := make([]string, len(messages))
|
|
259
|
+
for i, message := range messages {
|
|
260
|
+
lines[i] = prefix + strings.ReplaceAll(message, "\n", "\n"+prefix)
|
|
261
|
+
}
|
|
262
|
+
panic(&pluginExit{lines: lines})
|
|
263
|
+
}
|
|
264
|
+
|
|
265
|
+
func getDescendantsOfType(node *ast.Node, check func(*ast.Node) bool) []*ast.Node {
|
|
266
|
+
var children []*ast.Node
|
|
267
|
+
node.ForEachChild(func(child *ast.Node) bool {
|
|
268
|
+
if check(child) {
|
|
269
|
+
children = append(children, child)
|
|
270
|
+
}
|
|
271
|
+
children = append(children, getDescendantsOfType(child, check)...)
|
|
272
|
+
return false
|
|
273
|
+
})
|
|
274
|
+
return children
|
|
275
|
+
}
|
|
276
|
+
|
|
277
|
+
func isChildOfNode(parent *ast.Node, node *ast.Node) bool {
|
|
278
|
+
return parent.ForEachChild(func(child *ast.Node) bool {
|
|
279
|
+
return child == node || isChildOfNode(child, node)
|
|
280
|
+
})
|
|
281
|
+
}
|
|
282
|
+
|
|
283
|
+
// getGetterSetterDeclarations asks the checker only if some accessor in the program could go by this name. See
|
|
284
|
+
// accessorNames. That's what keeps the first program from being checked almost in full.
|
|
285
|
+
func (c *transformContext) getGetterSetterDeclarations(node *ast.Node) (getterDeclaration, setterDeclaration *ast.Node) {
|
|
286
|
+
if !c.names.mayBeAccessor(node.AsPropertyAccessExpression().Name()) {
|
|
287
|
+
return nil, nil
|
|
288
|
+
}
|
|
289
|
+
nodeSymbol := c.checker.GetSymbolAtLocation(node)
|
|
290
|
+
if nodeSymbol == nil {
|
|
291
|
+
return nil, nil
|
|
292
|
+
}
|
|
293
|
+
for _, declaration := range nodeSymbol.Declarations() {
|
|
294
|
+
if ast.IsGetAccessorDeclaration(declaration) {
|
|
295
|
+
getterDeclaration = declaration
|
|
296
|
+
}
|
|
297
|
+
if ast.IsSetAccessorDeclaration(declaration) {
|
|
298
|
+
setterDeclaration = declaration
|
|
299
|
+
}
|
|
300
|
+
if getterDeclaration != nil && setterDeclaration != nil {
|
|
301
|
+
break
|
|
302
|
+
}
|
|
303
|
+
}
|
|
304
|
+
return getterDeclaration, setterDeclaration
|
|
305
|
+
}
|
|
306
|
+
|
|
307
|
+
// parenthesizeRightSideOfBinary is what ts.factory.createBinaryExpression does to its right operand. The patched
|
|
308
|
+
// printer leaves a parse tree node alone, so it has to happen here. The left operand is always a call. That rules out
|
|
309
|
+
// the case where `+` on two literals needs none.
|
|
310
|
+
func parenthesizeRightSideOfBinary(factory *printer.NodeFactory, operator ast.Kind, operand *ast.Node) *ast.Node {
|
|
311
|
+
emitted := ast.SkipPartiallyEmittedExpressions(operand)
|
|
312
|
+
if emitted.Kind == ast.KindParenthesizedExpression || !binaryOperandNeedsParentheses(operator, operand, emitted) {
|
|
313
|
+
return operand
|
|
314
|
+
}
|
|
315
|
+
return factory.NewParenthesizedExpression(operand)
|
|
316
|
+
}
|
|
317
|
+
|
|
318
|
+
func binaryOperandNeedsParentheses(operator ast.Kind, operand, emitted *ast.Node) bool {
|
|
319
|
+
precedence := binaryOperatorPrecedence(operator)
|
|
320
|
+
isRightAssociative := operator == ast.KindAsteriskAsteriskToken
|
|
321
|
+
if operand.Kind == ast.KindArrowFunction && precedence > 3 {
|
|
322
|
+
return true
|
|
323
|
+
}
|
|
324
|
+
operandPrecedence := expressionPrecedence(emitted)
|
|
325
|
+
switch {
|
|
326
|
+
case operandPrecedence < precedence:
|
|
327
|
+
return !(isRightAssociative && operand.Kind == ast.KindYieldExpression)
|
|
328
|
+
case operandPrecedence > precedence:
|
|
329
|
+
return false
|
|
330
|
+
}
|
|
331
|
+
if ast.IsBinaryExpression(emitted) && emitted.AsBinaryExpression().OperatorToken.Kind == operator {
|
|
332
|
+
switch operator {
|
|
333
|
+
case ast.KindAsteriskToken, ast.KindBarToken, ast.KindAmpersandToken, ast.KindCaretToken, ast.KindCommaToken:
|
|
334
|
+
return false
|
|
335
|
+
}
|
|
336
|
+
}
|
|
337
|
+
return !isExpressionRightAssociative(emitted)
|
|
338
|
+
}
|
|
339
|
+
|
|
340
|
+
// expressionPrecedence is getExpressionPrecedence from TS 5.5.3, in its numbers. ast.GetExpressionPrecedence can't stand
|
|
341
|
+
// in for it: there, ?? ranks above a conditional and a call ranks as a member, and here those change the result.
|
|
342
|
+
func expressionPrecedence(node *ast.Node) int {
|
|
343
|
+
switch node.Kind {
|
|
344
|
+
case ast.KindSpreadElement:
|
|
345
|
+
return 1
|
|
346
|
+
case ast.KindYieldExpression:
|
|
347
|
+
return 2
|
|
348
|
+
case ast.KindConditionalExpression:
|
|
349
|
+
return 4
|
|
350
|
+
case ast.KindBinaryExpression:
|
|
351
|
+
return binaryOperatorPrecedence(node.AsBinaryExpression().OperatorToken.Kind)
|
|
352
|
+
case ast.KindTypeAssertionExpression, ast.KindNonNullExpression, ast.KindPrefixUnaryExpression, ast.KindTypeOfExpression, ast.KindVoidExpression, ast.KindDeleteExpression, ast.KindAwaitExpression:
|
|
353
|
+
return 16
|
|
354
|
+
case ast.KindPostfixUnaryExpression:
|
|
355
|
+
return 17
|
|
356
|
+
case ast.KindCallExpression:
|
|
357
|
+
return 18
|
|
358
|
+
case ast.KindNewExpression:
|
|
359
|
+
if node.ArgumentList() == nil {
|
|
360
|
+
return 18
|
|
361
|
+
}
|
|
362
|
+
return 19
|
|
363
|
+
case ast.KindTaggedTemplateExpression, ast.KindPropertyAccessExpression, ast.KindElementAccessExpression, ast.KindMetaProperty:
|
|
364
|
+
return 19
|
|
365
|
+
case ast.KindAsExpression, ast.KindSatisfiesExpression:
|
|
366
|
+
return 11
|
|
367
|
+
case ast.KindThisKeyword, ast.KindSuperKeyword, ast.KindIdentifier, ast.KindPrivateIdentifier, ast.KindNullKeyword, ast.KindTrueKeyword, ast.KindFalseKeyword, ast.KindNumericLiteral, ast.KindBigIntLiteral, ast.KindStringLiteral, ast.KindArrayLiteralExpression, ast.KindObjectLiteralExpression, ast.KindFunctionExpression, ast.KindArrowFunction, ast.KindClassExpression, ast.KindRegularExpressionLiteral, ast.KindNoSubstitutionTemplateLiteral, ast.KindTemplateExpression, ast.KindParenthesizedExpression, ast.KindOmittedExpression, ast.KindJsxElement, ast.KindJsxSelfClosingElement, ast.KindJsxFragment:
|
|
368
|
+
return 20
|
|
369
|
+
}
|
|
370
|
+
return -1
|
|
371
|
+
}
|
|
372
|
+
|
|
373
|
+
func binaryOperatorPrecedence(operator ast.Kind) int {
|
|
374
|
+
switch operator {
|
|
375
|
+
case ast.KindCommaToken:
|
|
376
|
+
return 0
|
|
377
|
+
case ast.KindQuestionQuestionToken:
|
|
378
|
+
return 4
|
|
379
|
+
case ast.KindBarBarToken:
|
|
380
|
+
return 5
|
|
381
|
+
case ast.KindAmpersandAmpersandToken:
|
|
382
|
+
return 6
|
|
383
|
+
case ast.KindBarToken:
|
|
384
|
+
return 7
|
|
385
|
+
case ast.KindCaretToken:
|
|
386
|
+
return 8
|
|
387
|
+
case ast.KindAmpersandToken:
|
|
388
|
+
return 9
|
|
389
|
+
case ast.KindEqualsEqualsToken, ast.KindExclamationEqualsToken, ast.KindEqualsEqualsEqualsToken, ast.KindExclamationEqualsEqualsToken:
|
|
390
|
+
return 10
|
|
391
|
+
case ast.KindLessThanToken, ast.KindGreaterThanToken, ast.KindLessThanEqualsToken, ast.KindGreaterThanEqualsToken, ast.KindInstanceOfKeyword, ast.KindInKeyword, ast.KindAsKeyword, ast.KindSatisfiesKeyword:
|
|
392
|
+
return 11
|
|
393
|
+
case ast.KindLessThanLessThanToken, ast.KindGreaterThanGreaterThanToken, ast.KindGreaterThanGreaterThanGreaterThanToken:
|
|
394
|
+
return 12
|
|
395
|
+
case ast.KindPlusToken, ast.KindMinusToken:
|
|
396
|
+
return 13
|
|
397
|
+
case ast.KindAsteriskToken, ast.KindSlashToken, ast.KindPercentToken:
|
|
398
|
+
return 14
|
|
399
|
+
case ast.KindAsteriskAsteriskToken:
|
|
400
|
+
return 15
|
|
401
|
+
}
|
|
402
|
+
if ast.IsAssignmentOperator(operator) {
|
|
403
|
+
return 3
|
|
404
|
+
}
|
|
405
|
+
return -1
|
|
406
|
+
}
|
|
407
|
+
|
|
408
|
+
// isExpressionRightAssociative is getExpressionAssociativity(node) === Right.
|
|
409
|
+
func isExpressionRightAssociative(node *ast.Node) bool {
|
|
410
|
+
switch node.Kind {
|
|
411
|
+
case ast.KindNewExpression:
|
|
412
|
+
return node.ArgumentList() == nil
|
|
413
|
+
case ast.KindPrefixUnaryExpression, ast.KindTypeOfExpression, ast.KindVoidExpression, ast.KindDeleteExpression, ast.KindAwaitExpression, ast.KindConditionalExpression, ast.KindYieldExpression:
|
|
414
|
+
return true
|
|
415
|
+
case ast.KindBinaryExpression:
|
|
416
|
+
operator := node.AsBinaryExpression().OperatorToken.Kind
|
|
417
|
+
return operator == ast.KindAsteriskAsteriskToken || ast.IsAssignmentOperator(operator)
|
|
418
|
+
}
|
|
419
|
+
return false
|
|
420
|
+
}
|
|
421
|
+
|
|
422
|
+
// accessorNames is the set of names any accessor in the program goes by. A property access can resolve to an accessor
|
|
423
|
+
// only if its name is in here, so every other one skips the checker. Two things can break that link, and either one
|
|
424
|
+
// turns the filter off: a computed accessor name, whose value only the checker knows, and a mapped type with an `as`
|
|
425
|
+
// clause, where a property keeps the declarations of a member with another name.
|
|
426
|
+
type accessorNames struct {
|
|
427
|
+
names map[string]bool
|
|
428
|
+
all bool
|
|
429
|
+
}
|
|
430
|
+
|
|
431
|
+
func (n *accessorNames) mayBeAccessor(name *ast.Node) bool { return n.all || n.names[name.Text()] }
|
|
432
|
+
|
|
433
|
+
// empty reports that nothing in the program can be an accessor, so no checker is needed at all.
|
|
434
|
+
func (n *accessorNames) empty() bool { return !n.all && len(n.names) == 0 }
|
|
435
|
+
|
|
436
|
+
// fileAccessorFacts is what one syntactic pass over a file finds.
|
|
437
|
+
type fileAccessorFacts struct {
|
|
438
|
+
names []string
|
|
439
|
+
computed bool
|
|
440
|
+
mappedTypeName bool
|
|
441
|
+
}
|
|
442
|
+
|
|
443
|
+
func scanAccessors(file *ast.SourceFile) fileAccessorFacts {
|
|
444
|
+
var facts fileAccessorFacts
|
|
445
|
+
var walk func(node *ast.Node) bool
|
|
446
|
+
walk = func(node *ast.Node) bool {
|
|
447
|
+
switch node.Kind {
|
|
448
|
+
case ast.KindGetAccessor, ast.KindSetAccessor:
|
|
449
|
+
name := node.Name()
|
|
450
|
+
if name != nil {
|
|
451
|
+
if ast.IsComputedPropertyName(name) {
|
|
452
|
+
facts.computed = true
|
|
453
|
+
} else {
|
|
454
|
+
facts.names = append(facts.names, name.Text())
|
|
455
|
+
}
|
|
456
|
+
}
|
|
457
|
+
case ast.KindMappedType:
|
|
458
|
+
if node.AsMappedTypeNode().NameType != nil {
|
|
459
|
+
facts.mappedTypeName = true
|
|
460
|
+
}
|
|
461
|
+
}
|
|
462
|
+
return node.ForEachChild(walk)
|
|
463
|
+
}
|
|
464
|
+
file.AsNode().ForEachChild(walk)
|
|
465
|
+
return facts
|
|
466
|
+
}
|
|
467
|
+
|
|
468
|
+
// fileUsesName reports whether a property access in file might be an accessor.
|
|
469
|
+
func fileUsesName(file *ast.SourceFile, names *accessorNames) bool {
|
|
470
|
+
var walk func(node *ast.Node) bool
|
|
471
|
+
walk = func(node *ast.Node) bool {
|
|
472
|
+
if node.Kind == ast.KindPropertyAccessExpression && names.mayBeAccessor(node.AsPropertyAccessExpression().Name()) {
|
|
473
|
+
return true
|
|
474
|
+
}
|
|
475
|
+
return node.ForEachChild(walk)
|
|
476
|
+
}
|
|
477
|
+
return file.AsNode().ForEachChild(walk)
|
|
478
|
+
}
|