@aster-cloud/aster-lang-ts 1.0.27 → 1.0.29

package/dist/test/unit/mapping/source-ir.test.js

@@ -0,0 +1,113 @@
+import { describe, it } from 'node:test';
+import assert from 'node:assert/strict';
+import { parseSourceIr, verifyCoverage, nodeAtOffset } from '../../../src/mapping/source-ir.js';
+import { verifyMapping } from '../../../src/mapping/mapping-ir.js';
+/**
+ * SourceIR（ADR 0037 §2/§9.5）—— 人类文档的结构化表示。
+ *
+ * <p>核心契约：**只标结构，不改内容**。每个节点的 span 必须能逐字节切回原文，
+ * 且父必须覆盖子——这两条是「点击原文 ↔ 定位 IR 节点」的前提。
+ */
+const POLICY = [
+    '# 付款审批政策', '',
+    '## 阈值', '',
+    '单笔付款超过 $10,000 时需要财务经理审批。', '',
+    '- 低于阈值：自动通过', '',
+    '- 高于阈值：转人工', '',
+    '## 例外', '',
+    '紧急付款可事后补批。', '',
+].join('\n');
+function allNodes(root) {
+    const out = [];
+    (function walk(n) { out.push(n); n.children.forEach(walk); })(root);
+    return out;
+}
+describe('SourceIR — 人类文档的结构化表示', () => {
+    it('★每个节点的 span 必须能逐字节切回原文（不做任何改写）', () => {
+        const ir = parseSourceIr(POLICY);
+        assert.deepStrictEqual(verifyCoverage(ir, POLICY), [], '覆盖不变式被破坏 —— span 切片与 text 不符或存在重叠。');
+        for (const n of allNodes(ir)) {
+            assert.strictEqual(n.text, POLICY.slice(n.span.start, n.span.end), `${n.nodeId} 的 text 不等于 span 切片 —— 说明做了文本改写。`);
+        }
+    });
+    it('★标题层级必须嵌套（`##` 归到 `#` 之下）', () => {
+        const ir = parseSourceIr(POLICY);
+        assert.strictEqual(ir.children.length, 1, `顶层应只有一个 \`# \` 标题节点，实际 ${ir.children.length} 个 —— 嵌套没建起来。`);
+        const h1 = ir.children[0];
+        assert.strictEqual(h1.level, 1);
+        const h2s = h1.children.filter(c => c.kind === 'HEADING');
+        assert.strictEqual(h2s.length, 2, '`## 阈值` 与 `## 例外` 都应挂在 `#` 之下。');
+        assert.ok(h2s.every(h => h.level === 2));
+    });
+    it('★父的 span 必须覆盖子（否则 nodeAtOffset 无法下降）', () => {
+        // 这是我实际踩过的 bug：HEADING 原本只覆盖标题那一行，其子段落在父之外，
+        // 于是「点击 $10,000 定位所在节点」返回 DOCUMENT 而不是那个段落。
+        const ir = parseSourceIr(POLICY);
+        for (const n of allNodes(ir)) {
+            for (const c of n.children) {
+                assert.ok(c.span.start >= n.span.start && c.span.end <= n.span.end, `${c.nodeId} 不被父 ${n.nodeId} 包含：子 [${c.span.start},${c.span.end}) `
+                    + `父 [${n.span.start},${n.span.end})`);
+            }
+        }
+    });
+    it('★nodeAtOffset 返回**最深**的命中节点', () => {
+        const ir = parseSourceIr(POLICY);
+        const offset = POLICY.indexOf('$10,000');
+        const hit = nodeAtOffset(ir, offset);
+        assert.strictEqual(hit?.kind, 'PARAGRAPH', `应命中段落而非祖先，实际 ${hit?.kind}（${hit?.nodeId}）`
+            + '\n★若返回 DOCUMENT/HEADING，说明包含不变式被破坏、无法逐层下降。');
+        assert.ok(hit.text.includes('$10,000'));
+    });
+    it('★verifyCoverage 必须能抓出错位的 span（否则它是个假门禁）', () => {
+        // 反向守卫：手工构造一个 text 与 span 不符的节点，必须被抓。
+        const bad = {
+            nodeId: 'doc', kind: 'DOCUMENT', span: { start: 0, end: 5 },
+            text: '完全不同的内容', children: [],
+        };
+        const problems = verifyCoverage(bad, POLICY);
+        assert.ok(problems.length > 0, 'text 与 span 不符却没被抓到 —— 这道检查形同虚设。');
+    });
+    it('★围栏代码块内的空行不得把代码块撕开', () => {
+        const doc = [
+            '# 标题', '',
+            '```', 'line1', '', 'line3', '```', '',
+            '正文。', '',
+        ].join('\n');
+        const ir = parseSourceIr(doc);
+        assert.deepStrictEqual(verifyCoverage(ir, doc), []);
+        const codeBlocks = allNodes(ir).filter(n => n.kind === 'CODE_BLOCK');
+        assert.strictEqual(codeBlocks.length, 1, `代码块应是一个整体节点，实际被切成 ${codeBlocks.length} 块。`);
+        assert.ok(codeBlocks[0].text.includes('line1') && codeBlocks[0].text.includes('line3'), '代码块内容不完整 —— 空行处被切开了。');
+    });
+    it('★与 MappingIR 打通：SourceIR 的 offset 可直接做候选映射的 span', () => {
+        // 这是 SourceIR 存在的理由：让 MappingIR 能吃**人类文档**而不只是 .aster。
+        const ir = parseSourceIr(POLICY);
+        const start = POLICY.indexOf('$10,000');
+        const text = POLICY.slice(start, start + '$10,000'.length);
+        // 该 offset 必须落在某个具体结构节点里（不是孤立的字符）
+        assert.ok(nodeAtOffset(ir, start) !== undefined, 'offset 应落在某个 SourceIR 节点内。');
+        const r = verifyMapping({ span: { start, end: start + text.length }, text, nodeId: '$.threshold' }, () => ({ kind: 'Int', value: 10000 }));
+        assert.strictEqual(r.verdict, 'VERIFIED', `人类文档里的 $10,000 应能验过 Int(10000)。实际 ${r.verdict}：${r.reason}`);
+    });
+    it('★文档首尾的空白必须原样保留（text 不得被 trim）', () => {
+        // 反向守卫。★原先的样本 POLICY 首尾没有可 trim 的空白，于是给 freeze 加
+        //   `.trim()` 这个变异**测不出来**——契约说「不改内容」，但没有样本能
+        //   证伪它。这里显式构造首尾带空白的文档。
+        const doc = '\n\n# 标题\n\n正文。\n\n   \n';
+        const ir = parseSourceIr(doc);
+        assert.deepStrictEqual(verifyCoverage(ir, doc), [], '首尾空白应原样保留 —— 若这里变红，多半是某处对 text 做了 trim/规范化。');
+        assert.strictEqual(ir.text, doc, 'DOCUMENT 的 text 必须逐字节等于原文（含首尾空白）。');
+    });
+    it('空文档与纯空白文档不崩', () => {
+        for (const doc of ['', '   \n\n  \n']) {
+            const ir = parseSourceIr(doc);
+            assert.deepStrictEqual(verifyCoverage(ir, doc), [], `文档 ${JSON.stringify(doc)} 覆盖检查失败`);
+            assert.strictEqual(ir.kind, 'DOCUMENT');
+        }
+    });
+    it('nodeId 在文档内唯一（否则映射会指向多个节点）', () => {
+        const ids = allNodes(parseSourceIr(POLICY)).map(n => n.nodeId);
+        assert.strictEqual(new Set(ids).size, ids.length, `nodeId 有重复：${ids.filter((v, i) => ids.indexOf(v) !== i).join(', ')}`);
+    });
+});
+//# sourceMappingURL=source-ir.test.js.map

