M6(2/n): 治理台九功能 + SSE 订阅层 + 读/治分权

治理台按 §9.1 拆成九个 gov-* feature,共用件落 shared/gov: · 外壳(左轨/顶栏/面包屑/页签/整页下钻)自原型 Governance.tsx 平移, DOM 与 g-* 类名原样;路由状态即应用状态,区/页签/下钻栈全编码进 hash 可深链 · 编排画布 diagram-js 画布件 1:1 平移(flow-layout/flow-node-paint/FlowDiagram), 新增 pkg-to-graph 把 ProcessPackage 转成画布图模型;统一报价 v1 全图 12 节点 15 边渲染通过 · 后端补四路由:审批单 / 工作流下钻 / 通道实例 / 度量仪表 SSE 订阅层(§9.2):app 层单一连接,按信封目标失效缓存; 组件不再自行轮询(去掉 refetchInterval)。广播只说「哪个目标动了」,不带业务载荷, 且在投递已落库已送达之后才发 —— 不是第二条投递链路。两处实质修正: · 治理路由一律要 govern → 读路由改要 read。客体三类 × 动作三种的分法就是为此: BD 有 task:read 能看在途、动不了控制事件;一律 govern 等于把三种动作压成一种 · 控制事件/恢复/改派原记为 engine-transition(归机器产出)→ 新增 control 条目种类, 归人裁决侧。归侧是按动作类型的纯推导,所以「谁干的」必须体现在 kind 上; 否则人的叫停会被算进自主率的机器分子判据 ⑩ 治理台一半跑通:在途监控 / 叫停 / 恢复,治理动作留痕可查。无权查看不再画成空清单,按岗位说明缺哪一项。 gates: tsc / eslint / depcruise(286 模块)/ api-report / 360 测试全绿 Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01KeDBx2PHLavbURXB8LJJ7m
2026-07-27 03:28:40 +08:00
parent 594a0a9ca0
commit a9cd6d10c7
47 changed files with 7272 additions and 11 deletions
@@ -0,0 +1,111 @@
+/**
+ * 流程包 → 画布图模型:**连线即映射**的可视一侧。
+ *
+ * 画布件(`flow-layout` / `flow-node-paint` / `FlowDiagram`)是框架无关的纯几何与画笔,
+ * 它认的是 `FlowGraph`;我们的权威模型是 `ProcessPackage`。这里做且只做一次形状转换,
+ * **不产生任何新语义** —— 节点仍是编排层五要素,审批点仍是系统内置人裁节点(共用方框几何而已)。
+ */
+import type { ProcessPackage } from '@contracts';
+import type { FlowEdge, FlowGraph, FlowNode } from './flow-layout.ts';
+
+/** 节点实例落位:running / waiting / terminal 决定描边高亮,不改几何 */
+export type InstanceMark = {
+  readonly nodeId: string;
+  readonly running: boolean;
+  readonly waiting: boolean;
+  readonly activated: boolean;
+  readonly terminal?: string | undefined;
+};
+
+/** 每行最多几个方框 —— 蛇形折行的行宽;取原型 business 预设的观感 */
+const ROW_WIDTH = 4;
+
+export function packageToGraph(pkg: ProcessPackage, marks: readonly InstanceMark[] = []): FlowGraph {
+  const markOf = new Map(marks.map((m) => [m.nodeId, m]));
+
+  const nodes: FlowNode[] = pkg.nodes.map((n) => {
+    const mark = markOf.get(n.id);
+    const state =
+      mark === undefined || !mark.activated
+        ? undefined
+        : mark.terminal !== undefined
+          ? mark.terminal === 'released'
+            ? '已放行'
+            : '已终止'
+          : mark.running
+            ? '运行中'
+            : mark.waiting
+              ? '等待中'
+              : '已激活';
+
+    if (n.kind === 'gateway') {
+      return {
+        id: n.id,
+        kind: 'gateway',
+        label: n.label,
+        // 并行网关画 +,异或网关画 ×(判断)
+        mode: n.gateway === 'parallel' ? 'and' : 'x',
+        ...(n.mode === 'join' ? { sub: '汇合' } : { sub: '分叉' }),
+        ...(state === undefined ? {} : { note: state }),
+      };
+    }
+
+    if (n.kind === 'start') return { id: n.id, kind: 'start', label: n.label };
+    if (n.kind === 'end') return { id: n.id, kind: 'end', label: n.label };
+
+    const base: FlowNode = {
+      id: n.id,
+      kind: 'activity',
+      label: n.label,
+      code: n.id,
+      ...(state === undefined ? {} : { note: state }),
+    };
+    if (n.kind === 'approval') {
+      // approval **不是一种活动**:它挂在 kind:"activity" 下仅因共用同一套方框几何
+      return { ...base, flavor: 'approval', owner: n.approver.position };
+    }
+    return { ...base, owner: n.owner.position };
+  });
+
+  /** 蛇形折行:偶数行 L→R、奇数行 R→L —— 行的划分交给拓扑序 */
+  const order = topologicalOrder(pkg);
+  const rows: string[][] = [];
+  for (let i = 0; i < order.length; i += ROW_WIDTH) rows.push(order.slice(i, i + ROW_WIDTH));
+
+  const edges: FlowEdge[] = pkg.edges.map((e) => ({
+    from: e.from,
+    to: e.to,
+    // 回边按声明走「回 A4 重开新实例」,视觉上标红以区分正向流转
+    ...(e.reopen ? { tone: 'bad' as const } : {}),
+    ...(e.label === undefined ? (e.condition === undefined ? {} : { label: e.condition }) : { label: e.label }),
+  }));
+
+  return { nodes, rows, anchors: [], edges };
+}
+
+/** 拓扑序:回边不参与定序(否则成环),同层按声明顺序稳定排列 */
+function topologicalOrder(pkg: ProcessPackage): string[] {
+  const ids = pkg.nodes.map((n) => n.id as string);
+  const forward = pkg.edges.filter((e) => !e.reopen);
+  const indegree = new Map<string, number>(ids.map((id) => [id, 0]));
+  for (const e of forward) indegree.set(e.to, (indegree.get(e.to) ?? 0) + 1);
+
+  const ready = ids.filter((id) => indegree.get(id) === 0);
+  const out: string[] = [];
+  const seen = new Set<string>();
+
+  while (ready.length > 0) {
+    const id = ready.shift()!;
+    if (seen.has(id)) continue;
+    seen.add(id);
+    out.push(id);
+    for (const e of forward.filter((x) => x.from === id)) {
+      const left = (indegree.get(e.to) ?? 0) - 1;
+      indegree.set(e.to, left);
+      if (left === 0) ready.push(e.to);
+    }
+  }
+  // 环(理论上闭合校验已挡住)或孤点:兜底补齐,画布不因数据异常而空白
+  for (const id of ids) if (!seen.has(id)) out.push(id);
+  return out;
+}