redscript-mc 3.0.0 → 3.0.2

package/dist/src2/optimizer/block_merge.js

@@ -1,84 +0,0 @@
-"use strict";
-/**
- * Block Merging — MIR optimization pass.
- *
- * Merges a block B into its sole predecessor A when:
- * - A ends with an unconditional jump to B
- * - B has exactly one predecessor (A)
- * - B is not the entry block
- *
- * The merged block keeps A's id and combines A's instrs + B's instrs + B's terminator.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.blockMerge = blockMerge;
-function blockMerge(fn) {
-    let blocks = fn.blocks;
-    // Iterate until no more merges possible
-    let changed = true;
-    while (changed) {
-        changed = false;
-        const blockMap = new Map(blocks.map(b => [b.id, b]));
-        const predCounts = computePredCounts(blocks);
-        const newBlocks = [];
-        const removed = new Set();
-        for (const block of blocks) {
-            if (removed.has(block.id))
-                continue;
-            // Check: does this block jump unconditionally to a single-pred successor?
-            if (block.term.kind === 'jump') {
-                const targetId = block.term.target;
-                const target = blockMap.get(targetId);
-                if (target && targetId !== fn.entry && predCounts.get(targetId) === 1) {
-                    // Merge target into this block
-                    const merged = {
-                        id: block.id,
-                        instrs: [...block.instrs, ...target.instrs],
-                        term: target.term,
-                        preds: block.preds,
-                    };
-                    newBlocks.push(merged);
-                    removed.add(targetId);
-                    changed = true;
-                    continue;
-                }
-            }
-            newBlocks.push(block);
-        }
-        blocks = newBlocks;
-    }
-    // Recompute preds after merging
-    blocks = recomputePreds(blocks);
-    return { ...fn, blocks };
-}
-function computePredCounts(blocks) {
-    const counts = new Map();
-    for (const b of blocks)
-        counts.set(b.id, 0);
-    for (const block of blocks) {
-        for (const target of getTermTargets(block.term)) {
-            counts.set(target, (counts.get(target) ?? 0) + 1);
-        }
-    }
-    return counts;
-}
-function recomputePreds(blocks) {
-    const predMap = new Map();
-    for (const b of blocks)
-        predMap.set(b.id, []);
-    for (const block of blocks) {
-        for (const target of getTermTargets(block.term)) {
-            const preds = predMap.get(target);
-            if (preds)
-                preds.push(block.id);
-        }
-    }
-    return blocks.map(b => ({ ...b, preds: predMap.get(b.id) ?? [] }));
-}
-function getTermTargets(term) {
-    switch (term.kind) {
-        case 'jump': return [term.target];
-        case 'branch': return [term.then, term.else];
-        default: return [];
-    }
-}
-//# sourceMappingURL=block_merge.js.map

package/dist/src2/optimizer/branch_simplify.d.ts

@@ -1,9 +0,0 @@
-/**
- * Branch Simplification — MIR optimization pass.
- *
- * Replaces `branch(const, then, else)` with an unconditional `jump`:
- * - branch(nonzero, then, else) → jump(then)
- * - branch(0, then, else) → jump(else)
- */
-import type { MIRFunction } from '../mir/types';
-export declare function branchSimplify(fn: MIRFunction): MIRFunction;

package/dist/src2/optimizer/branch_simplify.js

@@ -1,28 +0,0 @@
-"use strict";
-/**
- * Branch Simplification — MIR optimization pass.
- *
- * Replaces `branch(const, then, else)` with an unconditional `jump`:
- * - branch(nonzero, then, else) → jump(then)
- * - branch(0, then, else) → jump(else)
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.branchSimplify = branchSimplify;
-function branchSimplify(fn) {
-    return {
-        ...fn,
-        blocks: fn.blocks.map(simplifyBlock),
-    };
-}
-function simplifyBlock(block) {
-    if (block.term.kind !== 'branch')
-        return block;
-    if (block.term.cond.kind !== 'const')
-        return block;
-    const target = block.term.cond.value !== 0 ? block.term.then : block.term.else;
-    return {
-        ...block,
-        term: { kind: 'jump', target },
-    };
-}
-//# sourceMappingURL=branch_simplify.js.map

package/dist/src2/optimizer/constant_fold.d.ts

@@ -1,10 +0,0 @@
-/**
- * Constant Folding — MIR optimization pass.
- *
- * Folds instructions where all operands are constants:
- * - Arithmetic: add(3, 4) → 7, neg(5) → -5
- * - Comparison: cmp(lt, 3, 4) → 1
- * - Boolean: and(1, 0) → 0, not(0) → 1
- */
-import type { MIRFunction } from '../mir/types';
-export declare function constantFold(fn: MIRFunction): MIRFunction;

