redscript-mc 2.6.2 → 3.0.0

package/dist/src/typechecker/index.js

@@ -9,6 +9,7 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.TypeChecker = void 0;
 const diagnostics_1 = require("../diagnostics");
 const types_1 = require("../events/types");
+const expand_1 = require("../structs/expand");
 // Entity type hierarchy for subtype checking
 const ENTITY_HIERARCHY = {
     'entity': null,
@@ -94,6 +95,10 @@ const INT_TYPE = { kind: 'named', name: 'int' };
 const STRING_TYPE = { kind: 'named', name: 'string' };
 const FORMAT_STRING_TYPE = { kind: 'named', name: 'format_string' };
 const BUILTIN_SIGNATURES = {
+    assert: {
+        params: [{ kind: 'named', name: 'bool' }],
+        return: VOID_TYPE,
+    },
     setTimeout: {
         params: [INT_TYPE, { kind: 'function_type', params: [], return: VOID_TYPE }],
         return: VOID_TYPE,
@@ -106,6 +111,14 @@ const BUILTIN_SIGNATURES = {
         params: [INT_TYPE],
         return: VOID_TYPE,
     },
+    int_to_str: {
+        params: [INT_TYPE],
+        return: STRING_TYPE,
+    },
+    bool_to_str: {
+        params: [{ kind: 'named', name: 'bool' }],
+        return: STRING_TYPE,
+    },
 };
 // ---------------------------------------------------------------------------
 // Type Checker
@@ -117,6 +130,8 @@ class TypeChecker {
         this.implMethods = new Map();
         this.structs = new Map();
         this.enums = new Map();
+        // enumName → variantName → field list (for payload variants)
+        this.enumPayloads = new Map();
         this.consts = new Map();
         this.globals = new Map();
         this.currentFn = null;
@@ -127,6 +142,8 @@ class TypeChecker {
         // Depth of loop/conditional nesting (for static-allocation enforcement)
         this.loopDepth = 0;
         this.condDepth = 0;
+        // interface name → InterfaceDecl
+        this.interfaces = new Map();
         this.richTextBuiltins = new Map([
             ['say', { messageIndex: 0 }],
             ['announce', { messageIndex: 0 }],
@@ -167,6 +184,10 @@ class TypeChecker {
         for (const fn of program.declarations) {
             this.functions.set(fn.name, fn);
         }
+        // Register interface declarations
+        for (const iface of program.interfaces ?? []) {
+            this.interfaces.set(iface.name, iface);
+        }
         // Register global variables (mutable) so functions can reference and assign them
         for (const global of program.globals ?? []) {
             this.globals.set(global.name, this.normalizeType(global.type));
@@ -191,19 +212,59 @@ class TypeChecker {
                 methods.set(method.name, method);
             }
         }
-        for (const struct of program.structs ?? []) {
+        const expandedStructs = (0, expand_1.expandStructDeclarations)(program.structs ?? [], ({ message, node }) => {
+            this.report(message, node);
+        });
+        for (const struct of expandedStructs) {
             const fields = new Map();
             for (const field of struct.fields) {
                 fields.set(field.name, field.type);
             }
             this.structs.set(struct.name, fields);
+            // @singleton structs get synthetic static get() and set(gs) methods
+            if (struct.isSingleton) {
+                const structType = { kind: 'struct', name: struct.name };
+                let singletonMethods = this.implMethods.get(struct.name);
+                if (!singletonMethods) {
+                    singletonMethods = new Map();
+                    this.implMethods.set(struct.name, singletonMethods);
+                }
+                const voidType = { kind: 'named', name: 'void' };
+                // Synthetic get() — no params, returns struct
+                singletonMethods.set('get', {
+                    name: 'get',
+                    params: [],
+                    returnType: structType,
+                    decorators: [],
+                    body: [],
+                    typeParams: undefined,
+                    isLibraryFn: true,
+                });
+                // Synthetic set(gs: StructName) — takes struct, returns void
+                singletonMethods.set('set', {
+                    name: 'set',
+                    params: [{ name: 'gs', type: structType }],
+                    returnType: voidType,
+                    decorators: [],
+                    body: [],
+                    typeParams: undefined,
+                    isLibraryFn: true,
+                });
+            }
         }
         for (const enumDecl of program.enums ?? []) {
             const variants = new Map();
+            const payloads = new Map();
             for (const variant of enumDecl.variants) {
                 variants.set(variant.name, variant.value ?? 0);
+                if (variant.fields && variant.fields.length > 0) {
+                    payloads.set(variant.name, variant.fields);
+                }
             }
             this.enums.set(enumDecl.name, variants);
+            if (payloads.size > 0) {
+                this.enumPayloads.set(enumDecl.name, payloads);
+            }
         }
         for (const constDecl of program.consts ?? []) {
             const constType = this.normalizeType(constDecl.type);
@@ -213,6 +274,21 @@ class TypeChecker {
             }
             this.consts.set(constDecl.name, constType);
         }
+        // Verify that each `impl <Interface> for <Struct>` satisfies all interface methods
+        for (const implBlock of program.implBlocks ?? []) {
+            if (!implBlock.traitName)
+                continue;
+            const iface = this.interfaces.get(implBlock.traitName);
+            if (!iface)
+                continue; // Unknown trait — not our concern here (could be built-in like Display)
+            const implementedMethods = new Set(implBlock.methods.map(m => m.name));
+            for (const required of iface.methods) {
+                if (!implementedMethods.has(required.name)) {
+                    const span = implBlock.span ?? required.span;
+                    this.report(`Struct '${implBlock.typeName}' does not implement required method '${required.name}' from interface '${implBlock.traitName}'`, span ?? { line: 1, col: 1 });
+                }
+            }
+        }
         // Second pass: type check function bodies
         for (const fn of program.declarations) {
             this.checkFunction(fn);
@@ -262,6 +338,69 @@ class TypeChecker {
         this.currentReturnType = null;
     }
     checkFunctionDecorators(fn) {
+        const watchDecorators = fn.decorators.filter(decorator => decorator.name === 'watch');
+        if (watchDecorators.length > 1) {
+            this.report(`Function '${fn.name}' cannot have multiple @watch decorators`, fn);
+            return;
+        }
+        if (watchDecorators.length === 1) {
+            const objective = watchDecorators[0].args?.objective;
+            if (!objective) {
+                this.report(`Function '${fn.name}' is missing a scoreboard objective in @watch("...")`, fn);
+                return;
+            }
+            if (fn.params.length > 0) {
+                this.report(`@watch handler '${fn.name}' cannot declare parameters`, fn);
+            }
+        }
+        const throttleDecorators = fn.decorators.filter(decorator => decorator.name === 'throttle');
+        if (throttleDecorators.length > 1) {
+            this.report(`Function '${fn.name}' cannot have multiple @throttle decorators`, fn);
+            return;
+        }
+        if (throttleDecorators.length === 1) {
+            const ticks = throttleDecorators[0].args?.ticks;
+            if (ticks === undefined || ticks <= 0) {
+                this.report(`@throttle on '${fn.name}' requires ticks=N (positive integer)`, fn);
+            }
+        }
+        const retryDecorators = fn.decorators.filter(decorator => decorator.name === 'retry');
+        if (retryDecorators.length > 1) {
+            this.report(`Function '${fn.name}' cannot have multiple @retry decorators`, fn);
+            return;
+        }
+        if (retryDecorators.length === 1) {
+            const max = retryDecorators[0].args?.max;
+            if (max === undefined || max <= 0) {
+                this.report(`@retry on '${fn.name}' requires max=N (positive integer)`, fn);
+            }
+        }
+        const profileDecorators = fn.decorators.filter(decorator => decorator.name === 'profile');
+        if (profileDecorators.length > 1) {
+            this.report(`Function '${fn.name}' cannot have multiple @profile decorators`, fn);
+            return;
+        }
+        if (profileDecorators.length === 1 && (profileDecorators[0].rawArgs?.length || profileDecorators[0].args && Object.keys(profileDecorators[0].args).length > 0)) {
+            this.report(`@profile decorator on '${fn.name}' does not accept arguments`, fn);
+            return;
+        }
+        const memoizeDecorators = fn.decorators.filter(decorator => decorator.name === 'memoize');
+        if (memoizeDecorators.length > 1) {
+            this.report(`Function '${fn.name}' cannot have multiple @memoize decorators`, fn);
+            return;
+        }
+        if (memoizeDecorators.length === 1) {
+            if (fn.params.length !== 1) {
+                this.report(`@memoize on '${fn.name}' requires exactly one parameter`, fn);
+            }
+            else {
+                const paramType = fn.params[0].type;
+                const isInt = paramType.kind === 'named' && paramType.name === 'int';
+                if (!isInt) {
+                    this.report(`@memoize on '${fn.name}' only supports int parameters (got '${paramType.kind === 'named' ? paramType.name : paramType.kind}')`, fn);
+                }
+            }
+        }
         const eventDecorators = fn.decorators.filter(decorator => decorator.name === 'on');
         if (eventDecorators.length === 0) {
             return;
@@ -372,9 +511,25 @@ class TypeChecker {
                             !this.typesMatch(subjectType, patternType)) {
                             this.report('Match arm pattern type must match subject type', arm.pattern.expr);
                         }
+                        this.checkBlock(arm.body);
+                    }
+                    else if (arm.pattern.kind === 'PatEnum') {
+                        const pat = arm.pattern;
+                        const variantPayloads = this.enumPayloads.get(pat.enumName)?.get(pat.variant) ?? [];
+                        // Bind pattern variables to their declared field types in arm scope
+                        const savedScope = new Map(this.scope);
+                        for (let i = 0; i < pat.bindings.length; i++) {
+                            const fieldDef = variantPayloads[i];
+                            const bindingType = fieldDef ? fieldDef.type : { kind: 'named', name: 'int' };
+                            this.scope.set(pat.bindings[i], { type: bindingType, mutable: false });
+                        }
+                        this.checkBlock(arm.body);
+                        this.scope = savedScope;
+                    }
+                    else {
+                        // PatSome / PatNone / PatInt / PatWild are structurally typed — no extra scope needed
+                        this.checkBlock(arm.body);
                     }
-                    // PatSome / PatNone / PatInt / PatWild are structurally typed — no expr to check
-                    this.checkBlock(arm.body);
                 }
                 break;
             case 'as_block': {
@@ -419,6 +574,22 @@ class TypeChecker {
             case 'raw':
                 // Raw commands are not type checked
                 break;
+            case 'break':
+            case 'continue':
+            case 'break_label':
+            case 'continue_label':
+                // Control flow — no sub-expressions to check
+                break;
+            case 'labeled_loop':
+                // Recurse into the labeled loop body
+                this.loopDepth++;
+                this.checkStmt(stmt.body);
+                this.loopDepth--;
+                break;
+            case 'const_decl':
+                // Local const: register in scope as immutable with its declared type
+                this.scope.set(stmt.name, { type: stmt.type, mutable: false });
+                break;
         }
     }
     checkLetDestructStmt(stmt) {
@@ -536,8 +707,8 @@ class TypeChecker {
                 if (arithmeticOps.includes(expr.op)) {
                     const leftType = this.inferType(expr.left);
                     const rightType = this.inferType(expr.right);
-                    const leftIsString = leftType.kind === 'named' && (leftType.name === 'string' || leftType.name === 'format_string');
-                    const rightIsString = rightType.kind === 'named' && (rightType.name === 'string' || rightType.name === 'format_string');
+                    const leftIsString = leftType.kind === 'named' && (leftType.name === 'string' || leftType.name === 'format_string'); // format_string kept for legacy type annotations
+                    const rightIsString = rightType.kind === 'named' && (rightType.name === 'string' || rightType.name === 'format_string'); // format_string kept for legacy type annotations
                     if (leftIsString || rightIsString) {
                         // String concatenation with + is not supported. Use f-strings instead.
                         this.report(`[StringConcat] String concatenation with '+' is not supported. Use f-strings instead: f"text{variable}" — e.g. f"Score: {score}"`, expr);
@@ -590,7 +761,29 @@ class TypeChecker {
                 break;
             case 'struct_lit':
                 for (const field of expr.fields) {
-                    this.checkExpr(field.value);
+                    let fieldType;
+                    if (expectedType) {
+                        const normalized = this.normalizeType(expectedType);
+                        if (normalized.kind === 'struct') {
+                            const structFields = this.structs.get(normalized.name);
+                            if (structFields && !structFields.has(field.name)) {
+                                this.report(`Struct '${normalized.name}' has no field '${field.name}'`, expr);
+                            }
+                            else {
+                                fieldType = structFields?.get(field.name);
+                            }
+                        }
+                    }
+                    this.checkExpr(field.value, fieldType);
+                    if (fieldType) {
+                        const actualType = this.inferType(field.value, fieldType);
+                        if (this.isNumericMismatch(fieldType, actualType)) {
+                            this.report(`Field '${field.name}' of struct expects ${this.typeToString(fieldType)}, got ${this.typeToString(actualType)}`, field.value);
+                        }
+                        else if (!this.typesMatch(fieldType, actualType)) {
+                            this.report(`Field '${field.name}' of struct expects ${this.typeToString(fieldType)}, got ${this.typeToString(actualType)}`, field.value);
+                        }
+                    }
                 }
                 break;
             case 'str_interp':
@@ -642,6 +835,32 @@ class TypeChecker {
                     }
                 }
                 break;
+            case 'enum_construct': {
+                if (!this.enums.has(expr.enumName)) {
+                    this.report(`Unknown enum '${expr.enumName}'`, expr);
+                    break;
+                }
+                const variants = this.enums.get(expr.enumName);
+                if (!variants.has(expr.variant)) {
+                    this.report(`Enum '${expr.enumName}' has no variant '${expr.variant}'`, expr);
+                    break;
+                }
+                const variantPayloads = this.enumPayloads.get(expr.enumName)?.get(expr.variant) ?? [];
+                if (variantPayloads.length === 0 && expr.args.length > 0) {
+                    this.report(`Enum variant '${expr.enumName}::${expr.variant}' has no payload fields`, expr);
+                    break;
+                }
+                for (const arg of expr.args) {
+                    const fieldDef = variantPayloads.find(f => f.name === arg.name);
+                    if (!fieldDef) {
+                        this.report(`Unknown field '${arg.name}' for enum variant '${expr.enumName}::${expr.variant}'`, expr);
+                    }
+                    else {
+                        this.checkExpr(arg.value, fieldDef.type);
+                    }
+                }
+                break;
+            }
             case 'blockpos':
                 break;
             // Literals don't need checking
@@ -741,7 +960,7 @@ class TypeChecker {
         }
         const messageType = this.inferType(message);
         if (messageType.kind !== 'named' ||
-            (messageType.name !== 'string' && messageType.name !== 'format_string')) {
+            messageType.name !== 'string') {
             this.report(`Argument ${messageIndex + 1} of '${expr.fn}' expects string or format_string, got ${this.typeToString(messageType)}`, message);
         }
     }
@@ -948,7 +1167,7 @@ class TypeChecker {
                         this.checkExpr(part.expr);
                     }
                 }
-                return FORMAT_STRING_TYPE;
+                return STRING_TYPE;
             case 'blockpos':
                 return { kind: 'named', name: 'BlockPos' };
             case 'ident':
@@ -1011,6 +1230,11 @@ class TypeChecker {
                     return { kind: 'enum', name: expr.enumName };
                 }
                 return { kind: 'named', name: 'void' };
+            case 'enum_construct':
+                if (this.enums.has(expr.enumName)) {
+                    return { kind: 'enum', name: expr.enumName };
+                }
+                return { kind: 'named', name: 'void' };
             case 'member':
                 if (expr.obj.kind === 'ident' && this.enums.has(expr.obj.name)) {
                     return { kind: 'enum', name: expr.obj.name };
@@ -1134,7 +1358,10 @@ class TypeChecker {
         if (receiverType.kind !== 'struct') {
             return null;
         }
-        const method = this.implMethods.get(receiverType.name)?.get(expr.fn);
+        // Try the method name as-is first, then try the original (pre-remap) name
+        const methodName = TypeChecker.PARSER_METHOD_REMAP[expr.fn] ?? expr.fn;
+        const method = this.implMethods.get(receiverType.name)?.get(expr.fn)
+            ?? this.implMethods.get(receiverType.name)?.get(methodName);
         if (!method || method.params[0]?.name !== 'self') {
             return null;
         }
@@ -1203,6 +1430,11 @@ class TypeChecker {
         if (expected.kind === 'selector' && actual.kind === 'selector') {
             return true; // any entity subtype is compatible
         }
+        // Fake player names (#name) are mc_name tokens typed as string — allow them
+        // where a selector is expected, since MC scoreboards accept fake player names.
+        if (expected.kind === 'selector' && actual.kind === 'named' && actual.name === 'string') {
+            return true;
+        }
         if (expected.kind !== actual.kind)
             return false;
         if (expected.kind === 'named' && actual.kind === 'named') {
@@ -1309,4 +1541,17 @@ class TypeChecker {
     }
 }
 exports.TypeChecker = TypeChecker;
+// Reverse map: parser sometimes remaps method names (e.g. add→set_add) for builtins.
+// When the receiver is a struct with an impl method matching the original name, use that.
+TypeChecker.PARSER_METHOD_REMAP = {
+    'set_add': 'add',
+    'set_contains': 'contains',
+    'set_remove': 'remove',
+    'set_clear': 'clear',
+    '__array_push': 'push',
+    '__array_pop': 'pop',
+    '__entity_tag': 'tag',
+    '__entity_untag': 'untag',
+    '__entity_has_tag': 'has_tag',
+};
 //# sourceMappingURL=index.js.map

package/dist/tsconfig.tsbuildinfo

@@ -1 +1 @@
-{"root":["../src/cli.ts","../src/compile.ts","../src/index.ts","../src/repl.ts","../src/__tests__/cli.test.ts","../src/__tests__/codegen.test.ts","../src/__tests__/compile-all.test.ts","../src/__tests__/dce.test.ts","../src/__tests__/diagnostics.test.ts","../src/__tests__/e2e.test.ts","../src/__tests__/entity-types.test.ts","../src/__tests__/formatter.test.ts","../src/__tests__/lexer.test.ts","../src/__tests__/lowering.test.ts","../src/__tests__/macro.test.ts","../src/__tests__/mc-integration.test.ts","../src/__tests__/mc-syntax.test.ts","../src/__tests__/nbt.test.ts","../src/__tests__/optimizer-advanced.test.ts","../src/__tests__/optimizer.test.ts","../src/__tests__/parser.test.ts","../src/__tests__/repl.test.ts","../src/__tests__/runtime.test.ts","../src/__tests__/stdlib-advanced.test.ts","../src/__tests__/stdlib-bigint.test.ts","../src/__tests__/stdlib-math.test.ts","../src/__tests__/stdlib-vec.test.ts","../src/__tests__/structure-optimizer.test.ts","../src/__tests__/typechecker.test.ts","../src/__tests__/var-allocator.test.ts","../src/ast/types.ts","../src/builtins/metadata.ts","../src/codegen/var-allocator.ts","../src/codegen/cmdblock/index.ts","../src/codegen/mcfunction/index.ts","../src/codegen/structure/index.ts","../src/diagnostics/index.ts","../src/events/types.ts","../src/formatter/index.ts","../src/ir/builder.ts","../src/ir/types.ts","../src/lexer/index.ts","../src/lowering/index.ts","../src/mc-test/client.ts","../src/mc-test/runner.ts","../src/mc-test/setup.ts","../src/mc-validator/index.ts","../src/nbt/index.ts","../src/optimizer/commands.ts","../src/optimizer/dce.ts","../src/optimizer/passes.ts","../src/optimizer/structure.ts","../src/parser/index.ts","../src/runtime/index.ts","../src/typechecker/index.ts","../src/types/entity-hierarchy.ts","../src2/__tests__/e2e/basic.test.ts","../src2/__tests__/e2e/macros.test.ts","../src2/__tests__/e2e/migrate.test.ts","../src2/__tests__/hir/desugar.test.ts","../src2/__tests__/lir/lower.test.ts","../src2/__tests__/lir/types.test.ts","../src2/__tests__/lir/verify.test.ts","../src2/__tests__/mir/arithmetic.test.ts","../src2/__tests__/mir/control-flow.test.ts","../src2/__tests__/mir/verify.test.ts","../src2/__tests__/optimizer/block_merge.test.ts","../src2/__tests__/optimizer/branch_simplify.test.ts","../src2/__tests__/optimizer/constant_fold.test.ts","../src2/__tests__/optimizer/copy_prop.test.ts","../src2/__tests__/optimizer/dce.test.ts","../src2/__tests__/optimizer/pipeline.test.ts","../src2/emit/compile.ts","../src2/emit/index.ts","../src2/hir/lower.ts","../src2/hir/types.ts","../src2/lir/lower.ts","../src2/lir/types.ts","../src2/lir/verify.ts","../src2/mir/lower.ts","../src2/mir/macro.ts","../src2/mir/types.ts","../src2/mir/verify.ts","../src2/optimizer/block_merge.ts","../src2/optimizer/branch_simplify.ts","../src2/optimizer/constant_fold.ts","../src2/optimizer/copy_prop.ts","../src2/optimizer/dce.ts","../src2/optimizer/pipeline.ts"],"version":"5.9.3"}
+{"root":["../src/cli.ts","../src/compile.ts","../src/index.ts","../src/repl-server.ts","../src/repl.ts","../src/__tests__/array-dynamic.test.ts","../src/__tests__/array-param.test.ts","../src/__tests__/array-write.test.ts","../src/__tests__/budget.test.ts","../src/__tests__/builtins.test.ts","../src/__tests__/cache-extra.test.ts","../src/__tests__/cli-init.test.ts","../src/__tests__/cli-publish.test.ts","../src/__tests__/cli.test.ts","../src/__tests__/compile-all.test.ts","../src/__tests__/compile-preprocess.test.ts","../src/__tests__/config-decorator.test.ts","../src/__tests__/dce.test.ts","../src/__tests__/diagnostics-extra.test.ts","../src/__tests__/diagnostics.test.ts","../src/__tests__/double.test.ts","../src/__tests__/enum.test.ts","../src/__tests__/error-recovery.test.ts","../src/__tests__/events-types-extra.test.ts","../src/__tests__/events-types.test.ts","../src/__tests__/fixed.test.ts","../src/__tests__/float-lint.test.ts","../src/__tests__/float.test.ts","../src/__tests__/for-each.test.ts","../src/__tests__/for-range.test.ts","../src/__tests__/formatter.test.ts","../src/__tests__/generics.test.ts","../src/__tests__/impl.test.ts","../src/__tests__/incremental.test.ts","../src/__tests__/index-extra.test.ts","../src/__tests__/lexer.test.ts","../src/__tests__/lsp-logic.test.ts","../src/__tests__/lsp.test.ts","../src/__tests__/match.test.ts","../src/__tests__/mc-integration.test.ts","../src/__tests__/mc-syntax.test.ts","../src/__tests__/mc-validator-coverage.test.ts","../src/__tests__/mc-validator-extra.test.ts","../src/__tests__/mc-version.test.ts","../src/__tests__/modules.test.ts","../src/__tests__/option.test.ts","../src/__tests__/parser-coverage.test.ts","../src/__tests__/parser-extra.test.ts","../src/__tests__/parser.test.ts","../src/__tests__/repl-extra.test.ts","../src/__tests__/repl-server-extra.test.ts","../src/__tests__/repl-server.test.ts","../src/__tests__/repl.test.ts","../src/__tests__/runtime-extra.test.ts","../src/__tests__/runtime.test.ts","../src/__tests__/schedule.test.ts","../src/__tests__/singleton-decorator.test.ts","../src/__tests__/sourcemap.test.ts","../src/__tests__/stdlib-include.test.ts","../src/__tests__/struct-display.test.ts","../src/__tests__/tuple.test.ts","../src/__tests__/typechecker-coverage.test.ts","../src/__tests__/typechecker-strict.test.ts","../src/__tests__/typechecker.test.ts","../src/__tests__/watch-decorator.test.ts","../src/__tests__/cache/cache-behavior.test.ts","../src/__tests__/compiler/break-stmt.test.ts","../src/__tests__/compiler/const-decl.test.ts","../src/__tests__/compiler/continue-stmt.test.ts","../src/__tests__/compiler/coroutine-extended.test.ts","../src/__tests__/compiler/deprecated.test.ts","../src/__tests__/compiler/do-while.test.ts","../src/__tests__/compiler/enum-payload.test.ts","../src/__tests__/compiler/interface.test.ts","../src/__tests__/compiler/match-string.test.ts","../src/__tests__/compiler/method-chain.test.ts","../src/__tests__/compiler/module-import.test.ts","../src/__tests__/compiler/option-extensions.test.ts","../src/__tests__/compiler/profile-decorator.test.ts","../src/__tests__/compiler/string-advanced.test.ts","../src/__tests__/compiler/tuple-type.test.ts","../src/__tests__/compiler/watch-decorator.test.ts","../src/__tests__/e2e/basic.test.ts","../src/__tests__/e2e/coroutine.test.ts","../src/__tests__/e2e/ecs-stdlib.test.ts","../src/__tests__/e2e/events-stdlib.test.ts","../src/__tests__/e2e/fft-stdlib.test.ts","../src/__tests__/e2e/for-in-array.test.ts","../src/__tests__/e2e/macros.test.ts","../src/__tests__/e2e/migrate.test.ts","../src/__tests__/e2e/ode-stdlib.test.ts","../src/__tests__/e2e/stdlib-e2e.test.ts","../src/__tests__/emit/compile-branches.test.ts","../src/__tests__/emit/compile-coverage.test.ts","../src/__tests__/emit/compile-extra-branches.test.ts","../src/__tests__/emit/compile-mocked-branches.test.ts","../src/__tests__/emit/compile.test.ts","../src/__tests__/emit/index.test.ts","../src/__tests__/emit/modules-branches.test.ts","../src/__tests__/emit/modules-coverage.test.ts","../src/__tests__/emit/modules-errors.test.ts","../src/__tests__/emit/modules-extra.test.ts","../src/__tests__/emit/modules-rewrite.test.ts","../src/__tests__/hir/desugar.test.ts","../src/__tests__/hir/lower-extra.test.ts","../src/__tests__/hir/monomorphize-extra.test.ts","../src/__tests__/hir/monomorphize-extra2.test.ts","../src/__tests__/lint/rules.test.ts","../src/__tests__/lir/lower.test.ts","../src/__tests__/lir/types.test.ts","../src/__tests__/lir/verify.test.ts","../src/__tests__/lsp/completion.test.ts","../src/__tests__/lsp/definition.test.ts","../src/__tests__/mc-integration/item-entity-events.test.ts","../src/__tests__/mc-integration/stdlib-coverage-2.test.ts","../src/__tests__/mc-integration/stdlib-coverage-3.test.ts","../src/__tests__/mc-integration/stdlib-coverage-4.test.ts","../src/__tests__/mc-integration/stdlib-coverage-5.test.ts","../src/__tests__/mc-integration/stdlib-coverage-6.test.ts","../src/__tests__/mc-integration/stdlib-coverage-7.test.ts","../src/__tests__/mc-integration/stdlib-coverage.test.ts","../src/__tests__/mc-integration/syntax-coverage.test.ts","../src/__tests__/mir/arithmetic.test.ts","../src/__tests__/mir/control-flow.test.ts","../src/__tests__/mir/lower-extra.test.ts","../src/__tests__/mir/lower-extra2.test.ts","../src/__tests__/mir/lower-extra3.test.ts","../src/__tests__/mir/lower-extra4.test.ts","../src/__tests__/mir/lower-extra5.test.ts","../src/__tests__/mir/lower-extra6.test.ts","../src/__tests__/mir/lower-extra7.test.ts","../src/__tests__/mir/lower-extra8.test.ts","../src/__tests__/mir/lower-extra9.test.ts","../src/__tests__/mir/verify.test.ts","../src/__tests__/optimizer/block_merge.test.ts","../src/__tests__/optimizer/branch_simplify.test.ts","../src/__tests__/optimizer/constant_fold.test.ts","../src/__tests__/optimizer/copy_prop.test.ts","../src/__tests__/optimizer/coroutine.test.ts","../src/__tests__/optimizer/dce.test.ts","../src/__tests__/optimizer/inline_fn.test.ts","../src/__tests__/optimizer/interprocedural.test.ts","../src/__tests__/optimizer/nbt-batch.test.ts","../src/__tests__/optimizer/optimizer-extended.test.ts","../src/__tests__/optimizer/pipeline.test.ts","../src/__tests__/optimizer/selector-cache.test.ts","../src/__tests__/optimizer/unroll.test.ts","../src/__tests__/optimizer/lir/const_imm.test.ts","../src/__tests__/optimizer/lir/dead_slot.test.ts","../src/__tests__/optimizer/lir/peephole.test.ts","../src/__tests__/optimizer/lir/pipeline.test.ts","../src/__tests__/stdlib/advanced.test.ts","../src/__tests__/stdlib/arr-len.test.ts","../src/__tests__/stdlib/bigint.test.ts","../src/__tests__/stdlib/bits.test.ts","../src/__tests__/stdlib/bossbar.test.ts","../src/__tests__/stdlib/calculus.test.ts","../src/__tests__/stdlib/color.test.ts","../src/__tests__/stdlib/combat.test.ts","../src/__tests__/stdlib/cooldown.test.ts","../src/__tests__/stdlib/dialog.test.ts","../src/__tests__/stdlib/easing.test.ts","../src/__tests__/stdlib/ecs.test.ts","../src/__tests__/stdlib/effects.test.ts","../src/__tests__/stdlib/events.test.ts","../src/__tests__/stdlib/expr.test.ts","../src/__tests__/stdlib/fft.test.ts","../src/__tests__/stdlib/geometry.test.ts","../src/__tests__/stdlib/graph.test.ts","../src/__tests__/stdlib/heap.test.ts","../src/__tests__/stdlib/interactions.test.ts","../src/__tests__/stdlib/inventory.test.ts","../src/__tests__/stdlib/linalg.test.ts","../src/__tests__/stdlib/list.test.ts","../src/__tests__/stdlib/map.test.ts","../src/__tests__/stdlib/math.test.ts","../src/__tests__/stdlib/math_hp.test.ts","../src/__tests__/stdlib/matrix.test.ts","../src/__tests__/stdlib/mobs.test.ts","../src/__tests__/stdlib/noise.test.ts","../src/__tests__/stdlib/ode.test.ts","../src/__tests__/stdlib/parabola.test.ts","../src/__tests__/stdlib/particles.test.ts","../src/__tests__/stdlib/pathfind.test.ts","../src/__tests__/stdlib/physics.test.ts","../src/__tests__/stdlib/player.test.ts","../src/__tests__/stdlib/quaternion.test.ts","../src/__tests__/stdlib/random.test.ts","../src/__tests__/stdlib/result.test.ts","../src/__tests__/stdlib/scheduler.test.ts","../src/__tests__/stdlib/set_int.test.ts","../src/__tests__/stdlib/sets.test.ts","../src/__tests__/stdlib/signal.test.ts","../src/__tests__/stdlib/sort-v2.test.ts","../src/__tests__/stdlib/sort.test.ts","../src/__tests__/stdlib/spawn.test.ts","../src/__tests__/stdlib/state.test.ts","../src/__tests__/stdlib/string.test.ts","../src/__tests__/stdlib/strings.test.ts","../src/__tests__/stdlib/tags.test.ts","../src/__tests__/stdlib/teams.test.ts","../src/__tests__/stdlib/timer.test.ts","../src/__tests__/stdlib/vec.test.ts","../src/__tests__/stdlib/world.test.ts","../src/__tests__/tuner/adapters.test.ts","../src/__tests__/tuner/engine.test.ts","../src/__tests__/tuner/simulator-extra.test.ts","../src/ast/types.ts","../src/builtins/metadata.ts","../src/cache/deps.ts","../src/cache/incremental.ts","../src/cache/index.ts","../src/diagnostics/index.ts","../src/emit/compile.ts","../src/emit/index.ts","../src/emit/modules.ts","../src/emit/sourcemap.ts","../src/events/types.ts","../src/formatter/index.ts","../src/hir/deprecated.ts","../src/hir/lower.ts","../src/hir/monomorphize.ts","../src/hir/types.ts","../src/lexer/index.ts","../src/lint/index.ts","../src/lir/budget.ts","../src/lir/lower.ts","../src/lir/types.ts","../src/lir/verify.ts","../src/lsp/main.ts","../src/lsp/server.ts","../src/mc-test/client.ts","../src/mc-test/runner.ts","../src/mc-test/setup.ts","../src/mc-validator/index.ts","../src/mir/lower.ts","../src/mir/macro.ts","../src/mir/types.ts","../src/mir/verify.ts","../src/nbt/index.ts","../src/optimizer/block_merge.ts","../src/optimizer/branch_simplify.ts","../src/optimizer/constant_fold.ts","../src/optimizer/copy_prop.ts","../src/optimizer/coroutine.ts","../src/optimizer/dce.ts","../src/optimizer/inline.ts","../src/optimizer/interprocedural.ts","../src/optimizer/nbt-batch.ts","../src/optimizer/pipeline.ts","../src/optimizer/selector-cache.ts","../src/optimizer/unroll.ts","../src/optimizer/lir/const_imm.ts","../src/optimizer/lir/dead_slot.ts","../src/optimizer/lir/peephole.ts","../src/optimizer/lir/pipeline.ts","../src/parser/index.ts","../src/runtime/index.ts","../src/tuner/cli.ts","../src/tuner/engine.ts","../src/tuner/metrics.ts","../src/tuner/simulator.ts","../src/tuner/types.ts","../src/tuner/adapters/ln-polynomial.ts","../src/tuner/adapters/sqrt-newton.ts","../src/typechecker/index.ts","../src/types/entity-hierarchy.ts","../src/types/mc-version.ts"],"version":"5.9.3"}

package/doc-drafts/redscript-docs/docs/en/stdlib/graph.md

@@ -0,0 +1,104 @@
+# `graph` — Directed and Undirected Weighted Graphs
+
+Import: `import "stdlib/graph.mcrs"`
+
+Fixed-capacity graph utilities for RedScript datapacks. The graph is stored in a single flat `int[]`, supports up to **64 nodes** and **256 directed edges**, and provides traversal plus shortest-path helpers without any dynamic graph object type.
+
+## Data Layout
+
+`graph_new()` allocates a 770-element `int[]` with this layout:
+
+| Index | Meaning |
+|------|------|
+| `g[0]` | Current directed edge count |
+| `g[1]` | Node count |
+| `g[2 + i * 3]` | Edge `i` source |
+| `g[2 + i * 3 + 1]` | Edge `i` destination |
+| `g[2 + i * 3 + 2]` | Edge `i` weight |
+
+Nodes are zero-based integers in `[0, graph_node_count(g))`.
+
+## Quick Example
+
+```rs
+import "stdlib/graph.mcrs";
+
+let g: int[] = graph_new(5);
+g = graph_add_edge(g, 0, 1, 1);
+g = graph_add_edge(g, 0, 2, 4);
+g = graph_add_undirected(g, 2, 3, 2);
+g = graph_add_edge(g, 1, 3, 2);
+g = graph_add_edge(g, 3, 4, 1);
+
+let vis: int[] = [0, 0, 0, 0, 0];
+let bfs_order: int[] = graph_bfs(g, 0, vis);
+
+let dist: int[] = [0, 0, 0, 0, 0];
+let shortest: int = graph_shortest_path(g, 0, 4, dist);
+// shortest = 4 via 0 -> 1 -> 3 -> 4
+```
+
+## Functions
+
+### `graph_new(n: int): int[]`
+
+Allocate a new graph with `n` nodes and no edges. `n` is clamped to `[0, 64]`.
+
+### `graph_add_edge(g: int[], src: int, dst: int, weight: int): int[]`
+
+Append one directed edge `src -> dst`. If `src` or `dst` is invalid, or the graph already holds 256 directed edges, the input graph is returned unchanged.
+
+### `graph_add_undirected(g: int[], a: int, b: int, weight: int): int[]`
+
+Append `a -> b` and `b -> a` with the same weight. This consumes two directed-edge slots.
+
+### `graph_node_count(g: int[]): int`
+
+Return the configured node count.
+
+### `graph_edge_count(g: int[]): int`
+
+Return the current directed edge count.
+
+### `graph_bfs(g: int[], start: int, out_visited: int[]): int[]`
+
+Breadth-first search from `start`.
+
+- Returns node indices in BFS visit order.
+- Writes `1` into `out_visited[i]` for each reachable node.
+- Returns `[]` if `start` is invalid.
+
+`out_visited` must have at least `graph_node_count(g)` slots and should be zero-initialized by the caller.
+
+### `graph_dfs(g: int[], start: int, out_visited: int[]): int[]`
+
+Depth-first search from `start`.
+
+- Returns node indices in DFS visit order.
+- Writes `1` into `out_visited[i]` for each reachable node.
+- Returns `[]` if `start` is invalid.
+
+Like `graph_bfs()`, the caller owns the output array sizing.
+
+### `graph_has_path(g: int[], src: int, dst: int): int`
+
+Return `1` if a directed path exists from `src` to `dst`, otherwise `0`.
+
+- Invalid endpoints also return `0`.
+- The implementation uses BFS over the stored directed edges.
+
+### `graph_shortest_path(g: int[], src: int, dst: int, out_dist: int[]): int`
+
+Run Dijkstra from `src` and fill `out_dist` with shortest distances.
+
+- `out_dist[i]` becomes the shortest distance from `src` to node `i`.
+- Unreachable nodes are written as `-1`.
+- The function returns `out_dist[dst]`.
+- Invalid `src` or `dst` returns `-1`.
+
+## Notes
+
+- Edge weights are plain integers.
+- Negative weights are not supported safely because the algorithm is Dijkstra.
+- `graph_bfs()` and `graph_dfs()` use fixed-size internal arrays sized for 64 nodes.
+- `graph_shortest_path()` uses `999999` as its internal infinity sentinel.

package/doc-drafts/redscript-docs/docs/en/stdlib/parabola.md

@@ -0,0 +1,113 @@
+# `parabola` — Projectile Aiming and Trajectory Helpers
+
+Import: `import "stdlib/parabola.mcrs"`
+
+Projectile helpers for Minecraft-style trajectories. This module is aimed at launch planning and simple tick-by-tick simulation. It uses **×10000 fixed-point velocities** and a gravity constant tuned to Minecraft projectile motion.
+
+## Units
+
+- Position offsets: blocks
+- Velocity: blocks/tick ×10000
+- Time: ticks
+- Gravity: `800` means `0.08 blocks/tick^2`
+- Drag: ×10000
+
+Requires `stdlib/math` for `mulfix()` and `isqrt()`.
+
+## Quick Example
+
+```rs
+import "stdlib/parabola.mcrs";
+
+let ticks: int = 20;
+let vx: int = parabola_vx(16, ticks);
+let vy: int = parabola_vy(4, ticks);
+let vz: int = parabola_vz(0, ticks);
+
+let y_at_10: int = parabola_y(vy, 10);
+let flight: int = parabola_flight_time(vy);
+```
+
+## Constants
+
+### `parabola_gravity(): int`
+
+Returns `800`, the per-tick gravity constant in ×10000 scale.
+
+### `parabola_gravity_half(): int`
+
+Returns `400`, used by the displacement formulas.
+
+## Velocity Solvers
+
+### `parabola_vx(dx: int, ticks: int): int`
+
+Initial X velocity needed to travel `dx` blocks in `ticks` ticks. Returns `0` if `ticks <= 0`.
+
+### `parabola_vy(dy: int, ticks: int): int`
+
+Initial Y velocity needed to reach vertical offset `dy` in `ticks` ticks under constant gravity. Returns `0` if `ticks <= 0`.
+
+### `parabola_vz(dz: int, ticks: int): int`
+
+Initial Z velocity needed to travel `dz` blocks in `ticks` ticks. Returns `0` if `ticks <= 0`.
+
+### `parabola_speed_xz(dx: int, dz: int, ticks: int): int`
+
+Horizontal speed magnitude from the solved `vx` and `vz`, returned in ×10000 scale.
+
+## Position at Tick `t`
+
+### `parabola_x(vx0: int, t: int): int`
+
+Horizontal X displacement after `t` ticks.
+
+### `parabola_y(vy0: int, t: int): int`
+
+Vertical displacement after `t` ticks under constant gravity.
+
+### `parabola_z(vz0: int, t: int): int`
+
+Horizontal Z displacement after `t` ticks.
+
+## Flight Estimates
+
+### `parabola_flight_time(vy0: int): int`
+
+Approximate number of ticks until a projectile returns to launch height. Returns `0` if `vy0 <= 0`.
+
+### `parabola_max_height(vy0: int): int`
+
+Approximate maximum height above launch point, in blocks.
+
+## Tick-Step Drag Helpers
+
+These functions are for per-tick simulation, not closed-form aiming.
+
+### `parabola_step_vx(vx: int, drag: int): int`
+
+Apply drag to X velocity.
+
+### `parabola_step_vy(vy: int, drag: int): int`
+
+Apply gravity first, then drag, to Y velocity.
+
+### `parabola_step_vz(vz: int, drag: int): int`
+
+Apply drag to Z velocity.
+
+## Targeting Helpers
+
+### `parabola_ticks_for_range(range: int): int`
+
+Estimate a practical flight time for a horizontal range, using a simple average-speed heuristic. Returns at least `1`.
+
+### `parabola_in_range(dx: int, dz: int, max_range: int): int`
+
+Return `1` if the horizontal target lies within `max_range`, otherwise `0`.
+
+## Notes
+
+- Closed-form position helpers here assume no drag.
+- Drag-aware helpers only advance velocity one tick at a time.
+- `parabola_y()` and `parabola_max_height()` return integer block values, so truncation is expected.