@maxiaochao/pi-toolkit 0.9.3 → 0.9.6

package/packages/codex-edit/benchmark/run-with-budget.mjs

@@ -0,0 +1,77 @@
+#!/usr/bin/env node
+import { spawn } from "node:child_process";
+import { readFile } from "node:fs/promises";
+
+function usage(message) {
+  if (message) console.error(message);
+  console.error("Usage: run-with-budget.mjs --progress <progress.json> --stop-cost <usd> --max-cost <usd> -- <command> [args...]");
+  process.exit(2);
+}
+
+const separator = process.argv.indexOf("--");
+if (separator < 0) usage("Missing -- before the runner command");
+const options = process.argv.slice(2, separator);
+const command = process.argv.slice(separator + 1);
+const valueFor = (name) => {
+  const index = options.indexOf(name);
+  return index < 0 ? undefined : options[index + 1];
+};
+const progressPath = valueFor("--progress");
+const stopCost = Number(valueFor("--stop-cost"));
+const maxCost = Number(valueFor("--max-cost"));
+if (!progressPath || !command.length || !Number.isFinite(stopCost) || !Number.isFinite(maxCost) || stopCost <= 0 || maxCost < stopCost) usage();
+
+function observedCost(progress) {
+  return (progress.results ?? []).reduce((sum, result) => sum + (result.recovery?.attempts ?? []).reduce(
+    (attemptSum, attempt) => attemptSum + Number(attempt.execution?.costUsd ?? 0),
+    0,
+  ), 0);
+}
+
+const child = spawn(command[0], command.slice(1), {
+  stdio: "inherit",
+  detached: process.platform !== "win32",
+});
+let stopping = false;
+const stop = (signal = "SIGTERM") => {
+  if (stopping) return;
+  stopping = true;
+  if (process.platform === "win32") child.kill(signal);
+  else process.kill(-child.pid, signal);
+};
+process.on("SIGINT", () => stop("SIGINT"));
+process.on("SIGTERM", () => stop("SIGTERM"));
+
+const timer = setInterval(async () => {
+  try {
+    const progress = JSON.parse(await readFile(progressPath, "utf8"));
+    const cost = observedCost(progress);
+    if (cost >= stopCost) {
+      console.error(`Budget stop: observed $${cost.toFixed(6)} >= scheduling threshold $${stopCost.toFixed(6)}`);
+      stop();
+    }
+  } catch (error) {
+    if (error?.code !== "ENOENT") console.error(`Budget monitor warning: ${error.message}`);
+  }
+}, 1_000);
+timer.unref();
+
+const exit = await new Promise((resolve) => child.on("exit", (code, signal) => resolve({ code, signal })));
+clearInterval(timer);
+let finalCost = 0;
+try {
+  finalCost = observedCost(JSON.parse(await readFile(progressPath, "utf8")));
+} catch {}
+if (finalCost > maxCost) {
+  console.error(`HARD BUDGET VIOLATION: observed $${finalCost.toFixed(6)} > $${maxCost.toFixed(6)}`);
+  process.exit(3);
+}
+if (stopping) {
+  console.error(`Runner stopped by budget gate at $${finalCost.toFixed(6)} (hard cap $${maxCost.toFixed(6)})`);
+  process.exit(0);
+}
+if (exit.signal) {
+  console.error(`Runner exited from ${exit.signal}`);
+  process.exit(1);
+}
+process.exit(exit.code ?? 1);

package/packages/codex-edit/benchmark/schedule.mjs

@@ -0,0 +1,19 @@
+export function interleaveNeutralAndChallenge(entries, neutralPerChallenge = 4) {
+  if (!Number.isInteger(neutralPerChallenge) || neutralPerChallenge < 1) {
+    throw new Error("neutralPerChallenge must be a positive integer");
+  }
+  const neutral = entries.filter((entry) => entry.cohort === "neutral");
+  const challenge = entries.filter((entry) => entry.cohort === "challenge");
+  const unknown = entries.filter((entry) => !["neutral", "challenge"].includes(entry.cohort));
+  if (unknown.length) throw new Error(`Unknown cohort: ${unknown[0].cohort}`);
+  if (neutral.length !== challenge.length * neutralPerChallenge) {
+    throw new Error(`Expected a ${neutralPerChallenge}:1 neutral/challenge ratio, found ${neutral.length}:${challenge.length}`);
+  }
+
+  const scheduled = [];
+  for (let index = 0; index < challenge.length; index += 1) {
+    scheduled.push(...neutral.slice(index * neutralPerChallenge, (index + 1) * neutralPerChallenge));
+    scheduled.push(challenge[index]);
+  }
+  return scheduled;
+}

