@sigx/terminal-zero 0.5.0

package/dist/shared-h5p-EcZV.js

@@ -0,0 +1,732 @@
+import { signal as e } from "@sigx/reactivity";
+import { charWidth as t, charWidth as n, dispatchKey as r, displayWidth as i, focus as a, focusNext as o, focusPrev as s, focusState as c, getColorDepth as l, getOutputTarget as u, getOutputTarget as d, getTerminalSize as f, hexToSGR as p, onKey as m, printStatic as h, registerFocusable as g, renderTerminal as _, resolveBg as v, resolveFg as y, setScreenBackground as b, setScreenForeground as x, syncTerminalSize as S, truncateToWidth as C, unregisterFocusable as w, writeStatic as T } from "@sigx/runtime-terminal";
+import { Buffer as ee } from "node:buffer";
+//#region src/shared/colorMath.ts
+function E(e) {
+	let t = e.trim().replace(/^#/, "");
+	return /^[0-9a-f]{6}$/i.test(t) ? [
+		parseInt(t.slice(0, 2), 16),
+		parseInt(t.slice(2, 4), 16),
+		parseInt(t.slice(4, 6), 16)
+	] : /^[0-9a-f]{3}$/i.test(t) ? [
+		parseInt(t[0] + t[0], 16),
+		parseInt(t[1] + t[1], 16),
+		parseInt(t[2] + t[2], 16)
+	] : null;
+}
+function D(e, t, n) {
+	let r = (e) => Math.max(0, Math.min(255, Math.round(e))).toString(16).padStart(2, "0");
+	return `#${r(e)}${r(t)}${r(n)}`;
+}
+function O(e, t, n) {
+	let r = E(e) ?? [
+		255,
+		255,
+		255
+	], i = E(t) ?? [
+		255,
+		255,
+		255
+	], a = Math.max(0, Math.min(1, n));
+	return D(r[0] + (i[0] - r[0]) * a, r[1] + (i[1] - r[1]) * a, r[2] + (i[2] - r[2]) * a);
+}
+function te(e, t) {
+	if (t <= 0) return [];
+	if (e.length === 0) return Array(t).fill("#ffffff");
+	if (e.length === 1) return Array(t).fill(e[0]);
+	let n = [];
+	for (let r = 0; r < t; r++) {
+		let i = (t === 1 ? 0 : r / (t - 1)) * (e.length - 1), a = Math.min(Math.floor(i), e.length - 2);
+		n.push(O(e[a], e[a + 1], i - a));
+	}
+	return n;
+}
+function ne(e, t, n) {
+	e /= 255, t /= 255, n /= 255;
+	let r = Math.max(e, t, n), i = Math.min(e, t, n), a = (r + i) / 2;
+	if (r === i) return [
+		0,
+		0,
+		a
+	];
+	let o = r - i, s = a > .5 ? o / (2 - r - i) : o / (r + i), c;
+	return c = r === e ? ((t - n) / o + (t < n ? 6 : 0)) / 6 : r === t ? ((n - e) / o + 2) / 6 : ((e - t) / o + 4) / 6, [
+		c,
+		s,
+		a
+	];
+}
+function re(e, t, n) {
+	if (t === 0) {
+		let e = n * 255;
+		return [
+			e,
+			e,
+			e
+		];
+	}
+	let r = n < .5 ? n * (1 + t) : n + t - n * t, i = 2 * n - r, a = (e) => (e < 0 && (e += 1), e > 1 && --e, e < 1 / 6 ? i + (r - i) * 6 * e : e < 1 / 2 ? r : e < 2 / 3 ? i + (r - i) * (2 / 3 - e) * 6 : i);
+	return [
+		a(e + 1 / 3) * 255,
+		a(e) * 255,
+		a(e - 1 / 3) * 255
+	];
+}
+function ie(e, t) {
+	let n = E(e) ?? [
+		255,
+		255,
+		255
+	], [r, i, a] = ne(n[0], n[1], n[2]), [o, s, c] = re(((r + t / 360) % 1 + 1) % 1, i, a);
+	return D(o, s, c);
+}
+//#endregion
+//#region src/shared/ticker.ts
+var ae = 80, k = e({ t: 0 }), A = null, j = 0;
+function oe() {
+	return k.t;
+}
+function se() {
+	if (!u().isTTY) return () => {};
+	j++, A ||= setInterval(() => {
+		k.t++;
+	}, 80);
+	let e = !0;
+	return () => {
+		e && (e = !1, j--, j === 0 && A && (clearInterval(A), A = null));
+	};
+}
+//#endregion
+//#region src/shared/textBuffer.ts
+var M = (e) => [...e];
+function N(e, n) {
+	let r = Math.max(1, n), i = M(e), a = [], o = 0, s = 0, c = -1, l = (e, t, n) => {
+		a.push({
+			text: i.slice(o, e).join(""),
+			start: o,
+			end: e,
+			hard: t
+		}), o = n, c = -1;
+	}, u = 0;
+	for (; u < i.length;) {
+		let e = i[u];
+		if (e === "\n") {
+			l(u, !0, u + 1), s = 0, u++;
+			continue;
+		}
+		let n = t(e.codePointAt(0) ?? 0);
+		if (s + n > r && u > o) {
+			if (e === " ") {
+				l(u, !1, u + 1), s = 0, u++;
+				continue;
+			}
+			c > o ? l(c, !1, c + 1) : l(u, !1, u), s = 0;
+			for (let e = o; e < u; e++) s += t(i[e].codePointAt(0) ?? 0);
+			continue;
+		}
+		e === " " && (c = u), s += n, u++;
+	}
+	return a.push({
+		text: i.slice(o).join(""),
+		start: o,
+		end: i.length,
+		hard: !0
+	}), {
+		rows: a,
+		width: r
+	};
+}
+function P(e, n) {
+	let r = e.rows;
+	for (let e = 0; e < r.length; e++) {
+		let i = r[e], a = e === r.length - 1, o = r[e + 1];
+		if (!(n >= i.start && (n < i.end || n === i.end && (a || o.start !== i.end) || a && n >= i.end))) continue;
+		let s = 0, c = M(i.text), l = Math.min(n - i.start, c.length);
+		for (let e = 0; e < l; e++) s += t(c[e].codePointAt(0) ?? 0);
+		return {
+			row: e,
+			col: s
+		};
+	}
+	let i = r.length - 1;
+	return {
+		row: i,
+		col: M(r[i].text).reduce((e, n) => e + t(n.codePointAt(0) ?? 0), 0)
+	};
+}
+function F(e, n, r) {
+	let i = e.rows[Math.max(0, Math.min(n, e.rows.length - 1))], a = M(i.text), o = 0;
+	for (let e = 0; e < a.length; e++) {
+		let n = t(a[e].codePointAt(0) ?? 0);
+		if (o + n > r) return i.start + e;
+		o += n;
+	}
+	return i.end;
+}
+function ce(e, t) {
+	let n = M(e.text), r = Math.max(0, Math.min(e.cursor, n.length));
+	return {
+		text: n.slice(0, r).join("") + t + n.slice(r).join(""),
+		cursor: r + M(t).length
+	};
+}
+function le(e) {
+	let t = M(e.text), n = Math.max(0, Math.min(e.cursor, t.length));
+	return n === 0 ? e : {
+		text: t.slice(0, n - 1).join("") + t.slice(n).join(""),
+		cursor: n - 1
+	};
+}
+function ue(e) {
+	let t = M(e.text), n = Math.max(0, Math.min(e.cursor, t.length));
+	return n >= t.length ? e : {
+		text: t.slice(0, n).join("") + t.slice(n + 1).join(""),
+		cursor: n
+	};
+}
+function de(e) {
+	return {
+		...e,
+		cursor: Math.max(0, e.cursor - 1)
+	};
+}
+function I(e) {
+	return {
+		...e,
+		cursor: Math.min(M(e.text).length, e.cursor + 1)
+	};
+}
+function L(e, t, n, r) {
+	let i = N(e.text, t), { row: a, col: o } = P(i, e.cursor), s = r !== void 0 && r >= 0 ? r : o, c = a + n;
+	return c < 0 || c >= i.rows.length ? {
+		state: e,
+		goalCol: s
+	} : {
+		state: {
+			...e,
+			cursor: F(i, c, s)
+		},
+		goalCol: s
+	};
+}
+function R(e, t) {
+	let n = N(e.text, t), { row: r } = P(n, e.cursor);
+	return {
+		...e,
+		cursor: n.rows[r].start
+	};
+}
+function z(e, t) {
+	let n = N(e.text, t), { row: r } = P(n, e.cursor);
+	return {
+		...e,
+		cursor: n.rows[r].end
+	};
+}
+//#endregion
+//#region src/shared/viewStack.ts
+function B(t) {
+	let n = e({ stack: [t] });
+	return {
+		push(e) {
+			n.stack = [...n.stack, e];
+		},
+		pop() {
+			return n.stack.length <= 1 ? !1 : (n.stack = n.stack.slice(0, -1), !0);
+		},
+		replace(e) {
+			n.stack = [...n.stack.slice(0, -1), e];
+		},
+		current() {
+			return n.stack[n.stack.length - 1];
+		},
+		depth() {
+			return n.stack.length;
+		}
+	};
+}
+//#endregion
+//#region src/shared/qr.ts
+var V = 4, H = [
+	0,
+	17,
+	32,
+	53,
+	78,
+	106,
+	134,
+	154,
+	192,
+	230,
+	271,
+	321,
+	367,
+	425,
+	458,
+	520,
+	586,
+	644,
+	718,
+	792,
+	858
+], fe = [
+	0,
+	7,
+	10,
+	15,
+	20,
+	26,
+	18,
+	20,
+	24,
+	30,
+	18,
+	20,
+	24,
+	26,
+	30,
+	22,
+	24,
+	28,
+	30,
+	28,
+	28
+], pe = [
+	0,
+	1,
+	1,
+	1,
+	1,
+	1,
+	2,
+	2,
+	2,
+	2,
+	4,
+	4,
+	4,
+	4,
+	4,
+	6,
+	6,
+	6,
+	6,
+	7,
+	8
+], U = [
+	0,
+	26,
+	44,
+	70,
+	100,
+	134,
+	172,
+	196,
+	242,
+	292,
+	346,
+	404,
+	466,
+	532,
+	581,
+	655,
+	733,
+	815,
+	901,
+	991,
+	1085
+], me = [
+	[],
+	[],
+	[6, 18],
+	[6, 22],
+	[6, 26],
+	[6, 30],
+	[6, 34],
+	[
+		6,
+		22,
+		38
+	],
+	[
+		6,
+		24,
+		42
+	],
+	[
+		6,
+		26,
+		46
+	],
+	[
+		6,
+		28,
+		50
+	],
+	[
+		6,
+		30,
+		54
+	],
+	[
+		6,
+		32,
+		58
+	],
+	[
+		6,
+		34,
+		62
+	],
+	[
+		6,
+		26,
+		46,
+		66
+	],
+	[
+		6,
+		26,
+		48,
+		70
+	],
+	[
+		6,
+		26,
+		50,
+		74
+	],
+	[
+		6,
+		30,
+		54,
+		78
+	],
+	[
+		6,
+		30,
+		56,
+		82
+	],
+	[
+		6,
+		30,
+		58,
+		86
+	],
+	[
+		6,
+		34,
+		62,
+		90
+	]
+], he = [
+	30660,
+	29427,
+	32170,
+	30877,
+	26159,
+	25368,
+	27713,
+	26998
+], ge = [
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	31892,
+	34236,
+	39577,
+	42195,
+	48118,
+	51042,
+	55367,
+	58893,
+	63784,
+	68472,
+	70749,
+	76311,
+	79154,
+	84390
+], _e = class {
+	buffer = [];
+	length = 0;
+	put(e, t) {
+		for (let n = t - 1; n >= 0; n--) this.buffer.push(e >> n & 1), this.length++;
+	}
+	getBit(e) {
+		return this.buffer[e];
+	}
+	getLength() {
+		return this.length;
+	}
+	getBuffer() {
+		return this.buffer;
+	}
+}, W = new Uint8Array(512), G = new Uint8Array(256);
+(function() {
+	let e = 1;
+	for (let t = 0; t < 255; t++) W[t] = e, G[e] = t, e <<= 1, e >= 256 && (e ^= 285);
+	for (let e = 255; e < 512; e++) W[e] = W[e - 255];
+})();
+function K(e, t) {
+	return e === 0 || t === 0 ? 0 : W[G[e] + G[t]];
+}
+function ve(e, t) {
+	let n = new Uint8Array(t + 1);
+	n[0] = 1;
+	for (let e = 0; e < t; e++) for (let r = t; r >= 1; r--) n[r] = n[r] ^ K(n[r - 1], W[e]);
+	let r = new Uint8Array(e.length + t);
+	for (let t = 0; t < e.length; t++) r[t] = e[t];
+	for (let i = 0; i < e.length; i++) {
+		let e = r[i];
+		if (e !== 0) for (let a = 1; a <= t; a++) r[i + a] ^= K(n[a], e);
+	}
+	return Array.from(r.slice(e.length));
+}
+function ye(e) {
+	for (let t = 1; t <= 20; t++) if (H[t] >= e) return t;
+	throw Error("Data too long for QR code (max ~850 bytes)");
+}
+function be(e) {
+	return 17 + e * 4;
+}
+function q(e) {
+	return Array.from({ length: e }, () => Array(e).fill(null));
+}
+function xe(e, t, n, r) {
+	t >= 0 && t < e.length && n >= 0 && n < e.length && (e[t][n] = r);
+}
+function J(e, t, n) {
+	for (let r = -1; r <= 7; r++) for (let i = -1; i <= 7; i++) {
+		let a = r >= 0 && r <= 6 && i >= 0 && i <= 6 && (r === 0 || r === 6 || i === 0 || i === 6 || r >= 2 && r <= 4 && i >= 2 && i <= 4);
+		xe(e, t + r, n + i, a);
+	}
+}
+function Se(e, t, n) {
+	for (let r = -2; r <= 2; r++) for (let i = -2; i <= 2; i++) {
+		let a = Math.abs(r) === 2 || Math.abs(i) === 2 || r === 0 && i === 0;
+		e[t + r][n + i] === null && (e[t + r][n + i] = a);
+	}
+}
+function Y(e) {
+	let t = e.length;
+	for (let n = 8; n < t - 8; n++) {
+		let t = n % 2 == 0;
+		e[6][n] === null && (e[6][n] = t), e[n][6] === null && (e[n][6] = t);
+	}
+}
+function Ce(e) {
+	let t = e.length;
+	for (let t = 0; t <= 8; t++) e[8][t] === null && (e[8][t] = !1), e[t][8] === null && (e[t][8] = !1);
+	for (let n = 0; n <= 7; n++) e[8][t - 1 - n] === null && (e[8][t - 1 - n] = !1);
+	for (let n = 0; n <= 7; n++) e[t - 1 - n][8] === null && (e[t - 1 - n][8] = !1);
+	e[t - 8][8] = !0;
+}
+function X(e, t) {
+	let n = e.length, r = he[t];
+	for (let t = 0; t <= 5; t++) e[8][t] = !!(r >> 14 - t & 1);
+	e[8][7] = !!(r >> 8 & 1), e[8][8] = !!(r >> 7 & 1), e[7][8] = !!(r >> 6 & 1);
+	for (let t = 0; t <= 5; t++) e[5 - t][8] = !!(r >> t & 1);
+	for (let t = 0; t <= 7; t++) e[8][n - 1 - t] = !!(r >> t & 1);
+	for (let t = 0; t <= 6; t++) e[n - 1 - t][8] = !!(r >> 14 - t & 1);
+}
+function Z(e, t) {
+	if (t < 7) return;
+	let n = e.length, r = ge[t];
+	for (let t = 0; t < 18; t++) {
+		let i = !!(r >> t & 1), a = Math.floor(t / 3), o = t % 3;
+		e[5 - a][n - 9 - o] = i, e[n - 9 - o][5 - a] = i;
+	}
+}
+var we = [
+	(e, t) => (e + t) % 2 == 0,
+	(e, t) => e % 2 == 0,
+	(e, t) => t % 3 == 0,
+	(e, t) => (e + t) % 3 == 0,
+	(e, t) => (Math.floor(e / 2) + Math.floor(t / 3)) % 2 == 0,
+	(e, t) => e * t % 2 + e * t % 3 == 0,
+	(e, t) => (e * t % 2 + e * t % 3) % 2 == 0,
+	(e, t) => ((e + t) % 2 + e * t % 3) % 2 == 0
+];
+function Te(e, t) {
+	let n = e.length, r = 0, i = !0;
+	for (let a = n - 1; a >= 1; a -= 2) {
+		a === 6 && (a = 5);
+		let o = i ? Array.from({ length: n }, (e, t) => n - 1 - t) : Array.from({ length: n }, (e, t) => t);
+		for (let n of o) for (let i of [a, a - 1]) e[n][i] === null && (e[n][i] = r < t.length ? !!t[r] : !1, r++);
+		i = !i;
+	}
+}
+function Q(e, t, n) {
+	let r = e.length, i = Array.from({ length: r }, (t, n) => Array.from({ length: r }, (t, r) => !!e[n][r])), a = we[n];
+	for (let e = 0; e < r; e++) for (let n = 0; n < r; n++) t[e][n] === null && a(e, n) && (i[e][n] = !i[e][n]);
+	return i;
+}
+function Ee(e) {
+	let t = e.length, n = 0;
+	for (let r = 0; r < t; r++) {
+		let i = 1;
+		for (let a = 1; a < t; a++) e[r][a] === e[r][a - 1] ? (i++, i === 5 ? n += 3 : i > 5 && n++) : i = 1;
+	}
+	for (let r = 0; r < t; r++) {
+		let i = 1;
+		for (let a = 1; a < t; a++) e[a][r] === e[a - 1][r] ? (i++, i === 5 ? n += 3 : i > 5 && n++) : i = 1;
+	}
+	for (let r = 0; r < t - 1; r++) for (let i = 0; i < t - 1; i++) {
+		let t = e[r][i];
+		t === e[r][i + 1] && t === e[r + 1][i] && t === e[r + 1][i + 1] && (n += 3);
+	}
+	return n;
+}
+function De(e) {
+	let t = ee.from(e, "utf-8"), n = ye(t.length), r = be(n), i = fe[n], a = pe[n], o = U[n], s = new _e();
+	s.put(V, 4), s.put(t.length, n <= 9 ? 8 : 16);
+	for (let e = 0; e < t.length; e++) s.put(t[e], 8);
+	let c = o - i * a, l = c * 8;
+	for (s.getLength() < l && s.put(0, Math.min(4, l - s.getLength())); s.getLength() % 8 != 0;) s.put(0, 1);
+	let u = [236, 17], d = 0;
+	for (; s.getLength() < l;) s.put(u[d % 2], 8), d++;
+	let f = [], p = s.getBuffer();
+	for (let e = 0; e < c; e++) {
+		let t = 0;
+		for (let n = 0; n < 8; n++) t = t << 1 | (p[e * 8 + n] || 0);
+		f.push(t);
+	}
+	let m = Math.floor(c / a), h = c % a, g = [], _ = [], v = 0;
+	for (let e = 0; e < a; e++) {
+		let t = m + +(e >= a - h), n = f.slice(v, v + t);
+		g.push(n), _.push(ve(n, i)), v += t;
+	}
+	let y = [], b = Math.max(...g.map((e) => e.length));
+	for (let e = 0; e < b; e++) for (let t of g) if (e < t.length) for (let n = 7; n >= 0; n--) y.push(t[e] >> n & 1);
+	for (let e = 0; e < i; e++) for (let t of _) if (e < t.length) for (let n = 7; n >= 0; n--) y.push(t[e] >> n & 1);
+	let x = q(r);
+	J(x, 0, 0), J(x, 0, r - 7), J(x, r - 7, 0), Y(x), Ce(x);
+	let S = me[n] || [];
+	for (let e = 0; e < S.length; e++) for (let t = 0; t < S.length; t++) {
+		let n = S[e], r = S[t];
+		x[n]?.[r] === null && Se(x, n, r);
+	}
+	let C = x.map((e) => [...e]);
+	Te(C, y);
+	let w = 0, T = Infinity;
+	for (let e = 0; e < 8; e++) {
+		let t = Ee(Q(C, x, e));
+		t < T && (T = t, w = e);
+	}
+	let E = Q(C, x, w), D = q(r);
+	J(D, 0, 0), J(D, 0, r - 7), J(D, r - 7, 0), Y(D), X(D, w), Z(D, n);
+	for (let e = 0; e < r; e++) for (let t = 0; t < r; t++) x[e][t] !== null && (E[e][t] = !!D[e][t]);
+	return X(E, w), n >= 7 && Z(E, n), E;
+}
+function Oe(e, t) {
+	let n = t?.quiet ?? 4, r = t?.invert ?? !1, i;
+	try {
+		i = De(e);
+	} catch {
+		return `  [QR: ${e}]`;
+	}
+	let a = i.length, o = a + n * 2, s = (e, t) => {
+		let r = e - n, o = t - n;
+		return r < 0 || r >= a || o < 0 || o >= a ? !1 : i[r][o];
+	}, c = [], l = !r;
+	for (let e = 0; e < o; e += 2) {
+		let t = "";
+		for (let n = 0; n < o; n++) {
+			let r = s(e, n), i = e + 1 < o ? s(e + 1, n) : !1;
+			r === l && i === l ? t += "█" : r === l && i !== l ? t += "▀" : r !== l && i === l ? t += "▄" : t += " ";
+		}
+		c.push(t);
+	}
+	return c.join("\n");
+}
+//#endregion
+//#region src/shared/index.ts
+var $ = {
+	checkboxOn: "◉",
+	checkboxOff: "◯",
+	radioOn: "●",
+	radioOff: "○",
+	cursor: "❯",
+	focusBar: "▌",
+	shadowCell: "▒",
+	barFull: "█",
+	barEmpty: "░",
+	barEighths: [
+		"▏",
+		"▎",
+		"▍",
+		"▌",
+		"▋",
+		"▊",
+		"▉"
+	],
+	check: "✔",
+	cross: "✖",
+	warn: "⚠",
+	info: "ℹ",
+	spinner: [
+		"⠋",
+		"⠙",
+		"⠹",
+		"⠸",
+		"⠼",
+		"⠴",
+		"⠦",
+		"⠧",
+		"⠇",
+		"⠏"
+	]
+}, ke = {
+	dots: $.spinner,
+	line: [
+		"—",
+		"\\",
+		"|",
+		"/"
+	],
+	arc: [
+		"◜",
+		"◠",
+		"◝",
+		"◞",
+		"◡",
+		"◟"
+	],
+	circle: [
+		"◐",
+		"◓",
+		"◑",
+		"◒"
+	],
+	bounce: [
+		"▁",
+		"▃",
+		"▄",
+		"▅",
+		"▆",
+		"▇",
+		"▆",
+		"▅",
+		"▄",
+		"▃"
+	],
+	moon: [
+		"🌑",
+		"🌒",
+		"🌓",
+		"🌔",
+		"🌕",
+		"🌖",
+		"🌗",
+		"🌘"
+	]
+}, Ae = 120, je = 50;
+//#endregion
+export { P as A, F as B, x as C, T as D, w as E, de as F, ie as G, oe as H, z as I, D as J, O as K, R as L, le as M, ce as N, Oe as O, N as P, I as R, b as S, C as T, se as U, ae as V, te as W, h as _, n as a, v as b, a as c, c as d, l as f, m as g, p as h, ke as i, ue as j, B as k, o as l, f as m, Ae as n, r as o, d as p, E as q, je as r, i as s, $ as t, s as u, g as v, S as w, y as x, _ as y, L as z };
+
+//# sourceMappingURL=shared-h5p-EcZV.js.map