@l1yp/file-viewer 0.1.0

package/dist/lib/lzma.js

@@ -0,0 +1,204 @@
+//#region src/lib/lzma.ts
+var e = 11, t = 1 << e, n = 5, r = 1024, i = 1 << 24, a = 4, o = 12, s = 4, c = 4, l = 14, u = 128, d = 2, f = 2, p = 130, m = 258, h = 514, g = class {
+	buf;
+	code = 0;
+	range = 4294967295;
+	pos;
+	constructor(e, t) {
+		this.buf = e, this.pos = t, this.pos++;
+		for (let e = 0; e < 4; e++) this.code = (this.code << 8 | this.nextByte()) >>> 0;
+	}
+	nextByte() {
+		return this.pos < this.buf.length ? this.buf[this.pos++] : (this.pos++, 0);
+	}
+	normalize() {
+		this.range >>> 0 < i && (this.range = this.range * 256 >>> 0, this.code = this.code * 256 + this.nextByte() >>> 0);
+	}
+	decodeBit(r, i) {
+		let a = r[i], o = (this.range >>> e) * a, s;
+		return this.code >>> 0 < o ? (this.range = o, r[i] = a + (t - a >> n), s = 0) : (this.range = this.range - o >>> 0, this.code = this.code - o >>> 0, r[i] = a - (a >> n), s = 1), this.normalize(), s;
+	}
+	decodeDirectBits(e) {
+		let t = 0;
+		do {
+			this.range >>>= 1, this.code = this.code - this.range >>> 0;
+			let e = 0 - (this.code >>> 31);
+			this.code = this.code + (this.range & e) >>> 0, this.normalize(), t = t * 2 + (e + 1);
+		} while (--e);
+		return t;
+	}
+};
+function _(e, t, n, r) {
+	let i = 1;
+	for (let a = 0; a < r; a++) i = (i << 1) + e.decodeBit(t, n + i);
+	return i - (1 << r);
+}
+function v(e, t, n, r) {
+	let i = 1, a = 0;
+	for (let o = 0; o < r; o++) {
+		let r = e.decodeBit(t, n + i);
+		i = (i << 1) + r, a |= r << o;
+	}
+	return a;
+}
+function y(e, t, n) {
+	return e.decodeBit(t, 0) === 0 ? _(e, t, f + n * 8, 3) : e.decodeBit(t, 1) === 0 ? 8 + _(e, t, p + n * 8, 3) : 16 + _(e, t, m, 8);
+}
+var b = class {
+	lc = 0;
+	lp = 0;
+	pb = 0;
+	literal = new Uint16Array();
+	isMatch = new Uint16Array(o << a);
+	isRep = new Uint16Array(o);
+	isRepG0 = new Uint16Array(o);
+	isRepG1 = new Uint16Array(o);
+	isRepG2 = new Uint16Array(o);
+	isRep0Long = new Uint16Array(o << a);
+	posSlot = new Uint16Array(s << 6);
+	specPos = new Uint16Array(u - l);
+	align = new Uint16Array(1 << c);
+	lenCoder = new Uint16Array(h);
+	repLenCoder = new Uint16Array(h);
+	state = 0;
+	rep0 = 0;
+	rep1 = 0;
+	rep2 = 0;
+	rep3 = 0;
+	setProps(e) {
+		if (e >= 225) throw Error("LZMA 属性非法");
+		this.lc = e % 9, e = e / 9 | 0, this.lp = e % 5, this.pb = e / 5 | 0;
+		let t = 768 << this.lc + this.lp;
+		this.literal.length !== t && (this.literal = new Uint16Array(t));
+	}
+	resetState() {
+		this.literal.fill(r), this.isMatch.fill(r), this.isRep.fill(r), this.isRepG0.fill(r), this.isRepG1.fill(r), this.isRepG2.fill(r), this.isRep0Long.fill(r), this.posSlot.fill(r), this.specPos.fill(r), this.align.fill(r), this.lenCoder.fill(r), this.repLenCoder.fill(r), this.state = 0, this.rep0 = this.rep1 = this.rep2 = this.rep3 = 0;
+	}
+	decode(e, t, n, r, i, o) {
+		let u = new g(e, t), f = (1 << this.pb) - 1, p = (1 << this.lp) - 1, m = this.lc, { state: h, rep0: b, rep1: x, rep2: S, rep3: C } = this;
+		for (; r < i;) {
+			let e = r - o, t = e & f;
+			if (u.decodeBit(this.isMatch, (h << a) + t) === 0) {
+				let t = r > o ? n[r - 1] : 0, i = 768 * (((e & p) << m) + (t >> 8 - m)), a = 1;
+				if (h >= 7) {
+					let e = n[r - b - 1];
+					do {
+						let t = e >> 7 & 1;
+						e = e << 1 & 255;
+						let n = u.decodeBit(this.literal, i + (1 + t << 8) + a);
+						if (a = a << 1 | n, t !== n) break;
+					} while (a < 256);
+				}
+				for (; a < 256;) a = a << 1 | u.decodeBit(this.literal, i + a);
+				n[r++] = a & 255, h = h < 4 ? 0 : h < 10 ? h - 3 : h - 6;
+				continue;
+			}
+			let g;
+			if (u.decodeBit(this.isRep, h) !== 0) {
+				if (u.decodeBit(this.isRepG0, h) === 0) {
+					if (u.decodeBit(this.isRep0Long, (h << a) + t) === 0) {
+						h = h < 7 ? 9 : 11, n[r] = n[r - b - 1], r++;
+						continue;
+					}
+				} else {
+					let e;
+					u.decodeBit(this.isRepG1, h) === 0 ? e = x : (u.decodeBit(this.isRepG2, h) === 0 ? e = S : (e = C, C = S), S = x), x = b, b = e;
+				}
+				g = y(u, this.repLenCoder, t), h = h < 7 ? 8 : 11;
+			} else {
+				C = S, S = x, x = b, g = y(u, this.lenCoder, t), h = h < 7 ? 7 : 10;
+				let e = g < s ? g : s - 1, n = _(u, this.posSlot, e << 6, 6);
+				if (n < 4) b = n;
+				else {
+					let e = (n >> 1) - 1;
+					if (b = (2 | n & 1) << e, n < l) b += v(u, this.specPos, b - n - 1, e);
+					else if (b += u.decodeDirectBits(e - c) * (1 << c), b += v(u, this.align, 0, c), b >>> 0 == 4294967295) break;
+				}
+			}
+			g += d;
+			let w = r - b - 1;
+			for (let e = 0; e < g && r < i; e++) n[r++] = n[w++];
+		}
+		return this.state = h, this.rep0 = b, this.rep1 = x, this.rep2 = S, this.rep3 = C, r;
+	}
+};
+function x(e, t, n) {
+	if (t.length < 5) throw Error("LZMA 属性长度不足");
+	let r = new b();
+	r.setProps(t[0]), r.resetState();
+	let i = new Uint8Array(n);
+	return r.decode(e, 0, i, 0, n, 0), i;
+}
+function S(e, t, n) {
+	let r = new Uint8Array(n), i = new b(), a = 0, o = 0, s = 0, c = !0;
+	for (; a < e.length;) {
+		let t = e[a++];
+		if (t === 0) break;
+		if (t >= 128) {
+			let n = ((t & 31) << 16) + (e[a] << 8) + e[a + 1] + 1;
+			a += 2;
+			let l = (e[a] << 8) + e[a + 1] + 1;
+			a += 2;
+			let u = t >> 5 & 3;
+			if (u >= 2) i.setProps(e[a++]), c = !1;
+			else if (c) throw Error("LZMA2 缺少属性的块");
+			u >= 1 && i.resetState(), u === 3 && (s = o), i.decode(e, a, r, o, o + n, s), a += l, o += n;
+		} else {
+			if (t > 2) throw Error(`LZMA2 非法控制字节 0x${t.toString(16)}`);
+			let n = (e[a] << 8) + e[a + 1] + 1;
+			a += 2, t === 1 && (s = o, c = !0), r.set(e.subarray(a, a + n), o), a += n, o += n;
+		}
+		if (o >= n) break;
+	}
+	return r;
+}
+var C = [
+	!0,
+	!0,
+	!0,
+	!1,
+	!0,
+	!1,
+	!1,
+	!1
+], w = [
+	0,
+	1,
+	2,
+	2,
+	3,
+	3,
+	3,
+	3
+], T = (e) => e === 0 || e === 255;
+function E(e, t = 0) {
+	let n = e.length;
+	if (n < 5) return;
+	let r = n - 5, i = 0, a = -1, o = 0;
+	for (; o <= r;) {
+		if ((e[o] & 254) != 232) {
+			o++;
+			continue;
+		}
+		let n = o - a;
+		if (a = o, n > 3) i = 0;
+		else if (i = i << n - 1 & 7, i !== 0) {
+			let t = e[o + 4 - w[i]];
+			if (!C[i] || T(t)) {
+				i = i << 1 & 7 | 1, o++;
+				continue;
+			}
+		}
+		if (T(e[o + 4])) {
+			let n = (e[o + 1] | e[o + 2] << 8 | e[o + 3] << 16 | e[o + 4] << 24) >>> 0, r = 0;
+			for (; r = n - (t + o + 5) >>> 0, i !== 0;) {
+				let e = w[i] * 8;
+				if (!T(r >>> 24 - e & 255)) break;
+				n = (r ^ (1 << 32 - e) - 1) >>> 0;
+			}
+			e[o + 4] = ~((r >>> 24 & 1) - 1) & 255, e[o + 3] = r >>> 16 & 255, e[o + 2] = r >>> 8 & 255, e[o + 1] = r & 255, o += 5, i = 0;
+		} else i = i << 1 & 7 | 1, o++;
+	}
+}
+//#endregion
+export { E as bcjX86Decode, S as lzma2Decode, x as lzmaDecode };

