@unicom-cloud/ui 0.8.168 → 0.8.170

package/draw/element/elbowArrow.js

@@ -0,0 +1,555 @@
+/* 潘启宝 2026-06-25 17:54:57 星期四 山东省济南市 */
+import { BinaryHeap as e } from "../common/binary-heap.js";
+import { clamp as t } from "../libs/math/utils.js";
+import { vector as n, vectorCross as r, vectorFromPoint as i, vectorScale as a } from "../libs/math/vector.js";
+import { pointDistance as o, pointFrom as s, pointScaleFromOrigin as c, pointTranslate as l, pointsEqual as u } from "../libs/math/point.js";
+import "../libs/math/index.js";
+import { getSizeFromPoints as d } from "../common/points.js";
+import { arrayToMap as f, invariant as p, isAnyTrue as m, isDevEnv as h } from "../common/utils.js";
+import "../common/index.js";
+import { HEADING_DOWN as g, HEADING_LEFT as _, HEADING_RIGHT as v, HEADING_UP as y, compareHeading as b, flipHeading as x, headingForPoint as S, headingForPointIsHorizontal as C, headingIsHorizontal as w, vectorToHeading as T } from "./heading.js";
+import { isBindableElement as E } from "./typeChecks.js";
+import { distanceToElement as D } from "./distance.js";
+import { getHoveredElementForBinding as O } from "./collision.js";
+import { bindPointToSnapToElementOutline as ee, getBindingGap as k, getGlobalFixedPointForBindableElement as te, getHeadingForElbowArrowSnap as ne, maxBindingDistance_simple as re } from "./binding.js";
+import { aabbForElement as A, pointInsideBounds as j } from "./bounds.js";
+//#region components/pc/draw/element/elbowArrow.ts
+var M = 1, N = (e, t) => {
+	let n = e.fixedSegments ? e.fixedSegments.slice() : null;
+	if (n) {
+		let r = [];
+		e.points.map((t) => s(e.x + t[0], e.y + t[1])).forEach((t, i, a) => {
+			if (i < 2) return r.push(t);
+			if (b(S(t, a[i - 1]), S(a[i - 1], a[i - 2]))) {
+				let t = n?.findIndex?.((e) => e.index === i - 1) ?? -1, o = n?.findIndex?.((e) => e.index === i) ?? -1;
+				o !== -1 && (n[o].start = s(a[i - 2][0] - e.x, a[i - 2][1] - e.y)), t !== -1 && n.splice(t, 1), r.splice(-1, 1), n.forEach((e) => {
+					e.index > i - 1 && --e.index;
+				});
+			}
+			return r.push(t);
+		});
+		let i = [];
+		r.forEach((e, t, r) => {
+			if (t < 3) return i.push(e);
+			if (o(r[t - 2], r[t - 1]) < M) {
+				let a = n?.findIndex?.((e) => e.index === t - 2) ?? -1, o = n?.findIndex?.((e) => e.index === t - 1) ?? -1;
+				o !== -1 && n.splice(o, 1), a !== -1 && n.splice(a, 1), i.splice(-2, 2), n.forEach((e) => {
+					e.index > t - 2 && (e.index -= 2);
+				});
+				let c = C(e, r[t - 1]);
+				return i.push(s(c ? e[0] : r[t - 2][0], c ? r[t - 2][1] : e[1]));
+			}
+			i.push(e);
+		});
+		let a = n.filter((e) => e.index !== 1 && e.index !== i.length - 1);
+		return a.length === 0 ? K(q(J(I(e, F(e, t, i.map((t) => s(t[0] - e.x, t[1] - e.y)))) ?? [])), a, null, null) : (h() && p($(i), "Invalid elbow points with fixed segments"), K(i, a, e.startIsSpecial, e.endIsSpecial));
+	}
+	return {
+		x: e.x,
+		y: e.y,
+		points: e.points,
+		fixedSegments: e.fixedSegments,
+		startIsSpecial: e.startIsSpecial,
+		endIsSpecial: e.endIsSpecial
+	};
+}, ie = (e, t, n) => {
+	let r = t.map((e) => e.index), i = (e.fixedSegments?.map?.((e) => e.index) ?? []).findIndex((e) => !r.includes(e));
+	if (i === -1 || !e.fixedSegments?.[i]) return { points: e.points };
+	let a = e.fixedSegments[i].index, o = e.fixedSegments[i - 1], c = e.fixedSegments[i + 1], l = e.x + (o ? o.end[0] : 0), u = e.y + (o ? o.end[1] : 0), { startHeading: d, endHeading: f, startGlobalPoint: p, endGlobalPoint: m, hoveredStartElement: h, hoveredEndElement: g, ..._ } = F({
+		x: l,
+		y: u,
+		startBinding: o ? null : e.startBinding,
+		endBinding: c ? null : e.endBinding,
+		startArrowhead: null,
+		endArrowhead: null,
+		points: e.points
+	}, n, [s(0, 0), s(e.x + (c?.start[0] ?? e.points[e.points.length - 1][0]) - l, e.y + (c?.start[1] ?? e.points[e.points.length - 1][1]) - u)], { isDragging: !1 }), { points: v } = K(q(J(I(e, {
+		startHeading: d,
+		endHeading: f,
+		startGlobalPoint: p,
+		endGlobalPoint: m,
+		hoveredStartElement: h,
+		hoveredEndElement: g,
+		..._
+	}) ?? [])), t, null, null);
+	if (!v || v.length < 2) throw Error("Property 'points' is required in the update returned by normalizeArrowElementUpdate()");
+	let y = [];
+	if (o) for (let t = 0; t < o.index; t++) y.push(s(e.x + e.points[t][0], e.y + e.points[t][1]));
+	if (v.forEach((t) => {
+		y.push(s(e.x + (o ? o.end[0] : 0) + t[0], e.y + (o ? o.end[1] : 0) + t[1]));
+	}), c) for (let t = c.index; t < e.points.length; t++) y.push(s(e.x + e.points[t][0], e.y + e.points[t][1]));
+	let C = (c?.index ?? e.points.length) - (o?.index ?? 0) - 1, w = t.map((e) => e.index > a ? {
+		...e,
+		index: e.index - C + (v.length - 1)
+	} : e);
+	return K(y.flatMap((e, t) => {
+		let n = y[t - 1], r = y[t + 1];
+		if (n && r) {
+			let i = S(e, n), a = S(r, e);
+			if (b(i, a)) return w.forEach((e) => {
+				e.index > t && --e.index;
+			}), [];
+			if (b(i, x(a))) return w.forEach((e) => {
+				e.index > t && (e.index += 1);
+			}), [e, e];
+		}
+		return [e];
+	}), w, !1, !1);
+}, ae = (e, t, n, r, i, a) => {
+	let c = t.map((t, n) => e.fixedSegments == null || e.fixedSegments[n] === void 0 || e.fixedSegments[n].index !== t.index ? n : (t.start[0] !== e.fixedSegments[n].start[0] && t.end[0] !== e.fixedSegments[n].end[0]) == (t.start[1] !== e.fixedSegments[n].start[1] && t.end[1] !== e.fixedSegments[n].end[1]) ? null : n).filter((e) => e !== null).shift();
+	if (c == null) return { points: e.points };
+	let l = e.fixedSegments?.findIndex?.((e) => e.index === 1) ?? -1, d = e.fixedSegments?.findIndex?.((t) => t.index === e.points.length - 1) ?? -1, f = o(t[c].start, t[c].end), p = f < 45;
+	if (l === -1 && t[c].index === 1 && i) {
+		let e = w(n), r = (e ? b(n, v) : b(n, g)) ? p ? f / 2 : 40 : p ? -f / 2 : -40;
+		t[c].start = s(t[c].start[0] + (e ? r : 0), t[c].start[1] + (e ? 0 : r));
+	}
+	if (d === -1 && t[c].index === e.points.length - 1 && a) {
+		let e = w(r), n = (e ? b(r, v) : b(r, g)) ? p ? f / 2 : 40 : p ? -f / 2 : -40;
+		t[c].end = s(t[c].end[0] + (e ? n : 0), t[c].end[1] + (e ? 0 : n));
+	}
+	let m = t.map((t) => ({
+		...t,
+		start: s(e.x + t.start[0], e.y + t.start[1]),
+		end: s(e.x + t.end[0], e.y + t.end[1])
+	})), h = e.points.map((t, n) => s(e.x + t[0], e.y + t[1])), _ = m[c].index - 1, y = m[c].index, x = m[c].start, S = m[c].end, T = h[_ - 1] && !u(h[_], h[_ - 1]) ? C(h[_ - 1], h[_]) : void 0, E = h[y + 1] && !u(h[y], h[y + 1]) ? C(h[y + 1], h[y]) : void 0;
+	if (T !== void 0) {
+		let e = +!!T;
+		h[_ - 1][e] = x[e];
+	}
+	if (h[_] = x, h[y] = S, E !== void 0) {
+		let e = +!!E;
+		h[y + 1][e] = S[e];
+	}
+	let D = m.findIndex((e) => e.index === _);
+	if (D !== -1) {
+		let e = +!!C(m[D].end, m[D].start);
+		m[D].start[e] = x[e], m[D].end = x;
+	}
+	let O = m.findIndex((e) => e.index === y + 1);
+	if (O !== -1) {
+		let e = +!!C(m[O].end, m[O].start);
+		m[O].end[e] = S[e], m[O].start = S;
+	}
+	if (l === -1 && _ === 0) {
+		let t = i ? w(n) : C(h[1], h[0]);
+		h.unshift(s(t ? x[0] : e.x + e.points[0][0], t ? e.y + e.points[0][1] : x[1])), i && h.unshift(s(e.x + e.points[0][0], e.y + e.points[0][1]));
+		for (let e of m) e.index += i ? 2 : 1;
+	}
+	if (d === -1 && y === e.points.length - 1) {
+		let t = w(r);
+		h.push(s(t ? S[0] : e.x + e.points[e.points.length - 1][0], t ? e.y + e.points[e.points.length - 1][1] : S[1])), a && h.push(s(e.x + e.points[e.points.length - 1][0], e.y + e.points[e.points.length - 1][1]));
+	}
+	return K(h, m.map((t) => ({
+		...t,
+		start: s(t.start[0] - e.x, t.start[1] - e.y),
+		end: s(t.end[0] - e.x, t.end[1] - e.y)
+	})), !1, !1);
+}, oe = (e, t, n, r, a, o, c, l, u) => {
+	let d = e.startIsSpecial ?? null, f = e.endIsSpecial ?? null, p = t.map((n, r) => r === 0 || r === t.length - 1 ? s(e.x + n[0], e.y + n[1]) : s(e.x + e.points[r][0], e.y + e.points[r][1])), m = n.map((n) => ({
+		...n,
+		start: s(e.x + (n.start[0] - t[0][0]), e.y + (n.start[1] - t[0][1])),
+		end: s(e.x + (n.end[0] - t[0][0]), e.y + (n.end[1] - t[0][1]))
+	})), h = [], _ = 2 + +!!d, y = 2 + +!!f;
+	for (; h.length + _ < p.length - y;) h.push(p[h.length + _]);
+	{
+		let e = p.at(d ? 2 : 1), t = p.at(d ? 3 : 2);
+		if (!e || !t) throw Error(`Second and third points must exist when handling endpoint drag (${d})`);
+		let n = w(r), a = w(T(i(e, t)));
+		if (l && n === a) {
+			let e = n ? b(r, v) : b(r, g);
+			if (h.unshift(s(a ? o[0] + (e ? 40 : -40) : t[0], a ? t[1] : o[1] + (e ? 40 : -40))), h.unshift(s(n ? o[0] + (e ? 40 : -40) : o[0], n ? o[1] : o[1] + (e ? 40 : -40))), !d) {
+				d = !0;
+				for (let e of m) e.index > 1 && (e.index += 1);
+			}
+		} else if (h.unshift(s(a ? o[0] : e[0], a ? e[1] : o[1])), d) {
+			d = !1;
+			for (let e of m) e.index > 1 && --e.index;
+		}
+		h.unshift(o);
+	}
+	{
+		let e = p.at(p.length - (f ? 3 : 2)), t = p.at(p.length - (f ? 4 : 3));
+		if (!e || !t) throw Error(`Second and third to last points must exist when handling endpoint drag (${f})`);
+		let n = w(a), r = C(t, e);
+		if (u && n === r) {
+			let e = n ? b(a, v) : b(a, g);
+			h.push(s(r ? c[0] + (e ? 40 : -40) : t[0], r ? t[1] : c[1] + (e ? 40 : -40))), h.push(s(n ? c[0] + (e ? 40 : -40) : c[0], n ? c[1] : c[1] + (e ? 40 : -40))), f ||= !0;
+		} else h.push(s(r ? c[0] : e[0], r ? e[1] : c[1])), f &&= !1;
+	}
+	return h.push(c), K(h, m.map(({ index: e }) => ({
+		index: e,
+		start: h[e - 1],
+		end: h[e]
+	})).map((e) => ({
+		...e,
+		start: s(e.start[0] - o[0], e.start[1] - o[1]),
+		end: s(e.end[0] - o[0], e.end[1] - o[1])
+	})), d, f);
+}, P = 1e6, se = (e, t, n, r) => {
+	if (e.points.length < 2) return { points: n.points ?? e.points };
+	let i = n.fixedSegments ?? e.fixedSegments ?? [], a = n.points ? n.points && n.points.length === 2 ? e.points.map((t, r) => r === 0 ? n.points[0] : r === e.points.length - 1 ? n.points[1] : t) : n.points.slice() : e.points.slice(), { startBinding: o, endBinding: c, ...l } = n, d = o === void 0 ? e.startBinding : o, f = c === void 0 ? e.endBinding : c, p = d && G(d.elementId, t), m = f && G(f.elementId, t), h = $(a);
+	if (d && !p && h || f && !m && h || t.size === 0 && h || Object.keys(l).length === 0 && (p?.id !== d?.elementId || m?.id !== f?.elementId)) return K(a.map((t) => s(e.x + t[0], e.y + t[1])), e.fixedSegments, e.startIsSpecial, e.endIsSpecial);
+	let { startHeading: g, endHeading: _, startGlobalPoint: v, endGlobalPoint: y, hoveredStartElement: b, hoveredEndElement: x, ...S } = F({
+		x: e.x,
+		y: e.y,
+		startBinding: d,
+		endBinding: f,
+		startArrowhead: e.startArrowhead,
+		endArrowhead: e.endArrowhead,
+		points: e.points
+	}, t, a, r);
+	return t.size === 0 && h ? K(a.map((t) => s(e.x + t[0], e.y + t[1])), e.fixedSegments, e.startIsSpecial, e.endIsSpecial) : !n.points && !n.fixedSegments && !n.startBinding && !n.endBinding ? N(e, t) : n.startBinding === e.startBinding && n.endBinding === e.endBinding && (n.points ?? []).every((t, n) => u(t, e.points[n] ?? s(Infinity, Infinity))) && h ? {} : i.length === 0 ? K(q(J(I(e, {
+		startHeading: g,
+		endHeading: _,
+		startGlobalPoint: v,
+		endGlobalPoint: y,
+		hoveredStartElement: b,
+		hoveredEndElement: x,
+		...S
+	}) ?? [])), i, null, null) : (e.fixedSegments?.length ?? 0) > i.length ? ie(e, i, t) : n.points ? n.points && n.fixedSegments ? n : oe(e, a, i, g, _, v, y, b, x) : ae(e, i, g, _, b, x);
+}, F = (e, t, r, i) => {
+	let a = l(r[0], n(e.x, e.y)), o = l(r[r.length - 1], n(e.x, e.y)), s = null, c = null;
+	if (i?.isDragging) {
+		let e = Array.from(t.values());
+		s = Z(a, t, e, i?.zoom) || null, c = Z(o, t, e, i?.zoom) || null;
+	} else s = e.startBinding && G(e.startBinding.elementId, t) || null, c = e.endBinding && G(e.endBinding.elementId, t) || null;
+	let u = Y({
+		...e,
+		angle: 0,
+		type: "arrow",
+		elbowed: !0,
+		points: r
+	}, "start", e.startBinding?.fixedPoint, a, s, t, i?.isDragging), d = Y({
+		...e,
+		angle: 0,
+		type: "arrow",
+		elbowed: !0,
+		points: r
+	}, "end", e.endBinding?.fixedPoint, o, c, t, i?.isDragging), f = X(u, d, s, a, t, i?.zoom), p = X(d, u, c, o, t, i?.zoom), m = [
+		u[0] - 2,
+		u[1] - 2,
+		u[0] + 2,
+		u[1] + 2
+	], h = [
+		d[0] - 2,
+		d[1] - 2,
+		d[0] + 2,
+		d[1] + 2
+	], g = s ? A(s, t, L(f, e.startArrowhead ? k(s, { elbowed: !0 }) * 6 : k(s, { elbowed: !0 }) * 2, 1)) : m, _ = c ? A(c, t, L(p, e.endArrowhead ? k(c, { elbowed: !0 }) * 6 : k(c, { elbowed: !0 }) * 2, 1)) : h, v = j(u, c ? A(c, t, L(p, 40, 40)) : h) || j(d, s ? A(s, t, L(f, 40, 40)) : m), y = W(v ? [m, h] : [g, _]), b = ce(v ? m : g, v ? h : _, y, v ? L(f, !s && !c ? 0 : 40, 0) : L(f, !s && !c ? 0 : 40 - (e.startArrowhead ? 30 : 10), 40), v ? L(p, !s && !c ? 0 : 40, 0) : L(p, !s && !c ? 0 : 40 - (e.endArrowhead ? 30 : 10), 40), v, s && A(s, t), c && A(c, t));
+	return {
+		dynamicAABBs: b,
+		startDonglePosition: V(b[0], f, u),
+		startGlobalPoint: u,
+		startHeading: f,
+		endDonglePosition: V(b[1], p, d),
+		endGlobalPoint: d,
+		endHeading: p,
+		commonBounds: y,
+		hoveredStartElement: s,
+		hoveredEndElement: c,
+		boundsOverlap: v,
+		startElementBounds: g,
+		endElementBounds: _
+	};
+}, I = (e, t) => {
+	let { dynamicAABBs: n, startDonglePosition: r, startGlobalPoint: i, startHeading: a, endDonglePosition: o, endGlobalPoint: s, endHeading: c, commonBounds: l, hoveredEndElement: u } = t, d = le(n, r || i, a, o || s, c, l), f = r && U(r, d), p = o && U(o, d), m = U(s, d);
+	m && u && (m.closed = !0);
+	let h = U(i, d);
+	h && e.startBinding && (h.closed = !0);
+	let g = f && p && (j(f.pos, n[1]) || j(p.pos, n[0])), _ = R(f || h, p || m, d, a || v, c || v, g ? [] : n);
+	if (_) {
+		let e = _.map((e) => [e.pos[0], e.pos[1]]);
+		return f && e.unshift(i), p && e.push(s), e;
+	}
+	return null;
+}, L = (e, t, n) => {
+	switch (e) {
+		case y: return [
+			t,
+			n,
+			n,
+			n
+		];
+		case v: return [
+			n,
+			t,
+			n,
+			n
+		];
+		case g: return [
+			n,
+			n,
+			t,
+			n
+		];
+	}
+	return [
+		n,
+		n,
+		n,
+		t
+	];
+}, R = (t, n, r, a, o, s) => {
+	let l = B(t.pos, n.pos), u = new e((e) => e.f);
+	for (u.push(t); u.size() > 0;) {
+		let e = u.pop();
+		if (!e || e.closed) continue;
+		if (e === n) return z(t, e);
+		e.closed = !0;
+		let d = de(e.addr, r);
+		for (let r = 0; r < 4; r++) {
+			let f = d[r];
+			if (!f || f.closed) continue;
+			let p = c(f.pos, e.pos, .5);
+			if (m(...s.map((e) => j(p, e)))) continue;
+			let h = fe(r), g = e.parent ? T(i(e.pos, e.parent.pos)) : a;
+			if (b(x(g), h) || Q(t.addr, f.addr) && b(h, a) || Q(n.addr, f.addr) && b(h, o)) continue;
+			let _ = g !== h, v = e.g + B(f.pos, e.pos) + (_ ? l ** 3 : 0), y = f.visited;
+			if (!y || v < f.g) {
+				let t = ue(f, n, h, o);
+				f.visited = !0, f.parent = e, f.h = B(n.pos, f.pos) + t * l ** 2, f.g = v, f.f = f.g + f.h, y ? u.rescoreElement(f) : u.push(f);
+			}
+		}
+	}
+	return null;
+}, z = (e, t) => {
+	let n = t, r = [];
+	for (; n.parent;) r.unshift(n), n = n.parent;
+	return r.unshift(e), r;
+}, B = (e, t) => Math.abs(e[0] - t[0]) + Math.abs(e[1] - t[1]), ce = (e, t, i, a, o, s, c, l) => {
+	let u = c ?? e, d = l ?? t, [f, p, m, h] = a ?? [
+		0,
+		0,
+		0,
+		0
+	], [g, _, v, y] = o ?? [
+		0,
+		0,
+		0,
+		0
+	], b = [
+		e[0] > t[2] ? e[1] > t[3] || e[3] < t[1] ? Math.min((u[0] + d[2]) / 2, e[0] - h) : (u[0] + d[2]) / 2 : e[0] > t[0] ? e[0] - h : i[0] - h,
+		e[1] > t[3] ? e[0] > t[2] || e[2] < t[0] ? Math.min((u[1] + d[3]) / 2, e[1] - f) : (u[1] + d[3]) / 2 : e[1] > t[1] ? e[1] - f : i[1] - f,
+		e[2] < t[0] ? e[1] > t[3] || e[3] < t[1] ? Math.max((u[2] + d[0]) / 2, e[2] + p) : (u[2] + d[0]) / 2 : e[2] < t[2] ? e[2] + p : i[2] + p,
+		e[3] < t[1] ? e[0] > t[2] || e[2] < t[0] ? Math.max((u[3] + d[1]) / 2, e[3] + m) : (u[3] + d[1]) / 2 : e[3] < t[3] ? e[3] + m : i[3] + m
+	], x = [
+		t[0] > e[2] ? t[1] > e[3] || t[3] < e[1] ? Math.min((d[0] + u[2]) / 2, t[0] - y) : (d[0] + u[2]) / 2 : t[0] > e[0] ? t[0] - y : i[0] - y,
+		t[1] > e[3] ? t[0] > e[2] || t[2] < e[0] ? Math.min((d[1] + u[3]) / 2, t[1] - g) : (d[1] + u[3]) / 2 : t[1] > e[1] ? t[1] - g : i[1] - g,
+		t[2] < e[0] ? t[1] > e[3] || t[3] < e[1] ? Math.max((d[2] + u[0]) / 2, t[2] + _) : (d[2] + u[0]) / 2 : t[2] < e[2] ? t[2] + _ : i[2] + _,
+		t[3] < e[1] ? t[0] > e[2] || t[2] < e[0] ? Math.max((d[3] + u[1]) / 2, t[3] + v) : (d[3] + u[1]) / 2 : t[3] < e[3] ? t[3] + v : i[3] + v
+	], S = W([b, x]);
+	if (!s && b[2] - b[0] + x[2] - x[0] > S[2] - S[0] + 1e-11 && b[3] - b[1] + x[3] - x[1] > S[3] - S[1] + 1e-11) {
+		let [i, a] = [(x[0] + x[2]) / 2, (x[1] + x[3]) / 2];
+		if (t[0] > e[2] && e[1] > t[3]) {
+			let t = b[2] + (x[0] - b[2]) / 2, o = x[3] + (b[1] - x[3]) / 2;
+			return r(n(e[2] - i, e[1] - a), n(e[0] - i, e[3] - a)) > 0 ? [[
+				b[0],
+				b[1],
+				t,
+				b[3]
+			], [
+				t,
+				x[1],
+				x[2],
+				x[3]
+			]] : [[
+				b[0],
+				o,
+				b[2],
+				b[3]
+			], [
+				x[0],
+				x[1],
+				x[2],
+				o
+			]];
+		} else if (e[2] < t[0] && e[3] < t[1]) {
+			let t = b[2] + (x[0] - b[2]) / 2, o = b[3] + (x[1] - b[3]) / 2;
+			return r(n(e[0] - i, e[1] - a), n(e[2] - i, e[3] - a)) > 0 ? [[
+				b[0],
+				b[1],
+				b[2],
+				o
+			], [
+				x[0],
+				o,
+				x[2],
+				x[3]
+			]] : [[
+				b[0],
+				b[1],
+				t,
+				b[3]
+			], [
+				t,
+				x[1],
+				x[2],
+				x[3]
+			]];
+		} else if (e[0] > t[2] && e[3] < t[1]) {
+			let t = x[2] + (b[0] - x[2]) / 2, o = b[3] + (x[1] - b[3]) / 2;
+			return r(n(e[2] - i, e[1] - a), n(e[0] - i, e[3] - a)) > 0 ? [[
+				t,
+				b[1],
+				b[2],
+				b[3]
+			], [
+				x[0],
+				x[1],
+				t,
+				x[3]
+			]] : [[
+				b[0],
+				b[1],
+				b[2],
+				o
+			], [
+				x[0],
+				o,
+				x[2],
+				x[3]
+			]];
+		} else if (e[0] > t[2] && e[1] > t[3]) {
+			let t = x[2] + (b[0] - x[2]) / 2, o = x[3] + (b[1] - x[3]) / 2;
+			return r(n(e[0] - i, e[1] - a), n(e[2] - i, e[3] - a)) > 0 ? [[
+				t,
+				b[1],
+				b[2],
+				b[3]
+			], [
+				x[0],
+				x[1],
+				t,
+				x[3]
+			]] : [[
+				b[0],
+				o,
+				b[2],
+				b[3]
+			], [
+				x[0],
+				x[1],
+				x[2],
+				o
+			]];
+		}
+	}
+	return [b, x];
+}, le = (e, t, n, r, i, a) => {
+	let o = /* @__PURE__ */ new Set(), s = /* @__PURE__ */ new Set();
+	n === _ || n === v ? s.add(t[1]) : o.add(t[0]), i === _ || i === v ? s.add(r[1]) : o.add(r[0]), e.forEach((e) => {
+		o.add(e[0]), o.add(e[2]), s.add(e[1]), s.add(e[3]);
+	}), o.add(a[0]), o.add(a[2]), s.add(a[1]), s.add(a[3]);
+	let c = Array.from(s).sort((e, t) => e - t), l = Array.from(o).sort((e, t) => e - t);
+	return {
+		row: c.length,
+		col: l.length,
+		data: c.flatMap((e, t) => l.map((n, r) => ({
+			f: 0,
+			g: 0,
+			h: 0,
+			closed: !1,
+			visited: !1,
+			parent: null,
+			addr: [r, t],
+			pos: [n, e]
+		})))
+	};
+}, V = (e, t, n) => {
+	switch (t) {
+		case y: return s(n[0], e[1]);
+		case v: return s(e[2], n[1]);
+		case g: return s(n[0], e[3]);
+	}
+	return s(e[0], n[1]);
+}, ue = (e, t, n, r) => {
+	if (r === v) switch (n) {
+		case v: return e.pos[0] >= t.pos[0] ? 4 : e.pos[1] === t.pos[1] ? 0 : 2;
+		case y: return e.pos[1] > t.pos[1] && e.pos[0] < t.pos[0] ? 1 : 3;
+		case g: return e.pos[1] < t.pos[1] && e.pos[0] < t.pos[0] ? 1 : 3;
+		case _: return e.pos[1] === t.pos[1] ? 4 : 2;
+	}
+	else if (r === _) switch (n) {
+		case v: return e.pos[1] === t.pos[1] ? 4 : 2;
+		case y: return e.pos[1] > t.pos[1] && e.pos[0] > t.pos[0] ? 1 : 3;
+		case g: return e.pos[1] < t.pos[1] && e.pos[0] > t.pos[0] ? 1 : 3;
+		case _: return e.pos[0] <= t.pos[0] ? 4 : e.pos[1] === t.pos[1] ? 0 : 2;
+	}
+	else if (r === y) switch (n) {
+		case v: return e.pos[1] > t.pos[1] && e.pos[0] < t.pos[0] ? 1 : 3;
+		case y: return e.pos[1] >= t.pos[1] ? 4 : e.pos[0] === t.pos[0] ? 0 : 2;
+		case g: return e.pos[0] === t.pos[0] ? 4 : 2;
+		case _: return e.pos[1] > t.pos[1] && e.pos[0] > t.pos[0] ? 1 : 3;
+	}
+	else if (r === g) switch (n) {
+		case v: return e.pos[1] < t.pos[1] && e.pos[0] < t.pos[0] ? 1 : 3;
+		case y: return e.pos[0] === t.pos[0] ? 4 : 2;
+		case g: return e.pos[1] <= t.pos[1] ? 4 : e.pos[0] === t.pos[0] ? 0 : 2;
+		case _: return e.pos[1] < t.pos[1] && e.pos[0] > t.pos[0] ? 1 : 3;
+	}
+	return 0;
+}, de = ([e, t], n) => [
+	H([e, t - 1], n),
+	H([e + 1, t], n),
+	H([e, t + 1], n),
+	H([e - 1, t], n)
+], H = ([e, t], n) => e < 0 || e >= n.col || t < 0 || t >= n.row ? null : n.data[t * n.col + e] ?? null, U = (e, t) => {
+	for (let n = 0; n < t.col; n++) for (let r = 0; r < t.row; r++) {
+		let i = H([n, r], t);
+		if (i && e[0] === i.pos[0] && e[1] === i.pos[1]) return i;
+	}
+	return null;
+}, W = (e) => [
+	Math.min(...e.map((e) => e[0])),
+	Math.min(...e.map((e) => e[1])),
+	Math.max(...e.map((e) => e[2])),
+	Math.max(...e.map((e) => e[3]))
+], G = (e, t) => {
+	let n = t.get(e);
+	return n && E(n) ? n : null;
+}, K = (e, n, r, o) => {
+	let c = e[0][0], u = e[0][1], f = e.map((t) => l(t, a(i(e[0]), -1)));
+	return (c < -1e6 || c > P || u < -1e6 || u > P || c + f[f.length - 1][0] < -1e6 || u + f[f.length - 1][0] > P || c + f[f.length - 1][1] < -1e6 || u + f[f.length - 1][1] > P) && console.error("Elbow arrow normalization is outside reasonable bounds (> 1e6)", {
+		x: c,
+		y: u,
+		points: f,
+		...d(f)
+	}), f = f.map(([e, n]) => s(t(e, -1e6, 1e6), t(n, -1e6, 1e6))), {
+		points: f,
+		x: t(c, -1e6, 1e6),
+		y: t(u, -1e6, 1e6),
+		fixedSegments: (n?.length ?? 0) > 0 ? n : null,
+		...d(f),
+		startIsSpecial: r,
+		endIsSpecial: o
+	};
+}, q = (e) => {
+	if (e.length > 1) {
+		let t = Math.abs(e[0][1] - e[1][1]) < Math.abs(e[0][0] - e[1][0]);
+		return e.filter((n, r) => {
+			if (r === 0 || r === e.length - 1) return !0;
+			let i = e[r + 1], a = Math.abs(n[1] - i[1]) < Math.abs(n[0] - i[0]);
+			return t === a ? (t = a, !1) : (t = a, !0);
+		});
+	}
+	return e;
+}, J = (e) => e.length >= 4 ? e.filter((t, n) => {
+	if (n === 0 || n === e.length - 1) return !0;
+	let r = e[n - 1];
+	return o(r, t) > M;
+}) : e, fe = (e) => {
+	switch (e) {
+		case 0: return y;
+		case 1: return v;
+		case 2: return g;
+	}
+	return _;
+}, Y = (e, t, n, r, i, a, o) => o ? i && a ? ee(e, i, t, a) : r : i ? te(n || [0, 0], i, a ?? f([i])) : r, X = (e, t, n, r, i, a) => ne(e, t, n, n && A(n, i, [
+	,
+	,
+	,
+	,
+].fill(D(n, i, e))), r, i, a), Z = (e, t, n, r) => O(e, n, t, re(r)), Q = (e, t) => e[0] === t[0] && e[1] === t[1], $ = (e, t = M) => e.slice(1).map((n, r) => Math.abs(n[0] - e[r][0]) < t || Math.abs(n[1] - e[r][1]) < t).every(Boolean);
+//#endregion
+export { se as updateElbowArrowPoints, $ as validateElbowPoints };
+/* 独立思考，明辨是非 */