package/packages/codex-edit/benchmark/select-tasks.mjs

@@ -0,0 +1,167 @@
+#!/usr/bin/env node
+
+import { createHash } from "node:crypto";
+import { execFileSync } from "node:child_process";
+import { mkdirSync, writeFileSync } from "node:fs";
+import { dirname, resolve } from "node:path";
+import { interleaveNeutralAndChallenge } from "./schedule.mjs";
+
+const SOURCE_COMMIT = "5827e3fb65845f4b76adb06e5919d94ec4ffd5cf";
+const SEED = "pi-toolkit-codex-edit-100-v1";
+const output = resolve("packages/codex-edit/benchmark/explicit-edit-100.json");
+const sourceFlag = process.argv.indexOf("--source");
+if (sourceFlag < 0 || !process.argv[sourceFlag + 1]) {
+  throw new Error("Usage: node select-tasks.mjs --source /path/to/explicit-edit-benchmark");
+}
+const source = resolve(process.argv[sourceFlag + 1]);
+const commit = execFileSync("git", ["rev-parse", "HEAD"], { cwd: source, encoding: "utf8" }).trim();
+if (commit !== SOURCE_COMMIT) throw new Error(`Expected source ${SOURCE_COMMIT}, found ${commit}`);
+
+const tasks = JSON.parse(
+  execFileSync(process.execPath, ["scripts/list-tasks.mjs"], {
+    cwd: source,
+    encoding: "utf8",
+    maxBuffer: 10 * 1024 * 1024,
+  }),
+);
+if (tasks.length !== 226) throw new Error(`Expected 226 source tasks, found ${tasks.length}`);
+
+const neutralQuotas = new Map([
+  ["language-replace", 13],
+  ["language-select", 13],
+  ["language-insert", 13],
+  ["literal", 4],
+  ["replace-all", 3],
+  ["select-one", 3],
+  ["unicode-fix", 3],
+  ["unique", 2],
+  ["multi-file", 2],
+  ["select-subset", 2],
+  ["delete-subset", 2],
+  ["insert-subset", 2],
+  ["distinct-edits", 2],
+  ["replace-block", 2],
+  ["delete-block", 2],
+  ["move-block", 2],
+  ["copy-block", 2],
+  ["insert-block", 2],
+  ["insert-payload", 2],
+  ["copy-within", 2],
+  ["move-between", 2],
+]);
+
+const challengeQuotas = new Map([
+  ["select-one", 1],
+  ["select-subset", 2],
+  ["delete-subset", 1],
+  ["insert-subset", 1],
+  ["multi-file", 2],
+  ["move-between", 2],
+  ["distinct-edits", 2],
+  ["replace-block", 1],
+  ["delete-block", 1],
+  ["move-block", 1],
+  ["copy-block", 1],
+  ["insert-block", 1],
+  ["insert-payload", 1],
+  ["copy-within", 1],
+  ["literal", 1],
+  ["unicode-fix", 1],
+]);
+
+const byCategory = new Map();
+for (const task of tasks) {
+  const group = byCategory.get(task.category) ?? [];
+  group.push(task);
+  byCategory.set(task.category, group);
+}
+if ([...neutralQuotas.values()].reduce((sum, count) => sum + count, 0) !== 80) {
+  throw new Error("Neutral quotas must total 80");
+}
+if ([...challengeQuotas.values()].reduce((sum, count) => sum + count, 0) !== 20) {
+  throw new Error("Challenge quotas must total 20");
+}
+if ([...byCategory.keys()].some((category) => !neutralQuotas.has(category))) {
+  throw new Error("Neutral quotas do not cover every source category");
+}
+
+const rank = (label, task) =>
+  createHash("sha256")
+    .update(`${SEED}\0${label}\0${task.id}\0${task.fixtureSha256}`)
+    .digest("hex");
+const compareRank = (label) => (left, right) => rank(label, left).localeCompare(rank(label, right));
+
+const neutral = [];
+for (const [category, quota] of neutralQuotas) {
+  const group = byCategory.get(category) ?? [];
+  if (group.length < quota) throw new Error(`Insufficient neutral tasks in ${category}`);
+  neutral.push(...group.toSorted(compareRank(`neutral:${category}`)).slice(0, quota));
+}
+const selectedIds = new Set(neutral.map((task) => task.id));
+
+const challenge = [];
+for (const [category, quota] of challengeQuotas) {
+  const candidates = (byCategory.get(category) ?? [])
+    .filter((task) => !selectedIds.has(task.id))
+    .toSorted((left, right) =>
+      right.scale - left.scale ||
+      Number(right.variant === "unicode") - Number(left.variant === "unicode") ||
+      compareRank(`challenge:${category}`)(left, right),
+    );
+  if (candidates.length < quota) throw new Error(`Insufficient challenge tasks in ${category}`);
+  const chosen = candidates.slice(0, quota);
+  challenge.push(...chosen);
+  for (const task of chosen) selectedIds.add(task.id);
+}
+
+const entry = (task, cohort) => ({
+  id: task.id,
+  fixtureSha256: task.fixtureSha256,
+  category: task.category,
+  scale: task.scale,
+  language: task.language,
+  variant: task.variant,
+  cohort,
+  reasons: [{ profile: "pi-toolkit", reason: `${cohort}-cohort-v1` }],
+});
+const selected = [
+  ...neutral.toSorted((left, right) => left.id.localeCompare(right.id)).map((task) => entry(task, "neutral")),
+  ...challenge
+    .toSorted((left, right) => left.id.localeCompare(right.id))
+    .map((task) => entry(task, "challenge")),
+];
+const included = interleaveNeutralAndChallenge(selected);
+if (included.length !== 100 || new Set(included.map(({ id }) => id)).size !== 100) {
+  throw new Error("Selection must contain 100 unique tasks");
+}
+
+const excluded = tasks
+  .filter((task) => !selectedIds.has(task.id))
+  .toSorted((left, right) => left.id.localeCompare(right.id))
+  .map((task) => ({
+    id: task.id,
+    fixtureSha256: task.fixtureSha256,
+    reasons: [{ profile: "pi-toolkit", reason: "not-selected-v1" }],
+  }));
+const manifest = {
+  version: 1,
+  criterion: "frozen-proportional-80-plus-declared-challenge-20-v1",
+  profiles: ["native-edit", "released-codex-edit", "local-codex-edit"],
+  source: {
+    repository: "https://github.com/alexshpunt/explicit-edit-benchmark",
+    commit: SOURCE_COMMIT,
+    taskCount: tasks.length,
+  },
+  selection: {
+    seed: SEED,
+    neutral: Object.fromEntries(neutralQuotas),
+    challenge: Object.fromEntries(challengeQuotas),
+    challengeOrdering: "descending scale, Unicode first, then seeded SHA-256 rank",
+    scheduling: "four-neutral-then-one-challenge-v1",
+  },
+  included,
+  excluded,
+};
+mkdirSync(dirname(output), { recursive: true });
+writeFileSync(output, `${JSON.stringify(manifest, null, 2)}\n`);
+console.log(`Wrote ${output}: ${neutral.length} neutral + ${challenge.length} challenge`);

