umt 2.5.0 → 2.7.0

package/module/es5/Error/retry.d.ts

@@ -0,0 +1,37 @@
+export interface RetryOptions {
+    retries?: number;
+    delay?: number;
+    shouldRetry?: (error: unknown) => boolean;
+}
+/**
+ * Retries a given async function with configurable retry logic
+ *
+ * @template T - The return type of the function
+ * @param function_ - The async function to retry
+ * @param options - Configuration options for retry behavior
+ * @param options.retries - Maximum number of retry attempts (default: 3)
+ * @param options.delay - Delay between retries in milliseconds (default: 1000)
+ * @param options.shouldRetry - Function to determine if an error should trigger a retry (default: always retry)
+ * @returns Promise that resolves with the function result or rejects with the final error
+ *
+ * @example
+ * ```typescript
+ * // Basic usage with default options
+ * const result = await retry(async () => {
+ *   const response = await fetch('/api/data');
+ *   if (!response.ok) throw new Error('Failed to fetch');
+ *   return response.json();
+ * });
+ *
+ * // Custom retry configuration
+ * const result = await retry(
+ *   () => riskyOperation(),
+ *   {
+ *     retries: 5,
+ *     delay: 2000,
+ *     shouldRetry: (error) => error instanceof NetworkError
+ *   }
+ * );
+ * ```
+ */
+export declare const retry: <T>(function_: () => Promise<T>, options?: RetryOptions) => Promise<T>;

package/module/es5/Error/retry.js

