@burdenoff/microfe-planmagnet 2026.726.1 → 2026.730.2

package/dist/node_modules/d3-array/src/ascending.js

@@ -0,0 +1,8 @@
+//#region node_modules/d3-array/src/ascending.js
+function e(e, t) {
+	return e == null || t == null ? NaN : e < t ? -1 : e > t ? 1 : e >= t ? 0 : NaN;
+}
+//#endregion
+export { e as default };
+
+//# sourceMappingURL=ascending.js.map

package/dist/node_modules/d3-array/src/ascending.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ascending.js","names":[],"sources":["../../../../node_modules/d3-array/src/ascending.js"],"sourcesContent":["export default function ascending(a, b) {\n  return a == null || b == null ? NaN : a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;\n}\n"],"x_google_ignoreList":[0],"mappings":";AAAA,SAAwB,EAAU,GAAG,GAAG;AACtC,QAAO,KAAK,QAAQ,KAAK,OAAO,MAAM,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI"}

package/dist/node_modules/d3-array/src/bisect.js

@@ -0,0 +1,10 @@
+import e from "./ascending.js";
+import t from "./bisector.js";
+import n from "./number.js";
+//#region node_modules/d3-array/src/bisect.js
+var r = t(e), i = r.right;
+r.left, t(n).center;
+//#endregion
+export { i as default };
+
+//# sourceMappingURL=bisect.js.map

package/dist/node_modules/d3-array/src/bisect.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bisect.js","names":[],"sources":["../../../../node_modules/d3-array/src/bisect.js"],"sourcesContent":["import ascending from \"./ascending.js\";\nimport bisector from \"./bisector.js\";\nimport number from \"./number.js\";\n\nconst ascendingBisect = bisector(ascending);\nexport const bisectRight = ascendingBisect.right;\nexport const bisectLeft = ascendingBisect.left;\nexport const bisectCenter = bisector(number).center;\nexport default bisectRight;\n"],"x_google_ignoreList":[0],"mappings":";;;;AAIA,IAAM,IAAkB,EAAS,EAAU,EAC9B,IAAc,EAAgB;AACjB,EAAgB,MACd,EAAS,EAAO,CAAC"}

package/dist/node_modules/d3-array/src/bisector.js

@@ -0,0 +1,43 @@
+import e from "./ascending.js";
+import t from "./descending.js";
+//#region node_modules/d3-array/src/bisector.js
+function n(n) {
+	let i, a, o;
+	n.length === 2 ? (i = n === e || n === t ? n : r, a = n, o = n) : (i = e, a = (t, r) => e(n(t), r), o = (e, t) => n(e) - t);
+	function s(e, t, n = 0, r = e.length) {
+		if (n < r) {
+			if (i(t, t) !== 0) return r;
+			do {
+				let i = n + r >>> 1;
+				a(e[i], t) < 0 ? n = i + 1 : r = i;
+			} while (n < r);
+		}
+		return n;
+	}
+	function c(e, t, n = 0, r = e.length) {
+		if (n < r) {
+			if (i(t, t) !== 0) return r;
+			do {
+				let i = n + r >>> 1;
+				a(e[i], t) <= 0 ? n = i + 1 : r = i;
+			} while (n < r);
+		}
+		return n;
+	}
+	function l(e, t, n = 0, r = e.length) {
+		let i = s(e, t, n, r - 1);
+		return i > n && o(e[i - 1], t) > -o(e[i], t) ? i - 1 : i;
+	}
+	return {
+		left: s,
+		center: l,
+		right: c
+	};
+}
+function r() {
+	return 0;
+}
+//#endregion
+export { n as default };
+
+//# sourceMappingURL=bisector.js.map

package/dist/node_modules/d3-array/src/bisector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bisector.js","names":[],"sources":["../../../../node_modules/d3-array/src/bisector.js"],"sourcesContent":["import ascending from \"./ascending.js\";\nimport descending from \"./descending.js\";\n\nexport default function bisector(f) {\n  let compare1, compare2, delta;\n\n  // If an accessor is specified, promote it to a comparator. In this case we\n  // can test whether the search value is (self-) comparable. We can’t do this\n  // for a comparator (except for specific, known comparators) because we can’t\n  // tell if the comparator is symmetric, and an asymmetric comparator can’t be\n  // used to test whether a single value is comparable.\n  if (f.length !== 2) {\n    compare1 = ascending;\n    compare2 = (d, x) => ascending(f(d), x);\n    delta = (d, x) => f(d) - x;\n  } else {\n    compare1 = f === ascending || f === descending ? f : zero;\n    compare2 = f;\n    delta = f;\n  }\n\n  function left(a, x, lo = 0, hi = a.length) {\n    if (lo < hi) {\n      if (compare1(x, x) !== 0) return hi;\n      do {\n        const mid = (lo + hi) >>> 1;\n        if (compare2(a[mid], x) < 0) lo = mid + 1;\n        else hi = mid;\n      } while (lo < hi);\n    }\n    return lo;\n  }\n\n  function right(a, x, lo = 0, hi = a.length) {\n    if (lo < hi) {\n      if (compare1(x, x) !== 0) return hi;\n      do {\n        const mid = (lo + hi) >>> 1;\n        if (compare2(a[mid], x) <= 0) lo = mid + 1;\n        else hi = mid;\n      } while (lo < hi);\n    }\n    return lo;\n  }\n\n  function center(a, x, lo = 0, hi = a.length) {\n    const i = left(a, x, lo, hi - 1);\n    return i > lo && delta(a[i - 1], x) > -delta(a[i], x) ? i - 1 : i;\n  }\n\n  return {left, center, right};\n}\n\nfunction zero() {\n  return 0;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;AAGA,SAAwB,EAAS,GAAG;CAClC,IAAI,GAAU,GAAU;AAOxB,CAAI,EAAE,WAAW,KAKf,IAAW,MAAM,KAAa,MAAM,IAAa,IAAI,GACrD,IAAW,GACX,IAAQ,MANR,IAAW,GACX,KAAY,GAAG,MAAM,EAAU,EAAE,EAAE,EAAE,EAAE,EACvC,KAAS,GAAG,MAAM,EAAE,EAAE,GAAG;CAO3B,SAAS,EAAK,GAAG,GAAG,IAAK,GAAG,IAAK,EAAE,QAAQ;AACzC,MAAI,IAAK,GAAI;AACX,OAAI,EAAS,GAAG,EAAE,KAAK,EAAG,QAAO;AACjC,MAAG;IACD,IAAM,IAAO,IAAK,MAAQ;AAC1B,IAAI,EAAS,EAAE,IAAM,EAAE,GAAG,IAAG,IAAK,IAAM,IACnC,IAAK;YACH,IAAK;;AAEhB,SAAO;;CAGT,SAAS,EAAM,GAAG,GAAG,IAAK,GAAG,IAAK,EAAE,QAAQ;AAC1C,MAAI,IAAK,GAAI;AACX,OAAI,EAAS,GAAG,EAAE,KAAK,EAAG,QAAO;AACjC,MAAG;IACD,IAAM,IAAO,IAAK,MAAQ;AAC1B,IAAI,EAAS,EAAE,IAAM,EAAE,IAAI,IAAG,IAAK,IAAM,IACpC,IAAK;YACH,IAAK;;AAEhB,SAAO;;CAGT,SAAS,EAAO,GAAG,GAAG,IAAK,GAAG,IAAK,EAAE,QAAQ;EAC3C,IAAM,IAAI,EAAK,GAAG,GAAG,GAAI,IAAK,EAAE;AAChC,SAAO,IAAI,KAAM,EAAM,EAAE,IAAI,IAAI,EAAE,GAAG,CAAC,EAAM,EAAE,IAAI,EAAE,GAAG,IAAI,IAAI;;AAGlE,QAAO;EAAC;EAAM;EAAQ;EAAM;;AAG9B,SAAS,IAAO;AACd,QAAO"}

