@xihe-lab/tapd-cli 2.0.0-rc.1 → 2.0.0-rc.2

package/templates/pm/integration-kickoff.yaml

@@ -0,0 +1,94 @@
+# 项目启动骨架（写场景：默认 dry-run 闸门预览，--yes 确认后依次落库）—— 整合管理（软考高项第4版 第8章）
+# 场景: tapd pm integration kickoff
+#   --input '{"project_name":"XX系统","startdate":"2026-09-11","enddate":"2026-10-11","wiki_content":"# 章程正文(md)"}' --yes
+# 编排（3 个写步骤串行）: tapd_create_wiki(章程) → tapd_create_iteration(首迭代)
+#   → tapd_create_release(发布计划；TAPD 发布计划无原生迭代关联字段，
+#     依赖前步产出的迭代 ID 经 ${steps...} 记录进 description)
+# 本地 expr 步骤只做创建结果形态归一（Iteration/Wiki/Release 包裹兼容），不触 API
+name: integration-kickoff
+domain: integration
+title: 项目启动骨架（章程 wiki + 首迭代 + 发布计划三步落库，软考第8章）
+write: true
+unwrap: true
+vars:
+  project_name: "未命名项目"
+  startdate: ""
+  enddate: ""
+  wiki_content: ""
+steps:
+  # 写步骤 1/3：项目章程 wiki（markdown 正文）
+  - id: charter
+    uses: tapd_create_wiki
+    args:
+      name: "${vars.project_name} 项目章程"
+      markdown_description: "${vars.wiki_content}"
+      note: "由 tapd pm integration kickoff 生成；项目周期 ${vars.startdate} ~ ${vars.enddate}"
+
+  - id: charter_ref
+    expr: >-
+      (() => {
+      const w = steps.charter.data || {};
+      const inner = w.Wiki || w.wiki || w;
+      return { id: String(inner.id || ''), title: inner.name || '' };
+      })()
+    depends_on: [charter]
+
+  # 写步骤 2/3：首迭代（open）
+  - id: new_iteration
+    uses: tapd_create_iteration
+    args:
+      name: "${vars.project_name} 首迭代"
+      startdate: "${vars.startdate}"
+      enddate: "${vars.enddate}"
+      status: open
+      description: "项目启动骨架创建；章程 wiki#${steps.charter_ref.data.id} ${steps.charter_ref.data.title}"
+    depends_on: [charter_ref]
+
+  - id: iteration_ref
+    expr: >-
+      (() => {
+      const r = steps.new_iteration.data || {};
+      const inner = r.Iteration || r.iteration || r;
+      return { id: String(inner.id || ''), name: inner.name || '' };
+      })()
+    depends_on: [new_iteration]
+
+  # 写步骤 3/3：发布计划（迭代 ID 以描述记录：tapd_create_release 无迭代关联字段）
+  - id: release
+    uses: tapd_create_release
+    args:
+      name: "${vars.project_name} 首发布计划"
+      start_date: "${vars.startdate}"
+      end_date: "${vars.enddate}"
+      release_date: "${vars.enddate}"
+      description: "由 pm integration kickoff 创建；关联首迭代 ${steps.iteration_ref.data.name}（id=${steps.iteration_ref.data.id}）"
+    depends_on: [iteration_ref]
+
+  - id: summary
+    expr: >-
+      (() => {
+      const r = steps.release.data || {};
+      const inner = r.Release || r.release || r;
+      return {
+      range: (vars.startdate || '?') + ' ~ ' + (vars.enddate || '?'),
+      wikiId: steps.charter_ref.data.id,
+      wikiTitle: steps.charter_ref.data.title,
+      iterationId: steps.iteration_ref.data.id,
+      iterationName: steps.iteration_ref.data.name,
+      releaseId: String(inner.id || ''),
+      };
+      })()
+    depends_on: [release]
+
+report:
+  format: markdown
+  template: |
+    # 项目启动骨架已创建 — ${vars.project_name}
+
+    - 项目周期: ${steps.summary.data.range}
+    - 章程 wiki: ${steps.summary.data.wikiTitle}（wiki#${steps.summary.data.wikiId}）
+    - 首迭代: ${steps.summary.data.iterationName}（id=${steps.summary.data.iterationId}）
+    - 发布计划: ${steps.summary.data.releaseId}
+
+    > 本场景含 3 个写步骤（wiki create → iteration create → release create，串行依赖）。
+    > 不加 --yes 时仅输出计划预览不落库；后续用 `tapd pm scope baseline` 冻结范围基线。

package/templates/pm/quality-dashboard.yaml

