bia/story-edit-web
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

多出口节点重设计 + 全局错误提示

Browse Source 
- 选择/随机/战斗节点改为每出口一行、右对齐、行高25px对齐右侧端口
- 去掉重复的选项合并预览，顶部改为紧凑角标
- 未捕获错误/操作失败统一 toast 提示，便于同事发现反馈
This commit is contained in:
bia
2026-06-08 18:53:48 +08:00
parent 188bfbbf7c
commit 2b66374e90
3 changed files with 41 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
web/static/graph.js
View File

@ -41,11 +41,11 @@
function getOutlets(node) {
const k = node.kind;
if (k === "choice" || k === "choice_once")
return (node.options || []).map((o, i) => ({ label: "选" + (i + 1) + (o.text ? "·" + o.text.slice(0, 6) : ""), target: o.goto || "" }));
return (node.options || []).map((o, i) => ({ label: (i + 1) + ". " + (o.text ? o.text.slice(0, 14) : "（空选项）"), target: o.goto || "" }));
if (k === "random")
return (node.branches || []).map((b) => ({ label: "权" + (b.weight != null ? b.weight : ""), target: b.goto || "" }));
return (node.branches || []).map((b, i) => ({ label: (i + 1) + ". 权重 " + (b.weight != null ? b.weight : "?"), target: b.goto || "" }));
if (k === "fight")
return [{ label: "胜", target: node.win || "" }, { label: "败", target: node.lose || "" }];
return [{ label: "① 胜", target: node.win || "" }, { label: "② 败", target: node.lose || "" }];
if (isEnding(node)) return [];
return [{ label: "next", target: node.next || "" }]; // 线性
}
@ -63,19 +63,25 @@
// ---------- 节点 HTML ----------
function nodeInner(ir, node, isStart) {
const names = roleNames(ir), end = isEnding(node);
const sm = summary(ir, names, end ? Object.assign({ kind: "ending" }, node) : node);
let h = '<div class="nid">' + (isStart ? '<span class="startflag">▶ 开头</span> ' : '') + '#' + esc(node.id) + '</div>'
+ '<div class="k">' + esc(sm[0]) + '</div>'
+ '<div class="t">' + esc(sm[1] || "") + '</div>';
const startTag = isStart ? '<span class="startflag">▶ 开头</span> ' : '';
if (end) {
const sm = summary(ir, names, Object.assign({ kind: "ending" }, node));
const g = (node.grants && node.grants.length) ? node.grants.map(gr => grantStr(ir, names, gr)).join("，") : "无奖励";
h += '<div class="rw">' + esc(g) + '</div>';
} else {
const outs = getOutlets(node);
if (outs.length > 1)
h += '<div class="outs">' + outs.map((o, i) => '<span>' + (i + 1) + "·" + esc(o.label) + '</span>').join("") + '</div>';
return '<div class="nid">' + startTag + '#' + esc(node.id) + '</div>'
+ '<div class="k">' + esc(sm[0]) + '</div><div class="t">' + esc(sm[1] || "") + '</div>'
+ '<div class="rw">' + esc(g) + '</div>';
}
return h;
const outs = getOutlets(node);
// 多出口节点（选择/随机/战斗）：顶部角标 + 每出口一行（右对齐，行高匹配端口间距 → 与黄点平齐）
if (outs.length > 1) {
const head = summary(ir, names, node)[0];
return '<div class="ch-tag">' + (isStart ? '<span class="startflag">▶</span> ' : '') + '<span class="nid">#' + esc(node.id) + '</span> ' + esc(head) + '</div>'
+ '<div class="ch-opts">' + outs.map(o => '<div class="ch-opt" title="' + esc(o.label) + '">' + esc(o.label) + '</div>').join("") + '</div>';
}
// 线性 / 单出口节点
const sm = summary(ir, names, node);
return '<div class="nid">' + startTag + '#' + esc(node.id) + '</div>'
+ '<div class="k">' + esc(sm[0]) + '</div><div class="t">' + esc(sm[1] || "") + '</div>';
}
// ---------- 自动布局：最长路径分层 + 每层顺序铺开 ----------