package/dist/node_modules/d3-array/src/descending.js

@@ -0,0 +1,8 @@
+//#region node_modules/d3-array/src/descending.js
+function e(e, t) {
+	return e == null || t == null ? NaN : t < e ? -1 : t > e ? 1 : t >= e ? 0 : NaN;
+}
+//#endregion
+export { e as default };
+
+//# sourceMappingURL=descending.js.map

package/dist/node_modules/d3-array/src/descending.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"descending.js","names":[],"sources":["../../../../node_modules/d3-array/src/descending.js"],"sourcesContent":["export default function descending(a, b) {\n  return a == null || b == null ? NaN\n    : b < a ? -1\n    : b > a ? 1\n    : b >= a ? 0\n    : NaN;\n}\n"],"x_google_ignoreList":[0],"mappings":";AAAA,SAAwB,EAAW,GAAG,GAAG;AACvC,QAAO,KAAK,QAAQ,KAAK,OAAO,MAC5B,IAAI,IAAI,KACR,IAAI,IAAI,IACR,KAAK,IAAI,IACT"}

package/dist/node_modules/d3-array/src/max.js

@@ -0,0 +1,14 @@
+//#region node_modules/d3-array/src/max.js
+function e(e, t) {
+	let n;
+	if (t === void 0) for (let t of e) t != null && (n < t || n === void 0 && t >= t) && (n = t);
+	else {
+		let r = -1;
+		for (let i of e) (i = t(i, ++r, e)) != null && (n < i || n === void 0 && i >= i) && (n = i);
+	}
+	return n;
+}
+//#endregion
+export { e as default };
+
+//# sourceMappingURL=max.js.map

package/dist/node_modules/d3-array/src/max.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"max.js","names":[],"sources":["../../../../node_modules/d3-array/src/max.js"],"sourcesContent":["export default function max(values, valueof) {\n  let max;\n  if (valueof === undefined) {\n    for (const value of values) {\n      if (value != null\n          && (max < value || (max === undefined && value >= value))) {\n        max = value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null\n          && (max < value || (max === undefined && value >= value))) {\n        max = value;\n      }\n    }\n  }\n  return max;\n}\n"],"x_google_ignoreList":[0],"mappings":";AAAA,SAAwB,EAAI,GAAQ,GAAS;CAC3C,IAAI;AACJ,KAAI,MAAY,KAAA,QACT,IAAM,KAAS,EAClB,CAAI,KAAS,SACL,IAAM,KAAU,MAAQ,KAAA,KAAa,KAAS,OACpD,IAAM;MAGL;EACL,IAAI,IAAQ;AACZ,OAAK,IAAI,KAAS,EAChB,EAAK,IAAQ,EAAQ,GAAO,EAAE,GAAO,EAAO,KAAK,SACzC,IAAM,KAAU,MAAQ,KAAA,KAAa,KAAS,OACpD,IAAM;;AAIZ,QAAO"}

package/dist/node_modules/d3-array/src/min.js

@@ -0,0 +1,14 @@
+//#region node_modules/d3-array/src/min.js
+function e(e, t) {
+	let n;
+	if (t === void 0) for (let t of e) t != null && (n > t || n === void 0 && t >= t) && (n = t);
+	else {
+		let r = -1;
+		for (let i of e) (i = t(i, ++r, e)) != null && (n > i || n === void 0 && i >= i) && (n = i);
+	}
+	return n;
+}
+//#endregion
+export { e as default };
+
+//# sourceMappingURL=min.js.map

package/dist/node_modules/d3-array/src/min.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"min.js","names":[],"sources":["../../../../node_modules/d3-array/src/min.js"],"sourcesContent":["export default function min(values, valueof) {\n  let min;\n  if (valueof === undefined) {\n    for (const value of values) {\n      if (value != null\n          && (min > value || (min === undefined && value >= value))) {\n        min = value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null\n          && (min > value || (min === undefined && value >= value))) {\n        min = value;\n      }\n    }\n  }\n  return min;\n}\n"],"x_google_ignoreList":[0],"mappings":";AAAA,SAAwB,EAAI,GAAQ,GAAS;CAC3C,IAAI;AACJ,KAAI,MAAY,KAAA,QACT,IAAM,KAAS,EAClB,CAAI,KAAS,SACL,IAAM,KAAU,MAAQ,KAAA,KAAa,KAAS,OACpD,IAAM;MAGL;EACL,IAAI,IAAQ;AACZ,OAAK,IAAI,KAAS,EAChB,EAAK,IAAQ,EAAQ,GAAO,EAAE,GAAO,EAAO,KAAK,SACzC,IAAM,KAAU,MAAQ,KAAA,KAAa,KAAS,OACpD,IAAM;;AAIZ,QAAO"}

package/dist/node_modules/d3-array/src/number.js

@@ -0,0 +1,15 @@
+//#region node_modules/d3-array/src/number.js
+function e(e) {
+	return e === null ? NaN : +e;
+}
+function* t(e, t) {
+	if (t === void 0) for (let t of e) t != null && (t = +t) >= t && (yield t);
+	else {
+		let n = -1;
+		for (let r of e) (r = t(r, ++n, e)) != null && (r = +r) >= r && (yield r);
+	}
+}
+//#endregion
+export { e as default, t as numbers };
+
+//# sourceMappingURL=number.js.map

