@aster-cloud/aster-lang-ts 1.0.30 → 1.0.32

package/dist/test/unit/list-numeric-fail-loud.test.js

@@ -0,0 +1,83 @@
+import { describe, it } from 'node:test';
+import assert from 'node:assert/strict';
+import { compile } from '../../src/browser.js';
+import { evaluate } from '../../src/core/interpreter.js';
+// List.sum/min/max/sort/sortBy/minBy/maxBy 对非数值元素必须**响亮失败**，
+// 与 truffle `Builtins.toDouble`（`Double.parseDouble` 抛 NumberFormatException）对齐。
+//
+// ★修复前（issue #193）：这七个 builtin 直接 `Number(x)`，`Number("2o")` 得 NaN 后
+//   sum 静默产出 NaN、max/min 因 `NaN > x` 恒假静默返回首元素、sort 顺序未定义——
+//   规则跑通了、结果是错的，且与 Java 侧一个响亮失败一个静默错答案。
+function run(expr, ret = 'Int', rules = '') {
+    const c = compile(`Module probe.\n${rules}Rule r given a as Int, produce ${ret}:\n  Return ${expr}.\n`);
+    if (!c.core)
+        return { ok: false, value: undefined, error: 'compile failed' };
+    const ev = evaluate(c.core, 'r', { a: 1 });
+    return { ok: ev.success, value: ev.value, error: String(ev.error ?? '') };
+}
+const ID_RULE = 'Rule id given x, produce:\n  Return x.\n';
+describe('List 数值 builtin 对非数值元素响亮失败（与 truffle toDouble 对齐）', () => {
+    const cases = [
+        ['List.sum', 'List.sum(["10", "2o"])', 'Int'],
+        ['List.min', 'List.min(["x", "y"])', 'Text'],
+        ['List.max', 'List.max(["x", "y"])', 'Text'],
+        ['List.sort', 'List.get(List.sort(["1", "b"]), 0)', 'Text'],
+        ['List.sum 空串', 'List.sum([""])', 'Int'],
+        ['List.sum 字符串 NaN', 'List.sum(["NaN"])', 'Int'],
+        ['List.sum 字符串 Infinity', 'List.sum(["Infinity"])', 'Int'],
+        ['List.sum 十六进制', 'List.sum(["0x10"])', 'Int'],
+        ['List.sum 布尔', 'List.sum([true])', 'Int'],
+    ];
+    for (const [name, expr, ret] of cases) {
+        it(`${name} 非数值元素必须报错，而不是静默给答案`, () => {
+            const r = run(expr, ret);
+            assert.equal(r.ok, false, `★${name} 静默返回了 ${JSON.stringify(r.value)}——静默错答案比报错危险`);
+            assert.match(r.error, /expected Number/i);
+        });
+    }
+    const keyed = [
+        ['List.sortBy', 'List.get(List.sortBy(["1", "b"], id), 0)', 'Text'],
+        ['List.minBy', 'List.minBy(["x", "y"], id)', 'Text'],
+        ['List.maxBy', 'List.maxBy(["x", "y"], id)', 'Text'],
+    ];
+    for (const [name, expr, ret] of keyed) {
+        it(`${name} 键函数返回非数值必须报错`, () => {
+            const r = run(expr, ret, ID_RULE);
+            assert.equal(r.ok, false, `★${name} 静默返回了 ${JSON.stringify(r.value)}`);
+            assert.match(r.error, /expected Number/i);
+        });
+    }
+    // 反向保险：合法数值（含可解析的字符串、前后空白）不得被误伤
+    it('数值列表照常工作', () => {
+        assert.equal(run('List.sum([3, 8, 1, 9])').value, 21);
+        assert.equal(run('List.max([3, 8, 1, 9])').value, 9);
+        assert.equal(run('List.min([3, 8, 1, 9])').value, 1);
+        assert.equal(run('List.get(List.sort([3, 8, 1]), 0)').value, 1);
+        assert.equal(run('List.maxBy([3, 8, 1], id)', 'Int', ID_RULE).value, 8);
+    });
+    it('可解析的数值字符串（含前后空白、小数、科学计数）照常换算', () => {
+        assert.equal(run('List.sum(["10", " 2 ", "1.5", "1e1"])', 'Decimal').value, 23.5);
+        assert.equal(run('List.max(["10", "9"])', 'Text').value, '10');
+    });
+});
+// ★issue #204：List.combinations 的 k 曾是裸 Number()，Number.isInteger 只拦得住 NaN：
+//   ""→0、true→1、"0x2"→2 静默被接受，而 truffle 侧 toInt（Integer.parseInt）一律抛错。
+describe('List.combinations 的 k 非法时响亮失败（与 truffle toInt 对齐）', () => {
+    for (const k of ['""', 'true', '"0x2"', '"2o"', '"2.0"']) {
+        it(`k=${k} 必须报错，而不是静默给答案`, () => {
+            const r = run(`List.length(List.combinations([1, 2, 3], ${k}))`);
+            assert.equal(r.ok, false, `★静默返回了 ${JSON.stringify(r.value)}`);
+            assert.match(r.error, /List\.combinations: expected Int/);
+        });
+    }
+    it('k 为负数仍报错', () => {
+        const r = run('List.length(List.combinations([1, 2, 3], 0 minus 1))');
+        assert.equal(r.ok, false);
+        assert.match(r.error, /非负整数/);
+    });
+    it('合法 k（数字、整数字符串）照常工作', () => {
+        assert.equal(run('List.length(List.combinations([1, 2, 3], 2))').value, 3);
+        assert.equal(run('List.length(List.combinations([1, 2, 3], "2"))').value, 3);
+    });
+});
+//# sourceMappingURL=list-numeric-fail-loud.test.js.map