package/dist/lib/markdown/blocks.d.ts

@@ -0,0 +1,9 @@
+import { type VNode } from 'vue';
+/**
+ * Block-level markdown → VNodes. Handles fenced code, ATX headings (## / ###),
+ * GFM pipe tables, ordered/unordered lists (with nesting + fenced code inside
+ * items), and paragraphs with hard line breaks. Faithful port of `mdNodes`.
+ */
+export declare function mdNodes(text: string, kp: string, depth: number): VNode[];
+/** Top-level markdown entry (depth 0). */
+export declare function md(text: string, kp: string): VNode[];

package/dist/lib/markdown/blocks.js

@@ -0,0 +1,221 @@
+import e from "../../components/CodeBlock.js";
+import { blockMath as t } from "./math.js";
+import { blockquoteStyle as n, headingStyle as r, hrStyle as i, listItemStyle as a, listStyle as o, paragraphStyle as s, taskCheckboxStyle as c } from "./styles.js";
+import { inline as l } from "./inline.js";
+import u from "../../components/MarkdownTable.js";
+import { h as d } from "vue";
+//#region src/lib/markdown/blocks.ts
+function f(t, n, r, i) {
+	return d(e, {
+		key: r,
+		code: t,
+		lang: n,
+		maxHeight: i?.maxHeight,
+		margin: i?.margin
+	});
+}
+function p(e, t, n, r) {
+	return d(u, {
+		key: r,
+		header: e,
+		aligns: t,
+		rows: n,
+		keyPrefix: r
+	});
+}
+function m(e, u, h) {
+	let g = String(e).replace(/\t/g, "  ").split("\n"), _ = [], v = s(h), y = 0, b = 0, x = (e) => e.match(/^(\s*)/)[1].length, S = (e) => /^ {0,3}([-*_])(?:[ \t]*\1){2,}[ \t]*$/.test(e), C = (e) => {
+		if (e.indexOf("|") === -1) return !1;
+		let t = e.trim();
+		t.charAt(0) === "|" && (t = t.slice(1)), t.charAt(t.length - 1) === "|" && (t = t.slice(0, -1));
+		let n = t.split("|");
+		return n.length > 0 && n.every((e) => /^\s*:?-+:?\s*$/.test(e));
+	}, w = (e) => {
+		let t = e.trim();
+		t.charAt(0) === "|" && (t = t.slice(1)), t.charAt(t.length - 1) === "|" && (t = t.slice(0, -1));
+		let n = [], r = "";
+		for (let e = 0; e < t.length; e++) {
+			let i = t.charAt(e);
+			if (i === "\\" && t.charAt(e + 1) === "|") {
+				r += "|", e++;
+				continue;
+			}
+			if (i === "|") {
+				n.push(r.trim()), r = "";
+				continue;
+			}
+			r += i;
+		}
+		return n.push(r.trim()), n;
+	};
+	for (; y < g.length;) {
+		let e = g[y];
+		if (e.trim() === "") {
+			y++;
+			continue;
+		}
+		let s = `${u}-${b++}`, T = e.match(/^(\s*)```+\s*([^`]*)$/);
+		if (T) {
+			let e = T[1].length, t = T[2], n = [];
+			for (y++; y < g.length && !/^\s*```+\s*$/.test(g[y]);) n.push(g[y].slice(e)), y++;
+			y++, _.push(f(n.join("\n"), t, s));
+			continue;
+		}
+		let E = e.match(/^\s*(\$\$|\\\[)/);
+		if (E) {
+			let n = E[1], r = n === "$$" ? "$$" : "\\]", i = e.slice(e.indexOf(n) + n.length), a = i.indexOf(r), o;
+			if (a !== -1) o = i.slice(0, a), y++;
+			else {
+				let e = [i];
+				for (y++; y < g.length;) {
+					let t = g[y].indexOf(r);
+					if (t !== -1) {
+						e.push(g[y].slice(0, t)), y++;
+						break;
+					}
+					e.push(g[y]), y++;
+				}
+				o = e.join("\n");
+			}
+			_.push(t(o.trim(), s));
+			continue;
+		}
+		if (S(e)) {
+			_.push(d("hr", {
+				key: s,
+				style: i
+			})), y++;
+			continue;
+		}
+		if (/^\s*>/.test(e)) {
+			let e = [];
+			for (; y < g.length;) if (/^\s*>/.test(g[y])) e.push(g[y].replace(/^\s*>\s?/, "")), y++;
+			else if (g[y].trim() === "") {
+				let t = y + 1;
+				for (; t < g.length && g[t].trim() === "";) t++;
+				if (t < g.length && /^\s*>/.test(g[t])) {
+					e.push(""), y = t;
+					continue;
+				}
+				break;
+			} else break;
+			_.push(d("blockquote", {
+				key: s,
+				style: n
+			}, m(e.join("\n"), s, h)));
+			continue;
+		}
+		let D = e.match(/^(#{1,6})\s+(.*)$/);
+		if (D) {
+			let e = D[1].length, t = r(e, _.length === 0);
+			_.push(d(`h${e}`, {
+				key: s,
+				style: t
+			}, l(D[2], s))), y++;
+			continue;
+		}
+		if (e.indexOf("|") !== -1 && y + 1 < g.length && C(g[y + 1])) {
+			let t = w(e), n = w(g[y + 1]).map((e) => {
+				let t = e.charAt(0) === ":", n = e.charAt(e.length - 1) === ":";
+				return t && n ? "center" : n ? "right" : t ? "left" : null;
+			});
+			y += 2;
+			let r = [];
+			for (; y < g.length;) {
+				let e = g[y];
+				if (e.trim() === "" || e.indexOf("|") === -1 || /^\s*```+/.test(e) || /^#{1,6}\s/.test(e)) break;
+				r.push(w(e)), y++;
+			}
+			_.push(p(t, n, r, s));
+			continue;
+		}
+		let O = e.match(/^(\s*)(\d+)\.\s+/), k = e.match(/^(\s*)([-*+•])\s+/);
+		if (O || k) {
+			let e = !!O, t = (O || k)[1].length, n = e ? /^(\s*)(\d+)\.\s+([\s\S]*)$/ : /^(\s*)([-*+•])\s+([\s\S]*)$/, r = [], i = null;
+			for (; y < g.length;) {
+				let a = g[y].match(n);
+				if (a && a[1].length === t && !S(g[y])) {
+					e && i === null && (i = parseInt(a[2], 10));
+					let o = [a[3]];
+					for (y++; y < g.length;) {
+						if (g[y].trim() === "") {
+							o.push(""), y++;
+							continue;
+						}
+						let e = x(g[y]), r = g[y].match(n);
+						if (e > t && !(r && r[1].length === t)) o.push(g[y]), y++;
+						else break;
+					}
+					r.push(o);
+				} else if (g[y].trim() === "") {
+					let e = y + 1;
+					for (; e < g.length && g[e].trim() === "";) e++;
+					if (e < g.length) {
+						let r = g[e].match(n);
+						if (r && r[1].length === t && !S(g[e]) || x(g[e]) > t) {
+							y = e;
+							continue;
+						}
+					}
+					break;
+				} else break;
+			}
+			let l = o(h, e), u = a(h), f = r.map((t, n) => {
+				let r = Infinity;
+				t.slice(1).forEach((e) => {
+					e.trim() !== "" && (r = Math.min(r, x(e)));
+				}), isFinite(r) || (r = 0);
+				let i = [t[0]].concat(t.slice(1).map((e) => e.trim() === "" ? "" : e.slice(r))).join("\n").replace(/\n+$/, ""), a = e ? null : /^\[([ xX])\]\s+/.exec(i), o = !!a && a[1].toLowerCase() === "x", l = m(a ? i.slice(a[0].length) : i, `${s}-i${n}`, h + 1), f = l.length === 1 && l[0] && l[0].type === "p";
+				if (a) {
+					let e = d("span", {
+						key: "cb",
+						style: c(o),
+						"aria-hidden": "true"
+					}, o ? "✓" : ""), t = f ? [e, ...l[0].children || []] : [e, ...l];
+					return d("li", {
+						key: n,
+						style: {
+							...u,
+							listStyleType: "none"
+						}
+					}, t);
+				}
+				let p = f ? d("span", { style: {
+					display: "block",
+					fontFamily: u.fontFamily,
+					fontSize: u.fontSize,
+					lineHeight: 1.72
+				} }, l[0].children) : l;
+				return d("li", {
+					key: n,
+					style: u
+				}, p);
+			}), p = e && i && i !== 1 ? { start: i } : {};
+			_.push(d(e ? "ol" : "ul", {
+				key: s,
+				style: l,
+				...p
+			}, f));
+			continue;
+		}
+		let A = [e];
+		for (y++; y < g.length;) {
+			let e = g[y];
+			if (e.trim() === "" || /^\s*```+/.test(e) || /^\s*(\$\$|\\\[)/.test(e) || /^#{1,6}\s/.test(e) || /^\s*>/.test(e) || S(e) || /^\s*\d+\.\s+/.test(e) || /^\s*[-*+•]\s+/.test(e) || e.indexOf("|") !== -1 && y + 1 < g.length && C(g[y + 1])) break;
+			A.push(e), y++;
+		}
+		let j = [];
+		A.forEach((e, t) => {
+			t > 0 && j.push(d("br", { key: `br${t}` })), l(e, `${s}-l${t}`).forEach((e) => j.push(e));
+		}), _.push(d("p", {
+			key: s,
+			style: v
+		}, j));
+	}
+	return _;
+}
+function h(e, t) {
+	return m(e, t, 0);
+}
+//#endregion
+export { h as md, m as mdNodes };

package/dist/lib/markdown/index.d.ts

@@ -0,0 +1,3 @@
+export { inline, type InlineNode } from './inline';
+export { segmentize, type Segment } from './segmentize';
+export { md, mdNodes } from './blocks';

package/dist/lib/markdown/inline.d.ts

@@ -0,0 +1,33 @@
+import { type VNode } from 'vue';
+export type InlineNode = VNode | string;
+/**
+ * Resolve an inline citation token to its rendered chip(s), or null to strip it. Provider-specific (ChatGPT
+ * supplies one via {@link renderInline}); the shared renderer just calls it for citation tokens it finds.
+ */
+export type CiteResolver = (token: string) => InlineNode[] | null;
+/**
+ * Resolve a markdown link to custom inline nodes, or null to render a normal anchor. Lets a provider turn
+ * specific links into rich nodes — ChatGPT renders managed file-download links as file chips (preview/download)
+ * via {@link renderInline}; everything else falls through to a plain `<a>`.
+ */
+export type LinkResolver = (text: string, href: string) => InlineNode[] | null;
+/** Inline resolvers a provider can install for one render pass. */
+export interface InlineResolvers {
+    cite?: CiteResolver;
+    link?: LinkResolver;
+}
+/** Run [body] with the given inline [resolvers] active, restoring the previous ones afterwards. */
+export declare function renderInline<T>(resolvers: InlineResolvers, body: () => T): T;
+/**
+ * Render inline markdown to an array of VNodes/strings.
+ * Order matters: code first (nothing is parsed inside it), then math (`$…$` / `\(…\)`, pulled out
+ * before emphasis so TeX internals like `_` `*` `\` aren't mangled), image before link
+ * (`![…](…)` contains `[…](…)`), bold (`**`/`__`) before italic (`*`/`_`).
+ * Groups: 1 code, 2 math-`$`, 3 math-`\(`, 4 img-alt, 5 img-url, 6 bold, 7 underscore-bold,
+ * 8 strike, 9 link-text, 10 link-url, 11 italic, 12 underscore-italic, 13 citation (PUA-delimited),
+ * 14 citation (`【n†…】`). The opening `$` is guarded against a following space/`$` and the closing
+ * against a following word char, so prose prices like `$5` don't trigger math. Underscore emphasis is
+ * guarded by alnum boundaries so `snake_case` stays intact.
+ * Citation tokens resolve via the active {@link CiteResolver} (or are stripped when none is set).
+ */
+export declare function inline(s: string, kp: string): InlineNode[];

package/dist/lib/markdown/inline.js

@@ -0,0 +1,84 @@
+import { useLightbox as e } from "../../composables/useLightbox.js";
+import { inlineMath as t } from "./math.js";
+import { delStyle as n, emStyle as r, imgStyle as i, inlineCodeStyle as a, linkStyle as o, strongStyle as s } from "./styles.js";
+import { h as c } from "vue";
+//#region src/lib/markdown/inline.ts
+var l = null, u = null;
+function d(e, t) {
+	let n = l, r = u;
+	l = e.cite ?? null, u = e.link ?? null;
+	try {
+		return t();
+	} finally {
+		l = n, u = r;
+	}
+}
+var f = /[\u{e200}-\u{e20f}]/gu;
+function p(d, p) {
+	let m = [], h = (e) => {
+		let t = e.replace(f, "");
+		t && m.push(t);
+	}, g = /`([^`\n]+?)`|\$(?![ \t$])((?:\\.|[^$\n\\])+?)\$(?![\w$])|\\\(([\s\S]+?)\\\)|!\[([^\]\n]*?)\]\(([^)\s]+?)\)|\*\*([\s\S]+?)\*\*|__([^_]+?)__|~~([\s\S]+?)~~|\[([^\]\n]+?)\]\(([^)\s]+?)\)|\*([^\s*][^*]*?)\*|(?<![A-Za-z0-9_])_([^_]+?)_(?![A-Za-z0-9_])|(\u{e200}[\s\S]*?\u{e201})|(【[^】\n]*?†[^】\n]*?】)/gu, _ = 0, v, y = 0;
+	for (; v = g.exec(d);) {
+		if (v.index > _ && h(d.slice(_, v.index)), v[1] !== void 0) m.push(c("code", {
+			key: `${p}-c${y++}`,
+			style: a
+		}, v[1]));
+		else if (v[2] !== void 0) m.push(t(v[2], `${p}-m${y++}`));
+		else if (v[3] !== void 0) m.push(t(v[3], `${p}-m${y++}`));
+		else if (v[4] !== void 0) {
+			let t = v[5], n = v[4];
+			m.push(c("img", {
+				key: `${p}-img${y++}`,
+				src: t,
+				alt: n,
+				loading: "lazy",
+				style: {
+					...i,
+					cursor: "zoom-in"
+				},
+				onClick: () => e().open({
+					src: t,
+					alt: n
+				})
+			}));
+		} else if (v[6] !== void 0) m.push(c("strong", {
+			key: `${p}-s${y++}`,
+			style: s
+		}, v[6]));
+		else if (v[7] !== void 0) m.push(c("strong", {
+			key: `${p}-s${y++}`,
+			style: s
+		}, v[7]));
+		else if (v[8] !== void 0) m.push(c("del", {
+			key: `${p}-d${y++}`,
+			style: n
+		}, v[8]));
+		else if (v[9] !== void 0) {
+			let e = v[10] ?? "", t = u ? u(v[9], e) : null;
+			if (t) for (let e of t) m.push(e);
+			else m.push(c("a", {
+				key: `${p}-a${y++}`,
+				href: e,
+				target: "_blank",
+				rel: "noopener noreferrer",
+				style: o
+			}, v[9]));
+		} else if (v[11] !== void 0) m.push(c("em", {
+			key: `${p}-e${y++}`,
+			style: r
+		}, v[11]));
+		else if (v[12] !== void 0) m.push(c("em", {
+			key: `${p}-e${y++}`,
+			style: r
+		}, v[12]));
+		else {
+			let e = v[13] ?? v[14] ?? "", t = l ? l(e) : null;
+			if (t) for (let e of t) m.push(e);
+		}
+		_ = g.lastIndex;
+	}
+	return _ < d.length && h(d.slice(_)), m;
+}
+//#endregion
+export { p as inline, d as renderInline };

