umt 2.10.0 → 2.11.0

package/module/Validate/parseEmail.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parseEmail.js","sourceRoot":"","sources":["../../src/Validate/parseEmail.ts"],"names":[],"mappings":"AAOA,MAAM,cAAc,GAAG;IACrB,KAAK,EACH,2JAA2J;IAC7J,MAAM,EACJ,+iBAA+iB;IACjjB,OAAO,EACL,oQAAoQ;IACtQ,OAAO,EACL,mUAAmU;IACrU,OAAO,EACL,ktCAAktC;CAC5sC,CAAC;AAMX,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,EACzB,KAAK,EACL,OAAO,GAIR,EAGC,EAAE;IACF,MAAM,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC;IAC1B,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACtC,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAElC,OAAO;QACL,KAAK,EAAE,KAAK,KAAK,IAAI;QACrB,KAAK,EAAE,KAAK,EAAE,MAAM;YAClB,CAAC,CAAC;gBACE,qFAAqF;gBACrF,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC;gBAC5B,qFAAqF;gBACrF,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC;aAC/B;YACH,CAAC,CAAC,SAAS;KACd,CAAC;AACJ,CAAC,CAAC"}

package/module/Validate/string/index.d.ts

@@ -1,5 +1,5 @@
 export * from "./core";
-export * from "./email";
+export * from "./validateEmail";
 export * from "./length";
 export * from "./minLength";
 export * from "./maxLength";

package/module/Validate/string/index.js

@@ -1,5 +1,5 @@
 export * from "./core";
-export * from "./email";
+export * from "./validateEmail";
 export * from "./length";
 export * from "./minLength";
 export * from "./maxLength";

package/module/Validate/string/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/Validate/string/index.ts"],"names":[],"mappings":"AAAA,cAAc,QAAQ,CAAC;AACvB,cAAc,SAAS,CAAC;AACxB,cAAc,UAAU,CAAC;AACzB,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,cAAc,CAAC;AAC7B,cAAc,QAAQ,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/Validate/string/index.ts"],"names":[],"mappings":"AAAA,cAAc,QAAQ,CAAC;AACvB,cAAc,iBAAiB,CAAC;AAChC,cAAc,UAAU,CAAC;AACzB,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,cAAc,CAAC;AAC7B,cAAc,QAAQ,CAAC"}

package/module/Validate/string/uuid.js