package/dist/node_modules/d3-array/src/number.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"number.js","names":[],"sources":["../../../../node_modules/d3-array/src/number.js"],"sourcesContent":["export default function number(x) {\n  return x === null ? NaN : +x;\n}\n\nexport function* numbers(values, valueof) {\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        yield value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {\n        yield value;\n      }\n    }\n  }\n}\n"],"x_google_ignoreList":[0],"mappings":";AAAA,SAAwB,EAAO,GAAG;AAChC,QAAO,MAAM,OAAO,MAAM,CAAC;;AAG7B,UAAiB,EAAQ,GAAQ,GAAS;AACxC,KAAI,MAAY,KAAA,QACT,IAAI,KAAS,EAChB,CAAI,KAAS,SAAS,IAAQ,CAAC,MAAU,MACvC,MAAM;MAGL;EACL,IAAI,IAAQ;AACZ,OAAK,IAAI,KAAS,EAChB,EAAK,IAAQ,EAAQ,GAAO,EAAE,GAAO,EAAO,KAAK,SAAS,IAAQ,CAAC,MAAU,MAC3E,MAAM"}

package/dist/node_modules/d3-array/src/quantile.js

@@ -0,0 +1,25 @@
+import e, { numbers as t } from "./number.js";
+import n from "./max.js";
+import r from "./min.js";
+import i from "./quickselect.js";
+//#region node_modules/d3-array/src/quantile.js
+function a(e, a, o) {
+	if (e = Float64Array.from(t(e, o)), !(!(s = e.length) || isNaN(a = +a))) {
+		if (a <= 0 || s < 2) return r(e);
+		if (a >= 1) return n(e);
+		var s, c = (s - 1) * a, l = Math.floor(c), u = n(i(e, l).subarray(0, l + 1));
+		return u + (r(e.subarray(l + 1)) - u) * (c - l);
+	}
+}
+function o(t, n, r = e) {
+	if (!(!(i = t.length) || isNaN(n = +n))) {
+		if (n <= 0 || i < 2) return +r(t[0], 0, t);
+		if (n >= 1) return +r(t[i - 1], i - 1, t);
+		var i, a = (i - 1) * n, o = Math.floor(a), s = +r(t[o], o, t);
+		return s + (+r(t[o + 1], o + 1, t) - s) * (a - o);
+	}
+}
+//#endregion
+export { a as default, o as quantileSorted };
+
+//# sourceMappingURL=quantile.js.map

package/dist/node_modules/d3-array/src/quantile.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quantile.js","names":[],"sources":["../../../../node_modules/d3-array/src/quantile.js"],"sourcesContent":["import max from \"./max.js\";\nimport maxIndex from \"./maxIndex.js\";\nimport min from \"./min.js\";\nimport minIndex from \"./minIndex.js\";\nimport quickselect from \"./quickselect.js\";\nimport number, {numbers} from \"./number.js\";\nimport {ascendingDefined} from \"./sort.js\";\nimport greatest from \"./greatest.js\";\n\nexport default function quantile(values, p, valueof) {\n  values = Float64Array.from(numbers(values, valueof));\n  if (!(n = values.length) || isNaN(p = +p)) return;\n  if (p <= 0 || n < 2) return min(values);\n  if (p >= 1) return max(values);\n  var n,\n      i = (n - 1) * p,\n      i0 = Math.floor(i),\n      value0 = max(quickselect(values, i0).subarray(0, i0 + 1)),\n      value1 = min(values.subarray(i0 + 1));\n  return value0 + (value1 - value0) * (i - i0);\n}\n\nexport function quantileSorted(values, p, valueof = number) {\n  if (!(n = values.length) || isNaN(p = +p)) return;\n  if (p <= 0 || n < 2) return +valueof(values[0], 0, values);\n  if (p >= 1) return +valueof(values[n - 1], n - 1, values);\n  var n,\n      i = (n - 1) * p,\n      i0 = Math.floor(i),\n      value0 = +valueof(values[i0], i0, values),\n      value1 = +valueof(values[i0 + 1], i0 + 1, values);\n  return value0 + (value1 - value0) * (i - i0);\n}\n\nexport function quantileIndex(values, p, valueof = number) {\n  if (isNaN(p = +p)) return;\n  numbers = Float64Array.from(values, (_, i) => number(valueof(values[i], i, values)));\n  if (p <= 0) return minIndex(numbers);\n  if (p >= 1) return maxIndex(numbers);\n  var numbers,\n      index = Uint32Array.from(values, (_, i) => i),\n      j = numbers.length - 1,\n      i = Math.floor(j * p);\n  quickselect(index, i, 0, j, (i, j) => ascendingDefined(numbers[i], numbers[j]));\n  i = greatest(index.subarray(0, i + 1), (i) => numbers[i]);\n  return i >= 0 ? i : -1;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;AASA,SAAwB,EAAS,GAAQ,GAAG,GAAS;AACnD,SAAS,aAAa,KAAK,EAAQ,GAAQ,EAAQ,CAAC,EAChD,IAAE,IAAI,EAAO,WAAW,MAAM,IAAI,CAAC,EAAE,GACzC;MAAI,KAAK,KAAK,IAAI,EAAG,QAAO,EAAI,EAAO;AACvC,MAAI,KAAK,EAAG,QAAO,EAAI,EAAO;EAC9B,IAAI,GACA,KAAK,IAAI,KAAK,GACd,IAAK,KAAK,MAAM,EAAE,EAClB,IAAS,EAAI,EAAY,GAAQ,EAAG,CAAC,SAAS,GAAG,IAAK,EAAE,CAAC;AAE7D,SAAO,KADM,EAAI,EAAO,SAAS,IAAK,EAAE,CAAC,GACf,MAAW,IAAI;;;AAG3C,SAAgB,EAAe,GAAQ,GAAG,IAAU,GAAQ;AACtD,SAAE,IAAI,EAAO,WAAW,MAAM,IAAI,CAAC,EAAE,GACzC;MAAI,KAAK,KAAK,IAAI,EAAG,QAAO,CAAC,EAAQ,EAAO,IAAI,GAAG,EAAO;AAC1D,MAAI,KAAK,EAAG,QAAO,CAAC,EAAQ,EAAO,IAAI,IAAI,IAAI,GAAG,EAAO;EACzD,IAAI,GACA,KAAK,IAAI,KAAK,GACd,IAAK,KAAK,MAAM,EAAE,EAClB,IAAS,CAAC,EAAQ,EAAO,IAAK,GAAI,EAAO;AAE7C,SAAO,KADM,CAAC,EAAQ,EAAO,IAAK,IAAI,IAAK,GAAG,EAAO,GAC3B,MAAW,IAAI"}

package/dist/node_modules/d3-array/src/quickselect.js