@@ -0,0 +1,88 @@
+# 质量度量盘（S5 / 软考高项第12章 质量管理）
+# 只读场景（L0 直接执行）：缺陷 severity×status 分布 + 未解清单 + 缺陷密度（保留分母）
+# 可选测试计划进度：pm 默认拿不到 test_plan_id，需经 --input '{"test_plan_id":"..."}' 传入；
+#   未传时跳过该步骤并在报告中注明（不报错）。
+# 用法: tapd pm quality dashboard --iteration <id>
+#   或: tapd pm quality dashboard --input '{"test_plan_id":"1139814312001001234"}'
+name: quality-dashboard
+domain: quality
+title: 质量度量盘（缺陷分布/未解清单/缺陷密度，可选测试计划进度）
+write: false
+unwrap: true
+vars:
+  iteration_id: ""
+  test_plan_id: ""
+steps:
+  - id: iteration
+    uses: tapd_get_iterations
+    args:
+      id: "${vars.iteration_id}"
+      fields: "id,name,startdate,enddate,status"
+    where: "String(vars.iteration_id || '').trim() !== ''"
+
+  - id: bugs
+    uses: tapd_get_bugs
+    args:
+      iteration_id: "${vars.iteration_id}"
+      limit: 200
+      fields: "id,title,severity,status,priority_label,current_owner,te,de,deadline"
+    filter: "!item.title.startsWith('zzz-delete-me')"
+
+  # 范围分母：剔除 zzz 脏数据与【风险】项（label=risk / 名称【风险】前缀，登记后不再计入范围度量）
+  - id: stories
+    uses: tapd_get_stories
+    args:
+      iteration_id: "${vars.iteration_id}"
+      limit: 200
+      fields: "id,name,status,owner"
+    filter: "!item.name.startsWith('zzz-delete-me') && !item.name.startsWith('【风险】')"
+
+  - id: test_plan
+    uses: tapd_get_test_plan_progress
+    args:
+      test_plan_id: "${vars.test_plan_id}"
+    where: "String(vars.test_plan_id || '').trim() !== ''"
+
+  - id: open_bugs
+    expr: "(() => { const asArr = v => Array.isArray(v) ? v : []; const norm = s => String(s === undefined || s === null ? '' : s).trim().toLowerCase(); const UNRESOLVED = ['closed', 'resolved', 'rejected', 'reject']; return asArr(steps.bugs.data).filter(b => !UNRESOLVED.includes(norm(b.status))); })()"
+    depends_on: [bugs]
+
+  - id: distribution
+    expr: "(() => { const asArr = v => Array.isArray(v) ? v : []; const norm = v => { const s = String(v === undefined || v === null ? '' : v).trim(); return s === '' ? '-' : s; }; const bugs = asArr(steps.bugs.data); const sevs = [...new Set(bugs.map(b => norm(b.severity)))].sort((a, b) => (Number(a) || 99) - (Number(b) || 99)); const stats = [...new Set(bugs.map(b => norm(b.status)))].sort(); const cell = (sv, st) => bugs.filter(b => norm(b.severity) === sv && norm(b.status) === st).length; const head = '| 严重度 | ' + stats.join(' | ') + ' | 合计 |'; const sep = '| ' + Array(stats.length + 2).fill('---').join(' | ') + ' |'; const rows = sevs.map(sv => '| ' + sv + ' | ' + stats.map(st => cell(sv, st)).join(' | ') + ' | ' + bugs.filter(b => norm(b.severity) === sv).length + ' |'); const bySeverity = {}; const byStatus = {}; for (const b of bugs) { bySeverity[norm(b.severity)] = (bySeverity[norm(b.severity)] || 0) + 1; byStatus[norm(b.status)] = (byStatus[norm(b.status)] || 0) + 1; } return { total: bugs.length, sevs, stats, bySeverity, byStatus, matrixTable: [head, sep].concat(rows).join('\\n') }; })()"
+    depends_on: [bugs, open_bugs]
+
+  - id: stats
+    expr: "(() => { const total = steps.distribution.data.total; const open = steps.open_bugs.data.length; const stories = steps.stories.data.length; return { total, open, stories, densityText: stories > 0 ? (total + '/' + stories) : (total + '/0（需求分母为 0，密度无意义）'), densityNum: stories > 0 ? Math.round((total / stories) * 100) / 100 : null }; })()"
+    depends_on: [distribution, stories]
+
+  # 注意：依赖声明用 bugs（wave 0）而非 iteration —— iteration 可能被 where 跳过，
+  # 依赖被跳过步骤会连锁跳过；挂到下一波次可确定性读取 steps.iteration 的最终状态。
+  - id: header
+    expr: "(() => { const list = steps.iteration && Array.isArray(steps.iteration.data) ? steps.iteration.data : []; const it = list[0]; return { name: it ? it.name : '（未识别迭代，请检查 --iteration）', range: it ? ((it.startdate || '-') + ' ~ ' + (it.enddate || '-')) : '-' }; })()"
+    depends_on: [bugs]
+
+  # 注意：test_plan 可能被 where 跳过（未传 test_plan_id），直接依赖它会连锁跳过；
+  # 挂到 stats（必然后于 wave 0 的 test_plan）之后，可确定性读取其执行/跳过状态。
+  - id: testplan_note
+    expr: "(() => { const tp = steps.test_plan; if (!tp || tp.data === undefined || tp.data === null) return '未提供 vars.test_plan_id（示例 --input {\"test_plan_id\":\"1139...\"}），已跳过测试计划执行进度。'; return '测试计划执行进度（原始返回）:\\n' + (typeof tp.data === 'string' ? tp.data : JSON.stringify(tp.data, null, 2)); })()"
+    depends_on: [stats]
+
+report:
+  format: markdown
+  template: |
+    # 质量度量盘 — ${steps.header.data.name}
+    - 迭代区间: ${steps.header.data.range}
+    - 缺陷: 全量 ${steps.stats.data.total}，未解 ${steps.stats.data.open}
+    - 需求（范围分母，已剔除 zzz 脏数据与【风险】项）: ${steps.stats.data.stories}
+    - 缺陷密度（有效缺陷/需求，保留分母）: ${steps.stats.data.densityText}
+
+    ## severity × status 分布
+    ${steps.distribution.data.matrixTable}
+
+    ## 未解缺陷清单（${steps.open_bugs.data | length}）
+    | id | 标题 | 严重度 | 状态 | 处理人 | 解决截止 |
+    | --- | --- | --- | --- | --- | --- |
+    ${steps.open_bugs.data | rows id,title,severity,status,current_owner,deadline}
+
+    ## 测试计划执行进度
+    ${steps.testplan_note.data}

package/templates/pm/quality-triage.yaml

