agentworkshop 0.7.66 → 0.7.71

package/server/services/workshop/eda/mes-console.ts

@@ -0,0 +1,219 @@
+/**
+ * MES 调试台用户面服务(plan1 BLOCKER B2 修正)。
+ *
+ * Agent 面的 mes-controller 授权口径是 agentId→dcw 绑定(人类没有绑定,直接复用
+ * 会全 403 或被迫伪造 agentId);限流也按 agentId 记账。用户面在这里单独收敛:
+ *  - 可见点 = 可读产线(readonly 及以上)上的 mes-rest 节点(跨线/孤儿不可见);
+ *  - 频控按 userId 独立记账(30 次/60s,Agent 面的 6 次/60s 是对话节奏,对调试台过苛);
+ *  - 取数直接走驱动结构化接口 fetchHistory(onRows 回调),不经 controller 的
+ *    Agent 向 prose 组装 —— preview 需要结构化统计/采样,不是一次调用能复用的。
+ *  - req 回显一律过 redactHeaders/redactQuery(凭据零透出,B3);driverConfig 原文绝不回显。
+ */
+import type { ResolvedUser } from '@/server/api/workshop/caller'
+import { lineMode } from '../permissions'
+import { getDcwNodeRepo } from '../dcw/dcw-node.repo'
+import { resolveDcwDriver } from '../dcw/drivers'
+import { historyFormatOf } from '../dcw/drivers/mes-rest'
+import { mesDictionaryOfNode } from '../mes/mes-controller'
+import { recordOps } from '../ops/ops'
+import { redactHeaders, redactQuery } from './redact'
+
+const WINDOW_MAX_MS = 7 * 24 * 3600_000
+const ROWS_MAX = 5000
+const SAMPLE_ROWS = 3
+
+// ===== userId 频控(30 次/60s) =====
+const rateStamps = new Map<string, number[]>()
+
+export function mesUserRateReset(): void {
+  rateStamps.clear()
+}
+
+function rateCheck(userId: string): boolean {
+  const now = Date.now()
+  const stamps = (rateStamps.get(userId) ?? []).filter(t => now - t < 60_000)
+  if (stamps.length >= 30) {
+    rateStamps.set(userId, stamps)
+    return false
+  }
+  stamps.push(now)
+  rateStamps.set(userId, stamps)
+  return true
+}
+
+/** 用户可读产线上的 mes-rest 点位(调试台目录面) */
+export function visibleMesNodesForUser(user: ResolvedUser): Array<{ id: string, name: string, lineId: string, unit: string, hasHistory: boolean, format: string }> {
+  const out: Array<{ id: string, name: string, lineId: string, unit: string, hasHistory: boolean, format: string }> = []
+  for (const n of getDcwNodeRepo().all()) {
+    if (n.driver !== 'mes-rest' || !n.enabled) continue
+    if (lineMode(user, n.lineId) === 'none') continue
+    const cfg = n.driverConfig ?? {}
+    out.push({
+      id: n.id,
+      name: n.name,
+      lineId: n.lineId ?? '',
+      unit: n.unit ?? '',
+      hasHistory: Boolean(cfg.historyMap),
+      format: historyFormatOf(cfg as Record<string, unknown>),
+    })
+  }
+  return out
+}
+
+function readableMesNode(user: ResolvedUser, nodeId: string) {
+  const node = getDcwNodeRepo().byId(nodeId)
+  if (!node || node.driver !== 'mes-rest' || !node.enabled) return null
+  if (lineMode(user, node.lineId) === 'none') return null
+  return node
+}
+
+export interface MesPreviewResult {
+  nodeId: string
+  nodeName: string
+  format: string
+  window: { from: string, to: string }
+  totalRows: number
+  complete: boolean
+  stats: { min: number | null, max: number | null, mean: number | null, std: number | null }
+  sample: string[]
+  dictionary: Array<{ field: string, label?: string, unit?: string, description?: string }>
+  requestEcho: { method: string, path: string, query: Record<string, string>, headers: Record<string, string> }
+}
+
+/**
+ * 点位历史取数预览(结构化):统计 + ≤3 行采样 + 字段字典 + 脱敏 req 回显。
+ * 标量/向量给出数值统计;图像/表格/事件只给行数与记录摘要(像素/大字段不进响应)。
+ */
+export async function mesPreview(user: ResolvedUser, args: {
+  nodeId: string
+  fromIso: string
+  toIso: string
+  maxRows?: number
+}): Promise<{ ok: true, data: MesPreviewResult } | { ok: false, status: number, code: string, message: string }> {
+  if (!rateCheck(user.id)) {
+    return { ok: false, status: 429, code: 'MES_RATE_LIMITED', message: 'MES 调试台取数过于频繁(每分钟 30 次),请稍后再试。' }
+  }
+  const node = readableMesNode(user, args.nodeId)
+  if (!node) {
+    return { ok: false, status: 403, code: 'SCOPE_VIOLATION', message: '点位不存在、未启用或不在你的可读产线上。' }
+  }
+  const cfg = node.driverConfig ?? {}
+  if (!cfg.historyMap) {
+    return { ok: false, status: 400, code: 'BAD_REQUEST', message: '该点位未配置历史映射(historyMap),无法取数。' }
+  }
+  const fromMs = Date.parse(args.fromIso)
+  const toMs = Date.parse(args.toIso)
+  if (!Number.isFinite(fromMs) || !Number.isFinite(toMs) || fromMs >= toMs) {
+    return { ok: false, status: 400, code: 'VALIDATION_ERROR', message: 'from/to 必须是合法时间且 from < to。' }
+  }
+  if (toMs - fromMs > WINDOW_MAX_MS) {
+    return { ok: false, status: 400, code: 'VALIDATION_ERROR', message: '时间窗超限(最大 7 天),请缩小窗口。' }
+  }
+  const maxRows = Math.min(Math.max(Math.round(Number(args.maxRows)) || 1000, 1), ROWS_MAX)
+
+  // req 回显(脱敏):historyMap 的 path/query/headers 模板;baseUrl 属节点配置可见面,一并给出
+  let requestEcho: MesPreviewResult['requestEcho'] = { method: 'GET', path: '', query: {}, headers: {} }
+  try {
+    const map = JSON.parse(String(cfg.historyMap)) as { method?: string, path?: string, query?: Record<string, unknown>, headers?: Record<string, unknown> }
+    requestEcho = {
+      method: String(map.method ?? 'GET').toUpperCase(),
+      path: String(map.path ?? ''),
+      query: redactQuery(map.query ?? {}),
+      headers: redactHeaders(map.headers ?? {}),
+    }
+  }
+  catch { /* historyMap 非法 JSON:驱动取数时会报 400,这里回显留空 */ }
+
+  const rows: Array<Record<string, unknown>> = []
+  const driver = resolveDcwDriver('mes-rest')
+  if (!driver.fetchHistory) {
+    return { ok: false, status: 503, code: 'UNAVAILABLE', message: 'mes-rest 驱动不支持历史取数。' }
+  }
+  let complete: boolean
+  let dictionary: MesPreviewResult['dictionary']
+  try {
+    const r = await driver.fetchHistory({
+      driverConfig: cfg as Record<string, unknown>,
+      fromIso: new Date(fromMs).toISOString(),
+      toIso: new Date(toMs).toISOString(),
+      maxRows,
+      onRows: (batch) => {
+        for (const row of batch) {
+          if (rows.length >= maxRows) return
+          // 像素/大字段不进响应:图像只留 mime 与长度摘要,表格/事件留 JSON 的键名骨架
+          if (row.data != null) {
+            rows.push({ ts: row.ts, mime: row.mime ?? 'image/png', bytes: Math.round((row.data.length * 3) / 4) })
+            return
+          }
+          if (row.record != null) {
+            rows.push({ ts: row.ts, record: row.record })
+            return
+          }
+          rows.push({ ts: row.ts, value: row.value, values: row.values })
+        }
+      },
+    })
+    complete = r.complete
+    dictionary = (r.dictionary ?? mesDictionaryOfNode(node.id, cfg as Record<string, unknown>))
+      .slice(0, 24)
+      .map(d => ({ field: d.field, label: d.label || undefined, unit: d.unit || undefined, description: d.description?.slice(0, 160) || undefined }))
+  }
+  catch (err) {
+    return { ok: false, status: 502, code: 'MES_HTTP_ERROR', message: `MES 取数失败:${err instanceof Error ? err.message : String(err)}` }
+  }
+
+  // 统计(标量数值面;向量取逐行均值)
+  const vals: number[] = []
+  for (const r of rows) {
+    if (typeof r.value === 'number' && Number.isFinite(r.value)) vals.push(r.value)
+    else if (Array.isArray(r.values)) {
+      const nums = r.values.filter((v): v is number => typeof v === 'number' && Number.isFinite(v))
+      if (nums.length) vals.push(nums.reduce((a, b) => a + b, 0) / nums.length)
+    }
+  }
+  const mean = vals.length ? vals.reduce((a, b) => a + b, 0) / vals.length : null
+  const std = vals.length > 1 && mean != null
+    ? Math.sqrt(vals.reduce((a, b) => a + (b - mean) ** 2, 0) / vals.length)
+    : null
+  const sample = rows.slice(0, SAMPLE_ROWS).map((r) => {
+    if (r.values != null) {
+      const v = r.values as number[]
+      return `${String(r.ts).slice(11, 19)} [${v.slice(0, 4).map(x => Number(x.toFixed(3))).join(',')}${v.length > 4 ? `,…(${v.length} 点)` : ''}]`
+    }
+    if (r.record != null) return `${String(r.ts).slice(11, 19)} ${JSON.stringify(r.record).slice(0, 120)}`
+    if (r.bytes != null) return `${String(r.ts).slice(11, 19)} <图像 ${r.mime} ${r.bytes}B>`
+    return `${String(r.ts).slice(11, 19)} ${typeof r.value === 'number' ? Number(r.value.toFixed(4)) : '?'}${node.unit ?? ''}`
+  })
+
+  // plan1 §5.4 埋点:调试台取数留痕(who/which point/window;不含任何取回数据)
+  try {
+    recordOps({
+      actor: user.id, actorName: user.name, actorKind: 'user',
+      action: 'mes.preview', kind: 'daq', targetKind: 'daq', targetId: node.id,
+      lineId: node.lineId ?? '', scope: 'line',
+      summary: `MES 调试台取数预览:${node.name}(${rows.length} 行,${new Date(fromMs).toISOString().slice(0, 16)} 起)`,
+      detail: { nodeId: node.id, rows: rows.length },
+    })
+  }
+  catch { /* 埋点失败不影响取数 */ }
+  return {
+    ok: true,
+    data: {
+      nodeId: node.id,
+      nodeName: node.name,
+      format: historyFormatOf(cfg as Record<string, unknown>),
+      window: { from: new Date(fromMs).toISOString(), to: new Date(toMs).toISOString() },
+      totalRows: rows.length,
+      complete,
+      stats: {
+        min: vals.length ? Math.min(...vals) : null,
+        max: vals.length ? Math.max(...vals) : null,
+        mean,
+        std,
+      },
+      sample,
+      dictionary,
+      requestEcho,
+    },
+  }
+}