@@ -0,0 +1,26 @@
+import { ascendingDefined as e, compareDefined as t } from "./sort.js";
+//#region node_modules/d3-array/src/quickselect.js
+function n(i, a, o = 0, s = Infinity, c) {
+	if (a = Math.floor(a), o = Math.floor(Math.max(0, o)), s = Math.floor(Math.min(i.length - 1, s)), !(o <= a && a <= s)) return i;
+	for (c = c === void 0 ? e : t(c); s > o;) {
+		if (s - o > 600) {
+			let e = s - o + 1, t = a - o + 1, r = Math.log(e), l = .5 * Math.exp(2 * r / 3), u = .5 * Math.sqrt(r * l * (e - l) / e) * (t - e / 2 < 0 ? -1 : 1), d = Math.max(o, Math.floor(a - t * l / e + u)), f = Math.min(s, Math.floor(a + (e - t) * l / e + u));
+			n(i, a, d, f, c);
+		}
+		let e = i[a], t = o, l = s;
+		for (r(i, o, a), c(i[s], e) > 0 && r(i, o, s); t < l;) {
+			for (r(i, t, l), ++t, --l; c(i[t], e) < 0;) ++t;
+			for (; c(i[l], e) > 0;) --l;
+		}
+		c(i[o], e) === 0 ? r(i, o, l) : (++l, r(i, l, s)), l <= a && (o = l + 1), a <= l && (s = l - 1);
+	}
+	return i;
+}
+function r(e, t, n) {
+	let r = e[t];
+	e[t] = e[n], e[n] = r;
+}
+//#endregion
+export { n as default };
+
+//# sourceMappingURL=quickselect.js.map

package/dist/node_modules/d3-array/src/quickselect.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quickselect.js","names":[],"sources":["../../../../node_modules/d3-array/src/quickselect.js"],"sourcesContent":["import {ascendingDefined, compareDefined} from \"./sort.js\";\n\n// Based on https://github.com/mourner/quickselect\n// ISC license, Copyright 2018 Vladimir Agafonkin.\nexport default function quickselect(array, k, left = 0, right = Infinity, compare) {\n  k = Math.floor(k);\n  left = Math.floor(Math.max(0, left));\n  right = Math.floor(Math.min(array.length - 1, right));\n\n  if (!(left <= k && k <= right)) return array;\n\n  compare = compare === undefined ? ascendingDefined : compareDefined(compare);\n\n  while (right > left) {\n    if (right - left > 600) {\n      const n = right - left + 1;\n      const m = k - left + 1;\n      const z = Math.log(n);\n      const s = 0.5 * Math.exp(2 * z / 3);\n      const sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);\n      const newLeft = Math.max(left, Math.floor(k - m * s / n + sd));\n      const newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));\n      quickselect(array, k, newLeft, newRight, compare);\n    }\n\n    const t = array[k];\n    let i = left;\n    let j = right;\n\n    swap(array, left, k);\n    if (compare(array[right], t) > 0) swap(array, left, right);\n\n    while (i < j) {\n      swap(array, i, j), ++i, --j;\n      while (compare(array[i], t) < 0) ++i;\n      while (compare(array[j], t) > 0) --j;\n    }\n\n    if (compare(array[left], t) === 0) swap(array, left, j);\n    else ++j, swap(array, j, right);\n\n    if (j <= k) left = j + 1;\n    if (k <= j) right = j - 1;\n  }\n\n  return array;\n}\n\nfunction swap(array, i, j) {\n  const t = array[i];\n  array[i] = array[j];\n  array[j] = t;\n}\n"],"x_google_ignoreList":[0],"mappings":";;AAIA,SAAwB,EAAY,GAAO,GAAG,IAAO,GAAG,IAAQ,UAAU,GAAS;AAKjF,KAJA,IAAI,KAAK,MAAM,EAAE,EACjB,IAAO,KAAK,MAAM,KAAK,IAAI,GAAG,EAAK,CAAC,EACpC,IAAQ,KAAK,MAAM,KAAK,IAAI,EAAM,SAAS,GAAG,EAAM,CAAC,EAEjD,EAAE,KAAQ,KAAK,KAAK,GAAQ,QAAO;AAIvC,MAFA,IAAU,MAAY,KAAA,IAAY,IAAmB,EAAe,EAAQ,EAErE,IAAQ,IAAM;AACnB,MAAI,IAAQ,IAAO,KAAK;GACtB,IAAM,IAAI,IAAQ,IAAO,GACnB,IAAI,IAAI,IAAO,GACf,IAAI,KAAK,IAAI,EAAE,EACf,IAAI,KAAM,KAAK,IAAI,IAAI,IAAI,EAAE,EAC7B,IAAK,KAAM,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAClE,IAAU,KAAK,IAAI,GAAM,KAAK,MAAM,IAAI,IAAI,IAAI,IAAI,EAAG,CAAC,EACxD,IAAW,KAAK,IAAI,GAAO,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,IAAI,EAAG,CAAC;AACtE,KAAY,GAAO,GAAG,GAAS,GAAU,EAAQ;;EAGnD,IAAM,IAAI,EAAM,IACZ,IAAI,GACJ,IAAI;AAKR,OAHA,EAAK,GAAO,GAAM,EAAE,EAChB,EAAQ,EAAM,IAAQ,EAAE,GAAG,KAAG,EAAK,GAAO,GAAM,EAAM,EAEnD,IAAI,IAAG;AAEZ,QADA,EAAK,GAAO,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GACnB,EAAQ,EAAM,IAAI,EAAE,GAAG,GAAG,GAAE;AACnC,UAAO,EAAQ,EAAM,IAAI,EAAE,GAAG,GAAG,GAAE;;AAOrC,EAJI,EAAQ,EAAM,IAAO,EAAE,KAAK,IAAG,EAAK,GAAO,GAAM,EAAE,IAClD,EAAE,GAAG,EAAK,GAAO,GAAG,EAAM,GAE3B,KAAK,MAAG,IAAO,IAAI,IACnB,KAAK,MAAG,IAAQ,IAAI;;AAG1B,QAAO;;AAGT,SAAS,EAAK,GAAO,GAAG,GAAG;CACzB,IAAM,IAAI,EAAM;AAEhB,CADA,EAAM,KAAK,EAAM,IACjB,EAAM,KAAK"}

package/dist/node_modules/d3-array/src/range.js

@@ -0,0 +1,10 @@
+//#region node_modules/d3-array/src/range.js
+function e(e, t, n) {
+	e = +e, t = +t, n = (i = arguments.length) < 2 ? (t = e, e = 0, 1) : i < 3 ? 1 : +n;
+	for (var r = -1, i = Math.max(0, Math.ceil((t - e) / n)) | 0, a = Array(i); ++r < i;) a[r] = e + r * n;
+	return a;
+}
+//#endregion
+export { e as default };
+
+//# sourceMappingURL=range.js.map