@@ -0,0 +1,42 @@
+# 缺陷分诊（S5 / 软考高项第12章 质量管理）
+# 只读「建议模式」：本模板零写步骤，只产分配建议表；
+#   确认后由人工执行 `tapd bug update <id> --owner <建议归属>`，或由 agent 调 tapd_update_bug 落库。
+# 规则（对齐 templates/triage-bugs.yaml 的写法）：
+#   高严重度（vars.high_severity，默认 "1,2"）→ 建议 te（测试口）复核；
+#   其余未解缺陷 → 按 current_owner 现有未解负载做负载均衡（负载最小者优先）。
+# 用法: tapd pm quality triage --iteration <id>
+name: quality-triage
+domain: quality
+title: 缺陷分诊（建议模式，确认后人工/agent 执行 bug update）
+write: false
+unwrap: true
+vars:
+  iteration_id: ""
+  high_severity: "1,2"
+steps:
+  - id: bugs
+    uses: tapd_get_bugs
+    args:
+      iteration_id: "${vars.iteration_id}"
+      limit: 200
+      fields: "id,title,severity,status,priority_label,current_owner,te,de"
+    filter: "!item.title.startsWith('zzz-delete-me')"
+
+  - id: triage
+    expr: "(() => { const asArr = v => Array.isArray(v) ? v : []; const norm = v => String(v === undefined || v === null ? '' : v).trim(); const UNRESOLVED = ['closed', 'resolved', 'rejected', 'reject']; const open = asArr(steps.bugs.data).filter(b => !UNRESOLVED.includes(norm(b.status).toLowerCase())); const highs = norm(vars.high_severity).split(',').map(s => s.trim()).filter(Boolean); const isHigh = b => highs.includes(norm(b.severity)); const high = open.filter(isHigh); const rest = open.filter(b => !isHigh(b)); const owners = [...new Set(open.map(b => norm(b.current_owner)).filter(o => o !== ''))]; const load = {}; for (const o of owners) load[o] = 0; for (const b of rest) { const o = norm(b.current_owner); if (load[o] !== undefined) load[o] += 1; } const pickMin = () => { let best = null; for (const o of owners) { if (best === null || load[o] < load[best]) best = o; } return best; }; const plan = []; for (const b of high) { plan.push({ id: norm(b.id), title: norm(b.title), severity: norm(b.severity), priority_label: norm(b.priority_label), current_owner: norm(b.current_owner), suggested: norm(b.te) !== '' ? norm(b.te) : '（te 未指定，请人工确认）', rule: '高严重度→te' }); } for (const b of rest) { const target = owners.length > 0 ? pickMin() : '（无候选处理人，请人工指派）'; if (target !== null && load[target] !== undefined) load[target] += 1; plan.push({ id: norm(b.id), title: norm(b.title), severity: norm(b.severity), priority_label: norm(b.priority_label), current_owner: norm(b.current_owner), suggested: target, rule: '按 current_owner 负载均衡' }); } return { openCount: open.length, highCount: high.length, restCount: rest.length, owners, plan }; })()"
+    depends_on: [bugs]
+
+report:
+  format: markdown
+  template: |
+    # 缺陷分诊（建议模式 — 确认后由人工/agent 执行 bug update，本模板零写步骤）
+    - 迭代: ${vars.iteration_id}
+    - 未解缺陷: ${steps.triage.data.openCount} 个 = 高严重度 ${steps.triage.data.highCount}（建议转 te 复核）+ 其余 ${steps.triage.data.restCount}（按 current_owner 负载均衡）
+    - 候选处理人池: ${steps.triage.data.owners | join}
+
+    ## 分配建议表
+    | id | 标题 | 严重度 | 优先级 | 当前处理人 | 建议归属 | 规则 |
+    | --- | --- | --- | --- | --- | --- | --- |
+    ${steps.triage.data.plan | rows id,title,severity,priority_label,current_owner,suggested,rule}
+
+    > 建议模式说明：本场景只读不落库。确认后请人工执行 `tapd bug update <id> --owner <建议归属>`，或由 agent 调 tapd_update_bug 完成转派。

package/templates/pm/risk-register.yaml