@@ -0,0 +1,88 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.retry = void 0;
+function _regenerator() { /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/babel/babel/blob/main/packages/babel-helpers/LICENSE */ var e, t, r = "function" == typeof Symbol ? Symbol : {}, n = r.iterator || "@@iterator", o = r.toStringTag || "@@toStringTag"; function i(r, n, o, i) { var c = n && n.prototype instanceof Generator ? n : Generator, u = Object.create(c.prototype); return _regeneratorDefine2(u, "_invoke", function (r, n, o) { var i, c, u, f = 0, p = o || [], y = !1, G = { p: 0, n: 0, v: e, a: d, f: d.bind(e, 4), d: function d(t, r) { return i = t, c = 0, u = e, G.n = r, a; } }; function d(r, n) { for (c = r, u = n, t = 0; !y && f && !o && t < p.length; t++) { var o, i = p[t], d = G.p, l = i[2]; r > 3 ? (o = l === n) && (u = i[(c = i[4]) ? 5 : (c = 3, 3)], i[4] = i[5] = e) : i[0] <= d && ((o = r < 2 && d < i[1]) ? (c = 0, G.v = n, G.n = i[1]) : d < l && (o = r < 3 || i[0] > n || n > l) && (i[4] = r, i[5] = n, G.n = l, c = 0)); } if (o || r > 1) return a; throw y = !0, n; } return function (o, p, l) { if (f > 1) throw TypeError("Generator is already running"); for (y && 1 === p && d(p, l), c = p, u = l; (t = c < 2 ? e : u) || !y;) { i || (c ? c < 3 ? (c > 1 && (G.n = -1), d(c, u)) : G.n = u : G.v = u); try { if (f = 2, i) { if (c || (o = "next"), t = i[o]) { if (!(t = t.call(i, u))) throw TypeError("iterator result is not an object"); if (!t.done) return t; u = t.value, c < 2 && (c = 0); } else 1 === c && (t = i["return"]) && t.call(i), c < 2 && (u = TypeError("The iterator does not provide a '" + o + "' method"), c = 1); i = e; } else if ((t = (y = G.n < 0) ? u : r.call(n, G)) !== a) break; } catch (t) { i = e, c = 1, u = t; } finally { f = 1; } } return { value: t, done: y }; }; }(r, o, i), !0), u; } var a = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} t = Object.getPrototypeOf; var c = [][n] ? t(t([][n]())) : (_regeneratorDefine2(t = {}, n, function () { return this; }), t), u = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(c); function f(e) { return Object.setPrototypeOf ? Object.setPrototypeOf(e, GeneratorFunctionPrototype) : (e.__proto__ = GeneratorFunctionPrototype, _regeneratorDefine2(e, o, "GeneratorFunction")), e.prototype = Object.create(u), e; } return GeneratorFunction.prototype = GeneratorFunctionPrototype, _regeneratorDefine2(u, "constructor", GeneratorFunctionPrototype), _regeneratorDefine2(GeneratorFunctionPrototype, "constructor", GeneratorFunction), GeneratorFunction.displayName = "GeneratorFunction", _regeneratorDefine2(GeneratorFunctionPrototype, o, "GeneratorFunction"), _regeneratorDefine2(u), _regeneratorDefine2(u, o, "Generator"), _regeneratorDefine2(u, n, function () { return this; }), _regeneratorDefine2(u, "toString", function () { return "[object Generator]"; }), (_regenerator = function _regenerator() { return { w: i, m: f }; })(); }
+function _regeneratorDefine2(e, r, n, t) { var i = Object.defineProperty; try { i({}, "", {}); } catch (e) { i = 0; } _regeneratorDefine2 = function _regeneratorDefine(e, r, n, t) { if (r) i ? i(e, r, { value: n, enumerable: !t, configurable: !t, writable: !t }) : e[r] = n;else { var o = function o(r, n) { _regeneratorDefine2(e, r, function (e) { return this._invoke(r, n, e); }); }; o("next", 0), o("throw", 1), o("return", 2); } }, _regeneratorDefine2(e, r, n, t); }
+function asyncGeneratorStep(n, t, e, r, o, a, c) { try { var i = n[a](c), u = i.value; } catch (n) { return void e(n); } i.done ? t(u) : Promise.resolve(u).then(r, o); }
+function _asyncToGenerator(n) { return function () { var t = this, e = arguments; return new Promise(function (r, o) { var a = n.apply(t, e); function _next(n) { asyncGeneratorStep(a, r, o, _next, _throw, "next", n); } function _throw(n) { asyncGeneratorStep(a, r, o, _next, _throw, "throw", n); } _next(void 0); }); }; }
+/**
+ * Retries a given async function with configurable retry logic
+ *
+ * @template T - The return type of the function
+ * @param function_ - The async function to retry
+ * @param options - Configuration options for retry behavior
+ * @param options.retries - Maximum number of retry attempts (default: 3)
+ * @param options.delay - Delay between retries in milliseconds (default: 1000)
+ * @param options.shouldRetry - Function to determine if an error should trigger a retry (default: always retry)
+ * @returns Promise that resolves with the function result or rejects with the final error
+ *
+ * @example
+ * ```typescript
+ * // Basic usage with default options
+ * const result = await retry(async () => {
+ *   const response = await fetch('/api/data');
+ *   if (!response.ok) throw new Error('Failed to fetch');
+ *   return response.json();
+ * });
+ *
+ * // Custom retry configuration
+ * const result = await retry(
+ *   () => riskyOperation(),
+ *   {
+ *     retries: 5,
+ *     delay: 2000,
+ *     shouldRetry: (error) => error instanceof NetworkError
+ *   }
+ * );
+ * ```
+ */
+var retry = exports.retry = function retry(function_) {
+  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+  var _options$retries = options.retries,
+    retries = _options$retries === void 0 ? 3 : _options$retries,
+    _options$delay = options.delay,
+    delay = _options$delay === void 0 ? 1000 : _options$delay,
+    _options$shouldRetry = options.shouldRetry,
+    shouldRetry = _options$shouldRetry === void 0 ? function () {
+      return true;
+    } : _options$shouldRetry;
+  var _attempt = /*#__PURE__*/function () {
+    var _ref = _asyncToGenerator(/*#__PURE__*/_regenerator().m(function _callee(remainingAttempts) {
+      var _t;
+      return _regenerator().w(function (_context) {
+        while (1) switch (_context.n) {
+          case 0:
+            _context.p = 0;
+            _context.n = 1;
+            return function_();
+          case 1:
+            return _context.a(2, _context.v);
+          case 2:
+            _context.p = 2;
+            _t = _context.v;
+            if (!(remainingAttempts <= 0 || !shouldRetry(_t))) {
+              _context.n = 3;
+              break;
+            }
+            throw _t;
+          case 3:
+            _context.n = 4;
+            return new Promise(function (resolve) {
+              return setTimeout(function () {
+                return resolve(_attempt(remainingAttempts - 1));
+              }, delay);
+            });
+          case 4:
+            return _context.a(2, _context.v);
+        }
+      }, _callee, null, [[0, 2]]);
+    }));
+    return function attempt(_x) {
+      return _ref.apply(this, arguments);
+    };
+  }();
+  return _attempt(retries);
+};

