@popcorn245/cornfield-components 0.52.0 → 0.53.0

package/dist/chunks/panel-review-ih7RlfkH.js

@@ -0,0 +1,884 @@
+import { J as e, Kt as t, Ot as n, X as r, _t as i, dt as a, ft as o, gt as s, kt as c, lt as l, mt as u, pt as d, ut as f, vt as p, xn as m, yn as h, yt as ee } from "./engine-xmHJvQY9.js";
+// ../explorer/corn-state.js
+var g = Object.freeze([
+	"open",
+	"merged",
+	"closed",
+	"draft",
+	"queued",
+	"running",
+	"requested",
+	"claimed",
+	"working",
+	"waiting",
+	"done",
+	"failed",
+	"stopped",
+	"success",
+	"failure",
+	"added",
+	"changed",
+	"removed",
+	"edit",
+	"sent-back"
+]), _ = Object.freeze([
+	"added",
+	"changed",
+	"removed",
+	"edit"
+]);
+Object.freeze([
+	"requested",
+	"claimed",
+	"working",
+	"waiting",
+	"done",
+	"failed",
+	"stopped"
+]);
+var v = Object.freeze({
+	quiet: "waiting",
+	"stop-requested": "stopped",
+	neutral: "done",
+	skipped: "done",
+	cancelled: "stopped",
+	approved: "success",
+	unreviewed: "waiting",
+	changed: "waiting",
+	missing: "failure",
+	allowed: "success",
+	refused: "failure",
+	mismatch: "failure",
+	pending: "running",
+	ok: "success",
+	bad: "failure",
+	stale: "waiting",
+	off: "stopped",
+	error: "failure",
+	idle: "running"
+});
+function y(e) {
+	let t = String(e || "");
+	return v[t] || (g.includes(t) && !_.includes(t) ? t : "");
+}
+function b(e) {
+	let t = String(e || "");
+	return _.includes(t) ? t : "";
+}
+function x(e) {
+	let t = b(e);
+	return t ? ` data-corn-state="${t}"` : "";
+}
+function S(e) {
+	let t = y(e);
+	return t ? ` data-corn-state="${t}"` : "";
+}
+Object.freeze({
+	requested: "<circle cx=\"6\" cy=\"6\" r=\"4.2\" stroke-dasharray=\"2 1.8\"/>",
+	queued: "<circle cx=\"6\" cy=\"6\" r=\"4.2\" stroke-dasharray=\"2 1.8\"/>",
+	claimed: "<circle cx=\"6\" cy=\"6\" r=\"4.2\"/><circle cx=\"6\" cy=\"6\" r=\"1.4\" fill=\"currentColor\" stroke=\"none\"/>",
+	working: "<path class=\"hx-state-spin\" d=\"M6 1.8a4.2 4.2 0 1 1-4.2 4.2\"/>",
+	running: "<path class=\"hx-state-spin\" d=\"M6 1.8a4.2 4.2 0 1 1-4.2 4.2\"/>",
+	waiting: "<path d=\"M6 1.2L11 10.4H1Z\" stroke-linejoin=\"round\"/><path d=\"M6 4.6v2.7M6 8.6v.1\"/>",
+	done: "<path d=\"M2 6.4l2.6 2.6L10 3.4\"/>",
+	success: "<path d=\"M2 6.4l2.6 2.6L10 3.4\"/>",
+	failed: "<path d=\"M2.6 2.6l6.8 6.8M9.4 2.6L2.6 9.4\"/>",
+	failure: "<path d=\"M2.6 2.6l6.8 6.8M9.4 2.6L2.6 9.4\"/>",
+	stopped: "<rect x=\"2.4\" y=\"2.4\" width=\"7.2\" height=\"7.2\" rx=\"1\" fill=\"currentColor\"/>",
+	neutral: "<path d=\"M2.4 6h7.2\"/>",
+	skipped: "<path d=\"M2.4 6h7.2\"/>",
+	cancelled: "<circle cx=\"6\" cy=\"6\" r=\"4.2\"/><path d=\"M3 9L9 3\"/>",
+	"sent-back": "<path d=\"M4.6 2.2L2 4.8l2.6 2.6\"/><path d=\"M2.2 4.8H7a2.8 2.8 0 0 1 0 5.6H4.6\"/>"
+}), Object.freeze([
+	["code", "Code: a branch and a pull request"],
+	["summary", "Summary of the conversation"],
+	["brief", "A brief for another run"],
+	["proposal", "A proposal drafted from the thread"]
+]), Object.freeze({
+	merged: "done",
+	closed: "stopped",
+	quiet: "waiting",
+	"stop-requested": "stopped"
+});
+function C(e) {
+	let t = Math.max(0, Math.round(e / 1e3));
+	return t < 60 ? `${t} s` : t < 3600 ? `${Math.floor(t / 60)} min` : `${Math.floor(t / 3600)} h`;
+}
+Object.freeze([
+	"minutes",
+	"turns",
+	"cost",
+	"tokens"
+]), Object.freeze([
+	{
+		key: "decide",
+		title: "toDecide"
+	},
+	{
+		key: "agent",
+		title: "withAgent"
+	},
+	{
+		key: "approved",
+		title: "approvedGroup"
+	},
+	{
+		key: "drafts",
+		title: "drafts"
+	}
+]), Object.freeze([
+	{
+		key: "needs",
+		title: "needsYou"
+	},
+	{
+		key: "motion",
+		title: "inMotion"
+	},
+	{
+		key: "finished",
+		title: "finished"
+	}
+]), Object.freeze([
+	"to-decide",
+	"changed",
+	"sent-back",
+	"approved",
+	"draft-pr",
+	"local",
+	"unknown"
+]), Object.freeze({
+	"to-decide": "To decide",
+	changed: "Changed since approved",
+	"sent-back": "Sent back",
+	approved: "Approved",
+	"draft-pr": "Draft PR",
+	local: "Local",
+	unknown: "Review state unknown"
+}), Object.freeze({
+	"to-decide": "waiting",
+	changed: "waiting",
+	"sent-back": "sent-back",
+	approved: "success",
+	"draft-pr": "draft",
+	local: "draft",
+	unknown: "failure"
+});
+function w(e) {
+	let t = e && e.report && typeof e.report.note == "string" ? e.report.note.replace(/\s+/g, " ").trim() : "", n = t.length > 90 ? `${t.slice(0, 89).trimEnd()}\u2026` : t;
+	return `A run is waiting on you${n ? `: ${n}` : ""}`;
+}
+// ../explorer/proposal-model.js
+var te = [
+	"before",
+	"diff",
+	"after"
+], T = [
+	"added",
+	"changed",
+	"removed"
+];
+function E(e) {
+	let t = D({
+		...e,
+		scenarios: 0
+	}).filter((e) => e.mark).map((e) => e.text.replace(/^\+/, ""));
+	return t.length ? t.join(" · ") : "No changes";
+}
+function D(e) {
+	let t = (t) => e?.[t] || 0, n = (e, t) => `${e} ${t}${e === 1 ? "" : "s"}`, r = (r) => {
+		let i = e?.nodes?.[r] || 0, a = e?.edges?.[r] || 0;
+		return !e?.nodes || i + a !== t(r) ? `${r === "added" ? "+" : ""}${t(r)} ${r}` : `${[i && n(i, "node"), a && n(a, "edge")].filter(Boolean).join(", ")} ${r}`;
+	}, i = T.filter((e) => t(e) > 0).map((e) => ({
+		mark: e,
+		text: r(e)
+	}));
+	return t("scenarios") > 0 && i.push({
+		mark: null,
+		text: `${t("scenarios")} ${t("scenarios") === 1 ? "scenario" : "scenarios"}`
+	}), i.length ? i : [{
+		mark: null,
+		text: "No changes"
+	}];
+}
+var O = (e) => `${e === "before" ? "Before" : e === "after" ? "After" : "Diff"} view`, k = (e, t) => `${t}, ${String(e).toLowerCase()}. The map is on it.`, A = /^[A-Za-z0-9][A-Za-z0-9._-]*$/, j = 200, M = (e) => typeof e == "string" && e.length <= j && A.test(e);
+function N(e) {
+	let t = String(e ?? ""), n = t.length > 60 ? `${t.slice(0, 59)}\u2026` : t;
+	return n.trim() ? `\u201c${n}\u201d is not a proposal's name.` : "That is not a proposal's name.";
+}
+function P(e) {
+	return e == null ? "" : typeof e == "string" ? e : JSON.stringify(e);
+}
+var F = [
+	"mark",
+	"editOp",
+	"before",
+	"why",
+	"x",
+	"y",
+	"r",
+	"baseR",
+	"degree",
+	"scaleDelta",
+	"color",
+	"from",
+	"to"
+];
+function I(e) {
+	return c(e) === "added" ? Object.keys(e).filter((t) => !F.includes(t) && e[t] !== void 0).map((t) => ({
+		field: t,
+		before: "",
+		after: P(e[t])
+	})) : e.mark === "changed" && e.before ? Object.keys(e.before).map((t) => ({
+		field: t,
+		before: P(e.before[t]),
+		after: P(e[t])
+	})) : [];
+}
+var L = {
+	added: "Added",
+	changed: "Changed",
+	removed: "Removed",
+	edit: "Your edit"
+};
+function ne(e) {
+	if (!n(e)) return "";
+	let r = I(e).map((n) => e.mark === "changed" ? `<div class="hx-change" data-corn="field-change"><span class="hx-change-field">${t(n.field)}</span><span class="hx-change-before">${t(n.before) || "<em>nothing</em>"}</span><span class="hx-change-arrow" aria-hidden="true">→</span><span class="hx-change-after">${t(n.after) || "<em>nothing</em>"}</span></div>` : `<div class="hx-change" data-corn="field-change"><span class="hx-change-field">${t(n.field)}</span><span class="hx-change-after">${t(n.after)}</span></div>`).join("");
+	return `<div class="hx-sec hx-proposal-sec hx-proposal-sec--${t(e.mark)}" data-proposal-mark="${t(e.mark)}" data-corn="section">
+    <strong class="hx-strong"><span class="hx-mark-dot hx-mark-dot--${t(e.mark)}" data-corn="mark-dot"${x(e.mark)}></span>${t(e.mark === "edit" ? `${e.editOp === "removed" ? "Removed" : "Added"} by your edit` : `${L[e.mark] || e.mark} by this proposal`)}</strong>
+    ${e.why ? `<div class="hx-why">${t(e.why)}</div>` : ""}
+    ${r}
+  </div>`;
+}
+var R = (e, t) => `${e} ${t}${e === 1 ? "" : "s"}`;
+function z(e) {
+	if (!Array.isArray(e) || e.length === 0) return "no checks";
+	let t = (t) => e.filter((e) => t.includes(e.state)).length, n = t(["failure"]), r = t(["cancelled"]), i = t(["running", "queued"]), a = [];
+	return n && a.push(`${R(n, "check")} failed`), r && a.push(`${R(r, "check")} cancelled`), i && a.push(`${R(i, "check")} running`), a.length ? a.join(", ") : e.length === 1 ? "1 check passed" : `all ${e.length} checks passed`;
+}
+function B(e) {
+	let t = typeof e == "string" ? /^pull\/([1-9]\d{0,8})$/.exec(e) : null;
+	return t ? Number(t[1]) : null;
+}
+function re(e) {
+	let t = B(e);
+	return t ? `PR #${t}` : !e || e === "checkout" ? "the checkout" : `worktree ${e}`;
+}
+function ie(e, t = null, n = null) {
+	let r = B(e);
+	if (!r) {
+		let t = !e || e === "checkout" ? "in the checkout" : `in worktree ${e}`;
+		return {
+			text: `Local draft \u00b7 ${t}`,
+			href: null,
+			state: "draft",
+			label: `This is a local draft, ${t}, not a pull request`
+		};
+	}
+	let i = [`PR #${r}`], a = t ? t.state === "merged" || t.state === "closed" ? t.state : typeof t.draft == "boolean" ? t.draft ? "draft" : "open" : "" : "";
+	return a && i.push(a), Array.isArray(n) && i.push(z(n)), {
+		text: i.join(" · "),
+		href: t && typeof t.url == "string" ? t.url : null,
+		state: a,
+		label: `Reviewing spec pull request: ${i.join(", ")}`
+	};
+}
+function ae(e, t, n = null) {
+	return t ? B(t) || t === "checkout" || n && n.has(t) && A.test(t) ? `There is no proposal called ${e} in ${re(t)}.` : `There is no proposal called ${e}. This link's source is not a PR, the checkout or a worktree.` : `There is no proposal called ${e}.`;
+}
+function oe(e) {
+	let t = new URLSearchParams(e || "");
+	if (!t.has("proposal")) return null;
+	let n = t.get("proposal") || "";
+	return A.test(n) ? null : n.trim() ? `This link does not name a proposal: ${N(n)}` : "This link does not name a proposal.";
+}
+function se(e, t, n) {
+	return Array.isArray(e) ? e.filter((e) => e && e.slug === t && e.source !== n && !e.error).sort((e, t) => +!!B(t.source) - !!B(e.source)).map((e) => ({
+		slug: e.slug,
+		source: e.source,
+		label: B(e.source) ? `Open the copy in PR #${B(e.source)}${e.pull && e.pull.draft ? " (draft)" : ""}` : `Open the copy ${e.source === "checkout" ? "in the checkout" : `in worktree ${e.source}`}`
+	})) : [];
+}
+function ce(e, t = !1) {
+	let n = Array.isArray(e) ? e : [];
+	if (!n.length) return "";
+	let r = (e) => n.filter((t) => t && e.includes(t.op)).length, i = (e, t) => `${e} ${t}${e === 1 ? "" : "s"}`, a = [];
+	r(["add-node"]) && a.push(`+${i(r(["add-node"]), "node")}`), r(["add-edge"]) && a.push(`+${i(r(["add-edge"]), "edge")}`), r(["remove-node"]) && a.push(`\u2212${i(r(["remove-node"]), "node")}`), r(["remove-edge"]) && a.push(`\u2212${i(r(["remove-edge"]), "edge")}`);
+	let o = r([
+		"add-step",
+		"reword-step",
+		"delete-step",
+		"move-step"
+	]);
+	o && a.push(`${i(o, "step")} changed`);
+	let s = n.length - r([
+		"add-node",
+		"add-edge",
+		"remove-node",
+		"remove-edge",
+		"add-step",
+		"reword-step",
+		"delete-step",
+		"move-step"
+	]);
+	return s > 0 && a.push(i(s, "other edit")), `yours: ${a.join(", ")}${t ? " (hidden)" : ""}`;
+}
+// ../core/proposal.js
+var le = [
+	"version",
+	"spec",
+	"title",
+	"summary",
+	"nodes",
+	"edges",
+	"mockups",
+	"scenarios"
+], ue = [
+	"node",
+	"path",
+	"title"
+], de = [
+	"png",
+	"jpg",
+	"jpeg",
+	"webp",
+	"svg",
+	"html"
+], fe = [
+	"id",
+	"title",
+	"steps",
+	"stepMs",
+	"linkNodes",
+	"actor",
+	"down"
+], V = [
+	"node",
+	"edge",
+	"text",
+	"ms",
+	"actor",
+	"at",
+	"check",
+	"expect"
+], pe = [
+	"GET",
+	"POST",
+	"PUT",
+	"PATCH",
+	"DELETE"
+], me = [
+	"read",
+	"write",
+	"delete"
+], he = [
+	"own",
+	"household",
+	"others",
+	"shared-read",
+	"shared-write"
+], ge = ["allowed", "refused"], _e = /^[a-z0-9]+(?:-[a-z0-9]+)*$/, H = `live-room-<id>, live-floor-<id> or live-device-<kind>-<id> (kind one of ${l.join(", ")})`, ve = [
+	"add",
+	"change",
+	"remove"
+], ye = ["mark", "before"], be = [
+	"mark",
+	"before",
+	"why"
+], xe = [
+	"from",
+	"to",
+	"kind",
+	"flow"
+], U = (e) => typeof e == "object" && !!e && !Array.isArray(e), W = (e) => typeof e == "string" && e.trim() !== "", G = (e) => e === void 0 ? e : JSON.parse(JSON.stringify(e)), K = (e) => Array.isArray(e) ? e : [], Se = (e) => typeof e == "number" && Number.isFinite(e) && e > 0;
+function q(e, t) {
+	if (e === t) return !0;
+	if (!e || !t || typeof e != "object" || typeof t != "object" || Array.isArray(e) !== Array.isArray(t)) return !1;
+	let n = Object.keys(e);
+	return n.length === Object.keys(t).length && n.every((n) => q(e[n], t[n]));
+}
+function Ce(e) {
+	if (typeof e != "string" || e.trim() === "") return "\"path\" must be the file's path, relative to the proposals folder.";
+	if (e.length > 200) return "\"path\" is at most 200 characters.";
+	if (/[\\\u0000-\u001f:%?#]/.test(e)) return "\"path\" has a character a plain relative path does not (a backslash, a colon, a control character, %, ? or #).";
+	if (e.startsWith("/")) return "\"path\" is relative to the proposals folder; it does not start with a slash.";
+	let t = e.split("/");
+	if (t.some((e) => e === "" || e === "." || e === "..")) return "\"path\" stays inside the proposals folder: no \"..\", no \".\" and no empty parts.";
+	if (t.some((e) => e.startsWith("."))) return "\"path\" has a hidden part (one that starts with a dot).";
+	let n = t[t.length - 1].split(".").length > 1 ? t[t.length - 1].split(".").pop().toLowerCase() : "";
+	return de.includes(n) ? null : `A mockup is one of: ${de.join(", ")}.`;
+}
+function we(e) {
+	if (!U(e) || !Array.isArray(e.mockups)) return [];
+	let t = [];
+	return e.mockups.slice(0, 40).forEach((e, n) => {
+		U(e) && W(e.node) && W(e.title) && Ce(e.path) === null && t.push({
+			index: n,
+			node: e.node,
+			path: e.path,
+			title: e.title.trim()
+		});
+	}), t;
+}
+function J(e) {
+	return `${e.from}|${e.to}|${e.kind === "flow" ? `flow:${e.flow}` : e.kind || "own"}`;
+}
+var Te = (e) => ({
+	from: e.parent,
+	to: e.id
+});
+function Ee(e, t) {
+	let n = [], r = (e, t, r) => n.push(r ? {
+		path: e,
+		message: t,
+		state: r
+	} : {
+		path: e,
+		message: t
+	});
+	if (!U(t)) return r("", "A proposal is a JSON object."), n;
+	for (let e of Object.keys(t)) le.includes(e) || r(e, `Unknown key "${e}". A proposal has: ${le.join(", ")}.`);
+	t.version !== 1 && r("version", `"version" must be the number 1 (got ${JSON.stringify(t.version)}).`), W(t.title) || r("title", "\"title\" must be a non-empty string."), W(t.summary) || r("summary", "\"summary\" must be a non-empty string: the one sentence the maintainer reads first."), t.spec !== void 0 && !W(t.spec) && r("spec", "\"spec\" must be the spec number as a string, like \"0013\".");
+	let c = (e) => {
+		let n = t[e];
+		if (n === void 0) return {
+			add: [],
+			change: [],
+			remove: []
+		};
+		if (!U(n)) return r(e, `"${e}" must be an object with add, change and remove lists.`), {
+			add: [],
+			change: [],
+			remove: []
+		};
+		let i = {};
+		for (let t of Object.keys(n)) ve.includes(t) || r(`${e}.${t}`, `Unknown key "${t}" in "${e}". Use add, change or remove.`);
+		for (let t of ve) n[t] === void 0 ? i[t] = [] : Array.isArray(n[t]) ? i[t] = n[t] : (r(`${e}.${t}`, `"${e}.${t}" must be a list.`), i[t] = []);
+		return i;
+	}, m = c("nodes"), h = c("edges"), g = new Map(K(e?.nodes).map((e) => [e.id, e])), _ = new Set(K(e?.edges).map(J)), v = /* @__PURE__ */ new Map();
+	m.add.forEach((e, t) => {
+		U(e) && W(e.id) && !v.has(e.id) && v.set(e.id, t);
+	});
+	let y = new Set(m.remove.filter((e) => U(e) && W(e.id)).map((e) => e.id)), b = (e) => g.has(e) || v.has(e), x = /* @__PURE__ */ new Set(), S = /* @__PURE__ */ new Map();
+	m.add.forEach((e, t) => {
+		let n = `nodes.add[${t}]`;
+		if (!U(e)) return r(n, "An added node is an object with an id, a label and a type.");
+		W(e.id) ? g.has(e.id) ? r(`${n}.id`, `Node "${e.id}" already exists in the map. Use nodes.change to change it.`, "exists") : x.has(e.id) && r(`${n}.id`, `Node "${e.id}" is added twice.`) : r(`${n}.id`, "An added node needs an \"id\"."), W(e.id) && x.add(e.id), W(e.label) || r(`${n}.label`, "An added node needs a \"label\"."), W(e.type) ? u[e.type] ? e.type === "page" && W(e.label) && (e.label.startsWith("/") || r(`${n}.label`, `A page label "${e.label}" must start with a slash route (like "/meals"), as topology validate demands.`), e.label.includes(".html") && r(`${n}.label`, `A page label "${e.label}" must not contain ".html".`)) : r(`${n}.type`, `Unknown node type "${e.type}". Valid types: ${Object.keys(u).join(", ")}.`) : r(`${n}.type`, "An added node needs a \"type\".");
+		for (let t of ye) t in e && r(`${n}.${t}`, `"${t}" is set when the proposal is applied; leave it out.`);
+		if (e.type === "device" && !l.includes(e.kind) && r(`${n}.kind`, `A device needs "kind", one of: ${l.join(", ")}.`), e.type === "external" && e.kind !== void 0 && !a.includes(e.kind) && r(`${n}.kind`, `An external's "kind" is one of: ${a.join(", ")} (or none, until the registry draws it).`), W(e.id) && u[e.type] && i(e)) {
+			let t = p(e.id), i = e.type === "device" ? `live-device-${l.includes(e.kind) ? e.kind : "<kind>"}-<id>` : `live-${e.type}-<id>`;
+			!t || t.type !== e.type ? r(`${n}.id`, [
+				"floor",
+				"room",
+				"device"
+			].includes(e.type) ? `"${e.id}" is a ${e.type} only the live layer draws${e.type === "device" ? " (no code file derives it)" : ""}: its id must be ${i}.` : `"${e.id}" starts with "${d}", which only the live layer's floors, rooms and devices use (${H}).`) : t.kind && l.includes(e.kind) && t.kind !== e.kind && r(`${n}.kind`, `"${e.id}" names the kind "${t.kind}" but the node says "${e.kind}".`);
+		}
+		e.parent !== void 0 && (W(e.parent) ? e.parent === e.id ? r(`${n}.parent`, "A node cannot be its own parent.") : b(e.parent) ? y.has(e.parent) ? r(`${n}.parent`, `Parent "${e.parent}" is a node this proposal removes.`) : W(e.id) && S.set(J(Te(e)), `nodes.add[${t}].parent`) : r(`${n}.parent`, `Parent "${e.parent}" is in neither the map nor the added nodes.`, "dangling") : r(`${n}.parent`, "\"parent\" must be the id of a node."));
+	});
+	let C = /* @__PURE__ */ new Set();
+	m.change.forEach((e, t) => {
+		let n = `nodes.change[${t}]`;
+		if (!U(e)) return r(n, "A changed node is an object with an id, a set and a why.");
+		if (W(e.id) ? v.has(e.id) ? r(`${n}.id`, `Node "${e.id}" is added by this proposal: change its entry in nodes.add instead.`) : g.has(e.id) ? C.has(e.id) && r(`${n}.id`, `Node "${e.id}" is changed twice: merge the two sets.`) : r(`${n}.id`, `Node "${e.id}" does not exist in the map, so it cannot be changed.`, "missing-target") : r(`${n}.id`, "A changed node needs an \"id\"."), W(e.id) && C.add(e.id), !U(e.set) || Object.keys(e.set).length === 0) r(`${n}.set`, "\"set\" must be an object of the fields to change.");
+		else {
+			"id" in e.set && r(`${n}.set.id`, "A change cannot set \"id\": it names the node."), "parent" in e.set && r(`${n}.set.parent`, "\"parent\" is not a node field: remove the ownership edge and add a new one.");
+			for (let t of be) t in e.set && r(`${n}.set.${t}`, `"${t}" is set when the proposal is applied; leave it out of "set".`);
+			"type" in e.set && !u[e.set.type] && r(`${n}.set.type`, `Unknown node type "${e.set.type}". Valid types: ${Object.keys(u).join(", ")}.`);
+		}
+		W(e.why) || r(`${n}.why`, "A change needs a \"why\": the reason the maintainer reads.");
+	});
+	let w = /* @__PURE__ */ new Set();
+	m.remove.forEach((e, t) => {
+		let n = `nodes.remove[${t}]`;
+		if (!U(e)) return r(n, "A removed node is an object with an id and a why.");
+		W(e.id) ? v.has(e.id) ? r(`${n}.id`, `Node "${e.id}" is added by this proposal: drop its entry from nodes.add instead of removing it.`) : g.has(e.id) ? w.has(e.id) ? r(`${n}.id`, `Node "${e.id}" is removed twice.`) : C.has(e.id) && r(`${n}.id`, `Node "${e.id}" is both changed and removed.`) : r(`${n}.id`, `Node "${e.id}" does not exist in the map, so it cannot be removed.`, "missing-target") : r(`${n}.id`, "A removed node needs an \"id\"."), W(e.id) && w.add(e.id), W(e.why) || r(`${n}.why`, "A removal needs a \"why\".");
+	});
+	let te = new Map(m.change.filter((e) => U(e) && W(e.id) && U(e.set)).map((e) => [e.id, e.set])), T = new Map(m.add.filter((e) => U(e) && W(e.id)).map((e) => [e.id, e])), E = (e) => T.get(e) || (g.has(e) ? {
+		...g.get(e),
+		...te.get(e) || {}
+	} : void 0), D = (e, t) => {
+		W(e.from) || r(`${t}.from`, "An edge needs a \"from\" node id."), W(e.to) || r(`${t}.to`, "An edge needs a \"to\" node id.");
+		let n = W(e.from) && W(e.to);
+		return e.kind !== void 0 && !f.includes(e.kind) && (r(`${t}.kind`, `Unknown edge kind "${e.kind}". Valid kinds: ${f.join(", ")} (or none, for ownership).`), n = !1), e.kind === "flow" ? o.includes(e.flow) || (r(`${t}.flow`, `A flow edge needs "flow", one of: ${o.join(", ")}.`), n = !1) : e.flow !== void 0 && r(`${t}.flow`, "\"flow\" only goes on an edge of kind \"flow\"."), n ? J(e) : null;
+	}, O = (e) => `${e.from} -> ${e.to}${e.kind ? ` (${e.kind === "flow" ? `flow ${e.flow}` : e.kind})` : " (ownership)"}`, k = new Map([...S]);
+	h.add.forEach((e, t) => {
+		let n = `edges.add[${t}]`;
+		if (!U(e)) return r(n, "An added edge is an object with from, to and optionally a kind.");
+		let i = D(e, n);
+		for (let t of ye) t in e && r(`${n}.${t}`, `"${t}" is set when the proposal is applied; leave it out.`);
+		for (let t of ["from", "to"]) W(e[t]) && (b(e[t]) ? y.has(e[t]) && r(`${n}.${t}`, `Node "${e[t]}" is a node this proposal removes, so an edge cannot be added to it.`) : r(`${n}.${t}`, `Node "${e[t]}" is in neither the map nor the added nodes.`, "dangling"));
+		let a = E(e.from), o = E(e.to);
+		if (a && o) {
+			for (let t of ["when", "side"]) if (e[t] !== void 0) for (let i of s({
+				kind: e.kind,
+				[t]: e[t]
+			}, a, o)) r(`${n}.${t}`, `The edge ${i}`);
+		}
+		i && (_.has(i) ? r(n, `Edge ${O(e)} already exists in the map.`, "exists") : k.has(i) && r(n, `Edge ${O(e)} is already added by ${k.get(i)}.`), k.set(i, k.get(i) || n));
+	});
+	let A = /* @__PURE__ */ new Map(), j = (e, t, n) => {
+		let i = D(e, t);
+		return i ? (_.has(i) ? A.has(i) ? r(t, `Edge ${O(e)} is already ${A.get(i)} by this proposal.`) : A.set(i, n === "change" ? "changed" : "removed") : r(t, `Edge ${O(e)} does not exist in the map, so it cannot be ${n === "change" ? "changed" : "removed"}.`, "missing-target"), i) : null;
+	};
+	h.change.forEach((e, t) => {
+		let n = `edges.change[${t}]`;
+		if (!U(e)) return r(n, "A changed edge is an object with from, to, set and why.");
+		if (j(e, n, "change"), !U(e.set) || Object.keys(e.set).length === 0) r(`${n}.set`, "\"set\" must be an object of the fields to change.");
+		else {
+			for (let t of xe) t in e.set && r(`${n}.set.${t}`, `A change cannot set "${t}": it names the edge. Remove the edge and add a new one.`);
+			for (let t of be) t in e.set && r(`${n}.set.${t}`, `"${t}" is set when the proposal is applied; leave it out of "set".`);
+		}
+		W(e.why) || r(`${n}.why`, "A change needs a \"why\".");
+	}), h.remove.forEach((e, t) => {
+		let n = `edges.remove[${t}]`;
+		if (!U(e)) return r(n, "A removed edge is an object with from, to and why.");
+		j(e, n, "remove"), W(e.why) || r(`${n}.why`, "A removal needs a \"why\".");
+	});
+	function M(e, t) {
+		if (!W(e) || !_e.test(e)) return r(t, `"actor" must be a persona id: lower-case words joined by dashes, like "child" (got ${JSON.stringify(e)}).`);
+		let n = ee(e);
+		b(n) || r(t, `Actor "${e}" is no persona: "${n}" is in neither the map nor the added nodes.`, "dangling");
+	}
+	function N(e, t) {
+		if (!W(e)) return r(t, `"at" must be a node id or a live id (${H}).`);
+		b(e) || p(e) || (e.startsWith("live-") ? r(t, `"${e}" is not a live id: write ${H}.`) : r(t, `Step happens nowhere: "${e}" is in neither the map nor the added nodes, and is not a live id.`, "dangling"));
+	}
+	let P = "A check is { route, method } or { table, op, row? }";
+	function F(e, t) {
+		if (!U(e)) return r(t, `${P}.`);
+		let n = "route" in e || "method" in e, i = "table" in e || "op" in e || "row" in e;
+		if (n && i) return r(t, `${P}: either one, not both.`);
+		if (!n && !i) return r(t, `${P}.`);
+		let a = n ? ["route", "method"] : [
+			"table",
+			"op",
+			"row"
+		];
+		for (let i of Object.keys(e)) a.includes(i) || r(`${t}.${i}`, `Unknown key "${i}" in a ${n ? "route" : "table"} check. It has: ${a.join(", ")}.`);
+		n ? (W(e.route) && e.route.startsWith("/") || r(`${t}.route`, "\"route\" must be a path starting with a slash, as the map labels it (\"/api/v1/rooms/[id]\") or a concrete one."), pe.includes(e.method) || r(`${t}.method`, `"method" must be one of: ${pe.join(", ")}.`)) : (W(e.table) || r(`${t}.table`, "\"table\" must be the SQL table name."), me.includes(e.op) || r(`${t}.op`, `"op" must be one of: ${me.join(", ")}.`), e.row !== void 0 && !he.includes(e.row) && r(`${t}.row`, `"row" must be one of: ${he.join(", ")}.`));
+	}
+	function I(e, t) {
+		Array.isArray(e) ? e.forEach((e, n) => F(e, `${t}[${n}]`)) : F(e, t);
+	}
+	function L(e, t) {
+		if (!Array.isArray(e)) return r(t, "\"down\" must be a list of the cloud node ids the scenario takes down.");
+		if (e.length === 0) return r(t, "\"down\" needs at least one cloud node id; leave it out for a scenario that is no outage.");
+		let n = /* @__PURE__ */ new Set();
+		e.forEach((e, i) => {
+			let a = `${t}[${i}]`;
+			if (!W(e)) return r(a, "\"down\" holds node ids: strings like \"ext-cloudflare\".");
+			if (n.has(e)) return r(a, `"${e}" is down twice.`);
+			n.add(e);
+			let o = E(e);
+			if (!o) return r(a, `Down node "${e}" is in neither the map nor the added nodes.`, y.has(e) ? "missing-target" : "dangling");
+			if (o.type !== "external" || o.kind !== "cloud") {
+				let t = o.type === "external" ? o.kind === void 0 ? "an external with no kind" : `an external of kind ${o.kind}` : `a ${o.type}`;
+				r(a, `"${e}" is ${t}: only an external of kind cloud can be down (a container, a stack or a machine is the House view's; the public web is never down as a whole).`);
+			}
+		});
+	}
+	let ne = new Set(h.remove.filter((e) => U(e) && W(e.from) && W(e.to)).map(J)), R = (e, t) => ne.has(e) || y.has(t.from) || y.has(t.to);
+	t.scenarios !== void 0 && !Array.isArray(t.scenarios) && r("scenarios", "\"scenarios\" must be a list.");
+	let z = /* @__PURE__ */ new Set();
+	if (K(t.scenarios).forEach((e, t) => {
+		let n = `scenarios[${t}]`;
+		if (!U(e)) return r(n, "A scenario is an object with an id, a title and steps.");
+		W(e.id) ? z.has(e.id) && r(`${n}.id`, `Scenario id "${e.id}" is used twice.`) : r(`${n}.id`, "A scenario needs an \"id\"."), W(e.id) && z.add(e.id), W(e.title) || r(`${n}.title`, "A scenario needs a \"title\".");
+		for (let t of Object.keys(e)) fe.includes(t) || r(`${n}.${t}`, `Unknown key "${t}" in a scenario. A scenario has: ${fe.join(", ")}.`);
+		if (e.stepMs !== void 0 && !Se(e.stepMs) && r(`${n}.stepMs`, "\"stepMs\" must be a positive number of milliseconds."), e.linkNodes !== void 0 && typeof e.linkNodes != "boolean" && r(`${n}.linkNodes`, "\"linkNodes\" must be true or false."), e.actor !== void 0 && M(e.actor, `${n}.actor`), e.down !== void 0 && L(e.down, `${n}.down`), !Array.isArray(e.steps)) return r(`${n}.steps`, "\"steps\" must be a list.");
+		if (e.steps.length === 0) return r(`${n}.steps`, "A scenario needs at least one step.");
+		e.steps.forEach((t, i) => {
+			let a = `${n}.steps[${i}]`;
+			if (!U(t)) return r(a, "A step is an object with a \"node\" or an \"edge\", and some \"text\".");
+			for (let e of Object.keys(t)) V.includes(e) || r(`${a}.${e}`, `Unknown key "${e}" in a step. A step has "node" or "edge", and "text"; optionally ${V.slice(3).join(", ")}.`);
+			if (W(t.text) || r(`${a}.text`, "A step needs \"text\": what happens at this point."), t.ms !== void 0 && !Se(t.ms) && r(`${a}.ms`, "\"ms\" must be a positive number of milliseconds."), t.actor !== void 0 && M(t.actor, `${a}.actor`), t.at !== void 0 && N(t.at, `${a}.at`), t.check !== void 0 && I(t.check, `${a}.check`), t.expect !== void 0 && (ge.includes(t.expect) ? t.actor === void 0 && e.actor === void 0 && r(`${a}.expect`, "\"expect\" needs an actor, on the step or its scenario: a step with no actor is never checked.") : r(`${a}.expect`, `"expect" must be one of: ${ge.join(", ")}.`)), t.node === void 0 == (t.edge === void 0) && r(a, "A step points at exactly one of \"node\" or \"edge\"."), t.node !== void 0 && (W(t.node) ? b(t.node) || r(`${a}.node`, `Step points at nothing: node "${t.node}" is in neither the map nor the added nodes.`, y.has(t.node) ? "missing-target" : "dangling") : r(`${a}.node`, "\"node\" must be a node id.")), t.edge !== void 0) {
+				if (!U(t.edge)) return r(`${a}.edge`, "\"edge\" must be an object with from and to.");
+				let e = D(t.edge, `${a}.edge`);
+				e && !_.has(e) && !k.has(e) && r(`${a}.edge`, `Step points at nothing: edge ${O(t.edge)} is in neither the map nor the added edges.`, R(e, t.edge) ? "missing-target" : "dangling");
+			}
+		});
+	}), t.mockups !== void 0 && !Array.isArray(t.mockups)) r("mockups", "\"mockups\" must be a list.");
+	else if (Array.isArray(t.mockups)) {
+		t.mockups.length > 40 && r("mockups", "At most 40 mockups in one proposal.");
+		let e = /* @__PURE__ */ new Set([
+			...v.keys(),
+			...y,
+			...m.change.filter((e) => U(e) && W(e.id)).map((e) => e.id)
+		]), n = /* @__PURE__ */ new Set();
+		t.mockups.forEach((t, i) => {
+			let a = `mockups[${i}]`;
+			if (!U(t)) return r(a, "A mockup is an object with a node, a path and a title.");
+			for (let e of Object.keys(t)) ue.includes(e) || r(`${a}.${e}`, `Unknown key "${e}" in a mockup. A mockup has: ${ue.join(", ")}.`);
+			W(t.title) || r(`${a}.title`, "A mockup needs a \"title\": what the screen is. It is also its alt text.");
+			let o = Ce(t.path);
+			o ? r(`${a}.path`, o) : n.has(`${t.node}|${t.path}`) ? r(a, `Mockup "${t.path}" is listed twice for node "${t.node}".`) : n.add(`${t.node}|${t.path}`), W(t.node) ? e.has(t.node) || r(`${a}.node`, `Mockup is beside node "${t.node}", which this proposal does not add, change or remove. Name a node the proposal touches.`) : r(`${a}.node`, "A mockup needs the \"node\" it belongs to.");
+		});
+	}
+	return n;
+}
+var De = u.external;
+function Oe(e, t) {
+	let n = e.nodes.map((e) => ({
+		...e,
+		mark: "none"
+	})), r = e.edges.map((e) => ({
+		...e,
+		mark: "none"
+	})), i = new Map(n.map((e) => [e.id, e])), a = /* @__PURE__ */ new Map();
+	for (let e of r) {
+		let t = J(e);
+		a.has(t) || a.set(t, []), a.get(t).push(e);
+	}
+	let o = (e) => ({
+		add: K(t[e]?.add),
+		change: K(t[e]?.change),
+		remove: K(t[e]?.remove)
+	}), s = o("nodes"), c = o("edges"), l = (e, t, n) => {
+		let r = {}, i = (t, n) => {
+			q(e[t], n) || (r[t] = e[t] === void 0 ? null : e[t], e[t] = G(n));
+		};
+		for (let [e, n] of Object.entries(t || {})) i(e, n);
+		e.mark = "changed", e.before = r, e.why = n;
+	};
+	for (let e of s.change) {
+		let t = i.get(e.id);
+		if (!t) continue;
+		let n = { ...e.set }, r = u[n.type];
+		r && ("color" in n || (n.color = r.color), "r" in n || (n.r = r.r)), l(t, n, e.why);
+	}
+	for (let e of c.change) for (let t of a.get(J(e)) || []) l(t, e.set, e.why);
+	for (let e of c.remove) for (let t of a.get(J(e)) || []) delete t.before, t.mark = "removed", t.why = e.why;
+	for (let e of s.remove) {
+		let t = i.get(e.id);
+		if (t) {
+			t.mark = "removed", t.why = e.why;
+			for (let t of r) (t.from === e.id || t.to === e.id) && t.mark !== "removed" && (delete t.before, t.mark = "removed", t.why = e.why);
+		}
+	}
+	let d = [], f = (e) => {
+		let t = a.get(J(e));
+		t ? t.forEach((e) => {
+			e.mark === "none" && (e.mark = "added");
+		}) : r.push({
+			...G(e),
+			mark: "added"
+		});
+	};
+	for (let e of s.add) {
+		let { parent: t, ...r } = G(e), a = u[e.type] || De, o = i.get(e.id);
+		o ? o.mark === "none" && (o.mark = "added") : n.push({
+			...r,
+			color: a.color,
+			r: e.r ?? a.r,
+			mark: "added"
+		}), t && d.push({
+			from: t,
+			to: e.id
+		});
+	}
+	for (let e of d) f(e);
+	for (let e of c.add) f(e);
+	return {
+		nodes: n,
+		edges: r
+	};
+}
+function ke(e, t) {
+	let n = new Map(e.nodes.map((e) => [e.id, e])), r = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map();
+	for (let t of e.edges) {
+		let e = J(t);
+		r.has(e) || r.set(e, t);
+		let n = `${t.from}|${t.to}`;
+		a.has(n) || a.set(n, /* @__PURE__ */ new Set()), a.get(n).add(e), !t.kind && !t.dashed && (o.has(t.to) || o.set(t.to, /* @__PURE__ */ new Set()), o.get(t.to).add(t.from));
+	}
+	let s = (e, t) => Object.entries(t || {}).every(([t, n]) => q(e[t], n)), c = (e, n) => K(t?.[e]?.[n]), l = new Set(c("nodes", "add").filter((e) => U(e) && i(e)).map((e) => e.id)), u = (e) => l.has(e) || typeof e == "string" && e.startsWith("live-"), d = [], f = (e, t, n, r) => d.push({
+		kind: e,
+		op: t,
+		key: n,
+		status: r
+	});
+	for (let e of c("nodes", "add")) {
+		if (l.has(e.id)) {
+			f("node", "add", e.id, "live");
+			continue;
+		}
+		let t = n.get(e.id);
+		f("node", "add", e.id, t ? t.type !== e.type || e.parent && !o.get(e.id)?.has(e.parent) ? "diverged" : "landed" : "pending");
+	}
+	for (let e of c("nodes", "change")) {
+		let t = n.get(e.id);
+		f("node", "change", e.id, t ? s(t, e.set) ? "landed" : "pending" : "diverged");
+	}
+	for (let e of c("nodes", "remove")) f("node", "remove", e.id, n.has(e.id) ? "pending" : "landed");
+	for (let e of c("edges", "add")) {
+		let t = J(e);
+		if (u(e.from) || u(e.to)) {
+			f("edge", "add", t, "live");
+			continue;
+		}
+		let n = [...a.get(`${e.from}|${e.to}`) || []].some((e) => e !== t);
+		f("edge", "add", t, r.has(t) ? "landed" : n ? "diverged" : "pending");
+	}
+	for (let e of c("edges", "change")) {
+		let t = J(e), n = r.get(t);
+		f("edge", "change", t, n ? s(n, e.set) ? "landed" : "pending" : "diverged");
+	}
+	for (let e of c("edges", "remove")) {
+		let t = J(e);
+		f("edge", "remove", t, r.has(t) ? "pending" : "landed");
+	}
+	let p = {
+		total: d.length,
+		pending: 0,
+		landed: 0,
+		diverged: 0,
+		live: 0
+	};
+	for (let e of d) p[e.status]++;
+	return {
+		items: d,
+		summary: p
+	};
+}
+function Ae(e, t) {
+	let n = Ee(e, t), r = !1;
+	if (n.some((e) => e.state === "exists" || e.state === "missing-target")) try {
+		r = ke(e, t).items.some((e) => e.op === "add" && e.status === "landed");
+	} catch {}
+	return {
+		errors: r ? n.filter((e) => e.state !== "exists" && e.state !== "missing-target") : n,
+		building: r
+	};
+}
+function je(e) {
+	let t = (e) => ({
+		added: K(e?.add).length,
+		changed: K(e?.change).length,
+		removed: K(e?.remove).length
+	}), n = t(e?.nodes), r = t(e?.edges);
+	return {
+		added: n.added + r.added,
+		changed: n.changed + r.changed,
+		removed: n.removed + r.removed,
+		scenarios: K(e?.scenarios).length,
+		nodes: n,
+		edges: r
+	};
+}
+// ../explorer/camera-frame.js
+var Me = .18;
+function Ne(e, t, n, r = 0) {
+	return e.every((e) => {
+		let i = t.x + e.x * t.zoom, a = t.y + e.y * t.zoom;
+		return i >= n.x + r && i <= n.x + n.width - r && a >= n.y + r && a <= n.y + n.height - r;
+	});
+}
+function Pe(e, t, { padding: n = 40, minZoom: r = Me } = {}) {
+	if (e.length < 2) return e;
+	let i = m(n, t), a = (t.width - i * 2) / r, o = (t.height - i * 2) / r, s = e.map(h), c = (t, n) => e.filter((e, r) => s[r].left >= t && s[r].right <= t + a && s[r].top >= n && s[r].bottom <= n + o), l = s.map((e) => e.left), u = s.map((e) => e.top), d = [], f = e.length <= 120 ? l.flatMap((e) => u.map((t) => [e, t])) : s.map((e) => [e.left, e.top]);
+	for (let [t, n] of f) {
+		if (d.length === e.length) break;
+		let r = c(t, n);
+		r.length > d.length && (d = r);
+	}
+	return d.length ? d : [e[0]];
+}
+function Fe(e, t, n, r = 0) {
+	let i = e.x + t.x * e.zoom, a = e.y + t.y * e.zoom, o = Math.min(r, (n.right - n.left) / 2), s = Math.min(r, (n.bottom - n.top) / 2), c = i < n.left + o || i > n.right - o, l = a < n.top + s || a > n.bottom - s;
+	return !c && !l ? null : {
+		x: c ? (n.left + n.right) / 2 - t.x * e.zoom : e.x,
+		y: l ? (n.top + n.bottom) / 2 - t.y * e.zoom : e.y,
+		zoom: e.zoom
+	};
+}
+var Ie = 0;
+function Le(e, t = 5) {
+	if (e.length <= t + 1) return e.join("");
+	let n = `hx-more-${++Ie}`, r = e.length - t;
+	return `${e.slice(0, t).join("")}<div class="hx-more" id="${n}" hidden>${e.slice(t).join("")}</div><button data-corn="more" data-corn-kind="quiet" type="button" class="hx-btn hx-btn--quiet hx-textact hx-more-btn" data-more="${n}" data-rest="${r}" aria-expanded="false" aria-controls="${n}">and ${r} more</button>`;
+}
+function Re(e) {
+	let t = e.closest && e.closest("[data-more]");
+	if (!t) return !1;
+	let n = t.previousElementSibling, r = n && n.id === t.dataset.more ? n : null, i = t.getAttribute("aria-expanded") !== "true";
+	return r && (r.hidden = !i), t.setAttribute("aria-expanded", String(i)), t.textContent = i ? "Show fewer" : `and ${t.dataset.rest} more`, !0;
+}
+// ../explorer/cloud-panel.js
+var Y = {
+	free: "Free",
+	paid: "Paid",
+	unknown: "Plan unknown",
+	off: "Off"
+};
+function ze(e) {
+	return !e || !Y[e.tier] ? "" : e.note ? `${Y[e.tier]} · ${e.note}` : Y[e.tier];
+}
+var Be = {
+	container: ["container", "containers"],
+	machine: ["machine", "machines"],
+	app: ["app", "apps"],
+	service: ["service", "services"],
+	page: ["endpoint", "endpoints"],
+	external: ["cloud service", "cloud services"]
+}, X = (e, t) => {
+	let n = Be[e] || [e, `${e}s`];
+	return t === 1 ? n[0] : n[1];
+};
+function Ve(t, n, i) {
+	let a = new Map(n.map((e) => [e.id, e])), o = new Map(Object.keys(e).map((e) => [e, /* @__PURE__ */ new Map()]));
+	for (let e of i) {
+		if (e.kind !== "calls" || e.to !== t.id) continue;
+		let n = o.get(r(e)), i = a.get(e.from) || {
+			id: e.from,
+			label: e.from,
+			type: "node"
+		}, s = n.get(e.from) || {
+			id: e.from,
+			label: String(i.label || e.from),
+			type: i.type,
+			vias: [],
+			browser: !1
+		};
+		e.label && !s.vias.includes(e.label) && s.vias.push(e.label), e.side === "browser" && (s.browser = !0), n.set(e.from, s);
+	}
+	let s = [];
+	for (let [t, n] of o) {
+		if (n.size === 0) continue;
+		let r = /* @__PURE__ */ new Map();
+		for (let { vias: e, ...t } of n.values()) r.has(t.type) || r.set(t.type, []), r.get(t.type).push({
+			...t,
+			via: e.join(", ")
+		});
+		let i = [...r].map(([e, t]) => ({
+			type: e,
+			noun: X(e, 1),
+			items: t.sort((e, t) => e.label.localeCompare(t.label))
+		})).sort((e, t) => t.items.length - e.items.length || e.type.localeCompare(t.type)), { title: a, color: o } = e[t];
+		s.push({
+			when: t,
+			title: a,
+			color: o,
+			count: n.size,
+			types: i
+		});
+	}
+	return s;
+}
+var He = {
+	run: "Breaks now",
+	deploy: "Breaks on deploy",
+	renew: "Breaks on renewal"
+}, Z = (e, n) => n.length ? `<div class="hx-fact" data-corn="section"><div class="hx-fact-k">${t(e)}</div><div class="hx-fact-v">${Le(n)}</div></div>` : "", Q = (e) => `<div class="hx-line">${e}</div>`, $ = (e) => `<span class="hx-name">${t(e)}</span>`;
+function Ue(e, n) {
+	let r = e.browser ? " <span class=\"hx-cloud-browser\">(browser)</span>" : "", i = [n ? X(e.type, 1) : "", e.via].filter(Boolean);
+	return Q(`<span>${$(e.label)}${r}${i.length ? `<span class="hx-faint"> · ${t(i.join(" · "))}</span>` : ""}</span>`);
+}
+var We = (e) => `<button data-corn-kind="quiet" type="button" class="hx-btn hx-btn--quiet hx-cloud-play" data-action="play-outage" data-id="${t(e.id)}">Play: ${t(String(e.label || e.id))} is down</button>`;
+function Ge(e, n, r) {
+	let i = new Map(n.map((e) => [e.id, e])), a = (e) => String((i.get(e) || { label: e }).label || e), o = e.kind === "web", s = o ? [] : e.roles || [], c = Ve(e, n, r).map((e) => {
+		let t = e.types.length > 1;
+		return Z(He[e.when], e.types.flatMap((e) => e.items.map((e) => Ue(e, t))));
+	}).join("") || Z("Used by", [Q("<span class=\"hx-faint\">Nothing on the map uses it.</span>")]), l = r.filter((t) => t.kind === "calls" && t.from === e.id && (i.get(t.to) || {}).type === "external").map((e) => Q(`<span>${$(a(e.to))}${e.label ? `<span class="hx-faint"> · ${t(e.label)}</span>` : ""}</span>`)), u = r.filter((t) => t.kind === "delivers" && t.from === e.id).map((e) => Q($(a(e.to))));
+	return (o ? "" : Z("Plan", [Q(t(ze(e.plan) || Y.unknown))])) + Z("Roles", s.length ? [Q(t(s.join(", ")))] : []) + Z("If it's down", [Q(t(e.breaks || "Not described yet."))]) + c + Z("Relies on", l) + Z("Pushes to", u) + (o ? "" : We(e));
+}
+export { O as A, oe as C, ne as D, se as E, S as F, b as I, x as L, w as M, C as N, B as O, y as P, k as S, ae as T, te as _, Re as a, I as b, Pe as c, J as d, we as f, L as g, T as h, Le as i, ce as j, ie as k, Fe as l, je as m, Ve as n, Me as o, Ae as p, X as r, Ne as s, Ge as t, Oe as u, D as v, N as w, M as x, E as y };