package/dist/test/unit/list-numeric-fail-loud.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"list-numeric-fail-loud.test.js","sourceRoot":"","sources":["../../../test/unit/list-numeric-fail-loud.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,WAAW,CAAC;AACzC,OAAO,MAAM,MAAM,oBAAoB,CAAC;AACxC,OAAO,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAC/C,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAEzD,6DAA6D;AAC7D,iFAAiF;AACjF,EAAE;AACF,qEAAqE;AACrE,4DAA4D;AAC5D,wCAAwC;AACxC,SAAS,GAAG,CAAC,IAAY,EAAE,GAAG,GAAG,KAAK,EAAE,KAAK,GAAG,EAAE;IAChD,MAAM,CAAC,GAAG,OAAO,CAAC,kBAAkB,KAAK,kCAAkC,GAAG,eAAe,IAAI,KAAK,CAAC,CAAC;IACxG,IAAI,CAAC,CAAC,CAAC,IAAI;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC;IAC7E,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC3C,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE,CAAC;AAC5E,CAAC;AAED,MAAM,OAAO,GAAG,0CAA0C,CAAC;AAE3D,QAAQ,CAAC,mDAAmD,EAAE,GAAG,EAAE;IACjE,MAAM,KAAK,GAAoC;QAC7C,CAAC,UAAU,EAAE,wBAAwB,EAAE,KAAK,CAAC;QAC7C,CAAC,UAAU,EAAE,sBAAsB,EAAE,MAAM,CAAC;QAC5C,CAAC,UAAU,EAAE,sBAAsB,EAAE,MAAM,CAAC;QAC5C,CAAC,WAAW,EAAE,oCAAoC,EAAE,MAAM,CAAC;QAC3D,CAAC,aAAa,EAAE,gBAAgB,EAAE,KAAK,CAAC;QACxC,CAAC,kBAAkB,EAAE,mBAAmB,EAAE,KAAK,CAAC;QAChD,CAAC,uBAAuB,EAAE,wBAAwB,EAAE,KAAK,CAAC;QAC1D,CAAC,eAAe,EAAE,oBAAoB,EAAE,KAAK,CAAC;QAC9C,CAAC,aAAa,EAAE,kBAAkB,EAAE,KAAK,CAAC;KAC3C,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC;QACtC,EAAE,CAAC,GAAG,IAAI,qBAAqB,EAAE,GAAG,EAAE;YACpC,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACzB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,IAAI,UAAU,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;YACnF,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;IACL,CAAC;IAED,MAAM,KAAK,GAAoC;QAC7C,CAAC,aAAa,EAAE,0CAA0C,EAAE,MAAM,CAAC;QACnE,CAAC,YAAY,EAAE,4BAA4B,EAAE,MAAM,CAAC;QACpD,CAAC,YAAY,EAAE,4BAA4B,EAAE,MAAM,CAAC;KACrD,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC;QACtC,EAAE,CAAC,GAAG,IAAI,eAAe,EAAE,GAAG,EAAE;YAC9B,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;YAClC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,IAAI,UAAU,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACvE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;IACL,CAAC;IAED,gCAAgC;IAChC,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE;QAClB,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACtD,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACrD,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACrD,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,mCAAmC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAChE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,2BAA2B,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,uCAAuC,EAAE,SAAS,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAClF,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,uBAAuB,EAAE,MAAM,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,4EAA4E;AAC5E,uEAAuE;AACvE,QAAQ,CAAC,mDAAmD,EAAE,GAAG,EAAE;IACjE,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;QACzD,EAAE,CAAC,KAAK,CAAC,gBAAgB,EAAE,GAAG,EAAE;YAC9B,MAAM,CAAC,GAAG,GAAG,CAAC,4CAA4C,CAAC,IAAI,CAAC,CAAC;YACjE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,UAAU,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC/D,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,kCAAkC,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;IACL,CAAC;IAED,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE;QAClB,MAAM,CAAC,GAAG,GAAG,CAAC,sDAAsD,CAAC,CAAC;QACtE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC1B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC5B,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,8CAA8C,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3E,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,gDAAgD,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC/E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/unit/lossless-mirror.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=lossless-mirror.test.d.ts.map

package/dist/test/unit/lossless-mirror.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lossless-mirror.test.d.ts","sourceRoot":"","sources":["../../../test/unit/lossless-mirror.test.ts"],"names":[],"mappings":""}

package/dist/test/unit/lossless-mirror.test.js

@@ -0,0 +1,41 @@
+/**
+ * lossless golden 的真源是本仓 test/lossless/golden/；兄弟仓 aster-lang-test 的
+ * corpus/tier3-fixtures/lossless/ 是它的镜像（落位规则同 aster-lang-test scripts/classify-existing.mjs 的 tier3：
+ * 原样复制 .aster，并配同名 meta）。golden 改动后须同步镜像，否则本测试失败。
+ * CI 的 test job 会 checkout aster-lang-test，因此 CI 中缺失即失败；仅本地未并列 checkout 时跳过。
+ */
+import { test } from 'node:test';
+import assert from 'node:assert/strict';
+import { existsSync, readdirSync, readFileSync } from 'node:fs';
+import { dirname, join } from 'node:path';
+import { fileURLToPath } from 'node:url';
+// 编译后从 dist/test/unit 运行：上溯 3 级到仓库根
+const repoRoot = join(dirname(fileURLToPath(import.meta.url)), '..', '..', '..');
+const goldenDir = join(repoRoot, 'test', 'lossless', 'golden');
+const MIRROR = ['corpus', 'tier3-fixtures', 'lossless'];
+function mirrorDir() {
+    return [join(repoRoot, '..', 'aster-lang-test', ...MIRROR), join(repoRoot, 'aster-lang-test', ...MIRROR)]
+        .find((c) => existsSync(c));
+}
+const asterFiles = (dir) => readdirSync(dir).filter((n) => n.endsWith('.aster')).sort();
+// 与 classify-existing.mjs 写 tier3 meta 的方式逐字节相同
+function expectedMeta(name) {
+    const meta = { tier: 3, bucket: 'lossless', engines: ['ts'], lexicon: 'en-US', source: `aster-lang-ts/test/lossless/golden/${name}` };
+    return JSON.stringify(meta, null, 2) + '\n';
+}
+test('lossless golden 与 aster-lang-test 镜像逐字节一致', (t) => {
+    const mirror = mirrorDir();
+    if (mirror === undefined) {
+        assert.ok(!process.env.CI, 'CI 中须 checkout aster-lang-test（见 .github/workflows/ci.yml test job）');
+        return t.skip('aster-lang-test 未并列 checkout');
+    }
+    const names = asterFiles(goldenDir);
+    assert.deepEqual(asterFiles(mirror), names, '镜像的 .aster 文件集合须与 golden 相同');
+    for (const name of names) {
+        assert.ok(readFileSync(join(mirror, name)).equals(readFileSync(join(goldenDir, name))), `${name} 与 golden 不一致`);
+        const metaPath = join(mirror, name.replace(/\.aster$/, '.meta.json'));
+        assert.ok(existsSync(metaPath), `${name} 缺同名 meta`);
+        assert.equal(readFileSync(metaPath, 'utf8'), expectedMeta(name), `${name} 的 meta 不符合落位规则`);
+    }
+});
+//# sourceMappingURL=lossless-mirror.test.js.map

package/dist/test/unit/lossless-mirror.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lossless-mirror.test.js","sourceRoot":"","sources":["../../../test/unit/lossless-mirror.test.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,MAAM,MAAM,oBAAoB,CAAC;AACxC,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAEzC,oCAAoC;AACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AACjF,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;AAC/D,MAAM,MAAM,GAAG,CAAC,QAAQ,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;AAExD,SAAS,SAAS;IAChB,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,iBAAiB,EAAE,GAAG,MAAM,CAAC,EAAE,IAAI,CAAC,QAAQ,EAAE,iBAAiB,EAAE,GAAG,MAAM,CAAC,CAAC;SACtG,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;AAChC,CAAC;AAED,MAAM,UAAU,GAAG,CAAC,GAAW,EAAY,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;AAE1G,gDAAgD;AAChD,SAAS,YAAY,CAAC,IAAY;IAChC,MAAM,IAAI,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,sCAAsC,IAAI,EAAE,EAAE,CAAC;IACtI,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;AAC9C,CAAC;AAED,IAAI,CAAC,2CAA2C,EAAE,CAAC,CAAC,EAAE,EAAE;IACtD,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,MAAM,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,qEAAqE,CAAC,CAAC;QAClG,OAAO,CAAC,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;IAChD,CAAC;IACD,MAAM,KAAK,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC;IACpC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,6BAA6B,CAAC,CAAC;IAC3E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,eAAe,CAAC,CAAC;QAChH,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC,CAAC;QACtE,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,GAAG,IAAI,WAAW,CAAC,CAAC;QACpD,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,iBAAiB,CAAC,CAAC;IAC7F,CAAC;AACH,CAAC,CAAC,CAAC"}

package/dist/test/unit/lossless-reflow.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=lossless-reflow.test.d.ts.map

package/dist/test/unit/lossless-reflow.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lossless-reflow.test.d.ts","sourceRoot":"","sources":["../../../test/unit/lossless-reflow.test.ts"],"names":[],"mappings":""}

package/dist/test/unit/lossless-reflow.test.js

@@ -0,0 +1,84 @@
+/**
+ * lossless 模式的 reflow：只整理记号之间的空白，不得改动字符串字面量、注释正文与语句结构。
+ * LSP 默认格式化即 lossless + reflow，任何改动都会直接改写用户源码。
+ */
+import { describe, test } from 'node:test';
+import assert from 'node:assert/strict';
+import { readdirSync, readFileSync } from 'node:fs';
+import { dirname, join } from 'node:path';
+import { fileURLToPath } from 'node:url';
+import { buildCstLossless } from '../../src/cst/cst_builder.js';
+import { printCNLFromCst, printRangeFromCst } from '../../src/cst/cst_printer.js';
+import { canonicalize } from '../../src/frontend/canonicalizer.js';
+import { lex } from '../../src/frontend/lexer.js';
+import { parse } from '../../src/parser.js';
+import { lowerModule } from '../../src/lower_to_core.js';
+// 编译后从 dist/test/unit 运行：上溯 3 级到仓库根
+const goldenDir = join(dirname(fileURLToPath(import.meta.url)), '..', '..', '..', 'test', 'lossless', 'golden');
+const reflow = (src) => printCNLFromCst(buildCstLossless(src), { reflow: true });
+function coreJson(src) {
+    const result = parse(lex(canonicalize(src)));
+    const errors = result.diagnostics.filter((d) => d.severity === 'error');
+    if (errors.length > 0)
+        throw new Error(errors.map((d) => d.message).join('; '));
+    return JSON.stringify(lowerModule(result.ast), (k, v) => (k === 'origin' ? undefined : v));
+}
+describe('lossless reflow 只动记号之间的空白', () => {
+    test('标点前同行空白、行尾空白、`. :` 与多余结尾换行被整理', () => {
+        const src = 'Module m .  \n\nRule r given a as Int , produce Int . :  \n  Return a .\n\n\n';
+        assert.equal(reflow(src), 'Module m.\n\nRule r given a as Int, produce Int:\n  Return a.\n');
+    });
+    test('字符串字面量原样保留', () => {
+        const src = 'Module m.\n\nRule r, produce Text:\n  Return "Hi , there . : ! ?" .\n';
+        assert.equal(reflow(src), 'Module m.\n\nRule r, produce Text:\n  Return "Hi , there . : ! ?".\n');
+    });
+    test('注释正文原样保留（只去行尾空白）', () => {
+        const src = '// 注释 , 带空格 .   \nModule m.  // 行尾 : 注释\n';
+        assert.equal(reflow(src), '// 注释 , 带空格 .\nModule m.  // 行尾 : 注释\n');
+    });
+    test('独占一行的句点（workflow 结束）不被拉到上一行', () => {
+        const src = ['Module m.', '', 'Rule run, produce. It performs io:', '  workflow:', '    step only:',
+            '      Return ok of 1.', '', '  .', ''].join('\n');
+        assert.equal(reflow(src), src);
+    });
+    test('文件中间只含空白的行被清空', () => {
+        const src = 'Module m.\n   \nRule r, produce Int:\n  Let x be 1.\n  \t \n  Return x.\n';
+        assert.equal(reflow(src), 'Module m.\n\nRule r, produce Int:\n  Let x be 1.\n\n  Return x.\n');
+    });
+    test('文件末尾的空白行与行尾空白去掉，至多留一个换行', () => {
+        const body = 'Module m.\n\nRule r, produce Int:\n  Return 1.';
+        assert.equal(reflow(`${body}\n  \n  \n`), `${body}\n`);
+        assert.equal(reflow(`${body}\n\n  `), `${body}\n`);
+        assert.equal(reflow(`${body}   `), body);
+    });
+    test('CRLF 文件去掉换行前的空白并保持 CRLF', () => {
+        const src = 'Module m.  \r\n   \r\nRule r, produce Int:  \r\n  // 注释 , 不动   \r\n  Return 1.   \r\n  \r\n\r\n';
+        const want = 'Module m.\r\n\r\nRule r, produce Int:\r\n  // 注释 , 不动\r\n  Return 1.\r\n';
+        assert.equal(reflow(src), want);
+    });
+    test('reflow 幂等', () => {
+        const src = 'Module m .  \r\n \r\nRule r given a as Int , produce Int . :  \r\n  Return a .  \r\n  \r\n  ';
+        assert.equal(reflow(reflow(src)), reflow(src));
+    });
+    test('区间格式化同样不改字符串', () => {
+        const src = 'Module m.\n\nRule r, produce Text:\n  Return "a , b" .\n';
+        const cst = buildCstLossless(src);
+        const start = src.indexOf('Return');
+        assert.equal(printRangeFromCst(cst, start, src.length, { reflow: true }), 'Return "a , b".\n');
+    });
+});
+describe('lossless golden', () => {
+    const inputs = readdirSync(goldenDir).filter((f) => f.endsWith('.in.aster')).sort();
+    for (const file of inputs) {
+        test(file, () => {
+            const src = readFileSync(join(goldenDir, file), 'utf8');
+            const expected = readFileSync(join(goldenDir, file.replace(/\.in\.aster$/, '.out.aster')), 'utf8');
+            assert.equal(printCNLFromCst(buildCstLossless(src)), src, '无 reflow 时须逐字节还原');
+            // 与 scripts/test-lossless-golden 同一比较口径：只忽略期望文件末尾的单个换行，其余空白逐字比较
+            const norm = (t) => t.replace(/\n$/, '');
+            assert.equal(norm(reflow(src)), norm(expected));
+            assert.equal(coreJson(expected), coreJson(src), 'reflow 前后 Core IR 须相同');
+        });
+    }
+});
+//# sourceMappingURL=lossless-reflow.test.js.map

package/dist/test/unit/lossless-reflow.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lossless-reflow.test.js","sourceRoot":"","sources":["../../../test/unit/lossless-reflow.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,MAAM,MAAM,oBAAoB,CAAC;AACxC,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACpD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAEzC,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AAClF,OAAO,EAAE,YAAY,EAAE,MAAM,qCAAqC,CAAC;AACnE,OAAO,EAAE,GAAG,EAAE,MAAM,6BAA6B,CAAC;AAClD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAEzD,oCAAoC;AACpC,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;AAEhH,MAAM,MAAM,GAAG,CAAC,GAAW,EAAU,EAAE,CAAC,eAAe,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AAEjG,SAAS,QAAQ,CAAC,GAAW;IAC3B,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC;IACxE,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAChF,OAAO,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7F,CAAC;AAED,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,MAAM,GAAG,GAAG,+EAA+E,CAAC;QAC5F,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,iEAAiE,CAAC,CAAC;IAC/F,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,YAAY,EAAE,GAAG,EAAE;QACtB,MAAM,GAAG,GAAG,uEAAuE,CAAC;QACpF,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,sEAAsE,CAAC,CAAC;IACpG,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAC5B,MAAM,GAAG,GAAG,2CAA2C,CAAC;QACxD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,wCAAwC,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACvC,MAAM,GAAG,GAAG,CAAC,WAAW,EAAE,EAAE,EAAE,oCAAoC,EAAE,aAAa,EAAE,gBAAgB;YACjG,uBAAuB,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,eAAe,EAAE,GAAG,EAAE;QACzB,MAAM,GAAG,GAAG,2EAA2E,CAAC;QACxF,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,mEAAmE,CAAC,CAAC;IACjG,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,yBAAyB,EAAE,GAAG,EAAE;QACnC,MAAM,IAAI,GAAG,gDAAgD,CAAC;QAC9D,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC;QACvD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,QAAQ,CAAC,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC;QACnD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,yBAAyB,EAAE,GAAG,EAAE;QACnC,MAAM,GAAG,GAAG,iGAAiG,CAAC;QAC9G,MAAM,IAAI,GAAG,0EAA0E,CAAC;QACxF,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,WAAW,EAAE,GAAG,EAAE;QACrB,MAAM,GAAG,GAAG,8FAA8F,CAAC;QAC3G,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,cAAc,EAAE,GAAG,EAAE;QACxB,MAAM,GAAG,GAAG,0DAA0D,CAAC;QACvE,MAAM,GAAG,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACpC,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,mBAAmB,CAAC,CAAC;IACjG,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,MAAM,MAAM,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACpF,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE;YACd,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;YACxD,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACnG,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,kBAAkB,CAAC,CAAC;YAC9E,gEAAgE;YAChE,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAChD,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,uBAAuB,CAAC,CAAC;QAC3E,CAAC,CAAC,CAAC;IACL,CAAC;AACH,CAAC,CAAC,CAAC"}

package/dist/test/unit/lowering/lowering.test.js

@@ -123,7 +123,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Fn1'),
             statements: [Node.Return(lambdaExpr)],
         });