package/draw/element/elementLink.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Create and link between shapes.
+ */
+import type { AppProps, AppState } from '../interface';
+import type { DrawElement } from './types';
+export declare const defaultGetElementLinkFromSelection: Exclude<AppProps['generateLinkForSelection'], undefined>;
+export declare const getLinkIdAndTypeFromSelection: (selectedElements: DrawElement[], appState: AppState) => {
+    id: string;
+    type: "element" | "group";
+} | null;
+export declare const canCreateLinkFromElements: (selectedElements: DrawElement[]) => boolean;
+export declare const isElementLink: (url: string) => boolean;
+export declare const parseElementLinkFromURL: (url: string) => string | null;

package/draw/element/elementLink.js

@@ -0,0 +1,50 @@
+/* 潘启宝 2026-06-25 17:54:57 星期四 山东省济南市 */
+import { ELEMENT_LINK_KEY as e } from "../common/constants.js";
+import { normalizeLink as t } from "../common/url.js";
+import "../common/index.js";
+import { elementsAreInSameGroup as n } from "./groups.js";
+//#region components/pc/draw/element/elementLink.ts
+var r = (n, r) => {
+	let i = window.location.href;
+	try {
+		let r = new URL(i);
+		return r.searchParams.set(e, n), t(r.toString());
+	} catch (e) {
+		console.error(e);
+	}
+	return t(i);
+}, i = (e, t) => {
+	if (e.length > 0 && a(e)) {
+		if (e.length === 1) return {
+			id: e[0].id,
+			type: "element"
+		};
+		if (e.length > 1) {
+			let n = Object.keys(t.selectedGroupIds)[0];
+			return n ? {
+				id: n,
+				type: "group"
+			} : {
+				id: e[0].groupIds[0],
+				type: "group"
+			};
+		}
+	}
+	return null;
+}, a = (e) => !!(e.length === 1 || e.length > 1 && n(e)), o = (e) => {
+	try {
+		let t = new URL(e);
+		return t.searchParams.has("element") && t.host === window.location.host;
+	} catch {
+		return !1;
+	}
+}, s = (t) => {
+	try {
+		let { searchParams: n } = new URL(t);
+		if (n.has("element")) return n.get(e);
+	} catch {}
+	return null;
+};
+//#endregion
+export { a as canCreateLinkFromElements, r as defaultGetElementLinkFromSelection, i as getLinkIdAndTypeFromSelection, o as isElementLink, s as parseElementLinkFromURL };
+/* 独立思考，明辨是非 */