package/dist/test/unit/mapping/source-ir.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"source-ir.test.js","sourceRoot":"","sources":["../../../../test/unit/mapping/source-ir.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,WAAW,CAAC;AACzC,OAAO,MAAM,MAAM,oBAAoB,CAAC;AAExC,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,mCAAmC,CAAC;AAEhG,OAAO,EAAE,aAAa,EAAE,MAAM,oCAAoC,CAAC;AAEnE;;;;;GAKG;AAEH,MAAM,MAAM,GAAG;IACb,UAAU,EAAE,EAAE;IACd,OAAO,EAAE,EAAE;IACX,2BAA2B,EAAE,EAAE;IAC/B,aAAa,EAAE,EAAE;IACjB,YAAY,EAAE,EAAE;IAChB,OAAO,EAAE,EAAE;IACX,YAAY,EAAE,EAAE;CACjB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAEb,SAAS,QAAQ,CAAC,IAAgB;IAChC,MAAM,GAAG,GAAiB,EAAE,CAAC;IAC7B,CAAC,SAAS,IAAI,CAAC,CAAa,IAAU,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACtF,OAAO,GAAG,CAAC;AACb,CAAC;AAED,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;IACrC,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,EAAE,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,CAAC,eAAe,CAAC,cAAc,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,EACnD,oCAAoC,CAAC,CAAC;QAExC,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;YAC7B,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAC/D,GAAG,CAAC,CAAC,MAAM,kCAAkC,CAAC,CAAC;QACnD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,EAAE,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;QAEjC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EACtC,0BAA0B,EAAE,CAAC,QAAQ,CAAC,MAAM,eAAe,CAAC,CAAC;QAC/D,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;QAC3B,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAEhC,MAAM,GAAG,GAAG,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;QAC1D,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,gCAAgC,CAAC,CAAC;QACpE,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,4CAA4C;QAC5C,4CAA4C;QAC5C,MAAM,EAAE,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;QAEjC,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC3B,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,EAChE,GAAG,CAAC,CAAC,MAAM,QAAQ,CAAC,CAAC,MAAM,UAAU,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI;sBACjE,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,EAAE,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACzC,MAAM,GAAG,GAAG,YAAY,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAErC,MAAM,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,EAAE,WAAW,EACvC,gBAAgB,GAAG,EAAE,IAAI,IAAI,GAAG,EAAE,MAAM,GAAG;cACzC,4CAA4C,CAAC,CAAC;QAClD,MAAM,CAAC,EAAE,CAAC,GAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,sCAAsC;QACtC,MAAM,GAAG,GAAe;YACtB,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;YAC3D,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,EAAE;SAC9B,CAAC;QACF,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC7C,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,kCAAkC,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC5B,MAAM,GAAG,GAAG;YACV,MAAM,EAAE,EAAE;YACV,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE;YACtC,KAAK,EAAE,EAAE;SACV,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEb,MAAM,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,CAAC,eAAe,CAAC,cAAc,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;QAEpD,MAAM,UAAU,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;QACrE,MAAM,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EACrC,qBAAqB,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC;QAC/C,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EACtF,sBAAsB,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,uDAAuD;QACvD,MAAM,EAAE,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;QAE3D,kCAAkC;QAClC,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,SAAS,EAAE,4BAA4B,CAAC,CAAC;QAE/E,MAAM,CAAC,GAAG,aAAa,CACrB,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,aAAa,EAAE,EAC1E,GAAG,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAEzC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,EAAE,UAAU,EACtC,qCAAqC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,iDAAiD;QACjD,6CAA6C;QAC7C,wBAAwB;QACxB,MAAM,GAAG,GAAG,0BAA0B,CAAC;QACvC,MAAM,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;QAE9B,MAAM,CAAC,eAAe,CAAC,cAAc,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAChD,6CAA6C,CAAC,CAAC;QACjD,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,EAC7B,mCAAmC,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;QACrB,KAAK,MAAM,GAAG,IAAI,CAAC,EAAE,EAAE,aAAa,CAAC,EAAE,CAAC;YACtC,MAAM,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;YAC9B,MAAM,CAAC,eAAe,CAAC,cAAc,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACxF,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,GAAG,GAAG,QAAQ,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC/D,MAAM,CAAC,WAAW,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,EAC9C,cAAc,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/unit/nodeid/change-impact.test.d.ts

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

package/dist/test/unit/nodeid/change-impact.test.d.ts.map

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

package/dist/test/unit/nodeid/change-impact.test.js

@@ -0,0 +1,152 @@
+import { describe, it } from 'node:test';
+import assert from 'node:assert/strict';
+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';
+import { computeNodeIds, canonicalHash } from '../../../src/nodeid/node-id-map.js';
+import { diffNodeIds } from '../../../src/nodeid/change-impact.js';
+/**
+ * ADR 0037 §4 的核心能力：跨版本 change impact（TS 侧，与 Java 对等）。
+ *
+ * <p>每条用例都锚在一个**具体的产品承诺**上（「改阈值 → 立刻知道哪条规则
+ * stale」），而不是锚在实现细节（路径字符串长什么样）上——后者会在重构时
+ * 变红却证明不了任何事。
+ */
+const V1 = [
+    'Module demo.approve.',
+    '',
+    'Rule approve given amount, produce:',
+    '  If amount greater than 10000:',
+    '    Return "REFER".',
+    '  Otherwise:',
+    '    Return "APPROVE".',
+    '',
+].join('\n');
+/** 完整链路：源码 → canonicalize → lex → parse → lower → Core IR。 */
+function ir(src) {
+    const ast = parse(lex(canonicalize(src))).ast;
+    return JSON.parse(JSON.stringify(lowerModule(ast)));
+}
+function idsOf(src) {
+    return computeNodeIds(ir(src));
+}
+describe('change impact（TS 侧）', () => {
+    it('★改阈值：节点身份不变、内容指纹变 —— 这正是 change impact 的前提', () => {
+        const v2 = V1.replace('10000', '20000');
+        assert.notStrictEqual(v2, V1, '★replace 未生效则本用例测的是「未编辑」，结论无效。');
+        const changes = diffNodeIds(idsOf(V1), idsOf(v2));
+        // 契约 1：不能出现「旧节点消失 + 新节点出现」——那说明身份没稳住。
+        assert.ok(!changes.some(c => c.kind === 'ADDED'), `改一个字面量不应产生 ADDED 节点，实际：${JSON.stringify(changes)}`);
+        assert.ok(!changes.some(c => c.kind === 'REMOVED'), `改一个字面量不应产生 REMOVED 节点，实际：${JSON.stringify(changes)}`);
+        // 契约 2：必须有 MODIFIED，否则 change impact 根本没察觉到这次修改。
+        assert.ok(changes.some(c => c.kind === 'MODIFIED'), '改了阈值却没报告任何 MODIFIED —— change impact 失效。');
+        // 契约 3：包含该阈值的那条规则必须被标为 stale（§4 的「谁受影响」）。
+        assert.ok(changes.flatMap(c => c.staleAncestors).some(a => a.includes('{approve}')), `改了 approve 规则内的阈值，该规则应出现在 staleAncestors 里。实际：${JSON.stringify(changes)}`);
+    });
+    it('★在前面插入一条无关规则：原有规则的身份必须纹丝不动', () => {
+        // 这是纯下标路径方案的灾难场景（实测 5/16 存活）。命名作用域路径应完全免疫。
+        const v2 = V1.replace('Rule approve', 'Rule noop, produce:\n  Return "X".\n\nRule approve');
+        assert.notStrictEqual(v2, V1, '★replace 未生效则本用例无效。');
+        const before = idsOf(V1);
+        const after = idsOf(v2);
+        for (const [id, identity] of before) {
+            const now = after.get(id);
+            assert.ok(now !== undefined, `插入无关规则后，原节点 ${id} 的身份丢失了`
+                + '\n★这会让 change impact 把「没动过的规则」误报成被删除。');
+            // ★根节点 `$` 除外：模块的 decls 确实多了一条规则，它的内容**本就应该**变。
+            //   契约是「祖先 stale、后代不受扰」，不是「插入后整棵树一个字节都不许动」。
+            if (id !== '$') {
+                assert.strictEqual(now.contentHash, identity.contentHash, `原节点 ${id} 内容未变，contentHash 却变了`
+                    + '\n★多半是 contentHash 混进了位置信息（origin 未剥干净）。');
+            }
+        }
+        // 反向守卫：根节点**必须**变——它是「本模块多了一条规则」的唯一体现。
+        assert.notStrictEqual(after.get('$').contentHash, before.get('$').contentHash, '模块新增了一条规则，根节点 contentHash 却没变 —— 内容指纹失效。');
+        assert.ok(diffNodeIds(before, after).some(c => c.kind === 'ADDED'), '插入了一条新规则却没有任何 ADDED。');
+    });
+    it('未修改的程序：不得报告任何变更（防止 change impact 恒报 stale）', () => {
+        // 若本用例变红，说明 nodeId 或 contentHash 里混进了非确定性内容
+        // （随机序、时间戳、位置…）——那会让每次编译都「全量 stale」，能力等于没有。
+        assert.deepStrictEqual(diffNodeIds(idsOf(V1), idsOf(V1)), [], '同一份源码两次编译不应产生任何变更。');
+    });
+    it('★contentHash 必须剥掉 origin：位置不是内容', () => {
+        // 在**文件开头**加一行注释：所有代码整体下移一行，位置全变、内容全同。
+        const v2 = `# 一行注释\n${V1}`;
+        assert.deepStrictEqual(diffNodeIds(idsOf(V1), idsOf(v2)), [], '只加了一行注释（位置变、内容不变），却报告了变更。'
+            + '\n★说明 contentHash 未剥干净 origin —— 这会让每次挪动代码都触发'
+            + '\n  全量 stale，change impact 沦为噪声。');
+    });
+    it('已知局限：重命名规则会使其子树身份迁移（如实暴露，不掩盖）', () => {
+        // ADR 0037 §8.5 记录的固有代价（实测 1/16 存活）。本用例把它**钉成已知行为**，
+        // 而不是让它在生产里以「一条规则凭空消失 + 一条凭空出现」的形式被发现。
+        const v2 = V1.replace('Rule approve given amount', 'Rule assess given amount');
+        assert.notStrictEqual(v2, V1, '★replace 未生效则本用例无效。');
+        const changes = diffNodeIds(idsOf(V1), idsOf(v2));
+        assert.ok(changes.some(c => c.kind === 'REMOVED'), `重命名应表现为旧身份 REMOVED（需由显式 rename 声明消解），实际：${JSON.stringify(changes)}`);
+        assert.ok(changes.some(c => c.kind === 'ADDED'), `重命名应表现为新身份 ADDED，实际：${JSON.stringify(changes)}`);
+    });
+    it('stale 只向上传播，不向下 —— 否则影响面被夸大到整棵子树', () => {
+        const changes = diffNodeIds(idsOf(V1), idsOf(V1.replace('10000', '20000')));
+        for (const c of changes) {
+            for (const ancestor of c.staleAncestors) {
+                assert.ok(c.nodeId.startsWith(ancestor), `staleAncestors 含非祖先项：节点 ${c.nodeId} 的 ${ancestor}`
+                    + '\n★若把后代也标 stale，改一个字面量会波及整棵子树，影响面失真。');
+                assert.notStrictEqual(c.nodeId, ancestor, '节点自身不应出现在 staleAncestors 里。');
+            }
+        }
+    });
+});
+describe('canonicalHash：与 Java 同口径', () => {
+    it('★object key 按 Unicode code point 升序（不是 UTF-16 code unit 序）', () => {
+        // JS 的字符串比较（`<` 与默认 `.sort()`）按 **UTF-16 code unit**；Java 的
+        // CanonicalJson 按 **code point**。两者对增补平面字符的排序**相反**——
+        // 两侧会对同一棵树产出不同 hash，且只在含这类字符的程序上暴露（极易隐身）。
+        //
+        // ★判别用例必须选一对在两种排序下**次序相反**的键，否则测试恒绿：
+        //   U+1F600 😀 的代理对以 D83D 开头 → UTF-16 序排在 U+FF5A ｚ **之前**；
+        //   而 code point 序 0x1F600 > 0xFF5A → 应排在**之后**。
+        //   （最初我用的是 `\u{1F600}` vs `'z'`(U+007A)，两种排序结果相同，
+        //     把 compareByCodePoint 换成默认 .sort() 测试照样绿 = 假门禁。）
+        const emoji = '\u{1F600}';
+        const fullwidthZ = '\uFF5A';
+        assert.notStrictEqual(emoji < fullwidthZ, emoji.codePointAt(0) < fullwidthZ.codePointAt(0), '★选用的键对在两种排序下次序相同，本用例无法判别 —— 换一对键。');
+        // 期望值取自 Java CanonicalJson.canonicalHash（实跑），非 TS 自产回填。
+        assert.strictEqual(canonicalHash({ [emoji]: 1, [fullwidthZ]: 2 }), 'b87d68a90ea148ae96b7a6680061882d749a96d3b0a269a9c5b3a18ff647961e', '键序与 Java 不一致 —— 多半是用了 JS 默认的 UTF-16 比较而非 code point 比较。');
+    });
+    it('★拒绝浮点与超安全整数：静默降级会产出两侧不同的 hash', () => {
+        assert.throws(() => canonicalHash({ x: 1.5 }), /安全整数/, '浮点应抛错——跨引擎浮点表示不一致，静默接受会让两侧 hash 不同且无人察觉。');
+        assert.throws(() => canonicalHash({ x: Number.MAX_SAFE_INTEGER + 2 }), /安全整数/);
+        assert.throws(() => canonicalHash({ x: NaN }), /NaN|Infinity/);
+    });
+    it('hash 随内容变化（防止退化成常量）', () => {
+        assert.notStrictEqual(canonicalHash({ a: 1 }), canonicalHash({ a: 2 }), '不同内容产出了相同 hash —— 指纹失效。');
+    });
+    it('★与 Java 引擎产出逐字节相同的 hash（跨引擎黄金向量）', () => {
+        // ADR 0037 §7 要求 `Verify_TS == Verify_Java`。contentHash 是 verifier 的
+        // 输入之一，两侧必须对同一棵树产出同一个 hash。
+        //
+        // ★下列期望值是从 **Java `CanonicalJson.canonicalHash`** 实跑取得的
+        //   （aster-lang-core，同一组输入），不是从 TS 自己的输出回填的——
+        //   后者会让本测试退化成「TS 和它自己一致」，恒绿且毫无意义。
+        //
+        // 覆盖四类易分叉点：键序、数组保序、字符串转义、null/bool 表示。
+        const golden = [
+            [{ kind: 'Func', name: 'approve' },
+                '1d734937ddec06a461c07bd9288b2794e5ed4c3f6412c35e77eb4f2ccedfa779'],
+            [{ kind: 'Module', name: 'demo.x', decls: [] },
+                'c57535c007893ea6a6e20cf310eac1bb94fe2034ccdbaa5d81c60672dc74b890'],
+            [{ z: 2, a: 1, m: [1, 2, 3] },
+                'ab46e446797b892a3626bbb51dac66c3bd1593612eb644be1f3f452232d876e3'],
+            [{ s: 'hello "world"\n', b: true, n: null },
+                '92c558f3dd8a1fd1e7be98261a6cb4fc37f01433418de7332dbb6540f8d5b8ea'],
+            [{ nested: { kind: 'If', cond: { kind: 'Bool', value: true } } },
+                '247d63263789e93f4c6700e1badf401abcd26662ca37767b4552873398571c7e'],
+        ];
+        for (const [value, expected] of golden) {
+            assert.strictEqual(canonicalHash(value), expected, `TS 与 Java 的 canonical hash 不一致，输入：${JSON.stringify(value)}`
+                + '\n★两侧对同一棵树必须产出同一 hash，否则跨引擎 verifier 无法成立。');
+        }
+    });
+});
+//# sourceMappingURL=change-impact.test.js.map

package/dist/test/unit/nodeid/change-impact.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"change-impact.test.js","sourceRoot":"","sources":["../../../../test/unit/nodeid/change-impact.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,WAAW,CAAC;AACzC,OAAO,MAAM,MAAM,oBAAoB,CAAC;AAExC,OAAO,EAAE,YAAY,EAAE,MAAM,wCAAwC,CAAC;AACtE,OAAO,EAAE,GAAG,EAAE,MAAM,gCAAgC,CAAC;AACrD,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAE5D,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,oCAAoC,CAAC;AACnF,OAAO,EAAE,WAAW,EAAE,MAAM,sCAAsC,CAAC;AAEnE;;;;;;GAMG;AAEH,MAAM,EAAE,GAAG;IACT,sBAAsB;IACtB,EAAE;IACF,qCAAqC;IACrC,iCAAiC;IACjC,qBAAqB;IACrB,cAAc;IACd,uBAAuB;IACvB,EAAE;CACH,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAEb,8DAA8D;AAC9D,SAAS,EAAE,CAAC,GAAW;IACrB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAgB,CAAC;IAC3D,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,SAAS,KAAK,CAAC,GAAW;IACxB,OAAO,cAAc,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;AACjC,CAAC;AAED,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACxC,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,gCAAgC,CAAC,CAAC;QAEhE,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;QAElD,sCAAsC;QACtC,MAAM,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,EAC9C,0BAA0B,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACvD,MAAM,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,EAChD,4BAA4B,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAEzD,iDAAiD;QACjD,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,EAChD,0CAA0C,CAAC,CAAC;QAE9C,0CAA0C;QAC1C,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,EACjF,iDAAiD,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAChF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,2CAA2C;QAC3C,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,cAAc,EAAE,oDAAoD,CAAC,CAAC;QAC5F,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,qBAAqB,CAAC,CAAC;QAErD,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;QACzB,MAAM,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;QAExB,KAAK,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,MAAM,EAAE,CAAC;YACpC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1B,MAAM,CAAC,EAAE,CAAC,GAAG,KAAK,SAAS,EACzB,eAAe,EAAE,SAAS;kBACxB,uCAAuC,CAAC,CAAC;YAC7C,gDAAgD;YAChD,4CAA4C;YAC5C,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBACf,MAAM,CAAC,WAAW,CAAC,GAAI,CAAC,WAAW,EAAE,QAAQ,CAAC,WAAW,EACvD,OAAO,EAAE,uBAAuB;sBAC9B,0CAA0C,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,WAAW,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,WAAW,EAC7E,0CAA0C,CAAC,CAAC;QAE9C,MAAM,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,EAChE,sBAAsB,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,4CAA4C;QAC5C,4CAA4C;QAC5C,MAAM,CAAC,eAAe,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAC1D,oBAAoB,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,uCAAuC;QACvC,MAAM,EAAE,GAAG,WAAW,EAAE,EAAE,CAAC;QAE3B,MAAM,CAAC,eAAe,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAC1D,2BAA2B;cACzB,+CAA+C;cAC/C,kCAAkC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,qDAAqD;QACrD,uCAAuC;QACvC,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,2BAA2B,EAAE,0BAA0B,CAAC,CAAC;QAC/E,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,qBAAqB,CAAC,CAAC;QAErD,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,EAC/C,2CAA2C,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACxE,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,EAC7C,uBAAuB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QAE5E,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,KAAK,MAAM,QAAQ,IAAI,CAAC,CAAC,cAAc,EAAE,CAAC;gBACxC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,EACrC,2BAA2B,CAAC,CAAC,MAAM,MAAM,QAAQ,EAAE;sBACjD,sCAAsC,CAAC,CAAC;gBAC5C,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,6BAA6B,CAAC,CAAC;YAC3E,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,4DAA4D;QAC5D,sDAAsD;QACtD,0CAA0C;QAC1C,EAAE;QACF,qCAAqC;QACrC,2DAA2D;QAC3D,iDAAiD;QACjD,mDAAmD;QACnD,sDAAsD;QACtD,MAAM,KAAK,GAAG,WAAW,CAAC;QAC1B,MAAM,UAAU,GAAG,QAAQ,CAAC;QAC5B,MAAM,CAAC,cAAc,CACnB,KAAK,GAAG,UAAU,EAClB,KAAK,CAAC,WAAW,CAAC,CAAC,CAAE,GAAG,UAAU,CAAC,WAAW,CAAC,CAAC,CAAE,EAClD,mCAAmC,CAAC,CAAC;QAEvC,wDAAwD;QACxD,MAAM,CAAC,WAAW,CAChB,aAAa,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC,EAC9C,kEAAkE,EAClE,yDAAyD,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EACnD,0CAA0C,CAAC,CAAC;QAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,gBAAgB,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;QAC/E,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC7B,MAAM,CAAC,cAAc,CAAC,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACpE,yBAAyB,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,qEAAqE;QACrE,4BAA4B;QAC5B,EAAE;QACF,wDAAwD;QACxD,8CAA8C;QAC9C,mCAAmC;QACnC,EAAE;QACF,uCAAuC;QACvC,MAAM,MAAM,GAA8C;YACxD,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE;gBAChC,kEAAkE,CAAC;YACrE,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,EAAE;gBAC5C,kEAAkE,CAAC;YACrE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;gBAC3B,kEAAkE,CAAC;YACrE,CAAC,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE;gBACzC,kEAAkE,CAAC;YACrE,CAAC,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE;gBAC9D,kEAAkE,CAAC;SACtE,CAAC;QAEF,KAAK,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,MAAM,EAAE,CAAC;YACvC,MAAM,CAAC,WAAW,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,QAAQ,EAC/C,qCAAqC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;kBAC1D,4CAA4C,CAAC,CAAC;QACpD,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/unit/nodeid/rename-declaration.test.d.ts

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

package/dist/test/unit/nodeid/rename-declaration.test.d.ts.map

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

package/dist/test/unit/nodeid/rename-declaration.test.js

@@ -0,0 +1,75 @@
+import { describe, it } from 'node:test';
+import assert from 'node:assert/strict';
+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';
+import { computeNodeIds } from '../../../src/nodeid/node-id-map.js';
+import { diffNodeIds, rename } from '../../../src/nodeid/change-impact.js';
+/**
+ * 显式 rename 声明（ADR 0037 §8.5 最后一项未决，与 Java 侧对等）。
+ *
+ * 命名作用域路径对重命名敏感：改一条规则的名字，其整棵子树的 nodeId 全变。
+ * 实测 16 节点样本 → 31 条变更，而其中 14 个节点内容逐字节未变。
+ */
+const V1 = [
+    'Module demo.approve.', '',
+    'Rule approve given amount, produce:',
+    '  If amount greater than 10000:',
+    '    Return "REFER".',
+    '  Otherwise:',
+    '    Return "APPROVE".', '',
+].join('\n');
+const idsOf = (src) => computeNodeIds(JSON.parse(JSON.stringify(lowerModule(parse(lex(canonicalize(src))).ast))));
+describe('显式 rename 声明（TS 侧）', () => {
+    it('★声明后子树身份整体迁移，REMOVED/ADDED 噪声归零', () => {
+        const v2 = V1.replace('Rule approve given amount', 'Rule assess given amount');
+        assert.notStrictEqual(v2, V1, '★replace 未生效则本用例无效。');
+        const before = idsOf(V1), after = idsOf(v2);
+        const noiseBefore = diffNodeIds(before, after).filter(c => c.kind !== 'MODIFIED').length;
+        const noiseAfter = diffNodeIds(before, after, [rename('approve', 'assess')])
+            .filter(c => c.kind !== 'MODIFIED').length;
+        assert.ok(noiseBefore > 0, '未声明时应存在 REMOVED/ADDED 噪声（问题本身）。');
+        assert.strictEqual(noiseAfter, 0, `声明后不应再有 REMOVED/ADDED，实际 ${noiseAfter} 条。`);
+    });
+    it('★真实改动仍被报告（反向守卫：声明不得吞掉一切）', () => {
+        // 没有这条，「声明重命名」可以退化成「把所有变更都吞掉」，上面那条照样绿。
+        const v2 = V1
+            .replace('Rule approve given amount', 'Rule assess given amount')
+            .replace('10000', '20000');
+        const changes = diffNodeIds(idsOf(V1), idsOf(v2), [rename('approve', 'assess')]);
+        assert.ok(changes.some(c => c.kind === 'MODIFIED'), '阈值确实改了，必须仍报 MODIFIED。');
+        assert.ok(changes.some(c => c.staleAncestors.some(a => a.includes('{assess}'))), '受影响的规则应以**新**名字出现在 staleAncestors 里。');
+    });
+    it('★contentHash 不唯一 —— 自动配对不可靠的依据', () => {
+        const ids = idsOf(['Module m.', '', 'Rule alpha, produce:', '  Return 1.', '',
+            'Rule beta, produce:', '  Return 1.', ''].join('\n'));
+        const a = ids.get('$.decls{alpha}.body');
+        const b = ids.get('$.decls{beta}.body');
+        assert.ok(a && b, '未找到被测节点，测试失去对象。');
+        assert.strictEqual(a.contentHash, b.contentHash, '两条同体规则的 body 应有相同 contentHash。'
+            + '\n★若本条变红，说明 hash 已唯一，届时可重新评估自动配对方案。');
+    });
+    it('只替换完整路径段，不做子串误伤（approve 不碰 approveAll）', () => {
+        const src = ['Module m.', '', 'Rule approve, produce:', '  Return 1.', '',
+            'Rule approveAll, produce:', '  Return 2.', ''].join('\n');
+        const renamed = src.replace('Rule approve,', 'Rule assess,');
+        assert.notStrictEqual(renamed, src, '★构造未生效则本用例无效。');
+        const changes = diffNodeIds(idsOf(src), idsOf(renamed), [rename('approve', 'assess')]);
+        assert.ok(!changes.some(c => c.nodeId.includes('approveAll')), `approveAll 未被修改，不应出现在变更里 —— 多半是把 approve 当子串误伤了。实际：${JSON.stringify(changes)}`);
+        assert.ok(changes.every(c => c.kind === 'MODIFIED'), '声明后不应再有 REMOVED/ADDED。');
+    });
+    it('自相矛盾的声明直接拒绝', () => {
+        assert.throws(() => diffNodeIds(idsOf(V1), idsOf(V1), [rename('approve', 'assess'), rename('approve', 'review')]), /多个目标/, '同一名字声明到两个目标，应当拒绝而非静默取其一。');
+    });
+    it('非法 Rename 构造直接拒绝', () => {
+        assert.throws(() => rename('', 'x'), /不能为空/);
+        assert.throws(() => rename('x', ' '), /不能为空/);
+        assert.throws(() => rename('same', 'same'), /相同/);
+    });
+    it('不传 renames 时与旧行为一致（向后兼容）', () => {
+        const v2 = V1.replace('10000', '20000');
+        assert.deepStrictEqual(diffNodeIds(idsOf(V1), idsOf(v2)), diffNodeIds(idsOf(V1), idsOf(v2), []));
+    });
+});
+//# sourceMappingURL=rename-declaration.test.js.map

package/dist/test/unit/nodeid/rename-declaration.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rename-declaration.test.js","sourceRoot":"","sources":["../../../../test/unit/nodeid/rename-declaration.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,WAAW,CAAC;AACzC,OAAO,MAAM,MAAM,oBAAoB,CAAC;AAExC,OAAO,EAAE,YAAY,EAAE,MAAM,wCAAwC,CAAC;AACtE,OAAO,EAAE,GAAG,EAAE,MAAM,gCAAgC,CAAC;AACrD,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAE5D,OAAO,EAAE,cAAc,EAAE,MAAM,oCAAoC,CAAC;AACpE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,sCAAsC,CAAC;AAE3E;;;;;GAKG;AAEH,MAAM,EAAE,GAAG;IACT,sBAAsB,EAAE,EAAE;IAC1B,qCAAqC;IACrC,iCAAiC;IACjC,qBAAqB;IACrB,cAAc;IACd,uBAAuB,EAAE,EAAE;CAC5B,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAEb,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAC5B,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;AAE1G,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IAClC,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,2BAA2B,EAAE,0BAA0B,CAAC,CAAC;QAC/E,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,qBAAqB,CAAC,CAAC;QAErD,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;QAC5C,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,MAAM,CAAC;QACzF,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC;aACzE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,MAAM,CAAC;QAE7C,MAAM,CAAC,EAAE,CAAC,WAAW,GAAG,CAAC,EAAE,iCAAiC,CAAC,CAAC;QAC9D,MAAM,CAAC,WAAW,CAAC,UAAU,EAAE,CAAC,EAAE,4BAA4B,UAAU,KAAK,CAAC,CAAC;IACjF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,uCAAuC;QACvC,MAAM,EAAE,GAAG,EAAE;aACV,OAAO,CAAC,2BAA2B,EAAE,0BAA0B,CAAC;aAChE,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAE7B,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QAEjF,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,EAAE,uBAAuB,CAAC,CAAC;QAC7E,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,EAC7E,sCAAsC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,WAAW,EAAE,EAAE,EAAE,sBAAsB,EAAE,aAAa,EAAE,EAAE;YAC3E,qBAAqB,EAAE,aAAa,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAExD,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC;QACzC,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC;QACxC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC;QACrC,MAAM,CAAC,WAAW,CAAC,CAAE,CAAC,WAAW,EAAE,CAAE,CAAC,WAAW,EAC/C,gCAAgC;cAC9B,qCAAqC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,GAAG,GAAG,CAAC,WAAW,EAAE,EAAE,EAAE,wBAAwB,EAAE,aAAa,EAAE,EAAE;YACvE,2BAA2B,EAAE,aAAa,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7D,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC,eAAe,EAAE,cAAc,CAAC,CAAC;QAC7D,MAAM,CAAC,cAAc,CAAC,OAAO,EAAE,GAAG,EAAE,eAAe,CAAC,CAAC;QAErD,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QAEvF,MAAM,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,EAC3D,sDAAsD,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnF,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,EAAE,wBAAwB,CAAC,CAAC;IACjF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;QACrB,MAAM,CAAC,MAAM,CACX,GAAG,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC,EACnG,MAAM,EAAE,0BAA0B,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAC1B,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;QAC7C,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;QAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACxC,MAAM,CAAC,eAAe,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,EACtD,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/unit/parse-type-recursion.test.d.ts

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

package/dist/test/unit/parse-type-recursion.test.d.ts.map

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

package/dist/test/unit/parse-type-recursion.test.js

@@ -0,0 +1,58 @@
+import { describe, it } from 'node:test';
+import assert from 'node:assert/strict';
+import { compile } from '../../src/browser.js';
+/**
+ * 类型递归的深度护栏（issue aster-lang-ts#145）。
+ *
+ * ★真实缺陷：`MAX_RECURSION_DEPTH=300` 的设计目标就是「病态输入不许打爆原生栈」，
+ * 但它此前**只接在 `parseExpr` 上**；而 `parseType → parseTypePrimary → parseType`
+ * 的类型递归完全无护栏。
+ *
+ * 实测（修复前）：`'maybe '.repeat(5000) + 'Int'`（约 30KB）→ 原生 `RangeError`
+ * 「Maximum call stack size exceeded」，被 decl-parser 的 catch-all 转成
+ * **span 恒为 1:1 的假诊断**——用户既不知道是哪一行，也不知道真正原因是嵌套过深。
+ *
+ * 对照：400 层**括号**一直正确报「nesting too deep (exceeds limit of 300)」——
+ * 同一份护栏，只是没接到类型这条路径上。
+ */
+function parseErrorOf(src) {
+    const c = compile(src);
+    const errs = c.parseErrors ?? [];
+    return errs.length > 0 ? errs[0].message : null;
+}
+function nestedMaybe(depth) {
+    return `Module p.\nRule r given x as ${'maybe '.repeat(depth)}Int, produce Int:\n  Return 1.\n`;
+}
+describe('类型嵌套深度护栏', () => {
+    it('★5000 层嵌套类型报可恢复诊断，不是原生 RangeError', () => {
+        const msg = parseErrorOf(nestedMaybe(5000));
+        assert.ok(msg, '应有解析错误');
+        assert.doesNotMatch(msg, /Maximum call stack size exceeded/, `不得渗出原生 RangeError；实际：${msg}`);
+        assert.match(msg, /nesting too deep/, `应报嵌套过深；实际：${msg}`);
+    });
+    it('★超限即报，且报的是嵌套过深而非别的错', () => {
+        const msg = parseErrorOf(nestedMaybe(400));
+        assert.ok(msg, '400 层已超 300 上限，应报错');
+        assert.match(msg, /nesting too deep/, `实际：${msg}`);
+    });
+    it('★护栏不随深度增加而失效（10000 层同样是可恢复诊断）', () => {
+        // 若护栏仍在递归之后，更深的输入只会更早栈溢出。
+        const msg = parseErrorOf(nestedMaybe(10000));
+        assert.ok(msg);
+        assert.doesNotMatch(msg, /Maximum call stack size exceeded/, `实际：${msg}`);
+    });
+});
+describe('正常类型不受影响（反向护栏）', () => {
+    // ★没有这一组，把 parseType 写成「一律报嵌套过深」也能让上面全部变绿。
+    it('普通类型正常解析', () => {
+        assert.equal(parseErrorOf('Module p.\nRule r given x as Int, produce Int:\n  Return 1.\n'), null);
+    });
+    it('浅层嵌套类型正常解析', () => {
+        assert.equal(parseErrorOf(nestedMaybe(10)), null, '10 层远低于上限');
+    });
+    it('★接近上限但未超（290 层）仍应通过', () => {
+        // 锁住「上限是 300 而不是被我改小了」——防护栏顺手收紧了合法输入。
+        assert.equal(parseErrorOf(nestedMaybe(290)), null, '290 层未超 300 上限，应通过');
+    });
+});
+//# sourceMappingURL=parse-type-recursion.test.js.map

package/dist/test/unit/parse-type-recursion.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parse-type-recursion.test.js","sourceRoot":"","sources":["../../../test/unit/parse-type-recursion.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;AAE/C;;;;;;;;;;;;;GAaG;AACH,SAAS,YAAY,CAAC,GAAW;IAC/B,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IACvB,MAAM,IAAI,GAAI,CAA6C,CAAC,WAAW,IAAI,EAAE,CAAC;IAC9E,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;AACnD,CAAC;AAED,SAAS,WAAW,CAAC,KAAa;IAChC,OAAO,gCAAgC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,kCAAkC,CAAC;AAClG,CAAC;AAED,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;IACxB,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,GAAG,GAAG,YAAY,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACzB,MAAM,CAAC,YAAY,CAAC,GAAI,EAAE,kCAAkC,EAC1D,wBAAwB,GAAG,EAAE,CAAC,CAAC;QACjC,MAAM,CAAC,KAAK,CAAC,GAAI,EAAE,kBAAkB,EAAE,aAAa,GAAG,EAAE,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC7B,MAAM,GAAG,GAAG,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,oBAAoB,CAAC,CAAC;QACrC,MAAM,CAAC,KAAK,CAAC,GAAI,EAAE,kBAAkB,EAAE,MAAM,GAAG,EAAE,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,0BAA0B;QAC1B,MAAM,GAAG,GAAG,YAAY,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QACf,MAAM,CAAC,YAAY,CAAC,GAAI,EAAE,kCAAkC,EAAE,MAAM,GAAG,EAAE,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,2CAA2C;IAC3C,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE;QAClB,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,+DAA+D,CAAC,EAAE,IAAI,CAAC,CAAC;IACpG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;QACpB,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC7B,sCAAsC;QACtC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/unit/regex-guard.test.js

@@ -49,6 +49,70 @@ test('regex-guard 测试套件', async (t) => {
             assert.match(result.error, /invalid regular expression/i);
         }
     });
+    await t.test('★相邻量词歧义也必须拒绝（嵌套量词检查抓不到它）', () => {
+        // ★这个缺口由独立审查者发现，我已复现：
+        //   `hasNestedQuantifier` 只看「被量词修饰的**分组**」，
+        //   而歧义**不需要分组**——两个相邻、匹配同一原子的量词即可产生
+        //   2^n 种切分，后缀失配时全部被穷举。
+        //
+        //   实测（守卫改前全部 ACCEPTED）：
+        //     a*a*a*a*a*a*a*a*a*a*b   16→292ms 20→361ms 22→808ms 24→1705ms（每 +2 翻倍）
+        //     a+a+a+a+a+a+a+a+b       同样指数
+        //
+        //   ★TS 侧**没有看门狗兜底**（Java 的 replaceAllWithTimeout 有），
+        //   单线程 JS 下这就是无限挂死。
+        for (const evil of [
+            'a*a*a*a*a*a*a*a*a*a*b',
+            'a+a+a+a+a+a+a+a+b',
+            '\\d*\\d*x',
+            '[ab]*[ab]*c',
+            'a{1,}a{1,}b',
+            // ★以下三条是独立审查者找出的绕过（第一版全部 ACCEPTED，实测 24 字符
+            //   输入 1720ms / 1720ms / 640ms，与已修的 a*a*b 同级）。
+            //   根因：readQuantifiedAtom 遇 `(` 直接 return null 并注释「交给
+            //   hasNestedQuantifier」，但后者只看**分组内部**有无量词——
+            //   `(a)*(a)*` 两侧内部都没有，于是**无人负责**。
+            '(a)*(a)*b',
+            '(?:a)*(?:a)*b',
+            'a*?a*?b',
+            // ★字符类里的括号会骗过深度扫描——这是**加分组支持时新引入**的漏判
+            //   （上一版遇 `(` 直接 return null，反而不会误算深度）。实测 22 字符 794ms。
+            '([)])*([)])*b',
+            '([(])*([(])*b',
+            // ★这条同样能区分两态（跳过=REJECT / 不跳过=ACCEPT），
+            //   且原子内「字符类 + 普通字符」混排，覆盖面比上两条更宽。
+            '([)]a)*([)]a)*b',
+        ]) {
+            const result = compileGuardedRegex(evil, '');
+            assert.strictEqual(result.ok, false, `相邻量词模式 ${evil} 未被拒绝`);
+            if (!result.ok) {
+                assert.match(result.error, /adjacent ambiguous quantifier/i);
+            }
+        }
+    });
+    await t.test('★合法模式不得被相邻量词检查误伤（误伤比漏网更糟）', () => {
+        // 反向守卫：守卫收得过紧会**静默丢掉**用户的合法 overlay 规则，
+        // 那比漏掉一个 ReDoS 更难发现。
+        //
+        // ★`a*b*c`（不同原子）、`a*a`/`aa*`（只有一个量词）都必须通过。
+        // 实证：扫了两仓 79 条**生产**词典正则，零误伤。
+        for (const ok of [
+            'a*b*c', '\\d+\\w+', '[a-z]+[0-9]*', '(ab)+c', 'a+b',
+            '\\bfoo\\b', 'greater\\s+than', '[\\p{L}]+', 'x{2,5}y',
+            'a*a', 'aa*', '\\s+\\S+', '^(#{1,6})\\s',
+            // ★反向：不同原子的相邻量词、含分组的合法模式不得被误伤
+            '(a)(b)*c', '(?:ab)*(?:cd)*e', 'a*?b*?c',
+            // ★`([)])(a)*b` 是**非回归样本**，不是「字符类跳过」的守卫：
+            //   我复刻「跳过/不跳过」两版逐条对拍，它在两态下**判定相同**（均 false），
+            //   故变异掉字符类跳过时它照样绿——**没有证明力**。保留它只为确认
+            //   含字符类的合法模式不被误伤，不得把它算进「反向守卫有效」的证据。
+            //   真正能区分两态的样本全在**攻击方向**（见上面的 `([)])*([)])*b`）。
+            '([)])(a)*b',
+        ]) {
+            const result = compileGuardedRegex(ok, ok.includes('p{') ? 'u' : '');
+            assert.strictEqual(result.ok, true, `合法模式 ${ok} 被误伤：${result.ok ? '' : result.error}`);
+        }
+    });
     await t.test('overlay-loader 跳过恶意 type-inference 规则', () => {
         const rules = loadTypeInferenceRules({
             version: 1,

package/dist/test/unit/regex-guard.test.js.map

@@ -1 +1 @@
-{"version":3,"file":"regex-guard.test.js","sourceRoot":"","sources":["../../../test/unit/regex-guard.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,MAAM,MAAM,aAAa,CAAC;AACjC,OAAO,EACL,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,0CAA0C,CAAC;AAClD,OAAO,EAAE,sBAAsB,EAAE,MAAM,6CAA6C,CAAC;AAErF,IAAI,CAAC,kBAAkB,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE;IACnC,MAAM,CAAC,CAAC,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;QACvD,MAAM,MAAM,GAAG,mBAAmB,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QACjD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,0BAA0B,CAAC,CAAC;QACzD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,CAAC,IAAI,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAC1C,KAAK,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,CAAC,EAAE,CAAC;YAC7D,MAAM,MAAM,GAAG,mBAAmB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC7C,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,KAAK,EAAE,YAAY,IAAI,iBAAiB,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE;QAC1B,MAAM,WAAW,GAAG,GAAG,CAAC,MAAM,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,mBAAmB,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;QACpD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,EAAE;QAC5B,MAAM,MAAM,GAAG,mBAAmB,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QACxD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACpC,IAAI,MAAM,CAAC,EAAE,EAAE,CAAC;YACd,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,YAAY,MAAM,CAAC,CAAC;YAC1C,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,EAAE,IAAI,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,CAAC,IAAI,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAClC,MAAM,MAAM,GAAG,mBAAmB,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;QACpD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,6BAA6B,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,CAAC,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACzD,MAAM,KAAK,GAAG,sBAAsB,CAAC;YACnC,OAAO,EAAE,CAAC;YACV,KAAK,EAAE;gBACL,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE;gBAC9C,EAAE,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE;aACnD;SACF,CAAC,CAAC;QACH,wBAAwB;QACxB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC1C,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
+{"version":3,"file":"regex-guard.test.js","sourceRoot":"","sources":["../../../test/unit/regex-guard.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,MAAM,MAAM,aAAa,CAAC;AACjC,OAAO,EACL,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,0CAA0C,CAAC;AAClD,OAAO,EAAE,sBAAsB,EAAE,MAAM,6CAA6C,CAAC;AAErF,IAAI,CAAC,kBAAkB,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE;IACnC,MAAM,CAAC,CAAC,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;QACvD,MAAM,MAAM,GAAG,mBAAmB,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QACjD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,0BAA0B,CAAC,CAAC;QACzD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,CAAC,IAAI,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAC1C,KAAK,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,CAAC,EAAE,CAAC;YAC7D,MAAM,MAAM,GAAG,mBAAmB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC7C,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,KAAK,EAAE,YAAY,IAAI,iBAAiB,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE;QAC1B,MAAM,WAAW,GAAG,GAAG,CAAC,MAAM,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,mBAAmB,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;QACpD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,EAAE;QAC5B,MAAM,MAAM,GAAG,mBAAmB,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QACxD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACpC,IAAI,MAAM,CAAC,EAAE,EAAE,CAAC;YACd,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,YAAY,MAAM,CAAC,CAAC;YAC1C,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,EAAE,IAAI,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,CAAC,IAAI,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAClC,MAAM,MAAM,GAAG,mBAAmB,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;QACpD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,6BAA6B,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,CAAC,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;QAC5C,sBAAsB;QACtB,4CAA4C;QAC5C,qCAAqC;QACrC,wBAAwB;QACxB,EAAE;QACF,yBAAyB;QACzB,4EAA4E;QAC5E,mCAAmC;QACnC,EAAE;QACF,sDAAsD;QACtD,qBAAqB;QACrB,KAAK,MAAM,IAAI,IAAI;YACjB,uBAAuB;YACvB,mBAAmB;YACnB,WAAW;YACX,aAAa;YACb,aAAa;YACb,2CAA2C;YAC3C,+CAA+C;YAC/C,sDAAsD;YACtD,6CAA6C;YAC7C,mCAAmC;YACnC,WAAW;YACX,eAAe;YACf,SAAS;YACT,sCAAsC;YACtC,uDAAuD;YACvD,eAAe;YACf,eAAe;YACf,sCAAsC;YACtC,kCAAkC;YAClC,iBAAiB;SAClB,EAAE,CAAC;YACF,MAAM,MAAM,GAAG,mBAAmB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC7C,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,KAAK,EAAE,UAAU,IAAI,OAAO,CAAC,CAAC;YAC5D,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;gBACf,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,gCAAgC,CAAC,CAAC;YAC/D,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,CAAC,IAAI,CAAC,2BAA2B,EAAE,GAAG,EAAE;QAC7C,wCAAwC;QACxC,qBAAqB;QACrB,EAAE;QACF,2CAA2C;QAC3C,8BAA8B;QAC9B,KAAK,MAAM,EAAE,IAAI;YACf,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,QAAQ,EAAE,KAAK;YACpD,WAAW,EAAE,iBAAiB,EAAE,WAAW,EAAE,SAAS;YACtD,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,cAAc;YACxC,8BAA8B;YAC9B,UAAU,EAAE,iBAAiB,EAAE,SAAS;YACxC,yCAAyC;YACzC,8CAA8C;YAC9C,sCAAsC;YACtC,qCAAqC;YACrC,gDAAgD;YAChD,YAAY;SACb,EAAE,CAAC;YACF,MAAM,MAAM,GAAG,mBAAmB,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACrE,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,EAChC,QAAQ,EAAE,QAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QACvD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,CAAC,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACzD,MAAM,KAAK,GAAG,sBAAsB,CAAC;YACnC,OAAO,EAAE,CAAC;YACV,KAAK,EAAE;gBACL,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE;gBAC9C,EAAE,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE;aACnD;SACF,CAAC,CAAC;QACH,wBAAwB;QACxB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC1C,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/unit/strict-int-coercion.test.d.ts

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

package/dist/test/unit/strict-int-coercion.test.d.ts.map

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