@tea-agent/loop-agent 0.13.0-alpha.0 → 0.13.0-beta.0

package/dist/worker/observe/static/dag-helpers.js

@@ -1,172 +1,172 @@
-/** DAG status helpers, progress, active cards, rank lanes. */
-import { UI_TEXT } from "./constants.js";
-import { el } from "./dom.js";
-import {
-	badge,
-	dagStatusBadge,
-	formatDuration,
-	formatAgo,
-	formatMs,
-} from "./format.js";
-import { navigate } from "./router.js";
-
-export function isNodeActive(status) {
-	if (!status) return false;
-	const s = status.toLowerCase();
-	return (
-		s === "running" || s === "started" || s === "pending" || s === "queued"
-	);
-}
-
-export function isNodeFinished(status) {
-	if (!status) return false;
-	const s = status.toLowerCase();
-	return (
-		s === "finished" ||
-		s === "completed" ||
-		s === "succeeded" ||
-		s === "done" ||
-		s === "error" ||
-		s === "failed" ||
-		s === "skipped"
-	);
-}
-
-export function isNodeFailed(status) {
-	if (!status) return false;
-	const s = status.toLowerCase();
-	return s === "error" || s === "failed" || s === "partial_failed";
-}
-
-export function dagProgress(dag) {
-	const nodes = dag.nodes ?? [];
-	const finished = nodes.filter((n) => isNodeFinished(n.status)).length;
-	return { finished, total: nodes.length };
-}
-
-export function getActiveNodes(dag) {
-	return (dag.nodes ?? []).filter((n) => isNodeActive(n.status));
-}
-
-export function dagSortTime(dag) {
-	return dag.startedAt ?? dag.finishedAt ?? "";
-}
-
-export function renderActiveDagCard(dag, nowMs) {
-	const card = el("div", "active-dag-card");
-	if (isNodeActive(dag.status) || getActiveNodes(dag).length > 0) {
-		card.classList.add("active-dag-card-running");
-	}
-	const title = dag.title || dag.dagRunId;
-	const header = el("div", "active-dag-header");
-	header.appendChild(el("span", "active-dag-title", title));
-	header.appendChild(dagStatusBadge(dag.effectiveStatus ?? dag.status));
-	card.appendChild(header);
-
-	const progress = dagProgress(dag);
-	const activeNodes = getActiveNodes(dag);
-	const currentLabel =
-		activeNodes.length > 0
-			? activeNodes
-					.map((n) => {
-						const parts = [n.nodeId];
-						if (n.executor) parts.push(`(${n.executor})`);
-						if (n.model) parts.push(n.model);
-						return parts.join(" ");
-					})
-					.join(", ")
-			: "—";
-
-	const elapsed =
-		dag.durationMs ??
-		(dag.startedAt
-			? Math.max(0, nowMs - Date.parse(dag.startedAt))
-			: undefined);
-	const lastUpdate = dag.finishedAt ?? dag.startedAt;
-
-	const meta = el("div", "active-dag-meta");
-	meta.appendChild(
-		el(
-			"span",
-			null,
-			`进度 ${progress.finished}/${progress.total} · 当前节点：${currentLabel}`,
-		),
-	);
-	meta.appendChild(
-		el(
-			"span",
-			null,
-			`已用时 ${formatDuration(elapsed)} · 最近活动 ${formatAgo(lastUpdate, nowMs)}`,
-		),
-	);
-	card.appendChild(meta);
-
-	const link = el("a", "active-dag-link", UI_TEXT.enterDetail);
-	link.href = `#/dag/${encodeURIComponent(dag.dagRunId)}`;
-	link.addEventListener("click", (e) => {
-		e.preventDefault();
-		navigate(`/dag/${encodeURIComponent(dag.dagRunId)}`);
-	});
-	card.appendChild(link);
-	return card;
-}
-
-export function renderRankLanes(dag) {
-	const container = el("div", "rank-lanes");
-	const nodes = dag.nodes ?? [];
-	const ranks = dag.ranks;
-	const rankGroups = new Map();
-
-	if (ranks && ranks.length > 0) {
-		for (let i = 0; i < ranks.length; i++) {
-			rankGroups.set(String(i), ranks[i]);
-		}
-		for (const node of nodes) {
-			const rank = node.rank ?? "—";
-			if (!rankGroups.has(rank)) {
-				rankGroups.set(rank, [node.nodeId]);
-			} else if (!rankGroups.get(rank).includes(node.nodeId)) {
-				rankGroups.get(rank).push(node.nodeId);
-			}
-		}
-	} else {
-		for (const node of nodes) {
-			const rank = node.rank ?? "—";
-			const list = rankGroups.get(rank) ?? [];
-			list.push(node.nodeId);
-			rankGroups.set(rank, list);
-		}
-	}
-
-	const sortedRanks = [...rankGroups.keys()].sort((a, b) => {
-		const na = Number(a);
-		const nb = Number(b);
-		if (!Number.isNaN(na) && !Number.isNaN(nb)) return na - nb;
-		return a.localeCompare(b);
-	});
-
-	const nodeById = Object.fromEntries(nodes.map((n) => [n.nodeId, n]));
-
-	for (const rank of sortedRanks) {
-		const lane = el("div", "rank-lane");
-		lane.appendChild(el("div", "rank-lane-label", `第 ${rank} 层`));
-		const chips = el("div", "rank-lane-nodes");
-		for (const nodeId of rankGroups.get(rank) ?? []) {
-			const node = nodeById[nodeId] ?? { nodeId };
-			const chip = el("div", "rank-node-chip");
-			if (isNodeActive(node.status)) chip.classList.add("rank-node-active");
-			if (isNodeFailed(node.status)) chip.classList.add("rank-node-error");
-			chip.appendChild(el("span", "rank-node-id", nodeId));
-			if (node.status) chip.appendChild(badge(node.status));
-			if (node.durationMs !== undefined) {
-				chip.appendChild(
-					el("span", "rank-node-dur", formatMs(node.durationMs)),
-				);
-			}
-			chips.appendChild(chip);
-		}
-		lane.appendChild(chips);
-		container.appendChild(lane);
-	}
-	return container;
-}
+/** DAG status helpers, progress, active cards, rank lanes. */
+import { UI_TEXT } from "./constants.js";
+import { el } from "./dom.js";
+import {
+	badge,
+	dagStatusBadge,
+	formatDuration,
+	formatAgo,
+	formatMs,
+} from "./format.js";
+import { navigate } from "./router.js";
+
+export function isNodeActive(status) {
+	if (!status) return false;
+	const s = status.toLowerCase();
+	return (
+		s === "running" || s === "started" || s === "pending" || s === "queued"
+	);
+}
+
+export function isNodeFinished(status) {
+	if (!status) return false;
+	const s = status.toLowerCase();
+	return (
+		s === "finished" ||
+		s === "completed" ||
+		s === "succeeded" ||
+		s === "done" ||
+		s === "error" ||
+		s === "failed" ||
+		s === "skipped"
+	);
+}
+
+export function isNodeFailed(status) {
+	if (!status) return false;
+	const s = status.toLowerCase();
+	return s === "error" || s === "failed" || s === "partial_failed";
+}
+
+export function dagProgress(dag) {
+	const nodes = dag.nodes ?? [];
+	const finished = nodes.filter((n) => isNodeFinished(n.status)).length;
+	return { finished, total: nodes.length };
+}
+
+export function getActiveNodes(dag) {
+	return (dag.nodes ?? []).filter((n) => isNodeActive(n.status));
+}
+
+export function dagSortTime(dag) {
+	return dag.startedAt ?? dag.finishedAt ?? "";
+}
+
+export function renderActiveDagCard(dag, nowMs) {
+	const card = el("div", "active-dag-card");
+	if (isNodeActive(dag.status) || getActiveNodes(dag).length > 0) {
+		card.classList.add("active-dag-card-running");
+	}
+	const title = dag.title || dag.dagRunId;
+	const header = el("div", "active-dag-header");
+	header.appendChild(el("span", "active-dag-title", title));
+	header.appendChild(dagStatusBadge(dag.effectiveStatus ?? dag.status));
+	card.appendChild(header);
+
+	const progress = dagProgress(dag);
+	const activeNodes = getActiveNodes(dag);
+	const currentLabel =
+		activeNodes.length > 0
+			? activeNodes
+					.map((n) => {
+						const parts = [n.nodeId];
+						if (n.executor) parts.push(`(${n.executor})`);
+						if (n.model) parts.push(n.model);
+						return parts.join(" ");
+					})
+					.join(", ")
+			: "—";
+
+	const elapsed =
+		dag.durationMs ??
+		(dag.startedAt
+			? Math.max(0, nowMs - Date.parse(dag.startedAt))
+			: undefined);
+	const lastUpdate = dag.finishedAt ?? dag.startedAt;
+
+	const meta = el("div", "active-dag-meta");
+	meta.appendChild(
+		el(
+			"span",
+			null,
+			`进度 ${progress.finished}/${progress.total} · 当前节点：${currentLabel}`,
+		),
+	);
+	meta.appendChild(
+		el(
+			"span",
+			null,
+			`已用时 ${formatDuration(elapsed)} · 最近活动 ${formatAgo(lastUpdate, nowMs)}`,
+		),
+	);
+	card.appendChild(meta);
+
+	const link = el("a", "active-dag-link", UI_TEXT.enterDetail);
+	link.href = `#/dag/${encodeURIComponent(dag.dagRunId)}`;
+	link.addEventListener("click", (e) => {
+		e.preventDefault();
+		navigate(`/dag/${encodeURIComponent(dag.dagRunId)}`);
+	});
+	card.appendChild(link);
+	return card;
+}
+
+export function renderRankLanes(dag) {
+	const container = el("div", "rank-lanes");
+	const nodes = dag.nodes ?? [];
+	const ranks = dag.ranks;
+	const rankGroups = new Map();
+
+	if (ranks && ranks.length > 0) {
+		for (let i = 0; i < ranks.length; i++) {
+			rankGroups.set(String(i), ranks[i]);
+		}
+		for (const node of nodes) {
+			const rank = node.rank ?? "—";
+			if (!rankGroups.has(rank)) {
+				rankGroups.set(rank, [node.nodeId]);
+			} else if (!rankGroups.get(rank).includes(node.nodeId)) {
+				rankGroups.get(rank).push(node.nodeId);
+			}
+		}
+	} else {
+		for (const node of nodes) {
+			const rank = node.rank ?? "—";
+			const list = rankGroups.get(rank) ?? [];
+			list.push(node.nodeId);
+			rankGroups.set(rank, list);
+		}
+	}
+
+	const sortedRanks = [...rankGroups.keys()].sort((a, b) => {
+		const na = Number(a);
+		const nb = Number(b);
+		if (!Number.isNaN(na) && !Number.isNaN(nb)) return na - nb;
+		return a.localeCompare(b);
+	});
+
+	const nodeById = Object.fromEntries(nodes.map((n) => [n.nodeId, n]));
+
+	for (const rank of sortedRanks) {
+		const lane = el("div", "rank-lane");
+		lane.appendChild(el("div", "rank-lane-label", `第 ${rank} 层`));
+		const chips = el("div", "rank-lane-nodes");
+		for (const nodeId of rankGroups.get(rank) ?? []) {
+			const node = nodeById[nodeId] ?? { nodeId };
+			const chip = el("div", "rank-node-chip");
+			if (isNodeActive(node.status)) chip.classList.add("rank-node-active");
+			if (isNodeFailed(node.status)) chip.classList.add("rank-node-error");
+			chip.appendChild(el("span", "rank-node-id", nodeId));
+			if (node.status) chip.appendChild(badge(node.status));
+			if (node.durationMs !== undefined) {
+				chip.appendChild(
+					el("span", "rank-node-dur", formatMs(node.durationMs)),
+				);
+			}
+			chips.appendChild(chip);
+		}
+		lane.appendChild(chips);
+		container.appendChild(lane);
+	}
+	return container;
+}