package/dist/src2/optimizer/constant_fold.js

@@ -1,85 +0,0 @@
-"use strict";
-/**
- * Constant Folding — MIR optimization pass.
- *
- * Folds instructions where all operands are constants:
- * - Arithmetic: add(3, 4) → 7, neg(5) → -5
- * - Comparison: cmp(lt, 3, 4) → 1
- * - Boolean: and(1, 0) → 0, not(0) → 1
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.constantFold = constantFold;
-function constantFold(fn) {
-    return {
-        ...fn,
-        blocks: fn.blocks.map(foldBlock),
-    };
-}
-function foldBlock(block) {
-    const instrs = [];
-    for (const instr of block.instrs) {
-        const folded = tryFold(instr);
-        instrs.push(folded ?? instr);
-    }
-    return { ...block, instrs };
-}
-function isConst(op) {
-    return op.kind === 'const';
-}
-function tryFold(instr) {
-    switch (instr.kind) {
-        case 'add':
-            if (isConst(instr.a) && isConst(instr.b))
-                return { kind: 'const', dst: instr.dst, value: instr.a.value + instr.b.value };
-            break;
-        case 'sub':
-            if (isConst(instr.a) && isConst(instr.b))
-                return { kind: 'const', dst: instr.dst, value: instr.a.value - instr.b.value };
-            break;
-        case 'mul':
-            if (isConst(instr.a) && isConst(instr.b))
-                return { kind: 'const', dst: instr.dst, value: instr.a.value * instr.b.value };
-            break;
-        case 'div':
-            if (isConst(instr.a) && isConst(instr.b) && instr.b.value !== 0)
-                return { kind: 'const', dst: instr.dst, value: Math.trunc(instr.a.value / instr.b.value) };
-            break;
-        case 'mod':
-            if (isConst(instr.a) && isConst(instr.b) && instr.b.value !== 0)
-                return { kind: 'const', dst: instr.dst, value: instr.a.value % instr.b.value };
-            break;
-        case 'neg':
-            if (isConst(instr.src))
-                return { kind: 'const', dst: instr.dst, value: -instr.src.value };
-            break;
-        case 'not':
-            if (isConst(instr.src))
-                return { kind: 'const', dst: instr.dst, value: instr.src.value === 0 ? 1 : 0 };
-            break;
-        case 'and':
-            if (isConst(instr.a) && isConst(instr.b))
-                return { kind: 'const', dst: instr.dst, value: (instr.a.value !== 0 && instr.b.value !== 0) ? 1 : 0 };
-            break;
-        case 'or':
-            if (isConst(instr.a) && isConst(instr.b))
-                return { kind: 'const', dst: instr.dst, value: (instr.a.value !== 0 || instr.b.value !== 0) ? 1 : 0 };
-            break;
-        case 'cmp':
-            if (isConst(instr.a) && isConst(instr.b))
-                return { kind: 'const', dst: instr.dst, value: evalCmp(instr.op, instr.a.value, instr.b.value) };
-            break;
-    }
-    return null;
-}
-function evalCmp(op, a, b) {
-    switch (op) {
-        case 'eq': return a === b ? 1 : 0;
-        case 'ne': return a !== b ? 1 : 0;
-        case 'lt': return a < b ? 1 : 0;
-        case 'le': return a <= b ? 1 : 0;
-        case 'gt': return a > b ? 1 : 0;
-        case 'ge': return a >= b ? 1 : 0;
-        default: return 0;
-    }
-}
-//# sourceMappingURL=constant_fold.js.map

package/dist/src2/optimizer/copy_prop.d.ts

@@ -1,9 +0,0 @@
-/**
- * Copy Propagation — MIR optimization pass.
- *
- * Within each block, tracks `copy dst, src` and `const dst, value` instructions
- * and replaces subsequent uses of `dst` with the known operand.
- * Invalidates mappings when a temp is redefined (written to).
- */
-import type { MIRFunction } from '../mir/types';
-export declare function copyProp(fn: MIRFunction): MIRFunction;

package/dist/src2/optimizer/copy_prop.js