package/server/services/workshop/eda/ocap.ts

@@ -0,0 +1,182 @@
+/**
+ * E7 OCAP —— 越限处置记录(Alarm→OCAP 闭环的人为处置面)。
+ *
+ * 数据流:FDC/SPC 违例(ops 审计 fdc.violate/spc.violate)→ 用户开 OCAP 单
+ * (关联 alarm 明细/run/节点)→ 记录处置步骤 → 关单(可弱关联 optimization_explorations
+ * 与 rollback anchor;跨 JSON 存储不设 FK,孤儿引用呈现侧标 stale,评审 A-9)。
+ * 通知侧:FDC 违例已走 notifyLineOperators;OCAP 开单/关单走 recordOps 审计。
+ */
+import { randomUUID } from 'node:crypto'
+import type { ResolvedUser } from '@/server/api/workshop/caller'
+import { lineMode } from '../permissions'
+import { getDaqNodeRepo } from '../daq/daq-node.repo'
+import { recordOps } from '../ops/ops'
+import { edaDb } from './eda-db'
+import { edaRunById } from './eda-run.repo'
+
+export interface OcapRow {
+  id: string
+  alarmId: string
+  runId: string | null
+  nodeId: string | null
+  title: string
+  steps: Array<{ at: string, by: string, text: string }>
+  status: 'open' | 'closed' | 'void'
+  closedBy: string | null
+  closedAt: string | null
+  linkedExplorationId: string | null
+  linkedRollbackAnchor: string | null
+  linkedExplorationExists: boolean | null
+  /** E7④:anchor 对应的 rollback 审计检索(详情面只读;空数组/undefined=无关联或仓储未就绪) */
+  relatedRollback?: Array<{ action: string, summary: string, at: string }>
+  ownerUserId: string | null
+  createdAt: string
+}
+
+function rowOf(r: Record<string, unknown>): OcapRow {
+  let steps: OcapRow['steps'] = []
+  try {
+    steps = JSON.parse(String(r.steps_json ?? '[]')) as OcapRow['steps']
+  }
+  catch { /* 坏 JSON 按空步骤 */ }
+  return {
+    id: String(r.id),
+    alarmId: String(r.alarm_id ?? ''),
+    runId: r.run_id == null ? null : String(r.run_id),
+    nodeId: r.node_id == null ? null : String(r.node_id),
+    title: String(r.title ?? ''),
+    steps,
+    status: String(r.status ?? 'open') as OcapRow['status'],
+    closedBy: r.closed_by == null ? null : String(r.closed_by),
+    closedAt: r.closed_at == null ? null : String(r.closed_at),
+    linkedExplorationId: r.linked_exploration_id == null ? null : String(r.linked_exploration_id),
+    linkedRollbackAnchor: r.linked_rollback_anchor == null ? null : String(r.linked_rollback_anchor),
+    linkedExplorationExists: null,
+    ownerUserId: r.owner_user_id == null ? null : String(r.owner_user_id),
+    createdAt: String(r.created_at ?? ''),
+  }
+}
+
+/** 可读性:owner/admin 或记录的批次/节点落在可读产线 */
+function canRead(user: ResolvedUser, row: OcapRow): boolean {
+  if (row.ownerUserId === user.id || user.role === 'admin') return true
+  try {
+    if (row.runId) {
+      const run = edaRunById(row.runId)
+      if (run && lineMode(user, run.lineId) !== 'none') return true
+    }
+    if (row.nodeId) {
+      const n = getDaqNodeRepo().byId(row.nodeId)
+      if (n && lineMode(user, n.lineId) !== 'none') return true
+    }
+  }
+  catch { /* 探测失败按不可读 */ }
+  return false
+}
+
+export function listOcap(user: ResolvedUser, opts: { status?: string, limit?: number } = {}): OcapRow[] {
+  const rows = edaDb().prepare('SELECT * FROM eda_ocap_records ORDER BY created_at DESC LIMIT ?')
+    .all(Math.min(Math.max(Math.round(Number(opts.limit)) || 100, 1), 500)) as Array<Record<string, unknown>>
+  return rows.map(rowOf).filter(r => canRead(user, r)).filter(r => (opts.status ? r.status === opts.status : true))
+}
+
+export function ocapById(user: ResolvedUser, id: string): OcapRow | null {
+  const r = edaDb().prepare('SELECT * FROM eda_ocap_records WHERE id = ?').get(id) as Record<string, unknown> | undefined
+  if (!r) return null
+  const row = rowOf(r)
+  return canRead(user, row) ? enrich(row) : null
+}
+
+/** 弱关联存在性校验(孤儿标 stale 不报错,评审 A-9③) */
+function enrich(row: OcapRow): OcapRow {
+  if (row.linkedExplorationId) {
+    try {
+      const db = edaDb()
+      const t = db.prepare('SELECT name FROM sqlite_master WHERE type=\'table\' AND name = \'optimization_explorations\'').get() as { name?: string } | undefined
+      if (!t) {
+        row.linkedExplorationExists = null
+        return row
+      }
+      const hit = db.prepare('SELECT id FROM optimization_explorations WHERE id = ?').get(row.linkedExplorationId)
+      row.linkedExplorationExists = Boolean(hit)
+    }
+    catch {
+      row.linkedExplorationExists = null
+    }
+  }
+  // E7④:anchor 对应 rollback 审计只读检索(kind/anchor 全部绑定参数,零拼接)
+  if (row.linkedRollbackAnchor) {
+    try {
+      const anchor = `%${row.linkedRollbackAnchor}%`
+      const rows = edaDb().prepare(`SELECT action, summary, at FROM audit_log
+        WHERE kind = 'rollback' AND (target_id LIKE ? OR summary LIKE ?)
+        ORDER BY at DESC LIMIT 10`).all(anchor, anchor) as Array<Record<string, unknown>>
+      row.relatedRollback = rows.map(e => ({
+        action: String(e.action ?? 'recipe.rollback'),
+        summary: String(e.summary ?? ''),
+        at: String(e.at ?? ''),
+      }))
+    }
+    catch { /* 审计仓储未就绪:relatedRollback 保持 undefined */ }
+  }
+  return row
+}
+
+export function createOcap(user: ResolvedUser, input: {
+  alarmId: string
+  runId?: string
+  nodeId?: string
+  title: string
+}): OcapRow {
+  if (!input.alarmId.trim()) throw new Error('alarm_id 必填(来自 ops 审计的 fdc.violate/spc.violate 记录 id)。')
+  const id = `ocap-${randomUUID().slice(0, 8)}`
+  const now = new Date().toISOString()
+  edaDb().prepare(`INSERT INTO eda_ocap_records (id, alarm_id, run_id, node_id, title, steps_json, status, owner_user_id, created_at)
+    VALUES (?, ?, ?, ?, ?, '[]', 'open', ?, ?)`)
+    .run(id, input.alarmId, input.runId ?? null, input.nodeId ?? null, input.title.slice(0, 200), user.id, now)
+  recordOps({
+    actor: user.id, actorName: user.name, actorKind: 'user',
+    action: 'ocap.open', kind: 'alarm', level: 'warn',
+    targetKind: 'ocap', targetId: id,
+    summary: `开 OCAP 处置单「${input.title}」(alarm=${input.alarmId})`,
+    detail: { runId: input.runId, nodeId: input.nodeId },
+  })
+  return ocapById(user, id)!
+}
+
+/** 追加处置步骤(open 态;关单后只读) */
+export function addOcapStep(user: ResolvedUser, id: string, text: string): OcapRow {
+  const row = ocapById(user, id)
+  if (!row) throw new Error(`OCAP 不存在或不可见: ${id}`)
+  if (row.status !== 'open') throw new Error('已关闭的 OCAP 不可追加步骤。')
+  if (!row.ownerUserId || (row.ownerUserId !== user.id && user.role !== 'admin')) {
+    throw new Error('仅 owner 或 admin 可追加处置步骤。')
+  }
+  const steps = [...row.steps, { at: new Date().toISOString(), by: user.name || user.id, text: text.slice(0, 500) }]
+  edaDb().prepare('UPDATE eda_ocap_records SET steps_json = ? WHERE id = ?').run(JSON.stringify(steps), id)
+  return ocapById(user, id)!
+}
+
+/** 关单/作废(弱关联可随关单补记) */
+export function closeOcap(user: ResolvedUser, id: string, args: {
+  status: 'closed' | 'void'
+  linkedExplorationId?: string
+  linkedRollbackAnchor?: string
+}): OcapRow {
+  const row = ocapById(user, id)
+  if (!row) throw new Error(`OCAP 不存在或不可见: ${id}`)
+  if (row.status !== 'open') throw new Error('该 OCAP 已终态。')
+  if (!row.ownerUserId || (row.ownerUserId !== user.id && user.role !== 'admin')) {
+    throw new Error('仅 owner 或 admin 可关闭 OCAP。')
+  }
+  edaDb().prepare('UPDATE eda_ocap_records SET status = ?, closed_by = ?, closed_at = ?, linked_exploration_id = COALESCE(?, linked_exploration_id), linked_rollback_anchor = COALESCE(?, linked_rollback_anchor) WHERE id = ?')
+    .run(args.status, user.id, new Date().toISOString(), args.linkedExplorationId ?? null, args.linkedRollbackAnchor ?? null, id)
+  recordOps({
+    actor: user.id, actorName: user.name, actorKind: 'user',
+    action: 'ocap.close', kind: 'alarm',
+    targetKind: 'ocap', targetId: id,
+    summary: `OCAP ${args.status === 'closed' ? '关单' : '作废'}「${row.title}」`,
+    detail: { linkedExplorationId: args.linkedExplorationId, linkedRollbackAnchor: args.linkedRollbackAnchor },
+  })
+  return ocapById(user, id)!
+}