@@ -0,0 +1,55 @@
+# 风险登记（S5 / 软考高项第15章 风险管理）
+# 写场景（含写步骤，默认 dry-run 闸门，--yes 确认落库）：
+#   以 tapd_create_story 落一条【风险】需求：name=【风险】<title>、label=risk、迭代关联、
+#   priority_label 按 probability 映射（高/High→High，中/Medium→Middle，低/Low→Low，未知→Middle）。
+#   描述 markdown 由 expr 组装（类别 + 概率×影响 + 触发条件 + 应对策略 + 责任人），经 ${} 注入写步骤。
+# 口径：登记后（label=risk 或名称以【风险】开头）会在范围度量中被剔除（pm scope/quality 模板内置过滤）。
+# 用法: tapd pm risk register --iteration <id> --yes \
+#         --input '{"title":"联调环境不可用","category":"进度","probability":"高","impact":"里程碑延期","strategy":"规避","owner":"alice","trigger":"环境连续 3 天不可用"}'
+name: risk-register
+domain: risk
+title: 风险登记（写：创建【风险】需求 label=risk，登记后会在范围度量中被剔除）
+write: true
+unwrap: true
+vars:
+  iteration_id: ""
+  title: ""
+  category: ""
+  probability: ""
+  impact: ""
+  strategy: ""
+  owner: ""
+  trigger: ""
+steps:
+  - id: assemble
+    expr: "(() => { const norm = v => String(v === undefined || v === null ? '' : v).trim(); const PMAP = { '高': 'High', 'high': 'High', 'h': 'High', '3': 'High', '中高': 'High', '中': 'Middle', 'medium': 'Middle', 'mid': 'Middle', 'm': 'Middle', '2': 'Middle', '低': 'Low', 'low': 'Low', 'l': 'Low', '1': 'Low' }; const p = norm(vars.probability).toLowerCase(); const priority_label = PMAP[p] || 'Middle'; const lines = ['【风险】' + norm(vars.title), '', '- 类别: ' + (norm(vars.category) || '未分类'), '- 概率×影响: ' + (norm(vars.probability) || '未填') + ' × ' + (norm(vars.impact) || '未填') + '（priority_label=' + priority_label + '）', '- 触发条件: ' + (norm(vars.trigger) || '未填'), '- 应对策略: ' + (norm(vars.strategy) || '未填'), '- 责任人: ' + (norm(vars.owner) || '未指定'), '- 关联迭代: ' + (norm(vars.iteration_id) || '未关联'), '- 登记说明: 由 tapd pm risk register 创建于 ' + today + '；label=risk，范围度量会剔除本项']; return { priority_label, probability: norm(vars.probability) || '未填', description: lines.join('\\n') }; })()"
+
+  # 缺 title / iteration_id 时跳过写步骤（宁可不落库，不产垃圾数据）
+  - id: register
+    uses: tapd_create_story
+    args:
+      name: "【风险】${vars.title}"
+      label: risk
+      iteration_id: "${vars.iteration_id}"
+      priority_label: "${steps.assemble.data.priority_label}"
+      description: "${steps.assemble.data.description}"
+    where: "String(vars.title || '').trim() !== '' && String(vars.iteration_id || '').trim() !== ''"
+    depends_on: [assemble]
+
+  - id: register_status
+    expr: "(() => { const titleOk = String(vars.title || '').trim() !== ''; const iterOk = String(vars.iteration_id || '').trim() !== ''; return { status: titleOk && iterOk ? '写步骤 register 已放行执行（闸门通过），成功时下方为新需求 id' : '写步骤 register 被跳过：缺少必填变量（title / iteration_id），请传 --iteration <id> 并在 --input 提供 title' }; })()"
+    depends_on: [assemble]
+
+report:
+  format: markdown
+  template: |
+    # 风险登记结果（登记后会在范围度量中被剔除 — label=risk）
+    - 目标需求: 【风险】${vars.title}
+    - 迭代: ${vars.iteration_id}；priority_label: ${steps.assemble.data.priority_label}（probability=${steps.assemble.data.probability}）
+    - 状态: ${steps.register_status.data.status}
+    - 新需求 id: ${steps.register.data.id}
+
+    ## 已写入的需求描述（markdown）
+    ${steps.assemble.data.description}
+
+    > 口径说明：登记项带 label=risk（名称以【风险】开头），pm scope/quality 的范围度量会自动剔除；如需撤销请删除该需求或移除 risk 标签。

package/templates/pm/risk-scan.yaml