@@ -14,7 +14,7 @@ export const uuid = (versions = [4], message) => ({
     validate: (value) => {
         return versions.some((version) => {
             // Regular expression for specific UUID version
-            const versionRegex = new RegExp(`^[\\da-f]{8}-?[\\da-f]{4}-?${version}[\\da-f]{3}-?[89ab][\\da-f]{3}-?[\\da-f]{12}$`, "i");
+            const versionRegex = new RegExp(String.raw `^[\da-f]{8}-?[\da-f]{4}-?${version}[\da-f]{3}-?[89ab][\da-f]{3}-?[\da-f]{12}$`, "i");
             return versionRegex.test(value);
         });
     },

package/module/Validate/string/uuid.js.map

@@ -1 +1 @@
-{"version":3,"file":"uuid.js","sourceRoot":"","sources":["../../../src/Validate/string/uuid.ts"],"names":[],"mappings":"AAEA;;;GAGG;AAEH;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAClB,WAAqB,CAAC,CAAC,CAAC,EACxB,OAAgB,EACY,EAAE,CAAC,CAAC;IAChC,IAAI,EAAE,QAAQ;IACd,OAAO;IACP,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE;QAClB,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE;YAC/B,+CAA+C;YAC/C,MAAM,YAAY,GAAG,IAAI,MAAM,CAC7B,8BAA8B,OAAO,+CAA+C,EACpF,GAAG,CACJ,CAAC;YACF,OAAO,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;IACL,CAAC;CACF,CAAC,CAAC"}
+{"version":3,"file":"uuid.js","sourceRoot":"","sources":["../../../src/Validate/string/uuid.ts"],"names":[],"mappings":"AAEA;;;GAGG;AAEH;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAClB,WAAqB,CAAC,CAAC,CAAC,EACxB,OAAgB,EACY,EAAE,CAAC,CAAC;IAChC,IAAI,EAAE,QAAQ;IACd,OAAO;IACP,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE;QAClB,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE;YAC/B,+CAA+C;YAC/C,MAAM,YAAY,GAAG,IAAI,MAAM,CAC7B,MAAM,CAAC,GAAG,CAAA,4BAA4B,OAAO,4CAA4C,EACzF,GAAG,CACJ,CAAC;YACF,OAAO,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;IACL,CAAC;CACF,CAAC,CAAC"}

package/module/Validate/string/{email.d.ts → validateEmail.d.ts}

@@ -2,10 +2,11 @@
  * String validation module for email addresses
  * Provides validation functionality for checking if a string is a valid email address
  */
+import { type ParseEmailOptions } from "../../Validate/parseEmail";
 import type { ValidateReturnType } from "../../Validate/type";
 /**
  * Creates a validator for checking if a string is a valid email address
  * @param {string} [message] - Custom error message for validation failure
  * @returns {ValidateReturnType<string>} - Validator for email addresses
  */
-export declare const email: (message?: string) => ValidateReturnType<string>;
+export declare const validateEmail: (message?: string, options?: ParseEmailOptions) => ValidateReturnType<string>;

package/module/Validate/string/validateEmail.js

@@ -0,0 +1,23 @@
+/**
+ * String validation module for email addresses
+ * Provides validation functionality for checking if a string is a valid email address
+ */
+import { parseEmail } from "../../Validate/parseEmail";
+/**
+ * Creates a validator for checking if a string is a valid email address
+ * @param {string} [message] - Custom error message for validation failure
+ * @returns {ValidateReturnType<string>} - Validator for email addresses
+ */
+export const validateEmail = (message, options) => {
+    return {
+        type: "string",
+        message,
+        validate: (value) => {
+            return parseEmail({
+                email: value,
+                options: options || { level: "basic" },
+            }).valid;
+        },
+    };
+};
+//# sourceMappingURL=validateEmail.js.map

package/module/Validate/string/validateEmail.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validateEmail.js","sourceRoot":"","sources":["../../../src/Validate/string/validateEmail.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,UAAU,EAA0B,MAAM,uBAAuB,CAAC;AAG3E;;;;GAIG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,OAAgB,EAChB,OAA2B,EACC,EAAE;IAC9B,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,OAAO;QACP,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE;YAClB,OAAO,UAAU,CAAC;gBAChB,KAAK,EAAE,KAAK;gBACZ,OAAO,EAAE,OAAO,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE;aACvC,CAAC,CAAC,KAAK,CAAC;QACX,CAAC;KACF,CAAC;AACJ,CAAC,CAAC"}

package/module/es5/Array/dualPivotQuickSort.js

@@ -7,6 +7,12 @@ exports.dualPivotQuickSort = void 0;
 var _compareFunctionDefault = require("./compareFunctionDefault");
 var _applyInsertionSortIfNeeded = require("./sortingHelpers/applyInsertionSortIfNeeded");
 var _rangeValidator = require("./sortingHelpers/rangeValidator");
+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; }
 /**
  * Get the median of three elements in the array
  * @param array - The input array
@@ -170,12 +176,13 @@ var dualPivotQuickSort = exports.dualPivotQuickSort = function dualPivotQuickSor
   var startIndex = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
   var endIndex = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : array.length - 1;
   var insertionSortThreshold = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 10;
-  var _validateRange = (0, _rangeValidator.validateRange)(array, startIndex, endIndex),
+  var result = _toConsumableArray(array);
+  var _validateRange = (0, _rangeValidator.validateRange)(result, startIndex, endIndex),
     validStartIndex = _validateRange.startIndex,
     validEndIndex = _validateRange.endIndex,
     shouldSort = _validateRange.shouldSort;
   if (shouldSort) {
-    _sortRange(array, validStartIndex, validEndIndex, compareFunction, insertionSortThreshold);
+    _sortRange(result, validStartIndex, validEndIndex, compareFunction, insertionSortThreshold);
   }
-  return array;
+  return result;
 };

package/module/es5/Array/insertionSort.js

@@ -5,6 +5,13 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.insertionSort = void 0;
 var _compareFunctionDefault = require("./compareFunctionDefault");
+var _insertionSortRange = require("./sortingHelpers/insertionSortRange");
+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; }
 /**
  * Sort an array using insertion sort algorithm
  *
@@ -30,14 +37,7 @@ var insertionSort = exports.insertionSort = function insertionSort(array) {
   var compareFunction = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : _compareFunctionDefault.compareFunctionDefault;
   var start = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
   var end = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : array.length - 1;
-  for (var index = start + 1; index <= end; index++) {
-    var index_ = index;
-    var target = array[index];
-    while (index_ > start && compareFunction(array[index_ - 1], target) > 0) {
-      array[index_] = array[index_ - 1];
-      index_--;
-    }
-    array[index_] = target;
-  }
-  return array;
+  var result = _toConsumableArray(array);
+  (0, _insertionSortRange.insertionSortRange)(result, compareFunction, start, end);
+  return result;
 };

package/module/es5/Array/quickSort.js

@@ -7,6 +7,12 @@ exports.quickSort = void 0;
 var _compareFunctionDefault = require("./compareFunctionDefault");
 var _applyInsertionSortIfNeeded = require("./sortingHelpers/applyInsertionSortIfNeeded");
 var _rangeValidator = require("./sortingHelpers/rangeValidator");
+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; }
 /**
  * Finds the median value among three elements in the array
  * @param array The array containing the elements
@@ -110,12 +116,13 @@ var quickSort = exports.quickSort = function quickSort(array) {
   var startIndex = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
   var endIndex = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : array.length - 1;
   var insertionSortThreshold = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 10;
-  var _validateRange = (0, _rangeValidator.validateRange)(array, startIndex, endIndex),
+  var result = _toConsumableArray(array);
+  var _validateRange = (0, _rangeValidator.validateRange)(result, startIndex, endIndex),
     validStartIndex = _validateRange.startIndex,
     validEndIndex = _validateRange.endIndex,
     shouldSort = _validateRange.shouldSort;
   if (shouldSort) {
-    _sortImpl(array, validStartIndex, validEndIndex, compareFunction, insertionSortThreshold);
+    _sortImpl(result, validStartIndex, validEndIndex, compareFunction, insertionSortThreshold);
   }
-  return array;
+  return result;
 };

package/module/es5/Array/sortingHelpers/applyInsertionSortIfNeeded.js

@@ -4,7 +4,7 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.applyInsertionSortIfNeeded = void 0;
-var _insertionSort = require("@/Array/insertionSort");
+var _insertionSortRange = require("./insertionSortRange");
 /**
  * Checks if a partition is small enough to apply insertion sort and applies it if so.
  *
@@ -18,7 +18,7 @@ var _insertionSort = require("@/Array/insertionSort");
  */
 var applyInsertionSortIfNeeded = exports.applyInsertionSortIfNeeded = function applyInsertionSortIfNeeded(array, low, high, compareFunction, insertionSortThreshold) {
   if (high - low + 1 <= insertionSortThreshold) {
-    (0, _insertionSort.insertionSort)(array, compareFunction, low, high);
+    (0, _insertionSortRange.insertionSortRange)(array, compareFunction, low, high);
     return true;
   }
   return false;

package/module/es5/Array/sortingHelpers/insertionSortRange.d.ts

@@ -0,0 +1,5 @@
+import type { CompareFunction } from "$/array/compareFunction";
+/**
+ * @internal
+ */
+export declare const insertionSortRange: <T>(array: T[], compareFunction: CompareFunction<T>, start: number, end: number) => void;

package/module/es5/Array/sortingHelpers/insertionSortRange.js

@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.insertionSortRange = void 0;
+/**
+ * @internal
+ */
+var insertionSortRange = exports.insertionSortRange = function insertionSortRange(array, compareFunction, start, end) {
+  for (var index = start + 1; index <= end; index++) {
+    var index_ = index;
+    var target = array[index];
+    while (index_ > start && compareFunction(array[index_ - 1], target) > 0) {
+      array[index_] = array[index_ - 1];
+      index_--;
+    }
+    array[index_] = target;
+  }
+};

package/module/es5/Array/timSort.js

@@ -5,7 +5,13 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.timSort = void 0;
 var _compareFunctionDefault = require("./compareFunctionDefault");
-var _insertionSort = require("@/Array/insertionSort");
+var _insertionSortRange = require("./sortingHelpers/insertionSortRange");
+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; }
 var MIN_RUN = 32;
 
 /**
@@ -79,19 +85,21 @@ var timSort = exports.timSort = function timSort(array) {
   var compareFunction = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : _compareFunctionDefault.compareFunctionDefault;
   var start = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
   var end = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : array.length - 1;
+  var result = _toConsumableArray(array);
   var n = end - start + 1;
   var minRun = getMinRunLength(n);
-  for (var index = start; index <= end; index += minRun) {
-    (0, _insertionSort.insertionSort)(array, compareFunction, index, Math.min(index + MIN_RUN - 1, end));
+  for (var runStart = start; runStart <= end; runStart += minRun) {
+    var runEnd = Math.min(runStart + MIN_RUN - 1, end);
+    (0, _insertionSortRange.insertionSortRange)(result, compareFunction, runStart, runEnd);
   }
   for (var size = minRun; size < n; size *= 2) {
     for (var left = start; left <= end; left += 2 * size) {
       var mid = left + size - 1;
       var right = Math.min(left + 2 * size - 1, end);
       if (mid < right) {
-        merge(array, left, mid, right, compareFunction);
+        merge(result, left, mid, right, compareFunction);
       }
     }
   }
-  return array;
+  return result;
 };

package/module/es5/Array/ultraNumberSort.js

@@ -5,7 +5,11 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.ultraNumberSort = void 0;
 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; }
 /**
  * Ultra-fast sorting specifically optimized for number arrays
@@ -15,32 +19,33 @@ function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length)
  */
 var ultraNumberSort = exports.ultraNumberSort = function ultraNumberSort(array) {
   var ascending = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
-  var length = array.length;
+  var result = _toConsumableArray(array);
+  var length = result.length;
   if (length <= 1) {
-    return array;
+    return result;
   }
 
   // For tiny arrays, use optimized inline sort
   if (length === 2) {
-    if (array[0] > array[1] === ascending) {
-      var _ref = [array[1], array[0]];
-      array[0] = _ref[0];
-      array[1] = _ref[1];
+    if (result[0] > result[1] === ascending) {
+      var _ref = [result[1], result[0]];
+      result[0] = _ref[0];
+      result[1] = _ref[1];
     }
-    return array;
+    return result;
   }
   if (length === 3) {
-    inlineSort3(array, ascending);
-    return array;
+    inlineSort3(result, ascending);
+    return result;
   }
 
   // Check if all numbers are integers and find range
   var allIntegers = true;
-  var min = array[0];
-  var max = array[0];
+  var min = result[0];
+  var max = result[0];
   var hasNaN = false;
   for (var index = 0; index < length; index++) {
-    var value = array[index];
+    var value = result[index];
     // biome-ignore lint/suspicious/noSelfCompare: ignore
     if (value !== value) {
       hasNaN = true;
@@ -59,21 +64,21 @@ var ultraNumberSort = exports.ultraNumberSort = function ultraNumberSort(array)
 
   // Handle NaN values
   if (hasNaN) {
-    return handleNaNSort(array, ascending);
+    return handleNaNSort(result, ascending);
   }
 
   // For small integer ranges, use counting sort
   if (allIntegers && max - min < length * 2 && max - min < 1000000) {
-    return countingSort(array, min, max, ascending);
+    return countingSort(result, min, max, ascending);
   }
 
   // For larger arrays, use radix sort if applicable
   if (allIntegers && length > 100) {
-    return radixSort(array, ascending);
+    return radixSort(result, ascending);
   }
 
   // Fall back to optimized quicksort for floating point
-  return numericQuickSort(array, 0, length - 1, ascending);
+  return numericQuickSort(result, 0, length - 1, ascending);
 };
 
 /**
@@ -335,8 +340,7 @@ var radixSortPositive = function radixSortPositive(array) {
  * Optimized quicksort for numbers
  */
 var numericQuickSort = function numericQuickSort(array, low, high, ascending) {
-  var stack = [];
-  stack.push(low, high);
+  var stack = [low, high];
   while (stack.length > 0) {
     var h = stack.pop();
     var l = stack.pop();

package/module/es5/Color/hexaToRgba.d.ts

@@ -2,7 +2,7 @@
  * Convert hexadecimal color code to RGBA color values
  * @param hex Hexadecimal color code (3, 6, or 8 digits with #)
  * @returns {Object} RGBA values (r, g, b as 0-255, a as 0-1)
- * @example hexToRgba("#00000000") // { r: 0, g: 0, b: 0, a: 0 }
+ * @example hexaToRgba("#00000000") // { r: 0, g: 0, b: 0, a: 0 }
  * @throws {Error} If the hex code format is invalid
  */
 export declare const hexaToRgba: (hex: string) => {

package/module/es5/Color/hexaToRgba.js

@@ -10,7 +10,7 @@ var _roundOf = require("@/Math/roundOf");
  * Convert hexadecimal color code to RGBA color values
  * @param hex Hexadecimal color code (3, 6, or 8 digits with #)
  * @returns {Object} RGBA values (r, g, b as 0-255, a as 0-1)
- * @example hexToRgba("#00000000") // { r: 0, g: 0, b: 0, a: 0 }
+ * @example hexaToRgba("#00000000") // { r: 0, g: 0, b: 0, a: 0 }
  * @throws {Error} If the hex code format is invalid
  */
 var hexaToRgba = exports.hexaToRgba = function hexaToRgba(hex) {

package/module/es5/Crypto/decodeBase58.js

@@ -19,7 +19,7 @@ function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length)
  */
 var decodeBase58 = exports.decodeBase58 = function decodeBase58(input) {
   var alphabet = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
-  var bigNumber = BigInt(0);
+  var bigNumber = 0n;
   var _iterator = _createForOfIteratorHelper(input),
     _step;
   try {
@@ -29,7 +29,7 @@ var decodeBase58 = exports.decodeBase58 = function decodeBase58(input) {
       if (value === -1) {
         throw new Error("Invalid base58 character: ".concat(_char));
       }
-      bigNumber = bigNumber * BigInt(58) + BigInt(value);
+      bigNumber = bigNumber * 58n + BigInt(value);
     }
   } catch (err) {
     _iterator.e(err);
@@ -38,8 +38,8 @@ var decodeBase58 = exports.decodeBase58 = function decodeBase58(input) {
   }
   var bytes = [];
   while (bigNumber > 0) {
-    bytes.unshift(Number(bigNumber % BigInt(256)));
-    bigNumber /= BigInt(256);
+    bytes.unshift(Number(bigNumber % 256n));
+    bigNumber /= 256n;
   }
   var leadingOnes = 0;
   var _iterator2 = _createForOfIteratorHelper(input),

package/module/es5/Crypto/encodeBase58.js

@@ -17,13 +17,13 @@ var encodeBase58 = exports.encodeBase58 = function encodeBase58(input) {
   var alphabet = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
   var bytes = typeof input === "string" ? new TextEncoder().encode(input) : input;
   var encoded = "";
-  var bigNumber = BigInt(0);
+  var bigNumber = 0n;
   var _iterator = _createForOfIteratorHelper(bytes),
     _step;
   try {
     for (_iterator.s(); !(_step = _iterator.n()).done;) {
       var _byte = _step.value;
-      bigNumber = bigNumber * BigInt(256) + BigInt(_byte);
+      bigNumber = bigNumber * 256n + BigInt(_byte);
     }
   } catch (err) {
     _iterator.e(err);
@@ -31,9 +31,9 @@ var encodeBase58 = exports.encodeBase58 = function encodeBase58(input) {
     _iterator.f();
   }
   while (bigNumber > 0) {
-    var remainder = Number(bigNumber % BigInt(58));
+    var remainder = Number(bigNumber % 58n);
     encoded = alphabet[remainder] + encoded;
-    bigNumber /= BigInt(58);
+    bigNumber /= 58n;
   }
   var leadingZeros = 0;
   var _iterator2 = _createForOfIteratorHelper(bytes),

package/module/es5/Math/mode.js

@@ -4,6 +4,7 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.mode = void 0;
+var _ultraNumberSort = require("@/Array/ultraNumberSort");
 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; } }
@@ -61,7 +62,5 @@ var mode = exports.mode = function mode(array) {
   } finally {
     _iterator2.f();
   }
-  return modes.sort(function (a, b) {
-    return a - b;
-  });
+  return (0, _ultraNumberSort.ultraNumberSort)(modes);
 };

package/module/es5/Math/solveEquation.js

@@ -70,7 +70,7 @@ var solveEquation = exports.solveEquation = function solveEquation(coefficients,
   }
 
   // Return the solution vector with values rounded to 1 decimal place
-  return solution.toReversed().map(function (value) {
+  return [].concat(solution).reverse().map(function (value) {
     return (0, _roundOf.roundOf)(value, 1);
   });
 };

package/module/es5/String/formatString/index.js

@@ -128,7 +128,7 @@ function formatString(template, dataOrFirstValue, optionsOrSecondValue) {
     var _pathAndFormatter$spl = pathAndFormatter.split(":"),
       _pathAndFormatter$spl2 = _toArray(_pathAndFormatter$spl),
       path = _pathAndFormatter$spl2[0],
-      formatterParts = _pathAndFormatter$spl2.slice(1);
+      formatterParts = _arrayLikeToArray(_pathAndFormatter$spl2).slice(1);
     var formatterString = formatterParts.join(":");
     var value;
     if (Array.isArray(data)) {

package/module/es5/String/fuzzySearch.js

@@ -5,6 +5,7 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.fuzzySearch = void 0;
 var _levenshteinDistance = require("./levenshteinDistance");
+var _quickSort = require("@/Array/quickSort");
 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; }
@@ -44,7 +45,7 @@ var fuzzySearch = exports.fuzzySearch = function fuzzySearch(query, items) {
   } finally {
     _iterator.f();
   }
-  return results.sort(function (a, b) {
+  return (0, _quickSort.quickSort)(results, function (a, b) {
     return b.score - a.score;
   });
 };

package/module/es5/String/reverseString.js

@@ -11,5 +11,5 @@ exports.reverseString = void 0;
  * @example reverseString("Hello"); // "olleH"
  */
 var reverseString = exports.reverseString = function reverseString(_char) {
-  return _char.split("").toReversed().join("");
+  return _char.split("").reverse().join("");
 };

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

@@ -19,3 +19,4 @@ export * from "./isPerfectSquare";
 export * from "./isPrimeNumber";
 export * from "./isString";
 export * from "./isValueNaN";
+export * from "./parseEmail";

package/module/es5/Validate/index.js

@@ -233,4 +233,15 @@ Object.keys(_isValueNaN).forEach(function (key) {
       return _isValueNaN[key];
     }
   });
+});
+var _parseEmail = require("./parseEmail");
+Object.keys(_parseEmail).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _parseEmail[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _parseEmail[key];
+    }
+  });
 });

package/module/es5/Validate/parseEmail.d.ts

@@ -0,0 +1,14 @@
+export type ParseEmailLevel = "basic" | "rfc822" | "rfc2822" | "rfc5321" | "rfc5322";
+export type ParseEmailOptions = {
+    level: ParseEmailLevel;
+};
+export declare const parseEmail: ({ email, options, }: {
+    email: string;
+    options: ParseEmailOptions;
+}) => {
+    valid: boolean;
+    parts?: {
+        local: string;
+        domain: string;
+    };
+};

package/module/es5/Validate/parseEmail.js

@@ -0,0 +1,48 @@
+"use strict";
+
+function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.parseEmail = void 0;
+function _wrapRegExp() { _wrapRegExp = function _wrapRegExp(e, r) { return new BabelRegExp(e, void 0, r); }; var e = RegExp.prototype, r = new WeakMap(); function BabelRegExp(e, t, p) { var o = RegExp(e, t); return r.set(o, p || r.get(e)), _setPrototypeOf(o, BabelRegExp.prototype); } function buildGroups(e, t) { var p = r.get(t); return Object.keys(p).reduce(function (r, t) { var o = p[t]; if ("number" == typeof o) r[t] = e[o];else { for (var i = 0; void 0 === e[o[i]] && i + 1 < o.length;) i++; r[t] = e[o[i]]; } return r; }, Object.create(null)); } return _inherits(BabelRegExp, RegExp), BabelRegExp.prototype.exec = function (r) { var t = e.exec.call(this, r); if (t) { t.groups = buildGroups(t, this); var p = t.indices; p && (p.groups = buildGroups(p, this)); } return t; }, BabelRegExp.prototype[Symbol.replace] = function (t, p) { if ("string" == typeof p) { var o = r.get(this); return e[Symbol.replace].call(this, t, p.replace(/\$<([^>]+)(>|$)/g, function (e, r, t) { if ("" === t) return e; var p = o[r]; return Array.isArray(p) ? "$" + p.join("$") : "number" == typeof p ? "$" + p : ""; })); } if ("function" == typeof p) { var i = this; return e[Symbol.replace].call(this, t, function () { var e = arguments; return "object" != _typeof(e[e.length - 1]) && (e = [].slice.call(e)).push(buildGroups(e, i)), p.apply(this, e); }); } return e[Symbol.replace].call(this, t, p); }, _wrapRegExp.apply(this, arguments); }
+function _inherits(t, e) { if ("function" != typeof e && null !== e) throw new TypeError("Super expression must either be null or a function"); t.prototype = Object.create(e && e.prototype, { constructor: { value: t, writable: !0, configurable: !0 } }), Object.defineProperty(t, "prototype", { writable: !1 }), e && _setPrototypeOf(t, e); }
+function _setPrototypeOf(t, e) { return _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function (t, e) { return t.__proto__ = e, t; }, _setPrototypeOf(t, e); }
+var EMAIL_PATTERNS = {
+  basic: /*#__PURE__*/_wrapRegExp(/^([a-zA-Z0-9.!#$%&'*+/=?^_`{|}~-]+)@([a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*)$/, {
+    local: 1,
+    domain: 2
+  }),
+  rfc822: /*#__PURE__*/_wrapRegExp(/^(?:\s|\((?:[^()\\]|\\[\s\S])*(?:\((?:[^()\\]|\\[\s\S])*\)(?:[^()\\]|\\[\s\S])*)*\))*("(?:[^"\\]|\\[\s\S]){0,62}"|[a-zA-Z0-9!#$%&'*/=?^_`{|}~-]{1,64}(?:\.[a-zA-Z0-9!#$%&'*/=?^_`{|}~-]+)*)(?:\s|\((?:[^()\\]|\\[\s\S])*(?:\((?:[^()\\]|\\[\s\S])*\)(?:[^()\\]|\\[\s\S])*)*\))*@(?:\s|\((?:[^()\\]|\\[\s\S])*(?:\((?:[^()\\]|\\[\s\S])*\)(?:[^()\\]|\\[\s\S])*)*\))*([a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*)(?:\s|\((?:[^()\\]|\\[\s\S])*(?:\((?:[^()\\]|\\[\s\S])*\)(?:[^()\\]|\\[\s\S])*)*\))*$/, {
+    local: 1,
+    domain: 2
+  }),
+  rfc2822: /*#__PURE__*/_wrapRegExp(/^(?=.{1,998}$)(?!.*\.\.)([a-zA-Z0-9!#$%&'*/=?^_`{|}~-](?:[a-zA-Z0-9!#$%&'*/=?^_`{|}~.+-]{0,62}[a-zA-Z0-9!#$%&'*/=?^_`{|}~-])?)@([a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*\.[a-zA-Z]{2,})$/, {
+    local: 1,
+    domain: 2
+  }),
+  rfc5321: /*#__PURE__*/_wrapRegExp(/^(?=.{1,256}$)(?=(?:[^@]{1,64})@)(?!.*\.\.)((?:[a-zA-Z0-9!#$%&'*+/=?^_`{|}~-]+(?:\.[a-zA-Z0-9!#$%&'*+/=?^_`{|}~-]+)*|"(?:[^"\\]|\\[\s\S]){0,62}"))@([a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)+|\[(?:(?:[0-9]{1,3}\.){3}[0-9]{1,3}|IPv6:[0-9a-fA-F:]+)\])$/, {
+    local: 1,
+    domain: 2
+  }),
+  rfc5322: /*#__PURE__*/_wrapRegExp(/^(?=.{1,998}$)(?:\s|\((?:[^()\\]|\\[\s\S])*(?:\((?:[^()\\]|\\[\s\S])*\)(?:[^()\\]|\\[\s\S])*)*\))*("(?:[^"\\]|\\[\s\S]){0,62}"(?:\."(?:[^"\\]|\\[\s\S]){0,62}")*|"(?:[^"\\]|\\[\s\S]){0,62}"(?:\.[a-zA-Z0-9!#$%&'*/=?^_`{|}~+-]{1,64}(?:\.[a-zA-Z0-9!#$%&'*/=?^_`{|}~+-]{1,64})*)+|[a-zA-Z0-9!#$%&'*/=?^_`{|}~+-]{1,64}(?:\.[a-zA-Z0-9!#$%&'*/=?^_`{|}~+-]{1,64})*(?:\."(?:[^"\\]|\\[\s\S]){0,62}")+|[a-zA-Z0-9!#$%&'*/=?^_`{|}~+-]{1,64}(?:(?:\s|\((?:[^()\\]|\\[\s\S])*(?:\((?:[^()\\]|\\[\s\S])*\)(?:[^()\\]|\\[\s\S])*)*\))*\.(?:\s|\((?:[^()\\]|\\[\s\S])*(?:\((?:[^()\\]|\\[\s\S])*\)(?:[^()\\]|\\[\s\S])*)*\))*[a-zA-Z0-9!#$%&'*/=?^_`{|}~+-]{1,64})*)(?:\s|\((?:[^()\\]|\\[\s\S])*(?:\((?:[^()\\]|\\[\s\S])*\)(?:[^()\\]|\\[\s\S])*)*\))*@(?:\s|\((?:[^()\\]|\\[\s\S])*(?:\((?:[^()\\]|\\[\s\S])*\)(?:[^()\\]|\\[\s\S])*)*\))*([a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:(?:\s|\((?:[^()\\]|\\[\s\S])*(?:\((?:[^()\\]|\\[\s\S])*\)(?:[^()\\]|\\[\s\S])*)*\))*\.(?:\s|\((?:[^()\\]|\\[\s\S])*(?:\((?:[^()\\]|\\[\s\S])*\)(?:[^()\\]|\\[\s\S])*)*\))*[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)+|\[(?:(?:[0-9]{1,3}\.){3}[0-9]{1,3}|IPv6:[0-9a-fA-F:]+)\])(?:\s|\((?:[^()\\]|\\[\s\S])*(?:\((?:[^()\\]|\\[\s\S])*\)(?:[^()\\]|\\[\s\S])*)*\))*$/, {
+    local: 1,
+    domain: 2
+  })
+};
+var parseEmail = exports.parseEmail = function parseEmail(_ref) {
+  var email = _ref.email,
+    options = _ref.options;
+  var level = options.level;
+  var pattern = EMAIL_PATTERNS[level];
+  var match = pattern.exec(email);
+  return {
+    valid: match !== null,
+    parts: match !== null && match !== void 0 && match.groups ? {
+      // biome-ignore lint/complexity/useLiteralKeys: Literal keys are used for group names
+      local: match.groups["local"],
+      // biome-ignore lint/complexity/useLiteralKeys: Literal keys are used for group names
+      domain: match.groups["domain"]
+    } : undefined
+  };
+};

package/module/es5/Validate/string/index.d.ts

@@ -1,5 +1,5 @@
 export * from "./core";
-export * from "./email";
+export * from "./validateEmail";
 export * from "./length";
 export * from "./minLength";
 export * from "./maxLength";