@yfwu2020/dsh-selection-explain 0.10.4 → 0.10.6

package/lib/host/effort.js

@@ -0,0 +1,239 @@
+/**
+ * 设置页那四个格子（**规范档位**）。
+ *
+ * 它们不是发给模型的 id，而是一份"意图词汇"：关（尽量不思考）/ 低 / 高 / 最高。
+ * 各 adapter 的档位词汇表并不统一 —— 本机 74 个模型上就数出七种：
+ *   off>low>high>max ／ low>high>max ／ high>max ／ off>minimal>low>medium>high ／
+ *   off>low>medium>high>xhigh>max ／ low>medium>high>xhigh ／ minimal>low>medium>high>xhigh ／
+ *   max（只有一档）／ 一档都不声明（不支持推理）。
+ * 落到哪个真实档位由 `mapEffortToModel` 算（纯函数，有单测）。
+ */
+const EFFORT_CANONICAL = ['off', 'low', 'high', 'max'];
+/**
+ * 档位名 → "思考深度"刻度（认 id，也认显示名；比较前会去掉空格/下划线/连字符并转小写）。
+ *
+ * 刻度只用来**比较深浅**，绝对数值没有意义。锚点取最常见的五档：off 0 / low 2 /
+ * medium 4 / high 6 / max 8，其余名字插在它们之间（minimal 在 off 与 low 之间、
+ * xhigh 在 high 与 max 之间）。认不出的名字不在这张表里 —— 由 `rankEfforts` 按位置插值。
+ */
+const EFFORT_RANK = {
+    off: 0, none: 0, disabled: 0, no: 0, nocontext: 0,
+    minimal: 1, minimum: 1, least: 1, tiny: 1,
+    low: 2, light: 2,
+    mid: 3, moderate: 3,
+    medium: 4,
+    high: 6,
+    xhigh: 7, veryhigh: 7,
+    max: 8, maximum: 8, highest: 8,
+    ultra: 9, extreme: 9,
+};
+/** 归一化档位名：'X-High' / 'very high' / 'x_high' 都算一个东西。 */
+function normEffortName(value) {
+    return String(value ?? '')
+        .trim()
+        .toLowerCase()
+        .replace(/[\s_-]+/g, '');
+}
+/**
+ * 每个声明档位的刻度：认得的名字用表，不认识的按**位置**在已知邻居之间线性插值
+ * （两头都没有已知锚点时按序号平铺到 0..8）。最后钳成不递减 —— 各 adapter 的声明都是升序，
+ * 插值不该把这个顺序弄反。
+ */
+function rankEfforts(declared) {
+    const known = declared.map((item) => {
+        const byId = EFFORT_RANK[normEffortName(item.id)];
+        if (byId !== undefined)
+            return byId;
+        const byName = EFFORT_RANK[normEffortName(item.name)];
+        return byName === undefined ? null : byName;
+    });
+    const n = declared.length;
+    const ranks = [];
+    for (let i = 0; i < n; i += 1) {
+        const hit = known[i];
+        if (hit !== null && hit !== undefined) {
+            ranks.push(hit);
+            continue;
+        }
+        let left = -1;
+        for (let l = i - 1; l >= 0; l -= 1) {
+            if (known[l] !== null && known[l] !== undefined) {
+                left = l;
+                break;
+            }
+        }
+        let right = -1;
+        for (let r = i + 1; r < n; r += 1) {
+            if (known[r] !== null && known[r] !== undefined) {
+                right = r;
+                break;
+            }
+        }
+        const leftRank = left >= 0 ? known[left] : null;
+        const rightRank = right >= 0 ? known[right] : null;
+        if (leftRank !== null && rightRank !== null) {
+            ranks.push(leftRank + ((rightRank - leftRank) * (i - left)) / (right - left));
+        }
+        else if (leftRank !== null) {
+            ranks.push(leftRank + (i - left));
+        }
+        else if (rightRank !== null) {
+            ranks.push(rightRank - (right - i));
+        }
+        else {
+            ranks.push(n > 1 ? (8 * i) / (n - 1) : 0);
+        }
+    }
+    for (let i = 1; i < n; i += 1) {
+        if (ranks[i] < ranks[i - 1])
+            ranks[i] = ranks[i - 1];
+    }
+    return ranks;
+}
+/**
+ * 规范四格 → 当前模型**真实声明**的档位（返回 '' 表示这个模型没有可发的档位）。
+ *
+ * 规则一条到底（对 `off>low>high>max` 这类 4 档模型恰好是恒等映射）：
+ *   · 关   → 声明里**最弱**的那档（模型没有 off 这类档时，就是它"能关到"的最小思考）
+ *   · 最高 → 声明里**最强**的那档
+ *   · 低/高 → 在整条刻度上取 1/3、2/3 处**最近的档**；候选**排除两端**（最弱那档留给「关」、
+ *     最强那档留给「最高」，四个格子于是各有落点），并保证 关 ≤ 低 ≤ 高 ≤ 最高 单调；
+ *     同样近时「低」取更浅的、「高」取更深的 —— 低要省、高要深。
+ *
+ * ⚠️ 这里**没有**任何按模型写死的表：输入只有"这个模型自己声明的档位列表"。
+ * 名字认得出来（off/low/high/max、minimal、xhigh…）就用名字的深度刻度；认不出来
+ * （别的 adapter 可能叫 a/b/c、tier1/tier2，或者干脆是数字）就按**它在声明里的位置**插值 ——
+ * 所以任何用户换任何模型都能落位，插件作者没见过那个模型也能映射。
+ * 为什么不让「低/高」也去抢最弱那档：那两个格子表达的是"开着思考、但别太深"，
+ * 落到"关"那一档等于**把用户要的思考关掉**；只有「关」该动那一档。
+ * 只有一档可发时（如 kimi-k3 只有 max），四格都落到它 —— 模型没有别的选择。
+ *
+ * 返回 '' 表示"这个模型没有可发的档位"（声明为空），调用方据此**不带** reasoningEffort。
+ */
+export function mapEffortToModel(declared, canonical) {
+    const list = (declared ?? []).filter((item) => item && typeof item.id === 'string' && item.id.length > 0);
+    if (list.length === 0)
+        return '';
+    if (list.length === 1)
+        return list[0].id;
+    const slot = EFFORT_CANONICAL.includes(canonical) ? canonical : 'off';
+    const ranks = rankEfforts(list);
+    // 两端：按刻度取最浅/最深；同样深时**以声明顺序为准**（声明在前的那档更弱、在后的更强）。
+    // 不能只按下标取首尾：adapter 万一声明得不严格升序，按下标就选错了；也不能只按刻度取最大，
+    // 那样 `…>max>ultra` 这种"更强但刻度相同"的档会被 max 抢走。
+    let weakest = 0;
+    let strongest = 0;
+    for (let i = 1; i < list.length; i += 1) {
+        if (ranks[i] < ranks[weakest])
+            weakest = i;
+        if (ranks[i] >= ranks[strongest])
+            strongest = i;
+    }
+    if (slot === 'max')
+        return list[strongest].id;
+    if (slot !== 'low' && slot !== 'high')
+        return list[weakest].id;
+    const pool = [];
+    for (let i = 0; i < list.length; i += 1) {
+        if (i !== weakest && i !== strongest)
+            pool.push(i);
+    }
+    // 中间两档没人可选时（只有"最弱 + 最强"两档）：都落到最强 —— 最弱那档留给「关」
+    if (pool.length === 0)
+        return list[strongest].id;
+    const span = ranks[strongest] - ranks[weakest];
+    const target = ranks[weakest] + span * (slot === 'low' ? 1 / 3 : 2 / 3);
+    const preferDeeper = slot === 'high';
+    let best = pool[0];
+    let bestDistance = Math.abs(ranks[best] - target);
+    for (const index of pool) {
+        const distance = Math.abs(ranks[index] - target);
+        const closer = distance < bestDistance;
+        const tie = distance === bestDistance;
+        if (closer || (tie && (preferDeeper ? ranks[index] > ranks[best] : ranks[index] < ranks[best]))) {
+            best = index;
+            bestDistance = distance;
+        }
+    }
+    return list[best].id;
+}
+/**
+ * 一个模型的四格映射（设置页给用户看的就是它；请求时也走这份算）。
+ * 返回空串的格子表示"没有可发的档位"（模型不支持推理时四个格子都是空串）。
+ */
+export function effortMapOf(declared) {
+    const out = {};
+    for (const slot of EFFORT_CANONICAL)
+        out[slot] = mapEffortToModel(declared, slot);
+    return out;
+}
+/**
+ * 清单里查不到这个模型时的兜底阶梯。
+ * 只列**最常见**的四档（与客户端 `FALLBACK_TIERS` 同一份）：多出来的 `medium` 很多模型
+ * 并不声明，而 dsh-llm 对"声明里没有的档"是**直接抛错**（不 clamp）—— 兜底时不该去撞它。
+ */
+const EFFORT_LADDER_FALLBACK = ['off', 'low', 'high', 'max'];
+/** 档位的中文名（notice 文案用，与客户端 TIER_LABEL 一致）。 */
+export const EFFORT_LABEL = { off: '关', low: '低', medium: '中', high: '高', max: '最大' };
+/**
+ * 这条上游错误是不是"**我们发的这个档位**不被接受"。
+ *
+ * ⚠️ 判据必须窄。免费/预览端点的上游会**偶发**返回
+ * `Reasoning is mandatory for this endpoint and cannot be disabled.` ——
+ * 2026-10-09 实测（`opencode-go/step-5-preview-free`，交错发送排除时间漂移）：
+ *   · effort=low 成功 5/8；effort=high 成功 5/8 —— **同一档位时好时坏，档位不是变量**；
+ *   · 对照模型 `longcat-2.5-preview-free` 6/6 成功（连 off 都收）。
+ * 所以只认"明确说这个档位无效"的措辞；"必须开推理"另有一条判据
+ * （见 looksLikeReasoningRequired，只在**我们发的是关档**时才算数）。
+ * 把偶发失败当成"档位不支持"会连锁出三个错：给用户一句错诊断、把失败永久记进
+ * noOffRoutes（以后再也不发这个档）、清掉用户选的档位。
+ */
+export function looksLikeUnsupportedTier(message) {
+    const tier = '(?:reasoning|effort|thinking|推理|思考|档位?)';
+    const bad = '(?:unsupported|not\\s+support|invalid|unrecognized|不支持|无效|不认识)';
+    return (new RegExp(`${bad}[^。\\n]{0,24}${tier}`, 'i').test(message) ||
+        new RegExp(`${tier}[^。\\n]{0,24}${bad}`, 'i').test(message));
+}
+/** 上游要求"必须开推理"——只有在**我们这次把推理关掉**（发的 off）时，这句才是冲我们来的。 */
+export function looksLikeReasoningRequired(message) {
+    return (/(?:reasoning|thinking|推理|思考)/i.test(message) &&
+        /(?:mandatory|required|must|cannot\s+be\s+disabled|必须|不能(?:被)?关闭|不可关闭)/i.test(message));
+}
+/**
+ * 换一个"没试过的"档位（重试用）。
+ *
+ * 为什么**绝不能省略档位**（老代码就是省略）：省略 = 请求里不带 reasoning，
+ * 对"必须开推理"的端点等于把推理关掉 —— 实测 20 次这样的重试 **0 次成功**，
+ * 而同一档位首发成功率约 60%。省略比"发一个可能不被接受的档"更糟。
+ *
+ * 顺序：模型自己声明的 defaultEffort → 沿档位阶梯往上走一格（离"关"越远越安全）。
+ * 返回空串表示"没档位可换了"，调用方就不重试。
+ */
+export function pickNextEffort(declared, defaultEffort, rejected, tried) {
+    const usable = (id) => !!id && id !== rejected && !tried.has(id);
+    if (usable(defaultEffort))
+        return defaultEffort;
+    // 用**模型自己的声明顺序**（各 adapter 都是从最省到最深），"往上走一格"才落在它真实的下一档上。
+    // 老写法是"我方五档阶梯 ∩ 声明"，看不见 minimal / xhigh / none 这类 id —— 而按刻度映射之后，
+    // 被拒的那个很可能正是这类 id（indexOf 得到 -1 → 退回最弱的那档，方向正好反了）。
+    const order = declared.length > 0 ? declared : EFFORT_LADDER_FALLBACK;
+    const start = order.indexOf(rejected);
+    // ① 先往上走：离「关」越远越安全（不吃 off 的模型通常都吃更高的档）
+    for (let i = (start < 0 ? 0 : start + 1); i < order.length; i += 1) {
+        const id = order[i];
+        if (usable(id))
+            return id;
+    }
+    // ② 再按"通常最稳"的顺序退（模型拒的是 max 时往上没得走，该退到 high，而不是退回 off ——
+    //    off 恰恰是最容易被拒的那一档）
+    for (const id of ['high', 'medium', 'low', 'max', 'off']) {
+        if (order.includes(id) && usable(id))
+            return id;
+    }
+    // ③ 兜底：声明里剩下的
+    for (const id of order)
+        if (usable(id))
+            return id;
+    return '';
+}
+//# sourceMappingURL=effort.js.map