-        const moduleAst = Node.Module('test.lowering.lambda_capture', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.lambda_capture', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const func = core.decls.find(d => d.kind === 'Func');
         const lambda = func.body.statements[0].expr;
@@ -137,7 +137,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Text'),
             statements: [Node.Return(awaitExpr)],
         });
-        const moduleAst = Node.Module('test.lowering.await_expr', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.await_expr', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const func = core.decls[0];
         const retExpr = func.body.statements[0].expr;
@@ -151,7 +151,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Int'),
             statements: [Node.Block([Node.Let('inner', Node.Int(2))]), inner],
         });
-        const moduleAst = Node.Module('test.lowering.scope_block', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.scope_block', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const func = core.decls[0];
         assert.equal(func.body.statements[0].kind, 'Scope');
@@ -171,7 +171,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('List'),
             statements: [Node.Return(resultCall), Node.Return(listCall)],
         });
-        const moduleAst = Node.Module('test.lowering.map_calls', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.map_calls', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const body = core.decls[0].body.statements;
         const resultExpr = body[0].expr;
@@ -184,7 +184,7 @@ Rule makeIdentity, produce Fn1:
     it('effectCaps 显式声明应完整传递', () => {
         const caps = [CapabilityKind.SECRETS];
         const funcDecl = Node.Func('readSecret', [], [], Node.TypeName('Text'), [], caps, true, Node.Block([Node.Return(Node.String('ok'))]));
-        const moduleAst = Node.Module('test.lowering.effectcaps.explicit', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.effectcaps.explicit', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const func = core.decls[0];
         assert.deepEqual(func.effectCaps, caps);
@@ -194,7 +194,7 @@ Rule makeIdentity, produce Fn1:
     it('effectCaps 推断结果应保持并标记为隐式', () => {
         const caps = [CapabilityKind.FILES, CapabilityKind.TIME];
         const funcDecl = Node.Func('touchFile', [], [], Node.TypeName('Bool'), [], caps, false, Node.Block([Node.Return(Node.Bool(true))]));
-        const moduleAst = Node.Module('test.lowering.effectcaps.implicit', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.effectcaps.implicit', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const func = core.decls[0];
         assert.deepEqual(func.effectCaps, caps);
@@ -203,7 +203,7 @@ Rule makeIdentity, produce Fn1:
     });
     it('未知 effect 应抛出诊断错误', () => {
         const funcDecl = Node.Func('useUnknownEffect', [], [], Node.TypeName('Int'), ['teleport'], [], false, Node.Block([Node.Return(Node.Int(1))]));
-        const moduleAst = Node.Module('test.lowering.effectcaps.unknown', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.effectcaps.unknown', null, [funcDecl]);
         assert.throws(() => lowerAst(moduleAst), /Unknown effect/);
     });
     it('Set 语句应降级为 Core.Set 并保留表达式', () => {
@@ -217,7 +217,7 @@ Rule makeIdentity, produce Fn1:
                 Node.Return(Node.Name('counter')),
             ],
         });
-        const moduleAst = Node.Module('test.lowering.set.basic', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.set.basic', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const func = core.decls[0];
         const body = func.body.statements;
@@ -237,7 +237,7 @@ Rule makeIdentity, produce Fn1:
                 Node.Return(Node.Name('a')),
             ],
         });
-        const moduleAst = Node.Module('test.lowering.set.sequence', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.set.sequence', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const func = core.decls[0];
         const body = func.body.statements;
@@ -256,7 +256,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Int'),
             statements: [matchStmt],
         });
-        const moduleAst = Node.Module('test.lowering.match.null', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.match.null', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const matchCore = (core.decls[0].body.statements[0]);
         assert.equal(matchCore.cases[0]?.pattern.kind, 'PatNull');
@@ -271,7 +271,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Int'),
             statements: [matchStmt],
         });
-        const moduleAst = Node.Module('test.lowering.match.ctor', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.match.ctor', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const matchCore = (core.decls[0].body.statements[0]);
         const pat = matchCore.cases[0].pattern;
@@ -288,7 +288,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Text'),
             statements: [matchStmt],
         });
