@faicad/faijs 0.33.2 → 0.35.8

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;AAiDH,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 * 本表是**六个类别的定义**；某个 op 实际声明哪一类，以该 op 的 `defineOp` 为准\n * （实测：`sweep`、`loft` 声明 `unmodeled`；`extrude`、`revolve`、`makeBox` 声明 `construct`）。\n */\nexport type Provenance =\n  /** 内核给历史：boolean / fillet / chamfer / shell / offset / 刚体变换 */\n  | { readonly kind: 'kernel'; readonly newFaces: NewFaceRule }\n  /** 输出面 ↔ 输入的构造规则：extrude / revolve / primitives（`via: 'explicit'` 词汇表给出） */\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"]}
+{"version":3,"file":"lineage.js","sourceRoot":"","sources":["../../../src/topology/naming/lineage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6CG;AAiDH,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;;GAEG;AACH,MAAM,WAAW,GAAG,0BAA0B,CAAA;AAC9C,MAAM,eAAe,GAAG,CAAC,CAAA;AAEzB;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,kBAAkB;IACzB,MAAM,CAAC,GAAG,UAAgD,CAAA;IAC1D,MAAM,QAAQ,GAAG,CAAC,CAAC,WAAW,CAAyD,CAAA;IACvF,IAAI,QAAQ,EAAE,CAAC;QACb,IAAI,QAAQ,CAAC,OAAO,KAAK,eAAe,EAAE,CAAC;YACzC,MAAM,IAAI,KAAK,CACb,4CAA4C,QAAQ,CAAC,OAAO,cAAc,eAAe,EAAE,CAC5F,CAAA;QACH,CAAC;QACD,OAAO,QAAQ,CAAC,KAAK,CAAA;IACvB,CAAC;IACD,MAAM,OAAO,GAAG,EAAE,OAAO,EAAE,eAAe,EAAE,KAAK,EAAE,IAAI,YAAY,EAAE,EAAE,CAAA;IACvE,CAAC,CAAC,WAAW,CAAC,GAAG,OAAO,CAAA;IACxB,OAAO,OAAO,CAAC,KAAK,CAAA;AACtB,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAiB,kBAAkB,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 * 本表是**六个类别的定义**；某个 op 实际声明哪一类，以该 op 的 `defineOp` 为准\n * （实测：`sweep`、`loft` 声明 `unmodeled`；`extrude`、`revolve`、`makeBox` 声明 `construct`）。\n */\nexport type Provenance =\n  /** 内核给历史：boolean / fillet / chamfer / shell / offset / 刚体变换 */\n  | { readonly kind: 'kernel'; readonly newFaces: NewFaceRule }\n  /** 输出面 ↔ 输入的构造规则：extrude / revolve / primitives（`via: 'explicit'` 词汇表给出） */\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 * globalThis 上的血缘图共享键与版本（见 `sharedLineageGraph`）。\n */\nconst LINEAGE_KEY = '__FAICAD_FAIJS_LINEAGE__'\nconst LINEAGE_VERSION = 1\n\n/**\n * 取（或建）挂在 globalThis 上的血缘图。\n *\n * **为什么必须挂 globalThis**：宿主 bundle 与第三方库（如 animation）可能各打一份\n * faijs 代码（node_modules 里 animation 内嵌一份、宿主一份）。模块级单例会让\n * 「建命名的一方」与「解析的一方」看到两张不同的表——求解侧 `roleTable` 恒空，\n * exact 路径永不命中，只剩几何兜底；而 brepkit 的 `uvBounds` 对平面返回 ±1e6\n * 哨兵，`surfaceCenterOfMass` 退化成参数原点求值，非居中模型上兜底全拒 →\n * `topo ref (face) not found in the current shape`（2026-10-16 装配选面 bug 实锤）。\n *\n * 与 `runtime-state.ts` 的 `getRuntimeState()` 同一机制——那边早就是 globalThis\n * （注释原话\"让两份 faijs 代码共享同一份状态……构建期去重是主手段，这里是兜底\"），\n * 血缘图是漏补的那一块。版本不符直接抛错，不静默错乱（与 N1/N2/N3 同精神：\n * 宁可在执行期就炸）。\n *\n * @returns the shared lineage graph singleton.\n */\nfunction sharedLineageGraph(): LineageGraph {\n  const g = globalThis as unknown as Record<string, unknown>\n  const existing = g[LINEAGE_KEY] as { version: number; graph: LineageGraph } | undefined\n  if (existing) {\n    if (existing.version !== LINEAGE_VERSION) {\n      throw new Error(\n        `[faijs] lineage version mismatch: loaded=${existing.version}, expected=${LINEAGE_VERSION}`,\n      )\n    }\n    return existing.graph\n  }\n  const created = { version: LINEAGE_VERSION, graph: new LineageGraph() }\n  g[LINEAGE_KEY] = created\n  return created.graph\n}\n\n/**\n * 执行期共用的血缘图实例。\n *\n * 唯一性由约束 C1（禁止并发多 runtime）保证；测试请自建 `new LineageGraph()`。\n * **跨 faijs 实例共享**（globalThis），见 `sharedLineageGraph`。\n */\nexport const runtimeLineage: LineageGraph = sharedLineageGraph()\n"]}

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

@@ -20,14 +20,25 @@ export interface FaceCandidateEntry {
     ordinal: number;
     /** 会话内 hash（BREP：subShapeHashes；exact 匹配用）。 */
     hash?: number;
-    /** BREP 现场句柄（存在 → 打分走 kernel 现场几何）。 */
+    /** BREP 现场句柄（exact 匹配 + 命中后回传活句柄用；打分不再优先走它）。 */
     handle?: BrepHandle;
-    /** mesh/primitive 面行快照（存在 → 打分走 scoreCandidate row 路径）。 */
+    /**
+     * 面行快照（存在 → 打分走 scoreCandidate row 路径）。
+     *
+     * BREP 路径也带（slot.faceHints，§3.6）：行几何与 handle 同一次 execute 产出
+     * （同帧），且 brepkit 的 kernel 现场 center 会退化（uvBounds ±1e6 哨兵 →
+     * surfaceCenterOfMass 在参数原点求值），故 `toScoringCandidate` 改为 row 优先。
+     * `axis` 与 `faceRowToHint` 入参对齐——圆柱面的轴 hint 不能丢。
+     */
     row?: Readonly<{
         surfaceType?: string;
         normal?: readonly number[];
         center?: readonly number[];
         area?: number;
+        axis?: {
+            origin?: readonly number[] | null;
+            direction?: readonly number[] | null;
+        };
     }>;
 }
 /** 面解析上下文：候选表 + role 表 + kernel（BREP 现场打分用，可为 null）+ 邻接（M3）。 */

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

