@geekybones/canvas-kit 1.0.1 → 1.2.0

package/dist/chunks/rolldown-runtime.js

@@ -0,0 +1,13 @@
+//#region \0rolldown/runtime.js
+var e = Object.create, t = Object.defineProperty, n = Object.getOwnPropertyDescriptor, r = Object.getOwnPropertyNames, i = Object.getPrototypeOf, a = Object.prototype.hasOwnProperty, o = (e, t) => () => (t || (e((t = { exports: {} }).exports, t), e = null), t.exports), s = (e, i, o, s) => {
+	if (i && typeof i == "object" || typeof i == "function") for (var c = r(i), l = 0, u = c.length, d; l < u; l++) d = c[l], !a.call(e, d) && d !== o && t(e, d, {
+		get: ((e) => i[e]).bind(null, d),
+		enumerable: !(s = n(i, d)) || s.enumerable
+	});
+	return e;
+}, c = (n, r, a) => (a = n == null ? {} : e(i(n)), s(r || !n || !n.__esModule ? t(a, "default", {
+	value: n,
+	enumerable: !0
+}) : a, n));
+//#endregion
+export { c as n, o as t };

package/dist/chunks/vendor-earcut.js

@@ -0,0 +1,258 @@
+//#region node_modules/.pnpm/earcut@3.0.2/node_modules/earcut/src/earcut.js
+function e(e, n, i = 2) {
+	let a = n && n.length, o = a ? n[0] * i : e.length, s = t(e, 0, o, i, !0), l = [];
+	if (!s || s.next === s.prev) return l;
+	let u, d, f;
+	if (a && (s = c(e, n, s, i)), e.length > 80 * i) {
+		u = e[0], d = e[1];
+		let t = u, n = d;
+		for (let r = i; r < o; r += i) {
+			let i = e[r], a = e[r + 1];
+			i < u && (u = i), a < d && (d = a), i > t && (t = i), a > n && (n = a);
+		}
+		f = Math.max(t - u, n - d), f = f === 0 ? 0 : 32767 / f;
+	}
+	return r(s, l, i, u, d, f, 0), l;
+}
+function t(e, t, n, r, i) {
+	let a;
+	if (i === M(e, t, n, r) > 0) for (let i = t; i < n; i += r) a = k(i / r | 0, e[i], e[i + 1], a);
+	else for (let i = n - r; i >= t; i -= r) a = k(i / r | 0, e[i], e[i + 1], a);
+	return a && x(a, a.next) && (A(a), a = a.next), a;
+}
+function n(e, t) {
+	if (!e) return e;
+	t ||= e;
+	let n = e, r;
+	do
+		if (r = !1, !n.steiner && (x(n, n.next) || b(n.prev, n, n.next) === 0)) {
+			if (A(n), n = t = n.prev, n === n.next) break;
+			r = !0;
+		} else n = n.next;
+	while (r || n !== t);
+	return t;
+}
+function r(e, t, c, l, u, d, f) {
+	if (!e) return;
+	!f && d && p(e, l, u, d);
+	let m = e;
+	for (; e.prev !== e.next;) {
+		let p = e.prev, h = e.next;
+		if (d ? a(e, l, u, d) : i(e)) {
+			t.push(p.i, e.i, h.i), A(e), e = h.next, m = h.next;
+			continue;
+		}
+		if (e = h, e === m) {
+			f ? f === 1 ? (e = o(n(e), t), r(e, t, c, l, u, d, 2)) : f === 2 && s(e, t, c, l, u, d) : r(n(e), t, c, l, u, d, 1);
+			break;
+		}
+	}
+}
+function i(e) {
+	let t = e.prev, n = e, r = e.next;
+	if (b(t, n, r) >= 0) return !1;
+	let i = t.x, a = n.x, o = r.x, s = t.y, c = n.y, l = r.y, u = Math.min(i, a, o), d = Math.min(s, c, l), f = Math.max(i, a, o), p = Math.max(s, c, l), m = r.next;
+	for (; m !== t;) {
+		if (m.x >= u && m.x <= f && m.y >= d && m.y <= p && v(i, s, a, c, o, l, m.x, m.y) && b(m.prev, m, m.next) >= 0) return !1;
+		m = m.next;
+	}
+	return !0;
+}
+function a(e, t, n, r) {
+	let i = e.prev, a = e, o = e.next;
+	if (b(i, a, o) >= 0) return !1;
+	let s = i.x, c = a.x, l = o.x, u = i.y, d = a.y, f = o.y, p = Math.min(s, c, l), m = Math.min(u, d, f), g = Math.max(s, c, l), _ = Math.max(u, d, f), y = h(p, m, t, n, r), x = h(g, _, t, n, r), S = e.prevZ, C = e.nextZ;
+	for (; S && S.z >= y && C && C.z <= x;) {
+		if (S.x >= p && S.x <= g && S.y >= m && S.y <= _ && S !== i && S !== o && v(s, u, c, d, l, f, S.x, S.y) && b(S.prev, S, S.next) >= 0 || (S = S.prevZ, C.x >= p && C.x <= g && C.y >= m && C.y <= _ && C !== i && C !== o && v(s, u, c, d, l, f, C.x, C.y) && b(C.prev, C, C.next) >= 0)) return !1;
+		C = C.nextZ;
+	}
+	for (; S && S.z >= y;) {
+		if (S.x >= p && S.x <= g && S.y >= m && S.y <= _ && S !== i && S !== o && v(s, u, c, d, l, f, S.x, S.y) && b(S.prev, S, S.next) >= 0) return !1;
+		S = S.prevZ;
+	}
+	for (; C && C.z <= x;) {
+		if (C.x >= p && C.x <= g && C.y >= m && C.y <= _ && C !== i && C !== o && v(s, u, c, d, l, f, C.x, C.y) && b(C.prev, C, C.next) >= 0) return !1;
+		C = C.nextZ;
+	}
+	return !0;
+}
+function o(e, t) {
+	let r = e;
+	do {
+		let n = r.prev, i = r.next.next;
+		!x(n, i) && S(n, r, r.next, i) && E(n, i) && E(i, n) && (t.push(n.i, r.i, i.i), A(r), A(r.next), r = e = i), r = r.next;
+	} while (r !== e);
+	return n(r);
+}
+function s(e, t, i, a, o, s) {
+	let c = e;
+	do {
+		let e = c.next.next;
+		for (; e !== c.prev;) {
+			if (c.i !== e.i && y(c, e)) {
+				let l = O(c, e);
+				c = n(c, c.next), l = n(l, l.next), r(c, t, i, a, o, s, 0), r(l, t, i, a, o, s, 0);
+				return;
+			}
+			e = e.next;
+		}
+		c = c.next;
+	} while (c !== e);
+}
+function c(e, n, r, i) {
+	let a = [];
+	for (let r = 0, o = n.length; r < o; r++) {
+		let s = t(e, n[r] * i, r < o - 1 ? n[r + 1] * i : e.length, i, !1);
+		s === s.next && (s.steiner = !0), a.push(g(s));
+	}
+	a.sort(l);
+	for (let e = 0; e < a.length; e++) r = u(a[e], r);
+	return r;
+}
+function l(e, t) {
+	let n = e.x - t.x;
+	return n === 0 && (n = e.y - t.y, n === 0 && (n = (e.next.y - e.y) / (e.next.x - e.x) - (t.next.y - t.y) / (t.next.x - t.x))), n;
+}
+function u(e, t) {
+	let r = d(e, t);
+	if (!r) return t;
+	let i = O(r, e);
+	return n(i, i.next), n(r, r.next);
+}
+function d(e, t) {
+	let n = t, r = e.x, i = e.y, a = -Infinity, o;
+	if (x(e, n)) return n;
+	do {
+		if (x(e, n.next)) return n.next;
+		if (i <= n.y && i >= n.next.y && n.next.y !== n.y) {
+			let e = n.x + (i - n.y) * (n.next.x - n.x) / (n.next.y - n.y);
+			if (e <= r && e > a && (a = e, o = n.x < n.next.x ? n : n.next, e === r)) return o;
+		}
+		n = n.next;
+	} while (n !== t);
+	if (!o) return null;
+	let s = o, c = o.x, l = o.y, u = Infinity;
+	n = o;
+	do {
+		if (r >= n.x && n.x >= c && r !== n.x && _(i < l ? r : a, i, c, l, i < l ? a : r, i, n.x, n.y)) {
+			let t = Math.abs(i - n.y) / (r - n.x);
+			E(n, e) && (t < u || t === u && (n.x > o.x || n.x === o.x && f(o, n))) && (o = n, u = t);
+		}
+		n = n.next;
+	} while (n !== s);
+	return o;
+}
+function f(e, t) {
+	return b(e.prev, e, t.prev) < 0 && b(t.next, e, e.next) < 0;
+}
+function p(e, t, n, r) {
+	let i = e;
+	do
+		i.z === 0 && (i.z = h(i.x, i.y, t, n, r)), i.prevZ = i.prev, i.nextZ = i.next, i = i.next;
+	while (i !== e);
+	i.prevZ.nextZ = null, i.prevZ = null, m(i);
+}
+function m(e) {
+	let t, n = 1;
+	do {
+		let r = e, i;
+		e = null;
+		let a = null;
+		for (t = 0; r;) {
+			t++;
+			let o = r, s = 0;
+			for (let e = 0; e < n && (s++, o = o.nextZ, o); e++);
+			let c = n;
+			for (; s > 0 || c > 0 && o;) s !== 0 && (c === 0 || !o || r.z <= o.z) ? (i = r, r = r.nextZ, s--) : (i = o, o = o.nextZ, c--), a ? a.nextZ = i : e = i, i.prevZ = a, a = i;
+			r = o;
+		}
+		a.nextZ = null, n *= 2;
+	} while (t > 1);
+	return e;
+}
+function h(e, t, n, r, i) {
+	return e = (e - n) * i | 0, t = (t - r) * i | 0, e = (e | e << 8) & 16711935, e = (e | e << 4) & 252645135, e = (e | e << 2) & 858993459, e = (e | e << 1) & 1431655765, t = (t | t << 8) & 16711935, t = (t | t << 4) & 252645135, t = (t | t << 2) & 858993459, t = (t | t << 1) & 1431655765, e | t << 1;
+}
+function g(e) {
+	let t = e, n = e;
+	do
+		(t.x < n.x || t.x === n.x && t.y < n.y) && (n = t), t = t.next;
+	while (t !== e);
+	return n;
+}
+function _(e, t, n, r, i, a, o, s) {
+	return (i - o) * (t - s) >= (e - o) * (a - s) && (e - o) * (r - s) >= (n - o) * (t - s) && (n - o) * (a - s) >= (i - o) * (r - s);
+}
+function v(e, t, n, r, i, a, o, s) {
+	return !(e === o && t === s) && _(e, t, n, r, i, a, o, s);
+}
+function y(e, t) {
+	return e.next.i !== t.i && e.prev.i !== t.i && !T(e, t) && (E(e, t) && E(t, e) && D(e, t) && (b(e.prev, e, t.prev) || b(e, t.prev, t)) || x(e, t) && b(e.prev, e, e.next) > 0 && b(t.prev, t, t.next) > 0);
+}
+function b(e, t, n) {
+	return (t.y - e.y) * (n.x - t.x) - (t.x - e.x) * (n.y - t.y);
+}
+function x(e, t) {
+	return e.x === t.x && e.y === t.y;
+}
+function S(e, t, n, r) {
+	let i = w(b(e, t, n)), a = w(b(e, t, r)), o = w(b(n, r, e)), s = w(b(n, r, t));
+	return !!(i !== a && o !== s || i === 0 && C(e, n, t) || a === 0 && C(e, r, t) || o === 0 && C(n, e, r) || s === 0 && C(n, t, r));
+}
+function C(e, t, n) {
+	return t.x <= Math.max(e.x, n.x) && t.x >= Math.min(e.x, n.x) && t.y <= Math.max(e.y, n.y) && t.y >= Math.min(e.y, n.y);
+}
+function w(e) {
+	return e > 0 ? 1 : e < 0 ? -1 : 0;
+}
+function T(e, t) {
+	let n = e;
+	do {
+		if (n.i !== e.i && n.next.i !== e.i && n.i !== t.i && n.next.i !== t.i && S(n, n.next, e, t)) return !0;
+		n = n.next;
+	} while (n !== e);
+	return !1;
+}
+function E(e, t) {
+	return b(e.prev, e, e.next) < 0 ? b(e, t, e.next) >= 0 && b(e, e.prev, t) >= 0 : b(e, t, e.prev) < 0 || b(e, e.next, t) < 0;
+}
+function D(e, t) {
+	let n = e, r = !1, i = (e.x + t.x) / 2, a = (e.y + t.y) / 2;
+	do
+		n.y > a != n.next.y > a && n.next.y !== n.y && i < (n.next.x - n.x) * (a - n.y) / (n.next.y - n.y) + n.x && (r = !r), n = n.next;
+	while (n !== e);
+	return r;
+}
+function O(e, t) {
+	let n = j(e.i, e.x, e.y), r = j(t.i, t.x, t.y), i = e.next, a = t.prev;
+	return e.next = t, t.prev = e, n.next = i, i.prev = n, r.next = n, n.prev = r, a.next = r, r.prev = a, r;
+}
+function k(e, t, n, r) {
+	let i = j(e, t, n);
+	return r ? (i.next = r.next, i.prev = r, r.next.prev = i, r.next = i) : (i.prev = i, i.next = i), i;
+}
+function A(e) {
+	e.next.prev = e.prev, e.prev.next = e.next, e.prevZ && (e.prevZ.nextZ = e.nextZ), e.nextZ && (e.nextZ.prevZ = e.prevZ);
+}
+function j(e, t, n) {
+	return {
+		i: e,
+		x: t,
+		y: n,
+		prev: null,
+		next: null,
+		z: 0,
+		prevZ: null,
+		nextZ: null,
+		steiner: !1
+	};
+}
+function M(e, t, n, r) {
+	let i = 0;
+	for (let a = t, o = n - r; a < n; a += r) i += (e[o] - e[a]) * (e[a + 1] + e[o + 1]), o = a;
+	return i;
+}
+//#endregion
+export { e as t };
+
+//# sourceMappingURL=vendor-earcut.js.map