package/lib/host/effort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"effort.js","sourceRoot":"","sources":["../../src/host/effort.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AACH,MAAM,gBAAgB,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAA;AAEtD;;;;;;GAMG;AACH,MAAM,WAAW,GAA2B;IAC1C,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC;IACjD,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC;IACzC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;IAChB,GAAG,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC;IACnB,MAAM,EAAE,CAAC;IACT,IAAI,EAAE,CAAC;IACP,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC;IACrB,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC;IAC9B,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC;CACrB,CAAA;AAED,uDAAuD;AACvD,SAAS,cAAc,CAAC,KAAc;IACpC,OAAO,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;SACvB,IAAI,EAAE;SACN,WAAW,EAAE;SACb,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAA;AAC5B,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAAC,QAA8C;IACjE,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QAClC,MAAM,IAAI,GAAG,WAAW,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;QACjD,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,IAAI,CAAA;QACnC,MAAM,MAAM,GAAG,WAAW,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;QACrD,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAA;IAC7C,CAAC,CAAC,CAAA;IACF,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAA;IACzB,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;QACpB,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACf,SAAQ;QACV,CAAC;QACD,IAAI,IAAI,GAAG,CAAC,CAAC,CAAA;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;gBAChD,IAAI,GAAG,CAAC,CAAA;gBACR,MAAK;YACP,CAAC;QACH,CAAC;QACD,IAAI,KAAK,GAAG,CAAC,CAAC,CAAA;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAClC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;gBAChD,KAAK,GAAG,CAAC,CAAA;gBACT,MAAK;YACP,CAAC;QACH,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAE,KAAK,CAAC,IAAI,CAAY,CAAC,CAAC,CAAC,IAAI,CAAA;QAC3D,MAAM,SAAS,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAE,KAAK,CAAC,KAAK,CAAY,CAAC,CAAC,CAAC,IAAI,CAAA;QAC9D,IAAI,QAAQ,KAAK,IAAI,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YAC5C,KAAK,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAA;QAC/E,CAAC;aAAM,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;QACnC,CAAC;aAAM,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YAC9B,KAAK,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAA;QACrC,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC3C,CAAC;IACH,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE;YAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAA;IACzD,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,gBAAgB,CAAC,QAA8C,EAAE,SAAiB;IAChG,MAAM,IAAI,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,OAAO,IAAI,CAAC,EAAE,KAAK,QAAQ,IAAI,IAAI,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IACzG,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAA;IAChC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,CAAE,CAAC,EAAE,CAAA;IACzC,MAAM,IAAI,GAAG,gBAAgB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAA;IACrE,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,CAAA;IAC/B,iDAAiD;IACjD,mDAAmD;IACnD,2CAA2C;IAC3C,IAAI,OAAO,GAAG,CAAC,CAAA;IACf,IAAI,SAAS,GAAG,CAAC,CAAA;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,IAAI,KAAK,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,OAAO,CAAE;YAAE,OAAO,GAAG,CAAC,CAAA;QAC5C,IAAI,KAAK,CAAC,CAAC,CAAE,IAAI,KAAK,CAAC,SAAS,CAAE;YAAE,SAAS,GAAG,CAAC,CAAA;IACnD,CAAC;IACD,IAAI,IAAI,KAAK,KAAK;QAAE,OAAO,IAAI,CAAC,SAAS,CAAE,CAAC,EAAE,CAAA;IAC9C,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC,OAAO,CAAE,CAAC,EAAE,CAAA;IAC/D,MAAM,IAAI,GAAa,EAAE,CAAA;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,SAAS;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACpD,CAAC;IACD,8CAA8C;IAC9C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,SAAS,CAAE,CAAC,EAAE,CAAA;IACjD,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAE,GAAG,KAAK,CAAC,OAAO,CAAE,CAAA;IAChD,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAE,GAAG,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IACxE,MAAM,YAAY,GAAG,IAAI,KAAK,MAAM,CAAA;IACpC,IAAI,IAAI,GAAG,IAAI,CAAC,CAAC,CAAE,CAAA;IACnB,IAAI,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,GAAG,MAAM,CAAC,CAAA;IAClD,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAE,GAAG,MAAM,CAAC,CAAA;QACjD,MAAM,MAAM,GAAG,QAAQ,GAAG,YAAY,CAAA;QACtC,MAAM,GAAG,GAAG,QAAQ,KAAK,YAAY,CAAA;QACrC,IAAI,MAAM,IAAI,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAE,GAAG,KAAK,CAAC,IAAI,CAAE,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAE,GAAG,KAAK,CAAC,IAAI,CAAE,CAAC,CAAC,EAAE,CAAC;YACpG,IAAI,GAAG,KAAK,CAAA;YACZ,YAAY,GAAG,QAAQ,CAAA;QACzB,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAE,CAAC,EAAE,CAAA;AACvB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,QAA8C;IACxE,MAAM,GAAG,GAA2B,EAAE,CAAA;IACtC,KAAK,MAAM,IAAI,IAAI,gBAAgB;QAAE,GAAG,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;IACjF,OAAO,GAAG,CAAA;AACZ,CAAC;AAED;;;;GAIG;AACH,MAAM,sBAAsB,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAA;AAE5D,6CAA6C;AAC7C,MAAM,CAAC,MAAM,YAAY,GAA2B,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,CAAA;AAE7G;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,wBAAwB,CAAC,OAAe;IACtD,MAAM,IAAI,GAAG,yCAAyC,CAAA;IACtD,MAAM,GAAG,GAAG,gEAAgE,CAAA;IAC5E,OAAO,CACL,IAAI,MAAM,CAAC,GAAG,GAAG,gBAAgB,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QAC3D,IAAI,MAAM,CAAC,GAAG,IAAI,gBAAgB,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAC5D,CAAA;AACH,CAAC;AAED,wDAAwD;AACxD,MAAM,UAAU,0BAA0B,CAAC,OAAe;IACxD,OAAO,CACL,+BAA+B,CAAC,IAAI,CAAC,OAAO,CAAC;QAC7C,wEAAwE,CAAC,IAAI,CAAC,OAAO,CAAC,CACvF,CAAA;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,cAAc,CAC5B,QAAkB,EAClB,aAAwC,EACxC,QAAgB,EAChB,KAAkB;IAElB,MAAM,MAAM,GAAG,CAAC,EAA6B,EAAgB,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;IACzG,IAAI,MAAM,CAAC,aAAa,CAAC;QAAE,OAAO,aAAa,CAAA;IAC/C,yDAAyD;IACzD,kEAAkE;IAClE,mDAAmD;IACnD,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,sBAAsB,CAAA;IACrE,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;IACrC,uCAAuC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACnE,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;QACnB,IAAI,MAAM,CAAC,EAAE,CAAC;YAAE,OAAO,EAAE,CAAA;IAC3B,CAAC;IACD,wDAAwD;IACxD,uBAAuB;IACvB,KAAK,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;QACzD,IAAI,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC;YAAE,OAAO,EAAE,CAAA;IACjD,CAAC;IACD,cAAc;IACd,KAAK,MAAM,EAAE,IAAI,KAAK;QAAE,IAAI,MAAM,CAAC,EAAE,CAAC;YAAE,OAAO,EAAE,CAAA;IACjD,OAAO,EAAE,CAAA;AACX,CAAC"}