package/dist/node_modules/d3-array/src/range.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"range.js","names":[],"sources":["../../../../node_modules/d3-array/src/range.js"],"sourcesContent":["export default function range(start, stop, step) {\n  start = +start, stop = +stop, step = (n = arguments.length) < 2 ? (stop = start, start = 0, 1) : n < 3 ? 1 : +step;\n\n  var i = -1,\n      n = Math.max(0, Math.ceil((stop - start) / step)) | 0,\n      range = new Array(n);\n\n  while (++i < n) {\n    range[i] = start + i * step;\n  }\n\n  return range;\n}\n"],"x_google_ignoreList":[0],"mappings":";AAAA,SAAwB,EAAM,GAAO,GAAM,GAAM;AAC/C,KAAQ,CAAC,GAAO,IAAO,CAAC,GAAM,KAAQ,IAAI,UAAU,UAAU,KAAK,IAAO,GAAO,IAAQ,GAAG,KAAK,IAAI,IAAI,IAAI,CAAC;AAM9G,MAJA,IAAI,IAAI,IACJ,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM,IAAO,KAAS,EAAK,CAAC,GAAG,GACpD,IAAY,MAAM,EAAE,EAEjB,EAAE,IAAI,GACX,GAAM,KAAK,IAAQ,IAAI;AAGzB,QAAO"}

package/dist/node_modules/d3-array/src/sort.js

@@ -0,0 +1,17 @@
+import e from "./ascending.js";
+//#region node_modules/d3-array/src/sort.js
+function t(t = e) {
+	if (t === e) return n;
+	if (typeof t != "function") throw TypeError("compare is not a function");
+	return (e, n) => {
+		let r = t(e, n);
+		return r || r === 0 ? r : (t(n, n) === 0) - (t(e, e) === 0);
+	};
+}
+function n(e, t) {
+	return (e == null || !(e >= e)) - (t == null || !(t >= t)) || (e < t ? -1 : +(e > t));
+}
+//#endregion
+export { n as ascendingDefined, t as compareDefined };
+
+//# sourceMappingURL=sort.js.map

package/dist/node_modules/d3-array/src/sort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sort.js","names":[],"sources":["../../../../node_modules/d3-array/src/sort.js"],"sourcesContent":["import ascending from \"./ascending.js\";\nimport permute from \"./permute.js\";\n\nexport default function sort(values, ...F) {\n  if (typeof values[Symbol.iterator] !== \"function\") throw new TypeError(\"values is not iterable\");\n  values = Array.from(values);\n  let [f] = F;\n  if ((f && f.length !== 2) || F.length > 1) {\n    const index = Uint32Array.from(values, (d, i) => i);\n    if (F.length > 1) {\n      F = F.map(f => values.map(f));\n      index.sort((i, j) => {\n        for (const f of F) {\n          const c = ascendingDefined(f[i], f[j]);\n          if (c) return c;\n        }\n      });\n    } else {\n      f = values.map(f);\n      index.sort((i, j) => ascendingDefined(f[i], f[j]));\n    }\n    return permute(values, index);\n  }\n  return values.sort(compareDefined(f));\n}\n\nexport function compareDefined(compare = ascending) {\n  if (compare === ascending) return ascendingDefined;\n  if (typeof compare !== \"function\") throw new TypeError(\"compare is not a function\");\n  return (a, b) => {\n    const x = compare(a, b);\n    if (x || x === 0) return x;\n    return (compare(b, b) === 0) - (compare(a, a) === 0);\n  };\n}\n\nexport function ascendingDefined(a, b) {\n  return (a == null || !(a >= a)) - (b == null || !(b >= b)) || (a < b ? -1 : a > b ? 1 : 0);\n}\n"],"x_google_ignoreList":[0],"mappings":";;AA0BA,SAAgB,EAAe,IAAU,GAAW;AAClD,KAAI,MAAY,EAAW,QAAO;AAClC,KAAI,OAAO,KAAY,WAAY,OAAU,UAAU,4BAA4B;AACnF,SAAQ,GAAG,MAAM;EACf,IAAM,IAAI,EAAQ,GAAG,EAAE;AAEvB,SADI,KAAK,MAAM,IAAU,KACjB,EAAQ,GAAG,EAAE,KAAK,MAAM,EAAQ,GAAG,EAAE,KAAK;;;AAItD,SAAgB,EAAiB,GAAG,GAAG;AACrC,SAAQ,KAAK,QAAQ,EAAE,KAAK,OAAO,KAAK,QAAQ,EAAE,KAAK,QAAQ,IAAI,IAAI,KAAK,MAAI"}

package/dist/node_modules/d3-array/src/ticks.js

@@ -0,0 +1,34 @@
+//#region node_modules/d3-array/src/ticks.js
+var e = Math.sqrt(50), t = Math.sqrt(10), n = Math.sqrt(2);
+function r(i, a, o) {
+	let s = (a - i) / Math.max(0, o), c = Math.floor(Math.log10(s)), l = s / 10 ** c, u = l >= e ? 10 : l >= t ? 5 : l >= n ? 2 : 1, d, f, p;
+	return c < 0 ? (p = 10 ** -c / u, d = Math.round(i * p), f = Math.round(a * p), d / p < i && ++d, f / p > a && --f, p = -p) : (p = 10 ** c * u, d = Math.round(i / p), f = Math.round(a / p), d * p < i && ++d, f * p > a && --f), f < d && .5 <= o && o < 2 ? r(i, a, o * 2) : [
+		d,
+		f,
+		p
+	];
+}
+function i(e, t, n) {
+	if (t = +t, e = +e, n = +n, !(n > 0)) return [];
+	if (e === t) return [e];
+	let i = t < e, [a, o, s] = i ? r(t, e, n) : r(e, t, n);
+	if (!(o >= a)) return [];
+	let c = o - a + 1, l = Array(c);
+	if (i) if (s < 0) for (let e = 0; e < c; ++e) l[e] = (o - e) / -s;
+	else for (let e = 0; e < c; ++e) l[e] = (o - e) * s;
+	else if (s < 0) for (let e = 0; e < c; ++e) l[e] = (a + e) / -s;
+	else for (let e = 0; e < c; ++e) l[e] = (a + e) * s;
+	return l;
+}
+function a(e, t, n) {
+	return t = +t, e = +e, n = +n, r(e, t, n)[2];
+}
+function o(e, t, n) {
+	t = +t, e = +e, n = +n;
+	let r = t < e, i = r ? a(t, e, n) : a(e, t, n);
+	return (r ? -1 : 1) * (i < 0 ? 1 / -i : i);
+}
+//#endregion
+export { i as default, a as tickIncrement, o as tickStep };
+
+//# sourceMappingURL=ticks.js.map

