dsh-dock 0.7.0 → 0.8.0

package/features/games/xiangqi-core.js

@@ -0,0 +1,299 @@
+/* 趣味游戏 · 象棋核心规则（纯函数，无 React）——供组件复用，也便于单测。 */
+export const ROWS = 10, COLS = 9;
+// 类型：g 将/帅 · a 仕/士 · e 相/象 · h 马 · k 车 · c 炮 · p 兵/卒
+// 颜色：r 红（下）· b 黑（上）
+
+export function pieceChar(p) {
+	const map = {
+		g: { r: "帥", b: "將" }, a: { r: "仕", b: "士" }, e: { r: "相", b: "象" },
+		h: { r: "馬", b: "馬" }, k: { r: "車", b: "車" }, c: { r: "炮", b: "炮" },
+		p: { r: "兵", b: "卒" },
+	};
+	return map[p.t] && map[p.t][p.c];
+}
+export const VALUE = { g: 100000, k: 900, c: 450, h: 400, e: 200, a: 200, p: 100 };
+
+export function initialBoard() {
+	const b = Array.from({ length: ROWS }, () => Array(COLS).fill(null));
+	const back = ["k", "h", "e", "a", "g", "a", "e", "h", "k"];
+	back.forEach((t, c) => { b[0][c] = { t, c: "b" }; });
+	b[2][1] = { t: "c", c: "b" }; b[2][7] = { t: "c", c: "b" };
+	// 黑卒在己方第三横线（row 3，紧邻楚河汉界一侧留一行间隔）。
+	[0, 2, 4, 6, 8].forEach((c) => { b[3][c] = { t: "p", c: "b" }; });
+	back.forEach((t, c) => { b[9][c] = { t, c: "r" }; });
+	b[7][1] = { t: "c", c: "r" }; b[7][7] = { t: "c", c: "r" };
+	// 红兵与红炮和黑方对称（row 6 / row 7）。
+	[0, 2, 4, 6, 8].forEach((c) => { b[6][c] = { t: "p", c: "r" }; });
+	return b;
+}
+export function cloneBoard(b) {
+	return b.map((row) => row.slice());
+}
+// 局面指纹：用于识别重复局面（防止 AI 无限循环将军）。
+export function posKey(board) {
+	let s = "";
+	for (const row of board) for (const p of row) s += p ? p.t + p.c : ".";
+	return s;
+}
+function inBounds(r, c) { return r >= 0 && r < ROWS && c >= 0 && c < COLS; }
+function inPalace(r, c, color) {
+	if (c < 3 || c > 5) return false;
+	return color === "r" ? r >= 7 && r <= 9 : r >= 0 && r <= 2;
+}
+function ownSide(r, color) { return color === "r" ? r >= 5 : r <= 4; }
+function crossedRiver(r, color) { return color === "r" ? r <= 4 : r >= 5; }
+function countBetween(board, r, c, tr, tc, dr, dc) {
+	let n = 0, rr = r + dr, cc = c + dc;
+	while (!(rr === tr && cc === tc)) {
+		if (rr < 0 || rr >= ROWS || cc < 0 || cc >= COLS) return -1;
+		if (board[rr][cc]) n += 1;
+		rr += dr; cc += dc;
+	}
+	return n;
+}
+
+export function attacks(board, r, c, tr, tc) {
+	const p = board[r][c];
+	if (!p) return false;
+	const dr = Math.sign(tr - r), dc = Math.sign(tc - c);
+	const t = board[tr][tc];
+	if (p.t === "k") {
+		if (r !== tr && c !== tc) return false;
+		return countBetween(board, r, c, tr, tc, dr, dc) === 0;
+	}
+	if (p.t === "c") {
+		if (r !== tr && c !== tc) return false;
+		if (dr === 0 && dc === 0) return false;
+		return countBetween(board, r, c, tr, tc, dr, dc) === 1 && !!t;
+	}
+	if (p.t === "h") {
+		const adr = Math.abs(tr - r), adc = Math.abs(tc - c);
+		if (!((adr === 2 && adc === 1) || (adr === 1 && adc === 2))) return false;
+		const legR = adr === 2 ? r + dr : r;
+		const legC = adc === 2 ? c + dc : c;
+		return !board[legR][legC];
+	}
+	if (p.t === "g") {
+		return Math.abs(tr - r) + Math.abs(tc - c) === 1 && inPalace(tr, tc, p.c);
+	}
+	if (p.t === "a") {
+		return Math.abs(tr - r) === 1 && Math.abs(tc - c) === 1 && inPalace(tr, tc, p.c);
+	}
+	if (p.t === "e") {
+		const adr = Math.abs(tr - r), adc = Math.abs(tc - c);
+		if (!(adr === 2 && adc === 2)) return false;
+		if (!ownSide(tr, p.c)) return false;
+		const eyeR = r + dr, eyeC = c + dc;
+		return !board[eyeR][eyeC];
+	}
+	if (p.t === "p") {
+		const forward = p.c === "r" ? r - 1 : r + 1;
+		if (tr === forward && tc === c) return true;
+		if (crossedRiver(r, p.c) && tr === r && Math.abs(tc - c) === 1) return true;
+		return false;
+	}
+	return false;
+}
+
+export function findGeneral(board, color) {
+	for (let r = 0; r < ROWS; r += 1) {
+		for (let c = 0; c < COLS; c += 1) {
+			const p = board[r][c];
+			if (p && p.t === "g" && p.c === color) return { r, c };
+		}
+	}
+	return null;
+}
+export function pseudoMoves(board, r, c) {
+	const p = board[r][c];
+	if (!p) return [];
+	const out = [];
+	const push = (nr, nc) => { if (inBounds(nr, nc)) out.push([nr, nc]); };
+	const clear = (nr, nc) => !board[nr][nc];
+	const enemy = (nr, nc) => { const q = board[nr][nc]; return q && q.c !== p.c; };
+	if (p.t === "g") {
+		[[-1, 0], [1, 0], [0, -1], [0, 1]].forEach(([dr, dc]) => {
+			const nr = r + dr, nc = c + dc;
+			if (inPalace(nr, nc, p.c) && (clear(nr, nc) || enemy(nr, nc))) push(nr, nc);
+		});
+	}
+	if (p.t === "a") {
+		[[-1, -1], [-1, 1], [1, -1], [1, 1]].forEach(([dr, dc]) => {
+			const nr = r + dr, nc = c + dc;
+			if (inPalace(nr, nc, p.c) && (clear(nr, nc) || enemy(nr, nc))) push(nr, nc);
+		});
+	}
+	if (p.t === "e") {
+		[[-2, -2], [-2, 2], [2, -2], [2, 2]].forEach(([dr, dc]) => {
+			const nr = r + dr, nc = c + dc, er = r + dr / 2, ec = c + dc / 2;
+			if (inBounds(nr, nc) && ownSide(nr, p.c) && !board[er][ec] && (clear(nr, nc) || enemy(nr, nc))) push(nr, nc);
+		});
+	}
+	if (p.t === "h") {
+		[[-2, -1], [-2, 1], [2, -1], [2, 1], [-1, -2], [-1, 2], [1, -2], [1, 2]].forEach(([dr, dc]) => {
+			const nr = r + dr, nc = c + dc;
+			const legR = Math.abs(dr) === 2 ? r + dr / 2 : r;
+			const legC = Math.abs(dc) === 2 ? c + dc / 2 : c;
+			if (inBounds(nr, nc) && !board[legR][legC] && (clear(nr, nc) || enemy(nr, nc))) push(nr, nc);
+		});
+	}
+	if (p.t === "k" || p.t === "c") {
+		[[-1, 0], [1, 0], [0, -1], [0, 1]].forEach(([dr, dc]) => {
+			let rr = r + dr, cc = c + dc, jumped = false;
+			while (inBounds(rr, cc)) {
+				const q = board[rr][cc];
+				if (p.t === "k") {
+					if (!q) push(rr, cc);
+					else { if (q.c !== p.c) push(rr, cc); break; }
+				} else {
+					if (!q && !jumped) push(rr, cc);
+					else if (q && !jumped) jumped = true;
+					else if (q && jumped) { if (q.c !== p.c) push(rr, cc); break; }
+				}
+				rr += dr; cc += dc;
+			}
+		});
+	}
+	if (p.t === "p") {
+		const forward = p.c === "r" ? -1 : 1;
+		[[forward, 0], [0, -1], [0, 1]].forEach(([dr, dc]) => {
+			const nr = r + dr, nc = c + dc;
+			if (!inBounds(nr, nc) || (dc !== 0 && !crossedRiver(r, p.c))) return;
+			if (clear(nr, nc) || enemy(nr, nc)) push(nr, nc);
+		});
+	}
+	return out;
+}
+export function applyMove(board, fr, fc, tr, tc) {
+	const nb = cloneBoard(board);
+	nb[tr][tc] = nb[fr][fc];
+	nb[fr][fc] = null;
+	return nb;
+}
+export function inCheck(board, color) {
+	const g = findGeneral(board, color);
+	if (!g) return true;
+	const enemy = color === "r" ? "b" : "r";
+	for (let r = 0; r < ROWS; r += 1) {
+		const p = board[r][g.c];
+		if (p && p.t === "g" && p.c === enemy) {
+			let clear = true;
+			const lo = Math.min(r, g.r), hi = Math.max(r, g.r);
+			for (let i = lo + 1; i < hi; i += 1) if (board[i][g.c]) { clear = false; break; }
+			if (clear) return true;
+		}
+	}
+	for (let r = 0; r < ROWS; r += 1) {
+		for (let c = 0; c < COLS; c += 1) {
+			const p = board[r][c];
+			if (p && p.c === enemy && attacks(board, r, c, g.r, g.c)) return true;
+		}
+	}
+	return false;
+}
+export function legalMoves(board, color) {
+	const out = [];
+	for (let r = 0; r < ROWS; r += 1) {
+		for (let c = 0; c < COLS; c += 1) {
+			const p = board[r][c];
+			if (!p || p.c !== color) continue;
+			for (const [nr, nc] of pseudoMoves(board, r, c)) {
+				const nb = applyMove(board, r, c, nr, nc);
+				if (!inCheck(nb, color)) out.push([r, c, nr, nc]);
+			}
+		}
+	}
+	return out;
+}
+export function hasLegalMoves(board, color) {
+	return legalMoves(board, color).length > 0;
+}
+function evaluatePosition(board) {
+	let score = 0;
+	for (let r = 0; r < ROWS; r += 1) {
+		for (let c = 0; c < COLS; c += 1) {
+			const p = board[r][c];
+			if (!p) continue;
+			let v = VALUE[p.t];
+			if (p.t === "p") v += crossedRiver(r, p.c) ? 50 : 0;
+			score += p.c === "b" ? v : -v;
+		}
+	}
+	return score;
+}
+function evalFrom(board, color) {
+	const e = evaluatePosition(board);
+	return color === "b" ? e : -e;
+}
+function negamax(board, color, depth, alpha, beta) {
+	const moves = legalMoves(board, color);
+	if (moves.length === 0) {
+		return color === "b" ? -1000000 + (10 - depth) : 1000000 - (10 - depth);
+	}
+	if (depth === 0) return evalFrom(board, color);
+	const enemy = color === "r" ? "b" : "r";
+	const ordered = orderMoves(board, moves);
+	let best = -Infinity;
+	for (const m of ordered) {
+		const nb = applyMove(board, m[0], m[1], m[2], m[3]);
+		const score = -negamax(nb, enemy, depth - 1, -beta, -alpha);
+		if (score > best) best = score;
+		if (best > alpha) alpha = best;
+		if (alpha >= beta) break;
+	}
+	return best;
+}
+function orderMoves(board, moves) {
+	const scored = moves.map((m) => {
+		let s = 0;
+		const target = board[m[2]][m[3]];
+		if (target) s += VALUE[target.t] * 10;
+		return { m, s };
+	});
+	scored.sort((a, b) => b.s - a.s);
+	return scored.map((o) => o.m);
+}
+// avoid：局面指纹 → 出现次数 的计数表。
+// 优先只在"从未出现过的局面"里选优；若全部重复，给出现次数越多的走法越大的罚分，
+// 避免来回倒子的死循环。根节点对评分相近（±TIE_EPSILON）的走法随机挑一个，
+// 防止每局都走出完全相同的呆板着法。
+export function bestMove(board, color, depth, avoid) {
+	const moves = legalMoves(board, color);
+	if (!moves.length) return null;
+	const enemy = color === "r" ? "b" : "r";
+	const ordered = orderMoves(board, moves);
+	let pool;
+	if (avoid && avoid.size) {
+		const seenCount = (m) => avoid.get(posKey(applyMove(board, m[0], m[1], m[2], m[3]))) || 0;
+		const minSeen = Math.min(...ordered.map(seenCount));
+		pool = minSeen === 0
+			? ordered.filter((m) => seenCount(m) === 0).map((m) => ({ m, pen: 0 }))
+			: ordered.map((m) => ({ m, pen: seenCount(m) * 60 })).sort((a, b) => a.pen - b.pen);
+	} else {
+		pool = ordered.map((m) => ({ m, pen: 0 }));
+	}
+	if (depth <= 1) {
+		return pickAmongBest(pool.map(({ m, pen }) => ({ m, s: evalFrom(applyMove(board, m[0], m[1], m[2], m[3]), color) - pen })));
+	}
+	let bestScore = -Infinity;
+	let alpha = -Infinity;
+	const scored = [];
+	for (const { m, pen } of pool) {
+		const nb = applyMove(board, m[0], m[1], m[2], m[3]);
+		// 窗口下界放宽 TIE_EPSILON：近似并列的走法仍能拿到精确评分，供随机挑选。
+		const s = -negamax(nb, enemy, depth - 1, -Infinity, -alpha) - pen;
+		scored.push({ m, s });
+		if (s > bestScore) {
+			bestScore = s;
+			alpha = Math.max(alpha, bestScore - TIE_EPSILON);
+		}
+	}
+	return pickAmongBest(scored);
+}
+const TIE_EPSILON = 12;
+function pickAmongBest(scored) {
+	let bestScore = -Infinity;
+	for (const o of scored) if (o.s > bestScore) bestScore = o.s;
+	const ties = scored.filter((o) => o.s >= bestScore - TIE_EPSILON);
+	return ties[Math.floor(Math.random() * ties.length)].m;
+}