package/lib/host/filters.js

@@ -0,0 +1,132 @@
+/** 返回一个 JSON 响应。 */
+/**
+ * 把模型**内联在正文里**的思考块拆出来。
+ *
+ * 为什么要它：有的模型（实测 opencode-go 上的 minimax-m3 偶发）不走 reasoning 通道，
+ * 而是把整段思考当正文吐出来，形如 `<think>The user wants…</think>`——
+ * 不处理的话，用户看到的"答案"就是一大段思考（实测报过"输出错乱、把思考也输出了"）。
+ *
+ * 流式难点是标签可能被切成两块（"...<thi" + "nk>..."），所以没找到标签时**留一小截尾巴**再输出。
+ */
+const THINK_TAGS = 'think|thinking|reasoning|analysis|scratchpad';
+const THINK_OPEN = new RegExp(`<(${THINK_TAGS})\\s*>`, 'i');
+const THINK_CLOSE = new RegExp(`</(${THINK_TAGS})\\s*>`, 'i');
+const THINK_TAIL = 24;
+export function createThinkFilter() {
+    let buffer = '';
+    let inside = false;
+    const drain = (final) => {
+        let text = '';
+        let think = '';
+        for (;;) {
+            if (inside) {
+                const close = THINK_CLOSE.exec(buffer);
+                if (!close) {
+                    if (final) {
+                        think += buffer;
+                        buffer = '';
+                    }
+                    else if (buffer.length > THINK_TAIL) {
+                        think += buffer.slice(0, buffer.length - THINK_TAIL);
+                        buffer = buffer.slice(-THINK_TAIL);
+                    }
+                    break;
+                }
+                think += buffer.slice(0, close.index);
+                buffer = buffer.slice(close.index + close[0].length);
+                inside = false;
+                continue;
+            }
+            const open = THINK_OPEN.exec(buffer);
+            if (!open) {
+                if (final) {
+                    text += buffer;
+                    buffer = '';
+                }
+                else if (buffer.length > THINK_TAIL) {
+                    text += buffer.slice(0, buffer.length - THINK_TAIL);
+                    buffer = buffer.slice(-THINK_TAIL);
+                }
+                break;
+            }
+            text += buffer.slice(0, open.index);
+            buffer = buffer.slice(open.index + open[0].length);
+            inside = true;
+        }
+        return { text, think };
+    };
+    return {
+        push: (chunk) => {
+            buffer += chunk;
+            return drain(false);
+        },
+        flush: () => drain(true),
+    };
+}
+/**
+ * 检测"思考被写进正文"的泄漏段。
+ *
+ * 实测 omen-alpha 在 `off` 档（上游 none）时不走 reasoning 通道，把整段英文推理当正文吐出来：
+ * 「The user is asking which model I am. According to my instructions…我是 Omen Alpha。」
+ * —— 这种文本**不带任何标签**，靠 `<think>` 过滤器抓不到，只能按"开头是自我盘算"来认。
+ *
+ * 保守三条件，缺一不裁（宁可留着，也不误删正文）：
+ *   ① 逐句扫描，从开头起连续命中"元推理"句式；
+ *   ② 命中段以英文为主（≥80% ASCII 字母）；
+ *   ③ 剩下的正文里有中文（说明真正的答案是中文，被裁的不是答案）。
+ */
+const META_SENTENCE = /^\s*(?:The user|The question|The request|The person|According to (?:my|the)|Based on (?:my|the)|Per (?:my|the)|My (?:instructions|system prompt|guidelines)|I (?:should|must|need|will|am asked|always|usually|will just)|So I|Thus I|Therefore I|Instructed to|Now I (?:have|need|know|see)|Let me (?:verify|check|think|see|confirm)|I have (?:the|a|enough)|First,? I|OK,? (?:I|let)|用户(?:问|要求)的?是|根据(?:我的)?(?:指令|系统提示)|我应该|我需要|按照(?:我的)?(?:指令|系统提示))/i;
+/**
+ * 宽松判据：开头是**英文盘算**、后面才是**中文答案**。
+ * 只用来"记住这个模型在关档会泄漏"（下次自动抬档），**不用来裁剪** ——
+ * 裁错了会误删正文，而记错了只是下次少一个档位可选，代价不对称。
+ */
+export function looksLikeLeakedReasoning(text) {
+    const body = String(text || '');
+    if (body.length < 40)
+        return false;
+    const cut = body.search(/[\u4e00-\u9fff]/);
+    if (cut < 30)
+        return false;
+    const head = body.slice(0, cut);
+    const tail = body.slice(cut);
+    if (!/[\u4e00-\u9fff]/.test(tail))
+        return false;
+    const letters = head.replace(/[^A-Za-z]/g, '').length;
+    return letters / head.length >= 0.5;
+}
+export function splitLeakedReasoning(text) {
+    const body = String(text || '');
+    if (body.length < 40)
+        return { prefix: '', rest: body };
+    // 注意：不能用 split(/(?<=[.。!！?？])\s*/) —— 它会把句末空白吃掉，
+    // 于是拼回来的 prefix 与真正流出去的正文差一个空格，客户端 indexOf 匹配不上（实测踩过）。
+    // 这里保留分隔符本身，保证 parts.join('') === body。
+    const parts = body.match(/[^.。!！?？]*[.。!！?？]\s*|[^.。!！?？]+$/g) ?? [body];
+    // 从句首开始，连续吃"不含中文的句子"作为泄漏段。
+    // 为什么不是"必须命中元推理句式"：实测泄漏段里会夹着 "Previously I said something incorrect … — that was wrong."
+    // 这种自述句，逐句匹配元句式会在这里断掉、只裁掉前半段。结构判据（英文盘算 + 中文答案）更稳。
+    // 但仍然要求：整段里**至少有一句**命中元推理句式，避免把"英文开头的正常回答"误裁。
+    let index = 0;
+    let ascii = 0;
+    let metaHit = false;
+    while (index < parts.length && !/[\u4e00-\u9fff]/.test(parts[index])) {
+        if (META_SENTENCE.test(parts[index]))
+            metaHit = true;
+        ascii += (parts[index].match(/[A-Za-z]/g) || []).length;
+        index += 1;
+    }
+    if (index === 0 || !metaHit)
+        return { prefix: '', rest: body };
+    const head = parts.slice(0, index).join('');
+    const tail = parts.slice(index).join('');
+    if (!tail.trim())
+        return { prefix: '', rest: body }; // 整篇都是盘算：不裁（可能是模型只说了这些）
+    const letters = head.replace(/[^A-Za-z]/g, '').length;
+    if (head.length > 0 && letters / head.length < 0.5)
+        return { prefix: '', rest: body };
+    if (!/[\u4e00-\u9fff]/.test(tail))
+        return { prefix: '', rest: body };
+    return { prefix: head, rest: tail };
+}
+//# sourceMappingURL=filters.js.map