package/dist/chunks/vendor-earcut.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vendor-earcut.js","names":[],"sources":["../../node_modules/.pnpm/earcut@3.0.2/node_modules/earcut/src/earcut.js"],"sourcesContent":["\nexport default function earcut(data, holeIndices, dim = 2) {\n\n    const hasHoles = holeIndices && holeIndices.length;\n    const outerLen = hasHoles ? holeIndices[0] * dim : data.length;\n    let outerNode = linkedList(data, 0, outerLen, dim, true);\n    const triangles = [];\n\n    if (!outerNode || outerNode.next === outerNode.prev) return triangles;\n\n    let minX, minY, invSize;\n\n    if (hasHoles) outerNode = eliminateHoles(data, holeIndices, outerNode, dim);\n\n    // if the shape is not too simple, we'll use z-order curve hash later; calculate polygon bbox\n    if (data.length > 80 * dim) {\n        minX = data[0];\n        minY = data[1];\n        let maxX = minX;\n        let maxY = minY;\n\n        for (let i = dim; i < outerLen; i += dim) {\n            const x = data[i];\n            const y = data[i + 1];\n            if (x < minX) minX = x;\n            if (y < minY) minY = y;\n            if (x > maxX) maxX = x;\n            if (y > maxY) maxY = y;\n        }\n\n        // minX, minY and invSize are later used to transform coords into integers for z-order calculation\n        invSize = Math.max(maxX - minX, maxY - minY);\n        invSize = invSize !== 0 ? 32767 / invSize : 0;\n    }\n\n    earcutLinked(outerNode, triangles, dim, minX, minY, invSize, 0);\n\n    return triangles;\n}\n\n// create a circular doubly linked list from polygon points in the specified winding order\nfunction linkedList(data, start, end, dim, clockwise) {\n    let last;\n\n    if (clockwise === (signedArea(data, start, end, dim) > 0)) {\n        for (let i = start; i < end; i += dim) last = insertNode(i / dim | 0, data[i], data[i + 1], last);\n    } else {\n        for (let i = end - dim; i >= start; i -= dim) last = insertNode(i / dim | 0, data[i], data[i + 1], last);\n    }\n\n    if (last && equals(last, last.next)) {\n        removeNode(last);\n        last = last.next;\n    }\n\n    return last;\n}\n\n// eliminate colinear or duplicate points\nfunction filterPoints(start, end) {\n    if (!start) return start;\n    if (!end) end = start;\n\n    let p = start,\n        again;\n    do {\n        again = false;\n\n        if (!p.steiner && (equals(p, p.next) || area(p.prev, p, p.next) === 0)) {\n            removeNode(p);\n            p = end = p.prev;\n            if (p === p.next) break;\n            again = true;\n\n        } else {\n            p = p.next;\n        }\n    } while (again || p !== end);\n\n    return end;\n}\n\n// main ear slicing loop which triangulates a polygon (given as a linked list)\nfunction earcutLinked(ear, triangles, dim, minX, minY, invSize, pass) {\n    if (!ear) return;\n\n    // interlink polygon nodes in z-order\n    if (!pass && invSize) indexCurve(ear, minX, minY, invSize);\n\n    let stop = ear;\n\n    // iterate through ears, slicing them one by one\n    while (ear.prev !== ear.next) {\n        const prev = ear.prev;\n        const next = ear.next;\n\n        if (invSize ? isEarHashed(ear, minX, minY, invSize) : isEar(ear)) {\n            triangles.push(prev.i, ear.i, next.i); // cut off the triangle\n\n            removeNode(ear);\n\n            // skipping the next vertex leads to less sliver triangles\n            ear = next.next;\n            stop = next.next;\n\n            continue;\n        }\n\n        ear = next;\n\n        // if we looped through the whole remaining polygon and can't find any more ears\n        if (ear === stop) {\n            // try filtering points and slicing again\n            if (!pass) {\n                earcutLinked(filterPoints(ear), triangles, dim, minX, minY, invSize, 1);\n\n            // if this didn't work, try curing all small self-intersections locally\n            } else if (pass === 1) {\n                ear = cureLocalIntersections(filterPoints(ear), triangles);\n                earcutLinked(ear, triangles, dim, minX, minY, invSize, 2);\n\n            // as a last resort, try splitting the remaining polygon into two\n            } else if (pass === 2) {\n                splitEarcut(ear, triangles, dim, minX, minY, invSize);\n            }\n\n            break;\n        }\n    }\n}\n\n// check whether a polygon node forms a valid ear with adjacent nodes\nfunction isEar(ear) {\n    const a = ear.prev,\n        b = ear,\n        c = ear.next;\n\n    if (area(a, b, c) >= 0) return false; // reflex, can't be an ear\n\n    // now make sure we don't have other points inside the potential ear\n    const ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;\n\n    // triangle bbox\n    const x0 = Math.min(ax, bx, cx),\n        y0 = Math.min(ay, by, cy),\n        x1 = Math.max(ax, bx, cx),\n        y1 = Math.max(ay, by, cy);\n\n    let p = c.next;\n    while (p !== a) {\n        if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 &&\n            pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, p.x, p.y) &&\n            area(p.prev, p, p.next) >= 0) return false;\n        p = p.next;\n    }\n\n    return true;\n}\n\nfunction isEarHashed(ear, minX, minY, invSize) {\n    const a = ear.prev,\n        b = ear,\n        c = ear.next;\n\n    if (area(a, b, c) >= 0) return false; // reflex, can't be an ear\n\n    const ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;\n\n    // triangle bbox\n    const x0 = Math.min(ax, bx, cx),\n        y0 = Math.min(ay, by, cy),\n        x1 = Math.max(ax, bx, cx),\n        y1 = Math.max(ay, by, cy);\n\n    // z-order range for the current triangle bbox;\n    const minZ = zOrder(x0, y0, minX, minY, invSize),\n        maxZ = zOrder(x1, y1, minX, minY, invSize);\n\n    let p = ear.prevZ,\n        n = ear.nextZ;\n\n    // look for points inside the triangle in both directions\n    while (p && p.z >= minZ && n && n.z <= maxZ) {\n        if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== a && p !== c &&\n            pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;\n        p = p.prevZ;\n\n        if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== a && n !== c &&\n            pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0) return false;\n        n = n.nextZ;\n    }\n\n    // look for remaining points in decreasing z-order\n    while (p && p.z >= minZ) {\n        if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== a && p !== c &&\n            pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;\n        p = p.prevZ;\n    }\n\n    // look for remaining points in increasing z-order\n    while (n && n.z <= maxZ) {\n        if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== a && n !== c &&\n            pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0) return false;\n        n = n.nextZ;\n    }\n\n    return true;\n}\n\n// go through all polygon nodes and cure small local self-intersections\nfunction cureLocalIntersections(start, triangles) {\n    let p = start;\n    do {\n        const a = p.prev,\n            b = p.next.next;\n\n        if (!equals(a, b) && intersects(a, p, p.next, b) && locallyInside(a, b) && locallyInside(b, a)) {\n\n            triangles.push(a.i, p.i, b.i);\n\n            // remove two nodes involved\n            removeNode(p);\n            removeNode(p.next);\n\n            p = start = b;\n        }\n        p = p.next;\n    } while (p !== start);\n\n    return filterPoints(p);\n}\n\n// try splitting polygon into two and triangulate them independently\nfunction splitEarcut(start, triangles, dim, minX, minY, invSize) {\n    // look for a valid diagonal that divides the polygon into two\n    let a = start;\n    do {\n        let b = a.next.next;\n        while (b !== a.prev) {\n            if (a.i !== b.i && isValidDiagonal(a, b)) {\n                // split the polygon in two by the diagonal\n                let c = splitPolygon(a, b);\n\n                // filter colinear points around the cuts\n                a = filterPoints(a, a.next);\n                c = filterPoints(c, c.next);\n\n                // run earcut on each half\n                earcutLinked(a, triangles, dim, minX, minY, invSize, 0);\n                earcutLinked(c, triangles, dim, minX, minY, invSize, 0);\n                return;\n            }\n            b = b.next;\n        }\n        a = a.next;\n    } while (a !== start);\n}\n\n// link every hole into the outer loop, producing a single-ring polygon without holes\nfunction eliminateHoles(data, holeIndices, outerNode, dim) {\n    const queue = [];\n\n    for (let i = 0, len = holeIndices.length; i < len; i++) {\n        const start = holeIndices[i] * dim;\n        const end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;\n        const list = linkedList(data, start, end, dim, false);\n        if (list === list.next) list.steiner = true;\n        queue.push(getLeftmost(list));\n    }\n\n    queue.sort(compareXYSlope);\n\n    // process holes from left to right\n    for (let i = 0; i < queue.length; i++) {\n        outerNode = eliminateHole(queue[i], outerNode);\n    }\n\n    return outerNode;\n}\n\nfunction compareXYSlope(a, b) {\n    let result = a.x - b.x;\n    // when the left-most point of 2 holes meet at a vertex, sort the holes counterclockwise so that when we find\n    // the bridge to the outer shell is always the point that they meet at.\n    if (result === 0) {\n        result = a.y - b.y;\n        if (result === 0) {\n            const aSlope = (a.next.y - a.y) / (a.next.x - a.x);\n            const bSlope = (b.next.y - b.y) / (b.next.x - b.x);\n            result = aSlope - bSlope;\n        }\n    }\n    return result;\n}\n\n// find a bridge between vertices that connects hole with an outer ring and link it\nfunction eliminateHole(hole, outerNode) {\n    const bridge = findHoleBridge(hole, outerNode);\n    if (!bridge) {\n        return outerNode;\n    }\n\n    const bridgeReverse = splitPolygon(bridge, hole);\n\n    // filter collinear points around the cuts\n    filterPoints(bridgeReverse, bridgeReverse.next);\n    return filterPoints(bridge, bridge.next);\n}\n\n// David Eberly's algorithm for finding a bridge between hole and outer polygon\nfunction findHoleBridge(hole, outerNode) {\n    let p = outerNode;\n    const hx = hole.x;\n    const hy = hole.y;\n    let qx = -Infinity;\n    let m;\n\n    // find a segment intersected by a ray from the hole's leftmost point to the left;\n    // segment's endpoint with lesser x will be potential connection point\n    // unless they intersect at a vertex, then choose the vertex\n    if (equals(hole, p)) return p;\n    do {\n        if (equals(hole, p.next)) return p.next;\n        else if (hy <= p.y && hy >= p.next.y && p.next.y !== p.y) {\n            const x = p.x + (hy - p.y) * (p.next.x - p.x) / (p.next.y - p.y);\n            if (x <= hx && x > qx) {\n                qx = x;\n                m = p.x < p.next.x ? p : p.next;\n                if (x === hx) return m; // hole touches outer segment; pick leftmost endpoint\n            }\n        }\n        p = p.next;\n    } while (p !== outerNode);\n\n    if (!m) return null;\n\n    // look for points inside the triangle of hole point, segment intersection and endpoint;\n    // if there are no points found, we have a valid connection;\n    // otherwise choose the point of the minimum angle with the ray as connection point\n\n    const stop = m;\n    const mx = m.x;\n    const my = m.y;\n    let tanMin = Infinity;\n\n    p = m;\n\n    do {\n        if (hx >= p.x && p.x >= mx && hx !== p.x &&\n                pointInTriangle(hy < my ? hx : qx, hy, mx, my, hy < my ? qx : hx, hy, p.x, p.y)) {\n\n            const tan = Math.abs(hy - p.y) / (hx - p.x); // tangential\n\n            if (locallyInside(p, hole) &&\n                (tan < tanMin || (tan === tanMin && (p.x > m.x || (p.x === m.x && sectorContainsSector(m, p)))))) {\n                m = p;\n                tanMin = tan;\n            }\n        }\n\n        p = p.next;\n    } while (p !== stop);\n\n    return m;\n}\n\n// whether sector in vertex m contains sector in vertex p in the same coordinates\nfunction sectorContainsSector(m, p) {\n    return area(m.prev, m, p.prev) < 0 && area(p.next, m, m.next) < 0;\n}\n\n// interlink polygon nodes in z-order\nfunction indexCurve(start, minX, minY, invSize) {\n    let p = start;\n    do {\n        if (p.z === 0) p.z = zOrder(p.x, p.y, minX, minY, invSize);\n        p.prevZ = p.prev;\n        p.nextZ = p.next;\n        p = p.next;\n    } while (p !== start);\n\n    p.prevZ.nextZ = null;\n    p.prevZ = null;\n\n    sortLinked(p);\n}\n\n// Simon Tatham's linked list merge sort algorithm\n// http://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html\nfunction sortLinked(list) {\n    let numMerges;\n    let inSize = 1;\n\n    do {\n        let p = list;\n        let e;\n        list = null;\n        let tail = null;\n        numMerges = 0;\n\n        while (p) {\n            numMerges++;\n            let q = p;\n            let pSize = 0;\n            for (let i = 0; i < inSize; i++) {\n                pSize++;\n                q = q.nextZ;\n                if (!q) break;\n            }\n            let qSize = inSize;\n\n            while (pSize > 0 || (qSize > 0 && q)) {\n\n                if (pSize !== 0 && (qSize === 0 || !q || p.z <= q.z)) {\n                    e = p;\n                    p = p.nextZ;\n                    pSize--;\n                } else {\n                    e = q;\n                    q = q.nextZ;\n                    qSize--;\n                }\n\n                if (tail) tail.nextZ = e;\n                else list = e;\n\n                e.prevZ = tail;\n                tail = e;\n            }\n\n            p = q;\n        }\n\n        tail.nextZ = null;\n        inSize *= 2;\n\n    } while (numMerges > 1);\n\n    return list;\n}\n\n// z-order of a point given coords and inverse of the longer side of data bbox\nfunction zOrder(x, y, minX, minY, invSize) {\n    // coords are transformed into non-negative 15-bit integer range\n    x = (x - minX) * invSize | 0;\n    y = (y - minY) * invSize | 0;\n\n    x = (x | (x << 8)) & 0x00FF00FF;\n    x = (x | (x << 4)) & 0x0F0F0F0F;\n    x = (x | (x << 2)) & 0x33333333;\n    x = (x | (x << 1)) & 0x55555555;\n\n    y = (y | (y << 8)) & 0x00FF00FF;\n    y = (y | (y << 4)) & 0x0F0F0F0F;\n    y = (y | (y << 2)) & 0x33333333;\n    y = (y | (y << 1)) & 0x55555555;\n\n    return x | (y << 1);\n}\n\n// find the leftmost node of a polygon ring\nfunction getLeftmost(start) {\n    let p = start,\n        leftmost = start;\n    do {\n        if (p.x < leftmost.x || (p.x === leftmost.x && p.y < leftmost.y)) leftmost = p;\n        p = p.next;\n    } while (p !== start);\n\n    return leftmost;\n}\n\n// check if a point lies within a convex triangle\nfunction pointInTriangle(ax, ay, bx, by, cx, cy, px, py) {\n    return (cx - px) * (ay - py) >= (ax - px) * (cy - py) &&\n           (ax - px) * (by - py) >= (bx - px) * (ay - py) &&\n           (bx - px) * (cy - py) >= (cx - px) * (by - py);\n}\n\n// check if a point lies within a convex triangle but false if its equal to the first point of the triangle\nfunction pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, px, py) {\n    return !(ax === px && ay === py) && pointInTriangle(ax, ay, bx, by, cx, cy, px, py);\n}\n\n// check if a diagonal between two polygon nodes is valid (lies in polygon interior)\nfunction isValidDiagonal(a, b) {\n    return a.next.i !== b.i && a.prev.i !== b.i && !intersectsPolygon(a, b) && // doesn't intersect other edges\n           (locallyInside(a, b) && locallyInside(b, a) && middleInside(a, b) && // locally visible\n            (area(a.prev, a, b.prev) || area(a, b.prev, b)) || // does not create opposite-facing sectors\n            equals(a, b) && area(a.prev, a, a.next) > 0 && area(b.prev, b, b.next) > 0); // special zero-length case\n}\n\n// signed area of a triangle\nfunction area(p, q, r) {\n    return (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);\n}\n\n// check if two points are equal\nfunction equals(p1, p2) {\n    return p1.x === p2.x && p1.y === p2.y;\n}\n\n// check if two segments intersect\nfunction intersects(p1, q1, p2, q2) {\n    const o1 = sign(area(p1, q1, p2));\n    const o2 = sign(area(p1, q1, q2));\n    const o3 = sign(area(p2, q2, p1));\n    const o4 = sign(area(p2, q2, q1));\n\n    if (o1 !== o2 && o3 !== o4) return true; // general case\n\n    if (o1 === 0 && onSegment(p1, p2, q1)) return true; // p1, q1 and p2 are collinear and p2 lies on p1q1\n    if (o2 === 0 && onSegment(p1, q2, q1)) return true; // p1, q1 and q2 are collinear and q2 lies on p1q1\n    if (o3 === 0 && onSegment(p2, p1, q2)) return true; // p2, q2 and p1 are collinear and p1 lies on p2q2\n    if (o4 === 0 && onSegment(p2, q1, q2)) return true; // p2, q2 and q1 are collinear and q1 lies on p2q2\n\n    return false;\n}\n\n// for collinear points p, q, r, check if point q lies on segment pr\nfunction onSegment(p, q, r) {\n    return q.x <= Math.max(p.x, r.x) && q.x >= Math.min(p.x, r.x) && q.y <= Math.max(p.y, r.y) && q.y >= Math.min(p.y, r.y);\n}\n\nfunction sign(num) {\n    return num > 0 ? 1 : num < 0 ? -1 : 0;\n}\n\n// check if a polygon diagonal intersects any polygon segments\nfunction intersectsPolygon(a, b) {\n    let p = a;\n    do {\n        if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\n                intersects(p, p.next, a, b)) return true;\n        p = p.next;\n    } while (p !== a);\n\n    return false;\n}\n\n// check if a polygon diagonal is locally inside the polygon\nfunction locallyInside(a, b) {\n    return area(a.prev, a, a.next) < 0 ?\n        area(a, b, a.next) >= 0 && area(a, a.prev, b) >= 0 :\n        area(a, b, a.prev) < 0 || area(a, a.next, b) < 0;\n}\n\n// check if the middle point of a polygon diagonal is inside the polygon\nfunction middleInside(a, b) {\n    let p = a;\n    let inside = false;\n    const px = (a.x + b.x) / 2;\n    const py = (a.y + b.y) / 2;\n    do {\n        if (((p.y > py) !== (p.next.y > py)) && p.next.y !== p.y &&\n                (px < (p.next.x - p.x) * (py - p.y) / (p.next.y - p.y) + p.x))\n            inside = !inside;\n        p = p.next;\n    } while (p !== a);\n\n    return inside;\n}\n\n// link two polygon vertices with a bridge; if the vertices belong to the same ring, it splits polygon into two;\n// if one belongs to the outer ring and another to a hole, it merges it into a single ring\nfunction splitPolygon(a, b) {\n    const a2 = createNode(a.i, a.x, a.y),\n        b2 = createNode(b.i, b.x, b.y),\n        an = a.next,\n        bp = b.prev;\n\n    a.next = b;\n    b.prev = a;\n\n    a2.next = an;\n    an.prev = a2;\n\n    b2.next = a2;\n    a2.prev = b2;\n\n    bp.next = b2;\n    b2.prev = bp;\n\n    return b2;\n}\n\n// create a node and optionally link it with previous one (in a circular doubly linked list)\nfunction insertNode(i, x, y, last) {\n    const p = createNode(i, x, y);\n\n    if (!last) {\n        p.prev = p;\n        p.next = p;\n\n    } else {\n        p.next = last.next;\n        p.prev = last;\n        last.next.prev = p;\n        last.next = p;\n    }\n    return p;\n}\n\nfunction removeNode(p) {\n    p.next.prev = p.prev;\n    p.prev.next = p.next;\n\n    if (p.prevZ) p.prevZ.nextZ = p.nextZ;\n    if (p.nextZ) p.nextZ.prevZ = p.prevZ;\n}\n\nfunction createNode(i, x, y) {\n    return {\n        i, // vertex index in coordinates array\n        x, y, // vertex coordinates\n        prev: null, // previous and next vertex nodes in a polygon ring\n        next: null,\n        z: 0, // z-order curve value\n        prevZ: null, // previous and next nodes in z-order\n        nextZ: null,\n        steiner: false // indicates whether this is a steiner point\n    };\n}\n\n// return a percentage difference between the polygon area and its triangulation area;\n// used to verify correctness of triangulation\nexport function deviation(data, holeIndices, dim, triangles) {\n    const hasHoles = holeIndices && holeIndices.length;\n    const outerLen = hasHoles ? holeIndices[0] * dim : data.length;\n\n    let polygonArea = Math.abs(signedArea(data, 0, outerLen, dim));\n    if (hasHoles) {\n        for (let i = 0, len = holeIndices.length; i < len; i++) {\n            const start = holeIndices[i] * dim;\n            const end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;\n            polygonArea -= Math.abs(signedArea(data, start, end, dim));\n        }\n    }\n\n    let trianglesArea = 0;\n    for (let i = 0; i < triangles.length; i += 3) {\n        const a = triangles[i] * dim;\n        const b = triangles[i + 1] * dim;\n        const c = triangles[i + 2] * dim;\n        trianglesArea += Math.abs(\n            (data[a] - data[c]) * (data[b + 1] - data[a + 1]) -\n            (data[a] - data[b]) * (data[c + 1] - data[a + 1]));\n    }\n\n    return polygonArea === 0 && trianglesArea === 0 ? 0 :\n        Math.abs((trianglesArea - polygonArea) / polygonArea);\n}\n\nfunction signedArea(data, start, end, dim) {\n    let sum = 0;\n    for (let i = start, j = end - dim; i < end; i += dim) {\n        sum += (data[j] - data[i]) * (data[i + 1] + data[j + 1]);\n        j = i;\n    }\n    return sum;\n}\n\n// turn a polygon in a multi-dimensional array form (e.g. as in GeoJSON) into a form Earcut accepts\nexport function flatten(data) {\n    const vertices = [];\n    const holes = [];\n    const dimensions = data[0][0].length;\n    let holeIndex = 0;\n    let prevLen = 0;\n\n    for (const ring of data) {\n        for (const p of ring) {\n            for (let d = 0; d < dimensions; d++) vertices.push(p[d]);\n        }\n        if (prevLen) {\n            holeIndex += prevLen;\n            holes.push(holeIndex);\n        }\n        prevLen = ring.length;\n    }\n    return {vertices, holes, dimensions};\n}\n"],"x_google_ignoreList":[0],"mappings":";AACA,SAAwB,EAAO,GAAM,GAAa,IAAM,GAAG;CAEvD,IAAM,IAAW,KAAe,EAAY,QACtC,IAAW,IAAW,EAAY,KAAK,IAAM,EAAK,QACpD,IAAY,EAAW,GAAM,GAAG,GAAU,GAAK,GAAK,EAClD,IAAY,EAAE;CAEpB,IAAI,CAAC,KAAa,EAAU,SAAS,EAAU,MAAM,OAAO;CAE5D,IAAI,GAAM,GAAM;CAKhB,IAHI,MAAU,IAAY,EAAe,GAAM,GAAa,GAAW,EAAI,GAGvE,EAAK,SAAS,KAAK,GAAK;EAExB,AADA,IAAO,EAAK,IACZ,IAAO,EAAK;EACZ,IAAI,IAAO,GACP,IAAO;EAEX,KAAK,IAAI,IAAI,GAAK,IAAI,GAAU,KAAK,GAAK;GACtC,IAAM,IAAI,EAAK,IACT,IAAI,EAAK,IAAI;GAInB,AAHI,IAAI,MAAM,IAAO,IACjB,IAAI,MAAM,IAAO,IACjB,IAAI,MAAM,IAAO,IACjB,IAAI,MAAM,IAAO;;EAKzB,AADA,IAAU,KAAK,IAAI,IAAO,GAAM,IAAO,EAAK,EAC5C,IAAU,MAAY,IAAsB,IAAlB,QAAQ;;CAKtC,OAFA,EAAa,GAAW,GAAW,GAAK,GAAM,GAAM,GAAS,EAAE,EAExD;;AAIX,SAAS,EAAW,GAAM,GAAO,GAAK,GAAK,GAAW;CAClD,IAAI;CAEJ,IAAI,MAAe,EAAW,GAAM,GAAO,GAAK,EAAI,GAAG,GACnD,KAAK,IAAI,IAAI,GAAO,IAAI,GAAK,KAAK,GAAK,IAAO,EAAW,IAAI,IAAM,GAAG,EAAK,IAAI,EAAK,IAAI,IAAI,EAAK;MAEjG,KAAK,IAAI,IAAI,IAAM,GAAK,KAAK,GAAO,KAAK,GAAK,IAAO,EAAW,IAAI,IAAM,GAAG,EAAK,IAAI,EAAK,IAAI,IAAI,EAAK;CAQ5G,OALI,KAAQ,EAAO,GAAM,EAAK,KAAK,KAC/B,EAAW,EAAK,EAChB,IAAO,EAAK,OAGT;;AAIX,SAAS,EAAa,GAAO,GAAK;CAC9B,IAAI,CAAC,GAAO,OAAO;CACnB,AAAU,MAAM;CAEhB,IAAI,IAAI,GACJ;CACJ;EAGI,IAFA,IAAQ,IAEJ,CAAC,EAAE,YAAY,EAAO,GAAG,EAAE,KAAK,IAAI,EAAK,EAAE,MAAM,GAAG,EAAE,KAAK,KAAK,IAAI;GAGpE,IAFA,EAAW,EAAE,EACb,IAAI,IAAM,EAAE,MACR,MAAM,EAAE,MAAM;GAClB,IAAQ;SAGR,IAAI,EAAE;QAEL,KAAS,MAAM;CAExB,OAAO;;AAIX,SAAS,EAAa,GAAK,GAAW,GAAK,GAAM,GAAM,GAAS,GAAM;CAClE,IAAI,CAAC,GAAK;CAGV,AAAI,CAAC,KAAQ,KAAS,EAAW,GAAK,GAAM,GAAM,EAAQ;CAE1D,IAAI,IAAO;CAGX,OAAO,EAAI,SAAS,EAAI,OAAM;EAC1B,IAAM,IAAO,EAAI,MACX,IAAO,EAAI;EAEjB,IAAI,IAAU,EAAY,GAAK,GAAM,GAAM,EAAQ,GAAG,EAAM,EAAI,EAAE;GAO9D,AANA,EAAU,KAAK,EAAK,GAAG,EAAI,GAAG,EAAK,EAAE,EAErC,EAAW,EAAI,EAGf,IAAM,EAAK,MACX,IAAO,EAAK;GAEZ;;EAMJ,IAHA,IAAM,GAGF,MAAQ,GAAM;GAEd,AAAK,IAIM,MAAS,KAChB,IAAM,EAAuB,EAAa,EAAI,EAAE,EAAU,EAC1D,EAAa,GAAK,GAAW,GAAK,GAAM,GAAM,GAAS,EAAE,IAGlD,MAAS,KAChB,EAAY,GAAK,GAAW,GAAK,GAAM,GAAM,EAAQ,GATrD,EAAa,EAAa,EAAI,EAAE,GAAW,GAAK,GAAM,GAAM,GAAS,EAAE;GAY3E;;;;AAMZ,SAAS,EAAM,GAAK;CAChB,IAAM,IAAI,EAAI,MACV,IAAI,GACJ,IAAI,EAAI;CAEZ,IAAI,EAAK,GAAG,GAAG,EAAE,IAAI,GAAG,OAAO;CAG/B,IAAM,IAAK,EAAE,GAAG,IAAK,EAAE,GAAG,IAAK,EAAE,GAAG,IAAK,EAAE,GAAG,IAAK,EAAE,GAAG,IAAK,EAAE,GAGzD,IAAK,KAAK,IAAI,GAAI,GAAI,EAAG,EAC3B,IAAK,KAAK,IAAI,GAAI,GAAI,EAAG,EACzB,IAAK,KAAK,IAAI,GAAI,GAAI,EAAG,EACzB,IAAK,KAAK,IAAI,GAAI,GAAI,EAAG,EAEzB,IAAI,EAAE;CACV,OAAO,MAAM,IAAG;EACZ,IAAI,EAAE,KAAK,KAAM,EAAE,KAAK,KAAM,EAAE,KAAK,KAAM,EAAE,KAAK,KAC9C,EAA2B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,GAAG,EAAE,EAAE,IAC5D,EAAK,EAAE,MAAM,GAAG,EAAE,KAAK,IAAI,GAAG,OAAO;EACzC,IAAI,EAAE;;CAGV,OAAO;;AAGX,SAAS,EAAY,GAAK,GAAM,GAAM,GAAS;CAC3C,IAAM,IAAI,EAAI,MACV,IAAI,GACJ,IAAI,EAAI;CAEZ,IAAI,EAAK,GAAG,GAAG,EAAE,IAAI,GAAG,OAAO;CAE/B,IAAM,IAAK,EAAE,GAAG,IAAK,EAAE,GAAG,IAAK,EAAE,GAAG,IAAK,EAAE,GAAG,IAAK,EAAE,GAAG,IAAK,EAAE,GAGzD,IAAK,KAAK,IAAI,GAAI,GAAI,EAAG,EAC3B,IAAK,KAAK,IAAI,GAAI,GAAI,EAAG,EACzB,IAAK,KAAK,IAAI,GAAI,GAAI,EAAG,EACzB,IAAK,KAAK,IAAI,GAAI,GAAI,EAAG,EAGvB,IAAO,EAAO,GAAI,GAAI,GAAM,GAAM,EAAQ,EAC5C,IAAO,EAAO,GAAI,GAAI,GAAM,GAAM,EAAQ,EAE1C,IAAI,EAAI,OACR,IAAI,EAAI;CAGZ,OAAO,KAAK,EAAE,KAAK,KAAQ,KAAK,EAAE,KAAK,IAAM;EAKzC,IAJI,EAAE,KAAK,KAAM,EAAE,KAAK,KAAM,EAAE,KAAK,KAAM,EAAE,KAAK,KAAM,MAAM,KAAK,MAAM,KACrE,EAA2B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,GAAG,EAAE,EAAE,IAAI,EAAK,EAAE,MAAM,GAAG,EAAE,KAAK,IAAI,MAC/F,IAAI,EAAE,OAEF,EAAE,KAAK,KAAM,EAAE,KAAK,KAAM,EAAE,KAAK,KAAM,EAAE,KAAK,KAAM,MAAM,KAAK,MAAM,KACrE,EAA2B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,GAAG,EAAE,EAAE,IAAI,EAAK,EAAE,MAAM,GAAG,EAAE,KAAK,IAAI,IAAG,OAAO;EACzG,IAAI,EAAE;;CAIV,OAAO,KAAK,EAAE,KAAK,IAAM;EACrB,IAAI,EAAE,KAAK,KAAM,EAAE,KAAK,KAAM,EAAE,KAAK,KAAM,EAAE,KAAK,KAAM,MAAM,KAAK,MAAM,KACrE,EAA2B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,GAAG,EAAE,EAAE,IAAI,EAAK,EAAE,MAAM,GAAG,EAAE,KAAK,IAAI,GAAG,OAAO;EACzG,IAAI,EAAE;;CAIV,OAAO,KAAK,EAAE,KAAK,IAAM;EACrB,IAAI,EAAE,KAAK,KAAM,EAAE,KAAK,KAAM,EAAE,KAAK,KAAM,EAAE,KAAK,KAAM,MAAM,KAAK,MAAM,KACrE,EAA2B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,GAAG,EAAE,EAAE,IAAI,EAAK,EAAE,MAAM,GAAG,EAAE,KAAK,IAAI,GAAG,OAAO;EACzG,IAAI,EAAE;;CAGV,OAAO;;AAIX,SAAS,EAAuB,GAAO,GAAW;CAC9C,IAAI,IAAI;CACR,GAAG;EACC,IAAM,IAAI,EAAE,MACR,IAAI,EAAE,KAAK;EAYf,AAVI,CAAC,EAAO,GAAG,EAAE,IAAI,EAAW,GAAG,GAAG,EAAE,MAAM,EAAE,IAAI,EAAc,GAAG,EAAE,IAAI,EAAc,GAAG,EAAE,KAE1F,EAAU,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAG7B,EAAW,EAAE,EACb,EAAW,EAAE,KAAK,EAElB,IAAI,IAAQ,IAEhB,IAAI,EAAE;UACD,MAAM;CAEf,OAAO,EAAa,EAAE;;AAI1B,SAAS,EAAY,GAAO,GAAW,GAAK,GAAM,GAAM,GAAS;CAE7D,IAAI,IAAI;CACR,GAAG;EACC,IAAI,IAAI,EAAE,KAAK;EACf,OAAO,MAAM,EAAE,OAAM;GACjB,IAAI,EAAE,MAAM,EAAE,KAAK,EAAgB,GAAG,EAAE,EAAE;IAEtC,IAAI,IAAI,EAAa,GAAG,EAAE;IAQ1B,AALA,IAAI,EAAa,GAAG,EAAE,KAAK,EAC3B,IAAI,EAAa,GAAG,EAAE,KAAK,EAG3B,EAAa,GAAG,GAAW,GAAK,GAAM,GAAM,GAAS,EAAE,EACvD,EAAa,GAAG,GAAW,GAAK,GAAM,GAAM,GAAS,EAAE;IACvD;;GAEJ,IAAI,EAAE;;EAEV,IAAI,EAAE;UACD,MAAM;;AAInB,SAAS,EAAe,GAAM,GAAa,GAAW,GAAK;CACvD,IAAM,IAAQ,EAAE;CAEhB,KAAK,IAAI,IAAI,GAAG,IAAM,EAAY,QAAQ,IAAI,GAAK,KAAK;EAGpD,IAAM,IAAO,EAAW,GAFV,EAAY,KAAK,GACnB,IAAI,IAAM,IAAI,EAAY,IAAI,KAAK,IAAM,EAAK,QAChB,GAAK,GAAM;EAErD,AADI,MAAS,EAAK,SAAM,EAAK,UAAU,KACvC,EAAM,KAAK,EAAY,EAAK,CAAC;;CAGjC,EAAM,KAAK,EAAe;CAG1B,KAAK,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,KAC9B,IAAY,EAAc,EAAM,IAAI,EAAU;CAGlD,OAAO;;AAGX,SAAS,EAAe,GAAG,GAAG;CAC1B,IAAI,IAAS,EAAE,IAAI,EAAE;CAWrB,OARI,MAAW,MACX,IAAS,EAAE,IAAI,EAAE,GACb,MAAW,MAGX,KAFgB,EAAE,KAAK,IAAI,EAAE,MAAM,EAAE,KAAK,IAAI,EAAE,MAChC,EAAE,KAAK,IAAI,EAAE,MAAM,EAAE,KAAK,IAAI,EAAE,MAIjD;;AAIX,SAAS,EAAc,GAAM,GAAW;CACpC,IAAM,IAAS,EAAe,GAAM,EAAU;CAC9C,IAAI,CAAC,GACD,OAAO;CAGX,IAAM,IAAgB,EAAa,GAAQ,EAAK;CAIhD,OADA,EAAa,GAAe,EAAc,KAAK,EACxC,EAAa,GAAQ,EAAO,KAAK;;AAI5C,SAAS,EAAe,GAAM,GAAW;CACrC,IAAI,IAAI,GACF,IAAK,EAAK,GACV,IAAK,EAAK,GACZ,IAAK,WACL;CAKJ,IAAI,EAAO,GAAM,EAAE,EAAE,OAAO;CAC5B,GAAG;EACC,IAAI,EAAO,GAAM,EAAE,KAAK,EAAE,OAAO,EAAE;EAC9B,IAAI,KAAM,EAAE,KAAK,KAAM,EAAE,KAAK,KAAK,EAAE,KAAK,MAAM,EAAE,GAAG;GACtD,IAAM,IAAI,EAAE,KAAK,IAAK,EAAE,MAAM,EAAE,KAAK,IAAI,EAAE,MAAM,EAAE,KAAK,IAAI,EAAE;GAC9D,IAAI,KAAK,KAAM,IAAI,MACf,IAAK,GACL,IAAI,EAAE,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,MACvB,MAAM,IAAI,OAAO;;EAG7B,IAAI,EAAE;UACD,MAAM;CAEf,IAAI,CAAC,GAAG,OAAO;CAMf,IAAM,IAAO,GACP,IAAK,EAAE,GACP,IAAK,EAAE,GACT,IAAS;CAEb,IAAI;CAEJ,GAAG;EACC,IAAI,KAAM,EAAE,KAAK,EAAE,KAAK,KAAM,MAAO,EAAE,KAC/B,EAAgB,IAAK,IAAK,IAAK,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,GAAI,EAAE,GAAG,EAAE,EAAE,EAAE;GAErF,IAAM,IAAM,KAAK,IAAI,IAAK,EAAE,EAAE,IAAI,IAAK,EAAE;GAEzC,AAAI,EAAc,GAAG,EAAK,KACrB,IAAM,KAAW,MAAQ,MAAW,EAAE,IAAI,EAAE,KAAM,EAAE,MAAM,EAAE,KAAK,EAAqB,GAAG,EAAE,OAC5F,IAAI,GACJ,IAAS;;EAIjB,IAAI,EAAE;UACD,MAAM;CAEf,OAAO;;AAIX,SAAS,EAAqB,GAAG,GAAG;CAChC,OAAO,EAAK,EAAE,MAAM,GAAG,EAAE,KAAK,GAAG,KAAK,EAAK,EAAE,MAAM,GAAG,EAAE,KAAK,GAAG;;AAIpE,SAAS,EAAW,GAAO,GAAM,GAAM,GAAS;CAC5C,IAAI,IAAI;CACR;EAII,AAHI,EAAE,MAAM,MAAG,EAAE,IAAI,EAAO,EAAE,GAAG,EAAE,GAAG,GAAM,GAAM,EAAQ,GAC1D,EAAE,QAAQ,EAAE,MACZ,EAAE,QAAQ,EAAE,MACZ,IAAI,EAAE;QACD,MAAM;CAKf,AAHA,EAAE,MAAM,QAAQ,MAChB,EAAE,QAAQ,MAEV,EAAW,EAAE;;AAKjB,SAAS,EAAW,GAAM;CACtB,IAAI,GACA,IAAS;CAEb,GAAG;EACC,IAAI,IAAI,GACJ;EACJ,IAAO;EACP,IAAI,IAAO;EAGX,KAFA,IAAY,GAEL,IAAG;GACN;GACA,IAAI,IAAI,GACJ,IAAQ;GACZ,KAAK,IAAI,IAAI,GAAG,IAAI,MAChB,KACA,IAAI,EAAE,OACD,IAHmB;GAK5B,IAAI,IAAQ;GAEZ,OAAO,IAAQ,KAAM,IAAQ,KAAK,IAgB9B,AAdI,MAAU,MAAM,MAAU,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,MAC9C,IAAI,GACJ,IAAI,EAAE,OACN,QAEA,IAAI,GACJ,IAAI,EAAE,OACN,MAGA,IAAM,EAAK,QAAQ,IAClB,IAAO,GAEZ,EAAE,QAAQ,GACV,IAAO;GAGX,IAAI;;EAIR,AADA,EAAK,QAAQ,MACb,KAAU;UAEL,IAAY;CAErB,OAAO;;AAIX,SAAS,EAAO,GAAG,GAAG,GAAM,GAAM,GAAS;CAevC,OAbA,KAAK,IAAI,KAAQ,IAAU,GAC3B,KAAK,IAAI,KAAQ,IAAU,GAE3B,KAAK,IAAK,KAAK,KAAM,UACrB,KAAK,IAAK,KAAK,KAAM,WACrB,KAAK,IAAK,KAAK,KAAM,WACrB,KAAK,IAAK,KAAK,KAAM,YAErB,KAAK,IAAK,KAAK,KAAM,UACrB,KAAK,IAAK,KAAK,KAAM,WACrB,KAAK,IAAK,KAAK,KAAM,WACrB,KAAK,IAAK,KAAK,KAAM,YAEd,IAAK,KAAK;;AAIrB,SAAS,EAAY,GAAO;CACxB,IAAI,IAAI,GACJ,IAAW;CACf;EAEI,CADI,EAAE,IAAI,EAAS,KAAM,EAAE,MAAM,EAAS,KAAK,EAAE,IAAI,EAAS,OAAI,IAAW,IAC7E,IAAI,EAAE;QACD,MAAM;CAEf,OAAO;;AAIX,SAAS,EAAgB,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI;CACrD,QAAQ,IAAK,MAAO,IAAK,OAAQ,IAAK,MAAO,IAAK,OAC1C,IAAK,MAAO,IAAK,OAAQ,IAAK,MAAO,IAAK,OAC1C,IAAK,MAAO,IAAK,OAAQ,IAAK,MAAO,IAAK;;AAItD,SAAS,EAA2B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI;CAChE,OAAO,EAAE,MAAO,KAAM,MAAO,MAAO,EAAgB,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG;;AAIvF,SAAS,EAAgB,GAAG,GAAG;CAC3B,OAAO,EAAE,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,MAAM,EAAE,KAAK,CAAC,EAAkB,GAAG,EAAE,KAC/D,EAAc,GAAG,EAAE,IAAI,EAAc,GAAG,EAAE,IAAI,EAAa,GAAG,EAAE,KAC/D,EAAK,EAAE,MAAM,GAAG,EAAE,KAAK,IAAI,EAAK,GAAG,EAAE,MAAM,EAAE,KAC9C,EAAO,GAAG,EAAE,IAAI,EAAK,EAAE,MAAM,GAAG,EAAE,KAAK,GAAG,KAAK,EAAK,EAAE,MAAM,GAAG,EAAE,KAAK,GAAG;;AAIrF,SAAS,EAAK,GAAG,GAAG,GAAG;CACnB,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE;;AAI9D,SAAS,EAAO,GAAI,GAAI;CACpB,OAAO,EAAG,MAAM,EAAG,KAAK,EAAG,MAAM,EAAG;;AAIxC,SAAS,EAAW,GAAI,GAAI,GAAI,GAAI;CAChC,IAAM,IAAK,EAAK,EAAK,GAAI,GAAI,EAAG,CAAC,EAC3B,IAAK,EAAK,EAAK,GAAI,GAAI,EAAG,CAAC,EAC3B,IAAK,EAAK,EAAK,GAAI,GAAI,EAAG,CAAC,EAC3B,IAAK,EAAK,EAAK,GAAI,GAAI,EAAG,CAAC;CASjC,OAFA,GALI,MAAO,KAAM,MAAO,KAEpB,MAAO,KAAK,EAAU,GAAI,GAAI,EAAG,IACjC,MAAO,KAAK,EAAU,GAAI,GAAI,EAAG,IACjC,MAAO,KAAK,EAAU,GAAI,GAAI,EAAG,IACjC,MAAO,KAAK,EAAU,GAAI,GAAI,EAAG;;AAMzC,SAAS,EAAU,GAAG,GAAG,GAAG;CACxB,OAAO,EAAE,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,EAAE;;AAG3H,SAAS,EAAK,GAAK;CACf,OAAO,IAAM,IAAI,IAAI,IAAM,IAAI,KAAK;;AAIxC,SAAS,EAAkB,GAAG,GAAG;CAC7B,IAAI,IAAI;CACR,GAAG;EACC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,MAAM,EAAE,KAC7D,EAAW,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,OAAO;EAC5C,IAAI,EAAE;UACD,MAAM;CAEf,OAAO;;AAIX,SAAS,EAAc,GAAG,GAAG;CACzB,OAAO,EAAK,EAAE,MAAM,GAAG,EAAE,KAAK,GAAG,IAC7B,EAAK,GAAG,GAAG,EAAE,KAAK,IAAI,KAAK,EAAK,GAAG,EAAE,MAAM,EAAE,IAAI,IACjD,EAAK,GAAG,GAAG,EAAE,KAAK,GAAG,KAAK,EAAK,GAAG,EAAE,MAAM,EAAE,GAAG;;AAIvD,SAAS,EAAa,GAAG,GAAG;CACxB,IAAI,IAAI,GACJ,IAAS,IACP,KAAM,EAAE,IAAI,EAAE,KAAK,GACnB,KAAM,EAAE,IAAI,EAAE,KAAK;CACzB;EAII,AAHM,EAAE,IAAI,KAAS,EAAE,KAAK,IAAI,KAAQ,EAAE,KAAK,MAAM,EAAE,KAC9C,KAAM,EAAE,KAAK,IAAI,EAAE,MAAM,IAAK,EAAE,MAAM,EAAE,KAAK,IAAI,EAAE,KAAK,EAAE,MAC/D,IAAS,CAAC,IACd,IAAI,EAAE;QACD,MAAM;CAEf,OAAO;;AAKX,SAAS,EAAa,GAAG,GAAG;CACxB,IAAM,IAAK,EAAW,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAChC,IAAK,EAAW,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAC9B,IAAK,EAAE,MACP,IAAK,EAAE;CAcX,OAZA,EAAE,OAAO,GACT,EAAE,OAAO,GAET,EAAG,OAAO,GACV,EAAG,OAAO,GAEV,EAAG,OAAO,GACV,EAAG,OAAO,GAEV,EAAG,OAAO,GACV,EAAG,OAAO,GAEH;;AAIX,SAAS,EAAW,GAAG,GAAG,GAAG,GAAM;CAC/B,IAAM,IAAI,EAAW,GAAG,GAAG,EAAE;CAY7B,OAVK,KAKD,EAAE,OAAO,EAAK,MACd,EAAE,OAAO,GACT,EAAK,KAAK,OAAO,GACjB,EAAK,OAAO,MAPZ,EAAE,OAAO,GACT,EAAE,OAAO,IAQN;;AAGX,SAAS,EAAW,GAAG;CAKnB,AAJA,EAAE,KAAK,OAAO,EAAE,MAChB,EAAE,KAAK,OAAO,EAAE,MAEZ,EAAE,UAAO,EAAE,MAAM,QAAQ,EAAE,QAC3B,EAAE,UAAO,EAAE,MAAM,QAAQ,EAAE;;AAGnC,SAAS,EAAW,GAAG,GAAG,GAAG;CACzB,OAAO;EACH;EACA;EAAG;EACH,MAAM;EACN,MAAM;EACN,GAAG;EACH,OAAO;EACP,OAAO;EACP,SAAS;EACZ;;AAgCL,SAAS,EAAW,GAAM,GAAO,GAAK,GAAK;CACvC,IAAI,IAAM;CACV,KAAK,IAAI,IAAI,GAAO,IAAI,IAAM,GAAK,IAAI,GAAK,KAAK,GAE7C,AADA,MAAQ,EAAK,KAAK,EAAK,OAAO,EAAK,IAAI,KAAK,EAAK,IAAI,KACrD,IAAI;CAER,OAAO"}