' + (n ? r : O(r, true)) + `
" + (n ? r : O(r, true)) + `
${this.parser.parse(e)}
${this.parser.parseInline(e)}
${O(e, true)}
An error occurred:
" + O(n.message + "", true) + "
\s*(]*>)\s*<\/p>/g; var CELL_STATUS = /]*)>\s*(ok|no|warn|✓|✔|✗|✘|⚠)(?:\s+((?:(?!<\/?td\b)[\s\S])*?))?\s*<\/td>/g; function figure(img) { const alt = img.match(/\salt="([^"]*)"/)?.[1]; return `${img}${alt ? `${alt}` : ""}`; } function decorate(html) { return html.replace(//g, '').replace(/<\/table>/g, "").replace(IMAGE_ONLY, (_2, img) => figure(img)).replace(CELL_STATUS, (_2, attrs, word, label = "") => `${statusHtml(word, label)}`); } var SPACED_IMAGE = /(`[^`\n]*`)|(!\[[^\]\n]*\]\()\s*((?:[^()<>"\n]|\([^()<>"\n]*\))*?)(\s+"[^"\n]*")?\s*\)/g; function wrapSpacedImages(text) { return text.replace(SPACED_IMAGE, (whole, code, head, dest, title = "") => code || !/\s/.test(dest) ? whole : `${head}<${dest}>${title})`); } function md(text) { return decorate(marked.parse(wrapSpacedImages(String(text ?? "")))); } function mdInline(text) { return inline.parseInline(wrapSpacedImages(String(text ?? ""))); } // src/components/error.js var ComponentError = class extends Error { constructor(message, line = 0) { super(message); this.name = "ComponentError"; this.line = line; } }; function contentLines(text) { return String(text).split("\n").map((raw, i) => ({ raw, text: raw.trim(), line: i + 1 })).filter((l3) => l3.text && !l3.text.startsWith("//")); } function fields(text) { return text.split("|").map((s) => s.trim()); } // src/components/callout.js var KINDS = /* @__PURE__ */ new Set(["info", "ok", "warn", "err"]); var ALIASES = { warning: "warn", error: "err", note: "info" }; var callout_default = { name: "callout", summary: "Conclusion / tip / warning bar", syntax: `\`\`\`callout [title] Body (Markdown) \`\`\` - If the first argument is not a type, the whole argument string is the title and the type is info.`, example: "```callout warn Caution\nClose the valve before you remove the pump.\n```", render(text, { args }) { const [first = "", ...rest] = args.split(/\s+/).filter(Boolean); const kind2 = KINDS.has(first) ? first : "info"; const title = (KINDS.has(first) ? rest.join(" ") : args).trim(); if (!title && !text.trim()) throw new ComponentError("callout needs a title or a body", 1); const firstLine = contentLines(text)[0]; const typeLine = firstLine && firstLine.text.match(/^type\s*[:：]\s*([a-z][\w-]*)\s*(?:#.*)?$/i); if (typeLine) { const word = typeLine[1].toLowerCase(); const wrongKind = KINDS.has(word) ? word : ALIASES[word] ?? ""; throw new ComponentError(`callout: put the type on the fence line, not in the body: \`\`\`callout ${wrongKind} [title]. The line "${firstLine.text}" would show as body text`, firstLine.line); } const head = title ? `${esc(title)}` : ""; const body = text.trim() ? `${md(text)}` : ""; return `${head}${body}`; } }; // src/components/kv.js var kv_default = { name: "kv", summary: "Key-value grid / title block (metadata)", syntax: `\`\`\`kv [cols=2] key: value * wide key: value \u2190 starts with *: spans the full row, larger text \`\`\` - Splits at the first colon (: or the fullwidth colon); the value may contain more colons.`, example: "```kv cols=2\n* Title: Simplified Technical English\nSpecification: ASD-STE100\nOwner: ASD\n```", render(text, { args }) { const cols = Math.max(1, Math.min(Number(parseAttrs(args).cols) || 2, 6)); const cells = contentLines(text).map(({ text: t, line }) => { const wide = t.startsWith("*"); const body = wide ? t.slice(1).trim() : t; const m = body.match(/^([^:：]+)[:：]\s*(.*)$/); if (!m) throw new ComponentError(`kv line has no colon: "${t}"; expected key: value`, line); return `${esc(m[1].trim())}${mdInline(m[2])}`; }); if (!cells.length) throw new ComponentError("kv needs at least one key: value line", 1); return `${cells.join("")}`; } }; // src/components/timeline.js var timeline_default = { name: "timeline", summary: "Timeline / phases", syntax: `\`\`\`timeline [h|v] time | title | note (optional) *time | title \u2190 starts with *: highlights the item \`\`\` - By default \u22646 items are horizontal and >6 are vertical; the h / v argument forces a direction.`, example: "```timeline\n1979 | AECMA starts the study\n1986 | First guide published\n*Now | Free download | Maintained by ASD STEMG\n```", render(text, { args }) { const items = contentLines(text).map(({ text: t, line }) => { const parts = fields(t); if (parts.length < 2 || !parts[1]) throw new ComponentError(`timeline line must be time | title | note: "${t}"`, line); const hi = parts[0].startsWith("*"); return { when: hi ? parts[0].slice(1).trim() : parts[0], title: parts[1], detail: parts[2] ?? "", hi }; }); if (!items.length) throw new ComponentError("timeline needs at least one item", 1); const vertical = /\bv(ertical)?\b/.test(args) || !/\bh(orizontal)?\b/.test(args) && items.length > 6; const lis = items.map((it3) => `${esc(it3.when)}${mdInline(it3.title)}${it3.detail ? `${mdInline(it3.detail)}` : ""}`); return vertical ? `${lis.join("")}` : `${lis.join("")}`; } }; // src/components/annot.js var SEG = /\[([^\]]+)\]\{(!?)([^}]*)\}/g; var TEXT_SIZE = 14; var NOTE_SIZE = 11; var NOTE_GAP = 10; var annot_default = { name: "annot", summary: "Sentence annotation by segment (underline bracket + note)", syntax: `\`\`\`annot # Heading | right-side note (optional) Sentence text, [annotated span]{note}, [wrong span]{!red note}. > Caption below (optional) \`\`\` - Each # starts a group; a group can hold several sentences. Overlapping notes move to separate rows automatically.`, example: '```annot\n# 1 Procedural sentence | 13 words, limit 20\nMake sure that [the hydraulic reservoir]{Technical name} is [full]{!Not "replenished"}.\n> Write one instruction per sentence\n```', render(text, { dir = "ltr" } = {}) { const groups = []; let group = null; const ensure = () => group ?? (group = pushGroup(groups, {})); for (const { text: t, line } of contentLines(text)) { if (t.startsWith("#")) { const [title, meta = ""] = fields(t.replace(/^#+\s*/, "")); group = pushGroup(groups, { title, meta }); } else if (t.startsWith(">")) { ensure().captions.push(t.replace(/^>\s*/, "")); } else { ensure().lines.push(sentenceHtml(t, line, dir === "rtl")); } } if (!groups.length) throw new ComponentError("annot needs at least one sentence", 1); return groups.map(groupHtml).join(""); } }; function pushGroup(groups, { title = "", meta = "" }) { const g = { title, meta, lines: [], captions: [] }; groups.push(g); return g; } function groupHtml(g) { const head = g.title || g.meta ? `${esc(g.title)}${g.meta ? `${esc(g.meta)}` : ""}` : ""; const lines = g.lines.map((l3) => `${l3}`).join(""); const caps = g.captions.map((c) => `${esc(c)}`).join(""); return `${head}${lines}${caps}`; } function sentenceHtml(sentence, line, rtl) { const stripped = sentence.replace(SEG, ""); if (/\[[^\]]*\]\{|\]\{[^}]*$/.test(stripped)) { throw new ComponentError(`annot has an unclosed annotation; expected [span]{note}: "${sentence}"`, line); } const rows = []; let out = ""; let plain = ""; let last = 0; for (const m of sentence.matchAll(SEG)) { const before = sentence.slice(last, m.index); out += esc(before); plain += before; const [, seg, bang, note2] = m; const x2 = measure(plain, TEXT_SIZE, { mono: !rtl }); const noteHtml2 = note2.trim() ? `${esc(note2.trim())}` : ""; out += `${esc(seg)}${noteHtml2}`; plain += seg; last = m.index + m[0].length; } out += esc(sentence.slice(last)); const wrapCls = rows.length ? "" : " am-annot-line--wrap"; return `${out}`; } function placeNote(rows, start, end) { const idx = rows.findIndex((ranges) => ranges.every(([s, e]) => end <= s || start >= e)); if (idx !== -1) { rows[idx].push([start, end]); return idx; } rows.push([[start, end]]); return rows.length - 1; } // src/components/delta.js var STATE_OF = { "+": "added", "-": "removed", "~": "changed" }; var SIGN = { added: "+", removed: "\u2212", changed: "~" }; var STATES = Object.keys(SIGN); var EN_DELTA = { added: "added", removed: "removed", changed: "changed", view: "View", before: "Before", changes: "Changes", after: "After" }; var labelsOf = (ui) => ({ ...EN_DELTA, ...ui?.delta }); function splitMarker(text) { const m = text.match(/^([+\-~]) +(\S.*)$/); return m ? { mark: m[1], text: m[2] } : { mark: null, text }; } var markState = (mark) => STATE_OF[mark] ?? null; var deltaAttr = (state) => state ? ` data-delta="${state}"` : ""; function deltaBadge(state, ui) { if (!state) return ""; return `${SIGN[state]}`; } function withDelta(html, states, { ui, video = false } = {}) { const used = STATES.map((s) => [s, states.filter((x2) => x2 === s).length]).filter(([, n]) => n > 0); if (!used.length) return html; const t = labelsOf(ui); const word = (s, n) => n === 1 ? t[s] : t.counts?.[s] ?? t[s]; const counts = used.map(([s, n]) => `${SIGN[s]}${n} ${esc(word(s, n))}`).join(" "); const views = ["before", "changes", "after"].map((v) => `${esc(t[v])}`).join(""); const switcher = video ? "" : `${views}`; const open = html.indexOf(">"); const close = html.lastIndexOf("${counts}${switcher}${html.slice(close)}`; } // src/components/tree.js var tree_default = { name: "tree", summary: "Hierarchy tree (org chart / indented list)", syntax: `\`\`\`tree [list] Root | subtitle Child Grandchild | one-line note *Highlighted child \`\`\` - Indentation (spaces or tabs) sets the level; "label | note" adds a gray note. - One root with 2 to 4 children \u2192 org chart; more children or the list argument \u2192 indented list; several roots \u2192 side by side. - Labels support inline Markdown, such as \`Section 1\` Words. - Change markers show what a plan adds, removes and changes. A line can start with + (added), - (removed) or ~ (changed), followed by a space, after the indentation: \`\`\`tree list src/ components/ + delta.js | parses change markers ~ flow.js ~ tree.js - legacy/ old-flow.js \`\`\` - Indentation still sets the level. The children of a + or - node inherit it; a child that carries a different marker is an error. ~ marks one node and is not inherited. - The Changes view draws added in the theme's ok color, removed faded with a struck-through label, changed with a warn outline, and each marked node with a +, \u2212 or ~ badge. A count row and a Before / Changes / After switch sit under the tree: Before and After show the tree as it was and as it will be, plain and without the items that are not in that view. - A line that starts with a marker and a space is always read as a marker. To keep a label that starts with "- ", write \\- item.`, example: "```tree\nASD-STE100 | Simplified Technical English\n Part 1: Writing rules\n `Section 1` Words\n Part 2: Dictionary\n Approved words | one word, one meaning\n```", render(text, { args, ui, video }) { const roots = buildTree(text); if (!roots.length) throw new ComponentError("tree needs at least one node", 1); return withDelta(treeHtml(roots, /\blist\b/.test(args), ui), statesOf(roots), { ui, video }); } }; function treeHtml(roots, listMode, ui) { if (roots.length === 1) { const [root] = roots; const n = root.children.length; if (!listMode && n >= 2 && n <= 4) return orgHtml(root, ui); return `${rootBox(root, ui, true)}${listHtml(root.children, ui)}`; } if (!listMode && roots.length <= 4) { return `${colsHtml(roots, ui)}`; } return `${listHtml(roots, ui)}`; } var statesOf = (nodes) => nodes.flatMap((n) => [n.state, ...statesOf(n.children)]); function buildTree(text) { const roots = []; const stack = []; let step = 0; String(text).split("\n").forEach((raw, i) => { if (!raw.trim()) return; const indent = raw.replace(/\t/g, " ").match(/^ */)[0].length; const node = { ...parseLabel(raw.trim()), indent, step: step++, line: i + 1, children: [] }; while (stack.length && stack.at(-1).indent >= indent) stack.pop(); (stack.length ? stack.at(-1).children : roots).push(node); stack.push(node); }); return roots.map((root) => settle(root, null)); } function settle(node, inherited) { const own = markState(node.mark); if (inherited && own && own !== inherited) { throw new ComponentError(`tree: "${node.mark}" under a ${inherited} node contradicts it. The children of a ${inherited} node are ${inherited} too; remove the marker or move the node`, node.line); } const state = inherited ?? own; const below = state === "added" || state === "removed" ? state : null; return { ...node, state, children: node.children.map((child) => settle(child, below)) }; } function parseLabel(t) { const escaped = /^\\[+\-~] /.test(t); const { mark, text } = escaped ? { mark: null, text: t.slice(1) } : splitMarker(t); const hi = text.startsWith("*"); const [label, sub = ""] = fields(hi ? text.slice(1) : text); return { label, sub, hi, mark }; } var labelHtml = (label) => mdInline(label).replace(/^([^<]*)<\/code>(?=\s*\S)/, '$1'); var vattrs = (n) => ` data-key="${esc(n.label)}" data-step="${n.step}"${deltaAttr(n.state)}`; var HIDDEN_IN = { before: "added", after: "removed" }; function lineAttrs(siblings, i, cols) { const n = siblings.length; return Object.entries(HIDDEN_IN).map(([view, hidden]) => { const shown2 = siblings.map((x2) => x2.state !== hidden); const first = shown2.indexOf(true); const last = shown2.lastIndexOf(true); const natural = cols ? n === 1 ? "none" : i === 0 ? "start" : i === n - 1 ? "end" : "full" : i < n - 1 ? "full" : "short"; const kind2 = cols ? first === last || i < first || i > last ? "none" : i === first ? "start" : i === last ? "end" : "full" : i < last ? "full" : i === last ? "short" : "none"; return kind2 === natural ? "" : ` data-line-${view}="${kind2}"`; }).join(""); } var dropAttrs = (children) => Object.entries(HIDDEN_IN).map(([view, hidden]) => children.every((c) => c.state === hidden) ? ` data-line-${view}="none"` : "").join(""); var boxInner = (n, ui) => `${deltaBadge(n.state, ui)}${labelHtml(n.label)}${n.sub ? `${mdInline(n.sub)}` : ""}`; function rootBox(root, ui, solo = false) { const drop = solo ? "" : dropAttrs(root.children); return `${boxInner(root, ui)}`; } function colHtml(node, ui, siblings, i) { const children = node.children.length ? listHtml(node.children, ui) : ""; return `${boxInner(node, ui)}${children}`; } var colsHtml = (nodes, ui) => nodes.map((n, i) => colHtml(n, ui, nodes, i)).join(""); function orgHtml(root, ui) { return `${rootBox(root, ui)}${colsHtml(root.children, ui)}`; } function listHtml(nodes, ui) { return `${nodes.map((n, i) => liHtml(n, ui, nodes, i)).join("")}`; } function liHtml(n, ui, siblings, i) { const sub = n.sub ? `${mdInline(n.sub)}` : ""; const kids = n.children.length ? `${n.children.map((c, k2) => liHtml(c, ui, n.children, k2)).join("")}` : ""; return `${deltaBadge(n.state, ui)}${labelHtml(n.label)}${sub}${kids}`; } // src/components/limits.js var NICE_MAX = [1, 1.5, 2, 2.5, 3, 4, 5, 6, 8, 10]; var NICE_STEP = [1, 2, 2.5, 5, 10]; function niceScale(peak) { if (!Number.isFinite(peak) || peak <= 0) return { max: 1, step: 1 }; const target = peak * 1.4; const pow = 10 ** Math.floor(Math.log10(target)); const integral = Number.isInteger(peak); const nice = NICE_MAX.map((m) => m * pow).find((m) => m >= target - 1e-9) ?? 10 * pow; const max = integral ? Math.ceil(nice) : nice; const stepPow = 10 ** Math.floor(Math.log10(max)); const step = [...NICE_STEP.map((s) => s * stepPow / 10), ...NICE_STEP.map((s) => s * stepPow)].find((s) => max / s <= 7 && Number.isInteger(round(max / s)) && (integral ? s >= 1 : true)) ?? max; return { max: round(max), step: round(step) }; } var round = (n) => Math.round(n * 1e3) / 1e3; var pct = (v, max) => `${Math.round(v / max * 1e4) / 100}%`; var NUM = /^(?:max\s+)?(-?\d+(?:\.\d+)?)$/i; var limits_default = { name: "limits", summary: "Value vs limit bars", syntax: `\`\`\`limits label | value / limit | unit (optional) | note (optional) label | limit | unit \u2190 limit only: the bar fills to the limit \`\`\` - A row turns red when the value is over the limit. The limit may be written as "max 20".`, example: "```limits\nProcedural sentence | 13 / 20 | words\nDescriptive sentence | max 25 | words\nNoun cluster | 4 / 3 | words | over\n```", render(text, { dir = "ltr", ui } = {}) { const rows = contentLines(text).map(({ text: t, line }) => parseRow(t, line)); if (!rows.length) throw new ComponentError("limits needs at least one line", 1); const words3 = { ...EN_WORDS, ...ui?.limits }; return `${rows.map((row) => rowHtml(row, dir === "rtl" ? "right" : "left", words3)).join("")}`; } }; function parseRow(t, line) { const [label, spec = "", unit = "", note2 = ""] = fields(t); const [a, b] = spec.split("/").map((s) => s.trim()); const nums = (b === void 0 ? [a] : [a, b]).map((s) => s?.match(NUM)?.[1]); if (!spec || nums.some((n) => n === void 0)) { throw new ComponentError(`limits line must be label | value / limit | unit: "${t}"`, line); } const [value, limit] = b === void 0 ? [null, Number(nums[0])] : nums.map(Number); return { label, value, limit, unit, note: note2 }; } var EN_WORDS = { value: "{value} / max {limit}", limit: "max {limit}" }; var fill = (template, value, limit) => template.replace("{value}", value).replace("{limit}", limit); function rowHtml({ label, value, limit, unit, note: note2 }, side = "left", words3 = EN_WORDS) { const { max, step } = niceScale(Math.max(limit, value ?? 0)); const shown2 = value ?? limit; const over2 = value !== null && value > limit; const valText = `${value !== null ? fill(words3.value, value, limit) : fill(words3.limit, value, limit)}${unit ? ` ${unit}` : ""}`; const ticks = []; if (step > 0 && max > 0) { for (let v = 0; v <= max + 1e-9; v += step) ticks.push(`${round(v)}`); } return ` ${esc(label)}${note2 ? `${esc(note2)}` : ""}${esc(valText)} ${ticks.join("")} `; } // src/runtime/rtl-letter.js var RTL_LETTER = /[\p{Script=Hebrew}\p{Script=Arabic}\p{Script=Syriac}\p{Script=Thaana}\p{Script=Nko}\p{Script=Samaritan}\p{Script=Mandaic}]/u; // src/bidi.js var LETTER = new RegExp("\\p{L}", "u"); function isLtrOnly(text) { const s = decode2(text); return !RTL_LETTER.test(s) && [...s].some((ch) => LETTER.test(ch)); } var hasRtl = (text) => RTL_LETTER.test(decode2(text)); var decode2 = (text) => String(text ?? "").replace(/&(amp|lt|gt|quot|#39);/g, (_2, e) => ({ amp: "&", lt: "<", gt: ">", quot: '"', "#39": "'" })[e]).replace(/&[#\w]+;/g, " "); var NEUTRAL = /[\p{P}\p{S}]/u; var WJ = String.fromCharCode(8288); var PREFIX = new RegExp("((?:^|[\\s(])\\p{Script=Hebrew}{1,3}-)(?=[^\\s-])", "gu"); var SIGNED = /(^|[\s(])([+\-−±~]\d[\d.,]*%?)/g; var WORD = /\S+/g; var WORD_LEAD = new RegExp(`^(?:\\p{Script=Hebrew}{1,3}[-\\u05BE]|[([{\xAB\u201C\u2018"']|"|')+`, "u"); var WORD_TRAIL = /(?:[.,:!?)\]}»”’…"'،؛؟]|(?${core}${trail}` : word; } var LRI = String.fromCharCode(8294); var PDI = String.fromCharCode(8297); function svgLine(line, dir) { if (dir !== "rtl") return line; return isLtrOnly(line) ? `${LRI}${line}${PDI}` : line; } var INLINE = /* @__PURE__ */ new Set(["a", "abbr", "b", "cite", "code", "del", "dfn", "em", "i", "ins", "kbd", "mark", "q", "s", "samp", "strong", "sub", "sup", "u", "var"]); var SKIP = /* @__PURE__ */ new Set(["svg", "math", "pre", "script", "style", "textarea", "select", "option", "title"]); var TOKEN = /|<\/?([a-zA-Z][\w-]*)\b(?:[^>"']|"[^"]*"|'[^']*')*>|[^<]+| { if (!run2.length) return; const text = run2.filter((t) => !t.startsWith("<")).join(""); const tags = run2.filter((t) => t.startsWith("<") && !t.startsWith("|->)\s*([^:：]+?)\s*(?:[:：]\s*(.*))?$/ }; function parseSequence(text) { const participants = []; const add = (p) => { if (!participants.includes(p)) participants.push(p); }; const steps = []; for (const { text: t, line } of contentLines(text)) { let m; if (m = t.match(RE.participants)) { m[1].split(/[,，]/).map((s) => s.trim()).filter(Boolean).forEach(add); } else if (m = t.match(RE.note)) { const over2 = m[1].split(/[,，]/).map((s) => s.trim()).filter(Boolean); over2.forEach(add); steps.push({ kind: "note", over: over2, text: m[2].trim(), line }); } else if (m = t.match(RE.divider)) { steps.push({ kind: "divider", text: m[1], line }); } else if (m = t.match(RE.msg)) { add(m[1]); add(m[3]); steps.push({ kind: "msg", from: m[1], to: m[3], dashed: m[2] === "-->", label: (m[4] ?? "").trim(), line }); } else { throw new ComponentError(`sequence cannot parse "${t}". Write a message as A -> B: label (--> is a dashed return) and a note as note A: text`, line); } } if (!participants.length) throw new ComponentError("sequence needs at least one message", 1); return { participants, steps }; } var sequence_default = { name: "sequence", summary: "Sequence diagram (messages between participants)", syntax: `\`\`\`sequence [num] participants: A, B, C \u2190 optional, fixes the participant order A -> B: request \u2190 solid line B --> A: response \u2190 dashed line (return) B -> B: self call note A: note on one participant note A, C: note across several participants == Phase divider == \`\`\` - Argument num: number the messages.`, example: "```sequence\nClient -> Server: SYN\nServer --> Client: SYN-ACK\nClient -> Server: ACK\nnote Client, Server: ESTABLISHED\n```", render(text, { args, uid, ui, dir = "ltr" }) { const model = parseSequence(text); return `${layout(model, { num: /\bnum\b/.test(args), id: uid(), ui, dir })}`; } }; function layout({ participants: ps, steps }, { num, id, ui, dir = "ltr" }) { const idx = new Map(ps.map((p, i) => [p, i])); const actorW = ps.map((p) => Math.max(measure(p, FS) + 28, 84)); const gaps = ps.slice(1).map((_2, i) => (actorW[i] + actorW[i + 1]) / 2 + 28); let extraRight = 0; let extraLeft = 0; const prepared = steps.map((s) => { if (s.kind === "msg") { const lines2 = s.label ? wrap(s.label, LABEL_MAX, FS) : []; const width2 = Math.max(0, ...lines2.map((l3) => measure(l3, FS))) + (num ? 34 : 22); const a = idx.get(s.from); const b = idx.get(s.to); if (a === b) { if (a < gaps.length) gaps[a] = Math.max(gaps[a], width2 + 48); else extraRight = Math.max(extraRight, width2 + 40); } else { const [lo, hi] = [Math.min(a, b), Math.max(a, b)]; const span = gaps.slice(lo, hi).reduce((x2, y3) => x2 + y3, 0); if (span < width2) gaps[hi - 1] += width2 - span; } return { ...s, lines: lines2, a, b }; } const lines = wrap(s.text, 220, 12); const w = Math.max(...lines.map((l3) => measure(l3, 12))) + 20; if (s.kind === "note" && s.over.length === 1) { const i = idx.get(s.over[0]); if (i === 0) extraLeft = Math.max(extraLeft, w / 2 - actorW[0] / 2); if (i === ps.length - 1) extraRight = Math.max(extraRight, w / 2 - actorW[i] / 2); } return { ...s, lines, w }; }); const xs = [MARGIN + extraLeft + actorW[0] / 2]; gaps.forEach((g) => xs.push(xs.at(-1) + g)); const width = xs.at(-1) + actorW.at(-1) / 2 + MARGIN + extraRight; const rtl = dir === "rtl"; const X3 = mirror(width, rtl); const dx = rtl ? -1 : 1; const body = []; let y2 = TOP + ACTOR_H + 22; let n = 0; for (const [k2, s] of prepared.entries()) { const start = body.length; if (s.kind === "msg") { n++; const cls = `am-edge${s.dashed ? " am-edge--dashed" : ""}`; const marker = ` marker-end="url(#${id}-arrow)"`; const step = num ? `${n}` : ""; if (s.a === s.b) { const x2 = X3(xs[s.a]); const labelX = x2 + dx * 40; body.push(s.lines.map((l3, k3) => `${esc(svgLine(l3, dir))}`).join("")); body.push(``, step); y2 += Math.max(s.lines.length * LH, 20) + 28; } else { y2 += s.lines.length * LH; const [x1, x2] = [X3(xs[s.a]), X3(xs[s.b])]; const mx = (x1 + x2) / 2; body.push(s.lines.map((l3, k3) => `${esc(svgLine(l3, dir))}`).join("")); body.push(``, step); y2 += 24; } } else if (s.kind === "note") { const xsOver = s.over.map((p) => X3(xs[idx.get(p)])); const lo = Math.min(...xsOver); const hi = Math.max(...xsOver); const w = Math.max(s.w, hi - lo + 40); const h2 = s.lines.length * LH + 12; const cx = (lo + hi) / 2; body.push(``); body.push(textLines(s.lines, cx, y2 + h2 / 2, LH, ' font-size="12"', dir)); y2 += h2 + 16; } else { const w = Math.max(...s.lines.map((l3) => measure(l3, 12))) + 20; body.push(``); body.push(``); body.push(textLines(s.lines.slice(0, 1), width / 2, y2 + 10, LH, ' font-size="12"', dir)); y2 += 34; } body.splice(start, body.length - start, `${body.slice(start).join("")}`); } const height = y2 + 6; const actors = ps.map((p, i) => { const x2 = X3(xs[i]); return `${textLines([p], x2, TOP + ACTOR_H / 2, LH, ' font-weight="600"', dir)}`; }); return `${svgOpen(width, height, diagramLabel(ui, "sequence", ps), dir)}${arrowDefs(id)}${actors.join("")}${body.join("")}`; } // node_modules/@dagrejs/dagre/dist/dagre.esm.js var Te2 = Object.defineProperty; var In = (e, n, t) => n in e ? Te2(e, n, { enumerable: true, configurable: true, writable: true, value: t }) : e[n] = t; var Sn = (e, n) => { for (var t in n) Te2(e, t, { get: n[t], enumerable: true }); }; var je2 = (e, n, t) => In(e, typeof n != "symbol" ? n + "" : n, t); var ie2 = {}; Sn(ie2, { Graph: () => T2, alg: () => H }); var Mn = Object.defineProperty; var Se = (e, n) => { for (var t in n) Mn(e, t, { get: n[t], enumerable: true }); }; var Q2 = class { constructor(e) { this._isDirected = true, this._isMultigraph = false, this._isCompound = false, this._nodes = {}, this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {}, this._nodeCount = 0, this._edgeCount = 0, this._defaultNodeLabelFn = () => { }, this._defaultEdgeLabelFn = () => { }, e && (this._isDirected = "directed" in e ? e.directed : true, this._isMultigraph = "multigraph" in e ? e.multigraph : false, this._isCompound = "compound" in e ? e.compound : false), this._isCompound && (this._parent = {}, this._children = {}, this._children["\0"] = {}); } isDirected() { return this._isDirected; } isMultigraph() { return this._isMultigraph; } isCompound() { return this._isCompound; } setGraph(e) { return this._label = e, this; } graph() { return this._label; } setDefaultNodeLabel(e) { return typeof e != "function" ? this._defaultNodeLabelFn = () => e : this._defaultNodeLabelFn = e, this; } nodeCount() { return this._nodeCount; } nodes() { return Object.keys(this._nodes); } sources() { return this.nodes().filter((e) => Object.keys(this._in[e]).length === 0); } sinks() { return this.nodes().filter((e) => Object.keys(this._out[e]).length === 0); } setNodes(e, n) { return e.forEach((t) => { n !== void 0 ? this.setNode(t, n) : this.setNode(t); }), this; } setNode(e, n) { return e in this._nodes ? (arguments.length > 1 && (this._nodes[e] = n), this) : (this._nodes[e] = arguments.length > 1 ? n : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = "\0", this._children[e] = {}, this._children["\0"][e] = true), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this); } node(e) { return this._nodes[e]; } hasNode(e) { return e in this._nodes; } removeNode(e) { if (e in this._nodes) { let n = (t) => this.removeEdge(this._edgeObjs[t]); delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], this.children(e).forEach((t) => { this.setParent(t); }), delete this._children[e]), Object.keys(this._in[e]).forEach(n), delete this._in[e], delete this._preds[e], Object.keys(this._out[e]).forEach(n), delete this._out[e], delete this._sucs[e], --this._nodeCount; } return this; } setParent(e, n) { if (!this._isCompound) throw new Error("Cannot set parent in a non-compound graph"); if (n === void 0) n = "\0"; else { n += ""; for (let t = n; t !== void 0; t = this.parent(t)) if (t === e) throw new Error("Setting " + n + " as parent of " + e + " would create a cycle"); this.setNode(n); } return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = n, this._children[n][e] = true, this; } parent(e) { if (this._isCompound) { let n = this._parent[e]; if (n !== "\0") return n; } } children(e = "\0") { if (this._isCompound) { let n = this._children[e]; if (n) return Object.keys(n); } else { if (e === "\0") return this.nodes(); if (this.hasNode(e)) return []; } return []; } predecessors(e) { let n = this._preds[e]; if (n) return Object.keys(n); } successors(e) { let n = this._sucs[e]; if (n) return Object.keys(n); } neighbors(e) { let n = this.predecessors(e); if (n) { let t = new Set(n), r = this.successors(e); if (r) for (let o of r) t.add(o); return Array.from(t.values()); } } isLeaf(e) { var n; let t; return this.isDirected() ? t = this.successors(e) : t = this.neighbors(e), ((n = t == null ? void 0 : t.length) != null ? n : 0) === 0; } filterNodes(e) { let n = new this.constructor({ directed: this._isDirected, multigraph: this._isMultigraph, compound: this._isCompound }); n.setGraph(this.graph()), Object.entries(this._nodes).forEach(([o, i]) => { e(o) && n.setNode(o, i); }), Object.values(this._edgeObjs).forEach((o) => { n.hasNode(o.v) && n.hasNode(o.w) && n.setEdge(o, this.edge(o)); }); let t = {}, r = (o) => { let i = this.parent(o); return !i || n.hasNode(i) ? (t[o] = i, i) : i in t ? t[i] : r(i); }; return this._isCompound && n.nodes().forEach((o) => n.setParent(o, r(o))), n; } setDefaultEdgeLabel(e) { return typeof e != "function" ? this._defaultEdgeLabelFn = () => e : this._defaultEdgeLabelFn = e, this; } edgeCount() { return this._edgeCount; } edges() { return Object.values(this._edgeObjs); } setPath(e, n) { return e.reduce((t, r) => (n !== void 0 ? this.setEdge(t, r, n) : this.setEdge(t, r), r)), this; } setEdge(e, n, t, r) { let o, i, s, a, l3 = false; typeof e == "object" && e !== null && "v" in e ? (o = e.v, i = e.w, s = e.name, arguments.length === 2 && (a = n, l3 = true)) : (o = e, i = n, s = r, arguments.length > 2 && (a = t, l3 = true)), o = "" + o, i = "" + i, s !== void 0 && (s = "" + s); let u = z2(this._isDirected, o, i, s); if (u in this._edgeLabels) return l3 && (this._edgeLabels[u] = a), this; if (s !== void 0 && !this._isMultigraph) throw new Error("Cannot set a named edge when isMultigraph = false"); this.setNode(o), this.setNode(i), this._edgeLabels[u] = l3 ? a : this._defaultEdgeLabelFn(o, i, s); let d = Pn(this._isDirected, o, i, s); return o = d.v, i = d.w, Object.freeze(d), this._edgeObjs[u] = d, Re2(this._preds[i], o), Re2(this._sucs[o], i), this._in[i][u] = d, this._out[o][u] = d, this._edgeCount++, this; } edge(e, n, t) { let r = arguments.length === 1 ? oe2(this._isDirected, e) : z2(this._isDirected, e, n, t); return this._edgeLabels[r]; } edgeAsObj(e, n, t) { let r = arguments.length === 1 ? this.edge(e) : this.edge(e, n, t); return typeof r != "object" || r === null ? { label: r } : r; } hasEdge(e, n, t) { return (arguments.length === 1 ? oe2(this._isDirected, e) : z2(this._isDirected, e, n, t)) in this._edgeLabels; } removeEdge(e, n, t) { let r = arguments.length === 1 ? oe2(this._isDirected, e) : z2(this._isDirected, e, n, t), o = this._edgeObjs[r]; if (o) { let i = o.v, s = o.w; delete this._edgeLabels[r], delete this._edgeObjs[r], Ie2(this._preds[s], i), Ie2(this._sucs[i], s), delete this._in[s][r], delete this._out[i][r], this._edgeCount--; } return this; } inEdges(e, n) { return this.isDirected() ? this.filterEdges(this._in[e], e, n) : this.nodeEdges(e, n); } outEdges(e, n) { return this.isDirected() ? this.filterEdges(this._out[e], e, n) : this.nodeEdges(e, n); } nodeEdges(e, n) { if (e in this._nodes) return this.filterEdges({ ...this._in[e], ...this._out[e] }, e, n); } _removeFromParentsChildList(e) { delete this._children[this._parent[e]][e]; } filterEdges(e, n, t) { if (!e) return; let r = Object.values(e); return t ? r.filter((o) => o.v === n && o.w === t || o.v === t && o.w === n) : r; } }; function Re2(e, n) { e[n] ? e[n]++ : e[n] = 1; } function Ie2(e, n) { e[n] !== void 0 && !--e[n] && delete e[n]; } function z2(e, n, t, r) { let o = "" + n, i = "" + t; if (!e && o > i) { let s = o; o = i, i = s; } return o + "" + i + "" + (r === void 0 ? "\0" : r); } function Pn(e, n, t, r) { let o = "" + n, i = "" + t; if (!e && o > i) { let a = o; o = i, i = a; } let s = { v: o, w: i }; return r && (s.name = r), s; } function oe2(e, n) { return z2(e, n.v, n.w, n.name); } var Fn = {}; Se(Fn, { read: () => Yn, write: () => An }); function An(e) { let n = { options: { directed: e.isDirected(), multigraph: e.isMultigraph(), compound: e.isCompound() }, nodes: Vn(e), edges: Dn(e) }, t = e.graph(); return t !== void 0 && (n.value = structuredClone(t)), n; } function Vn(e) { return e.nodes().map((n) => { let t = e.node(n), r = e.parent(n), o = { v: n }; return t !== void 0 && (o.value = t), r !== void 0 && (o.parent = r), o; }); } function Dn(e) { return e.edges().map((n) => { let t = e.edge(n), r = { v: n.v, w: n.w }; return n.name !== void 0 && (r.name = n.name), t !== void 0 && (r.value = t), r; }); } function Yn(e) { let n = new Q2(e.options); return e.value !== void 0 && n.setGraph(e.value), e.nodes.forEach((t) => { n.setNode(t.v, t.value), t.parent && n.setParent(t.v, t.parent); }), e.edges.forEach((t) => { n.setEdge({ v: t.v, w: t.w, name: t.name }, t.value); }), n; } var H = {}; Se(H, { CycleException: () => K, bellmanFord: () => Me2, components: () => Xn, dijkstra: () => J2, dijkstraAll: () => qn, findCycles: () => $n, floydWarshall: () => Jn, isAcyclic: () => Qn, postorder: () => et2, preorder: () => nt2, prim: () => tt2, shortestPaths: () => rt2, tarjan: () => Fe2, topsort: () => Ae2 }); var Wn = () => 1; function Me2(e, n, t, r) { return Bn(e, String(n), t || Wn, r || function(o) { var i; return (i = e.outEdges(o)) != null ? i : []; }); } function Bn(e, n, t, r) { let o = {}, i, s = 0, a = e.nodes(), l3 = function(c) { let f2 = o[c.v], h2 = o[c.w]; if (!f2 || !h2) return; let p = t(c); f2.distance + p < h2.distance && (o[c.w] = { distance: f2.distance + p, predecessor: c.v }, i = true); }, u = function() { a.forEach(function(c) { r(c).forEach(function(f2) { let h2 = f2.v === c ? f2.v : f2.w, p = h2 === f2.v ? f2.w : f2.v; l3({ v: h2, w: p }); }); }); }; a.forEach(function(c) { let f2 = c === n ? 0 : Number.POSITIVE_INFINITY; o[c] = { distance: f2, predecessor: "" }; }); let d = a.length; for (let c = 1; c < d && (i = false, s++, u(), !!i); c++) ; if (s === d - 1 && (i = false, u(), i)) throw new Error("The graph contains a negative weight cycle"); return o; } function Xn(e) { let n = {}, t = [], r; function o(i) { var s, a; i in n || (n[i] = true, r.push(i), (s = e.successors(i)) == null || s.forEach(o), (a = e.predecessors(i)) == null || a.forEach(o)); } return e.nodes().forEach(function(i) { r = [], o(i), r.length && t.push(r); }), t; } var Pe = class { constructor() { this._arr = [], this._keyIndices = {}; } size() { return this._arr.length; } keys() { return this._arr.map((e) => e.key); } has(e) { return e in this._keyIndices; } priority(e) { let n = this._keyIndices[e]; if (n !== void 0) return this._arr[n].priority; } min() { if (this.size() === 0) throw new Error("Queue underflow"); return this._arr[0].key; } add(e, n) { let t = this._keyIndices, r = String(e); if (!(r in t)) { let o = this._arr, i = o.length; return t[r] = i, o.push({ key: r, priority: n }), this._decrease(i), true; } return false; } removeMin() { if (this.size() === 0) throw new Error("Queue underflow"); this._swap(0, this._arr.length - 1); let e = this._arr.pop(); return delete this._keyIndices[e.key], this._heapify(0), e.key; } decrease(e, n) { let t = this._keyIndices[e]; if (t === void 0) throw new Error(`Key not found: ${e}`); let r = this._arr[t].priority; if (n > r) throw new Error(`New priority is greater than current priority. Key: ${e} Old: ${r} New: ${n}`); this._arr[t].priority = n, this._decrease(t); } _heapify(e) { let n = this._arr, t = 2 * e, r = t + 1, o = e; t < n.length && (o = n[t].priority < n[o].priority ? t : o, r < n.length && (o = n[r].priority < n[o].priority ? r : o), o !== e && (this._swap(e, o), this._heapify(o))); } _decrease(e) { let n = this._arr, t = n[e].priority, r; for (; e !== 0 && (r = e >> 1, !(n[r].priority < t)); ) this._swap(e, r), e = r; } _swap(e, n) { let t = this._arr, r = this._keyIndices, o = t[e], i = t[n]; t[e] = i, t[n] = o, r[i.key] = e, r[o.key] = n; } }; var zn = () => 1; function J2(e, n, t, r) { let o = function(i) { var s; return (s = e.outEdges(i)) != null ? s : []; }; return Hn(e, String(n), t || zn, r || o); } function Hn(e, n, t, r) { let o = {}, i = new Pe(), s, a, l3 = function(u) { let d = u.v !== s ? u.v : u.w, c = o[d]; if (!c) return; let f2 = t(u), h2 = a.distance + f2; if (f2 < 0) throw new Error("dijkstra does not allow negative edge weights. Bad edge: " + u + " Weight: " + f2); h2 < c.distance && (c.distance = h2, c.predecessor = s, i.decrease(d, h2)); }; for (e.nodes().forEach(function(u) { let d = u === n ? 0 : Number.POSITIVE_INFINITY; o[u] = { distance: d, predecessor: "" }, i.add(u, d); }); i.size() > 0; ) { s = i.removeMin(); let u = o[s]; if (!u || u.distance === Number.POSITIVE_INFINITY) break; a = u, r(s).forEach(l3); } return o; } function qn(e, n, t) { return e.nodes().reduce(function(r, o) { return r[o] = J2(e, o, n, t), r; }, {}); } function Fe2(e) { let n = 0, t = [], r = {}, o = []; function i(s) { var a; let l3 = r[s] = { onStack: true, lowlink: n, index: n++ }; if (t.push(s), (a = e.successors(s)) == null || a.forEach(function(u) { if (u in r) { let d = r[u]; d != null && d.onStack && (l3.lowlink = Math.min(l3.lowlink, d.index)); } else { i(u); let d = r[u]; d && (l3.lowlink = Math.min(l3.lowlink, d.lowlink)); } }), l3.lowlink === l3.index) { let u = [], d; do { d = t.pop(); let c = r[d]; c && (c.onStack = false), u.push(d); } while (s !== d); o.push(u); } } return e.nodes().forEach(function(s) { s in r || i(s); }), o; } function $n(e) { return Fe2(e).filter(function(n) { var t; let r = n[0]; return r ? n.length > 1 || n.length === 1 && ((t = e.outEdges(r, r)) != null ? t : []).length > 0 : false; }); } var Un = () => 1; function Jn(e, n, t) { return Kn(e, n || Un, t || function(r) { var o; return (o = e.outEdges(r)) != null ? o : []; }); } function Kn(e, n, t) { let r = {}, o = e.nodes(); return o.forEach(function(i) { let s = {}; r[i] = s, s[i] = { distance: 0, predecessor: "" }, o.forEach(function(a) { i !== a && (s[a] = { distance: Number.POSITIVE_INFINITY, predecessor: "" }); }), t(i).forEach(function(a) { let l3 = a.v === i ? a.w : a.v, u = n(a); s[l3] = { distance: u, predecessor: i }; }); }), o.forEach(function(i) { let s = r[i]; s && o.forEach(function(a) { let l3 = r[a]; l3 && o.forEach(function(u) { let d = l3[i], c = s[u], f2 = l3[u]; if (d && c && f2) { let h2 = d.distance + c.distance; h2 < f2.distance && (f2.distance = h2, f2.predecessor = c.predecessor); } }); }); }), r; } var K = class extends Error { constructor(e) { super(e), this.name = "CycleException"; } }; function Ae2(e) { let n = {}, t = {}, r = []; function o(i) { var s; if (i in t) throw new K(); i in n || (t[i] = true, n[i] = true, (s = e.predecessors(i)) == null || s.forEach(o), delete t[i], r.push(i)); } if (e.sinks().forEach(o), Object.keys(n).length !== e.nodeCount()) throw new K(); return r; } function Qn(e) { try { Ae2(e); } catch (n) { if (n instanceof K) return false; throw n; } return true; } function Zn(e, n, t, r, o) { Array.isArray(n) || (n = [n]); let i = ((a) => { var l3; return (l3 = e.isDirected() ? e.successors(a) : e.neighbors(a)) != null ? l3 : []; }), s = {}; return n.forEach(function(a) { if (!e.hasNode(a)) throw new Error("Graph does not have node: " + a); o = Ve2(e, a, t === "post", s, i, r, o); }), o; } function Ve2(e, n, t, r, o, i, s) { return n in r || (r[n] = true, t || (s = i(s, n)), o(n).forEach(function(a) { s = Ve2(e, a, t, r, o, i, s); }), t && (s = i(s, n))), s; } function De2(e, n, t) { return Zn(e, n, t, function(r, o) { return r.push(o), r; }, []); } function et2(e, n) { return De2(e, n, "post"); } function nt2(e, n) { return De2(e, n, "pre"); } function tt2(e, n) { var t; let r = new Q2(), o = {}, i = new Pe(), s; function a(d) { let c = d.v === s ? d.w : d.v, f2 = i.priority(c); if (f2 !== void 0) { let h2 = n(d); h2 < f2 && (o[c] = s, i.decrease(c, h2)); } } if (e.nodeCount() === 0) return r; e.nodes().forEach(function(d) { i.add(d, Number.POSITIVE_INFINITY), r.setNode(d); }); let l3 = e.nodes()[0]; l3 !== void 0 && i.decrease(l3, 0); let u = false; for (; i.size() > 0; ) { if (s = i.removeMin(), s in o) r.setEdge(s, o[s]); else { if (u) throw new Error("Input graph is not connected: " + e); u = true; } (t = e.nodeEdges(s)) == null || t.forEach(a); } return r; } function rt2(e, n, t, r) { return ot2(e, n, t, r != null ? r : ((o) => { var i; return (i = e.outEdges(o)) != null ? i : []; })); } function ot2(e, n, t, r) { if (t === void 0) return J2(e, n, t, r); let o = false, i = e.nodes(); for (let s = 0; s < i.length; s++) { let a = i[s]; if (a === void 0) continue; let l3 = r(a); for (let u = 0; u < l3.length; u++) { let d = l3[u]; if (!d) continue; let c = d.v === a ? d.v : d.w, f2 = c === d.v ? d.w : d.v; t({ v: c, w: f2 }) < 0 && (o = true); } if (o) return Me2(e, n, t, r); } return J2(e, n, t, r); } var T2 = Q2; function M(e, n, t, r) { let o = r; for (; e.hasNode(o); ) o = $2(r); return t.dummy = n, e.setNode(o, t), o; } function Ye2(e) { let n = new T2().setGraph(e.graph()); return e.nodes().forEach((t) => n.setNode(t, e.node(t))), e.edges().forEach((t) => { let r = n.edge(t.v, t.w) || { weight: 0, minlen: 1 }, o = e.edge(t); n.setEdge(t.v, t.w, { weight: r.weight + o.weight, minlen: Math.max(r.minlen, o.minlen) }); }), n; } function Z(e) { let n = new T2({ multigraph: e.isMultigraph() }).setGraph(e.graph()); return e.nodes().forEach((t) => { e.children(t).length || n.setNode(t, e.node(t)); }), e.edges().forEach((t) => { n.setEdge(t, e.edge(t)); }), n; } function se2(e, n) { let t = e.x, r = e.y, o = n.x - t, i = n.y - r, s = e.width / 2, a = e.height / 2; if (!o && !i) throw new Error("Not possible to find intersection inside of the rectangle"); let l3, u; return Math.abs(i) * s > Math.abs(o) * a ? (i < 0 && (a = -a), l3 = a * o / i, u = a) : (o < 0 && (s = -s), l3 = s, u = s * i / o), { x: t + l3, y: r + u }; } function P2(e) { let n = A2(de2(e) + 1).map(() => []); return e.nodes().forEach((t) => { let r = e.node(t), o = r.rank; o !== void 0 && (n[o] || (n[o] = []), n[o][r.order] = t); }), n; } function We2(e) { let n = e.nodes().map((r) => { let o = e.node(r).rank; return o === void 0 ? Number.MAX_VALUE : o; }), t = R2(Math.min, n); e.nodes().forEach((r) => { let o = e.node(r); Object.hasOwn(o, "rank") && (o.rank -= t); }); } function Be2(e) { let n = e.nodes().map((s) => e.node(s).rank).filter((s) => s !== void 0), t = R2(Math.min, n), r = []; e.nodes().forEach((s) => { let a = e.node(s).rank - t; r[a] || (r[a] = []), r[a].push(s); }); let o = 0, i = e.graph().nodeRankFactor; Array.from(r).forEach((s, a) => { s === void 0 && a % i !== 0 ? --o : s !== void 0 && o && s.forEach((l3) => e.node(l3).rank += o); }); } function ae(e, n, t, r) { let o = { width: 0, height: 0 }; return arguments.length >= 4 && (o.rank = t, o.order = r), M(e, "border", o, n); } function it2(e, n = Xe2) { let t = []; for (let r = 0; r < e.length; r += n) { let o = e.slice(r, r + n); t.push(o); } return t; } var Xe2 = 65535; function R2(e, n) { if (n.length > Xe2) { let t = it2(n); return e(...t.map((r) => e(...r))); } else return e(...n); } function de2(e) { let t = e.nodes().map((r) => { let o = e.node(r).rank; return o === void 0 ? Number.MIN_VALUE : o; }); return R2(Math.max, t); } function ze2(e, n) { let t = { lhs: [], rhs: [] }; return e.forEach((r) => { n(r) ? t.lhs.push(r) : t.rhs.push(r); }), t; } function le2(e, n) { let t = Date.now(); try { return n(); } finally { console.log(e + " time: " + (Date.now() - t) + "ms"); } } function q2(e, n) { return n(); } var st2 = 0; function $2(e) { let n = ++st2; return e + ("" + n); } function A2(e, n, t = 1) { n == null && (n = e, e = 0); let r = (i) => i < n; t < 0 && (r = (i) => n < i); let o = []; for (let i = e; r(i); i += t) o.push(i); return o; } function B2(e, n) { let t = {}; for (let r of n) e[r] !== void 0 && (t[r] = e[r]); return t; } function X2(e, n) { let t; return typeof n == "string" ? t = (r) => r[n] : t = n, Object.entries(e).reduce((r, [o, i]) => (r[o] = t(i, o), r), {}); } function He2(e, n) { return e.reduce((t, r, o) => (t[r] = n[o], t), {}); } var D2 = "\0"; function ee2(e, n, t) { var u, d, c, f2, h2, p; if (!(e && n && t && n.dummy === "edge" && t.dummy === "edge" && n.edgeObj && t.edgeObj && e[n.edgeObj.v] && e[t.edgeObj.v] && e[n.edgeObj.w] && e[t.edgeObj.w])) return 0; let r = true; n.edgeObj.w === t.edgeObj.w && (r = false); let o = r ? (d = (u = e[n.edgeObj.v]) == null ? void 0 : u.rank) != null ? d : NaN + 1 : (f2 = (c = e[n.edgeObj.w]) == null ? void 0 : c.rank) != null ? f2 : NaN - 1, i = Object.entries(e).find((E2) => { var y2, L2; return ((y2 = E2[1].edgeObj) == null ? void 0 : y2.v) === n.edgeObj.v && ((L2 = E2[1].edgeObj) == null ? void 0 : L2.w) === n.edgeObj.w && E2[1].rank === o; }), s = Object.entries(e).find((E2) => { var y2, L2; return ((y2 = E2[1].edgeObj) == null ? void 0 : y2.v) === t.edgeObj.v && ((L2 = E2[1].edgeObj) == null ? void 0 : L2.w) === t.edgeObj.w && E2[1].rank === o; }); if (!i || !s) return 0; let a = (h2 = i[1].order) != null ? h2 : NaN, l3 = (p = s[1].order) != null ? p : NaN; return isNaN(a - l3) ? 0 : a - l3; } var ue2 = "3.1.1"; var ce2 = class { constructor() { je2(this, "_sentinel"); let n = {}; n._next = n._prev = n, this._sentinel = n; } dequeue() { let n = this._sentinel, t = n._prev; if (t !== n) return qe2(t), t; } enqueue(n) { let t = this._sentinel; n._prev && n._next && qe2(n), n._next = t._next, t._next._prev = n, t._next = n, n._prev = t; } toString() { let n = [], t = this._sentinel, r = t._prev; for (; r !== t; ) n.push(JSON.stringify(r, at2)), r = r._prev; return "[" + n.join(", ") + "]"; } }; function qe2(e) { e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev; } function at2(e, n) { if (e !== "_next" && e !== "_prev") return n; } var $e2 = ce2; var dt2 = () => 1; function be2(e, n) { if (e.nodeCount() <= 1) return []; let t = ut2(e, n || dt2); return lt2(t.graph, t.buckets, t.zeroIdx).flatMap((o) => e.outEdges(o.v, o.w) || []); } function lt2(e, n, t) { var a; let r = [], o = n[n.length - 1], i = n[0], s; for (; e.nodeCount(); ) { for (; s = i.dequeue(); ) fe2(e, n, t, s); for (; s = o.dequeue(); ) fe2(e, n, t, s); if (e.nodeCount()) { for (let l3 = n.length - 2; l3 > 0; --l3) if (s = (a = n[l3]) == null ? void 0 : a.dequeue(), s) { r = r.concat(fe2(e, n, t, s, true) || []); break; } } } return r; } function fe2(e, n, t, r, o) { let i = [], s = o ? i : void 0; return (e.inEdges(r.v) || []).forEach((a) => { let l3 = e.edge(a), u = e.node(a.v); o && i.push({ v: a.v, w: a.w }), u.out -= l3, he2(n, t, u); }), (e.outEdges(r.v) || []).forEach((a) => { let l3 = e.edge(a), u = a.w, d = e.node(u); d.in -= l3, he2(n, t, d); }), e.removeNode(r.v), s; } function ut2(e, n) { let t = new T2(), r = 0, o = 0; e.nodes().forEach((a) => { t.setNode(a, { v: a, in: 0, out: 0 }); }), e.edges().forEach((a) => { let l3 = t.edge(a.v, a.w) || 0, u = n(a), d = l3 + u; t.setEdge(a.v, a.w, d); let c = t.node(a.v), f2 = t.node(a.w); o = Math.max(o, c.out += u), r = Math.max(r, f2.in += u); }); let i = ct2(o + r + 3).map(() => new $e2()), s = r + 1; return t.nodes().forEach((a) => { he2(i, s, t.node(a)); }), { graph: t, buckets: i, zeroIdx: s }; } function he2(e, n, t) { var r, o, i; t.out ? t.in ? (i = e[t.out - t.in + n]) == null || i.enqueue(t) : (o = e[e.length - 1]) == null || o.enqueue(t) : (r = e[0]) == null || r.enqueue(t); } function ct2(e) { let n = []; for (let t = 0; t < e; t++) n.push(t); return n; } function Ue2(e, n) { (e.graph().acyclicer === "greedy" ? be2(e, r(e)) : ft2(e, n != null ? n : null)).forEach((o) => { let i = e.edge(o); e.removeEdge(o), i.forwardName = o.name, i.reversed = true, e.setEdge(o.w, o.v, i, $2("rev")); }); function r(o) { return (i) => o.edge(i).weight; } } function ft2(e, n) { let t = [], r = {}, o = {}; function i(l3) { Object.hasOwn(o, l3) || (o[l3] = true, r[l3] = true, e.outEdges(l3).forEach((u) => { Object.hasOwn(r, u.w) ? t.push(u) : i(u.w); }), delete r[l3]); } function s(l3) { var u; Object.hasOwn(o, l3) || (o[l3] = true, r[l3] = true, (u = e.outEdges(l3)) == null || u.forEach((d) => { var c, f2; Object.hasOwn(r, d.w) || ((c = n.node(l3)) == null ? void 0 : c.rank) > ((f2 = n.node(d.w)) == null ? void 0 : f2.rank) && ht2(e, d.w, d) ? t.push(d) : s(d.w); }), delete r[l3]); } let a = i; return n && typeof n.node == "function" && (a = s), e.sources().forEach(a), e.nodes().forEach(a), t; } function Je2(e) { e.edges().forEach((n) => { let t = e.edge(n); if (t.reversed) { e.removeEdge(n); let r = t.forwardName; delete t.reversed, delete t.forwardName, e.setEdge(n.w, n.v, t, r); } }); } function ht2(e, n, t) { let r = /* @__PURE__ */ new Set(); function o(i) { var s; if (e.sources().includes(i)) return true; r.add(i); for (let a of (s = e.inEdges(i)) != null ? s : []) if (!(a.v === t.v && a.w === t.w) && !r.has(a.v) && o(a.v)) return true; return false; } return o(n); } function Ke2(e) { e.graph().dummyChains = [], e.edges().forEach((n) => gt2(e, n)); } function gt2(e, n) { let t = n.v, r = e.node(t).rank, o = n.w, i = e.node(o).rank, s = n.name, a = e.edge(n), l3 = a.labelRank; if (i === r + 1) return; e.removeEdge(n); let u, d, c; for (c = 0, ++r; r < i; ++c, ++r) a.points = [], d = { width: 0, height: 0, edgeLabel: a, edgeObj: n, rank: r }, u = M(e, "edge", d, "_d"), r === l3 && (d.width = a.width, d.height = a.height, d.dummy = "edge-label", d.labelpos = a.labelpos), e.setEdge(t, u, { weight: a.weight }, s), c === 0 && e.graph().dummyChains.push(u), t = u; e.setEdge(t, o, { weight: a.weight }, s); } function Qe2(e) { e.graph().dummyChains.forEach((n) => { let t = e.node(n), r = t.edgeLabel, o; for (e.setEdge(t.edgeObj, r); t.dummy; ) o = e.successors(n)[0], e.removeNode(n), r.points.push({ x: t.x, y: t.y }), t.dummy === "edge-label" && (r.x = t.x, r.y = t.y, r.width = t.width, r.height = t.height), n = o, t = e.node(n); }); } function U2(e) { let n = {}; function t(r) { let o = e.node(r); if (Object.hasOwn(n, r)) return o.rank; n[r] = true; let i = e.outEdges(r), s = i ? i.map((l3) => l3 == null ? Number.POSITIVE_INFINITY : t(l3.w) - e.edge(l3).minlen) : [], a = R2(Math.min, s); return a === Number.POSITIVE_INFINITY && (a = 0), o.rank = a; } e.sources().forEach(t); } function V2(e, n) { return e.node(n.w).rank - e.node(n.v).rank - e.edge(n).minlen; } var ne2 = mt2; function mt2(e) { let n = new T2({ directed: false }), t = e.nodes(); if (t.length === 0) throw new Error("Graph must have at least one node"); let r = t[0], o = e.nodeCount(); n.setNode(r, {}); let i, s; for (; Et(n, e) < o && (i = Lt(n, e), !!i); ) s = n.hasNode(i.v) ? V2(e, i) : -V2(e, i), yt2(n, e, s); return n; } function Et(e, n) { function t(r) { let o = n.nodeEdges(r); o && o.forEach((i) => { let s = i.v, a = r === s ? i.w : s; !e.hasNode(a) && !V2(n, i) && (e.setNode(a, {}), e.setEdge(r, a, {}), t(a)); }); } return e.nodes().forEach(t), e.nodeCount(); } function Lt(e, n) { return n.edges().reduce((r, o) => { let i = Number.POSITIVE_INFINITY; return e.hasNode(o.v) !== e.hasNode(o.w) && (i = V2(n, o)), i < r[0] ? [i, o] : r; }, [Number.POSITIVE_INFINITY, null])[1]; } function yt2(e, n, t) { e.nodes().forEach((r) => n.node(r).rank += t); } var { preorder: wt2, postorder: Nt } = H; var en = Y2; Y2.initLowLimValues = pe2; Y2.initCutValues = ge2; Y2.calcCutValue = nn; Y2.leaveEdge = rn; Y2.enterEdge = on; Y2.exchangeEdges = sn; function Y2(e) { e = Ye2(e), U2(e); let n = ne2(e); pe2(n), ge2(n, e); let t, r; for (; t = rn(n); ) r = on(n, e, t), sn(n, e, t, r); } function ge2(e, n) { let t = Nt(e, e.nodes()); t = t.slice(0, t.length - 1), t.forEach((r) => Gt(e, n, r)); } function Gt(e, n, t) { let o = e.node(t).parent, i = e.edge(t, o); i.cutvalue = nn(e, n, t); } function nn(e, n, t) { let o = e.node(t).parent, i = true, s = n.edge(t, o), a = 0; s || (i = false, s = n.edge(o, t)), a = s.weight; let l3 = n.nodeEdges(t); return l3 && l3.forEach((u) => { let d = u.v === t, c = d ? u.w : u.v; if (c !== o) { let f2 = d === i, h2 = n.edge(u).weight; if (a += f2 ? h2 : -h2, kt2(e, t, c)) { let E2 = e.edge(t, c).cutvalue; a += f2 ? -E2 : E2; } } }), a; } function pe2(e, n) { arguments.length < 2 && (n = e.nodes()[0]), tn(e, {}, 1, n); } function tn(e, n, t, r, o) { let i = t, s = e.node(r); n[r] = true; let a = e.neighbors(r); return a && a.forEach((l3) => { Object.hasOwn(n, l3) || (t = tn(e, n, t, l3, r)); }), s.low = i, s.lim = t++, o ? s.parent = o : delete s.parent, t; } function rn(e) { return e.edges().find((n) => e.edge(n).cutvalue < 0); } function on(e, n, t) { let r = t.v, o = t.w; n.hasEdge(r, o) || (r = t.w, o = t.v); let i = e.node(r), s = e.node(o), a = i, l3 = false; return i.lim > s.lim && (a = s, l3 = true), n.edges().filter((d) => l3 === Ze2(e, e.node(d.v), a) && l3 !== Ze2(e, e.node(d.w), a)).reduce((d, c) => V2(n, c) < V2(n, d) ? c : d); } function sn(e, n, t, r) { let o = t.v, i = t.w; e.removeEdge(o, i), e.setEdge(r.v, r.w, {}), pe2(e), ge2(e, n), vt(e, n); } function vt(e, n) { let t = e.nodes().find((o) => !e.node(o).parent); if (!t) return; let r = wt2(e, [t]); r = r.slice(1), r.forEach((o) => { let s = e.node(o).parent, a = n.edge(o, s), l3 = false; a || (a = n.edge(s, o), l3 = true), n.node(o).rank = n.node(s).rank + (l3 ? a.minlen : -a.minlen); }); } function kt2(e, n, t) { return e.hasEdge(n, t); } function Ze2(e, n, t) { return t.low <= n.lim && n.lim <= t.lim; } var dn = xt2; function xt2(e) { let n = e.graph().ranker; if (typeof n == "function") return n(e); switch (n) { case "network-simplex": an(e); break; case "tight-tree": Ot2(e); break; case "longest-path": _t(e); break; case "none": break; default: an(e); } } var _t = U2; function Ot2(e) { U2(e), ne2(e); } function an(e) { en(e); } var ln = Ct; function Ct(e) { let n = jt(e), t = e.graph(); if (!Array.isArray(t.dummyChains)) return; t.dummyChains.forEach((o) => { let i = e.node(o), s = i.edgeObj, a = Tt2(e, n, s.v, s.w), l3 = a.path, u = a.lca, d = 0, c = l3[d], f2 = true; for (; o !== s.w; ) { if (i = e.node(o), f2) { for (; (c = l3[d]) !== u && e.node(c).maxRank < i.rank; ) d++; c === u && (f2 = false); } if (!f2) { for (; d < l3.length - 1 && e.node(l3[d + 1]).minRank <= i.rank; ) d++; c = l3[d]; } c !== void 0 && e.setParent(o, c), o = e.successors(o)[0]; } }); } function Tt2(e, n, t, r) { let o = [], i = [], s = Math.min(n[t].low, n[r].low), a = Math.max(n[t].lim, n[r].lim), l3; l3 = t; do l3 = e.parent(l3), o.push(l3); while (l3 && (n[l3].low > s || a > n[l3].lim)); let u = l3, d = r; for (; (d = e.parent(d)) !== u; ) i.push(d); return { path: o.concat(i.reverse()), lca: u }; } function jt(e) { let n = {}, t = 0; function r(o) { let i = t; e.children(o).forEach(r), n[o] = { low: i, lim: t++ }; } return e.children(D2).forEach(r), n; } function un(e) { let n = M(e, "root", {}, "_root"), t = Rt2(e), r = Object.values(t), o = R2(Math.max, r) - 1, i = 2 * o + 1; e.graph().nestingRoot = n, e.edges().forEach((a) => e.edge(a).minlen *= i); let s = It(e) + 1; e.children(D2).forEach((a) => { cn(e, n, i, s, o, t, a); }), e.graph().nodeRankFactor = i; } function cn(e, n, t, r, o, i, s) { var c; let a = e.children(s); if (!a.length) { s !== n && e.setEdge(n, s, { weight: 0, minlen: t }); return; } let l3 = ae(e, "_bt"), u = ae(e, "_bb"), d = e.node(s); e.setParent(l3, s), d.borderTop = l3, e.setParent(u, s), d.borderBottom = u, a.forEach((f2) => { var b; cn(e, n, t, r, o, i, f2); let h2 = e.node(f2), p = h2.borderTop ? h2.borderTop : f2, E2 = h2.borderBottom ? h2.borderBottom : f2, y2 = h2.borderTop ? r : 2 * r, L2 = p !== E2 ? 1 : o - ((b = i[s]) != null ? b : 0) + 1; e.setEdge(l3, p, { weight: y2, minlen: L2, nestingEdge: true }), e.setEdge(E2, u, { weight: y2, minlen: L2, nestingEdge: true }); }), e.parent(s) || e.setEdge(n, l3, { weight: 0, minlen: o + ((c = i[s]) != null ? c : 0) }); } function Rt2(e) { let n = {}; function t(r, o) { let i = e.children(r); i && i.length && i.forEach((s) => t(s, o + 1)), n[r] = o; } return e.children(D2).forEach((r) => t(r, 1)), n; } function It(e) { return e.edges().reduce((n, t) => n + e.edge(t).weight, 0); } function fn2(e) { let n = e.graph(); e.removeNode(n.nestingRoot), delete n.nestingRoot, e.edges().forEach((t) => { e.edge(t).nestingEdge && e.removeEdge(t); }); } var bn = Mt; function Mt(e) { function n(t) { let r = e.children(t), o = e.node(t); if (r.length && r.forEach(n), o && Object.hasOwn(o, "minRank")) { o.borderLeft = [], o.borderRight = []; for (let i = o.minRank, s = o.maxRank + 1; i < s; ++i) hn(e, "borderLeft", "_bl", t, o, i), hn(e, "borderRight", "_br", t, o, i); } } e.children(D2).forEach(n); } function hn(e, n, t, r, o, i) { let s = { width: 0, height: 0, rank: i, borderType: n }, a = o[n][i - 1], l3 = M(e, "border", s, t); o[n][i] = l3, e.setParent(l3, r), a && e.setEdge(a, l3, { weight: 1 }); } function pn(e) { var t; let n = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase(); (n === "lr" || n === "rl") && En(e); } function mn2(e) { var t; let n = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase(); (n === "bt" || n === "rl") && Pt2(e), (n === "lr" || n === "rl") && (Ft(e), En(e)); } function En(e) { e.nodes().forEach((n) => gn2(e.node(n))), e.edges().forEach((n) => gn2(e.edge(n))); } function gn2(e) { let n = e.width; e.width = e.height, e.height = n; } function Pt2(e) { e.nodes().forEach((n) => me2(e.node(n))), e.edges().forEach((n) => { var r; let t = e.edge(n); (r = t.points) == null || r.forEach(me2), Object.hasOwn(t, "y") && me2(t); }); } function me2(e) { e.y = -e.y; } function Ft(e) { e.nodes().forEach((n) => Ee2(e.node(n))), e.edges().forEach((n) => { var r; let t = e.edge(n); (r = t.points) == null || r.forEach(Ee2), Object.hasOwn(t, "x") && Ee2(t); }); } function Ee2(e) { let n = e.x; e.x = e.y, e.y = n; } function Le2(e, n = null) { let t = {}, r = e.nodes().filter((d) => !e.children(d).length), o = r.map((d) => e.node(d).rank), i = R2(Math.max, o), s = A2(i + 1).map(() => []); function a(d) { if (t[d]) return; t[d] = true; let c = e.node(d); s[c.rank].push(d); let f2 = e.successors(d); f2 && [...f2].sort((p, E2) => u(p, E2)).forEach(a); } r.sort((d, c) => e.node(d).rank - e.node(c).rank).forEach(a); function u(d, c) { let f2 = e.node(d), h2 = e.node(c); return ee2(n, f2, h2); } return s; } function ye(e, n) { let t = 0; for (let r = 1; r < n.length; ++r) t += Vt(e, n[r - 1], n[r]); return t; } function Vt(e, n, t) { let r = He2(t, t.map((u, d) => d)), o = n.flatMap((u) => { let d = e.outEdges(u); return d ? d.map((c) => ({ pos: r[c.w], weight: e.edge(c).weight })).sort((c, f2) => c.pos - f2.pos) : []; }), i = 1; for (; i < t.length; ) i <<= 1; let s = 2 * i - 1; i -= 1; let a = new Array(s).fill(0), l3 = 0; return o.forEach((u) => { let d = u.pos + i; a[d] += u.weight; let c = 0; for (; d > 0; ) d % 2 && (c += a[d + 1]), d = d - 1 >> 1, a[d] += u.weight; l3 += u.weight * c; }), l3; } function we2(e, n = []) { return n.map((t) => { let r = e.inEdges(t); if (!r || !r.length) return { v: t }; { let o = r.reduce((i, s) => { let a = e.edge(s), l3 = e.node(s.v); return { sum: i.sum + a.weight * l3.order, weight: i.weight + a.weight }; }, { sum: 0, weight: 0 }); return { v: t, barycenter: o.sum / o.weight, weight: o.weight }; } }); } function Ne2(e, n) { let t = {}; e.forEach((o, i) => { let s = { indegree: 0, in: [], out: [], vs: [o.v], i }; o.barycenter !== void 0 && (s.barycenter = o.barycenter, s.weight = o.weight), t[o.v] = s; }), n.edges().forEach((o) => { let i = t[o.v], s = t[o.w]; i !== void 0 && s !== void 0 && (s.indegree++, i.out.push(s)); }); let r = Object.values(t).filter((o) => !o.indegree); return Dt(r); } function Dt(e) { let n = []; function t(o) { return (i) => { i.merged || (i.barycenter === void 0 || o.barycenter === void 0 || i.barycenter >= o.barycenter) && Yt(o, i); }; } function r(o) { return (i) => { i.in.push(o), --i.indegree === 0 && e.push(i); }; } for (; e.length; ) { let o = e.pop(); n.push(o), o.in.reverse().forEach(t(o)), o.out.forEach(r(o)); } return n.filter((o) => !o.merged).map((o) => B2(o, ["vs", "i", "barycenter", "weight"])); } function Yt(e, n) { let t = 0, r = 0; e.weight && (t += e.barycenter * e.weight, r += e.weight), n.weight && (t += n.barycenter * n.weight, r += n.weight), e.vs = n.vs.concat(e.vs), e.barycenter = t / r, e.weight = r, e.i = Math.min(n.i, e.i), n.merged = true; } function Ge2(e, n, t, r, o) { let i = {}, s = null, a = null, l3 = o; typeof n == "boolean" ? (l3 = n, i = {}) : n && (i = n, s = t != null ? t : null, a = r != null ? r : null); let u = ze2(e, (L2) => Object.hasOwn(L2, "barycenter")), d = u.lhs, c = u.rhs.sort((L2, b) => b.i - L2.i), f2 = [], h2 = 0, p = 0, E2 = 0; d.sort(Wt(a, s, !!l3)); for (let [L2, b] of Object.entries(i)) { let g = d.findIndex((m) => m.vs[0] === L2); d.splice(g + 1, 0, b); } E2 = Ln(f2, c, E2), d.forEach((L2) => { E2 += L2.vs.length, f2.push(L2.vs), h2 += L2.barycenter * L2.weight, p += L2.weight, E2 = Ln(f2, c, E2); }); let y2 = { vs: f2.flat(1) }; return p && (y2.barycenter = h2 / p, y2.weight = p), y2; } function Ln(e, n, t) { let r; for (; n.length && (r = n[n.length - 1]).i <= t; ) n.pop(), e.push(r.vs), t++; return t; } function Wt(e, n, t) { return (r, o) => { if (r.barycenter < o.barycenter) return -1; if (r.barycenter > o.barycenter) return 1; if (e && (typeof r.vs[0] == "string" || typeof o.vs[0] == "string")) { let i = e.node(r.vs[0]), s = e.node(o.vs[0]), a = ee2(n, i, s); if (a !== 0) return a; } return t ? o.i - r.i : r.i - o.i; }; } function te2(e, n, t, r, o) { var L2, b, g, m, w, k2, _2, C2, j2, I2, S2; let i = null, s = o; typeof r == "boolean" ? (s = r, i = null) : r !== void 0 && (i = r); let a = e.children(n), l3 = e.node(n), u = l3 ? l3.borderLeft : void 0, d = l3 ? l3.borderRight : void 0, c = {}; u && (a = a.filter((G2) => G2 !== u && G2 !== d)); let f2 = we2(e, a); f2.forEach((G2) => { if (e.children(G2.v).length) { let { result: x2 } = te2(e, G2.v, t, i, s); c[G2.v] = x2, Object.hasOwn(x2, "barycenter") && Xt(G2, x2); } }); let h2 = Ne2(f2, t); Bt(h2, c); let p = {}, E2 = false; for (let G2 = 0; G2 < h2.length; G2++) for (let x2 = G2 + 1; x2 < h2.length; x2++) if (!(!h2[G2] || !h2[x2] || !((L2 = h2[G2]) != null && L2.barycenter) || !((b = h2[x2]) != null && b.barycenter)) && ((g = h2[G2]) == null ? void 0 : g.barycenter) === h2[x2].barycenter) { let v = (w = (m = h2[G2]) == null ? void 0 : m.vs[0]) != null ? w : "", N2 = (_2 = (k2 = h2[x2]) == null ? void 0 : k2.vs[0]) != null ? _2 : "", O2 = e.node(v), W2 = e.node(N2); if (O2.dummy === "edge" && W2.dummy === "edge" && ((C2 = O2.edgeObj) == null ? void 0 : C2.v) === ((j2 = W2.edgeObj) == null ? void 0 : j2.v) && ((I2 = O2.edgeObj) == null ? void 0 : I2.w) === ((S2 = W2.edgeObj) == null ? void 0 : S2.w)) if (O2.edgeLabel.reversed) { p[N2] = h2[G2], h2.splice(G2, 1), G2--; break; } else p[v] = h2[x2], h2.splice(x2, 1), x2--; else E2 = true; } let y2 = Ge2(h2, p, i, e, s); if (u && d) { y2.vs = [u, y2.vs, d].flat(1); let G2 = e.predecessors(u); if (G2 && G2.length) { let x2 = e.node(G2[0]), v = e.predecessors(d), N2 = e.node(v[0]); Object.hasOwn(y2, "barycenter") || (y2.barycenter = 0, y2.weight = 0), y2.barycenter = (y2.barycenter * y2.weight + x2.order + N2.order) / (y2.weight + 2), y2.weight += 2; } } return Object.defineProperty(y2, "result", { value: y2, enumerable: false, configurable: true, writable: true }), Object.defineProperty(y2, "usedBias", { value: E2, enumerable: false, configurable: true, writable: true }), y2; } function Bt(e, n) { e.forEach((t) => { t.vs = t.vs.flatMap((r) => n[r] ? n[r].vs : r); }); } function Xt(e, n) { e.barycenter !== void 0 ? (e.barycenter = (e.barycenter * e.weight + n.barycenter * n.weight) / (e.weight + n.weight), e.weight += n.weight) : (e.barycenter = n.barycenter, e.weight = n.weight); } function ve2(e, n, t, r) { r || (r = e.nodes()); let o = zt(e), i = new T2({ compound: true }).setGraph({ root: o }).setDefaultNodeLabel((s) => e.node(s)); return r.forEach((s) => { let a = e.node(s), l3 = e.parent(s); if (a.rank === n || a.minRank <= n && n <= a.maxRank) { i.setNode(s), i.setParent(s, l3 || o); let u = e[t](s); u && u.forEach((d) => { let c = d.v === s ? d.w : d.v, f2 = i.edge(c, s), h2 = f2 !== void 0 ? f2.weight : 0; i.setEdge(c, s, { weight: e.edge(d).weight + h2 }); }), Object.hasOwn(a, "minRank") && i.setNode(s, { borderLeft: a.borderLeft[n], borderRight: a.borderRight[n] }); } }), i; } function zt(e) { let n; for (; e.hasNode(n = $2("_root")); ) ; return n; } function ke2(e, n, t) { let r = {}, o; t.forEach((i) => { let s = e.parent(i), a, l3; for (; s; ) { if (a = e.parent(s), a ? (l3 = r[a], r[a] = s) : (l3 = o, o = s), l3 && l3 !== s) { n.setEdge(l3, s); return; } s = a; } }); } function re2(e, n = {}, t = null) { if (typeof n.customOrder == "function") { n.customOrder(e, re2); return; } let r = de2(e), o = yn(e, A2(1, r + 1), "inEdges"), i = yn(e, A2(r - 1, -1, -1), "outEdges"), s = Le2(e, t); if (wn(e, s), n.disableOptimalOrderHeuristic) return; let a = Number.POSITIVE_INFINITY, l3, u = n.constraints || []; for (let d = 0, c = 0; c < 4; ++d, ++c) { Ht(d % 2 ? o : i, d % 4 >= 2, u, t), s = P2(e); let f2 = ye(e, s); f2 < a ? (c = 0, l3 = Object.assign({}, s), a = f2) : f2 === a && (l3 = structuredClone(s)); } wn(e, l3); } function yn(e, n, t) { let r = /* @__PURE__ */ new Map(), o = (i, s) => { r.has(i) || r.set(i, []), r.get(i).push(s); }; for (let i of e.nodes()) { let s = e.node(i); if (typeof s.rank == "number" && o(s.rank, i), typeof s.minRank == "number" && typeof s.maxRank == "number") for (let a = s.minRank; a <= s.maxRank; a++) a !== s.rank && o(a, i); } return n.map(function(i) { return ve2(e, i, t, r.get(i) || []); }); } function Ht(e, n, t, r) { let o = true, i = new T2(); e.forEach(function(s) { t.forEach((d) => i.setEdge(d.left, d.right)); let a = s.graph().root, { result: l3, usedBias: u } = te2(s, a, i, r, o); n && u && (o = !o), l3.vs.forEach((d, c) => s.node(d).order = c), ke2(s, i, l3.vs); }); } function wn(e, n) { Object.values(n).forEach((t) => t.forEach((r, o) => e.node(r).order = o)); } function qt(e, n) { let t = {}; function r(o, i) { let s = 0, a = 0, l3 = o.length, u = i[i.length - 1]; return i.forEach((d, c) => { let f2 = Ut(e, d), h2 = f2 ? e.node(f2).order : l3; (f2 || d === u) && (i.slice(a, c + 1).forEach((p) => { let E2 = e.predecessors(p); E2 && E2.forEach((y2) => { let L2 = e.node(y2), b = L2.order; (b < s || h2 < b) && !(L2.dummy && e.node(p).dummy) && Gn(t, y2, p); }); }), a = c + 1, s = h2); }), i; } return n.length && n.reduce(r), t; } function $t(e, n) { let t = {}; function r(i, s, a, l3, u) { A2(s, a).forEach((d) => { let c = i[d]; if (c !== void 0 && e.node(c).dummy) { let f2 = e.predecessors(c); f2 && f2.forEach((h2) => { if (h2 === void 0) return; let p = e.node(h2); p.dummy && (p.order < l3 || p.order > u) && Gn(t, h2, c); }); } }); } function o(i, s) { let a = -1, l3 = -1, u = 0; return s.forEach((d, c) => { if (e.node(d).dummy === "border") { let f2 = e.predecessors(d); if (f2 && f2.length) { let h2 = f2[0]; if (h2 === void 0) return; l3 = e.node(h2).order, r(s, u, c, a, l3), u = c, a = l3; } } r(s, u, s.length, l3, i.length); }), s; } return n.length && n.reduce(o), t; } function Ut(e, n) { if (e.node(n).dummy) { let t = e.predecessors(n); if (t) return t.find((r) => e.node(r).dummy); } } function Gn(e, n, t) { if (n > t) { let o = n; n = t, t = o; } let r = e[n]; r || (e[n] = r = {}), r[t] = true; } function Jt(e, n, t) { if (n > t) { let o = n; n = t, t = o; } let r = e[n]; return r !== void 0 && Object.hasOwn(r, t); } function Kt(e, n, t, r, o) { let i = {}, s = {}, a = {}; return n.forEach((l3) => { l3.forEach((u, d) => { i[u] = u, s[u] = u, a[u] = d; }); }), n.forEach((l3) => { let u = -1, d = -1, c = false, f2 = l3, h2 = l3.findIndex((p) => (o == null ? void 0 : o.includes(p)) || Nn(p, e, o)); h2 > 0 && (f2 = [l3[h2], ...l3.slice(0, h2), ...l3.slice(h2 + 1)], c = true), f2.forEach((p) => { var y2; let E2 = r(p); if (E2 && E2.length) { o != null && o.includes(p) && (E2 = E2.filter((g) => Nn(g, e, o))); let L2 = E2.sort((g, m) => { let w = a[g], k2 = a[m]; return (w !== void 0 ? w : 0) - (k2 !== void 0 ? k2 : 0); }), b = (L2.length - 1) / 2; for (let g = Math.floor(b), m = Math.ceil(b); g <= m; ++g) { let w = L2[g]; if (w === void 0) continue; let k2 = a[w]; if (k2 !== void 0 && s[p] === p && u < k2 && a[w] !== d && !Jt(t, p, w)) { let _2 = i[w]; _2 !== void 0 && (s[w] = p, s[p] = i[p] = _2, u = k2, c && (u = -1, d = (y2 = a[w]) != null ? y2 : -1, c = false)); } } } }); }), { root: i, align: s }; } function Qt(e, n, t, r, o = false) { let i = {}, s = Zt(e, n, t, o), a = o ? "borderLeft" : "borderRight"; function l3(h2, p) { let E2 = s.nodes().slice(), y2 = {}, L2 = E2.pop(); for (; L2; ) { if (y2[L2]) h2(L2); else { y2[L2] = true, E2.push(L2); for (let b of p(L2)) E2.push(b); } L2 = E2.pop(); } } function u(h2) { let p = s.inEdges(h2); p ? i[h2] = p.reduce((E2, y2) => { var g; let L2 = (g = i[y2.v]) != null ? g : 0, b = s.edge(y2); return Math.max(E2, L2 + (b !== void 0 ? b : 0)); }, 0) : i[h2] = 0; } function d(h2) { let p = s.outEdges(h2), E2 = Number.POSITIVE_INFINITY; p && (E2 = p.reduce((L2, b) => { let g = i[b.w], m = s.edge(b); return Math.min(L2, (g !== void 0 ? g : 0) - (m !== void 0 ? m : 0)); }, Number.POSITIVE_INFINITY)); let y2 = e.node(h2); E2 !== Number.POSITIVE_INFINITY && y2.borderType !== a && (i[h2] = Math.max(i[h2] !== void 0 ? i[h2] : 0, E2)); } function c(h2) { return s.predecessors(h2) || []; } function f2(h2) { return s.successors(h2) || []; } return l3(u, c), l3(d, f2), Object.keys(r).forEach((h2) => { var E2; let p = t[h2]; p !== void 0 && (i[h2] = (E2 = i[p]) != null ? E2 : 0); }), i; } function Zt(e, n, t, r) { let o = new T2(), i = e.graph(), s = rr(i.nodesep, i.edgesep, r); return n.forEach((a) => { let l3; a.forEach((u) => { let d = t[u]; if (d !== void 0) { if (o.setNode(d), l3 !== void 0) { let c = t[l3]; if (c !== void 0) { let f2 = o.edge(c, d); o.setEdge(c, d, Math.max(s(e, u, l3), f2 || 0)); } } l3 = u; } }); }), o; } function er(e, n) { return Object.values(n).reduce((t, r) => { let o = Number.NEGATIVE_INFINITY, i = Number.POSITIVE_INFINITY; Object.entries(r).forEach(([a, l3]) => { let u = or(e, a) / 2; o = Math.max(l3 + u, o), i = Math.min(l3 - u, i); }); let s = o - i; return s < t[0] && (t = [s, r]), t; }, [Number.POSITIVE_INFINITY, null])[1]; } function nr(e, n) { let t = Object.values(n), r = R2(Math.min, t), o = R2(Math.max, t); ["u", "d"].forEach((i) => { ["l", "r"].forEach((s) => { let a = i + s, l3 = e[a]; if (!l3 || l3 === n) return; let u = Object.values(l3), d = r - R2(Math.min, u); s !== "l" && (d = o - R2(Math.max, u)), d && (e[a] = X2(l3, (c) => c + d)); }); }); } function tr(e, n = void 0) { let t = e.ul; return t ? X2(t, (r, o) => { var s, a; if (n) { let l3 = n.toLowerCase(), u = e[l3]; if (u && u[o] !== void 0) return u[o]; } let i = Object.values(e).map((l3) => { let u = l3[o]; return u !== void 0 ? u : 0; }).sort((l3, u) => l3 - u); return (((s = i[1]) != null ? s : 0) + ((a = i[2]) != null ? a : 0)) / 2; }) : {}; } function vn(e, n) { let t = P2(e), r = Object.assign(qt(e, t), $t(e, t)), o = {}, i; ["u", "d"].forEach((a) => { i = a === "u" ? t : Object.values(t).reverse(), ["l", "r"].forEach((l3) => { l3 === "r" && (i = i.map((f2) => Object.values(f2).reverse())); let d = Kt(e, i, r, (f2) => (a === "u" ? e.predecessors(f2) : e.successors(f2)) || [], n), c = Qt(e, i, d.root, d.align, l3 === "r"); l3 === "r" && (c = X2(c, (f2) => -f2)), o[a + l3] = c; }); }); let s = er(e, o); return nr(o, s), tr(o, e.graph().align); } function rr(e, n, t) { return (r, o, i) => { let s = r.node(o), a = r.node(i), l3 = 0, u; if (l3 += s.width / 2, Object.hasOwn(s, "labelpos")) switch (s.labelpos.toLowerCase()) { case "l": u = -s.width / 2; break; case "r": u = s.width / 2; break; } if (u && (l3 += t ? u : -u), u = void 0, l3 += (s.dummy ? n : e) / 2, l3 += (a.dummy ? n : e) / 2, l3 += a.width / 2, Object.hasOwn(a, "labelpos")) switch (a.labelpos.toLowerCase()) { case "l": u = a.width / 2; break; case "r": u = -a.width / 2; break; } return u && (l3 += t ? u : -u), l3; }; } function or(e, n) { return e.node(n).width; } function Nn(e, n, t) { var s; if (!t) return false; let r = (s = n.node(e)) == null ? void 0 : s.edgeObj; if (!r || n.node(e).edgeLabel.reversed) return false; let o = t.indexOf(r == null ? void 0 : r.v), i = t.indexOf(r == null ? void 0 : r.w); return o !== -1 && i !== -1 && o === (i + 1) % t.length || o === (i - 1) % t.length; } function kn(e, n) { e = Z(e), ir(e), Object.entries(vn(e, n)).forEach(([t, r]) => e.node(t).x = r); } function ir(e) { let n = P2(e), t = e.graph(), r = t.ranksep, o = t.rankalign, i = 0; n.forEach((s) => { let a = s.reduce((l3, u) => { var c; let d = (c = e.node(u).height) != null ? c : 0; return l3 > d ? l3 : d; }, 0); s.forEach((l3) => { let u = e.node(l3); o === "top" ? u.y = i + u.height / 2 : o === "bottom" ? u.y = i + a - u.height / 2 : u.y = i + a / 2; }), i += a + r; }); } var xn2 = /* @__PURE__ */ new WeakMap(); function Oe2(e, n = {}) { return Rn2(e, q2, n), e; } function _n(e, n, t) { let r = n; for (; r !== void 0; ) { let o = e.parent(r); if (o === t) return r; r = o; } } function Rn2(e, n, t) { var L2; let r = e.nodes().filter((b) => e.children(b).length), o = {}; r.forEach((b) => { let g = e.node(b); if (g && g.rankdir) { let m = new T2({ multigraph: true, compound: true }); m.setGraph({ rankdir: g.rankdir }); let w = e.children(b); w.forEach((v) => { let N2 = { ...e.node(v) }; m.setNode(v, N2); let O2 = e.parent(v); O2 && O2 !== b && w.includes(O2) && m.setParent(v, O2); }); let k2 = /* @__PURE__ */ new Set(); e.edges().forEach((v) => { let N2 = _n(e, v.v, b), O2 = _n(e, v.w, b); if (N2 && O2 && N2 !== O2) { let W2 = `${N2}\0${O2}`; k2.has(W2) || (k2.add(W2), m.setEdge(N2, O2, { ...e.edge(v) })); } }), Rn2(m, n, t); let _2 = jn(m); On(_2, n, t, null), Cn(m, _2); let C2 = 1 / 0, j2 = 1 / 0, I2 = -1 / 0, S2 = -1 / 0; m.nodes().forEach((v) => { if (v === b) return; let N2 = m.node(v); N2 && typeof N2.x == "number" && typeof N2.y == "number" && typeof N2.width == "number" && typeof N2.height == "number" && (C2 = Math.min(C2, N2.x - N2.width / 2), I2 = Math.max(I2, N2.x + N2.width / 2), j2 = Math.min(j2, N2.y - N2.height / 2), S2 = Math.max(S2, N2.y + N2.height / 2)); }), (!isFinite(C2) || !isFinite(j2) || !isFinite(I2) || !isFinite(S2)) && (C2 = j2 = 0, I2 = S2 = 0); let G2 = I2 - C2, x2 = S2 - j2; o[b] = { minX: C2, minY: j2, maxX: I2, maxY: S2, width: G2, height: x2, offsetX: C2, offsetY: j2 }, g._dagreClusterSubgraph = m; } }); let i = [], s = (b) => { let g = [], m = (e.children(b) || []).filter((w) => w !== b); for (; m.length > 0; ) { let w = m.shift(); g.push(w), (e.children(w) || []).filter((k2) => k2 !== w).forEach((k2) => m.push(k2)); } return g; }, a = /* @__PURE__ */ new Map(); r.forEach((b) => { let g = e.node(b); g && g.rankdir && o[b] && a.set(b, (e.children(b) || []).filter((m) => m !== b)); }); let l3 = new Set([...a.values()].flat()), u = /* @__PURE__ */ new Map(); a.forEach((b, g) => { l3.has(g) || u.set(g, s(g)); }); let d = new Set([...u.values()].flat()), c = (b) => { for (let [g, m] of u) if (m.includes(b)) return g; return b; }, f2 = []; e.edges().forEach((b) => { (d.has(b.v) || d.has(b.w)) && f2.push({ edge: b, label: e.edge(b) }); }); let h2 = /* @__PURE__ */ new Map(); d.forEach((b) => { let g = e.parent(b); h2.set(b, typeof g == "string" ? g : void 0); }), u.forEach((b, g) => { let m = e.node(g), w = []; b.forEach((C2) => { let j2 = e.node(C2); j2 && (w.push({ id: C2, node: j2, parent: h2.get(C2) }), e.removeNode(C2)); }); let k2 = f2.filter(({ edge: C2 }) => b.includes(C2.v) || b.includes(C2.w)), _2 = o[g]; m && (i.push({ clusterId: g, subgraph: m._dagreClusterSubgraph, bounds: _2, children: b, removedNodes: w, removedEdges: k2 }), m.width = _2.width, m.height = _2.height); }); let p = /* @__PURE__ */ new Set(); f2.forEach(({ edge: b, label: g }) => { let m = c(b.v), w = c(b.w); if (m !== w && e.hasNode(m) && e.hasNode(w)) { let k2 = `${m}\0${w}`; p.has(k2) || (p.add(k2), e.setEdge(m, w, { ...g, width: 0, height: 0 })); } }); let E2 = jn(e), y2 = On(E2, n, t, (L2 = xn2.get(e)) != null ? L2 : null); xn2.set(e, y2), Cn(e, E2), p.forEach((b) => { let g = b.indexOf("\0"), m = b.slice(0, g), w = b.slice(g + 1); e.hasEdge(m, w) && e.removeEdge(m, w); }), i.forEach(({ clusterId: b, subgraph: g, bounds: m, removedNodes: w, removedEdges: k2 }) => { var G2, x2; let _2 = e.node(b), C2 = (G2 = _2 == null ? void 0 : _2.x) != null ? G2 : 0, j2 = (x2 = _2 == null ? void 0 : _2.y) != null ? x2 : 0, I2 = (m.minX + m.maxX) / 2, S2 = (m.minY + m.maxY) / 2; w.forEach(({ id: v, node: N2, parent: O2 }) => { e.setNode(v, N2), O2 !== void 0 && e.setParent(v, O2); }), k2.forEach(({ edge: v, label: N2 }) => { e.setEdge(v, N2); }), g.nodes().forEach((v) => { if (v === b) return; let N2 = g.node(v), O2 = e.node(v); O2 && N2 && typeof N2.x == "number" && typeof N2.y == "number" && (O2.x = C2 + (N2.x - I2), O2.y = j2 + (N2.y - S2)); }), delete _2._dagreClusterSubgraph; }), r.forEach((b) => { var w, k2; let g = e.node(b), m = o[b]; if (g && g.rankdir && g._dagreClusterSubgraph && m) { let _2 = g._dagreClusterSubgraph, C2 = (w = g.x) != null ? w : 0, j2 = (k2 = g.y) != null ? k2 : 0, I2 = (m.minX + m.maxX) / 2, S2 = (m.minY + m.maxY) / 2; _2.nodes().forEach((G2) => { if (G2 === b) return; let x2 = _2.node(G2), v = e.node(G2); if (v && x2 && typeof x2.x == "number" && typeof x2.y == "number") { let N2 = x2.x - I2, O2 = x2.y - S2; v.x = C2 + N2, v.y = j2 + O2; } }), delete g._dagreClusterSubgraph; } }); } function On(e, n, t, r = null) { var l3, u; let o = (t == null ? void 0 : t.useDynamic) !== false, i = o && (l3 = r == null ? void 0 : r.graph) != null ? l3 : null, s = o && (u = r == null ? void 0 : r.rawNodes) != null ? u : null; n(" makeSpaceForEdgeLabels", () => hr(e)), n(" removeSelfEdges", () => Nr(e)), n(" acyclic", () => Ue2(e, i)), n(" nestingGraph.run", () => un(e)), n(" rank", () => dn(Z(e))), n(" injectEdgeLabelProxies", () => br(e)), n(" removeEmptyRanks", () => Be2(e)), n(" nestingGraph.cleanup", () => fn2(e)), n(" normalizeRanks", () => We2(e)), n(" assignRankMinMax", () => gr(e)), n(" removeEdgeLabelProxies", () => pr(e)), n(" normalize.run", () => Ke2(e)), n(" parentDummyChains", () => ln(e)), n(" addBorderSegments", () => bn(e)), n(" order", () => re2(e, t, s)), n(" insertSelfEdges", () => Gr(e)), n(" adjustCoordinateSystem", () => pn(e)), n(" position", () => kn(e, t.corePath)), n(" positionSelfEdges", () => vr(e)); let a = JSON.parse(JSON.stringify(e._nodes)); return n(" removeBorderNodes", () => wr(e)), n(" normalize.undo", () => Qe2(e)), n(" fixupEdgeLabelCoords", () => Lr(e)), n(" undoCoordinateSystem", () => mn2(e)), n(" translateGraph", () => mr(e)), n(" assignNodeIntersects", () => Er(e)), n(" reversePoints", () => yr(e)), n(" acyclic.undo", () => Je2(e)), { graph: e, rawNodes: a }; } function Cn(e, n) { e.nodes().forEach((t) => { let r = e.node(t), o = n.node(t); r && (r.x = o.x, r.y = o.y, r.order = o.order, r.rank = o.rank, n.children(t).length && (r.width = o.width, r.height = o.height)); }), e.edges().forEach((t) => { let r = e.edge(t), o = n.edge(t); r.points = o.points, Object.hasOwn(o, "x") && (r.x = o.x, r.y = o.y); }), e.graph().width = n.graph().width, e.graph().height = n.graph().height; } var sr = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"]; var ar = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "TB", rankalign: "center" }; var dr = ["acyclicer", "ranker", "rankdir", "align", "rankalign"]; var lr = ["width", "height", "rank"]; var Tn2 = { width: 0, height: 0 }; var ur = ["minlen", "weight", "width", "height", "labeloffset"]; var cr = { minlen: 1, weight: 1, width: 0, height: 0, labeloffset: 10, labelpos: "r" }; var fr = ["labelpos"]; function jn(e) { let n = new T2({ multigraph: true, compound: true }), t = _e2(e.graph()); return n.setGraph(Object.assign({}, ar, xe2(t, sr), B2(t, dr))), e.nodes().forEach((r) => { let o = _e2(e.node(r)), i = xe2(o, lr); Object.keys(Tn2).forEach((a) => { i[a] === void 0 && (i[a] = Tn2[a]); }), n.setNode(r, i); let s = e.parent(r); s !== void 0 && n.setParent(r, s); }), e.edges().forEach((r) => { let o = _e2(e.edge(r)); n.setEdge(r, Object.assign({}, cr, xe2(o, ur), B2(o, fr))); }), n; } function hr(e) { let n = e.graph(); n.ranksep /= 2, e.edges().forEach((t) => { var o; let r = e.edge(t); r.minlen *= 2, ((o = r.labelpos) != null ? o : "r").toLowerCase() !== "c" && (n.rankdir === "TB" || n.rankdir === "BT" ? r.width += r.labeloffset : r.height += r.labeloffset); }); } function br(e) { e.edges().forEach((n) => { let t = e.edge(n); if (t.width && t.height) { let r = e.node(n.v), i = { rank: (e.node(n.w).rank - r.rank) / 2 + r.rank, e: n }; M(e, "edge-proxy", i, "_ep"); } }); } function gr(e) { let n = 0; e.nodes().forEach((t) => { let r = e.node(t); r.borderTop && (r.minRank = e.node(r.borderTop).rank, r.maxRank = e.node(r.borderBottom).rank, n = Math.max(n, r.maxRank)); }), e.graph().maxRank = n; } function pr(e) { e.nodes().forEach((n) => { let t = e.node(n); if (t.dummy === "edge-proxy") { let r = t; e.edge(r.e).labelRank = t.rank, e.removeNode(n); } }); } function mr(e) { let n = Number.POSITIVE_INFINITY, t = 0, r = Number.POSITIVE_INFINITY, o = 0, i = e.graph(), s = i.marginx || 0, a = i.marginy || 0; function l3(u) { let d = u.x, c = u.y, f2 = u.width, h2 = u.height; n = Math.min(n, d - f2 / 2), t = Math.max(t, d + f2 / 2), r = Math.min(r, c - h2 / 2), o = Math.max(o, c + h2 / 2); } e.nodes().forEach((u) => l3(e.node(u))), e.edges().forEach((u) => { let d = e.edge(u); Object.hasOwn(d, "x") && l3(d); }), n -= s, r -= a, e.nodes().forEach((u) => { let d = e.node(u); d.x -= n, d.y -= r; }), e.edges().forEach((u) => { let d = e.edge(u); d.points.forEach((c) => { c.x -= n, c.y -= r; }), Object.hasOwn(d, "x") && (d.x -= n), Object.hasOwn(d, "y") && (d.y -= r); }), i.width = t - n + s, i.height = o - r + a; } function Er(e) { e.edges().forEach((n) => { if (n.v === n.w) return; let t = e.edge(n), r = e.node(n.v), o = e.node(n.w), i, s; t.points ? (i = t.points[0], s = t.points[t.points.length - 1]) : (t.points = [], i = o, s = r), t.points.unshift(se2(r, i)), t.points.push(se2(o, s)); }); } function Lr(e) { e.edges().forEach((n) => { let t = e.edge(n); if (Object.hasOwn(t, "x")) switch ((t.labelpos === "l" || t.labelpos === "r") && (t.width -= t.labeloffset), t.labelpos) { case "l": t.x -= t.width / 2 + t.labeloffset; break; case "r": t.x += t.width / 2 + t.labeloffset; break; } }); } function yr(e) { e.edges().forEach((n) => { let t = e.edge(n); t.reversed && t.points.reverse(); }); } function wr(e) { e.nodes().forEach((n) => { if (e.children(n).length) { let t = e.node(n), r = e.node(t.borderTop), o = e.node(t.borderBottom), i = e.node(t.borderLeft[t.borderLeft.length - 1]), s = e.node(t.borderRight[t.borderRight.length - 1]); t.width = Math.abs(s.x - i.x), t.height = Math.abs(o.y - r.y), t.x = i.x + t.width / 2, t.y = r.y + t.height / 2; } }), e.nodes().forEach((n) => { e.node(n).dummy === "border" && e.removeNode(n); }); } function Nr(e) { e.edges().forEach((n) => { if (n.v === n.w) { let t = e.node(n.v); t.selfEdges || (t.selfEdges = []), t.selfEdges.push({ e: n, label: e.edge(n) }), e.removeEdge(n); } }); } function Gr(e) { P2(e).forEach((t) => { let r = 0; t.forEach((o, i) => { let s = e.node(o); typeof s.rank != "number" && (s.rank = 0), s.order = i + r, (s.selfEdges || []).forEach((a) => { M(e, "selfedge", { width: a.label.width, height: a.label.height, rank: s.rank, order: i + ++r, e: a.e, edgeLabel: a.label }, "_se"), (!Array.isArray(a.label.points) || a.label.points.length !== 7) && (a.label.points = [{ x: 0, y: -10 }, { x: 0, y: -10 }, { x: 0, y: 0 }, { x: 0, y: 10 }, { x: 0, y: 10 }, { x: 0, y: 0 }, { x: 0, y: 0 }]); }), delete s.selfEdges; }); }); } function vr(e) { e.nodes().forEach((n) => { let t = e.node(n), r = (o) => typeof o == "number" && isFinite(o); if (t.dummy === "selfedge") { let o = t, i = e.node(o.e.v), s = r(i == null ? void 0 : i.x) ? i.x : 0, a = r(i == null ? void 0 : i.y) ? i.y : 0, l3 = r(i == null ? void 0 : i.width) ? i.width : 0, u = r(i == null ? void 0 : i.height) ? i.height : 0, d = r(t.x) ? t.x : s, c = r(t.y) ? t.y : a, f2 = l3 / 2, h2 = u / 2; o.edgeLabel.points = [{ x: d + f2, y: c - h2 }, { x: d + f2, y: c - h2 }, { x: d, y: c }, { x: d - f2, y: c + h2 }, { x: d - f2, y: c + h2 }, { x: d, y: c }, { x: d, y: c }], o.edgeLabel.x = d, o.edgeLabel.y = c, e.setEdge(o.e, o.edgeLabel), e.removeNode(n); } else t && Array.isArray(t.selfEdges) && t.selfEdges.forEach((o) => { if (!Array.isArray(o.label.points) || o.label.points.length !== 7) { let i = r(t.x) ? t.x : 0, s = r(t.y) ? t.y : 0, a = r(t.width) ? t.width : 0, l3 = r(t.height) ? t.height : 0, u = a / 2, d = l3 / 2; o.label.points = [{ x: i + u, y: s - d }, { x: i + u, y: s - d }, { x: i, y: s }, { x: i - u, y: s + d }, { x: i - u, y: s + d }, { x: i, y: s }, { x: i, y: s }]; } }); }); } function xe2(e, n) { return X2(B2(e, n), Number); } function _e2(e) { let n = {}; return e && Object.entries(e).forEach(([t, r]) => { typeof t == "string" && (t = t.toLowerCase()), n[t] = r; }), n; } function Ce2(e) { let n = P2(e), t = new T2({ compound: true, multigraph: true }).setGraph({}); return e.nodes().forEach((r) => { t.setNode(r, { label: r }), t.setParent(r, "layer" + e.node(r).rank); }), e.edges().forEach((r) => t.setEdge(r.v, r.w, {}, r.name)), n.forEach((r, o) => { let i = "layer" + o; t.setNode(i, { rank: "same" }), r.reduce((s, a) => (t.setEdge(s, a, { style: "invis" }), a)); }), t; } var kr = { graphlib: ie2, version: ue2, layout: Oe2, debug: Ce2, util: { time: le2, notime: q2 } }; var $o = kr; // src/components/flow.js var FS2 = 13; var LH2 = 17; var TEXT_MAX = 150; var EDGE_FS = 11.5; var CLUSTER_FS = 11; var CLUSTER_LABEL_H = 15; var DIRS = /* @__PURE__ */ new Set(["TB", "LR", "BT", "RL"]); var BRACKETS = [ { open: "[(", close: ")]", shape: "db" }, { open: "[", close: "]", shape: "rect" }, { open: "(", close: ")", shape: "round" }, { open: "{", close: "}", shape: "diamond" } ]; var ARROW = /^\s*(-->|->)\s*/; var flow_default = { name: "flow", summary: "Flowchart / architecture diagram (automatic layout)", syntax: `\`\`\`flow [TB|LR|BT|RL] A -> B: label \u2190 solid line; text after the colon is the edge label A --> C \u2190 dashed line A -> B -> C \u2190 chain A -> B & C \u2190 fan-out (Start) {Valid?} [(Database)] [text with: a colon] \u2190 rounded / diamond / cylinder / rectangle *Key node \u2190 * prefix highlights group Group name: B, C \u2190 draw a group box around nodes \`\`\` - The text inside the brackets is the node's identity; later lines can refer to the node by that text alone. The default direction is TB (top to bottom). - Change markers show what a plan adds, removes and changes. A line can start with + (added), - (removed) or ~ (changed), followed by a space: \`\`\`flow LR Client -> Gateway + Gateway -> [(Cache)]: lookup + Cache -> Service: miss - Gateway -> Service ~ *Service \`\`\` - A marker applies to every link on its line. A node is removed when it appears only on - lines, added when it appears only on + lines, and unchanged when it also appears on an unmarked line, even if its links changed. ~ Node on a line without an arrow marks that node as changed. - ~ on a line with an arrow is an error: remove the old link with - and add the new one with +. That is also how a link's label changes. The same link both unmarked and marked is an error too. - + group Name: A, B and - group Name: A, B mark a group box. A group that is not removed and holds only removed nodes is a warning. Markers combine with * and every shape bracket. - The Changes view draws added in the theme's ok color, removed faded with a struck-through label, changed with a warn outline, and each marked node with a +, \u2212 or ~ badge. A count row and a Before / Changes / After switch sit under the diagram: Before and After show the diagram as it was and as it will be, plain and without the items that are not in that view. - A line that starts with a marker and a space is always read as a marker. To keep a node name that starts with "- ", write it in brackets: [- Gateway].`, example: "```flow LR\n(User) -> Gateway: HTTPS\nGateway -> Auth & *Service\nService -> [(Database)]\ngroup Backend: Auth, Service\n```", render(text, { args, uid, ui, warn, video, dir: pageDir = "ltr" }) { const model = parseFlow(text); model.warnings.forEach((w) => warn?.(w)); const flowDir = (args.match(/\b(TB|LR|BT|RL)\b/i)?.[1] ?? "TB").toUpperCase(); const html = `${layout2(model, DIRS.has(flowDir) ? flowDir : "TB", uid(), ui, pageDir)}`; return withDelta(html, [...model.nodes.values(), ...model.edges, ...model.groups].map((x2) => x2.state ?? null), { ui, video }); } }; function parseFlow(text) { const nodes = /* @__PURE__ */ new Map(); const edges = []; const groups = []; const upsert = (spec, line, mark) => { const prev = nodes.get(spec.id); const seen = { before: mark !== "+", after: mark !== "-", tilde: mark === "~" }; if (!prev) nodes.set(spec.id, { ...spec, ...seen, line }); else { const merged = { before: prev.before || seen.before, after: prev.after || seen.after, tilde: prev.tilde || seen.tilde }; nodes.set(spec.id, { ...prev, ...merged, shape: spec.explicit ? spec.shape : prev.shape, hi: prev.hi || spec.hi }); } return spec.id; }; for (const { text: raw, line } of contentLines(text)) { const { mark, text: t } = splitMarker(raw); const g = t.match(/^group\s+(.+?)\s*[:：]\s*(.+)$/i); if (g) { if (mark === "~") throw new ComponentError("flow: ~ marks a node, not a group. Use + group or - group to add or remove a group box", line); const state = markState(mark); groups.push({ name: g[1], members: g[2].split(/[,，]/).map((s) => s.trim()).filter(Boolean), line, ...state && { state } }); continue; } const { chain, label } = parseChain(t, line); if (mark === "~" && chain.length > 1) { throw new ComponentError('flow: ~ marks a node, not a link. To change a link, remove the old one and add the new one: "- A -> B" then "+ A -> C"', line); } const ids = chain.map((step) => ({ ...step, ids: step.nodes.map((n) => upsert(n, line, mark)) })); for (let k2 = 1; k2 < ids.length; k2++) { const isLast = k2 === ids.length - 1; for (const from of ids[k2 - 1].ids) { for (const to of ids[k2].ids) { const state = markState(mark); edges.push({ from, to, dashed: ids[k2].arrow === "-->", label: isLast ? label : "", line, ...state && { state } }); } } } } if (!nodes.size) throw new ComponentError("flow needs at least one node", 1); for (const grp of groups) { const missing = grp.members.filter((m) => !nodes.has(m)); if (missing.length) throw new ComponentError(`group ${grp.name} refers to nodes that do not exist: ${missing.join(", ")}`, grp.line); } checkLinks(edges); const settled = new Map([...nodes].map(([id, n]) => { const state = nodeState(n); return [id, state ? { ...n, state } : n]; })); return { nodes: settled, edges, groups, warnings: groupWarnings(groups, settled) }; } function nodeState({ before, after, tilde }) { if (before && !after) return "removed"; if (after && !before) return "added"; return tilde ? "changed" : null; } function checkLinks(edges) { const key = (e) => `${e.from}\0${e.to}`; for (const e of edges.filter((x2) => x2.state)) { const plain = edges.find((x2) => !x2.state && key(x2) === key(e)); if (plain) throw new ComponentError(`flow: the link ${e.from} -> ${e.to} is written unmarked on line ${plain.line} and as ${e.state === "added" ? "+" : "-"} here. Mark every line of that link, or none`, e.line); } } function groupWarnings(groups, nodes) { return groups.filter((g) => g.state !== "removed" && g.members.every((m) => nodes.get(m).state === "removed")).map((g) => ({ line: g.line, message: `group ${g.name} holds only removed nodes and would be an empty box after the change. Mark it with "- group ${g.name}: ${g.members.join(", ")}"` })); } function parseChain(t, line) { const chain = []; let pos = 0; let arrow = null; for (; ; ) { const group = []; for (; ; ) { const { node, end } = parseNode(t, pos, line); group.push(node); pos = end; const amp = t.slice(pos).match(/^\s*&\s*/); if (!amp) break; pos += amp[0].length; } chain.push({ arrow, nodes: group }); const a = t.slice(pos).match(ARROW); if (!a) break; arrow = a[1]; pos += a[0].length; } const rest = t.slice(pos).trim(); if (rest && !/^[:：]/.test(rest)) { throw new ComponentError(`flow cannot parse "${t}". Write a link as A -> B: label`, line); } return { chain, label: rest.replace(/^[:：]\s*/, "") }; } function parseNode(t, start, line) { let pos = start + t.slice(start).match(/^\s*/)[0].length; const hi = t[pos] === "*"; if (hi) pos++; const bracket = BRACKETS.find((b) => t.startsWith(b.open, pos)); let label; let end; if (bracket) { const close = t.indexOf(bracket.close, pos + bracket.open.length); if (close === -1) throw new ComponentError(`flow: unclosed shape bracket, missing ${bracket.close}`, line); label = t.slice(pos + bracket.open.length, close).trim(); end = close + bracket.close.length; } else { const m = t.slice(pos).match(/^(.*?)(?=\s*(?:-->|->|&|[:：]|$))/); label = m[1].trim(); end = pos + m[0].length; } if (!label) throw new ComponentError(`flow has an empty node: "${t}"`, line); return { node: { id: label, label, shape: bracket?.shape ?? "rect", explicit: Boolean(bracket), hi }, end }; } function nodeSize(node) { const lines = wrap(node.label, TEXT_MAX, FS2); const tw = Math.max(...lines.map((l3) => measure(l3, FS2))); const th = lines.length * LH2; const w = Math.max(tw + 28, 64); const h2 = th + 18; const size = { rect: [w, h2], round: [w + 12, h2], diamond: [(tw + 28) * 1.5, h2 * 1.6], db: [w, h2 + 14] }[node.shape]; return { lines, width: size[0], height: size[1] }; } var nodeKey = (i) => `n${i}`; var gkey = (i) => `g${i}`; var reserveKey = (i) => `r${i}`; function runLayout({ nodes, edges, groups }, rankdir, rtl, widths, reserve) { const g = new $o.graphlib.Graph({ compound: groups.length > 0, multigraph: true }); g.setGraph({ rankdir, nodesep: 36, ranksep: 46, marginx: 14, marginy: groups.length ? 26 : 14 }); g.setDefaultEdgeLabel(() => ({})); const key = new Map([...nodes.keys()].map((name, i) => [name, nodeKey(i)])); const sizes = /* @__PURE__ */ new Map(); for (const n of nodes.values()) { const s = nodeSize(n); sizes.set(n.id, s); g.setNode(key.get(n.id), { width: s.width, height: s.height }); } const vertical = rankdir === "TB" || rankdir === "BT"; groups.forEach((grp, i) => { g.setNode(gkey(i), { label: grp.name }); grp.members.forEach((m) => g.setParent(key.get(m), gkey(i))); if (!reserve.has(i) || !vertical) return; g.setNode(reserveKey(i), { width: widths[i] + 4, height: CLUSTER_LABEL_H }); g.setParent(reserveKey(i), gkey(i)); const down = edges.map((e) => rankdir === "TB" ? [e.from, e.to] : [e.to, e.from]); const link = (a, b, name) => rankdir === "TB" ? g.setEdge(a, b, {}, name) : g.setEdge(b, a, {}, name); const inside = new Set(grp.members); const first = grp.members.filter((m) => !down.some(([a, b]) => b === m && a !== m && inside.has(a))); (first.length ? first : grp.members.slice(0, 1)).forEach((m, k2) => { link(reserveKey(i), key.get(m), `r${i}-${k2}`); down.forEach(([a, b], j2) => { if (b === m && !inside.has(a)) link(key.get(a), reserveKey(i), `r${i}-${k2}-${j2}`); }); }); }); edges.forEach((e, i) => { const label = e.label ? { label: e.label, width: measure(e.label, EDGE_FS) + 12, height: 18, labelpos: "c" } : {}; g.setEdge(key.get(e.from), key.get(e.to), label, `e${i}`); }); $o.layout(g); if (rtl) mirrorLayout(g); if (!vertical) { for (const [i, side] of reserve) { const c = g.node(gkey(i)); insertStrip(g, side === "top" ? top(c) + 2 : top(c) + c.height - 2, CLUSTER_LABEL_H + 3); } } return { g, key, sizes }; } function insertStrip(g, y2, d) { for (const v of g.nodes()) { const n = g.node(v); if (v.startsWith("g") && top(n) < y2 && top(n) + n.height > y2) { n.height += d; n.y += d / 2; } else if (n.y > y2) n.y += d; } for (const e of g.edges()) { const edge = g.edge(e); edge.points = edge.points.map((p) => p.y > y2 ? { ...p, y: p.y + d } : p); if (edge.y !== void 0 && edge.y > y2) edge.y += d; } g.graph().height += d; } var top = (n) => n.y - n.height / 2; function placeLabels({ g, key, sizes }, { nodes, edges, groups }, widths, rtl, reserve) { const boxes = []; for (const n of nodes.values()) { const { x: x2, y: y2 } = g.node(key.get(n.id)); const { width: w, height: h2 } = sizes.get(n.id); boxes.push([x2 - w / 2, y2 - h2 / 2, x2 + w / 2, y2 + h2 / 2]); } const segments = []; edges.forEach((e, i) => { const data = g.edge({ v: key.get(e.from), w: key.get(e.to), name: `e${i}` }); const pts = data.points; for (let k2 = 1; k2 < pts.length; k2++) segments.push([pts[k2 - 1], pts[k2]]); if (e.label) { const w = measure(e.label, EDGE_FS) + 10; boxes.push([data.x - w / 2, data.y - 9, data.x + w / 2, data.y + 9]); } }); return groups.map((grp, i) => { const c = g.node(gkey(i)); const left = c.x - c.width / 2; const right = left + c.width; const w = widths[i]; const own = grp.state ? [[rtl ? left - 8 : right - 8, top(c) - 8, rtl ? left + 8 : right + 8, top(c) + 8]] : []; const free = (x02, y0, y1) => { const box = [x02 - 5, y0 - 2, x02 + w + 5, y1 + 2]; const wide = [x02 - 10, y0 - 2, x02 + w + 10, y1 + 2]; return ![...boxes, ...own].some((b) => overlaps(wide, b)) && !segments.some(([p, q3]) => segmentHits(p, q3, box)); }; const room = g.hasNode(reserveKey(i)) ? g.node(reserveKey(i)) : null; const baselines = reserve.get(i) === "bottom" ? [top(c) + c.height - 6] : room ? [top(c) + 14, room.y + 4] : [top(c) + 14]; for (const baseline2 of baselines) { const [y0, y1] = [baseline2 - 11, baseline2 + 4]; for (let s = 0; s <= Math.max(0, c.width - 16 - w); s += 4) { const x02 = rtl ? right - 8 - w - s : left + 8 + s; if (free(x02, y0, y1)) { boxes.push([x02, y0, x02 + w, y1]); return [rtl ? x02 + w : x02, baseline2]; } } } if (!room) return null; const baseline = baselines.at(-1); const x0 = room.x - w / 2; boxes.push([x0, baseline - 11, x0 + w, baseline + 4]); return [rtl ? x0 + w : x0, baseline]; }); } var overlaps = (a, b) => a[0] < b[2] && b[0] < a[2] && a[1] < b[3] && b[1] < a[3]; function segmentHits(p, q3, [x0, y0, x1, y1]) { const dx = q3.x - p.x; const dy = q3.y - p.y; let t0 = 0; let t1 = 1; for (const [a, b] of [[-dx, p.x - x0], [dx, x1 - p.x], [-dy, p.y - y0], [dy, y1 - p.y]]) { if (a === 0) { if (b < 0) return false; } else { const t = b / a; if (a < 0) t0 = Math.max(t0, t); else t1 = Math.min(t1, t); if (t0 > t1) return false; } } return true; } var labelWidth = (name, pageDir) => measure(name, CLUSTER_FS, { mono: pageDir !== "rtl" }) + 2; function layout2(model, rankdir, id, ui, pageDir = "ltr") { const { nodes, edges, groups } = model; const rtl = pageDir === "rtl"; const widths = groups.map((grp) => labelWidth(grp.name, pageDir)); let run2 = runLayout(model, rankdir, rtl, widths, /* @__PURE__ */ new Set()); let spots = placeLabels(run2, model, widths, rtl, /* @__PURE__ */ new Map()); const reserve = /* @__PURE__ */ new Map(); for (const side of ["top", "bottom"]) { const crowded = spots.flatMap((s, i) => s ? [] : [i]); if (!crowded.length) break; for (const i of crowded) reserve.set(i, side); run2 = runLayout(model, rankdir, rtl, widths, reserve); spots = placeLabels(run2, model, widths, rtl, reserve); } const { g, key, sizes } = run2; const clusters = groups.map((grp, i) => { const c = g.node(gkey(i)); const x2 = c.x - c.width / 2; const y2 = c.y - c.height / 2; const mark = deltaAttr(grp.state); const badgeX = rtl ? x2 : x2 + c.width; const [labelX, labelY] = spots[i] ?? [rtl ? x2 + c.width - 8 : x2 + 8, y2 + 14]; return `${esc(svgLine(grp.name, pageDir))}${badgeSvg(grp.state, badgeX, y2)}`; }); const stepOf = new Map([.../* @__PURE__ */ new Set([...[...nodes.values()].map((n) => n.line), ...edges.map((e) => e.line)])].sort((a, b) => a - b).map((l3, k2) => [l3, k2])); const edgeSvg = edges.map((e, i) => { const data = g.edge({ v: key.get(e.from), w: key.get(e.to), name: `e${i}` }); const pts = clipEnds(data.points, g.node(key.get(e.from)), nodes.get(e.from).shape, g.node(key.get(e.to)), nodes.get(e.to).shape); const head = e.state ? `${id}-arrow-${e.state}` : `${id}-arrow`; const path = ``; const open = ``; if (!e.label) return `${open}${path}`; const w = measure(e.label, EDGE_FS) + 10; return `${open}${path}${textLines([e.label], data.x, data.y, LH2, "", pageDir)}`; }); const nodeSvg = [...nodes.values()].map((n) => { const { x: x2, y: y2 } = g.node(key.get(n.id)); const { width: w, height: h2, lines } = sizes.get(n.id); const badge = badgeSvg(n.state, ...badgePoint(n.shape, x2, y2, w, h2, rtl)); return `${shapeSvg(n.shape, x2, y2, w, h2)}${textLines(lines, x2, y2 + (n.shape === "db" ? 4 : 0), LH2, "", pageDir)}${badge}`; }); const { width, height } = g.graph(); const label = diagramLabel(ui, "flow", [...nodes.keys()].slice(0, 8)); const heads = ["added", "removed"].filter((state) => edges.some((e) => e.state === state)); return `${svgOpen(width, height, label, pageDir)}${arrowDefs(id, heads)}${clusters.join("")}${edgeSvg.join("")}${nodeSvg.join("")}`; } function badgeSvg(state, x2, y2) { if (!state) return ""; return `${SIGN[state]}`; } function badgePoint(shape, x2, y2, w, h2, rtl = false) { const s = rtl ? -1 : 1; if (shape === "diamond") return [x2 + s * (w / 4), y2 - h2 / 4]; if (shape === "round") return [x2 + s * (w / 2 - h2 * 0.15), y2 - h2 / 2 + h2 * 0.15]; return [x2 + s * (w / 2), y2 - h2 / 2]; } function shapeSvg(shape, x2, y2, w, h2) { const l3 = x2 - w / 2; const t = y2 - h2 / 2; if (shape === "diamond") { return ``; } if (shape === "db") { const ry = 7; return ``; } const rx = shape === "round" ? h2 / 2 : 3; return ``; } function clipEnds(points, from, fromShape, to, toShape) { const pts = points.map((p) => ({ ...p })); if (fromShape === "diamond" && pts.length > 1) pts[0] = diamondPoint(from, pts[1]); if (toShape === "diamond" && pts.length > 1) pts[pts.length - 1] = diamondPoint(to, pts[pts.length - 2]); return pts; } function diamondPoint(node, toward) { const dx = toward.x - node.x; const dy = toward.y - node.y; const k2 = Math.abs(dx) / (node.width / 2) + Math.abs(dy) / (node.height / 2); if (k2 === 0) return { x: node.x, y: node.y }; return { x: node.x + dx / k2, y: node.y + dy / k2 }; } // src/components/er.js var FS3 = 13; var FIELD_FS = 12; var KEY_FS = 11; var EDGE_FS2 = 11.5; var LH3 = 17; var HEAD_LH = 20; var FIELD_LH = 17; var PAD = 11; var KEY_GAP = 12; var SIGN_W = 14; var MIN_WIDTH = 92; var LOOP_OUT = 34; var LOOP_STEP = 20; var LOOP_END = 18; var LOOP_LABEL = 24; var LOOP_GAP = 6; var DIRS2 = /* @__PURE__ */ new Set(["TB", "LR", "BT", "RL"]); var CARDS = ["1\\.\\.\\*", "0\\.\\.1", "\\*", "1"]; var MARKERS = /* @__PURE__ */ new Set(["PK", "FK", "UK"]); var RELATIONSHIP = new RegExp(`^(\\S+)\\s+(${CARDS.join("|")})\\s*--\\s*(${CARDS.join("|")})\\s+(\\S+)\\s*(?::\\s*(.*))?$`); var MERMAID = /^(\S+)\s+([|o{}]{2})(?:--|\.\.)([|o{}]{2})\s+(\S+)\s*(?::\s*(.*))?$/; var MERMAID_CARDS = { "||": "1", "o|": "0..1", "|o": "0..1", "|{": "1..*", "}|": "1..*", "o{": "*", "}o": "*" }; var er_default = { name: "er", summary: "Entity relationship diagram (automatic layout, crow's-foot ends)", syntax: `\`\`\`er [TB|LR|BT|RL] *User \u2190 a line at column 0 is an entity; * highlights it id PK \u2190 an indented line is a field: name [type] [PK|FK|UK] email string UK Order id PK user_id FK -> User \u2190 FK -> Entity draws the many-to-one relationship (*--1) User 1--* Order: places \u2190 A -- B: label (optional) \`\`\` - Cardinalities are 1, 0..1, * and 1..*. The left end is drawn at the entity on the left, the right end at the entity on the right. - A field's FK -> Entity already draws its relationship, so a relationship line is optional. A relationship line that names the same two entities replaces the implied one and sets the cardinality and the label. Two FK fields that point at the same entity draw two relationships. - The type is optional: \`email UK\` is a field with a key but no type. - A Mermaid line such as USER ||--o{ ORDER is an error that shows the line written for this component. - An entity a field or a relationship names must be written at column 0. - A field that points at its own entity draws a loop: beside the box, or below it in LR and RL. - The default direction is TB (top to bottom). - Change markers show what a plan adds, removes and changes. A line can start with + (added), - (removed) or ~ (changed), followed by a space: an entity line at column 0, a field line after its indentation, or a relationship line: \`\`\`er User ~ email varchar(320) UK + phone string Order + coupon_id FK -> Coupon - legacy_ref string + Coupon id PK - AuditLog id PK + User 1--* Coupon: owns \`\`\` - An entity is marked only by its own line; a marked field does not mark it. The fields of a + or - entity inherit its marker, and a field with another marker is an error. ~ marks a field as changed and does not show the old value. Markers combine with *. - A relationship from an FK field takes the marker of that field; otherwise it is added or removed with an entity at either end. A written relationship line takes its own marker. To change one, remove the old line with - and add the new one with +; ~ on a relationship line is an error. - The Changes view draws added in the theme's ok color, removed faded with struck-through text, changed with a warn outline, and each marked entity with a +, \u2212 or ~ badge. A marked field row gets a tinted band and its sign at the start of the row. A count row (entities, fields and written relationship lines) and a Before / Changes / After switch sit under the diagram: Before and After show the schema as it was and as it will be, plain and without the items that are not in that view. - A line that starts with a marker and a space is always read as a marker.`, example: "```er LR\n*User\n id PK\n email string UK\nOrder\n id PK\n user_id FK -> User\nUser 1--* Order: places\n```", render(text, { args, ui, video, dir: pageDir = "ltr" }) { const model = parseEr(text); const dir = (args.match(/\b(TB|LR|BT|RL)\b/i)?.[1] ?? "TB").toUpperCase(); const html = `${layout3(model, DIRS2.has(dir) ? dir : "TB", ui, pageDir)}`; const states = [...model.entities.values()].flatMap((e) => [e.state, ...e.fields.map((x2) => x2.state)]).concat(model.written.map((rel) => rel.state)); return withDelta(html, states.map((state) => state ?? null), { ui, video }); } }; function parseEr(text) { const entities = /* @__PURE__ */ new Map(); const written = []; let current = null; for (const { raw, text: line, line: n } of contentLines(text)) { const { mark, text: body } = splitMarker(line); const state = markState(mark); if (/^\s/.test(raw)) { if (!current) throw new ComponentError(`"${line}": a field line must follow an entity; write the entity name at the start of its own line first`, n); current.fields.push(settleField(parseField(body, n), mark, current, n)); continue; } const rel = body.match(RELATIONSHIP); if (rel) { if (mark === "~") throw new ComponentError('er: ~ marks an entity or a field, not a relationship. To change a relationship, remove the old line and add the new one: "- A 1--* B" then "+ A 1--1 B"', n); written.push({ from: rel[1], fromCard: rel[2], to: rel[4], toCard: rel[3], label: rel[5]?.trim() ?? "", line: n, ...state && { state } }); current = null; continue; } const mermaid = body.match(MERMAID); if (mermaid && MERMAID_CARDS[mermaid[2]] && MERMAID_CARDS[mermaid[3]]) { throw new ComponentError(`"${line}" is Mermaid syntax; write ${mark && mark !== "~" ? `${mark} ` : ""}${erLineOf(mermaid)}`, n); } if (body.includes("--") || body.includes("{") || body.includes("}")) { throw new ComponentError(`"${line}" is not an entity of this component; write A 1--* B for a relationship, or the entity name at column 0 on its own line`, n); } const hi = body.startsWith("*"); const name = (hi ? body.slice(1) : body).trim(); if (!name) throw new ComponentError("an entity needs a name", n); if (entities.has(name)) throw new ComponentError(`entity "${name}" is written twice`, n); current = { name, hi, fields: [], line: n, ...state && { state } }; entities.set(name, current); } if (!entities.size) throw new ComponentError("an entity relationship diagram needs at least one entity (a line at column 0)", 1); for (const entity of entities.values()) { for (const field of entity.fields) { if (field.ref && !entities.has(field.ref)) throw new ComponentError(`no entity "${field.ref}"; write it at column 0`, field.line); } } for (const rel of written) { for (const name of [rel.from, rel.to]) { if (!entities.has(name)) throw new ComponentError(`no entity "${name}"; write it at column 0`, rel.line); } } checkEnds(entities, written); return { entities, written }; } function checkEnds(entities, written) { const replaced = new Set(written.map((rel) => pairKey(rel.from, rel.to))); const implied = [...entities.values()].flatMap((entity) => entity.fields.filter((field) => field.ref && !replaced.has(pairKey(entity.name, field.ref))).map((field) => ({ from: entity.name, to: field.ref, line: field.line, state: field.state === "changed" ? void 0 : field.state }))); for (const rel of [...implied, ...written]) { const ends = [rel.from, rel.to].map((name) => entities.get(name)); const added = ends.find((e) => e.state === "added"); const removed = ends.find((e) => e.state === "removed"); if (rel.state === "added" && removed) { throw new ComponentError(`er: the + relationship ${rel.from} to ${rel.to} touches the removed entity ${removed.name}, so it would dangle in the After view. Remove the + or keep ${removed.name}`, rel.line); } if (rel.state === "removed" && added) { throw new ComponentError(`er: the - relationship ${rel.from} to ${rel.to} touches the added entity ${added.name}, so it would dangle in the Before view. Remove the - or do not add ${added.name}`, rel.line); } if (!rel.state && added && removed) { throw new ComponentError(`er: the relationship ${rel.from} to ${rel.to} joins the added entity ${added.name} and the removed entity ${removed.name}, so it exists in neither view. Remove it or change an entity marker`, rel.line); } } } function settleField(field, mark, entity, n) { const own = markState(mark); const inherited = entity.state === "added" || entity.state === "removed" ? entity.state : null; if (inherited && own && own !== inherited) { throw new ComponentError(`er: "${mark}" under the ${inherited} entity ${entity.name} contradicts it. The fields of a ${inherited} entity are ${inherited} too; remove the marker or move the field`, n); } const state = inherited ?? own; return state ? { ...field, state } : field; } function parseField(line, n) { const tokens = line.split(/\s+/); const name = tokens.shift(); const arrow = tokens.indexOf("->"); const head = arrow === -1 ? tokens : tokens.slice(0, arrow); const ref = arrow === -1 ? null : tokens[arrow + 1]; if (arrow !== -1 && (ref === void 0 || arrow + 2 !== tokens.length)) { throw new ComponentError(`"${line}": write the entity a field points at as "-> Entity", after the key marker`, n); } if (ref !== null && head.at(-1) !== "FK") { throw new ComponentError(`"${line}": only a FK field points at another entity; mark the field FK`, n); } const at3 = head.findIndex((t) => MARKERS.has(t)); if (at3 !== -1 && at3 !== head.length - 1) throw new ComponentError(`"${line}": "${head[at3]}" must be the last word before "->"`, n); const marker = at3 === -1 ? null : head[at3]; const type = head.slice(0, at3 === -1 ? head.length : at3).join(" "); return { name, type, marker, ref, line: n }; } function erLineOf(mermaid) { const [, from, left, right, to, label] = mermaid; const text = label?.trim(); return `${from} ${MERMAID_CARDS[left]}--${MERMAID_CARDS[right]} ${to}${text ? `: ${text}` : ""}`; } function relationships({ entities, written }) { const ends = (...names) => { const states = names.map((name) => entities.get(name).state); return ["removed", "added"].find((s) => states.includes(s)); }; const withState = (rel, state) => state ? { ...rel, state } : rel; const implied = []; for (const entity of entities.values()) { for (const field of entity.fields) { if (!field.ref) continue; const own = field.state === "changed" ? null : field.state; implied.push(withState({ from: entity.name, fromCard: "*", to: field.ref, toCard: "1", label: "", line: field.line }, own ?? ends(entity.name, field.ref))); } } const replaced = new Set(written.map((rel) => pairKey(rel.from, rel.to))); const lines = written.map((rel) => withState(rel, rel.state ?? ends(rel.from, rel.to) ?? implied.find((x2) => pairKey(x2.from, x2.to) === pairKey(rel.from, rel.to) && x2.state)?.state)); return [...implied.filter((rel) => !replaced.has(pairKey(rel.from, rel.to))), ...lines]; } var pairKey = (a, b) => [a, b].sort().join("\0"); var fieldText = (field) => field.type ? `${field.name} ${field.type}` : field.name; var nameWidth = (entity) => measure(entity.name, FS3, { bold: true }); var rowWidth = (entity, field) => measure(fieldText(field), FIELD_FS, { bold: entity.hi }) + keyWidth(entity, field) + signWidth(entity) + 2 * PAD; var signWidth = (entity) => entity.fields.some((x2) => x2.state) ? SIGN_W : 0; var keyWidth = (entity, field) => field.marker ? measure(field.marker, KEY_FS, { mono: true, bold: entity.hi }) + KEY_GAP : 0; function nodeSize2(entity) { const rows = entity.fields.map((field) => rowWidth(entity, field)); return { width: Math.ceil(Math.max(MIN_WIDTH, nameWidth(entity) + 2 * PAD, ...rows)), height: HEAD_LH + entity.fields.length * FIELD_LH + 2 * PAD }; } function layout3(model, rankdir, ui, pageDir = "ltr") { const { entities } = model; const rels = relationships(model); const loops = rels.filter((rel) => rel.from === rel.to); const g = new $o.graphlib.Graph({ multigraph: true }); g.setGraph({ rankdir, nodesep: 44, ranksep: 62, marginx: 14, marginy: 14 }); g.setDefaultEdgeLabel(() => ({})); const key = new Map([...entities.keys()].map((name, i) => [name, `n${i}`])); const below = rankdir === "LR" || rankdir === "RL"; const room = /* @__PURE__ */ new Map(); if (below) { for (const name of entities.keys()) { const own = loops.filter((rel) => rel.from === name); if (own.length) room.set(name, loopRoom(own)); } } const sizes = /* @__PURE__ */ new Map(); for (const entity of entities.values()) { const size = nodeSize2(entity); sizes.set(entity.name, size); g.setNode(key.get(entity.name), { width: size.width, height: size.height + (room.get(entity.name) ?? 0) }); } const centre = (name) => { const { x: x2, y: y2 } = g.node(key.get(name)); return { x: x2, y: y2 - (room.get(name) ?? 0) / 2 }; }; rels.filter((rel) => rel.from !== rel.to).forEach((rel, i) => { const label2 = rel.label ? { label: rel.label, width: measure(rel.label, EDGE_FS2) + 10, height: 18, labelpos: "c" } : {}; g.setEdge(key.get(rel.from), key.get(rel.to), label2, `e${i}`); }); $o.layout(g); const rtl = pageDir === "rtl"; if (rtl) mirrorLayout(g); const steps = [.../* @__PURE__ */ new Set([...[...entities.values()].map((e) => e.line), ...rels.map((r) => r.line)])].sort((a, b) => a - b); const stepOf = new Map(steps.map((line, i) => [line, i])); const straight = rels.filter((rel) => rel.from !== rel.to).map((rel, i) => { const data = g.edge({ v: key.get(rel.from), w: key.get(rel.to), name: `e${i}` }); const points = data.points.map((p) => ({ ...p })); if (room.has(rel.from)) points[0] = clipToBox(centre(rel.from), sizes.get(rel.from), data.points[1]); if (room.has(rel.to)) points[points.length - 1] = clipToBox(centre(rel.to), sizes.get(rel.to), data.points[data.points.length - 2]); return { rel, data, points }; }); const edgeSvg = straight.map(({ rel, data, points }) => { const label2 = rel.label ? labelSvg(rel.label, data.x, data.y, pageDir) : ""; return `${endsSvg(points, rel)}${label2}`; }); const nodeSvg = [...entities.values()].map((entity) => { const { x: x2, y: y2 } = centre(entity.name); const size = sizes.get(entity.name); return nodeSvgOf(entity, x2, y2, size, stepOf.get(entity.line), pageDir); }); const s = rtl ? -1 : 1; const seen = /* @__PURE__ */ new Map(); const loopSpecs = loops.map((rel) => { const { nth, depth } = seen.get(rel.from) ?? { nth: 0, depth: 0 }; seen.set(rel.from, { nth: nth + 1, depth: depth + LOOP_STEP + (rel.label ? LOOP_LABEL : 0) }); const { x: x2, y: y2 } = centre(rel.from); const size = sizes.get(rel.from); return below ? loopBelow(rel, x2, y2, size, depth, s) : loopBeside(rel, x2, y2, size, nth, s); }); const loopsSvg = loopSpecs.map((spec) => loopSvg(spec, stepOf.get(spec.rel.line), pageDir)); const xs = []; const ys = []; const at3 = (x2, y2) => { xs.push(x2); ys.push(y2); }; for (const entity of entities.values()) { const { x: x2, y: y2 } = centre(entity.name); const size = sizes.get(entity.name); at3(x2 - size.width / 2, y2 - size.height / 2); at3(x2 + size.width / 2, y2 + size.height / 2); } straight.forEach(({ rel, data, points }) => { for (const p of points) at3(p.x, p.y); if (rel.label) { const w = labelWidth2(rel.label); at3(data.x - w / 2, data.y - 9); at3(data.x + w / 2, data.y + 9); } }); for (const { corners } of loopSpecs) corners.forEach(([x2, y2]) => at3(x2, y2)); const margin = 14; const shiftX = margin - Math.min(...xs); const shiftY = margin - Math.min(...ys); const shift = shiftX || shiftY ? ` transform="translate(${f(shiftX)},${f(shiftY)})"` : ""; const width = Math.ceil(Math.max(...xs) - Math.min(...xs)) + 2 * margin; const height = Math.ceil(Math.max(...ys) - Math.min(...ys)) + 2 * margin; const label = diagramLabel(ui, "er", [...entities.keys()].slice(0, 8)); return `${svgOpen(width, height, label, pageDir)}${edgeSvg.join("")}${loopsSvg.join("")}${nodeSvg.join("")}`; } function loopRoom(own) { const steps = own.slice(0, -1).reduce((depth, rel) => depth + LOOP_STEP + (rel.label ? LOOP_LABEL : 0), 0); return LOOP_OUT + steps + (own.at(-1).label ? LOOP_LABEL : 0) + LOOP_GAP; } function clipToBox(centre, size, toward) { const dx = toward.x - centre.x; const dy = toward.y - centre.y; const k2 = Math.max(Math.abs(dx) / (size.width / 2), Math.abs(dy) / (size.height / 2)); if (k2 === 0) return { ...centre }; return { x: centre.x + dx / k2, y: centre.y + dy / k2 }; } function nodeSvgOf(entity, x2, y2, size, step, pageDir) { const left = x2 - size.width / 2; const top2 = y2 - size.height / 2; const [nameX, keyX] = pageDir === "rtl" ? [left + size.width - PAD, left + PAD] : [left + PAD, left + size.width - PAD]; const head = `${esc(svgLine(entity.name, pageDir))}`; const rule = ``; const rtl = pageDir === "rtl"; const shift = (rtl ? -1 : 1) * signWidth(entity); const fields2 = entity.fields.map((field, i) => { const cy = top2 + PAD + HEAD_LH + FIELD_LH * (i + 0.5) + 1; const mark = deltaAttr(field.state); const marker = field.marker ? `${esc(svgLine(field.marker, pageDir))}` : ""; const band = field.state ? `${esc(svgLine(SIGN[field.state], pageDir))}` : ""; return `${band}${esc(svgLine(fieldText(field), pageDir))}${marker}`; }).join(""); const badge = badgeSvg(entity.state, rtl ? left : left + size.width, top2); return `${head}${rule}${fields2}${badge}`; } function loopBeside(rel, x2, y2, size, nth, s) { const edge = x2 + s * size.width / 2; const out = edge + s * LOOP_OUT + s * nth * LOOP_STEP; const [ay, by] = [y2 - LOOP_END / 2, y2 + LOOP_END / 2]; const label = rel.label ? { x: out + s * 6 + s * labelWidth2(rel.label) / 2, y: y2 } : null; return { rel, a: { x: edge, y: ay }, b: { x: edge, y: by }, c: [{ x: out, y: ay }, { x: out, y: by }], away: { x: s, y: 0 }, label, corners: [[out + s * 6 + s * (rel.label ? labelWidth2(rel.label) : 0), by], [out, ay]] }; } function loopBelow(rel, x2, y2, size, depth, s) { const bottom = y2 + size.height / 2; const out = bottom + LOOP_OUT + depth; const [ax, bx] = [x2 - s * LOOP_END / 2, x2 + s * LOOP_END / 2]; const half = Math.max(LOOP_END / 2, rel.label ? labelWidth2(rel.label) / 2 : 0); return { rel, a: { x: ax, y: bottom }, b: { x: bx, y: bottom }, c: [{ x: ax, y: out }, { x: bx, y: out }], away: { x: 0, y: 1 }, label: rel.label ? { x: x2, y: out + 6 + 9 } : null, corners: [[x2 - half, bottom], [x2 + half, out + (rel.label ? 6 + 18 : 0)]] }; } function loopSvg({ rel, a, b, c, away, label }, step, pageDir) { const path = ``; const ends = `${endMark(a, { x: a.x + away.x, y: a.y + away.y }, rel.fromCard)}${endMark(b, { x: b.x + away.x, y: b.y + away.y }, rel.toCard)}`; const text = label ? labelSvg(rel.label, label.x, label.y, pageDir) : ""; return `${path}${ends}${text}`; } function labelWidth2(text) { return measure(text, EDGE_FS2) + 10; } function labelSvg(text, x2, y2, pageDir) { const w = labelWidth2(text); return `${textLines([text], x2, y2, LH3, "", pageDir)}`; } function endsSvg(points, rel) { if (points.length < 2) return ""; return endMark(points.at(-1), points.at(-2), rel.toCard) + endMark(points[0], points[1], rel.fromCard); } var R3 = { back: 12, side: 5, gap: 5 }; function endMark(point, toward, card) { const dx = point.x - toward.x; const dy = point.y - toward.y; const length = Math.hypot(dx, dy) || 1; const ux = dx / length; const uy = dy / length; const px = -uy; const py = ux; const at3 = (back, side) => ({ x: point.x - ux * back + px * side, y: point.y - uy * back + py * side }); const line = (a, b) => ``; const bar = (back) => line(at3(back, -R3.side), at3(back, R3.side)); const foot = (apexBack) => { const apex = at3(apexBack, 0); return [line(at3(0, -R3.side), apex), line(at3(0, 0), apex), line(at3(0, R3.side), apex)].join(""); }; const circle = (back) => { const c = at3(back, 0); return ``; }; const marks = { "1": () => bar(R3.back), "0..1": () => bar(R3.back) + circle(R3.back + R3.gap), "*": () => foot(R3.back), "1..*": () => foot(R3.back) + bar(R3.back + R3.gap) }[card](); return `${marks}`; } // src/components/ask.js var OPTION = /^([*-])\s+(.+)$/; var ask_default = { name: "ask", summary: "A decision the reader makes on the page (collected by Reply)", pageOnly: true, panelOnly: true, syntax: `\`\`\`ask [multi] The question, one sentence * The option you suggest | optional note \u2190 * marks the suggestion; it starts selected - Another option | optional note \`\`\` - The first line is the question. Each option starts with * or -. Write 2 to 6 options. - One choice: exactly one * option. multi lets the reader pick several; * marks the ones that start picked. - Place the ask in the panel whose content the answer changes. The Reply button turns the answers into one reply.`, example: "```ask\nWhich cache do we use?\n* Redis | keeps data after a restart\n- Memcached | simpler, no disk\n```", // The text the STE check reads: options are list items; the note reads as a second clause of the item. lint(text) { return text.split("\n").map((l3) => l3.replace(OPTION, (_2, mark, body) => `- ${fields(body).filter(Boolean).join(": ")}`)).join("\n"); }, render(text, { args, uid, ui = {} }) { const multi = /(^|\s)multi(\s|$)/.test(args); const lines = contentLines(text); const [first, ...rest] = lines; if (!first || OPTION.test(first.text)) throw new ComponentError("ask: the first line is the question", first?.line ?? 1); const options = rest.map(({ text: t, line }) => { const m = t.match(OPTION); if (!m) throw new ComponentError(`ask: "${t}" is not an option; start it with * (suggested) or -`, line); const [label, note2 = ""] = fields(m[2]); if (!label) throw new ComponentError("ask: an option needs a label before |", line); return { label, note: note2, suggested: m[1] === "*", line }; }); if (options.length < 2 || options.length > 6) throw new ComponentError(`ask: write 2 to 6 options, not ${options.length}`, first.line); const suggested = options.filter((o) => o.suggested).length; if (!multi && suggested !== 1) { throw new ComponentError(`ask: mark exactly one option with * as your suggestion (found ${suggested}); add multi to let the reader pick several`, first.line); } const seen = /* @__PURE__ */ new Set(); for (const o of options) { if (seen.has(o.label)) throw new ComponentError(`ask: two options are both "${o.label}"`, o.line); seen.add(o.label); } const id = uid(); const type = multi ? "checkbox" : "radio"; const items = options.map((o) => `${mdInline(o.label)}${o.suggested ? ` ${esc(ui.reply?.suggested ?? "suggested")}` : ""}${o.note ? `${mdInline(o.note)}` : ""}`); return `${mdInline(first.text)}${items.join("")}`; } }; // src/components/index.js var ALL2 = [callout_default, kv_default, timeline_default, annot_default, tree_default, limits_default, sequence_default, flow_default, er_default, ask_default]; var COMPONENTS = new Map(ALL2.map((c) => [c.name, c])); var RAW_LANGS = /* @__PURE__ */ new Set(["html", "svg"]); // src/templates/panel.js function panelHtml(panel, { cols = 3, grid = true, hints = {} } = {}) { const { attrs } = panel; const span = Math.min(Number(attrs.span) || 1, cols); const rows = Number(attrs.rows) || 1; const layout4 = [ grid && span > 1 ? `grid-column: span ${span}` : "", grid && rows > 1 ? `grid-row: span ${rows}` : "" ].filter(Boolean).join("; "); const style = layout4 ? ` style="${layout4}"` : ""; const hinted = Math.floor(Number(hints.span)); const data = grid && hinted >= 1 ? ` data-span="${Math.min(hinted, cols)}"` : ""; const cls = `${span > 1 ? " am-span-wide" : ""}${attrs.bare ? " am-panel--bare" : ""}`; const meta = attrs.meta ? `${esc(attrs.meta)}` : ""; const head = attrs.bare ? "" : `${esc(panel.id)}${esc(panel.title)}${meta} `; return ` ${head}${panel.html} `; } var RESERVED = /* @__PURE__ */ new Set(["template", "theme", "style", "mode", "cols", "title", "subtitle", "lang"]); function headHtml(meta, introHtml, language = {}) { const extras = Object.entries(meta).filter(([k2, v]) => !RESERVED.has(k2) && v !== ""); const names = language.metaKeys ?? {}; const value = (v) => language.dir === "rtl" ? `${esc(v)}` : esc(v); const metaRow = extras.length ? `${extras.map(([k2, v]) => `${esc(names[k2.toLowerCase()] ?? k2)}${value(v)}`).join("")}` : ""; const sub = meta.subtitle ? `${esc(meta.subtitle)}` : ""; const intro = introHtml ? `${introHtml}` : ""; return `${esc(meta.title || "Untitled")}${sub}${metaRow}${intro}`; } // src/templates/sheet.js var ruler = (side, labels) => `${labels.map((l3) => `${l3}`).join("")}`; function fillRows(panels, cols) { const spans = panels.map((p) => Math.max(1, Math.min(Number(p.attrs.span) || 1, cols))); if (panels.some((p) => Number(p.attrs.rows) > 1)) return spans; let used = 0; return spans.map((span, i) => { if (used + span > cols) used = 0; used += span; const next = spans[i + 1]; const fill2 = next === void 0 || used + next > cols ? cols - used : 0; used = fill2 || used === cols ? 0 : used; return span + fill2; }); } var WIDE_TABLE_COLS = 4; var TABLE_COLS_PER_SPAN = 2; var DIAGRAM_PX_PER_SPAN = 560; var CELL_SEP = /(? b.type === "md").flatMap((b) => { const lines = b.text.split("\n").map((l3) => l3.trim()); return lines.flatMap((l3, i) => l3.startsWith("|") && DELIMITER_ROW.test(lines[i + 1] ?? "") ? [l3.split(CELL_SEP).length - 2] : []); }); return Math.max(0, ...counts); } var svgWidth = (html) => Math.max(0, ...[...html.matchAll(/]*?\swidth="(\d+(?:\.\d+)?)"/g)].map((m) => Number(m[1]))); function minSpan(panel) { const tableCols = tableColumns(panel.blocks ?? []); const byTable = tableCols >= WIDE_TABLE_COLS ? Math.ceil(tableCols / TABLE_COLS_PER_SPAN) : 1; const byDiagram = Math.ceil(svgWidth(panel.html ?? "") / DIAGRAM_PX_PER_SPAN); return Math.max(1, byTable, byDiagram); } function sheet({ meta, introHtml, panels, language }) { const cols = Math.max(1, Math.min(Number(meta.cols) || 3, 12)); const sized = panels.map((p) => p.attrs.span === void 0 && minSpan(p) > 1 ? { ...p, attrs: { ...p.attrs, span: Math.min(minSpan(p), cols) } } : p); const spans = fillRows(sized, cols); const placed = sized.map((p, i) => ({ ...p, attrs: { ...p.attrs, span: spans[i] } })); const nums = Array.from({ length: 8 }, (_2, i) => i + 1); const letters = ["A", "B", "C", "D"]; return ` ${headHtml(meta, introHtml, language)} ${ruler("top", nums)}${ruler("bottom", nums)}${ruler("left", letters)}${ruler("right", letters)} ${placed.map((p, i) => panelHtml(p, { cols, hints: { span: panels[i].attrs.span } })).join("\n")} `; } // src/templates/doc.js function doc({ meta, introHtml, panels, ui, language }) { const withToc = panels.length >= 3; const toc = withToc ? `${panels.map((p) => `${esc(p.id)} \xB7 ${esc(p.title)}`).join("")}` : ""; return ` ${headHtml(meta, introHtml, language)} ${toc} ${panels.map((p) => panelHtml(p, { grid: false })).join("\n")} `; } // src/templates/index.js var TEMPLATES = { sheet, doc }; // src/themes/index.js var block = (selector, vars) => `${selector} { ${Object.entries(vars).map(([k2, v]) => ` ${k2}: ${v};`).join("\n")} }`; function tokenCss(sel, { common = {}, light = {}, dark = {} }) { const parts = [block(`${sel}, ${sel}[data-mode="light"]`, { ...common, ...light })]; if (Object.keys(dark).length) { parts.push(block(`${sel}[data-mode="dark"]`, dark), `@media (prefers-color-scheme: dark) { ${block(`${sel}[data-mode="auto"]`, dark)} }`); } return parts.join("\n"); } var pageSel = (t) => `html[data-theme="${t.name}"]`; var videoSel = (t) => `html[data-video][data-theme="${t.name}"]`; var scoped = (css, sel) => css.replace(/&/g, sel); var languageFontCss = () => fontLanguages().map((l3) => block(langSelector(l3, "html", "[data-theme][data-mode]"), { "--font-sans": l3.fonts.sans })); var ownLanguageFont = (t) => fontLanguages().map((l3) => block(langSelector(l3, "html", `[data-theme="${t.name}"][data-mode]`), { "--font-sans": t.tokens.common["--font-sans"] })); function pageCss(list = themes("page"), { diff = false, delta = false, rtl = false, math: math2 = false } = {}) { const decorations = list.filter((t) => t.css).map((t) => scoped(t.css, pageSel(t))); const ownFonts = list.filter((t) => t.ownFont).flatMap(ownLanguageFont); return [list.map((t) => tokenCss(pageSel(t), t.tokens)).join("\n\n"), ...languageFontCss(), ...ownFonts, BASE_CSS, ...math2 ? [MATH_CSS] : [], ...diff ? [DIFF_CSS] : [], ...delta ? [DELTA_CSS] : [], ...rtl ? [RTL_CSS] : [], ...decorations].join("\n\n"); } function videoCss(list = themes("video"), { diff = false, delta = false, rtl = false } = {}) { const parts = list.filter((t) => t.video).flatMap((t) => [ t.video.tokens ? tokenCss(videoSel(t), t.video.tokens) : "", t.video.css ? scoped(t.video.css, videoSel(t)) : "", rtl && t.video.rtlCss ? scoped(t.video.rtlCss, videoSel(t)) : "" ]).filter(Boolean); return [pageCss(list.filter((t) => t.scope.includes("page")), { diff, delta, rtl }), VIDEO_CSS, ...parts].join("\n\n"); } // src/lint/wordlist.en.js var EN_WORDS2 = Object.freeze({ "utilize": "use", "utilise": "use", "utilization": "use", "commence": "start", "commenced": "started", "prior to": "before", "in order to": "to", "approximately": "about", "ensure": "make sure", "replenish": "fill", "terminate": "stop", "facilitate": "help", "leverage": "use", "numerous": "many", "subsequently": "then", "endeavor": "try", "ascertain": "find", "sufficient": "enough", "demonstrate": "show", "assist": "help", "obtain": "get", "initiate": "start", "modify": "change", "possess": "have", "purchase": "buy", "in the event that": "if", "due to the fact that": "because", "at this point in time": "now", "a number of": "some", "with regard to": "about", "in addition": "also" }); // src/lint/wordlist.zh.js var ZH_LIGHT_VERBS = Object.freeze([ { re: /进行(?![中时])了?([一-龥]{2})/g, label: "\u8FDB\u884C" }, { re: /(?:加以|予以)([一-龥]{2})/g, label: "\u52A0\u4EE5/\u4E88\u4EE5" }, { re: /[做作]出了?([一-龥]{2})/g, label: "\u505A\u51FA" } ]); var ZH_CLICHES = Object.freeze([ "\u8D4B\u80FD", "\u6293\u624B", "\u95ED\u73AF", "\u6253\u901A", "\u5168\u65B9\u4F4D", "\u591A\u7EF4\u5EA6", "\u6DF1\u5EA6\u878D\u5408", "\u663E\u8457\u63D0\u5347", "\u81F3\u5173\u91CD\u8981", "\u4E0D\u53EF\u6216\u7F3A", "\u4E0E\u6B64\u540C\u65F6", "\u7EFC\u4E0A\u6240\u8FF0", "\u503C\u5F97\u6CE8\u610F\u7684\u662F", "\u603B\u800C\u8A00\u4E4B", "\u4F17\u6240\u5468\u77E5", "\u6BCB\u5EB8\u7F6E\u7591", "\u4E00\u7AD9\u5F0F", "\u5E95\u5C42\u903B\u8F91", "\u9897\u7C92\u5EA6", "\u65B9\u6CD5\u8BBA" ]); var UNIT = String.raw`(?:个|次|秒|天|分钟|小时|倍|字|条|项|人|行|位|%|MB|GB|KB|TB|ms)?`; var ZH_WORDS = Object.freeze([ // typos { re: /登陆/g, suggestion: "\u767B\u5F55" }, { re: /帐号/g, suggestion: "\u8D26\u53F7" }, { re: /阀值/g, suggestion: "\u9608\u503C" }, { re: /布署/g, suggestion: "\u90E8\u7F72" }, // quantities without a number { re: /尽快/g, suggestion: "give a concrete deadline" }, { re: /若干/g, suggestion: "write the number" }, { re: /大概|大约/g, suggestion: 'use "\u7EA6" in descriptions, a value in steps' }, { re: /多次/g, suggestion: "write the count" }, // 以上/以下/以内 after a number: it is unclear whether the endpoint is included { re: new RegExp(String.raw`(?<=\d\s*${UNIT}\s*)(?:以上|以下)`, "g"), suggestion: "name the endpoint: \u5927\u4E8E / \u4E0D\u5C0F\u4E8E, \u5C0F\u4E8E / \u4E0D\u5927\u4E8E" }, { re: /(?<=\d[^。，；\n]{0,6})以内/g, suggestion: "\u4E0D\u8D85\u8FC7" }, // one meaning, one word { re: /单击|点按/g, suggestion: "\u70B9\u51FB" }, { re: /键入/g, suggestion: "\u8F93\u5165" }, { re: /登出/g, suggestion: "\u9000\u51FA\u767B\u5F55" }, { re: /入参/g, suggestion: "\u53C2\u6570" }, { re: /出参/g, suggestion: "\u8FD4\u56DE\u503C" }, { re: /缺省/g, suggestion: "\u9ED8\u8BA4" } ]); // src/lint/ste.js var LIMITS = { zh: { procedural: 35, descriptive: 45 }, en: { procedural: 20, descriptive: 25 } }; var MAX_SENTENCES = 6; var ABBR = /\b(e\.g|i\.e|etc|vs|cf|approx|Fig|No)\./gi; var PASSIVE = /\b(?:am|is|are|was|were|be|been|being)\s+(?:\w+ly\s+)?(\w+ed|known|done|made|given|taken|seen|written|built|shown|sent|kept|held|found|set|put|run|begun|chosen|driven|broken)\b/i; var EN_RE = Object.entries(EN_WORDS2).sort((a, b) => b[0].length - a[0].length).map(([word, suggestion]) => ({ re: new RegExp(`\\b${word.replace(/ /g, "\\s+")}\\b`, "gi"), word, suggestion })); function splitSentences(text) { const masked = text.replace(ABBR, (m) => m.replace(/\./g, "\0")); const parts = masked.match(/[^。！？；!?;]+?(?:[。！？；!?;]+|\.(?=\s|$)|$)|[^.]+?\.(?=\s|$)/g) ?? []; return parts.map((s) => s.replace(/\u0000/g, ".").trim()).filter(Boolean); } function sentenceLength(sentence) { const cjk = [...sentence].filter(isCJK).filter((c) => !/[，。！？；：、（）「」『』“”‘’《》]/.test(c)).length; const words3 = sentence.match(/[A-Za-z0-9][\w'’-]*/g)?.length ?? 0; return cjk >= 4 || cjk > words3 ? { lang: "zh", count: cjk + words3 } : { lang: "en", count: words3 }; } var CJK_TEXT = /[\p{Script=Han}\p{Script=Hiragana}\p{Script=Katakana}]/gu; function neutralLength(sentence) { const han = sentence.match(CJK_TEXT)?.length ?? 0; const rest = sentence.replace(CJK_TEXT, " "); const words3 = countWords(rest); return han >= 4 || han > words3 ? { lang: "zh", count: han + words3 } : { lang: "en", count: words3 }; } var RULE_LANGUAGES = /* @__PURE__ */ new Set(["zh", "en", "ja"]); function ruleFamily(language) { if (!language) return "auto"; const base = language.tag.split("-")[0]; if (!RULE_LANGUAGES.has(base)) return "neutral"; return language.declared ? base : "auto"; } function formatWarning(w) { return `L${w.line} [${w.rule}] ${w.message}${w.suggestion ? ` \u2192 ${w.suggestion}` : ""}`; } function lintDoc(doc2, language) { const warnings = []; const family = ruleFamily(language); const blocks = [...doc2.intro, ...doc2.panels.flatMap((p) => p.blocks)]; for (const b of blocks) { if (b.type === "md") lintMarkdown(b.text, b.line, warnings, family); else if (b.lang === "callout") lintMarkdown(b.text, b.line + 1, warnings, family); else if (COMPONENTS.get(b.lang)?.lint) lintMarkdown(COMPONENTS.get(b.lang).lint(b.text), b.line + 1, warnings, family); } return warnings; } function clean(text) { return stripMath(text.replace(/~~[^~]*~~/g, "").replace(/`[^`]*`/g, "")).replace(/!\[([^\]]*)\]\([^)]*\)/g, "$1").replace(/\[([^\]]*)\]\([^)]*\)/g, "$1").replace(/<[^>]+>/g, "").replace(/[*_]{1,3}/g, ""); } function lintMarkdown(text, startLine, out, family) { let para = null; const flush = () => { if (para && para.count > MAX_SENTENCES) { out.push({ line: para.line, rule: "paragraph-length", message: `paragraph has ${para.count} sentences (max ${MAX_SENTENCES})` }); } para = null; }; let inHtml = false; let inMath = false; text.split("\n").forEach((raw, i) => { const line = startLine + i; const t = raw.trim(); if (/^<(div|svg|table|details|figure)/i.test(t)) inHtml = true; if (inHtml) { if (/<\/(div|svg|table|details|figure)>\s*$/i.test(t)) inHtml = false; return flush(); } if (inMath) { if (!t || closesDisplay(t)) inMath = false; return flush(); } if (opensDisplay(raw) || isDisplayLine(raw)) { inMath = opensDisplay(raw); return flush(); } if (!t || /^#{1,6}\s/.test(t) || /^[-*_]{3,}$/.test(t)) return flush(); if (t.startsWith("|")) { flush(); if (/^\|?[\s:|-]+\|?$/.test(t)) return; const cells = t.replace(/^\||\|$/g, "").split("|").map((c) => c.trim()); if (cells.some((c) => /^(no|✗|✘)(\s|$)/.test(c))) return; cells.forEach((c) => checkUnit(clean(c.replace(/^(ok|warn|✓|✔|⚠)(\s|$)/, "")), line, "descriptive", out, family)); return; } const list = t.match(/^(?:([-*+])|(\d+)[.)])\s+(.*)$/); if (list) { flush(); checkUnit(clean(list[3]), line, list[2] ? "procedural" : "descriptive", out, family); return; } const body = clean(t.replace(/^>\s*/, "")); const n = checkUnit(body, line, "descriptive", out, family); if (!para) para = { line, count: 0 }; para.count += n; }); flush(); } function checkUnit(text, line, kind2, out, family) { const sentences = splitSentences(text); const zhFamily = family === "auto" || family === "zh"; const ja = family === "ja" || zhFamily && isJapanese(text); const chineseRules = zhFamily && !ja; const englishRules = family !== "neutral"; for (const s of sentences) { const { lang, count: count2 } = family === "neutral" ? neutralLength(s) : sentenceLength(s); const limit = LIMITS[lang][kind2]; if (count2 > limit) { const unit = lang === "zh" ? "characters" : "words"; const preview2 = s.length > 24 ? `${s.slice(0, 24)}\u2026` : s; out.push({ line, rule: "sentence-length", message: `${kind2 === "procedural" ? "step" : "sentence"} has ${count2} ${unit} (max ${limit}): "${preview2}"` }); } if (englishRules && lang === "en" && PASSIVE.test(s)) { out.push({ line, rule: "passive", message: `possible passive voice: "${s.match(PASSIVE)[0]}"`, suggestion: "use active voice" }); } } const lexical = [ ...(englishRules ? EN_RE : []).flatMap(({ re: re3, suggestion }) => [...text.matchAll(re3)].map((m) => ({ index: m.index, rule: "word", message: `not recommended: "${m[0]}"`, suggestion }))), ...(chineseRules ? ZH_LIGHT_VERBS : []).flatMap(({ re: re3, label }) => [...text.matchAll(re3)].map((m) => ({ index: m.index, rule: "word", message: `light verb "${m[0]}" (${label})`, suggestion: `use "${m[1]}"` }))), ...(chineseRules ? ZH_WORDS : []).flatMap(({ re: re3, suggestion }) => [...text.matchAll(re3)].map((m) => ({ index: m.index, rule: "word", message: `not recommended: "${m[0]}"`, suggestion }))) ]; out.push(...lexical.sort((a, b) => a.index - b.index).map(({ index, ...w }) => ({ line, ...w }))); for (const s of sentences) { if (!zhFamily || isJapanese(s)) continue; if ((s.match(/的/g) ?? []).length >= 3) out.push({ line, rule: "de-chain", message: `chained "\u7684": ${s}`, suggestion: 'split the sentence or remove extra "\u7684"' }); } for (const c of chineseRules ? ZH_CLICHES : []) { if (text.includes(c)) out.push({ line, rule: "cliche", message: `clich\xE9 "${c}"`, suggestion: "delete it or state a concrete fact" }); } return sentences.length; } // src/page.js var SOURCE_OPEN = ']*>([\\s\\S]*?)<\\/textarea>`); var AUDIO_OPEN = '<audio id="amv-audio"'; function rootTag({ lang, dir, theme, mode, style, voice, video = false }) { return `<html lang="${lang}"${dirAttr(dir)} data-theme="${esc(theme)}" data-mode="${esc(mode)}" data-style="${esc(style)}"${voice ? ` data-voice="${esc(voice)}"` : ""}${video ? " data-video" : ""}>`; } function rootCarrierAttrs({ lang, dir, theme, mode, style }) { return ` data-am-root-lang="${lang}"${dir === "rtl" ? ' data-am-root-dir="rtl"' : ""} data-am-root-theme="${esc(theme)}" data-am-root-mode="${esc(mode)}" data-am-root-style="${esc(style)}"`; } var dirAttr = (dir) => dir === "rtl" ? ' dir="rtl"' : ""; function audioTag(wav2) { return `${AUDIO_OPEN} preload="auto" src="data:audio/wav;base64,${wav2.toString("base64")}"></audio>`; } function sourceTag(source) { return `${SOURCE_OPEN} hidden readonly aria-hidden="true">${esc(source)}`; } function readPage(html) { const s = String(html); const root = s.match(/]*>/)?.[0] ?? ""; const attr = (name) => root.match(new RegExp(`\\s${name}="([^"]+)"`))?.[1]; const video = /\sdata-video\b/.test(root); const open = s.lastIndexOf(SOURCE_OPEN); const m = open === -1 ? null : s.slice(open).match(SOURCE_RE); const before = open === -1 ? "" : s.slice(0, open).trimEnd(); return { source: m ? unescapeHtml(m[1]) : null, video, // A in the body does not count; the template's always comes before the body. template: video ? "video" : s.match(/") && before.lastIndexOf(AUDIO_OPEN) > before.lastIndexOf("").replace(/"/g, '"').replace(/'/g, "'").replace(/&/g, "&"); } // src/han-forms.js var PAIRS = "\u8FD9\u9019 \u4E2A\u500B \u4EEC\u5011 \u8BF4\u8AAA \u56FD\u570B \u4E3A\u70BA \u6765\u4F86 \u65F6\u6642 \u4F1A\u6703 \u8FC7\u904E \u5BF9\u5C0D \u5B66\u5B78 \u8FD8\u9084 \u6CA1\u6C92 \u6837\u6A23 \u5F00\u958B \u95E8\u9580 \u95EE\u554F \u95F4\u9593 \u70B9\u9EDE \u73B0\u73FE \u79CD\u7A2E \u7ECF\u7D93 \u52A8\u52D5 \u5B9E\u5BE6 \u673A\u6A5F \u5173\u95DC \u4E1A\u696D \u4E0E\u8207 \u65E0\u7121 \u7535\u96FB \u4E66\u66F8 \u9A6C\u99AC \u8F66\u8ECA \u89C1\u898B \u4E70\u8CB7 \u5356\u8CE3 \u8BFB\u8B80 \u8BED\u8A9E \u8BDD\u8A71 \u8BF7\u8ACB \u8BA9\u8B93 \u8BA4\u8A8D \u5E94\u61C9 \u5F53\u7576 \u603B\u7E3D \u5C06\u5C07 \u4F53\u9AD4 \u534E\u83EF \u58F0\u8072 \u542C\u807D \u89C2\u89C0 \u89C9\u89BA \u8BB0\u8A18 \u8BBE\u8A2D \u8BA1\u8A08 \u8BBA\u8AD6 \u8BAE\u8B70 \u8BB8\u8A31 \u8BC1\u8B49 \u8BC6\u8B58 \u8C03\u8ABF \u8BD5\u8A66 \u8BE5\u8A72 \u8BE6\u8A73 \u8BEF\u8AA4 \u8C08\u8AC7 \u8C22\u8B1D \u8C01\u8AB0 \u8BFE\u8AB2 \u8D1F\u8CA0 \u8D23\u8CAC \u8D35\u8CB4 \u8D44\u8CC7 \u8D39\u8CBB \u8D5B\u8CFD \u8D22\u8CA1 \u8D2D\u8CFC \u8D27\u8CA8 \u8D38\u8CBF \u8D28\u8CEA \u94B1\u9322 \u94F6\u9280 \u94C1\u9435 \u7F51\u7DB2 \u9875\u9801 \u7EA7\u7D1A \u7EBF\u7DDA \u7C7B\u985E \u6570\u6578 \u636E\u64DA \u5E93\u5EAB \u6237\u6236 \u52A1\u52D9 \u533A\u5340 \u4E1C\u6771 \u4E50\u6A02 \u4EA7\u7522 \u4EB2\u89AA \u513F\u5152 \u529E\u8FA6 \u5174\u8208 \u519B\u8ECD \u519C\u8FB2 \u51B5\u6CC1 \u5218\u5289 \u521B\u5275 \u5267\u5287 \u5355\u55AE \u53CC\u96D9 \u53F7\u865F \u5458\u54E1 \u56ED\u5712 \u56F4\u570D \u56FE\u5716 \u5706\u5713 \u573A\u5834 \u5757\u584A \u574F\u58DE \u5904\u8655 \u5907\u5099 \u5934\u982D \u5939\u593E \u594B\u596E \u5987\u5A66 \u5B59\u5B6B \u5B81\u5BE7 \u5B9D\u5BF6 \u5BA1\u5BE9 \u5C42\u5C64 \u5C5E\u5C6C \u5C81\u6B72 \u5E08\u5E2B \u5E26\u5E36 \u5E2E\u5E6B \u5E7F\u5EE3 \u5F02\u7570 \u5F20\u5F35 \u5F3A\u5F37 \u5F55\u9304 \u5F52\u6B78 \u5F7B\u5FB9 \u5F84\u5F91 \u60AC\u61F8 \u60CA\u9A5A \u6218\u6230 \u62A4\u8B77 \u62A5\u5831 \u62E9\u64C7 \u62C5\u64D4 \u62E5\u64C1 \u62DF\u64EC \u6362\u63DB \u635F\u640D \u654C\u6575 \u65AD\u65B7 \u65E7\u820A \u663E\u986F \u6653\u66C9 \u6682\u66AB \u672F\u8853 \u6742\u96DC \u6781\u6975 \u6784\u69CB \u6807\u6A19 \u680F\u6B04 \u6811\u6A39 \u6863\u6A94 \u6865\u6A4B \u68C0\u6AA2 \u697C\u6A13 \u6B22\u6B61 \u6BD5\u7562 \u6C14\u6C23 \u6C49\u6F22 \u6D4E\u6FDF \u6D4F\u700F \u6D4B\u6E2C \u6E7E\u7063 \u6EE1\u6EFF \u706D\u6EC5 \u706F\u71C8 \u7231\u611B \u72B6\u72C0 \u72EC\u7368 \u73AF\u74B0 \u753B\u756B \u7597\u7642 \u76D8\u76E4 \u7801\u78BC \u786E\u78BA \u79BB\u96E2 \u79EF\u7A4D \u79F0\u7A31 \u7A77\u7AAE \u7ADE\u7AF6 \u7B14\u7B46 \u7B80\u7C21 \u7CAE\u7CE7 \u7D27\u7DCA \u7EA2\u7D05 \u7EA6\u7D04 \u7EAA\u7D00 \u7EAF\u7D14 \u7EB8\u7D19 \u7EC4\u7D44 \u7EC6\u7D30 \u7EC7\u7E54 \u7EC8\u7D42 \u7ED3\u7D50 \u7ED9\u7D66 \u7EDC\u7D61 \u7EDF\u7D71 \u7EE7\u7E7C \u7EED\u7E8C \u7EF4\u7DAD \u7EFC\u7D9C \u7EFF\u7DA0 \u7F13\u7DE9 \u7F16\u7DE8 \u7F57\u7F85 \u4E60\u7FD2 \u8054\u806F \u804C\u8077 \u8111\u8166 \u8138\u81C9 \u8282\u7BC0 \u8425\u71DF \u84DD\u85CD \u8651\u616E \u867D\u96D6 \u8865\u88DC \u88C5\u88DD \u89C8\u89BD \u89C4\u898F \u89C6\u8996 \u89E6\u89F8 \u8BA2\u8A02 \u8BA8\u8A0E \u8BAD\u8A13 \u8BB2\u8B1B \u8BBF\u8A2A \u8BC4\u8A55 \u8BCD\u8A5E \u8BD1\u8B6F \u8BC9\u8A34 \u8F93\u8F38 \u8F91\u8F2F \u8FB9\u908A \u8FBE\u9054 \u8FC1\u9077 \u8FD0\u904B \u8FDC\u9060 \u8FDE\u9023 \u8FDB\u9032 \u9009\u9078 \u9012\u905E \u9002\u9069 \u903B\u908F \u9057\u907A \u90AE\u90F5 \u94FA\u92EA \u94FE\u93C8 \u9500\u92B7 \u9501\u9396 \u9519\u932F \u952E\u9375 \u955C\u93E1 \u957F\u9577 \u95EA\u9583 \u95ED\u9589 \u95FB\u805E \u9605\u95B1 \u961F\u968A \u9636\u968E \u9645\u969B \u9690\u96B1 \u96BE\u96E3 \u9759\u975C \u9876\u9802 \u9879\u9805 \u987A\u9806 \u987B\u9808 \u9898\u984C \u989D\u984D \u98CE\u98A8 \u98DE\u98DB \u996D\u98EF \u9986\u9928 \u9A8C\u9A57 \u9A97\u9A19 \u9C7C\u9B5A \u9E1F\u9CE5 \u9E21\u96DE \u9EA6\u9EA5 \u9F50\u9F4A \u9F7F\u9F52 \u9F99\u9F8D".split(" "); var SIMPLIFIED_ONLY = PAIRS.map((pair) => [...pair][0]).join(""); var TRADITIONAL_ONLY = PAIRS.map((pair) => [...pair][1]).join(""); // src/language.js var CJK_PER_LATIN = 3; var SCRIPT_LANGUAGES = [ [new RegExp("\\p{Script=Thai}", "u"), "th"], [new RegExp("\\p{Script=Hebrew}", "u"), "he"], [new RegExp("\\p{Script=Greek}", "u"), "el"], [new RegExp("\\p{Script=Arabic}", "u"), "ar"], [new RegExp("\\p{Script=Cyrillic}", "u"), "ru"] ]; var HANGUL = new RegExp("\\p{Script=Hangul}", "u"); var SIMPLIFIED = new Set(SIMPLIFIED_ONLY); var TRADITIONAL = new Set(TRADITIONAL_ONLY); function hanLanguage(text) { let simplified = 0; let traditional = 0; for (const ch of text) { if (SIMPLIFIED.has(ch)) simplified++; else if (TRADITIONAL.has(ch)) traditional++; } return traditional > simplified ? "zh-Hant" : "zh"; } function detectLang(text) { const draft = String(text); let cjk = 0; let hangul = 0; let latin = 0; const others = /* @__PURE__ */ new Map(); for (const ch of draft) { if (isCJK(ch)) { cjk++; if (HANGUL.test(ch)) hangul++; } else if (/[a-z]/i.test(ch)) { latin++; } else { const script = SCRIPT_LANGUAGES.find(([re3]) => re3.test(ch)); if (script) others.set(script[1], (others.get(script[1]) ?? 0) + 1); } } const otherTotal = [...others.values()].reduce((sum2, n) => sum2 + n, 0); if ((cjk + otherTotal) * CJK_PER_LATIN < latin) return "en"; const [topTag, topCount] = [...others].sort((a, b) => b[1] - a[1])[0] ?? [null, 0]; if (topCount > cjk) return topTag; if (hangul * 2 > cjk) return "ko"; return isJapanese(draft) ? "ja" : hanLanguage(draft); } function canonicalTag(value) { if (typeof value !== "string") return null; const text = value.trim().replace(/_/g, "-"); if (!text) return null; try { const tag = Intl.getCanonicalLocales(text)[0]; const { language } = new Intl.Locale(tag); return !language || language === "und" ? null : tag; } catch { return null; } } var baseLanguage = (tag) => new Intl.Locale(tag).language; function voiceHints(tag) { const locale = new Intl.Locale(tag).maximize(); return findLanguage(locale.language, locale.script)?.voice ?? null; } function directionOf(locale) { const info = typeof locale.getTextInfo === "function" ? locale.getTextInfo() : locale.textInfo; return info?.direction === "rtl" ? "rtl" : "ltr"; } function resolveLanguage({ declared, previous, text = "" }) { const declaredTag = canonicalTag(declared); const tag = declaredTag ?? canonicalTag(previous) ?? detectLang(text); const locale = new Intl.Locale(tag).maximize(); const entry = findLanguage(locale.language, locale.script); const labels = entry ?? FALLBACK; return Object.freeze({ tag, declared: declaredTag !== null, htmlLang: tag === "zh" ? "zh-CN" : tag, script: locale.script, dir: directionOf(locale), supported: Boolean(entry), labelKey: labels.id, ui: labels.deltaCounts ? { ...labels.ui, delta: { ...labels.ui.delta, counts: labels.deltaCounts } } : labels.ui, videoUi: labels.videoUi, metaKeys: labels.metaKeys ?? {}, dateOrder: labels.dateOrder ?? "ymd" }); } // src/images.js import { readFileSync as readFileSync2, statSync } from "node:fs"; import { homedir } from "node:os"; import { extname, isAbsolute, resolve } from "node:path"; import { fileURLToPath } from "node:url"; var TYPES = { ".png": "image/png", ".jpg": "image/jpeg", ".jpeg": "image/jpeg", ".gif": "image/gif", ".webp": "image/webp", ".avif": "image/avif", ".svg": "image/svg+xml" }; var MAX_IMAGE_BYTES = 5 * 1024 * 1024; var IMAGE_EXAMPLE = ""; var NOT_LOCAL = /^(?:(?!file:)[a-z][a-z0-9+.-]+:|\/\/|#)/i; var IMG_SRC = /]*?)\bsrc="([^"]*)"/g; var TEXT_IMAGE = /!\[[^\]\n]*\](?:\([^)\n]*\)|\[[^\]\n]*\])/; var EMBEDDED = /]*?\bdata-am-src="([^"]*)" src="(data:[^"]*)"/g; var ImageError = class extends Error { constructor(message, ref) { super(message); this.name = "ImageError"; this.ref = ref; } }; function decodeRef(src) { const ref = src.replace(/&/g, "&"); try { return decodeURI(ref); } catch { return ref; } } function localPath(ref, baseDir) { if (ref.startsWith("file:")) return fileURLToPath(ref); if (ref.startsWith("~/")) return resolve(homedir(), ref.slice(2)); return resolve(baseDir, ref); } function readImage(ref, baseDir) { const path = localPath(ref, baseDir); const type = TYPES[extname(path).toLowerCase()]; if (!type) throw new ImageError(`"${ref}" is not an image file; use ${Object.keys(TYPES).join(" ")}`, ref); let size; try { size = statSync(path).size; } catch { return null; } if (size > MAX_IMAGE_BYTES) { throw new ImageError(`"${ref}" is ${(size / 1048576).toFixed(1)} MB; the limit is ${MAX_IMAGE_BYTES / 1048576} MB. Shrink or crop the image first`, ref); } return `data:${type};base64,${readFileSync2(path).toString("base64")}`; } function assertNoImageText(html) { const left = html.replace(/<(code|pre)\b[\s\S]*?<\/\1>/g, "").replace(/<[^>]*>/g, "").match(TEXT_IMAGE); if (left) throw new ImageError(`"${left[0]}" was not read as an image. Check the path: write a space as %20, or put the path in < and >`, left[0]); } function inlineImages(html, { baseDir = process.cwd(), known = /* @__PURE__ */ new Map(), checkText = true } = {}) { if (checkText) assertNoImageText(html); return html.replace(IMG_SRC, (whole, before, src) => { const ref = decodeRef(src); if (NOT_LOCAL.test(ref)) return whole; const uri = readImage(ref, baseDir) ?? known.get(ref); if (!uri) throw new ImageError(`Image not found: "${ref}"${isAbsolute(ref) ? "" : ` (relative paths are read from ${baseDir})`}. Use the absolute path of an existing file`, ref); return ` [decodeRef(src), uri])); } // src/code.js import { readFileSync as readFileSync3, statSync as statSync2 } from "node:fs"; import { basename as basename2, extname as extname2, isAbsolute as isAbsolute2, relative, resolve as resolve2, sep } from "node:path"; // src/diff.js var DiffError = class extends Error { constructor(message, line) { super(message); this.name = "DiffError"; this.line = line; } }; var DIFF_EXAMPLE = "```diff file=src/code.js\n@@ -60,3 +60,3 @@\n export function parseCodeArgs(args) {\n- const attrs = parseAttrs(args);\n+ const attrs = parseAttrs(args, { diff: true });\n const opts = {};\n```"; var HUNK = /^@@ -(\d+)(?:,(\d+))? \+(\d+)(?:,(\d+))? @@/; var GIT_HEAD = /^(?:diff --git |index |new file mode |deleted file mode |old mode |new mode |similarity index |rename (?:from|to) )/; var ELLIPSIS = /^ ?(?:…|\.\.\.)\s*$/; var KIND = { "+": "add", "-": "del", " ": "ctx" }; var headPath = (line) => { const path = line.slice(4).split(" ")[0].trim().replace(/^[ab]\//, ""); return path === "/dev/null" ? "" : path; }; function parseDiff(text, start) { const lines = text.split("\n"); while (lines.length && lines[lines.length - 1] === "") lines.pop(); const numbered = start !== void 0 || lines.some((l3) => HUNK.test(l3)); const rows = []; const warnings = []; const newLines = /* @__PURE__ */ new Set(); let title = ""; let from = ""; let o = start ?? 1; let n = start ?? 1; let hunk = null; let started = false; const closeHunk = () => { if (hunk && (hunk.got.o !== hunk.want.o || hunk.got.n !== hunk.want.n)) { warnings.push({ rule: "diff-counts", message: `the hunk "${hunk.header}" has ${hunk.got.o} old and ${hunk.got.n} new lines, but its header says ${hunk.want.o} and ${hunk.want.n}. Fix the numbers in the @@ line, or add the missing lines` }); } hunk = null; }; const preamble = () => !hunk && !started || hunk && hunk.got.o >= hunk.want.o && hunk.got.n >= hunk.want.n; lines.forEach((line, i) => { const fail = (message) => { throw new DiffError(message, i + 1); }; const meta = () => rows.push({ kind: "meta", text: line }); if (line.startsWith("diff --git ")) { closeHunk(); started = false; from = ""; return meta(); } if (GIT_HEAD.test(line) || line.startsWith("\\")) return meta(); if (preamble() && line.startsWith("--- ") && lines[i + 1]?.startsWith("+++ ")) { from = headPath(line); return meta(); } if (preamble() && line.startsWith("+++ ") && rows[rows.length - 1]?.text.startsWith("--- ")) { title ||= headPath(line) || from; return meta(); } const m = line.match(HUNK); if (m) { closeHunk(); o = Number(m[1]); n = Number(m[3]); hunk = { header: m[0], want: { o: m[2] === void 0 ? 1 : Number(m[2]), n: m[4] === void 0 ? 1 : Number(m[4]) }, got: { o: 0, n: 0 } }; return rows.push({ kind: "hunk", text: line }); } if (line.startsWith("@@")) fail(`line ${i + 1} is not a hunk header; write it as @@ -60,4 +60,5 @@ (old start and count, new start and count)`); if (ELLIPSIS.test(line)) fail(`line ${i + 1} stands for cut lines: the gutter cannot know how many lines were skipped. Split the diff into two hunks, each with its own @@ header`); if (!rows.length && line === "") return; const kind2 = line === "" ? "ctx" : KIND[line[0]]; if (!kind2) fail(`line ${i + 1} is not a diff line ("${line.length > 40 ? `${line.slice(0, 40)}\u2026` : line}"); start it with +, -, a space or @@. A line of code that did not change starts with a space`); started = true; const row = { kind: kind2, text: line }; if (kind2 !== "add") { row.o = o++; if (hunk) hunk.got.o++; } if (kind2 !== "del") { row.n = n; newLines.add(n++); if (hunk) hunk.got.n++; } rows.push(row); }); closeHunk(); const count2 = (kind2) => rows.filter((r) => r.kind === kind2).length; return { rows, title, add: count2("add"), del: count2("del"), numbered, newLines, warnings }; } function diffRowsHtml({ rows, numbered }, hl) { return rows.map((r) => { const marked2 = r.n !== void 0 && hl.has(r.n) ? " am-ln--hl" : ""; const nums = numbered ? `${r.o === void 0 ? "" : ` data-o="${r.o}"`}${r.n === void 0 ? "" : ` data-n="${r.n}"`}` : ""; return `${esc(r.text)}`; }).join(""); } // src/code.js var MAX_CODE_LINES = 200; var LONG_CODE_LINES = 40; var MAX_FILE_BYTES = 2 * 1024 * 1024; var KEYS = /* @__PURE__ */ new Set(["src", "lines", "hl", "title", "start"]); var DIFF_KEYS = /* @__PURE__ */ new Set([...KEYS, "file"]); var CODE_EXAMPLE = "```ts src=server/routes.ts lines=18-30 hl=22\n```"; var SECRET_FILE = new RegExp([ "^\\.env(?!\\.(?:example|sample|template)$)(?:\\..*)?$", "^(?:\\.netrc|\\.npmrc|\\.yarnrc(?:\\.yml)?|\\.pypirc|\\.pgpass|\\.my\\.cnf|\\.git-credentials|\\.htpasswd)$", "^(?:id_(?:rsa|dsa|ecdsa|ed25519).*|credentials.*|secrets?(?:\\..*)?|.*_history|.*\\.local\\.json)$", "\\.(?:pem|key|p12|pfx|keystore|jks|tfvars|tfstate(?:\\.backup)?|sqlite3?|db|kdbx|ovpn)$" ].join("|"), "i"); var SECRET_DIR = /* @__PURE__ */ new Set([".git", ".ssh", ".aws", ".azure", ".gnupg", ".kube", ".docker", ".password-store"]); var SECRET_TEXT = /sk-ant-|sk-[A-Za-z0-9]{32,}|AKIA[0-9A-Z]{16}|-----BEGIN [A-Z ]*PRIVATE KEY|gh[pousr]_[A-Za-z0-9]{30,}|github_pat_[A-Za-z0-9_]{30,}|xox[abeprs]-[A-Za-z0-9-]{10,}|AIza[0-9A-Za-z_-]{30,}|eyJ[A-Za-z0-9_-]{20,}\.[A-Za-z0-9_-]{10,}\.|(?:password|passwd|secret|api[_-]?key|access[_-]?token|auth[_-]?token)["']?\s*[:=]\s*["'][^"'\s$<{]{12,}["']/i; var CodeError = class extends Error { constructor(message, line = 0, example = CODE_EXAMPLE) { super(message); this.name = "CodeError"; this.line = line; this.example = example; } }; function parseRange(value, name) { const m = String(value).match(/^(\d+)(?:-(\d+))?$/); if (!m) throw new CodeError(`${name}="${value}" is not a line range; write ${name}=18-30 or ${name}=18`); const from = Number(m[1]); const to = m[2] === void 0 ? from : Number(m[2]); if (from < 1 || to < from) throw new CodeError(`${name}="${value}": the first line must be 1 or more and not after the last line`); return { from, to }; } function parseHighlight(value) { const set = /* @__PURE__ */ new Set(); for (const part of String(value).split(",").map((s) => s.trim()).filter(Boolean)) { const { from, to } = parseRange(part, "hl"); for (let n = from; n <= to; n++) set.add(n); } return set; } function parseCodeArgs(args, diff = false) { const attrs = parseAttrs(args); const keys = diff ? DIFF_KEYS : KEYS; for (const [key, value] of Object.entries(attrs)) { if (value !== true && !keys.has(key)) throw new CodeError(`unknown code block setting "${key}"; use ${[...keys].join(", ")}`, 0, diff ? DIFF_EXAMPLE : CODE_EXAMPLE); } const text = (key) => typeof attrs[key] === "string" || typeof attrs[key] === "number" ? String(attrs[key]) : void 0; return { src: text("src"), lines: text("lines"), hl: text("hl"), title: text("title"), start: text("start"), file: text("file") }; } function localPath2(ref, baseDir) { const path = resolve2(baseDir, ref); const rel = relative(baseDir, path); return rel === ".." || rel.startsWith(`..${sep}`) || isAbsolute2(rel) ? null : path; } function readSlice(ref, range, baseDir) { const path = localPath2(ref, baseDir); if (!path) return null; if (SECRET_FILE.test(basename2(path)) || relative(baseDir, path).split(sep).some((part) => SECRET_DIR.has(part))) { throw new CodeError(`"${ref}" is a file that holds keys or passwords by convention; it is not embedded. Write a sketch instead`); } let size; try { const stat = statSync2(path); if (!stat.isFile()) throw new CodeError(`"${ref}" is not a file`); size = stat.size; } catch (err) { if (err instanceof CodeError) throw err; return null; } if (size > MAX_FILE_BYTES) throw new CodeError(`"${ref}" is ${(size / 1048576).toFixed(1)} MB; code files up to ${MAX_FILE_BYTES / 1048576} MB are read`); const buf = readFileSync3(path); if (buf.includes(0)) throw new CodeError(`"${ref}" is a binary file, not code`); if (SECRET_TEXT.test(buf.toString("utf8"))) throw new CodeError(`"${ref}" looks like it holds a key or a token somewhere in the file; no part of it is embedded. Write a sketch instead`); const all = buf.toString("utf8").replace(/\r\n?/g, "\n").replace(/\n$/, "").split("\n"); const from = range?.from ?? 1; const to = range?.to ?? all.length; if (to > all.length) throw new CodeError(`"${ref}" has ${all.length} lines; lines=${range.from}-${range.to} goes past the end`); return all.slice(from - 1, to); } var EMBEDDED_BLOCK = /]*?\sdata-am-src="([^"]*)"(?:\sdata-am-lines="([^"]*)")?[^>]*>([\s\S]*?)<\/figure>/g; var LINE_SPAN = /]*>([\s\S]*?)<\/span>/g; function readEmbeddedCode(html) { return new Map([...String(html).matchAll(EMBEDDED_BLOCK)].map(([, src, lines = "", inner]) => [ `${unescapeHtml(src)}#${lines}`, [...inner.matchAll(LINE_SPAN)].map((m) => unescapeHtml(m[1])) ])); } function renderCode({ lang, args, text }, { baseDir = process.cwd(), known = /* @__PURE__ */ new Map(), ui = {}, copy = true } = {}) { const isDiff = lang === "diff"; const opts = parseCodeArgs(args, isDiff); if (isDiff && opts.src) throw new CodeError("a diff block takes the diff you paste; src= is not supported for it yet, so paste the diff into the block", 0, DIFF_EXAMPLE); const range = opts.lines ? parseRange(opts.lines, "lines") : null; if (range && !opts.src) throw new CodeError("lines= needs src=; for code you type, use start= to number the lines"); let body; let first = 1; if (opts.src) { if (text.trim()) throw new CodeError("a block with src= takes its code from the file; leave the block empty"); body = readSlice(opts.src, range, baseDir) ?? known.get(`${opts.src}#${opts.lines ?? ""}`); if (!body) { const where2 = localPath2(opts.src, baseDir) ? "not found" : `outside the current folder ${baseDir}; only files inside it are quoted`; throw new CodeError(`Code file "${opts.src}" is ${where2}`); } first = range?.from ?? 1; } else { body = text.split("\n"); if (opts.start) first = parseRange(opts.start, "start").from; } if (body.length > MAX_CODE_LINES) throw new CodeError(`the block has ${body.length} lines; quote ${MAX_CODE_LINES} lines at most, and pick the lines that make the point`); const slice = body.join("\n"); if (SECRET_TEXT.test(slice)) throw new CodeError(`${opts.src ? `"${opts.src}"` : "the block"} looks like it holds a key or a token; it is not embedded. Quote other lines or write a sketch`); const copyButton = copy ? `${esc(ui.copyCode ?? "Copy")}` : ""; const long = body.length > LONG_CODE_LINES ? [{ rule: "code-length", message: `the block has ${body.length} lines; readers skim past long code. Pick the 10 to ${LONG_CODE_LINES} lines that make the point` }] : []; if (isDiff) return renderDiff(text, opts, { copyButton, long }); const last = first + body.length - 1; const hl = opts.hl ? parseHighlight(opts.hl) : /* @__PURE__ */ new Set(); const outside = [...hl].find((n) => n < first || n > last); if (outside !== void 0) throw new CodeError(`hl=${opts.hl}: line ${outside} is not in the block (lines ${first}-${last})`); const shownLang = lang || (opts.src ? extname2(opts.src).slice(1).toLowerCase() : ""); const numbered = Boolean(opts.src || opts.start); const where = opts.src ? `${opts.src}${range ? `:${range.from === range.to ? range.from : `${range.from}-${range.to}`}` : ""}` : ""; const title = opts.title ?? where; const lines = body.map((l3, i) => { const n = first + i; return `${esc(l3)}`; }).join(""); const source = opts.src ? ` data-am-src="${esc(opts.src)}"${opts.lines ? ` data-am-lines="${esc(opts.lines)}"` : ""}` : ""; const head = `${esc(title)}${shownLang ? `${esc(shownLang)}` : ""}${copyButton}`; const html = `${head}${lines}`; return { html, file: where || null, warnings: long }; } function renderDiff(text, opts, { copyButton, long }) { const diff = (() => { try { return parseDiff(text, opts.start ? parseRange(opts.start, "start").from : void 0); } catch (err) { if (err instanceof DiffError) throw new CodeError(err.message, err.line, DIFF_EXAMPLE); throw err; } })(); const hl = opts.hl ? parseHighlight(opts.hl) : /* @__PURE__ */ new Set(); if (hl.size && !diff.numbered) throw new CodeError("hl= on a diff needs line numbers: add an @@ header or start="); const outside = [...hl].find((n) => !diff.newLines.has(n)); if (outside !== void 0) throw new CodeError(`hl=${opts.hl}: line ${outside} is not a new-side line of the diff`); const file = opts.file ?? diff.title; const shownLang = extname2(file).slice(1).toLowerCase() || "diff"; const stat = `+${diff.add} \u2212${diff.del}`; const head = `${esc(opts.title ?? file)}${stat}${esc(shownLang)}${copyButton}`; const html = `${head}${diffRowsHtml(diff, hl)}`; return { html, file: null, warnings: [...diff.warnings, ...long] }; } // src/render.js var RenderError = class extends Error { constructor(message, { line, component, example } = {}) { super(message); this.name = "RenderError"; this.line = line; this.component = component; this.example = example; } }; var LintError = class extends Error { constructor(warnings) { super(`STE check failed (style: strict): ${warnings.length} warning${warnings.length === 1 ? "" : "s"}`); this.name = "LintError"; this.warnings = warnings; } }; function renderDoc(source, overrides = {}, defaults2 = {}, { themes: themes2 = BUILTIN, previousLanguage, baseDir, codeDir, knownImages, knownCode } = {}) { const choices = { theme: themes2.choices("page") }; const parsed = parseDoc(source, { defaults: defaults2, choices }); const meta = applyOverrides(parsed.meta, overrides, { ...CHOICES, ...choices }); if (meta.template === "video") throw new ParseError("template: video is a video draft; render it with am video", 0); const problem = themes2.problem(meta.theme, "page"); if (problem) throw new ParseError(problem, 0); const doc2 = { ...parsed, meta: meta.theme === AUTO ? { ...meta, theme: pickTheme({ scope: "page", template: meta.template, visuals: hasVisuals(parsed) }) } : meta }; const language = resolveLanguage({ declared: doc2.meta.lang, previous: previousLanguage, text: source }); const warnings = doc2.meta.style === "off" ? [] : lintDoc(doc2, language); if (doc2.meta.style === "strict" && warnings.length) throw new LintError(warnings); const stats = { panels: doc2.panels.length, components: {}, code: [], codeWarnings: [], componentWarnings: [], htmlWarnings: [], mathWarnings: [] }; const ui = language.ui; const ctx = { seq: 0, stats, ui, dir: language.dir, images: { baseDir, known: knownImages }, code: { baseDir: codeDir, known: knownCode } }; const loose = doc2.intro.find((b) => b.type === "fence" && COMPONENTS.get(b.lang)?.panelOnly); if (loose) throw new RenderError(`${loose.lang} belongs in a panel: put it under the ## heading of the panel the answer changes`, { line: loose.line, component: loose.lang, example: COMPONENTS.get(loose.lang).example }); const introHtml = renderBlocks(doc2.intro, ctx); const panels = doc2.panels.map((p) => ({ ...p, html: renderBlocks(p.blocks, ctx) })); const page = TEMPLATES[doc2.meta.template]({ meta: doc2.meta, introHtml, panels, ui, language }); const body = language.dir === "rtl" ? isolateLtrRuns(page) : page; const html = shell({ meta: doc2.meta, language, body, source, embedded: themes2.embedFor(doc2.meta.theme, "page") }); return { html, warnings, stats, meta: doc2.meta, language }; } function hasVisuals({ intro, panels }) { return [...intro, ...panels.flatMap((p) => p.blocks)].some((b) => b.type === "fence" && (COMPONENTS.has(b.lang) || RAW_LANGS.has(b.lang))); } function renderBlocks(blocks, ctx) { return blocks.map((b) => { const { result, notes } = collectHtmlNotes(() => b.type === "md" ? `${md(b.text)}` : renderFence(b, ctx), { math: !ctx.video }); noteHtml(b, notes.filter((n) => !n.math), ctx); noteMath(b, notes.filter((n) => n.math), ctx); return embedImages(b, result, ctx); }).join("\n"); } function noteHtml(block2, notes, ctx) { if (!notes.length || !ctx.stats.htmlWarnings) return; const lines = block2.text.split("\n"); const first = block2.type === "md" ? block2.line : block2.line + 1; const used = /* @__PURE__ */ new Map(); for (const { at: at3, message } of notes) { const tag = at3.split("\n")[0]; const places = lines.flatMap((l3, i) => Array(l3.split(tag).length - 1).fill(i)); const n = used.get(tag) ?? 0; used.set(tag, n + 1); ctx.stats.htmlWarnings.push({ line: first + (places[Math.min(n, places.length - 1)] ?? 0), message }); } } function noteMath(block2, notes, ctx) { if (!notes.length || !ctx.stats.mathWarnings) return; const first = block2.type === "md" ? block2.line : block2.line + 1; const next = /* @__PURE__ */ new Map(); for (const { at: at3, message } of notes) { const index = block2.text.indexOf(at3, next.get(at3) ?? 0); next.set(at3, index + 1); ctx.stats.mathWarnings.push({ line: first + (index < 0 ? 0 : block2.text.slice(0, index).split("\n").length - 1), message }); } } var MARKDOWN_FENCES = /* @__PURE__ */ new Set(["callout", "kv", "tree", "timeline"]); function embedImages(block2, html, ctx) { try { return inlineImages(html, { ...ctx.images, checkText: block2.type === "md" || MARKDOWN_FENCES.has(block2.lang) }); } catch (err) { if (!(err instanceof ImageError)) throw err; const idx = block2.text.split("\n").findIndex((l3) => l3.includes(err.ref) || l3.includes(encodeURI(err.ref))); const first = block2.type === "md" ? block2.line : block2.line + 1; throw new RenderError(err.message, { line: first + Math.max(idx, 0), component: "image", example: IMAGE_EXAMPLE }); } } function renderFence(block2, ctx) { const { lang, args, text, line } = block2; if (RAW_LANGS.has(lang)) return text; const comp = COMPONENTS.get(lang); if (!comp) return codeBlock(block2, ctx); if (comp.pageOnly && ctx.video) throw new RenderError(`${lang} works on a page only; a video cannot take answers`, { line, component: lang, example: comp.example }); ctx.stats.components[lang] = (ctx.stats.components[lang] ?? 0) + 1; try { const warn = ({ line: at3 = 0, message }) => ctx.stats.componentWarnings?.push({ line: line + at3, component: lang, message }); return comp.render(text, { args, uid: () => `am${++ctx.seq}`, ui: ctx.ui, dir: ctx.dir ?? "ltr", video: ctx.video, warn }); } catch (err) { if (!(err instanceof ComponentError)) throw err; throw new RenderError(err.message, { line: line + (err.line || 0), component: lang, example: comp.example }); } } function codeBlock(block2, ctx) { try { const { html, file, warnings } = renderCode(block2, { ...ctx.code, ui: ctx.ui, copy: !ctx.video }); if (file && ctx.stats.code) ctx.stats.code.push(file); if (ctx.stats.codeWarnings) ctx.stats.codeWarnings.push(...warnings.map((w) => ({ line: block2.line, ...w }))); return html; } catch (err) { if (!(err instanceof CodeError)) throw err; throw new RenderError(err.message, { line: block2.line + err.line, component: "code", example: err.example }); } } function timestamp(d = /* @__PURE__ */ new Date(), order = "ymd") { const p = (n) => String(n).padStart(2, "0"); const time = `${p(d.getHours())}:${p(d.getMinutes())}`; if (order === "dmy") return `${d.getDate()}.${d.getMonth() + 1}.${d.getFullYear()} ${time}`; return `${d.getFullYear()}-${p(d.getMonth() + 1)}-${p(d.getDate())} ${time}`; } function colophon(language) { const repo = "https://github.com/QingYunA/answer-me-with-html"; const link = `Answer me with HTML`; const star = `\u2605 Star on GitHub`; const label = esc(language.ui.generated ?? "Generated by"); const time = esc(timestamp(/* @__PURE__ */ new Date(), language.dateOrder)); if (language.dir === "rtl") return ``; return ``; } var hasDelta = (html) => html.includes('class="am-delta-bar"'); function lightboxShell(ui, hasDiagrams) { if (!hasDiagrams) return ""; return ` \u2715 `; } function shell({ meta, language, body, source, embedded }) { const { ui, labelKey } = language; const pick = (name, label, values, current) => `${esc(label)}${values.map(([value, text]) => `${esc(text)}`).join("")}`; const root = { lang: language.htmlLang, dir: language.dir, theme: meta.theme, mode: meta.mode, style: meta.style }; return ` ${rootTag(root)} ${esc(meta.title || "Answer me with HTML")} ${pick("theme", ui.theme, embedded.map((t) => [t.name, t.label[labelKey]]), meta.theme)} ${pick("mode", ui.modeLabel, Object.entries(ui.mode), meta.mode)} ${esc(ui.reply.button)} ${esc(ui.remark.button)} ${esc(ui.copy)} ${body} ${lightboxShell(ui, body.includes('class="am-diagram'))}${colophon(language)} ${sourceTag(source)}
([^<]*)<\/code>(?=\s*\S)/, '$1'); var vattrs = (n) => ` data-key="${esc(n.label)}" data-step="${n.step}"${deltaAttr(n.state)}`; var HIDDEN_IN = { before: "added", after: "removed" }; function lineAttrs(siblings, i, cols) { const n = siblings.length; return Object.entries(HIDDEN_IN).map(([view, hidden]) => { const shown2 = siblings.map((x2) => x2.state !== hidden); const first = shown2.indexOf(true); const last = shown2.lastIndexOf(true); const natural = cols ? n === 1 ? "none" : i === 0 ? "start" : i === n - 1 ? "end" : "full" : i < n - 1 ? "full" : "short"; const kind2 = cols ? first === last || i < first || i > last ? "none" : i === first ? "start" : i === last ? "end" : "full" : i < last ? "full" : i === last ? "short" : "none"; return kind2 === natural ? "" : ` data-line-${view}="${kind2}"`; }).join(""); } var dropAttrs = (children) => Object.entries(HIDDEN_IN).map(([view, hidden]) => children.every((c) => c.state === hidden) ? ` data-line-${view}="none"` : "").join(""); var boxInner = (n, ui) => `${deltaBadge(n.state, ui)}${labelHtml(n.label)}${n.sub ? `${mdInline(n.sub)}` : ""}`; function rootBox(root, ui, solo = false) { const drop = solo ? "" : dropAttrs(root.children); return `${boxInner(root, ui)}`; } function colHtml(node, ui, siblings, i) { const children = node.children.length ? listHtml(node.children, ui) : ""; return `${boxInner(node, ui)}${children}`; } var colsHtml = (nodes, ui) => nodes.map((n, i) => colHtml(n, ui, nodes, i)).join(""); function orgHtml(root, ui) { return `${rootBox(root, ui)}${colsHtml(root.children, ui)}`; } function listHtml(nodes, ui) { return `${nodes.map((n, i) => liHtml(n, ui, nodes, i)).join("")}`; } function liHtml(n, ui, siblings, i) { const sub = n.sub ? `${mdInline(n.sub)}` : ""; const kids = n.children.length ? `${n.children.map((c, k2) => liHtml(c, ui, n.children, k2)).join("")}` : ""; return `${deltaBadge(n.state, ui)}${labelHtml(n.label)}${sub}${kids}`; } // src/components/limits.js var NICE_MAX = [1, 1.5, 2, 2.5, 3, 4, 5, 6, 8, 10]; var NICE_STEP = [1, 2, 2.5, 5, 10]; function niceScale(peak) { if (!Number.isFinite(peak) || peak <= 0) return { max: 1, step: 1 }; const target = peak * 1.4; const pow = 10 ** Math.floor(Math.log10(target)); const integral = Number.isInteger(peak); const nice = NICE_MAX.map((m) => m * pow).find((m) => m >= target - 1e-9) ?? 10 * pow; const max = integral ? Math.ceil(nice) : nice; const stepPow = 10 ** Math.floor(Math.log10(max)); const step = [...NICE_STEP.map((s) => s * stepPow / 10), ...NICE_STEP.map((s) => s * stepPow)].find((s) => max / s <= 7 && Number.isInteger(round(max / s)) && (integral ? s >= 1 : true)) ?? max; return { max: round(max), step: round(step) }; } var round = (n) => Math.round(n * 1e3) / 1e3; var pct = (v, max) => `${Math.round(v / max * 1e4) / 100}%`; var NUM = /^(?:max\s+)?(-?\d+(?:\.\d+)?)$/i; var limits_default = { name: "limits", summary: "Value vs limit bars", syntax: `\`\`\`limits label | value / limit | unit (optional) | note (optional) label | limit | unit \u2190 limit only: the bar fills to the limit \`\`\` - A row turns red when the value is over the limit. The limit may be written as "max 20".`, example: "```limits\nProcedural sentence | 13 / 20 | words\nDescriptive sentence | max 25 | words\nNoun cluster | 4 / 3 | words | over\n```", render(text, { dir = "ltr", ui } = {}) { const rows = contentLines(text).map(({ text: t, line }) => parseRow(t, line)); if (!rows.length) throw new ComponentError("limits needs at least one line", 1); const words3 = { ...EN_WORDS, ...ui?.limits }; return `${rows.map((row) => rowHtml(row, dir === "rtl" ? "right" : "left", words3)).join("")}`; } }; function parseRow(t, line) { const [label, spec = "", unit = "", note2 = ""] = fields(t); const [a, b] = spec.split("/").map((s) => s.trim()); const nums = (b === void 0 ? [a] : [a, b]).map((s) => s?.match(NUM)?.[1]); if (!spec || nums.some((n) => n === void 0)) { throw new ComponentError(`limits line must be label | value / limit | unit: "${t}"`, line); } const [value, limit] = b === void 0 ? [null, Number(nums[0])] : nums.map(Number); return { label, value, limit, unit, note: note2 }; } var EN_WORDS = { value: "{value} / max {limit}", limit: "max {limit}" }; var fill = (template, value, limit) => template.replace("{value}", value).replace("{limit}", limit); function rowHtml({ label, value, limit, unit, note: note2 }, side = "left", words3 = EN_WORDS) { const { max, step } = niceScale(Math.max(limit, value ?? 0)); const shown2 = value ?? limit; const over2 = value !== null && value > limit; const valText = `${value !== null ? fill(words3.value, value, limit) : fill(words3.limit, value, limit)}${unit ? ` ${unit}` : ""}`; const ticks = []; if (step > 0 && max > 0) { for (let v = 0; v <= max + 1e-9; v += step) ticks.push(`${round(v)}`); } return ` ${esc(label)}${note2 ? `${esc(note2)}` : ""}${esc(valText)} ${ticks.join("")} `; } // src/runtime/rtl-letter.js var RTL_LETTER = /[\p{Script=Hebrew}\p{Script=Arabic}\p{Script=Syriac}\p{Script=Thaana}\p{Script=Nko}\p{Script=Samaritan}\p{Script=Mandaic}]/u; // src/bidi.js var LETTER = new RegExp("\\p{L}", "u"); function isLtrOnly(text) { const s = decode2(text); return !RTL_LETTER.test(s) && [...s].some((ch) => LETTER.test(ch)); } var hasRtl = (text) => RTL_LETTER.test(decode2(text)); var decode2 = (text) => String(text ?? "").replace(/&(amp|lt|gt|quot|#39);/g, (_2, e) => ({ amp: "&", lt: "<", gt: ">", quot: '"', "#39": "'" })[e]).replace(/&[#\w]+;/g, " "); var NEUTRAL = /[\p{P}\p{S}]/u; var WJ = String.fromCharCode(8288); var PREFIX = new RegExp("((?:^|[\\s(])\\p{Script=Hebrew}{1,3}-)(?=[^\\s-])", "gu"); var SIGNED = /(^|[\s(])([+\-−±~]\d[\d.,]*%?)/g; var WORD = /\S+/g; var WORD_LEAD = new RegExp(`^(?:\\p{Script=Hebrew}{1,3}[-\\u05BE]|[([{\xAB\u201C\u2018"']|"|')+`, "u"); var WORD_TRAIL = /(?:[.,:!?)\]}»”’…"'،؛؟]|(?${core}${trail}` : word; } var LRI = String.fromCharCode(8294); var PDI = String.fromCharCode(8297); function svgLine(line, dir) { if (dir !== "rtl") return line; return isLtrOnly(line) ? `${LRI}${line}${PDI}` : line; } var INLINE = /* @__PURE__ */ new Set(["a", "abbr", "b", "cite", "code", "del", "dfn", "em", "i", "ins", "kbd", "mark", "q", "s", "samp", "strong", "sub", "sup", "u", "var"]); var SKIP = /* @__PURE__ */ new Set(["svg", "math", "pre", "script", "style", "textarea", "select", "option", "title"]); var TOKEN = /|<\/?([a-zA-Z][\w-]*)\b(?:[^>"']|"[^"]*"|'[^']*')*>|[^<]+| { if (!run2.length) return; const text = run2.filter((t) => !t.startsWith("<")).join(""); const tags = run2.filter((t) => t.startsWith("<") && !t.startsWith("|->)\s*([^:：]+?)\s*(?:[:：]\s*(.*))?$/ }; function parseSequence(text) { const participants = []; const add = (p) => { if (!participants.includes(p)) participants.push(p); }; const steps = []; for (const { text: t, line } of contentLines(text)) { let m; if (m = t.match(RE.participants)) { m[1].split(/[,，]/).map((s) => s.trim()).filter(Boolean).forEach(add); } else if (m = t.match(RE.note)) { const over2 = m[1].split(/[,，]/).map((s) => s.trim()).filter(Boolean); over2.forEach(add); steps.push({ kind: "note", over: over2, text: m[2].trim(), line }); } else if (m = t.match(RE.divider)) { steps.push({ kind: "divider", text: m[1], line }); } else if (m = t.match(RE.msg)) { add(m[1]); add(m[3]); steps.push({ kind: "msg", from: m[1], to: m[3], dashed: m[2] === "-->", label: (m[4] ?? "").trim(), line }); } else { throw new ComponentError(`sequence cannot parse "${t}". Write a message as A -> B: label (--> is a dashed return) and a note as note A: text`, line); } } if (!participants.length) throw new ComponentError("sequence needs at least one message", 1); return { participants, steps }; } var sequence_default = { name: "sequence", summary: "Sequence diagram (messages between participants)", syntax: `\`\`\`sequence [num] participants: A, B, C \u2190 optional, fixes the participant order A -> B: request \u2190 solid line B --> A: response \u2190 dashed line (return) B -> B: self call note A: note on one participant note A, C: note across several participants == Phase divider == \`\`\` - Argument num: number the messages.`, example: "```sequence\nClient -> Server: SYN\nServer --> Client: SYN-ACK\nClient -> Server: ACK\nnote Client, Server: ESTABLISHED\n```", render(text, { args, uid, ui, dir = "ltr" }) { const model = parseSequence(text); return `${layout(model, { num: /\bnum\b/.test(args), id: uid(), ui, dir })}`; } }; function layout({ participants: ps, steps }, { num, id, ui, dir = "ltr" }) { const idx = new Map(ps.map((p, i) => [p, i])); const actorW = ps.map((p) => Math.max(measure(p, FS) + 28, 84)); const gaps = ps.slice(1).map((_2, i) => (actorW[i] + actorW[i + 1]) / 2 + 28); let extraRight = 0; let extraLeft = 0; const prepared = steps.map((s) => { if (s.kind === "msg") { const lines2 = s.label ? wrap(s.label, LABEL_MAX, FS) : []; const width2 = Math.max(0, ...lines2.map((l3) => measure(l3, FS))) + (num ? 34 : 22); const a = idx.get(s.from); const b = idx.get(s.to); if (a === b) { if (a < gaps.length) gaps[a] = Math.max(gaps[a], width2 + 48); else extraRight = Math.max(extraRight, width2 + 40); } else { const [lo, hi] = [Math.min(a, b), Math.max(a, b)]; const span = gaps.slice(lo, hi).reduce((x2, y3) => x2 + y3, 0); if (span < width2) gaps[hi - 1] += width2 - span; } return { ...s, lines: lines2, a, b }; } const lines = wrap(s.text, 220, 12); const w = Math.max(...lines.map((l3) => measure(l3, 12))) + 20; if (s.kind === "note" && s.over.length === 1) { const i = idx.get(s.over[0]); if (i === 0) extraLeft = Math.max(extraLeft, w / 2 - actorW[0] / 2); if (i === ps.length - 1) extraRight = Math.max(extraRight, w / 2 - actorW[i] / 2); } return { ...s, lines, w }; }); const xs = [MARGIN + extraLeft + actorW[0] / 2]; gaps.forEach((g) => xs.push(xs.at(-1) + g)); const width = xs.at(-1) + actorW.at(-1) / 2 + MARGIN + extraRight; const rtl = dir === "rtl"; const X3 = mirror(width, rtl); const dx = rtl ? -1 : 1; const body = []; let y2 = TOP + ACTOR_H + 22; let n = 0; for (const [k2, s] of prepared.entries()) { const start = body.length; if (s.kind === "msg") { n++; const cls = `am-edge${s.dashed ? " am-edge--dashed" : ""}`; const marker = ` marker-end="url(#${id}-arrow)"`; const step = num ? `${n}` : ""; if (s.a === s.b) { const x2 = X3(xs[s.a]); const labelX = x2 + dx * 40; body.push(s.lines.map((l3, k3) => `${esc(svgLine(l3, dir))}`).join("")); body.push(``, step); y2 += Math.max(s.lines.length * LH, 20) + 28; } else { y2 += s.lines.length * LH; const [x1, x2] = [X3(xs[s.a]), X3(xs[s.b])]; const mx = (x1 + x2) / 2; body.push(s.lines.map((l3, k3) => `${esc(svgLine(l3, dir))}`).join("")); body.push(``, step); y2 += 24; } } else if (s.kind === "note") { const xsOver = s.over.map((p) => X3(xs[idx.get(p)])); const lo = Math.min(...xsOver); const hi = Math.max(...xsOver); const w = Math.max(s.w, hi - lo + 40); const h2 = s.lines.length * LH + 12; const cx = (lo + hi) / 2; body.push(``); body.push(textLines(s.lines, cx, y2 + h2 / 2, LH, ' font-size="12"', dir)); y2 += h2 + 16; } else { const w = Math.max(...s.lines.map((l3) => measure(l3, 12))) + 20; body.push(``); body.push(``); body.push(textLines(s.lines.slice(0, 1), width / 2, y2 + 10, LH, ' font-size="12"', dir)); y2 += 34; } body.splice(start, body.length - start, `${body.slice(start).join("")}`); } const height = y2 + 6; const actors = ps.map((p, i) => { const x2 = X3(xs[i]); return `${textLines([p], x2, TOP + ACTOR_H / 2, LH, ' font-weight="600"', dir)}`; }); return `${svgOpen(width, height, diagramLabel(ui, "sequence", ps), dir)}${arrowDefs(id)}${actors.join("")}${body.join("")}`; } // node_modules/@dagrejs/dagre/dist/dagre.esm.js var Te2 = Object.defineProperty; var In = (e, n, t) => n in e ? Te2(e, n, { enumerable: true, configurable: true, writable: true, value: t }) : e[n] = t; var Sn = (e, n) => { for (var t in n) Te2(e, t, { get: n[t], enumerable: true }); }; var je2 = (e, n, t) => In(e, typeof n != "symbol" ? n + "" : n, t); var ie2 = {}; Sn(ie2, { Graph: () => T2, alg: () => H }); var Mn = Object.defineProperty; var Se = (e, n) => { for (var t in n) Mn(e, t, { get: n[t], enumerable: true }); }; var Q2 = class { constructor(e) { this._isDirected = true, this._isMultigraph = false, this._isCompound = false, this._nodes = {}, this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {}, this._nodeCount = 0, this._edgeCount = 0, this._defaultNodeLabelFn = () => { }, this._defaultEdgeLabelFn = () => { }, e && (this._isDirected = "directed" in e ? e.directed : true, this._isMultigraph = "multigraph" in e ? e.multigraph : false, this._isCompound = "compound" in e ? e.compound : false), this._isCompound && (this._parent = {}, this._children = {}, this._children["\0"] = {}); } isDirected() { return this._isDirected; } isMultigraph() { return this._isMultigraph; } isCompound() { return this._isCompound; } setGraph(e) { return this._label = e, this; } graph() { return this._label; } setDefaultNodeLabel(e) { return typeof e != "function" ? this._defaultNodeLabelFn = () => e : this._defaultNodeLabelFn = e, this; } nodeCount() { return this._nodeCount; } nodes() { return Object.keys(this._nodes); } sources() { return this.nodes().filter((e) => Object.keys(this._in[e]).length === 0); } sinks() { return this.nodes().filter((e) => Object.keys(this._out[e]).length === 0); } setNodes(e, n) { return e.forEach((t) => { n !== void 0 ? this.setNode(t, n) : this.setNode(t); }), this; } setNode(e, n) { return e in this._nodes ? (arguments.length > 1 && (this._nodes[e] = n), this) : (this._nodes[e] = arguments.length > 1 ? n : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = "\0", this._children[e] = {}, this._children["\0"][e] = true), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this); } node(e) { return this._nodes[e]; } hasNode(e) { return e in this._nodes; } removeNode(e) { if (e in this._nodes) { let n = (t) => this.removeEdge(this._edgeObjs[t]); delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], this.children(e).forEach((t) => { this.setParent(t); }), delete this._children[e]), Object.keys(this._in[e]).forEach(n), delete this._in[e], delete this._preds[e], Object.keys(this._out[e]).forEach(n), delete this._out[e], delete this._sucs[e], --this._nodeCount; } return this; } setParent(e, n) { if (!this._isCompound) throw new Error("Cannot set parent in a non-compound graph"); if (n === void 0) n = "\0"; else { n += ""; for (let t = n; t !== void 0; t = this.parent(t)) if (t === e) throw new Error("Setting " + n + " as parent of " + e + " would create a cycle"); this.setNode(n); } return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = n, this._children[n][e] = true, this; } parent(e) { if (this._isCompound) { let n = this._parent[e]; if (n !== "\0") return n; } } children(e = "\0") { if (this._isCompound) { let n = this._children[e]; if (n) return Object.keys(n); } else { if (e === "\0") return this.nodes(); if (this.hasNode(e)) return []; } return []; } predecessors(e) { let n = this._preds[e]; if (n) return Object.keys(n); } successors(e) { let n = this._sucs[e]; if (n) return Object.keys(n); } neighbors(e) { let n = this.predecessors(e); if (n) { let t = new Set(n), r = this.successors(e); if (r) for (let o of r) t.add(o); return Array.from(t.values()); } } isLeaf(e) { var n; let t; return this.isDirected() ? t = this.successors(e) : t = this.neighbors(e), ((n = t == null ? void 0 : t.length) != null ? n : 0) === 0; } filterNodes(e) { let n = new this.constructor({ directed: this._isDirected, multigraph: this._isMultigraph, compound: this._isCompound }); n.setGraph(this.graph()), Object.entries(this._nodes).forEach(([o, i]) => { e(o) && n.setNode(o, i); }), Object.values(this._edgeObjs).forEach((o) => { n.hasNode(o.v) && n.hasNode(o.w) && n.setEdge(o, this.edge(o)); }); let t = {}, r = (o) => { let i = this.parent(o); return !i || n.hasNode(i) ? (t[o] = i, i) : i in t ? t[i] : r(i); }; return this._isCompound && n.nodes().forEach((o) => n.setParent(o, r(o))), n; } setDefaultEdgeLabel(e) { return typeof e != "function" ? this._defaultEdgeLabelFn = () => e : this._defaultEdgeLabelFn = e, this; } edgeCount() { return this._edgeCount; } edges() { return Object.values(this._edgeObjs); } setPath(e, n) { return e.reduce((t, r) => (n !== void 0 ? this.setEdge(t, r, n) : this.setEdge(t, r), r)), this; } setEdge(e, n, t, r) { let o, i, s, a, l3 = false; typeof e == "object" && e !== null && "v" in e ? (o = e.v, i = e.w, s = e.name, arguments.length === 2 && (a = n, l3 = true)) : (o = e, i = n, s = r, arguments.length > 2 && (a = t, l3 = true)), o = "" + o, i = "" + i, s !== void 0 && (s = "" + s); let u = z2(this._isDirected, o, i, s); if (u in this._edgeLabels) return l3 && (this._edgeLabels[u] = a), this; if (s !== void 0 && !this._isMultigraph) throw new Error("Cannot set a named edge when isMultigraph = false"); this.setNode(o), this.setNode(i), this._edgeLabels[u] = l3 ? a : this._defaultEdgeLabelFn(o, i, s); let d = Pn(this._isDirected, o, i, s); return o = d.v, i = d.w, Object.freeze(d), this._edgeObjs[u] = d, Re2(this._preds[i], o), Re2(this._sucs[o], i), this._in[i][u] = d, this._out[o][u] = d, this._edgeCount++, this; } edge(e, n, t) { let r = arguments.length === 1 ? oe2(this._isDirected, e) : z2(this._isDirected, e, n, t); return this._edgeLabels[r]; } edgeAsObj(e, n, t) { let r = arguments.length === 1 ? this.edge(e) : this.edge(e, n, t); return typeof r != "object" || r === null ? { label: r } : r; } hasEdge(e, n, t) { return (arguments.length === 1 ? oe2(this._isDirected, e) : z2(this._isDirected, e, n, t)) in this._edgeLabels; } removeEdge(e, n, t) { let r = arguments.length === 1 ? oe2(this._isDirected, e) : z2(this._isDirected, e, n, t), o = this._edgeObjs[r]; if (o) { let i = o.v, s = o.w; delete this._edgeLabels[r], delete this._edgeObjs[r], Ie2(this._preds[s], i), Ie2(this._sucs[i], s), delete this._in[s][r], delete this._out[i][r], this._edgeCount--; } return this; } inEdges(e, n) { return this.isDirected() ? this.filterEdges(this._in[e], e, n) : this.nodeEdges(e, n); } outEdges(e, n) { return this.isDirected() ? this.filterEdges(this._out[e], e, n) : this.nodeEdges(e, n); } nodeEdges(e, n) { if (e in this._nodes) return this.filterEdges({ ...this._in[e], ...this._out[e] }, e, n); } _removeFromParentsChildList(e) { delete this._children[this._parent[e]][e]; } filterEdges(e, n, t) { if (!e) return; let r = Object.values(e); return t ? r.filter((o) => o.v === n && o.w === t || o.v === t && o.w === n) : r; } }; function Re2(e, n) { e[n] ? e[n]++ : e[n] = 1; } function Ie2(e, n) { e[n] !== void 0 && !--e[n] && delete e[n]; } function z2(e, n, t, r) { let o = "" + n, i = "" + t; if (!e && o > i) { let s = o; o = i, i = s; } return o + "" + i + "" + (r === void 0 ? "\0" : r); } function Pn(e, n, t, r) { let o = "" + n, i = "" + t; if (!e && o > i) { let a = o; o = i, i = a; } let s = { v: o, w: i }; return r && (s.name = r), s; } function oe2(e, n) { return z2(e, n.v, n.w, n.name); } var Fn = {}; Se(Fn, { read: () => Yn, write: () => An }); function An(e) { let n = { options: { directed: e.isDirected(), multigraph: e.isMultigraph(), compound: e.isCompound() }, nodes: Vn(e), edges: Dn(e) }, t = e.graph(); return t !== void 0 && (n.value = structuredClone(t)), n; } function Vn(e) { return e.nodes().map((n) => { let t = e.node(n), r = e.parent(n), o = { v: n }; return t !== void 0 && (o.value = t), r !== void 0 && (o.parent = r), o; }); } function Dn(e) { return e.edges().map((n) => { let t = e.edge(n), r = { v: n.v, w: n.w }; return n.name !== void 0 && (r.name = n.name), t !== void 0 && (r.value = t), r; }); } function Yn(e) { let n = new Q2(e.options); return e.value !== void 0 && n.setGraph(e.value), e.nodes.forEach((t) => { n.setNode(t.v, t.value), t.parent && n.setParent(t.v, t.parent); }), e.edges.forEach((t) => { n.setEdge({ v: t.v, w: t.w, name: t.name }, t.value); }), n; } var H = {}; Se(H, { CycleException: () => K, bellmanFord: () => Me2, components: () => Xn, dijkstra: () => J2, dijkstraAll: () => qn, findCycles: () => $n, floydWarshall: () => Jn, isAcyclic: () => Qn, postorder: () => et2, preorder: () => nt2, prim: () => tt2, shortestPaths: () => rt2, tarjan: () => Fe2, topsort: () => Ae2 }); var Wn = () => 1; function Me2(e, n, t, r) { return Bn(e, String(n), t || Wn, r || function(o) { var i; return (i = e.outEdges(o)) != null ? i : []; }); } function Bn(e, n, t, r) { let o = {}, i, s = 0, a = e.nodes(), l3 = function(c) { let f2 = o[c.v], h2 = o[c.w]; if (!f2 || !h2) return; let p = t(c); f2.distance + p < h2.distance && (o[c.w] = { distance: f2.distance + p, predecessor: c.v }, i = true); }, u = function() { a.forEach(function(c) { r(c).forEach(function(f2) { let h2 = f2.v === c ? f2.v : f2.w, p = h2 === f2.v ? f2.w : f2.v; l3({ v: h2, w: p }); }); }); }; a.forEach(function(c) { let f2 = c === n ? 0 : Number.POSITIVE_INFINITY; o[c] = { distance: f2, predecessor: "" }; }); let d = a.length; for (let c = 1; c < d && (i = false, s++, u(), !!i); c++) ; if (s === d - 1 && (i = false, u(), i)) throw new Error("The graph contains a negative weight cycle"); return o; } function Xn(e) { let n = {}, t = [], r; function o(i) { var s, a; i in n || (n[i] = true, r.push(i), (s = e.successors(i)) == null || s.forEach(o), (a = e.predecessors(i)) == null || a.forEach(o)); } return e.nodes().forEach(function(i) { r = [], o(i), r.length && t.push(r); }), t; } var Pe = class { constructor() { this._arr = [], this._keyIndices = {}; } size() { return this._arr.length; } keys() { return this._arr.map((e) => e.key); } has(e) { return e in this._keyIndices; } priority(e) { let n = this._keyIndices[e]; if (n !== void 0) return this._arr[n].priority; } min() { if (this.size() === 0) throw new Error("Queue underflow"); return this._arr[0].key; } add(e, n) { let t = this._keyIndices, r = String(e); if (!(r in t)) { let o = this._arr, i = o.length; return t[r] = i, o.push({ key: r, priority: n }), this._decrease(i), true; } return false; } removeMin() { if (this.size() === 0) throw new Error("Queue underflow"); this._swap(0, this._arr.length - 1); let e = this._arr.pop(); return delete this._keyIndices[e.key], this._heapify(0), e.key; } decrease(e, n) { let t = this._keyIndices[e]; if (t === void 0) throw new Error(`Key not found: ${e}`); let r = this._arr[t].priority; if (n > r) throw new Error(`New priority is greater than current priority. Key: ${e} Old: ${r} New: ${n}`); this._arr[t].priority = n, this._decrease(t); } _heapify(e) { let n = this._arr, t = 2 * e, r = t + 1, o = e; t < n.length && (o = n[t].priority < n[o].priority ? t : o, r < n.length && (o = n[r].priority < n[o].priority ? r : o), o !== e && (this._swap(e, o), this._heapify(o))); } _decrease(e) { let n = this._arr, t = n[e].priority, r; for (; e !== 0 && (r = e >> 1, !(n[r].priority < t)); ) this._swap(e, r), e = r; } _swap(e, n) { let t = this._arr, r = this._keyIndices, o = t[e], i = t[n]; t[e] = i, t[n] = o, r[i.key] = e, r[o.key] = n; } }; var zn = () => 1; function J2(e, n, t, r) { let o = function(i) { var s; return (s = e.outEdges(i)) != null ? s : []; }; return Hn(e, String(n), t || zn, r || o); } function Hn(e, n, t, r) { let o = {}, i = new Pe(), s, a, l3 = function(u) { let d = u.v !== s ? u.v : u.w, c = o[d]; if (!c) return; let f2 = t(u), h2 = a.distance + f2; if (f2 < 0) throw new Error("dijkstra does not allow negative edge weights. Bad edge: " + u + " Weight: " + f2); h2 < c.distance && (c.distance = h2, c.predecessor = s, i.decrease(d, h2)); }; for (e.nodes().forEach(function(u) { let d = u === n ? 0 : Number.POSITIVE_INFINITY; o[u] = { distance: d, predecessor: "" }, i.add(u, d); }); i.size() > 0; ) { s = i.removeMin(); let u = o[s]; if (!u || u.distance === Number.POSITIVE_INFINITY) break; a = u, r(s).forEach(l3); } return o; } function qn(e, n, t) { return e.nodes().reduce(function(r, o) { return r[o] = J2(e, o, n, t), r; }, {}); } function Fe2(e) { let n = 0, t = [], r = {}, o = []; function i(s) { var a; let l3 = r[s] = { onStack: true, lowlink: n, index: n++ }; if (t.push(s), (a = e.successors(s)) == null || a.forEach(function(u) { if (u in r) { let d = r[u]; d != null && d.onStack && (l3.lowlink = Math.min(l3.lowlink, d.index)); } else { i(u); let d = r[u]; d && (l3.lowlink = Math.min(l3.lowlink, d.lowlink)); } }), l3.lowlink === l3.index) { let u = [], d; do { d = t.pop(); let c = r[d]; c && (c.onStack = false), u.push(d); } while (s !== d); o.push(u); } } return e.nodes().forEach(function(s) { s in r || i(s); }), o; } function $n(e) { return Fe2(e).filter(function(n) { var t; let r = n[0]; return r ? n.length > 1 || n.length === 1 && ((t = e.outEdges(r, r)) != null ? t : []).length > 0 : false; }); } var Un = () => 1; function Jn(e, n, t) { return Kn(e, n || Un, t || function(r) { var o; return (o = e.outEdges(r)) != null ? o : []; }); } function Kn(e, n, t) { let r = {}, o = e.nodes(); return o.forEach(function(i) { let s = {}; r[i] = s, s[i] = { distance: 0, predecessor: "" }, o.forEach(function(a) { i !== a && (s[a] = { distance: Number.POSITIVE_INFINITY, predecessor: "" }); }), t(i).forEach(function(a) { let l3 = a.v === i ? a.w : a.v, u = n(a); s[l3] = { distance: u, predecessor: i }; }); }), o.forEach(function(i) { let s = r[i]; s && o.forEach(function(a) { let l3 = r[a]; l3 && o.forEach(function(u) { let d = l3[i], c = s[u], f2 = l3[u]; if (d && c && f2) { let h2 = d.distance + c.distance; h2 < f2.distance && (f2.distance = h2, f2.predecessor = c.predecessor); } }); }); }), r; } var K = class extends Error { constructor(e) { super(e), this.name = "CycleException"; } }; function Ae2(e) { let n = {}, t = {}, r = []; function o(i) { var s; if (i in t) throw new K(); i in n || (t[i] = true, n[i] = true, (s = e.predecessors(i)) == null || s.forEach(o), delete t[i], r.push(i)); } if (e.sinks().forEach(o), Object.keys(n).length !== e.nodeCount()) throw new K(); return r; } function Qn(e) { try { Ae2(e); } catch (n) { if (n instanceof K) return false; throw n; } return true; } function Zn(e, n, t, r, o) { Array.isArray(n) || (n = [n]); let i = ((a) => { var l3; return (l3 = e.isDirected() ? e.successors(a) : e.neighbors(a)) != null ? l3 : []; }), s = {}; return n.forEach(function(a) { if (!e.hasNode(a)) throw new Error("Graph does not have node: " + a); o = Ve2(e, a, t === "post", s, i, r, o); }), o; } function Ve2(e, n, t, r, o, i, s) { return n in r || (r[n] = true, t || (s = i(s, n)), o(n).forEach(function(a) { s = Ve2(e, a, t, r, o, i, s); }), t && (s = i(s, n))), s; } function De2(e, n, t) { return Zn(e, n, t, function(r, o) { return r.push(o), r; }, []); } function et2(e, n) { return De2(e, n, "post"); } function nt2(e, n) { return De2(e, n, "pre"); } function tt2(e, n) { var t; let r = new Q2(), o = {}, i = new Pe(), s; function a(d) { let c = d.v === s ? d.w : d.v, f2 = i.priority(c); if (f2 !== void 0) { let h2 = n(d); h2 < f2 && (o[c] = s, i.decrease(c, h2)); } } if (e.nodeCount() === 0) return r; e.nodes().forEach(function(d) { i.add(d, Number.POSITIVE_INFINITY), r.setNode(d); }); let l3 = e.nodes()[0]; l3 !== void 0 && i.decrease(l3, 0); let u = false; for (; i.size() > 0; ) { if (s = i.removeMin(), s in o) r.setEdge(s, o[s]); else { if (u) throw new Error("Input graph is not connected: " + e); u = true; } (t = e.nodeEdges(s)) == null || t.forEach(a); } return r; } function rt2(e, n, t, r) { return ot2(e, n, t, r != null ? r : ((o) => { var i; return (i = e.outEdges(o)) != null ? i : []; })); } function ot2(e, n, t, r) { if (t === void 0) return J2(e, n, t, r); let o = false, i = e.nodes(); for (let s = 0; s < i.length; s++) { let a = i[s]; if (a === void 0) continue; let l3 = r(a); for (let u = 0; u < l3.length; u++) { let d = l3[u]; if (!d) continue; let c = d.v === a ? d.v : d.w, f2 = c === d.v ? d.w : d.v; t({ v: c, w: f2 }) < 0 && (o = true); } if (o) return Me2(e, n, t, r); } return J2(e, n, t, r); } var T2 = Q2; function M(e, n, t, r) { let o = r; for (; e.hasNode(o); ) o = $2(r); return t.dummy = n, e.setNode(o, t), o; } function Ye2(e) { let n = new T2().setGraph(e.graph()); return e.nodes().forEach((t) => n.setNode(t, e.node(t))), e.edges().forEach((t) => { let r = n.edge(t.v, t.w) || { weight: 0, minlen: 1 }, o = e.edge(t); n.setEdge(t.v, t.w, { weight: r.weight + o.weight, minlen: Math.max(r.minlen, o.minlen) }); }), n; } function Z(e) { let n = new T2({ multigraph: e.isMultigraph() }).setGraph(e.graph()); return e.nodes().forEach((t) => { e.children(t).length || n.setNode(t, e.node(t)); }), e.edges().forEach((t) => { n.setEdge(t, e.edge(t)); }), n; } function se2(e, n) { let t = e.x, r = e.y, o = n.x - t, i = n.y - r, s = e.width / 2, a = e.height / 2; if (!o && !i) throw new Error("Not possible to find intersection inside of the rectangle"); let l3, u; return Math.abs(i) * s > Math.abs(o) * a ? (i < 0 && (a = -a), l3 = a * o / i, u = a) : (o < 0 && (s = -s), l3 = s, u = s * i / o), { x: t + l3, y: r + u }; } function P2(e) { let n = A2(de2(e) + 1).map(() => []); return e.nodes().forEach((t) => { let r = e.node(t), o = r.rank; o !== void 0 && (n[o] || (n[o] = []), n[o][r.order] = t); }), n; } function We2(e) { let n = e.nodes().map((r) => { let o = e.node(r).rank; return o === void 0 ? Number.MAX_VALUE : o; }), t = R2(Math.min, n); e.nodes().forEach((r) => { let o = e.node(r); Object.hasOwn(o, "rank") && (o.rank -= t); }); } function Be2(e) { let n = e.nodes().map((s) => e.node(s).rank).filter((s) => s !== void 0), t = R2(Math.min, n), r = []; e.nodes().forEach((s) => { let a = e.node(s).rank - t; r[a] || (r[a] = []), r[a].push(s); }); let o = 0, i = e.graph().nodeRankFactor; Array.from(r).forEach((s, a) => { s === void 0 && a % i !== 0 ? --o : s !== void 0 && o && s.forEach((l3) => e.node(l3).rank += o); }); } function ae(e, n, t, r) { let o = { width: 0, height: 0 }; return arguments.length >= 4 && (o.rank = t, o.order = r), M(e, "border", o, n); } function it2(e, n = Xe2) { let t = []; for (let r = 0; r < e.length; r += n) { let o = e.slice(r, r + n); t.push(o); } return t; } var Xe2 = 65535; function R2(e, n) { if (n.length > Xe2) { let t = it2(n); return e(...t.map((r) => e(...r))); } else return e(...n); } function de2(e) { let t = e.nodes().map((r) => { let o = e.node(r).rank; return o === void 0 ? Number.MIN_VALUE : o; }); return R2(Math.max, t); } function ze2(e, n) { let t = { lhs: [], rhs: [] }; return e.forEach((r) => { n(r) ? t.lhs.push(r) : t.rhs.push(r); }), t; } function le2(e, n) { let t = Date.now(); try { return n(); } finally { console.log(e + " time: " + (Date.now() - t) + "ms"); } } function q2(e, n) { return n(); } var st2 = 0; function $2(e) { let n = ++st2; return e + ("" + n); } function A2(e, n, t = 1) { n == null && (n = e, e = 0); let r = (i) => i < n; t < 0 && (r = (i) => n < i); let o = []; for (let i = e; r(i); i += t) o.push(i); return o; } function B2(e, n) { let t = {}; for (let r of n) e[r] !== void 0 && (t[r] = e[r]); return t; } function X2(e, n) { let t; return typeof n == "string" ? t = (r) => r[n] : t = n, Object.entries(e).reduce((r, [o, i]) => (r[o] = t(i, o), r), {}); } function He2(e, n) { return e.reduce((t, r, o) => (t[r] = n[o], t), {}); } var D2 = "\0"; function ee2(e, n, t) { var u, d, c, f2, h2, p; if (!(e && n && t && n.dummy === "edge" && t.dummy === "edge" && n.edgeObj && t.edgeObj && e[n.edgeObj.v] && e[t.edgeObj.v] && e[n.edgeObj.w] && e[t.edgeObj.w])) return 0; let r = true; n.edgeObj.w === t.edgeObj.w && (r = false); let o = r ? (d = (u = e[n.edgeObj.v]) == null ? void 0 : u.rank) != null ? d : NaN + 1 : (f2 = (c = e[n.edgeObj.w]) == null ? void 0 : c.rank) != null ? f2 : NaN - 1, i = Object.entries(e).find((E2) => { var y2, L2; return ((y2 = E2[1].edgeObj) == null ? void 0 : y2.v) === n.edgeObj.v && ((L2 = E2[1].edgeObj) == null ? void 0 : L2.w) === n.edgeObj.w && E2[1].rank === o; }), s = Object.entries(e).find((E2) => { var y2, L2; return ((y2 = E2[1].edgeObj) == null ? void 0 : y2.v) === t.edgeObj.v && ((L2 = E2[1].edgeObj) == null ? void 0 : L2.w) === t.edgeObj.w && E2[1].rank === o; }); if (!i || !s) return 0; let a = (h2 = i[1].order) != null ? h2 : NaN, l3 = (p = s[1].order) != null ? p : NaN; return isNaN(a - l3) ? 0 : a - l3; } var ue2 = "3.1.1"; var ce2 = class { constructor() { je2(this, "_sentinel"); let n = {}; n._next = n._prev = n, this._sentinel = n; } dequeue() { let n = this._sentinel, t = n._prev; if (t !== n) return qe2(t), t; } enqueue(n) { let t = this._sentinel; n._prev && n._next && qe2(n), n._next = t._next, t._next._prev = n, t._next = n, n._prev = t; } toString() { let n = [], t = this._sentinel, r = t._prev; for (; r !== t; ) n.push(JSON.stringify(r, at2)), r = r._prev; return "[" + n.join(", ") + "]"; } }; function qe2(e) { e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev; } function at2(e, n) { if (e !== "_next" && e !== "_prev") return n; } var $e2 = ce2; var dt2 = () => 1; function be2(e, n) { if (e.nodeCount() <= 1) return []; let t = ut2(e, n || dt2); return lt2(t.graph, t.buckets, t.zeroIdx).flatMap((o) => e.outEdges(o.v, o.w) || []); } function lt2(e, n, t) { var a; let r = [], o = n[n.length - 1], i = n[0], s; for (; e.nodeCount(); ) { for (; s = i.dequeue(); ) fe2(e, n, t, s); for (; s = o.dequeue(); ) fe2(e, n, t, s); if (e.nodeCount()) { for (let l3 = n.length - 2; l3 > 0; --l3) if (s = (a = n[l3]) == null ? void 0 : a.dequeue(), s) { r = r.concat(fe2(e, n, t, s, true) || []); break; } } } return r; } function fe2(e, n, t, r, o) { let i = [], s = o ? i : void 0; return (e.inEdges(r.v) || []).forEach((a) => { let l3 = e.edge(a), u = e.node(a.v); o && i.push({ v: a.v, w: a.w }), u.out -= l3, he2(n, t, u); }), (e.outEdges(r.v) || []).forEach((a) => { let l3 = e.edge(a), u = a.w, d = e.node(u); d.in -= l3, he2(n, t, d); }), e.removeNode(r.v), s; } function ut2(e, n) { let t = new T2(), r = 0, o = 0; e.nodes().forEach((a) => { t.setNode(a, { v: a, in: 0, out: 0 }); }), e.edges().forEach((a) => { let l3 = t.edge(a.v, a.w) || 0, u = n(a), d = l3 + u; t.setEdge(a.v, a.w, d); let c = t.node(a.v), f2 = t.node(a.w); o = Math.max(o, c.out += u), r = Math.max(r, f2.in += u); }); let i = ct2(o + r + 3).map(() => new $e2()), s = r + 1; return t.nodes().forEach((a) => { he2(i, s, t.node(a)); }), { graph: t, buckets: i, zeroIdx: s }; } function he2(e, n, t) { var r, o, i; t.out ? t.in ? (i = e[t.out - t.in + n]) == null || i.enqueue(t) : (o = e[e.length - 1]) == null || o.enqueue(t) : (r = e[0]) == null || r.enqueue(t); } function ct2(e) { let n = []; for (let t = 0; t < e; t++) n.push(t); return n; } function Ue2(e, n) { (e.graph().acyclicer === "greedy" ? be2(e, r(e)) : ft2(e, n != null ? n : null)).forEach((o) => { let i = e.edge(o); e.removeEdge(o), i.forwardName = o.name, i.reversed = true, e.setEdge(o.w, o.v, i, $2("rev")); }); function r(o) { return (i) => o.edge(i).weight; } } function ft2(e, n) { let t = [], r = {}, o = {}; function i(l3) { Object.hasOwn(o, l3) || (o[l3] = true, r[l3] = true, e.outEdges(l3).forEach((u) => { Object.hasOwn(r, u.w) ? t.push(u) : i(u.w); }), delete r[l3]); } function s(l3) { var u; Object.hasOwn(o, l3) || (o[l3] = true, r[l3] = true, (u = e.outEdges(l3)) == null || u.forEach((d) => { var c, f2; Object.hasOwn(r, d.w) || ((c = n.node(l3)) == null ? void 0 : c.rank) > ((f2 = n.node(d.w)) == null ? void 0 : f2.rank) && ht2(e, d.w, d) ? t.push(d) : s(d.w); }), delete r[l3]); } let a = i; return n && typeof n.node == "function" && (a = s), e.sources().forEach(a), e.nodes().forEach(a), t; } function Je2(e) { e.edges().forEach((n) => { let t = e.edge(n); if (t.reversed) { e.removeEdge(n); let r = t.forwardName; delete t.reversed, delete t.forwardName, e.setEdge(n.w, n.v, t, r); } }); } function ht2(e, n, t) { let r = /* @__PURE__ */ new Set(); function o(i) { var s; if (e.sources().includes(i)) return true; r.add(i); for (let a of (s = e.inEdges(i)) != null ? s : []) if (!(a.v === t.v && a.w === t.w) && !r.has(a.v) && o(a.v)) return true; return false; } return o(n); } function Ke2(e) { e.graph().dummyChains = [], e.edges().forEach((n) => gt2(e, n)); } function gt2(e, n) { let t = n.v, r = e.node(t).rank, o = n.w, i = e.node(o).rank, s = n.name, a = e.edge(n), l3 = a.labelRank; if (i === r + 1) return; e.removeEdge(n); let u, d, c; for (c = 0, ++r; r < i; ++c, ++r) a.points = [], d = { width: 0, height: 0, edgeLabel: a, edgeObj: n, rank: r }, u = M(e, "edge", d, "_d"), r === l3 && (d.width = a.width, d.height = a.height, d.dummy = "edge-label", d.labelpos = a.labelpos), e.setEdge(t, u, { weight: a.weight }, s), c === 0 && e.graph().dummyChains.push(u), t = u; e.setEdge(t, o, { weight: a.weight }, s); } function Qe2(e) { e.graph().dummyChains.forEach((n) => { let t = e.node(n), r = t.edgeLabel, o; for (e.setEdge(t.edgeObj, r); t.dummy; ) o = e.successors(n)[0], e.removeNode(n), r.points.push({ x: t.x, y: t.y }), t.dummy === "edge-label" && (r.x = t.x, r.y = t.y, r.width = t.width, r.height = t.height), n = o, t = e.node(n); }); } function U2(e) { let n = {}; function t(r) { let o = e.node(r); if (Object.hasOwn(n, r)) return o.rank; n[r] = true; let i = e.outEdges(r), s = i ? i.map((l3) => l3 == null ? Number.POSITIVE_INFINITY : t(l3.w) - e.edge(l3).minlen) : [], a = R2(Math.min, s); return a === Number.POSITIVE_INFINITY && (a = 0), o.rank = a; } e.sources().forEach(t); } function V2(e, n) { return e.node(n.w).rank - e.node(n.v).rank - e.edge(n).minlen; } var ne2 = mt2; function mt2(e) { let n = new T2({ directed: false }), t = e.nodes(); if (t.length === 0) throw new Error("Graph must have at least one node"); let r = t[0], o = e.nodeCount(); n.setNode(r, {}); let i, s; for (; Et(n, e) < o && (i = Lt(n, e), !!i); ) s = n.hasNode(i.v) ? V2(e, i) : -V2(e, i), yt2(n, e, s); return n; } function Et(e, n) { function t(r) { let o = n.nodeEdges(r); o && o.forEach((i) => { let s = i.v, a = r === s ? i.w : s; !e.hasNode(a) && !V2(n, i) && (e.setNode(a, {}), e.setEdge(r, a, {}), t(a)); }); } return e.nodes().forEach(t), e.nodeCount(); } function Lt(e, n) { return n.edges().reduce((r, o) => { let i = Number.POSITIVE_INFINITY; return e.hasNode(o.v) !== e.hasNode(o.w) && (i = V2(n, o)), i < r[0] ? [i, o] : r; }, [Number.POSITIVE_INFINITY, null])[1]; } function yt2(e, n, t) { e.nodes().forEach((r) => n.node(r).rank += t); } var { preorder: wt2, postorder: Nt } = H; var en = Y2; Y2.initLowLimValues = pe2; Y2.initCutValues = ge2; Y2.calcCutValue = nn; Y2.leaveEdge = rn; Y2.enterEdge = on; Y2.exchangeEdges = sn; function Y2(e) { e = Ye2(e), U2(e); let n = ne2(e); pe2(n), ge2(n, e); let t, r; for (; t = rn(n); ) r = on(n, e, t), sn(n, e, t, r); } function ge2(e, n) { let t = Nt(e, e.nodes()); t = t.slice(0, t.length - 1), t.forEach((r) => Gt(e, n, r)); } function Gt(e, n, t) { let o = e.node(t).parent, i = e.edge(t, o); i.cutvalue = nn(e, n, t); } function nn(e, n, t) { let o = e.node(t).parent, i = true, s = n.edge(t, o), a = 0; s || (i = false, s = n.edge(o, t)), a = s.weight; let l3 = n.nodeEdges(t); return l3 && l3.forEach((u) => { let d = u.v === t, c = d ? u.w : u.v; if (c !== o) { let f2 = d === i, h2 = n.edge(u).weight; if (a += f2 ? h2 : -h2, kt2(e, t, c)) { let E2 = e.edge(t, c).cutvalue; a += f2 ? -E2 : E2; } } }), a; } function pe2(e, n) { arguments.length < 2 && (n = e.nodes()[0]), tn(e, {}, 1, n); } function tn(e, n, t, r, o) { let i = t, s = e.node(r); n[r] = true; let a = e.neighbors(r); return a && a.forEach((l3) => { Object.hasOwn(n, l3) || (t = tn(e, n, t, l3, r)); }), s.low = i, s.lim = t++, o ? s.parent = o : delete s.parent, t; } function rn(e) { return e.edges().find((n) => e.edge(n).cutvalue < 0); } function on(e, n, t) { let r = t.v, o = t.w; n.hasEdge(r, o) || (r = t.w, o = t.v); let i = e.node(r), s = e.node(o), a = i, l3 = false; return i.lim > s.lim && (a = s, l3 = true), n.edges().filter((d) => l3 === Ze2(e, e.node(d.v), a) && l3 !== Ze2(e, e.node(d.w), a)).reduce((d, c) => V2(n, c) < V2(n, d) ? c : d); } function sn(e, n, t, r) { let o = t.v, i = t.w; e.removeEdge(o, i), e.setEdge(r.v, r.w, {}), pe2(e), ge2(e, n), vt(e, n); } function vt(e, n) { let t = e.nodes().find((o) => !e.node(o).parent); if (!t) return; let r = wt2(e, [t]); r = r.slice(1), r.forEach((o) => { let s = e.node(o).parent, a = n.edge(o, s), l3 = false; a || (a = n.edge(s, o), l3 = true), n.node(o).rank = n.node(s).rank + (l3 ? a.minlen : -a.minlen); }); } function kt2(e, n, t) { return e.hasEdge(n, t); } function Ze2(e, n, t) { return t.low <= n.lim && n.lim <= t.lim; } var dn = xt2; function xt2(e) { let n = e.graph().ranker; if (typeof n == "function") return n(e); switch (n) { case "network-simplex": an(e); break; case "tight-tree": Ot2(e); break; case "longest-path": _t(e); break; case "none": break; default: an(e); } } var _t = U2; function Ot2(e) { U2(e), ne2(e); } function an(e) { en(e); } var ln = Ct; function Ct(e) { let n = jt(e), t = e.graph(); if (!Array.isArray(t.dummyChains)) return; t.dummyChains.forEach((o) => { let i = e.node(o), s = i.edgeObj, a = Tt2(e, n, s.v, s.w), l3 = a.path, u = a.lca, d = 0, c = l3[d], f2 = true; for (; o !== s.w; ) { if (i = e.node(o), f2) { for (; (c = l3[d]) !== u && e.node(c).maxRank < i.rank; ) d++; c === u && (f2 = false); } if (!f2) { for (; d < l3.length - 1 && e.node(l3[d + 1]).minRank <= i.rank; ) d++; c = l3[d]; } c !== void 0 && e.setParent(o, c), o = e.successors(o)[0]; } }); } function Tt2(e, n, t, r) { let o = [], i = [], s = Math.min(n[t].low, n[r].low), a = Math.max(n[t].lim, n[r].lim), l3; l3 = t; do l3 = e.parent(l3), o.push(l3); while (l3 && (n[l3].low > s || a > n[l3].lim)); let u = l3, d = r; for (; (d = e.parent(d)) !== u; ) i.push(d); return { path: o.concat(i.reverse()), lca: u }; } function jt(e) { let n = {}, t = 0; function r(o) { let i = t; e.children(o).forEach(r), n[o] = { low: i, lim: t++ }; } return e.children(D2).forEach(r), n; } function un(e) { let n = M(e, "root", {}, "_root"), t = Rt2(e), r = Object.values(t), o = R2(Math.max, r) - 1, i = 2 * o + 1; e.graph().nestingRoot = n, e.edges().forEach((a) => e.edge(a).minlen *= i); let s = It(e) + 1; e.children(D2).forEach((a) => { cn(e, n, i, s, o, t, a); }), e.graph().nodeRankFactor = i; } function cn(e, n, t, r, o, i, s) { var c; let a = e.children(s); if (!a.length) { s !== n && e.setEdge(n, s, { weight: 0, minlen: t }); return; } let l3 = ae(e, "_bt"), u = ae(e, "_bb"), d = e.node(s); e.setParent(l3, s), d.borderTop = l3, e.setParent(u, s), d.borderBottom = u, a.forEach((f2) => { var b; cn(e, n, t, r, o, i, f2); let h2 = e.node(f2), p = h2.borderTop ? h2.borderTop : f2, E2 = h2.borderBottom ? h2.borderBottom : f2, y2 = h2.borderTop ? r : 2 * r, L2 = p !== E2 ? 1 : o - ((b = i[s]) != null ? b : 0) + 1; e.setEdge(l3, p, { weight: y2, minlen: L2, nestingEdge: true }), e.setEdge(E2, u, { weight: y2, minlen: L2, nestingEdge: true }); }), e.parent(s) || e.setEdge(n, l3, { weight: 0, minlen: o + ((c = i[s]) != null ? c : 0) }); } function Rt2(e) { let n = {}; function t(r, o) { let i = e.children(r); i && i.length && i.forEach((s) => t(s, o + 1)), n[r] = o; } return e.children(D2).forEach((r) => t(r, 1)), n; } function It(e) { return e.edges().reduce((n, t) => n + e.edge(t).weight, 0); } function fn2(e) { let n = e.graph(); e.removeNode(n.nestingRoot), delete n.nestingRoot, e.edges().forEach((t) => { e.edge(t).nestingEdge && e.removeEdge(t); }); } var bn = Mt; function Mt(e) { function n(t) { let r = e.children(t), o = e.node(t); if (r.length && r.forEach(n), o && Object.hasOwn(o, "minRank")) { o.borderLeft = [], o.borderRight = []; for (let i = o.minRank, s = o.maxRank + 1; i < s; ++i) hn(e, "borderLeft", "_bl", t, o, i), hn(e, "borderRight", "_br", t, o, i); } } e.children(D2).forEach(n); } function hn(e, n, t, r, o, i) { let s = { width: 0, height: 0, rank: i, borderType: n }, a = o[n][i - 1], l3 = M(e, "border", s, t); o[n][i] = l3, e.setParent(l3, r), a && e.setEdge(a, l3, { weight: 1 }); } function pn(e) { var t; let n = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase(); (n === "lr" || n === "rl") && En(e); } function mn2(e) { var t; let n = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase(); (n === "bt" || n === "rl") && Pt2(e), (n === "lr" || n === "rl") && (Ft(e), En(e)); } function En(e) { e.nodes().forEach((n) => gn2(e.node(n))), e.edges().forEach((n) => gn2(e.edge(n))); } function gn2(e) { let n = e.width; e.width = e.height, e.height = n; } function Pt2(e) { e.nodes().forEach((n) => me2(e.node(n))), e.edges().forEach((n) => { var r; let t = e.edge(n); (r = t.points) == null || r.forEach(me2), Object.hasOwn(t, "y") && me2(t); }); } function me2(e) { e.y = -e.y; } function Ft(e) { e.nodes().forEach((n) => Ee2(e.node(n))), e.edges().forEach((n) => { var r; let t = e.edge(n); (r = t.points) == null || r.forEach(Ee2), Object.hasOwn(t, "x") && Ee2(t); }); } function Ee2(e) { let n = e.x; e.x = e.y, e.y = n; } function Le2(e, n = null) { let t = {}, r = e.nodes().filter((d) => !e.children(d).length), o = r.map((d) => e.node(d).rank), i = R2(Math.max, o), s = A2(i + 1).map(() => []); function a(d) { if (t[d]) return; t[d] = true; let c = e.node(d); s[c.rank].push(d); let f2 = e.successors(d); f2 && [...f2].sort((p, E2) => u(p, E2)).forEach(a); } r.sort((d, c) => e.node(d).rank - e.node(c).rank).forEach(a); function u(d, c) { let f2 = e.node(d), h2 = e.node(c); return ee2(n, f2, h2); } return s; } function ye(e, n) { let t = 0; for (let r = 1; r < n.length; ++r) t += Vt(e, n[r - 1], n[r]); return t; } function Vt(e, n, t) { let r = He2(t, t.map((u, d) => d)), o = n.flatMap((u) => { let d = e.outEdges(u); return d ? d.map((c) => ({ pos: r[c.w], weight: e.edge(c).weight })).sort((c, f2) => c.pos - f2.pos) : []; }), i = 1; for (; i < t.length; ) i <<= 1; let s = 2 * i - 1; i -= 1; let a = new Array(s).fill(0), l3 = 0; return o.forEach((u) => { let d = u.pos + i; a[d] += u.weight; let c = 0; for (; d > 0; ) d % 2 && (c += a[d + 1]), d = d - 1 >> 1, a[d] += u.weight; l3 += u.weight * c; }), l3; } function we2(e, n = []) { return n.map((t) => { let r = e.inEdges(t); if (!r || !r.length) return { v: t }; { let o = r.reduce((i, s) => { let a = e.edge(s), l3 = e.node(s.v); return { sum: i.sum + a.weight * l3.order, weight: i.weight + a.weight }; }, { sum: 0, weight: 0 }); return { v: t, barycenter: o.sum / o.weight, weight: o.weight }; } }); } function Ne2(e, n) { let t = {}; e.forEach((o, i) => { let s = { indegree: 0, in: [], out: [], vs: [o.v], i }; o.barycenter !== void 0 && (s.barycenter = o.barycenter, s.weight = o.weight), t[o.v] = s; }), n.edges().forEach((o) => { let i = t[o.v], s = t[o.w]; i !== void 0 && s !== void 0 && (s.indegree++, i.out.push(s)); }); let r = Object.values(t).filter((o) => !o.indegree); return Dt(r); } function Dt(e) { let n = []; function t(o) { return (i) => { i.merged || (i.barycenter === void 0 || o.barycenter === void 0 || i.barycenter >= o.barycenter) && Yt(o, i); }; } function r(o) { return (i) => { i.in.push(o), --i.indegree === 0 && e.push(i); }; } for (; e.length; ) { let o = e.pop(); n.push(o), o.in.reverse().forEach(t(o)), o.out.forEach(r(o)); } return n.filter((o) => !o.merged).map((o) => B2(o, ["vs", "i", "barycenter", "weight"])); } function Yt(e, n) { let t = 0, r = 0; e.weight && (t += e.barycenter * e.weight, r += e.weight), n.weight && (t += n.barycenter * n.weight, r += n.weight), e.vs = n.vs.concat(e.vs), e.barycenter = t / r, e.weight = r, e.i = Math.min(n.i, e.i), n.merged = true; } function Ge2(e, n, t, r, o) { let i = {}, s = null, a = null, l3 = o; typeof n == "boolean" ? (l3 = n, i = {}) : n && (i = n, s = t != null ? t : null, a = r != null ? r : null); let u = ze2(e, (L2) => Object.hasOwn(L2, "barycenter")), d = u.lhs, c = u.rhs.sort((L2, b) => b.i - L2.i), f2 = [], h2 = 0, p = 0, E2 = 0; d.sort(Wt(a, s, !!l3)); for (let [L2, b] of Object.entries(i)) { let g = d.findIndex((m) => m.vs[0] === L2); d.splice(g + 1, 0, b); } E2 = Ln(f2, c, E2), d.forEach((L2) => { E2 += L2.vs.length, f2.push(L2.vs), h2 += L2.barycenter * L2.weight, p += L2.weight, E2 = Ln(f2, c, E2); }); let y2 = { vs: f2.flat(1) }; return p && (y2.barycenter = h2 / p, y2.weight = p), y2; } function Ln(e, n, t) { let r; for (; n.length && (r = n[n.length - 1]).i <= t; ) n.pop(), e.push(r.vs), t++; return t; } function Wt(e, n, t) { return (r, o) => { if (r.barycenter < o.barycenter) return -1; if (r.barycenter > o.barycenter) return 1; if (e && (typeof r.vs[0] == "string" || typeof o.vs[0] == "string")) { let i = e.node(r.vs[0]), s = e.node(o.vs[0]), a = ee2(n, i, s); if (a !== 0) return a; } return t ? o.i - r.i : r.i - o.i; }; } function te2(e, n, t, r, o) { var L2, b, g, m, w, k2, _2, C2, j2, I2, S2; let i = null, s = o; typeof r == "boolean" ? (s = r, i = null) : r !== void 0 && (i = r); let a = e.children(n), l3 = e.node(n), u = l3 ? l3.borderLeft : void 0, d = l3 ? l3.borderRight : void 0, c = {}; u && (a = a.filter((G2) => G2 !== u && G2 !== d)); let f2 = we2(e, a); f2.forEach((G2) => { if (e.children(G2.v).length) { let { result: x2 } = te2(e, G2.v, t, i, s); c[G2.v] = x2, Object.hasOwn(x2, "barycenter") && Xt(G2, x2); } }); let h2 = Ne2(f2, t); Bt(h2, c); let p = {}, E2 = false; for (let G2 = 0; G2 < h2.length; G2++) for (let x2 = G2 + 1; x2 < h2.length; x2++) if (!(!h2[G2] || !h2[x2] || !((L2 = h2[G2]) != null && L2.barycenter) || !((b = h2[x2]) != null && b.barycenter)) && ((g = h2[G2]) == null ? void 0 : g.barycenter) === h2[x2].barycenter) { let v = (w = (m = h2[G2]) == null ? void 0 : m.vs[0]) != null ? w : "", N2 = (_2 = (k2 = h2[x2]) == null ? void 0 : k2.vs[0]) != null ? _2 : "", O2 = e.node(v), W2 = e.node(N2); if (O2.dummy === "edge" && W2.dummy === "edge" && ((C2 = O2.edgeObj) == null ? void 0 : C2.v) === ((j2 = W2.edgeObj) == null ? void 0 : j2.v) && ((I2 = O2.edgeObj) == null ? void 0 : I2.w) === ((S2 = W2.edgeObj) == null ? void 0 : S2.w)) if (O2.edgeLabel.reversed) { p[N2] = h2[G2], h2.splice(G2, 1), G2--; break; } else p[v] = h2[x2], h2.splice(x2, 1), x2--; else E2 = true; } let y2 = Ge2(h2, p, i, e, s); if (u && d) { y2.vs = [u, y2.vs, d].flat(1); let G2 = e.predecessors(u); if (G2 && G2.length) { let x2 = e.node(G2[0]), v = e.predecessors(d), N2 = e.node(v[0]); Object.hasOwn(y2, "barycenter") || (y2.barycenter = 0, y2.weight = 0), y2.barycenter = (y2.barycenter * y2.weight + x2.order + N2.order) / (y2.weight + 2), y2.weight += 2; } } return Object.defineProperty(y2, "result", { value: y2, enumerable: false, configurable: true, writable: true }), Object.defineProperty(y2, "usedBias", { value: E2, enumerable: false, configurable: true, writable: true }), y2; } function Bt(e, n) { e.forEach((t) => { t.vs = t.vs.flatMap((r) => n[r] ? n[r].vs : r); }); } function Xt(e, n) { e.barycenter !== void 0 ? (e.barycenter = (e.barycenter * e.weight + n.barycenter * n.weight) / (e.weight + n.weight), e.weight += n.weight) : (e.barycenter = n.barycenter, e.weight = n.weight); } function ve2(e, n, t, r) { r || (r = e.nodes()); let o = zt(e), i = new T2({ compound: true }).setGraph({ root: o }).setDefaultNodeLabel((s) => e.node(s)); return r.forEach((s) => { let a = e.node(s), l3 = e.parent(s); if (a.rank === n || a.minRank <= n && n <= a.maxRank) { i.setNode(s), i.setParent(s, l3 || o); let u = e[t](s); u && u.forEach((d) => { let c = d.v === s ? d.w : d.v, f2 = i.edge(c, s), h2 = f2 !== void 0 ? f2.weight : 0; i.setEdge(c, s, { weight: e.edge(d).weight + h2 }); }), Object.hasOwn(a, "minRank") && i.setNode(s, { borderLeft: a.borderLeft[n], borderRight: a.borderRight[n] }); } }), i; } function zt(e) { let n; for (; e.hasNode(n = $2("_root")); ) ; return n; } function ke2(e, n, t) { let r = {}, o; t.forEach((i) => { let s = e.parent(i), a, l3; for (; s; ) { if (a = e.parent(s), a ? (l3 = r[a], r[a] = s) : (l3 = o, o = s), l3 && l3 !== s) { n.setEdge(l3, s); return; } s = a; } }); } function re2(e, n = {}, t = null) { if (typeof n.customOrder == "function") { n.customOrder(e, re2); return; } let r = de2(e), o = yn(e, A2(1, r + 1), "inEdges"), i = yn(e, A2(r - 1, -1, -1), "outEdges"), s = Le2(e, t); if (wn(e, s), n.disableOptimalOrderHeuristic) return; let a = Number.POSITIVE_INFINITY, l3, u = n.constraints || []; for (let d = 0, c = 0; c < 4; ++d, ++c) { Ht(d % 2 ? o : i, d % 4 >= 2, u, t), s = P2(e); let f2 = ye(e, s); f2 < a ? (c = 0, l3 = Object.assign({}, s), a = f2) : f2 === a && (l3 = structuredClone(s)); } wn(e, l3); } function yn(e, n, t) { let r = /* @__PURE__ */ new Map(), o = (i, s) => { r.has(i) || r.set(i, []), r.get(i).push(s); }; for (let i of e.nodes()) { let s = e.node(i); if (typeof s.rank == "number" && o(s.rank, i), typeof s.minRank == "number" && typeof s.maxRank == "number") for (let a = s.minRank; a <= s.maxRank; a++) a !== s.rank && o(a, i); } return n.map(function(i) { return ve2(e, i, t, r.get(i) || []); }); } function Ht(e, n, t, r) { let o = true, i = new T2(); e.forEach(function(s) { t.forEach((d) => i.setEdge(d.left, d.right)); let a = s.graph().root, { result: l3, usedBias: u } = te2(s, a, i, r, o); n && u && (o = !o), l3.vs.forEach((d, c) => s.node(d).order = c), ke2(s, i, l3.vs); }); } function wn(e, n) { Object.values(n).forEach((t) => t.forEach((r, o) => e.node(r).order = o)); } function qt(e, n) { let t = {}; function r(o, i) { let s = 0, a = 0, l3 = o.length, u = i[i.length - 1]; return i.forEach((d, c) => { let f2 = Ut(e, d), h2 = f2 ? e.node(f2).order : l3; (f2 || d === u) && (i.slice(a, c + 1).forEach((p) => { let E2 = e.predecessors(p); E2 && E2.forEach((y2) => { let L2 = e.node(y2), b = L2.order; (b < s || h2 < b) && !(L2.dummy && e.node(p).dummy) && Gn(t, y2, p); }); }), a = c + 1, s = h2); }), i; } return n.length && n.reduce(r), t; } function $t(e, n) { let t = {}; function r(i, s, a, l3, u) { A2(s, a).forEach((d) => { let c = i[d]; if (c !== void 0 && e.node(c).dummy) { let f2 = e.predecessors(c); f2 && f2.forEach((h2) => { if (h2 === void 0) return; let p = e.node(h2); p.dummy && (p.order < l3 || p.order > u) && Gn(t, h2, c); }); } }); } function o(i, s) { let a = -1, l3 = -1, u = 0; return s.forEach((d, c) => { if (e.node(d).dummy === "border") { let f2 = e.predecessors(d); if (f2 && f2.length) { let h2 = f2[0]; if (h2 === void 0) return; l3 = e.node(h2).order, r(s, u, c, a, l3), u = c, a = l3; } } r(s, u, s.length, l3, i.length); }), s; } return n.length && n.reduce(o), t; } function Ut(e, n) { if (e.node(n).dummy) { let t = e.predecessors(n); if (t) return t.find((r) => e.node(r).dummy); } } function Gn(e, n, t) { if (n > t) { let o = n; n = t, t = o; } let r = e[n]; r || (e[n] = r = {}), r[t] = true; } function Jt(e, n, t) { if (n > t) { let o = n; n = t, t = o; } let r = e[n]; return r !== void 0 && Object.hasOwn(r, t); } function Kt(e, n, t, r, o) { let i = {}, s = {}, a = {}; return n.forEach((l3) => { l3.forEach((u, d) => { i[u] = u, s[u] = u, a[u] = d; }); }), n.forEach((l3) => { let u = -1, d = -1, c = false, f2 = l3, h2 = l3.findIndex((p) => (o == null ? void 0 : o.includes(p)) || Nn(p, e, o)); h2 > 0 && (f2 = [l3[h2], ...l3.slice(0, h2), ...l3.slice(h2 + 1)], c = true), f2.forEach((p) => { var y2; let E2 = r(p); if (E2 && E2.length) { o != null && o.includes(p) && (E2 = E2.filter((g) => Nn(g, e, o))); let L2 = E2.sort((g, m) => { let w = a[g], k2 = a[m]; return (w !== void 0 ? w : 0) - (k2 !== void 0 ? k2 : 0); }), b = (L2.length - 1) / 2; for (let g = Math.floor(b), m = Math.ceil(b); g <= m; ++g) { let w = L2[g]; if (w === void 0) continue; let k2 = a[w]; if (k2 !== void 0 && s[p] === p && u < k2 && a[w] !== d && !Jt(t, p, w)) { let _2 = i[w]; _2 !== void 0 && (s[w] = p, s[p] = i[p] = _2, u = k2, c && (u = -1, d = (y2 = a[w]) != null ? y2 : -1, c = false)); } } } }); }), { root: i, align: s }; } function Qt(e, n, t, r, o = false) { let i = {}, s = Zt(e, n, t, o), a = o ? "borderLeft" : "borderRight"; function l3(h2, p) { let E2 = s.nodes().slice(), y2 = {}, L2 = E2.pop(); for (; L2; ) { if (y2[L2]) h2(L2); else { y2[L2] = true, E2.push(L2); for (let b of p(L2)) E2.push(b); } L2 = E2.pop(); } } function u(h2) { let p = s.inEdges(h2); p ? i[h2] = p.reduce((E2, y2) => { var g; let L2 = (g = i[y2.v]) != null ? g : 0, b = s.edge(y2); return Math.max(E2, L2 + (b !== void 0 ? b : 0)); }, 0) : i[h2] = 0; } function d(h2) { let p = s.outEdges(h2), E2 = Number.POSITIVE_INFINITY; p && (E2 = p.reduce((L2, b) => { let g = i[b.w], m = s.edge(b); return Math.min(L2, (g !== void 0 ? g : 0) - (m !== void 0 ? m : 0)); }, Number.POSITIVE_INFINITY)); let y2 = e.node(h2); E2 !== Number.POSITIVE_INFINITY && y2.borderType !== a && (i[h2] = Math.max(i[h2] !== void 0 ? i[h2] : 0, E2)); } function c(h2) { return s.predecessors(h2) || []; } function f2(h2) { return s.successors(h2) || []; } return l3(u, c), l3(d, f2), Object.keys(r).forEach((h2) => { var E2; let p = t[h2]; p !== void 0 && (i[h2] = (E2 = i[p]) != null ? E2 : 0); }), i; } function Zt(e, n, t, r) { let o = new T2(), i = e.graph(), s = rr(i.nodesep, i.edgesep, r); return n.forEach((a) => { let l3; a.forEach((u) => { let d = t[u]; if (d !== void 0) { if (o.setNode(d), l3 !== void 0) { let c = t[l3]; if (c !== void 0) { let f2 = o.edge(c, d); o.setEdge(c, d, Math.max(s(e, u, l3), f2 || 0)); } } l3 = u; } }); }), o; } function er(e, n) { return Object.values(n).reduce((t, r) => { let o = Number.NEGATIVE_INFINITY, i = Number.POSITIVE_INFINITY; Object.entries(r).forEach(([a, l3]) => { let u = or(e, a) / 2; o = Math.max(l3 + u, o), i = Math.min(l3 - u, i); }); let s = o - i; return s < t[0] && (t = [s, r]), t; }, [Number.POSITIVE_INFINITY, null])[1]; } function nr(e, n) { let t = Object.values(n), r = R2(Math.min, t), o = R2(Math.max, t); ["u", "d"].forEach((i) => { ["l", "r"].forEach((s) => { let a = i + s, l3 = e[a]; if (!l3 || l3 === n) return; let u = Object.values(l3), d = r - R2(Math.min, u); s !== "l" && (d = o - R2(Math.max, u)), d && (e[a] = X2(l3, (c) => c + d)); }); }); } function tr(e, n = void 0) { let t = e.ul; return t ? X2(t, (r, o) => { var s, a; if (n) { let l3 = n.toLowerCase(), u = e[l3]; if (u && u[o] !== void 0) return u[o]; } let i = Object.values(e).map((l3) => { let u = l3[o]; return u !== void 0 ? u : 0; }).sort((l3, u) => l3 - u); return (((s = i[1]) != null ? s : 0) + ((a = i[2]) != null ? a : 0)) / 2; }) : {}; } function vn(e, n) { let t = P2(e), r = Object.assign(qt(e, t), $t(e, t)), o = {}, i; ["u", "d"].forEach((a) => { i = a === "u" ? t : Object.values(t).reverse(), ["l", "r"].forEach((l3) => { l3 === "r" && (i = i.map((f2) => Object.values(f2).reverse())); let d = Kt(e, i, r, (f2) => (a === "u" ? e.predecessors(f2) : e.successors(f2)) || [], n), c = Qt(e, i, d.root, d.align, l3 === "r"); l3 === "r" && (c = X2(c, (f2) => -f2)), o[a + l3] = c; }); }); let s = er(e, o); return nr(o, s), tr(o, e.graph().align); } function rr(e, n, t) { return (r, o, i) => { let s = r.node(o), a = r.node(i), l3 = 0, u; if (l3 += s.width / 2, Object.hasOwn(s, "labelpos")) switch (s.labelpos.toLowerCase()) { case "l": u = -s.width / 2; break; case "r": u = s.width / 2; break; } if (u && (l3 += t ? u : -u), u = void 0, l3 += (s.dummy ? n : e) / 2, l3 += (a.dummy ? n : e) / 2, l3 += a.width / 2, Object.hasOwn(a, "labelpos")) switch (a.labelpos.toLowerCase()) { case "l": u = a.width / 2; break; case "r": u = -a.width / 2; break; } return u && (l3 += t ? u : -u), l3; }; } function or(e, n) { return e.node(n).width; } function Nn(e, n, t) { var s; if (!t) return false; let r = (s = n.node(e)) == null ? void 0 : s.edgeObj; if (!r || n.node(e).edgeLabel.reversed) return false; let o = t.indexOf(r == null ? void 0 : r.v), i = t.indexOf(r == null ? void 0 : r.w); return o !== -1 && i !== -1 && o === (i + 1) % t.length || o === (i - 1) % t.length; } function kn(e, n) { e = Z(e), ir(e), Object.entries(vn(e, n)).forEach(([t, r]) => e.node(t).x = r); } function ir(e) { let n = P2(e), t = e.graph(), r = t.ranksep, o = t.rankalign, i = 0; n.forEach((s) => { let a = s.reduce((l3, u) => { var c; let d = (c = e.node(u).height) != null ? c : 0; return l3 > d ? l3 : d; }, 0); s.forEach((l3) => { let u = e.node(l3); o === "top" ? u.y = i + u.height / 2 : o === "bottom" ? u.y = i + a - u.height / 2 : u.y = i + a / 2; }), i += a + r; }); } var xn2 = /* @__PURE__ */ new WeakMap(); function Oe2(e, n = {}) { return Rn2(e, q2, n), e; } function _n(e, n, t) { let r = n; for (; r !== void 0; ) { let o = e.parent(r); if (o === t) return r; r = o; } } function Rn2(e, n, t) { var L2; let r = e.nodes().filter((b) => e.children(b).length), o = {}; r.forEach((b) => { let g = e.node(b); if (g && g.rankdir) { let m = new T2({ multigraph: true, compound: true }); m.setGraph({ rankdir: g.rankdir }); let w = e.children(b); w.forEach((v) => { let N2 = { ...e.node(v) }; m.setNode(v, N2); let O2 = e.parent(v); O2 && O2 !== b && w.includes(O2) && m.setParent(v, O2); }); let k2 = /* @__PURE__ */ new Set(); e.edges().forEach((v) => { let N2 = _n(e, v.v, b), O2 = _n(e, v.w, b); if (N2 && O2 && N2 !== O2) { let W2 = `${N2}\0${O2}`; k2.has(W2) || (k2.add(W2), m.setEdge(N2, O2, { ...e.edge(v) })); } }), Rn2(m, n, t); let _2 = jn(m); On(_2, n, t, null), Cn(m, _2); let C2 = 1 / 0, j2 = 1 / 0, I2 = -1 / 0, S2 = -1 / 0; m.nodes().forEach((v) => { if (v === b) return; let N2 = m.node(v); N2 && typeof N2.x == "number" && typeof N2.y == "number" && typeof N2.width == "number" && typeof N2.height == "number" && (C2 = Math.min(C2, N2.x - N2.width / 2), I2 = Math.max(I2, N2.x + N2.width / 2), j2 = Math.min(j2, N2.y - N2.height / 2), S2 = Math.max(S2, N2.y + N2.height / 2)); }), (!isFinite(C2) || !isFinite(j2) || !isFinite(I2) || !isFinite(S2)) && (C2 = j2 = 0, I2 = S2 = 0); let G2 = I2 - C2, x2 = S2 - j2; o[b] = { minX: C2, minY: j2, maxX: I2, maxY: S2, width: G2, height: x2, offsetX: C2, offsetY: j2 }, g._dagreClusterSubgraph = m; } }); let i = [], s = (b) => { let g = [], m = (e.children(b) || []).filter((w) => w !== b); for (; m.length > 0; ) { let w = m.shift(); g.push(w), (e.children(w) || []).filter((k2) => k2 !== w).forEach((k2) => m.push(k2)); } return g; }, a = /* @__PURE__ */ new Map(); r.forEach((b) => { let g = e.node(b); g && g.rankdir && o[b] && a.set(b, (e.children(b) || []).filter((m) => m !== b)); }); let l3 = new Set([...a.values()].flat()), u = /* @__PURE__ */ new Map(); a.forEach((b, g) => { l3.has(g) || u.set(g, s(g)); }); let d = new Set([...u.values()].flat()), c = (b) => { for (let [g, m] of u) if (m.includes(b)) return g; return b; }, f2 = []; e.edges().forEach((b) => { (d.has(b.v) || d.has(b.w)) && f2.push({ edge: b, label: e.edge(b) }); }); let h2 = /* @__PURE__ */ new Map(); d.forEach((b) => { let g = e.parent(b); h2.set(b, typeof g == "string" ? g : void 0); }), u.forEach((b, g) => { let m = e.node(g), w = []; b.forEach((C2) => { let j2 = e.node(C2); j2 && (w.push({ id: C2, node: j2, parent: h2.get(C2) }), e.removeNode(C2)); }); let k2 = f2.filter(({ edge: C2 }) => b.includes(C2.v) || b.includes(C2.w)), _2 = o[g]; m && (i.push({ clusterId: g, subgraph: m._dagreClusterSubgraph, bounds: _2, children: b, removedNodes: w, removedEdges: k2 }), m.width = _2.width, m.height = _2.height); }); let p = /* @__PURE__ */ new Set(); f2.forEach(({ edge: b, label: g }) => { let m = c(b.v), w = c(b.w); if (m !== w && e.hasNode(m) && e.hasNode(w)) { let k2 = `${m}\0${w}`; p.has(k2) || (p.add(k2), e.setEdge(m, w, { ...g, width: 0, height: 0 })); } }); let E2 = jn(e), y2 = On(E2, n, t, (L2 = xn2.get(e)) != null ? L2 : null); xn2.set(e, y2), Cn(e, E2), p.forEach((b) => { let g = b.indexOf("\0"), m = b.slice(0, g), w = b.slice(g + 1); e.hasEdge(m, w) && e.removeEdge(m, w); }), i.forEach(({ clusterId: b, subgraph: g, bounds: m, removedNodes: w, removedEdges: k2 }) => { var G2, x2; let _2 = e.node(b), C2 = (G2 = _2 == null ? void 0 : _2.x) != null ? G2 : 0, j2 = (x2 = _2 == null ? void 0 : _2.y) != null ? x2 : 0, I2 = (m.minX + m.maxX) / 2, S2 = (m.minY + m.maxY) / 2; w.forEach(({ id: v, node: N2, parent: O2 }) => { e.setNode(v, N2), O2 !== void 0 && e.setParent(v, O2); }), k2.forEach(({ edge: v, label: N2 }) => { e.setEdge(v, N2); }), g.nodes().forEach((v) => { if (v === b) return; let N2 = g.node(v), O2 = e.node(v); O2 && N2 && typeof N2.x == "number" && typeof N2.y == "number" && (O2.x = C2 + (N2.x - I2), O2.y = j2 + (N2.y - S2)); }), delete _2._dagreClusterSubgraph; }), r.forEach((b) => { var w, k2; let g = e.node(b), m = o[b]; if (g && g.rankdir && g._dagreClusterSubgraph && m) { let _2 = g._dagreClusterSubgraph, C2 = (w = g.x) != null ? w : 0, j2 = (k2 = g.y) != null ? k2 : 0, I2 = (m.minX + m.maxX) / 2, S2 = (m.minY + m.maxY) / 2; _2.nodes().forEach((G2) => { if (G2 === b) return; let x2 = _2.node(G2), v = e.node(G2); if (v && x2 && typeof x2.x == "number" && typeof x2.y == "number") { let N2 = x2.x - I2, O2 = x2.y - S2; v.x = C2 + N2, v.y = j2 + O2; } }), delete g._dagreClusterSubgraph; } }); } function On(e, n, t, r = null) { var l3, u; let o = (t == null ? void 0 : t.useDynamic) !== false, i = o && (l3 = r == null ? void 0 : r.graph) != null ? l3 : null, s = o && (u = r == null ? void 0 : r.rawNodes) != null ? u : null; n(" makeSpaceForEdgeLabels", () => hr(e)), n(" removeSelfEdges", () => Nr(e)), n(" acyclic", () => Ue2(e, i)), n(" nestingGraph.run", () => un(e)), n(" rank", () => dn(Z(e))), n(" injectEdgeLabelProxies", () => br(e)), n(" removeEmptyRanks", () => Be2(e)), n(" nestingGraph.cleanup", () => fn2(e)), n(" normalizeRanks", () => We2(e)), n(" assignRankMinMax", () => gr(e)), n(" removeEdgeLabelProxies", () => pr(e)), n(" normalize.run", () => Ke2(e)), n(" parentDummyChains", () => ln(e)), n(" addBorderSegments", () => bn(e)), n(" order", () => re2(e, t, s)), n(" insertSelfEdges", () => Gr(e)), n(" adjustCoordinateSystem", () => pn(e)), n(" position", () => kn(e, t.corePath)), n(" positionSelfEdges", () => vr(e)); let a = JSON.parse(JSON.stringify(e._nodes)); return n(" removeBorderNodes", () => wr(e)), n(" normalize.undo", () => Qe2(e)), n(" fixupEdgeLabelCoords", () => Lr(e)), n(" undoCoordinateSystem", () => mn2(e)), n(" translateGraph", () => mr(e)), n(" assignNodeIntersects", () => Er(e)), n(" reversePoints", () => yr(e)), n(" acyclic.undo", () => Je2(e)), { graph: e, rawNodes: a }; } function Cn(e, n) { e.nodes().forEach((t) => { let r = e.node(t), o = n.node(t); r && (r.x = o.x, r.y = o.y, r.order = o.order, r.rank = o.rank, n.children(t).length && (r.width = o.width, r.height = o.height)); }), e.edges().forEach((t) => { let r = e.edge(t), o = n.edge(t); r.points = o.points, Object.hasOwn(o, "x") && (r.x = o.x, r.y = o.y); }), e.graph().width = n.graph().width, e.graph().height = n.graph().height; } var sr = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"]; var ar = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "TB", rankalign: "center" }; var dr = ["acyclicer", "ranker", "rankdir", "align", "rankalign"]; var lr = ["width", "height", "rank"]; var Tn2 = { width: 0, height: 0 }; var ur = ["minlen", "weight", "width", "height", "labeloffset"]; var cr = { minlen: 1, weight: 1, width: 0, height: 0, labeloffset: 10, labelpos: "r" }; var fr = ["labelpos"]; function jn(e) { let n = new T2({ multigraph: true, compound: true }), t = _e2(e.graph()); return n.setGraph(Object.assign({}, ar, xe2(t, sr), B2(t, dr))), e.nodes().forEach((r) => { let o = _e2(e.node(r)), i = xe2(o, lr); Object.keys(Tn2).forEach((a) => { i[a] === void 0 && (i[a] = Tn2[a]); }), n.setNode(r, i); let s = e.parent(r); s !== void 0 && n.setParent(r, s); }), e.edges().forEach((r) => { let o = _e2(e.edge(r)); n.setEdge(r, Object.assign({}, cr, xe2(o, ur), B2(o, fr))); }), n; } function hr(e) { let n = e.graph(); n.ranksep /= 2, e.edges().forEach((t) => { var o; let r = e.edge(t); r.minlen *= 2, ((o = r.labelpos) != null ? o : "r").toLowerCase() !== "c" && (n.rankdir === "TB" || n.rankdir === "BT" ? r.width += r.labeloffset : r.height += r.labeloffset); }); } function br(e) { e.edges().forEach((n) => { let t = e.edge(n); if (t.width && t.height) { let r = e.node(n.v), i = { rank: (e.node(n.w).rank - r.rank) / 2 + r.rank, e: n }; M(e, "edge-proxy", i, "_ep"); } }); } function gr(e) { let n = 0; e.nodes().forEach((t) => { let r = e.node(t); r.borderTop && (r.minRank = e.node(r.borderTop).rank, r.maxRank = e.node(r.borderBottom).rank, n = Math.max(n, r.maxRank)); }), e.graph().maxRank = n; } function pr(e) { e.nodes().forEach((n) => { let t = e.node(n); if (t.dummy === "edge-proxy") { let r = t; e.edge(r.e).labelRank = t.rank, e.removeNode(n); } }); } function mr(e) { let n = Number.POSITIVE_INFINITY, t = 0, r = Number.POSITIVE_INFINITY, o = 0, i = e.graph(), s = i.marginx || 0, a = i.marginy || 0; function l3(u) { let d = u.x, c = u.y, f2 = u.width, h2 = u.height; n = Math.min(n, d - f2 / 2), t = Math.max(t, d + f2 / 2), r = Math.min(r, c - h2 / 2), o = Math.max(o, c + h2 / 2); } e.nodes().forEach((u) => l3(e.node(u))), e.edges().forEach((u) => { let d = e.edge(u); Object.hasOwn(d, "x") && l3(d); }), n -= s, r -= a, e.nodes().forEach((u) => { let d = e.node(u); d.x -= n, d.y -= r; }), e.edges().forEach((u) => { let d = e.edge(u); d.points.forEach((c) => { c.x -= n, c.y -= r; }), Object.hasOwn(d, "x") && (d.x -= n), Object.hasOwn(d, "y") && (d.y -= r); }), i.width = t - n + s, i.height = o - r + a; } function Er(e) { e.edges().forEach((n) => { if (n.v === n.w) return; let t = e.edge(n), r = e.node(n.v), o = e.node(n.w), i, s; t.points ? (i = t.points[0], s = t.points[t.points.length - 1]) : (t.points = [], i = o, s = r), t.points.unshift(se2(r, i)), t.points.push(se2(o, s)); }); } function Lr(e) { e.edges().forEach((n) => { let t = e.edge(n); if (Object.hasOwn(t, "x")) switch ((t.labelpos === "l" || t.labelpos === "r") && (t.width -= t.labeloffset), t.labelpos) { case "l": t.x -= t.width / 2 + t.labeloffset; break; case "r": t.x += t.width / 2 + t.labeloffset; break; } }); } function yr(e) { e.edges().forEach((n) => { let t = e.edge(n); t.reversed && t.points.reverse(); }); } function wr(e) { e.nodes().forEach((n) => { if (e.children(n).length) { let t = e.node(n), r = e.node(t.borderTop), o = e.node(t.borderBottom), i = e.node(t.borderLeft[t.borderLeft.length - 1]), s = e.node(t.borderRight[t.borderRight.length - 1]); t.width = Math.abs(s.x - i.x), t.height = Math.abs(o.y - r.y), t.x = i.x + t.width / 2, t.y = r.y + t.height / 2; } }), e.nodes().forEach((n) => { e.node(n).dummy === "border" && e.removeNode(n); }); } function Nr(e) { e.edges().forEach((n) => { if (n.v === n.w) { let t = e.node(n.v); t.selfEdges || (t.selfEdges = []), t.selfEdges.push({ e: n, label: e.edge(n) }), e.removeEdge(n); } }); } function Gr(e) { P2(e).forEach((t) => { let r = 0; t.forEach((o, i) => { let s = e.node(o); typeof s.rank != "number" && (s.rank = 0), s.order = i + r, (s.selfEdges || []).forEach((a) => { M(e, "selfedge", { width: a.label.width, height: a.label.height, rank: s.rank, order: i + ++r, e: a.e, edgeLabel: a.label }, "_se"), (!Array.isArray(a.label.points) || a.label.points.length !== 7) && (a.label.points = [{ x: 0, y: -10 }, { x: 0, y: -10 }, { x: 0, y: 0 }, { x: 0, y: 10 }, { x: 0, y: 10 }, { x: 0, y: 0 }, { x: 0, y: 0 }]); }), delete s.selfEdges; }); }); } function vr(e) { e.nodes().forEach((n) => { let t = e.node(n), r = (o) => typeof o == "number" && isFinite(o); if (t.dummy === "selfedge") { let o = t, i = e.node(o.e.v), s = r(i == null ? void 0 : i.x) ? i.x : 0, a = r(i == null ? void 0 : i.y) ? i.y : 0, l3 = r(i == null ? void 0 : i.width) ? i.width : 0, u = r(i == null ? void 0 : i.height) ? i.height : 0, d = r(t.x) ? t.x : s, c = r(t.y) ? t.y : a, f2 = l3 / 2, h2 = u / 2; o.edgeLabel.points = [{ x: d + f2, y: c - h2 }, { x: d + f2, y: c - h2 }, { x: d, y: c }, { x: d - f2, y: c + h2 }, { x: d - f2, y: c + h2 }, { x: d, y: c }, { x: d, y: c }], o.edgeLabel.x = d, o.edgeLabel.y = c, e.setEdge(o.e, o.edgeLabel), e.removeNode(n); } else t && Array.isArray(t.selfEdges) && t.selfEdges.forEach((o) => { if (!Array.isArray(o.label.points) || o.label.points.length !== 7) { let i = r(t.x) ? t.x : 0, s = r(t.y) ? t.y : 0, a = r(t.width) ? t.width : 0, l3 = r(t.height) ? t.height : 0, u = a / 2, d = l3 / 2; o.label.points = [{ x: i + u, y: s - d }, { x: i + u, y: s - d }, { x: i, y: s }, { x: i - u, y: s + d }, { x: i - u, y: s + d }, { x: i, y: s }, { x: i, y: s }]; } }); }); } function xe2(e, n) { return X2(B2(e, n), Number); } function _e2(e) { let n = {}; return e && Object.entries(e).forEach(([t, r]) => { typeof t == "string" && (t = t.toLowerCase()), n[t] = r; }), n; } function Ce2(e) { let n = P2(e), t = new T2({ compound: true, multigraph: true }).setGraph({}); return e.nodes().forEach((r) => { t.setNode(r, { label: r }), t.setParent(r, "layer" + e.node(r).rank); }), e.edges().forEach((r) => t.setEdge(r.v, r.w, {}, r.name)), n.forEach((r, o) => { let i = "layer" + o; t.setNode(i, { rank: "same" }), r.reduce((s, a) => (t.setEdge(s, a, { style: "invis" }), a)); }), t; } var kr = { graphlib: ie2, version: ue2, layout: Oe2, debug: Ce2, util: { time: le2, notime: q2 } }; var $o = kr; // src/components/flow.js var FS2 = 13; var LH2 = 17; var TEXT_MAX = 150; var EDGE_FS = 11.5; var CLUSTER_FS = 11; var CLUSTER_LABEL_H = 15; var DIRS = /* @__PURE__ */ new Set(["TB", "LR", "BT", "RL"]); var BRACKETS = [ { open: "[(", close: ")]", shape: "db" }, { open: "[", close: "]", shape: "rect" }, { open: "(", close: ")", shape: "round" }, { open: "{", close: "}", shape: "diamond" } ]; var ARROW = /^\s*(-->|->)\s*/; var flow_default = { name: "flow", summary: "Flowchart / architecture diagram (automatic layout)", syntax: `\`\`\`flow [TB|LR|BT|RL] A -> B: label \u2190 solid line; text after the colon is the edge label A --> C \u2190 dashed line A -> B -> C \u2190 chain A -> B & C \u2190 fan-out (Start) {Valid?} [(Database)] [text with: a colon] \u2190 rounded / diamond / cylinder / rectangle *Key node \u2190 * prefix highlights group Group name: B, C \u2190 draw a group box around nodes \`\`\` - The text inside the brackets is the node's identity; later lines can refer to the node by that text alone. The default direction is TB (top to bottom). - Change markers show what a plan adds, removes and changes. A line can start with + (added), - (removed) or ~ (changed), followed by a space: \`\`\`flow LR Client -> Gateway + Gateway -> [(Cache)]: lookup + Cache -> Service: miss - Gateway -> Service ~ *Service \`\`\` - A marker applies to every link on its line. A node is removed when it appears only on - lines, added when it appears only on + lines, and unchanged when it also appears on an unmarked line, even if its links changed. ~ Node on a line without an arrow marks that node as changed. - ~ on a line with an arrow is an error: remove the old link with - and add the new one with +. That is also how a link's label changes. The same link both unmarked and marked is an error too. - + group Name: A, B and - group Name: A, B mark a group box. A group that is not removed and holds only removed nodes is a warning. Markers combine with * and every shape bracket. - The Changes view draws added in the theme's ok color, removed faded with a struck-through label, changed with a warn outline, and each marked node with a +, \u2212 or ~ badge. A count row and a Before / Changes / After switch sit under the diagram: Before and After show the diagram as it was and as it will be, plain and without the items that are not in that view. - A line that starts with a marker and a space is always read as a marker. To keep a node name that starts with "- ", write it in brackets: [- Gateway].`, example: "```flow LR\n(User) -> Gateway: HTTPS\nGateway -> Auth & *Service\nService -> [(Database)]\ngroup Backend: Auth, Service\n```", render(text, { args, uid, ui, warn, video, dir: pageDir = "ltr" }) { const model = parseFlow(text); model.warnings.forEach((w) => warn?.(w)); const flowDir = (args.match(/\b(TB|LR|BT|RL)\b/i)?.[1] ?? "TB").toUpperCase(); const html = `${layout2(model, DIRS.has(flowDir) ? flowDir : "TB", uid(), ui, pageDir)}`; return withDelta(html, [...model.nodes.values(), ...model.edges, ...model.groups].map((x2) => x2.state ?? null), { ui, video }); } }; function parseFlow(text) { const nodes = /* @__PURE__ */ new Map(); const edges = []; const groups = []; const upsert = (spec, line, mark) => { const prev = nodes.get(spec.id); const seen = { before: mark !== "+", after: mark !== "-", tilde: mark === "~" }; if (!prev) nodes.set(spec.id, { ...spec, ...seen, line }); else { const merged = { before: prev.before || seen.before, after: prev.after || seen.after, tilde: prev.tilde || seen.tilde }; nodes.set(spec.id, { ...prev, ...merged, shape: spec.explicit ? spec.shape : prev.shape, hi: prev.hi || spec.hi }); } return spec.id; }; for (const { text: raw, line } of contentLines(text)) { const { mark, text: t } = splitMarker(raw); const g = t.match(/^group\s+(.+?)\s*[:：]\s*(.+)$/i); if (g) { if (mark === "~") throw new ComponentError("flow: ~ marks a node, not a group. Use + group or - group to add or remove a group box", line); const state = markState(mark); groups.push({ name: g[1], members: g[2].split(/[,，]/).map((s) => s.trim()).filter(Boolean), line, ...state && { state } }); continue; } const { chain, label } = parseChain(t, line); if (mark === "~" && chain.length > 1) { throw new ComponentError('flow: ~ marks a node, not a link. To change a link, remove the old one and add the new one: "- A -> B" then "+ A -> C"', line); } const ids = chain.map((step) => ({ ...step, ids: step.nodes.map((n) => upsert(n, line, mark)) })); for (let k2 = 1; k2 < ids.length; k2++) { const isLast = k2 === ids.length - 1; for (const from of ids[k2 - 1].ids) { for (const to of ids[k2].ids) { const state = markState(mark); edges.push({ from, to, dashed: ids[k2].arrow === "-->", label: isLast ? label : "", line, ...state && { state } }); } } } } if (!nodes.size) throw new ComponentError("flow needs at least one node", 1); for (const grp of groups) { const missing = grp.members.filter((m) => !nodes.has(m)); if (missing.length) throw new ComponentError(`group ${grp.name} refers to nodes that do not exist: ${missing.join(", ")}`, grp.line); } checkLinks(edges); const settled = new Map([...nodes].map(([id, n]) => { const state = nodeState(n); return [id, state ? { ...n, state } : n]; })); return { nodes: settled, edges, groups, warnings: groupWarnings(groups, settled) }; } function nodeState({ before, after, tilde }) { if (before && !after) return "removed"; if (after && !before) return "added"; return tilde ? "changed" : null; } function checkLinks(edges) { const key = (e) => `${e.from}\0${e.to}`; for (const e of edges.filter((x2) => x2.state)) { const plain = edges.find((x2) => !x2.state && key(x2) === key(e)); if (plain) throw new ComponentError(`flow: the link ${e.from} -> ${e.to} is written unmarked on line ${plain.line} and as ${e.state === "added" ? "+" : "-"} here. Mark every line of that link, or none`, e.line); } } function groupWarnings(groups, nodes) { return groups.filter((g) => g.state !== "removed" && g.members.every((m) => nodes.get(m).state === "removed")).map((g) => ({ line: g.line, message: `group ${g.name} holds only removed nodes and would be an empty box after the change. Mark it with "- group ${g.name}: ${g.members.join(", ")}"` })); } function parseChain(t, line) { const chain = []; let pos = 0; let arrow = null; for (; ; ) { const group = []; for (; ; ) { const { node, end } = parseNode(t, pos, line); group.push(node); pos = end; const amp = t.slice(pos).match(/^\s*&\s*/); if (!amp) break; pos += amp[0].length; } chain.push({ arrow, nodes: group }); const a = t.slice(pos).match(ARROW); if (!a) break; arrow = a[1]; pos += a[0].length; } const rest = t.slice(pos).trim(); if (rest && !/^[:：]/.test(rest)) { throw new ComponentError(`flow cannot parse "${t}". Write a link as A -> B: label`, line); } return { chain, label: rest.replace(/^[:：]\s*/, "") }; } function parseNode(t, start, line) { let pos = start + t.slice(start).match(/^\s*/)[0].length; const hi = t[pos] === "*"; if (hi) pos++; const bracket = BRACKETS.find((b) => t.startsWith(b.open, pos)); let label; let end; if (bracket) { const close = t.indexOf(bracket.close, pos + bracket.open.length); if (close === -1) throw new ComponentError(`flow: unclosed shape bracket, missing ${bracket.close}`, line); label = t.slice(pos + bracket.open.length, close).trim(); end = close + bracket.close.length; } else { const m = t.slice(pos).match(/^(.*?)(?=\s*(?:-->|->|&|[:：]|$))/); label = m[1].trim(); end = pos + m[0].length; } if (!label) throw new ComponentError(`flow has an empty node: "${t}"`, line); return { node: { id: label, label, shape: bracket?.shape ?? "rect", explicit: Boolean(bracket), hi }, end }; } function nodeSize(node) { const lines = wrap(node.label, TEXT_MAX, FS2); const tw = Math.max(...lines.map((l3) => measure(l3, FS2))); const th = lines.length * LH2; const w = Math.max(tw + 28, 64); const h2 = th + 18; const size = { rect: [w, h2], round: [w + 12, h2], diamond: [(tw + 28) * 1.5, h2 * 1.6], db: [w, h2 + 14] }[node.shape]; return { lines, width: size[0], height: size[1] }; } var nodeKey = (i) => `n${i}`; var gkey = (i) => `g${i}`; var reserveKey = (i) => `r${i}`; function runLayout({ nodes, edges, groups }, rankdir, rtl, widths, reserve) { const g = new $o.graphlib.Graph({ compound: groups.length > 0, multigraph: true }); g.setGraph({ rankdir, nodesep: 36, ranksep: 46, marginx: 14, marginy: groups.length ? 26 : 14 }); g.setDefaultEdgeLabel(() => ({})); const key = new Map([...nodes.keys()].map((name, i) => [name, nodeKey(i)])); const sizes = /* @__PURE__ */ new Map(); for (const n of nodes.values()) { const s = nodeSize(n); sizes.set(n.id, s); g.setNode(key.get(n.id), { width: s.width, height: s.height }); } const vertical = rankdir === "TB" || rankdir === "BT"; groups.forEach((grp, i) => { g.setNode(gkey(i), { label: grp.name }); grp.members.forEach((m) => g.setParent(key.get(m), gkey(i))); if (!reserve.has(i) || !vertical) return; g.setNode(reserveKey(i), { width: widths[i] + 4, height: CLUSTER_LABEL_H }); g.setParent(reserveKey(i), gkey(i)); const down = edges.map((e) => rankdir === "TB" ? [e.from, e.to] : [e.to, e.from]); const link = (a, b, name) => rankdir === "TB" ? g.setEdge(a, b, {}, name) : g.setEdge(b, a, {}, name); const inside = new Set(grp.members); const first = grp.members.filter((m) => !down.some(([a, b]) => b === m && a !== m && inside.has(a))); (first.length ? first : grp.members.slice(0, 1)).forEach((m, k2) => { link(reserveKey(i), key.get(m), `r${i}-${k2}`); down.forEach(([a, b], j2) => { if (b === m && !inside.has(a)) link(key.get(a), reserveKey(i), `r${i}-${k2}-${j2}`); }); }); }); edges.forEach((e, i) => { const label = e.label ? { label: e.label, width: measure(e.label, EDGE_FS) + 12, height: 18, labelpos: "c" } : {}; g.setEdge(key.get(e.from), key.get(e.to), label, `e${i}`); }); $o.layout(g); if (rtl) mirrorLayout(g); if (!vertical) { for (const [i, side] of reserve) { const c = g.node(gkey(i)); insertStrip(g, side === "top" ? top(c) + 2 : top(c) + c.height - 2, CLUSTER_LABEL_H + 3); } } return { g, key, sizes }; } function insertStrip(g, y2, d) { for (const v of g.nodes()) { const n = g.node(v); if (v.startsWith("g") && top(n) < y2 && top(n) + n.height > y2) { n.height += d; n.y += d / 2; } else if (n.y > y2) n.y += d; } for (const e of g.edges()) { const edge = g.edge(e); edge.points = edge.points.map((p) => p.y > y2 ? { ...p, y: p.y + d } : p); if (edge.y !== void 0 && edge.y > y2) edge.y += d; } g.graph().height += d; } var top = (n) => n.y - n.height / 2; function placeLabels({ g, key, sizes }, { nodes, edges, groups }, widths, rtl, reserve) { const boxes = []; for (const n of nodes.values()) { const { x: x2, y: y2 } = g.node(key.get(n.id)); const { width: w, height: h2 } = sizes.get(n.id); boxes.push([x2 - w / 2, y2 - h2 / 2, x2 + w / 2, y2 + h2 / 2]); } const segments = []; edges.forEach((e, i) => { const data = g.edge({ v: key.get(e.from), w: key.get(e.to), name: `e${i}` }); const pts = data.points; for (let k2 = 1; k2 < pts.length; k2++) segments.push([pts[k2 - 1], pts[k2]]); if (e.label) { const w = measure(e.label, EDGE_FS) + 10; boxes.push([data.x - w / 2, data.y - 9, data.x + w / 2, data.y + 9]); } }); return groups.map((grp, i) => { const c = g.node(gkey(i)); const left = c.x - c.width / 2; const right = left + c.width; const w = widths[i]; const own = grp.state ? [[rtl ? left - 8 : right - 8, top(c) - 8, rtl ? left + 8 : right + 8, top(c) + 8]] : []; const free = (x02, y0, y1) => { const box = [x02 - 5, y0 - 2, x02 + w + 5, y1 + 2]; const wide = [x02 - 10, y0 - 2, x02 + w + 10, y1 + 2]; return ![...boxes, ...own].some((b) => overlaps(wide, b)) && !segments.some(([p, q3]) => segmentHits(p, q3, box)); }; const room = g.hasNode(reserveKey(i)) ? g.node(reserveKey(i)) : null; const baselines = reserve.get(i) === "bottom" ? [top(c) + c.height - 6] : room ? [top(c) + 14, room.y + 4] : [top(c) + 14]; for (const baseline2 of baselines) { const [y0, y1] = [baseline2 - 11, baseline2 + 4]; for (let s = 0; s <= Math.max(0, c.width - 16 - w); s += 4) { const x02 = rtl ? right - 8 - w - s : left + 8 + s; if (free(x02, y0, y1)) { boxes.push([x02, y0, x02 + w, y1]); return [rtl ? x02 + w : x02, baseline2]; } } } if (!room) return null; const baseline = baselines.at(-1); const x0 = room.x - w / 2; boxes.push([x0, baseline - 11, x0 + w, baseline + 4]); return [rtl ? x0 + w : x0, baseline]; }); } var overlaps = (a, b) => a[0] < b[2] && b[0] < a[2] && a[1] < b[3] && b[1] < a[3]; function segmentHits(p, q3, [x0, y0, x1, y1]) { const dx = q3.x - p.x; const dy = q3.y - p.y; let t0 = 0; let t1 = 1; for (const [a, b] of [[-dx, p.x - x0], [dx, x1 - p.x], [-dy, p.y - y0], [dy, y1 - p.y]]) { if (a === 0) { if (b < 0) return false; } else { const t = b / a; if (a < 0) t0 = Math.max(t0, t); else t1 = Math.min(t1, t); if (t0 > t1) return false; } } return true; } var labelWidth = (name, pageDir) => measure(name, CLUSTER_FS, { mono: pageDir !== "rtl" }) + 2; function layout2(model, rankdir, id, ui, pageDir = "ltr") { const { nodes, edges, groups } = model; const rtl = pageDir === "rtl"; const widths = groups.map((grp) => labelWidth(grp.name, pageDir)); let run2 = runLayout(model, rankdir, rtl, widths, /* @__PURE__ */ new Set()); let spots = placeLabels(run2, model, widths, rtl, /* @__PURE__ */ new Map()); const reserve = /* @__PURE__ */ new Map(); for (const side of ["top", "bottom"]) { const crowded = spots.flatMap((s, i) => s ? [] : [i]); if (!crowded.length) break; for (const i of crowded) reserve.set(i, side); run2 = runLayout(model, rankdir, rtl, widths, reserve); spots = placeLabels(run2, model, widths, rtl, reserve); } const { g, key, sizes } = run2; const clusters = groups.map((grp, i) => { const c = g.node(gkey(i)); const x2 = c.x - c.width / 2; const y2 = c.y - c.height / 2; const mark = deltaAttr(grp.state); const badgeX = rtl ? x2 : x2 + c.width; const [labelX, labelY] = spots[i] ?? [rtl ? x2 + c.width - 8 : x2 + 8, y2 + 14]; return `${esc(svgLine(grp.name, pageDir))}${badgeSvg(grp.state, badgeX, y2)}`; }); const stepOf = new Map([.../* @__PURE__ */ new Set([...[...nodes.values()].map((n) => n.line), ...edges.map((e) => e.line)])].sort((a, b) => a - b).map((l3, k2) => [l3, k2])); const edgeSvg = edges.map((e, i) => { const data = g.edge({ v: key.get(e.from), w: key.get(e.to), name: `e${i}` }); const pts = clipEnds(data.points, g.node(key.get(e.from)), nodes.get(e.from).shape, g.node(key.get(e.to)), nodes.get(e.to).shape); const head = e.state ? `${id}-arrow-${e.state}` : `${id}-arrow`; const path = ``; const open = ``; if (!e.label) return `${open}${path}`; const w = measure(e.label, EDGE_FS) + 10; return `${open}${path}${textLines([e.label], data.x, data.y, LH2, "", pageDir)}`; }); const nodeSvg = [...nodes.values()].map((n) => { const { x: x2, y: y2 } = g.node(key.get(n.id)); const { width: w, height: h2, lines } = sizes.get(n.id); const badge = badgeSvg(n.state, ...badgePoint(n.shape, x2, y2, w, h2, rtl)); return `${shapeSvg(n.shape, x2, y2, w, h2)}${textLines(lines, x2, y2 + (n.shape === "db" ? 4 : 0), LH2, "", pageDir)}${badge}`; }); const { width, height } = g.graph(); const label = diagramLabel(ui, "flow", [...nodes.keys()].slice(0, 8)); const heads = ["added", "removed"].filter((state) => edges.some((e) => e.state === state)); return `${svgOpen(width, height, label, pageDir)}${arrowDefs(id, heads)}${clusters.join("")}${edgeSvg.join("")}${nodeSvg.join("")}`; } function badgeSvg(state, x2, y2) { if (!state) return ""; return `${SIGN[state]}`; } function badgePoint(shape, x2, y2, w, h2, rtl = false) { const s = rtl ? -1 : 1; if (shape === "diamond") return [x2 + s * (w / 4), y2 - h2 / 4]; if (shape === "round") return [x2 + s * (w / 2 - h2 * 0.15), y2 - h2 / 2 + h2 * 0.15]; return [x2 + s * (w / 2), y2 - h2 / 2]; } function shapeSvg(shape, x2, y2, w, h2) { const l3 = x2 - w / 2; const t = y2 - h2 / 2; if (shape === "diamond") { return ``; } if (shape === "db") { const ry = 7; return ``; } const rx = shape === "round" ? h2 / 2 : 3; return ``; } function clipEnds(points, from, fromShape, to, toShape) { const pts = points.map((p) => ({ ...p })); if (fromShape === "diamond" && pts.length > 1) pts[0] = diamondPoint(from, pts[1]); if (toShape === "diamond" && pts.length > 1) pts[pts.length - 1] = diamondPoint(to, pts[pts.length - 2]); return pts; } function diamondPoint(node, toward) { const dx = toward.x - node.x; const dy = toward.y - node.y; const k2 = Math.abs(dx) / (node.width / 2) + Math.abs(dy) / (node.height / 2); if (k2 === 0) return { x: node.x, y: node.y }; return { x: node.x + dx / k2, y: node.y + dy / k2 }; } // src/components/er.js var FS3 = 13; var FIELD_FS = 12; var KEY_FS = 11; var EDGE_FS2 = 11.5; var LH3 = 17; var HEAD_LH = 20; var FIELD_LH = 17; var PAD = 11; var KEY_GAP = 12; var SIGN_W = 14; var MIN_WIDTH = 92; var LOOP_OUT = 34; var LOOP_STEP = 20; var LOOP_END = 18; var LOOP_LABEL = 24; var LOOP_GAP = 6; var DIRS2 = /* @__PURE__ */ new Set(["TB", "LR", "BT", "RL"]); var CARDS = ["1\\.\\.\\*", "0\\.\\.1", "\\*", "1"]; var MARKERS = /* @__PURE__ */ new Set(["PK", "FK", "UK"]); var RELATIONSHIP = new RegExp(`^(\\S+)\\s+(${CARDS.join("|")})\\s*--\\s*(${CARDS.join("|")})\\s+(\\S+)\\s*(?::\\s*(.*))?$`); var MERMAID = /^(\S+)\s+([|o{}]{2})(?:--|\.\.)([|o{}]{2})\s+(\S+)\s*(?::\s*(.*))?$/; var MERMAID_CARDS = { "||": "1", "o|": "0..1", "|o": "0..1", "|{": "1..*", "}|": "1..*", "o{": "*", "}o": "*" }; var er_default = { name: "er", summary: "Entity relationship diagram (automatic layout, crow's-foot ends)", syntax: `\`\`\`er [TB|LR|BT|RL] *User \u2190 a line at column 0 is an entity; * highlights it id PK \u2190 an indented line is a field: name [type] [PK|FK|UK] email string UK Order id PK user_id FK -> User \u2190 FK -> Entity draws the many-to-one relationship (*--1) User 1--* Order: places \u2190 A -- B: label (optional) \`\`\` - Cardinalities are 1, 0..1, * and 1..*. The left end is drawn at the entity on the left, the right end at the entity on the right. - A field's FK -> Entity already draws its relationship, so a relationship line is optional. A relationship line that names the same two entities replaces the implied one and sets the cardinality and the label. Two FK fields that point at the same entity draw two relationships. - The type is optional: \`email UK\` is a field with a key but no type. - A Mermaid line such as USER ||--o{ ORDER is an error that shows the line written for this component. - An entity a field or a relationship names must be written at column 0. - A field that points at its own entity draws a loop: beside the box, or below it in LR and RL. - The default direction is TB (top to bottom). - Change markers show what a plan adds, removes and changes. A line can start with + (added), - (removed) or ~ (changed), followed by a space: an entity line at column 0, a field line after its indentation, or a relationship line: \`\`\`er User ~ email varchar(320) UK + phone string Order + coupon_id FK -> Coupon - legacy_ref string + Coupon id PK - AuditLog id PK + User 1--* Coupon: owns \`\`\` - An entity is marked only by its own line; a marked field does not mark it. The fields of a + or - entity inherit its marker, and a field with another marker is an error. ~ marks a field as changed and does not show the old value. Markers combine with *. - A relationship from an FK field takes the marker of that field; otherwise it is added or removed with an entity at either end. A written relationship line takes its own marker. To change one, remove the old line with - and add the new one with +; ~ on a relationship line is an error. - The Changes view draws added in the theme's ok color, removed faded with struck-through text, changed with a warn outline, and each marked entity with a +, \u2212 or ~ badge. A marked field row gets a tinted band and its sign at the start of the row. A count row (entities, fields and written relationship lines) and a Before / Changes / After switch sit under the diagram: Before and After show the schema as it was and as it will be, plain and without the items that are not in that view. - A line that starts with a marker and a space is always read as a marker.`, example: "```er LR\n*User\n id PK\n email string UK\nOrder\n id PK\n user_id FK -> User\nUser 1--* Order: places\n```", render(text, { args, ui, video, dir: pageDir = "ltr" }) { const model = parseEr(text); const dir = (args.match(/\b(TB|LR|BT|RL)\b/i)?.[1] ?? "TB").toUpperCase(); const html = `${layout3(model, DIRS2.has(dir) ? dir : "TB", ui, pageDir)}`; const states = [...model.entities.values()].flatMap((e) => [e.state, ...e.fields.map((x2) => x2.state)]).concat(model.written.map((rel) => rel.state)); return withDelta(html, states.map((state) => state ?? null), { ui, video }); } }; function parseEr(text) { const entities = /* @__PURE__ */ new Map(); const written = []; let current = null; for (const { raw, text: line, line: n } of contentLines(text)) { const { mark, text: body } = splitMarker(line); const state = markState(mark); if (/^\s/.test(raw)) { if (!current) throw new ComponentError(`"${line}": a field line must follow an entity; write the entity name at the start of its own line first`, n); current.fields.push(settleField(parseField(body, n), mark, current, n)); continue; } const rel = body.match(RELATIONSHIP); if (rel) { if (mark === "~") throw new ComponentError('er: ~ marks an entity or a field, not a relationship. To change a relationship, remove the old line and add the new one: "- A 1--* B" then "+ A 1--1 B"', n); written.push({ from: rel[1], fromCard: rel[2], to: rel[4], toCard: rel[3], label: rel[5]?.trim() ?? "", line: n, ...state && { state } }); current = null; continue; } const mermaid = body.match(MERMAID); if (mermaid && MERMAID_CARDS[mermaid[2]] && MERMAID_CARDS[mermaid[3]]) { throw new ComponentError(`"${line}" is Mermaid syntax; write ${mark && mark !== "~" ? `${mark} ` : ""}${erLineOf(mermaid)}`, n); } if (body.includes("--") || body.includes("{") || body.includes("}")) { throw new ComponentError(`"${line}" is not an entity of this component; write A 1--* B for a relationship, or the entity name at column 0 on its own line`, n); } const hi = body.startsWith("*"); const name = (hi ? body.slice(1) : body).trim(); if (!name) throw new ComponentError("an entity needs a name", n); if (entities.has(name)) throw new ComponentError(`entity "${name}" is written twice`, n); current = { name, hi, fields: [], line: n, ...state && { state } }; entities.set(name, current); } if (!entities.size) throw new ComponentError("an entity relationship diagram needs at least one entity (a line at column 0)", 1); for (const entity of entities.values()) { for (const field of entity.fields) { if (field.ref && !entities.has(field.ref)) throw new ComponentError(`no entity "${field.ref}"; write it at column 0`, field.line); } } for (const rel of written) { for (const name of [rel.from, rel.to]) { if (!entities.has(name)) throw new ComponentError(`no entity "${name}"; write it at column 0`, rel.line); } } checkEnds(entities, written); return { entities, written }; } function checkEnds(entities, written) { const replaced = new Set(written.map((rel) => pairKey(rel.from, rel.to))); const implied = [...entities.values()].flatMap((entity) => entity.fields.filter((field) => field.ref && !replaced.has(pairKey(entity.name, field.ref))).map((field) => ({ from: entity.name, to: field.ref, line: field.line, state: field.state === "changed" ? void 0 : field.state }))); for (const rel of [...implied, ...written]) { const ends = [rel.from, rel.to].map((name) => entities.get(name)); const added = ends.find((e) => e.state === "added"); const removed = ends.find((e) => e.state === "removed"); if (rel.state === "added" && removed) { throw new ComponentError(`er: the + relationship ${rel.from} to ${rel.to} touches the removed entity ${removed.name}, so it would dangle in the After view. Remove the + or keep ${removed.name}`, rel.line); } if (rel.state === "removed" && added) { throw new ComponentError(`er: the - relationship ${rel.from} to ${rel.to} touches the added entity ${added.name}, so it would dangle in the Before view. Remove the - or do not add ${added.name}`, rel.line); } if (!rel.state && added && removed) { throw new ComponentError(`er: the relationship ${rel.from} to ${rel.to} joins the added entity ${added.name} and the removed entity ${removed.name}, so it exists in neither view. Remove it or change an entity marker`, rel.line); } } } function settleField(field, mark, entity, n) { const own = markState(mark); const inherited = entity.state === "added" || entity.state === "removed" ? entity.state : null; if (inherited && own && own !== inherited) { throw new ComponentError(`er: "${mark}" under the ${inherited} entity ${entity.name} contradicts it. The fields of a ${inherited} entity are ${inherited} too; remove the marker or move the field`, n); } const state = inherited ?? own; return state ? { ...field, state } : field; } function parseField(line, n) { const tokens = line.split(/\s+/); const name = tokens.shift(); const arrow = tokens.indexOf("->"); const head = arrow === -1 ? tokens : tokens.slice(0, arrow); const ref = arrow === -1 ? null : tokens[arrow + 1]; if (arrow !== -1 && (ref === void 0 || arrow + 2 !== tokens.length)) { throw new ComponentError(`"${line}": write the entity a field points at as "-> Entity", after the key marker`, n); } if (ref !== null && head.at(-1) !== "FK") { throw new ComponentError(`"${line}": only a FK field points at another entity; mark the field FK`, n); } const at3 = head.findIndex((t) => MARKERS.has(t)); if (at3 !== -1 && at3 !== head.length - 1) throw new ComponentError(`"${line}": "${head[at3]}" must be the last word before "->"`, n); const marker = at3 === -1 ? null : head[at3]; const type = head.slice(0, at3 === -1 ? head.length : at3).join(" "); return { name, type, marker, ref, line: n }; } function erLineOf(mermaid) { const [, from, left, right, to, label] = mermaid; const text = label?.trim(); return `${from} ${MERMAID_CARDS[left]}--${MERMAID_CARDS[right]} ${to}${text ? `: ${text}` : ""}`; } function relationships({ entities, written }) { const ends = (...names) => { const states = names.map((name) => entities.get(name).state); return ["removed", "added"].find((s) => states.includes(s)); }; const withState = (rel, state) => state ? { ...rel, state } : rel; const implied = []; for (const entity of entities.values()) { for (const field of entity.fields) { if (!field.ref) continue; const own = field.state === "changed" ? null : field.state; implied.push(withState({ from: entity.name, fromCard: "*", to: field.ref, toCard: "1", label: "", line: field.line }, own ?? ends(entity.name, field.ref))); } } const replaced = new Set(written.map((rel) => pairKey(rel.from, rel.to))); const lines = written.map((rel) => withState(rel, rel.state ?? ends(rel.from, rel.to) ?? implied.find((x2) => pairKey(x2.from, x2.to) === pairKey(rel.from, rel.to) && x2.state)?.state)); return [...implied.filter((rel) => !replaced.has(pairKey(rel.from, rel.to))), ...lines]; } var pairKey = (a, b) => [a, b].sort().join("\0"); var fieldText = (field) => field.type ? `${field.name} ${field.type}` : field.name; var nameWidth = (entity) => measure(entity.name, FS3, { bold: true }); var rowWidth = (entity, field) => measure(fieldText(field), FIELD_FS, { bold: entity.hi }) + keyWidth(entity, field) + signWidth(entity) + 2 * PAD; var signWidth = (entity) => entity.fields.some((x2) => x2.state) ? SIGN_W : 0; var keyWidth = (entity, field) => field.marker ? measure(field.marker, KEY_FS, { mono: true, bold: entity.hi }) + KEY_GAP : 0; function nodeSize2(entity) { const rows = entity.fields.map((field) => rowWidth(entity, field)); return { width: Math.ceil(Math.max(MIN_WIDTH, nameWidth(entity) + 2 * PAD, ...rows)), height: HEAD_LH + entity.fields.length * FIELD_LH + 2 * PAD }; } function layout3(model, rankdir, ui, pageDir = "ltr") { const { entities } = model; const rels = relationships(model); const loops = rels.filter((rel) => rel.from === rel.to); const g = new $o.graphlib.Graph({ multigraph: true }); g.setGraph({ rankdir, nodesep: 44, ranksep: 62, marginx: 14, marginy: 14 }); g.setDefaultEdgeLabel(() => ({})); const key = new Map([...entities.keys()].map((name, i) => [name, `n${i}`])); const below = rankdir === "LR" || rankdir === "RL"; const room = /* @__PURE__ */ new Map(); if (below) { for (const name of entities.keys()) { const own = loops.filter((rel) => rel.from === name); if (own.length) room.set(name, loopRoom(own)); } } const sizes = /* @__PURE__ */ new Map(); for (const entity of entities.values()) { const size = nodeSize2(entity); sizes.set(entity.name, size); g.setNode(key.get(entity.name), { width: size.width, height: size.height + (room.get(entity.name) ?? 0) }); } const centre = (name) => { const { x: x2, y: y2 } = g.node(key.get(name)); return { x: x2, y: y2 - (room.get(name) ?? 0) / 2 }; }; rels.filter((rel) => rel.from !== rel.to).forEach((rel, i) => { const label2 = rel.label ? { label: rel.label, width: measure(rel.label, EDGE_FS2) + 10, height: 18, labelpos: "c" } : {}; g.setEdge(key.get(rel.from), key.get(rel.to), label2, `e${i}`); }); $o.layout(g); const rtl = pageDir === "rtl"; if (rtl) mirrorLayout(g); const steps = [.../* @__PURE__ */ new Set([...[...entities.values()].map((e) => e.line), ...rels.map((r) => r.line)])].sort((a, b) => a - b); const stepOf = new Map(steps.map((line, i) => [line, i])); const straight = rels.filter((rel) => rel.from !== rel.to).map((rel, i) => { const data = g.edge({ v: key.get(rel.from), w: key.get(rel.to), name: `e${i}` }); const points = data.points.map((p) => ({ ...p })); if (room.has(rel.from)) points[0] = clipToBox(centre(rel.from), sizes.get(rel.from), data.points[1]); if (room.has(rel.to)) points[points.length - 1] = clipToBox(centre(rel.to), sizes.get(rel.to), data.points[data.points.length - 2]); return { rel, data, points }; }); const edgeSvg = straight.map(({ rel, data, points }) => { const label2 = rel.label ? labelSvg(rel.label, data.x, data.y, pageDir) : ""; return `${endsSvg(points, rel)}${label2}`; }); const nodeSvg = [...entities.values()].map((entity) => { const { x: x2, y: y2 } = centre(entity.name); const size = sizes.get(entity.name); return nodeSvgOf(entity, x2, y2, size, stepOf.get(entity.line), pageDir); }); const s = rtl ? -1 : 1; const seen = /* @__PURE__ */ new Map(); const loopSpecs = loops.map((rel) => { const { nth, depth } = seen.get(rel.from) ?? { nth: 0, depth: 0 }; seen.set(rel.from, { nth: nth + 1, depth: depth + LOOP_STEP + (rel.label ? LOOP_LABEL : 0) }); const { x: x2, y: y2 } = centre(rel.from); const size = sizes.get(rel.from); return below ? loopBelow(rel, x2, y2, size, depth, s) : loopBeside(rel, x2, y2, size, nth, s); }); const loopsSvg = loopSpecs.map((spec) => loopSvg(spec, stepOf.get(spec.rel.line), pageDir)); const xs = []; const ys = []; const at3 = (x2, y2) => { xs.push(x2); ys.push(y2); }; for (const entity of entities.values()) { const { x: x2, y: y2 } = centre(entity.name); const size = sizes.get(entity.name); at3(x2 - size.width / 2, y2 - size.height / 2); at3(x2 + size.width / 2, y2 + size.height / 2); } straight.forEach(({ rel, data, points }) => { for (const p of points) at3(p.x, p.y); if (rel.label) { const w = labelWidth2(rel.label); at3(data.x - w / 2, data.y - 9); at3(data.x + w / 2, data.y + 9); } }); for (const { corners } of loopSpecs) corners.forEach(([x2, y2]) => at3(x2, y2)); const margin = 14; const shiftX = margin - Math.min(...xs); const shiftY = margin - Math.min(...ys); const shift = shiftX || shiftY ? ` transform="translate(${f(shiftX)},${f(shiftY)})"` : ""; const width = Math.ceil(Math.max(...xs) - Math.min(...xs)) + 2 * margin; const height = Math.ceil(Math.max(...ys) - Math.min(...ys)) + 2 * margin; const label = diagramLabel(ui, "er", [...entities.keys()].slice(0, 8)); return `${svgOpen(width, height, label, pageDir)}${edgeSvg.join("")}${loopsSvg.join("")}${nodeSvg.join("")}`; } function loopRoom(own) { const steps = own.slice(0, -1).reduce((depth, rel) => depth + LOOP_STEP + (rel.label ? LOOP_LABEL : 0), 0); return LOOP_OUT + steps + (own.at(-1).label ? LOOP_LABEL : 0) + LOOP_GAP; } function clipToBox(centre, size, toward) { const dx = toward.x - centre.x; const dy = toward.y - centre.y; const k2 = Math.max(Math.abs(dx) / (size.width / 2), Math.abs(dy) / (size.height / 2)); if (k2 === 0) return { ...centre }; return { x: centre.x + dx / k2, y: centre.y + dy / k2 }; } function nodeSvgOf(entity, x2, y2, size, step, pageDir) { const left = x2 - size.width / 2; const top2 = y2 - size.height / 2; const [nameX, keyX] = pageDir === "rtl" ? [left + size.width - PAD, left + PAD] : [left + PAD, left + size.width - PAD]; const head = `${esc(svgLine(entity.name, pageDir))}`; const rule = ``; const rtl = pageDir === "rtl"; const shift = (rtl ? -1 : 1) * signWidth(entity); const fields2 = entity.fields.map((field, i) => { const cy = top2 + PAD + HEAD_LH + FIELD_LH * (i + 0.5) + 1; const mark = deltaAttr(field.state); const marker = field.marker ? `${esc(svgLine(field.marker, pageDir))}` : ""; const band = field.state ? `${esc(svgLine(SIGN[field.state], pageDir))}` : ""; return `${band}${esc(svgLine(fieldText(field), pageDir))}${marker}`; }).join(""); const badge = badgeSvg(entity.state, rtl ? left : left + size.width, top2); return `${head}${rule}${fields2}${badge}`; } function loopBeside(rel, x2, y2, size, nth, s) { const edge = x2 + s * size.width / 2; const out = edge + s * LOOP_OUT + s * nth * LOOP_STEP; const [ay, by] = [y2 - LOOP_END / 2, y2 + LOOP_END / 2]; const label = rel.label ? { x: out + s * 6 + s * labelWidth2(rel.label) / 2, y: y2 } : null; return { rel, a: { x: edge, y: ay }, b: { x: edge, y: by }, c: [{ x: out, y: ay }, { x: out, y: by }], away: { x: s, y: 0 }, label, corners: [[out + s * 6 + s * (rel.label ? labelWidth2(rel.label) : 0), by], [out, ay]] }; } function loopBelow(rel, x2, y2, size, depth, s) { const bottom = y2 + size.height / 2; const out = bottom + LOOP_OUT + depth; const [ax, bx] = [x2 - s * LOOP_END / 2, x2 + s * LOOP_END / 2]; const half = Math.max(LOOP_END / 2, rel.label ? labelWidth2(rel.label) / 2 : 0); return { rel, a: { x: ax, y: bottom }, b: { x: bx, y: bottom }, c: [{ x: ax, y: out }, { x: bx, y: out }], away: { x: 0, y: 1 }, label: rel.label ? { x: x2, y: out + 6 + 9 } : null, corners: [[x2 - half, bottom], [x2 + half, out + (rel.label ? 6 + 18 : 0)]] }; } function loopSvg({ rel, a, b, c, away, label }, step, pageDir) { const path = ``; const ends = `${endMark(a, { x: a.x + away.x, y: a.y + away.y }, rel.fromCard)}${endMark(b, { x: b.x + away.x, y: b.y + away.y }, rel.toCard)}`; const text = label ? labelSvg(rel.label, label.x, label.y, pageDir) : ""; return `${path}${ends}${text}`; } function labelWidth2(text) { return measure(text, EDGE_FS2) + 10; } function labelSvg(text, x2, y2, pageDir) { const w = labelWidth2(text); return `${textLines([text], x2, y2, LH3, "", pageDir)}`; } function endsSvg(points, rel) { if (points.length < 2) return ""; return endMark(points.at(-1), points.at(-2), rel.toCard) + endMark(points[0], points[1], rel.fromCard); } var R3 = { back: 12, side: 5, gap: 5 }; function endMark(point, toward, card) { const dx = point.x - toward.x; const dy = point.y - toward.y; const length = Math.hypot(dx, dy) || 1; const ux = dx / length; const uy = dy / length; const px = -uy; const py = ux; const at3 = (back, side) => ({ x: point.x - ux * back + px * side, y: point.y - uy * back + py * side }); const line = (a, b) => ``; const bar = (back) => line(at3(back, -R3.side), at3(back, R3.side)); const foot = (apexBack) => { const apex = at3(apexBack, 0); return [line(at3(0, -R3.side), apex), line(at3(0, 0), apex), line(at3(0, R3.side), apex)].join(""); }; const circle = (back) => { const c = at3(back, 0); return ``; }; const marks = { "1": () => bar(R3.back), "0..1": () => bar(R3.back) + circle(R3.back + R3.gap), "*": () => foot(R3.back), "1..*": () => foot(R3.back) + bar(R3.back + R3.gap) }[card](); return `${marks}`; } // src/components/ask.js var OPTION = /^([*-])\s+(.+)$/; var ask_default = { name: "ask", summary: "A decision the reader makes on the page (collected by Reply)", pageOnly: true, panelOnly: true, syntax: `\`\`\`ask [multi] The question, one sentence * The option you suggest | optional note \u2190 * marks the suggestion; it starts selected - Another option | optional note \`\`\` - The first line is the question. Each option starts with * or -. Write 2 to 6 options. - One choice: exactly one * option. multi lets the reader pick several; * marks the ones that start picked. - Place the ask in the panel whose content the answer changes. The Reply button turns the answers into one reply.`, example: "```ask\nWhich cache do we use?\n* Redis | keeps data after a restart\n- Memcached | simpler, no disk\n```", // The text the STE check reads: options are list items; the note reads as a second clause of the item. lint(text) { return text.split("\n").map((l3) => l3.replace(OPTION, (_2, mark, body) => `- ${fields(body).filter(Boolean).join(": ")}`)).join("\n"); }, render(text, { args, uid, ui = {} }) { const multi = /(^|\s)multi(\s|$)/.test(args); const lines = contentLines(text); const [first, ...rest] = lines; if (!first || OPTION.test(first.text)) throw new ComponentError("ask: the first line is the question", first?.line ?? 1); const options = rest.map(({ text: t, line }) => { const m = t.match(OPTION); if (!m) throw new ComponentError(`ask: "${t}" is not an option; start it with * (suggested) or -`, line); const [label, note2 = ""] = fields(m[2]); if (!label) throw new ComponentError("ask: an option needs a label before |", line); return { label, note: note2, suggested: m[1] === "*", line }; }); if (options.length < 2 || options.length > 6) throw new ComponentError(`ask: write 2 to 6 options, not ${options.length}`, first.line); const suggested = options.filter((o) => o.suggested).length; if (!multi && suggested !== 1) { throw new ComponentError(`ask: mark exactly one option with * as your suggestion (found ${suggested}); add multi to let the reader pick several`, first.line); } const seen = /* @__PURE__ */ new Set(); for (const o of options) { if (seen.has(o.label)) throw new ComponentError(`ask: two options are both "${o.label}"`, o.line); seen.add(o.label); } const id = uid(); const type = multi ? "checkbox" : "radio"; const items = options.map((o) => `${mdInline(o.label)}${o.suggested ? ` ${esc(ui.reply?.suggested ?? "suggested")}` : ""}${o.note ? `${mdInline(o.note)}` : ""}`); return `${mdInline(first.text)}${items.join("")}`; } }; // src/components/index.js var ALL2 = [callout_default, kv_default, timeline_default, annot_default, tree_default, limits_default, sequence_default, flow_default, er_default, ask_default]; var COMPONENTS = new Map(ALL2.map((c) => [c.name, c])); var RAW_LANGS = /* @__PURE__ */ new Set(["html", "svg"]); // src/templates/panel.js function panelHtml(panel, { cols = 3, grid = true, hints = {} } = {}) { const { attrs } = panel; const span = Math.min(Number(attrs.span) || 1, cols); const rows = Number(attrs.rows) || 1; const layout4 = [ grid && span > 1 ? `grid-column: span ${span}` : "", grid && rows > 1 ? `grid-row: span ${rows}` : "" ].filter(Boolean).join("; "); const style = layout4 ? ` style="${layout4}"` : ""; const hinted = Math.floor(Number(hints.span)); const data = grid && hinted >= 1 ? ` data-span="${Math.min(hinted, cols)}"` : ""; const cls = `${span > 1 ? " am-span-wide" : ""}${attrs.bare ? " am-panel--bare" : ""}`; const meta = attrs.meta ? `${esc(attrs.meta)}` : ""; const head = attrs.bare ? "" : `${esc(panel.id)}${esc(panel.title)}${meta} `; return ` ${head}${panel.html} `; } var RESERVED = /* @__PURE__ */ new Set(["template", "theme", "style", "mode", "cols", "title", "subtitle", "lang"]); function headHtml(meta, introHtml, language = {}) { const extras = Object.entries(meta).filter(([k2, v]) => !RESERVED.has(k2) && v !== ""); const names = language.metaKeys ?? {}; const value = (v) => language.dir === "rtl" ? `${esc(v)}` : esc(v); const metaRow = extras.length ? `${extras.map(([k2, v]) => `${esc(names[k2.toLowerCase()] ?? k2)}${value(v)}`).join("")}` : ""; const sub = meta.subtitle ? `${esc(meta.subtitle)}` : ""; const intro = introHtml ? `${introHtml}` : ""; return `${esc(meta.title || "Untitled")}${sub}${metaRow}${intro}`; } // src/templates/sheet.js var ruler = (side, labels) => `${labels.map((l3) => `${l3}`).join("")}`; function fillRows(panels, cols) { const spans = panels.map((p) => Math.max(1, Math.min(Number(p.attrs.span) || 1, cols))); if (panels.some((p) => Number(p.attrs.rows) > 1)) return spans; let used = 0; return spans.map((span, i) => { if (used + span > cols) used = 0; used += span; const next = spans[i + 1]; const fill2 = next === void 0 || used + next > cols ? cols - used : 0; used = fill2 || used === cols ? 0 : used; return span + fill2; }); } var WIDE_TABLE_COLS = 4; var TABLE_COLS_PER_SPAN = 2; var DIAGRAM_PX_PER_SPAN = 560; var CELL_SEP = /(? b.type === "md").flatMap((b) => { const lines = b.text.split("\n").map((l3) => l3.trim()); return lines.flatMap((l3, i) => l3.startsWith("|") && DELIMITER_ROW.test(lines[i + 1] ?? "") ? [l3.split(CELL_SEP).length - 2] : []); }); return Math.max(0, ...counts); } var svgWidth = (html) => Math.max(0, ...[...html.matchAll(/]*?\swidth="(\d+(?:\.\d+)?)"/g)].map((m) => Number(m[1]))); function minSpan(panel) { const tableCols = tableColumns(panel.blocks ?? []); const byTable = tableCols >= WIDE_TABLE_COLS ? Math.ceil(tableCols / TABLE_COLS_PER_SPAN) : 1; const byDiagram = Math.ceil(svgWidth(panel.html ?? "") / DIAGRAM_PX_PER_SPAN); return Math.max(1, byTable, byDiagram); } function sheet({ meta, introHtml, panels, language }) { const cols = Math.max(1, Math.min(Number(meta.cols) || 3, 12)); const sized = panels.map((p) => p.attrs.span === void 0 && minSpan(p) > 1 ? { ...p, attrs: { ...p.attrs, span: Math.min(minSpan(p), cols) } } : p); const spans = fillRows(sized, cols); const placed = sized.map((p, i) => ({ ...p, attrs: { ...p.attrs, span: spans[i] } })); const nums = Array.from({ length: 8 }, (_2, i) => i + 1); const letters = ["A", "B", "C", "D"]; return ` ${headHtml(meta, introHtml, language)} ${ruler("top", nums)}${ruler("bottom", nums)}${ruler("left", letters)}${ruler("right", letters)} ${placed.map((p, i) => panelHtml(p, { cols, hints: { span: panels[i].attrs.span } })).join("\n")} `; } // src/templates/doc.js function doc({ meta, introHtml, panels, ui, language }) { const withToc = panels.length >= 3; const toc = withToc ? `${panels.map((p) => `${esc(p.id)} \xB7 ${esc(p.title)}`).join("")}` : ""; return ` ${headHtml(meta, introHtml, language)} ${toc} ${panels.map((p) => panelHtml(p, { grid: false })).join("\n")} `; } // src/templates/index.js var TEMPLATES = { sheet, doc }; // src/themes/index.js var block = (selector, vars) => `${selector} { ${Object.entries(vars).map(([k2, v]) => ` ${k2}: ${v};`).join("\n")} }`; function tokenCss(sel, { common = {}, light = {}, dark = {} }) { const parts = [block(`${sel}, ${sel}[data-mode="light"]`, { ...common, ...light })]; if (Object.keys(dark).length) { parts.push(block(`${sel}[data-mode="dark"]`, dark), `@media (prefers-color-scheme: dark) { ${block(`${sel}[data-mode="auto"]`, dark)} }`); } return parts.join("\n"); } var pageSel = (t) => `html[data-theme="${t.name}"]`; var videoSel = (t) => `html[data-video][data-theme="${t.name}"]`; var scoped = (css, sel) => css.replace(/&/g, sel); var languageFontCss = () => fontLanguages().map((l3) => block(langSelector(l3, "html", "[data-theme][data-mode]"), { "--font-sans": l3.fonts.sans })); var ownLanguageFont = (t) => fontLanguages().map((l3) => block(langSelector(l3, "html", `[data-theme="${t.name}"][data-mode]`), { "--font-sans": t.tokens.common["--font-sans"] })); function pageCss(list = themes("page"), { diff = false, delta = false, rtl = false, math: math2 = false } = {}) { const decorations = list.filter((t) => t.css).map((t) => scoped(t.css, pageSel(t))); const ownFonts = list.filter((t) => t.ownFont).flatMap(ownLanguageFont); return [list.map((t) => tokenCss(pageSel(t), t.tokens)).join("\n\n"), ...languageFontCss(), ...ownFonts, BASE_CSS, ...math2 ? [MATH_CSS] : [], ...diff ? [DIFF_CSS] : [], ...delta ? [DELTA_CSS] : [], ...rtl ? [RTL_CSS] : [], ...decorations].join("\n\n"); } function videoCss(list = themes("video"), { diff = false, delta = false, rtl = false } = {}) { const parts = list.filter((t) => t.video).flatMap((t) => [ t.video.tokens ? tokenCss(videoSel(t), t.video.tokens) : "", t.video.css ? scoped(t.video.css, videoSel(t)) : "", rtl && t.video.rtlCss ? scoped(t.video.rtlCss, videoSel(t)) : "" ]).filter(Boolean); return [pageCss(list.filter((t) => t.scope.includes("page")), { diff, delta, rtl }), VIDEO_CSS, ...parts].join("\n\n"); } // src/lint/wordlist.en.js var EN_WORDS2 = Object.freeze({ "utilize": "use", "utilise": "use", "utilization": "use", "commence": "start", "commenced": "started", "prior to": "before", "in order to": "to", "approximately": "about", "ensure": "make sure", "replenish": "fill", "terminate": "stop", "facilitate": "help", "leverage": "use", "numerous": "many", "subsequently": "then", "endeavor": "try", "ascertain": "find", "sufficient": "enough", "demonstrate": "show", "assist": "help", "obtain": "get", "initiate": "start", "modify": "change", "possess": "have", "purchase": "buy", "in the event that": "if", "due to the fact that": "because", "at this point in time": "now", "a number of": "some", "with regard to": "about", "in addition": "also" }); // src/lint/wordlist.zh.js var ZH_LIGHT_VERBS = Object.freeze([ { re: /进行(?![中时])了?([一-龥]{2})/g, label: "\u8FDB\u884C" }, { re: /(?:加以|予以)([一-龥]{2})/g, label: "\u52A0\u4EE5/\u4E88\u4EE5" }, { re: /[做作]出了?([一-龥]{2})/g, label: "\u505A\u51FA" } ]); var ZH_CLICHES = Object.freeze([ "\u8D4B\u80FD", "\u6293\u624B", "\u95ED\u73AF", "\u6253\u901A", "\u5168\u65B9\u4F4D", "\u591A\u7EF4\u5EA6", "\u6DF1\u5EA6\u878D\u5408", "\u663E\u8457\u63D0\u5347", "\u81F3\u5173\u91CD\u8981", "\u4E0D\u53EF\u6216\u7F3A", "\u4E0E\u6B64\u540C\u65F6", "\u7EFC\u4E0A\u6240\u8FF0", "\u503C\u5F97\u6CE8\u610F\u7684\u662F", "\u603B\u800C\u8A00\u4E4B", "\u4F17\u6240\u5468\u77E5", "\u6BCB\u5EB8\u7F6E\u7591", "\u4E00\u7AD9\u5F0F", "\u5E95\u5C42\u903B\u8F91", "\u9897\u7C92\u5EA6", "\u65B9\u6CD5\u8BBA" ]); var UNIT = String.raw`(?:个|次|秒|天|分钟|小时|倍|字|条|项|人|行|位|%|MB|GB|KB|TB|ms)?`; var ZH_WORDS = Object.freeze([ // typos { re: /登陆/g, suggestion: "\u767B\u5F55" }, { re: /帐号/g, suggestion: "\u8D26\u53F7" }, { re: /阀值/g, suggestion: "\u9608\u503C" }, { re: /布署/g, suggestion: "\u90E8\u7F72" }, // quantities without a number { re: /尽快/g, suggestion: "give a concrete deadline" }, { re: /若干/g, suggestion: "write the number" }, { re: /大概|大约/g, suggestion: 'use "\u7EA6" in descriptions, a value in steps' }, { re: /多次/g, suggestion: "write the count" }, // 以上/以下/以内 after a number: it is unclear whether the endpoint is included { re: new RegExp(String.raw`(?<=\d\s*${UNIT}\s*)(?:以上|以下)`, "g"), suggestion: "name the endpoint: \u5927\u4E8E / \u4E0D\u5C0F\u4E8E, \u5C0F\u4E8E / \u4E0D\u5927\u4E8E" }, { re: /(?<=\d[^。，；\n]{0,6})以内/g, suggestion: "\u4E0D\u8D85\u8FC7" }, // one meaning, one word { re: /单击|点按/g, suggestion: "\u70B9\u51FB" }, { re: /键入/g, suggestion: "\u8F93\u5165" }, { re: /登出/g, suggestion: "\u9000\u51FA\u767B\u5F55" }, { re: /入参/g, suggestion: "\u53C2\u6570" }, { re: /出参/g, suggestion: "\u8FD4\u56DE\u503C" }, { re: /缺省/g, suggestion: "\u9ED8\u8BA4" } ]); // src/lint/ste.js var LIMITS = { zh: { procedural: 35, descriptive: 45 }, en: { procedural: 20, descriptive: 25 } }; var MAX_SENTENCES = 6; var ABBR = /\b(e\.g|i\.e|etc|vs|cf|approx|Fig|No)\./gi; var PASSIVE = /\b(?:am|is|are|was|were|be|been|being)\s+(?:\w+ly\s+)?(\w+ed|known|done|made|given|taken|seen|written|built|shown|sent|kept|held|found|set|put|run|begun|chosen|driven|broken)\b/i; var EN_RE = Object.entries(EN_WORDS2).sort((a, b) => b[0].length - a[0].length).map(([word, suggestion]) => ({ re: new RegExp(`\\b${word.replace(/ /g, "\\s+")}\\b`, "gi"), word, suggestion })); function splitSentences(text) { const masked = text.replace(ABBR, (m) => m.replace(/\./g, "\0")); const parts = masked.match(/[^。！？；!?;]+?(?:[。！？；!?;]+|\.(?=\s|$)|$)|[^.]+?\.(?=\s|$)/g) ?? []; return parts.map((s) => s.replace(/\u0000/g, ".").trim()).filter(Boolean); } function sentenceLength(sentence) { const cjk = [...sentence].filter(isCJK).filter((c) => !/[，。！？；：、（）「」『』“”‘’《》]/.test(c)).length; const words3 = sentence.match(/[A-Za-z0-9][\w'’-]*/g)?.length ?? 0; return cjk >= 4 || cjk > words3 ? { lang: "zh", count: cjk + words3 } : { lang: "en", count: words3 }; } var CJK_TEXT = /[\p{Script=Han}\p{Script=Hiragana}\p{Script=Katakana}]/gu; function neutralLength(sentence) { const han = sentence.match(CJK_TEXT)?.length ?? 0; const rest = sentence.replace(CJK_TEXT, " "); const words3 = countWords(rest); return han >= 4 || han > words3 ? { lang: "zh", count: han + words3 } : { lang: "en", count: words3 }; } var RULE_LANGUAGES = /* @__PURE__ */ new Set(["zh", "en", "ja"]); function ruleFamily(language) { if (!language) return "auto"; const base = language.tag.split("-")[0]; if (!RULE_LANGUAGES.has(base)) return "neutral"; return language.declared ? base : "auto"; } function formatWarning(w) { return `L${w.line} [${w.rule}] ${w.message}${w.suggestion ? ` \u2192 ${w.suggestion}` : ""}`; } function lintDoc(doc2, language) { const warnings = []; const family = ruleFamily(language); const blocks = [...doc2.intro, ...doc2.panels.flatMap((p) => p.blocks)]; for (const b of blocks) { if (b.type === "md") lintMarkdown(b.text, b.line, warnings, family); else if (b.lang === "callout") lintMarkdown(b.text, b.line + 1, warnings, family); else if (COMPONENTS.get(b.lang)?.lint) lintMarkdown(COMPONENTS.get(b.lang).lint(b.text), b.line + 1, warnings, family); } return warnings; } function clean(text) { return stripMath(text.replace(/~~[^~]*~~/g, "").replace(/`[^`]*`/g, "")).replace(/!\[([^\]]*)\]\([^)]*\)/g, "$1").replace(/\[([^\]]*)\]\([^)]*\)/g, "$1").replace(/<[^>]+>/g, "").replace(/[*_]{1,3}/g, ""); } function lintMarkdown(text, startLine, out, family) { let para = null; const flush = () => { if (para && para.count > MAX_SENTENCES) { out.push({ line: para.line, rule: "paragraph-length", message: `paragraph has ${para.count} sentences (max ${MAX_SENTENCES})` }); } para = null; }; let inHtml = false; let inMath = false; text.split("\n").forEach((raw, i) => { const line = startLine + i; const t = raw.trim(); if (/^<(div|svg|table|details|figure)/i.test(t)) inHtml = true; if (inHtml) { if (/<\/(div|svg|table|details|figure)>\s*$/i.test(t)) inHtml = false; return flush(); } if (inMath) { if (!t || closesDisplay(t)) inMath = false; return flush(); } if (opensDisplay(raw) || isDisplayLine(raw)) { inMath = opensDisplay(raw); return flush(); } if (!t || /^#{1,6}\s/.test(t) || /^[-*_]{3,}$/.test(t)) return flush(); if (t.startsWith("|")) { flush(); if (/^\|?[\s:|-]+\|?$/.test(t)) return; const cells = t.replace(/^\||\|$/g, "").split("|").map((c) => c.trim()); if (cells.some((c) => /^(no|✗|✘)(\s|$)/.test(c))) return; cells.forEach((c) => checkUnit(clean(c.replace(/^(ok|warn|✓|✔|⚠)(\s|$)/, "")), line, "descriptive", out, family)); return; } const list = t.match(/^(?:([-*+])|(\d+)[.)])\s+(.*)$/); if (list) { flush(); checkUnit(clean(list[3]), line, list[2] ? "procedural" : "descriptive", out, family); return; } const body = clean(t.replace(/^>\s*/, "")); const n = checkUnit(body, line, "descriptive", out, family); if (!para) para = { line, count: 0 }; para.count += n; }); flush(); } function checkUnit(text, line, kind2, out, family) { const sentences = splitSentences(text); const zhFamily = family === "auto" || family === "zh"; const ja = family === "ja" || zhFamily && isJapanese(text); const chineseRules = zhFamily && !ja; const englishRules = family !== "neutral"; for (const s of sentences) { const { lang, count: count2 } = family === "neutral" ? neutralLength(s) : sentenceLength(s); const limit = LIMITS[lang][kind2]; if (count2 > limit) { const unit = lang === "zh" ? "characters" : "words"; const preview2 = s.length > 24 ? `${s.slice(0, 24)}\u2026` : s; out.push({ line, rule: "sentence-length", message: `${kind2 === "procedural" ? "step" : "sentence"} has ${count2} ${unit} (max ${limit}): "${preview2}"` }); } if (englishRules && lang === "en" && PASSIVE.test(s)) { out.push({ line, rule: "passive", message: `possible passive voice: "${s.match(PASSIVE)[0]}"`, suggestion: "use active voice" }); } } const lexical = [ ...(englishRules ? EN_RE : []).flatMap(({ re: re3, suggestion }) => [...text.matchAll(re3)].map((m) => ({ index: m.index, rule: "word", message: `not recommended: "${m[0]}"`, suggestion }))), ...(chineseRules ? ZH_LIGHT_VERBS : []).flatMap(({ re: re3, label }) => [...text.matchAll(re3)].map((m) => ({ index: m.index, rule: "word", message: `light verb "${m[0]}" (${label})`, suggestion: `use "${m[1]}"` }))), ...(chineseRules ? ZH_WORDS : []).flatMap(({ re: re3, suggestion }) => [...text.matchAll(re3)].map((m) => ({ index: m.index, rule: "word", message: `not recommended: "${m[0]}"`, suggestion }))) ]; out.push(...lexical.sort((a, b) => a.index - b.index).map(({ index, ...w }) => ({ line, ...w }))); for (const s of sentences) { if (!zhFamily || isJapanese(s)) continue; if ((s.match(/的/g) ?? []).length >= 3) out.push({ line, rule: "de-chain", message: `chained "\u7684": ${s}`, suggestion: 'split the sentence or remove extra "\u7684"' }); } for (const c of chineseRules ? ZH_CLICHES : []) { if (text.includes(c)) out.push({ line, rule: "cliche", message: `clich\xE9 "${c}"`, suggestion: "delete it or state a concrete fact" }); } return sentences.length; } // src/page.js var SOURCE_OPEN = ']*>([\\s\\S]*?)<\\/textarea>`); var AUDIO_OPEN = '<audio id="amv-audio"'; function rootTag({ lang, dir, theme, mode, style, voice, video = false }) { return `<html lang="${lang}"${dirAttr(dir)} data-theme="${esc(theme)}" data-mode="${esc(mode)}" data-style="${esc(style)}"${voice ? ` data-voice="${esc(voice)}"` : ""}${video ? " data-video" : ""}>`; } function rootCarrierAttrs({ lang, dir, theme, mode, style }) { return ` data-am-root-lang="${lang}"${dir === "rtl" ? ' data-am-root-dir="rtl"' : ""} data-am-root-theme="${esc(theme)}" data-am-root-mode="${esc(mode)}" data-am-root-style="${esc(style)}"`; } var dirAttr = (dir) => dir === "rtl" ? ' dir="rtl"' : ""; function audioTag(wav2) { return `${AUDIO_OPEN} preload="auto" src="data:audio/wav;base64,${wav2.toString("base64")}"></audio>`; } function sourceTag(source) { return `${SOURCE_OPEN} hidden readonly aria-hidden="true">${esc(source)}`; } function readPage(html) { const s = String(html); const root = s.match(/]*>/)?.[0] ?? ""; const attr = (name) => root.match(new RegExp(`\\s${name}="([^"]+)"`))?.[1]; const video = /\sdata-video\b/.test(root); const open = s.lastIndexOf(SOURCE_OPEN); const m = open === -1 ? null : s.slice(open).match(SOURCE_RE); const before = open === -1 ? "" : s.slice(0, open).trimEnd(); return { source: m ? unescapeHtml(m[1]) : null, video, // A in the body does not count; the template's always comes before the body. template: video ? "video" : s.match(/") && before.lastIndexOf(AUDIO_OPEN) > before.lastIndexOf("").replace(/"/g, '"').replace(/'/g, "'").replace(/&/g, "&"); } // src/han-forms.js var PAIRS = "\u8FD9\u9019 \u4E2A\u500B \u4EEC\u5011 \u8BF4\u8AAA \u56FD\u570B \u4E3A\u70BA \u6765\u4F86 \u65F6\u6642 \u4F1A\u6703 \u8FC7\u904E \u5BF9\u5C0D \u5B66\u5B78 \u8FD8\u9084 \u6CA1\u6C92 \u6837\u6A23 \u5F00\u958B \u95E8\u9580 \u95EE\u554F \u95F4\u9593 \u70B9\u9EDE \u73B0\u73FE \u79CD\u7A2E \u7ECF\u7D93 \u52A8\u52D5 \u5B9E\u5BE6 \u673A\u6A5F \u5173\u95DC \u4E1A\u696D \u4E0E\u8207 \u65E0\u7121 \u7535\u96FB \u4E66\u66F8 \u9A6C\u99AC \u8F66\u8ECA \u89C1\u898B \u4E70\u8CB7 \u5356\u8CE3 \u8BFB\u8B80 \u8BED\u8A9E \u8BDD\u8A71 \u8BF7\u8ACB \u8BA9\u8B93 \u8BA4\u8A8D \u5E94\u61C9 \u5F53\u7576 \u603B\u7E3D \u5C06\u5C07 \u4F53\u9AD4 \u534E\u83EF \u58F0\u8072 \u542C\u807D \u89C2\u89C0 \u89C9\u89BA \u8BB0\u8A18 \u8BBE\u8A2D \u8BA1\u8A08 \u8BBA\u8AD6 \u8BAE\u8B70 \u8BB8\u8A31 \u8BC1\u8B49 \u8BC6\u8B58 \u8C03\u8ABF \u8BD5\u8A66 \u8BE5\u8A72 \u8BE6\u8A73 \u8BEF\u8AA4 \u8C08\u8AC7 \u8C22\u8B1D \u8C01\u8AB0 \u8BFE\u8AB2 \u8D1F\u8CA0 \u8D23\u8CAC \u8D35\u8CB4 \u8D44\u8CC7 \u8D39\u8CBB \u8D5B\u8CFD \u8D22\u8CA1 \u8D2D\u8CFC \u8D27\u8CA8 \u8D38\u8CBF \u8D28\u8CEA \u94B1\u9322 \u94F6\u9280 \u94C1\u9435 \u7F51\u7DB2 \u9875\u9801 \u7EA7\u7D1A \u7EBF\u7DDA \u7C7B\u985E \u6570\u6578 \u636E\u64DA \u5E93\u5EAB \u6237\u6236 \u52A1\u52D9 \u533A\u5340 \u4E1C\u6771 \u4E50\u6A02 \u4EA7\u7522 \u4EB2\u89AA \u513F\u5152 \u529E\u8FA6 \u5174\u8208 \u519B\u8ECD \u519C\u8FB2 \u51B5\u6CC1 \u5218\u5289 \u521B\u5275 \u5267\u5287 \u5355\u55AE \u53CC\u96D9 \u53F7\u865F \u5458\u54E1 \u56ED\u5712 \u56F4\u570D \u56FE\u5716 \u5706\u5713 \u573A\u5834 \u5757\u584A \u574F\u58DE \u5904\u8655 \u5907\u5099 \u5934\u982D \u5939\u593E \u594B\u596E \u5987\u5A66 \u5B59\u5B6B \u5B81\u5BE7 \u5B9D\u5BF6 \u5BA1\u5BE9 \u5C42\u5C64 \u5C5E\u5C6C \u5C81\u6B72 \u5E08\u5E2B \u5E26\u5E36 \u5E2E\u5E6B \u5E7F\u5EE3 \u5F02\u7570 \u5F20\u5F35 \u5F3A\u5F37 \u5F55\u9304 \u5F52\u6B78 \u5F7B\u5FB9 \u5F84\u5F91 \u60AC\u61F8 \u60CA\u9A5A \u6218\u6230 \u62A4\u8B77 \u62A5\u5831 \u62E9\u64C7 \u62C5\u64D4 \u62E5\u64C1 \u62DF\u64EC \u6362\u63DB \u635F\u640D \u654C\u6575 \u65AD\u65B7 \u65E7\u820A \u663E\u986F \u6653\u66C9 \u6682\u66AB \u672F\u8853 \u6742\u96DC \u6781\u6975 \u6784\u69CB \u6807\u6A19 \u680F\u6B04 \u6811\u6A39 \u6863\u6A94 \u6865\u6A4B \u68C0\u6AA2 \u697C\u6A13 \u6B22\u6B61 \u6BD5\u7562 \u6C14\u6C23 \u6C49\u6F22 \u6D4E\u6FDF \u6D4F\u700F \u6D4B\u6E2C \u6E7E\u7063 \u6EE1\u6EFF \u706D\u6EC5 \u706F\u71C8 \u7231\u611B \u72B6\u72C0 \u72EC\u7368 \u73AF\u74B0 \u753B\u756B \u7597\u7642 \u76D8\u76E4 \u7801\u78BC \u786E\u78BA \u79BB\u96E2 \u79EF\u7A4D \u79F0\u7A31 \u7A77\u7AAE \u7ADE\u7AF6 \u7B14\u7B46 \u7B80\u7C21 \u7CAE\u7CE7 \u7D27\u7DCA \u7EA2\u7D05 \u7EA6\u7D04 \u7EAA\u7D00 \u7EAF\u7D14 \u7EB8\u7D19 \u7EC4\u7D44 \u7EC6\u7D30 \u7EC7\u7E54 \u7EC8\u7D42 \u7ED3\u7D50 \u7ED9\u7D66 \u7EDC\u7D61 \u7EDF\u7D71 \u7EE7\u7E7C \u7EED\u7E8C \u7EF4\u7DAD \u7EFC\u7D9C \u7EFF\u7DA0 \u7F13\u7DE9 \u7F16\u7DE8 \u7F57\u7F85 \u4E60\u7FD2 \u8054\u806F \u804C\u8077 \u8111\u8166 \u8138\u81C9 \u8282\u7BC0 \u8425\u71DF \u84DD\u85CD \u8651\u616E \u867D\u96D6 \u8865\u88DC \u88C5\u88DD \u89C8\u89BD \u89C4\u898F \u89C6\u8996 \u89E6\u89F8 \u8BA2\u8A02 \u8BA8\u8A0E \u8BAD\u8A13 \u8BB2\u8B1B \u8BBF\u8A2A \u8BC4\u8A55 \u8BCD\u8A5E \u8BD1\u8B6F \u8BC9\u8A34 \u8F93\u8F38 \u8F91\u8F2F \u8FB9\u908A \u8FBE\u9054 \u8FC1\u9077 \u8FD0\u904B \u8FDC\u9060 \u8FDE\u9023 \u8FDB\u9032 \u9009\u9078 \u9012\u905E \u9002\u9069 \u903B\u908F \u9057\u907A \u90AE\u90F5 \u94FA\u92EA \u94FE\u93C8 \u9500\u92B7 \u9501\u9396 \u9519\u932F \u952E\u9375 \u955C\u93E1 \u957F\u9577 \u95EA\u9583 \u95ED\u9589 \u95FB\u805E \u9605\u95B1 \u961F\u968A \u9636\u968E \u9645\u969B \u9690\u96B1 \u96BE\u96E3 \u9759\u975C \u9876\u9802 \u9879\u9805 \u987A\u9806 \u987B\u9808 \u9898\u984C \u989D\u984D \u98CE\u98A8 \u98DE\u98DB \u996D\u98EF \u9986\u9928 \u9A8C\u9A57 \u9A97\u9A19 \u9C7C\u9B5A \u9E1F\u9CE5 \u9E21\u96DE \u9EA6\u9EA5 \u9F50\u9F4A \u9F7F\u9F52 \u9F99\u9F8D".split(" "); var SIMPLIFIED_ONLY = PAIRS.map((pair) => [...pair][0]).join(""); var TRADITIONAL_ONLY = PAIRS.map((pair) => [...pair][1]).join(""); // src/language.js var CJK_PER_LATIN = 3; var SCRIPT_LANGUAGES = [ [new RegExp("\\p{Script=Thai}", "u"), "th"], [new RegExp("\\p{Script=Hebrew}", "u"), "he"], [new RegExp("\\p{Script=Greek}", "u"), "el"], [new RegExp("\\p{Script=Arabic}", "u"), "ar"], [new RegExp("\\p{Script=Cyrillic}", "u"), "ru"] ]; var HANGUL = new RegExp("\\p{Script=Hangul}", "u"); var SIMPLIFIED = new Set(SIMPLIFIED_ONLY); var TRADITIONAL = new Set(TRADITIONAL_ONLY); function hanLanguage(text) { let simplified = 0; let traditional = 0; for (const ch of text) { if (SIMPLIFIED.has(ch)) simplified++; else if (TRADITIONAL.has(ch)) traditional++; } return traditional > simplified ? "zh-Hant" : "zh"; } function detectLang(text) { const draft = String(text); let cjk = 0; let hangul = 0; let latin = 0; const others = /* @__PURE__ */ new Map(); for (const ch of draft) { if (isCJK(ch)) { cjk++; if (HANGUL.test(ch)) hangul++; } else if (/[a-z]/i.test(ch)) { latin++; } else { const script = SCRIPT_LANGUAGES.find(([re3]) => re3.test(ch)); if (script) others.set(script[1], (others.get(script[1]) ?? 0) + 1); } } const otherTotal = [...others.values()].reduce((sum2, n) => sum2 + n, 0); if ((cjk + otherTotal) * CJK_PER_LATIN < latin) return "en"; const [topTag, topCount] = [...others].sort((a, b) => b[1] - a[1])[0] ?? [null, 0]; if (topCount > cjk) return topTag; if (hangul * 2 > cjk) return "ko"; return isJapanese(draft) ? "ja" : hanLanguage(draft); } function canonicalTag(value) { if (typeof value !== "string") return null; const text = value.trim().replace(/_/g, "-"); if (!text) return null; try { const tag = Intl.getCanonicalLocales(text)[0]; const { language } = new Intl.Locale(tag); return !language || language === "und" ? null : tag; } catch { return null; } } var baseLanguage = (tag) => new Intl.Locale(tag).language; function voiceHints(tag) { const locale = new Intl.Locale(tag).maximize(); return findLanguage(locale.language, locale.script)?.voice ?? null; } function directionOf(locale) { const info = typeof locale.getTextInfo === "function" ? locale.getTextInfo() : locale.textInfo; return info?.direction === "rtl" ? "rtl" : "ltr"; } function resolveLanguage({ declared, previous, text = "" }) { const declaredTag = canonicalTag(declared); const tag = declaredTag ?? canonicalTag(previous) ?? detectLang(text); const locale = new Intl.Locale(tag).maximize(); const entry = findLanguage(locale.language, locale.script); const labels = entry ?? FALLBACK; return Object.freeze({ tag, declared: declaredTag !== null, htmlLang: tag === "zh" ? "zh-CN" : tag, script: locale.script, dir: directionOf(locale), supported: Boolean(entry), labelKey: labels.id, ui: labels.deltaCounts ? { ...labels.ui, delta: { ...labels.ui.delta, counts: labels.deltaCounts } } : labels.ui, videoUi: labels.videoUi, metaKeys: labels.metaKeys ?? {}, dateOrder: labels.dateOrder ?? "ymd" }); } // src/images.js import { readFileSync as readFileSync2, statSync } from "node:fs"; import { homedir } from "node:os"; import { extname, isAbsolute, resolve } from "node:path"; import { fileURLToPath } from "node:url"; var TYPES = { ".png": "image/png", ".jpg": "image/jpeg", ".jpeg": "image/jpeg", ".gif": "image/gif", ".webp": "image/webp", ".avif": "image/avif", ".svg": "image/svg+xml" }; var MAX_IMAGE_BYTES = 5 * 1024 * 1024; var IMAGE_EXAMPLE = ""; var NOT_LOCAL = /^(?:(?!file:)[a-z][a-z0-9+.-]+:|\/\/|#)/i; var IMG_SRC = /]*?)\bsrc="([^"]*)"/g; var TEXT_IMAGE = /!\[[^\]\n]*\](?:\([^)\n]*\)|\[[^\]\n]*\])/; var EMBEDDED = /]*?\bdata-am-src="([^"]*)" src="(data:[^"]*)"/g; var ImageError = class extends Error { constructor(message, ref) { super(message); this.name = "ImageError"; this.ref = ref; } }; function decodeRef(src) { const ref = src.replace(/&/g, "&"); try { return decodeURI(ref); } catch { return ref; } } function localPath(ref, baseDir) { if (ref.startsWith("file:")) return fileURLToPath(ref); if (ref.startsWith("~/")) return resolve(homedir(), ref.slice(2)); return resolve(baseDir, ref); } function readImage(ref, baseDir) { const path = localPath(ref, baseDir); const type = TYPES[extname(path).toLowerCase()]; if (!type) throw new ImageError(`"${ref}" is not an image file; use ${Object.keys(TYPES).join(" ")}`, ref); let size; try { size = statSync(path).size; } catch { return null; } if (size > MAX_IMAGE_BYTES) { throw new ImageError(`"${ref}" is ${(size / 1048576).toFixed(1)} MB; the limit is ${MAX_IMAGE_BYTES / 1048576} MB. Shrink or crop the image first`, ref); } return `data:${type};base64,${readFileSync2(path).toString("base64")}`; } function assertNoImageText(html) { const left = html.replace(/<(code|pre)\b[\s\S]*?<\/\1>/g, "").replace(/<[^>]*>/g, "").match(TEXT_IMAGE); if (left) throw new ImageError(`"${left[0]}" was not read as an image. Check the path: write a space as %20, or put the path in < and >`, left[0]); } function inlineImages(html, { baseDir = process.cwd(), known = /* @__PURE__ */ new Map(), checkText = true } = {}) { if (checkText) assertNoImageText(html); return html.replace(IMG_SRC, (whole, before, src) => { const ref = decodeRef(src); if (NOT_LOCAL.test(ref)) return whole; const uri = readImage(ref, baseDir) ?? known.get(ref); if (!uri) throw new ImageError(`Image not found: "${ref}"${isAbsolute(ref) ? "" : ` (relative paths are read from ${baseDir})`}. Use the absolute path of an existing file`, ref); return ` [decodeRef(src), uri])); } // src/code.js import { readFileSync as readFileSync3, statSync as statSync2 } from "node:fs"; import { basename as basename2, extname as extname2, isAbsolute as isAbsolute2, relative, resolve as resolve2, sep } from "node:path"; // src/diff.js var DiffError = class extends Error { constructor(message, line) { super(message); this.name = "DiffError"; this.line = line; } }; var DIFF_EXAMPLE = "```diff file=src/code.js\n@@ -60,3 +60,3 @@\n export function parseCodeArgs(args) {\n- const attrs = parseAttrs(args);\n+ const attrs = parseAttrs(args, { diff: true });\n const opts = {};\n```"; var HUNK = /^@@ -(\d+)(?:,(\d+))? \+(\d+)(?:,(\d+))? @@/; var GIT_HEAD = /^(?:diff --git |index |new file mode |deleted file mode |old mode |new mode |similarity index |rename (?:from|to) )/; var ELLIPSIS = /^ ?(?:…|\.\.\.)\s*$/; var KIND = { "+": "add", "-": "del", " ": "ctx" }; var headPath = (line) => { const path = line.slice(4).split(" ")[0].trim().replace(/^[ab]\//, ""); return path === "/dev/null" ? "" : path; }; function parseDiff(text, start) { const lines = text.split("\n"); while (lines.length && lines[lines.length - 1] === "") lines.pop(); const numbered = start !== void 0 || lines.some((l3) => HUNK.test(l3)); const rows = []; const warnings = []; const newLines = /* @__PURE__ */ new Set(); let title = ""; let from = ""; let o = start ?? 1; let n = start ?? 1; let hunk = null; let started = false; const closeHunk = () => { if (hunk && (hunk.got.o !== hunk.want.o || hunk.got.n !== hunk.want.n)) { warnings.push({ rule: "diff-counts", message: `the hunk "${hunk.header}" has ${hunk.got.o} old and ${hunk.got.n} new lines, but its header says ${hunk.want.o} and ${hunk.want.n}. Fix the numbers in the @@ line, or add the missing lines` }); } hunk = null; }; const preamble = () => !hunk && !started || hunk && hunk.got.o >= hunk.want.o && hunk.got.n >= hunk.want.n; lines.forEach((line, i) => { const fail = (message) => { throw new DiffError(message, i + 1); }; const meta = () => rows.push({ kind: "meta", text: line }); if (line.startsWith("diff --git ")) { closeHunk(); started = false; from = ""; return meta(); } if (GIT_HEAD.test(line) || line.startsWith("\\")) return meta(); if (preamble() && line.startsWith("--- ") && lines[i + 1]?.startsWith("+++ ")) { from = headPath(line); return meta(); } if (preamble() && line.startsWith("+++ ") && rows[rows.length - 1]?.text.startsWith("--- ")) { title ||= headPath(line) || from; return meta(); } const m = line.match(HUNK); if (m) { closeHunk(); o = Number(m[1]); n = Number(m[3]); hunk = { header: m[0], want: { o: m[2] === void 0 ? 1 : Number(m[2]), n: m[4] === void 0 ? 1 : Number(m[4]) }, got: { o: 0, n: 0 } }; return rows.push({ kind: "hunk", text: line }); } if (line.startsWith("@@")) fail(`line ${i + 1} is not a hunk header; write it as @@ -60,4 +60,5 @@ (old start and count, new start and count)`); if (ELLIPSIS.test(line)) fail(`line ${i + 1} stands for cut lines: the gutter cannot know how many lines were skipped. Split the diff into two hunks, each with its own @@ header`); if (!rows.length && line === "") return; const kind2 = line === "" ? "ctx" : KIND[line[0]]; if (!kind2) fail(`line ${i + 1} is not a diff line ("${line.length > 40 ? `${line.slice(0, 40)}\u2026` : line}"); start it with +, -, a space or @@. A line of code that did not change starts with a space`); started = true; const row = { kind: kind2, text: line }; if (kind2 !== "add") { row.o = o++; if (hunk) hunk.got.o++; } if (kind2 !== "del") { row.n = n; newLines.add(n++); if (hunk) hunk.got.n++; } rows.push(row); }); closeHunk(); const count2 = (kind2) => rows.filter((r) => r.kind === kind2).length; return { rows, title, add: count2("add"), del: count2("del"), numbered, newLines, warnings }; } function diffRowsHtml({ rows, numbered }, hl) { return rows.map((r) => { const marked2 = r.n !== void 0 && hl.has(r.n) ? " am-ln--hl" : ""; const nums = numbered ? `${r.o === void 0 ? "" : ` data-o="${r.o}"`}${r.n === void 0 ? "" : ` data-n="${r.n}"`}` : ""; return `${esc(r.text)}`; }).join(""); } // src/code.js var MAX_CODE_LINES = 200; var LONG_CODE_LINES = 40; var MAX_FILE_BYTES = 2 * 1024 * 1024; var KEYS = /* @__PURE__ */ new Set(["src", "lines", "hl", "title", "start"]); var DIFF_KEYS = /* @__PURE__ */ new Set([...KEYS, "file"]); var CODE_EXAMPLE = "```ts src=server/routes.ts lines=18-30 hl=22\n```"; var SECRET_FILE = new RegExp([ "^\\.env(?!\\.(?:example|sample|template)$)(?:\\..*)?$", "^(?:\\.netrc|\\.npmrc|\\.yarnrc(?:\\.yml)?|\\.pypirc|\\.pgpass|\\.my\\.cnf|\\.git-credentials|\\.htpasswd)$", "^(?:id_(?:rsa|dsa|ecdsa|ed25519).*|credentials.*|secrets?(?:\\..*)?|.*_history|.*\\.local\\.json)$", "\\.(?:pem|key|p12|pfx|keystore|jks|tfvars|tfstate(?:\\.backup)?|sqlite3?|db|kdbx|ovpn)$" ].join("|"), "i"); var SECRET_DIR = /* @__PURE__ */ new Set([".git", ".ssh", ".aws", ".azure", ".gnupg", ".kube", ".docker", ".password-store"]); var SECRET_TEXT = /sk-ant-|sk-[A-Za-z0-9]{32,}|AKIA[0-9A-Z]{16}|-----BEGIN [A-Z ]*PRIVATE KEY|gh[pousr]_[A-Za-z0-9]{30,}|github_pat_[A-Za-z0-9_]{30,}|xox[abeprs]-[A-Za-z0-9-]{10,}|AIza[0-9A-Za-z_-]{30,}|eyJ[A-Za-z0-9_-]{20,}\.[A-Za-z0-9_-]{10,}\.|(?:password|passwd|secret|api[_-]?key|access[_-]?token|auth[_-]?token)["']?\s*[:=]\s*["'][^"'\s$<{]{12,}["']/i; var CodeError = class extends Error { constructor(message, line = 0, example = CODE_EXAMPLE) { super(message); this.name = "CodeError"; this.line = line; this.example = example; } }; function parseRange(value, name) { const m = String(value).match(/^(\d+)(?:-(\d+))?$/); if (!m) throw new CodeError(`${name}="${value}" is not a line range; write ${name}=18-30 or ${name}=18`); const from = Number(m[1]); const to = m[2] === void 0 ? from : Number(m[2]); if (from < 1 || to < from) throw new CodeError(`${name}="${value}": the first line must be 1 or more and not after the last line`); return { from, to }; } function parseHighlight(value) { const set = /* @__PURE__ */ new Set(); for (const part of String(value).split(",").map((s) => s.trim()).filter(Boolean)) { const { from, to } = parseRange(part, "hl"); for (let n = from; n <= to; n++) set.add(n); } return set; } function parseCodeArgs(args, diff = false) { const attrs = parseAttrs(args); const keys = diff ? DIFF_KEYS : KEYS; for (const [key, value] of Object.entries(attrs)) { if (value !== true && !keys.has(key)) throw new CodeError(`unknown code block setting "${key}"; use ${[...keys].join(", ")}`, 0, diff ? DIFF_EXAMPLE : CODE_EXAMPLE); } const text = (key) => typeof attrs[key] === "string" || typeof attrs[key] === "number" ? String(attrs[key]) : void 0; return { src: text("src"), lines: text("lines"), hl: text("hl"), title: text("title"), start: text("start"), file: text("file") }; } function localPath2(ref, baseDir) { const path = resolve2(baseDir, ref); const rel = relative(baseDir, path); return rel === ".." || rel.startsWith(`..${sep}`) || isAbsolute2(rel) ? null : path; } function readSlice(ref, range, baseDir) { const path = localPath2(ref, baseDir); if (!path) return null; if (SECRET_FILE.test(basename2(path)) || relative(baseDir, path).split(sep).some((part) => SECRET_DIR.has(part))) { throw new CodeError(`"${ref}" is a file that holds keys or passwords by convention; it is not embedded. Write a sketch instead`); } let size; try { const stat = statSync2(path); if (!stat.isFile()) throw new CodeError(`"${ref}" is not a file`); size = stat.size; } catch (err) { if (err instanceof CodeError) throw err; return null; } if (size > MAX_FILE_BYTES) throw new CodeError(`"${ref}" is ${(size / 1048576).toFixed(1)} MB; code files up to ${MAX_FILE_BYTES / 1048576} MB are read`); const buf = readFileSync3(path); if (buf.includes(0)) throw new CodeError(`"${ref}" is a binary file, not code`); if (SECRET_TEXT.test(buf.toString("utf8"))) throw new CodeError(`"${ref}" looks like it holds a key or a token somewhere in the file; no part of it is embedded. Write a sketch instead`); const all = buf.toString("utf8").replace(/\r\n?/g, "\n").replace(/\n$/, "").split("\n"); const from = range?.from ?? 1; const to = range?.to ?? all.length; if (to > all.length) throw new CodeError(`"${ref}" has ${all.length} lines; lines=${range.from}-${range.to} goes past the end`); return all.slice(from - 1, to); } var EMBEDDED_BLOCK = /]*?\sdata-am-src="([^"]*)"(?:\sdata-am-lines="([^"]*)")?[^>]*>([\s\S]*?)<\/figure>/g; var LINE_SPAN = /]*>([\s\S]*?)<\/span>/g; function readEmbeddedCode(html) { return new Map([...String(html).matchAll(EMBEDDED_BLOCK)].map(([, src, lines = "", inner]) => [ `${unescapeHtml(src)}#${lines}`, [...inner.matchAll(LINE_SPAN)].map((m) => unescapeHtml(m[1])) ])); } function renderCode({ lang, args, text }, { baseDir = process.cwd(), known = /* @__PURE__ */ new Map(), ui = {}, copy = true } = {}) { const isDiff = lang === "diff"; const opts = parseCodeArgs(args, isDiff); if (isDiff && opts.src) throw new CodeError("a diff block takes the diff you paste; src= is not supported for it yet, so paste the diff into the block", 0, DIFF_EXAMPLE); const range = opts.lines ? parseRange(opts.lines, "lines") : null; if (range && !opts.src) throw new CodeError("lines= needs src=; for code you type, use start= to number the lines"); let body; let first = 1; if (opts.src) { if (text.trim()) throw new CodeError("a block with src= takes its code from the file; leave the block empty"); body = readSlice(opts.src, range, baseDir) ?? known.get(`${opts.src}#${opts.lines ?? ""}`); if (!body) { const where2 = localPath2(opts.src, baseDir) ? "not found" : `outside the current folder ${baseDir}; only files inside it are quoted`; throw new CodeError(`Code file "${opts.src}" is ${where2}`); } first = range?.from ?? 1; } else { body = text.split("\n"); if (opts.start) first = parseRange(opts.start, "start").from; } if (body.length > MAX_CODE_LINES) throw new CodeError(`the block has ${body.length} lines; quote ${MAX_CODE_LINES} lines at most, and pick the lines that make the point`); const slice = body.join("\n"); if (SECRET_TEXT.test(slice)) throw new CodeError(`${opts.src ? `"${opts.src}"` : "the block"} looks like it holds a key or a token; it is not embedded. Quote other lines or write a sketch`); const copyButton = copy ? `${esc(ui.copyCode ?? "Copy")}` : ""; const long = body.length > LONG_CODE_LINES ? [{ rule: "code-length", message: `the block has ${body.length} lines; readers skim past long code. Pick the 10 to ${LONG_CODE_LINES} lines that make the point` }] : []; if (isDiff) return renderDiff(text, opts, { copyButton, long }); const last = first + body.length - 1; const hl = opts.hl ? parseHighlight(opts.hl) : /* @__PURE__ */ new Set(); const outside = [...hl].find((n) => n < first || n > last); if (outside !== void 0) throw new CodeError(`hl=${opts.hl}: line ${outside} is not in the block (lines ${first}-${last})`); const shownLang = lang || (opts.src ? extname2(opts.src).slice(1).toLowerCase() : ""); const numbered = Boolean(opts.src || opts.start); const where = opts.src ? `${opts.src}${range ? `:${range.from === range.to ? range.from : `${range.from}-${range.to}`}` : ""}` : ""; const title = opts.title ?? where; const lines = body.map((l3, i) => { const n = first + i; return `${esc(l3)}`; }).join(""); const source = opts.src ? ` data-am-src="${esc(opts.src)}"${opts.lines ? ` data-am-lines="${esc(opts.lines)}"` : ""}` : ""; const head = `${esc(title)}${shownLang ? `${esc(shownLang)}` : ""}${copyButton}`; const html = `${head}${lines}
${esc(meta.subtitle)}
${lines}
${diffRowsHtml(diff, hl)}