@@ -0,0 +1,87 @@
+# 风险扫描（S5 / 软考高项第15章 风险管理）
+# 六路只读扫描，输出「候选风险清单」（类别/描述/证据/建议等级）供人工裁决：
+#   ① 逾期任务   tapd_get_tasks（due < today 且 status != done，zzz 过滤）
+#   ② 逾期缺陷   tapd_get_bugs（deadline < today 且未解，zzz 过滤）
+#   ③ 阻塞用例   tapd_get_tcase_result(result=block)（工作区级查询，无迭代维度）
+#   ④ 超支任务   tasks 里 exceed > 0
+#   ⑤ 依赖停滞   tapd_get_time_relative_stories 前置未完成（后置为迭代内需求）
+#   ⑥ 外部依赖   stories source 非空
+# 本模板零写步骤：确认要跟踪的候选项后，用 `tapd pm risk register` 登记为【风险】需求。
+# 用法: tapd pm risk scan --iteration <id>
+name: risk-scan
+domain: risk
+title: 风险扫描（六路只读扫描，候选清单供人工裁决）
+write: false
+unwrap: true
+vars:
+  iteration_id: ""
+steps:
+  - id: tasks
+    uses: tapd_get_tasks
+    args:
+      iteration_id: "${vars.iteration_id}"
+      limit: 200
+      fields: "id,name,owner,status,due,effort,exceed"
+    filter: "!item.name.startsWith('zzz-delete-me')"
+
+  - id: bugs
+    uses: tapd_get_bugs
+    args:
+      iteration_id: "${vars.iteration_id}"
+      limit: 200
+      fields: "id,title,severity,status,current_owner,deadline"
+    filter: "!item.title.startsWith('zzz-delete-me')"
+
+  - id: blocked
+    uses: tapd_get_tcase_result
+    # 真机约束（2026-09-11 L2 冒烟）：tcase_result 必须带 tcase_id + test_plan_id（实体级查询），
+    # 工作区级"所有 block 用例"不可查。默认关闭；--input 提供 tcase_id/test_plan_id 时才启用本路。
+    where: "vars.tcase_id != null && vars.test_plan_id != null"
+    args:
+      tcase_id: "${vars.tcase_id}"
+      test_plan_id: "${vars.test_plan_id}"
+      result: block
+      limit: 200
+      fields: "id,tcase_id,test_plan_id,result,executed_by,executed"
+
+  - id: stories
+    uses: tapd_get_stories
+    args:
+      iteration_id: "${vars.iteration_id}"
+      limit: 200
+      fields: "id,name,status,owner,source"
+    filter: "!item.name.startsWith('zzz-delete-me')"
+
+  - id: relations
+    uses: tapd_get_time_relative_stories
+    # 真机约束：无 story_id 的全量前后置查询 API 不接受。默认关闭；
+    # --input 提供 relations_story_id（迭代内某需求长 ID）时查该需求的依赖网络。
+    where: "vars.relations_story_id != null"
+    args:
+      story_id: "${vars.relations_story_id}"
+      limit: 200
+      fields: "predecessor_id,successor_id,relation_type"
+
+  - id: scan
+    expr: "(() => { const asArr = v => Array.isArray(v) ? v : []; const norm = v => String(v === undefined || v === null ? '' : v).trim(); const UNRESOLVED = ['closed', 'resolved', 'rejected', 'reject']; const DONEISH = ['done', 'closed', 'completed', '已关闭', '已完成']; const isDone = s => DONEISH.includes(norm(s).toLowerCase()); const tasks = asArr(steps.tasks.data); const bugs = asArr(steps.bugs.data); const blockedCases = asArr((steps['blocked'] || {}).data); const stories = asArr(steps.stories.data); const relations = asArr((steps['relations'] || {}).data); const findings = []; for (const t of tasks) { if (norm(t.due) !== '' && norm(t.due) < today && !isDone(t.status)) { findings.push({ category: '进度', kind: '逾期任务', id: norm(t.id), desc: '任务「' + norm(t.name) + '」逾期未完成（应完成 ' + norm(t.due) + '，状态 ' + (norm(t.status) || '-') + '）', evidence: 'task ' + norm(t.id) + ' due=' + norm(t.due) + ' status=' + norm(t.status) + ' owner=' + (norm(t.owner) || '-'), level: '高' }); } } for (const t of tasks) { const exceed = Number(t.exceed) || 0; if (exceed > 0) { const effort = Number(t.effort) || 0; const pct = effort > 0 ? Math.round((exceed / effort) * 100) : null; findings.push({ category: '成本', kind: '超支任务', id: norm(t.id), desc: '任务「' + norm(t.name) + '」超支 ' + exceed + ' 工时' + (pct !== null ? ('（超出预估 ' + pct + '%）') : ''), evidence: 'task ' + norm(t.id) + ' effort=' + (norm(t.effort) || '-') + ' exceed=' + exceed, level: pct !== null && pct >= 30 ? '高' : '中' }); } } for (const b of bugs) { if (norm(b.deadline) !== '' && norm(b.deadline) < today && !UNRESOLVED.includes(norm(b.status).toLowerCase())) { findings.push({ category: '质量', kind: '逾期缺陷', id: norm(b.id), desc: '缺陷「' + norm(b.title) + '」超过解决截止 ' + norm(b.deadline) + ' 仍未解（severity=' + (norm(b.severity) || '-') + '）', evidence: 'bug ' + norm(b.id) + ' deadline=' + norm(b.deadline) + ' status=' + norm(b.status) + ' owner=' + (norm(b.current_owner) || '-'), level: norm(b.severity) === '1' ? '高' : '中' }); } } for (const c of blockedCases) { findings.push({ category: '质量', kind: '阻塞用例', id: norm(c.tcase_id) || norm(c.id), desc: '测试用例执行被阻塞（result=block），需解除环境/依赖阻塞后回归', evidence: 'tcase ' + (norm(c.tcase_id) || norm(c.id)) + ' plan=' + (norm(c.test_plan_id) || '-') + ' by=' + (norm(c.executed_by) || '-') + ' at=' + (norm(c.executed) || '-'), level: '中' }); } const byId = new Map(stories.map(s => [norm(s.id), s])); const seenRel = new Set(); for (const r of relations) { const succ = byId.get(norm(r.successor_id)); if (!succ) continue; const pred = byId.get(norm(r.predecessor_id)); if (pred && isDone(pred.status)) continue; const key = norm(r.predecessor_id) + '->' + norm(r.successor_id); if (seenRel.has(key)) continue; seenRel.add(key); findings.push({ category: '依赖', kind: '依赖停滞', id: norm(succ.id), desc: '需求「' + norm(succ.name) + '」的前置「' + (pred ? norm(pred.name) : norm(r.predecessor_id) + '（迭代外）') + '」未完成（状态 ' + (pred ? (norm(pred.status) || '-') : '迭代外') + '），后置无法推进', evidence: 'relation pred=' + norm(r.predecessor_id) + ' succ=' + norm(r.successor_id) + ' type=' + (norm(r.relation_type) || '-'), level: '高' }); } for (const s of stories) { if (norm(s.source) !== '') { findings.push({ category: '依赖', kind: '外部依赖', id: norm(s.id), desc: '需求「' + norm(s.name) + '」来源外部（source=' + norm(s.source) + '），交付受外部制约，需跟踪', evidence: 'story ' + norm(s.id) + ' source=' + norm(s.source) + ' owner=' + (norm(s.owner) || '-'), level: '中' }); } } const catCount = {}; for (const f of findings) catCount[f.category] = (catCount[f.category] || 0) + 1; const categorySummary = Object.keys(catCount).map(k => k + ' ' + catCount[k]).join('，'); return { today, total: findings.length, categorySummary, scanned: { tasks: tasks.length, bugs: bugs.length, blocked: blockedCases.length, stories: stories.length, relations: relations.length }, findings }; })()"
+    depends_on: [tasks, bugs, stories]
+    # blocked/relations 为 opt-in 路径（where 门控，缺省 skipped）：刻意不用 depends_on 引用，
+    # 改为括号安全取数，避免「上游 skipped 级联跳过本聚合步」——与 quality-dashboard 同款处理。
+
+report:
+  format: markdown
+  template: |
+    # 风险扫描报告（候选清单 — 输出供人工裁决，本模板零写步骤）
+    - 扫描日期: ${steps.scan.data.today}；迭代: ${vars.iteration_id}
+    - 扫描量: 任务 ${steps.scan.data.scanned.tasks} / 缺陷 ${steps.scan.data.scanned.bugs} / 用例结果 ${steps.scan.data.scanned.blocked} / 需求 ${steps.scan.data.scanned.stories} / 前后置关系 ${steps.scan.data.scanned.relations}（zzz 脏数据已过滤）
+    - 候选风险: ${steps.scan.data.total} 项（${steps.scan.data.categorySummary}）
+
+    ## 候选清单（类别 / 描述 / 证据 / 建议等级）
+    | 类别 | 类型 | 对象 | 描述 | 证据 | 建议等级 |
+    | --- | --- | --- | --- | --- | --- |
+    ${steps.scan.data.findings | rows category,kind,id,desc,evidence,level}
+
+    ## 裁决与去向
+    - 确认要跟踪的候选项 → `tapd pm risk register --iteration <id> --yes --input '{"title":"...","category":"...","probability":"高|中|低","impact":"...","strategy":"...","owner":"...","trigger":"..."}'` 登记为【风险】需求（label=risk）
+    - 阻塞用例为工作区级查询（tapd_get_tcase_result 无迭代维度），请按 test_plan / tcase 上下文人工归位
+    - 建议等级仅为规则初判（高/中），最终等级以人工裁决为准；未确认的候选项不会落库