package/features/tokenlog/host.js

@@ -52,7 +52,7 @@ export const feature = {
 
     // ===== 定价与金额估算 =====
     // 定价表以「人民币元 / 百万 tokens」为基准(DeepSeek/智谱官方刊例即人民币), 金额先算 CNY,
-    // 对外 cost(USD) = CNY / usdCnyRate, 客户端/CSV 再按 cost × usdCnyRate 还原人民币。
+    // 对外记录的 cost 保持 USD，供旧版客户端兼容；当前客户端和 CSV 统一展示人民币。
     // usdCnyRate 与 pricing 均可被 settings.yaml 覆盖:
     //   dsh-dock-tokenlog:
     //     usdCnyRate: 7.2                    # USD↔CNY 汇率
@@ -649,7 +649,7 @@ export const feature = {
             if (method === 'export') {
               loadPricingConfig()
               const list = buildQuery(payload || {})
-              const header = ['time', 'provider', 'model', 'apiKey', 'inputTokens', 'outputTokens', 'cacheReadTokens', 'cacheWriteTokens', 'reasoningTokens', 'billedInput', 'cacheHitPercent', 'totalTokens', 'cost', 'costCny', 'effort', 'status', 'statusCode', 'errorCode', 'errorMsg', 'llmMs', 'sessionId', 'turn', 'step']
+              const header = ['time', 'provider', 'model', 'apiKey', 'inputTokens', 'outputTokens', 'cacheReadTokens', 'cacheWriteTokens', 'reasoningTokens', 'billedInput', 'cacheHitPercent', 'totalTokens', 'costCny', 'effort', 'status', 'statusCode', 'errorCode', 'errorMsg', 'llmMs', 'sessionId', 'turn', 'step']
               const esc = (v) => {
                 const s = String(v === undefined || v === null ? '' : v)
                 return /[,"\n]/.test(s) ? '"' + s.replace(/"/g, '""') + '"' : s

package/features/tokenlog/view.jsx

@@ -37,13 +37,7 @@ function fmtCompact(n) {
 	if (n >= 1e3) return (n / 1e3).toFixed(1) + "K";
 	return String(Math.round(n));
 }
-function fmtCost(n) {
-	const v = Number(n) || 0;
-	if (v >= 10) return "$" + v.toFixed(2);
-	if (v >= 0.01) return "$" + v.toFixed(4);
-	return "$" + v.toFixed(6);
-}
-// 人民币金额: USD 按汇率换算, 默认 7.2(host 返回 rateUsdCny 可覆盖)
+// 金额记录在 RPC 中以 USD 传输；界面统一按人民币显示。
 function fmtCostCny(usd, rate) {
 	const v = (Number(usd) || 0) * (Number(rate) > 0 ? Number(rate) : 7.2);
 	if (v >= 10000) return "¥" + (v / 10000).toFixed(2) + "万";
@@ -170,7 +164,7 @@ function Detail({ rec, onClose, rate }) {
 		["计费输入", fmtNum(rec.billedInput)],
 		["缓存命中率", rec.cacheHitPercent + "%"],
 		["总 Token", fmtNum(rec.totalTokens)],
-		["消耗金额(估算)", fmtCost(rec.cost) + " ≈ " + fmtCostCny(rec.cost, rateCny)],
+		["消耗金额(估算)", fmtCostCny(rec.cost, rateCny)],
 		["推理强度", rec.effort || "—"],
 		["耗时", fmtDuration(rec.llmMs)],
 		["Turn / Step", rec.turn + " / " + rec.step],
@@ -350,8 +344,7 @@ export function TokenLogView(props) {
 		{ v: fmtCompact(totals.cacheReadTokens), l: "缓存命中" },
 		{ v: totals.cacheHitPct + "%", l: "缓存命中率" },
 		{ v: fmtCompact(totals.outputTokens), l: "输出" },
-		{ v: fmtCost(totals.cost), l: "消耗金额(估算)" },
-		{ v: fmtCostCny(totals.cost, rateCny), l: "消耗金额(¥)" },
+		{ v: fmtCostCny(totals.cost, rateCny), l: "消耗金额(估算·人民币)" },
 		{ v: fmtDuration(totals.llmMs), l: "累计耗时" + (totals.timed ? " (" + totals.timed + "步)" : "") },
 	] : [];
 
@@ -368,7 +361,6 @@ export function TokenLogView(props) {
 			<td>{r.key}</td><td>{fmtNum(r.calls)}</td><td>{fmtCompact(r.inputTokens)}</td>
 			<td>{fmtCompact(r.cacheReadTokens)}</td><td>{r.cacheHitPct + "%"}</td><td>{fmtCompact(r.outputTokens)}</td>
 			<td>{fmtCompact(r.totalTokens)}</td>
-			<td>{fmtCost(r.cost)}</td>
 			<td>{fmtCostCny(r.cost, rateCny)}</td>
 			<td>{fmtDuration(r.llmMs)}</td>
 		</tr>
@@ -394,7 +386,6 @@ export function TokenLogView(props) {
 				<td>{fmtNum(r.outputTokens)}</td>
 				<td>{fmtNum(r.reasoningTokens)}</td>
 				<td>{fmtNum(r.totalTokens)}</td>
-				<td>{fmtCost(r.cost)}</td>
 				<td>{fmtCostCny(r.cost, rateCny)}</td>
 				<td>{r.effort || "—"}</td>
 				<td>
@@ -418,7 +409,7 @@ export function TokenLogView(props) {
 		<div key="sumtab" className="dtok-table-wrap">
 			<table className="dtok-table">
 				<thead><tr>
-					<th>维度</th><th>调用</th><th>输入</th><th>缓存</th><th>命中率</th><th>输出</th><th>总Token</th><th>金额</th><th>金额(¥)</th><th>耗时</th>
+					<th>维度</th><th>调用</th><th>输入</th><th>缓存</th><th>命中率</th><th>输出</th><th>总Token</th><th>金额（人民币）</th><th>耗时</th>
 				</tr></thead>
 				<tbody>{summaryRows}</tbody>
 			</table>
@@ -451,7 +442,7 @@ export function TokenLogView(props) {
 					<thead><tr>
 						{sortTh("时间", "time")}{sortTh("会话ID", "sessionId")}{sortTh("提供商", "provider")}{sortTh("模型", "model")}
 						{sortTh("输入", "inputTokens")}{sortTh("缓存", "cacheReadTokens")}{sortTh("命中%", "cacheHitPercent")}{sortTh("输出", "outputTokens")}
-						{sortTh("推理", "reasoningTokens")}{sortTh("总额", "totalTokens")}{sortTh("金额", "cost")}{sortTh("金额(¥)", "cost")}{sortTh("强度", "effort")}
+						{sortTh("推理", "reasoningTokens")}{sortTh("总额", "totalTokens")}{sortTh("金额（人民币）", "cost")}{sortTh("强度", "effort")}
 						{sortTh("状态", "status")}{sortTh("耗时", "llmMs")}
 					</tr></thead>
 					<tbody>{detailRows}</tbody>
@@ -521,32 +512,32 @@ function TokenLogHomeStat() {
 	}, []);
 	if (!snap.totals) return <span>{snap.err ? "用量查询失败（点击进入查看）" : "正在拉取今日用量…"}</span>;
 	const t = snap.totals;
-	return <span>今日 {fmtNum(t.calls)} 次调用 · {fmtCompact(t.totalTokens)} Token · {fmtCost(t.cost)}（{fmtCostCny(t.cost, snap.rate)}）</span>;
+	return <span>今日 {fmtNum(t.calls)} 次调用 · {fmtCompact(t.totalTokens)} Token · {fmtCostCny(t.cost, snap.rate)}</span>;
 }
 
 // ---------- 会话输入区 chip：显示当前会话总 Token（10s 静默刷新），点击打开功能坞并按该会话筛选 ----------
 export function TokenLogChip(props) {
 	const sid = (props && props.sessionId) || (props && props.session && props.session.sessionId) || null;
-	const [snap, setSnap] = useState({ totals: null, err: "" });
+	const [snap, setSnap] = useState({ totals: null, rate: 7.2, err: "" });
 	useEffect(() => {
 		if (!sid) return;
 		let cancel = false;
 		const load = () => rpcCall("query", { sessionId: sid })
-			.then((d) => { if (!cancel) setSnap({ totals: d && d.totals, err: "" }); })
-			.catch((e) => { if (!cancel) setSnap((s) => ({ totals: s.totals, err: String((e && e.message) || e) })); });
+			.then((d) => { if (!cancel) setSnap({ totals: d && d.totals, rate: (d && d.rateUsdCny) || 7.2, err: "" }); })
+			.catch((e) => { if (!cancel) setSnap((s) => ({ totals: s.totals, rate: s.rate, err: String((e && e.message) || e) })); });
 		load();
 		const timer = setInterval(load, 10000);
 		return () => { cancel = true; clearInterval(timer); };
 	}, [sid]);
 	if (!sid) return null;
 	const t = snap.totals;
-	// chip 文案用紧凑金额（2 位小数）：fmtCost 对小金额输出 6 位小数，chip 里太长会撑爆输入卡工具行；
+	// chip 文案用紧凑人民币金额（2 位小数），避免撑爆输入卡工具行；
 	// 完整金额在 title 悬浮提示里。
 	const label = snap.err && !t
 		? (snap.err.includes("重启") ? "用量·需重启宿主" : "用量·失败")
-		: (t ? "⛁ " + fmtCompact(t.totalTokens) + (t.cost > 0 ? " · $" + t.cost.toFixed(2) : "") : "⛁ …");
+		: (t ? "⛁ " + fmtCompact(t.totalTokens) + (t.cost > 0 ? " · " + fmtCostCny(t.cost, snap.rate) : "") : "⛁ …");
 	const title = t
-		? "本会话 " + fmtNum(t.calls) + " 次调用 · " + fmtNum(t.totalTokens) + " Token · " + fmtCost(t.cost) + "（估算）\n点击在功能坞查看用量记录"
+		? "本会话 " + fmtNum(t.calls) + " 次调用 · " + fmtNum(t.totalTokens) + " Token · " + fmtCostCny(t.cost, snap.rate) + "（估算）\n点击在功能坞查看用量记录"
 		: (snap.err ? snap.err + "\n" : "") + "点击在功能坞查看用量记录";
 	return (
 		<button type="button" className={"dockchip" + (snap.err && !t ? " err" : "")} title={title} aria-label="会话用量"

package/index.js

@@ -19,7 +19,6 @@ import { feature as fVisionProxy } from './features/visionproxy/host.js'
 import { feature as fBalance } from './features/balance/host.js'
 import { feature as fTokenlog } from './features/tokenlog/host.js'
 import { feature as fAnimation } from './features/animation/host.js'
-import { feature as fMobileRelay } from './features/mobile-relay/host.js'
 
 export const name = 'dsh-dock'
 
@@ -39,7 +38,6 @@ export function apply(ctx) {
     fBalance,
     fTokenlog,
     fAnimation,
-    fMobileRelay,
   ]
 
   const state = new Map()

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "dsh-dock",
-  "version": "0.7.0",
+  "version": "0.8.0",
   "description": "DeepSeek Harness 功能坞插件（dsh-dock）：模块化功能中枢——每个功能一个 features/ 模块（可单独提取成包发布，又可经 dockBridge 装回面板）。含用量记录（LLM 调用记账/费用统计）、模型设置、图片理解代理、模型余额、任务动画（8 种氛围动效 + 桌面伙伴 3D 场景、完成通知与提示音、钉钉/飞书推送，开关独立、配置持久化）；侧栏入口 + 可拖拽弹窗（最大化/最小化/缩放）。",
   "type": "module",
   "main": "index.js",

package/src/client.jsx

@@ -24,13 +24,13 @@ import { feature as fHeartbeat } from "../features/heartbeat/view.js";
 import { feature as fTheme } from "../features/theme/view.js";
 import { feature as fBalance } from "../features/balance/view.js";
 import { feature as fAnimation } from "../features/animation/view.jsx";
-import { feature as fMobileRelay } from "../features/mobile-relay/view.jsx";
+import { feature as fGames } from "../features/games/view.jsx";
 
 const name = "dsh-dock";
-const DOCK_VERSION = "0.7.0";
+const DOCK_VERSION = "0.8.0";
 
 // ---- 内置功能注册表：新功能 = features/<id>/ 加模块 + 这里 import 一行 ----
-const BUILTIN_FEATURES = [fTokenlog, fModelconfig, fHeartbeat, fTheme, fBalance, fAnimation, fMobileRelay];
+const BUILTIN_FEATURES = [fTokenlog, fModelconfig, fHeartbeat, fTheme, fBalance, fAnimation, fGames];
 // 规划占位（路线图）：接入后移除并建 features/<id>/ 模块
 const PLANNED_FEATURES = [];
 const PLANNED_NOTES = {};
@@ -186,11 +186,16 @@ const SHELL_CSS = [
 	// 溢出兼容（两层防护，缺一不可）：
 	//  1) 宽度上限：宿主 .row 是 flex-wrap:wrap 且换行优先于收缩，chips 一长 tools 整行变宽，
 	//     右侧模型选择器/发送键被挤到第二行（左右错位）。宿主 .row 带 container-type:inline-size，
-	//     用容器单位 cqw 让上限随输入卡宽度自适应（窄卡少占、宽卡多占）；不支持 cqw 的老内核退回固定 280px。
+	//     用容器单位 cqw 让上限随输入卡宽度自适应（窄卡少占、宽卡多占）；不支持 cqw 的老内核退回固定值。
+	//     注意：旧上限 min(280px,36cqw) 仍偏宽——标准 780px 输入卡下（.row 内容约 762px），
+	//     add 钮(28)+工作区选择器(~214)+chips(280) 已与右侧模型选择器+发送键（~345px）合计超宽，
+	//     即便 chips 未截断 .row 也会换行把模型选择器/发送键挤到第二行。实测把上限收到 189px
+	//     （≈25cqw）并使 chips 内距收紧（padding 2px 6px、gap 2px）后，实测 4~6M 用量 + 余额
+	//     两 chip 可完整显示且不再换行；超限时仍被省略号截断，完整值在 title 悬浮提示里。
 	//  2) 截断：超限部分用省略号截断（完整数值在 title 悬浮提示里），防 chips 凸出输入卡圆角（悬空）。
-	".dockchip-row{display:inline-flex;align-items:center;gap:4px;min-width:0;flex:0 1 auto;overflow:hidden;max-width:280px;}",
-	"@supports (width:1cqw){.dockchip-row{max-width:min(280px,36cqw);}}",
-	".dockchip{display:inline-flex;align-items:center;gap:5px;cursor:pointer;border:none;background:transparent;color:var(--dsw-alias-label-tertiary);border-radius:8px;padding:2px 8px;font-family:inherit;font-size:11px;line-height:18px;white-space:nowrap;min-width:0;overflow:hidden;transition:background .15s var(--ds-ease-in-out),color .15s var(--ds-ease-in-out);}",
+	".dockchip-row{display:inline-flex;align-items:center;gap:2px;min-width:0;flex:0 1 auto;overflow:hidden;max-width:189px;}",
+	"@supports (width:1cqw){.dockchip-row{max-width:min(189px,25cqw);}}",
+	".dockchip{display:inline-flex;align-items:center;gap:5px;cursor:pointer;border:none;background:transparent;color:var(--dsw-alias-label-tertiary);border-radius:8px;padding:2px 6px;font-family:inherit;font-size:11px;line-height:18px;white-space:nowrap;min-width:0;overflow:hidden;transition:background .15s var(--ds-ease-in-out),color .15s var(--ds-ease-in-out);}",
 	".dockchip > span{overflow:hidden;text-overflow:ellipsis;white-space:nowrap;min-width:0;}",
 	".dockchip:hover{background:var(--dsw-alias-interactive-bg-hover);color:var(--dsw-alias-label-primary);}",
 	".dockchip .dockchip-dot{width:6px;height:6px;border-radius:50%;flex:none;}",
@@ -198,6 +203,13 @@ const SHELL_CSS = [
 ].join("\n");
 
 let dockCssTag = null;
+let initialCssSchedule = null;
+function cancelInitialCssSchedule() {
+	if (!initialCssSchedule || typeof window === "undefined") return;
+	if (initialCssSchedule.type === "idle" && typeof window.cancelIdleCallback === "function") window.cancelIdleCallback(initialCssSchedule.id);
+	if (initialCssSchedule.type === "timer") window.clearTimeout(initialCssSchedule.id);
+	initialCssSchedule = null;
+}
 function fullDockCss() {
 	const parts = [SHELL_CSS];
 	for (const f of BUILTIN_FEATURES) if (f.css) parts.push(f.css);
@@ -209,6 +221,7 @@ function fullDockCss() {
 // 外部功能注册携带样式时可重算更新（外部样式后到）。
 function ensureCss() {
 	if (typeof document === "undefined") return;
+	cancelInitialCssSchedule();
 	try {
 		if (!dockCssTag || !dockCssTag.isConnected) {
 			if (document.querySelector('style[data-plugin-css="dsh-dock"]')) {
@@ -224,6 +237,20 @@ function ensureCss() {
 		console.error("[dsh-dock] ensureCss failed:", e && e.message ? e.message : String(e));
 	}
 }
+// 刷新页时宿主内容优先绘制：功能坞样式很大，首帧同步解析会让整页短暂停顿。
+// 首次注入延后到浏览器空闲期；之后的外部模块注册仍走 ensureCss() 立即更新。
+function scheduleInitialCss() {
+	if (typeof document === "undefined" || initialCssSchedule || (dockCssTag && dockCssTag.isConnected)) return;
+	const run = () => {
+		initialCssSchedule = null;
+		ensureCss();
+	};
+	if (typeof window !== "undefined" && typeof window.requestIdleCallback === "function") {
+		initialCssSchedule = { type: "idle", id: window.requestIdleCallback(run, { timeout: 350 }) };
+	} else {
+		initialCssSchedule = { type: "timer", id: setTimeout(run, 48) };
+	}
+}
 
 // ---- 外部功能变化订阅 hook（弹层/设置页重渲染用） ----
 function useExternalVersion() {
@@ -277,9 +304,14 @@ function DockModal() {
 	// lastGeom 记住本页生命周期内最后一次几何，重开弹层时还原
 	const [win, setWin] = react.useState(() => ({ mode: "normal", x: null, y: null, w: null, h: null }));
 	const dlgRef = react.useRef(null);
+	const contentRef = react.useRef(null);
 	react.useEffect(() => {
 		if (lastGeom.w) setWin({ mode: "normal", x: lastGeom.x, y: lastGeom.y, w: lastGeom.w, h: lastGeom.h });
 	}, []);
+	// 切换左侧模块时总是从新页面顶部开始，避免把上一页的滚动位置带进小游戏等短页面。
+	react.useEffect(() => {
+		if (open && contentRef.current) contentRef.current.scrollTop = 0;
+	}, [active, open]);
 	function beginDrag(e, type) {
 		if (win.mode !== "normal" || e.button !== 0) return;
 		if (type === "move" && e.target && e.target.closest && e.target.closest("button,select,input")) return;
@@ -382,7 +414,7 @@ function DockModal() {
 							react.createElement("span", null, m.name),
 							m.planned ? react.createElement("span", { className: "dockm-badge" }, "规划中") : null,
 							m.external ? react.createElement("span", { className: "dockm-badge" }, "外部") : null))),
-				react.createElement("div", { className: "dockm-content" },
+				react.createElement("div", { className: "dockm-content", ref: contentRef },
 					react.createElement("div", { className: "dockm-content-head" },
 						react.createElement("div", { className: "dockm-name" },
 							isHome
@@ -594,7 +626,7 @@ const ctxRef = { current: null };
 
 export function apply(ctx) {
 	ctxRef.current = ctx;
-	ensureCss();
+	scheduleInitialCss();
 	initFeatureState(BUILTIN_FEATURES.concat(PLANNED_FEATURES));
 	const slots = ctx.get("slots");
 	if (slots === undefined) return;
@@ -616,21 +648,6 @@ export function apply(ctx) {
 	slots.inject("conversation.input.left", () => slots.register(
 		{ name: "conversation.input.left", id: "dsh-dock-chips", order: 10, label: "功能坞" },
 		(zone) => react.createElement(DockChips, Object.assign({}, zone, { ctx: ctxRef.current }))));
-	// 手机接力链接使用 fragment，避免配对码进入服务器日志或 Referer。插件加载后立即消费并
-	// 清掉 fragment，再自动打开对应功能；DSH 会话本身仍由宿主原生会话服务继续承接。
-	try {
-		if (typeof window !== "undefined") {
-			const match = window.location.hash.match(/(?:^#|&)dsh-mobile-relay=([^&]+)/);
-			if (match) {
-				const launch = decodeURIComponent(match[1]);
-				if (/^[A-Za-z0-9_-]+\.[A-F0-9]{10}$/i.test(launch)) {
-					sessionStorage.setItem("dsh-dock/mobile-relay/launch/v1", launch);
-					window.history.replaceState(null, "", window.location.pathname + window.location.search);
-					setTimeout(() => openPanel("mobile-relay"), 0);
-				}
-			}
-		}
-	} catch { /* 私密模式禁用 storage/history 时保持手动入口可用 */ }
 }
 
 export const inject = ["timer"];

package/src/host-core.js

@@ -39,7 +39,10 @@ export const DockConfig = z.object({
 })
 
 /** 任务动画 effectMode 合法值（客户端动画模式）。 */
-export const ANIMATION_MODES = ['flow', 'breathe', 'ring', 'orbit', 'robot', 'matrix', 'stars', 'aurora']
+export const ANIMATION_MODES = [
+  'flow', 'breathe', 'ring', 'orbit', 'robot', 'matrix', 'stars', 'aurora', 'space',
+  'nebula', 'warp', 'radar', 'constellation', 'fireflies', 'ocean', 'prism', 'circuit', 'gravity', 'lantern',
+]
 
 /** 提示音 soundEffect 合法值（客户端音效库键名）。 */
 export const SOUND_EFFECTS = ['chime', 'ding', 'coin', 'bell', 'pulse', 'arp']