@@ -1,113 +0,0 @@
-"use strict";
-/**
- * Copy Propagation — MIR optimization pass.
- *
- * Within each block, tracks `copy dst, src` and `const dst, value` instructions
- * and replaces subsequent uses of `dst` with the known operand.
- * Invalidates mappings when a temp is redefined (written to).
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.copyProp = copyProp;
-function copyProp(fn) {
-    return {
-        ...fn,
-        blocks: fn.blocks.map(propBlock),
-    };
-}
-function propBlock(block) {
-    // Map from temp → the operand it was copied from
-    const copies = new Map();
-    const instrs = [];
-    for (const instr of block.instrs) {
-        // Rewrite uses first
-        const rewritten = rewriteUses(instr, copies);
-        // Invalidate any mapping whose source was just redefined
-        const dst = getDst(rewritten);
-        if (dst) {
-            // Remove any mapping that points TO this dst (as a temp source)
-            for (const [k, v] of copies) {
-                if (v.kind === 'temp' && v.name === dst) {
-                    copies.delete(k);
-                }
-            }
-            // Remove dst's own previous mapping (will be re-added below if applicable)
-            copies.delete(dst);
-        }
-        // Track new propagatable definitions
-        if (rewritten.kind === 'const') {
-            // const dst, value → record dst → const operand
-            copies.set(rewritten.dst, { kind: 'const', value: rewritten.value });
-        }
-        else if (rewritten.kind === 'copy') {
-            // copy dst, src → record dst → src (temp or const)
-            copies.set(rewritten.dst, rewritten.src);
-        }
-        instrs.push(rewritten);
-    }
-    // Also rewrite terminator uses
-    const term = rewriteUses(block.term, copies);
-    return { ...block, instrs, term };
-}
-function resolve(op, copies) {
-    if (op.kind === 'temp') {
-        const replacement = copies.get(op.name);
-        if (replacement)
-            return replacement;
-    }
-    return op;
-}
-function rewriteUses(instr, copies) {
-    switch (instr.kind) {
-        case 'copy':
-            return { ...instr, src: resolve(instr.src, copies) };
-        case 'neg':
-        case 'not':
-            return { ...instr, src: resolve(instr.src, copies) };
-        case 'add':
-        case 'sub':
-        case 'mul':
-        case 'div':
-        case 'mod':
-        case 'and':
-        case 'or':
-            return { ...instr, a: resolve(instr.a, copies), b: resolve(instr.b, copies) };
-        case 'cmp':
-            return { ...instr, a: resolve(instr.a, copies), b: resolve(instr.b, copies) };
-        case 'nbt_write':
-            return { ...instr, src: resolve(instr.src, copies) };
-        case 'call':
-            return { ...instr, args: instr.args.map(a => resolve(a, copies)) };
-        case 'call_macro':
-            return { ...instr, args: instr.args.map(a => ({ ...a, value: resolve(a.value, copies) })) };
-        case 'branch':
-            return { ...instr, cond: resolve(instr.cond, copies) };
-        case 'return':
-            return { ...instr, value: instr.value ? resolve(instr.value, copies) : null };
-        default:
-            return instr;
-    }
-}
-function getDst(instr) {
-    switch (instr.kind) {
-        case 'const':
-        case 'copy':
-        case 'add':
-        case 'sub':
-        case 'mul':
-        case 'div':
-        case 'mod':
-        case 'neg':
-        case 'cmp':
-        case 'and':
-        case 'or':
-        case 'not':
-        case 'nbt_read':
-            return instr.dst;
-        case 'call':
-        case 'call_macro':
-            return instr.dst;
-        default:
-            return null;
-    }
-}
-//# sourceMappingURL=copy_prop.js.map

package/dist/src2/optimizer/dce.d.ts

@@ -1,8 +0,0 @@
-/**
- * Dead Code Elimination — MIR optimization pass.
- *
- * 1. Removes definitions of temps that are never used anywhere in the function.
- * 2. Removes unreachable blocks (no predecessors and not the entry block).
- */
-import type { MIRFunction } from '../mir/types';
-export declare function dce(fn: MIRFunction): MIRFunction;

package/dist/src2/optimizer/dce.js