package/templates/pm/schedule-burndown.yaml

@@ -0,0 +1,87 @@
+# 迭代燃尽数据（软考第10章 进度管理，纯只读 L0）
+# 剩余量按「完成日回放」近似：实体完成日取变更记录 status→done 的最早时间，
+# 缺失时回退实体 completed 字段；按迭代 startdate~today 逐日推算剩余件数与剩余工时。
+# 若变更接口不可用，趋势退化为快照日单点（report 脚注注明口径）。
+# 用法: tapd pm schedule burndown [--iteration <id>] [--dry-run]
+name: schedule-burndown
+domain: schedule
+title: 迭代燃尽数据（story/task 剩余量按日趋势 + 总量快照）
+write: false
+unwrap: true
+vars:
+  iteration_id: ""
+steps:
+  - id: iteration
+    uses: tapd_get_iterations
+    args:
+      id: "${vars.iteration_id}"
+      fields: "id,name,startdate,enddate,status"
+
+  - id: stories
+    uses: tapd_get_stories
+    args:
+      iteration_id: "${vars.iteration_id}"
+      fields: "id,name,owner,status,effort,effort_completed,remain,completed"
+      limit: 200
+    filter: "!item.name.startsWith('zzz-delete-me')"
+
+  - id: tasks
+    uses: tapd_get_tasks
+    args:
+      iteration_id: "${vars.iteration_id}"
+      fields: "id,name,owner,status,effort,effort_completed,remain,completed"
+      limit: 200
+    filter: "!item.name.startsWith('zzz-delete-me')"
+
+  - id: dates
+    expr: "(() => { return { today: today }; })()"
+
+  - id: story_ids
+    expr: "(steps.stories.data.length > 0 ? steps.stories.data.map(s => String(s.id)).join(',') : '0')"
+    depends_on: [stories]
+
+  - id: task_ids
+    expr: "(steps.tasks.data.length > 0 ? steps.tasks.data.map(t => String(t.id)).join(',') : '0')"
+    depends_on: [tasks]
+
+  - id: story_changes
+    uses: tapd_get_story_changes
+    args:
+      story_id: "${steps.story_ids.data}"
+      fields: "story_id,field,new_value,created"
+      limit: 200
+    depends_on: [story_ids]
+
+  - id: task_changes
+    uses: tapd_get_task_changes
+    args:
+      task_id: "${steps.task_ids.data}"
+      fields: "task_id,field,new_value,created"
+      limit: 200
+    depends_on: [task_ids]
+
+  - id: burndown
+    expr: "(() => { const arr = v => Array.isArray(v) ? v : (v && Array.isArray(v.data) ? v.data : []); const num = v => { const n = Number(v); return Number.isFinite(n) ? n : 0; }; const DONE = ['done', 'closed', 'close', 'completed', 'finish', 'finished', 'delivered', 'resolved']; const isDone = st => DONE.includes(String(st ?? '').toLowerCase()); const s = arr(steps.stories.data), t = arr(steps.tasks.data); const sc = arr(steps.story_changes.data), tc = arr(steps.task_changes.data); const td = steps.dates.data.today; const it = (steps.iteration.data ?? [])[0] ?? {}; const ents = [...s.map(x => ({ id: String(x.id), effort: num(x.effort), completed: x.completed ?? '' })), ...t.map(x => ({ id: String(x.id), effort: num(x.effort), completed: x.completed ?? '' }))]; const chg = [...sc.map(c => ({ id: String(c.story_id), field: c.field, nw: c.new_value, created: String(c.created ?? '').slice(0, 10) })), ...tc.map(c => ({ id: String(c.task_id), field: c.field, nw: c.new_value, created: String(c.created ?? '').slice(0, 10) }))]; const dayMap = {}; for (const e of ents) { const hits = chg.filter(c => c.id === e.id && c.field === 'status' && isDone(c.nw) && c.created !== '').map(c => c.created).sort(); const fb = String(e.completed ?? '').slice(0, 10); dayMap[e.id] = hits.length > 0 ? hits[0] : (fb !== '' ? fb : ''); } const totalEffort = ents.reduce((a, e) => a + e.effort, 0); let cur = it.startdate ? String(it.startdate).slice(0, 10) : td; const days = []; const nextDay = d => new Date(new Date(d + 'T00:00:00Z').getTime() + 86400000).toISOString().slice(0, 10); let guard = 0; while (cur <= td && guard < 120) { days.push(cur); cur = nextDay(cur); guard++; } if (days.length === 0) days.push(td); const doneByDay = e => { const dd = dayMap[e.id]; return dd !== undefined && dd !== '' && dd <= days[days.length - 1] ? dd : ''; }; const trend = days.map(d => { const doneList = ents.filter(e => { const dd = doneByDay(e); return dd !== '' && dd <= d; }); const burn = doneList.reduce((a, e) => a + e.effort, 0); return { date: d, doneEntities: doneList.length, remainEntities: ents.length - doneList.length, burnEffort: Math.round(burn * 100) / 100, remainEffort: Math.round((totalEffort - burn) * 100) / 100 }; }); const dist = days.map((d, i) => ({ date: d, completed: trend[i].doneEntities - (i > 0 ? trend[i - 1].doneEntities : 0) })); const all = [...s, ...t]; return { totals: { totalStories: s.length, totalTasks: t.length, doneStories: s.filter(x => isDone(x.status)).length, doneTasks: t.filter(x => isDone(x.status)).length, totalEffort: totalEffort, effortCompleted: all.reduce((a, x) => a + num(x.effort_completed), 0), remain: all.reduce((a, x) => a + num(x.remain), 0) }, trend: trend, dist: dist, meta: { from: days[0], to: days[days.length - 1], days: days.length, entities: ents.length } }; })()"
+    depends_on: [iteration, dates, story_changes, task_changes]
+
+report:
+  format: markdown
+  template: |
+    # 迭代燃尽数据 — ${steps.iteration.data.0.name}（${steps.iteration.data.0.startdate} ~ ${steps.iteration.data.0.enddate}）
+
+    - 总量快照: 需求 ${steps.burndown.data.totals.totalStories}（done ${steps.burndown.data.totals.doneStories}），任务 ${steps.burndown.data.totals.totalTasks}（done ${steps.burndown.data.totals.doneTasks}）
+    - 工时: 总预估 ${steps.burndown.data.totals.totalEffort} h / 已完成 ${steps.burndown.data.totals.effortCompleted} h / 剩余 ${steps.burndown.data.totals.remain} h
+    - 趋势窗口: ${steps.burndown.data.meta.from} ~ ${steps.burndown.data.meta.to}（${steps.burndown.data.meta.days} 天，${steps.burndown.data.meta.entities} 个实体，已剔除 zzz-delete-me* 测试数据）
+
+    ## 按日趋势（完成日回放）
+    | 日期 | 累计完成(件) | 剩余(件) | 累计消耗工时(h) | 剩余工时(h) |
+    |---|---|---|---|---|
+    ${steps.burndown.data.trend | rows date,doneEntities,remainEntities,burnEffort,remainEffort}
+
+    ## 完成量按日分布
+    | 日期 | 当日完成(件) |
+    |---|---|
+    ${steps.burndown.data.dist | rows date,completed}
+
+    ---
+    口径：剩余量按「完成日回放」近似，非实时小时级燃尽——实体完成日取变更记录 status→done 的最早时间，缺失时回退实体 completed 字段；当日消耗工时按实体 effort 预估整额计入完成日（故与 effort_completed 口径的快照值可能不等）；趋势窗口取迭代 startdate~今日（上限 120 天，未来开始的迭代退化为今日单点）；变更查询按迭代实体 id 合并多 ID 查询（limit 200，超限截断不翻页）。