package/dist/lib/markdown/math.d.ts

@@ -0,0 +1,5 @@
+import { type VNode } from 'vue';
+/** Inline formula (`$…$` / `\(…\)`) — flows within the surrounding line. */
+export declare function inlineMath(tex: string, key: string): VNode;
+/** Display formula (`$$…$$` / `\[…\]`) — its own centered block, scrolls sideways if too wide. */
+export declare function blockMath(tex: string, key: string): VNode;

package/dist/lib/markdown/math.js

@@ -0,0 +1,25 @@
+import { h as e } from "vue";
+import t from "katex";
+//#region src/lib/markdown/math.ts
+function n(e, n) {
+	return t.renderToString(e, {
+		displayMode: n,
+		throwOnError: !1
+	});
+}
+function r(t, r) {
+	return e("span", {
+		key: r,
+		class: "math-inline",
+		innerHTML: n(t, !1)
+	});
+}
+function i(t, r) {
+	return e("div", {
+		key: r,
+		class: "math-block",
+		innerHTML: n(t, !0)
+	});
+}
+//#endregion
+export { i as blockMath, r as inlineMath };

package/dist/lib/markdown/segmentize.d.ts

@@ -0,0 +1,11 @@
+export interface Segment {
+    code: boolean;
+    text: string;
+    lang?: string;
+}
+/**
+ * Split markdown into ordered segments of prose and fenced code blocks.
+ * Blank lines inside fences are preserved; blank lines around prose are trimmed.
+ * Faithful port of the original `segmentize` (used for human messages).
+ */
+export declare function segmentize(text: string): Segment[];

