minerva-design 1.5.0 → 1.6.1

package/dist/native/components/ShapeChart/geometry.js

@@ -262,14 +262,17 @@ function T(e, t, n, r, i) {
 function E(e, t, n) {
 	let { pts: r } = e;
 	if (r.length < 3) return [];
-	let a = c(r), o = [];
+	let a = c(r), u = [];
 	r.forEach((t, n) => {
-		let c = s(t, l(r, (n + 1) % r.length), a, e.internal[n] ? i : 0);
-		c && o.push(c);
-	}), o.push(...e.guards);
-	let u = Infinity, d = Infinity, f = -Infinity, p = -Infinity;
-	for (let e of r) u = Math.min(u, e[0]), d = Math.min(d, e[1]), f = Math.max(f, e[0]), p = Math.max(p, e[1]);
-	return t.t === "disc" && (u = Math.max(u, t.cx - t.r1), d = Math.max(d, t.cy - t.r1), f = Math.min(f, t.cx + t.r1), p = Math.min(p, t.cy + t.r1)), f > u && p > d ? T(o, t, n, a, 2 * Math.hypot(f - u, p - d) + i) : [];
+		let o = s(t, l(r, (n + 1) % r.length), a, e.internal[n] ? i : 0);
+		o && u.push(o);
+	}), u.push(...e.guards);
+	let d = Infinity, f = Infinity, p = -Infinity, m = -Infinity;
+	for (let e of r) d = Math.min(d, e[0]), f = Math.min(f, e[1]), p = Math.max(p, e[0]), m = Math.max(m, e[1]);
+	if (t.t === "disc" && (d = Math.max(d, t.cx - t.r1), f = Math.max(f, t.cy - t.r1), p = Math.min(p, t.cx + t.r1), m = Math.min(m, t.cy + t.r1)), !(p > d && m > f)) return [];
+	let h = 2 * Math.hypot(p - d, m - f) + i;
+	for (let t of e.guards) h = Math.max(h, o(t, a) + i);
+	return T(u, t, n, a, h);
 }
 function D(e) {
 	let t = e.filter((e) => e.t === "A");
@@ -484,16 +487,82 @@ function I(e, t, n = !1) {
 	if (r.length === 1 && i) {
 		let e = D(i.items);
 		if (e) return [P(e, t, n)];
-		let r = O(i.items);
-		if (r) return N(i.items, r.base, t) ?? j(i.items, r.base, t) ?? F(C(r.outline), r.base, t);
+		let r = O(i.items), a = r && (N(i.items, r.base, t) ?? j(i.items, r.base, t));
+		if (a) return a;
 	}
-	let a = r.map((e) => g(e.items, e.start)), [o, s] = a;
-	if (a.length === 2 && o && s && m(o) * m(s) < 0 && L(o, s)) return F(w(o, s), { t: "plane" }, t);
-	let c = [];
-	for (let e of a) c.push(...F(C(e), { t: "plane" }, t));
-	return c;
+	let a = [];
+	for (let e of L(r)) a.push(...F(e.pieces, e.base, t));
+	return a;
+}
+function L(e) {
+	let t = e[0];
+	if (e.length === 1 && t) {
+		let e = O(t.items);
+		if (e) return [{
+			pieces: C(e.outline),
+			base: e.base
+		}];
+	}
+	let n = e.map((e) => g(e.items, e.start)), [r, i] = n;
+	return n.length === 2 && r && i && m(r) * m(i) < 0 && H(r, i) ? [{
+		pieces: w(r, i),
+		base: { t: "plane" }
+	}] : n.map((e) => ({
+		pieces: C(e),
+		base: { t: "plane" }
+	}));
 }
-function L(e, t) {
+var R = 8, z = 240;
+function B(e, t, n, r) {
+	let i = e.pts, a = e.internal, o = (e) => {
+		let t = [], n = [];
+		i.forEach((r, o) => {
+			let s = l(i, (o + 1) % i.length), c = e(r), u = e(s), d = a[o] ?? !1, f = () => {
+				let e = c / (c - u);
+				return [r[0] + (s[0] - r[0]) * e, r[1] + (s[1] - r[1]) * e];
+			};
+			c >= 0 ? (t.push(r), n.push(d), u < 0 && (t.push(f()), n.push(!0))) : u >= 0 && (t.push(f()), n.push(d));
+		}), i = t, a = n;
+	}, s = (e) => t[0] * e[0] + t[1] * e[1];
+	Number.isFinite(n) && o((e) => s(e) - n), Number.isFinite(r) && o((e) => r - s(e));
+	let c = [], u = [];
+	for (i.forEach((e, t) => {
+		let n = c[c.length - 1];
+		n && d(n, e) <= .001 ? u[u.length - 1] = a[t] ?? !0 : (c.push(e), u.push(a[t] ?? !0));
+	}); c.length > 1 && d(l(c, 0), l(c, c.length - 1)) <= .001;) c.pop(), u.pop();
+	return c.length < 3 || Math.abs(m(c)) < .05 ? null : {
+		pts: c,
+		internal: u,
+		guards: e.guards
+	};
+}
+function V(e, t, n, r) {
+	let i = Math.hypot(n.x1 - n.x0, n.y1 - n.y0);
+	if (i < 2 || r < 8) return null;
+	let a = [(n.x1 - n.x0) / i, (n.y1 - n.y0) / i], o = a[0] * n.x0 + a[1] * n.y0, s = L(e.map((e) => ({
+		start: [e.x, e.y],
+		items: h(e, !0)
+	})).filter((e) => e.items.length > 0)), c = Infinity, l = -Infinity;
+	for (let e of s) for (let t of e.pieces) for (let e of t.pts) {
+		let t = a[0] * e[0] + a[1] * e[1] - o;
+		c = Math.min(c, t), l = Math.max(l, t);
+	}
+	let u = Math.min(Math.max(0, c), l), d = Math.min(Math.max(i, c), l), f = Math.min(R, Math.ceil(r / 20), Math.floor((d - u) / 6));
+	if (f < 2) return null;
+	let p = [], m = z;
+	for (let e = 0; e < f && m > 0; e++) {
+		let n = e === 0 ? -Infinity : o + u + (d - u) * e / f, r = e === f - 1 ? Infinity : o + u + (d - u) * (e + 1) / f, i = o + u + (d - u) * (e + .5) / f, c = t([a[0] * i, a[1] * i]);
+		for (let e of s) for (let t of e.pieces) {
+			if (m <= 0) break;
+			let i = t.pts.map((e) => a[0] * e[0] + a[1] * e[1]);
+			if (Math.max(...i) <= n || Math.min(...i) >= r) continue;
+			let o = B(t, a, n, r);
+			o && (m--, p.push(...E(o, e.base, c)));
+		}
+	}
+	return p;
+}
+function H(e, t) {
 	let n = (e) => {
 		let t = Infinity, n = Infinity, r = -Infinity, i = -Infinity;
 		for (let a of e) t = Math.min(t, a[0]), n = Math.min(n, a[1]), r = Math.max(r, a[0]), i = Math.max(i, a[1]);
@@ -506,7 +575,7 @@ function L(e, t) {
 	}, r = n(e), i = n(t);
 	return i.x0 >= r.x0 - .5 && i.y0 >= r.y0 - .5 && i.x1 <= r.x1 + .5 && i.y1 <= r.y1 + .5;
 }
-function R(e, t) {
+function U(e, t) {
 	let n = t.filter((e) => Number.isFinite(e) && e >= 0);
 	n.length % 2 && (n = [...n, ...n]);
 	let r = n.reduce((e, t) => e + t, 0);
@@ -523,7 +592,7 @@ function R(e, t) {
 	}
 	return u && f.length > 1 && o.push(f), o;
 }
-var z = (e, t, n, r, i) => {
+var W = (e, t, n, r, i) => {
 	let a = i === "butt" ? 0 : n, o = d(e, t) + a;
 	return {
 		t: "box",
@@ -535,7 +604,7 @@ var z = (e, t, n, r, i) => {
 		...i === "round" ? { radius: n / 2 } : null,
 		rotate: Math.atan2(t[1] - e[1], t[0] - e[0])
 	};
-}, B = (e, t, n) => ({
+}, G = (e, t, n) => ({
 	t: "box",
 	x: e[0] - t / 2,
 	y: e[1] - t / 2,
@@ -544,7 +613,7 @@ var z = (e, t, n, r, i) => {
 	radius: t / 2,
 	color: n
 });
-function V(e, t) {
+function K(e, t) {
 	let n = e.width, r = e.paths.map((e) => ({
 		start: [e.x, e.y],
 		items: h(e, e.closed),
@@ -557,7 +626,7 @@ function V(e, t) {
 		if (r.length === 1 && a && y(a)) return [A(a.cx, a.cy, a.r + n / 2, Math.max(0, a.r - n / 2), t([a.cx, a.cy]))];
 		if (r.length === 1 && a?.t === "A") {
 			let r = a.r + n / 2, o = a.r - n / 2, s = t([a.cx, a.cy]), c = {
-				...H(a.cx, a.cy, r, a.a0),
+				...q(a.cx, a.cy, r, a.a0),
 				closed: !0,
 				segs: [{
 					t: "A",
@@ -579,7 +648,7 @@ function V(e, t) {
 					y: a.cy
 				}]
 			}, l = e.cap === "round", u = O(h(c, !0)), d = u && j(h(c, !0), u.base, s, l ? i : 0) || I([c], s);
-			return l && d.push(B(f(a.cx, a.cy, a.r, a.a0), n, s), B(f(a.cx, a.cy, a.r, a.a1), n, s)), d;
+			return l && d.push(G(f(a.cx, a.cy, a.r, a.a0), n, s), G(f(a.cx, a.cy, a.r, a.a1), n, s)), d;
 		}
 		if (o.closed) {
 			let e = D(r);
@@ -599,7 +668,7 @@ function V(e, t) {
 	for (let i of r) {
 		let r = g(i.items, i.start, .25), a = _(i.closed ? [...r, l(r, 0)] : r, !1);
 		if (a.length < 2) continue;
-		let o = e.dash.length ? R(a, e.dash) : [a];
+		let o = e.dash.length ? U(a, e.dash) : [a];
 		for (let r of o) {
 			let i = r.length, a = i > 2 && d(l(r, 0), l(r, i - 1)) < .001, o = Array(i).fill(0), c = [];
 			if (e.cap !== "round" && n >= 1.5) for (let t = +!a; t < i - 1; t++) {
@@ -613,24 +682,24 @@ function V(e, t) {
 					i = [i[0] - e * f, i[1] - t * f], c = [c[0] + e * p, c[1] + t * p];
 				}
 				let m = [(i[0] + c[0]) / 2, (i[1] + c[1]) / 2];
-				s.push(z(i, c, n, t(m), e.cap));
+				s.push(W(i, c, n, t(m), e.cap));
 			}
-			for (let e of c) s.push(B(l(r, e), n, t(l(r, e))));
+			for (let e of c) s.push(G(l(r, e), n, t(l(r, e))));
 		}
 	}
 	return s;
 }
-var H = (e, t, n, r) => {
+var q = (e, t, n, r) => {
 	let [i, a] = f(e, t, n, r);
 	return {
 		x: i,
 		y: a
 	};
-}, U = (e, t) => e.length ? t >= .999 ? e : [{
+}, J = (e, t) => e.length ? t >= .999 ? e : [{
 	t: "group",
 	opacity: t,
 	children: e
-}] : [], W = (e) => {
+}] : [], Y = (e) => {
 	let t = Infinity, n = Infinity, r = -Infinity, i = -Infinity;
 	for (let a of e) {
 		let e = (e, a) => {
@@ -641,20 +710,35 @@ var H = (e, t, n, r) => {
 	}
 	return Number.isFinite(t) ? [(t + r) / 2, (n + i) / 2] : [0, 0];
 };
-function G(e) {
-	let r = n(e.paint, ...W(e.paths)), i = r.a * e.alpha;
-	return i <= .002 ? [] : U(I(e.paths, t(r), e.shadow), i);
+function X(r) {
+	let { paint: i } = r, a = i.gradient?.stops ?? [];
+	if (i.gradient && a.length > 1) {
+		let o = Math.max(...a.map((e) => e.color.a)), s = o * r.alpha;
+		if (s <= .002) return [];
+		let c = 0;
+		for (let e of a) {
+			let t = a[0]?.color ?? e.color;
+			c = Math.max(c, Math.abs(e.color.r - t.r), Math.abs(e.color.g - t.g), Math.abs(e.color.b - t.b), Math.abs(e.color.a - t.a) * 255);
+		}
+		let l = V(r.paths, (r) => {
+			let a = n(i, r[0], r[1]);
+			return o > 0 && a.a < o - .001 ? e(a, 1 / o) : t(a);
+		}, i.gradient, c);
+		if (l) return J(l, s);
+	}
+	let o = n(i, ...Y(r.paths)), s = o.a * r.alpha;
+	return s <= .002 ? [] : J(I(r.paths, t(o), r.shadow), s);
 }
-function K(r) {
+function Z(r) {
 	let { paint: i } = r, a = i.color.a;
 	i.gradient?.stops.length && (a = Math.max(...i.gradient.stops.map((e) => e.color.a)));
 	let o = a * r.alpha;
-	return o <= .002 ? [] : U(V(r, (r) => {
+	return o <= .002 ? [] : J(K(r, (r) => {
 		let o = n(i, r[0], r[1]);
 		return i.gradient && a > 0 && o.a < a - .001 ? e(o, 1 / a) : t(o);
 	}), o);
 }
-function q(t) {
+function Q(t) {
 	return !t.text || t.alpha * t.color.a <= .002 ? [] : [{
 		t: "text",
 		text: t.text,
@@ -670,12 +754,12 @@ function q(t) {
 		...t.halo ? { halo: e(t.halo, t.alpha) } : null
 	}];
 }
-function J(e) {
+function $(e) {
 	let t = [];
-	for (let n of e) n.kind === "fill" ? t.push(...G(n)) : n.kind === "stroke" ? t.push(...K(n)) : t.push(...q(n));
+	for (let n of e) n.kind === "fill" ? t.push(...X(n)) : n.kind === "stroke" ? t.push(...Z(n)) : t.push(...Q(n));
 	return t;
 }
 //#endregion
-export { m as area, C as convexPieces, R as dashPolyline, J as framePrims, S as mergeConvex, I as regionViews, b as triangulate };
+export { m as area, C as convexPieces, U as dashPolyline, $ as framePrims, S as mergeConvex, I as regionViews, b as triangulate };
 
 //# sourceMappingURL=geometry.js.map