package/templates/pm/schedule-standup.yaml

@@ -0,0 +1,109 @@
+# 站会三段式材料（软考第10章 进度管理，纯只读 L0）
+# 三段式：昨日完成 / 今日计划 / 阻塞扫描，全部按人（owner）分组
+# 数据源：迭代 stories/tasks/bugs 快照 + story_changes/task_changes（按迭代实体 id 列表
+# 合并成 TAPD 多 ID 查询，逗号分隔，控制步骤规模为 2 次 changes 调用而非逐实体查询）
+# 用法: tapd pm schedule standup [--iteration <id>] [--dry-run]
+name: schedule-standup
+domain: schedule
+title: 站会三段式材料（昨日变更/今日计划/阻塞扫描，按人分组）
+write: false
+unwrap: true
+vars:
+  iteration_id: ""
+steps:
+  - id: iteration
+    uses: tapd_get_iterations
+    args:
+      id: "${vars.iteration_id}"
+      fields: "id,name,startdate,enddate,status"
+
+  - id: stories
+    uses: tapd_get_stories
+    args:
+      iteration_id: "${vars.iteration_id}"
+      fields: "id,name,owner,status,begin,due"
+      limit: 200
+    filter: "!item.name.startsWith('zzz-delete-me')"
+
+  - id: tasks
+    uses: tapd_get_tasks
+    args:
+      iteration_id: "${vars.iteration_id}"
+      fields: "id,name,owner,status,progress,begin,due"
+      limit: 200
+    filter: "!item.name.startsWith('zzz-delete-me')"
+
+  - id: bugs
+    uses: tapd_get_bugs
+    args:
+      iteration_id: "${vars.iteration_id}"
+      fields: "id,title,current_owner,status"
+      limit: 200
+    filter: "!item.title.startsWith('zzz-delete-me')"
+
+  - id: dates
+    expr: "(() => { const fmt = ms => new Date(ms).toISOString().slice(0, 10); const base = new Date(today + 'T00:00:00Z').getTime(); return { today: today, yesterday: fmt(base - 86400000) }; })()"
+
+  - id: story_ids
+    expr: "(steps.stories.data.length > 0 ? steps.stories.data.map(s => String(s.id)).join(',') : '0')"
+    depends_on: [stories]
+
+  - id: task_ids
+    expr: "(steps.tasks.data.length > 0 ? steps.tasks.data.map(t => String(t.id)).join(',') : '0')"
+    depends_on: [tasks]
+
+  - id: story_changes
+    uses: tapd_get_story_changes
+    args:
+      story_id: "${steps.story_ids.data}"
+      fields: "story_id,field,old_value,new_value,created,author"
+      limit: 200
+    depends_on: [story_ids]
+
+  - id: task_changes
+    uses: tapd_get_task_changes
+    args:
+      task_id: "${steps.task_ids.data}"
+      fields: "task_id,field,old_value,new_value,created,author"
+      limit: 200
+    depends_on: [task_ids]
+
+  - id: standup
+    expr: "(() => { const arr = v => Array.isArray(v) ? v : (v && Array.isArray(v.data) ? v.data : []); const num = v => { const n = Number(String(v ?? '').replace('%', '')); return Number.isFinite(n) ? n : 0; }; const ownerOf = v => { const s = String(v ?? '').trim(); return s === '' ? '(未分派)' : s; }; const DONE = ['done', 'closed', 'close', 'completed', 'finish', 'finished', 'delivered', 'resolved']; const isDone = st => DONE.includes(String(st ?? '').toLowerCase()); const s = arr(steps.stories.data), t = arr(steps.tasks.data), b = arr(steps.bugs.data); const sc = arr(steps.story_changes.data), tc = arr(steps.task_changes.data); const y = steps.dates.data.yesterday, td = steps.dates.data.today; const evts = [...sc.map(c => ({ kind: 'story', id: String(c.story_id), field: c.field, nw: c.new_value, created: c.created, author: c.author })), ...tc.map(c => ({ kind: 'task', id: String(c.task_id), field: c.field, nw: c.new_value, created: c.created, author: c.author }))]; const recent = evts.filter(c => String(c.created ?? '').slice(0, 10) >= y); const doneEvts = recent.filter(c => c.field === 'status' && isDone(c.nw)); const doneRows = []; const seen = new Set(); for (const e of doneEvts) { const key = e.kind + ':' + e.id; if (seen.has(key)) continue; seen.add(key); const ent = e.kind === 'story' ? s.find(x => String(x.id) === e.id) : t.find(x => String(x.id) === e.id); doneRows.push({ owner: ownerOf(ent ? ent.owner : ''), kind: e.kind, id: e.id, name: ent ? ent.name : '(迭代外实体)', author: e.author ?? '', at: String(e.created ?? '').slice(0, 10) }); } const planRows = t.filter(x => !isDone(x.status)).map(x => ({ owner: ownerOf(x.owner), id: String(x.id), name: x.name, status: x.status, progress: num(x.progress), begin: x.begin ?? '', due: x.due ?? '' })); const blockRows = planRows.filter(r => r.progress === 0 && r.begin !== '' && r.begin < td).map(r => ({ owner: r.owner, id: r.id, name: r.name, begin: r.begin, due: r.due, status: r.status })); const bugMap = {}; for (const g of b) { if (isDone(g.status)) continue; const o = ownerOf(g.current_owner); bugMap[o] = (bugMap[o] ?? 0) + 1; } const bugRows = Object.keys(bugMap).sort().map(o => ({ owner: o, openBugs: bugMap[o] })); const owners = [...new Set([...doneRows.map(r => r.owner), ...planRows.map(r => r.owner), ...blockRows.map(r => r.owner), ...bugRows.map(r => r.owner)])].sort(); const summary = owners.map(o => ({ owner: o, doneYesterday: doneRows.filter(r => r.owner === o).length, plannedToday: planRows.filter(r => r.owner === o).length, blocked: blockRows.filter(r => r.owner === o).length, openBugs: bugMap[o] ?? 0 })); return { summary: summary, doneRows: doneRows, planRows: planRows, blockRows: blockRows, bugRows: bugRows, counts: { today: td, yesterday: y, changes: recent.length, done: doneRows.length, planned: planRows.length, blocked: blockRows.length, storyCount: s.length, taskCount: t.length, bugCount: b.length } }; })()"
+    depends_on: [iteration, bugs, dates, story_changes, task_changes]
+
+report:
+  format: markdown
+  template: |
+    # 站会三段式材料 — ${steps.iteration.data.0.name}（${steps.iteration.data.0.startdate} ~ ${steps.iteration.data.0.enddate}）
+
+    - 数据窗口: 昨日 ${steps.standup.data.counts.yesterday} → 今日 ${steps.standup.data.counts.today}
+    - 范围: 需求 ${steps.standup.data.counts.storyCount} / 任务 ${steps.standup.data.counts.taskCount} / 缺陷 ${steps.standup.data.counts.bugCount}（已剔除 zzz-delete-me* 测试数据）；昨日以来变更事件 ${steps.standup.data.counts.changes} 条
+
+    ## 按人汇总
+    | 处理人 | 昨日完成 | 今日计划 | 阻塞 | 未解 bug |
+    |---|---|---|---|---|
+    ${steps.standup.data.summary | rows owner,doneYesterday,plannedToday,blocked,openBugs}
+
+    ## 一、昨日完成（${steps.standup.data.counts.done}）
+    | 处理人 | 类型 | id | 名称 | 变更人 | 完成日 |
+    |---|---|---|---|---|---|
+    ${steps.standup.data.doneRows | rows owner,kind,id,name,author,at}
+
+    ## 二、今日计划（${steps.standup.data.counts.planned}）
+    | 处理人 | id | 任务 | 状态 | 进度% | begin | due |
+    |---|---|---|---|---|---|---|
+    ${steps.standup.data.planRows | rows owner,id,name,status,progress,begin,due}
+
+    ## 三、阻塞扫描（${steps.standup.data.counts.blocked}）
+    | 处理人 | id | 任务 | begin | due | 状态 |
+    |---|---|---|---|---|---|
+    ${steps.standup.data.blockRows | rows owner,id,name,begin,due,status}
+
+    ## 未解 bug 分布
+    | 处理人 | 未解 bug |
+    |---|---|
+    ${steps.standup.data.bugRows | rows owner,openBugs}
+
+    ---
+    口径：昨日完成 = story/task 变更记录中 status → done 类状态且 created >= 昨日（每实体去重取首条，按实体当前 owner 归组）；今日计划 = 迭代内未完成任务；阻塞 = 任务 progress=0 且 begin < 今日；未解 bug = 状态不在 done/closed/... 的迭代内缺陷。变更查询按迭代实体 id 列表合并多 ID 查询（limit 200，超限截断不翻页；空迭代以 id=0 占位保证步骤可执行）。