package/dist/lib/markdown/segmentize.js

@@ -0,0 +1,28 @@
+//#region src/lib/markdown/segmentize.ts
+function e(e) {
+	let t = String(e).split("\n"), n = [], r = [], i = 0, a = () => {
+		if (r.length) {
+			let e = r.join("\n").replace(/^\n+/, "").replace(/\n+$/, "");
+			e.trim() && n.push({
+				code: !1,
+				text: e
+			}), r = [];
+		}
+	};
+	for (; i < t.length;) {
+		let e = t[i].match(/^\s*```+\s*([^`]*)$/);
+		if (e) {
+			a();
+			let r = e[1], o = [];
+			for (i++; i < t.length && !/^\s*```+\s*$/.test(t[i]);) o.push(t[i]), i++;
+			i++, n.push({
+				code: !0,
+				lang: r,
+				text: o.join("\n")
+			});
+		} else r.push(t[i]), i++;
+	}
+	return a(), n;
+}
+//#endregion
+export { e as segmentize };

package/dist/lib/markdown/styles.d.ts

@@ -0,0 +1,26 @@
+import type { CSSProperties } from 'vue';
+/**
+ * Centralized typography for markdown-rendered nodes. The render functions build
+ * raw VNodes (outside any SFC), so they can't use scoped CSS — keeping every
+ * markdown style in this one file is the maintainable equivalent: tweak prose
+ * sizing/spacing here and it applies everywhere markdown is rendered.
+ *
+ * `depth` mirrors the original: 0 = top level, >0 = nested inside a list item.
+ */
+export declare function paragraphStyle(depth: number): CSSProperties;
+export declare function headingStyle(level: number, first: boolean): CSSProperties;
+export declare function listStyle(depth: number, ordered: boolean): CSSProperties;
+export declare function listItemStyle(depth: number): CSSProperties;
+export declare const inlineCodeStyle: CSSProperties;
+export declare const strongStyle: CSSProperties;
+export declare const delStyle: CSSProperties;
+export declare const emStyle: CSSProperties;
+export declare const linkStyle: CSSProperties;
+/** Inline image (`![alt](url)`). Scales down to the column, never overflows. */
+export declare const imgStyle: CSSProperties;
+/** Thematic break (`---` / `***` / `___`). */
+export declare const hrStyle: CSSProperties;
+/** Blockquote (`> …`): left rule + softened text; nests via recursion. */
+export declare const blockquoteStyle: CSSProperties;
+/** GFM task-list checkbox (`- [ ]` / `- [x]`) — a styled box, not a native input, for theme control. */
+export declare function taskCheckboxStyle(checked: boolean): CSSProperties;