package/draw/element/embeddable.d.ts

@@ -0,0 +1,6 @@
+import type { DrawProps } from '../interface';
+import type { DrawElement, DrawIframeLikeElement } from './types';
+export declare const createSrcDoc: (body: string) => string;
+export declare const createPlaceholderEmbeddableLabel: (element: DrawIframeLikeElement) => DrawElement;
+export declare const maybeParseEmbedSrc: (str: string) => string;
+export declare const embeddableURLValidator: (url: string | null | undefined, validateEmbeddable: DrawProps["validateEmbeddable"]) => boolean;

package/draw/element/embeddable.js

@@ -0,0 +1,58 @@
+/* 潘启宝 2026-06-25 17:54:57 星期四 山东省济南市 */
+import { FONT_FAMILY as e, VERTICAL_ALIGN as t } from "../common/constants.js";
+import { getFontString as n } from "../common/utils.js";
+import "../common/index.js";
+import { isIframeElement as r } from "./typeChecks.js";
+import { wrapText as i } from "./textWrapping.js";
+import { newTextElement as a } from "./newElement.js";
+//#region components/pc/draw/element/embeddable.ts
+var o = /^<(?:iframe|blockquote)[\s\S]*?\s(?:src|href)=["']([^"']*)["'][\s\S]*?>$/i, s = (e) => `<html><body>${e}</body></html>`, c = (o) => {
+	let s;
+	s = r(o) ? "IFrame element" : !o.link || o?.link === "" ? "Empty Web-Embed" : o.link;
+	let c = Math.max(Math.min(o.width / 2, o.width / s.length), o.width / 30), l = e.Helvetica, u = n({
+		fontSize: c,
+		fontFamily: l
+	});
+	return a({
+		x: o.x + o.width / 2,
+		y: o.y + o.height / 2,
+		strokeColor: o.strokeColor === "transparent" ? "black" : o.strokeColor,
+		backgroundColor: "transparent",
+		fontFamily: l,
+		fontSize: c,
+		text: i(s, u, o.width - 20),
+		textAlign: "center",
+		verticalAlign: t.MIDDLE,
+		angle: o.angle ?? 0
+	});
+}, l = (e) => {
+	try {
+		let { hostname: t } = new URL(e);
+		return t.replace(/^www\./, "").replace(/^([^.]+)/, "*");
+	} catch (e) {
+		console.error(e);
+	}
+	return null;
+}, u = (e) => {
+	let t = e.match(o);
+	return t && t.length === 2 ? t[1] : e;
+}, d = (e, t) => {
+	if (!e) return !1;
+	if (t != null) {
+		if (typeof t == "function") {
+			let n = t(e);
+			if (typeof n == "boolean") return n;
+		} else if (typeof t == "boolean") return t;
+		else if (t instanceof RegExp) return t.test(e);
+		else if (Array.isArray(t)) {
+			for (let n of t) if (n instanceof RegExp) {
+				if (e.match(n)) return !0;
+			} else if (l(e, n)) return !0;
+			return !1;
+		}
+	}
+	return !!l(e);
+};
+//#endregion
+export { c as createPlaceholderEmbeddableLabel, s as createSrcDoc, d as embeddableURLValidator, u as maybeParseEmbedSrc };
+/* 独立思考，明辨是非 */