@@ -1,155 +0,0 @@
-"use strict";
-/**
- * Dead Code Elimination — MIR optimization pass.
- *
- * 1. Removes definitions of temps that are never used anywhere in the function.
- * 2. Removes unreachable blocks (no predecessors and not the entry block).
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.dce = dce;
-function dce(fn) {
-    // Phase 1: Remove unreachable blocks
-    let blocks = removeUnreachable(fn);
-    // Phase 2: Remove unused temp definitions
-    blocks = removeDeadDefs(fn.params, blocks);
-    // Phase 3: Recompute preds after block removal
-    blocks = recomputePreds(blocks);
-    return { ...fn, blocks };
-}
-function removeUnreachable(fn) {
-    const reachable = new Set();
-    const queue = [fn.entry];
-    const blockMap = new Map(fn.blocks.map(b => [b.id, b]));
-    while (queue.length > 0) {
-        const id = queue.shift();
-        if (reachable.has(id))
-            continue;
-        reachable.add(id);
-        const block = blockMap.get(id);
-        if (block) {
-            for (const target of getTermTargets(block.term)) {
-                if (!reachable.has(target))
-                    queue.push(target);
-            }
-        }
-    }
-    return fn.blocks.filter(b => reachable.has(b.id));
-}
-function removeDeadDefs(params, blocks) {
-    // Collect all used temps across the entire function
-    const used = new Set();
-    for (const block of blocks) {
-        for (const instr of block.instrs) {
-            for (const t of getUsedTemps(instr))
-                used.add(t);
-        }
-        for (const t of getUsedTemps(block.term))
-            used.add(t);
-    }
-    // Remove instructions whose dst is never used, unless they have side effects
-    return blocks.map(block => ({
-        ...block,
-        instrs: block.instrs.filter(instr => {
-            const dst = getDst(instr);
-            if (dst === null)
-                return true; // no dst → keep (side-effectful)
-            if (hasSideEffects(instr))
-                return true;
-            return used.has(dst);
-        }),
-    }));
-}
-function recomputePreds(blocks) {
-    const predMap = new Map();
-    for (const b of blocks)
-        predMap.set(b.id, []);
-    for (const block of blocks) {
-        for (const target of getTermTargets(block.term)) {
-            const preds = predMap.get(target);
-            if (preds)
-                preds.push(block.id);
-        }
-    }
-    return blocks.map(b => ({ ...b, preds: predMap.get(b.id) ?? [] }));
-}
-function hasSideEffects(instr) {
-    if (instr.kind === 'call' || instr.kind === 'call_macro' ||
-        instr.kind === 'call_context' || instr.kind === 'nbt_write')
-        return true;
-    // Return field temps (__rf_) write to global return slots — not dead even if unused locally
-    const dst = getDst(instr);
-    if (dst && dst.startsWith('__rf_'))
-        return true;
-    return false;
-}
-function getTermTargets(term) {
-    switch (term.kind) {
-        case 'jump': return [term.target];
-        case 'branch': return [term.then, term.else];
-        default: return [];
-    }
-}
-function getDst(instr) {
-    switch (instr.kind) {
-        case 'const':
-        case 'copy':
-        case 'add':
-        case 'sub':
-        case 'mul':
-        case 'div':
-        case 'mod':
-        case 'neg':
-        case 'cmp':
-        case 'and':
-        case 'or':
-        case 'not':
-        case 'nbt_read':
-            return instr.dst;
-        case 'call':
-        case 'call_macro':
-            return instr.dst;
-        default:
-            return null;
-    }
-}
-function getUsedTemps(instr) {
-    const temps = [];
-    const addOp = (op) => { if (op.kind === 'temp')
-        temps.push(op.name); };
-    switch (instr.kind) {
-        case 'copy':
-        case 'neg':
-        case 'not':
-            addOp(instr.src);
-            break;
-        case 'add':
-        case 'sub':
-        case 'mul':
-        case 'div':
-        case 'mod':
-        case 'cmp':
-        case 'and':
-        case 'or':
-            addOp(instr.a);
-            addOp(instr.b);
-            break;
-        case 'nbt_write':
-            addOp(instr.src);
-            break;
-        case 'call':
-            instr.args.forEach(addOp);
-            break;
-        case 'call_macro':
-            instr.args.forEach(a => addOp(a.value));
-            break;
-        case 'branch':
-            addOp(instr.cond);
-            break;
-        case 'return':
-            if (instr.value)
-                addOp(instr.value);
-            break;
-    }
-    return temps;
-}
-//# sourceMappingURL=dce.js.map

package/dist/src2/optimizer/pipeline.d.ts

@@ -1,10 +0,0 @@
-/**
- * MIR Optimization Pipeline — runs all passes to a fixpoint.
- *
- * Each pass is a function MIRFunction → MIRFunction.
- * The pipeline iterates until no pass changes the function (fixpoint).
- */
-import type { MIRFunction, MIRModule } from '../mir/types';
-export type Pass = (fn: MIRFunction) => MIRFunction;
-export declare function optimizeFunction(fn: MIRFunction, passes?: Pass[]): MIRFunction;
-export declare function optimizeModule(mod: MIRModule, passes?: Pass[]): MIRModule;

