@undp/data-viz 2.6.0 → 2.6.1

package/dist/esm-D23XoYrV.js

@@ -0,0 +1,653 @@
+import { a as e, n as t, o as n, r, t as i } from "./chunk-foFoljWS.js";
+//#region node_modules/@turf/helpers/dist/esm/index.js
+var a = 6371008.8;
+a * 100, a * 100, 360 / (2 * Math.PI), a * 3.28084, a * 39.37, a / 1e3, a / 1e3, a / 1609.344, a * 1e3, a * 1e3, a / 1852, a * 1.0936;
+function o(e, t, n = {}) {
+	let r = { type: "Feature" };
+	return (n.id === 0 || n.id) && (r.id = n.id), n.bbox && (r.bbox = n.bbox), r.properties = t || {}, r.geometry = e, r;
+}
+function s(e, t, n = {}) {
+	if (!e) throw Error("coordinates is required");
+	if (!Array.isArray(e)) throw Error("coordinates must be an Array");
+	if (e.length < 2) throw Error("coordinates must be at least 2 numbers long");
+	if (!l(e[0]) || !l(e[1])) throw Error("coordinates must contain numbers");
+	return o({
+		type: "Point",
+		coordinates: e
+	}, t, n);
+}
+function c(e, t, n = {}) {
+	for (let t of e) {
+		if (t.length < 4) throw Error("Each LinearRing of a Polygon must have 4 or more Positions.");
+		if (t[t.length - 1].length !== t[0].length) throw Error("First and last Position are not equivalent.");
+		for (let e = 0; e < t[t.length - 1].length; e++) if (t[t.length - 1][e] !== t[0][e]) throw Error("First and last Position are not equivalent.");
+	}
+	return o({
+		type: "Polygon",
+		coordinates: e
+	}, t, n);
+}
+function l(e) {
+	return !isNaN(e) && e !== null && !Array.isArray(e);
+}
+//#endregion
+//#region node_modules/@turf/meta/dist/esm/index.js
+function u(e, t, n) {
+	if (e !== null) for (var r, i, a, o, s, c, l, d = 0, f = 0, p, m = e.type, h = m === "FeatureCollection", g = m === "Feature", _ = h ? e.features.length : 1, v = 0; v < _; v++) {
+		l = h ? e.features[v].geometry : g ? e.geometry : e, p = l ? l.type === "GeometryCollection" : !1, s = p ? l.geometries.length : 1;
+		for (var y = 0; y < s; y++) {
+			var b = 0, x = 0;
+			if (o = p ? l.geometries[y] : l, o !== null) {
+				c = o.coordinates;
+				var S = o.type;
+				switch (d = n && (S === "Polygon" || S === "MultiPolygon") ? 1 : 0, S) {
+					case null: break;
+					case "Point":
+						if (t(c, f, v, b, x) === !1) return !1;
+						f++, b++;
+						break;
+					case "LineString":
+					case "MultiPoint":
+						for (r = 0; r < c.length; r++) {
+							if (t(c[r], f, v, b, x) === !1) return !1;
+							f++, S === "MultiPoint" && b++;
+						}
+						S === "LineString" && b++;
+						break;
+					case "Polygon":
+					case "MultiLineString":
+						for (r = 0; r < c.length; r++) {
+							for (i = 0; i < c[r].length - d; i++) {
+								if (t(c[r][i], f, v, b, x) === !1) return !1;
+								f++;
+							}
+							S === "MultiLineString" && b++, S === "Polygon" && x++;
+						}
+						S === "Polygon" && b++;
+						break;
+					case "MultiPolygon":
+						for (r = 0; r < c.length; r++) {
+							for (x = 0, i = 0; i < c[r].length; i++) {
+								for (a = 0; a < c[r][i].length - d; a++) {
+									if (t(c[r][i][a], f, v, b, x) === !1) return !1;
+									f++;
+								}
+								x++;
+							}
+							b++;
+						}
+						break;
+					case "GeometryCollection":
+						for (r = 0; r < o.geometries.length; r++) if (u(o.geometries[r], t, n) === !1) return !1;
+						break;
+					default: throw Error("Unknown Geometry Type");
+				}
+			}
+		}
+	}
+}
+function d(e, t) {
+	var n, r, i, a, o, s, c, l, u, d, f = 0, p = e.type === "FeatureCollection", m = e.type === "Feature", h = p ? e.features.length : 1;
+	for (n = 0; n < h; n++) {
+		for (s = p ? e.features[n].geometry : m ? e.geometry : e, l = p ? e.features[n].properties : m ? e.properties : {}, u = p ? e.features[n].bbox : m ? e.bbox : void 0, d = p ? e.features[n].id : m ? e.id : void 0, c = s ? s.type === "GeometryCollection" : !1, o = c ? s.geometries.length : 1, i = 0; i < o; i++) {
+			if (a = c ? s.geometries[i] : s, a === null) {
+				if (t(null, f, l, u, d) === !1) return !1;
+				continue;
+			}
+			switch (a.type) {
+				case "Point":
+				case "LineString":
+				case "MultiPoint":
+				case "Polygon":
+				case "MultiLineString":
+				case "MultiPolygon":
+					if (t(a, f, l, u, d) === !1) return !1;
+					break;
+				case "GeometryCollection":
+					for (r = 0; r < a.geometries.length; r++) if (t(a.geometries[r], f, l, u, d) === !1) return !1;
+					break;
+				default: throw Error("Unknown Geometry Type");
+			}
+		}
+		f++;
+	}
+}
+function f(e, t, n) {
+	var r = n;
+	return d(e, function(e, i, a, o, s) {
+		r = i === 0 && n === void 0 ? e : t(r, e, i, a, o, s);
+	}), r;
+}
+//#endregion
+//#region node_modules/rbush/rbush.min.js
+var p = /* @__PURE__ */ i(((e, t) => {
+	(function(n, r) {
+		typeof e == "object" && t !== void 0 ? t.exports = r() : typeof define == "function" && define.amd ? define(r) : (n ||= self).RBush = r();
+	})(e, function() {
+		function e(e, r, i, a, o) {
+			(function e(n, r, i, a, o) {
+				for (; a > i;) {
+					if (a - i > 600) {
+						var s = a - i + 1, c = r - i + 1, l = Math.log(s), u = .5 * Math.exp(2 * l / 3), d = .5 * Math.sqrt(l * u * (s - u) / s) * (c - s / 2 < 0 ? -1 : 1);
+						e(n, r, Math.max(i, Math.floor(r - c * u / s + d)), Math.min(a, Math.floor(r + (s - c) * u / s + d)), o);
+					}
+					var f = n[r], p = i, m = a;
+					for (t(n, i, r), o(n[a], f) > 0 && t(n, i, a); p < m;) {
+						for (t(n, p, m), p++, m--; o(n[p], f) < 0;) p++;
+						for (; o(n[m], f) > 0;) m--;
+					}
+					o(n[i], f) === 0 ? t(n, i, m) : t(n, ++m, a), m <= r && (i = m + 1), r <= m && (a = m - 1);
+				}
+			})(e, r, i || 0, a || e.length - 1, o || n);
+		}
+		function t(e, t, n) {
+			var r = e[t];
+			e[t] = e[n], e[n] = r;
+		}
+		function n(e, t) {
+			return e < t ? -1 : +(e > t);
+		}
+		var r = function(e) {
+			e === void 0 && (e = 9), this._maxEntries = Math.max(4, e), this._minEntries = Math.max(2, Math.ceil(.4 * this._maxEntries)), this.clear();
+		};
+		function i(e, t, n) {
+			if (!n) return t.indexOf(e);
+			for (var r = 0; r < t.length; r++) if (n(e, t[r])) return r;
+			return -1;
+		}
+		function a(e, t) {
+			o(e, 0, e.children.length, t, e);
+		}
+		function o(e, t, n, r, i) {
+			i ||= m(null), i.minX = Infinity, i.minY = Infinity, i.maxX = -Infinity, i.maxY = -Infinity;
+			for (var a = t; a < n; a++) {
+				var o = e.children[a];
+				s(i, e.leaf ? r(o) : o);
+			}
+			return i;
+		}
+		function s(e, t) {
+			return e.minX = Math.min(e.minX, t.minX), e.minY = Math.min(e.minY, t.minY), e.maxX = Math.max(e.maxX, t.maxX), e.maxY = Math.max(e.maxY, t.maxY), e;
+		}
+		function c(e, t) {
+			return e.minX - t.minX;
+		}
+		function l(e, t) {
+			return e.minY - t.minY;
+		}
+		function u(e) {
+			return (e.maxX - e.minX) * (e.maxY - e.minY);
+		}
+		function d(e) {
+			return e.maxX - e.minX + (e.maxY - e.minY);
+		}
+		function f(e, t) {
+			return e.minX <= t.minX && e.minY <= t.minY && t.maxX <= e.maxX && t.maxY <= e.maxY;
+		}
+		function p(e, t) {
+			return t.minX <= e.maxX && t.minY <= e.maxY && t.maxX >= e.minX && t.maxY >= e.minY;
+		}
+		function m(e) {
+			return {
+				children: e,
+				height: 1,
+				leaf: !0,
+				minX: Infinity,
+				minY: Infinity,
+				maxX: -Infinity,
+				maxY: -Infinity
+			};
+		}
+		function h(t, n, r, i, a) {
+			for (var o = [n, r]; o.length;) if (!((r = o.pop()) - (n = o.pop()) <= i)) {
+				var s = n + Math.ceil((r - n) / i / 2) * i;
+				e(t, s, n, r, a), o.push(n, s, s, r);
+			}
+		}
+		return r.prototype.all = function() {
+			return this._all(this.data, []);
+		}, r.prototype.search = function(e) {
+			var t = this.data, n = [];
+			if (!p(e, t)) return n;
+			for (var r = this.toBBox, i = []; t;) {
+				for (var a = 0; a < t.children.length; a++) {
+					var o = t.children[a], s = t.leaf ? r(o) : o;
+					p(e, s) && (t.leaf ? n.push(o) : f(e, s) ? this._all(o, n) : i.push(o));
+				}
+				t = i.pop();
+			}
+			return n;
+		}, r.prototype.collides = function(e) {
+			var t = this.data;
+			if (!p(e, t)) return !1;
+			for (var n = []; t;) {
+				for (var r = 0; r < t.children.length; r++) {
+					var i = t.children[r], a = t.leaf ? this.toBBox(i) : i;
+					if (p(e, a)) {
+						if (t.leaf || f(e, a)) return !0;
+						n.push(i);
+					}
+				}
+				t = n.pop();
+			}
+			return !1;
+		}, r.prototype.load = function(e) {
+			if (!e || !e.length) return this;
+			if (e.length < this._minEntries) {
+				for (var t = 0; t < e.length; t++) this.insert(e[t]);
+				return this;
+			}
+			var n = this._build(e.slice(), 0, e.length - 1, 0);
+			if (this.data.children.length) if (this.data.height === n.height) this._splitRoot(this.data, n);
+			else {
+				if (this.data.height < n.height) {
+					var r = this.data;
+					this.data = n, n = r;
+				}
+				this._insert(n, this.data.height - n.height - 1, !0);
+			}
+			else this.data = n;
+			return this;
+		}, r.prototype.insert = function(e) {
+			return e && this._insert(e, this.data.height - 1), this;
+		}, r.prototype.clear = function() {
+			return this.data = m([]), this;
+		}, r.prototype.remove = function(e, t) {
+			if (!e) return this;
+			for (var n, r, a, o = this.data, s = this.toBBox(e), c = [], l = []; o || c.length;) {
+				if (o || (o = c.pop(), r = c[c.length - 1], n = l.pop(), a = !0), o.leaf) {
+					var u = i(e, o.children, t);
+					if (u !== -1) return o.children.splice(u, 1), c.push(o), this._condense(c), this;
+				}
+				a || o.leaf || !f(o, s) ? r ? (n++, o = r.children[n], a = !1) : o = null : (c.push(o), l.push(n), n = 0, r = o, o = o.children[0]);
+			}
+			return this;
+		}, r.prototype.toBBox = function(e) {
+			return e;
+		}, r.prototype.compareMinX = function(e, t) {
+			return e.minX - t.minX;
+		}, r.prototype.compareMinY = function(e, t) {
+			return e.minY - t.minY;
+		}, r.prototype.toJSON = function() {
+			return this.data;
+		}, r.prototype.fromJSON = function(e) {
+			return this.data = e, this;
+		}, r.prototype._all = function(e, t) {
+			for (var n = []; e;) e.leaf ? t.push.apply(t, e.children) : n.push.apply(n, e.children), e = n.pop();
+			return t;
+		}, r.prototype._build = function(e, t, n, r) {
+			var i, o = n - t + 1, s = this._maxEntries;
+			if (o <= s) return a(i = m(e.slice(t, n + 1)), this.toBBox), i;
+			r || (r = Math.ceil(Math.log(o) / Math.log(s)), s = Math.ceil(o / s ** (r - 1))), (i = m([])).leaf = !1, i.height = r;
+			var c = Math.ceil(o / s), l = c * Math.ceil(Math.sqrt(s));
+			h(e, t, n, l, this.compareMinX);
+			for (var u = t; u <= n; u += l) {
+				var d = Math.min(u + l - 1, n);
+				h(e, u, d, c, this.compareMinY);
+				for (var f = u; f <= d; f += c) {
+					var p = Math.min(f + c - 1, d);
+					i.children.push(this._build(e, f, p, r - 1));
+				}
+			}
+			return a(i, this.toBBox), i;
+		}, r.prototype._chooseSubtree = function(e, t, n, r) {
+			for (; r.push(t), !t.leaf && r.length - 1 !== n;) {
+				for (var i = Infinity, a = Infinity, o = void 0, s = 0; s < t.children.length; s++) {
+					var c = t.children[s], l = u(c), d = (f = e, p = c, (Math.max(p.maxX, f.maxX) - Math.min(p.minX, f.minX)) * (Math.max(p.maxY, f.maxY) - Math.min(p.minY, f.minY)) - l);
+					d < a ? (a = d, i = l < i ? l : i, o = c) : d === a && l < i && (i = l, o = c);
+				}
+				t = o || t.children[0];
+			}
+			var f, p;
+			return t;
+		}, r.prototype._insert = function(e, t, n) {
+			var r = n ? e : this.toBBox(e), i = [], a = this._chooseSubtree(r, this.data, t, i);
+			for (a.children.push(e), s(a, r); t >= 0 && i[t].children.length > this._maxEntries;) this._split(i, t), t--;
+			this._adjustParentBBoxes(r, i, t);
+		}, r.prototype._split = function(e, t) {
+			var n = e[t], r = n.children.length, i = this._minEntries;
+			this._chooseSplitAxis(n, i, r);
+			var o = this._chooseSplitIndex(n, i, r), s = m(n.children.splice(o, n.children.length - o));
+			s.height = n.height, s.leaf = n.leaf, a(n, this.toBBox), a(s, this.toBBox), t ? e[t - 1].children.push(s) : this._splitRoot(n, s);
+		}, r.prototype._splitRoot = function(e, t) {
+			this.data = m([e, t]), this.data.height = e.height + 1, this.data.leaf = !1, a(this.data, this.toBBox);
+		}, r.prototype._chooseSplitIndex = function(e, t, n) {
+			for (var r, i, a, s, c, l, d, f = Infinity, p = Infinity, m = t; m <= n - t; m++) {
+				var h = o(e, 0, m, this.toBBox), g = o(e, m, n, this.toBBox), _ = (i = h, a = g, s = void 0, c = void 0, l = void 0, d = void 0, s = Math.max(i.minX, a.minX), c = Math.max(i.minY, a.minY), l = Math.min(i.maxX, a.maxX), d = Math.min(i.maxY, a.maxY), Math.max(0, l - s) * Math.max(0, d - c)), v = u(h) + u(g);
+				_ < f ? (f = _, r = m, p = v < p ? v : p) : _ === f && v < p && (p = v, r = m);
+			}
+			return r || n - t;
+		}, r.prototype._chooseSplitAxis = function(e, t, n) {
+			var r = e.leaf ? this.compareMinX : c, i = e.leaf ? this.compareMinY : l;
+			this._allDistMargin(e, t, n, r) < this._allDistMargin(e, t, n, i) && e.children.sort(r);
+		}, r.prototype._allDistMargin = function(e, t, n, r) {
+			e.children.sort(r);
+			for (var i = this.toBBox, a = o(e, 0, t, i), c = o(e, n - t, n, i), l = d(a) + d(c), u = t; u < n - t; u++) {
+				var f = e.children[u];
+				s(a, e.leaf ? i(f) : f), l += d(a);
+			}
+			for (var p = n - t - 1; p >= t; p--) {
+				var m = e.children[p];
+				s(c, e.leaf ? i(m) : m), l += d(c);
+			}
+			return l;
+		}, r.prototype._adjustParentBBoxes = function(e, t, n) {
+			for (var r = n; r >= 0; r--) s(t[r], e);
+		}, r.prototype._condense = function(e) {
+			for (var t = e.length - 1, n = void 0; t >= 0; t--) e[t].children.length === 0 ? t > 0 ? (n = e[t - 1].children).splice(n.indexOf(e[t]), 1) : this.clear() : a(e[t], this.toBBox);
+		}, r;
+	});
+})), m = /* @__PURE__ */ r({ default: () => g });
+function h(e, t) {
+	return e < t ? -1 : +(e > t);
+}
+var g, _ = t((() => {
+	g = class {
+		constructor(e = [], t = h) {
+			if (this.data = e, this.length = this.data.length, this.compare = t, this.length > 0) for (let e = (this.length >> 1) - 1; e >= 0; e--) this._down(e);
+		}
+		push(e) {
+			this.data.push(e), this.length++, this._up(this.length - 1);
+		}
+		pop() {
+			if (this.length === 0) return;
+			let e = this.data[0], t = this.data.pop();
+			return this.length--, this.length > 0 && (this.data[0] = t, this._down(0)), e;
+		}
+		peek() {
+			return this.data[0];
+		}
+		_up(e) {
+			let { data: t, compare: n } = this, r = t[e];
+			for (; e > 0;) {
+				let i = e - 1 >> 1, a = t[i];
+				if (n(r, a) >= 0) break;
+				t[e] = a, e = i;
+			}
+			t[e] = r;
+		}
+		_down(e) {
+			let { data: t, compare: n } = this, r = this.length >> 1, i = t[e];
+			for (; e < r;) {
+				let r = (e << 1) + 1, a = t[r], o = r + 1;
+				if (o < this.length && n(t[o], a) < 0 && (r = o, a = t[o]), n(a, i) >= 0) break;
+				t[e] = a, e = r;
+			}
+			t[e] = i;
+		}
+	};
+})), v = /* @__PURE__ */ i(((e, t) => {
+	t.exports = function(e, t, n, r) {
+		var i = e[0], a = e[1], o = !1;
+		n === void 0 && (n = 0), r === void 0 && (r = t.length);
+		for (var s = (r - n) / 2, c = 0, l = s - 1; c < s; l = c++) {
+			var u = t[n + c * 2 + 0], d = t[n + c * 2 + 1], f = t[n + l * 2 + 0], p = t[n + l * 2 + 1];
+			d > a != p > a && i < (f - u) * (a - d) / (p - d) + u && (o = !o);
+		}
+		return o;
+	};
+})), y = /* @__PURE__ */ i(((e, t) => {
+	t.exports = function(e, t, n, r) {
+		var i = e[0], a = e[1], o = !1;
+		n === void 0 && (n = 0), r === void 0 && (r = t.length);
+		for (var s = r - n, c = 0, l = s - 1; c < s; l = c++) {
+			var u = t[c + n][0], d = t[c + n][1], f = t[l + n][0], p = t[l + n][1];
+			d > a != p > a && i < (f - u) * (a - d) / (p - d) + u && (o = !o);
+		}
+		return o;
+	};
+})), b = /* @__PURE__ */ i(((e, t) => {
+	var n = v(), r = y();
+	t.exports = function(e, t, i, a) {
+		return t.length > 0 && Array.isArray(t[0]) ? r(e, t, i, a) : n(e, t, i, a);
+	}, t.exports.nested = r, t.exports.flat = n;
+})), x = /* @__PURE__ */ i(((e, t) => {
+	(function(n, r) {
+		typeof e == "object" && t !== void 0 ? r(e) : typeof define == "function" && define.amd ? define(["exports"], r) : r((n ||= self).predicates = {});
+	})(e, function(e) {
+		let t = 134217729;
+		function n(e, t, n, r, i) {
+			let a, o, s, c, l = t[0], u = r[0], d = 0, f = 0;
+			u > l == u > -l ? (a = l, l = t[++d]) : (a = u, u = r[++f]);
+			let p = 0;
+			if (d < e && f < n) for (u > l == u > -l ? (s = a - ((o = l + a) - l), l = t[++d]) : (s = a - ((o = u + a) - u), u = r[++f]), a = o, s !== 0 && (i[p++] = s); d < e && f < n;) u > l == u > -l ? (s = a - ((o = a + l) - (c = o - a)) + (l - c), l = t[++d]) : (s = a - ((o = a + u) - (c = o - a)) + (u - c), u = r[++f]), a = o, s !== 0 && (i[p++] = s);
+			for (; d < e;) s = a - ((o = a + l) - (c = o - a)) + (l - c), l = t[++d], a = o, s !== 0 && (i[p++] = s);
+			for (; f < n;) s = a - ((o = a + u) - (c = o - a)) + (u - c), u = r[++f], a = o, s !== 0 && (i[p++] = s);
+			return a === 0 && p !== 0 || (i[p++] = a), p;
+		}
+		function r(e) {
+			return new Float64Array(e);
+		}
+		let i = r(4), a = r(8), o = r(12), s = r(16), c = r(4);
+		e.orient2d = function(e, r, l, u, d, f) {
+			let p = (r - f) * (l - d), m = (e - d) * (u - f), h = p - m;
+			if (p === 0 || m === 0 || p > 0 != m > 0) return h;
+			let g = Math.abs(p + m);
+			return Math.abs(h) >= 33306690738754716e-32 * g ? h : -function(e, r, l, u, d, f, p) {
+				let m, h, g, _, v, y, b, x, S, C, w, T, E, D, O, k, A, j, M = e - d, N = l - d, P = r - f, F = u - f;
+				v = (O = (x = M - (b = (y = t * M) - (y - M))) * (C = F - (S = (y = t * F) - (y - F))) - ((D = M * F) - b * S - x * S - b * C)) - (w = O - (A = (x = P - (b = (y = t * P) - (y - P))) * (C = N - (S = (y = t * N) - (y - N))) - ((k = P * N) - b * S - x * S - b * C))), i[0] = O - (w + v) + (v - A), v = (E = D - ((T = D + w) - (v = T - D)) + (w - v)) - (w = E - k), i[1] = E - (w + v) + (v - k), v = (j = T + w) - T, i[2] = T - (j - v) + (w - v), i[3] = j;
+				let I = function(e, t) {
+					let n = t[0];
+					for (let r = 1; r < e; r++) n += t[r];
+					return n;
+				}(4, i), L = 22204460492503146e-32 * p;
+				if (I >= L || -I >= L || (m = e - (M + (v = e - M)) + (v - d), g = l - (N + (v = l - N)) + (v - d), h = r - (P + (v = r - P)) + (v - f), _ = u - (F + (v = u - F)) + (v - f), m === 0 && h === 0 && g === 0 && _ === 0) || (L = 11093356479670487e-47 * p + 33306690738754706e-32 * Math.abs(I), (I += M * _ + F * m - (P * g + N * h)) >= L || -I >= L)) return I;
+				v = (O = (x = m - (b = (y = t * m) - (y - m))) * (C = F - (S = (y = t * F) - (y - F))) - ((D = m * F) - b * S - x * S - b * C)) - (w = O - (A = (x = h - (b = (y = t * h) - (y - h))) * (C = N - (S = (y = t * N) - (y - N))) - ((k = h * N) - b * S - x * S - b * C))), c[0] = O - (w + v) + (v - A), v = (E = D - ((T = D + w) - (v = T - D)) + (w - v)) - (w = E - k), c[1] = E - (w + v) + (v - k), v = (j = T + w) - T, c[2] = T - (j - v) + (w - v), c[3] = j;
+				let R = n(4, i, 4, c, a);
+				v = (O = (x = M - (b = (y = t * M) - (y - M))) * (C = _ - (S = (y = t * _) - (y - _))) - ((D = M * _) - b * S - x * S - b * C)) - (w = O - (A = (x = P - (b = (y = t * P) - (y - P))) * (C = g - (S = (y = t * g) - (y - g))) - ((k = P * g) - b * S - x * S - b * C))), c[0] = O - (w + v) + (v - A), v = (E = D - ((T = D + w) - (v = T - D)) + (w - v)) - (w = E - k), c[1] = E - (w + v) + (v - k), v = (j = T + w) - T, c[2] = T - (j - v) + (w - v), c[3] = j;
+				let z = n(R, a, 4, c, o);
+				return v = (O = (x = m - (b = (y = t * m) - (y - m))) * (C = _ - (S = (y = t * _) - (y - _))) - ((D = m * _) - b * S - x * S - b * C)) - (w = O - (A = (x = h - (b = (y = t * h) - (y - h))) * (C = g - (S = (y = t * g) - (y - g))) - ((k = h * g) - b * S - x * S - b * C))), c[0] = O - (w + v) + (v - A), v = (E = D - ((T = D + w) - (v = T - D)) + (w - v)) - (w = E - k), c[1] = E - (w + v) + (v - k), v = (j = T + w) - T, c[2] = T - (j - v) + (w - v), c[3] = j, s[n(z, o, 4, c, s) - 1];
+			}(e, r, l, u, d, f, g);
+		}, e.orient2dfast = function(e, t, n, r, i, a) {
+			return (t - a) * (n - i) - (e - i) * (r - a);
+		}, Object.defineProperty(e, "__esModule", { value: !0 });
+	});
+})), S = /* @__PURE__ */ n((/* @__PURE__ */ i(((t, n) => {
+	var r = p(), i = (_(), e(m)), a = b(), o = x().orient2d;
+	i.default && (i = i.default), n.exports = s, n.exports.default = s;
+	function s(e, t, n) {
+		t = Math.max(0, t === void 0 ? 2 : t), n ||= 0;
+		var i = y(e), a = new r(16);
+		a.toBBox = function(e) {
+			return {
+				minX: e[0],
+				minY: e[1],
+				maxX: e[0],
+				maxY: e[1]
+			};
+		}, a.compareMinX = function(e, t) {
+			return e[0] - t[0];
+		}, a.compareMinY = function(e, t) {
+			return e[1] - t[1];
+		}, a.load(e);
+		for (var o = [], s = 0, l; s < i.length; s++) {
+			var u = i[s];
+			a.remove(u), l = S(u, l), o.push(l);
+		}
+		var d = new r(16);
+		for (s = 0; s < o.length; s++) d.insert(v(o[s]));
+		for (var f = t * t, p = n * n; o.length;) {
+			var m = o.shift(), h = m.p, g = m.next.p, _ = C(h, g);
+			if (!(_ < p)) {
+				var b = _ / f;
+				u = c(a, m.prev.p, h, g, m.next.next.p, b, d), u && Math.min(C(u, h), C(u, g)) <= b && (o.push(m), o.push(S(u, m)), a.remove(u), d.remove(m), d.insert(v(m)), d.insert(v(m.next)));
+			}
+		}
+		m = l;
+		var x = [];
+		do
+			x.push(m.p), m = m.next;
+		while (m !== l);
+		return x.push(m.p), x;
+	}
+	function c(e, t, n, r, a, o, s) {
+		for (var c = new i([], l), d = e.data; d;) {
+			for (var p = 0; p < d.children.length; p++) {
+				var m = d.children[p], h = d.leaf ? w(m, n, r) : u(n, r, m);
+				h > o || c.push({
+					node: m,
+					dist: h
+				});
+			}
+			for (; c.length && !c.peek().node.children;) {
+				var g = c.pop(), _ = g.node, v = w(_, t, n), y = w(_, r, a);
+				if (g.dist < v && g.dist < y && f(n, _, s) && f(r, _, s)) return _;
+			}
+			d = c.pop(), d &&= d.node;
+		}
+		return null;
+	}
+	function l(e, t) {
+		return e.dist - t.dist;
+	}
+	function u(e, t, n) {
+		if (d(e, n) || d(t, n)) return 0;
+		var r = T(e[0], e[1], t[0], t[1], n.minX, n.minY, n.maxX, n.minY);
+		if (r === 0) return 0;
+		var i = T(e[0], e[1], t[0], t[1], n.minX, n.minY, n.minX, n.maxY);
+		if (i === 0) return 0;
+		var a = T(e[0], e[1], t[0], t[1], n.maxX, n.minY, n.maxX, n.maxY);
+		if (a === 0) return 0;
+		var o = T(e[0], e[1], t[0], t[1], n.minX, n.maxY, n.maxX, n.maxY);
+		return o === 0 ? 0 : Math.min(r, i, a, o);
+	}
+	function d(e, t) {
+		return e[0] >= t.minX && e[0] <= t.maxX && e[1] >= t.minY && e[1] <= t.maxY;
+	}
+	function f(e, t, n) {
+		for (var r = Math.min(e[0], t[0]), i = Math.min(e[1], t[1]), a = Math.max(e[0], t[0]), o = Math.max(e[1], t[1]), s = n.search({
+			minX: r,
+			minY: i,
+			maxX: a,
+			maxY: o
+		}), c = 0; c < s.length; c++) if (g(s[c].p, s[c].next.p, e, t)) return !1;
+		return !0;
+	}
+	function h(e, t, n) {
+		return o(e[0], e[1], t[0], t[1], n[0], n[1]);
+	}
+	function g(e, t, n, r) {
+		return e !== r && t !== n && h(e, t, n) > 0 != h(e, t, r) > 0 && h(n, r, e) > 0 != h(n, r, t) > 0;
+	}
+	function v(e) {
+		var t = e.p, n = e.next.p;
+		return e.minX = Math.min(t[0], n[0]), e.minY = Math.min(t[1], n[1]), e.maxX = Math.max(t[0], n[0]), e.maxY = Math.max(t[1], n[1]), e;
+	}
+	function y(e) {
+		for (var t = e[0], n = e[0], r = e[0], i = e[0], o = 0; o < e.length; o++) {
+			var s = e[o];
+			s[0] < t[0] && (t = s), s[0] > r[0] && (r = s), s[1] < n[1] && (n = s), s[1] > i[1] && (i = s);
+		}
+		var c = [
+			t,
+			n,
+			r,
+			i
+		], l = c.slice();
+		for (o = 0; o < e.length; o++) a(e[o], c) || l.push(e[o]);
+		return D(l);
+	}
+	function S(e, t) {
+		var n = {
+			p: e,
+			prev: null,
+			next: null,
+			minX: 0,
+			minY: 0,
+			maxX: 0,
+			maxY: 0
+		};
+		return t ? (n.next = t.next, n.prev = t, t.next.prev = n, t.next = n) : (n.prev = n, n.next = n), n;
+	}
+	function C(e, t) {
+		var n = e[0] - t[0], r = e[1] - t[1];
+		return n * n + r * r;
+	}
+	function w(e, t, n) {
+		var r = t[0], i = t[1], a = n[0] - r, o = n[1] - i;
+		if (a !== 0 || o !== 0) {
+			var s = ((e[0] - r) * a + (e[1] - i) * o) / (a * a + o * o);
+			s > 1 ? (r = n[0], i = n[1]) : s > 0 && (r += a * s, i += o * s);
+		}
+		return a = e[0] - r, o = e[1] - i, a * a + o * o;
+	}
+	function T(e, t, n, r, i, a, o, s) {
+		var c = n - e, l = r - t, u = o - i, d = s - a, f = e - i, p = t - a, m = c * c + l * l, h = c * u + l * d, g = u * u + d * d, _ = c * f + l * p, v = u * f + d * p, y = m * g - h * h, b, x, S, C, w = y, T = y;
+		y === 0 ? (x = 0, w = 1, C = v, T = g) : (x = h * v - g * _, C = m * v - h * _, x < 0 ? (x = 0, C = v, T = g) : x > w && (x = w, C = v + h, T = g)), C < 0 ? (C = 0, -_ < 0 ? x = 0 : -_ > m ? x = w : (x = -_, w = m)) : C > T && (C = T, -_ + h < 0 ? x = 0 : -_ + h > m ? x = w : (x = -_ + h, w = m)), b = x === 0 ? 0 : x / w, S = C === 0 ? 0 : C / T;
+		var E = (1 - b) * e + b * n, D = (1 - b) * t + b * r, O = (1 - S) * i + S * o, k = (1 - S) * a + S * s, A = O - E, j = k - D;
+		return A * A + j * j;
+	}
+	function E(e, t) {
+		return e[0] === t[0] ? e[1] - t[1] : e[0] - t[0];
+	}
+	function D(e) {
+		e.sort(E);
+		for (var t = [], n = 0; n < e.length; n++) {
+			for (; t.length >= 2 && h(t[t.length - 2], t[t.length - 1], e[n]) <= 0;) t.pop();
+			t.push(e[n]);
+		}
+		for (var r = [], i = e.length - 1; i >= 0; i--) {
+			for (; r.length >= 2 && h(r[r.length - 2], r[r.length - 1], e[i]) <= 0;) r.pop();
+			r.push(e[i]);
+		}
+		return r.pop(), t.pop(), t.concat(r);
+	}
+})))(), 1);
+function C(e, t = {}) {
+	t.concavity = t.concavity || Infinity;
+	let n = [];
+	if (u(e, (e) => {
+		n.push([e[0], e[1]]);
+	}), !n.length) return null;
+	let r = (0, S.default)(n, t.concavity);
+	return r.length > 3 ? c([r]) : null;
+}
+//#endregion
+//#region node_modules/@turf/centroid/dist/esm/index.js
+function w(e, t = {}) {
+	let n = 0, r = 0, i = 0;
+	return u(e, function(e) {
+		n += e[0], r += e[1], i++;
+	}, !0), s([n / i, r / i], t.properties);
+}
+//#endregion
+//#region node_modules/@turf/invariant/dist/esm/index.js
+function T(e) {
+	if (!e) throw Error("coord is required");
+	if (!Array.isArray(e)) {
+		if (e.type === "Feature" && e.geometry !== null && e.geometry.type === "Point") return [...e.geometry.coordinates];
+		if (e.type === "Point") return [...e.coordinates];
+	}
+	if (Array.isArray(e) && e.length >= 2 && !Array.isArray(e[0]) && !Array.isArray(e[1])) return [...e];
+	throw Error("coord must be GeoJSON Point or an Array of numbers");
+}
+function E(e, t) {
+	return e.type === "FeatureCollection" ? "FeatureCollection" : e.type === "GeometryCollection" ? "GeometryCollection" : e.type === "Feature" && e.geometry !== null ? e.geometry.type : e.type;
+}
+//#endregion
+//#region node_modules/@turf/center-of-mass/dist/esm/index.js
+function D(e, t = {}) {
+	switch (E(e)) {
+		case "Point": return s(T(e), t.properties);
+		case "Polygon":
+			var n = [];
+			u(e, function(e) {
+				n.push(e);
+			});
+			var r = w(e, { properties: t.properties }), i = r.geometry.coordinates, a = 0, o = 0, c = 0, l, d, f, p, m, h, g, _, v = n.map(function(e) {
+				return [e[0] - i[0], e[1] - i[1]];
+			});
+			for (l = 0; l < n.length - 1; l++) d = v[l], p = d[0], h = d[1], f = v[l + 1], m = f[0], g = f[1], _ = p * g - m * h, c += _, a += (p + m) * _, o += (h + g) * _;
+			if (c === 0) return r;
+			var y = 1 / (c * .5 * 6);
+			return s([i[0] + y * a, i[1] + y * o], t.properties);
+		default:
+			var b = C(e);
+			return b ? D(b, { properties: t.properties }) : w(e, { properties: t.properties });
+	}
+}
+var O = D;
+//#endregion
+export { a as i, u as n, f as r, O as t };
+
+//# sourceMappingURL=esm-D23XoYrV.js.map