tempest-react-sdk 0.77.0 → 0.79.0

package/dist/components/Markdown/markdown-parse.js

@@ -1,7 +1,24 @@
 import { safeImageUrl as e, safeLinkUrl as t } from "../../utils/safe-url.js";
 //#region src/components/Markdown/markdown-parse.ts
-var n = /^\s{0,3}(`{3,}|~{3,})\s*([\w+-]*)$/, r = /^\s{0,3}(#{1,6})\s+/, i = /^\s{0,3}([-*_])\s*(?:\1\s*){2,}$/, a = /^\s{0,3}>\s?(.*)$/, o = /^(\s*)([-*+])\s+(.*)$/, s = /^(\s*)(\d{1,9})[.)]\s+(.*)$/, c = /^\s{0,3}\|[\s|:-]*$|^\s{0,3}:?-+:?(\s*\|\s*:?-+:?)+\s*\|?$/, l = 32;
+var n = /^\s{0,3}(`{3,}|~{3,})\s*([\w+-]*)$/, r = /^\s{0,3}(#{1,6})\s+/, i = /^\s{0,3}([-*_])\s*(?:\1\s*){2,}$/, a = /^\s{0,3}>\s?(.*)$/, o = /^([^\S\n\r]*)([-*+])[^\S\n\r]+/, s = /^([^\S\n\r]*)(\d{1,9})[.)][^\S\n\r]+/;
+function c(e, t) {
+	let n = e.exec(t);
+	if (!n) return null;
+	let r = t.slice(n[0].length);
+	return r.includes("\u2028") || r.includes("\u2029") ? null : {
+		indent: n[1],
+		marker: n[2],
+		content: r
+	};
+}
+function l(e) {
+	return c(o, e);
+}
 function u(e) {
+	return c(s, e);
+}
+var d = /^\s{0,3}\|[\s|:-]*$|^\s{0,3}:?-+:?(\s*\|\s*:?-+:?)+\s*\|?$/, f = 32;
+function p(e) {
 	let t = r.exec(e);
 	if (!t) return null;
 	let n = e.slice(t[0].length).trimEnd(), i = n.length;
@@ -11,97 +28,96 @@ function u(e) {
 		text: n
 	};
 }
-function d(e) {
+function m(e) {
 	return e.endsWith("  ");
 }
-function f(e) {
-	return p(e.replace(/\r\n?/g, "\n").split("\n"), 0);
+function h(e) {
+	return g(e.replace(/\r\n?/g, "\n").split("\n"), 0);
 }
-function p(e, t) {
-	if (t >= l) {
+function g(e, t) {
+	if (t >= f) {
 		let t = e.map((e) => e.trim()).filter(Boolean).join("\n");
 		return t ? [{
 			type: "paragraph",
-			children: b(t)
+			children: C(t)
 		}] : [];
 	}
-	let r = [], f = 0;
-	for (; f < e.length;) {
-		let l = e[f];
-		if (l.trim() === "") {
-			f += 1;
+	let r = [], o = 0;
+	for (; o < e.length;) {
+		let s = e[o];
+		if (s.trim() === "") {
+			o += 1;
 			continue;
 		}
-		let g = n.exec(l.trimEnd());
-		if (g) {
-			let t = g[1][0], n = [];
-			for (f += 1; f < e.length && !RegExp(`^\\s{0,3}${t}{3,}\\s*$`).test(e[f]);) n.push(e[f]), f += 1;
-			f += 1, r.push({
+		let c = n.exec(s.trimEnd());
+		if (c) {
+			let t = c[1][0], n = [];
+			for (o += 1; o < e.length && !RegExp(`^\\s{0,3}${t}{3,}\\s*$`).test(e[o]);) n.push(e[o]), o += 1;
+			o += 1, r.push({
 				type: "code",
-				language: g[2] || null,
+				language: c[2] || null,
 				value: n.join("\n")
 			});
 			continue;
 		}
-		let v = u(l);
-		if (v) {
+		let f = p(s);
+		if (f) {
 			r.push({
 				type: "heading",
-				level: v.level,
-				children: b(v.text)
-			}), f += 1;
+				level: f.level,
+				children: C(f.text)
+			}), o += 1;
 			continue;
 		}
-		if (i.test(l)) {
-			r.push({ type: "rule" }), f += 1;
+		if (i.test(s)) {
+			r.push({ type: "rule" }), o += 1;
 			continue;
 		}
-		if (a.test(l)) {
+		if (a.test(s)) {
 			let n = [];
-			for (; f < e.length;) {
-				let t = a.exec(e[f]);
-				if (t) {
-					n.push(t[1]), f += 1;
-					continue;
+			for (; o < e.length;) {
+				let t = a.exec(e[o]);
+				if (t) n.push(t[1]), o += 1;
+				else {
+					if (e[o].trim() === "") break;
+					n.push(e[o]), o += 1;
 				}
-				if (e[f].trim() === "") break;
-				n.push(e[f]), f += 1;
 			}
 			r.push({
 				type: "quote",
-				children: p(n, t + 1)
+				children: g(n, t + 1)
 			});
 			continue;
 		}
-		if (o.test(l) || s.test(l)) {
-			let [n, i] = h(e, f, t);
-			r.push(n), f = i;
+		if (l(s) || u(s)) {
+			let [n, i] = v(e, o, t);
+			r.push(n), o = i;
 			continue;
 		}
-		if (f + 1 < e.length && l.includes("|") && c.test(e[f + 1].trimEnd())) {
-			let [t, n] = _(e, f);
-			r.push(t), f = n;
+		if (o + 1 < e.length && s.includes("|") && d.test(e[o + 1].trimEnd())) {
+			let [t, n] = b(e, o);
+			r.push(t), o = n;
 			continue;
 		}
-		let y = [], x = [];
-		for (; f < e.length && e[f].trim() !== "";) {
-			let t = e[f];
-			if (u(t) || i.test(t) || n.test(t.trimEnd()) || a.test(t) || o.test(t) || s.test(t)) break;
-			y.push(t.trim()), x.push(d(t)), f += 1;
+		let h = [], y = [];
+		for (; o < e.length && e[o].trim() !== "";) {
+			let t = e[o];
+			if (p(t) || i.test(t) || n.test(t.trimEnd()) || a.test(t) || l(t) || u(t)) break;
+			h.push(t.trim()), y.push(m(t)), o += 1;
 		}
-		y.length > 0 && r.push({
+		h.length > 0 && r.push({
 			type: "paragraph",
-			children: b(m(y, x))
+			children: C(_(h, y))
 		});
 	}
 	return r;
 }
-function m(e, t) {
+function _(e, t) {
 	return e.map((n, r) => t[r] && r < e.length - 1 ? `${n}  ` : n).join("\n");
 }
-function h(e, t, n) {
-	let r = o.exec(e[t]), i = s.exec(e[t]), a = i !== null, c = ((i ?? r)?.[1] ?? "").length, l = a ? Number(i?.[2] ?? 1) : 1, u = [], d = [], f = t, m = () => {
-		d.length !== 0 && (u.push(p(d, n + 1)), d = []);
+function v(e, t, n) {
+	let r = l(e[t]), i = u(e[t]), a = i !== null, o = (i ?? r)?.indent.length ?? 0, s = a ? Number(i?.marker ?? 1) : 1, c = [], d = [], f = t, p = () => {
+		d.length !== 0 && (c.push(g(d, n + 1)), d = []);
 	};
 	for (; f < e.length;) {
 		let t = e[f];
@@ -112,58 +128,40 @@ function h(e, t, n) {
 			}
 			break;
 		}
-		let n = o.exec(t), r = s.exec(t), i = n ?? r;
-		if (i && i[1].length <= c) {
+		let n = l(t), r = u(t), i = n ?? r;
+		if (i && i.indent.length <= o) {
 			if (!(a ? r : n)) break;
-			m(), d.push(i[3]), f += 1;
-			continue;
-		}
-		if (i) {
-			d.push(t.slice(c)), f += 1;
-			continue;
-		}
-		if (t.search(/\S/) > c) {
-			d.push(t.trim()), f += 1;
-			continue;
-		}
-		break;
+			p(), d.push(i.content), f += 1;
+		} else if (i) d.push(t.slice(o)), f += 1;
+		else if (t.search(/\S/) > o) d.push(t.trim()), f += 1;
+		else break;
 	}
-	return m(), [{
+	return p(), [{
 		type: "list",
 		ordered: a,
-		start: l,
-		items: u
+		start: s,
+		items: c
 	}, f];
 }
-function g(e) {
+function y(e) {
 	let t = e.trim().replace(/^\|/, "").replace(/\|$/, ""), n = [], r = "";
-	for (let e = 0; e < t.length; e += 1) {
-		if (t[e] === "\\" && t[e + 1] === "|") {
-			r += "|", e += 1;
-			continue;
-		}
-		if (t[e] === "|") {
-			n.push(r), r = "";
-			continue;
-		}
-		r += t[e];
-	}
+	for (let e = 0; e < t.length; e += 1) t[e] === "\\" && t[e + 1] === "|" ? (r += "|", e += 1) : t[e] === "|" ? (n.push(r), r = "") : r += t[e];
 	return n.push(r), n.map((e) => e.trim());
 }
-function _(e, t) {
-	let n = g(e[t]), r = g(e[t + 1]).map((e) => {
+function b(e, t) {
+	let n = y(e[t]), r = y(e[t + 1]).map((e) => {
 		let t = e.startsWith(":"), n = e.endsWith(":");
 		return t && n ? "center" : n ? "right" : t ? "left" : null;
 	}), i = [], a = t + 2;
-	for (; a < e.length && e[a].trim() !== "" && e[a].includes("|");) i.push(g(e[a]).map(b)), a += 1;
+	for (; a < e.length && e[a].trim() !== "" && e[a].includes("|");) i.push(y(e[a]).map(C)), a += 1;
 	return [{
 		type: "table",
 		align: r,
-		head: n.map(b),
+		head: n.map(C),
 		rows: i
 	}, a];
 }
-var v = [
+var x = [
 	{
 		guard: {
 			kind: "link",
@@ -191,7 +189,7 @@ var v = [
 		first: "[",
 		pattern: /^\[([^\]]*)\]\(((?:[^()\s]|\([^()\s]*\))+)(?:\s+"[^"]*")?\)/,
 		build: (e) => {
-			let n = t(e[2]), r = b(e[1]);
+			let n = t(e[2]), r = C(e[1]);
 			return n ? {
 				type: "link",
 				href: n,
@@ -215,7 +213,7 @@ var v = [
 		pattern: /^\*\*([\s\S]+?)\*\*/,
 		build: (e) => ({
 			type: "strong",
-			children: b(e[1])
+			children: C(e[1])
 		})
 	},
 	{
@@ -223,7 +221,7 @@ var v = [
 		pattern: /^__([\s\S]+?)__/,
 		build: (e) => ({
 			type: "strong",
-			children: b(e[1])
+			children: C(e[1])
 		})
 	},
 	{
@@ -231,7 +229,7 @@ var v = [
 		pattern: /^~~([\s\S]+?)~~/,
 		build: (e) => ({
 			type: "del",
-			children: b(e[1])
+			children: C(e[1])
 		})
 	},
 	{
@@ -239,7 +237,7 @@ var v = [
 		pattern: /^\*([^*\n]+)\*/,
 		build: (e) => ({
 			type: "em",
-			children: b(e[1])
+			children: C(e[1])
 		})
 	},
 	{
@@ -247,7 +245,7 @@ var v = [
 		pattern: /^_([^_\n]+)_/,
 		build: (e) => ({
 			type: "em",
-			children: b(e[1])
+			children: C(e[1])
 		})
 	},
 	{
@@ -277,8 +275,8 @@ var v = [
 		pattern: /^\\\n/,
 		build: () => ({ type: "break" })
 	}
-], y = new Set(v.map((e) => e.first));
-function b(e) {
+], S = new Set(x.map((e) => e.first));
+function C(e) {
 	let t = [], n = "", r = 0, i = -1, a = -1, o = -1, s = /[>\s]/g, c = () => {
 		n && t.push({
 			type: "text",
@@ -308,12 +306,12 @@ function b(e) {
 			i - r >= 2 && e[i] === "\n" ? (c(), t.push({ type: "break" }), r = i + 1) : (n += e.slice(r, i), r = i);
 			continue;
 		}
-		if (!y.has(e[r])) {
+		if (!S.has(e[r])) {
 			n += e[r], r += 1;
 			continue;
 		}
 		let i = e.slice(r), o = !1;
-		for (let n of v) {
+		for (let n of x) {
 			if (n.first !== e[r] || !d(n.guard)) continue;
 			let s = n.pattern.exec(i);
 			if (!s) {
@@ -331,6 +329,6 @@ function b(e) {
 	return c(), t;
 }
 //#endregion
-export { b as parseInline, f as parseMarkdown };
+export { C as parseInline, h as parseMarkdown };
 
 //# sourceMappingURL=markdown-parse.js.map

package/dist/components/Markdown/markdown-parse.js.map

@@ -1 +1 @@
-{"version":3,"file":"markdown-parse.js","names":[],"sources":["../../../src/components/Markdown/markdown-parse.ts"],"sourcesContent":["/**\n * @tempest-limits file-lines, function-lines — a Markdown block parser is a state\n * machine over line kinds: paragraph, heading, fence, list, quote, table and\n * thematic break each need to see the lines around them to know where they end.\n * parseBlocks is that loop, and cutting it into per-kind functions would hand each\n * one the same lookahead cursor.\n */\n// A small Markdown parser for the subset an app actually renders from untrusted\n// text: comments, ticket bodies, release notes, a product description.\n//\n// It produces a node tree, never an HTML string, and the renderer turns that into\n// React elements. No `dangerouslySetInnerHTML` exists anywhere in this component —\n// which is the property that makes rendering somebody else's Markdown safe, and it\n// is structural rather than a promise about escaping.\n//\n// Raw HTML in the input is therefore not \"sanitized\", it is **text**: `<script>` in\n// a comment renders as the four characters somebody typed. That is the whole point,\n// and it is also the documented limit — this is not a CommonMark implementation and\n// does not try to be.\n\nimport { safeImageUrl, safeLinkUrl } from \"@/utils/safe-url\";\n\n/** Inline content. */\nexport type MarkdownInline =\n    | { type: \"text\"; value: string }\n    | { type: \"strong\"; children: MarkdownInline[] }\n    | { type: \"em\"; children: MarkdownInline[] }\n    | { type: \"del\"; children: MarkdownInline[] }\n    | { type: \"code\"; value: string }\n    | { type: \"link\"; href: string; children: MarkdownInline[] }\n    | { type: \"image\"; src: string; alt: string }\n    | { type: \"break\" };\n\n/** Column alignment of a table, from the delimiter row. */\nexport type MarkdownAlign = \"left\" | \"center\" | \"right\" | null;\n\n/** Block content. */\nexport type MarkdownBlock =\n    | { type: \"heading\"; level: number; children: MarkdownInline[] }\n    | { type: \"paragraph\"; children: MarkdownInline[] }\n    | { type: \"code\"; language: string | null; value: string }\n    | { type: \"quote\"; children: MarkdownBlock[] }\n    | { type: \"list\"; ordered: boolean; start: number; items: MarkdownBlock[][] }\n    | {\n          type: \"table\";\n          align: MarkdownAlign[];\n          head: MarkdownInline[][];\n          rows: MarkdownInline[][][];\n      }\n    | { type: \"rule\" };\n\n/**\n * A fence opener, matched against the line **after** `trimEnd()`.\n *\n * The trailing `\\s*` lives in the `trimEnd()` rather than in the pattern: with it,\n * `\\s*([\\w+-]*)\\s*$` is two whitespace quantifiers separated by one that may be\n * empty, and a fence followed by 20 000 spaces and a stray `!` took 0.36 s (#437).\n */\nconst FENCE = /^\\s{0,3}(`{3,}|~{3,})\\s*([\\w+-]*)$/;\n/**\n * The opening marker of an ATX heading. The text and the optional closing `#` run\n * are cut by {@link matchHeading} with string operations, not by this pattern.\n */\nconst HEADING_OPEN = /^\\s{0,3}(#{1,6})\\s+/;\nconst RULE = /^\\s{0,3}([-*_])\\s*(?:\\1\\s*){2,}$/;\nconst QUOTE = /^\\s{0,3}>\\s?(.*)$/;\nconst BULLET = /^(\\s*)([-*+])\\s+(.*)$/;\nconst ORDERED = /^(\\s*)(\\d{1,9})[.)]\\s+(.*)$/;\n/**\n * A table's delimiter row, matched against the line **after** `trimEnd()`.\n *\n * The `|` is required somewhere in the line, and that is what tells a one-column\n * table (`| --- |`) apart from a thematic break (`---`) — a single column is a\n * legitimate table, and the first version of this regex demanded two. The trailing\n * whitespace is trimmed before the test for the same reason as {@link FENCE}: a\n * `\\s*\\|?\\s*$` tail backtracked quadratically on `- |` plus 50 000 spaces (#437).\n */\nconst TABLE_DELIMITER = /^\\s{0,3}\\|[\\s|:-]*$|^\\s{0,3}:?-+:?(\\s*\\|\\s*:?-+:?)+\\s*\\|?$/;\n\n/**\n * How deep quotes and lists may nest before the rest is read as a paragraph.\n *\n * Each level is one recursive {@link parseBlocks} call and one nested element in\n * the render, so `\"- \".repeat(20000)` used to throw `RangeError: Maximum call stack\n * size exceeded` out of the component (#437). Real documents stop at a handful of\n * levels; past this cap the words are kept, only the nesting is dropped.\n */\nconst MAX_NESTING_DEPTH = 32;\n\n/**\n * Match an ATX heading in linear time.\n *\n * The regex this replaces, `/^\\s{0,3}(#{1,6})\\s+(.*?)\\s*#*\\s*$/`, let a lazy `.*?`\n * and two `\\s*` race for the same run of spaces: `\"# a\" + \" \".repeat(4000) + \"b\"`\n * took about 4.7 s, cubic in the run (#437). Only the opening marker is a regex\n * now. The text is the rest of the line minus the longest suffix shaped like\n * `\\s*#*\\s*` — exactly what the lazy group left behind, so `# título #`,\n * `# título#` and `# #` read as before.\n *\n * @param line - One source line.\n * @returns The level and raw text, or `null` when the line is not a heading.\n */\nfunction matchHeading(line: string): { level: number; text: string } | null {\n    const open = HEADING_OPEN.exec(line);\n    if (!open) return null;\n    let text = line.slice(open[0].length).trimEnd();\n    let end = text.length;\n    while (end > 0 && text[end - 1] === \"#\") end -= 1;\n    text = text.slice(0, end).trimEnd();\n    return { level: open[1].length, text };\n}\n\n/**\n * Whether a paragraph line ends in a hard break: two or more trailing spaces.\n *\n * `/ {2,}$/` was quadratic on a line with a long inner run of spaces — it retried\n * the run from every space and failed at the next word each time (0.57 s for\n * 50 000 spaces, #437).\n */\nfunction endsWithHardBreak(line: string): boolean {\n    return line.endsWith(\"  \");\n}\n\n/**\n * Parse a Markdown document into blocks.\n *\n * @param source - Raw Markdown.\n * @returns Block nodes in document order.\n */\nexport function parseMarkdown(source: string): MarkdownBlock[] {\n    const lines = source.replace(/\\r\\n?/g, \"\\n\").split(\"\\n\");\n    return parseBlocks(lines, 0);\n}\n\n/**\n * Parse a run of lines into blocks.\n *\n * @param lines - The lines of this container.\n * @param depth - How many quotes and lists enclose them. At\n *   {@link MAX_NESTING_DEPTH} the lines become one paragraph instead of more\n *   containers, so a hostile document cannot exhaust the stack.\n * @returns The blocks.\n */\nfunction parseBlocks(lines: string[], depth: number): MarkdownBlock[] {\n    if (depth >= MAX_NESTING_DEPTH) {\n        const source = lines\n            .map((line) => line.trim())\n            .filter(Boolean)\n            .join(\"\\n\");\n        return source ? [{ type: \"paragraph\", children: parseInline(source) }] : [];\n    }\n    const blocks: MarkdownBlock[] = [];\n    let i = 0;\n\n    while (i < lines.length) {\n        const line = lines[i];\n\n        if (line.trim() === \"\") {\n            i += 1;\n            continue;\n        }\n\n        const fence = FENCE.exec(line.trimEnd());\n        if (fence) {\n            const marker = fence[1][0];\n            const body: string[] = [];\n            i += 1;\n            while (i < lines.length && !new RegExp(`^\\\\s{0,3}${marker}{3,}\\\\s*$`).test(lines[i])) {\n                body.push(lines[i]);\n                i += 1;\n            }\n            // An unterminated fence still yields a code block: the alternative is to\n            // render the rest of the document as prose full of backticks.\n            i += 1;\n            blocks.push({ type: \"code\", language: fence[2] || null, value: body.join(\"\\n\") });\n            continue;\n        }\n\n        const heading = matchHeading(line);\n        if (heading) {\n            blocks.push({\n                type: \"heading\",\n                level: heading.level,\n                children: parseInline(heading.text),\n            });\n            i += 1;\n            continue;\n        }\n\n        if (RULE.test(line)) {\n            blocks.push({ type: \"rule\" });\n            i += 1;\n            continue;\n        }\n\n        if (QUOTE.test(line)) {\n            const inner: string[] = [];\n            while (i < lines.length) {\n                const match = QUOTE.exec(lines[i]);\n                if (match) {\n                    inner.push(match[1]);\n                    i += 1;\n                    continue;\n                }\n                // A blank line ends the quote; a plain line continues it (lazy\n                // continuation), which is how people actually write quotes.\n                if (lines[i].trim() === \"\") break;\n                inner.push(lines[i]);\n                i += 1;\n            }\n            blocks.push({ type: \"quote\", children: parseBlocks(inner, depth + 1) });\n            continue;\n        }\n\n        if (BULLET.test(line) || ORDERED.test(line)) {\n            const [list, next] = parseList(lines, i, depth);\n            blocks.push(list);\n            i = next;\n            continue;\n        }\n\n        if (\n            i + 1 < lines.length &&\n            line.includes(\"|\") &&\n            TABLE_DELIMITER.test(lines[i + 1].trimEnd())\n        ) {\n            const [table, next] = parseTable(lines, i);\n            blocks.push(table);\n            i = next;\n            continue;\n        }\n\n        const paragraph: string[] = [];\n        const hardBreaks: boolean[] = [];\n        while (i < lines.length && lines[i].trim() !== \"\") {\n            const current = lines[i];\n            if (\n                matchHeading(current) ||\n                RULE.test(current) ||\n                FENCE.test(current.trimEnd()) ||\n                QUOTE.test(current) ||\n                BULLET.test(current) ||\n                ORDERED.test(current)\n            ) {\n                break;\n            }\n            paragraph.push(current.trim());\n            hardBreaks.push(endsWithHardBreak(current));\n            i += 1;\n        }\n        if (paragraph.length > 0) {\n            blocks.push({\n                type: \"paragraph\",\n                children: parseInline(joinParagraph(paragraph, hardBreaks)),\n            });\n        }\n    }\n\n    return blocks;\n}\n\n/**\n * Re-join the lines of a paragraph, keeping the two-space hard break.\n *\n * Every line is trimmed before it is parsed, because leading indentation is not\n * content and a trailing space is invisible noise in almost every line. The one\n * exception is the CommonMark hard break: two or more trailing spaces mean\n * \"break the line here\", so trimming first would delete the only mark that says\n * so and the `  \\n` inline rule could never match. The flag is recorded before\n * the trim and the marker put back here, on every line but the last — a break\n * after the final line of a paragraph would break into nothing.\n *\n * @param lines - The trimmed lines, in order.\n * @param hardBreaks - Whether each line ended in two or more spaces.\n * @returns The paragraph source the inline parser reads.\n */\nfunction joinParagraph(lines: readonly string[], hardBreaks: readonly boolean[]): string {\n    return lines\n        .map((line, index) => (hardBreaks[index] && index < lines.length - 1 ? `${line}  ` : line))\n        .join(\"\\n\");\n}\n\n/**\n * Parse a list, including nested lists and multi-line items.\n *\n * Nesting is decided by indentation relative to the **first** item's marker, so a\n * list indented inside a quote or another list still reads correctly.\n *\n * @param lines - The lines of the enclosing container.\n * @param start - Index of the first item's line.\n * @param depth - Nesting depth of the enclosing container.\n * @returns The list node and the index of the first line after it.\n */\nfunction parseList(lines: string[], start: number, depth: number): [MarkdownBlock, number] {\n    const bulletStart = BULLET.exec(lines[start]);\n    const orderedStart = ORDERED.exec(lines[start]);\n    // The two markers are mutually exclusive — `-*+` versus digits — so whichever\n    // matched decides the list kind.\n    const ordered = orderedStart !== null;\n    const first = orderedStart ?? bulletStart;\n    const baseIndent = (first?.[1] ?? \"\").length;\n    const startNumber = ordered ? Number(orderedStart?.[2] ?? 1) : 1;\n\n    const items: MarkdownBlock[][] = [];\n    let buffer: string[] = [];\n    let i = start;\n\n    const flush = (): void => {\n        if (buffer.length === 0) return;\n        items.push(parseBlocks(buffer, depth + 1));\n        buffer = [];\n    };\n\n    while (i < lines.length) {\n        const line = lines[i];\n        if (line.trim() === \"\") {\n            // A single blank line inside a list is a loose item, not the end. Two in\n            // a row end it, which is what a blank-then-paragraph document means.\n            if (i + 1 < lines.length && lines[i + 1].trim() !== \"\") {\n                buffer.push(\"\");\n                i += 1;\n                continue;\n            }\n            break;\n        }\n        const bullet = BULLET.exec(line);\n        const numbered = ORDERED.exec(line);\n        const match = bullet ?? numbered;\n\n        if (match && match[1].length <= baseIndent) {\n            const sameKind = ordered ? Boolean(numbered) : Boolean(bullet);\n            if (!sameKind) break;\n            flush();\n            buffer.push(match[3]);\n            i += 1;\n            continue;\n        }\n        if (match) {\n            // Deeper marker: keep the indentation so the recursive call sees a list.\n            buffer.push(line.slice(baseIndent));\n            i += 1;\n            continue;\n        }\n        if (line.search(/\\S/) > baseIndent) {\n            buffer.push(line.trim());\n            i += 1;\n            continue;\n        }\n        break;\n    }\n    flush();\n\n    return [{ type: \"list\", ordered, start: startNumber, items }, i];\n}\n\n/** Split a table row on unescaped pipes. */\nfunction splitRow(line: string): string[] {\n    const trimmed = line.trim().replace(/^\\|/, \"\").replace(/\\|$/, \"\");\n    const cells: string[] = [];\n    let current = \"\";\n    for (let i = 0; i < trimmed.length; i += 1) {\n        if (trimmed[i] === \"\\\\\" && trimmed[i + 1] === \"|\") {\n            current += \"|\";\n            i += 1;\n            continue;\n        }\n        if (trimmed[i] === \"|\") {\n            cells.push(current);\n            current = \"\";\n            continue;\n        }\n        current += trimmed[i];\n    }\n    cells.push(current);\n    return cells.map((cell) => cell.trim());\n}\n\n/**\n * Parse a GFM pipe table.\n *\n * @returns The table node and the index of the first line after it.\n */\nfunction parseTable(lines: string[], start: number): [MarkdownBlock, number] {\n    const head = splitRow(lines[start]);\n    const align: MarkdownAlign[] = splitRow(lines[start + 1]).map((cell) => {\n        const left = cell.startsWith(\":\");\n        const right = cell.endsWith(\":\");\n        if (left && right) return \"center\";\n        if (right) return \"right\";\n        if (left) return \"left\";\n        return null;\n    });\n\n    const rows: MarkdownInline[][][] = [];\n    let i = start + 2;\n    while (i < lines.length && lines[i].trim() !== \"\" && lines[i].includes(\"|\")) {\n        rows.push(splitRow(lines[i]).map(parseInline));\n        i += 1;\n    }\n\n    return [{ type: \"table\", align, head: head.map(parseInline), rows }, i];\n}\n\n/**\n * The precheck a rule needs before its pattern may run, keyed by the opener the\n * pattern starts with.\n *\n * `link` covers links and images, whose label ends at the first `]`; `autolink`\n * covers `<scheme:...>`, which ends at the first `>` or whitespace. Without the\n * precheck each pattern scanned to the end of the text from every opener, and\n * `\"[\".repeat(50000)` took 0.6 s (#437).\n */\ntype InlineGuard = { kind: \"link\"; opener: \"[\" | \"![\" } | { kind: \"autolink\"; opener: \"<\" };\n\n/** Inline delimiters, longest marker first so `**` wins over `*`. */\nconst INLINE_RULES: Array<{\n    first: string;\n    pattern: RegExp;\n    guard?: InlineGuard;\n    build: (match: RegExpExecArray) => MarkdownInline | null;\n}> = [\n    {\n        guard: { kind: \"link\", opener: \"![\" },\n        first: \"!\",\n        pattern: /^!\\[([^\\]]*)\\]\\(((?:[^()\\s]|\\([^()\\s]*\\))+)(?:\\s+\"[^\"]*\")?\\)/,\n        build: (match) => {\n            const src = safeImageUrl(match[2]);\n            return src ? { type: \"image\", src, alt: match[1] } : { type: \"text\", value: match[1] };\n        },\n    },\n    {\n        guard: { kind: \"link\", opener: \"[\" },\n        first: \"[\",\n        pattern: /^\\[([^\\]]*)\\]\\(((?:[^()\\s]|\\([^()\\s]*\\))+)(?:\\s+\"[^\"]*\")?\\)/,\n        build: (match) => {\n            const href = safeLinkUrl(match[2]);\n            const children = parseInline(match[1]);\n            // A rejected URL keeps the label as plain text: dropping the text too\n            // would silently delete words somebody wrote.\n            return href ? { type: \"link\", href, children } : { type: \"text\", value: match[1] };\n        },\n    },\n    { first: \"`\", pattern: /^`([^`]+)`/, build: (match) => ({ type: \"code\", value: match[1] }) },\n    {\n        first: \"*\",\n        pattern: /^\\*\\*([\\s\\S]+?)\\*\\*/,\n        build: (match) => ({ type: \"strong\", children: parseInline(match[1]) }),\n    },\n    {\n        first: \"_\",\n        pattern: /^__([\\s\\S]+?)__/,\n        build: (match) => ({ type: \"strong\", children: parseInline(match[1]) }),\n    },\n    {\n        first: \"~\",\n        pattern: /^~~([\\s\\S]+?)~~/,\n        build: (match) => ({ type: \"del\", children: parseInline(match[1]) }),\n    },\n    {\n        first: \"*\",\n        pattern: /^\\*([^*\\n]+)\\*/,\n        build: (match) => ({ type: \"em\", children: parseInline(match[1]) }),\n    },\n    {\n        first: \"_\",\n        pattern: /^_([^_\\n]+)_/,\n        build: (match) => ({ type: \"em\", children: parseInline(match[1]) }),\n    },\n    {\n        guard: { kind: \"autolink\", opener: \"<\" },\n        first: \"<\",\n        pattern: /^<((?:https?:\\/\\/|mailto:)[^>\\s]+)>/,\n        build: (match) => {\n            const href = safeLinkUrl(match[1]);\n            return href\n                ? { type: \"link\", href, children: [{ type: \"text\", value: match[1] }] }\n                : { type: \"text\", value: match[1] };\n        },\n    },\n    { first: \"\\\\\", pattern: /^\\\\\\n/, build: () => ({ type: \"break\" }) },\n];\n\n/** Characters some inline rule can start with; any other character is text. */\nconst INLINE_FIRST = new Set(INLINE_RULES.map((rule) => rule.first));\n\n/**\n * Parse inline Markdown.\n *\n * A backslash escapes the next character, so `\\*not italic\\*` renders with the\n * asterisks. Anything that matches no rule is text — an unclosed `**` is two\n * asterisks, not a bold run to the end of the paragraph.\n *\n * The parse is linear in the text, which matters because the text is somebody\n * else's (#437):\n *\n * - A run of spaces is consumed whole: it is a hard break when two or more of them\n *   end at a newline, and text otherwise. Matching `^ {2,}\\n` from every space\n *   rescanned the run each time.\n * - A link or image label ends at the first `]` after the opener, so every opener\n *   before the same `]` shares the same `](...)` tail. The position of that `]` is\n *   cached, an opener whose `]` is not followed by `(` is skipped without running\n *   the pattern, and once a tail has failed no later opener retries it.\n * - An autolink ends at the first `>` or whitespace, also cached; when that stop\n *   is not `>` the pattern cannot match and is not run.\n * - A rule runs only at its own first character, so a run of `[` costs one set\n *   lookup per character instead of every pattern in the table.\n *\n * @param source - One block's text.\n * @returns Inline nodes.\n */\nexport function parseInline(source: string): MarkdownInline[] {\n    const nodes: MarkdownInline[] = [];\n    let text = \"\";\n    let i = 0;\n\n    let bracketAt = -1;\n    let deadTailAt = -1;\n    let stopAt = -1;\n    const stops = /[>\\s]/g;\n\n    const flush = (): void => {\n        if (text) nodes.push({ type: \"text\", value: text });\n        text = \"\";\n    };\n\n    const closingBracket = (from: number): number => {\n        if (bracketAt < from) {\n            const found = source.indexOf(\"]\", from);\n            bracketAt = found === -1 ? source.length : found;\n        }\n        return bracketAt;\n    };\n\n    const autolinkStop = (from: number): number => {\n        if (stopAt < from) {\n            stops.lastIndex = from;\n            stopAt = stops.exec(source)?.index ?? source.length;\n        }\n        return stopAt;\n    };\n\n    const allowed = (guard: InlineGuard | undefined): boolean => {\n        if (!guard) return true;\n        if (!source.startsWith(guard.opener, i)) return false;\n        if (guard.kind === \"autolink\") return source[autolinkStop(i + 1)] === \">\";\n        const close = closingBracket(i + guard.opener.length);\n        return source[close + 1] === \"(\" && close !== deadTailAt;\n    };\n\n    while (i < source.length) {\n        if (source[i] === \"\\\\\" && i + 1 < source.length && source[i + 1] !== \"\\n\") {\n            text += source[i + 1];\n            i += 2;\n            continue;\n        }\n\n        if (source[i] === \" \") {\n            let end = i;\n            while (source[end] === \" \") end += 1;\n            if (end - i >= 2 && source[end] === \"\\n\") {\n                flush();\n                nodes.push({ type: \"break\" });\n                i = end + 1;\n            } else {\n                text += source.slice(i, end);\n                i = end;\n            }\n            continue;\n        }\n\n        if (!INLINE_FIRST.has(source[i])) {\n            text += source[i];\n            i += 1;\n            continue;\n        }\n\n        const rest = source.slice(i);\n        let matched = false;\n        for (const rule of INLINE_RULES) {\n            if (rule.first !== source[i] || !allowed(rule.guard)) continue;\n            const match = rule.pattern.exec(rest);\n            if (!match) {\n                if (rule.guard?.kind === \"link\") {\n                    deadTailAt = closingBracket(i + rule.guard.opener.length);\n                }\n                continue;\n            }\n            const node = rule.build(match);\n            if (!node) continue;\n            flush();\n            nodes.push(node);\n            i += match[0].length;\n            matched = true;\n            break;\n        }\n        if (matched) continue;\n\n        text += source[i];\n        i += 1;\n    }\n\n    flush();\n    return nodes;\n}\n"],"mappings":";;AA0DA,IAAM,IAAQ,sCAKR,IAAe,uBACf,IAAO,oCACP,IAAQ,qBACR,IAAS,yBACT,IAAU,+BAUV,IAAkB,8DAUlB,IAAoB;AAe1B,SAAS,EAAa,GAAsD;CACxE,IAAM,IAAO,EAAa,KAAK,CAAI;CACnC,IAAI,CAAC,GAAM,OAAO;CAClB,IAAI,IAAO,EAAK,MAAM,EAAK,EAAE,CAAC,MAAM,CAAC,CAAC,QAAQ,GAC1C,IAAM,EAAK;CACf,OAAO,IAAM,KAAK,EAAK,IAAM,OAAO,MAAK;CAEzC,OADA,IAAO,EAAK,MAAM,GAAG,CAAG,CAAC,CAAC,QAAQ,GAC3B;EAAE,OAAO,EAAK,EAAE,CAAC;EAAQ;CAAK;AACzC;AASA,SAAS,EAAkB,GAAuB;CAC9C,OAAO,EAAK,SAAS,IAAI;AAC7B;AAQA,SAAgB,EAAc,GAAiC;CAE3D,OAAO,EADO,EAAO,QAAQ,UAAU,IAAI,CAAC,CAAC,MAAM,IAChC,GAAO,CAAC;AAC/B;AAWA,SAAS,EAAY,GAAiB,GAAgC;CAClE,IAAI,KAAS,GAAmB;EAC5B,IAAM,IAAS,EACV,KAAK,MAAS,EAAK,KAAK,CAAC,CAAC,CAC1B,OAAO,OAAO,CAAC,CACf,KAAK,IAAI;EACd,OAAO,IAAS,CAAC;GAAE,MAAM;GAAa,UAAU,EAAY,CAAM;EAAE,CAAC,IAAI,CAAC;CAC9E;CACA,IAAM,IAA0B,CAAC,GAC7B,IAAI;CAER,OAAO,IAAI,EAAM,SAAQ;EACrB,IAAM,IAAO,EAAM;EAEnB,IAAI,EAAK,KAAK,MAAM,IAAI;GACpB,KAAK;GACL;EACJ;EAEA,IAAM,IAAQ,EAAM,KAAK,EAAK,QAAQ,CAAC;EACvC,IAAI,GAAO;GACP,IAAM,IAAS,EAAM,EAAE,CAAC,IAClB,IAAiB,CAAC;GAExB,KADA,KAAK,GACE,IAAI,EAAM,UAAU,CAAK,OAAO,YAAY,EAAO,UAAU,CAAC,CAAC,KAAK,EAAM,EAAE,IAE/E,AADA,EAAK,KAAK,EAAM,EAAE,GAClB,KAAK;GAKT,AADA,KAAK,GACL,EAAO,KAAK;IAAE,MAAM;IAAQ,UAAU,EAAM,MAAM;IAAM,OAAO,EAAK,KAAK,IAAI;GAAE,CAAC;GAChF;EACJ;EAEA,IAAM,IAAU,EAAa,CAAI;EACjC,IAAI,GAAS;GAMT,AALA,EAAO,KAAK;IACR,MAAM;IACN,OAAO,EAAQ;IACf,UAAU,EAAY,EAAQ,IAAI;GACtC,CAAC,GACD,KAAK;GACL;EACJ;EAEA,IAAI,EAAK,KAAK,CAAI,GAAG;GAEjB,AADA,EAAO,KAAK,EAAE,MAAM,OAAO,CAAC,GAC5B,KAAK;GACL;EACJ;EAEA,IAAI,EAAM,KAAK,CAAI,GAAG;GAClB,IAAM,IAAkB,CAAC;GACzB,OAAO,IAAI,EAAM,SAAQ;IACrB,IAAM,IAAQ,EAAM,KAAK,EAAM,EAAE;IACjC,IAAI,GAAO;KAEP,AADA,EAAM,KAAK,EAAM,EAAE,GACnB,KAAK;KACL;IACJ;IAGA,IAAI,EAAM,EAAE,CAAC,KAAK,MAAM,IAAI;IAE5B,AADA,EAAM,KAAK,EAAM,EAAE,GACnB,KAAK;GACT;GACA,EAAO,KAAK;IAAE,MAAM;IAAS,UAAU,EAAY,GAAO,IAAQ,CAAC;GAAE,CAAC;GACtE;EACJ;EAEA,IAAI,EAAO,KAAK,CAAI,KAAK,EAAQ,KAAK,CAAI,GAAG;GACzC,IAAM,CAAC,GAAM,KAAQ,EAAU,GAAO,GAAG,CAAK;GAE9C,AADA,EAAO,KAAK,CAAI,GAChB,IAAI;GACJ;EACJ;EAEA,IACI,IAAI,IAAI,EAAM,UACd,EAAK,SAAS,GAAG,KACjB,EAAgB,KAAK,EAAM,IAAI,EAAE,CAAC,QAAQ,CAAC,GAC7C;GACE,IAAM,CAAC,GAAO,KAAQ,EAAW,GAAO,CAAC;GAEzC,AADA,EAAO,KAAK,CAAK,GACjB,IAAI;GACJ;EACJ;EAEA,IAAM,IAAsB,CAAC,GACvB,IAAwB,CAAC;EAC/B,OAAO,IAAI,EAAM,UAAU,EAAM,EAAE,CAAC,KAAK,MAAM,KAAI;GAC/C,IAAM,IAAU,EAAM;GACtB,IACI,EAAa,CAAO,KACpB,EAAK,KAAK,CAAO,KACjB,EAAM,KAAK,EAAQ,QAAQ,CAAC,KAC5B,EAAM,KAAK,CAAO,KAClB,EAAO,KAAK,CAAO,KACnB,EAAQ,KAAK,CAAO,GAEpB;GAIJ,AAFA,EAAU,KAAK,EAAQ,KAAK,CAAC,GAC7B,EAAW,KAAK,EAAkB,CAAO,CAAC,GAC1C,KAAK;EACT;EACA,AAAI,EAAU,SAAS,KACnB,EAAO,KAAK;GACR,MAAM;GACN,UAAU,EAAY,EAAc,GAAW,CAAU,CAAC;EAC9D,CAAC;CAET;CAEA,OAAO;AACX;AAiBA,SAAS,EAAc,GAA0B,GAAwC;CACrF,OAAO,EACF,KAAK,GAAM,MAAW,EAAW,MAAU,IAAQ,EAAM,SAAS,IAAI,GAAG,EAAK,MAAM,CAAK,CAAC,CAC1F,KAAK,IAAI;AAClB;AAaA,SAAS,EAAU,GAAiB,GAAe,GAAwC;CACvF,IAAM,IAAc,EAAO,KAAK,EAAM,EAAM,GACtC,IAAe,EAAQ,KAAK,EAAM,EAAM,GAGxC,IAAU,MAAiB,MAE3B,MADQ,KAAgB,EAAA,GACF,MAAM,GAAA,CAAI,QAChC,IAAc,IAAU,OAAO,IAAe,MAAM,CAAC,IAAI,GAEzD,IAA2B,CAAC,GAC9B,IAAmB,CAAC,GACpB,IAAI,GAEF,UAAoB;EAClB,EAAO,WAAW,MACtB,EAAM,KAAK,EAAY,GAAQ,IAAQ,CAAC,CAAC,GACzC,IAAS,CAAC;CACd;CAEA,OAAO,IAAI,EAAM,SAAQ;EACrB,IAAM,IAAO,EAAM;EACnB,IAAI,EAAK,KAAK,MAAM,IAAI;GAGpB,IAAI,IAAI,IAAI,EAAM,UAAU,EAAM,IAAI,EAAE,CAAC,KAAK,MAAM,IAAI;IAEpD,AADA,EAAO,KAAK,EAAE,GACd,KAAK;IACL;GACJ;GACA;EACJ;EACA,IAAM,IAAS,EAAO,KAAK,CAAI,GACzB,IAAW,EAAQ,KAAK,CAAI,GAC5B,IAAQ,KAAU;EAExB,IAAI,KAAS,EAAM,EAAE,CAAC,UAAU,GAAY;GAExC,IAAI,EADa,IAAkB,IAAoB,IACxC;GAGf,AAFA,EAAM,GACN,EAAO,KAAK,EAAM,EAAE,GACpB,KAAK;GACL;EACJ;EACA,IAAI,GAAO;GAGP,AADA,EAAO,KAAK,EAAK,MAAM,CAAU,CAAC,GAClC,KAAK;GACL;EACJ;EACA,IAAI,EAAK,OAAO,IAAI,IAAI,GAAY;GAEhC,AADA,EAAO,KAAK,EAAK,KAAK,CAAC,GACvB,KAAK;GACL;EACJ;EACA;CACJ;CAGA,OAFA,EAAM,GAEC,CAAC;EAAE,MAAM;EAAQ;EAAS,OAAO;EAAa;CAAM,GAAG,CAAC;AACnE;AAGA,SAAS,EAAS,GAAwB;CACtC,IAAM,IAAU,EAAK,KAAK,CAAC,CAAC,QAAQ,OAAO,EAAE,CAAC,CAAC,QAAQ,OAAO,EAAE,GAC1D,IAAkB,CAAC,GACrB,IAAU;CACd,KAAK,IAAI,IAAI,GAAG,IAAI,EAAQ,QAAQ,KAAK,GAAG;EACxC,IAAI,EAAQ,OAAO,QAAQ,EAAQ,IAAI,OAAO,KAAK;GAE/C,AADA,KAAW,KACX,KAAK;GACL;EACJ;EACA,IAAI,EAAQ,OAAO,KAAK;GAEpB,AADA,EAAM,KAAK,CAAO,GAClB,IAAU;GACV;EACJ;EACA,KAAW,EAAQ;CACvB;CAEA,OADA,EAAM,KAAK,CAAO,GACX,EAAM,KAAK,MAAS,EAAK,KAAK,CAAC;AAC1C;AAOA,SAAS,EAAW,GAAiB,GAAwC;CACzE,IAAM,IAAO,EAAS,EAAM,EAAM,GAC5B,IAAyB,EAAS,EAAM,IAAQ,EAAE,CAAC,CAAC,KAAK,MAAS;EACpE,IAAM,IAAO,EAAK,WAAW,GAAG,GAC1B,IAAQ,EAAK,SAAS,GAAG;EAI/B,OAHI,KAAQ,IAAc,WACtB,IAAc,UACd,IAAa,SACV;CACX,CAAC,GAEK,IAA6B,CAAC,GAChC,IAAI,IAAQ;CAChB,OAAO,IAAI,EAAM,UAAU,EAAM,EAAE,CAAC,KAAK,MAAM,MAAM,EAAM,EAAE,CAAC,SAAS,GAAG,IAEtE,AADA,EAAK,KAAK,EAAS,EAAM,EAAE,CAAC,CAAC,IAAI,CAAW,CAAC,GAC7C,KAAK;CAGT,OAAO,CAAC;EAAE,MAAM;EAAS;EAAO,MAAM,EAAK,IAAI,CAAW;EAAG;CAAK,GAAG,CAAC;AAC1E;AAcA,IAAM,IAKD;CACD;EACI,OAAO;GAAE,MAAM;GAAQ,QAAQ;EAAK;EACpC,OAAO;EACP,SAAS;EACT,QAAQ,MAAU;GACd,IAAM,IAAM,EAAa,EAAM,EAAE;GACjC,OAAO,IAAM;IAAE,MAAM;IAAS;IAAK,KAAK,EAAM;GAAG,IAAI;IAAE,MAAM;IAAQ,OAAO,EAAM;GAAG;EACzF;CACJ;CACA;EACI,OAAO;GAAE,MAAM;GAAQ,QAAQ;EAAI;EACnC,OAAO;EACP,SAAS;EACT,QAAQ,MAAU;GACd,IAAM,IAAO,EAAY,EAAM,EAAE,GAC3B,IAAW,EAAY,EAAM,EAAE;GAGrC,OAAO,IAAO;IAAE,MAAM;IAAQ;IAAM;GAAS,IAAI;IAAE,MAAM;IAAQ,OAAO,EAAM;GAAG;EACrF;CACJ;CACA;EAAE,OAAO;EAAK,SAAS;EAAc,QAAQ,OAAW;GAAE,MAAM;GAAQ,OAAO,EAAM;EAAG;CAAG;CAC3F;EACI,OAAO;EACP,SAAS;EACT,QAAQ,OAAW;GAAE,MAAM;GAAU,UAAU,EAAY,EAAM,EAAE;EAAE;CACzE;CACA;EACI,OAAO;EACP,SAAS;EACT,QAAQ,OAAW;GAAE,MAAM;GAAU,UAAU,EAAY,EAAM,EAAE;EAAE;CACzE;CACA;EACI,OAAO;EACP,SAAS;EACT,QAAQ,OAAW;GAAE,MAAM;GAAO,UAAU,EAAY,EAAM,EAAE;EAAE;CACtE;CACA;EACI,OAAO;EACP,SAAS;EACT,QAAQ,OAAW;GAAE,MAAM;GAAM,UAAU,EAAY,EAAM,EAAE;EAAE;CACrE;CACA;EACI,OAAO;EACP,SAAS;EACT,QAAQ,OAAW;GAAE,MAAM;GAAM,UAAU,EAAY,EAAM,EAAE;EAAE;CACrE;CACA;EACI,OAAO;GAAE,MAAM;GAAY,QAAQ;EAAI;EACvC,OAAO;EACP,SAAS;EACT,QAAQ,MAAU;GACd,IAAM,IAAO,EAAY,EAAM,EAAE;GACjC,OAAO,IACD;IAAE,MAAM;IAAQ;IAAM,UAAU,CAAC;KAAE,MAAM;KAAQ,OAAO,EAAM;IAAG,CAAC;GAAE,IACpE;IAAE,MAAM;IAAQ,OAAO,EAAM;GAAG;EAC1C;CACJ;CACA;EAAE,OAAO;EAAM,SAAS;EAAS,cAAc,EAAE,MAAM,QAAQ;CAAG;AACtE,GAGM,IAAe,IAAI,IAAI,EAAa,KAAK,MAAS,EAAK,KAAK,CAAC;AA2BnE,SAAgB,EAAY,GAAkC;CAC1D,IAAM,IAA0B,CAAC,GAC7B,IAAO,IACP,IAAI,GAEJ,IAAY,IACZ,IAAa,IACb,IAAS,IACP,IAAQ,UAER,UAAoB;EAEtB,AADI,KAAM,EAAM,KAAK;GAAE,MAAM;GAAQ,OAAO;EAAK,CAAC,GAClD,IAAO;CACX,GAEM,KAAkB,MAAyB;EAC7C,IAAI,IAAY,GAAM;GAClB,IAAM,IAAQ,EAAO,QAAQ,KAAK,CAAI;GACtC,IAAY,MAAU,KAAK,EAAO,SAAS;EAC/C;EACA,OAAO;CACX,GAEM,KAAgB,OACd,IAAS,MACT,EAAM,YAAY,GAClB,IAAS,EAAM,KAAK,CAAM,CAAC,EAAE,SAAS,EAAO,SAE1C,IAGL,KAAW,MAA4C;EACzD,IAAI,CAAC,GAAO,OAAO;EACnB,IAAI,CAAC,EAAO,WAAW,EAAM,QAAQ,CAAC,GAAG,OAAO;EAChD,IAAI,EAAM,SAAS,YAAY,OAAO,EAAO,EAAa,IAAI,CAAC,OAAO;EACtE,IAAM,IAAQ,EAAe,IAAI,EAAM,OAAO,MAAM;EACpD,OAAO,EAAO,IAAQ,OAAO,OAAO,MAAU;CAClD;CAEA,OAAO,IAAI,EAAO,SAAQ;EACtB,IAAI,EAAO,OAAO,QAAQ,IAAI,IAAI,EAAO,UAAU,EAAO,IAAI,OAAO,MAAM;GAEvE,AADA,KAAQ,EAAO,IAAI,IACnB,KAAK;GACL;EACJ;EAEA,IAAI,EAAO,OAAO,KAAK;GACnB,IAAI,IAAM;GACV,OAAO,EAAO,OAAS,MAAK,KAAO;GACnC,AAAI,IAAM,KAAK,KAAK,EAAO,OAAS,QAChC,EAAM,GACN,EAAM,KAAK,EAAE,MAAM,QAAQ,CAAC,GAC5B,IAAI,IAAM,MAEV,KAAQ,EAAO,MAAM,GAAG,CAAG,GAC3B,IAAI;GAER;EACJ;EAEA,IAAI,CAAC,EAAa,IAAI,EAAO,EAAE,GAAG;GAE9B,AADA,KAAQ,EAAO,IACf,KAAK;GACL;EACJ;EAEA,IAAM,IAAO,EAAO,MAAM,CAAC,GACvB,IAAU;EACd,KAAK,IAAM,KAAQ,GAAc;GAC7B,IAAI,EAAK,UAAU,EAAO,MAAM,CAAC,EAAQ,EAAK,KAAK,GAAG;GACtD,IAAM,IAAQ,EAAK,QAAQ,KAAK,CAAI;GACpC,IAAI,CAAC,GAAO;IACR,AAAI,EAAK,OAAO,SAAS,WACrB,IAAa,EAAe,IAAI,EAAK,MAAM,OAAO,MAAM;IAE5D;GACJ;GACA,IAAM,IAAO,EAAK,MAAM,CAAK;GACxB,OAIL;IAHA,EAAM,GACN,EAAM,KAAK,CAAI,GACf,KAAK,EAAM,EAAE,CAAC,QACd,IAAU;IACV;GADU;EAEd;EACI,MAEJ,KAAQ,EAAO,IACf,KAAK;CACT;CAGA,OADA,EAAM,GACC;AACX"}
+{"version":3,"file":"markdown-parse.js","names":["FENCE","HEADING_OPEN","RULE","QUOTE","BULLET_OPENER","ORDERED_OPENER","matchListOpener","match","pattern","line","content","matchBullet","matchOrdered","TABLE_DELIMITER","MAX_NESTING_DEPTH","matchHeading","open","text","end","endsWithHardBreak","parseMarkdown","parseBlocks","source","depth","lines","parseInline","blocks","i","fence","marker","body","heading","inner","list","next","parseList","table","parseTable","paragraph","hardBreaks","current","joinParagraph","index","bulletStart","start","orderedStart","ordered","baseIndent","startNumber","items","buffer","flush","bullet","numbered","splitRow","trimmed","cells","cell","head","align","left","right","rows","INLINE_RULES","src","safeImageUrl","href","safeLinkUrl","children","INLINE_FIRST","rule","nodes","bracketAt","deadTailAt","stopAt","stops","closingBracket","from","found","autolinkStop","allowed","guard","close","rest","matched","node"],"sources":["../../../src/components/Markdown/markdown-parse.ts"],"sourcesContent":["/**\n * @tempest-limits file-lines, function-lines — a Markdown block parser is a state\n * machine over line kinds: paragraph, heading, fence, list, quote, table and\n * thematic break each need to see the lines around them to know where they end.\n * parseBlocks is that loop, and cutting it into per-kind functions would hand each\n * one the same lookahead cursor.\n */\n// A small Markdown parser for the subset an app actually renders from untrusted\n// text: comments, ticket bodies, release notes, a product description.\n//\n// It produces a node tree, never an HTML string, and the renderer turns that into\n// React elements. No `dangerouslySetInnerHTML` exists anywhere in this component —\n// which is the property that makes rendering somebody else's Markdown safe, and it\n// is structural rather than a promise about escaping.\n//\n// Raw HTML in the input is therefore not \"sanitized\", it is **text**: `<script>` in\n// a comment renders as the four characters somebody typed. That is the whole point,\n// and it is also the documented limit — this is not a CommonMark implementation and\n// does not try to be.\n\nimport { safeImageUrl, safeLinkUrl } from \"@/utils/safe-url\";\n\n/** Inline content. */\nexport type MarkdownInline =\n    | { type: \"text\"; value: string }\n    | { type: \"strong\"; children: MarkdownInline[] }\n    | { type: \"em\"; children: MarkdownInline[] }\n    | { type: \"del\"; children: MarkdownInline[] }\n    | { type: \"code\"; value: string }\n    | { type: \"link\"; href: string; children: MarkdownInline[] }\n    | { type: \"image\"; src: string; alt: string }\n    | { type: \"break\" };\n\n/** Column alignment of a table, from the delimiter row. */\nexport type MarkdownAlign = \"left\" | \"center\" | \"right\" | null;\n\n/** Block content. */\nexport type MarkdownBlock =\n    | { type: \"heading\"; level: number; children: MarkdownInline[] }\n    | { type: \"paragraph\"; children: MarkdownInline[] }\n    | { type: \"code\"; language: string | null; value: string }\n    | { type: \"quote\"; children: MarkdownBlock[] }\n    | { type: \"list\"; ordered: boolean; start: number; items: MarkdownBlock[][] }\n    | {\n          type: \"table\";\n          align: MarkdownAlign[];\n          head: MarkdownInline[][];\n          rows: MarkdownInline[][][];\n      }\n    | { type: \"rule\" };\n\n/**\n * A fence opener, matched against the line **after** `trimEnd()`.\n *\n * The trailing `\\s*` lives in the `trimEnd()` rather than in the pattern: with it,\n * `\\s*([\\w+-]*)\\s*$` is two whitespace quantifiers separated by one that may be\n * empty, and a fence followed by 20 000 spaces and a stray `!` took 0.36 s (#437).\n */\nconst FENCE = /^\\s{0,3}(`{3,}|~{3,})\\s*([\\w+-]*)$/;\n/**\n * The opening marker of an ATX heading. The text and the optional closing `#` run\n * are cut by {@link matchHeading} with string operations, not by this pattern.\n */\nconst HEADING_OPEN = /^\\s{0,3}(#{1,6})\\s+/;\nconst RULE = /^\\s{0,3}([-*_])\\s*(?:\\1\\s*){2,}$/;\nconst QUOTE = /^\\s{0,3}>\\s?(.*)$/;\n/**\n * The opener of a list item: indentation, marker and the whitespace that\n * separates the marker from the content.\n *\n * The content is sliced off with a string operation rather than captured,\n * because it may not hold U+2028/U+2029. Those are line terminators the old\n * `(.*)$` could not cross, so a line with one after the marker was a paragraph\n * and has to stay one. Capturing the content with a regex that stops at them (a\n * `[^\\u2028\\u2029]*`) would put the separator and the content back to racing for\n * a run of spaces — quadratic, 3.6 s for a bullet padded with 80 000 spaces\n * (#478). Matching only the opener and slicing sidesteps that entirely.\n *\n * The separator is `[^\\S\\n\\r]`: every whitespace character except CR and LF,\n * which a line never contains. That keeps a separator a person pastes from Word\n * or Docs — NBSP, a form feed, a leading BOM — reading as a list, exactly as the\n * old `\\s+` did, instead of silently turning the line into a paragraph.\n */\nconst BULLET_OPENER = /^([^\\S\\n\\r]*)([-*+])[^\\S\\n\\r]+/;\nconst ORDERED_OPENER = /^([^\\S\\n\\r]*)(\\d{1,9})[.)][^\\S\\n\\r]+/;\n\n/** A list item's opener: how far it is indented, its marker and its content. */\ninterface ListOpener {\n    indent: string;\n    marker: string;\n    content: string;\n}\n\n/**\n * Read a list item's opener, or `null` when the line is not one.\n *\n * A line whose content holds U+2028/U+2029 is not a list item: the old `(.*)$`\n * stopped at the separator, never reached `$`, and left the line a paragraph,\n * and {@link parseMarkdown} still splits only on `\\n` and `\\r`. Keeping that\n * here is what lets the opener stay a plain pattern with no `.*` to race.\n *\n * @param pattern - {@link BULLET_OPENER} or {@link ORDERED_OPENER}.\n * @param line - One source line.\n * @returns The opener, or `null` when the line is not a list item.\n */\nfunction matchListOpener(pattern: RegExp, line: string): ListOpener | null {\n    const match = pattern.exec(line);\n    if (!match) return null;\n    const content = line.slice(match[0].length);\n    if (content.includes(\"\\u2028\") || content.includes(\"\\u2029\")) return null;\n    return { indent: match[1], marker: match[2], content };\n}\n\n/** {@link matchListOpener} for a bullet. */\nfunction matchBullet(line: string): ListOpener | null {\n    return matchListOpener(BULLET_OPENER, line);\n}\n\n/** {@link matchListOpener} for an ordered marker. */\nfunction matchOrdered(line: string): ListOpener | null {\n    return matchListOpener(ORDERED_OPENER, line);\n}\n/**\n * A table's delimiter row, matched against the line **after** `trimEnd()`.\n *\n * The `|` is required somewhere in the line, and that is what tells a one-column\n * table (`| --- |`) apart from a thematic break (`---`) — a single column is a\n * legitimate table, and the first version of this regex demanded two. The trailing\n * whitespace is trimmed before the test for the same reason as {@link FENCE}: a\n * `\\s*\\|?\\s*$` tail backtracked quadratically on `- |` plus 50 000 spaces (#437).\n */\nconst TABLE_DELIMITER = /^\\s{0,3}\\|[\\s|:-]*$|^\\s{0,3}:?-+:?(\\s*\\|\\s*:?-+:?)+\\s*\\|?$/;\n\n/**\n * How deep quotes and lists may nest before the rest is read as a paragraph.\n *\n * Each level is one recursive {@link parseBlocks} call and one nested element in\n * the render, so `\"- \".repeat(20000)` used to throw `RangeError: Maximum call stack\n * size exceeded` out of the component (#437). Real documents stop at a handful of\n * levels; past this cap the words are kept, only the nesting is dropped.\n */\nconst MAX_NESTING_DEPTH = 32;\n\n/**\n * Match an ATX heading in linear time.\n *\n * The regex this replaces, `/^\\s{0,3}(#{1,6})\\s+(.*?)\\s*#*\\s*$/`, let a lazy `.*?`\n * and two `\\s*` race for the same run of spaces: `\"# a\" + \" \".repeat(4000) + \"b\"`\n * took about 4.7 s, cubic in the run (#437). Only the opening marker is a regex\n * now. The text is the rest of the line minus the longest suffix shaped like\n * `\\s*#*\\s*` — exactly what the lazy group left behind, so `# título #`,\n * `# título#` and `# #` read as before.\n *\n * @param line - One source line.\n * @returns The level and raw text, or `null` when the line is not a heading.\n */\nfunction matchHeading(line: string): { level: number; text: string } | null {\n    const open = HEADING_OPEN.exec(line);\n    if (!open) return null;\n    let text = line.slice(open[0].length).trimEnd();\n    let end = text.length;\n    while (end > 0 && text[end - 1] === \"#\") end -= 1;\n    text = text.slice(0, end).trimEnd();\n    return { level: open[1].length, text };\n}\n\n/**\n * Whether a paragraph line ends in a hard break: two or more trailing spaces.\n *\n * `/ {2,}$/` was quadratic on a line with a long inner run of spaces — it retried\n * the run from every space and failed at the next word each time (0.57 s for\n * 50 000 spaces, #437).\n */\nfunction endsWithHardBreak(line: string): boolean {\n    return line.endsWith(\"  \");\n}\n\n/**\n * Parse a Markdown document into blocks.\n *\n * @param source - Raw Markdown.\n * @returns Block nodes in document order.\n */\nexport function parseMarkdown(source: string): MarkdownBlock[] {\n    const lines = source.replace(/\\r\\n?/g, \"\\n\").split(\"\\n\");\n    return parseBlocks(lines, 0);\n}\n\n/**\n * Parse a run of lines into blocks.\n *\n * @param lines - The lines of this container.\n * @param depth - How many quotes and lists enclose them. At\n *   {@link MAX_NESTING_DEPTH} the lines become one paragraph instead of more\n *   containers, so a hostile document cannot exhaust the stack.\n * @returns The blocks.\n */\nfunction parseBlocks(lines: string[], depth: number): MarkdownBlock[] {\n    if (depth >= MAX_NESTING_DEPTH) {\n        const source = lines\n            .map((line) => line.trim())\n            .filter(Boolean)\n            .join(\"\\n\");\n        return source ? [{ type: \"paragraph\", children: parseInline(source) }] : [];\n    }\n    const blocks: MarkdownBlock[] = [];\n    let i = 0;\n\n    while (i < lines.length) {\n        const line = lines[i];\n\n        if (line.trim() === \"\") {\n            i += 1;\n            continue;\n        }\n\n        const fence = FENCE.exec(line.trimEnd());\n        if (fence) {\n            const marker = fence[1][0];\n            const body: string[] = [];\n            i += 1;\n            while (i < lines.length && !new RegExp(`^\\\\s{0,3}${marker}{3,}\\\\s*$`).test(lines[i])) {\n                body.push(lines[i]);\n                i += 1;\n            }\n            // An unterminated fence still yields a code block: the alternative is to\n            // render the rest of the document as prose full of backticks.\n            i += 1;\n            blocks.push({ type: \"code\", language: fence[2] || null, value: body.join(\"\\n\") });\n            continue;\n        }\n\n        const heading = matchHeading(line);\n        if (heading) {\n            blocks.push({\n                type: \"heading\",\n                level: heading.level,\n                children: parseInline(heading.text),\n            });\n            i += 1;\n            continue;\n        }\n\n        if (RULE.test(line)) {\n            blocks.push({ type: \"rule\" });\n            i += 1;\n            continue;\n        }\n\n        if (QUOTE.test(line)) {\n            const inner: string[] = [];\n            while (i < lines.length) {\n                const match = QUOTE.exec(lines[i]);\n                if (match) {\n                    inner.push(match[1]);\n                    i += 1;\n                    continue;\n                }\n                // A blank line ends the quote; a plain line continues it (lazy\n                // continuation), which is how people actually write quotes.\n                if (lines[i].trim() === \"\") break;\n                inner.push(lines[i]);\n                i += 1;\n            }\n            blocks.push({ type: \"quote\", children: parseBlocks(inner, depth + 1) });\n            continue;\n        }\n\n        if (matchBullet(line) || matchOrdered(line)) {\n            const [list, next] = parseList(lines, i, depth);\n            blocks.push(list);\n            i = next;\n            continue;\n        }\n\n        if (\n            i + 1 < lines.length &&\n            line.includes(\"|\") &&\n            TABLE_DELIMITER.test(lines[i + 1].trimEnd())\n        ) {\n            const [table, next] = parseTable(lines, i);\n            blocks.push(table);\n            i = next;\n            continue;\n        }\n\n        const paragraph: string[] = [];\n        const hardBreaks: boolean[] = [];\n        while (i < lines.length && lines[i].trim() !== \"\") {\n            const current = lines[i];\n            if (\n                matchHeading(current) ||\n                RULE.test(current) ||\n                FENCE.test(current.trimEnd()) ||\n                QUOTE.test(current) ||\n                matchBullet(current) ||\n                matchOrdered(current)\n            ) {\n                break;\n            }\n            paragraph.push(current.trim());\n            hardBreaks.push(endsWithHardBreak(current));\n            i += 1;\n        }\n        if (paragraph.length > 0) {\n            blocks.push({\n                type: \"paragraph\",\n                children: parseInline(joinParagraph(paragraph, hardBreaks)),\n            });\n        }\n    }\n\n    return blocks;\n}\n\n/**\n * Re-join the lines of a paragraph, keeping the two-space hard break.\n *\n * Every line is trimmed before it is parsed, because leading indentation is not\n * content and a trailing space is invisible noise in almost every line. The one\n * exception is the CommonMark hard break: two or more trailing spaces mean\n * \"break the line here\", so trimming first would delete the only mark that says\n * so and the `  \\n` inline rule could never match. The flag is recorded before\n * the trim and the marker put back here, on every line but the last — a break\n * after the final line of a paragraph would break into nothing.\n *\n * @param lines - The trimmed lines, in order.\n * @param hardBreaks - Whether each line ended in two or more spaces.\n * @returns The paragraph source the inline parser reads.\n */\nfunction joinParagraph(lines: readonly string[], hardBreaks: readonly boolean[]): string {\n    return lines\n        .map((line, index) => (hardBreaks[index] && index < lines.length - 1 ? `${line}  ` : line))\n        .join(\"\\n\");\n}\n\n/**\n * Parse a list, including nested lists and multi-line items.\n *\n * Nesting is decided by indentation relative to the **first** item's marker, so a\n * list indented inside a quote or another list still reads correctly.\n *\n * @param lines - The lines of the enclosing container.\n * @param start - Index of the first item's line.\n * @param depth - Nesting depth of the enclosing container.\n * @returns The list node and the index of the first line after it.\n */\nfunction parseList(lines: string[], start: number, depth: number): [MarkdownBlock, number] {\n    const bulletStart = matchBullet(lines[start]);\n    const orderedStart = matchOrdered(lines[start]);\n    // The two markers are mutually exclusive — `-*+` versus digits — so whichever\n    // matched decides the list kind.\n    const ordered = orderedStart !== null;\n    const first = orderedStart ?? bulletStart;\n    const baseIndent = first?.indent.length ?? 0;\n    const startNumber = ordered ? Number(orderedStart?.marker ?? 1) : 1;\n\n    const items: MarkdownBlock[][] = [];\n    let buffer: string[] = [];\n    let i = start;\n\n    const flush = (): void => {\n        if (buffer.length === 0) return;\n        items.push(parseBlocks(buffer, depth + 1));\n        buffer = [];\n    };\n\n    while (i < lines.length) {\n        const line = lines[i];\n        if (line.trim() === \"\") {\n            // A single blank line inside a list is a loose item, not the end. Two in\n            // a row end it, which is what a blank-then-paragraph document means.\n            if (i + 1 < lines.length && lines[i + 1].trim() !== \"\") {\n                buffer.push(\"\");\n                i += 1;\n                continue;\n            }\n            break;\n        }\n        const bullet = matchBullet(line);\n        const numbered = matchOrdered(line);\n        const match = bullet ?? numbered;\n\n        if (match && match.indent.length <= baseIndent) {\n            const sameKind = ordered ? Boolean(numbered) : Boolean(bullet);\n            if (!sameKind) break;\n            flush();\n            buffer.push(match.content);\n            i += 1;\n            continue;\n        }\n        if (match) {\n            // Deeper marker: keep the indentation so the recursive call sees a list.\n            buffer.push(line.slice(baseIndent));\n            i += 1;\n            continue;\n        }\n        if (line.search(/\\S/) > baseIndent) {\n            buffer.push(line.trim());\n            i += 1;\n            continue;\n        }\n        break;\n    }\n    flush();\n\n    return [{ type: \"list\", ordered, start: startNumber, items }, i];\n}\n\n/** Split a table row on unescaped pipes. */\nfunction splitRow(line: string): string[] {\n    const trimmed = line.trim().replace(/^\\|/, \"\").replace(/\\|$/, \"\");\n    const cells: string[] = [];\n    let current = \"\";\n    for (let i = 0; i < trimmed.length; i += 1) {\n        if (trimmed[i] === \"\\\\\" && trimmed[i + 1] === \"|\") {\n            current += \"|\";\n            i += 1;\n            continue;\n        }\n        if (trimmed[i] === \"|\") {\n            cells.push(current);\n            current = \"\";\n            continue;\n        }\n        current += trimmed[i];\n    }\n    cells.push(current);\n    return cells.map((cell) => cell.trim());\n}\n\n/**\n * Parse a GFM pipe table.\n *\n * @returns The table node and the index of the first line after it.\n */\nfunction parseTable(lines: string[], start: number): [MarkdownBlock, number] {\n    const head = splitRow(lines[start]);\n    const align: MarkdownAlign[] = splitRow(lines[start + 1]).map((cell) => {\n        const left = cell.startsWith(\":\");\n        const right = cell.endsWith(\":\");\n        if (left && right) return \"center\";\n        if (right) return \"right\";\n        if (left) return \"left\";\n        return null;\n    });\n\n    const rows: MarkdownInline[][][] = [];\n    let i = start + 2;\n    while (i < lines.length && lines[i].trim() !== \"\" && lines[i].includes(\"|\")) {\n        rows.push(splitRow(lines[i]).map(parseInline));\n        i += 1;\n    }\n\n    return [{ type: \"table\", align, head: head.map(parseInline), rows }, i];\n}\n\n/**\n * The precheck a rule needs before its pattern may run, keyed by the opener the\n * pattern starts with.\n *\n * `link` covers links and images, whose label ends at the first `]`; `autolink`\n * covers `<scheme:...>`, which ends at the first `>` or whitespace. Without the\n * precheck each pattern scanned to the end of the text from every opener, and\n * `\"[\".repeat(50000)` took 0.6 s (#437).\n */\ntype InlineGuard = { kind: \"link\"; opener: \"[\" | \"![\" } | { kind: \"autolink\"; opener: \"<\" };\n\n/** Inline delimiters, longest marker first so `**` wins over `*`. */\nconst INLINE_RULES: Array<{\n    first: string;\n    pattern: RegExp;\n    guard?: InlineGuard;\n    build: (match: RegExpExecArray) => MarkdownInline | null;\n}> = [\n    {\n        guard: { kind: \"link\", opener: \"![\" },\n        first: \"!\",\n        pattern: /^!\\[([^\\]]*)\\]\\(((?:[^()\\s]|\\([^()\\s]*\\))+)(?:\\s+\"[^\"]*\")?\\)/,\n        build: (match) => {\n            const src = safeImageUrl(match[2]);\n            return src ? { type: \"image\", src, alt: match[1] } : { type: \"text\", value: match[1] };\n        },\n    },\n    {\n        guard: { kind: \"link\", opener: \"[\" },\n        first: \"[\",\n        pattern: /^\\[([^\\]]*)\\]\\(((?:[^()\\s]|\\([^()\\s]*\\))+)(?:\\s+\"[^\"]*\")?\\)/,\n        build: (match) => {\n            const href = safeLinkUrl(match[2]);\n            const children = parseInline(match[1]);\n            // A rejected URL keeps the label as plain text: dropping the text too\n            // would silently delete words somebody wrote.\n            return href ? { type: \"link\", href, children } : { type: \"text\", value: match[1] };\n        },\n    },\n    { first: \"`\", pattern: /^`([^`]+)`/, build: (match) => ({ type: \"code\", value: match[1] }) },\n    {\n        first: \"*\",\n        pattern: /^\\*\\*([\\s\\S]+?)\\*\\*/,\n        build: (match) => ({ type: \"strong\", children: parseInline(match[1]) }),\n    },\n    {\n        first: \"_\",\n        pattern: /^__([\\s\\S]+?)__/,\n        build: (match) => ({ type: \"strong\", children: parseInline(match[1]) }),\n    },\n    {\n        first: \"~\",\n        pattern: /^~~([\\s\\S]+?)~~/,\n        build: (match) => ({ type: \"del\", children: parseInline(match[1]) }),\n    },\n    {\n        first: \"*\",\n        pattern: /^\\*([^*\\n]+)\\*/,\n        build: (match) => ({ type: \"em\", children: parseInline(match[1]) }),\n    },\n    {\n        first: \"_\",\n        pattern: /^_([^_\\n]+)_/,\n        build: (match) => ({ type: \"em\", children: parseInline(match[1]) }),\n    },\n    {\n        guard: { kind: \"autolink\", opener: \"<\" },\n        first: \"<\",\n        pattern: /^<((?:https?:\\/\\/|mailto:)[^>\\s]+)>/,\n        build: (match) => {\n            const href = safeLinkUrl(match[1]);\n            return href\n                ? { type: \"link\", href, children: [{ type: \"text\", value: match[1] }] }\n                : { type: \"text\", value: match[1] };\n        },\n    },\n    { first: \"\\\\\", pattern: /^\\\\\\n/, build: () => ({ type: \"break\" }) },\n];\n\n/** Characters some inline rule can start with; any other character is text. */\nconst INLINE_FIRST = new Set(INLINE_RULES.map((rule) => rule.first));\n\n/**\n * Parse inline Markdown.\n *\n * A backslash escapes the next character, so `\\*not italic\\*` renders with the\n * asterisks. Anything that matches no rule is text — an unclosed `**` is two\n * asterisks, not a bold run to the end of the paragraph.\n *\n * The parse is linear in the text, which matters because the text is somebody\n * else's (#437):\n *\n * - A run of spaces is consumed whole: it is a hard break when two or more of them\n *   end at a newline, and text otherwise. Matching `^ {2,}\\n` from every space\n *   rescanned the run each time.\n * - A link or image label ends at the first `]` after the opener, so every opener\n *   before the same `]` shares the same `](...)` tail. The position of that `]` is\n *   cached, an opener whose `]` is not followed by `(` is skipped without running\n *   the pattern, and once a tail has failed no later opener retries it.\n * - An autolink ends at the first `>` or whitespace, also cached; when that stop\n *   is not `>` the pattern cannot match and is not run.\n * - A rule runs only at its own first character, so a run of `[` costs one set\n *   lookup per character instead of every pattern in the table.\n *\n * @param source - One block's text.\n * @returns Inline nodes.\n */\nexport function parseInline(source: string): MarkdownInline[] {\n    const nodes: MarkdownInline[] = [];\n    let text = \"\";\n    let i = 0;\n\n    let bracketAt = -1;\n    let deadTailAt = -1;\n    let stopAt = -1;\n    const stops = /[>\\s]/g;\n\n    const flush = (): void => {\n        if (text) nodes.push({ type: \"text\", value: text });\n        text = \"\";\n    };\n\n    const closingBracket = (from: number): number => {\n        if (bracketAt < from) {\n            const found = source.indexOf(\"]\", from);\n            bracketAt = found === -1 ? source.length : found;\n        }\n        return bracketAt;\n    };\n\n    const autolinkStop = (from: number): number => {\n        if (stopAt < from) {\n            stops.lastIndex = from;\n            stopAt = stops.exec(source)?.index ?? source.length;\n        }\n        return stopAt;\n    };\n\n    const allowed = (guard: InlineGuard | undefined): boolean => {\n        if (!guard) return true;\n        if (!source.startsWith(guard.opener, i)) return false;\n        if (guard.kind === \"autolink\") return source[autolinkStop(i + 1)] === \">\";\n        const close = closingBracket(i + guard.opener.length);\n        return source[close + 1] === \"(\" && close !== deadTailAt;\n    };\n\n    while (i < source.length) {\n        if (source[i] === \"\\\\\" && i + 1 < source.length && source[i + 1] !== \"\\n\") {\n            text += source[i + 1];\n            i += 2;\n            continue;\n        }\n\n        if (source[i] === \" \") {\n            let end = i;\n            while (source[end] === \" \") end += 1;\n            if (end - i >= 2 && source[end] === \"\\n\") {\n                flush();\n                nodes.push({ type: \"break\" });\n                i = end + 1;\n            } else {\n                text += source.slice(i, end);\n                i = end;\n            }\n            continue;\n        }\n\n        if (!INLINE_FIRST.has(source[i])) {\n            text += source[i];\n            i += 1;\n            continue;\n        }\n\n        const rest = source.slice(i);\n        let matched = false;\n        for (const rule of INLINE_RULES) {\n            if (rule.first !== source[i] || !allowed(rule.guard)) continue;\n            const match = rule.pattern.exec(rest);\n            if (!match) {\n                if (rule.guard?.kind === \"link\") {\n                    deadTailAt = closingBracket(i + rule.guard.opener.length);\n                }\n                continue;\n            }\n            const node = rule.build(match);\n            if (!node) continue;\n            flush();\n            nodes.push(node);\n            i += match[0].length;\n            matched = true;\n            break;\n        }\n        if (matched) continue;\n\n        text += source[i];\n        i += 1;\n    }\n\n    flush();\n    return nodes;\n}\n"],"mappings":";;AA0DA,IAAMA,IAAQ,sCAKRC,IAAe,uBACfC,IAAO,oCACPC,IAAQ,qBAkBRC,IAAgB,kCAChBC,IAAiB;AAqBvB,SAASC,EAAgB,GAAiB,GAAiC;CACvE,IAAMC,IAAQC,EAAQ,KAAKC,CAAI;CAC/B,IAAI,CAACF,GAAO,OAAO;CACnB,IAAMG,IAAUD,EAAK,MAAMF,EAAM,EAAE,CAAC,MAAM;CAE1C,OADIG,EAAQ,SAAS,QAAQ,KAAKA,EAAQ,SAAS,QAAQ,IAAU,OAC9D;EAAE,QAAQH,EAAM;EAAI,QAAQA,EAAM;EAAI;CAAQ;AACzD;AAGA,SAASI,EAAY,GAAiC;CAClD,OAAOL,EAAgBF,GAAeK,CAAI;AAC9C;AAGA,SAASG,EAAa,GAAiC;CACnD,OAAON,EAAgBD,GAAgBI,CAAI;AAC/C;AAUA,IAAMI,IAAkB,8DAUlBC,IAAoB;AAe1B,SAASC,EAAa,GAAsD;CACxE,IAAMC,IAAOf,EAAa,KAAKQ,CAAI;CACnC,IAAI,CAACO,GAAM,OAAO;CAClB,IAAIC,IAAOR,EAAK,MAAMO,EAAK,EAAE,CAAC,MAAM,CAAC,CAAC,QAAQ,GAC1CE,IAAMD,EAAK;CACf,OAAOC,IAAM,KAAKD,EAAKC,IAAM,OAAO,MAAK;CAEzC,OADA,IAAOD,EAAK,MAAM,GAAGC,CAAG,CAAC,CAAC,QAAQ,GAC3B;EAAE,OAAOF,EAAK,EAAE,CAAC;EAAQ;CAAK;AACzC;AASA,SAASG,EAAkB,GAAuB;CAC9C,OAAOV,EAAK,SAAS,IAAI;AAC7B;AAQA,SAAgBW,EAAc,GAAiC;CAE3D,OAAOC,EADOC,EAAO,QAAQ,UAAU,IAAI,CAAC,CAAC,MAAM,IAChC,GAAO,CAAC;AAC/B;AAWA,SAASD,EAAY,GAAiB,GAAgC;CAClE,IAAIE,KAAST,GAAmB;EAC5B,IAAMQ,IAASE,EACV,KAAK,MAASf,EAAK,KAAK,CAAC,CAAC,CAC1B,OAAO,OAAO,CAAC,CACf,KAAK,IAAI;EACd,OAAOa,IAAS,CAAC;GAAE,MAAM;GAAa,UAAUG,EAAYH,CAAM;EAAE,CAAC,IAAI,CAAC;CAC9E;CACA,IAAMI,IAA0B,CAAC,GAC7BC,IAAI;CAER,OAAOA,IAAIH,EAAM,SAAQ;EACrB,IAAMf,IAAOe,EAAMG;EAEnB,IAAIlB,EAAK,KAAK,MAAM,IAAI;GACpB,KAAK;GACL;EACJ;EAEA,IAAMmB,IAAQ5B,EAAM,KAAKS,EAAK,QAAQ,CAAC;EACvC,IAAImB,GAAO;GACP,IAAMC,IAASD,EAAM,EAAE,CAAC,IAClBE,IAAiB,CAAC;GAExB,KADA,KAAK,GACEH,IAAIH,EAAM,UAAU,CAAK,OAAO,YAAYK,EAAO,UAAU,CAAC,CAAC,KAAKL,EAAMG,EAAE,IAE/E,AADAG,EAAK,KAAKN,EAAMG,EAAE,GAClB,KAAK;GAKT,AADA,KAAK,GACLD,EAAO,KAAK;IAAE,MAAM;IAAQ,UAAUE,EAAM,MAAM;IAAM,OAAOE,EAAK,KAAK,IAAI;GAAE,CAAC;GAChF;EACJ;EAEA,IAAMC,IAAUhB,EAAaN,CAAI;EACjC,IAAIsB,GAAS;GAMT,AALAL,EAAO,KAAK;IACR,MAAM;IACN,OAAOK,EAAQ;IACf,UAAUN,EAAYM,EAAQ,IAAI;GACtC,CAAC,GACD,KAAK;GACL;EACJ;EAEA,IAAI7B,EAAK,KAAKO,CAAI,GAAG;GAEjB,AADAiB,EAAO,KAAK,EAAE,MAAM,OAAO,CAAC,GAC5B,KAAK;GACL;EACJ;EAEA,IAAIvB,EAAM,KAAKM,CAAI,GAAG;GAClB,IAAMuB,IAAkB,CAAC;GACzB,OAAOL,IAAIH,EAAM,SAAQ;IACrB,IAAMjB,IAAQJ,EAAM,KAAKqB,EAAMG,EAAE;IACjC,IAAIpB,GAEA,AADAyB,EAAM,KAAKzB,EAAM,EAAE,GACnB,KAAK;SAKT;SAAIiB,EAAMG,EAAE,CAAC,KAAK,MAAM,IAAI;KAE5B,AADAK,EAAM,KAAKR,EAAMG,EAAE,GACnB,KAAK;IAFuB;GAGhC;GACA,EAAO,KAAK;IAAE,MAAM;IAAS,UAAUN,EAAYW,GAAOT,IAAQ,CAAC;GAAE,CAAC;GACtE;EACJ;EAEA,IAAIZ,EAAYF,CAAI,KAAKG,EAAaH,CAAI,GAAG;GACzC,IAAM,CAACwB,GAAMC,KAAQC,EAAUX,GAAOG,GAAGJ,CAAK;GAE9C,AADAG,EAAO,KAAKO,CAAI,GAChB,IAAIC;GACJ;EACJ;EAEA,IACIP,IAAI,IAAIH,EAAM,UACdf,EAAK,SAAS,GAAG,KACjBI,EAAgB,KAAKW,EAAMG,IAAI,EAAE,CAAC,QAAQ,CAAC,GAC7C;GACE,IAAM,CAACS,GAAOF,KAAQG,EAAWb,GAAOG,CAAC;GAEzC,AADAD,EAAO,KAAKU,CAAK,GACjB,IAAIF;GACJ;EACJ;EAEA,IAAMI,IAAsB,CAAC,GACvBC,IAAwB,CAAC;EAC/B,OAAOZ,IAAIH,EAAM,UAAUA,EAAMG,EAAE,CAAC,KAAK,MAAM,KAAI;GAC/C,IAAMa,IAAUhB,EAAMG;GACtB,IACIZ,EAAayB,CAAO,KACpBtC,EAAK,KAAKsC,CAAO,KACjBxC,EAAM,KAAKwC,EAAQ,QAAQ,CAAC,KAC5BrC,EAAM,KAAKqC,CAAO,KAClB7B,EAAY6B,CAAO,KACnB5B,EAAa4B,CAAO,GAEpB;GAIJ,AAFAF,EAAU,KAAKE,EAAQ,KAAK,CAAC,GAC7BD,EAAW,KAAKpB,EAAkBqB,CAAO,CAAC,GAC1C,KAAK;EACT;EACA,AAAIF,EAAU,SAAS,KACnBZ,EAAO,KAAK;GACR,MAAM;GACN,UAAUD,EAAYgB,EAAcH,GAAWC,CAAU,CAAC;EAC9D,CAAC;CAET;CAEA,OAAOb;AACX;AAiBA,SAASe,EAAc,GAA0B,GAAwC;CACrF,OAAOjB,EACF,KAAK,GAAM,MAAWe,EAAWG,MAAUA,IAAQlB,EAAM,SAAS,IAAI,GAAGf,EAAK,MAAMA,CAAK,CAAC,CAC1F,KAAK,IAAI;AAClB;AAaA,SAAS0B,EAAU,GAAiB,GAAe,GAAwC;CACvF,IAAMQ,IAAchC,EAAYa,EAAMoB,EAAM,GACtCC,IAAejC,EAAaY,EAAMoB,EAAM,GAGxCE,IAAUD,MAAiB,MAE3BE,KADQF,KAAgBF,EAAA,EACJ,OAAO,UAAU,GACrCK,IAAcF,IAAU,OAAOD,GAAc,UAAU,CAAC,IAAI,GAE5DI,IAA2B,CAAC,GAC9BC,IAAmB,CAAC,GACpBvB,IAAIiB,GAEFO,UAAoB;EACtB,AAAID,EAAO,WAAW,MACtBD,EAAM,KAAK5B,EAAY6B,GAAQ3B,IAAQ,CAAC,CAAC,GACzC,IAAS,CAAC;CACd;CAEA,OAAOI,IAAIH,EAAM,SAAQ;EACrB,IAAMf,IAAOe,EAAMG;EACnB,IAAIlB,EAAK,KAAK,MAAM,IAAI;GAGpB,IAAIkB,IAAI,IAAIH,EAAM,UAAUA,EAAMG,IAAI,EAAE,CAAC,KAAK,MAAM,IAAI;IAEpD,AADAuB,EAAO,KAAK,EAAE,GACd,KAAK;IACL;GACJ;GACA;EACJ;EACA,IAAME,IAASzC,EAAYF,CAAI,GACzB4C,IAAWzC,EAAaH,CAAI,GAC5BF,IAAQ6C,KAAUC;EAExB,IAAI9C,KAASA,EAAM,OAAO,UAAUwC,GAAY;GAE5C,IAAI,EADaD,IAAkBO,IAAoBD,IACxC;GAGf,AAFAD,EAAM,GACND,EAAO,KAAK3C,EAAM,OAAO,GACzB,KAAK;EAET,OACA,IAAIA,GAGA,AADA2C,EAAO,KAAKzC,EAAK,MAAMsC,CAAU,CAAC,GAClC,KAAK;OAGT,IAAItC,EAAK,OAAO,IAAI,IAAIsC,GAEpB,AADAG,EAAO,KAAKzC,EAAK,KAAK,CAAC,GACvB,KAAK;OAGT;CACJ;CAGA,OAFA0C,EAAM,GAEC,CAAC;EAAE,MAAM;EAAQ;EAAS,OAAOH;EAAa;CAAM,GAAGrB,CAAC;AACnE;AAGA,SAAS2B,EAAS,GAAwB;CACtC,IAAMC,IAAU9C,EAAK,KAAK,CAAC,CAAC,QAAQ,OAAO,EAAE,CAAC,CAAC,QAAQ,OAAO,EAAE,GAC1D+C,IAAkB,CAAC,GACrBhB,IAAU;CACd,KAAK,IAAIb,IAAI,GAAGA,IAAI4B,EAAQ,QAAQ,KAAK,GACrC,AAAIA,EAAQ5B,OAAO,QAAQ4B,EAAQ5B,IAAI,OAAO,OAC1C,KAAW,KACX,KAAK,KAGL4B,EAAQ5B,OAAO,OACf6B,EAAM,KAAKhB,CAAO,GAClB,IAAU,MAGd,KAAWe,EAAQ5B;CAGvB,OADA6B,EAAM,KAAKhB,CAAO,GACXgB,EAAM,KAAK,MAASC,EAAK,KAAK,CAAC;AAC1C;AAOA,SAASpB,EAAW,GAAiB,GAAwC;CACzE,IAAMqB,IAAOJ,EAAS9B,EAAMoB,EAAM,GAC5Be,IAAyBL,EAAS9B,EAAMoB,IAAQ,EAAE,CAAC,CAAC,KAAK,MAAS;EACpE,IAAMgB,IAAOH,EAAK,WAAW,GAAG,GAC1BI,IAAQJ,EAAK,SAAS,GAAG;EAI/B,OAHIG,KAAQC,IAAc,WACtBA,IAAc,UACdD,IAAa,SACV;CACX,CAAC,GAEKE,IAA6B,CAAC,GAChCnC,IAAIiB,IAAQ;CAChB,OAAOjB,IAAIH,EAAM,UAAUA,EAAMG,EAAE,CAAC,KAAK,MAAM,MAAMH,EAAMG,EAAE,CAAC,SAAS,GAAG,IAEtE,AADAmC,EAAK,KAAKR,EAAS9B,EAAMG,EAAE,CAAC,CAAC,IAAIF,CAAW,CAAC,GAC7C,KAAK;CAGT,OAAO,CAAC;EAAE,MAAM;EAAS;EAAO,MAAMiC,EAAK,IAAIjC,CAAW;EAAG;CAAK,GAAGE,CAAC;AAC1E;AAcA,IAAMoC,IAKD;CACD;EACI,OAAO;GAAE,MAAM;GAAQ,QAAQ;EAAK;EACpC,OAAO;EACP,SAAS;EACT,QAAQ,MAAU;GACd,IAAMC,IAAMC,EAAa1D,EAAM,EAAE;GACjC,OAAOyD,IAAM;IAAE,MAAM;IAAS;IAAK,KAAKzD,EAAM;GAAG,IAAI;IAAE,MAAM;IAAQ,OAAOA,EAAM;GAAG;EACzF;CACJ;CACA;EACI,OAAO;GAAE,MAAM;GAAQ,QAAQ;EAAI;EACnC,OAAO;EACP,SAAS;EACT,QAAQ,MAAU;GACd,IAAM2D,IAAOC,EAAY5D,EAAM,EAAE,GAC3B6D,IAAW3C,EAAYlB,EAAM,EAAE;GAGrC,OAAO2D,IAAO;IAAE,MAAM;IAAQ;IAAM;GAAS,IAAI;IAAE,MAAM;IAAQ,OAAO3D,EAAM;GAAG;EACrF;CACJ;CACA;EAAE,OAAO;EAAK,SAAS;EAAc,QAAQ,OAAW;GAAE,MAAM;GAAQ,OAAOA,EAAM;EAAG;CAAG;CAC3F;EACI,OAAO;EACP,SAAS;EACT,QAAQ,OAAW;GAAE,MAAM;GAAU,UAAUkB,EAAYlB,EAAM,EAAE;EAAE;CACzE;CACA;EACI,OAAO;EACP,SAAS;EACT,QAAQ,OAAW;GAAE,MAAM;GAAU,UAAUkB,EAAYlB,EAAM,EAAE;EAAE;CACzE;CACA;EACI,OAAO;EACP,SAAS;EACT,QAAQ,OAAW;GAAE,MAAM;GAAO,UAAUkB,EAAYlB,EAAM,EAAE;EAAE;CACtE;CACA;EACI,OAAO;EACP,SAAS;EACT,QAAQ,OAAW;GAAE,MAAM;GAAM,UAAUkB,EAAYlB,EAAM,EAAE;EAAE;CACrE;CACA;EACI,OAAO;EACP,SAAS;EACT,QAAQ,OAAW;GAAE,MAAM;GAAM,UAAUkB,EAAYlB,EAAM,EAAE;EAAE;CACrE;CACA;EACI,OAAO;GAAE,MAAM;GAAY,QAAQ;EAAI;EACvC,OAAO;EACP,SAAS;EACT,QAAQ,MAAU;GACd,IAAM2D,IAAOC,EAAY5D,EAAM,EAAE;GACjC,OAAO2D,IACD;IAAE,MAAM;IAAQ;IAAM,UAAU,CAAC;KAAE,MAAM;KAAQ,OAAO3D,EAAM;IAAG,CAAC;GAAE,IACpE;IAAE,MAAM;IAAQ,OAAOA,EAAM;GAAG;EAC1C;CACJ;CACA;EAAE,OAAO;EAAM,SAAS;EAAS,cAAc,EAAE,MAAM,QAAQ;CAAG;AACtE,GAGM8D,IAAe,IAAI,IAAIN,EAAa,KAAK,MAASO,EAAK,KAAK,CAAC;AA2BnE,SAAgB7C,EAAY,GAAkC;CAC1D,IAAM8C,IAA0B,CAAC,GAC7BtD,IAAO,IACPU,IAAI,GAEJ6C,IAAY,IACZC,IAAa,IACbC,IAAS,IACPC,IAAQ,UAERxB,UAAoB;EAEtB,AADIlC,KAAMsD,EAAM,KAAK;GAAE,MAAM;GAAQ,OAAOtD;EAAK,CAAC,GAClD,IAAO;CACX,GAEM2D,KAAkB,MAAyB;EAC7C,IAAIJ,IAAYK,GAAM;GAClB,IAAMC,IAAQxD,EAAO,QAAQ,KAAKuD,CAAI;GACtC,IAAYC,MAAU,KAAKxD,EAAO,SAASwD;EAC/C;EACA,OAAON;CACX,GAEMO,KAAgB,OACdL,IAASG,MACT,EAAM,YAAYA,GAClB,IAASF,EAAM,KAAKrD,CAAM,CAAC,EAAE,SAASA,EAAO,SAE1CoD,IAGLM,KAAW,MAA4C;EACzD,IAAI,CAACC,GAAO,OAAO;EACnB,IAAI,CAAC3D,EAAO,WAAW2D,EAAM,QAAQtD,CAAC,GAAG,OAAO;EAChD,IAAIsD,EAAM,SAAS,YAAY,OAAO3D,EAAOyD,EAAapD,IAAI,CAAC,OAAO;EACtE,IAAMuD,IAAQN,EAAejD,IAAIsD,EAAM,OAAO,MAAM;EACpD,OAAO3D,EAAO4D,IAAQ,OAAO,OAAOA,MAAUT;CAClD;CAEA,OAAO9C,IAAIL,EAAO,SAAQ;EACtB,IAAIA,EAAOK,OAAO,QAAQA,IAAI,IAAIL,EAAO,UAAUA,EAAOK,IAAI,OAAO,MAAM;GAEvE,AADA,KAAQL,EAAOK,IAAI,IACnB,KAAK;GACL;EACJ;EAEA,IAAIL,EAAOK,OAAO,KAAK;GACnB,IAAIT,IAAMS;GACV,OAAOL,EAAOJ,OAAS,MAAK,KAAO;GACnC,AAAIA,IAAMS,KAAK,KAAKL,EAAOJ,OAAS,QAChCiC,EAAM,GACNoB,EAAM,KAAK,EAAE,MAAM,QAAQ,CAAC,GAC5B,IAAIrD,IAAM,MAEV,KAAQI,EAAO,MAAMK,GAAGT,CAAG,GAC3B,IAAIA;GAER;EACJ;EAEA,IAAI,CAACmD,EAAa,IAAI/C,EAAOK,EAAE,GAAG;GAE9B,AADA,KAAQL,EAAOK,IACf,KAAK;GACL;EACJ;EAEA,IAAMwD,IAAO7D,EAAO,MAAMK,CAAC,GACvByD,IAAU;EACd,KAAK,IAAMd,KAAQP,GAAc;GAC7B,IAAIO,EAAK,UAAUhD,EAAOK,MAAM,CAACqD,EAAQV,EAAK,KAAK,GAAG;GACtD,IAAM/D,IAAQ+D,EAAK,QAAQ,KAAKa,CAAI;GACpC,IAAI,CAAC5E,GAAO;IACR,AAAI+D,EAAK,OAAO,SAAS,WACrB,IAAaM,EAAejD,IAAI2C,EAAK,MAAM,OAAO,MAAM;IAE5D;GACJ;GACA,IAAMe,IAAOf,EAAK,MAAM/D,CAAK;GAC7B,IAAK8E,GACL;IAGA,AAHAlC,EAAM,GACNoB,EAAM,KAAKc,CAAI,GACf,KAAK9E,EAAM,EAAE,CAAC,QACd,IAAU;IACV;GAJM;EAKV;EACA,AAAI6E,MAEJ,KAAQ9D,EAAOK,IACf,KAAK;CACT;CAGA,OADAwB,EAAM,GACCoB;AACX"}

package/dist/components/Masonry/Masonry.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"Masonry.cjs","names":[],"sources":["../../../src/components/Masonry/Masonry.tsx"],"sourcesContent":["import {\n    useCallback,\n    useEffect,\n    useLayoutEffect,\n    useMemo,\n    useRef,\n    useState,\n    type HTMLAttributes,\n    type ReactNode,\n} from \"react\";\n\nimport { cn } from \"@/utils/cn\";\n\nimport { columnsFor, distribute } from \"./masonry-layout\";\nimport styles from \"./Masonry.module.css\";\n\n/** DOM attributes this component redefines. */\ntype OverriddenDomProps = \"children\";\n\nexport interface MasonryProps<T> extends Omit<HTMLAttributes<HTMLDivElement>, OverriddenDomProps> {\n    /** What to lay out. */\n    items: readonly T[];\n    /** Render one card. */\n    children: (item: T, index: number) => ReactNode;\n    /** Stable key per item. Index is a fallback nobody should rely on. */\n    itemKey?: (item: T, index: number) => string | number;\n    /**\n     * Column count: a fixed number, or a `width → columns` map read as\n     * \"from this width up\". Default `{ 0: 1, 640: 2, 1024: 3 }`.\n     */\n    columns?: number | Record<number, number>;\n    /** Gap between cards, any CSS length. Default `var(--tempest-space-4)`. */\n    gap?: string;\n}\n\n/** Default breakpoints: one column on a phone, three on a desktop. */\nconst DEFAULT_COLUMNS: Record<number, number> = { 0: 1, 640: 2, 1024: 3 };\n\n/**\n * Masonry layout: cards of uneven height packed into columns with an even bottom\n * edge.\n *\n * Measures the rendered cards and deals each one into the shortest column, rather\n * than using CSS `columns` or `grid-auto-flow: dense`. Both of those are one line\n * of CSS and neither does this job: CSS `columns` breaks a card across the column\n * boundary, and a dense grid keeps every row the height of its tallest cell, which\n * is the ragged bottom edge people reach for masonry to avoid.\n *\n * @example\n * <Masonry items={fotos} itemKey={(foto) => foto.id} columns={{ 0: 1, 700: 2, 1100: 4 }}>\n *     {(foto) => <img src={foto.url} alt={foto.alt} />}\n * </Masonry>\n */\nexport function Masonry<T>({\n    items,\n    children,\n    itemKey,\n    columns = DEFAULT_COLUMNS,\n    gap,\n    className,\n    style,\n    ...rest\n}: MasonryProps<T>) {\n    const wrapper = useRef<HTMLDivElement | null>(null);\n    const cells = useRef<Map<number, HTMLElement>>(new Map());\n    const [width, setWidth] = useState(0);\n    const [heights, setHeights] = useState<number[]>([]);\n\n    const columnCount = columnsFor(width, columns);\n\n    /**\n     * Track the container width, not the viewport.\n     *\n     * A masonry inside a drawer or a two-column page is narrower than the window,\n     * and a media query would give it desktop columns at 300px wide. `ResizeObserver`\n     * is what makes the breakpoint map mean \"this container\", which is the only\n     * useful reading.\n     */\n    useEffect(() => {\n        const node = wrapper.current;\n        if (!node || typeof ResizeObserver === \"undefined\") return;\n        const observer = new ResizeObserver(([entry]) => {\n            setWidth(entry.contentRect.width);\n        });\n        observer.observe(node);\n        setWidth(node.getBoundingClientRect().width);\n        return () => observer.disconnect();\n    }, []);\n\n    /**\n     * Re-read every card's height, and store it only when something moved.\n     *\n     * The equality check is what stops the loop: writing a new array on every pass\n     * would re-render, re-measure and write again. The first render lays out in\n     * source order with weight 1 each — never blank — and this pass re-deals with\n     * real numbers.\n     */\n    const measure = useCallback(() => {\n        const next = items.map((_, index) => {\n            const node = cells.current.get(index);\n            return node ? node.getBoundingClientRect().height : 1;\n        });\n        setHeights((current) =>\n            current.length === next.length && current.every((value, i) => value === next[i])\n                ? current\n                : next,\n        );\n    }, [items]);\n\n    useLayoutEffect(measure, [measure, columnCount, width]);\n\n    /**\n     * Re-measure when a card changes size on its own — an image finishing its\n     * download is the common one, and it is exactly the case a height measured at\n     * mount gets wrong.\n     */\n    useEffect(() => {\n        if (typeof ResizeObserver === \"undefined\") return;\n        const observer = new ResizeObserver(measure);\n        for (const node of cells.current.values()) observer.observe(node);\n        return () => observer.disconnect();\n    }, [measure, columnCount]);\n\n    const layout = useMemo(\n        () =>\n            distribute(\n                items.map((_, index) => heights[index] ?? 1),\n                columnCount,\n            ),\n        [items, heights, columnCount],\n    );\n\n    return (\n        <div\n            ref={wrapper}\n            className={cn(styles.wrapper, className)}\n            style={{ ...style, ...(gap ? { \"--tempest-masonry-gap\": gap } : {}) }}\n            {...rest}\n        >\n            {layout.map((columnItems, column) => (\n                <div key={column} className={styles.column}>\n                    {columnItems.map((index) => {\n                        const item = items[index];\n                        return (\n                            <div\n                                key={itemKey ? itemKey(item, index) : index}\n                                className={styles.item}\n                                ref={(node) => {\n                                    if (node) cells.current.set(index, node);\n                                    else cells.current.delete(index);\n                                }}\n                            >\n                                {children(item, index)}\n                            </div>\n                        );\n                    })}\n                </div>\n            ))}\n        </div>\n    );\n}\n"],"mappings":"gKAoCA,IAAM,EAA0C,CAAE,EAAG,EAAG,IAAK,EAAG,KAAM,CAAE,EAiBxE,SAAgB,EAAW,CACvB,QACA,WACA,UACA,UAAU,EACV,MACA,YACA,QACA,GAAG,GACa,CAChB,IAAM,GAAA,EAAU,EAAA,OAAA,CAA8B,IAAI,EAC5C,GAAA,EAAQ,EAAA,OAAA,CAAiC,IAAI,GAAK,EAClD,CAAC,EAAO,IAAA,EAAY,EAAA,SAAA,CAAS,CAAC,EAC9B,CAAC,EAAS,IAAA,EAAc,EAAA,SAAA,CAAmB,CAAC,CAAC,EAE7C,EAAc,EAAA,WAAW,EAAO,CAAO,GAU7C,EAAA,EAAA,UAAA,KAAgB,CACZ,IAAM,EAAO,EAAQ,QACrB,GAAI,CAAC,GAAQ,OAAO,eAAmB,IAAa,OACpD,IAAM,EAAW,IAAI,gBAAgB,CAAC,KAAW,CAC7C,EAAS,EAAM,YAAY,KAAK,CACpC,CAAC,EAGD,OAFA,EAAS,QAAQ,CAAI,EACrB,EAAS,EAAK,sBAAsB,CAAC,CAAC,KAAK,MAC9B,EAAS,WAAW,CACrC,EAAG,CAAC,CAAC,EAUL,IAAM,GAAA,EAAU,EAAA,YAAA,KAAkB,CAC9B,IAAM,EAAO,EAAM,KAAK,EAAG,IAAU,CACjC,IAAM,EAAO,EAAM,QAAQ,IAAI,CAAK,EACpC,OAAO,EAAO,EAAK,sBAAsB,CAAC,CAAC,OAAS,CACxD,CAAC,EACD,EAAY,GACR,EAAQ,SAAW,EAAK,QAAU,EAAQ,OAAO,EAAO,IAAM,IAAU,EAAK,EAAE,EACzE,EACA,CACV,CACJ,EAAG,CAAC,CAAK,CAAC,GAEV,EAAA,EAAA,gBAAA,CAAgB,EAAS,CAAC,EAAS,EAAa,CAAK,CAAC,GAOtD,EAAA,EAAA,UAAA,KAAgB,CACZ,GAAI,OAAO,eAAmB,IAAa,OAC3C,IAAM,EAAW,IAAI,eAAe,CAAO,EAC3C,IAAK,IAAM,KAAQ,EAAM,QAAQ,OAAO,EAAG,EAAS,QAAQ,CAAI,EAChE,UAAa,EAAS,WAAW,CACrC,EAAG,CAAC,EAAS,CAAW,CAAC,EAEzB,IAAM,GAAA,EAAS,EAAA,QAAA,KAEP,EAAA,WACI,EAAM,KAAK,EAAG,IAAU,EAAQ,IAAU,CAAC,EAC3C,CACJ,EACJ,CAAC,EAAO,EAAS,CAAW,CAChC,EAEA,OACI,EAAA,EAAA,IAAA,CAAC,MAAD,CACI,IAAK,EACL,UAAW,EAAA,GAAG,EAAA,QAAO,QAAS,CAAS,EACvC,MAAO,CAAE,GAAG,EAAO,GAAI,EAAM,CAAE,wBAAyB,CAAI,EAAI,CAAC,CAAG,EACpE,GAAI,EAEH,SAAA,EAAO,KAAK,EAAa,KACtB,EAAA,EAAA,IAAA,CAAC,MAAD,CAAkB,UAAW,EAAA,QAAO,OAC/B,SAAA,EAAY,IAAK,GAAU,CACxB,IAAM,EAAO,EAAM,GACnB,OACI,EAAA,EAAA,IAAA,CAAC,MAAD,CAEI,UAAW,EAAA,QAAO,KAClB,IAAM,GAAS,CACP,EAAM,EAAM,QAAQ,IAAI,EAAO,CAAI,EAClC,EAAM,QAAQ,OAAO,CAAK,CACnC,EAEC,SAAA,EAAS,EAAM,CAAK,CACpB,EARI,EAAU,EAAQ,EAAM,CAAK,EAAI,CAQrC,CAEb,CAAC,CACA,EAhBK,CAgBL,CACR,CACA,CAAA,CAEb"}
+{"version":3,"file":"Masonry.cjs","names":["useRef","useState","columnsFor","useCallback","useMemo","distribute","cn","styles","require_cn","require_masonry_layout","require_Masonry_module","react","react_jsx_runtime","DEFAULT_COLUMNS","Masonry","rest","wrapper","cells","width","setWidth","heights","setHeights","columnCount","columns","node","observer","entry","measure","next","items","index","current","value","i","layout","className","style","gap","columnItems","item","children","itemKey","column"],"sources":["../../../src/components/Masonry/Masonry.tsx"],"sourcesContent":["import {\n    useCallback,\n    useEffect,\n    useLayoutEffect,\n    useMemo,\n    useRef,\n    useState,\n    type HTMLAttributes,\n    type ReactNode,\n} from \"react\";\n\nimport { cn } from \"@/utils/cn\";\n\nimport { columnsFor, distribute } from \"./masonry-layout\";\nimport styles from \"./Masonry.module.css\";\n\n/** DOM attributes this component redefines. */\ntype OverriddenDomProps = \"children\";\n\nexport interface MasonryProps<T> extends Omit<HTMLAttributes<HTMLDivElement>, OverriddenDomProps> {\n    /** What to lay out. */\n    items: readonly T[];\n    /** Render one card. */\n    children: (item: T, index: number) => ReactNode;\n    /** Stable key per item. Index is a fallback nobody should rely on. */\n    itemKey?: (item: T, index: number) => string | number;\n    /**\n     * Column count: a fixed number, or a `width → columns` map read as\n     * \"from this width up\". Default `{ 0: 1, 640: 2, 1024: 3 }`.\n     */\n    columns?: number | Record<number, number>;\n    /** Gap between cards, any CSS length. Default `var(--tempest-space-4)`. */\n    gap?: string;\n}\n\n/** Default breakpoints: one column on a phone, three on a desktop. */\nconst DEFAULT_COLUMNS: Record<number, number> = { 0: 1, 640: 2, 1024: 3 };\n\n/**\n * Masonry layout: cards of uneven height packed into columns with an even bottom\n * edge.\n *\n * Measures the rendered cards and deals each one into the shortest column, rather\n * than using CSS `columns` or `grid-auto-flow: dense`. Both of those are one line\n * of CSS and neither does this job: CSS `columns` breaks a card across the column\n * boundary, and a dense grid keeps every row the height of its tallest cell, which\n * is the ragged bottom edge people reach for masonry to avoid.\n *\n * @example\n * <Masonry items={fotos} itemKey={(foto) => foto.id} columns={{ 0: 1, 700: 2, 1100: 4 }}>\n *     {(foto) => <img src={foto.url} alt={foto.alt} />}\n * </Masonry>\n */\nexport function Masonry<T>({\n    items,\n    children,\n    itemKey,\n    columns = DEFAULT_COLUMNS,\n    gap,\n    className,\n    style,\n    ...rest\n}: MasonryProps<T>) {\n    const wrapper = useRef<HTMLDivElement | null>(null);\n    const cells = useRef<Map<number, HTMLElement>>(new Map());\n    const [width, setWidth] = useState(0);\n    const [heights, setHeights] = useState<number[]>([]);\n\n    const columnCount = columnsFor(width, columns);\n\n    /**\n     * Track the container width, not the viewport.\n     *\n     * A masonry inside a drawer or a two-column page is narrower than the window,\n     * and a media query would give it desktop columns at 300px wide. `ResizeObserver`\n     * is what makes the breakpoint map mean \"this container\", which is the only\n     * useful reading.\n     */\n    useEffect(() => {\n        const node = wrapper.current;\n        if (!node || typeof ResizeObserver === \"undefined\") return;\n        const observer = new ResizeObserver(([entry]) => {\n            setWidth(entry.contentRect.width);\n        });\n        observer.observe(node);\n        setWidth(node.getBoundingClientRect().width);\n        return () => observer.disconnect();\n    }, []);\n\n    /**\n     * Re-read every card's height, and store it only when something moved.\n     *\n     * The equality check is what stops the loop: writing a new array on every pass\n     * would re-render, re-measure and write again. The first render lays out in\n     * source order with weight 1 each — never blank — and this pass re-deals with\n     * real numbers.\n     */\n    const measure = useCallback(() => {\n        const next = items.map((_, index) => {\n            const node = cells.current.get(index);\n            return node ? node.getBoundingClientRect().height : 1;\n        });\n        setHeights((current) =>\n            current.length === next.length && current.every((value, i) => value === next[i])\n                ? current\n                : next,\n        );\n    }, [items]);\n\n    useLayoutEffect(measure, [measure, columnCount, width]);\n\n    /**\n     * Re-measure when a card changes size on its own — an image finishing its\n     * download is the common one, and it is exactly the case a height measured at\n     * mount gets wrong.\n     */\n    useEffect(() => {\n        if (typeof ResizeObserver === \"undefined\") return;\n        const observer = new ResizeObserver(measure);\n        for (const node of cells.current.values()) observer.observe(node);\n        return () => observer.disconnect();\n    }, [measure, columnCount]);\n\n    const layout = useMemo(\n        () =>\n            distribute(\n                items.map((_, index) => heights[index] ?? 1),\n                columnCount,\n            ),\n        [items, heights, columnCount],\n    );\n\n    return (\n        <div\n            ref={wrapper}\n            className={cn(styles.wrapper, className)}\n            style={{ ...style, ...(gap ? { \"--tempest-masonry-gap\": gap } : {}) }}\n            {...rest}\n        >\n            {layout.map((columnItems, column) => (\n                <div key={column} className={styles.column}>\n                    {columnItems.map((index) => {\n                        const item = items[index];\n                        return (\n                            <div\n                                key={itemKey ? itemKey(item, index) : index}\n                                className={styles.item}\n                                ref={(node) => {\n                                    if (node) cells.current.set(index, node);\n                                    else cells.current.delete(index);\n                                }}\n                            >\n                                {children(item, index)}\n                            </div>\n                        );\n                    })}\n                </div>\n            ))}\n        </div>\n    );\n}\n"],"mappings":"A,gKAoCA,IAAMa,EAA0C,CAAE,EAAG,EAAG,IAAK,EAAG,KAAM,CAAE,EAiBxE,SAAgBC,EAAW,CACvB,QACA,WACA,UACA,UAAUD,EACV,MACA,YACA,QACA,GAAGE,GACa,CAChB,IAAMC,GAAA,EAAUhB,EAAAA,OAAAA,CAA8B,IAAI,EAC5CiB,GAAA,EAAQjB,EAAAA,OAAAA,CAAiC,IAAI,GAAK,EAClD,CAACkB,EAAOC,IAAA,EAAYlB,EAAAA,SAAAA,CAAS,CAAC,EAC9B,CAACmB,EAASC,IAAA,EAAcpB,EAAAA,SAAAA,CAAmB,CAAC,CAAC,EAE7CqB,EAAcpB,EAAAA,WAAWgB,EAAOK,CAAO,GAU7C,EAAAZ,EAAA,UAAA,KAAgB,CACZ,IAAMa,EAAOR,EAAQ,QACrB,GAAI,CAACQ,GAAQ,OAAO,eAAmB,IAAa,OACpD,IAAMC,EAAW,IAAI,gBAAgB,CAACC,KAAW,CAC7CP,EAASO,EAAM,YAAY,KAAK,CACpC,CAAC,EAGD,OAFAD,EAAS,QAAQD,CAAI,EACrBL,EAASK,EAAK,sBAAsB,CAAC,CAAC,KAAK,MAC9BC,EAAS,WAAW,CACrC,EAAG,CAAC,CAAC,EAUL,IAAME,GAAA,EAAUxB,EAAAA,YAAAA,KAAkB,CAC9B,IAAMyB,EAAOC,EAAM,KAAK,EAAG,IAAU,CACjC,IAAML,EAAOP,EAAM,QAAQ,IAAIa,CAAK,EACpC,OAAON,EAAOA,EAAK,sBAAsB,CAAC,CAAC,OAAS,CACxD,CAAC,EACDH,EAAY,GACRU,EAAQ,SAAWH,EAAK,QAAUG,EAAQ,OAAO,EAAO,IAAMC,IAAUJ,EAAKK,EAAE,EACzEF,EACAH,CACV,CACJ,EAAG,CAACC,CAAK,CAAC,GAEV,EAAAlB,EAAA,gBAAA,CAAgBgB,EAAS,CAACA,EAASL,EAAaJ,CAAK,CAAC,GAOtD,EAAAP,EAAA,UAAA,KAAgB,CACZ,GAAI,OAAO,eAAmB,IAAa,OAC3C,IAAMc,EAAW,IAAI,eAAeE,CAAO,EAC3C,IAAK,IAAMH,KAAQP,EAAM,QAAQ,OAAO,EAAGQ,EAAS,QAAQD,CAAI,EAChE,UAAaC,EAAS,WAAW,CACrC,EAAG,CAACE,EAASL,CAAW,CAAC,EAEzB,IAAMY,GAAA,EAAS9B,EAAAA,QAAAA,KAEPC,EAAAA,WACIwB,EAAM,KAAK,EAAG,IAAUT,EAAQU,IAAU,CAAC,EAC3CR,CACJ,EACJ,CAACO,EAAOT,EAASE,CAAW,CAChC,EAEA,OACI,EAAAV,EAAA,IAAA,CAAC,MAAD,CACI,IAAKI,EACL,UAAWV,EAAAA,GAAGC,EAAAA,QAAO,QAAS4B,CAAS,EACvC,MAAO,CAAE,GAAGC,EAAO,GAAIC,EAAM,CAAE,wBAAyBA,CAAI,EAAI,CAAC,CAAG,EACpE,GAAItB,EAEH,SAAAmB,EAAO,KAAK,EAAa,KACtB,EAAAtB,EAAA,IAAA,CAAC,MAAD,CAAkB,UAAWL,EAAAA,QAAO,OAC/B,SAAA+B,EAAY,IAAK,GAAU,CACxB,IAAMC,EAAOV,EAAMC,GACnB,OACI,EAAAlB,EAAA,IAAA,CAAC,MAAD,CAEI,UAAWL,EAAAA,QAAO,KAClB,IAAM,GAAS,CACPiB,EAAMP,EAAM,QAAQ,IAAIa,EAAON,CAAI,EAClCP,EAAM,QAAQ,OAAOa,CAAK,CACnC,EAEC,SAAAU,EAASD,EAAMT,CAAK,CACpB,EARIW,EAAUA,EAAQF,EAAMT,CAAK,EAAIA,CAQrC,CAEb,CAAC,CACA,EAhBKY,CAgBL,CACR,CACA,CAAA,CAEb,C"}

package/dist/components/Masonry/Masonry.js.map

@@ -1 +1 @@
-{"version":3,"file":"Masonry.js","names":[],"sources":["../../../src/components/Masonry/Masonry.tsx"],"sourcesContent":["import {\n    useCallback,\n    useEffect,\n    useLayoutEffect,\n    useMemo,\n    useRef,\n    useState,\n    type HTMLAttributes,\n    type ReactNode,\n} from \"react\";\n\nimport { cn } from \"@/utils/cn\";\n\nimport { columnsFor, distribute } from \"./masonry-layout\";\nimport styles from \"./Masonry.module.css\";\n\n/** DOM attributes this component redefines. */\ntype OverriddenDomProps = \"children\";\n\nexport interface MasonryProps<T> extends Omit<HTMLAttributes<HTMLDivElement>, OverriddenDomProps> {\n    /** What to lay out. */\n    items: readonly T[];\n    /** Render one card. */\n    children: (item: T, index: number) => ReactNode;\n    /** Stable key per item. Index is a fallback nobody should rely on. */\n    itemKey?: (item: T, index: number) => string | number;\n    /**\n     * Column count: a fixed number, or a `width → columns` map read as\n     * \"from this width up\". Default `{ 0: 1, 640: 2, 1024: 3 }`.\n     */\n    columns?: number | Record<number, number>;\n    /** Gap between cards, any CSS length. Default `var(--tempest-space-4)`. */\n    gap?: string;\n}\n\n/** Default breakpoints: one column on a phone, three on a desktop. */\nconst DEFAULT_COLUMNS: Record<number, number> = { 0: 1, 640: 2, 1024: 3 };\n\n/**\n * Masonry layout: cards of uneven height packed into columns with an even bottom\n * edge.\n *\n * Measures the rendered cards and deals each one into the shortest column, rather\n * than using CSS `columns` or `grid-auto-flow: dense`. Both of those are one line\n * of CSS and neither does this job: CSS `columns` breaks a card across the column\n * boundary, and a dense grid keeps every row the height of its tallest cell, which\n * is the ragged bottom edge people reach for masonry to avoid.\n *\n * @example\n * <Masonry items={fotos} itemKey={(foto) => foto.id} columns={{ 0: 1, 700: 2, 1100: 4 }}>\n *     {(foto) => <img src={foto.url} alt={foto.alt} />}\n * </Masonry>\n */\nexport function Masonry<T>({\n    items,\n    children,\n    itemKey,\n    columns = DEFAULT_COLUMNS,\n    gap,\n    className,\n    style,\n    ...rest\n}: MasonryProps<T>) {\n    const wrapper = useRef<HTMLDivElement | null>(null);\n    const cells = useRef<Map<number, HTMLElement>>(new Map());\n    const [width, setWidth] = useState(0);\n    const [heights, setHeights] = useState<number[]>([]);\n\n    const columnCount = columnsFor(width, columns);\n\n    /**\n     * Track the container width, not the viewport.\n     *\n     * A masonry inside a drawer or a two-column page is narrower than the window,\n     * and a media query would give it desktop columns at 300px wide. `ResizeObserver`\n     * is what makes the breakpoint map mean \"this container\", which is the only\n     * useful reading.\n     */\n    useEffect(() => {\n        const node = wrapper.current;\n        if (!node || typeof ResizeObserver === \"undefined\") return;\n        const observer = new ResizeObserver(([entry]) => {\n            setWidth(entry.contentRect.width);\n        });\n        observer.observe(node);\n        setWidth(node.getBoundingClientRect().width);\n        return () => observer.disconnect();\n    }, []);\n\n    /**\n     * Re-read every card's height, and store it only when something moved.\n     *\n     * The equality check is what stops the loop: writing a new array on every pass\n     * would re-render, re-measure and write again. The first render lays out in\n     * source order with weight 1 each — never blank — and this pass re-deals with\n     * real numbers.\n     */\n    const measure = useCallback(() => {\n        const next = items.map((_, index) => {\n            const node = cells.current.get(index);\n            return node ? node.getBoundingClientRect().height : 1;\n        });\n        setHeights((current) =>\n            current.length === next.length && current.every((value, i) => value === next[i])\n                ? current\n                : next,\n        );\n    }, [items]);\n\n    useLayoutEffect(measure, [measure, columnCount, width]);\n\n    /**\n     * Re-measure when a card changes size on its own — an image finishing its\n     * download is the common one, and it is exactly the case a height measured at\n     * mount gets wrong.\n     */\n    useEffect(() => {\n        if (typeof ResizeObserver === \"undefined\") return;\n        const observer = new ResizeObserver(measure);\n        for (const node of cells.current.values()) observer.observe(node);\n        return () => observer.disconnect();\n    }, [measure, columnCount]);\n\n    const layout = useMemo(\n        () =>\n            distribute(\n                items.map((_, index) => heights[index] ?? 1),\n                columnCount,\n            ),\n        [items, heights, columnCount],\n    );\n\n    return (\n        <div\n            ref={wrapper}\n            className={cn(styles.wrapper, className)}\n            style={{ ...style, ...(gap ? { \"--tempest-masonry-gap\": gap } : {}) }}\n            {...rest}\n        >\n            {layout.map((columnItems, column) => (\n                <div key={column} className={styles.column}>\n                    {columnItems.map((index) => {\n                        const item = items[index];\n                        return (\n                            <div\n                                key={itemKey ? itemKey(item, index) : index}\n                                className={styles.item}\n                                ref={(node) => {\n                                    if (node) cells.current.set(index, node);\n                                    else cells.current.delete(index);\n                                }}\n                            >\n                                {children(item, index)}\n                            </div>\n                        );\n                    })}\n                </div>\n            ))}\n        </div>\n    );\n}\n"],"mappings":";;;;;;AAoCA,IAAM,IAA0C;CAAE,GAAG;CAAG,KAAK;CAAG,MAAM;AAAE;AAiBxE,SAAgB,EAAW,EACvB,UACA,aACA,YACA,aAAU,GACV,QACA,cACA,UACA,GAAG,KACa;CAChB,IAAM,IAAU,EAA8B,IAAI,GAC5C,IAAQ,kBAAiC,IAAI,IAAI,CAAC,GAClD,CAAC,GAAO,KAAY,EAAS,CAAC,GAC9B,CAAC,GAAS,KAAc,EAAmB,CAAC,CAAC,GAE7C,IAAc,EAAW,GAAO,CAAO;CAU7C,QAAgB;EACZ,IAAM,IAAO,EAAQ;EACrB,IAAI,CAAC,KAAQ,OAAO,iBAAmB,KAAa;EACpD,IAAM,IAAW,IAAI,gBAAgB,CAAC,OAAW;GAC7C,EAAS,EAAM,YAAY,KAAK;EACpC,CAAC;EAGD,OAFA,EAAS,QAAQ,CAAI,GACrB,EAAS,EAAK,sBAAsB,CAAC,CAAC,KAAK,SAC9B,EAAS,WAAW;CACrC,GAAG,CAAC,CAAC;CAUL,IAAM,IAAU,QAAkB;EAC9B,IAAM,IAAO,EAAM,KAAK,GAAG,MAAU;GACjC,IAAM,IAAO,EAAM,QAAQ,IAAI,CAAK;GACpC,OAAO,IAAO,EAAK,sBAAsB,CAAC,CAAC,SAAS;EACxD,CAAC;EACD,GAAY,MACR,EAAQ,WAAW,EAAK,UAAU,EAAQ,OAAO,GAAO,MAAM,MAAU,EAAK,EAAE,IACzE,IACA,CACV;CACJ,GAAG,CAAC,CAAK,CAAC;CASV,AAPA,EAAgB,GAAS;EAAC;EAAS;EAAa;CAAK,CAAC,GAOtD,QAAgB;EACZ,IAAI,OAAO,iBAAmB,KAAa;EAC3C,IAAM,IAAW,IAAI,eAAe,CAAO;EAC3C,KAAK,IAAM,KAAQ,EAAM,QAAQ,OAAO,GAAG,EAAS,QAAQ,CAAI;EAChE,aAAa,EAAS,WAAW;CACrC,GAAG,CAAC,GAAS,CAAW,CAAC;CAEzB,IAAM,IAAS,QAEP,EACI,EAAM,KAAK,GAAG,MAAU,EAAQ,MAAU,CAAC,GAC3C,CACJ,GACJ;EAAC;EAAO;EAAS;CAAW,CAChC;CAEA,OACI,kBAAC,OAAD;EACI,KAAK;EACL,WAAW,EAAG,EAAO,SAAS,CAAS;EACvC,OAAO;GAAE,GAAG;GAAO,GAAI,IAAM,EAAE,yBAAyB,EAAI,IAAI,CAAC;EAAG;EACpE,GAAI;EAEH,UAAA,EAAO,KAAK,GAAa,MACtB,kBAAC,OAAD;GAAkB,WAAW,EAAO;GAC/B,UAAA,EAAY,KAAK,MAAU;IACxB,IAAM,IAAO,EAAM;IACnB,OACI,kBAAC,OAAD;KAEI,WAAW,EAAO;KAClB,MAAM,MAAS;MACX,AAAI,IAAM,EAAM,QAAQ,IAAI,GAAO,CAAI,IAClC,EAAM,QAAQ,OAAO,CAAK;KACnC;KAEC,UAAA,EAAS,GAAM,CAAK;IACpB,GARI,IAAU,EAAQ,GAAM,CAAK,IAAI,CAQrC;GAEb,CAAC;EACA,GAhBK,CAgBL,CACR;CACA,CAAA;AAEb"}
+{"version":3,"file":"Masonry.js","names":["styles","Masonry_module_default","DEFAULT_COLUMNS","Masonry","rest","wrapper","useRef","cells","width","setWidth","useState","heights","setHeights","columnCount","columnsFor","columns","node","observer","entry","measure","useCallback","next","items","index","current","value","i","useLayoutEffect","useEffect","layout","useMemo","distribute","cn","className","style","gap","columnItems","item","children","itemKey","column"],"sources":["../../../src/components/Masonry/Masonry.tsx"],"sourcesContent":["import {\n    useCallback,\n    useEffect,\n    useLayoutEffect,\n    useMemo,\n    useRef,\n    useState,\n    type HTMLAttributes,\n    type ReactNode,\n} from \"react\";\n\nimport { cn } from \"@/utils/cn\";\n\nimport { columnsFor, distribute } from \"./masonry-layout\";\nimport styles from \"./Masonry.module.css\";\n\n/** DOM attributes this component redefines. */\ntype OverriddenDomProps = \"children\";\n\nexport interface MasonryProps<T> extends Omit<HTMLAttributes<HTMLDivElement>, OverriddenDomProps> {\n    /** What to lay out. */\n    items: readonly T[];\n    /** Render one card. */\n    children: (item: T, index: number) => ReactNode;\n    /** Stable key per item. Index is a fallback nobody should rely on. */\n    itemKey?: (item: T, index: number) => string | number;\n    /**\n     * Column count: a fixed number, or a `width → columns` map read as\n     * \"from this width up\". Default `{ 0: 1, 640: 2, 1024: 3 }`.\n     */\n    columns?: number | Record<number, number>;\n    /** Gap between cards, any CSS length. Default `var(--tempest-space-4)`. */\n    gap?: string;\n}\n\n/** Default breakpoints: one column on a phone, three on a desktop. */\nconst DEFAULT_COLUMNS: Record<number, number> = { 0: 1, 640: 2, 1024: 3 };\n\n/**\n * Masonry layout: cards of uneven height packed into columns with an even bottom\n * edge.\n *\n * Measures the rendered cards and deals each one into the shortest column, rather\n * than using CSS `columns` or `grid-auto-flow: dense`. Both of those are one line\n * of CSS and neither does this job: CSS `columns` breaks a card across the column\n * boundary, and a dense grid keeps every row the height of its tallest cell, which\n * is the ragged bottom edge people reach for masonry to avoid.\n *\n * @example\n * <Masonry items={fotos} itemKey={(foto) => foto.id} columns={{ 0: 1, 700: 2, 1100: 4 }}>\n *     {(foto) => <img src={foto.url} alt={foto.alt} />}\n * </Masonry>\n */\nexport function Masonry<T>({\n    items,\n    children,\n    itemKey,\n    columns = DEFAULT_COLUMNS,\n    gap,\n    className,\n    style,\n    ...rest\n}: MasonryProps<T>) {\n    const wrapper = useRef<HTMLDivElement | null>(null);\n    const cells = useRef<Map<number, HTMLElement>>(new Map());\n    const [width, setWidth] = useState(0);\n    const [heights, setHeights] = useState<number[]>([]);\n\n    const columnCount = columnsFor(width, columns);\n\n    /**\n     * Track the container width, not the viewport.\n     *\n     * A masonry inside a drawer or a two-column page is narrower than the window,\n     * and a media query would give it desktop columns at 300px wide. `ResizeObserver`\n     * is what makes the breakpoint map mean \"this container\", which is the only\n     * useful reading.\n     */\n    useEffect(() => {\n        const node = wrapper.current;\n        if (!node || typeof ResizeObserver === \"undefined\") return;\n        const observer = new ResizeObserver(([entry]) => {\n            setWidth(entry.contentRect.width);\n        });\n        observer.observe(node);\n        setWidth(node.getBoundingClientRect().width);\n        return () => observer.disconnect();\n    }, []);\n\n    /**\n     * Re-read every card's height, and store it only when something moved.\n     *\n     * The equality check is what stops the loop: writing a new array on every pass\n     * would re-render, re-measure and write again. The first render lays out in\n     * source order with weight 1 each — never blank — and this pass re-deals with\n     * real numbers.\n     */\n    const measure = useCallback(() => {\n        const next = items.map((_, index) => {\n            const node = cells.current.get(index);\n            return node ? node.getBoundingClientRect().height : 1;\n        });\n        setHeights((current) =>\n            current.length === next.length && current.every((value, i) => value === next[i])\n                ? current\n                : next,\n        );\n    }, [items]);\n\n    useLayoutEffect(measure, [measure, columnCount, width]);\n\n    /**\n     * Re-measure when a card changes size on its own — an image finishing its\n     * download is the common one, and it is exactly the case a height measured at\n     * mount gets wrong.\n     */\n    useEffect(() => {\n        if (typeof ResizeObserver === \"undefined\") return;\n        const observer = new ResizeObserver(measure);\n        for (const node of cells.current.values()) observer.observe(node);\n        return () => observer.disconnect();\n    }, [measure, columnCount]);\n\n    const layout = useMemo(\n        () =>\n            distribute(\n                items.map((_, index) => heights[index] ?? 1),\n                columnCount,\n            ),\n        [items, heights, columnCount],\n    );\n\n    return (\n        <div\n            ref={wrapper}\n            className={cn(styles.wrapper, className)}\n            style={{ ...style, ...(gap ? { \"--tempest-masonry-gap\": gap } : {}) }}\n            {...rest}\n        >\n            {layout.map((columnItems, column) => (\n                <div key={column} className={styles.column}>\n                    {columnItems.map((index) => {\n                        const item = items[index];\n                        return (\n                            <div\n                                key={itemKey ? itemKey(item, index) : index}\n                                className={styles.item}\n                                ref={(node) => {\n                                    if (node) cells.current.set(index, node);\n                                    else cells.current.delete(index);\n                                }}\n                            >\n                                {children(item, index)}\n                            </div>\n                        );\n                    })}\n                </div>\n            ))}\n        </div>\n    );\n}\n"],"mappings":";;;;;;AAoCA,IAAME,IAA0C;CAAE,GAAG;CAAG,KAAK;CAAG,MAAM;AAAE;AAiBxE,SAAgBC,EAAW,EACvB,UACA,aACA,YACA,aAAUD,GACV,QACA,cACA,UACA,GAAGE,KACa;CAChB,IAAMC,IAAUC,EAA8B,IAAI,GAC5CC,IAAQD,kBAAiC,IAAI,IAAI,CAAC,GAClD,CAACE,GAAOC,KAAYC,EAAS,CAAC,GAC9B,CAACC,GAASC,KAAcF,EAAmB,CAAC,CAAC,GAE7CG,IAAcC,EAAWN,GAAOO,CAAO;CAU7C,QAAgB;EACZ,IAAMC,IAAOX,EAAQ;EACrB,IAAI,CAACW,KAAQ,OAAO,iBAAmB,KAAa;EACpD,IAAMC,IAAW,IAAI,gBAAgB,CAACC,OAAW;GAC7C,EAASA,EAAM,YAAY,KAAK;EACpC,CAAC;EAGD,OAFAD,EAAS,QAAQD,CAAI,GACrBP,EAASO,EAAK,sBAAsB,CAAC,CAAC,KAAK,SAC9BC,EAAS,WAAW;CACrC,GAAG,CAAC,CAAC;CAUL,IAAME,IAAUC,QAAkB;EAC9B,IAAMC,IAAOC,EAAM,KAAK,GAAG,MAAU;GACjC,IAAMN,IAAOT,EAAM,QAAQ,IAAIgB,CAAK;GACpC,OAAOP,IAAOA,EAAK,sBAAsB,CAAC,CAAC,SAAS;EACxD,CAAC;EACD,GAAY,MACRQ,EAAQ,WAAWH,EAAK,UAAUG,EAAQ,OAAO,GAAO,MAAMC,MAAUJ,EAAKK,EAAE,IACzEF,IACAH,CACV;CACJ,GAAG,CAACC,CAAK,CAAC;CASV,AAPAK,EAAgBR,GAAS;EAACA;EAASN;EAAaL;CAAK,CAAC,GAOtDoB,QAAgB;EACZ,IAAI,OAAO,iBAAmB,KAAa;EAC3C,IAAMX,IAAW,IAAI,eAAeE,CAAO;EAC3C,KAAK,IAAMH,KAAQT,EAAM,QAAQ,OAAO,GAAG,EAAS,QAAQS,CAAI;EAChE,aAAaC,EAAS,WAAW;CACrC,GAAG,CAACE,GAASN,CAAW,CAAC;CAEzB,IAAMgB,IAASC,QAEPC,EACIT,EAAM,KAAK,GAAG,MAAUX,EAAQY,MAAU,CAAC,GAC3CV,CACJ,GACJ;EAACS;EAAOX;EAASE;CAAW,CAChC;CAEA,OACI,kBAAC,OAAD;EACI,KAAKR;EACL,WAAW2B,EAAGhC,EAAO,SAASiC,CAAS;EACvC,OAAO;GAAE,GAAGC;GAAO,GAAIC,IAAM,EAAE,yBAAyBA,EAAI,IAAI,CAAC;EAAG;EACpE,GAAI/B;EAEH,UAAAyB,EAAO,KAAK,GAAa,MACtB,kBAAC,OAAD;GAAkB,WAAW7B,EAAO;GAC/B,UAAAoC,EAAY,KAAK,MAAU;IACxB,IAAMC,IAAOf,EAAMC;IACnB,OACI,kBAAC,OAAD;KAEI,WAAWvB,EAAO;KAClB,MAAM,MAAS;MACX,AAAIgB,IAAMT,EAAM,QAAQ,IAAIgB,GAAOP,CAAI,IAClCT,EAAM,QAAQ,OAAOgB,CAAK;KACnC;KAEC,UAAAe,EAASD,GAAMd,CAAK;IACpB,GARIgB,IAAUA,EAAQF,GAAMd,CAAK,IAAIA,CAQrC;GAEb,CAAC;EACA,GAhBKiB,CAgBL,CACR;CACA,CAAA;AAEb"}

package/dist/components/Masonry/Masonry.module.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"Masonry.module.cjs","names":[],"sources":["../../../src/components/Masonry/Masonry.module.css"],"sourcesContent":[".wrapper {\n    display: flex;\n    align-items: flex-start;\n    gap: var(--tempest-masonry-gap, var(--tempest-space-4));\n    width: 100%;\n}\n\n.column {\n    display: flex;\n    flex: 1 1 0;\n    flex-direction: column;\n    gap: var(--tempest-masonry-gap, var(--tempest-space-4));\n    min-width: 0;\n}\n\n.item {\n    min-width: 0;\n}\n"],"mappings":";"}
+{"version":3,"file":"Masonry.module.cjs","names":["wrapper","column","item","Masonry_module_default"],"sources":["../../../src/components/Masonry/Masonry.module.css"],"sourcesContent":[".wrapper {\n    display: flex;\n    align-items: flex-start;\n    gap: var(--tempest-masonry-gap, var(--tempest-space-4));\n    width: 100%;\n}\n\n.column {\n    display: flex;\n    flex: 1 1 0;\n    flex-direction: column;\n    gap: var(--tempest-masonry-gap, var(--tempest-space-4));\n    min-width: 0;\n}\n\n.item {\n    min-width: 0;\n}\n"],"mappings":";"}

package/dist/components/Masonry/Masonry.module.js.map

@@ -1 +1 @@
-{"version":3,"file":"Masonry.module.js","names":[],"sources":["../../../src/components/Masonry/Masonry.module.css"],"sourcesContent":[".wrapper {\n    display: flex;\n    align-items: flex-start;\n    gap: var(--tempest-masonry-gap, var(--tempest-space-4));\n    width: 100%;\n}\n\n.column {\n    display: flex;\n    flex: 1 1 0;\n    flex-direction: column;\n    gap: var(--tempest-masonry-gap, var(--tempest-space-4));\n    min-width: 0;\n}\n\n.item {\n    min-width: 0;\n}\n"],"mappings":";"}
+{"version":3,"file":"Masonry.module.js","names":["wrapper","column","item","Masonry_module_default"],"sources":["../../../src/components/Masonry/Masonry.module.css"],"sourcesContent":[".wrapper {\n    display: flex;\n    align-items: flex-start;\n    gap: var(--tempest-masonry-gap, var(--tempest-space-4));\n    width: 100%;\n}\n\n.column {\n    display: flex;\n    flex: 1 1 0;\n    flex-direction: column;\n    gap: var(--tempest-masonry-gap, var(--tempest-space-4));\n    min-width: 0;\n}\n\n.item {\n    min-width: 0;\n}\n"],"mappings":";"}

package/dist/components/Masonry/masonry-layout.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"masonry-layout.cjs","names":[],"sources":["../../../src/components/Masonry/masonry-layout.ts"],"sourcesContent":["/**\n * Column count for a width, from a breakpoint map.\n *\n * The map is read as \"from this width up\", so `{ 0: 1, 640: 2, 1024: 3 }` means one\n * column on a phone and three on a desktop. Keys are sorted here rather than\n * trusted in insertion order — an object literal written out of order would\n * otherwise pick the wrong column count, silently.\n *\n * @param width - Container width in pixels.\n * @param columns - Breakpoint → column count, or a fixed number.\n * @returns At least 1, always.\n */\nexport function columnsFor(width: number, columns: number | Record<number, number>): number {\n    if (typeof columns === \"number\") return Math.max(1, Math.floor(columns));\n    const steps = Object.keys(columns)\n        .map(Number)\n        .filter((key) => Number.isFinite(key))\n        .sort((a, b) => a - b);\n    let count = 1;\n    for (const step of steps) {\n        if (width >= step) count = columns[step];\n    }\n    return Math.max(1, Math.floor(count));\n}\n\n/**\n * Deal items into columns, shortest column first.\n *\n * Round-robin (`index % columns`) is the obvious approach and produces ragged\n * columns the moment items differ in height — which is the only reason to reach\n * for a masonry layout at all. Feeding the shortest column keeps the bottom edge\n * as even as the content allows.\n *\n * Reading order is the cost, and it is why this is a layout for **independent**\n * cards: down a column rather than across the row. A list where item 2 must follow\n * item 1 wants a grid, not this.\n *\n * @param heights - Estimated or measured height per item, in the items' order.\n * @param columnCount - How many columns to fill.\n * @returns Item indexes per column.\n */\nexport function distribute(heights: readonly number[], columnCount: number): number[][] {\n    const count = Math.max(1, Math.floor(columnCount));\n    const columns: number[][] = Array.from({ length: count }, () => []);\n    const totals = new Array<number>(count).fill(0);\n\n    for (let index = 0; index < heights.length; index += 1) {\n        let shortest = 0;\n        for (let column = 1; column < count; column += 1) {\n            if (totals[column] < totals[shortest]) shortest = column;\n        }\n        columns[shortest].push(index);\n        totals[shortest] += Math.max(1, heights[index] ?? 1);\n    }\n\n    return columns;\n}\n"],"mappings":"AAYA,SAAgB,EAAW,EAAe,EAAkD,CACxF,GAAI,OAAO,GAAY,SAAU,OAAO,KAAK,IAAI,EAAG,KAAK,MAAM,CAAO,CAAC,EACvE,IAAM,EAAQ,OAAO,KAAK,CAAO,CAAC,CAC7B,IAAI,MAAM,CAAC,CACX,OAAQ,GAAQ,OAAO,SAAS,CAAG,CAAC,CAAC,CACrC,MAAM,EAAG,IAAM,EAAI,CAAC,EACrB,EAAQ,EACZ,IAAK,IAAM,KAAQ,EACX,GAAS,IAAM,EAAQ,EAAQ,IAEvC,OAAO,KAAK,IAAI,EAAG,KAAK,MAAM,CAAK,CAAC,CACxC,CAkBA,SAAgB,EAAW,EAA4B,EAAiC,CACpF,IAAM,EAAQ,KAAK,IAAI,EAAG,KAAK,MAAM,CAAW,CAAC,EAC3C,EAAsB,MAAM,KAAK,CAAE,OAAQ,CAAM,MAAS,CAAC,CAAC,EAC5D,EAAa,MAAc,CAAK,CAAC,CAAC,KAAK,CAAC,EAE9C,IAAK,IAAI,EAAQ,EAAG,EAAQ,EAAQ,OAAQ,GAAS,EAAG,CACpD,IAAI,EAAW,EACf,IAAK,IAAI,EAAS,EAAG,EAAS,EAAO,GAAU,EACvC,EAAO,GAAU,EAAO,KAAW,EAAW,GAEtD,EAAQ,EAAS,CAAC,KAAK,CAAK,EAC5B,EAAO,IAAa,KAAK,IAAI,EAAG,EAAQ,IAAU,CAAC,CACvD,CAEA,OAAO,CACX"}
+{"version":3,"file":"masonry-layout.cjs","names":["columnsFor","columns","steps","key","a","b","count","step","width","distribute","columnCount","totals","index","heights","shortest","column"],"sources":["../../../src/components/Masonry/masonry-layout.ts"],"sourcesContent":["/**\n * Column count for a width, from a breakpoint map.\n *\n * The map is read as \"from this width up\", so `{ 0: 1, 640: 2, 1024: 3 }` means one\n * column on a phone and three on a desktop. Keys are sorted here rather than\n * trusted in insertion order — an object literal written out of order would\n * otherwise pick the wrong column count, silently.\n *\n * @param width - Container width in pixels.\n * @param columns - Breakpoint → column count, or a fixed number.\n * @returns At least 1, always.\n */\nexport function columnsFor(width: number, columns: number | Record<number, number>): number {\n    if (typeof columns === \"number\") return Math.max(1, Math.floor(columns));\n    const steps = Object.keys(columns)\n        .map(Number)\n        .filter((key) => Number.isFinite(key))\n        .sort((a, b) => a - b);\n    let count = 1;\n    for (const step of steps) {\n        if (width >= step) count = columns[step];\n    }\n    return Math.max(1, Math.floor(count));\n}\n\n/**\n * Deal items into columns, shortest column first.\n *\n * Round-robin (`index % columns`) is the obvious approach and produces ragged\n * columns the moment items differ in height — which is the only reason to reach\n * for a masonry layout at all. Feeding the shortest column keeps the bottom edge\n * as even as the content allows.\n *\n * Reading order is the cost, and it is why this is a layout for **independent**\n * cards: down a column rather than across the row. A list where item 2 must follow\n * item 1 wants a grid, not this.\n *\n * @param heights - Estimated or measured height per item, in the items' order.\n * @param columnCount - How many columns to fill.\n * @returns Item indexes per column.\n */\nexport function distribute(heights: readonly number[], columnCount: number): number[][] {\n    const count = Math.max(1, Math.floor(columnCount));\n    const columns: number[][] = Array.from({ length: count }, () => []);\n    const totals = new Array<number>(count).fill(0);\n\n    for (let index = 0; index < heights.length; index += 1) {\n        let shortest = 0;\n        for (let column = 1; column < count; column += 1) {\n            if (totals[column] < totals[shortest]) shortest = column;\n        }\n        columns[shortest].push(index);\n        totals[shortest] += Math.max(1, heights[index] ?? 1);\n    }\n\n    return columns;\n}\n"],"mappings":"AAYA,SAAgBA,EAAW,EAAe,EAAkD,CACxF,GAAI,OAAOC,GAAY,SAAU,OAAO,KAAK,IAAI,EAAG,KAAK,MAAMA,CAAO,CAAC,EACvE,IAAMC,EAAQ,OAAO,KAAKD,CAAO,CAAC,CAC7B,IAAI,MAAM,CAAC,CACX,OAAQ,GAAQ,OAAO,SAASE,CAAG,CAAC,CAAC,CACrC,MAAM,EAAG,IAAMC,EAAIC,CAAC,EACrBC,EAAQ,EACZ,IAAK,IAAMC,KAAQL,EACXM,GAASD,IAAM,EAAQN,EAAQM,IAEvC,OAAO,KAAK,IAAI,EAAG,KAAK,MAAMD,CAAK,CAAC,CACxC,CAkBA,SAAgBG,EAAW,EAA4B,EAAiC,CACpF,IAAMH,EAAQ,KAAK,IAAI,EAAG,KAAK,MAAMI,CAAW,CAAC,EAC3CT,EAAsB,MAAM,KAAK,CAAE,OAAQK,CAAM,MAAS,CAAC,CAAC,EAC5DK,EAAa,MAAcL,CAAK,CAAC,CAAC,KAAK,CAAC,EAE9C,IAAK,IAAIM,EAAQ,EAAGA,EAAQC,EAAQ,OAAQ,GAAS,EAAG,CACpD,IAAIC,EAAW,EACf,IAAK,IAAIC,EAAS,EAAGA,EAAST,EAAO,GAAU,EACvCK,EAAOI,GAAUJ,EAAOG,KAAW,EAAWC,GAEtDd,EAAQa,EAAS,CAAC,KAAKF,CAAK,EAC5B,EAAOE,IAAa,KAAK,IAAI,EAAGD,EAAQD,IAAU,CAAC,CACvD,CAEA,OAAOX,CACX,C"}