package/dist/src2/optimizer/pipeline.js

@@ -1,42 +0,0 @@
-"use strict";
-/**
- * MIR Optimization Pipeline — runs all passes to a fixpoint.
- *
- * Each pass is a function MIRFunction → MIRFunction.
- * The pipeline iterates until no pass changes the function (fixpoint).
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.optimizeFunction = optimizeFunction;
-exports.optimizeModule = optimizeModule;
-const constant_fold_1 = require("./constant_fold");
-const copy_prop_1 = require("./copy_prop");
-const dce_1 = require("./dce");
-const block_merge_1 = require("./block_merge");
-const branch_simplify_1 = require("./branch_simplify");
-const defaultPasses = [
-    constant_fold_1.constantFold,
-    copy_prop_1.copyProp,
-    branch_simplify_1.branchSimplify,
-    dce_1.dce,
-    block_merge_1.blockMerge,
-];
-const MAX_ITERATIONS = 20;
-function optimizeFunction(fn, passes = defaultPasses) {
-    let current = fn;
-    for (let i = 0; i < MAX_ITERATIONS; i++) {
-        const before = JSON.stringify(current);
-        for (const pass of passes) {
-            current = pass(current);
-        }
-        if (JSON.stringify(current) === before)
-            break;
-    }
-    return current;
-}
-function optimizeModule(mod, passes) {
-    return {
-        ...mod,
-        functions: mod.functions.map(fn => optimizeFunction(fn, passes)),
-    };
-}
-//# sourceMappingURL=pipeline.js.map

package/dist/swap_test.map.json

@@ -1,14 +0,0 @@
-{
-  "$b": "a",
-  "$d": "b",
-  "$f": "p0",
-  "$g": "p1",
-  "$h": "x",
-  "$i": "y",
-  "$k": "tmp",
-  "$n": "m",
-  "$a": "const:0",
-  "$c": "internal:p0",
-  "$e": "internal:p1",
-  "$m": "internal:ret"
-}

package/dist/tsconfig.tsbuildinfo

@@ -1 +0,0 @@
-{"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/dist/typechecker/index.d.ts

@@ -1,61 +0,0 @@
-/**
- * RedScript Type Checker
- *
- * Performs basic type checking between Parser and Lowering phases.
- * Collects errors but doesn't block compilation (warn mode).
- */
-import type { Program } from '../ast/types';
-import { DiagnosticError } from '../diagnostics';
-export declare class TypeChecker {
-    private collector;
-    private functions;
-    private implMethods;
-    private structs;
-    private enums;
-    private consts;
-    private currentFn;
-    private currentReturnType;
-    private scope;
-    private selfTypeStack;
-    private readonly richTextBuiltins;
-    constructor(source?: string, filePath?: string);
-    private getNodeLocation;
-    private report;
-    /**
-     * Type check a program. Returns collected errors.
-     */
-    check(program: Program): DiagnosticError[];
-    private checkFunction;
-    private checkFunctionDecorators;
-    private checkBlock;
-    private checkStmt;
-    private checkLetStmt;
-    private checkReturnStmt;
-    private checkExpr;
-    private checkCallExpr;
-    private checkRichTextBuiltinCall;
-    private checkInvokeExpr;
-    private checkFunctionCallArgs;
-    private checkTpCall;
-    private checkMemberExpr;
-    private checkStaticCallExpr;
-    private checkLambdaExpr;
-    private checkIfBranches;
-    private getThenBranchNarrowing;
-    private inferType;
-    private inferLambdaType;
-    /** Infer entity type from a selector */
-    private inferEntityTypeFromSelector;
-    private resolveInstanceMethod;
-    /** Check if childType is a subtype of parentType */
-    private isEntitySubtype;
-    /** Push a new self type context */
-    private pushSelfType;
-    /** Pop self type context */
-    private popSelfType;
-    /** Get current @s type */
-    private getCurrentSelfType;
-    private typesMatch;
-    private typeToString;
-    private normalizeType;
-}