package/lib/host/filters.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filters.js","sourceRoot":"","sources":["../../src/host/filters.ts"],"names":[],"mappings":"AAEA,oBAAoB;AACpB;;;;;;;;GAQG;AACH,MAAM,UAAU,GAAG,8CAA8C,CAAA;AAEjE,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,KAAK,UAAU,QAAQ,EAAE,GAAG,CAAC,CAAA;AAE3D,MAAM,WAAW,GAAG,IAAI,MAAM,CAAC,MAAM,UAAU,QAAQ,EAAE,GAAG,CAAC,CAAA;AAE7D,MAAM,UAAU,GAAG,EAAE,CAAA;AAErB,MAAM,UAAU,iBAAiB;IAC/B,IAAI,MAAM,GAAG,EAAE,CAAA;IACf,IAAI,MAAM,GAAG,KAAK,CAAA;IAClB,MAAM,KAAK,GAAG,CAAC,KAAc,EAAmC,EAAE;QAChE,IAAI,IAAI,GAAG,EAAE,CAAA;QACb,IAAI,KAAK,GAAG,EAAE,CAAA;QACd,SAAS,CAAC;YACR,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBACtC,IAAI,CAAC,KAAK,EAAE,CAAC;oBACX,IAAI,KAAK,EAAE,CAAC;wBACV,KAAK,IAAI,MAAM,CAAA;wBACf,MAAM,GAAG,EAAE,CAAA;oBACb,CAAC;yBAAM,IAAI,MAAM,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC;wBACtC,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,UAAU,CAAC,CAAA;wBACpD,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,CAAA;oBACpC,CAAC;oBACD,MAAK;gBACP,CAAC;gBACD,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;gBACrC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;gBACpD,MAAM,GAAG,KAAK,CAAA;gBACd,SAAQ;YACV,CAAC;YACD,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YACpC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,IAAI,KAAK,EAAE,CAAC;oBACV,IAAI,IAAI,MAAM,CAAA;oBACd,MAAM,GAAG,EAAE,CAAA;gBACb,CAAC;qBAAM,IAAI,MAAM,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC;oBACtC,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,UAAU,CAAC,CAAA;oBACnD,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,CAAA;gBACpC,CAAC;gBACD,MAAK;YACP,CAAC;YACD,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;YACnC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;YAClD,MAAM,GAAG,IAAI,CAAA;QACf,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;IACxB,CAAC,CAAA;IACD,OAAO;QACL,IAAI,EAAE,CAAC,KAAa,EAAE,EAAE;YACtB,MAAM,IAAI,KAAK,CAAA;YACf,OAAO,KAAK,CAAC,KAAK,CAAC,CAAA;QACrB,CAAC;QACD,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;KACzB,CAAA;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,aAAa,GACjB,2bAA2b,CAAA;AAE7b;;;;GAIG;AACH,MAAM,UAAU,wBAAwB,CAAC,IAAY;IACnD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC,CAAA;IAC/B,IAAI,IAAI,CAAC,MAAM,GAAG,EAAE;QAAE,OAAO,KAAK,CAAA;IAClC,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAA;IAC1C,IAAI,GAAG,GAAG,EAAE;QAAE,OAAO,KAAK,CAAA;IAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;IAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IAC5B,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAA;IAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,MAAM,CAAA;IACrD,OAAO,OAAO,GAAG,IAAI,CAAC,MAAM,IAAI,GAAG,CAAA;AACrC,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,IAAY;IAC/C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC,CAAA;IAC/B,IAAI,IAAI,CAAC,MAAM,GAAG,EAAE;QAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;IACvD,iDAAiD;IACjD,uDAAuD;IACvD,wCAAwC;IACxC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,oCAAoC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACxE,2BAA2B;IAC3B,yFAAyF;IACzF,kDAAkD;IAClD,8CAA8C;IAC9C,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,OAAO,GAAG,KAAK,CAAA;IACnB,OAAO,KAAK,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;QACrE,IAAI,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAAE,OAAO,GAAG,IAAI,CAAA;QACpD,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAA;QACvD,KAAK,IAAI,CAAC,CAAA;IACZ,CAAC;IACD,IAAI,KAAK,KAAK,CAAC,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;IAC9D,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAC3C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACxC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;QAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA,CAAC,wBAAwB;IAC5E,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,MAAM,CAAA;IACrD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG;QAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;IACrF,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;IACpE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;AACrC,CAAC"}