package/dist/worker/observe/static/dag-layout.d.ts

@@ -1,31 +1,31 @@
-export type DagLayoutNodeInput = { nodeId: string };
-export type DagLayoutEdgeInput = { from: string; to: string };
-export type DagLayoutNode = {
-	nodeId: string;
-	rank: number;
-	index: number;
-	x: number;
-	y: number;
-	width: number;
-	height: number;
-};
-export type DagLayoutEdge = DagLayoutEdgeInput & { path: string };
-export type DagLayout = {
-	width: number;
-	height: number;
-	nodes: DagLayoutNode[];
-	edges: DagLayoutEdge[];
-};
-
-export function layoutDag(
-	nodes?: DagLayoutNodeInput[],
-	edges?: DagLayoutEdgeInput[],
-	ranks?: string[][],
-	options?: Partial<{
-		nodeWidth: number;
-		nodeHeight: number;
-		rankGap: number;
-		nodeGap: number;
-		padding: number;
-	}>,
-): DagLayout;
+export type DagLayoutNodeInput = { nodeId: string };
+export type DagLayoutEdgeInput = { from: string; to: string };
+export type DagLayoutNode = {
+	nodeId: string;
+	rank: number;
+	index: number;
+	x: number;
+	y: number;
+	width: number;
+	height: number;
+};
+export type DagLayoutEdge = DagLayoutEdgeInput & { path: string };
+export type DagLayout = {
+	width: number;
+	height: number;
+	nodes: DagLayoutNode[];
+	edges: DagLayoutEdge[];
+};
+
+export function layoutDag(
+	nodes?: DagLayoutNodeInput[],
+	edges?: DagLayoutEdgeInput[],
+	ranks?: string[][],
+	options?: Partial<{
+		nodeWidth: number;
+		nodeHeight: number;
+		rankGap: number;
+		nodeGap: number;
+		padding: number;
+	}>,
+): DagLayout;