-        const moduleAst = Node.Module('test.lowering.match.int', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.match.int', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const matchCore = (core.decls[0].body.statements[0]);
         const pat = matchCore.cases[0].pattern;
@@ -301,7 +301,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Result'),
             statements: [Node.Return(Node.Ok(Node.Int(1)))],
         });
-        const moduleAst = Node.Module('test.lowering.expr.ok', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.expr.ok', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const retStmt = core.decls[0].body.statements[0];
         const expr = retStmt.expr;
@@ -314,7 +314,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Result'),
             statements: [Node.Return(Node.Err(Node.String('fail')))],
         });
-        const moduleAst = Node.Module('test.lowering.expr.err', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.expr.err', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const retStmt = core.decls[0].body.statements[0];
         const expr = retStmt.expr;
@@ -327,7 +327,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.Maybe(Node.TypeName('Int')),
             statements: [Node.Return(Node.Some(Node.Int(7))), Node.Return(Node.None())],
         });
-        const moduleAst = Node.Module('test.lowering.expr.option', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.expr.option', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const firstReturn = core.decls[0].body.statements[0];
         const secondReturn = core.decls[0].body.statements[1];
@@ -344,7 +344,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Int'),
             statements: [startStmt, Node.Return(Node.Int(0))],
         });
-        const moduleAst = Node.Module('test.lowering.start', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.start', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const stmt = core.decls[0].body.statements[0];
         assert.equal(stmt.kind, 'Start');
@@ -358,7 +358,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Int'),
             statements: [waitStmt, Node.Return(Node.Int(1))],
         });
