@sheetxl/sdk 0.8.0-beta.10 → 0.8.0-beta.11

package/node/esm/{CImNvdz1iP-lUlro.mjs → BIRq1kT7lLRzns9t.mjs}

@@ -1,63 +1,63 @@
 /**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.10
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.11
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.
 */
-import { n as t } from "./BH1v-E4Ro3bR7Znw.mjs";
-var n = 2 * Math.PI;
-function c(t, n) {
-	const c = Math.cos(n), e = Math.sin(n), s = Math.cos(t.phi), y = Math.sin(t.phi);
+import { t } from "./Bbf1Pm9Gk7YpLTvg.mjs";
+var c = 2 * Math.PI;
+function n(t, c) {
+	const n = Math.cos(c), e = Math.sin(c), s = Math.cos(t.phi), y = Math.sin(t.phi);
 	return {
-		x: t.cx + t.rx * c * s - t.ry * e * y,
-		y: t.cy + t.rx * c * y + t.ry * e * s
+		x: t.cx + t.rx * n * s - t.ry * e * y,
+		y: t.cy + t.rx * n * y + t.ry * e * s
 	};
 }
-function e(t, n) {
+function e(t, c) {
 	switch (t.k) {
 		case "L": return {
-			x: t.x0 + (t.x1 - t.x0) * n,
-			y: t.y0 + (t.y1 - t.y0) * n
+			x: t.x0 + (t.x1 - t.x0) * c,
+			y: t.y0 + (t.y1 - t.y0) * c
 		};
 		case "Q": {
-			const c = 1 - n;
+			const n = 1 - c;
 			return {
-				x: c * c * t.x0 + 2 * c * n * t.cx + n * n * t.x1,
-				y: c * c * t.y0 + 2 * c * n * t.cy + n * n * t.y1
+				x: n * n * t.x0 + 2 * n * c * t.cx + c * c * t.x1,
+				y: n * n * t.y0 + 2 * n * c * t.cy + c * c * t.y1
 			};
 		}
 		case "C": {
-			const c = 1 - n, e = c * c * c, s = 3 * c * c * n, y = 3 * c * n * n, x = n * n * n;
+			const n = 1 - c, e = n * n * n, s = 3 * n * n * c, y = 3 * n * c * c, x = c * c * c;
 			return {
 				x: e * t.x0 + s * t.c1x + y * t.c2x + x * t.x1,
 				y: e * t.y0 + s * t.c1y + y * t.c2y + x * t.y1
 			};
 		}
-		case "A": return c(t, t.t0 + t.dt * n);
+		case "A": return n(t, t.t0 + t.dt * c);
 	}
 }
-function s(t, n) {
+function s(t, c) {
 	switch (t.k) {
 		case "L": return {
 			x: t.x1 - t.x0,
 			y: t.y1 - t.y0
 		};
 		case "Q": {
-			const c = 1 - n;
+			const n = 1 - c;
 			return {
-				x: 2 * c * (t.cx - t.x0) + 2 * n * (t.x1 - t.cx),
-				y: 2 * c * (t.cy - t.y0) + 2 * n * (t.y1 - t.cy)
+				x: 2 * n * (t.cx - t.x0) + 2 * c * (t.x1 - t.cx),
+				y: 2 * n * (t.cy - t.y0) + 2 * c * (t.y1 - t.cy)
 			};
 		}
 		case "C": {
-			const c = 1 - n;
+			const n = 1 - c;
 			return {
-				x: 3 * c * c * (t.c1x - t.x0) + 6 * c * n * (t.c2x - t.c1x) + 3 * n * n * (t.x1 - t.c2x),
-				y: 3 * c * c * (t.c1y - t.y0) + 6 * c * n * (t.c2y - t.c1y) + 3 * n * n * (t.y1 - t.c2y)
+				x: 3 * n * n * (t.c1x - t.x0) + 6 * n * c * (t.c2x - t.c1x) + 3 * c * c * (t.x1 - t.c2x),
+				y: 3 * n * n * (t.c1y - t.y0) + 6 * n * c * (t.c2y - t.c1y) + 3 * c * c * (t.y1 - t.c2y)
 			};
 		}
 		case "A": {
-			const c = t.t0 + t.dt * n, e = Math.cos(c), s = Math.sin(c), y = Math.cos(t.phi), x = Math.sin(t.phi), r = t.dt < 0 ? -1 : 1;
+			const n = t.t0 + t.dt * c, e = Math.cos(n), s = Math.sin(n), y = Math.cos(t.phi), x = Math.sin(t.phi), r = t.dt < 0 ? -1 : 1;
 			return {
 				x: r * (-t.rx * s * y - t.ry * e * x),
 				y: r * (-t.rx * s * x + t.ry * e * y)
@@ -67,86 +67,86 @@ function s(t, n) {
 }
 var y = /* @__PURE__ */ new WeakMap();
 function x(t) {
-	let n = y.get(t);
-	if (n) return n;
+	let c = y.get(t);
+	if (c) return c;
 	if ("L" === t.k) {
-		const c = Math.hypot(t.x1 - t.x0, t.y1 - t.y0);
-		n = {
-			cum: new Float64Array([0, c]),
-			total: c
+		const n = Math.hypot(t.x1 - t.x0, t.y1 - t.y0);
+		c = {
+			cum: new Float64Array([0, n]),
+			total: n
 		};
 	} else {
-		const c = function(t) {
-			let n;
+		const n = function(t) {
+			let c;
 			switch (t.k) {
 				case "Q":
-					n = Math.hypot(t.cx - t.x0, t.cy - t.y0) + Math.hypot(t.x1 - t.cx, t.y1 - t.cy);
+					c = Math.hypot(t.cx - t.x0, t.cy - t.y0) + Math.hypot(t.x1 - t.cx, t.y1 - t.cy);
 					break;
 				case "C":
-					n = Math.hypot(t.c1x - t.x0, t.c1y - t.y0) + Math.hypot(t.c2x - t.c1x, t.c2y - t.c1y) + Math.hypot(t.x1 - t.c2x, t.y1 - t.c2y);
+					c = Math.hypot(t.c1x - t.x0, t.c1y - t.y0) + Math.hypot(t.c2x - t.c1x, t.c2y - t.c1y) + Math.hypot(t.x1 - t.c2x, t.y1 - t.c2y);
 					break;
 				case "A":
-					n = Math.abs(t.dt) * Math.max(t.rx, t.ry);
+					c = Math.abs(t.dt) * Math.max(t.rx, t.ry);
 					break;
-				default: n = 0;
+				default: c = 0;
 			}
-			return Math.min(256, Math.max(32, Math.ceil(n)));
-		}(t), s = new Float64Array(c + 1);
+			return Math.min(256, Math.max(32, Math.ceil(c)));
+		}(t), s = new Float64Array(n + 1);
 		let y = e(t, 0);
-		for (let n = 1; n <= c; n++) {
-			const x = e(t, n / c);
-			s[n] = s[n - 1] + Math.hypot(x.x - y.x, x.y - y.y), y = x;
+		for (let c = 1; c <= n; c++) {
+			const x = e(t, c / n);
+			s[c] = s[c - 1] + Math.hypot(x.x - y.x, x.y - y.y), y = x;
 		}
-		n = {
+		c = {
 			cum: s,
-			total: s[c]
+			total: s[n]
 		};
 	}
-	return y.set(t, n), n;
+	return y.set(t, c), c;
 }
 function r(t) {
 	return x(t).total;
 }
-function o(t, n) {
-	const { cum: c, total: e } = x(t);
+function o(t, c) {
+	const { cum: n, total: e } = x(t);
 	if (!(e > 0)) return 0;
-	if (n <= 0) return 0;
-	if (n >= e) return 1;
-	const s = c.length - 1;
+	if (c <= 0) return 0;
+	if (c >= e) return 1;
+	const s = n.length - 1;
 	let y = 0, r = s;
 	for (; r - y > 1;) {
 		const t = y + r >> 1;
-		c[t] <= n ? y = t : r = t;
+		n[t] <= c ? y = t : r = t;
 	}
-	const o = c[r] - c[y];
-	return (y + (o > 0 ? (n - c[y]) / o : 0)) / s;
+	const o = n[r] - n[y];
+	return (y + (o > 0 ? (c - n[y]) / o : 0)) / s;
 }
-var a = (t, n, c) => t + (n - t) * c;
-function i(t, n) {
+var a = (t, c, n) => t + (c - t) * n;
+function i(t, c) {
 	switch (t.k) {
 		case "L": {
-			const c = e(t, n);
+			const n = e(t, c);
 			return [{
 				k: "L",
 				x0: t.x0,
 				y0: t.y0,
-				x1: c.x,
-				y1: c.y
+				x1: n.x,
+				y1: n.y
 			}, {
 				k: "L",
-				x0: c.x,
-				y0: c.y,
+				x0: n.x,
+				y0: n.y,
 				x1: t.x1,
 				y1: t.y1
 			}];
 		}
 		case "Q": {
-			const c = a(t.x0, t.cx, n), e = a(t.y0, t.cy, n), s = a(t.cx, t.x1, n), y = a(t.cy, t.y1, n), x = a(c, s, n), r = a(e, y, n);
+			const n = a(t.x0, t.cx, c), e = a(t.y0, t.cy, c), s = a(t.cx, t.x1, c), y = a(t.cy, t.y1, c), x = a(n, s, c), r = a(e, y, c);
 			return [{
 				k: "Q",
 				x0: t.x0,
 				y0: t.y0,
-				cx: c,
+				cx: n,
 				cy: e,
 				x1: x,
 				y1: r
@@ -161,12 +161,12 @@ function i(t, n) {
 			}];
 		}
 		case "C": {
-			const c = a(t.x0, t.c1x, n), e = a(t.y0, t.c1y, n), s = a(t.c1x, t.c2x, n), y = a(t.c1y, t.c2y, n), x = a(t.c2x, t.x1, n), r = a(t.c2y, t.y1, n), o = a(c, s, n), i = a(e, y, n), h = a(s, x, n), u = a(y, r, n), l = a(o, h, n), p = a(i, u, n);
+			const n = a(t.x0, t.c1x, c), e = a(t.y0, t.c1y, c), s = a(t.c1x, t.c2x, c), y = a(t.c1y, t.c2y, c), x = a(t.c2x, t.x1, c), r = a(t.c2y, t.y1, c), o = a(n, s, c), i = a(e, y, c), h = a(s, x, c), u = a(y, r, c), l = a(o, h, c), p = a(i, u, c);
 			return [{
 				k: "C",
 				x0: t.x0,
 				y0: t.y0,
-				c1x: c,
+				c1x: n,
 				c1y: e,
 				c2x: o,
 				c2y: i,
@@ -185,16 +185,16 @@ function i(t, n) {
 			}];
 		}
 		case "A": {
-			const e = c(t, t.t0 + t.dt * n);
+			const e = n(t, t.t0 + t.dt * c);
 			return [{
 				...t,
-				dt: t.dt * n,
+				dt: t.dt * c,
 				x1: e.x,
 				y1: e.y
 			}, {
 				...t,
-				t0: t.t0 + t.dt * n,
-				dt: t.dt * (1 - n),
+				t0: t.t0 + t.dt * c,
+				dt: t.dt * (1 - c),
 				x0: e.x,
 				y0: e.y
 			}];
@@ -206,13 +206,13 @@ var h = (t) => ({
 	y: t.y1
 });
 function u(t) {
-	let n = 0;
-	for (const c of t.segments) n += r(c);
-	return n;
+	let c = 0;
+	for (const n of t.segments) c += r(n);
+	return c;
 }
-function l(t, n) {
-	const c = t.segments;
-	if (0 === c.length) return {
+function l(t, c) {
+	const n = t.segments;
+	if (0 === n.length) return {
 		point: {
 			x: t.x,
 			y: t.y
@@ -222,19 +222,19 @@ function l(t, n) {
 			y: 0
 		}
 	};
-	let y = Math.max(0, n);
-	for (let t = 0; t < c.length; t++) {
-		const n = c[t], x = r(n);
-		if (y <= x || t === c.length - 1) {
-			const t = o(n, Math.min(y, x));
+	let y = Math.max(0, c);
+	for (let t = 0; t < n.length; t++) {
+		const c = n[t], x = r(c);
+		if (y <= x || t === n.length - 1) {
+			const t = o(c, Math.min(y, x));
 			return {
-				point: e(n, t),
-				tangent: s(n, t)
+				point: e(c, t),
+				tangent: s(c, t)
 			};
 		}
 		y -= x;
 	}
-	const x = c[c.length - 1];
+	const x = n[n.length - 1];
 	return {
 		point: h(x),
 		tangent: s(x, 1)
@@ -245,61 +245,61 @@ var p = () => ({
 	t: 1 / 0,
 	r: -1 / 0,
 	b: -1 / 0
-}), f = (t, n, c) => {
-	n < t.l && (t.l = n), n > t.r && (t.r = n), c < t.t && (t.t = c), c > t.b && (t.b = c);
-}, M = (t, n, c) => {
+}), f = (t, c, n) => {
+	c < t.l && (t.l = c), c > t.r && (t.r = c), n < t.t && (t.t = n), n > t.b && (t.b = n);
+}, M = (t, c, n) => {
 	const e = [], s = (t) => {
 		t > 0 && t < 1 && e.push(t);
 	};
-	if (Math.abs(t) < 1e-12) return Math.abs(n) > 1e-12 && s(-c / n), e;
-	const y = n * n - 4 * t * c;
+	if (Math.abs(t) < 1e-12) return Math.abs(c) > 1e-12 && s(-n / c), e;
+	const y = c * c - 4 * t * n;
 	if (y < 0) return e;
 	const x = Math.sqrt(y);
-	return s((-n + x) / (2 * t)), s((-n - x) / (2 * t)), e;
-}, m = (t, c) => {
+	return s((-c + x) / (2 * t)), s((-c - x) / (2 * t)), e;
+}, m = (t, n) => {
 	const e = Math.abs(t.dt);
-	return e >= n || ((t.dt >= 0 ? c - t.t0 : t.t0 - c) % n + n) % n <= e;
+	return e >= c || ((t.dt >= 0 ? n - t.t0 : t.t0 - n) % c + c) % c <= e;
 };
-function d(t, n) {
-	switch (f(t, n.x0, n.y0), f(t, n.x1, n.y1), n.k) {
+function d(t, c) {
+	switch (f(t, c.x0, c.y0), f(t, c.x1, c.y1), c.k) {
 		case "L": return;
 		case "Q":
-			for (const c of M(0, 2 * (n.x0 - 2 * n.cx + n.x1), 2 * (n.cx - n.x0))) {
-				const s = e(n, c);
+			for (const n of M(0, 2 * (c.x0 - 2 * c.cx + c.x1), 2 * (c.cx - c.x0))) {
+				const s = e(c, n);
 				f(t, s.x, s.y);
 			}
-			for (const c of M(0, 2 * (n.y0 - 2 * n.cy + n.y1), 2 * (n.cy - n.y0))) {
-				const s = e(n, c);
+			for (const n of M(0, 2 * (c.y0 - 2 * c.cy + c.y1), 2 * (c.cy - c.y0))) {
+				const s = e(c, n);
 				f(t, s.x, s.y);
 			}
 			return;
 		case "C": {
-			const c = (t, n, c, e) => M(3 * n - t - 3 * c + e, 2 * (t - 2 * n + c), n - t);
-			for (const s of [...c(n.x0, n.c1x, n.c2x, n.x1), ...c(n.y0, n.c1y, n.c2y, n.y1)]) {
-				const c = e(n, s);
-				f(t, c.x, c.y);
+			const n = (t, c, n, e) => M(3 * c - t - 3 * n + e, 2 * (t - 2 * c + n), c - t);
+			for (const s of [...n(c.x0, c.c1x, c.c2x, c.x1), ...n(c.y0, c.c1y, c.c2y, c.y1)]) {
+				const n = e(c, s);
+				f(t, n.x, n.y);
 			}
 			return;
 		}
 		case "A": {
-			const e = Math.cos(n.phi), s = Math.sin(n.phi), y = [Math.atan2(-n.ry * s, n.rx * e), Math.atan2(n.ry * e, n.rx * s)];
-			for (const e of y) for (const s of [e, e + Math.PI]) if (m(n, s)) {
-				const e = c(n, s);
+			const e = Math.cos(c.phi), s = Math.sin(c.phi), y = [Math.atan2(-c.ry * s, c.rx * e), Math.atan2(c.ry * e, c.rx * s)];
+			for (const e of y) for (const s of [e, e + Math.PI]) if (m(c, s)) {
+				const e = n(c, s);
 				f(t, e.x, e.y);
 			}
 			return;
 		}
 	}
 }
-function g(t, n) {
-	for (const c of n) {
-		f(t, c.x, c.y);
-		for (const n of c.segments) d(t, n);
+function g(t, c) {
+	for (const n of c) {
+		f(t, n.x, n.y);
+		for (const c of n.segments) d(t, c);
 	}
 	return t;
 }
 function $(e, s) {
-	const y = [], x = (n) => t(n, s);
+	const y = [], x = (c) => t(c, s);
 	for (const t of e) {
 		t.implicit || y.push(`M${x(t.x)} ${x(t.y)}`);
 		for (const e of t.segments) switch (e.k) {
@@ -314,12 +314,12 @@ function $(e, s) {
 				break;
 			case "A": {
 				const t = x(e.rx), s = x(e.ry), r = x(180 * e.phi / Math.PI), o = e.dt > 0 ? 1 : 0;
-				if (Math.abs(e.dt) >= n) {
-					const n = c(e, e.t0 + e.dt / 2);
-					y.push(`A${t} ${s} ${r} 0 ${o} ${x(n.x)} ${x(n.y)}`), y.push(`A${t} ${s} ${r} 0 ${o} ${x(e.x1)} ${x(e.y1)}`);
+				if (Math.abs(e.dt) >= c) {
+					const c = n(e, e.t0 + e.dt / 2);
+					y.push(`A${t} ${s} ${r} 0 ${o} ${x(c.x)} ${x(c.y)}`), y.push(`A${t} ${s} ${r} 0 ${o} ${x(e.x1)} ${x(e.y1)}`);
 				} else {
-					const n = Math.abs(e.dt) > Math.PI + 1e-9 ? 1 : 0;
-					y.push(`A${t} ${s} ${r} ${n} ${o} ${x(e.x1)} ${x(e.y1)}`);
+					const c = Math.abs(e.dt) > Math.PI + 1e-9 ? 1 : 0;
+					y.push(`A${t} ${s} ${r} ${c} ${o} ${x(e.x1)} ${x(e.y1)}`);
 				}
 				break;
 			}
@@ -341,10 +341,10 @@ var k = 192 / 72, b = {
 	med: 1.75,
 	lg: 2.5
 }, L = (t) => {
-	const n = [];
-	for (let c = 1; c < t.length; c++) {
-		const [e, s] = t[c - 1], [y, x] = t[c];
-		n.push({
+	const c = [];
+	for (let n = 1; n < t.length; n++) {
+		const [e, s] = t[n - 1], [y, x] = t[n];
+		c.push({
 			k: "L",
 			x0: e,
 			y0: s,
@@ -355,37 +355,37 @@ var k = 192 / 72, b = {
 	return {
 		x: t[0][0],
 		y: t[0][1],
-		segments: n,
+		segments: c,
 		closed: !0
 	};
 };
-function v(t, n) {
-	const c = t?.type;
-	if (!c || "none" === c) return null;
+function v(t, c) {
+	const n = t?.type;
+	if (!n || "none" === n) return null;
 	const e = t?.length ?? "med", s = t?.width ?? "med";
-	if ("arrow" === c) return function(t, n, c) {
-		const e = Math.max(t, k), s = w[n] * e, y = A[c] * e, x = Math.atan(y / s), r = Math.hypot(s, y), o = t / (2 * Math.sin(x / 2)), a = t / 2, i = Math.cos(x), h = Math.sin(x), u = o / 2, l = (t, n) => ({
+	if ("arrow" === n) return function(t, c, n) {
+		const e = Math.max(t, k), s = w[c] * e, y = A[n] * e, x = Math.atan(y / s), r = Math.hypot(s, y), o = t / (2 * Math.sin(x / 2)), a = t / 2, i = Math.cos(x), h = Math.sin(x), u = o / 2, l = (t, c) => ({
 			x: t + u,
-			y: n
-		}), p = l(-o / 2, 0), f = l(r * i - a * h, -r * h - a * i), M = l(r * i, -r * h), m = l(r * i + a * h, -r * h + a * i), d = l(o / 2, 0), g = l(r * i + a * h, r * h - a * i), $ = l(r * i, r * h), b = l(r * i - a * h, r * h + a * i), L = (t, n) => ({
+			y: c
+		}), p = l(-o / 2, 0), f = l(r * i - a * h, -r * h - a * i), M = l(r * i, -r * h), m = l(r * i + a * h, -r * h + a * i), d = l(o / 2, 0), g = l(r * i + a * h, r * h - a * i), $ = l(r * i, r * h), b = l(r * i - a * h, r * h + a * i), L = (t, c) => ({
 			k: "L",
 			x0: t.x,
 			y0: t.y,
-			x1: n.x,
-			y1: n.y
-		}), v = (t, n, c) => ({
+			x1: c.x,
+			y1: c.y
+		}), v = (t, c, n) => ({
 			k: "A",
 			cx: t.x,
 			cy: t.y,
 			rx: a,
 			ry: a,
 			phi: 0,
-			t0: Math.atan2(n.y - t.y, n.x - t.x),
+			t0: Math.atan2(c.y - t.y, c.x - t.x),
 			dt: Math.PI,
-			x0: n.x,
-			y0: n.y,
-			x1: c.x,
-			y1: c.y
+			x0: c.x,
+			y0: c.y,
+			x1: n.x,
+			y1: n.y
 		});
 		return {
 			outline: [{
@@ -404,9 +404,9 @@ function v(t, n) {
 			clip: o / 2,
 			sample: o / 2
 		};
-	}(n, e, s);
-	const y = Math.max(n, k), x = b[e] * y, r = b[s] * y;
-	switch (c) {
+	}(c, e, s);
+	const y = Math.max(c, k), x = b[e] * y, r = b[s] * y;
+	switch (n) {
 		case "triangle": return {
 			outline: [L([
 				[0, 0],
@@ -475,28 +475,28 @@ function v(t, n) {
 	}
 	var o, a;
 }
-function C(t, n, c, e) {
-	if (!(n.clip > 0)) return t;
+function C(t, c, n, e) {
+	if (!(c.clip > 0)) return t;
 	const s = u(t);
-	let y = s - n.clip > 0 ? n.clip : s;
-	return y += e, y >= s && (y = s - .26), function(t, n, c) {
-		if (!(n > .26) || 0 === t.segments.length) return t;
-		const e = c ? t.segments : [...t.segments].reverse(), s = [];
-		let y = n;
+	let y = s - c.clip > 0 ? c.clip : s;
+	return y += e, y >= s && (y = s - .26), function(t, c, n) {
+		if (!(c > .26) || 0 === t.segments.length) return t;
+		const e = n ? t.segments : [...t.segments].reverse(), s = [];
+		let y = c;
 		for (const t of e) {
 			if (y > .26) {
-				const n = r(t);
-				if (n <= y) {
-					y -= n;
+				const c = r(t);
+				if (c <= y) {
+					y -= c;
 					continue;
 				}
-				const [e, x] = i(t, o(t, c ? y : n - y));
-				s.push(c ? x : e), y = 0;
+				const [e, x] = i(t, o(t, n ? y : c - y));
+				s.push(n ? x : e), y = 0;
 				continue;
 			}
 			s.push(t);
 		}
-		const x = c ? s : s.reverse(), a = x.length > 0 ? {
+		const x = n ? s : s.reverse(), a = x.length > 0 ? {
 			x: (h = x[0]).x0,
 			y: h.y0
 		} : {
@@ -511,53 +511,53 @@ function C(t, n, c, e) {
 			closed: t.closed
 		};
 		return t.implicit && (u.implicit = !0), u;
-	}(t, y, c);
+	}(t, y, n);
 }
-function Q(t, n, c) {
-	const e = u(t), s = l(t, c ? 0 : e);
+function Q(t, c, n) {
+	const e = u(t), s = l(t, n ? 0 : e);
 	let y;
-	if (n.sample > 0) {
-		const x = l(t, c ? Math.min(n.sample, e) : n.sample < e ? e - n.sample : 0).point;
+	if (c.sample > 0) {
+		const x = l(t, n ? Math.min(c.sample, e) : c.sample < e ? e - c.sample : 0).point;
 		y = Math.atan2(x.y - s.point.y, x.x - s.point.x);
 	} else y = Math.atan2(s.tangent.y, s.tangent.x);
-	return n.outline.map((t) => function(t, n, c, e, s = !1) {
+	return c.outline.map((t) => function(t, c, n, e, s = !1) {
 		const y = Math.cos(e), x = Math.sin(e), r = s ? -1 : 1, o = (t, e) => ({
-			x: n + t * y - e * r * x,
-			y: c + t * x + e * r * y
+			x: c + t * y - e * r * x,
+			y: n + t * x + e * r * y
 		}), a = t.segments.map((t) => {
-			const n = o(t.x0, t.y0), c = o(t.x1, t.y1);
+			const c = o(t.x0, t.y0), n = o(t.x1, t.y1);
 			switch (t.k) {
 				case "L": return {
 					k: "L",
-					x0: n.x,
-					y0: n.y,
-					x1: c.x,
-					y1: c.y
+					x0: c.x,
+					y0: c.y,
+					x1: n.x,
+					y1: n.y
 				};
 				case "Q": {
 					const e = o(t.cx, t.cy);
 					return {
 						k: "Q",
-						x0: n.x,
-						y0: n.y,
+						x0: c.x,
+						y0: c.y,
 						cx: e.x,
 						cy: e.y,
-						x1: c.x,
-						y1: c.y
+						x1: n.x,
+						y1: n.y
 					};
 				}
 				case "C": {
 					const e = o(t.c1x, t.c1y), s = o(t.c2x, t.c2y);
 					return {
 						k: "C",
-						x0: n.x,
-						y0: n.y,
+						x0: c.x,
+						y0: c.y,
 						c1x: e.x,
 						c1y: e.y,
 						c2x: s.x,
 						c2y: s.y,
-						x1: c.x,
-						y1: c.y
+						x1: n.x,
+						y1: n.y
 					};
 				}
 				case "A": {
@@ -571,10 +571,10 @@ function Q(t, n, c) {
 						phi: s ? e - t.phi : e + t.phi,
 						t0: s ? -t.t0 : t.t0,
 						dt: s ? -t.dt : t.dt,
-						x0: n.x,
-						y0: n.y,
-						x1: c.x,
-						y1: c.y
+						x0: c.x,
+						y0: c.y,
+						x1: n.x,
+						y1: n.y
 					};
 				}
 			}
@@ -585,22 +585,22 @@ function Q(t, n, c) {
 			segments: a,
 			closed: t.closed
 		};
-	}(t, s.point.x, s.point.y, y, !c));
+	}(t, s.point.x, s.point.y, y, !n));
 }
-function I(t, n) {
-	const c = v(n.head, n.width), e = v(n.tail, n.width);
-	if (!c && !e) return null;
-	const s = "square" === n.cap ? n.width / 2 : 0, y = [];
+function I(t, c) {
+	const n = v(c.head, c.width), e = v(c.tail, c.width);
+	if (!n && !e) return null;
+	const s = "square" === c.cap ? c.width / 2 : 0, y = [];
 	let x = !1;
 	const r = t.map((t) => {
 		if (!function(t) {
 			if (t.closed || 0 === t.segments.length) return !1;
-			const n = h(t.segments[t.segments.length - 1]);
-			return Math.abs(n.x - t.x) > 1e-6 || Math.abs(n.y - t.y) > 1e-6;
+			const c = h(t.segments[t.segments.length - 1]);
+			return Math.abs(c.x - t.x) > 1e-6 || Math.abs(c.y - t.y) > 1e-6;
 		}(t)) return t;
 		x = !0;
-		let n = t;
-		return c && (y.push(...Q(n, c, !0)), n = C(n, c, !0, s)), e && (y.push(...Q(n, e, !1)), n = C(n, e, !1, s)), n;
+		let c = t;
+		return n && (y.push(...Q(c, n, !0)), c = C(c, n, !0, s)), e && (y.push(...Q(c, e, !1)), c = C(c, e, !1, s)), c;
 	});
 	return x ? {
 		stroke: r,

package/node/esm/{CD9wbvufChVYYkrI.mjs → BIwObuhTJYf0jpUa.mjs}

@@ -1,10 +1,10 @@
 /**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.10
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.11
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.
 */
-import { i as t, n as e, r as n, t as r } from "./CImNvdz1iP-lUlro.mjs";
+import { i as t, n as e, r as n, t as r } from "./BIRq1kT7lLRzns9t.mjs";
 var s = 6e4, a = Math.PI / 180 / s, c = 108e5 / Math.PI, o = /^[+-]?\d+$/, u = (t) => o.test(t) ? Number(t) : t, i = /* @__PURE__ */ new WeakMap();
 function h(t) {
 	let e = i.get(t);

package/node/esm/Bbf1Pm9Gk7YpLTvg.mjs

@@ -0,0 +1,12 @@
+/**
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.11
+*
+* (C) 2026-present SheetXL Inc. & Michael T. Ford
+* License: The license can be found at https://www.sheetxl.com/license.
+*/
+function e(e, t) {
+	if (!Number.isFinite(e)) return "0";
+	let i = e.toFixed(t);
+	return i.indexOf(".") >= 0 && (i = i.replace(/\.?0+$/, "")), "-0" === i ? "0" : i;
+}
+export { e as t };