package/server/services/workshop/eda/redact.ts

@@ -0,0 +1,28 @@
+/**
+ * redact —— 请求模板回显的凭据脱敏(MES 调试台 req 回显专用,plan1 BLOCKER B3)。
+ *
+ * historyMap.read/write/history 的 headers/query 是声明式 JSON,放
+ * Authorization/Cookie/api-key 是这类驱动的常规用法;调试台把请求模板回显给
+ * 前端时必须按 key 黑名单剔除值,且绝不回显 driverConfig 原文。
+ */
+
+/** 敏感 key 黑名单(headers 与 query 共用;大小写/连写下划线不敏感) */
+const SENSITIVE_KEY = /(authorization|cookie|set-cookie|token|secret|api[-_]?key|x-api[-_]?key|password|credential|signature)/i
+
+/** 逐 key 脱敏:命中黑名单的值替换为 '***',key 名保留(用户仍能看到"这里有个头") */
+export function redactHeaders(headers: Record<string, unknown>): Record<string, string> {
+  const out: Record<string, string> = {}
+  for (const [k, v] of Object.entries(headers ?? {})) {
+    out[k] = SENSITIVE_KEY.test(k) ? '***' : String(v ?? '')
+  }
+  return out
+}
+
+/** query 同口径脱敏(from/to 等普通参数原样保留) */
+export function redactQuery(query: Record<string, unknown>): Record<string, string> {
+  const out: Record<string, string> = {}
+  for (const [k, v] of Object.entries(query ?? {})) {
+    out[k] = SENSITIVE_KEY.test(k) ? '***' : String(v ?? '')
+  }
+  return out
+}