-        const moduleAst = Node.Module('test.lowering.wait', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.wait', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const stmt = core.decls[0].body.statements[0];
         assert.equal(stmt.kind, 'Wait');
@@ -371,7 +371,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Null'),
             statements: [callStmt, Node.Return(Node.Null())],
         });
-        const moduleAst = Node.Module('test.lowering.callStmt', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.callStmt', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const stmt = core.decls[0].body.statements[0];
         assert.equal(stmt.kind, 'Let');
@@ -387,7 +387,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Int'),
             statements: [ifStmt, Node.Return(Node.Int(0))],
         });
-        const moduleAst = Node.Module('test.lowering.if.then', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.if.then', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const stmt = core.decls[0].body.statements[0];
         assert.equal(stmt.kind, 'If');
@@ -401,7 +401,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Int'),
             statements: [ifStmt, Node.Return(Node.Int(0))],
         });
-        const moduleAst = Node.Module('test.lowering.if.else', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.if.else', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const stmt = core.decls[0].body.statements[0];
         assert.equal(stmt.elseBlock.statements[0]?.kind, 'Return');
@@ -416,7 +416,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Int'),
             statements: [scopeBlock],
         });
-        const moduleAst = Node.Module('test.lowering.scope.single', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.scope.single', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const stmt = core.decls[0].body.statements[0];
         assert.equal(stmt.kind, 'Scope');
@@ -434,7 +434,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Int'),
             statements: [outer],
         });