package/dist/node_modules/d3-array/src/ticks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ticks.js","names":[],"sources":["../../../../node_modules/d3-array/src/ticks.js"],"sourcesContent":["const e10 = Math.sqrt(50),\n    e5 = Math.sqrt(10),\n    e2 = Math.sqrt(2);\n\nfunction tickSpec(start, stop, count) {\n  const step = (stop - start) / Math.max(0, count),\n      power = Math.floor(Math.log10(step)),\n      error = step / Math.pow(10, power),\n      factor = error >= e10 ? 10 : error >= e5 ? 5 : error >= e2 ? 2 : 1;\n  let i1, i2, inc;\n  if (power < 0) {\n    inc = Math.pow(10, -power) / factor;\n    i1 = Math.round(start * inc);\n    i2 = Math.round(stop * inc);\n    if (i1 / inc < start) ++i1;\n    if (i2 / inc > stop) --i2;\n    inc = -inc;\n  } else {\n    inc = Math.pow(10, power) * factor;\n    i1 = Math.round(start / inc);\n    i2 = Math.round(stop / inc);\n    if (i1 * inc < start) ++i1;\n    if (i2 * inc > stop) --i2;\n  }\n  if (i2 < i1 && 0.5 <= count && count < 2) return tickSpec(start, stop, count * 2);\n  return [i1, i2, inc];\n}\n\nexport default function ticks(start, stop, count) {\n  stop = +stop, start = +start, count = +count;\n  if (!(count > 0)) return [];\n  if (start === stop) return [start];\n  const reverse = stop < start, [i1, i2, inc] = reverse ? tickSpec(stop, start, count) : tickSpec(start, stop, count);\n  if (!(i2 >= i1)) return [];\n  const n = i2 - i1 + 1, ticks = new Array(n);\n  if (reverse) {\n    if (inc < 0) for (let i = 0; i < n; ++i) ticks[i] = (i2 - i) / -inc;\n    else for (let i = 0; i < n; ++i) ticks[i] = (i2 - i) * inc;\n  } else {\n    if (inc < 0) for (let i = 0; i < n; ++i) ticks[i] = (i1 + i) / -inc;\n    else for (let i = 0; i < n; ++i) ticks[i] = (i1 + i) * inc;\n  }\n  return ticks;\n}\n\nexport function tickIncrement(start, stop, count) {\n  stop = +stop, start = +start, count = +count;\n  return tickSpec(start, stop, count)[2];\n}\n\nexport function tickStep(start, stop, count) {\n  stop = +stop, start = +start, count = +count;\n  const reverse = stop < start, inc = reverse ? tickIncrement(stop, start, count) : tickIncrement(start, stop, count);\n  return (reverse ? -1 : 1) * (inc < 0 ? 1 / -inc : inc);\n}\n"],"x_google_ignoreList":[0],"mappings":";AAAA,IAAM,IAAM,KAAK,KAAK,GAAG,EACrB,IAAK,KAAK,KAAK,GAAG,EAClB,IAAK,KAAK,KAAK,EAAE;AAErB,SAAS,EAAS,GAAO,GAAM,GAAO;CACpC,IAAM,KAAQ,IAAO,KAAS,KAAK,IAAI,GAAG,EAAM,EAC5C,IAAQ,KAAK,MAAM,KAAK,MAAM,EAAK,CAAC,EACpC,IAAQ,IAAgB,MAAI,GAC5B,IAAS,KAAS,IAAM,KAAK,KAAS,IAAK,IAAI,KAAS,IAAK,IAAI,GACjE,GAAI,GAAI;AAgBZ,QAfI,IAAQ,KACV,IAAe,MAAI,CAAC,IAAS,GAC7B,IAAK,KAAK,MAAM,IAAQ,EAAI,EAC5B,IAAK,KAAK,MAAM,IAAO,EAAI,EACvB,IAAK,IAAM,KAAO,EAAE,GACpB,IAAK,IAAM,KAAM,EAAE,GACvB,IAAM,CAAC,MAEP,IAAe,MAAI,IAAS,GAC5B,IAAK,KAAK,MAAM,IAAQ,EAAI,EAC5B,IAAK,KAAK,MAAM,IAAO,EAAI,EACvB,IAAK,IAAM,KAAO,EAAE,GACpB,IAAK,IAAM,KAAM,EAAE,IAErB,IAAK,KAAM,MAAO,KAAS,IAAQ,IAAU,EAAS,GAAO,GAAM,IAAQ,EAAE,GAC1E;EAAC;EAAI;EAAI;EAAI;;AAGtB,SAAwB,EAAM,GAAO,GAAM,GAAO;AAEhD,KADA,IAAO,CAAC,GAAM,IAAQ,CAAC,GAAO,IAAQ,CAAC,GACnC,EAAE,IAAQ,GAAI,QAAO,EAAE;AAC3B,KAAI,MAAU,EAAM,QAAO,CAAC,EAAM;CAClC,IAAM,IAAU,IAAO,GAAO,CAAC,GAAI,GAAI,KAAO,IAAU,EAAS,GAAM,GAAO,EAAM,GAAG,EAAS,GAAO,GAAM,EAAM;AACnH,KAAI,EAAE,KAAM,GAAK,QAAO,EAAE;CAC1B,IAAM,IAAI,IAAK,IAAK,GAAG,IAAY,MAAM,EAAE;AAC3C,KAAI,EACF,KAAI,IAAM,EAAG,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,EAAG,GAAM,MAAM,IAAK,KAAK,CAAC;KAC3D,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,EAAG,GAAM,MAAM,IAAK,KAAK;UAEnD,IAAM,EAAG,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,EAAG,GAAM,MAAM,IAAK,KAAK,CAAC;KAC3D,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,EAAG,GAAM,MAAM,IAAK,KAAK;AAEzD,QAAO;;AAGT,SAAgB,EAAc,GAAO,GAAM,GAAO;AAEhD,QADA,IAAO,CAAC,GAAM,IAAQ,CAAC,GAAO,IAAQ,CAAC,GAChC,EAAS,GAAO,GAAM,EAAM,CAAC;;AAGtC,SAAgB,EAAS,GAAO,GAAM,GAAO;AAC3C,KAAO,CAAC,GAAM,IAAQ,CAAC,GAAO,IAAQ,CAAC;CACvC,IAAM,IAAU,IAAO,GAAO,IAAM,IAAU,EAAc,GAAM,GAAO,EAAM,GAAG,EAAc,GAAO,GAAM,EAAM;AACnH,SAAQ,IAAU,KAAK,MAAM,IAAM,IAAI,IAAI,CAAC,IAAM"}

package/dist/node_modules/d3-color/src/color.js