package/server/services/workshop/eda/spc-math.ts

@@ -0,0 +1,144 @@
+/**
+ * SPC 数学库(E4,纯函数零依赖 —— 教科书公式,单测锁定)。
+ *
+ * 控制图:I-MR / Xbar-R / EWMA / CUSUM;判异:Nelson 1-8(含 Western Electric 基本四则)。
+ * 全部输入输出为标量数组/结构体,不触库 —— 判定序列建议为 per-run 等间隔特征
+ * (eda_run_features.mean 按 run 开始时间 ASC),不均匀采样上的链长类规则(5/6)无意义。
+ */
+
+/** Nelson 规则(逐点命中;返回每点触发的规则 id 列表,1-8) */
+export function nelsonHits(values: number[], cl: number, sigma: number): string[][] {
+  const n = values.length
+  const hits: string[][] = Array.from({ length: n }, () => [])
+  const side = (v: number): number => (v > cl ? 1 : v < cl ? -1 : 0)
+  const beyond = (v: number, k: number): number => (v > cl + k * sigma ? 1 : v < cl - k * sigma ? -1 : 0)
+  for (let i = 0; i < n; i++) {
+    const v = values[i]!
+    if (sigma > 0 && Math.abs(v - cl) > 3 * sigma) hits[i]!.push('1')
+    // 规则 2:连续 9 点同侧
+    if (i >= 8) {
+      const win = values.slice(i - 8, i + 1)
+      const s0 = side(win[0]!)
+      if (s0 !== 0 && win.every(w => side(w) === s0)) hits[i]!.push('2')
+    }
+    // 规则 3:连续 6 点单调(升或降)
+    if (i >= 5) {
+      const win = values.slice(i - 5, i + 1)
+      let inc = true
+      let dec = true
+      for (let j = 1; j < win.length; j++) {
+        if (win[j]! <= win[j - 1]!) inc = false
+        if (win[j]! >= win[j - 1]!) dec = false
+      }
+      if (inc || dec) hits[i]!.push('3')
+    }
+    // 规则 4:连续 14 点交替上下
+    if (i >= 13) {
+      const win = values.slice(i - 13, i + 1)
+      let alt = true
+      for (let j = 2; j < win.length; j++) {
+        if ((win[j]! - win[j - 1]!) * (win[j - 1]! - win[j - 2]!) >= 0) alt = false
+      }
+      if (alt) hits[i]!.push('4')
+    }
+    // 规则 5:3 点中 2 点落在同侧 2σ 外
+    if (i >= 2 && sigma > 0) {
+      const win = values.slice(i - 2, i + 1)
+      const up = win.filter(w => beyond(w, 2) === 1).length
+      const down = win.filter(w => beyond(w, 2) === -1).length
+      if (up >= 2 || down >= 2) hits[i]!.push('5')
+    }
+    // 规则 6:5 点中 4 点落在同侧 1σ 外
+    if (i >= 4 && sigma > 0) {
+      const win = values.slice(i - 4, i + 1)
+      const up = win.filter(w => beyond(w, 1) === 1).length
+      const down = win.filter(w => beyond(w, 1) === -1).length
+      if (up >= 4 || down >= 4) hits[i]!.push('6')
+    }
+    // 规则 7:连续 15 点在 1σ 内(分层)
+    if (i >= 14 && sigma > 0) {
+      const win = values.slice(i - 14, i + 1)
+      if (win.every(w => Math.abs(w - cl) < sigma)) hits[i]!.push('7')
+    }
+    // 规则 8:连续 8 点都落在 1σ 外(两侧不限)
+    if (i >= 7 && sigma > 0) {
+      const win = values.slice(i - 7, i + 1)
+      if (win.every(w => Math.abs(w - cl) > sigma)) hits[i]!.push('8')
+    }
+  }
+  return hits
+}
+
+/** I-MR:单值-移动极差;σ̂ = MR̄ / 1.128(n=2 无偏常数) */
+export function iMr(values: number[]): { cl: number, sigma: number, ucl: number, lcl: number, mrBar: number, mrUcl: number } | null {
+  if (values.length < 2) return null
+  const cl = values.reduce((a, b) => a + b, 0) / values.length
+  const mrs: number[] = []
+  for (let i = 1; i < values.length; i++) mrs.push(Math.abs(values[i]! - values[i - 1]!))
+  const mrBar = mrs.reduce((a, b) => a + b, 0) / mrs.length
+  const sigma = mrBar / 1.128
+  return {
+    cl,
+    sigma,
+    ucl: cl + 3 * sigma,
+    lcl: cl - 3 * sigma,
+    mrBar,
+    mrUcl: 3.267 * mrBar,
+  }
+}
+
+/** Xbar-R:子组均值-极差;σ̂ = R̄ / d2(n)(d2 查表 2..6,缺省按 1.128 退化) */
+const D2: Record<number, number> = { 2: 1.128, 3: 1.693, 4: 2.059, 5: 2.326, 6: 2.534 }
+export function xbarR(groups: number[][]): { cl: number, sigma: number, ucl: number, lcl: number, rBar: number } | null {
+  const usable = groups.filter(g => g.length >= 2)
+  if (usable.length < 2) return null
+  const xbars = usable.map(g => g.reduce((a, b) => a + b, 0) / g.length)
+  const rs = usable.map(g => Math.max(...g) - Math.min(...g))
+  const cl = xbars.reduce((a, b) => a + b, 0) / xbars.length
+  const rBar = rs.reduce((a, b) => a + b, 0) / rs.length
+  const n = usable[0]!.length
+  const d2 = D2[n] ?? 1.128
+  const sigma = rBar / d2
+  const a2 = 3 / (d2 * Math.sqrt(n))
+  return { cl, sigma, ucl: cl + a2 * rBar, lcl: cl - a2 * rBar, rBar }
+}
+
+/** EWMA:z_t = λ·x_t + (1-λ)·z_{t-1};控制限 cl ± 3σ·sqrt(λ/(2-λ)·(1-(1-λ)^{2t})) */
+export function ewma(values: number[], cl: number, sigma: number, lambda = 0.2): { stats: number[], limits: Array<{ ucl: number, lcl: number }> } {
+  let z = cl
+  const stats: number[] = []
+  const limits: Array<{ ucl: number, lcl: number }> = []
+  for (let i = 0; i < values.length; i++) {
+    z = lambda * values[i]! + (1 - lambda) * z
+    const f = sigma * Math.sqrt((lambda / (2 - lambda)) * (1 - (1 - lambda) ** (2 * (i + 1))))
+    stats.push(z)
+    limits.push({ ucl: cl + 3 * f, lcl: cl - 3 * f })
+  }
+  return { stats, limits }
+}
+
+/** CUSUM(标准化):k(h 均以 σ 为单位,缺省 k=0.5,h=4);返回 C+/C- 与越限点 */
+export function cusum(values: number[], cl: number, sigma: number, k = 0.5, h = 4): { cPlus: number[], cMinus: number[], violated: boolean[] } {
+  let cp = 0
+  let cm = 0
+  const cPlus: number[] = []
+  const cMinus: number[] = []
+  const violated: boolean[] = []
+  const kk = k * sigma
+  const hh = h * sigma
+  for (const v of values) {
+    cp = Math.max(0, cp + (v - cl) - kk)
+    cm = Math.max(0, cm + (cl - v) - kk)
+    cPlus.push(cp)
+    cMinus.push(cm)
+    violated.push(sigma > 0 && (cp > hh || cm > hh))
+  }
+  return { cPlus, cMinus, violated }
+}
+
+/** 从特征值序列建限:I-MR 为主(等间隔 per-run 序列的缺省图型) */
+export function buildLimits(values: number[]): { cl: number, sigma: number, ucl: number, lcl: number } | null {
+  const m = iMr(values)
+  if (!m) return null
+  return { cl: m.cl, sigma: m.sigma, ucl: m.ucl, lcl: m.lcl }
+}