-        const moduleAst = Node.Module('test.lowering.scope.nested', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.scope.nested', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const scope = core.decls[0].body.statements[0];
         assert.equal(scope.kind, 'Scope');
@@ -450,7 +450,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Bool'),
             statements: [Node.Return(Node.Bool(true))],
         });
-        const moduleAst = Node.Module('test.lowering.type.pii', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.type.pii', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const paramType = (core.decls[0].params[0]).type;
         assert.equal(paramType.kind, 'PiiType');
@@ -464,7 +464,7 @@ Rule makeIdentity, produce Fn1:
                 Node.String('ok'),
             ])),
         ]));
-        const moduleAst = Node.Module('test.lowering.func.pii', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.func.pii', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const func = core.decls[0];
         assert.equal(func.piiLevel, 'L2');
@@ -472,7 +472,7 @@ Rule makeIdentity, produce Fn1:
     });
     it('类型参数引用应降级为 Core.TypeVar', () => {
         const funcDecl = Node.Func('identity', ['T'], [makeParam('value', Node.TypeName('T'))], Node.TypeName('T'), [], [], false, Node.Block([Node.Return(Node.Name('value'))]));
-        const moduleAst = Node.Module('test.lowering.type.var', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.type.var', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const func = core.decls[0];
         assert.equal(func.params[0].type.kind, 'TypeVar');
@@ -480,7 +480,7 @@ Rule makeIdentity, produce Fn1:
     });
     it('TypeApp 应降级并保留参数列表', () => {
         const funcDecl = Node.Func('getFuture', [], [], Node.TypeApp('Future', [Node.TypeName('Text'), Node.TypeName('Int')]), [], [], false, Node.Block([Node.Return(Node.Name('pending'))]));
-        const moduleAst = Node.Module('test.lowering.type.app', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.type.app', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const ret = core.decls[0].ret;
         assert.equal(ret.kind, 'TypeApp');
@@ -496,7 +496,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.Maybe(Node.TypeName('Text')),
             statements: [Node.Return(Node.None())],
         });
-        const moduleAst = Node.Module('test.lowering.type.option', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.type.option', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const paramType = (core.decls[0].params[0]).type;
         const ret = core.decls[0].ret;
@@ -511,7 +511,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.Result(Node.TypeName('Text'), Node.TypeName('Error')),
             statements: [Node.Return(Node.Ok(Node.String('ok')))],
         });
-        const moduleAst = Node.Module('test.lowering.type.result', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.type.result', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const ret = core.decls[0].ret;
         assert.equal(ret.kind, 'Result');
@@ -519,7 +519,7 @@ Rule makeIdentity, produce Fn1:
         assert.equal(ret.err.kind, 'TypeName');
     });
     it('Import 声明应直接映射为 Core.Import', () => {
-        const moduleAst = Node.Module('test.lowering.import', [
+        const moduleAst = Node.Module('test.lowering.import', null, [
             Node.Import('Http.Client', 'HttpClient'),
         ]);
         const core = lowerAst(moduleAst);
@@ -530,7 +530,7 @@ Rule makeIdentity, produce Fn1:
         assert.equal(Object.prototype.hasOwnProperty.call(decl, 'version'), false);
     });
     it('Import version 应映射为 Core.Import version', () => {
-        const moduleAst = Node.Module('test.lowering.import.version', [
+        const moduleAst = Node.Module('test.lowering.import.version', null, [
             Node.Import('risk.Scoring', 'Score', 2),
         ]);
         const core = lowerAst(moduleAst);
@@ -552,7 +552,7 @@ Rule makeIdentity, produce Fn1:
             span: freshSpan(),
         };
         const dataDecl = Node.Data('User', [field]);
-        const moduleAst = Node.Module('test.lowering.data.constraints', [dataDecl]);
+        const moduleAst = Node.Module('test.lowering.data.constraints', null, [dataDecl]);
         const core = lowerAst(moduleAst);
         const data = core.decls[0];
         assert.ok(data.fields[0].constraints, '应该存在 constraints');
@@ -582,7 +582,7 @@ Rule makeIdentity, produce Fn1:
             span: freshSpan(),
         };
         const dataDecl = Node.Data('Profile', [fieldWithConstraints, fieldWithoutConstraints]);
-        const moduleAst = Node.Module('test.lowering.data.multi_constraints', [dataDecl]);
+        const moduleAst = Node.Module('test.lowering.data.multi_constraints', null, [dataDecl]);
         const core = lowerAst(moduleAst);
         const data = core.decls[0];
         assert.equal(data.fields[0].constraints.length, 2);
@@ -598,7 +598,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('User'),
             statements: [Node.Return(construct)],
         });
-        const moduleAst = Node.Module('test.lowering.construct', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.construct', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const expr = core.decls[0].body.statements[0]
             .expr;
@@ -613,7 +613,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Long'),
             statements: [Node.Return(Node.Long('1234567890123456789'))],
         });
-        const moduleAst = Node.Module('test.lowering.long', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.long', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const retStmt = core.decls[0].body.statements[0];
         const expr = retStmt.expr;
@@ -626,7 +626,7 @@ Rule makeIdentity, produce Fn1:
             retType: Node.TypeName('Double'),
             statements: [Node.Return(Node.Double(3.14))],
         });
-        const moduleAst = Node.Module('test.lowering.double', [funcDecl]);
+        const moduleAst = Node.Module('test.lowering.double', null, [funcDecl]);
         const core = lowerAst(moduleAst);
         const retStmt = core.decls[0].body.statements[0];
         const expr = retStmt.expr;