@@ -1 +1 @@
-{"version":3,"file":"resolve-face.d.ts","sourceRoot":"","sources":["../../../src/topology/naming/resolve-face.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAA;AACjE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAA;AACzD,OAAO,KAAK,EAAY,WAAW,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,SAAS,CAAA;AAG/E,+CAA+C;AAC/C,MAAM,WAAW,kBAAkB;IACjC,gEAAgE;IAChE,OAAO,EAAE,MAAM,CAAA;IACf,+CAA+C;IAC/C,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,uCAAuC;IACvC,MAAM,CAAC,EAAE,UAAU,CAAA;IACnB,2DAA2D;IAC3D,GAAG,CAAC,EAAE,QAAQ,CAAC;QACb,WAAW,CAAC,EAAE,MAAM,CAAA;QACpB,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;QAC1B,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;QAC1B,IAAI,CAAC,EAAE,MAAM,CAAA;KACd,CAAC,CAAA;CACH;AAED,gEAAgE;AAChE,MAAM,WAAW,iBAAiB;IAChC,oDAAoD;IACpD,QAAQ,CAAC,MAAM,EAAE,aAAa,GAAG,IAAI,CAAA;IACrC,oCAAoC;IACpC,QAAQ,CAAC,KAAK,EAAE,SAAS,kBAAkB,EAAE,CAAA;IAC7C,qEAAqE;IACrE,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAA;IAC9B,wDAAwD;IACxD,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,kBAAkB,EAAE,CAAA;IAC9C,2DAA2D;IAC3D,QAAQ,CAAC,QAAQ,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAA;IACnD,iEAAiE;IACjE,QAAQ,CAAC,aAAa,CAAC,EAAE,aAAa,CAAC,SAAS,MAAM,EAAE,CAAC,CAAA;IACzD,yFAAyF;IACzF,QAAQ,CAAC,iBAAiB,CAAC,EAAE,aAAa,CAAC,SAAS,MAAM,EAAE,CAAC,CAAA;IAC7D,iEAAiE;IACjE,QAAQ,CAAC,iBAAiB,CAAC,EAAE,aAAa,CAAC,SAAS,MAAM,EAAE,CAAC,CAAA;IAC7D,qEAAqE;IACrE,QAAQ,CAAC,mBAAmB,CAAC,EAAE,aAAa,CAAC,SAAS,MAAM,EAAE,CAAC,CAAA;CAChE;AAED,0DAA0D;AAC1D,MAAM,WAAW,kBAAkB;IACjC,kBAAkB;IAClB,OAAO,EAAE,MAAM,CAAA;IACf,4BAA4B;IAC5B,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,uCAAuC;IACvC,MAAM,CAAC,EAAE,UAAU,CAAA;IACnB,uCAAuC;IACvC,IAAI,CAAC,EAAE;QACL,MAAM,CAAC,EAAE,MAAM,CAAA;QACf,QAAQ,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;KAC7B,CAAA;CACF;AAED,sDAAsD;AACtD,MAAM,WAAW,oBAAoB;IACnC,mBAAmB;IACnB,OAAO,EAAE,MAAM,CAAA;IACf,gBAAgB;IAChB,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,iBAAiB;IACjB,MAAM,CAAC,EAAE,UAAU,CAAA;IACnB,YAAY;IACZ,QAAQ,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;CAC7B;AAkDD;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,WAAW,EAChB,GAAG,EAAE,iBAAiB,GACrB,cAAc,CAAC;IAAE,MAAM,CAAC,EAAE,UAAU,CAAA;CAAE,CAAC,CA4CzC"}
+{"version":3,"file":"resolve-face.d.ts","sourceRoot":"","sources":["../../../src/topology/naming/resolve-face.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAA;AACjE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAA;AACzD,OAAO,KAAK,EAAY,WAAW,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,SAAS,CAAA;AAG/E,+CAA+C;AAC/C,MAAM,WAAW,kBAAkB;IACjC,gEAAgE;IAChE,OAAO,EAAE,MAAM,CAAA;IACf,+CAA+C;IAC/C,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,gDAAgD;IAChD,MAAM,CAAC,EAAE,UAAU,CAAA;IACnB;;;;;;;OAOG;IACH,GAAG,CAAC,EAAE,QAAQ,CAAC;QACb,WAAW,CAAC,EAAE,MAAM,CAAA;QACpB,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;QAC1B,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;QAC1B,IAAI,CAAC,EAAE,MAAM,CAAA;QACb,IAAI,CAAC,EAAE;YAAE,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAC;YAAC,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAA;SAAE,CAAA;KACnF,CAAC,CAAA;CACH;AAED,gEAAgE;AAChE,MAAM,WAAW,iBAAiB;IAChC,oDAAoD;IACpD,QAAQ,CAAC,MAAM,EAAE,aAAa,GAAG,IAAI,CAAA;IACrC,oCAAoC;IACpC,QAAQ,CAAC,KAAK,EAAE,SAAS,kBAAkB,EAAE,CAAA;IAC7C,qEAAqE;IACrE,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAA;IAC9B,wDAAwD;IACxD,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,kBAAkB,EAAE,CAAA;IAC9C,2DAA2D;IAC3D,QAAQ,CAAC,QAAQ,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAA;IACnD,iEAAiE;IACjE,QAAQ,CAAC,aAAa,CAAC,EAAE,aAAa,CAAC,SAAS,MAAM,EAAE,CAAC,CAAA;IACzD,yFAAyF;IACzF,QAAQ,CAAC,iBAAiB,CAAC,EAAE,aAAa,CAAC,SAAS,MAAM,EAAE,CAAC,CAAA;IAC7D,iEAAiE;IACjE,QAAQ,CAAC,iBAAiB,CAAC,EAAE,aAAa,CAAC,SAAS,MAAM,EAAE,CAAC,CAAA;IAC7D,qEAAqE;IACrE,QAAQ,CAAC,mBAAmB,CAAC,EAAE,aAAa,CAAC,SAAS,MAAM,EAAE,CAAC,CAAA;CAChE;AAED,0DAA0D;AAC1D,MAAM,WAAW,kBAAkB;IACjC,kBAAkB;IAClB,OAAO,EAAE,MAAM,CAAA;IACf,4BAA4B;IAC5B,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,uCAAuC;IACvC,MAAM,CAAC,EAAE,UAAU,CAAA;IACnB,uCAAuC;IACvC,IAAI,CAAC,EAAE;QACL,MAAM,CAAC,EAAE,MAAM,CAAA;QACf,QAAQ,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;KAC7B,CAAA;CACF;AAED,sDAAsD;AACtD,MAAM,WAAW,oBAAoB;IACnC,mBAAmB;IACnB,OAAO,EAAE,MAAM,CAAA;IACf,gBAAgB;IAChB,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,iBAAiB;IACjB,MAAM,CAAC,EAAE,UAAU,CAAA;IACnB,YAAY;IACZ,QAAQ,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;CAC7B;AAkED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,WAAW,EAChB,GAAG,EAAE,iBAAiB,GACrB,cAAc,CAAC;IAAE,MAAM,CAAC,EAAE,UAAU,CAAA;CAAE,CAAC,CA4CzC"}

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

@@ -12,9 +12,25 @@
  * 任何一步定不了案就返回三态（调用方抛 TopoRefError），绝不静默拿序号硬取。
  */
 import { scoreCandidate, MIN_SCORE, AMBIGUITY_THRESHOLD } from './score.js';
-/** 打分候选 → 候选条目（handle 优先、row 兜底，与 score.ts FaceCandidate 同构）。 */
+/**
+ * 打分候选 → 候选条目（**row 优先**、kernel 现场兜底，与 score.ts FaceCandidate 同构）。
+ *
+ * 曾经是 handle 优先（`c.handle !== undefined ? { handle } : { row }`），那让 BREP
+ * 路径的打分一律走 kernel 现场——而 brepkit 的 `uvBounds` 对平面返回 ±1e6 哨兵，
+ * `surfaceCenterOfMass` 在参数原点求值：非居中模型上 center 全错（`[20,20,0]` 退
+ * 化成 `[0,0,0]`），距 hint 质心 28mm > 10mm 硬门 → 全候选被拒 →
+ * `topo ref (face) not found in the current shape`（2026-10-16 装配选面 bug）。
+ * 居中模型只因"参数原点恰好等于质心"而侥幸通过——是巧合，不是正确性。
+ *
+ * 行快照与 handle 同一次 execute 产出（同帧不陈旧），几何就是命名行的同一来源
+ * （`geom-hint.ts` 的 `faceRowToHint`），且 derived 解析（`resolve-derived.ts` 的
+ * `normalOf`）早已走 row——这里把主解析路径对齐过来。
+ *
+ * @param c - the face candidate entry.
+ * @returns the scoring candidate (row first, live handle as fallback).
+ */
 function toScoringCandidate(c) {
-    return c.handle !== undefined ? { handle: c.handle } : { row: c.row };
+    return c.row !== undefined ? { row: c.row } : { handle: c.handle };
 }
 /** 一组候选对 hint 打分：best / secondBest / scored。 */
 function scoreCandidates(hint, candidates, ctx) {

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

@@ -1 +1 @@
-{"version":3,"file":"resolve-face.js","sourceRoot":"","sources":["../../../src/topology/naming/resolve-face.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAKH,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,mBAAmB,EAAE,MAAM,SAAS,CAAA;AAoExE,iEAAiE;AACjE,SAAS,kBAAkB,CAAC,CAAqB;IAC/C,OAAO,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAA;AACvE,CAAC;AAED,gDAAgD;AAChD,SAAS,eAAe,CACtB,IAAc,EACd,UAAyC,EACzC,GAAsB;IAEtB,IAAI,SAAS,GAAG,CAAC,QAAQ,CAAA;IACzB,IAAI,eAAe,GAAG,CAAC,QAAQ,CAAA;IAC/B,IAAI,IAAoC,CAAA;IACxC,MAAM,MAAM,GAA4D,EAAE,CAAA;IAC1E,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAA;QACrE,IAAI,KAAK,GAAG,SAAS;YAAE,MAAM,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAA;QAC3D,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YACtB,eAAe,GAAG,SAAS,CAAA;YAC3B,SAAS,GAAG,KAAK,CAAA;YACjB,IAAI,GAAG,CAAC,CAAA;QACV,CAAC;aAAM,IAAI,KAAK,GAAG,eAAe,EAAE,CAAC;YACnC,eAAe,GAAG,KAAK,CAAA;QACzB,CAAC;IACH,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,eAAe,EAAE,CAAA;AACrD,CAAC;AAED,2CAA2C;AAC3C,SAAS,SAAS,CAChB,IAAc,EACd,UAAyC,EACzC,GAAsB;IAEtB,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,eAAe,EAAE,GAAG,eAAe,CAAC,IAAI,EAAE,UAAU,EAAE,GAAG,CAAC,CAAA;IAC3F,IAAI,IAAI,KAAK,SAAS,IAAI,SAAS,GAAG,SAAS,EAAE,CAAC;QAChD,IAAI,SAAS,GAAG,eAAe,GAAG,mBAAmB,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3E,MAAM,WAAW,GAAG,MAAM;iBACvB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,SAAS,GAAG,mBAAmB,CAAC;iBACzD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;YAC1B,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,CAAA;QACvD,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,CAAA;IAC3C,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAA;AACzB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,GAAgB,EAChB,GAAsB;IAEtB,8BAA8B;IAC9B,MAAM,YAAY,GAAG,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAClE,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,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,CAAA;YACxB,IAAI,IAAI,EAAE,CAAC;gBACT,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,CAAA;YAClG,CAAC;QACH,CAAC;aAAM,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,CAAA;QACzC,CAAC;aAAM,CAAC;YACN,wBAAwB;YACxB,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,EAAE,GAAG,CAAC,CAAA;YACjD,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC3B,OAAO;oBACL,EAAE,EAAE,IAAI;oBACR,MAAM,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE;oBAC1C,OAAO,EAAE,KAAK,CAAC,SAAS,CAAC,OAAO;oBAChC,UAAU,EAAE,oBAAoB;iBACjC,CAAA;YACH,CAAC;YACD,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;gBAC/B,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,iBAAiB,EAAE,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAA;YACtG,CAAC;YACD,qBAAqB;QACvB,CAAC;IACH,CAAC;IAED,gBAAgB;IAChB,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;IAC/C,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACzB,OAAO;YACL,EAAE,EAAE,IAAI;YACR,MAAM,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE;YACxC,OAAO,EAAE,GAAG,CAAC,SAAS,CAAC,OAAO;YAC9B,UAAU,EAAE,oBAAoB;SACjC,CAAA;IACH,CAAC;IACD,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QAC7B,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,iBAAiB,EAAE,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAA;IACpG,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAA;AAC3C,CAAC","sourcesContent":["/**\n * resolve-face.ts — 面 TopoRef 解析（移植 brepjs shapeRefFns.resolveRef，§2.5）\n *\n * 解析策略：\n * 1. 精确：roleTable[origin][role] 的 hash 命中当前面\n *    - 恰好 1 → exact；0 → deleted；多个（1→多分裂）→ 只在这几个候选间用 hint 打分\n * 2. 几何兜底（role 缺失 / 分裂打分未命中）：在当前全部面上按 hint 打分\n *    - BREP：kernel 现场几何；mesh/primitive：命名槽面 hint 快照\n * 3. 最优分 > MIN_SCORE 且与次优差 ≥ AMBIGUITY_THRESHOLD → geometric-fallback；\n *    否则 ambiguous（并列）/ not-found（无超阈值候选）\n *\n * 任何一步定不了案就返回三态（调用方抛 TopoRefError），绝不静默拿序号硬取。\n */\n\nimport type { BrepEngineApi } from '../../brep/engine/primitives'\nimport type { BrepHandle } from '../../brep/engine/types'\nimport type { FaceHint, FaceTopoRef, RoleTable, TopoResolution } from './types'\nimport { scoreCandidate, MIN_SCORE, AMBIGUITY_THRESHOLD } from './score'\n\n/** 单个面候选：枚举序号 + 会话内 hash +（BREP 句柄 或 面行快照）。 */\nexport interface FaceCandidateEntry {\n  /** 面枚举序号（1 起，TopExp::MapShapes 序；与 FaceRow.id 的 `o1.fN` 同序）。 */\n  ordinal: number\n  /** 会话内 hash（BREP：subShapeHashes；exact 匹配用）。 */\n  hash?: number\n  /** BREP 现场句柄（存在 → 打分走 kernel 现场几何）。 */\n  handle?: BrepHandle\n  /** mesh/primitive 面行快照（存在 → 打分走 scoreCandidate row 路径）。 */\n  row?: Readonly<{\n    surfaceType?: string\n    normal?: readonly number[]\n    center?: readonly number[]\n    area?: number\n  }>\n}\n\n/** 面解析上下文：候选表 + role 表 + kernel（BREP 现场打分用，可为 null）+ 邻接（M3）。 */\nexport interface ResolutionContext {\n  /** OCCT 内核（mesh/primitive 路径为 null——打分走 row 快照）。 */\n  readonly kernel: BrepEngineApi | null\n  /** 当前快照的全部面候选（按枚举序，ordinal 1 起）。 */\n  readonly faces: readonly FaceCandidateEntry[]\n  /** 该 part 的 RoleTable（BREP 链上的 part 有；mesh/primitive 无 → 只走几何兜底）。 */\n  readonly roleTable?: RoleTable\n  /** 边候选表（ordinal 1 起 ↔ 数组下标 0 起；edge lineage 解析用，M3）。 */\n  readonly edges?: readonly EdgeCandidateEntry[]\n  /** 顶点候选表（ordinal 1 起 ↔ 数组下标 0 起；vertex lineage 解析用，M3）。 */\n  readonly vertices?: readonly VertexCandidateEntry[]\n  /** face ordinal(1 起) → 邻接 face ordinal 列表（derived/布尔缝解析用，M3）。 */\n  readonly faceAdjacency?: ReadonlyArray<readonly number[]>\n  /** face ordinal(1 起) → 邻接 edge ordinal 列表（edge lineage 用，M3；mesh 为空 → 边 lineage 不可用）。 */\n  readonly faceEdgeAdjacency?: ReadonlyArray<readonly number[]>\n  /** edge ordinal(1 起) → 邻接 face ordinal 列表（edge lineage 用，M3）。 */\n  readonly edgeFaceAdjacency?: ReadonlyArray<readonly number[]>\n  /** face ordinal(1 起) → 邻接 vertex ordinal 列表（vertex lineage 用，M3）。 */\n  readonly faceVertexAdjacency?: ReadonlyArray<readonly number[]>\n}\n\n/** 边候选：序号 + length/midpoint hint（edge lineage 解析用，M3）。 */\nexport interface EdgeCandidateEntry {\n  /** 边枚举序号（1 起）。 */\n  ordinal: number\n  /** 会话内 hash（exact 匹配预留）。 */\n  hash?: number\n  /** BREP 现场句柄（存在 → 打分走 kernel 现场几何）。 */\n  handle?: BrepHandle\n  /** 边几何 hint（length/midpoint；候选裁决用）。 */\n  hint?: {\n    length?: number\n    midpoint?: readonly number[]\n  }\n}\n\n/** 顶点候选：序号 + position hint（vertex lineage 解析用，M3）。 */\nexport interface VertexCandidateEntry {\n  /** 顶点枚举序号（1 起）。 */\n  ordinal: number\n  /** 会话内 hash。 */\n  hash?: number\n  /** BREP 现场句柄。 */\n  handle?: BrepHandle\n  /** 顶点坐标。 */\n  position?: readonly number[]\n}\n\n/** 打分候选 → 候选条目（handle 优先、row 兜底，与 score.ts FaceCandidate 同构）。 */\nfunction toScoringCandidate(c: FaceCandidateEntry): { handle?: BrepHandle; row?: FaceCandidateEntry['row'] } {\n  return c.handle !== undefined ? { handle: c.handle } : { row: c.row }\n}\n\n/** 一组候选对 hint 打分：best / secondBest / scored。 */\nfunction scoreCandidates(\n  hint: FaceHint,\n  candidates: readonly FaceCandidateEntry[],\n  ctx: ResolutionContext,\n): { scored: Array<{ candidate: FaceCandidateEntry; score: number }>; best?: FaceCandidateEntry; bestScore: number; secondBestScore: number } {\n  let bestScore = -Infinity\n  let secondBestScore = -Infinity\n  let best: FaceCandidateEntry | undefined\n  const scored: Array<{ candidate: FaceCandidateEntry; score: number }> = []\n  for (const c of candidates) {\n    const score = scoreCandidate(ctx.kernel, hint, toScoringCandidate(c))\n    if (score > MIN_SCORE) scored.push({ candidate: c, score })\n    if (score > bestScore) {\n      secondBestScore = bestScore\n      bestScore = score\n      best = c\n    } else if (score > secondBestScore) {\n      secondBestScore = score\n    }\n  }\n  return { scored, best, bestScore, secondBestScore }\n}\n\n/** 打分结果 → 三态（match / ambiguous / none）。 */\nfunction outcomeOf(\n  hint: FaceHint,\n  candidates: readonly FaceCandidateEntry[],\n  ctx: ResolutionContext,\n): { kind: 'match'; candidate: FaceCandidateEntry } | { kind: 'ambiguous'; candidates: FaceCandidateEntry[] } | { kind: 'none' } {\n  const { scored, best, bestScore, secondBestScore } = scoreCandidates(hint, candidates, ctx)\n  if (best !== undefined && bestScore > MIN_SCORE) {\n    if (bestScore - secondBestScore < AMBIGUITY_THRESHOLD && scored.length > 1) {\n      const competitive = scored\n        .filter((e) => e.score >= bestScore - AMBIGUITY_THRESHOLD)\n        .map((e) => e.candidate)\n      return { kind: 'ambiguous', candidates: competitive }\n    }\n    return { kind: 'match', candidate: best }\n  }\n  return { kind: 'none' }\n}\n\n/**\n * 解析面 TopoRef 到当前快照的序号/句柄。\n *\n * @param ref - the face TopoRef to resolve.\n * @param ctx - the resolution context (candidates + role table + kernel).\n * @returns the three-state TopoResolution.\n */\nexport function resolveFaceTopo(\n  ref: FaceTopoRef,\n  ctx: ResolutionContext,\n): TopoResolution<{ handle?: BrepHandle }> {\n  // 1. 精确：role 的追踪 hash 在候选面中命中\n  const targetHashes = ctx.roleTable?.get(ref.origin)?.get(ref.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 === 1) {\n      const [only] = survivors\n      if (only) {\n        return { ok: true, entity: { handle: only.handle }, ordinal: only.ordinal, confidence: 'exact' }\n      }\n    } else if (survivors.length === 0) {\n      return { ok: false, reason: 'deleted' }\n    } else {\n      // 1→多分裂：只在后继内裁决，不与全形状竞争\n      const split = outcomeOf(ref.hint, survivors, ctx)\n      if (split.kind === 'match') {\n        return {\n          ok: true,\n          entity: { handle: split.candidate.handle },\n          ordinal: split.candidate.ordinal,\n          confidence: 'geometric-fallback',\n        }\n      }\n      if (split.kind === 'ambiguous') {\n        return { ok: false, reason: 'ambiguous', candidatesOrdinal: split.candidates.map((c) => c.ordinal) }\n      }\n      // 'none' → 落到全形状几何兜底\n    }\n  }\n\n  // 2. 几何兜底：全形状打分\n  const all = outcomeOf(ref.hint, ctx.faces, ctx)\n  if (all.kind === 'match') {\n    return {\n      ok: true,\n      entity: { handle: all.candidate.handle },\n      ordinal: all.candidate.ordinal,\n      confidence: 'geometric-fallback',\n    }\n  }\n  if (all.kind === 'ambiguous') {\n    return { ok: false, reason: 'ambiguous', candidatesOrdinal: all.candidates.map((c) => c.ordinal) }\n  }\n  return { ok: false, reason: 'not-found' }\n}\n"]}
+{"version":3,"file":"resolve-face.js","sourceRoot":"","sources":["../../../src/topology/naming/resolve-face.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAKH,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,mBAAmB,EAAE,MAAM,SAAS,CAAA;AA4ExE;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,kBAAkB,CAAC,CAAqB;IAC/C,OAAO,CAAC,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAA;AACpE,CAAC;AAED,gDAAgD;AAChD,SAAS,eAAe,CACtB,IAAc,EACd,UAAyC,EACzC,GAAsB;IAEtB,IAAI,SAAS,GAAG,CAAC,QAAQ,CAAA;IACzB,IAAI,eAAe,GAAG,CAAC,QAAQ,CAAA;IAC/B,IAAI,IAAoC,CAAA;IACxC,MAAM,MAAM,GAA4D,EAAE,CAAA;IAC1E,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAA;QACrE,IAAI,KAAK,GAAG,SAAS;YAAE,MAAM,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAA;QAC3D,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YACtB,eAAe,GAAG,SAAS,CAAA;YAC3B,SAAS,GAAG,KAAK,CAAA;YACjB,IAAI,GAAG,CAAC,CAAA;QACV,CAAC;aAAM,IAAI,KAAK,GAAG,eAAe,EAAE,CAAC;YACnC,eAAe,GAAG,KAAK,CAAA;QACzB,CAAC;IACH,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,eAAe,EAAE,CAAA;AACrD,CAAC;AAED,2CAA2C;AAC3C,SAAS,SAAS,CAChB,IAAc,EACd,UAAyC,EACzC,GAAsB;IAEtB,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,eAAe,EAAE,GAAG,eAAe,CAAC,IAAI,EAAE,UAAU,EAAE,GAAG,CAAC,CAAA;IAC3F,IAAI,IAAI,KAAK,SAAS,IAAI,SAAS,GAAG,SAAS,EAAE,CAAC;QAChD,IAAI,SAAS,GAAG,eAAe,GAAG,mBAAmB,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3E,MAAM,WAAW,GAAG,MAAM;iBACvB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,SAAS,GAAG,mBAAmB,CAAC;iBACzD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;YAC1B,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,CAAA;QACvD,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,CAAA;IAC3C,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAA;AACzB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,GAAgB,EAChB,GAAsB;IAEtB,8BAA8B;IAC9B,MAAM,YAAY,GAAG,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAClE,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,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,CAAA;YACxB,IAAI,IAAI,EAAE,CAAC;gBACT,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,CAAA;YAClG,CAAC;QACH,CAAC;aAAM,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,CAAA;QACzC,CAAC;aAAM,CAAC;YACN,wBAAwB;YACxB,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,EAAE,GAAG,CAAC,CAAA;YACjD,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC3B,OAAO;oBACL,EAAE,EAAE,IAAI;oBACR,MAAM,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE;oBAC1C,OAAO,EAAE,KAAK,CAAC,SAAS,CAAC,OAAO;oBAChC,UAAU,EAAE,oBAAoB;iBACjC,CAAA;YACH,CAAC;YACD,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;gBAC/B,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,iBAAiB,EAAE,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAA;YACtG,CAAC;YACD,qBAAqB;QACvB,CAAC;IACH,CAAC;IAED,gBAAgB;IAChB,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;IAC/C,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACzB,OAAO;YACL,EAAE,EAAE,IAAI;YACR,MAAM,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE;YACxC,OAAO,EAAE,GAAG,CAAC,SAAS,CAAC,OAAO;YAC9B,UAAU,EAAE,oBAAoB;SACjC,CAAA;IACH,CAAC;IACD,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QAC7B,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,iBAAiB,EAAE,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAA;IACpG,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAA;AAC3C,CAAC","sourcesContent":["/**\n * resolve-face.ts — 面 TopoRef 解析（移植 brepjs shapeRefFns.resolveRef，§2.5）\n *\n * 解析策略：\n * 1. 精确：roleTable[origin][role] 的 hash 命中当前面\n *    - 恰好 1 → exact；0 → deleted；多个（1→多分裂）→ 只在这几个候选间用 hint 打分\n * 2. 几何兜底（role 缺失 / 分裂打分未命中）：在当前全部面上按 hint 打分\n *    - BREP：kernel 现场几何；mesh/primitive：命名槽面 hint 快照\n * 3. 最优分 > MIN_SCORE 且与次优差 ≥ AMBIGUITY_THRESHOLD → geometric-fallback；\n *    否则 ambiguous（并列）/ not-found（无超阈值候选）\n *\n * 任何一步定不了案就返回三态（调用方抛 TopoRefError），绝不静默拿序号硬取。\n */\n\nimport type { BrepEngineApi } from '../../brep/engine/primitives'\nimport type { BrepHandle } from '../../brep/engine/types'\nimport type { FaceHint, FaceTopoRef, RoleTable, TopoResolution } from './types'\nimport { scoreCandidate, MIN_SCORE, AMBIGUITY_THRESHOLD } from './score'\n\n/** 单个面候选：枚举序号 + 会话内 hash +（BREP 句柄 或 面行快照）。 */\nexport interface FaceCandidateEntry {\n  /** 面枚举序号（1 起，TopExp::MapShapes 序；与 FaceRow.id 的 `o1.fN` 同序）。 */\n  ordinal: number\n  /** 会话内 hash（BREP：subShapeHashes；exact 匹配用）。 */\n  hash?: number\n  /** BREP 现场句柄（exact 匹配 + 命中后回传活句柄用；打分不再优先走它）。 */\n  handle?: BrepHandle\n  /**\n   * 面行快照（存在 → 打分走 scoreCandidate row 路径）。\n   *\n   * BREP 路径也带（slot.faceHints，§3.6）：行几何与 handle 同一次 execute 产出\n   * （同帧），且 brepkit 的 kernel 现场 center 会退化（uvBounds ±1e6 哨兵 →\n   * surfaceCenterOfMass 在参数原点求值），故 `toScoringCandidate` 改为 row 优先。\n   * `axis` 与 `faceRowToHint` 入参对齐——圆柱面的轴 hint 不能丢。\n   */\n  row?: Readonly<{\n    surfaceType?: string\n    normal?: readonly number[]\n    center?: readonly number[]\n    area?: number\n    axis?: { origin?: readonly number[] | null; direction?: readonly number[] | null }\n  }>\n}\n\n/** 面解析上下文：候选表 + role 表 + kernel（BREP 现场打分用，可为 null）+ 邻接（M3）。 */\nexport interface ResolutionContext {\n  /** OCCT 内核（mesh/primitive 路径为 null——打分走 row 快照）。 */\n  readonly kernel: BrepEngineApi | null\n  /** 当前快照的全部面候选（按枚举序，ordinal 1 起）。 */\n  readonly faces: readonly FaceCandidateEntry[]\n  /** 该 part 的 RoleTable（BREP 链上的 part 有；mesh/primitive 无 → 只走几何兜底）。 */\n  readonly roleTable?: RoleTable\n  /** 边候选表（ordinal 1 起 ↔ 数组下标 0 起；edge lineage 解析用，M3）。 */\n  readonly edges?: readonly EdgeCandidateEntry[]\n  /** 顶点候选表（ordinal 1 起 ↔ 数组下标 0 起；vertex lineage 解析用，M3）。 */\n  readonly vertices?: readonly VertexCandidateEntry[]\n  /** face ordinal(1 起) → 邻接 face ordinal 列表（derived/布尔缝解析用，M3）。 */\n  readonly faceAdjacency?: ReadonlyArray<readonly number[]>\n  /** face ordinal(1 起) → 邻接 edge ordinal 列表（edge lineage 用，M3；mesh 为空 → 边 lineage 不可用）。 */\n  readonly faceEdgeAdjacency?: ReadonlyArray<readonly number[]>\n  /** edge ordinal(1 起) → 邻接 face ordinal 列表（edge lineage 用，M3）。 */\n  readonly edgeFaceAdjacency?: ReadonlyArray<readonly number[]>\n  /** face ordinal(1 起) → 邻接 vertex ordinal 列表（vertex lineage 用，M3）。 */\n  readonly faceVertexAdjacency?: ReadonlyArray<readonly number[]>\n}\n\n/** 边候选：序号 + length/midpoint hint（edge lineage 解析用，M3）。 */\nexport interface EdgeCandidateEntry {\n  /** 边枚举序号（1 起）。 */\n  ordinal: number\n  /** 会话内 hash（exact 匹配预留）。 */\n  hash?: number\n  /** BREP 现场句柄（存在 → 打分走 kernel 现场几何）。 */\n  handle?: BrepHandle\n  /** 边几何 hint（length/midpoint；候选裁决用）。 */\n  hint?: {\n    length?: number\n    midpoint?: readonly number[]\n  }\n}\n\n/** 顶点候选：序号 + position hint（vertex lineage 解析用，M3）。 */\nexport interface VertexCandidateEntry {\n  /** 顶点枚举序号（1 起）。 */\n  ordinal: number\n  /** 会话内 hash。 */\n  hash?: number\n  /** BREP 现场句柄。 */\n  handle?: BrepHandle\n  /** 顶点坐标。 */\n  position?: readonly number[]\n}\n\n/**\n * 打分候选 → 候选条目（**row 优先**、kernel 现场兜底，与 score.ts FaceCandidate 同构）。\n *\n * 曾经是 handle 优先（`c.handle !== undefined ? { handle } : { row }`），那让 BREP\n * 路径的打分一律走 kernel 现场——而 brepkit 的 `uvBounds` 对平面返回 ±1e6 哨兵，\n * `surfaceCenterOfMass` 在参数原点求值：非居中模型上 center 全错（`[20,20,0]` 退\n * 化成 `[0,0,0]`），距 hint 质心 28mm > 10mm 硬门 → 全候选被拒 →\n * `topo ref (face) not found in the current shape`（2026-10-16 装配选面 bug）。\n * 居中模型只因\"参数原点恰好等于质心\"而侥幸通过——是巧合，不是正确性。\n *\n * 行快照与 handle 同一次 execute 产出（同帧不陈旧），几何就是命名行的同一来源\n * （`geom-hint.ts` 的 `faceRowToHint`），且 derived 解析（`resolve-derived.ts` 的\n * `normalOf`）早已走 row——这里把主解析路径对齐过来。\n *\n * @param c - the face candidate entry.\n * @returns the scoring candidate (row first, live handle as fallback).\n */\nfunction toScoringCandidate(c: FaceCandidateEntry): { handle?: BrepHandle; row?: FaceCandidateEntry['row'] } {\n  return c.row !== undefined ? { row: c.row } : { handle: c.handle }\n}\n\n/** 一组候选对 hint 打分：best / secondBest / scored。 */\nfunction scoreCandidates(\n  hint: FaceHint,\n  candidates: readonly FaceCandidateEntry[],\n  ctx: ResolutionContext,\n): { scored: Array<{ candidate: FaceCandidateEntry; score: number }>; best?: FaceCandidateEntry; bestScore: number; secondBestScore: number } {\n  let bestScore = -Infinity\n  let secondBestScore = -Infinity\n  let best: FaceCandidateEntry | undefined\n  const scored: Array<{ candidate: FaceCandidateEntry; score: number }> = []\n  for (const c of candidates) {\n    const score = scoreCandidate(ctx.kernel, hint, toScoringCandidate(c))\n    if (score > MIN_SCORE) scored.push({ candidate: c, score })\n    if (score > bestScore) {\n      secondBestScore = bestScore\n      bestScore = score\n      best = c\n    } else if (score > secondBestScore) {\n      secondBestScore = score\n    }\n  }\n  return { scored, best, bestScore, secondBestScore }\n}\n\n/** 打分结果 → 三态（match / ambiguous / none）。 */\nfunction outcomeOf(\n  hint: FaceHint,\n  candidates: readonly FaceCandidateEntry[],\n  ctx: ResolutionContext,\n): { kind: 'match'; candidate: FaceCandidateEntry } | { kind: 'ambiguous'; candidates: FaceCandidateEntry[] } | { kind: 'none' } {\n  const { scored, best, bestScore, secondBestScore } = scoreCandidates(hint, candidates, ctx)\n  if (best !== undefined && bestScore > MIN_SCORE) {\n    if (bestScore - secondBestScore < AMBIGUITY_THRESHOLD && scored.length > 1) {\n      const competitive = scored\n        .filter((e) => e.score >= bestScore - AMBIGUITY_THRESHOLD)\n        .map((e) => e.candidate)\n      return { kind: 'ambiguous', candidates: competitive }\n    }\n    return { kind: 'match', candidate: best }\n  }\n  return { kind: 'none' }\n}\n\n/**\n * 解析面 TopoRef 到当前快照的序号/句柄。\n *\n * @param ref - the face TopoRef to resolve.\n * @param ctx - the resolution context (candidates + role table + kernel).\n * @returns the three-state TopoResolution.\n */\nexport function resolveFaceTopo(\n  ref: FaceTopoRef,\n  ctx: ResolutionContext,\n): TopoResolution<{ handle?: BrepHandle }> {\n  // 1. 精确：role 的追踪 hash 在候选面中命中\n  const targetHashes = ctx.roleTable?.get(ref.origin)?.get(ref.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 === 1) {\n      const [only] = survivors\n      if (only) {\n        return { ok: true, entity: { handle: only.handle }, ordinal: only.ordinal, confidence: 'exact' }\n      }\n    } else if (survivors.length === 0) {\n      return { ok: false, reason: 'deleted' }\n    } else {\n      // 1→多分裂：只在后继内裁决，不与全形状竞争\n      const split = outcomeOf(ref.hint, survivors, ctx)\n      if (split.kind === 'match') {\n        return {\n          ok: true,\n          entity: { handle: split.candidate.handle },\n          ordinal: split.candidate.ordinal,\n          confidence: 'geometric-fallback',\n        }\n      }\n      if (split.kind === 'ambiguous') {\n        return { ok: false, reason: 'ambiguous', candidatesOrdinal: split.candidates.map((c) => c.ordinal) }\n      }\n      // 'none' → 落到全形状几何兜底\n    }\n  }\n\n  // 2. 几何兜底：全形状打分\n  const all = outcomeOf(ref.hint, ctx.faces, ctx)\n  if (all.kind === 'match') {\n    return {\n      ok: true,\n      entity: { handle: all.candidate.handle },\n      ordinal: all.candidate.ordinal,\n      confidence: 'geometric-fallback',\n    }\n  }\n  if (all.kind === 'ambiguous') {\n    return { ok: false, reason: 'ambiguous', candidatesOrdinal: all.candidates.map((c) => c.ordinal) }\n  }\n  return { ok: false, reason: 'not-found' }\n}\n"]}

package/dist/weapp.d.ts

@@ -15,7 +15,7 @@ export * from './env-agnostic.js';
 export { setBrepkitWasmInitFn, initBrepkitWasm, isBrepkitInitialized } from './brepkit-kernel/brepkitWasm.js';
 export { registerBrepkitBrepEngine, BREPKIT_BREP_ENGINE_ID, ensureBrepkitDefaultEngine } from './brep/engine/adapters/brepkit.js';
 export { registerBrepkitMeshEngine, BREPKIT_MESH_ENGINE_ID, ensureBrepkitMeshBackend } from './brep/engine/adapters/brepkit.js';
-export { registerBrepEngine, hasBrepEngine, getBrepEngine, getActiveBrepEngineId, freezeEngineRegistries, registerMeshEngine, getMeshEngine, getActiveMeshEngineId, isMeshEngineRegistered, getMeshSolidBackend } from './brep/engine/registry.js';
+export { registerBrepEngine, getBrepEngine, getActiveBrepEngine, hasBrepEngine, getActiveBrepEngineId, freezeEngineRegistries, registerMeshEngine, getMeshEngine, getActiveMeshEngine, getActiveMeshEngineId, isMeshEngineRegistered, getMeshSolidBackend } from './brep/engine/registry.js';
 export type { BrepEngine, BrepEngineProvider, MeshEngine } from './brep/engine/registry.js';
 export type { BrepEngineApi } from './brep/engine/primitives.js';
 export { MeshSolidRegistry, normalizeMeshSolid, describeMeshSolid, buildMeshSolidTopology, weldToleranceFor } from './brep/mesh-solid.js';

package/dist/weapp.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"weapp.d.ts","sourceRoot":"","sources":["../src/weapp.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAIH,cAAc,gBAAgB,CAAA;AAG9B,OAAO,EAAE,oBAAoB,EAAE,eAAe,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAA;AAG1G,OAAO,EAAE,yBAAyB,EAAE,sBAAsB,EAAE,0BAA0B,EAAE,MAAM,gCAAgC,CAAA;AAG9H,OAAO,EAAE,yBAAyB,EAAE,sBAAsB,EAAE,wBAAwB,EAAE,MAAM,gCAAgC,CAAA;AAG5H,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAE,aAAa,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,kBAAkB,EAAE,aAAa,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAA;AAC/O,YAAY,EAAE,UAAU,EAAE,kBAAkB,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAA;AACxF,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAA;AAE7D,OAAO,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAA;AACtI,YAAY,EACV,gBAAgB,EAAE,eAAe,EAAE,kBAAkB,EAAE,cAAc,EAAE,yBAAyB,GACjG,MAAM,mBAAmB,CAAA;AAC1B,OAAO,EAAE,wBAAwB,EAAE,MAAM,gCAAgC,CAAA;AAIzE,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAA;AACrD,YAAY,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAA"}
+{"version":3,"file":"weapp.d.ts","sourceRoot":"","sources":["../src/weapp.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAIH,cAAc,gBAAgB,CAAA;AAG9B,OAAO,EAAE,oBAAoB,EAAE,eAAe,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAA;AAG1G,OAAO,EAAE,yBAAyB,EAAE,sBAAsB,EAAE,0BAA0B,EAAE,MAAM,gCAAgC,CAAA;AAG9H,OAAO,EAAE,yBAAyB,EAAE,sBAAsB,EAAE,wBAAwB,EAAE,MAAM,gCAAgC,CAAA;AAG5H,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAE,mBAAmB,EAAE,aAAa,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,kBAAkB,EAAE,aAAa,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAA;AACzR,YAAY,EAAE,UAAU,EAAE,kBAAkB,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAA;AACxF,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAA;AAE7D,OAAO,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAA;AACtI,YAAY,EACV,gBAAgB,EAAE,eAAe,EAAE,kBAAkB,EAAE,cAAc,EAAE,yBAAyB,GACjG,MAAM,mBAAmB,CAAA;AAC1B,OAAO,EAAE,wBAAwB,EAAE,MAAM,gCAAgC,CAAA;AAIzE,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAA;AACrD,YAAY,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAA"}

package/dist/weapp.js

@@ -22,7 +22,7 @@ export { registerBrepkitBrepEngine, BREPKIT_BREP_ENGINE_ID, ensureBrepkitDefault
 // `cad.load` 的 STL/3MF 路径就产出「网格实体 + 近似拓扑」。
 export { registerBrepkitMeshEngine, BREPKIT_MESH_ENGINE_ID, ensureBrepkitMeshBackend } from './brep/engine/adapters/brepkit.js';
 // BREP 引擎注册表（环境无关；ensureBrepChain 见已注册引擎即跳过 OCCT）
-export { registerBrepEngine, hasBrepEngine, getBrepEngine, getActiveBrepEngineId, freezeEngineRegistries, registerMeshEngine, getMeshEngine, getActiveMeshEngineId, isMeshEngineRegistered, getMeshSolidBackend } from './brep/engine/registry.js';
+export { registerBrepEngine, getBrepEngine, getActiveBrepEngine, hasBrepEngine, getActiveBrepEngineId, freezeEngineRegistries, registerMeshEngine, getMeshEngine, getActiveMeshEngine, getActiveMeshEngineId, isMeshEngineRegistered, getMeshSolidBackend } from './brep/engine/registry.js';
 // 网格实体（近似拓扑的载体）：端口 + 注册表 + 驱动。
 export { MeshSolidRegistry, normalizeMeshSolid, describeMeshSolid, buildMeshSolidTopology, weldToleranceFor } from './brep/mesh-solid.js';
 export { assertShapeSlotExclusive } from './cad-runtime/backend-dispatch.js';

package/dist/weapp.js.map

@@ -1 +1 @@
-{"version":3,"file":"weapp.js","sourceRoot":"","sources":["../src/weapp.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,sEAAsE;AACtE,wDAAwD;AACxD,cAAc,gBAAgB,CAAA;AAE9B,8DAA8D;AAC9D,OAAO,EAAE,oBAAoB,EAAE,eAAe,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAA;AAE1G,gDAAgD;AAChD,OAAO,EAAE,yBAAyB,EAAE,sBAAsB,EAAE,0BAA0B,EAAE,MAAM,gCAAgC,CAAA;AAC9H,kDAAkD;AAClD,2CAA2C;AAC3C,OAAO,EAAE,yBAAyB,EAAE,sBAAsB,EAAE,wBAAwB,EAAE,MAAM,gCAAgC,CAAA;AAE5H,kDAAkD;AAClD,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAE,aAAa,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,kBAAkB,EAAE,aAAa,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAA;AAG/O,+BAA+B;AAC/B,OAAO,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAA;AAItI,OAAO,EAAE,wBAAwB,EAAE,MAAM,gCAAgC,CAAA;AAEzE,2DAA2D;AAC3D,+CAA+C;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAA","sourcesContent":["/**\n * @faicad/faijs-core/weapp — weapp 专用宿主入口\n *\n * 小程序（无 OCCT 环境）宿主的最小导出面：brepkit wasm 装载注入点 + brepkit BREP\n * 引擎注册 + 环境无关执行栈。全部为 re-export，零新实现。\n *\n * 为什么独立成入口：browser umbrella 曾 re-export brepkit 符号，导致 web 端模块图\n * 包含 brepkitWasm.js（其 node 分支 import('brepkit-wasm') 被 vite 静态解析而报错）。\n * 宿主边界必须由静态入口声明，而不是靠构建脚本事后 stub 剔除。\n *\n * 导出面受 entry-boundary.test.ts 白名单守卫约束——新增导出必须同步更新白名单。\n * web/desktop 宿主禁止 import 本入口（brepkit 是 weapp 专属 BREP 引擎）。\n */\n\n// 共享面（env-agnostic：identity + runtime-state + lang/*）——三处 umbrella 统一\n// re-export（§9.1），weapp worker 由此获得 analyzeCode 等语言层符号。\nexport * from './env-agnostic'\n\n// brepkit wasm 装载（weapp 专属注入点；宿主装配期调用一次 setBrepkitWasmInitFn）\nexport { setBrepkitWasmInitFn, initBrepkitWasm, isBrepkitInitialized } from './brepkit-kernel/brepkitWasm'\n\n// brepkit BREP 引擎注册（weapp 只注册 brepkit，不注册 occt）\nexport { registerBrepkitBrepEngine, BREPKIT_BREP_ENGINE_ID, ensureBrepkitDefaultEngine } from './brep/engine/adapters/brepkit'\n// brepkit 网格实体后端（网格语义路径；与 BREP 槽独立注册）。weapp 侧装了它，\n// `cad.load` 的 STL/3MF 路径就产出「网格实体 + 近似拓扑」。\nexport { registerBrepkitMeshEngine, BREPKIT_MESH_ENGINE_ID, ensureBrepkitMeshBackend } from './brep/engine/adapters/brepkit'\n\n// BREP 引擎注册表（环境无关；ensureBrepChain 见已注册引擎即跳过 OCCT）\nexport { registerBrepEngine, hasBrepEngine, getBrepEngine, getActiveBrepEngineId, freezeEngineRegistries, registerMeshEngine, getMeshEngine, getActiveMeshEngineId, isMeshEngineRegistered, getMeshSolidBackend } from './brep/engine/registry'\nexport type { BrepEngine, BrepEngineProvider, MeshEngine } from './brep/engine/registry'\nexport type { BrepEngineApi } from './brep/engine/primitives'\n// 网格实体（近似拓扑的载体）：端口 + 注册表 + 驱动。\nexport { MeshSolidRegistry, normalizeMeshSolid, describeMeshSolid, buildMeshSolidTopology, weldToleranceFor } from './brep/mesh-solid'\nexport type {\n  MeshSolidBackend, MeshSolidResult, MeshSolidKernelOps, MeshSolidInput, MeshSolidNormalizeOptions,\n} from './brep/mesh-solid'\nexport { assertShapeSlotExclusive } from './cad-runtime/backend-dispatch'\n\n// cad-runtime（环境无关执行栈）：createRuntime 为 with-cad 变体（§9.2），与\n// browser/node 入口同口径——自带 cad 命名空间注册，宿主无需手工补注册。\nexport { createRuntime } from './cad-runtime/runtime'\nexport type { CadRuntime } from './cad-runtime/runtime'\n"]}
+{"version":3,"file":"weapp.js","sourceRoot":"","sources":["../src/weapp.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,sEAAsE;AACtE,wDAAwD;AACxD,cAAc,gBAAgB,CAAA;AAE9B,8DAA8D;AAC9D,OAAO,EAAE,oBAAoB,EAAE,eAAe,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAA;AAE1G,gDAAgD;AAChD,OAAO,EAAE,yBAAyB,EAAE,sBAAsB,EAAE,0BAA0B,EAAE,MAAM,gCAAgC,CAAA;AAC9H,kDAAkD;AAClD,2CAA2C;AAC3C,OAAO,EAAE,yBAAyB,EAAE,sBAAsB,EAAE,wBAAwB,EAAE,MAAM,gCAAgC,CAAA;AAE5H,kDAAkD;AAClD,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAE,mBAAmB,EAAE,aAAa,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,kBAAkB,EAAE,aAAa,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAA;AAGzR,+BAA+B;AAC/B,OAAO,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAA;AAItI,OAAO,EAAE,wBAAwB,EAAE,MAAM,gCAAgC,CAAA;AAEzE,2DAA2D;AAC3D,+CAA+C;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAA","sourcesContent":["/**\n * @faicad/faijs-core/weapp — weapp 专用宿主入口\n *\n * 小程序（无 OCCT 环境）宿主的最小导出面：brepkit wasm 装载注入点 + brepkit BREP\n * 引擎注册 + 环境无关执行栈。全部为 re-export，零新实现。\n *\n * 为什么独立成入口：browser umbrella 曾 re-export brepkit 符号，导致 web 端模块图\n * 包含 brepkitWasm.js（其 node 分支 import('brepkit-wasm') 被 vite 静态解析而报错）。\n * 宿主边界必须由静态入口声明，而不是靠构建脚本事后 stub 剔除。\n *\n * 导出面受 entry-boundary.test.ts 白名单守卫约束——新增导出必须同步更新白名单。\n * web/desktop 宿主禁止 import 本入口（brepkit 是 weapp 专属 BREP 引擎）。\n */\n\n// 共享面（env-agnostic：identity + runtime-state + lang/*）——三处 umbrella 统一\n// re-export（§9.1），weapp worker 由此获得 analyzeCode 等语言层符号。\nexport * from './env-agnostic'\n\n// brepkit wasm 装载（weapp 专属注入点；宿主装配期调用一次 setBrepkitWasmInitFn）\nexport { setBrepkitWasmInitFn, initBrepkitWasm, isBrepkitInitialized } from './brepkit-kernel/brepkitWasm'\n\n// brepkit BREP 引擎注册（weapp 只注册 brepkit，不注册 occt）\nexport { registerBrepkitBrepEngine, BREPKIT_BREP_ENGINE_ID, ensureBrepkitDefaultEngine } from './brep/engine/adapters/brepkit'\n// brepkit 网格实体后端（网格语义路径；与 BREP 槽独立注册）。weapp 侧装了它，\n// `cad.load` 的 STL/3MF 路径就产出「网格实体 + 近似拓扑」。\nexport { registerBrepkitMeshEngine, BREPKIT_MESH_ENGINE_ID, ensureBrepkitMeshBackend } from './brep/engine/adapters/brepkit'\n\n// BREP 引擎注册表（环境无关；ensureBrepChain 见已注册引擎即跳过 OCCT）\nexport { registerBrepEngine, getBrepEngine, getActiveBrepEngine, hasBrepEngine, getActiveBrepEngineId, freezeEngineRegistries, registerMeshEngine, getMeshEngine, getActiveMeshEngine, getActiveMeshEngineId, isMeshEngineRegistered, getMeshSolidBackend } from './brep/engine/registry'\nexport type { BrepEngine, BrepEngineProvider, MeshEngine } from './brep/engine/registry'\nexport type { BrepEngineApi } from './brep/engine/primitives'\n// 网格实体（近似拓扑的载体）：端口 + 注册表 + 驱动。\nexport { MeshSolidRegistry, normalizeMeshSolid, describeMeshSolid, buildMeshSolidTopology, weldToleranceFor } from './brep/mesh-solid'\nexport type {\n  MeshSolidBackend, MeshSolidResult, MeshSolidKernelOps, MeshSolidInput, MeshSolidNormalizeOptions,\n} from './brep/mesh-solid'\nexport { assertShapeSlotExclusive } from './cad-runtime/backend-dispatch'\n\n// cad-runtime（环境无关执行栈）：createRuntime 为 with-cad 变体（§9.2），与\n// browser/node 入口同口径——自带 cad 命名空间注册，宿主无需手工补注册。\nexport { createRuntime } from './cad-runtime/runtime'\nexport type { CadRuntime } from './cad-runtime/runtime'\n"]}

package/package.json

@@ -1,6 +1,11 @@
 {
   "name": "@faicad/faijs",
-  "version": "0.33.2",
+  "version": "0.35.8",
+  "faijs": {
+    "lib": {
+      "role": "host"
+    }
+  },
   "type": "module",
   "license": "Apache-2.0",
   "repository": {
@@ -22,6 +27,10 @@
       "types": "./dist/api/cadquery-selectors/index.d.ts",
       "default": "./dist/api/cadquery-selectors/index.js"
     },
+    "./api/view": {
+      "types": "./dist/api/view/index.d.ts",
+      "default": "./dist/api/view/index.js"
+    },
     "./api/*": {
       "types": "./dist/api/*.d.ts",
       "default": "./dist/api/*.js"
@@ -86,14 +95,6 @@
       "types": "./dist/mesh/boolean.d.ts",
       "default": "./dist/mesh/boolean.js"
     },
-    "./mesh/decoration-provider": {
-      "types": "./dist/mesh/decoration-provider.d.ts",
-      "default": "./dist/mesh/decoration-provider.js"
-    },
-    "./mesh/engrave": {
-      "types": "./dist/mesh/engrave.d.ts",
-      "default": "./dist/mesh/engrave.js"
-    },
     "./mesh/stl-loader": {
       "types": "./dist/mesh/stl-loader.d.ts",
       "default": "./dist/mesh/stl-loader.js"
@@ -250,6 +251,10 @@
       "types": "./dist/brepkit-kernel/brepkitWasm.d.ts",
       "default": "./dist/brepkit-kernel/brepkitWasm.js"
     },
+    "./brepkit-kernel/brepkitKernel": {
+      "types": "./dist/brepkit-kernel/brepkitKernel.d.ts",
+      "default": "./dist/brepkit-kernel/brepkitKernel.js"
+    },
     "./primitives/brep-primitives": {
       "types": "./dist/primitives/brep-primitives.d.ts",
       "default": "./dist/primitives/brep-primitives.js"
@@ -326,6 +331,10 @@
       "types": "./dist/occt-kernel/occtKernel.d.ts",
       "default": "./dist/occt-kernel/occtKernel.js"
     },
+    "./occt-kernel/occt-primitives": {
+      "types": "./dist/occt-kernel/occt-primitives.d.ts",
+      "default": "./dist/occt-kernel/occt-primitives.js"
+    },
     "./occt-kernel/topologyExt": {
       "types": "./dist/occt-kernel/topologyExt.d.ts",
       "default": "./dist/occt-kernel/topologyExt.js"
@@ -409,6 +418,26 @@
     "./units": {
       "types": "./dist/units.d.ts",
       "default": "./dist/units.js"
+    },
+    "./sketch": {
+      "types": "./dist/sketch/index.d.ts",
+      "default": "./dist/sketch/index.js"
+    },
+    "./sketch/node": {
+      "types": "./dist/sketch/node.d.ts",
+      "default": "./dist/sketch/node.js"
+    },
+    "./extra": {
+      "types": "./dist/extra/index.d.ts",
+      "default": "./dist/extra/index.js"
+    },
+    "./extra/browser": {
+      "types": "./dist/extra/browser.d.ts",
+      "default": "./dist/extra/browser.js"
+    },
+    "./extra/editor-ops": {
+      "types": "./dist/extra/editor-ops.d.ts",
+      "default": "./dist/extra/editor-ops.js"
     }
   },
   "files": [
@@ -420,14 +449,16 @@
     "@xmldom/xmldom": "^0.9.8",
     "acorn": "^8.18.0",
     "fflate": "^0.8.3",
+    "@salusoft89/planegcs": "^1.2.0",
     "manifold-3d": "^3.5.1",
-    "opentype.js": "^1.3.4"
+    "opentype.js": "^1.3.4",
+    "brepkit-wasm": "^4.1.49"
   },
   "peerDependencies": {
     "occt-wasm": "^5.6.0"
   },
   "devDependencies": {
-    "@faicad/brepkit2-wasm": "^2.130.0",
+    "@faicad/brepkit2-wasm": "^2.131.0",
     "@types/three": "^0.184.1",
     "sucrase": "^3.35.1",
     "three-162": "npm:three@^0.162.0",
@@ -438,6 +469,7 @@
     "build": "tsc -p tsconfig.build.json && node ../../scripts/fix-import-extensions.mjs dist",
     "typecheck": "tsc --noEmit",
     "test": "vitest run",
+    "test:install": "vitest run -c vitest.install.config.ts",
     "lint": "eslint src",
     "gen:capability-map": "tsx scripts/gen-capability-map.ts",
     "gen:brepkit-surface": "tsx scripts/gen-brepkit-surface.ts",