@@ -0,0 +1,291 @@
+import e, { extend as t } from "./define.js";
+//#region node_modules/d3-color/src/color.js
+function n() {}
+var r = .7, i = 1 / r, a = "\\s*([+-]?\\d+)\\s*", o = "\\s*([+-]?(?:\\d*\\.)?\\d+(?:[eE][+-]?\\d+)?)\\s*", s = "\\s*([+-]?(?:\\d*\\.)?\\d+(?:[eE][+-]?\\d+)?)%\\s*", c = /^#([0-9a-f]{3,8})$/, l = RegExp(`^rgb\\(${a},${a},${a}\\)$`), u = RegExp(`^rgb\\(${s},${s},${s}\\)$`), d = RegExp(`^rgba\\(${a},${a},${a},${o}\\)$`), f = RegExp(`^rgba\\(${s},${s},${s},${o}\\)$`), p = RegExp(`^hsl\\(${o},${s},${s}\\)$`), m = RegExp(`^hsla\\(${o},${s},${s},${o}\\)$`), h = {
+	aliceblue: 15792383,
+	antiquewhite: 16444375,
+	aqua: 65535,
+	aquamarine: 8388564,
+	azure: 15794175,
+	beige: 16119260,
+	bisque: 16770244,
+	black: 0,
+	blanchedalmond: 16772045,
+	blue: 255,
+	blueviolet: 9055202,
+	brown: 10824234,
+	burlywood: 14596231,
+	cadetblue: 6266528,
+	chartreuse: 8388352,
+	chocolate: 13789470,
+	coral: 16744272,
+	cornflowerblue: 6591981,
+	cornsilk: 16775388,
+	crimson: 14423100,
+	cyan: 65535,
+	darkblue: 139,
+	darkcyan: 35723,
+	darkgoldenrod: 12092939,
+	darkgray: 11119017,
+	darkgreen: 25600,
+	darkgrey: 11119017,
+	darkkhaki: 12433259,
+	darkmagenta: 9109643,
+	darkolivegreen: 5597999,
+	darkorange: 16747520,
+	darkorchid: 10040012,
+	darkred: 9109504,
+	darksalmon: 15308410,
+	darkseagreen: 9419919,
+	darkslateblue: 4734347,
+	darkslategray: 3100495,
+	darkslategrey: 3100495,
+	darkturquoise: 52945,
+	darkviolet: 9699539,
+	deeppink: 16716947,
+	deepskyblue: 49151,
+	dimgray: 6908265,
+	dimgrey: 6908265,
+	dodgerblue: 2003199,
+	firebrick: 11674146,
+	floralwhite: 16775920,
+	forestgreen: 2263842,
+	fuchsia: 16711935,
+	gainsboro: 14474460,
+	ghostwhite: 16316671,
+	gold: 16766720,
+	goldenrod: 14329120,
+	gray: 8421504,
+	green: 32768,
+	greenyellow: 11403055,
+	grey: 8421504,
+	honeydew: 15794160,
+	hotpink: 16738740,
+	indianred: 13458524,
+	indigo: 4915330,
+	ivory: 16777200,
+	khaki: 15787660,
+	lavender: 15132410,
+	lavenderblush: 16773365,
+	lawngreen: 8190976,
+	lemonchiffon: 16775885,
+	lightblue: 11393254,
+	lightcoral: 15761536,
+	lightcyan: 14745599,
+	lightgoldenrodyellow: 16448210,
+	lightgray: 13882323,
+	lightgreen: 9498256,
+	lightgrey: 13882323,
+	lightpink: 16758465,
+	lightsalmon: 16752762,
+	lightseagreen: 2142890,
+	lightskyblue: 8900346,
+	lightslategray: 7833753,
+	lightslategrey: 7833753,
+	lightsteelblue: 11584734,
+	lightyellow: 16777184,
+	lime: 65280,
+	limegreen: 3329330,
+	linen: 16445670,
+	magenta: 16711935,
+	maroon: 8388608,
+	mediumaquamarine: 6737322,
+	mediumblue: 205,
+	mediumorchid: 12211667,
+	mediumpurple: 9662683,
+	mediumseagreen: 3978097,
+	mediumslateblue: 8087790,
+	mediumspringgreen: 64154,
+	mediumturquoise: 4772300,
+	mediumvioletred: 13047173,
+	midnightblue: 1644912,
+	mintcream: 16121850,
+	mistyrose: 16770273,
+	moccasin: 16770229,
+	navajowhite: 16768685,
+	navy: 128,
+	oldlace: 16643558,
+	olive: 8421376,
+	olivedrab: 7048739,
+	orange: 16753920,
+	orangered: 16729344,
+	orchid: 14315734,
+	palegoldenrod: 15657130,
+	palegreen: 10025880,
+	paleturquoise: 11529966,
+	palevioletred: 14381203,
+	papayawhip: 16773077,
+	peachpuff: 16767673,
+	peru: 13468991,
+	pink: 16761035,
+	plum: 14524637,
+	powderblue: 11591910,
+	purple: 8388736,
+	rebeccapurple: 6697881,
+	red: 16711680,
+	rosybrown: 12357519,
+	royalblue: 4286945,
+	saddlebrown: 9127187,
+	salmon: 16416882,
+	sandybrown: 16032864,
+	seagreen: 3050327,
+	seashell: 16774638,
+	sienna: 10506797,
+	silver: 12632256,
+	skyblue: 8900331,
+	slateblue: 6970061,
+	slategray: 7372944,
+	slategrey: 7372944,
+	snow: 16775930,
+	springgreen: 65407,
+	steelblue: 4620980,
+	tan: 13808780,
+	teal: 32896,
+	thistle: 14204888,
+	tomato: 16737095,
+	turquoise: 4251856,
+	violet: 15631086,
+	wheat: 16113331,
+	white: 16777215,
+	whitesmoke: 16119285,
+	yellow: 16776960,
+	yellowgreen: 10145074
+};
+e(n, b, {
+	copy(e) {
+		return Object.assign(new this.constructor(), this, e);
+	},
+	displayable() {
+		return this.rgb().displayable();
+	},
+	hex: g,
+	formatHex: g,
+	formatHex8: _,
+	formatHsl: v,
+	formatRgb: y,
+	toString: y
+});
+function g() {
+	return this.rgb().formatHex();
+}
+function _() {
+	return this.rgb().formatHex8();
+}
+function v() {
+	return N(this).formatHsl();
+}
+function y() {
+	return this.rgb().formatRgb();
+}
+function b(e) {
+	var t, n;
+	return e = (e + "").trim().toLowerCase(), (t = c.exec(e)) ? (n = t[1].length, t = parseInt(t[1], 16), n === 6 ? x(t) : n === 3 ? new T(t >> 8 & 15 | t >> 4 & 240, t >> 4 & 15 | t & 240, (t & 15) << 4 | t & 15, 1) : n === 8 ? S(t >> 24 & 255, t >> 16 & 255, t >> 8 & 255, (t & 255) / 255) : n === 4 ? S(t >> 12 & 15 | t >> 8 & 240, t >> 8 & 15 | t >> 4 & 240, t >> 4 & 15 | t & 240, ((t & 15) << 4 | t & 15) / 255) : null) : (t = l.exec(e)) ? new T(t[1], t[2], t[3], 1) : (t = u.exec(e)) ? new T(t[1] * 255 / 100, t[2] * 255 / 100, t[3] * 255 / 100, 1) : (t = d.exec(e)) ? S(t[1], t[2], t[3], t[4]) : (t = f.exec(e)) ? S(t[1] * 255 / 100, t[2] * 255 / 100, t[3] * 255 / 100, t[4]) : (t = p.exec(e)) ? M(t[1], t[2] / 100, t[3] / 100, 1) : (t = m.exec(e)) ? M(t[1], t[2] / 100, t[3] / 100, t[4]) : h.hasOwnProperty(e) ? x(h[e]) : e === "transparent" ? new T(NaN, NaN, NaN, 0) : null;
+}
+function x(e) {
+	return new T(e >> 16 & 255, e >> 8 & 255, e & 255, 1);
+}
+function S(e, t, n, r) {
+	return r <= 0 && (e = t = n = NaN), new T(e, t, n, r);
+}
+function C(e) {
+	return e instanceof n || (e = b(e)), e ? (e = e.rgb(), new T(e.r, e.g, e.b, e.opacity)) : new T();
+}
+function w(e, t, n, r) {
+	return arguments.length === 1 ? C(e) : new T(e, t, n, r ?? 1);
+}
+function T(e, t, n, r) {
+	this.r = +e, this.g = +t, this.b = +n, this.opacity = +r;
+}
+e(T, w, t(n, {
+	brighter(e) {
+		return e = e == null ? i : i ** +e, new T(this.r * e, this.g * e, this.b * e, this.opacity);
+	},
+	darker(e) {
+		return e = e == null ? r : r ** +e, new T(this.r * e, this.g * e, this.b * e, this.opacity);
+	},
+	rgb() {
+		return this;
+	},
+	clamp() {
+		return new T(A(this.r), A(this.g), A(this.b), k(this.opacity));
+	},
+	displayable() {
+		return -.5 <= this.r && this.r < 255.5 && -.5 <= this.g && this.g < 255.5 && -.5 <= this.b && this.b < 255.5 && 0 <= this.opacity && this.opacity <= 1;
+	},
+	hex: E,
+	formatHex: E,
+	formatHex8: D,
+	formatRgb: O,
+	toString: O
+}));
+function E() {
+	return `#${j(this.r)}${j(this.g)}${j(this.b)}`;
+}
+function D() {
+	return `#${j(this.r)}${j(this.g)}${j(this.b)}${j((isNaN(this.opacity) ? 1 : this.opacity) * 255)}`;
+}
+function O() {
+	let e = k(this.opacity);
+	return `${e === 1 ? "rgb(" : "rgba("}${A(this.r)}, ${A(this.g)}, ${A(this.b)}${e === 1 ? ")" : `, ${e})`}`;
+}
+function k(e) {
+	return isNaN(e) ? 1 : Math.max(0, Math.min(1, e));
+}
+function A(e) {
+	return Math.max(0, Math.min(255, Math.round(e) || 0));
+}
+function j(e) {
+	return e = A(e), (e < 16 ? "0" : "") + e.toString(16);
+}
+function M(e, t, n, r) {
+	return r <= 0 ? e = t = n = NaN : n <= 0 || n >= 1 ? e = t = NaN : t <= 0 && (e = NaN), new F(e, t, n, r);
+}
+function N(e) {
+	if (e instanceof F) return new F(e.h, e.s, e.l, e.opacity);
+	if (e instanceof n || (e = b(e)), !e) return new F();
+	if (e instanceof F) return e;
+	e = e.rgb();
+	var t = e.r / 255, r = e.g / 255, i = e.b / 255, a = Math.min(t, r, i), o = Math.max(t, r, i), s = NaN, c = o - a, l = (o + a) / 2;
+	return c ? (s = t === o ? (r - i) / c + (r < i) * 6 : r === o ? (i - t) / c + 2 : (t - r) / c + 4, c /= l < .5 ? o + a : 2 - o - a, s *= 60) : c = l > 0 && l < 1 ? 0 : s, new F(s, c, l, e.opacity);
+}
+function P(e, t, n, r) {
+	return arguments.length === 1 ? N(e) : new F(e, t, n, r ?? 1);
+}
+function F(e, t, n, r) {
+	this.h = +e, this.s = +t, this.l = +n, this.opacity = +r;
+}
+e(F, P, t(n, {
+	brighter(e) {
+		return e = e == null ? i : i ** +e, new F(this.h, this.s, this.l * e, this.opacity);
+	},
+	darker(e) {
+		return e = e == null ? r : r ** +e, new F(this.h, this.s, this.l * e, this.opacity);
+	},
+	rgb() {
+		var e = this.h % 360 + (this.h < 0) * 360, t = isNaN(e) || isNaN(this.s) ? 0 : this.s, n = this.l, r = n + (n < .5 ? n : 1 - n) * t, i = 2 * n - r;
+		return new T(R(e >= 240 ? e - 240 : e + 120, i, r), R(e, i, r), R(e < 120 ? e + 240 : e - 120, i, r), this.opacity);
+	},
+	clamp() {
+		return new F(I(this.h), L(this.s), L(this.l), k(this.opacity));
+	},
+	displayable() {
+		return (0 <= this.s && this.s <= 1 || isNaN(this.s)) && 0 <= this.l && this.l <= 1 && 0 <= this.opacity && this.opacity <= 1;
+	},
+	formatHsl() {
+		let e = k(this.opacity);
+		return `${e === 1 ? "hsl(" : "hsla("}${I(this.h)}, ${L(this.s) * 100}%, ${L(this.l) * 100}%${e === 1 ? ")" : `, ${e})`}`;
+	}
+}));
+function I(e) {
+	return e = (e || 0) % 360, e < 0 ? e + 360 : e;
+}
+function L(e) {
+	return Math.max(0, Math.min(1, e || 0));
+}
+function R(e, t, n) {
+	return (e < 60 ? t + (n - t) * e / 60 : e < 180 ? n : e < 240 ? t + (n - t) * (240 - e) / 60 : t) * 255;
+}
+//#endregion
+export { b as default, w as rgb };
+
+//# sourceMappingURL=color.js.map