package/{extensions → packages}/codex-edit/codex-edit-explainer.html

@@ -135,20 +135,20 @@ footer { max-width: 1180px; margin: 0 auto; padding: 0 26px 54px; color: var(--m
   <div class="topbar-inner">
     <div class="brand">Pi <span>apply_patch</span> 方案说明</div>
     <nav class="nav" aria-label="页面导航">
-      <a href="#answer">结论</a><a href="#architecture">架构</a><a href="#config">配置</a><a href="#principle">原理</a><a href="#evidence">数据</a>
+      <a href="#answer">结论</a><a href="#install">安装</a><a href="#architecture">架构</a><a href="#config">配置</a><a href="#principle">原理</a><a href="#evidence">数据</a>
     </nav>
   </div>
 </header>
 <main>
   <section class="hero-grid" id="answer">
     <div>
-      <div class="eyebrow">GPT-5.6 / Pi / Codex-style editing</div>
+      <div class="eyebrow">GPT-5.6 / Pi / Codex harness apply_patch</div>
       <h1>它变好了，但改善主要在“第一次编辑能不能正确开始”。</h1>
-      <p class="lede">公平对照下，apply_patch 没有提升最终正确率，却把 GPT-5.6 的首次编辑成功率从 85% 提到 95%，并消除了观察到的编辑协议失败。它适合作为 GPT/Codex 模型的候选工具，不应无条件替代所有模型的 edit。</p>
+      <p class="lede">这个扩展让选中的 GPT 模型在 Pi 中使用与 Codex harness 相同的 apply_patch 协议；其他模型仍使用 Pi 原生 edit。公平对照下，GPT-5.6 的首次编辑成功率从 85% 提到 95%，并消除了观察到的编辑协议失败。</p>
     </div>
     <aside class="signal">
-      <strong>当前包状态：可安装，按模型路由</strong>
-      <p>这个 npm 包包含真正的 apply_patch extension。安装后，GPT/Codex 模型按配置使用 apply_patch，其他模型继续使用 edit。</p>
+      <strong>当前状态：根包内置，也可单独安装</strong>
+      <p><code>@maxiaochao/pi-toolkit</code> 默认包含本扩展；只需要 apply_patch 时可安装 <code>@maxiaochao/pi-codex-edit</code>。两种方式使用同一份实现。</p>
     </aside>
   </section>
 
@@ -161,6 +161,26 @@ footer { max-width: 1180px; margin: 0 auto; padding: 0 26px 54px; color: var(--m
     </div>
   </section>
 
+  <section class="section" id="install">
+    <div class="section-head"><div><div class="eyebrow">Distribution</div><h2>完整工具包与独立子包二选一</h2></div><p class="section-note">同时安装没有额外收益，还可能重复注册 <code>apply_patch</code>。</p></div>
+    <div class="explain">
+      <article class="panel">
+        <span class="badge green">完整工具包</span>
+        <h3 style="margin-top:16px">随 pi-toolkit 默认加载</h3>
+        <div class="code-wrap"><button class="copy" data-copy="toolkit-install">复制</button><pre id="toolkit-install">pi install npm:@maxiaochao/pi-toolkit
+pi update npm:@maxiaochao/pi-toolkit</pre></div>
+        <p>根 manifest 直接加载 <code>packages/codex-edit/extensions/codex-edit.ts</code>。只有发布了新的 toolkit 版本，根包用户才会收到 Codex Edit 更新。</p>
+      </article>
+      <article class="panel">
+        <span class="badge amber">独立子包</span>
+        <h3 style="margin-top:16px">只安装 Codex Edit</h3>
+        <div class="code-wrap"><button class="copy" data-copy="child-install">复制</button><pre id="child-install">pi install npm:@maxiaochao/pi-codex-edit
+pi update npm:@maxiaochao/pi-codex-edit</pre></div>
+        <p>子包拥有独立版本和发布流程。只发布子包不会更新已安装的 toolkit；实现或配置变更需要分别发布两个 npm 包。</p>
+      </article>
+    </div>
+  </section>
+
   <section class="section">
     <div class="section-head"><div><div class="eyebrow">先解释指标</div><h2>“编辑协议失败：1 → 0”到底是什么？</h2></div><p class="section-note">这是本次 benchmark 自定义的分类名，不是 HTTP、Responses API 或 custom tool 协议错误。</p></div>
     <div class="explain">
@@ -187,7 +207,7 @@ footer { max-width: 1180px; margin: 0 auto; padding: 0 26px 54px; color: var(--m
       <div class="arch-row">
         <div class="arch-node"><small>01 · Model state</small><strong>当前模型配置</strong><p>ctx.model.provider、api、id、compat 能力标记。</p></div>
         <div class="arch-arrow">→</div>
-        <div class="arch-node"><small>02 · Routing</small><strong>syncEditorTools()</strong><p>命中的 GPT/Codex 模型启用 apply_patch；其他模型启用 edit。</p></div>
+        <div class="arch-node"><small>02 · Routing</small><strong>syncEditorTools()</strong><p>ID glob 和 Responses API 均命中时启用 apply_patch；其他模型启用 Pi edit。</p></div>
         <div class="arch-arrow">→</div>
         <div class="arch-node"><small>03 · Provider</small><strong>Responses serializer</strong><p>Grammar 支持时序列化为 type=custom + Lark definition，否则回退为普通 function tool。</p></div>
         <div class="arch-arrow">→</div>
@@ -210,51 +230,52 @@ footer { max-width: 1180px; margin: 0 auto; padding: 0 26px 54px; color: var(--m
   </section>
 
   <section class="section" id="config">
-    <div class="section-head"><div><div class="eyebrow">Configuration</div><h2>当前配置与可选扩展</h2></div><p class="section-note">默认只为已稳定验证的 Sol High 启用；Luna 的性能结果存在长尾波动，需要显式 opt-in。</p></div>
+    <div class="section-head"><div><div class="eyebrow">Configuration</div><h2>当前模型路由</h2></div><p class="section-note">默认覆盖 Responses API 上的全部 <code>gpt-5.6-*</code> 变体；provider 不参与匹配。</p></div>
     <div class="tabs" role="tablist" aria-label="配置视图">
       <button class="tab" role="tab" aria-selected="true" aria-controls="config-current" id="tab-current">当前实际配置</button>
-      <button class="tab" role="tab" aria-selected="false" aria-controls="config-recommended" id="tab-recommended">Luna 显式启用</button>
+      <button class="tab" role="tab" aria-selected="false" aria-controls="config-recommended" id="tab-recommended">添加模型</button>
       <button class="tab" role="tab" aria-selected="false" aria-controls="config-route" id="tab-route">路由规则</button>
     </div>
     <div class="tab-panel active" id="config-current" role="tabpanel" aria-labelledby="tab-current">
       <div class="code-wrap"><button class="copy" data-copy="current-config">复制</button><pre id="current-config">{
   "enabled": true,
   "models": [
-    { "provider": "pudu-openai-proxy", "model": "gpt-5.6-sol" }
+    "gpt-5.6-*"
   ]
 }</pre></div>
-      <div class="callout">models.json 中的 provider API key 不在页面展示。建议使用环境变量或 Pi auth 存储，并轮换已经出现在配置文件中的 key。</div>
+      <div class="callout">路由还要求 <code>model.api</code> 为 <code>openai-responses</code> 或 <code>openai-codex-responses</code>。grammar 不可用时 Pi 回退为普通 function tool。</div>
     </div>
     <div class="tab-panel" id="config-recommended" role="tabpanel" aria-labelledby="tab-recommended">
       <div class="code-wrap"><button class="copy" data-copy="recommended-config">复制</button><pre id="recommended-config">{
   "enabled": true,
   "models": [
-    { "provider": "pudu-openai-proxy", "model": "gpt-5.6-sol" },
-    { "provider": "pudu-openai-proxy", "model": "gpt-5.6-luna" }
+    "gpt-5.6-*",
+    "gpt-5.7-*",
+    "my-codex-model"
   ]
 }</pre></div>
-      <p>Luna High 的有效重测中，两组都 20/20 正常结束，最终正确率都是 18/20；首次编辑成功率为 edit 90%、apply_patch 100%。按 17 个两组都正确的配对样本，apply_patch 中位总耗时多 2.3s；按全部 20 个配对样本，中位多 1.2s，9 例更快、11 例更慢。因此 Luna 有协议适配收益，但没有稳定的总耗时优势，当前不默认启用。</p>
+      <p>每项按完整 <code>model.id</code> 做区分大小写的匹配，<code>*</code> 是通配符。精确 ID 也可以直接作为规则。添加规则只改变路由，不代表模型已经通过协议验证；未命中规则的模型继续使用 Pi 原生 <code>edit</code>。</p>
     </div>
     <div class="tab-panel" id="config-route" role="tabpanel" aria-labelledby="tab-route">
       <div class="code-wrap"><button class="copy" data-copy="route-rule">复制</button><pre id="route-rule">model = ctx.model
 
 if enabled
 and model.api in ["openai-responses", "openai-codex-responses"]
-and provider/model matches allowlist:
+and model.id matches any models glob:
     active = ["apply_patch"]
 else:
     active = ["edit"]
 
 # Preserve all unrelated active tools.
 # Register both tools permanently for session replay.</pre></div>
-      <p>切换发生在 <code>session_start</code> 和 <code>model_select</code>。不重新定义同名工具，只改变 active tool 集合。</p>
+      <p><code>provider</code> 不参与匹配；即使 ID 命中，其他 API 上的模型仍使用 Pi <code>edit</code>。切换发生在 <code>session_start</code> 和 <code>model_select</code>。独立包修改 <code>config.json</code>，完整 toolkit 修改 <code>packages/codex-edit/config.json</code>，但包更新可能覆盖本地配置。</p>
     </div>
   </section>
 
   <section class="section" id="principle">
     <div class="section-head"><div><div class="eyebrow">Design principles</div><h2>这个工具的三个核心原则</h2></div></div>
     <div class="principles">
-      <article class="principle"><h3>模型协议对齐</h3><p>GPT/Codex 模型不再被要求适应 Pi 自定义的 <code>oldText/newText</code> JSON；它看到原生的 <code>apply_patch</code> 名称和 patch grammar。</p></article>
+      <article class="principle"><h3>模型协议对齐</h3><p>选中的 GPT 模型不再被要求适应 Pi 自定义的 <code>oldText/newText</code> JSON；它看到与 Codex harness 相同的 <code>apply_patch</code> 名称和 patch grammar。</p></article>
       <article class="principle"><h3>执行端独立防护</h3><p>grammar 不是安全策略。执行端仍要做 workspace 边界、符号链接、目录、覆盖冲突、权限和取消检查。</p></article>
       <article class="principle"><h3>按能力选择，不靠 AGENTS 对抗</h3><p>不在 AGENTS 中要求模型“不要使用 apply_patch”。扩展只让模型看到适合自己的一个编辑工具，避免两套协议同时暴露。</p></article>
     </div>
@@ -276,7 +297,7 @@ else:
       </tbody>
     </table>
     <div class="panel" style="margin-top:18px">
-      <div class="status"><i></i>最终判断：候选实现保留，默认自动启用暂不打开</div>
+      <div class="status"><i></i>最终判断：已投入使用，但只对 allowlist 中的 GPT/Codex 模型路由 apply_patch</div>
       <p>本页的耗时比较优先使用同一 fixture 的配对差值，避免两组成功样本构成不同造成中位数偏差。runner 的 180s 进程上限是删失边界，不是 API timeout；本次有效 Luna 重测没有触发该上限。</p>
     </div>
   </section>
@@ -284,14 +305,14 @@ else:
   <section class="section">
     <div class="section-head"><div><div class="eyebrow">Files</div><h2>实现位置</h2></div></div>
     <div class="panel">
-      <p><code>extensions/codex-edit/index.ts</code>：工具注册、执行、防护、renderer 和模型路由。</p>
-      <p><code>extensions/codex-edit/parser.ts</code>：patch grammar 对应的 parser、hunk matcher 和 workspace path resolver。</p>
-      <p><code>extensions/codex-edit/tests/parser.test.mjs</code>：6 个纯函数/文件操作测试，当前全部通过。</p>
-      <p><code>/home/maxiaochao/.pi/agent/evaluations/gpt-edit-benchmark/report-final.md</code>：最终 benchmark 报告。</p>
+      <p><code>packages/codex-edit/extensions/codex-edit.ts</code>：工具注册、执行、防护、renderer 和模型路由。</p>
+      <p><code>packages/codex-edit/src/parser.ts</code>：patch grammar 对应的 parser、顺序 hunk matcher、同路径 update 合并和 workspace path resolver。</p>
+      <p><code>packages/codex-edit/tests/</code>：22 个 Node 测试与 12 个共享对比 case，覆盖 native edit vs local Codex Edit、released v0.1.7 vs local parser、matcher、路径、结构重构、报告重建和工作区边界。</p>
+      <p><code>packages/codex-edit/docs/test-report.html</code>：当前自包含测试报告；同目录 Markdown 是权威中间源。</p>
     </div>
   </section>
 </main>
-<footer>说明页基于 Pi 0.84.4、Codex apply_patch 源码分析和 20-case GPT-5.6 benchmark。页面内没有包含任何 API key。</footer>
+<footer>说明页基于 Pi 0.85.1、Codex apply_patch 源码分析、历史 20-case 证据和已完成的 100-task 三臂基准。正式运行完成 300/300 条 chain，本地版满足全部验收门槛；页面内没有包含任何 API key。</footer>
 <script>
 const tabs = [...document.querySelectorAll('.tab')];
 const panels = [...document.querySelectorAll('.tab-panel')];