package/module/es5/IP/getIpClass.js

@@ -19,7 +19,7 @@ var getIpClass = exports.getIpClass = function getIpClass(ip) {
   if (parts.length !== 4) {
     return "";
   }
-  var firstOctet = Number.parseInt(parts[0]);
+  var firstOctet = Number.parseInt(parts[0], 10);
   if (Number.isNaN(firstOctet) || firstOctet < 0 || firstOctet > 255) {
     return "";
   }

package/module/es5/IP/getNetworkAddress.js

@@ -25,7 +25,7 @@ var getNetworkAddress = exports.getNetworkAddress = function getNetworkAddress(i
   // Validate IP format
   var ipParts = ip.split(".");
   if (ipParts.length !== 4 || !ipParts.every(function (part) {
-    var number_ = Number.parseInt(part);
+    var number_ = Number.parseInt(part, 10);
     return !Number.isNaN(number_) && number_ >= 0 && number_ <= 255;
   })) {
     throw new TypeError("Invalid IP address or subnet mask");
@@ -34,7 +34,7 @@ var getNetworkAddress = exports.getNetworkAddress = function getNetworkAddress(i
   // Validate subnet mask format
   var maskParts = subnetMask.split(".");
   if (maskParts.length !== 4 || !maskParts.every(function (part) {
-    var number_ = Number.parseInt(part);
+    var number_ = Number.parseInt(part, 10);
     return !Number.isNaN(number_) && number_ >= 0 && number_ <= 255;
   })) {
     throw new TypeError("Invalid IP address or subnet mask");

package/module/es5/IP/ipToBinaryString.js

@@ -37,7 +37,7 @@ var ipToBinaryString = exports.ipToBinaryString = function ipToBinaryString(ip)
       if (!octet || octet.length > 1 && octet[0] === "0") {
         throw new Error("Invalid IP address format");
       }
-      var number = Number.parseInt(octet);
+      var number = Number.parseInt(octet, 10);
       if (Number.isNaN(number) || number < 0 || number > 255) {
         throw new Error("Invalid IP address format");
       }
@@ -50,6 +50,6 @@ var ipToBinaryString = exports.ipToBinaryString = function ipToBinaryString(ip)
     _iterator.f();
   }
   return parts.map(function (octet) {
-    return Number.parseInt(octet).toString(2).padStart(8, "0");
+    return Number.parseInt(octet, 10).toString(2).padStart(8, "0");
   }).join("");
 };

package/module/es5/IP/subnetMaskToCidr.js

@@ -24,7 +24,7 @@ var subnetMaskToCidr = exports.subnetMaskToCidr = function subnetMaskToCidr(subn
 
   // Validate each octet
   var binaryOctets = octets.map(function (octet) {
-    var number_ = Number.parseInt(octet);
+    var number_ = Number.parseInt(octet, 10);
     if (Number.isNaN(number_) || number_ < 0 || number_ > 255) {
       throw new Error("Invalid subnet mask format");
     }

package/module/es5/Math/calculator/core.js

@@ -11,6 +11,10 @@ var _multiplication = require("@/Math/multiplication");
 var _subtract = require("@/Math/subtract");
 var _isNumber = require("@/Validate/isNumber");
 var calculatorCore = exports.calculatorCore = function calculatorCore(expression, currencyExchange) {
+  // Handle empty string
+  if (expression === "") {
+    return "";
+  }
   var sanitizedExpression = expression;
 
   // Handle signs
@@ -61,6 +65,12 @@ var calculatorCore = exports.calculatorCore = function calculatorCore(expression
 
     // Return result if no more calculations needed
     else {
+      var number_ = Number(sanitizedExpression);
+      if (!Number.isNaN(number_)) {
+        // Handle floating point precision issues
+        var rounded = Math.round(number_ * 1e10) / 1e10;
+        return rounded.toString();
+      }
       return sanitizedExpression;
     }
   }
@@ -86,7 +96,7 @@ var containsParentheses = function containsParentheses(expr) {
 };
 var resolveParentheses = function resolveParentheses(expr) {
   // Logic for calculations inside parentheses
-  var match = expr.match(/\(\d+\.?(\d+)?([*+/-])\d+\.?(\d+)?\)/);
+  var match = expr.match(/\((-?\d+(?:\.\d+)?)([*+/-])(-?\d+(?:\.\d+)?)\)/);
   if (match) {
     return expr.replace(match[0], calculatorCore(match[0].replaceAll(/\(|\)/g, "")));
   }
@@ -100,20 +110,18 @@ var containsDiv = function containsDiv(expr) {
 };
 var resolveMulExp = function resolveMulExp(expr) {
   // Logic for multiplication and exponentiation
-  var match = expr.match(/(.*?)(\d+\.?(\d+)?([*^])\d+\.?(\d+)?$)/);
+  var match = expr.match(/(.*?)(-?\d+(?:\.\d+)?)([*^])(-?\d+(?:\.\d+)?)$/);
   if (match) {
-    var operands = match[2].split(/([*/^])/);
-    var result = operands[1] === "^" ? Math.pow(Number(operands[0]), Number(operands[2])) : (0, _multiplication.multiplication)(Number(operands[0]), Number(operands[2]));
+    var result = match[3] === "^" ? Math.pow(Number(match[2]), Number(match[4])) : (0, _multiplication.multiplication)(Number(match[2]), Number(match[4]));
     return "".concat(match[1]).concat(result);
   }
   return Number.NaN.toString();
 };
 var resolveDiv = function resolveDiv(expr) {
   // Logic for division
-  var match = expr.match(/\d+\.?(\d+)?(\/)\d+\.?(\d+)?/);
+  var match = expr.match(/(-?\d+(?:\.\d+)?)\/(-?\d+(?:\.\d+)?)/);
   if (match) {
-    var operands = match[0].split(/(\/)/);
-    var result = (0, _division.division)(Number(operands[0]), Number(operands[2]));
+    var result = (0, _division.division)(Number(match[1]), Number(match[2]));
     return expr.replace(match[0], String(result));
   }
   return Number.NaN.toString();
@@ -123,9 +131,9 @@ var containsAddSub = function containsAddSub(expr) {
 };
 var resolveAddSub = function resolveAddSub(expr) {
   // Logic for addition and subtraction
-  var match = expr.match(/(-?\d+)\.?(\d+)?(\+|-)(-?\d+)\.?(\d+)?/);
+  var match = expr.match(/(-?\d+(?:\.\d+)?)(\+|-)(-?\d+(?:\.\d+)?)/);
   if (match) {
-    var result = match[3] === "+" ? (0, _addition.addition)(Number(match[1]), Number(match[4])) : (0, _subtract.subtract)(Number(match[1]), Number(match[4]));
+    var result = match[2] === "+" ? (0, _addition.addition)(Number(match[1]), Number(match[3])) : (0, _subtract.subtract)(Number(match[1]), Number(match[3]));
     return expr.replace(match[0], String(result));
   }
   return Number.NaN.toString();

package/module/es5/Math/calculator/literalExpression.js

@@ -19,18 +19,24 @@ function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length)
  * @example literalExpression("3x+2=8"); // "2"
  */
 var literalExpression = exports.literalExpression = function literalExpression(x) {
+  // Handle invalid equations like x=x
+  var sides = x.split("=");
+  if (sides.length === 2 && sides[0] === sides[1]) {
+    return "";
+  }
+
   // Store numerical and variable parts of the equation
   var numericalPart = "";
   var variablePart = [];
 
   // Split by equals sign and identify numerical and variable parts
-  var _iterator = _createForOfIteratorHelper(x.split("=")),
+  var _iterator = _createForOfIteratorHelper(sides),
     _step;
   try {
     for (_iterator.s(); !(_step = _iterator.n()).done;) {
       var part = _step.value;
       if (/[A-Za-z]+/.test(part)) {
-        variablePart = part.split(/(\d+[A-Za-z]+)|([^A-Za-z]+)/).filter(function (n) {
+        variablePart = part.split(/([-+]?\d*[A-Za-z]+)|([-+]?\d+)/).filter(function (n) {
           return n && n !== undefined;
         });
       } else {
@@ -45,11 +51,19 @@ var literalExpression = exports.literalExpression = function literalExpression(x
     _iterator.f();
   }
   if (variablePart[1]) {
-    variablePart[1] = (0, _core.calculatorCore)(variablePart[1]).replaceAll("+", "plus").replaceAll("-", "minus").replaceAll("plus", "-").replaceAll("minus", "+");
+    // Invert signs before calculating
+    var invertedPart = variablePart[1].replaceAll("+", "plus").replaceAll("-", "minus").replaceAll("plus", "-").replaceAll("minus", "+");
+    variablePart[1] = (0, _core.calculatorCore)(invertedPart);
   }
 
   // Calculate the numerical part
-  numericalPart = variablePart[1] ? (0, _core.calculatorCore)("".concat(numericalPart).concat(variablePart[1])) : (0, _core.calculatorCore)(numericalPart);
+  if (variablePart[1]) {
+    // Ensure proper sign handling when combining
+    var sign = variablePart[1].startsWith("-") ? "" : "+";
+    numericalPart = (0, _core.calculatorCore)("".concat(numericalPart).concat(sign).concat(variablePart[1]));
+  } else {
+    numericalPart = (0, _core.calculatorCore)(numericalPart);
+  }
 
   // Split the variable part again to separate coefficient and variable
   variablePart = variablePart[0].split(/(\d+)|([A-Za-z]+)/).filter(function (n) {
@@ -68,8 +82,7 @@ var literalExpression = exports.literalExpression = function literalExpression(x
     if (/(-?)\d+\/1/.test(numericalPart)) {
       return numericalPart.replace(/\/1/, "");
     }
-  }
-  if (variablePart[0] !== "1") {
+  } else if (variablePart[0] !== "1") {
     numericalPart = "".concat(numericalPart, "/").concat(variablePart[0]);
   }
   return numericalPart;

package/module/es5/Math/correlationCoefficient.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Calculate the Pearson correlation coefficient between two arrays
+ * @param x - First array of numbers
+ * @param y - Second array of numbers
+ * @returns Correlation coefficient (-1 to 1)
+ * @example
+ * correlationCoefficient([1, 2, 3, 4, 5], [2, 4, 6, 8, 10]); // 1 (perfect positive correlation)
+ * correlationCoefficient([1, 2, 3, 4, 5], [5, 4, 3, 2, 1]); // -1 (perfect negative correlation)
+ * correlationCoefficient([1, 2, 3, 4, 5], [1, 1, 1, 1, 1]); // 0 (no correlation)
+ */
+export declare const correlationCoefficient: (x: number[], y: number[]) => number;

package/module/es5/Math/correlationCoefficient.js

@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.correlationCoefficient = void 0;
+var _average = require("./average");
+function _slicedToArray(r, e) { return _arrayWithHoles(r) || _iterableToArrayLimit(r, e) || _unsupportedIterableToArray(r, e) || _nonIterableRest(); }
+function _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."); }
+function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t["return"] && (u = t["return"](), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
+function _arrayWithHoles(r) { if (Array.isArray(r)) return r; }
+function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
+function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
+/**
+ * Calculate the Pearson correlation coefficient between two arrays
+ * @param x - First array of numbers
+ * @param y - Second array of numbers
+ * @returns Correlation coefficient (-1 to 1)
+ * @example
+ * correlationCoefficient([1, 2, 3, 4, 5], [2, 4, 6, 8, 10]); // 1 (perfect positive correlation)
+ * correlationCoefficient([1, 2, 3, 4, 5], [5, 4, 3, 2, 1]); // -1 (perfect negative correlation)
+ * correlationCoefficient([1, 2, 3, 4, 5], [1, 1, 1, 1, 1]); // 0 (no correlation)
+ */
+var correlationCoefficient = exports.correlationCoefficient = function correlationCoefficient(x, y) {
+  if (x.length !== y.length) {
+    throw new Error("Arrays must have the same length");
+  }
+  if (x.length === 0) {
+    return Number.NaN;
+  }
+  if (x.length === 1) {
+    return Number.NaN;
+  }
+  var meanX = (0, _average.average)(x);
+  var meanY = (0, _average.average)(y);
+  var numerator = 0;
+  var sumSquaredX = 0;
+  var sumSquaredY = 0;
+  var _iterator = _createForOfIteratorHelper(x.entries()),
+    _step;
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var _step$value = _slicedToArray(_step.value, 2),
+        index = _step$value[0],
+        element = _step$value[1];
+      var deltaX = element - meanX;
+      var deltaY = y[index] - meanY;
+      numerator += deltaX * deltaY;
+      sumSquaredX += deltaX * deltaX;
+      sumSquaredY += deltaY * deltaY;
+    }
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+  var denominator = Math.sqrt(sumSquaredX * sumSquaredY);
+  if (denominator === 0) {
+    return Number.NaN;
+  }
+  return numerator / denominator;
+};

package/module/es5/Math/division.js

@@ -17,7 +17,7 @@ var _getDecimalLength = require("./getDecimalLength");
 var division = exports.division = function division(x, y) {
   var isFloor = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
   if (y === 0) {
-    // biome-ignore lint/suspicious/noExplicitAny: <explanation>
+    // biome-ignore lint/suspicious/noExplicitAny: ignore
     return isFloor ? Number.NaN : [Number.NaN, Number.NaN];
   }
   var sign = Math.sign(x) * Math.sign(y);
@@ -39,12 +39,12 @@ var division = exports.division = function division(x, y) {
   var divisionResult = xInt / yInt * scalingFactor;
   if (isFloor) {
     // Apply sign to result
-    // biome-ignore lint/suspicious/noExplicitAny: <explanation>
+    // biome-ignore lint/suspicious/noExplicitAny: ignore
     return sign * divisionResult;
   }
   // When isFloor is false, calculate quotient and remainder
   var intQuotient = Math.floor(divisionResult);
   var remainder = xInt % yInt;
-  // biome-ignore lint/suspicious/noExplicitAny: <explanation>
+  // biome-ignore lint/suspicious/noExplicitAny: ignore
   return [sign * intQuotient, remainder];
 };

package/module/es5/Math/gcd.js

@@ -4,8 +4,13 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.gcd = void 0;
+var _isDouble = require("@/Validate/isDouble");
 function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
+function _toConsumableArray(r) { return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _nonIterableSpread(); }
+function _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."); }
 function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _iterableToArray(r) { if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r); }
+function _arrayWithoutHoles(r) { if (Array.isArray(r)) return _arrayLikeToArray(r); }
 function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
 /**
  * Greatest Common Divisor (GCD)
@@ -15,14 +20,47 @@ function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length)
  * @returns number The GCD of all input numbers
  * @example gcd(12, 18); // 6
  */
-var _gcd = exports.gcd = function gcd(x, y) {
-  var copyX = Math.abs(x);
-  var copyY = Math.abs(y);
+var gcd = exports.gcd = function gcd(x, y) {
   for (var _len = arguments.length, z = new Array(_len > 2 ? _len - 2 : 0), _key = 2; _key < _len; _key++) {
     z[_key - 2] = arguments[_key];
   }
+  // Handle decimal numbers by scaling them to integers
+  var allNumbers = [x, y].concat(z);
+
+  // If any number is decimal, find common decimal places and scale
+  var hasDecimals = allNumbers.some(function (number_) {
+    return (0, _isDouble.isDouble)(number_, false);
+  });
+  if (hasDecimals) {
+    // Find maximum decimal places
+    var getDecimalPlaces = function getDecimalPlaces(number_) {
+      var string_ = number_.toString();
+      return string_.includes(".") ? string_.split(".")[1].length : 0;
+    };
+    var maxDecimalPlaces = Math.max.apply(Math, _toConsumableArray(allNumbers.map(function (number_) {
+      return getDecimalPlaces(number_);
+    })));
+    var multiplier = Math.pow(10, maxDecimalPlaces);
+
+    // Scale all numbers to integers
+    var scaledNumbers = allNumbers.map(function (number_) {
+      return Math.round(number_ * multiplier);
+    });
+    var result = _gcdInteger.apply(void 0, [scaledNumbers[0], scaledNumbers[1]].concat(_toConsumableArray(scaledNumbers.slice(2))));
+
+    // Scale back to original decimal range
+    return result / multiplier;
+  }
+  return _gcdInteger.apply(void 0, [x, y].concat(z));
+};
+var _gcdInteger = function gcdInteger(x, y) {
+  var copyX = Math.abs(Math.round(x));
+  var copyY = Math.abs(Math.round(y));
+  for (var _len2 = arguments.length, z = new Array(_len2 > 2 ? _len2 - 2 : 0), _key2 = 2; _key2 < _len2; _key2++) {
+    z[_key2 - 2] = arguments[_key2];
+  }
   var copyZ = z.map(function (element) {
-    return Math.abs(element);
+    return Math.abs(Math.round(element));
   });
   if (copyX === 0 || copyY === 0) {
     return 0;
@@ -43,7 +81,7 @@ var _gcd = exports.gcd = function gcd(x, y) {
     try {
       for (_iterator.s(); !(_step = _iterator.n()).done;) {
         var element = _step.value;
-        copyX = _gcd(copyX, element);
+        copyX = _gcdInteger(copyX, element);
       }
     } catch (err) {
       _iterator.e(err);

package/module/es5/Math/index.d.ts

@@ -2,6 +2,7 @@ export * from "./addition";
 export * from "./average";
 export * from "./bitwise";
 export * from "./calculator";
+export * from "./correlationCoefficient";
 export * from "./degToRad";
 export * from "./deviationValue";
 export * from "./division";
@@ -17,11 +18,13 @@ export * from "./mathSeparator";
 export * from "./max";
 export * from "./median";
 export * from "./min";
+export * from "./mode";
 export * from "./multiples";
 export * from "./multiplication";
 export * from "./nCr";
 export * from "./nHr";
 export * from "./nPr";
+export * from "./percentile";
 export * from "./primeFactorization";
 export * from "./quotient";
 export * from "./radToDeg";

package/module/es5/Math/index.js

@@ -47,6 +47,17 @@ Object.keys(_calculator).forEach(function (key) {
     }
   });
 });
+var _correlationCoefficient = require("./correlationCoefficient");
+Object.keys(_correlationCoefficient).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _correlationCoefficient[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _correlationCoefficient[key];
+    }
+  });
+});
 var _degToRad = require("./degToRad");
 Object.keys(_degToRad).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;
@@ -212,6 +223,17 @@ Object.keys(_min).forEach(function (key) {
     }
   });
 });
+var _mode = require("./mode");
+Object.keys(_mode).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _mode[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _mode[key];
+    }
+  });
+});
 var _multiples = require("./multiples");
 Object.keys(_multiples).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;
@@ -267,6 +289,17 @@ Object.keys(_nPr).forEach(function (key) {
     }
   });
 });
+var _percentile = require("./percentile");
+Object.keys(_percentile).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _percentile[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _percentile[key];
+    }
+  });
+});
 var _primeFactorization = require("./primeFactorization");
 Object.keys(_primeFactorization).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;

package/module/es5/Math/mode.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Finds the most frequently occurring value(s) in an array
+ * @param array - Array of numbers to find mode for
+ * @returns Array of mode values (can be multiple values if there are ties)
+ * @example
+ * mode([1, 2, 2, 3, 3, 3]); // [3]
+ * mode([1, 2, 2, 3, 3]); // [2, 3]
+ * mode([1, 2, 3]); // [1, 2, 3]
+ */
+export declare const mode: (array: number[]) => number[];

package/module/es5/Math/mode.js

@@ -0,0 +1,67 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mode = void 0;
+function _slicedToArray(r, e) { return _arrayWithHoles(r) || _iterableToArrayLimit(r, e) || _unsupportedIterableToArray(r, e) || _nonIterableRest(); }
+function _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."); }
+function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t["return"] && (u = t["return"](), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
+function _arrayWithHoles(r) { if (Array.isArray(r)) return r; }
+function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
+function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
+/**
+ * Finds the most frequently occurring value(s) in an array
+ * @param array - Array of numbers to find mode for
+ * @returns Array of mode values (can be multiple values if there are ties)
+ * @example
+ * mode([1, 2, 2, 3, 3, 3]); // [3]
+ * mode([1, 2, 2, 3, 3]); // [2, 3]
+ * mode([1, 2, 3]); // [1, 2, 3]
+ */
+var mode = exports.mode = function mode(array) {
+  if (array.length === 0) {
+    return [];
+  }
+  var frequency = new Map();
+  var maxFrequency = 0;
+
+  // Count frequencies
+  var _iterator = _createForOfIteratorHelper(array),
+    _step;
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var value = _step.value;
+      var count = (frequency.get(value) || 0) + 1;
+      frequency.set(value, count);
+      maxFrequency = Math.max(maxFrequency, count);
+    }
+
+    // Find all values with maximum frequency
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+  var modes = [];
+  var _iterator2 = _createForOfIteratorHelper(frequency),
+    _step2;
+  try {
+    for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+      var _step2$value = _slicedToArray(_step2.value, 2),
+        _value = _step2$value[0],
+        _count = _step2$value[1];
+      if (_count === maxFrequency) {
+        modes.push(_value);
+      }
+    }
+  } catch (err) {
+    _iterator2.e(err);
+  } finally {
+    _iterator2.f();
+  }
+  return modes.sort(function (a, b) {
+    return a - b;
+  });
+};