@faicad/faijs 0.19.0 → 0.29.3

package/dist/topology/naming/lineage.js.map

@@ -1 +1 @@
-{"version":3,"file":"lineage.js","sourceRoot":"","sources":["../../../src/topology/naming/lineage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6CG;AAgDH,kCAAkC;AAClC,MAAM,CAAC,MAAM,gBAAgB,GAAG;IAC9B,QAAQ;IACR,WAAW;IACX,UAAU;IACV,WAAW;IACX,WAAW;IACX,WAAW;CACH,CAAA;AAcV;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,CAAkB;IAChD,OAAO,UAAU,IAAI,CAAC,IAAI,SAAS,IAAI,CAAC,CAAA;AAC1C,CAAC;AAwDD,4BAA4B;AAC5B,MAAM,OAAO,YAAa,SAAQ,KAAK;IACrC,6BAA6B;IACpB,IAAI,CAAkB;IAC/B,sBAAsB;IACb,IAAI,CAAS;IAEtB;;;;OAIG;IACH,YAAY,IAAsB,EAAE,OAAe,EAAE,IAAa;QAChE,KAAK,CAAC,OAAO,CAAC,CAAA;QACd,IAAI,CAAC,IAAI,GAAG,cAAc,CAAA;QAC1B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;IAClB,CAAC;CACF;AAED,+CAA+C;AAE/C;;;;;;;;;;GAUG;AACH,MAAM,UAAU,cAAc,CAAC,CAAW,EAAE,CAAW;IACrD,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,UAAU;YACb,OAAO,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAA;QACnD,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,CAAA;QACjD,KAAK,UAAU;YACb,OAAO,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,CAAA;QACrD,KAAK,WAAW;YACd,OAAO,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,CAAA;QACvE,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,IAAI,cAAc,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAA;QACrF,KAAK,SAAS;YACZ,OAAO,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,cAAc,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAA;QAChF,KAAK,UAAU;YACb,OAAO,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,IAAI,cAAc,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAA;IAC3F,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAc,EAAE,CAAc;IAC9D,IAAI,CAAC,CAAC,GAAG,KAAK,aAAa;QAAE,OAAO,CAAC,CAAC,GAAG,KAAK,aAAa,CAAA;IAC3D,IAAI,CAAC,CAAC,GAAG,KAAK,UAAU;QAAE,OAAO,KAAK,CAAA;IACtC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM;QAAE,OAAO,KAAK,CAAA;IACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;IAC3D,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAa,EAAE,CAAa;IAC3D,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,UAAU;YACb,OAAO,CAAC,CAAC,IAAI,KAAK,UAAU,CAAA;QAC9B,KAAK,WAAW;YACd,OAAO,CAAC,CAAC,IAAI,KAAK,WAAW,CAAA;QAC/B,KAAK,WAAW;YACd,OAAO,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;QAC9C,KAAK,WAAW;YACd,OAAO,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAA;QACxD,KAAK,QAAQ;YACX,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,iBAAiB,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAA;QACzE,KAAK,WAAW;YACd,OAAO,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,iBAAiB,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAA;IAC9E,CAAC;AACH,CAAC;AAED,qBAAqB;AACrB,SAAS,SAAS,CAAC,CAAsB,EAAE,CAAsB;IAC/D,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAC/D,CAAC;AAED,YAAY;AAEZ;;;;;GAKG;AACH,MAAM,OAAO,YAAY;IACN,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAA;IACtC,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAA;IACxD;;;;;;OAMG;IACc,YAAY,GAAG,IAAI,GAAG,EAAuE,CAAA;IAC9G;;;OAGG;IACc,aAAa,GAAG,IAAI,GAAG,EAAmB,CAAA;IAC3D;;;;;;;;OAQG;IACc,kBAAkB,GAAG,IAAI,GAAG,EAAyE,CAAA;IAEtH;;;;;;;OAOG;IACH,QAAQ,CAAC,KAAmB,EAAE,IAAiB;QAC7C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAA;QAEvB,2CAA2C;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAA;QACjC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,YAAY,CACpB,kBAAkB,EAClB,GAAG,KAAK,CAAC,EAAE,oCAAoC,EAC/C,IAAI,CACL,CAAA;QACH,CAAC;QACD,IAAI,MAAM,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC;YACvB,MAAM,IAAI,YAAY,CACpB,kBAAkB,EAClB,GAAG,KAAK,CAAC,EAAE,UAAU,IAAI,UAAU,MAAM,CAAC,EAAE,KAAK,EACjD,IAAI,CACL,CAAA;QACH,CAAC;QAED,0CAA0C;QAC1C,MAAM,MAAM,GAAe,EAAE,CAAA;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;YACzC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,MAAM,IAAI,YAAY,CACpB,wBAAwB,EACxB,GAAG,KAAK,CAAC,EAAE,OAAO,CAAC,sCAAsC;oBACvD,+BAA+B,EACjC,IAAI,CACL,CAAA;YACH,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACnB,CAAC;QAED,MAAM,IAAI,GAAgB;YACxB,IAAI;YACJ,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,MAAM;YACN,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;YAC3B,UAAU,EAAE,KAAK,CAAC,UAAU;SAC7B,CAAA;QAED,+BAA+B;QAC/B,wDAAwD;QACxD,uCAAuC;QACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACrC,IAAI,QAAQ,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;YAC9C,MAAM,IAAI,YAAY,CACpB,uBAAuB,EACvB,GAAG,IAAI,cAAc;gBACnB,OAAO,QAAQ,CAAC,EAAE,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,QAAQ,CAAC,UAAU,CAAC,IAAI,IAAI;gBAChH,OAAO,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,UAAU,CAAC,IAAI,GAAG,EACjG,IAAI,CACL,CAAA;QACH,CAAC;QAED,6CAA6C;QAC7C,EAAE;QACF,6DAA6D;QAC7D,sDAAsD;QACtD,gCAAgC;QAChC,EAAE;QACF,oDAAoD;QACpD,wCAAwC;QACxC,0DAA0D;QAC1D,wCAAwC;QAExC,+CAA+C;QAC/C,0CAA0C;QAC1C,mDAAmD;QACnD,uCAAuC;QACvC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAC7F,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO;YAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QAC7D,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAE,CAAA;IAC9B,CAAC;IAED;;;;;;;;;OASG;IACH,eAAe,CAAC,IAAY,EAAE,SAA0B;QACtD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACjC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,YAAY,CACpB,kBAAkB,EAClB,WAAW,IAAI,0BAA0B,EACzC,IAAI,CACL,CAAA;QACH,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC,CAAA;IAC9C,CAAC;IAED;;;;;OAKG;IACH,IAAI,CAAC,IAAY;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC7B,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,IAAc;QACnB,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACjC,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,IAAc;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACrC,OAAO,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC9D,CAAC;IAED;;;;;;;;OAQG;IACH,aAAa,CAAC,IAAc;QAC1B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAA;QAC7C,CAAC;QACD,OAAO,SAAS,CAAA;IAClB,CAAC;IAED,eAAe;IACf,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAA;IACxB,CAAC;IAED,wCAAwC;IACxC,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;QAClB,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAA;QACtB,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAA;QACzB,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAA;QAC1B,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAA;IACjC,CAAC;IAED;;;;;;;;;;OAUG;IACH,YAAY,CAAC,IAAY,EAAE,SAAuE,EAAE,KAAe,EAAE,IAAe;QAClI,IAAI,SAAS;YAAE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;QACrD,IAAI,KAAK,KAAK,SAAS;YAAE,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QAC5D,IAAI,SAAS,IAAI,IAAI,KAAK,SAAS;YAAE,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;IACnF,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,IAAY;QACxB,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACpC,CAAC;IAED;;;;OAIG;IACH,cAAc,CAAC,IAAY;QACzB,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACrC,CAAC;IAED;;;;;;;;;OASG;IACH,WAAW,CAAC,IAAc;QACxB,OAAO,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC1C,CAAC;CACF;AAED;;;;;;GAMG;AACH,SAAS,YAAY,CAAC,CAAc,EAAE,CAAc;IAClD,OAAO,CACL,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE;QACb,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;QAC7B,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC;QAC/B,gBAAgB,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,UAAU,CAAC,CAC7C,CAAA;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,IAAI,YAAY,EAAE,CAAA","sourcesContent":["/**\n * lineage.ts — 血缘图登记（计划 §4.3）。\n *\n * 每个 op 执行完登记一条 `LineageNode`：**谁（`StmtId`）用什么 op、吃了哪些\n * part、产出哪些 part、属哪个 provenance 类别**。两张表：\n *\n * | 表 | 键 → 值 | 用途 |\n * |---|---|---|\n * | `lineage` | `StmtId` → `LineageNode` | 从身份原点沿 DAG 前进 |\n * | `partToStmt` | `PartName` → `StmtId` | 从 part 名字反查是哪条语句造的 |\n *\n * ## 为什么这一层必须存在\n *\n * 现状把身份表达成 **hash**（`face-evolution.ts` 的内存指针哈希），于是每次查询都在\n * 付「对齐 hash」的利息：谁改了几何，谁的 hash 就变，身份就断。正确形态是\n * `(StmtId, RoleName)` 的**因果坐标**——`StmtId` 说「哪条语句产生」，`RoleName` 说\n * 「那条语句把它当作什么」。因果坐标不随几何变化，**也不需要知道中间过了几个 op**。\n *\n * ## 登记口只能有一个（但调用点有两个）\n *\n * 手写 op 走 `wrapBrepOne`（`define-op.ts`），生成投影走 `compatOp`\n * （`api/internal/compat-op.ts`）——**两条路径都必须登记**，否则 42 条投影永远无名。\n * 但两条路径共用一个 `register()`，规则才只有一处。\n *\n * ## 三条硬规则（这是「未来漏洞最少」的核心）\n *\n * | # | 规则 | 违反时 |\n * |---|---|---|\n * | **N1** | inputs 里任一 Shape 查不到 `PartName` → 报错 | `E_TOPO_UNTRACKED_INPUT` |\n * | **N2** | 当前语句锚点缺失，或与声明的 `stmt` 不符 → 报错 | `E_TOPO_NO_ANCHOR` |\n * | **N3** | 同一 `StmtId` 重复登记且**身份内容**不同 → 报错 | `E_TOPO_DUPLICATE_STMT` |\n *\n * **N1 为什么必须是错误而不是\"默认成链根\"**：op 内部常临时造 Shape（中间产物、\n * 工具件）。若给它们默认一个 origin，「看起来对但语义错」的身份就诞生了——\n * 引用能解析成功，但解析到**别的面**。这类错误不会在测试里暴露（测试用的参数恰好\n * 让两者重合），只会在用户改参数、改尺寸时暴露。**宁可在执行期就炸。**\n *\n * **N2 为什么现在才敢做**：它依赖 `getCurrentStmt()` 是\"当前语句的权威读法\"。\n * 这一点由约束 **C1（禁止并发多 runtime）** 保证（见 §4.7.1）——不是\"全局态凑合能用\"。\n *\n * ## 依赖注入，不读全局\n *\n * `register()` 收一个 `LineageDeps`（`nameOf` / `currentStmt`）而不是 import\n * `runtime-state`。理由有两条：其一，`topology/` 现有模块（如 `roles.ts`）都是\n * \"把依赖当参数\"的风格，读全局会破坏它；其二，N1/N2/N3 的测试不想去摆弄全局态。\n */\n\nimport type { PartName, StmtId } from '../../identity'\nimport type { HashEvolution } from '../../brep/face-evolution'\nimport { type RoleName } from './role-name'\n\n// ── provenance 类别（封闭，计划 §4.4）──\n\n/**\n * 新造面的获取方式（只有 `kernel` / `construct` 需要）。\n *\n * - `byAdjacency`：靠结果形状与输入的**邻接关系**推出哪个面是新造的\n *   （布尔/倒角等：新面必然与已知面相邻，而幸存面有自己的坐标）\n * - `explicit`：op 直接给出词汇表（构造类：底面 = profile、侧面 i = 第 i 条边扫掠）\n *\n * ⚠️ **不能靠内核的 `generated` 桶**（Phase 0.4 实测）：它与 `modified` 同构分段、\n * 键集相同，值是各输入面派生的**中间形**——`cut` 里 12 个 hash 结果里 0 存活，\n * `fillet`/`fuse` 里整桶为空。故 `byAdjacency` / `explicit` 是**必填**。\n */\nexport type NewFaceRule =\n  | { readonly via: 'byAdjacency' }\n  | { readonly via: 'explicit'; readonly vocab: readonly RoleName[] }\n\n/**\n * 六个 provenance 类别（计划 §4.4，封闭集）。\n *\n * **继承面的处置完全由类别决定，op 不写**；只有 `construct` 和 `kernel` 会造新面，\n * 才有词汇这一项 ⇒ `identity` / `subdivide` / `replicate(k)` **零声明**。\n *\n * 本表是**类别归属**，不是接线状态（例：`sweep` 属 `construct` 类但未接线，见 §1 D10）。\n */\nexport type Provenance =\n  /** 内核给历史：boolean / fillet / chamfer / shell / offset / 刚体变换 */\n  | { readonly kind: 'kernel'; readonly newFaces: NewFaceRule }\n  /** 输出面 ↔ 输入的构造规则：extrude / revolve / sweep / loft / primitives / sketch / import_brep */\n  | { readonly kind: 'construct'; readonly newFaces: Extract<NewFaceRule, { via: 'explicit' }> }\n  /** 1:1，第 i 面 → 第 i 面：copy / place / clone / locate / applyMatrix */\n  | { readonly kind: 'identity' }\n  /** 每输入面 → 若干片：split / section */\n  | { readonly kind: 'subdivide' }\n  /** 第 k 份第 i 面 ← 第 i 面：linearPattern / circularPattern / gridPattern / rectangularPattern / mirrorJoin */\n  | { readonly kind: 'replicate'; readonly k: number }\n  /** 显式记账：算不出来。应趋近于 0；审计测试必须列出全部并给出理由 */\n  | { readonly kind: 'unmodeled'; readonly reason: string }\n\n/** `Provenance` 的类别标签（封闭六值）。 */\nexport type ProvenanceKind = Provenance['kind']\n\n/** 六个类别标签，供审计测试枚举（新增类别必须同步此处）。 */\nexport const PROVENANCE_KINDS = [\n  'kernel',\n  'construct',\n  'identity',\n  'subdivide',\n  'replicate',\n  'unmodeled',\n] as const\n\n/**\n * 演化记录（`kind='kernel'` 时执行期补挂）。\n *\n * 两种形态并存（1.10 前置①实测）：\n * - **序号键**（`slot.faceEvolution` 的实际存储形态，`Map<ordinal, ordinal[]>`）：\n *   boolean/fillet/chamfer 走 `decodeEvolution`（逐句柄 hashCode），copy/transform/place\n *   走 `identityEvolution`（恒等）。回走推进 identity 类与\"序号不变\"的 kernel 路径用它。\n * - **哈希键**（`HashEvolution`，`decodeHashEvolution` 的输出）：只在 booleanWithRoleTable\n *   等组合函数内部瞬时存在，不落 slot。回走按哈希集合推进时用它。\n */\nexport type EvolutionRecord = Map<number, number[]> | HashEvolution\n\n/**\n * 判断演化记录是否为哈希键形态（`HashEvolution` 有 `modified`/`deleted` 字段）。\n *\n * @param e - the evolution record to test.\n * @returns true when the record is the hash-key form (`HashEvolution`).\n */\nexport function isHashEvolution(e: EvolutionRecord): e is HashEvolution {\n  return 'modified' in e && 'deleted' in e\n}\n\n/**\n * 血缘图的一个节点 = 一条语句的登记记录。\n *\n * `inputs`/`outputs` 是 `PartName`（不是 Shape）：Shape 是执行期的活对象，\n * 身份层必须只留**可序列化、可比较**的东西，否则节点会随 arena 释放而失去意义。\n */\nexport interface LineageNode {\n  /** 该语句的 id（`ExecutionAnchor.id`），全局唯一。 */\n  readonly stmt: StmtId\n  /** op 名（如 `cad.fillet`）——用于报错信息与审计。 */\n  readonly op: string\n  /** 输入 part 名（`inputs.map(nameOf)` 的结果，已保证全部有名字）。 */\n  readonly inputs: readonly PartName[]\n  /** 产出 part 名（至少一个）。 */\n  readonly outputs: readonly PartName[]\n  /** provenance 类别 + 该类别的载荷。 */\n  readonly provenance: Provenance\n  /** `kind='kernel'` 时执行期记录的 hash 演化（`attachEvolution` 事后补上）。 */\n  readonly evolution?: EvolutionRecord\n}\n\n/**\n * 登记入参（尚未解析成 `PartName` 的形态）。\n *\n * `inputs` 故意收 **Shape 句柄**而不是 `PartName`：N1 的判据就是\n * \"这个 Shape 有没有名字\"，若调用方先自己 map 成名字，就正好把\n * \"查不到名字\"这一步跳过/默认了——那正是 N1 要防的。\n */\nexport interface LineageDraft {\n  /** 声明本条语句的 id（N2 会与当前锚点核对）。 */\n  readonly stmt: StmtId\n  /** op 名。 */\n  readonly op: string\n  /** 输入 Shape 句柄（N1 在 register 内解析）。 */\n  readonly inputs: readonly object[]\n  /** 产出 part 名（非空；调用方从锚点/nameOf 拿到）。 */\n  readonly outputs: readonly [PartName, ...PartName[]]\n  /** provenance 类别 + 载荷。 */\n  readonly provenance: Provenance\n}\n\n/** 登记所需的外部读口（由调用点注入，见文件头「依赖注入」）。 */\nexport interface LineageDeps {\n  /** Shape → PartName（`runtime-state` 的 `nameOf`）。 */\n  readonly nameOf: (shape: object) => PartName | undefined\n  /** 当前执行语句锚点（`runtime-state` 的 `getCurrentStmt`）。 */\n  readonly currentStmt: () => { readonly id: string } | undefined\n}\n\n// ── 错误 ──\n\n/** 血缘登记错误码（三条规则 N1/N2/N3）。 */\nexport type LineageErrorCode = 'E_TOPO_UNTRACKED_INPUT' | 'E_TOPO_NO_ANCHOR' | 'E_TOPO_DUPLICATE_STMT'\n\n/** 血缘登记失败。带稳定错误码，禁止静默兜底。 */\nexport class LineageError extends Error {\n  /** 稳定错误码（宿主/args 校验按码识别）。 */\n  readonly code: LineageErrorCode\n  /** 出错的语句 id（若能确定）。 */\n  readonly stmt?: string\n\n  /**\n   * @param code - the stable error code.\n   * @param message - what went wrong, with the offending statement named.\n   * @param stmt - the statement id, when known.\n   */\n  constructor(code: LineageErrorCode, message: string, stmt?: string) {\n    super(message)\n    this.name = 'LineageError'\n    this.code = code\n    this.stmt = stmt\n  }\n}\n\n// ── 结构化比较（不引 node:util——topology/ 要能进浏览器构建）──\n\n/**\n * 两个 `RoleName` 是否相等（按值、递归）。\n *\n * 手写而不是 `JSON.stringify` 比较：键序会随写字面量的顺序变化\n * （`{index, op}` 与 `{op, index}` 是同一个值、不同的 JSON），\n * 而这两个函数是 N3「内容不同才报错」的判据——键序敏感会**误报冲突**。\n *\n * @param a - one role name.\n * @param b - the other role name.\n * @returns true when the two roles are structurally identical.\n */\nexport function roleNameEquals(a: RoleName, b: RoleName): boolean {\n  switch (a.kind) {\n    case 'semantic':\n      return b.kind === 'semantic' && a.name === b.name\n    case 'wall':\n      return b.kind === 'wall' && a.index === b.index\n    case 'imported':\n      return b.kind === 'imported' && a.index === b.index\n    case 'generated':\n      return b.kind === 'generated' && a.op === b.op && a.index === b.index\n    case 'hole':\n      return b.kind === 'hole' && a.index === b.index && roleNameEquals(a.inner, b.inner)\n    case 'replica':\n      return b.kind === 'replica' && a.k === b.k && roleNameEquals(a.inner, b.inner)\n    case 'splinter':\n      return b.kind === 'splinter' && a.index === b.index && roleNameEquals(a.inner, b.inner)\n  }\n}\n\n/**\n * 两条新造面规则是否相等（词汇表**逐项按序**比较——顺序是构造语义的一部分：\n * 侧面 i 对应第 i 条 profile 边，重排就是换了一个 role）。\n *\n * @param a - one rule.\n * @param b - the other rule.\n * @returns true when the two rules are structurally identical.\n */\nexport function newFaceRuleEquals(a: NewFaceRule, b: NewFaceRule): boolean {\n  if (a.via === 'byAdjacency') return b.via === 'byAdjacency'\n  if (b.via !== 'explicit') return false\n  if (a.vocab.length !== b.vocab.length) return false\n  for (let i = 0; i < a.vocab.length; i++) {\n    if (!roleNameEquals(a.vocab[i], b.vocab[i])) return false\n  }\n  return true\n}\n\n/**\n * 两个 `Provenance` 是否相等（按值）。\n *\n * @param a - one provenance.\n * @param b - the other provenance.\n * @returns true when they are structurally identical.\n */\nexport function provenanceEquals(a: Provenance, b: Provenance): boolean {\n  switch (a.kind) {\n    case 'identity':\n      return b.kind === 'identity'\n    case 'subdivide':\n      return b.kind === 'subdivide'\n    case 'replicate':\n      return b.kind === 'replicate' && a.k === b.k\n    case 'unmodeled':\n      return b.kind === 'unmodeled' && a.reason === b.reason\n    case 'kernel':\n      return b.kind === 'kernel' && newFaceRuleEquals(a.newFaces, b.newFaces)\n    case 'construct':\n      return b.kind === 'construct' && newFaceRuleEquals(a.newFaces, b.newFaces)\n  }\n}\n\n/** 两个字符串数组是否逐项相等。 */\nfunction sameNames(a: readonly PartName[], b: readonly PartName[]): boolean {\n  return a.length === b.length && a.every((x, i) => x === b[i])\n}\n\n// ── 血缘图 ──\n\n/**\n * 血缘图：两张表 + 一个登记函数。\n *\n * 实例化而非全局单例，是为了让 N1/N2/N3 的测试各用各的图、互不污染；\n * 执行期由 `runtime-state` 侧持有唯一实例（C1 保证单 runtime，不存在两图并存）。\n */\nexport class LineageGraph {\n  private readonly nodes = new Map<StmtId, LineageNode>()\n  private readonly partOwner = new Map<PartName, StmtId>()\n  /**\n   * 执行期旁挂：语句输出 part 的 roleTable（1.10 前置③）。\n   *\n   * 回走锚定需要 root 语句的「origin→role→hash[]」表；它本来只存在\n   * `slot.roleTable`（解析缓存）里，删字段后唯一落点就是这里。\n   * 不进 `LineageNode`（节点是身份数据，N3 比较不含它）。\n   */\n  private readonly outputTables = new Map<StmtId, ReadonlyMap<string, ReadonlyMap<string, readonly number[]>>>()\n  /**\n   * 执行期旁挂：语句输出 part 的 BREP 句柄（回走锚定/落地做 ordinal↔hash 换算用）。\n   * 句柄是活对象不进节点；随 `clear()` 一起清（句柄生命周期由 solidCache 管）。\n   */\n  private readonly outputHandles = new Map<StmtId, unknown>()\n  /**\n   * 执行期旁挂：**part 名键**的 roleTable（1.10 前置③，op 读输入表用）。\n   *\n   * 为什么有语句键还要 part 键：op 实现读的是「输入 part 的表」。按语句反查\n   * （stmtOf(part)）在重赋值下会指到**本语句**——register 先于 impl 执行，\n   * `part0 = translate(part0)` 的 partOwner 已被 s2 覆盖，impl 读输入表时\n   * 拿到的是自己的输出。part 键表只在 `recordOutput`（impl 内 fromBrep 时）\n   * 才覆盖 ⇒ impl 读表时看到的仍是上一条语句记录的旧表——时序天然正确。\n   */\n  private readonly outputTablesByPart = new Map<PartName, ReadonlyMap<string, ReadonlyMap<string, readonly number[]>>>()\n\n  /**\n   * 登记一条语句（N1/N2/N3 全在这里校验）。\n   *\n   * @param draft - the statement's lineage facts (inputs still as Shape handles).\n   * @param deps - the injected readers (`nameOf` / `currentStmt`).\n   * @returns the stored node.\n   * @throws LineageError on N1 (untracked input), N2 (anchor mismatch), or N3 (conflicting re-register).\n   */\n  register(draft: LineageDraft, deps: LineageDeps): LineageNode {\n    const stmt = draft.stmt\n\n    // N2：当前锚点必须是本条语句，否则说明\"我拿到的 stmt 不是正在跑的那条\"。\n    const anchor = deps.currentStmt()\n    if (!anchor) {\n      throw new LineageError(\n        'E_TOPO_NO_ANCHOR',\n        `${draft.op} 登记血缘时无当前语句锚点（getCurrentStmt() 为空）`,\n        stmt,\n      )\n    }\n    if (anchor.id !== stmt) {\n      throw new LineageError(\n        'E_TOPO_NO_ANCHOR',\n        `${draft.op} 声明的语句 ${stmt} 与当前锚点 ${anchor.id} 不符`,\n        stmt,\n      )\n    }\n\n    // N1：输入 Shape 必须都有 PartName——**不许默认成链根**。\n    const inputs: PartName[] = []\n    for (let i = 0; i < draft.inputs.length; i++) {\n      const name = deps.nameOf(draft.inputs[i])\n      if (name === undefined) {\n        throw new LineageError(\n          'E_TOPO_UNTRACKED_INPUT',\n          `${draft.op} 的第 ${i} 个输入 Shape 没有 PartName（op 内部临时造的件？）。` +\n            `不允许默认成链根——那会产生\"能解析但解析错面\"的假身份。`,\n          stmt,\n        )\n      }\n      inputs.push(name)\n    }\n\n    const node: LineageNode = {\n      stmt,\n      op: draft.op,\n      inputs,\n      outputs: [...draft.outputs],\n      provenance: draft.provenance,\n    }\n\n    // N3：同一语句重复登记，若**身份内容**不同即为冲突。\n    // 注意比较范围刻意**不含 evolution**：它在执行期事后补（`attachEvolution`），\n    // 若纳入比较，第二次登记会因\"上次还没补 evolution\"而误报冲突。\n    const existing = this.nodes.get(stmt)\n    if (existing && !sameIdentity(existing, node)) {\n      throw new LineageError(\n        'E_TOPO_DUPLICATE_STMT',\n        `${stmt} 被重复登记且内容不同：` +\n          `已登记 ${existing.op}(${existing.inputs.join(',')} → ${existing.outputs.join(',')}, ${existing.provenance.kind})，` +\n          `本次为 ${node.op}(${node.inputs.join(',')} → ${node.outputs.join(',')}, ${node.provenance.kind})`,\n        stmt,\n      )\n    }\n\n    // PartName → StmtId：反查索引（名字 → 语句）。**最后写者胜**。\n    //\n    // 重赋值（`part0 = cad.translate(part0, …)`）是 faijs 的合法惯用法：后一条语句\n    // 重新绑定同名 PartName，旧绑定随之失效。身份载体是 `(StmtId, RoleName)`，\n    // PartName 只是反查索引，故覆盖更新即可——不报错。\n    //\n    // ⚠️ 曾经这里有一条 `E_TOPO_PART_REDEFINED` 守卫（把\"两名同出\"一律判为\n    // \"反查歧义\"）。§1.4/1.5 接线后它当场误杀了重赋值（8 例回退，见\n    // `api/dual-form-contract.test.ts`），已废除：线性程序里\"两名同出\"就是重赋值，\n    // 是合法的；而当两条语句真的同时存活并引用时，\"当前绑定\"语义本就该取最新。\n\n    // ⚠️ 幂等重登记必须**保留已补挂的 evolution**：既然 N3 刻意不比较它，\n    // 那它就不是\"本次登记的输入\"，重登记时用不带 evolution 的新对象覆盖\n    // 等于把先前记录的 hash 演化**静默丢掉**——而丢掉的正是 kernel 类推进 role\n    // 所需的全部信息（重新算一遍几何也补不回来，因为演化只在执行那一刻可得）。\n    this.nodes.set(stmt, existing?.evolution ? { ...node, evolution: existing.evolution } : node)\n    for (const out of node.outputs) this.partOwner.set(out, stmt)\n    return this.nodes.get(stmt)!\n  }\n\n  /**\n   * 事后补挂 hash 演化（`kind='kernel'` 用）。\n   *\n   * 与 `register` 分开是因为演化记录发生在几何算完之后，而登记发生在调用边界；\n   * 合成一个操作会让 N3 的\"内容比较\"必须处理\"evolution 可能晚到\"的时序问题。\n   *\n   * @param stmt - the statement whose evolution to attach.\n   * @param evolution - the hash evolution produced by this statement.\n   * @throws LineageError when the statement was never registered.\n   */\n  attachEvolution(stmt: StmtId, evolution: EvolutionRecord): void {\n    const node = this.nodes.get(stmt)\n    if (!node) {\n      throw new LineageError(\n        'E_TOPO_NO_ANCHOR',\n        `为未登记的语句 ${stmt} 挂 hash 演化——必须先 register`,\n        stmt,\n      )\n    }\n    this.nodes.set(stmt, { ...node, evolution })\n  }\n\n  /**\n   * 按语句 id 取节点。\n   *\n   * @param stmt - the statement id to look up.\n   * @returns the statement's LineageNode, or undefined when not registered.\n   */\n  node(stmt: StmtId): LineageNode | undefined {\n    return this.nodes.get(stmt)\n  }\n\n  /**\n   * 按 part 名反查产出它的语句 id。\n   *\n   * @param part - the part name to look up.\n   * @returns the producing statement id, or undefined when unowned.\n   */\n  stmtOf(part: PartName): StmtId | undefined {\n    return this.partOwner.get(part)\n  }\n\n  /**\n   * 按 part 名反查产出它的节点。\n   *\n   * @param part - the part name to look up.\n   * @returns the producing node, or undefined when unowned.\n   */\n  nodeOfPart(part: PartName): LineageNode | undefined {\n    const stmt = this.partOwner.get(part)\n    return stmt === undefined ? undefined : this.nodes.get(stmt)\n  }\n\n  /**\n   * 找把 `part` 作为输入的下游节点（回走推进用，1.10 前置②）。\n   *\n   * 链行走的方向是「origin → 消费者 → 消费者的消费者」：中间 part 的产出方\n   * 是 origin 自己（`stmtOf` 指回原点），不能用产出方找下一步。\n   *\n   * @param part - the part name consumed by the wanted node.\n   * @returns the first (registration-order) node whose inputs contain the part.\n   */\n  nodeConsuming(part: PartName): LineageNode | undefined {\n    for (const node of this.nodes.values()) {\n      if (node.inputs.includes(part)) return node\n    }\n    return undefined\n  }\n\n  /** 已登记的语句数。 */\n  get size(): number {\n    return this.nodes.size\n  }\n\n  /** 清空（每次执行开始时调用——一次执行内 `StmtId` 稳定）。 */\n  clear(): void {\n    this.nodes.clear()\n    this.partOwner.clear()\n    this.outputTables.clear()\n    this.outputHandles.clear()\n    this.outputTablesByPart.clear()\n  }\n\n  /**\n   * 记录语句输出 part 的 roleTable 与句柄（1.10 前置③，执行期旁挂）。\n   *\n   * 调用点：`define-op.wrapped` 的 brep 分支——登记血缘时（或补挂演化时）\n   * 顺手记录，读口是 `getSlot(outShape)`。表/句柄都可选（构造类 op 可能两者皆无）。\n   *\n   * @param stmt - the statement whose output is recorded.\n   * @param roleTable - the output part's role table (origin→role→hash[]), if any.\n   * @param solid - the output part's BREP handle, if any.\n   * @param part - the output part name to also key the table under (part-key authority), if any.\n   */\n  recordOutput(stmt: StmtId, roleTable?: ReadonlyMap<string, ReadonlyMap<string, readonly number[]>>, solid?: unknown, part?: PartName): void {\n    if (roleTable) this.outputTables.set(stmt, roleTable)\n    if (solid !== undefined) this.outputHandles.set(stmt, solid)\n    if (roleTable && part !== undefined) this.outputTablesByPart.set(part, roleTable)\n  }\n\n  /** 读语句输出 part 的 roleTable（回走锚定用）。\n   *\n   * @param stmt - the statement whose output table to read.\n   * @returns the statement-keyed role table, or undefined when none was recorded.\n   */\n  outputTableOf(stmt: StmtId): ReadonlyMap<string, ReadonlyMap<string, readonly number[]>> | undefined {\n    return this.outputTables.get(stmt)\n  }\n\n  /** 读语句输出 part 的 BREP 句柄（回走 ordinal↔hash 换算用）。\n   *\n   * @param stmt - the statement whose output handle to read.\n   * @returns the statement-keyed BREP handle, or undefined when none was recorded.\n   */\n  outputHandleOf(stmt: StmtId): unknown | undefined {\n    return this.outputHandles.get(stmt)\n  }\n\n  /**\n   * 读 part 名键的 roleTable（op 实现读**输入**表用，1.10 前置③）。\n   *\n   * 语义 = 旧 `getSlot(input)?.roleTable`：impl 执行时刻，该 part 的表是\n   * 上一条语句 `recordOutput` 记录的那份（本语句的覆盖发生在 impl 内\n   * fromBrep 时，晚于任何输入读）。未记录（mesh 产物 / 未接血缘）→ undefined。\n   *\n   * @param part - the output part name whose role table to read.\n   * @returns the part-keyed role table, or undefined when not recorded.\n   */\n  tableOfPart(part: PartName): ReadonlyMap<string, ReadonlyMap<string, readonly number[]>> | undefined {\n    return this.outputTablesByPart.get(part)\n  }\n}\n\n/**\n * 判断两节点是否\"身份内容\"相同（N3 用；刻意不含 `evolution`）。\n *\n * @param a - the stored node.\n * @param b - the incoming node.\n * @returns true when op / inputs / outputs / provenance all match.\n */\nfunction sameIdentity(a: LineageNode, b: LineageNode): boolean {\n  return (\n    a.op === b.op &&\n    sameNames(a.inputs, b.inputs) &&\n    sameNames(a.outputs, b.outputs) &&\n    provenanceEquals(a.provenance, b.provenance)\n  )\n}\n\n/**\n * 执行期共用的血缘图实例。\n *\n * 唯一性由约束 C1（禁止并发多 runtime）保证；测试请自建 `new LineageGraph()`。\n */\nexport const runtimeLineage = new LineageGraph()\n"]}
+{"version":3,"file":"lineage.js","sourceRoot":"","sources":["../../../src/topology/naming/lineage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6CG;AAgDH,kCAAkC;AAClC,MAAM,CAAC,MAAM,gBAAgB,GAAG;IAC9B,QAAQ;IACR,WAAW;IACX,UAAU;IACV,WAAW;IACX,WAAW;IACX,WAAW;CACH,CAAA;AAcV;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,CAAkB;IAChD,OAAO,UAAU,IAAI,CAAC,IAAI,SAAS,IAAI,CAAC,CAAA;AAC1C,CAAC;AAwDD,4BAA4B;AAC5B,MAAM,OAAO,YAAa,SAAQ,KAAK;IACrC,6BAA6B;IACpB,IAAI,CAAkB;IAC/B,sBAAsB;IACb,IAAI,CAAS;IAEtB;;;;OAIG;IACH,YAAY,IAAsB,EAAE,OAAe,EAAE,IAAa;QAChE,KAAK,CAAC,OAAO,CAAC,CAAA;QACd,IAAI,CAAC,IAAI,GAAG,cAAc,CAAA;QAC1B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;IAClB,CAAC;CACF;AAED,+CAA+C;AAE/C;;;;;;;;;;GAUG;AACH,MAAM,UAAU,cAAc,CAAC,CAAW,EAAE,CAAW;IACrD,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,UAAU;YACb,OAAO,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAA;QACnD,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,CAAA;QACjD,KAAK,UAAU;YACb,OAAO,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,CAAA;QACrD,KAAK,WAAW;YACd,OAAO,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,CAAA;QACvE,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,IAAI,cAAc,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAA;QACrF,KAAK,SAAS;YACZ,OAAO,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,cAAc,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAA;QAChF,KAAK,UAAU;YACb,OAAO,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,IAAI,cAAc,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAA;IAC3F,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAc,EAAE,CAAc;IAC9D,IAAI,CAAC,CAAC,GAAG,KAAK,aAAa;QAAE,OAAO,CAAC,CAAC,GAAG,KAAK,aAAa,CAAA;IAC3D,IAAI,CAAC,CAAC,GAAG,KAAK,UAAU;QAAE,OAAO,KAAK,CAAA;IACtC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM;QAAE,OAAO,KAAK,CAAA;IACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;IAC3D,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAa,EAAE,CAAa;IAC3D,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,UAAU;YACb,OAAO,CAAC,CAAC,IAAI,KAAK,UAAU,CAAA;QAC9B,KAAK,WAAW;YACd,OAAO,CAAC,CAAC,IAAI,KAAK,WAAW,CAAA;QAC/B,KAAK,WAAW;YACd,OAAO,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;QAC9C,KAAK,WAAW;YACd,OAAO,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAA;QACxD,KAAK,QAAQ;YACX,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,iBAAiB,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAA;QACzE,KAAK,WAAW;YACd,OAAO,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,iBAAiB,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAA;IAC9E,CAAC;AACH,CAAC;AAED,qBAAqB;AACrB,SAAS,SAAS,CAAC,CAAsB,EAAE,CAAsB;IAC/D,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAC/D,CAAC;AAED,YAAY;AAEZ;;;;;GAKG;AACH,MAAM,OAAO,YAAY;IACN,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAA;IACtC,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAA;IACxD;;;;;;OAMG;IACc,YAAY,GAAG,IAAI,GAAG,EAAuE,CAAA;IAC9G;;;OAGG;IACc,aAAa,GAAG,IAAI,GAAG,EAAmB,CAAA;IAC3D;;;;;;;;OAQG;IACc,kBAAkB,GAAG,IAAI,GAAG,EAAyE,CAAA;IAEtH;;;;;;;OAOG;IACH,QAAQ,CAAC,KAAmB,EAAE,IAAiB;QAC7C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAA;QAEvB,2CAA2C;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAA;QACjC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,YAAY,CACpB,kBAAkB,EAClB,GAAG,KAAK,CAAC,EAAE,oCAAoC,EAC/C,IAAI,CACL,CAAA;QACH,CAAC;QACD,IAAI,MAAM,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC;YACvB,MAAM,IAAI,YAAY,CACpB,kBAAkB,EAClB,GAAG,KAAK,CAAC,EAAE,UAAU,IAAI,UAAU,MAAM,CAAC,EAAE,KAAK,EACjD,IAAI,CACL,CAAA;QACH,CAAC;QAED,0CAA0C;QAC1C,MAAM,MAAM,GAAe,EAAE,CAAA;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;YACzC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,MAAM,IAAI,YAAY,CACpB,wBAAwB,EACxB,GAAG,KAAK,CAAC,EAAE,OAAO,CAAC,sCAAsC;oBACvD,+BAA+B,EACjC,IAAI,CACL,CAAA;YACH,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACnB,CAAC;QAED,MAAM,IAAI,GAAgB;YACxB,IAAI;YACJ,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,MAAM;YACN,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;YAC3B,UAAU,EAAE,KAAK,CAAC,UAAU;SAC7B,CAAA;QAED,+BAA+B;QAC/B,wDAAwD;QACxD,uCAAuC;QACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACrC,IAAI,QAAQ,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;YAC9C,MAAM,IAAI,YAAY,CACpB,uBAAuB,EACvB,GAAG,IAAI,cAAc;gBACnB,OAAO,QAAQ,CAAC,EAAE,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,QAAQ,CAAC,UAAU,CAAC,IAAI,IAAI;gBAChH,OAAO,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,UAAU,CAAC,IAAI,GAAG,EACjG,IAAI,CACL,CAAA;QACH,CAAC;QAED,6CAA6C;QAC7C,EAAE;QACF,6DAA6D;QAC7D,sDAAsD;QACtD,gCAAgC;QAChC,EAAE;QACF,oDAAoD;QACpD,wCAAwC;QACxC,0DAA0D;QAC1D,wCAAwC;QAExC,+CAA+C;QAC/C,0CAA0C;QAC1C,mDAAmD;QACnD,uCAAuC;QACvC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAC7F,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO;YAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QAC7D,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAE,CAAA;IAC9B,CAAC;IAED;;;;;;;;;OASG;IACH,eAAe,CAAC,IAAY,EAAE,SAA0B;QACtD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACjC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,YAAY,CACpB,kBAAkB,EAClB,WAAW,IAAI,0BAA0B,EACzC,IAAI,CACL,CAAA;QACH,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC,CAAA;IAC9C,CAAC;IAED;;;;;OAKG;IACH,IAAI,CAAC,IAAY;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC7B,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,IAAc;QACnB,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACjC,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,IAAc;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACrC,OAAO,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC9D,CAAC;IAED;;;;;;;;OAQG;IACH,aAAa,CAAC,IAAc;QAC1B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAA;QAC7C,CAAC;QACD,OAAO,SAAS,CAAA;IAClB,CAAC;IAED,eAAe;IACf,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAA;IACxB,CAAC;IAED;;;;OAIG;IACH,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAA;IAC/B,CAAC;IAED,wCAAwC;IACxC,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;QAClB,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAA;QACtB,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAA;QACzB,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAA;QAC1B,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAA;IACjC,CAAC;IAED;;;;;;;;;;OAUG;IACH,YAAY,CAAC,IAAY,EAAE,SAAuE,EAAE,KAAe,EAAE,IAAe;QAClI,IAAI,SAAS;YAAE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;QACrD,IAAI,KAAK,KAAK,SAAS;YAAE,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QAC5D,IAAI,SAAS,IAAI,IAAI,KAAK,SAAS;YAAE,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;IACnF,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,IAAY;QACxB,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACpC,CAAC;IAED;;;;OAIG;IACH,cAAc,CAAC,IAAY;QACzB,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACrC,CAAC;IAED;;;;;;;;;OASG;IACH,WAAW,CAAC,IAAc;QACxB,OAAO,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC1C,CAAC;CACF;AAED;;;;;;GAMG;AACH,SAAS,YAAY,CAAC,CAAc,EAAE,CAAc;IAClD,OAAO,CACL,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE;QACb,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;QAC7B,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC;QAC/B,gBAAgB,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,UAAU,CAAC,CAC7C,CAAA;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,IAAI,YAAY,EAAE,CAAA","sourcesContent":["/**\n * lineage.ts — 血缘图登记（计划 §4.3）。\n *\n * 每个 op 执行完登记一条 `LineageNode`：**谁（`StmtId`）用什么 op、吃了哪些\n * part、产出哪些 part、属哪个 provenance 类别**。两张表：\n *\n * | 表 | 键 → 值 | 用途 |\n * |---|---|---|\n * | `lineage` | `StmtId` → `LineageNode` | 从身份原点沿 DAG 前进 |\n * | `partToStmt` | `PartName` → `StmtId` | 从 part 名字反查是哪条语句造的 |\n *\n * ## 为什么这一层必须存在\n *\n * 现状把身份表达成 **hash**（`face-evolution.ts` 的内存指针哈希），于是每次查询都在\n * 付「对齐 hash」的利息：谁改了几何，谁的 hash 就变，身份就断。正确形态是\n * `(StmtId, RoleName)` 的**因果坐标**——`StmtId` 说「哪条语句产生」，`RoleName` 说\n * 「那条语句把它当作什么」。因果坐标不随几何变化，**也不需要知道中间过了几个 op**。\n *\n * ## 登记口只能有一个（但调用点有两个）\n *\n * 手写 op 走 `wrapBrepOne`（`define-op.ts`），生成投影走 `compatOp`\n * （`api/internal/compat-op.ts`）——**两条路径都必须登记**，否则 42 条投影永远无名。\n * 但两条路径共用一个 `register()`，规则才只有一处。\n *\n * ## 三条硬规则（这是「未来漏洞最少」的核心）\n *\n * | # | 规则 | 违反时 |\n * |---|---|---|\n * | **N1** | inputs 里任一 Shape 查不到 `PartName` → 报错 | `E_TOPO_UNTRACKED_INPUT` |\n * | **N2** | 当前语句锚点缺失，或与声明的 `stmt` 不符 → 报错 | `E_TOPO_NO_ANCHOR` |\n * | **N3** | 同一 `StmtId` 重复登记且**身份内容**不同 → 报错 | `E_TOPO_DUPLICATE_STMT` |\n *\n * **N1 为什么必须是错误而不是\"默认成链根\"**：op 内部常临时造 Shape（中间产物、\n * 工具件）。若给它们默认一个 origin，「看起来对但语义错」的身份就诞生了——\n * 引用能解析成功，但解析到**别的面**。这类错误不会在测试里暴露（测试用的参数恰好\n * 让两者重合），只会在用户改参数、改尺寸时暴露。**宁可在执行期就炸。**\n *\n * **N2 为什么现在才敢做**：它依赖 `getCurrentStmt()` 是\"当前语句的权威读法\"。\n * 这一点由约束 **C1（禁止并发多 runtime）** 保证（见 §4.7.1）——不是\"全局态凑合能用\"。\n *\n * ## 依赖注入，不读全局\n *\n * `register()` 收一个 `LineageDeps`（`nameOf` / `currentStmt`）而不是 import\n * `runtime-state`。理由有两条：其一，`topology/` 现有模块（如 `roles.ts`）都是\n * \"把依赖当参数\"的风格，读全局会破坏它；其二，N1/N2/N3 的测试不想去摆弄全局态。\n */\n\nimport type { PartName, StmtId } from '../../identity'\nimport type { HashEvolution } from '../../brep/face-evolution'\nimport { type RoleName } from './role-name'\n\n// ── provenance 类别（封闭，计划 §4.4）──\n\n/**\n * 新造面的获取方式（只有 `kernel` / `construct` 需要）。\n *\n * - `byAdjacency`：靠结果形状与输入的**邻接关系**推出哪个面是新造的\n *   （布尔/倒角等：新面必然与已知面相邻，而幸存面有自己的坐标）\n * - `explicit`：op 直接给出词汇表（构造类：底面 = profile、侧面 i = 第 i 条边扫掠）\n *\n * ⚠️ **不能靠内核的 `generated` 桶**（Phase 0.4 实测）：它与 `modified` 同构分段、\n * 键集相同，值是各输入面派生的**中间形**——`cut` 里 12 个 hash 结果里 0 存活，\n * `fillet`/`fuse` 里整桶为空。故 `byAdjacency` / `explicit` 是**必填**。\n */\nexport type NewFaceRule =\n  | { readonly via: 'byAdjacency' }\n  | { readonly via: 'explicit'; readonly vocab: readonly RoleName[] }\n\n/**\n * 六个 provenance 类别（计划 §4.4，封闭集）。\n *\n * **继承面的处置完全由类别决定，op 不写**；只有 `construct` 和 `kernel` 会造新面，\n * 才有词汇这一项 ⇒ `identity` / `subdivide` / `replicate(k)` **零声明**。\n *\n * 本表是**类别归属**，不是接线状态（例：`sweep` 属 `construct` 类但未接线，见 §1 D10）。\n */\nexport type Provenance =\n  /** 内核给历史：boolean / fillet / chamfer / shell / offset / 刚体变换 */\n  | { readonly kind: 'kernel'; readonly newFaces: NewFaceRule }\n  /** 输出面 ↔ 输入的构造规则：extrude / revolve / sweep / loft / primitives / sketch / import_brep */\n  | { readonly kind: 'construct'; readonly newFaces: Extract<NewFaceRule, { via: 'explicit' }> }\n  /** 1:1，第 i 面 → 第 i 面：copy / place / clone / locate / applyMatrix */\n  | { readonly kind: 'identity' }\n  /** 每输入面 → 若干片：split / section */\n  | { readonly kind: 'subdivide' }\n  /** 第 k 份第 i 面 ← 第 i 面：linearPattern / circularPattern / gridPattern / rectangularPattern / mirrorJoin */\n  | { readonly kind: 'replicate'; readonly k: number }\n  /** 显式记账：算不出来。应趋近于 0；审计测试必须列出全部并给出理由 */\n  | { readonly kind: 'unmodeled'; readonly reason: string }\n\n/** `Provenance` 的类别标签（封闭六值）。 */\nexport type ProvenanceKind = Provenance['kind']\n\n/** 六个类别标签，供审计测试枚举（新增类别必须同步此处）。 */\nexport const PROVENANCE_KINDS = [\n  'kernel',\n  'construct',\n  'identity',\n  'subdivide',\n  'replicate',\n  'unmodeled',\n] as const\n\n/**\n * 演化记录（`kind='kernel'` 时执行期补挂）。\n *\n * 两种形态并存（1.10 前置①实测）：\n * - **序号键**（`slot.faceEvolution` 的实际存储形态，`Map<ordinal, ordinal[]>`）：\n *   boolean/fillet/chamfer 走 `decodeEvolution`（逐句柄 hashCode），copy/transform/place\n *   走 `identityEvolution`（恒等）。回走推进 identity 类与\"序号不变\"的 kernel 路径用它。\n * - **哈希键**（`HashEvolution`，`decodeHashEvolution` 的输出）：只在 booleanWithRoleTable\n *   等组合函数内部瞬时存在，不落 slot。回走按哈希集合推进时用它。\n */\nexport type EvolutionRecord = Map<number, number[]> | HashEvolution\n\n/**\n * 判断演化记录是否为哈希键形态（`HashEvolution` 有 `modified`/`deleted` 字段）。\n *\n * @param e - the evolution record to test.\n * @returns true when the record is the hash-key form (`HashEvolution`).\n */\nexport function isHashEvolution(e: EvolutionRecord): e is HashEvolution {\n  return 'modified' in e && 'deleted' in e\n}\n\n/**\n * 血缘图的一个节点 = 一条语句的登记记录。\n *\n * `inputs`/`outputs` 是 `PartName`（不是 Shape）：Shape 是执行期的活对象，\n * 身份层必须只留**可序列化、可比较**的东西，否则节点会随 arena 释放而失去意义。\n */\nexport interface LineageNode {\n  /** 该语句的 id（`ExecutionAnchor.id`），全局唯一。 */\n  readonly stmt: StmtId\n  /** op 名（如 `cad.fillet`）——用于报错信息与审计。 */\n  readonly op: string\n  /** 输入 part 名（`inputs.map(nameOf)` 的结果，已保证全部有名字）。 */\n  readonly inputs: readonly PartName[]\n  /** 产出 part 名（至少一个）。 */\n  readonly outputs: readonly PartName[]\n  /** provenance 类别 + 该类别的载荷。 */\n  readonly provenance: Provenance\n  /** `kind='kernel'` 时执行期记录的 hash 演化（`attachEvolution` 事后补上）。 */\n  readonly evolution?: EvolutionRecord\n}\n\n/**\n * 登记入参（尚未解析成 `PartName` 的形态）。\n *\n * `inputs` 故意收 **Shape 句柄**而不是 `PartName`：N1 的判据就是\n * \"这个 Shape 有没有名字\"，若调用方先自己 map 成名字，就正好把\n * \"查不到名字\"这一步跳过/默认了——那正是 N1 要防的。\n */\nexport interface LineageDraft {\n  /** 声明本条语句的 id（N2 会与当前锚点核对）。 */\n  readonly stmt: StmtId\n  /** op 名。 */\n  readonly op: string\n  /** 输入 Shape 句柄（N1 在 register 内解析）。 */\n  readonly inputs: readonly object[]\n  /** 产出 part 名（非空；调用方从锚点/nameOf 拿到）。 */\n  readonly outputs: readonly [PartName, ...PartName[]]\n  /** provenance 类别 + 载荷。 */\n  readonly provenance: Provenance\n}\n\n/** 登记所需的外部读口（由调用点注入，见文件头「依赖注入」）。 */\nexport interface LineageDeps {\n  /** Shape → PartName（`runtime-state` 的 `nameOf`）。 */\n  readonly nameOf: (shape: object) => PartName | undefined\n  /** 当前执行语句锚点（`runtime-state` 的 `getCurrentStmt`）。 */\n  readonly currentStmt: () => { readonly id: string } | undefined\n}\n\n// ── 错误 ──\n\n/** 血缘登记错误码（三条规则 N1/N2/N3）。 */\nexport type LineageErrorCode = 'E_TOPO_UNTRACKED_INPUT' | 'E_TOPO_NO_ANCHOR' | 'E_TOPO_DUPLICATE_STMT'\n\n/** 血缘登记失败。带稳定错误码，禁止静默兜底。 */\nexport class LineageError extends Error {\n  /** 稳定错误码（宿主/args 校验按码识别）。 */\n  readonly code: LineageErrorCode\n  /** 出错的语句 id（若能确定）。 */\n  readonly stmt?: string\n\n  /**\n   * @param code - the stable error code.\n   * @param message - what went wrong, with the offending statement named.\n   * @param stmt - the statement id, when known.\n   */\n  constructor(code: LineageErrorCode, message: string, stmt?: string) {\n    super(message)\n    this.name = 'LineageError'\n    this.code = code\n    this.stmt = stmt\n  }\n}\n\n// ── 结构化比较（不引 node:util——topology/ 要能进浏览器构建）──\n\n/**\n * 两个 `RoleName` 是否相等（按值、递归）。\n *\n * 手写而不是 `JSON.stringify` 比较：键序会随写字面量的顺序变化\n * （`{index, op}` 与 `{op, index}` 是同一个值、不同的 JSON），\n * 而这两个函数是 N3「内容不同才报错」的判据——键序敏感会**误报冲突**。\n *\n * @param a - one role name.\n * @param b - the other role name.\n * @returns true when the two roles are structurally identical.\n */\nexport function roleNameEquals(a: RoleName, b: RoleName): boolean {\n  switch (a.kind) {\n    case 'semantic':\n      return b.kind === 'semantic' && a.name === b.name\n    case 'wall':\n      return b.kind === 'wall' && a.index === b.index\n    case 'imported':\n      return b.kind === 'imported' && a.index === b.index\n    case 'generated':\n      return b.kind === 'generated' && a.op === b.op && a.index === b.index\n    case 'hole':\n      return b.kind === 'hole' && a.index === b.index && roleNameEquals(a.inner, b.inner)\n    case 'replica':\n      return b.kind === 'replica' && a.k === b.k && roleNameEquals(a.inner, b.inner)\n    case 'splinter':\n      return b.kind === 'splinter' && a.index === b.index && roleNameEquals(a.inner, b.inner)\n  }\n}\n\n/**\n * 两条新造面规则是否相等（词汇表**逐项按序**比较——顺序是构造语义的一部分：\n * 侧面 i 对应第 i 条 profile 边，重排就是换了一个 role）。\n *\n * @param a - one rule.\n * @param b - the other rule.\n * @returns true when the two rules are structurally identical.\n */\nexport function newFaceRuleEquals(a: NewFaceRule, b: NewFaceRule): boolean {\n  if (a.via === 'byAdjacency') return b.via === 'byAdjacency'\n  if (b.via !== 'explicit') return false\n  if (a.vocab.length !== b.vocab.length) return false\n  for (let i = 0; i < a.vocab.length; i++) {\n    if (!roleNameEquals(a.vocab[i], b.vocab[i])) return false\n  }\n  return true\n}\n\n/**\n * 两个 `Provenance` 是否相等（按值）。\n *\n * @param a - one provenance.\n * @param b - the other provenance.\n * @returns true when they are structurally identical.\n */\nexport function provenanceEquals(a: Provenance, b: Provenance): boolean {\n  switch (a.kind) {\n    case 'identity':\n      return b.kind === 'identity'\n    case 'subdivide':\n      return b.kind === 'subdivide'\n    case 'replicate':\n      return b.kind === 'replicate' && a.k === b.k\n    case 'unmodeled':\n      return b.kind === 'unmodeled' && a.reason === b.reason\n    case 'kernel':\n      return b.kind === 'kernel' && newFaceRuleEquals(a.newFaces, b.newFaces)\n    case 'construct':\n      return b.kind === 'construct' && newFaceRuleEquals(a.newFaces, b.newFaces)\n  }\n}\n\n/** 两个字符串数组是否逐项相等。 */\nfunction sameNames(a: readonly PartName[], b: readonly PartName[]): boolean {\n  return a.length === b.length && a.every((x, i) => x === b[i])\n}\n\n// ── 血缘图 ──\n\n/**\n * 血缘图：两张表 + 一个登记函数。\n *\n * 实例化而非全局单例，是为了让 N1/N2/N3 的测试各用各的图、互不污染；\n * 执行期由 `runtime-state` 侧持有唯一实例（C1 保证单 runtime，不存在两图并存）。\n */\nexport class LineageGraph {\n  private readonly nodes = new Map<StmtId, LineageNode>()\n  private readonly partOwner = new Map<PartName, StmtId>()\n  /**\n   * 执行期旁挂：语句输出 part 的 roleTable（1.10 前置③）。\n   *\n   * 回走锚定需要 root 语句的「origin→role→hash[]」表；它本来只存在\n   * `slot.roleTable`（解析缓存）里，删字段后唯一落点就是这里。\n   * 不进 `LineageNode`（节点是身份数据，N3 比较不含它）。\n   */\n  private readonly outputTables = new Map<StmtId, ReadonlyMap<string, ReadonlyMap<string, readonly number[]>>>()\n  /**\n   * 执行期旁挂：语句输出 part 的 BREP 句柄（回走锚定/落地做 ordinal↔hash 换算用）。\n   * 句柄是活对象不进节点；随 `clear()` 一起清（句柄生命周期由 solidCache 管）。\n   */\n  private readonly outputHandles = new Map<StmtId, unknown>()\n  /**\n   * 执行期旁挂：**part 名键**的 roleTable（1.10 前置③，op 读输入表用）。\n   *\n   * 为什么有语句键还要 part 键：op 实现读的是「输入 part 的表」。按语句反查\n   * （stmtOf(part)）在重赋值下会指到**本语句**——register 先于 impl 执行，\n   * `part0 = translate(part0)` 的 partOwner 已被 s2 覆盖，impl 读输入表时\n   * 拿到的是自己的输出。part 键表只在 `recordOutput`（impl 内 fromBrep 时）\n   * 才覆盖 ⇒ impl 读表时看到的仍是上一条语句记录的旧表——时序天然正确。\n   */\n  private readonly outputTablesByPart = new Map<PartName, ReadonlyMap<string, ReadonlyMap<string, readonly number[]>>>()\n\n  /**\n   * 登记一条语句（N1/N2/N3 全在这里校验）。\n   *\n   * @param draft - the statement's lineage facts (inputs still as Shape handles).\n   * @param deps - the injected readers (`nameOf` / `currentStmt`).\n   * @returns the stored node.\n   * @throws LineageError on N1 (untracked input), N2 (anchor mismatch), or N3 (conflicting re-register).\n   */\n  register(draft: LineageDraft, deps: LineageDeps): LineageNode {\n    const stmt = draft.stmt\n\n    // N2：当前锚点必须是本条语句，否则说明\"我拿到的 stmt 不是正在跑的那条\"。\n    const anchor = deps.currentStmt()\n    if (!anchor) {\n      throw new LineageError(\n        'E_TOPO_NO_ANCHOR',\n        `${draft.op} 登记血缘时无当前语句锚点（getCurrentStmt() 为空）`,\n        stmt,\n      )\n    }\n    if (anchor.id !== stmt) {\n      throw new LineageError(\n        'E_TOPO_NO_ANCHOR',\n        `${draft.op} 声明的语句 ${stmt} 与当前锚点 ${anchor.id} 不符`,\n        stmt,\n      )\n    }\n\n    // N1：输入 Shape 必须都有 PartName——**不许默认成链根**。\n    const inputs: PartName[] = []\n    for (let i = 0; i < draft.inputs.length; i++) {\n      const name = deps.nameOf(draft.inputs[i])\n      if (name === undefined) {\n        throw new LineageError(\n          'E_TOPO_UNTRACKED_INPUT',\n          `${draft.op} 的第 ${i} 个输入 Shape 没有 PartName（op 内部临时造的件？）。` +\n            `不允许默认成链根——那会产生\"能解析但解析错面\"的假身份。`,\n          stmt,\n        )\n      }\n      inputs.push(name)\n    }\n\n    const node: LineageNode = {\n      stmt,\n      op: draft.op,\n      inputs,\n      outputs: [...draft.outputs],\n      provenance: draft.provenance,\n    }\n\n    // N3：同一语句重复登记，若**身份内容**不同即为冲突。\n    // 注意比较范围刻意**不含 evolution**：它在执行期事后补（`attachEvolution`），\n    // 若纳入比较，第二次登记会因\"上次还没补 evolution\"而误报冲突。\n    const existing = this.nodes.get(stmt)\n    if (existing && !sameIdentity(existing, node)) {\n      throw new LineageError(\n        'E_TOPO_DUPLICATE_STMT',\n        `${stmt} 被重复登记且内容不同：` +\n          `已登记 ${existing.op}(${existing.inputs.join(',')} → ${existing.outputs.join(',')}, ${existing.provenance.kind})，` +\n          `本次为 ${node.op}(${node.inputs.join(',')} → ${node.outputs.join(',')}, ${node.provenance.kind})`,\n        stmt,\n      )\n    }\n\n    // PartName → StmtId：反查索引（名字 → 语句）。**最后写者胜**。\n    //\n    // 重赋值（`part0 = cad.translate(part0, …)`）是 faijs 的合法惯用法：后一条语句\n    // 重新绑定同名 PartName，旧绑定随之失效。身份载体是 `(StmtId, RoleName)`，\n    // PartName 只是反查索引，故覆盖更新即可——不报错。\n    //\n    // ⚠️ 曾经这里有一条 `E_TOPO_PART_REDEFINED` 守卫（把\"两名同出\"一律判为\n    // \"反查歧义\"）。§1.4/1.5 接线后它当场误杀了重赋值（8 例回退，见\n    // `api/dual-form-contract.test.ts`），已废除：线性程序里\"两名同出\"就是重赋值，\n    // 是合法的；而当两条语句真的同时存活并引用时，\"当前绑定\"语义本就该取最新。\n\n    // ⚠️ 幂等重登记必须**保留已补挂的 evolution**：既然 N3 刻意不比较它，\n    // 那它就不是\"本次登记的输入\"，重登记时用不带 evolution 的新对象覆盖\n    // 等于把先前记录的 hash 演化**静默丢掉**——而丢掉的正是 kernel 类推进 role\n    // 所需的全部信息（重新算一遍几何也补不回来，因为演化只在执行那一刻可得）。\n    this.nodes.set(stmt, existing?.evolution ? { ...node, evolution: existing.evolution } : node)\n    for (const out of node.outputs) this.partOwner.set(out, stmt)\n    return this.nodes.get(stmt)!\n  }\n\n  /**\n   * 事后补挂 hash 演化（`kind='kernel'` 用）。\n   *\n   * 与 `register` 分开是因为演化记录发生在几何算完之后，而登记发生在调用边界；\n   * 合成一个操作会让 N3 的\"内容比较\"必须处理\"evolution 可能晚到\"的时序问题。\n   *\n   * @param stmt - the statement whose evolution to attach.\n   * @param evolution - the hash evolution produced by this statement.\n   * @throws LineageError when the statement was never registered.\n   */\n  attachEvolution(stmt: StmtId, evolution: EvolutionRecord): void {\n    const node = this.nodes.get(stmt)\n    if (!node) {\n      throw new LineageError(\n        'E_TOPO_NO_ANCHOR',\n        `为未登记的语句 ${stmt} 挂 hash 演化——必须先 register`,\n        stmt,\n      )\n    }\n    this.nodes.set(stmt, { ...node, evolution })\n  }\n\n  /**\n   * 按语句 id 取节点。\n   *\n   * @param stmt - the statement id to look up.\n   * @returns the statement's LineageNode, or undefined when not registered.\n   */\n  node(stmt: StmtId): LineageNode | undefined {\n    return this.nodes.get(stmt)\n  }\n\n  /**\n   * 按 part 名反查产出它的语句 id。\n   *\n   * @param part - the part name to look up.\n   * @returns the producing statement id, or undefined when unowned.\n   */\n  stmtOf(part: PartName): StmtId | undefined {\n    return this.partOwner.get(part)\n  }\n\n  /**\n   * 按 part 名反查产出它的节点。\n   *\n   * @param part - the part name to look up.\n   * @returns the producing node, or undefined when unowned.\n   */\n  nodeOfPart(part: PartName): LineageNode | undefined {\n    const stmt = this.partOwner.get(part)\n    return stmt === undefined ? undefined : this.nodes.get(stmt)\n  }\n\n  /**\n   * 找把 `part` 作为输入的下游节点（回走推进用，1.10 前置②）。\n   *\n   * 链行走的方向是「origin → 消费者 → 消费者的消费者」：中间 part 的产出方\n   * 是 origin 自己（`stmtOf` 指回原点），不能用产出方找下一步。\n   *\n   * @param part - the part name consumed by the wanted node.\n   * @returns the first (registration-order) node whose inputs contain the part.\n   */\n  nodeConsuming(part: PartName): LineageNode | undefined {\n    for (const node of this.nodes.values()) {\n      if (node.inputs.includes(part)) return node\n    }\n    return undefined\n  }\n\n  /** 已登记的语句数。 */\n  get size(): number {\n    return this.nodes.size\n  }\n\n  /**\n   * 全部已登记语句 id（回走恢复需遍历候选 origin 时用）。\n   *\n   * @returns the registered statement ids.\n   */\n  stmtIds(): StmtId[] {\n    return [...this.nodes.keys()]\n  }\n\n  /** 清空（每次执行开始时调用——一次执行内 `StmtId` 稳定）。 */\n  clear(): void {\n    this.nodes.clear()\n    this.partOwner.clear()\n    this.outputTables.clear()\n    this.outputHandles.clear()\n    this.outputTablesByPart.clear()\n  }\n\n  /**\n   * 记录语句输出 part 的 roleTable 与句柄（1.10 前置③，执行期旁挂）。\n   *\n   * 调用点：`define-op.wrapped` 的 brep 分支——登记血缘时（或补挂演化时）\n   * 顺手记录，读口是 `getSlot(outShape)`。表/句柄都可选（构造类 op 可能两者皆无）。\n   *\n   * @param stmt - the statement whose output is recorded.\n   * @param roleTable - the output part's role table (origin→role→hash[]), if any.\n   * @param solid - the output part's BREP handle, if any.\n   * @param part - the output part name to also key the table under (part-key authority), if any.\n   */\n  recordOutput(stmt: StmtId, roleTable?: ReadonlyMap<string, ReadonlyMap<string, readonly number[]>>, solid?: unknown, part?: PartName): void {\n    if (roleTable) this.outputTables.set(stmt, roleTable)\n    if (solid !== undefined) this.outputHandles.set(stmt, solid)\n    if (roleTable && part !== undefined) this.outputTablesByPart.set(part, roleTable)\n  }\n\n  /** 读语句输出 part 的 roleTable（回走锚定用）。\n   *\n   * @param stmt - the statement whose output table to read.\n   * @returns the statement-keyed role table, or undefined when none was recorded.\n   */\n  outputTableOf(stmt: StmtId): ReadonlyMap<string, ReadonlyMap<string, readonly number[]>> | undefined {\n    return this.outputTables.get(stmt)\n  }\n\n  /** 读语句输出 part 的 BREP 句柄（回走 ordinal↔hash 换算用）。\n   *\n   * @param stmt - the statement whose output handle to read.\n   * @returns the statement-keyed BREP handle, or undefined when none was recorded.\n   */\n  outputHandleOf(stmt: StmtId): unknown | undefined {\n    return this.outputHandles.get(stmt)\n  }\n\n  /**\n   * 读 part 名键的 roleTable（op 实现读**输入**表用，1.10 前置③）。\n   *\n   * 语义 = 旧 `getSlot(input)?.roleTable`：impl 执行时刻，该 part 的表是\n   * 上一条语句 `recordOutput` 记录的那份（本语句的覆盖发生在 impl 内\n   * fromBrep 时，晚于任何输入读）。未记录（mesh 产物 / 未接血缘）→ undefined。\n   *\n   * @param part - the output part name whose role table to read.\n   * @returns the part-keyed role table, or undefined when not recorded.\n   */\n  tableOfPart(part: PartName): ReadonlyMap<string, ReadonlyMap<string, readonly number[]>> | undefined {\n    return this.outputTablesByPart.get(part)\n  }\n}\n\n/**\n * 判断两节点是否\"身份内容\"相同（N3 用；刻意不含 `evolution`）。\n *\n * @param a - the stored node.\n * @param b - the incoming node.\n * @returns true when op / inputs / outputs / provenance all match.\n */\nfunction sameIdentity(a: LineageNode, b: LineageNode): boolean {\n  return (\n    a.op === b.op &&\n    sameNames(a.inputs, b.inputs) &&\n    sameNames(a.outputs, b.outputs) &&\n    provenanceEquals(a.provenance, b.provenance)\n  )\n}\n\n/**\n * 执行期共用的血缘图实例。\n *\n * 唯一性由约束 C1（禁止并发多 runtime）保证；测试请自建 `new LineageGraph()`。\n */\nexport const runtimeLineage = new LineageGraph()\n"]}

package/dist/topology/naming/resolve-edge.d.ts

@@ -14,7 +14,7 @@
  */
 import type { BrepHandle } from '../../brep/engine/types.js';
 import type { EdgeTopoRef, RoleQualifier, TopoResolution } from './types.js';
-import { type FaceCandidateEntry, type ResolutionContext } from './resolve-face.js';
+import { type EdgeCandidateEntry, type FaceCandidateEntry, type ResolutionContext } from './resolve-face.js';
 /**
  * 解析一个 RoleQualifier 到当前面候选（exact 优先，几何兜底）。
  *
@@ -23,6 +23,25 @@ import { type FaceCandidateEntry, type ResolutionContext } from './resolve-face.
  * @returns the face candidates for the role (possibly several after a split).
  */
 export declare function facesForQualifier(qualifier: RoleQualifier, ctx: ResolutionContext): FaceCandidateEntry[];
+/**
+ * 在候选边集合里按**纯几何** hint（length / midpoint）取最优边。
+ *
+ * 这是「没有 role 层的边身份」的唯一裁决器，两个消费点共用同一份实现：
+ * - `resolveEdgeTopo` 的多公共边裁决与 mesh 降级路径；
+ * - 网格实体（近似拓扑）的边解析——那里 `EdgeTopoRef.faces` 只是占位限定符
+ *   （网格零件没有 role，见 `mesh-primitive.test.ts` 的 Phase 1.8 契约）。
+ *
+ * 无法区分（最优点与次优点差值 < `HINT_MARGIN`）→ `undefined`，调用方按
+ * ambiguous / not-found 如实报错，**绝不**静默拿序号硬取。
+ *
+ * @param edges - the candidate edges (ordinal + optional handle/hint).
+ * @param hint - the edge hint carrying length / midpoint.
+ * @returns the best-matching candidate, or undefined when the hint cannot decide.
+ */
+export declare function matchEdgeByHint(edges: readonly EdgeCandidateEntry[], hint: EdgeTopoRef['hint']): {
+    ordinal: number;
+    handle?: BrepHandle;
+} | undefined;
 /**
  * 解析边 TopoRef 到当前快照的边序号。
  *

package/dist/topology/naming/resolve-edge.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"resolve-edge.d.ts","sourceRoot":"","sources":["../../../src/topology/naming/resolve-edge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAA;AACzD,OAAO,KAAK,EAAE,WAAW,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,SAAS,CAAA;AACzE,OAAO,EAAmB,KAAK,kBAAkB,EAAE,KAAK,iBAAiB,EAAE,MAAM,gBAAgB,CAAA;AAajG;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAC/B,SAAS,EAAE,aAAa,EACxB,GAAG,EAAE,iBAAiB,GACrB,kBAAkB,EAAE,CAgBtB;AAuBD;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,WAAW,EAChB,GAAG,EAAE,iBAAiB,GACrB,cAAc,CAAC;IAAE,MAAM,CAAC,EAAE,UAAU,CAAA;CAAE,CAAC,CAwCzC"}
+{"version":3,"file":"resolve-edge.d.ts","sourceRoot":"","sources":["../../../src/topology/naming/resolve-edge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAA;AACzD,OAAO,KAAK,EAAE,WAAW,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,SAAS,CAAA;AACzE,OAAO,EAAmB,KAAK,kBAAkB,EAAE,KAAK,kBAAkB,EAAE,KAAK,iBAAiB,EAAE,MAAM,gBAAgB,CAAA;AAa1H;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAC/B,SAAS,EAAE,aAAa,EACxB,GAAG,EAAE,iBAAiB,GACrB,kBAAkB,EAAE,CAgBtB;AAuBD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,SAAS,kBAAkB,EAAE,EACpC,IAAI,EAAE,WAAW,CAAC,MAAM,CAAC,GACxB;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,UAAU,CAAA;CAAE,GAAG,SAAS,CAiBtD;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,WAAW,EAChB,GAAG,EAAE,iBAAiB,GACrB,cAAc,CAAC;IAAE,MAAM,CAAC,EAAE,UAAU,CAAA;CAAE,CAAC,CAsDzC"}

package/dist/topology/naming/resolve-edge.js

@@ -66,6 +66,42 @@ function edgeHintScore(edge, refHint) {
     }
     return score;
 }
+/**
+ * 在候选边集合里按**纯几何** hint（length / midpoint）取最优边。
+ *
+ * 这是「没有 role 层的边身份」的唯一裁决器，两个消费点共用同一份实现：
+ * - `resolveEdgeTopo` 的多公共边裁决与 mesh 降级路径；
+ * - 网格实体（近似拓扑）的边解析——那里 `EdgeTopoRef.faces` 只是占位限定符
+ *   （网格零件没有 role，见 `mesh-primitive.test.ts` 的 Phase 1.8 契约）。
+ *
+ * 无法区分（最优点与次优点差值 < `HINT_MARGIN`）→ `undefined`，调用方按
+ * ambiguous / not-found 如实报错，**绝不**静默拿序号硬取。
+ *
+ * @param edges - the candidate edges (ordinal + optional handle/hint).
+ * @param hint - the edge hint carrying length / midpoint.
+ * @returns the best-matching candidate, or undefined when the hint cannot decide.
+ */
+export function matchEdgeByHint(edges, hint) {
+    if (hint.length === undefined && hint.midpoint === undefined)
+        return undefined;
+    let best;
+    let bestScore = Infinity;
+    let secondScore = Infinity;
+    for (const edge of edges) {
+        const score = edgeHintScore(edge, hint);
+        if (score < bestScore) {
+            secondScore = bestScore;
+            bestScore = score;
+            best = { ordinal: edge.ordinal, handle: edge.handle };
+        }
+        else if (score < secondScore) {
+            secondScore = score;
+        }
+    }
+    if (best === undefined || secondScore - bestScore < HINT_MARGIN)
+        return undefined;
+    return best;
+}
 /**
  * 解析边 TopoRef 到当前快照的边序号。
  *
@@ -78,6 +114,20 @@ export function resolveEdgeTopo(ref, ctx) {
     const facesA = facesForQualifier(qualA, ctx);
     const facesB = facesForQualifier(qualB, ctx);
     if (facesA.length === 0 || facesB.length === 0) {
+        // 无 role 层的近似拓扑（网格实体）：`faces` 是占位限定符，两个 RoleQualifier
+        // 都不可能解析到面——既没有 roleTable（网格零件不冒充 role，Phase 1.8），
+        // 限定符本身也不携带几何（类型上只有 origin/role）。边的身份只剩几何一条路：
+        // 在整个边表上按 hint 匹配并标注 geometric-fallback。
+        //
+        // 判据是 `!ctx.faceEdgeAdjacency`：BREP 上下文**总是**带 face→edge 邻接
+        // （buildEdgeResolutionContext 现场枚举），故这条分支对 BREP 零影响——
+        // BREP 侧解析不到面仍然是 not-found，不会退化成"按长度瞎猜一条边"。
+        if (!ctx.faceEdgeAdjacency && ctx.edges && ctx.edges.length > 0) {
+            const best = matchEdgeByHint(ctx.edges, ref.hint);
+            if (best !== undefined) {
+                return { ok: true, entity: { handle: best.handle }, ordinal: best.ordinal, confidence: 'geometric-fallback' };
+            }
+        }
         return { ok: false, reason: 'not-found' };
     }
     // 收集所有 (a, b) 面对的公共边
@@ -114,25 +164,9 @@ export function resolveEdgeTopo(ref, ctx) {
 }
 /** 在候选 ordinal 中按 hint 取最优边；无法区分 → undefined（ambiguous）。 */
 function bestEdgeByHint(ordinals, hint, ctx) {
-    if (hint.length === undefined && hint.midpoint === undefined)
-        return undefined;
-    let best;
-    let bestScore = Infinity;
-    let secondScore = Infinity;
-    for (const ord of ordinals) {
-        const edge = ctx.edges?.find((e) => e.ordinal === ord);
-        const score = edgeHintScore(edge ?? {}, hint);
-        if (score < bestScore) {
-            secondScore = bestScore;
-            bestScore = score;
-            best = { ordinal: ord, handle: edge?.handle };
-        }
-        else if (score < secondScore) {
-            secondScore = score;
-        }
-    }
-    if (best === undefined || secondScore - bestScore < HINT_MARGIN)
-        return undefined;
-    return best;
+    const pool = ordinals
+        .map((o) => ctx.edges?.find((e) => e.ordinal === o))
+        .filter((e) => e !== undefined);
+    return matchEdgeByHint(pool, hint);
 }
 //# sourceMappingURL=resolve-edge.js.map

package/dist/topology/naming/resolve-edge.js.map

@@ -1 +1 @@
-{"version":3,"file":"resolve-edge.js","sourceRoot":"","sources":["../../../src/topology/naming/resolve-edge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAIH,OAAO,EAAE,eAAe,EAAmD,MAAM,gBAAgB,CAAA;AAEjG,sCAAsC;AACtC,MAAM,WAAW,GAAG,IAAI,CAAA;AAExB,eAAe;AACf,SAAS,QAAQ,CAAC,CAAoB,EAAE,CAAoB;IAC1D,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;IACtB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;IACtB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;IACtB,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAA;AAC/C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC/B,SAAwB,EACxB,GAAsB;IAEtB,MAAM,YAAY,GAAG,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;IAC9E,IAAI,YAAY,KAAK,SAAS,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1D,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;QAChG,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,SAAS,CAAA;IAC5C,CAAC;IACD,kDAAkD;IAClD,MAAM,UAAU,GAAG,eAAe,CAChC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EACxF,GAAG,CACJ,CAAA;IACD,IAAI,UAAU,CAAC,EAAE,EAAE,CAAC;QAClB,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,UAAU,CAAC,OAAO,CAAC,CAAA;QACnE,IAAI,GAAG;YAAE,OAAO,CAAC,GAAG,CAAC,CAAA;IACvB,CAAC;IACD,OAAO,EAAE,CAAA;AACX,CAAC;AAED,sCAAsC;AACtC,SAAS,kBAAkB,CAAC,KAAyB,EAAE,KAAyB,EAAE,GAAsB;IACtG,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,iBAAiB,EAAE,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;IACxE,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,iBAAiB,EAAE,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;IACxE,MAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACzD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,uCAAuC;AACvC,SAAS,aAAa,CAAC,IAAkE,EAAE,OAA4B;IACrH,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,EAAE,MAAM,KAAK,SAAS,EAAE,CAAC;QACpE,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAA;IACtD,CAAC;IACD,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,EAAE,QAAQ,KAAK,SAAS,EAAE,CAAC;QACxE,KAAK,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAA;IACzD,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,GAAgB,EAChB,GAAsB;IAEtB,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,GAAG,CAAC,KAAK,CAAA;IAChC,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;IAC5C,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;IAC5C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/C,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAA;IAC3C,CAAC;IAED,qBAAqB;IACrB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAA;IAChC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,KAAK,MAAM,CAAC,IAAI,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAC9D,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAA;IAC1B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAA;QACrB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,CAAA;YACvD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,CAAA;QAC3F,CAAC;IACH,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,iBAAiB;QACjB,MAAM,IAAI,GAAG,cAAc,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAClD,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,UAAU,EAAE,oBAAoB,EAAE,CAAA;QACrI,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,EAAE,CAAA;IACtE,CAAC;IAED,wDAAwD;IACxD,IAAI,CAAC,GAAG,CAAC,iBAAiB,IAAI,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChE,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAC3E,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,UAAU,EAAE,oBAAoB,EAAE,CAAA;QACrI,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAA;IAC3C,CAAC;IAED,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAA;AAC3C,CAAC;AAED,4DAA4D;AAC5D,SAAS,cAAc,CACrB,QAA2B,EAC3B,IAAyB,EACzB,GAAsB;IAEtB,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;QAAE,OAAO,SAAS,CAAA;IAC9E,IAAI,IAA0D,CAAA;IAC9D,IAAI,SAAS,GAAG,QAAQ,CAAA;IACxB,IAAI,WAAW,GAAG,QAAQ,CAAA;IAC1B,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,GAAG,CAAC,CAAA;QACtD,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,IAAI,EAAE,EAAE,IAAI,CAAC,CAAA;QAC7C,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YACtB,WAAW,GAAG,SAAS,CAAA;YACvB,SAAS,GAAG,KAAK,CAAA;YACjB,IAAI,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAA;QAC/C,CAAC;aAAM,IAAI,KAAK,GAAG,WAAW,EAAE,CAAC;YAC/B,WAAW,GAAG,KAAK,CAAA;QACrB,CAAC;IACH,CAAC;IACD,IAAI,IAAI,KAAK,SAAS,IAAI,WAAW,GAAG,SAAS,GAAG,WAAW;QAAE,OAAO,SAAS,CAAA;IACjF,OAAO,IAAI,CAAA;AACb,CAAC","sourcesContent":["/**\n * resolve-edge.ts — 边 TopoRef 解析（移植 brepjs edgeRefFns，§4.2/§4.3）\n *\n * 边 = 两邻面之交。EdgeTopoRef.faces 是两个 RoleQualifier（带 origin，faijs 扩展：\n * 布尔合流后两面可能来自不同 origin）。\n *\n * 解析 = 两 role 解析到当前面 → 取公共边：\n * - 1 条公共边 → exact\n * - 多条（两邻面沿多边相接，如圆角面）→ hint（length/midpoint）裁决\n * - 无公共边 / role 缺失 → not-found\n *\n * mesh 无 face→edge 邻接（build-mesh-topology.ts:262，§5.3 能力边界）→\n * lineage 不可用，只能给边 hint；此时解析降级为「纯 hint 匹配」并显式标注。\n */\n\nimport type { BrepHandle } from '../../brep/engine/types'\nimport type { EdgeTopoRef, RoleQualifier, TopoResolution } from './types'\nimport { resolveFaceTopo, type FaceCandidateEntry, type ResolutionContext } from './resolve-face'\n\n/** Hint 距离比这更近视为不可区分（→ ambiguous）。 */\nconst HINT_MARGIN = 1e-6\n\n/** 两点的欧氏距离。 */\nfunction distance(a: readonly number[], b: readonly number[]): number {\n  const dx = a[0] - b[0]\n  const dy = a[1] - b[1]\n  const dz = a[2] - b[2]\n  return Math.sqrt(dx * dx + dy * dy + dz * dz)\n}\n\n/**\n * 解析一个 RoleQualifier 到当前面候选（exact 优先，几何兜底）。\n *\n * @param qualifier - the face role qualifier (origin + role).\n * @param ctx - the resolution context.\n * @returns the face candidates for the role (possibly several after a split).\n */\nexport function facesForQualifier(\n  qualifier: RoleQualifier,\n  ctx: ResolutionContext,\n): FaceCandidateEntry[] {\n  const targetHashes = ctx.roleTable?.get(qualifier.origin)?.get(qualifier.role)\n  if (targetHashes !== undefined && targetHashes.length > 0) {\n    const survivors = ctx.faces.filter((f) => f.hash !== undefined && targetHashes.includes(f.hash))\n    if (survivors.length > 0) return survivors\n  }\n  // role 缺失/未命中 → 几何兜底（只取最优面，与 resolveFaceTopo 同口径）\n  const resolution = resolveFaceTopo(\n    { kind: 'face', origin: qualifier.origin, role: qualifier.role, hint: { kind: 'face' } },\n    ctx,\n  )\n  if (resolution.ok) {\n    const hit = ctx.faces.find((f) => f.ordinal === resolution.ordinal)\n    if (hit) return [hit]\n  }\n  return []\n}\n\n/** 两面的公共边 ordinal（face→edge 邻接交集）。 */\nfunction sharedEdgeOrdinals(faceA: FaceCandidateEntry, faceB: FaceCandidateEntry, ctx: ResolutionContext): number[] {\n  const aEdges = new Set(ctx.faceEdgeAdjacency?.[faceA.ordinal - 1] ?? [])\n  const bEdges = new Set(ctx.faceEdgeAdjacency?.[faceB.ordinal - 1] ?? [])\n  const shared: number[] = []\n  for (const e of aEdges) if (bEdges.has(e)) shared.push(e)\n  return shared\n}\n\n/** 候选边 hint 与 ref hint 的距离分（越小越匹配）。 */\nfunction edgeHintScore(edge: { hint?: { length?: number; midpoint?: readonly number[] } }, refHint: EdgeTopoRef['hint']): number {\n  let score = 0\n  if (refHint.length !== undefined && edge.hint?.length !== undefined) {\n    score += Math.abs(edge.hint.length - refHint.length)\n  }\n  if (refHint.midpoint !== undefined && edge.hint?.midpoint !== undefined) {\n    score += distance(edge.hint.midpoint, refHint.midpoint)\n  }\n  return score\n}\n\n/**\n * 解析边 TopoRef 到当前快照的边序号。\n *\n * @param ref - the edge TopoRef to resolve.\n * @param ctx - the resolution context (needs faceEdgeAdjacency for lineage).\n * @returns the three-state TopoResolution with the edge ordinal.\n */\nexport function resolveEdgeTopo(\n  ref: EdgeTopoRef,\n  ctx: ResolutionContext,\n): TopoResolution<{ handle?: BrepHandle }> {\n  const [qualA, qualB] = ref.faces\n  const facesA = facesForQualifier(qualA, ctx)\n  const facesB = facesForQualifier(qualB, ctx)\n  if (facesA.length === 0 || facesB.length === 0) {\n    return { ok: false, reason: 'not-found' }\n  }\n\n  // 收集所有 (a, b) 面对的公共边\n  const shared = new Set<number>()\n  for (const a of facesA) {\n    for (const b of facesB) {\n      for (const e of sharedEdgeOrdinals(a, b, ctx)) shared.add(e)\n    }\n  }\n\n  const unique = [...shared]\n  if (unique.length === 1) {\n    const [only] = unique\n    if (only !== undefined) {\n      const edge = ctx.edges?.find((e) => e.ordinal === only)\n      return { ok: true, entity: { handle: edge?.handle }, ordinal: only, confidence: 'exact' }\n    }\n  }\n\n  if (unique.length > 1) {\n    // 多公共边 → hint 裁决\n    const best = bestEdgeByHint(unique, ref.hint, ctx)\n    if (best !== undefined) return { ok: true, entity: { handle: best.handle }, ordinal: best.ordinal, confidence: 'geometric-fallback' }\n    return { ok: false, reason: 'ambiguous', candidatesOrdinal: unique }\n  }\n\n  // 无公共边：face→edge 邻接缺失（mesh）→ 纯 hint 匹配整个边表；否则 not-found\n  if (!ctx.faceEdgeAdjacency && ctx.edges && ctx.edges.length > 0) {\n    const best = bestEdgeByHint(ctx.edges.map((e) => e.ordinal), ref.hint, ctx)\n    if (best !== undefined) return { ok: true, entity: { handle: best.handle }, ordinal: best.ordinal, confidence: 'geometric-fallback' }\n    return { ok: false, reason: 'not-found' }\n  }\n\n  return { ok: false, reason: 'not-found' }\n}\n\n/** 在候选 ordinal 中按 hint 取最优边；无法区分 → undefined（ambiguous）。 */\nfunction bestEdgeByHint(\n  ordinals: readonly number[],\n  hint: EdgeTopoRef['hint'],\n  ctx: ResolutionContext,\n): { ordinal: number; handle?: BrepHandle } | undefined {\n  if (hint.length === undefined && hint.midpoint === undefined) return undefined\n  let best: { ordinal: number; handle?: BrepHandle } | undefined\n  let bestScore = Infinity\n  let secondScore = Infinity\n  for (const ord of ordinals) {\n    const edge = ctx.edges?.find((e) => e.ordinal === ord)\n    const score = edgeHintScore(edge ?? {}, hint)\n    if (score < bestScore) {\n      secondScore = bestScore\n      bestScore = score\n      best = { ordinal: ord, handle: edge?.handle }\n    } else if (score < secondScore) {\n      secondScore = score\n    }\n  }\n  if (best === undefined || secondScore - bestScore < HINT_MARGIN) return undefined\n  return best\n}\n"]}
+{"version":3,"file":"resolve-edge.js","sourceRoot":"","sources":["../../../src/topology/naming/resolve-edge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAIH,OAAO,EAAE,eAAe,EAA4E,MAAM,gBAAgB,CAAA;AAE1H,sCAAsC;AACtC,MAAM,WAAW,GAAG,IAAI,CAAA;AAExB,eAAe;AACf,SAAS,QAAQ,CAAC,CAAoB,EAAE,CAAoB;IAC1D,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;IACtB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;IACtB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;IACtB,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAA;AAC/C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC/B,SAAwB,EACxB,GAAsB;IAEtB,MAAM,YAAY,GAAG,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;IAC9E,IAAI,YAAY,KAAK,SAAS,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1D,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;QAChG,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,SAAS,CAAA;IAC5C,CAAC;IACD,kDAAkD;IAClD,MAAM,UAAU,GAAG,eAAe,CAChC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EACxF,GAAG,CACJ,CAAA;IACD,IAAI,UAAU,CAAC,EAAE,EAAE,CAAC;QAClB,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,UAAU,CAAC,OAAO,CAAC,CAAA;QACnE,IAAI,GAAG;YAAE,OAAO,CAAC,GAAG,CAAC,CAAA;IACvB,CAAC;IACD,OAAO,EAAE,CAAA;AACX,CAAC;AAED,sCAAsC;AACtC,SAAS,kBAAkB,CAAC,KAAyB,EAAE,KAAyB,EAAE,GAAsB;IACtG,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,iBAAiB,EAAE,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;IACxE,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,iBAAiB,EAAE,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;IACxE,MAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACzD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,uCAAuC;AACvC,SAAS,aAAa,CAAC,IAAkE,EAAE,OAA4B;IACrH,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,EAAE,MAAM,KAAK,SAAS,EAAE,CAAC;QACpE,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAA;IACtD,CAAC;IACD,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,EAAE,QAAQ,KAAK,SAAS,EAAE,CAAC;QACxE,KAAK,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAA;IACzD,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAoC,EACpC,IAAyB;IAEzB,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;QAAE,OAAO,SAAS,CAAA;IAC9E,IAAI,IAA0D,CAAA;IAC9D,IAAI,SAAS,GAAG,QAAQ,CAAA;IACxB,IAAI,WAAW,GAAG,QAAQ,CAAA;IAC1B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QACvC,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YACtB,WAAW,GAAG,SAAS,CAAA;YACvB,SAAS,GAAG,KAAK,CAAA;YACjB,IAAI,GAAG,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAA;QACvD,CAAC;aAAM,IAAI,KAAK,GAAG,WAAW,EAAE,CAAC;YAC/B,WAAW,GAAG,KAAK,CAAA;QACrB,CAAC;IACH,CAAC;IACD,IAAI,IAAI,KAAK,SAAS,IAAI,WAAW,GAAG,SAAS,GAAG,WAAW;QAAE,OAAO,SAAS,CAAA;IACjF,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,GAAgB,EAChB,GAAsB;IAEtB,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,GAAG,CAAC,KAAK,CAAA;IAChC,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;IAC5C,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;IAC5C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/C,sDAAsD;QACtD,mDAAmD;QACnD,8CAA8C;QAC9C,yCAAyC;QACzC,EAAE;QACF,4DAA4D;QAC5D,sDAAsD;QACtD,4CAA4C;QAC5C,IAAI,CAAC,GAAG,CAAC,iBAAiB,IAAI,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChE,MAAM,IAAI,GAAG,eAAe,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,CAAA;YACjD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,UAAU,EAAE,oBAAoB,EAAE,CAAA;YAC/G,CAAC;QACH,CAAC;QACD,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAA;IAC3C,CAAC;IAED,qBAAqB;IACrB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAA;IAChC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,KAAK,MAAM,CAAC,IAAI,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAC9D,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAA;IAC1B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAA;QACrB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,CAAA;YACvD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,CAAA;QAC3F,CAAC;IACH,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,iBAAiB;QACjB,MAAM,IAAI,GAAG,cAAc,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAClD,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,UAAU,EAAE,oBAAoB,EAAE,CAAA;QACrI,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,EAAE,CAAA;IACtE,CAAC;IAED,wDAAwD;IACxD,IAAI,CAAC,GAAG,CAAC,iBAAiB,IAAI,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChE,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAC3E,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,UAAU,EAAE,oBAAoB,EAAE,CAAA;QACrI,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAA;IAC3C,CAAC;IAED,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAA;AAC3C,CAAC;AAED,4DAA4D;AAC5D,SAAS,cAAc,CACrB,QAA2B,EAC3B,IAAyB,EACzB,GAAsB;IAEtB,MAAM,IAAI,GAAG,QAAQ;SAClB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC;SACnD,MAAM,CAAC,CAAC,CAAC,EAA2B,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAA;IAC1D,OAAO,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AACpC,CAAC","sourcesContent":["/**\n * resolve-edge.ts — 边 TopoRef 解析（移植 brepjs edgeRefFns，§4.2/§4.3）\n *\n * 边 = 两邻面之交。EdgeTopoRef.faces 是两个 RoleQualifier（带 origin，faijs 扩展：\n * 布尔合流后两面可能来自不同 origin）。\n *\n * 解析 = 两 role 解析到当前面 → 取公共边：\n * - 1 条公共边 → exact\n * - 多条（两邻面沿多边相接，如圆角面）→ hint（length/midpoint）裁决\n * - 无公共边 / role 缺失 → not-found\n *\n * mesh 无 face→edge 邻接（build-mesh-topology.ts:262，§5.3 能力边界）→\n * lineage 不可用，只能给边 hint；此时解析降级为「纯 hint 匹配」并显式标注。\n */\n\nimport type { BrepHandle } from '../../brep/engine/types'\nimport type { EdgeTopoRef, RoleQualifier, TopoResolution } from './types'\nimport { resolveFaceTopo, type EdgeCandidateEntry, type FaceCandidateEntry, type ResolutionContext } from './resolve-face'\n\n/** Hint 距离比这更近视为不可区分（→ ambiguous）。 */\nconst HINT_MARGIN = 1e-6\n\n/** 两点的欧氏距离。 */\nfunction distance(a: readonly number[], b: readonly number[]): number {\n  const dx = a[0] - b[0]\n  const dy = a[1] - b[1]\n  const dz = a[2] - b[2]\n  return Math.sqrt(dx * dx + dy * dy + dz * dz)\n}\n\n/**\n * 解析一个 RoleQualifier 到当前面候选（exact 优先，几何兜底）。\n *\n * @param qualifier - the face role qualifier (origin + role).\n * @param ctx - the resolution context.\n * @returns the face candidates for the role (possibly several after a split).\n */\nexport function facesForQualifier(\n  qualifier: RoleQualifier,\n  ctx: ResolutionContext,\n): FaceCandidateEntry[] {\n  const targetHashes = ctx.roleTable?.get(qualifier.origin)?.get(qualifier.role)\n  if (targetHashes !== undefined && targetHashes.length > 0) {\n    const survivors = ctx.faces.filter((f) => f.hash !== undefined && targetHashes.includes(f.hash))\n    if (survivors.length > 0) return survivors\n  }\n  // role 缺失/未命中 → 几何兜底（只取最优面，与 resolveFaceTopo 同口径）\n  const resolution = resolveFaceTopo(\n    { kind: 'face', origin: qualifier.origin, role: qualifier.role, hint: { kind: 'face' } },\n    ctx,\n  )\n  if (resolution.ok) {\n    const hit = ctx.faces.find((f) => f.ordinal === resolution.ordinal)\n    if (hit) return [hit]\n  }\n  return []\n}\n\n/** 两面的公共边 ordinal（face→edge 邻接交集）。 */\nfunction sharedEdgeOrdinals(faceA: FaceCandidateEntry, faceB: FaceCandidateEntry, ctx: ResolutionContext): number[] {\n  const aEdges = new Set(ctx.faceEdgeAdjacency?.[faceA.ordinal - 1] ?? [])\n  const bEdges = new Set(ctx.faceEdgeAdjacency?.[faceB.ordinal - 1] ?? [])\n  const shared: number[] = []\n  for (const e of aEdges) if (bEdges.has(e)) shared.push(e)\n  return shared\n}\n\n/** 候选边 hint 与 ref hint 的距离分（越小越匹配）。 */\nfunction edgeHintScore(edge: { hint?: { length?: number; midpoint?: readonly number[] } }, refHint: EdgeTopoRef['hint']): number {\n  let score = 0\n  if (refHint.length !== undefined && edge.hint?.length !== undefined) {\n    score += Math.abs(edge.hint.length - refHint.length)\n  }\n  if (refHint.midpoint !== undefined && edge.hint?.midpoint !== undefined) {\n    score += distance(edge.hint.midpoint, refHint.midpoint)\n  }\n  return score\n}\n\n/**\n * 在候选边集合里按**纯几何** hint（length / midpoint）取最优边。\n *\n * 这是「没有 role 层的边身份」的唯一裁决器，两个消费点共用同一份实现：\n * - `resolveEdgeTopo` 的多公共边裁决与 mesh 降级路径；\n * - 网格实体（近似拓扑）的边解析——那里 `EdgeTopoRef.faces` 只是占位限定符\n *   （网格零件没有 role，见 `mesh-primitive.test.ts` 的 Phase 1.8 契约）。\n *\n * 无法区分（最优点与次优点差值 < `HINT_MARGIN`）→ `undefined`，调用方按\n * ambiguous / not-found 如实报错，**绝不**静默拿序号硬取。\n *\n * @param edges - the candidate edges (ordinal + optional handle/hint).\n * @param hint - the edge hint carrying length / midpoint.\n * @returns the best-matching candidate, or undefined when the hint cannot decide.\n */\nexport function matchEdgeByHint(\n  edges: readonly EdgeCandidateEntry[],\n  hint: EdgeTopoRef['hint'],\n): { ordinal: number; handle?: BrepHandle } | undefined {\n  if (hint.length === undefined && hint.midpoint === undefined) return undefined\n  let best: { ordinal: number; handle?: BrepHandle } | undefined\n  let bestScore = Infinity\n  let secondScore = Infinity\n  for (const edge of edges) {\n    const score = edgeHintScore(edge, hint)\n    if (score < bestScore) {\n      secondScore = bestScore\n      bestScore = score\n      best = { ordinal: edge.ordinal, handle: edge.handle }\n    } else if (score < secondScore) {\n      secondScore = score\n    }\n  }\n  if (best === undefined || secondScore - bestScore < HINT_MARGIN) return undefined\n  return best\n}\n\n/**\n * 解析边 TopoRef 到当前快照的边序号。\n *\n * @param ref - the edge TopoRef to resolve.\n * @param ctx - the resolution context (needs faceEdgeAdjacency for lineage).\n * @returns the three-state TopoResolution with the edge ordinal.\n */\nexport function resolveEdgeTopo(\n  ref: EdgeTopoRef,\n  ctx: ResolutionContext,\n): TopoResolution<{ handle?: BrepHandle }> {\n  const [qualA, qualB] = ref.faces\n  const facesA = facesForQualifier(qualA, ctx)\n  const facesB = facesForQualifier(qualB, ctx)\n  if (facesA.length === 0 || facesB.length === 0) {\n    // 无 role 层的近似拓扑（网格实体）：`faces` 是占位限定符，两个 RoleQualifier\n    // 都不可能解析到面——既没有 roleTable（网格零件不冒充 role，Phase 1.8），\n    // 限定符本身也不携带几何（类型上只有 origin/role）。边的身份只剩几何一条路：\n    // 在整个边表上按 hint 匹配并标注 geometric-fallback。\n    //\n    // 判据是 `!ctx.faceEdgeAdjacency`：BREP 上下文**总是**带 face→edge 邻接\n    // （buildEdgeResolutionContext 现场枚举），故这条分支对 BREP 零影响——\n    // BREP 侧解析不到面仍然是 not-found，不会退化成\"按长度瞎猜一条边\"。\n    if (!ctx.faceEdgeAdjacency && ctx.edges && ctx.edges.length > 0) {\n      const best = matchEdgeByHint(ctx.edges, ref.hint)\n      if (best !== undefined) {\n        return { ok: true, entity: { handle: best.handle }, ordinal: best.ordinal, confidence: 'geometric-fallback' }\n      }\n    }\n    return { ok: false, reason: 'not-found' }\n  }\n\n  // 收集所有 (a, b) 面对的公共边\n  const shared = new Set<number>()\n  for (const a of facesA) {\n    for (const b of facesB) {\n      for (const e of sharedEdgeOrdinals(a, b, ctx)) shared.add(e)\n    }\n  }\n\n  const unique = [...shared]\n  if (unique.length === 1) {\n    const [only] = unique\n    if (only !== undefined) {\n      const edge = ctx.edges?.find((e) => e.ordinal === only)\n      return { ok: true, entity: { handle: edge?.handle }, ordinal: only, confidence: 'exact' }\n    }\n  }\n\n  if (unique.length > 1) {\n    // 多公共边 → hint 裁决\n    const best = bestEdgeByHint(unique, ref.hint, ctx)\n    if (best !== undefined) return { ok: true, entity: { handle: best.handle }, ordinal: best.ordinal, confidence: 'geometric-fallback' }\n    return { ok: false, reason: 'ambiguous', candidatesOrdinal: unique }\n  }\n\n  // 无公共边：face→edge 邻接缺失（mesh）→ 纯 hint 匹配整个边表；否则 not-found\n  if (!ctx.faceEdgeAdjacency && ctx.edges && ctx.edges.length > 0) {\n    const best = bestEdgeByHint(ctx.edges.map((e) => e.ordinal), ref.hint, ctx)\n    if (best !== undefined) return { ok: true, entity: { handle: best.handle }, ordinal: best.ordinal, confidence: 'geometric-fallback' }\n    return { ok: false, reason: 'not-found' }\n  }\n\n  return { ok: false, reason: 'not-found' }\n}\n\n/** 在候选 ordinal 中按 hint 取最优边；无法区分 → undefined（ambiguous）。 */\nfunction bestEdgeByHint(\n  ordinals: readonly number[],\n  hint: EdgeTopoRef['hint'],\n  ctx: ResolutionContext,\n): { ordinal: number; handle?: BrepHandle } | undefined {\n  const pool = ordinals\n    .map((o) => ctx.edges?.find((e) => e.ordinal === o))\n    .filter((e): e is EdgeCandidateEntry => e !== undefined)\n  return matchEdgeByHint(pool, hint)\n}\n"]}

package/dist/topology/naming/score.js

@@ -11,8 +11,8 @@
 const TYPE_MISMATCH = -Infinity;
 /** 法向点积下限（拒绝阈值）。 */
 const NORMAL_DOT_MIN = 0.707;
-/** 质心距²上限（mm²；拒绝阈值）。 */
-const CENTROID_DIST_SQ_MAX = 100;
+/** 质心距²上限（mm²；平方量级，保持裸数字，见 tolerance.ts）。 */
+const CENTROID_DIST_SQ_MAX_MM2 = 100;
 /** 面积 |log 比| 超此值扣分。 */
 const AREA_LOG_RATIO_MAX = 1.0;
 /** 几何兜底接受的最小分。 */
@@ -86,7 +86,7 @@ export function scoreCandidate(kernel, hint, candidate) {
         const dy = hint.center[1] - g.center[1];
         const dz = hint.center[2] - g.center[2];
         const distSq = dx * dx + dy * dy + dz * dz;
-        if (distSq > CENTROID_DIST_SQ_MAX)
+        if (distSq > CENTROID_DIST_SQ_MAX_MM2)
             return TYPE_MISMATCH;
         score -= distSq / 100;
     }

package/dist/topology/naming/score.js.map

@@ -1 +1 @@
-{"version":3,"file":"score.js","sourceRoot":"","sources":["../../../src/topology/naming/score.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAsBH,sBAAsB;AACtB,MAAM,aAAa,GAAG,CAAC,QAAQ,CAAA;AAC/B,oBAAoB;AACpB,MAAM,cAAc,GAAG,KAAK,CAAA;AAC5B,wBAAwB;AACxB,MAAM,oBAAoB,GAAG,GAAG,CAAA;AAChC,wBAAwB;AACxB,MAAM,kBAAkB,GAAG,GAAG,CAAA;AAC9B,kBAAkB;AAClB,MAAM,CAAC,MAAM,SAAS,GAAG,GAAG,CAAA;AAC5B,wCAAwC;AACxC,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAA;AAEtC,uCAAuC;AACvC,SAAS,iBAAiB,CACxB,MAA4B,EAC5B,SAAwB;IAExB,IAAI,SAAS,CAAC,MAAM,KAAK,SAAS,IAAI,MAAM,EAAE,CAAC;QAC7C,MAAM,MAAM,GAAG,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;QAC3D,MAAM,EAAE,GAAG,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;QAC5C,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACjC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACjC,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;QAC3D,OAAO;YACL,WAAW,EAAE,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC;YACjD,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YACtC,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YACtC,IAAI,EAAE,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC;SAC3C,CAAA;IACH,CAAC;IACD,OAAO,SAAS,CAAC,GAAG,IAAI,EAAE,CAAA;AAC5B,CAAC;AAED,wDAAwD;AACxD,SAAS,UAAU,CAAC,OAAsB,EAAE,KAAiB;IAC3D,mEAAmE;IACnE,gEAAgE;IAChE,OAAO,SAAS,CAAA;AAClB,CAAC;AAED,iCAAiC;AACjC,SAAS,UAAU,CAAC,IAAc,EAAE,IAAwB;IAC1D,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC;QAAE,OAAO,CAAC,CAAA;IACvD,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,IAAI,CAAC;QAAE,OAAO,CAAC,CAAA;IAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAA;IACrD,OAAO,QAAQ,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;AACtD,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAC5B,MAA4B,EAC5B,IAAc,EACd,SAAwB;IAExB,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IAE9C,SAAS;IACT,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACnC,IAAI,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,WAAW,EAAE,CAAC;YACvC,KAAK,IAAI,GAAG,CAAA;QACd,CAAC;aAAM,CAAC;YACN,OAAO,aAAa,CAAA;QACtB,CAAC;IACH,CAAC;IAED,OAAO;IACP,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QACxD,MAAM,GAAG,GACP,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAC9B,IAAI,GAAG,GAAG,cAAc;YAAE,OAAO,aAAa,CAAA;QAC9C,KAAK,IAAI,GAAG,CAAA;IACd,CAAC;IAED,SAAS;IACT,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QACxD,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACvC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACvC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACvC,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;QAC1C,IAAI,MAAM,GAAG,oBAAoB;YAAE,OAAO,aAAa,CAAA;QACvD,KAAK,IAAI,MAAM,GAAG,GAAG,CAAA;IACvB,CAAC;IAED,QAAQ;IACR,KAAK,IAAI,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAA;IAEjC,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;GAGG;AACH;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAqB;IACrD,OAAO,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;AACrE,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAC,IAAc,EAAE,GAAyB;IACpE,OAAO,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,CAAA;AAC5C,CAAC","sourcesContent":["/**\n * score.ts — 面候选打分器（移植 brepjs src/topology/shapeRef/scoring.ts）\n *\n * 两套实现，口径一致、结果可比（§3.5）：\n * - `defaultFaceScorer`：BREP 现场几何（kernel 计算 surfaceType/normal/center/area）\n * - `scoreFaceRow`：mesh/primitive 面行快照（FaceRow 或命名槽 FaceHint）\n *\n * 阈值常量化并写明 mm 单位假设——faijs 契约就是 mm，可直接沿用 brepjs 阈值。\n */\n\nimport type { BrepEngineApi } from '../../brep/engine/primitives'\nimport type { BrepHandle } from '../../brep/engine/types'\nimport type { FaceHint } from './types'\n\n/** 打分函数：分越高越匹配；-Infinity 直接拒绝。 */\nexport type FaceScorer = (hint: FaceHint, candidate: FaceCandidate) => number\n\n/** 打分候选：BREP 现场句柄 或 mesh/primitive 面行快照，二选一。 */\nexport interface FaceCandidate {\n  /** BREP 现场面句柄（走 kernel 现场几何）。 */\n  readonly handle?: BrepHandle\n  /** 面行快照（mesh/primitive；与 handle 二选一）。 */\n  readonly row?: Readonly<{\n    surfaceType?: string\n    normal?: readonly number[]\n    center?: readonly number[]\n    area?: number\n  }>\n}\n\n/** 曲面类型不符直接拒绝（硬门）。 */\nconst TYPE_MISMATCH = -Infinity\n/** 法向点积下限（拒绝阈值）。 */\nconst NORMAL_DOT_MIN = 0.707\n/** 质心距²上限（mm²；拒绝阈值）。 */\nconst CENTROID_DIST_SQ_MAX = 100\n/** 面积 |log 比| 超此值扣分。 */\nconst AREA_LOG_RATIO_MAX = 1.0\n/** 几何兜底接受的最小分。 */\nexport const MIN_SCORE = 0.5\n/** 并列模糊带：两候选分差小于此值视为并列（→ ambiguous）。 */\nexport const AMBIGUITY_THRESHOLD = 0.1\n\n/** 从候选读取几何量的统一入口（handle 优先，row 兜底）。 */\nfunction candidateGeometry(\n  kernel: BrepEngineApi | null,\n  candidate: FaceCandidate,\n): { surfaceType?: string; normal?: readonly number[]; center?: readonly number[]; area?: number } {\n  if (candidate.handle !== undefined && kernel) {\n    const center = kernel.surfaceCenterOfMass(candidate.handle)\n    const uv = kernel.uvBounds(candidate.handle)\n    const u = (uv.uMin + uv.uMax) / 2\n    const v = (uv.vMin + uv.vMax) / 2\n    const normal = kernel.surfaceNormal(candidate.handle, u, v)\n    return {\n      surfaceType: kernel.surfaceType(candidate.handle),\n      normal: [normal.x, normal.y, normal.z],\n      center: [center.x, center.y, center.z],\n      area: faceAreaOf(kernel, candidate.handle),\n    }\n  }\n  return candidate.row ?? {}\n}\n\n/** 面面积：BREP 现场无直接 API，用包围盒近似不可靠——退化为 undefined（不打分）。 */\nfunction faceAreaOf(_kernel: BrepEngineApi, _face: BrepHandle): number | undefined {\n  // occt-wasm 无公开 face area API（queryBatch 仅测试用、返回 {area} 但生产路径零调用）。\n  // hint 携带的 area 仍参与面积比扣分（见 scorerArea），此处返回 undefined 表示「现场未知」。\n  return undefined\n}\n\n/** 面积比扣分（hint.area 已知且 >0 时）。 */\nfunction scorerArea(hint: FaceHint, area: number | undefined): number {\n  if (hint.area === undefined || hint.area <= 0) return 0\n  if (area === undefined || area <= 0) return 0\n  const logRatio = Math.abs(Math.log(hint.area / area))\n  return logRatio > AREA_LOG_RATIO_MAX ? -logRatio : 0\n}\n\n/**\n * 打分一条候选（共用于 BREP 现场与面行快照两路）。\n *\n * @param kernel - OCCT 内核（candidate.handle 路径需要；row 路径可传 null）。\n * @param hint - 被解析 TopoRef 携带的面 hint。\n * @param candidate - 候选（句柄或面行）。\n * @returns 综合分；-Infinity 表示硬性不匹配。\n */\nexport function scoreCandidate(\n  kernel: BrepEngineApi | null,\n  hint: FaceHint,\n  candidate: FaceCandidate,\n): number {\n  let score = 0\n  const g = candidateGeometry(kernel, candidate)\n\n  // 曲面类型硬门\n  if (hint.surfaceType !== undefined) {\n    if (g.surfaceType === hint.surfaceType) {\n      score += 1.0\n    } else {\n      return TYPE_MISMATCH\n    }\n  }\n\n  // 法向点积\n  if (hint.normal !== undefined && g.normal !== undefined) {\n    const dot =\n      hint.normal[0] * g.normal[0] +\n      hint.normal[1] * g.normal[1] +\n      hint.normal[2] * g.normal[2]\n    if (dot < NORMAL_DOT_MIN) return TYPE_MISMATCH\n    score += dot\n  }\n\n  // 质心距²惩罚\n  if (hint.center !== undefined && g.center !== undefined) {\n    const dx = hint.center[0] - g.center[0]\n    const dy = hint.center[1] - g.center[1]\n    const dz = hint.center[2] - g.center[2]\n    const distSq = dx * dx + dy * dy + dz * dz\n    if (distSq > CENTROID_DIST_SQ_MAX) return TYPE_MISMATCH\n    score -= distSq / 100\n  }\n\n  // 面积比扣分\n  score += scorerArea(hint, g.area)\n\n  return score\n}\n\n/**\n * BREP 现场打分器（§3.5 defaultFaceScorer 移植）：候选是活句柄，几何现场算。\n * 保持与 scoreFaceRow 同一套权重，保证两路结果可比。\n */\n/**\n * Build a scorer that computes geometry live from a BREP kernel handle.\n *\n * @param kernel - the OCCT kernel used to evaluate candidate face geometry.\n * @returns a FaceScorer scoring live face handles against a FaceHint.\n */\nexport function defaultFaceScorer(kernel: BrepEngineApi): FaceScorer {\n  return (hint, candidate) => scoreCandidate(kernel, hint, candidate)\n}\n\n/**\n * 面行/命名槽快照打分器（§3.5 scoreFaceRow）：候选是 FaceRow/hint 快照，\n * 用于 mesh/primitive（无 kernel 现场几何）。\n *\n * @param hint - the FaceHint carried by the TopoRef being resolved.\n * @param row - the candidate face-row snapshot (surfaceType/normal/center/area).\n * @returns the combined score; -Infinity rejects the candidate outright.\n */\nexport function scoreFaceRow(hint: FaceHint, row: FaceCandidate['row']): number {\n  return scoreCandidate(null, hint, { row })\n}\n"]}
+{"version":3,"file":"score.js","sourceRoot":"","sources":["../../../src/topology/naming/score.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAsBH,sBAAsB;AACtB,MAAM,aAAa,GAAG,CAAC,QAAQ,CAAA;AAC/B,oBAAoB;AACpB,MAAM,cAAc,GAAG,KAAK,CAAA;AAC5B,6CAA6C;AAC7C,MAAM,wBAAwB,GAAG,GAAG,CAAA;AACpC,wBAAwB;AACxB,MAAM,kBAAkB,GAAG,GAAG,CAAA;AAC9B,kBAAkB;AAClB,MAAM,CAAC,MAAM,SAAS,GAAG,GAAG,CAAA;AAC5B,wCAAwC;AACxC,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAA;AAEtC,uCAAuC;AACvC,SAAS,iBAAiB,CACxB,MAA4B,EAC5B,SAAwB;IAExB,IAAI,SAAS,CAAC,MAAM,KAAK,SAAS,IAAI,MAAM,EAAE,CAAC;QAC7C,MAAM,MAAM,GAAG,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;QAC3D,MAAM,EAAE,GAAG,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;QAC5C,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACjC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACjC,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;QAC3D,OAAO;YACL,WAAW,EAAE,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC;YACjD,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YACtC,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YACtC,IAAI,EAAE,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC;SAC3C,CAAA;IACH,CAAC;IACD,OAAO,SAAS,CAAC,GAAG,IAAI,EAAE,CAAA;AAC5B,CAAC;AAED,wDAAwD;AACxD,SAAS,UAAU,CAAC,OAAsB,EAAE,KAAiB;IAC3D,mEAAmE;IACnE,gEAAgE;IAChE,OAAO,SAAS,CAAA;AAClB,CAAC;AAED,iCAAiC;AACjC,SAAS,UAAU,CAAC,IAAc,EAAE,IAAwB;IAC1D,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC;QAAE,OAAO,CAAC,CAAA;IACvD,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,IAAI,CAAC;QAAE,OAAO,CAAC,CAAA;IAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAA;IACrD,OAAO,QAAQ,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;AACtD,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAC5B,MAA4B,EAC5B,IAAc,EACd,SAAwB;IAExB,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IAE9C,SAAS;IACT,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACnC,IAAI,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,WAAW,EAAE,CAAC;YACvC,KAAK,IAAI,GAAG,CAAA;QACd,CAAC;aAAM,CAAC;YACN,OAAO,aAAa,CAAA;QACtB,CAAC;IACH,CAAC;IAED,OAAO;IACP,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QACxD,MAAM,GAAG,GACP,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAC9B,IAAI,GAAG,GAAG,cAAc;YAAE,OAAO,aAAa,CAAA;QAC9C,KAAK,IAAI,GAAG,CAAA;IACd,CAAC;IAED,SAAS;IACT,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QACxD,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACvC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACvC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACvC,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;QAC1C,IAAI,MAAM,GAAG,wBAAwB;YAAE,OAAO,aAAa,CAAA;QAC3D,KAAK,IAAI,MAAM,GAAG,GAAG,CAAA;IACvB,CAAC;IAED,QAAQ;IACR,KAAK,IAAI,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAA;IAEjC,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;GAGG;AACH;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAqB;IACrD,OAAO,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;AACrE,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAC,IAAc,EAAE,GAAyB;IACpE,OAAO,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,CAAA;AAC5C,CAAC","sourcesContent":["/**\n * score.ts — 面候选打分器（移植 brepjs src/topology/shapeRef/scoring.ts）\n *\n * 两套实现，口径一致、结果可比（§3.5）：\n * - `defaultFaceScorer`：BREP 现场几何（kernel 计算 surfaceType/normal/center/area）\n * - `scoreFaceRow`：mesh/primitive 面行快照（FaceRow 或命名槽 FaceHint）\n *\n * 阈值常量化并写明 mm 单位假设——faijs 契约就是 mm，可直接沿用 brepjs 阈值。\n */\n\nimport type { BrepEngineApi } from '../../brep/engine/primitives'\nimport type { BrepHandle } from '../../brep/engine/types'\nimport type { FaceHint } from './types'\n\n/** 打分函数：分越高越匹配；-Infinity 直接拒绝。 */\nexport type FaceScorer = (hint: FaceHint, candidate: FaceCandidate) => number\n\n/** 打分候选：BREP 现场句柄 或 mesh/primitive 面行快照，二选一。 */\nexport interface FaceCandidate {\n  /** BREP 现场面句柄（走 kernel 现场几何）。 */\n  readonly handle?: BrepHandle\n  /** 面行快照（mesh/primitive；与 handle 二选一）。 */\n  readonly row?: Readonly<{\n    surfaceType?: string\n    normal?: readonly number[]\n    center?: readonly number[]\n    area?: number\n  }>\n}\n\n/** 曲面类型不符直接拒绝（硬门）。 */\nconst TYPE_MISMATCH = -Infinity\n/** 法向点积下限（拒绝阈值）。 */\nconst NORMAL_DOT_MIN = 0.707\n/** 质心距²上限（mm²；平方量级，保持裸数字，见 tolerance.ts）。 */\nconst CENTROID_DIST_SQ_MAX_MM2 = 100\n/** 面积 |log 比| 超此值扣分。 */\nconst AREA_LOG_RATIO_MAX = 1.0\n/** 几何兜底接受的最小分。 */\nexport const MIN_SCORE = 0.5\n/** 并列模糊带：两候选分差小于此值视为并列（→ ambiguous）。 */\nexport const AMBIGUITY_THRESHOLD = 0.1\n\n/** 从候选读取几何量的统一入口（handle 优先，row 兜底）。 */\nfunction candidateGeometry(\n  kernel: BrepEngineApi | null,\n  candidate: FaceCandidate,\n): { surfaceType?: string; normal?: readonly number[]; center?: readonly number[]; area?: number } {\n  if (candidate.handle !== undefined && kernel) {\n    const center = kernel.surfaceCenterOfMass(candidate.handle)\n    const uv = kernel.uvBounds(candidate.handle)\n    const u = (uv.uMin + uv.uMax) / 2\n    const v = (uv.vMin + uv.vMax) / 2\n    const normal = kernel.surfaceNormal(candidate.handle, u, v)\n    return {\n      surfaceType: kernel.surfaceType(candidate.handle),\n      normal: [normal.x, normal.y, normal.z],\n      center: [center.x, center.y, center.z],\n      area: faceAreaOf(kernel, candidate.handle),\n    }\n  }\n  return candidate.row ?? {}\n}\n\n/** 面面积：BREP 现场无直接 API，用包围盒近似不可靠——退化为 undefined（不打分）。 */\nfunction faceAreaOf(_kernel: BrepEngineApi, _face: BrepHandle): number | undefined {\n  // occt-wasm 无公开 face area API（queryBatch 仅测试用、返回 {area} 但生产路径零调用）。\n  // hint 携带的 area 仍参与面积比扣分（见 scorerArea），此处返回 undefined 表示「现场未知」。\n  return undefined\n}\n\n/** 面积比扣分（hint.area 已知且 >0 时）。 */\nfunction scorerArea(hint: FaceHint, area: number | undefined): number {\n  if (hint.area === undefined || hint.area <= 0) return 0\n  if (area === undefined || area <= 0) return 0\n  const logRatio = Math.abs(Math.log(hint.area / area))\n  return logRatio > AREA_LOG_RATIO_MAX ? -logRatio : 0\n}\n\n/**\n * 打分一条候选（共用于 BREP 现场与面行快照两路）。\n *\n * @param kernel - OCCT 内核（candidate.handle 路径需要；row 路径可传 null）。\n * @param hint - 被解析 TopoRef 携带的面 hint。\n * @param candidate - 候选（句柄或面行）。\n * @returns 综合分；-Infinity 表示硬性不匹配。\n */\nexport function scoreCandidate(\n  kernel: BrepEngineApi | null,\n  hint: FaceHint,\n  candidate: FaceCandidate,\n): number {\n  let score = 0\n  const g = candidateGeometry(kernel, candidate)\n\n  // 曲面类型硬门\n  if (hint.surfaceType !== undefined) {\n    if (g.surfaceType === hint.surfaceType) {\n      score += 1.0\n    } else {\n      return TYPE_MISMATCH\n    }\n  }\n\n  // 法向点积\n  if (hint.normal !== undefined && g.normal !== undefined) {\n    const dot =\n      hint.normal[0] * g.normal[0] +\n      hint.normal[1] * g.normal[1] +\n      hint.normal[2] * g.normal[2]\n    if (dot < NORMAL_DOT_MIN) return TYPE_MISMATCH\n    score += dot\n  }\n\n  // 质心距²惩罚\n  if (hint.center !== undefined && g.center !== undefined) {\n    const dx = hint.center[0] - g.center[0]\n    const dy = hint.center[1] - g.center[1]\n    const dz = hint.center[2] - g.center[2]\n    const distSq = dx * dx + dy * dy + dz * dz\n    if (distSq > CENTROID_DIST_SQ_MAX_MM2) return TYPE_MISMATCH\n    score -= distSq / 100\n  }\n\n  // 面积比扣分\n  score += scorerArea(hint, g.area)\n\n  return score\n}\n\n/**\n * BREP 现场打分器（§3.5 defaultFaceScorer 移植）：候选是活句柄，几何现场算。\n * 保持与 scoreFaceRow 同一套权重，保证两路结果可比。\n */\n/**\n * Build a scorer that computes geometry live from a BREP kernel handle.\n *\n * @param kernel - the OCCT kernel used to evaluate candidate face geometry.\n * @returns a FaceScorer scoring live face handles against a FaceHint.\n */\nexport function defaultFaceScorer(kernel: BrepEngineApi): FaceScorer {\n  return (hint, candidate) => scoreCandidate(kernel, hint, candidate)\n}\n\n/**\n * 面行/命名槽快照打分器（§3.5 scoreFaceRow）：候选是 FaceRow/hint 快照，\n * 用于 mesh/primitive（无 kernel 现场几何）。\n *\n * @param hint - the FaceHint carried by the TopoRef being resolved.\n * @param row - the candidate face-row snapshot (surfaceType/normal/center/area).\n * @returns the combined score; -Infinity rejects the candidate outright.\n */\nexport function scoreFaceRow(hint: FaceHint, row: FaceCandidate['row']): number {\n  return scoreCandidate(null, hint, { row })\n}\n"]}