@burdenoff/microfe-eventfullymanaged 2026.704.6 → 2026.704.8

package/dist/node_modules/recharts-scale/es6/getNiceTickValues.js

@@ -0,0 +1,132 @@
+import { __toESM as e } from "../../../_virtual/_rolldown/runtime.js";
+import { require_decimal as t } from "../../decimal.js-light/decimal.js";
+import { compose as n, map as r, memoize as i, range as a, reverse as o } from "./util/utils.js";
+import s from "./util/arithmetic.js";
+//#region node_modules/recharts-scale/es6/getNiceTickValues.js
+var c = /* @__PURE__ */ e(t());
+function l(e) {
+	return f(e) || d(e) || h(e) || u();
+}
+function u() {
+	throw TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+function d(e) {
+	if (typeof Symbol < "u" && Symbol.iterator in Object(e)) return Array.from(e);
+}
+function f(e) {
+	if (Array.isArray(e)) return g(e);
+}
+function p(e, t) {
+	return v(e) || _(e, t) || h(e, t) || m();
+}
+function m() {
+	throw TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+function h(e, t) {
+	if (e) {
+		if (typeof e == "string") return g(e, t);
+		var n = Object.prototype.toString.call(e).slice(8, -1);
+		if (n === "Object" && e.constructor && (n = e.constructor.name), n === "Map" || n === "Set") return Array.from(e);
+		if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return g(e, t);
+	}
+}
+function g(e, t) {
+	(t == null || t > e.length) && (t = e.length);
+	for (var n = 0, r = Array(t); n < t; n++) r[n] = e[n];
+	return r;
+}
+function _(e, t) {
+	if (!(typeof Symbol > "u" || !(Symbol.iterator in Object(e)))) {
+		var n = [], r = !0, i = !1, a = void 0;
+		try {
+			for (var o = e[Symbol.iterator](), s; !(r = (s = o.next()).done) && (n.push(s.value), !(t && n.length === t)); r = !0);
+		} catch (e) {
+			i = !0, a = e;
+		} finally {
+			try {
+				!r && o.return != null && o.return();
+			} finally {
+				if (i) throw a;
+			}
+		}
+		return n;
+	}
+}
+function v(e) {
+	if (Array.isArray(e)) return e;
+}
+function y(e) {
+	var t = p(e, 2), n = t[0], r = t[1], i = n, a = r;
+	return n > r && (i = r, a = n), [i, a];
+}
+function b(e, t, n) {
+	if (e.lte(0)) return new c.default(0);
+	var r = s.getDigitCount(e.toNumber()), i = new c.default(10).pow(r), a = e.div(i), o = r === 1 ? .1 : .05, l = new c.default(Math.ceil(a.div(o).toNumber())).add(n).mul(o).mul(i);
+	return t ? l : new c.default(Math.ceil(l));
+}
+function x(e, t, i) {
+	var o = 1, l = new c.default(e);
+	if (!l.isint() && i) {
+		var u = Math.abs(e);
+		u < 1 ? (o = new c.default(10).pow(s.getDigitCount(e) - 1), l = new c.default(Math.floor(l.div(o).toNumber())).mul(o)) : u > 1 && (l = new c.default(Math.floor(e)));
+	} else e === 0 ? l = new c.default(Math.floor((t - 1) / 2)) : i || (l = new c.default(Math.floor(e)));
+	var d = Math.floor((t - 1) / 2);
+	return n(r(function(e) {
+		return l.add(new c.default(e - d).mul(o)).toNumber();
+	}), a)(0, t);
+}
+function S(e, t, n, r) {
+	var i = arguments.length > 4 && arguments[4] !== void 0 ? arguments[4] : 0;
+	if (!Number.isFinite((t - e) / (n - 1))) return {
+		step: new c.default(0),
+		tickMin: new c.default(0),
+		tickMax: new c.default(0)
+	};
+	var a = b(new c.default(t).sub(e).div(n - 1), r, i), o;
+	e <= 0 && t >= 0 ? o = new c.default(0) : (o = new c.default(e).add(t).div(2), o = o.sub(new c.default(o).mod(a)));
+	var s = Math.ceil(o.sub(e).div(a).toNumber()), l = Math.ceil(new c.default(t).sub(o).div(a).toNumber()), u = s + l + 1;
+	return u > n ? S(e, t, n, r, i + 1) : (u < n && (l = t > 0 ? l + (n - u) : l, s = t > 0 ? s : s + (n - u)), {
+		step: a,
+		tickMin: o.sub(new c.default(s).mul(a)),
+		tickMax: o.add(new c.default(l).mul(a))
+	});
+}
+function C(e) {
+	var t = p(e, 2), n = t[0], r = t[1], i = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : 6, u = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : !0, d = Math.max(i, 2), f = p(y([n, r]), 2), m = f[0], h = f[1];
+	if (m === -Infinity || h === Infinity) {
+		var g = h === Infinity ? [m].concat(l(a(0, i - 1).map(function() {
+			return Infinity;
+		}))) : [].concat(l(a(0, i - 1).map(function() {
+			return -Infinity;
+		})), [h]);
+		return n > r ? o(g) : g;
+	}
+	if (m === h) return x(m, i, u);
+	var _ = S(m, h, d, u), v = _.step, b = _.tickMin, C = _.tickMax, w = s.rangeStep(b, C.add(new c.default(.1).mul(v)), v);
+	return n > r ? o(w) : w;
+}
+function w(e) {
+	var t = p(e, 2), i = t[0], s = t[1], l = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : 6, u = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : !0, d = Math.max(l, 2), f = p(y([i, s]), 2), m = f[0], h = f[1];
+	if (m === -Infinity || h === Infinity) return [i, s];
+	if (m === h) return x(m, l, u);
+	var g = b(new c.default(h).sub(m).div(d - 1), u, 0), _ = n(r(function(e) {
+		return new c.default(m).add(new c.default(e).mul(g)).toNumber();
+	}), a)(0, d).filter(function(e) {
+		return e >= m && e <= h;
+	});
+	return i > s ? o(_) : _;
+}
+function T(e, t) {
+	var n = p(e, 2), r = n[0], i = n[1], a = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : !0, u = p(y([r, i]), 2), d = u[0], f = u[1];
+	if (d === -Infinity || f === Infinity) return [r, i];
+	if (d === f) return [d];
+	var m = Math.max(t, 2), h = b(new c.default(f).sub(d).div(m - 1), a, 0), g = [].concat(l(s.rangeStep(new c.default(d), new c.default(f).sub(new c.default(.99).mul(h)), h)), [f]);
+	return r > i ? o(g) : g;
+}
+var E = i(C);
+i(w);
+var D = i(T);
+//#endregion
+export { E as getNiceTickValues, D as getTickValuesFixedDomain };
+
+//# sourceMappingURL=getNiceTickValues.js.map

package/dist/node_modules/recharts-scale/es6/getNiceTickValues.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getNiceTickValues.js","names":["Decimal","Arithmetic"],"sources":["../../../../node_modules/recharts-scale/es6/getNiceTickValues.js"],"sourcesContent":["function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\n\nfunction _iterableToArray(iter) { if (typeof Symbol !== \"undefined\" && Symbol.iterator in Object(iter)) return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }\n\nfunction _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\n\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\n\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\n\nfunction _iterableToArrayLimit(arr, i) { if (typeof Symbol === \"undefined\" || !(Symbol.iterator in Object(arr))) return; var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\n/**\n * @fileOverview calculate tick values of scale\n * @author xile611, arcthur\n * @date 2015-09-17\n */\nimport Decimal from 'decimal.js-light';\nimport { compose, range, memoize, map, reverse } from './util/utils';\nimport Arithmetic from './util/arithmetic';\n/**\n * Calculate a interval of a minimum value and a maximum value\n *\n * @param  {Number} min       The minimum value\n * @param  {Number} max       The maximum value\n * @return {Array} An interval\n */\n\nfunction getValidInterval(_ref) {\n  var _ref2 = _slicedToArray(_ref, 2),\n      min = _ref2[0],\n      max = _ref2[1];\n\n  var validMin = min,\n      validMax = max; // exchange\n\n  if (min > max) {\n    validMin = max;\n    validMax = min;\n  }\n\n  return [validMin, validMax];\n}\n/**\n * Calculate the step which is easy to understand between ticks, like 10, 20, 25\n *\n * @param  {Decimal} roughStep        The rough step calculated by deviding the\n * difference by the tickCount\n * @param  {Boolean} allowDecimals    Allow the ticks to be decimals or not\n * @param  {Integer} correctionFactor A correction factor\n * @return {Decimal} The step which is easy to understand between two ticks\n */\n\n\nfunction getFormatStep(roughStep, allowDecimals, correctionFactor) {\n  if (roughStep.lte(0)) {\n    return new Decimal(0);\n  }\n\n  var digitCount = Arithmetic.getDigitCount(roughStep.toNumber()); // The ratio between the rough step and the smallest number which has a bigger\n  // order of magnitudes than the rough step\n\n  var digitCountValue = new Decimal(10).pow(digitCount);\n  var stepRatio = roughStep.div(digitCountValue); // When an integer and a float multiplied, the accuracy of result may be wrong\n\n  var stepRatioScale = digitCount !== 1 ? 0.05 : 0.1;\n  var amendStepRatio = new Decimal(Math.ceil(stepRatio.div(stepRatioScale).toNumber())).add(correctionFactor).mul(stepRatioScale);\n  var formatStep = amendStepRatio.mul(digitCountValue);\n  return allowDecimals ? formatStep : new Decimal(Math.ceil(formatStep));\n}\n/**\n * calculate the ticks when the minimum value equals to the maximum value\n *\n * @param  {Number}  value         The minimum valuue which is also the maximum value\n * @param  {Integer} tickCount     The count of ticks\n * @param  {Boolean} allowDecimals Allow the ticks to be decimals or not\n * @return {Array}                 ticks\n */\n\n\nfunction getTickOfSingleValue(value, tickCount, allowDecimals) {\n  var step = 1; // calculate the middle value of ticks\n\n  var middle = new Decimal(value);\n\n  if (!middle.isint() && allowDecimals) {\n    var absVal = Math.abs(value);\n\n    if (absVal < 1) {\n      // The step should be a float number when the difference is smaller than 1\n      step = new Decimal(10).pow(Arithmetic.getDigitCount(value) - 1);\n      middle = new Decimal(Math.floor(middle.div(step).toNumber())).mul(step);\n    } else if (absVal > 1) {\n      // Return the maximum integer which is smaller than 'value' when 'value' is greater than 1\n      middle = new Decimal(Math.floor(value));\n    }\n  } else if (value === 0) {\n    middle = new Decimal(Math.floor((tickCount - 1) / 2));\n  } else if (!allowDecimals) {\n    middle = new Decimal(Math.floor(value));\n  }\n\n  var middleIndex = Math.floor((tickCount - 1) / 2);\n  var fn = compose(map(function (n) {\n    return middle.add(new Decimal(n - middleIndex).mul(step)).toNumber();\n  }), range);\n  return fn(0, tickCount);\n}\n/**\n * Calculate the step\n *\n * @param  {Number}  min              The minimum value of an interval\n * @param  {Number}  max              The maximum value of an interval\n * @param  {Integer} tickCount        The count of ticks\n * @param  {Boolean} allowDecimals    Allow the ticks to be decimals or not\n * @param  {Number}  correctionFactor A correction factor\n * @return {Object}  The step, minimum value of ticks, maximum value of ticks\n */\n\n\nfunction calculateStep(min, max, tickCount, allowDecimals) {\n  var correctionFactor = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 0;\n\n  // dirty hack (for recharts' test)\n  if (!Number.isFinite((max - min) / (tickCount - 1))) {\n    return {\n      step: new Decimal(0),\n      tickMin: new Decimal(0),\n      tickMax: new Decimal(0)\n    };\n  } // The step which is easy to understand between two ticks\n\n\n  var step = getFormatStep(new Decimal(max).sub(min).div(tickCount - 1), allowDecimals, correctionFactor); // A medial value of ticks\n\n  var middle; // When 0 is inside the interval, 0 should be a tick\n\n  if (min <= 0 && max >= 0) {\n    middle = new Decimal(0);\n  } else {\n    // calculate the middle value\n    middle = new Decimal(min).add(max).div(2); // minus modulo value\n\n    middle = middle.sub(new Decimal(middle).mod(step));\n  }\n\n  var belowCount = Math.ceil(middle.sub(min).div(step).toNumber());\n  var upCount = Math.ceil(new Decimal(max).sub(middle).div(step).toNumber());\n  var scaleCount = belowCount + upCount + 1;\n\n  if (scaleCount > tickCount) {\n    // When more ticks need to cover the interval, step should be bigger.\n    return calculateStep(min, max, tickCount, allowDecimals, correctionFactor + 1);\n  }\n\n  if (scaleCount < tickCount) {\n    // When less ticks can cover the interval, we should add some additional ticks\n    upCount = max > 0 ? upCount + (tickCount - scaleCount) : upCount;\n    belowCount = max > 0 ? belowCount : belowCount + (tickCount - scaleCount);\n  }\n\n  return {\n    step: step,\n    tickMin: middle.sub(new Decimal(belowCount).mul(step)),\n    tickMax: middle.add(new Decimal(upCount).mul(step))\n  };\n}\n/**\n * Calculate the ticks of an interval, the count of ticks will be guraranteed\n *\n * @param  {Number}  min, max      min: The minimum value, max: The maximum value\n * @param  {Integer} tickCount     The count of ticks\n * @param  {Boolean} allowDecimals Allow the ticks to be decimals or not\n * @return {Array}   ticks\n */\n\n\nfunction getNiceTickValuesFn(_ref3) {\n  var _ref4 = _slicedToArray(_ref3, 2),\n      min = _ref4[0],\n      max = _ref4[1];\n\n  var tickCount = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 6;\n  var allowDecimals = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;\n  // More than two ticks should be return\n  var count = Math.max(tickCount, 2);\n\n  var _getValidInterval = getValidInterval([min, max]),\n      _getValidInterval2 = _slicedToArray(_getValidInterval, 2),\n      cormin = _getValidInterval2[0],\n      cormax = _getValidInterval2[1];\n\n  if (cormin === -Infinity || cormax === Infinity) {\n    var _values = cormax === Infinity ? [cormin].concat(_toConsumableArray(range(0, tickCount - 1).map(function () {\n      return Infinity;\n    }))) : [].concat(_toConsumableArray(range(0, tickCount - 1).map(function () {\n      return -Infinity;\n    })), [cormax]);\n\n    return min > max ? reverse(_values) : _values;\n  }\n\n  if (cormin === cormax) {\n    return getTickOfSingleValue(cormin, tickCount, allowDecimals);\n  } // Get the step between two ticks\n\n\n  var _calculateStep = calculateStep(cormin, cormax, count, allowDecimals),\n      step = _calculateStep.step,\n      tickMin = _calculateStep.tickMin,\n      tickMax = _calculateStep.tickMax;\n\n  var values = Arithmetic.rangeStep(tickMin, tickMax.add(new Decimal(0.1).mul(step)), step);\n  return min > max ? reverse(values) : values;\n}\n/**\n * Calculate the ticks of an interval, the count of ticks won't be guraranteed\n *\n * @param  {Number}  min, max      min: The minimum value, max: The maximum value\n * @param  {Integer} tickCount     The count of ticks\n * @param  {Boolean} allowDecimals Allow the ticks to be decimals or not\n * @return {Array}   ticks\n */\n\n\nfunction getTickValuesFn(_ref5) {\n  var _ref6 = _slicedToArray(_ref5, 2),\n      min = _ref6[0],\n      max = _ref6[1];\n\n  var tickCount = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 6;\n  var allowDecimals = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;\n  // More than two ticks should be return\n  var count = Math.max(tickCount, 2);\n\n  var _getValidInterval3 = getValidInterval([min, max]),\n      _getValidInterval4 = _slicedToArray(_getValidInterval3, 2),\n      cormin = _getValidInterval4[0],\n      cormax = _getValidInterval4[1];\n\n  if (cormin === -Infinity || cormax === Infinity) {\n    return [min, max];\n  }\n\n  if (cormin === cormax) {\n    return getTickOfSingleValue(cormin, tickCount, allowDecimals);\n  }\n\n  var step = getFormatStep(new Decimal(cormax).sub(cormin).div(count - 1), allowDecimals, 0);\n  var fn = compose(map(function (n) {\n    return new Decimal(cormin).add(new Decimal(n).mul(step)).toNumber();\n  }), range);\n  var values = fn(0, count).filter(function (entry) {\n    return entry >= cormin && entry <= cormax;\n  });\n  return min > max ? reverse(values) : values;\n}\n/**\n * Calculate the ticks of an interval, the count of ticks won't be guraranteed,\n * but the domain will be guaranteed\n *\n * @param  {Number}  min, max      min: The minimum value, max: The maximum value\n * @param  {Integer} tickCount     The count of ticks\n * @param  {Boolean} allowDecimals Allow the ticks to be decimals or not\n * @return {Array}   ticks\n */\n\n\nfunction getTickValuesFixedDomainFn(_ref7, tickCount) {\n  var _ref8 = _slicedToArray(_ref7, 2),\n      min = _ref8[0],\n      max = _ref8[1];\n\n  var allowDecimals = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;\n\n  // More than two ticks should be return\n  var _getValidInterval5 = getValidInterval([min, max]),\n      _getValidInterval6 = _slicedToArray(_getValidInterval5, 2),\n      cormin = _getValidInterval6[0],\n      cormax = _getValidInterval6[1];\n\n  if (cormin === -Infinity || cormax === Infinity) {\n    return [min, max];\n  }\n\n  if (cormin === cormax) {\n    return [cormin];\n  }\n\n  var count = Math.max(tickCount, 2);\n  var step = getFormatStep(new Decimal(cormax).sub(cormin).div(count - 1), allowDecimals, 0);\n  var values = [].concat(_toConsumableArray(Arithmetic.rangeStep(new Decimal(cormin), new Decimal(cormax).sub(new Decimal(0.99).mul(step)), step)), [cormax]);\n  return min > max ? reverse(values) : values;\n}\n\nexport var getNiceTickValues = memoize(getNiceTickValuesFn);\nexport var getTickValues = memoize(getTickValuesFn);\nexport var getTickValuesFixedDomain = memoize(getTickValuesFixedDomainFn);"],"x_google_ignoreList":[0],"mappings":";;;;;;AAAA,SAAS,EAAmB,GAAK;AAAE,QAAO,EAAmB,EAAI,IAAI,EAAiB,EAAI,IAAI,EAA4B,EAAI,IAAI,GAAoB;;AAEtJ,SAAS,IAAqB;AAAE,OAAU,UAAU,uIAAuI;;AAE3L,SAAS,EAAiB,GAAM;AAAE,KAAI,OAAO,SAAW,OAAe,OAAO,YAAY,OAAO,EAAK,CAAE,QAAO,MAAM,KAAK,EAAK;;AAE/H,SAAS,EAAmB,GAAK;AAAE,KAAI,MAAM,QAAQ,EAAI,CAAE,QAAO,EAAkB,EAAI;;AAExF,SAAS,EAAe,GAAK,GAAG;AAAE,QAAO,EAAgB,EAAI,IAAI,EAAsB,GAAK,EAAE,IAAI,EAA4B,GAAK,EAAE,IAAI,GAAkB;;AAE3J,SAAS,IAAmB;AAAE,OAAU,UAAU,4IAA4I;;AAE9L,SAAS,EAA4B,GAAG,GAAQ;AAAO,QAAW;MAAI,OAAO,KAAM,SAAU,QAAO,EAAkB,GAAG,EAAO;EAAE,IAAI,IAAI,OAAO,UAAU,SAAS,KAAK,EAAE,CAAC,MAAM,GAAG,GAAG;AAA+D,MAAzD,MAAM,YAAY,EAAE,gBAAa,IAAI,EAAE,YAAY,OAAU,MAAM,SAAS,MAAM,MAAO,QAAO,MAAM,KAAK,EAAE;AAAE,MAAI,MAAM,eAAe,2CAA2C,KAAK,EAAE,CAAE,QAAO,EAAkB,GAAG,EAAO;;;AAE7Z,SAAS,EAAkB,GAAK,GAAK;AAAE,EAAI,KAAO,QAAQ,IAAM,EAAI,YAAQ,IAAM,EAAI;AAAQ,MAAK,IAAI,IAAI,GAAG,IAAW,MAAM,EAAI,EAAE,IAAI,GAAK,IAAO,GAAK,KAAK,EAAI;AAAM,QAAO;;AAEhL,SAAS,EAAsB,GAAK,GAAG;AAAM,cAAO,SAAW,OAAe,EAAE,OAAO,YAAY,OAAO,EAAI,IAAW;MAAI,IAAO,EAAE,EAAM,IAAK,IAAU,IAAK,IAAW,IAAK,KAAA;AAAW,MAAI;AAAE,QAAK,IAAI,IAAK,EAAI,OAAO,WAAW,EAAE,GAAI,EAAE,KAAM,IAAK,EAAG,MAAM,EAAE,UAAoB,EAAK,KAAK,EAAG,MAAM,EAAM,OAAK,EAAK,WAAW,KAA3D,IAAK;WAA2E,GAAK;AAAa,GAAX,IAAK,IAAM,IAAK;YAAe;AAAE,OAAI;AAAE,IAAI,CAAC,KAAM,EAAG,UAAa,QAAM,EAAG,QAAW;aAAY;AAAE,QAAI,EAAI,OAAM;;;AAAQ,SAAO;;;AAEle,SAAS,EAAgB,GAAK;AAAE,KAAI,MAAM,QAAQ,EAAI,CAAE,QAAO;;AAkB/D,SAAS,EAAiB,GAAM;CAC9B,IAAI,IAAQ,EAAe,GAAM,EAAE,EAC/B,IAAM,EAAM,IACZ,IAAM,EAAM,IAEZ,IAAW,GACX,IAAW;AAOf,QALI,IAAM,MACR,IAAW,GACX,IAAW,IAGN,CAAC,GAAU,EAAS;;AAa7B,SAAS,EAAc,GAAW,GAAe,GAAkB;AACjE,KAAI,EAAU,IAAI,EAAE,CAClB,QAAO,IAAIA,EAAAA,QAAQ,EAAE;CAGvB,IAAI,IAAaC,EAAW,cAAc,EAAU,UAAU,CAAC,EAG3D,IAAkB,IAAID,EAAAA,QAAQ,GAAG,CAAC,IAAI,EAAW,EACjD,IAAY,EAAU,IAAI,EAAgB,EAE1C,IAAiB,MAAe,IAAW,KAAP,KAEpC,IADiB,IAAIA,EAAAA,QAAQ,KAAK,KAAK,EAAU,IAAI,EAAe,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAiB,CAAC,IAAI,EAAe,CAC/F,IAAI,EAAgB;AACpD,QAAO,IAAgB,IAAa,IAAIA,EAAAA,QAAQ,KAAK,KAAK,EAAW,CAAC;;AAYxE,SAAS,EAAqB,GAAO,GAAW,GAAe;CAC7D,IAAI,IAAO,GAEP,IAAS,IAAIA,EAAAA,QAAQ,EAAM;AAE/B,KAAI,CAAC,EAAO,OAAO,IAAI,GAAe;EACpC,IAAI,IAAS,KAAK,IAAI,EAAM;AAE5B,EAAI,IAAS,KAEX,IAAO,IAAIA,EAAAA,QAAQ,GAAG,CAAC,IAAIC,EAAW,cAAc,EAAM,GAAG,EAAE,EAC/D,IAAS,IAAID,EAAAA,QAAQ,KAAK,MAAM,EAAO,IAAI,EAAK,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAK,IAC9D,IAAS,MAElB,IAAS,IAAIA,EAAAA,QAAQ,KAAK,MAAM,EAAM,CAAC;QAEhC,MAAU,IACnB,IAAS,IAAIA,EAAAA,QAAQ,KAAK,OAAO,IAAY,KAAK,EAAE,CAAC,GAC3C,MACV,IAAS,IAAIA,EAAAA,QAAQ,KAAK,MAAM,EAAM,CAAC;CAGzC,IAAI,IAAc,KAAK,OAAO,IAAY,KAAK,EAAE;AAIjD,QAHS,EAAQ,EAAI,SAAU,GAAG;AAChC,SAAO,EAAO,IAAI,IAAIA,EAAAA,QAAQ,IAAI,EAAY,CAAC,IAAI,EAAK,CAAC,CAAC,UAAU;GACpE,EAAE,EAAM,CACA,GAAG,EAAU;;AAczB,SAAS,EAAc,GAAK,GAAK,GAAW,GAAe;CACzD,IAAI,IAAmB,UAAU,SAAS,KAAK,UAAU,OAAO,KAAA,IAAY,UAAU,KAAK;AAG3F,KAAI,CAAC,OAAO,UAAU,IAAM,MAAQ,IAAY,GAAG,CACjD,QAAO;EACL,MAAM,IAAIA,EAAAA,QAAQ,EAAE;EACpB,SAAS,IAAIA,EAAAA,QAAQ,EAAE;EACvB,SAAS,IAAIA,EAAAA,QAAQ,EAAE;EACxB;CAIH,IAAI,IAAO,EAAc,IAAIA,EAAAA,QAAQ,EAAI,CAAC,IAAI,EAAI,CAAC,IAAI,IAAY,EAAE,EAAE,GAAe,EAAiB,EAEnG;AAEJ,CAAI,KAAO,KAAK,KAAO,IACrB,IAAS,IAAIA,EAAAA,QAAQ,EAAE,IAGvB,IAAS,IAAIA,EAAAA,QAAQ,EAAI,CAAC,IAAI,EAAI,CAAC,IAAI,EAAE,EAEzC,IAAS,EAAO,IAAI,IAAIA,EAAAA,QAAQ,EAAO,CAAC,IAAI,EAAK,CAAC;CAGpD,IAAI,IAAa,KAAK,KAAK,EAAO,IAAI,EAAI,CAAC,IAAI,EAAK,CAAC,UAAU,CAAC,EAC5D,IAAU,KAAK,KAAK,IAAIA,EAAAA,QAAQ,EAAI,CAAC,IAAI,EAAO,CAAC,IAAI,EAAK,CAAC,UAAU,CAAC,EACtE,IAAa,IAAa,IAAU;AAaxC,QAXI,IAAa,IAER,EAAc,GAAK,GAAK,GAAW,GAAe,IAAmB,EAAE,IAG5E,IAAa,MAEf,IAAU,IAAM,IAAI,KAAW,IAAY,KAAc,GACzD,IAAa,IAAM,IAAI,IAAa,KAAc,IAAY,KAGzD;EACC;EACN,SAAS,EAAO,IAAI,IAAIA,EAAAA,QAAQ,EAAW,CAAC,IAAI,EAAK,CAAC;EACtD,SAAS,EAAO,IAAI,IAAIA,EAAAA,QAAQ,EAAQ,CAAC,IAAI,EAAK,CAAC;EACpD;;AAYH,SAAS,EAAoB,GAAO;CAClC,IAAI,IAAQ,EAAe,GAAO,EAAE,EAChC,IAAM,EAAM,IACZ,IAAM,EAAM,IAEZ,IAAY,UAAU,SAAS,KAAK,UAAU,OAAO,KAAA,IAAY,UAAU,KAAK,GAChF,IAAgB,UAAU,SAAS,KAAK,UAAU,OAAO,KAAA,IAAY,UAAU,KAAK,IAEpF,IAAQ,KAAK,IAAI,GAAW,EAAE,EAG9B,IAAqB,EADD,EAAiB,CAAC,GAAK,EAAI,CAAC,EACO,EAAE,EACzD,IAAS,EAAmB,IAC5B,IAAS,EAAmB;AAEhC,KAAI,MAAW,aAAa,MAAW,UAAU;EAC/C,IAAI,IAAU,MAAW,WAAW,CAAC,EAAO,CAAC,OAAO,EAAmB,EAAM,GAAG,IAAY,EAAE,CAAC,IAAI,WAAY;AAC7G,UAAO;IACP,CAAC,CAAC,GAAG,EAAE,CAAC,OAAO,EAAmB,EAAM,GAAG,IAAY,EAAE,CAAC,IAAI,WAAY;AAC1E,UAAO;IACP,CAAC,EAAE,CAAC,EAAO,CAAC;AAEd,SAAO,IAAM,IAAM,EAAQ,EAAQ,GAAG;;AAGxC,KAAI,MAAW,EACb,QAAO,EAAqB,GAAQ,GAAW,EAAc;CAI/D,IAAI,IAAiB,EAAc,GAAQ,GAAQ,GAAO,EAAc,EACpE,IAAO,EAAe,MACtB,IAAU,EAAe,SACzB,IAAU,EAAe,SAEzB,IAASC,EAAW,UAAU,GAAS,EAAQ,IAAI,IAAID,EAAAA,QAAQ,GAAI,CAAC,IAAI,EAAK,CAAC,EAAE,EAAK;AACzF,QAAO,IAAM,IAAM,EAAQ,EAAO,GAAG;;AAYvC,SAAS,EAAgB,GAAO;CAC9B,IAAI,IAAQ,EAAe,GAAO,EAAE,EAChC,IAAM,EAAM,IACZ,IAAM,EAAM,IAEZ,IAAY,UAAU,SAAS,KAAK,UAAU,OAAO,KAAA,IAAY,UAAU,KAAK,GAChF,IAAgB,UAAU,SAAS,KAAK,UAAU,OAAO,KAAA,IAAY,UAAU,KAAK,IAEpF,IAAQ,KAAK,IAAI,GAAW,EAAE,EAG9B,IAAqB,EADA,EAAiB,CAAC,GAAK,EAAI,CAAC,EACO,EAAE,EAC1D,IAAS,EAAmB,IAC5B,IAAS,EAAmB;AAEhC,KAAI,MAAW,aAAa,MAAW,SACrC,QAAO,CAAC,GAAK,EAAI;AAGnB,KAAI,MAAW,EACb,QAAO,EAAqB,GAAQ,GAAW,EAAc;CAG/D,IAAI,IAAO,EAAc,IAAIA,EAAAA,QAAQ,EAAO,CAAC,IAAI,EAAO,CAAC,IAAI,IAAQ,EAAE,EAAE,GAAe,EAAE,EAItF,IAHK,EAAQ,EAAI,SAAU,GAAG;AAChC,SAAO,IAAIA,EAAAA,QAAQ,EAAO,CAAC,IAAI,IAAIA,EAAAA,QAAQ,EAAE,CAAC,IAAI,EAAK,CAAC,CAAC,UAAU;GACnE,EAAE,EAAM,CACM,GAAG,EAAM,CAAC,OAAO,SAAU,GAAO;AAChD,SAAO,KAAS,KAAU,KAAS;GACnC;AACF,QAAO,IAAM,IAAM,EAAQ,EAAO,GAAG;;AAavC,SAAS,EAA2B,GAAO,GAAW;CACpD,IAAI,IAAQ,EAAe,GAAO,EAAE,EAChC,IAAM,EAAM,IACZ,IAAM,EAAM,IAEZ,IAAgB,UAAU,SAAS,KAAK,UAAU,OAAO,KAAA,IAAY,UAAU,KAAK,IAIpF,IAAqB,EADA,EAAiB,CAAC,GAAK,EAAI,CAAC,EACO,EAAE,EAC1D,IAAS,EAAmB,IAC5B,IAAS,EAAmB;AAEhC,KAAI,MAAW,aAAa,MAAW,SACrC,QAAO,CAAC,GAAK,EAAI;AAGnB,KAAI,MAAW,EACb,QAAO,CAAC,EAAO;CAGjB,IAAI,IAAQ,KAAK,IAAI,GAAW,EAAE,EAC9B,IAAO,EAAc,IAAIA,EAAAA,QAAQ,EAAO,CAAC,IAAI,EAAO,CAAC,IAAI,IAAQ,EAAE,EAAE,GAAe,EAAE,EACtF,IAAS,EAAE,CAAC,OAAO,EAAmBC,EAAW,UAAU,IAAID,EAAAA,QAAQ,EAAO,EAAE,IAAIA,EAAAA,QAAQ,EAAO,CAAC,IAAI,IAAIA,EAAAA,QAAQ,IAAK,CAAC,IAAI,EAAK,CAAC,EAAE,EAAK,CAAC,EAAE,CAAC,EAAO,CAAC;AAC3J,QAAO,IAAM,IAAM,EAAQ,EAAO,GAAG;;AAGvC,IAAW,IAAoB,EAAQ,EAAoB;AAChC,EAAQ,EAAgB;AACnD,IAAW,IAA2B,EAAQ,EAA2B"}

package/dist/node_modules/recharts-scale/es6/index.js

@@ -0,0 +1 @@
+import "./getNiceTickValues.js";

package/dist/node_modules/recharts-scale/es6/util/arithmetic.js

@@ -0,0 +1,32 @@
+import { __toESM as e } from "../../../../_virtual/_rolldown/runtime.js";
+import { require_decimal as t } from "../../../decimal.js-light/decimal.js";
+import { curry as n } from "./utils.js";
+//#region node_modules/recharts-scale/es6/util/arithmetic.js
+var r = /* @__PURE__ */ e(t());
+function i(e) {
+	return e === 0 ? 1 : Math.floor(new r.default(e).abs().log(10).toNumber()) + 1;
+}
+function a(e, t, n) {
+	for (var i = new r.default(e), a = 0, o = []; i.lt(t) && a < 1e5;) o.push(i.toNumber()), i = i.add(n), a++;
+	return o;
+}
+var o = {
+	rangeStep: a,
+	getDigitCount: i,
+	interpolateNumber: n(function(e, t, n) {
+		var r = +e;
+		return r + n * (+t - r);
+	}),
+	uninterpolateNumber: n(function(e, t, n) {
+		var r = t - +e;
+		return r ||= Infinity, (n - e) / r;
+	}),
+	uninterpolateTruncation: n(function(e, t, n) {
+		var r = t - +e;
+		return r ||= Infinity, Math.max(0, Math.min(1, (n - e) / r));
+	})
+};
+//#endregion
+export { o as default };
+
+//# sourceMappingURL=arithmetic.js.map

package/dist/node_modules/recharts-scale/es6/util/arithmetic.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arithmetic.js","names":["Decimal"],"sources":["../../../../../node_modules/recharts-scale/es6/util/arithmetic.js"],"sourcesContent":["/**\n * @fileOverview 一些公用的运算方法\n * @author xile611\n * @date 2015-09-17\n */\nimport Decimal from 'decimal.js-light';\nimport { curry } from './utils';\n/**\n * 获取数值的位数\n * 其中绝对值属于区间[0.1, 1)， 得到的值为0\n * 绝对值属于区间[0.01, 0.1)，得到的位数为 -1\n * 绝对值属于区间[0.001, 0.01)，得到的位数为 -2\n *\n * @param  {Number} value 数值\n * @return {Integer} 位数\n */\n\nfunction getDigitCount(value) {\n  var result;\n\n  if (value === 0) {\n    result = 1;\n  } else {\n    result = Math.floor(new Decimal(value).abs().log(10).toNumber()) + 1;\n  }\n\n  return result;\n}\n/**\n * 按照固定的步长获取[start, end)这个区间的数据\n * 并且需要处理js计算精度的问题\n *\n * @param  {Decimal} start 起点\n * @param  {Decimal} end   终点，不包含该值\n * @param  {Decimal} step  步长\n * @return {Array}         若干数值\n */\n\n\nfunction rangeStep(start, end, step) {\n  var num = new Decimal(start);\n  var i = 0;\n  var result = []; // magic number to prevent infinite loop\n\n  while (num.lt(end) && i < 100000) {\n    result.push(num.toNumber());\n    num = num.add(step);\n    i++;\n  }\n\n  return result;\n}\n/**\n * 对数值进行线性插值\n *\n * @param  {Number} a  定义域的极点\n * @param  {Number} b  定义域的极点\n * @param  {Number} t  [0, 1]内的某个值\n * @return {Number}    定义域内的某个值\n */\n\n\nvar interpolateNumber = curry(function (a, b, t) {\n  var newA = +a;\n  var newB = +b;\n  return newA + t * (newB - newA);\n});\n/**\n * 线性插值的逆运算\n *\n * @param  {Number} a 定义域的极点\n * @param  {Number} b 定义域的极点\n * @param  {Number} x 可以认为是插值后的一个输出值\n * @return {Number}   当x在 a ~ b这个范围内时，返回值属于[0, 1]\n */\n\nvar uninterpolateNumber = curry(function (a, b, x) {\n  var diff = b - +a;\n  diff = diff || Infinity;\n  return (x - a) / diff;\n});\n/**\n * 线性插值的逆运算，并且有截断的操作\n *\n * @param  {Number} a 定义域的极点\n * @param  {Number} b 定义域的极点\n * @param  {Number} x 可以认为是插值后的一个输出值\n * @return {Number}   当x在 a ~ b这个区间内时，返回值属于[0, 1]，\n * 当x不在 a ~ b这个区间时，会截断到 a ~ b 这个区间\n */\n\nvar uninterpolateTruncation = curry(function (a, b, x) {\n  var diff = b - +a;\n  diff = diff || Infinity;\n  return Math.max(0, Math.min(1, (x - a) / diff));\n});\nexport default {\n  rangeStep: rangeStep,\n  getDigitCount: getDigitCount,\n  interpolateNumber: interpolateNumber,\n  uninterpolateNumber: uninterpolateNumber,\n  uninterpolateTruncation: uninterpolateTruncation\n};"],"x_google_ignoreList":[0],"mappings":";;;;;AAiBA,SAAS,EAAc,GAAO;AAS5B,QANI,MAAU,IACH,IAEA,KAAK,MAAM,IAAIA,EAAAA,QAAQ,EAAM,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG;;AAgBvE,SAAS,EAAU,GAAO,GAAK,GAAM;AAKnC,MAJA,IAAI,IAAM,IAAIA,EAAAA,QAAQ,EAAM,EACxB,IAAI,GACJ,IAAS,EAAE,EAER,EAAI,GAAG,EAAI,IAAI,IAAI,KAGxB,CAFA,EAAO,KAAK,EAAI,UAAU,CAAC,EAC3B,IAAM,EAAI,IAAI,EAAK,EACnB;AAGF,QAAO;;AA8CT,IAAA,IAAe;CACF;CACI;CACI,mBArCG,EAAM,SAAU,GAAG,GAAG,GAAG;EAC/C,IAAI,IAAO,CAAC;AAEZ,SAAO,IAAO,KADH,CAAC,IACc;GAC1B;CAkCqB,qBAxBG,EAAM,SAAU,GAAG,GAAG,GAAG;EACjD,IAAI,IAAO,IAAI,CAAC;AAEhB,SADA,MAAe,WACP,IAAI,KAAK;GACjB;CAqByB,yBAVG,EAAM,SAAU,GAAG,GAAG,GAAG;EACrD,IAAI,IAAO,IAAI,CAAC;AAEhB,SADA,MAAe,UACR,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,IAAI,KAAK,EAAK,CAAC;GAC/C;CAOD"}

package/dist/node_modules/recharts-scale/es6/util/utils.js

@@ -0,0 +1,79 @@
+//#region node_modules/recharts-scale/es6/util/utils.js
+function e(e) {
+	return i(e) || r(e) || n(e) || t();
+}
+function t() {
+	throw TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+function n(e, t) {
+	if (e) {
+		if (typeof e == "string") return a(e, t);
+		var n = Object.prototype.toString.call(e).slice(8, -1);
+		if (n === "Object" && e.constructor && (n = e.constructor.name), n === "Map" || n === "Set") return Array.from(e);
+		if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return a(e, t);
+	}
+}
+function r(e) {
+	if (typeof Symbol < "u" && Symbol.iterator in Object(e)) return Array.from(e);
+}
+function i(e) {
+	if (Array.isArray(e)) return a(e);
+}
+function a(e, t) {
+	(t == null || t > e.length) && (t = e.length);
+	for (var n = 0, r = Array(t); n < t; n++) r[n] = e[n];
+	return r;
+}
+var o = function(e) {
+	return e;
+}, s = { "@@functional/placeholder": !0 }, c = function(e) {
+	return e === s;
+}, l = function(e) {
+	return function t() {
+		return arguments.length === 0 || arguments.length === 1 && c(arguments.length <= 0 ? void 0 : arguments[0]) ? t : e.apply(void 0, arguments);
+	};
+}, u = function t(n, r) {
+	return n === 1 ? r : l(function() {
+		var i = [...arguments], a = i.filter(function(e) {
+			return e !== s;
+		}).length;
+		return a >= n ? r.apply(void 0, i) : t(n - a, l(function() {
+			var t = [...arguments], n = i.map(function(e) {
+				return c(e) ? t.shift() : e;
+			});
+			return r.apply(void 0, e(n).concat(t));
+		}));
+	});
+}, d = function(e) {
+	return u(e.length, e);
+}, f = function(e, t) {
+	for (var n = [], r = e; r < t; ++r) n[r - e] = r;
+	return n;
+}, p = d(function(e, t) {
+	return Array.isArray(t) ? t.map(e) : Object.keys(t).map(function(e) {
+		return t[e];
+	}).map(e);
+}), m = function() {
+	var e = [...arguments];
+	if (!e.length) return o;
+	var t = e.reverse(), n = t[0], r = t.slice(1);
+	return function() {
+		return r.reduce(function(e, t) {
+			return t(e);
+		}, n.apply(void 0, arguments));
+	};
+}, h = function(e) {
+	return Array.isArray(e) ? e.reverse() : e.split("").reverse.join("");
+}, g = function(e) {
+	var t = null, n = null;
+	return function() {
+		var r = [...arguments];
+		return t && r.every(function(e, n) {
+			return e === t[n];
+		}) ? n : (t = r, n = e.apply(void 0, r), n);
+	};
+};
+//#endregion
+export { m as compose, d as curry, p as map, g as memoize, f as range, h as reverse };
+
+//# sourceMappingURL=utils.js.map

package/dist/node_modules/recharts-scale/es6/util/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","names":[],"sources":["../../../../../node_modules/recharts-scale/es6/util/utils.js"],"sourcesContent":["function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\n\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\n\nfunction _iterableToArray(iter) { if (typeof Symbol !== \"undefined\" && Symbol.iterator in Object(iter)) return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }\n\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\n\nvar identity = function identity(i) {\n  return i;\n};\n\nexport var PLACE_HOLDER = {\n  '@@functional/placeholder': true\n};\n\nvar isPlaceHolder = function isPlaceHolder(val) {\n  return val === PLACE_HOLDER;\n};\n\nvar curry0 = function curry0(fn) {\n  return function _curried() {\n    if (arguments.length === 0 || arguments.length === 1 && isPlaceHolder(arguments.length <= 0 ? undefined : arguments[0])) {\n      return _curried;\n    }\n\n    return fn.apply(void 0, arguments);\n  };\n};\n\nvar curryN = function curryN(n, fn) {\n  if (n === 1) {\n    return fn;\n  }\n\n  return curry0(function () {\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    var argsLength = args.filter(function (arg) {\n      return arg !== PLACE_HOLDER;\n    }).length;\n\n    if (argsLength >= n) {\n      return fn.apply(void 0, args);\n    }\n\n    return curryN(n - argsLength, curry0(function () {\n      for (var _len2 = arguments.length, restArgs = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n        restArgs[_key2] = arguments[_key2];\n      }\n\n      var newArgs = args.map(function (arg) {\n        return isPlaceHolder(arg) ? restArgs.shift() : arg;\n      });\n      return fn.apply(void 0, _toConsumableArray(newArgs).concat(restArgs));\n    }));\n  });\n};\n\nexport var curry = function curry(fn) {\n  return curryN(fn.length, fn);\n};\nexport var range = function range(begin, end) {\n  var arr = [];\n\n  for (var i = begin; i < end; ++i) {\n    arr[i - begin] = i;\n  }\n\n  return arr;\n};\nexport var map = curry(function (fn, arr) {\n  if (Array.isArray(arr)) {\n    return arr.map(fn);\n  }\n\n  return Object.keys(arr).map(function (key) {\n    return arr[key];\n  }).map(fn);\n});\nexport var compose = function compose() {\n  for (var _len3 = arguments.length, args = new Array(_len3), _key3 = 0; _key3 < _len3; _key3++) {\n    args[_key3] = arguments[_key3];\n  }\n\n  if (!args.length) {\n    return identity;\n  }\n\n  var fns = args.reverse(); // first function can receive multiply arguments\n\n  var firstFn = fns[0];\n  var tailsFn = fns.slice(1);\n  return function () {\n    return tailsFn.reduce(function (res, fn) {\n      return fn(res);\n    }, firstFn.apply(void 0, arguments));\n  };\n};\nexport var reverse = function reverse(arr) {\n  if (Array.isArray(arr)) {\n    return arr.reverse();\n  } // can be string\n\n\n  return arr.split('').reverse.join('');\n};\nexport var memoize = function memoize(fn) {\n  var lastArgs = null;\n  var lastResult = null;\n  return function () {\n    for (var _len4 = arguments.length, args = new Array(_len4), _key4 = 0; _key4 < _len4; _key4++) {\n      args[_key4] = arguments[_key4];\n    }\n\n    if (lastArgs && args.every(function (val, i) {\n      return val === lastArgs[i];\n    })) {\n      return lastResult;\n    }\n\n    lastArgs = args;\n    lastResult = fn.apply(void 0, args);\n    return lastResult;\n  };\n};"],"x_google_ignoreList":[0],"mappings":";AAAA,SAAS,EAAmB,GAAK;AAAE,QAAO,EAAmB,EAAI,IAAI,EAAiB,EAAI,IAAI,EAA4B,EAAI,IAAI,GAAoB;;AAEtJ,SAAS,IAAqB;AAAE,OAAU,UAAU,uIAAuI;;AAE3L,SAAS,EAA4B,GAAG,GAAQ;AAAO,QAAW;MAAI,OAAO,KAAM,SAAU,QAAO,EAAkB,GAAG,EAAO;EAAE,IAAI,IAAI,OAAO,UAAU,SAAS,KAAK,EAAE,CAAC,MAAM,GAAG,GAAG;AAA+D,MAAzD,MAAM,YAAY,EAAE,gBAAa,IAAI,EAAE,YAAY,OAAU,MAAM,SAAS,MAAM,MAAO,QAAO,MAAM,KAAK,EAAE;AAAE,MAAI,MAAM,eAAe,2CAA2C,KAAK,EAAE,CAAE,QAAO,EAAkB,GAAG,EAAO;;;AAE7Z,SAAS,EAAiB,GAAM;AAAE,KAAI,OAAO,SAAW,OAAe,OAAO,YAAY,OAAO,EAAK,CAAE,QAAO,MAAM,KAAK,EAAK;;AAE/H,SAAS,EAAmB,GAAK;AAAE,KAAI,MAAM,QAAQ,EAAI,CAAE,QAAO,EAAkB,EAAI;;AAExF,SAAS,EAAkB,GAAK,GAAK;AAAE,EAAI,KAAO,QAAQ,IAAM,EAAI,YAAQ,IAAM,EAAI;AAAQ,MAAK,IAAI,IAAI,GAAG,IAAW,MAAM,EAAI,EAAE,IAAI,GAAK,IAAO,GAAK,KAAK,EAAI;AAAM,QAAO;;AAEhL,IAAI,IAAW,SAAkB,GAAG;AAClC,QAAO;GAGE,IAAe,EACxB,4BAA4B,IAC7B,EAEG,IAAgB,SAAuB,GAAK;AAC9C,QAAO,MAAQ;GAGb,IAAS,SAAgB,GAAI;AAC/B,QAAO,SAAS,IAAW;AAKzB,SAJI,UAAU,WAAW,KAAK,UAAU,WAAW,KAAK,EAAc,UAAU,UAAU,IAAI,KAAA,IAAY,UAAU,GAAG,GAC9G,IAGF,EAAG,MAAM,KAAK,GAAG,UAAU;;GAIlC,IAAS,SAAS,EAAO,GAAG,GAAI;AAKlC,QAJI,MAAM,IACD,IAGF,EAAO,WAAY;EACnB,IAA6B,QACnB,YAGX,IAAa,EAAK,OAAO,SAAU,GAAK;AAC1C,UAAO,MAAQ;IACf,CAAC;AAMH,SAJI,KAAc,IACT,EAAG,MAAM,KAAK,GAAG,EAAK,GAGxB,EAAO,IAAI,GAAY,EAAO,WAAY;GAC1C,IAA8B,QACf,YAGhB,IAAU,EAAK,IAAI,SAAU,GAAK;AACpC,WAAO,EAAc,EAAI,GAAG,EAAS,OAAO,GAAG;KAC/C;AACF,UAAO,EAAG,MAAM,KAAK,GAAG,EAAmB,EAAQ,CAAC,OAAO,EAAS,CAAC;IACrE,CAAC;GACH;GAGO,IAAQ,SAAe,GAAI;AACpC,QAAO,EAAO,EAAG,QAAQ,EAAG;GAEnB,IAAQ,SAAe,GAAO,GAAK;AAG5C,MAAK,IAFD,IAAM,EAAE,EAEH,IAAI,GAAO,IAAI,GAAK,EAAE,EAC7B,GAAI,IAAI,KAAS;AAGnB,QAAO;GAEE,IAAM,EAAM,SAAU,GAAI,GAAK;AAKxC,QAJI,MAAM,QAAQ,EAAI,GACb,EAAI,IAAI,EAAG,GAGb,OAAO,KAAK,EAAI,CAAC,IAAI,SAAU,GAAK;AACzC,SAAO,EAAI;GACX,CAAC,IAAI,EAAG;EACV,EACS,IAAU,WAAmB;CACjC,IAA8B,QACnB;AAGhB,KAAI,CAAC,EAAK,OACR,QAAO;CAGT,IAAI,IAAM,EAAK,SAAS,EAEpB,IAAU,EAAI,IACd,IAAU,EAAI,MAAM,EAAE;AAC1B,QAAO,WAAY;AACjB,SAAO,EAAQ,OAAO,SAAU,GAAK,GAAI;AACvC,UAAO,EAAG,EAAI;KACb,EAAQ,MAAM,KAAK,GAAG,UAAU,CAAC;;GAG7B,IAAU,SAAiB,GAAK;AAMzC,QALI,MAAM,QAAQ,EAAI,GACb,EAAI,SAAS,GAIf,EAAI,MAAM,GAAG,CAAC,QAAQ,KAAK,GAAG;GAE5B,IAAU,SAAiB,GAAI;CACxC,IAAI,IAAW,MACX,IAAa;AACjB,QAAO,WAAY;EACZ,IAA8B,QACnB;AAWhB,SARI,KAAY,EAAK,MAAM,SAAU,GAAK,GAAG;AAC3C,UAAO,MAAQ,EAAS;IACxB,GACO,KAGT,IAAW,GACX,IAAa,EAAG,MAAM,KAAK,GAAG,EAAK,EAC5B"}

package/dist/node_modules/tiny-invariant/dist/esm/tiny-invariant.js

@@ -0,0 +1,13 @@
+//#region node_modules/tiny-invariant/dist/esm/tiny-invariant.js
+var e = process.env.NODE_ENV === "production", t = "Invariant failed";
+function n(n, r) {
+	if (!n) {
+		if (e) throw Error(t);
+		var i = typeof r == "function" ? r() : r, a = i ? `${t}: ${i}` : t;
+		throw Error(a);
+	}
+}
+//#endregion
+export { n as invariant };
+
+//# sourceMappingURL=tiny-invariant.js.map

package/dist/node_modules/tiny-invariant/dist/esm/tiny-invariant.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tiny-invariant.js","names":[],"sources":["../../../../../node_modules/tiny-invariant/dist/esm/tiny-invariant.js"],"sourcesContent":["var isProduction = process.env.NODE_ENV === 'production';\nvar prefix = 'Invariant failed';\nfunction invariant(condition, message) {\n    if (condition) {\n        return;\n    }\n    if (isProduction) {\n        throw new Error(prefix);\n    }\n    var provided = typeof message === 'function' ? message() : message;\n    var value = provided ? \"\".concat(prefix, \": \").concat(provided) : prefix;\n    throw new Error(value);\n}\n\nexport { invariant as default };\n"],"x_google_ignoreList":[0],"mappings":";AAAA,IAAI,IAAA,QAAA,IAAA,aAAwC,cACxC,IAAS;AACb,SAAS,EAAU,GAAW,GAAS;AAC/B,SAGJ;MAAI,EACA,OAAU,MAAM,EAAO;EAE3B,IAAI,IAAW,OAAO,KAAY,aAAa,GAAS,GAAG,GACvD,IAAQ,IAAW,GAAU,MAAqB,MAAY;AAClE,QAAU,MAAM,EAAM"}

package/dist/node_modules/victory-vendor/es/d3-scale.js

@@ -0,0 +1,53 @@
+import { __exportAll as e } from "../../../_virtual/_rolldown/runtime.js";
+import t, { implicit as n } from "../../d3-scale/src/ordinal.js";
+import r, { point as i } from "../../d3-scale/src/band.js";
+import a from "../../d3-scale/src/tickFormat.js";
+import o from "../../d3-scale/src/linear.js";
+import s from "../../d3-scale/src/identity.js";
+import c from "../../d3-scale/src/log.js";
+import l from "../../d3-scale/src/symlog.js";
+import u, { sqrt as d } from "../../d3-scale/src/pow.js";
+import f from "../../d3-scale/src/radial.js";
+import p from "../../d3-scale/src/quantile.js";
+import m from "../../d3-scale/src/quantize.js";
+import h from "../../d3-scale/src/threshold.js";
+import g from "../../d3-scale/src/time.js";
+import _ from "../../d3-scale/src/utcTime.js";
+import v, { sequentialLog as y, sequentialPow as b, sequentialSqrt as x, sequentialSymlog as S } from "../../d3-scale/src/sequential.js";
+import C from "../../d3-scale/src/sequentialQuantile.js";
+import w, { divergingLog as T, divergingPow as E, divergingSqrt as D, divergingSymlog as O } from "../../d3-scale/src/diverging.js";
+//#region node_modules/victory-vendor/es/d3-scale.js
+var k = /* @__PURE__ */ e({
+	scaleBand: () => r,
+	scaleDiverging: () => w,
+	scaleDivergingLog: () => T,
+	scaleDivergingPow: () => E,
+	scaleDivergingSqrt: () => D,
+	scaleDivergingSymlog: () => O,
+	scaleIdentity: () => s,
+	scaleImplicit: () => n,
+	scaleLinear: () => o,
+	scaleLog: () => c,
+	scaleOrdinal: () => t,
+	scalePoint: () => i,
+	scalePow: () => u,
+	scaleQuantile: () => p,
+	scaleQuantize: () => m,
+	scaleRadial: () => f,
+	scaleSequential: () => v,
+	scaleSequentialLog: () => y,
+	scaleSequentialPow: () => b,
+	scaleSequentialQuantile: () => C,
+	scaleSequentialSqrt: () => x,
+	scaleSequentialSymlog: () => S,
+	scaleSqrt: () => d,
+	scaleSymlog: () => l,
+	scaleThreshold: () => h,
+	scaleTime: () => g,
+	scaleUtc: () => _,
+	tickFormat: () => a
+});
+//#endregion
+export { k as d3_scale_exports };
+
+//# sourceMappingURL=d3-scale.js.map

package/dist/node_modules/victory-vendor/es/d3-scale.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"d3-scale.js","names":[],"sources":["../../../../node_modules/victory-vendor/es/d3-scale.js"],"sourcesContent":["\n// `victory-vendor/d3-scale` (ESM)\n// See upstream license: https://github.com/d3/d3-scale/blob/main/LICENSE\n//\n// Our ESM package uses the underlying installed dependencies of `node_modules/d3-scale`\nexport * from \"d3-scale\";\n"],"x_google_ignoreList":[0],"mappings":""}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@burdenoff/microfe-eventfullymanaged",
-  "version": "2026.704.6",
+  "version": "2026.704.8",
   "description": "EventfullyManaged - End-to-end event management platform",
   "type": "module",
   "files": [