package/dist/worker/observe/static/dag-layout.js

@@ -1,83 +1,83 @@
-const DEFAULTS = {
-	nodeWidth: 216,
-	nodeHeight: 92,
-	rankGap: 104,
-	nodeGap: 28,
-	padding: 32,
-};
-
-export function layoutDag(nodes = [], edges = [], ranks = [], options = {}) {
-	const config = { ...DEFAULTS, ...options };
-	const nodeIds = [...new Set(nodes.map((node) => node.nodeId).filter(Boolean))].sort();
-	if (nodeIds.length === 0) return { width: 320, height: 160, nodes: [], edges: [] };
-	const known = new Set(nodeIds);
-	const validEdges = edges
-		.filter((edge) => known.has(edge.from) && known.has(edge.to) && edge.from !== edge.to)
-		.sort((a, b) => a.from.localeCompare(b.from) || a.to.localeCompare(b.to));
-	const layers = normalizeLayers(nodeIds, validEdges, ranks);
-	const positioned = [];
-	for (let rank = 0; rank < layers.length; rank++) {
-		const ids = layers[rank];
-		for (let index = 0; index < ids.length; index++) {
-			positioned.push({
-				nodeId: ids[index], rank, index,
-				x: config.padding + rank * (config.nodeWidth + config.rankGap),
-				y: config.padding + index * (config.nodeHeight + config.nodeGap),
-				width: config.nodeWidth, height: config.nodeHeight,
-			});
-		}
-	}
-	const byId = new Map(positioned.map((node) => [node.nodeId, node]));
-	const routed = validEdges.map((edge) => {
-		const from = byId.get(edge.from);
-		const to = byId.get(edge.to);
-		const x1 = from.x + from.width;
-		const y1 = from.y + from.height / 2;
-		const x2 = to.x;
-		const y2 = to.y + to.height / 2;
-		const bend = Math.max(36, (x2 - x1) / 2);
-		return { ...edge, path: `M ${x1} ${y1} C ${x1 + bend} ${y1}, ${x2 - bend} ${y2}, ${x2} ${y2}` };
-	});
-	const maxRows = Math.max(...layers.map((layer) => layer.length), 1);
-	return {
-		width: config.padding * 2 + layers.length * config.nodeWidth + (layers.length - 1) * config.rankGap,
-		height: config.padding * 2 + maxRows * config.nodeHeight + (maxRows - 1) * config.nodeGap,
-		nodes: positioned,
-		edges: routed,
-	};
-}
-
-function normalizeLayers(nodeIds, edges, ranks) {
-	const known = new Set(nodeIds);
-	const seen = new Set();
-	const layers = [];
-	if (Array.isArray(ranks)) {
-		for (const rank of ranks) {
-			if (!Array.isArray(rank)) continue;
-			const ids = [...new Set(rank.filter((id) => known.has(id) && !seen.has(id)))].sort();
-			ids.forEach((id) => seen.add(id));
-			if (ids.length > 0) layers.push(ids);
-		}
-	}
-	if (layers.length === 0 && edges.length > 0) {
-		const level = new Map(nodeIds.map((id) => [id, 0]));
-		for (let pass = 0; pass < nodeIds.length; pass++) {
-			let changed = false;
-			for (const edge of edges) {
-				const next = Math.min(nodeIds.length - 1, level.get(edge.from) + 1);
-				if (next > level.get(edge.to)) { level.set(edge.to, next); changed = true; }
-			}
-			if (!changed) break;
-		}
-		for (const id of nodeIds) {
-			const rank = level.get(id);
-			(layers[rank] ??= []).push(id);
-			seen.add(id);
-		}
-		for (const layer of layers) layer?.sort();
-	}
-	for (const id of nodeIds) {
-		if (!seen.has(id)) (layers[0] ??= []).push(id);
-	}
-	return layers.filter(Boolean);
-}
+const DEFAULTS = {
+	nodeWidth: 216,
+	nodeHeight: 92,
+	rankGap: 104,
+	nodeGap: 28,
+	padding: 32,
+};
+
+export function layoutDag(nodes = [], edges = [], ranks = [], options = {}) {
+	const config = { ...DEFAULTS, ...options };
+	const nodeIds = [...new Set(nodes.map((node) => node.nodeId).filter(Boolean))].sort();
+	if (nodeIds.length === 0) return { width: 320, height: 160, nodes: [], edges: [] };
+	const known = new Set(nodeIds);
+	const validEdges = edges
+		.filter((edge) => known.has(edge.from) && known.has(edge.to) && edge.from !== edge.to)
+		.sort((a, b) => a.from.localeCompare(b.from) || a.to.localeCompare(b.to));
+	const layers = normalizeLayers(nodeIds, validEdges, ranks);
+	const positioned = [];
+	for (let rank = 0; rank < layers.length; rank++) {
+		const ids = layers[rank];
+		for (let index = 0; index < ids.length; index++) {
+			positioned.push({
+				nodeId: ids[index], rank, index,
+				x: config.padding + rank * (config.nodeWidth + config.rankGap),
+				y: config.padding + index * (config.nodeHeight + config.nodeGap),
+				width: config.nodeWidth, height: config.nodeHeight,
+			});
+		}
+	}
+	const byId = new Map(positioned.map((node) => [node.nodeId, node]));
+	const routed = validEdges.map((edge) => {
+		const from = byId.get(edge.from);
+		const to = byId.get(edge.to);
+		const x1 = from.x + from.width;
+		const y1 = from.y + from.height / 2;
+		const x2 = to.x;
+		const y2 = to.y + to.height / 2;
+		const bend = Math.max(36, (x2 - x1) / 2);
+		return { ...edge, path: `M ${x1} ${y1} C ${x1 + bend} ${y1}, ${x2 - bend} ${y2}, ${x2} ${y2}` };
+	});
+	const maxRows = Math.max(...layers.map((layer) => layer.length), 1);
+	return {
+		width: config.padding * 2 + layers.length * config.nodeWidth + (layers.length - 1) * config.rankGap,
+		height: config.padding * 2 + maxRows * config.nodeHeight + (maxRows - 1) * config.nodeGap,
+		nodes: positioned,
+		edges: routed,
+	};
+}
+
+function normalizeLayers(nodeIds, edges, ranks) {
+	const known = new Set(nodeIds);
+	const seen = new Set();
+	const layers = [];
+	if (Array.isArray(ranks)) {
+		for (const rank of ranks) {
+			if (!Array.isArray(rank)) continue;
+			const ids = [...new Set(rank.filter((id) => known.has(id) && !seen.has(id)))].sort();
+			ids.forEach((id) => seen.add(id));
+			if (ids.length > 0) layers.push(ids);
+		}
+	}
+	if (layers.length === 0 && edges.length > 0) {
+		const level = new Map(nodeIds.map((id) => [id, 0]));
+		for (let pass = 0; pass < nodeIds.length; pass++) {
+			let changed = false;
+			for (const edge of edges) {
+				const next = Math.min(nodeIds.length - 1, level.get(edge.from) + 1);
+				if (next > level.get(edge.to)) { level.set(edge.to, next); changed = true; }
+			}
+			if (!changed) break;
+		}
+		for (const id of nodeIds) {
+			const rank = level.get(id);
+			(layers[rank] ??= []).push(id);
+			seen.add(id);
+		}
+		for (const layer of layers) layer?.sort();
+	}
+	for (const id of nodeIds) {
+		if (!seen.has(id)) (layers[0] ??= []).push(id);
+	}
+	return layers.filter(Boolean);
+}