umt 2.11.0 → 2.12.1

package/module/es5/Array/range.js

@@ -22,7 +22,7 @@ var range = exports.range = function range(start, end) {
     return array;
   }
   var actualStart = end === undefined ? 0 : start;
-  var actualEnd = end === undefined ? start : end;
+  var actualEnd = end !== null && end !== void 0 ? end : start;
 
   // Return empty array if invalid range
   if (step > 0 && actualStart >= actualEnd || step < 0 && actualStart <= actualEnd) {

package/module/es5/Array/timSort.js

@@ -89,7 +89,7 @@ var timSort = exports.timSort = function timSort(array) {
   var n = end - start + 1;
   var minRun = getMinRunLength(n);
   for (var runStart = start; runStart <= end; runStart += minRun) {
-    var runEnd = Math.min(runStart + MIN_RUN - 1, end);
+    var runEnd = Math.min(runStart + minRun - 1, end);
     (0, _insertionSortRange.insertionSortRange)(result, compareFunction, runStart, runEnd);
   }
   for (var size = minRun; size < n; size *= 2) {

package/module/es5/Array/ultraNumberSort.js

@@ -190,15 +190,15 @@ var countingSort = function countingSort(array, min, max, ascending) {
     for (var index_ = 0; index_ < range; index_++) {
       var cnt = count[index_];
       var value = index_ + min;
-      for (var _index_ = 0; _index_ < cnt; _index_++) {
+      for (var index__ = 0; index__ < cnt; index__++) {
         array[index++] = value;
       }
     }
   } else {
-    for (var _index_2 = range - 1; _index_2 >= 0; _index_2--) {
-      var _cnt = count[_index_2];
-      var _value = _index_2 + min;
-      for (var _index_3 = 0; _index_3 < _cnt; _index_3++) {
+    for (var _index_ = range - 1; _index_ >= 0; _index_--) {
+      var _cnt = count[_index_];
+      var _value = _index_ + min;
+      for (var _index__ = 0; _index__ < _cnt; _index__++) {
         array[index++] = _value;
       }
     }
@@ -240,11 +240,11 @@ var radixSort = function radixSort(array, ascending) {
   var index = 0;
   if (ascending) {
     // Negative numbers first (in reverse order)
-    for (var _index_4 = negative.length - 1; _index_4 >= 0; _index_4--) {
-      array[index++] = -negative[_index_4];
+    for (var _index_2 = negative.length - 1; _index_2 >= 0; _index_2--) {
+      array[index++] = -negative[_index_2];
     }
     // Zeros
-    for (var _index_5 = 0; _index_5 < zeroCount; _index_5++) {
+    for (var _index_3 = 0; _index_3 < zeroCount; _index_3++) {
       array[index++] = 0;
     }
     // Positive numbers
@@ -262,11 +262,11 @@ var radixSort = function radixSort(array, ascending) {
     }
   } else {
     // Positive numbers first (in reverse order)
-    for (var _index_6 = positive.length - 1; _index_6 >= 0; _index_6--) {
-      array[index++] = positive[_index_6];
+    for (var _index_4 = positive.length - 1; _index_4 >= 0; _index_4--) {
+      array[index++] = positive[_index_4];
     }
     // Zeros
-    for (var _index_7 = 0; _index_7 < zeroCount; _index_7++) {
+    for (var _index_5 = 0; _index_5 < zeroCount; _index_5++) {
       array[index++] = 0;
     }
     // Negative numbers
@@ -384,12 +384,12 @@ var numericInsertionSort = function numericInsertionSort(array, low, high, ascen
   } else {
     for (var _index6 = low + 1; _index6 <= high; _index6++) {
       var _key = array[_index6];
-      var _index_8 = _index6 - 1;
-      while (_index_8 >= low && array[_index_8] < _key) {
-        array[_index_8 + 1] = array[_index_8];
-        _index_8--;
+      var _index_6 = _index6 - 1;
+      while (_index_6 >= low && array[_index_6] < _key) {
+        array[_index_6 + 1] = array[_index_6];
+        _index_6--;
       }
-      array[_index_8 + 1] = _key;
+      array[_index_6 + 1] = _key;
     }
   }
 };

package/module/es5/Consts/clock.d.ts

@@ -1,7 +1,7 @@
 /**
  * Number of milliseconds in one second
  */
-export declare const OneSecondMs: 1000;
+export declare const OneSecondMs = 1000;
 /**
  * Number of milliseconds in one minute
  */

package/module/es5/DataStructure/priorityQueue.d.ts

@@ -64,10 +64,10 @@ export declare class PriorityQueue<T> {
      * ]);
      * ```
      */
-    constructor(initialElements?: Array<{
+    constructor(initialElements?: {
         value: T;
         priority: number;
-    }>);
+    }[]);
     /**
      * Returns the number of elements in the queue.
      * @returns The number of elements in the queue
@@ -205,10 +205,10 @@ export declare class PriorityQueue<T> {
      * // [{ value: "high", priority: 10 }, { value: "low", priority: 1 }] (order may vary)
      * ```
      */
-    toArrayWithPriorities(): Array<{
+    toArrayWithPriorities(): {
         value: T;
         priority: number;
-    }>;
+    }[];
     /**
      * Updates the minimum priority when adding elements.
      * @param priority - The priority being added

package/module/es5/DataStructure/priorityQueue.js

@@ -4,6 +4,7 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.PriorityQueue = void 0;
+var _unwrap = require("@/Tool/unwrap");
 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); }
 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."); }
@@ -204,8 +205,8 @@ var PriorityQueue = exports.PriorityQueue = /*#__PURE__*/function () {
         return (_this$heap$pop = this.heap.pop()) === null || _this$heap$pop === void 0 ? void 0 : _this$heap$pop.value;
       }
       var result = this.heap[0].value;
-      // biome-ignore lint/style/noNonNullAssertion: pop() cannot return undefined when heap.length > 1
-      this.heap[0] = this.heap.pop();
+      // pop() cannot return undefined when heap.length > 1
+      this.heap[0] = (0, _unwrap.unwrap)(this.heap.pop(), "panic: heap is empty");
       this.heapifyDown(0);
       return result;
     }

package/module/es5/Date/dayOfWeek.js

@@ -17,7 +17,8 @@ var dayOfWeek = exports.dayOfWeek = function dayOfWeek(properties) {
   var timeDifference = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 9;
   var nowTime = (0, _now.now)(timeDifference);
   if (properties) {
-    return (0, _new.newDateInt)(properties.year || nowTime.getFullYear(), properties.mon || nowTime.getMonth() + 1, properties.day || nowTime.getDate()).getDay();
+    var _properties$year, _properties$mon, _properties$day;
+    return (0, _new.newDateInt)((_properties$year = properties.year) !== null && _properties$year !== void 0 ? _properties$year : nowTime.getFullYear(), (_properties$mon = properties.mon) !== null && _properties$mon !== void 0 ? _properties$mon : nowTime.getMonth() + 1, (_properties$day = properties.day) !== null && _properties$day !== void 0 ? _properties$day : nowTime.getDate()).getDay();
   }
   return nowTime.getDay();
 };

package/module/es5/Date/format.js

@@ -77,6 +77,6 @@ var format = exports.format = function format(date) {
     ZZ: timezoneOffsetString.replace(":", "")
   };
   return formatString.replaceAll(/\[([^\]]+)]|(Y{1,4}|M{1,2}|D{1,2}|d{1,2}|H{1,2}|h{1,2}|a|A|m{1,2}|s{1,2}|Z{1,2}|SSS)/g, function (_match, $1, $2) {
-    return $1 || matches[$2];
+    return $1 !== null && $1 !== void 0 ? $1 : matches[$2];
   });
 };

package/module/es5/IP/ipToBinaryString.js

@@ -34,7 +34,7 @@ var ipToBinaryString = exports.ipToBinaryString = function ipToBinaryString(ip)
     for (_iterator.s(); !(_step = _iterator.n()).done;) {
       var octet = _step.value;
       // Check for empty octet or leading zeros
-      if (!octet || octet.length > 1 && octet[0] === "0") {
+      if (!octet || octet.length > 1 && octet.startsWith("0")) {
         throw new Error("Invalid IP address format");
       }
       var number = Number.parseInt(octet, 10);

package/module/es5/IP/subnetMaskToCidr.js

@@ -33,7 +33,7 @@ var subnetMaskToCidr = exports.subnetMaskToCidr = function subnetMaskToCidr(subn
 
   // Join octets and count consecutive 1s
   var binaryString = binaryOctets.join("");
-  var match = binaryString.match(/^1*0*$/);
+  var match = /^1*0*$/.exec(binaryString);
   if (!match) {
     throw new Error("Invalid subnet mask: must be consecutive 1s followed by 0s");
   }

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

@@ -78,12 +78,22 @@ var calculatorCore = exports.calculatorCore = function calculatorCore(expression
 var sanitizeSigns = function sanitizeSigns(expr) {
   return expr.replaceAll("--", "+").replaceAll("++", "+").replaceAll("+-", "+0-").replaceAll("-+", "+0-");
 };
+var currencyRegexCache = new Map();
+var getCurrencyRegex = function getCurrencyRegex(currencySymbol) {
+  var cached = currencyRegexCache.get(currencySymbol);
+  if (cached) {
+    return cached;
+  }
+  var regex = new RegExp("\\".concat(currencySymbol, "([0-9]+)"));
+  currencyRegexCache.set(currencySymbol, regex);
+  return regex;
+};
 var applyCurrencyExchange = function applyCurrencyExchange(expr, rates) {
   var returnExpr = expr;
   // Currency exchange logic
   for (var index in rates) {
     if (returnExpr.includes(index)) {
-      var $ = returnExpr.match(new RegExp("\\".concat(index, "([0-9]+)")));
+      var $ = getCurrencyRegex(index).exec(returnExpr);
       if ($) {
         returnExpr = returnExpr.replace($[0], (0, _convertCurrency.convertCurrency)($[0], rates));
       }
@@ -96,7 +106,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 = /\((-?\d+(?:\.\d+)?)([*+/-])(-?\d+(?:\.\d+)?)\)/.exec(expr);
   if (match) {
     return expr.replace(match[0], calculatorCore(match[0].replaceAll(/\(|\)/g, "")));
   }
@@ -110,7 +120,7 @@ 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 = /(.*?)(-?\d+(?:\.\d+)?)([*^])(-?\d+(?:\.\d+)?)$/.exec(expr);
   if (match) {
     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);
@@ -119,7 +129,7 @@ var resolveMulExp = function resolveMulExp(expr) {
 };
 var resolveDiv = function resolveDiv(expr) {
   // Logic for division
-  var match = expr.match(/(-?\d+(?:\.\d+)?)\/(-?\d+(?:\.\d+)?)/);
+  var match = /(-?\d+(?:\.\d+)?)\/(-?\d+(?:\.\d+)?)/.exec(expr);
   if (match) {
     var result = (0, _division.division)(Number(match[1]), Number(match[2]));
     return expr.replace(match[0], String(result));
@@ -131,7 +141,7 @@ 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 = /(-?\d+(?:\.\d+)?)(\+|-)(-?\d+(?:\.\d+)?)/.exec(expr);
   if (match) {
     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));

package/module/es5/Math/gcd.js

@@ -62,8 +62,11 @@ var _gcdInteger = function gcdInteger(x, y) {
   var copyZ = z.map(function (element) {
     return Math.abs(Math.round(element));
   });
-  if (copyX === 0 || copyY === 0) {
-    return 0;
+  if (copyX === 0) {
+    return copyY;
+  }
+  if (copyY === 0) {
+    return copyX;
   }
   /* Euclidean algorithm */
   var _ref = [Math.max(copyX, copyY), Math.min(copyX, copyY)];

package/module/es5/Math/mathConverter.js

@@ -24,7 +24,7 @@ function _arrayWithHoles(r) { if (Array.isArray(r)) return r; }
 var _mathConverter = exports.mathConverter = function mathConverter(equation) {
   var convertedEquation = equation;
   while (true) {
-    var multiplicationOrExponentiation = convertedEquation.match(/\d+\.?(\d+)?(\*|\^)\d+\.?(\d+)?/);
+    var multiplicationOrExponentiation = /\d+\.?(\d+)?(\*|\^)\d+\.?(\d+)?/.exec(convertedEquation);
     if (!multiplicationOrExponentiation) {
       return convertedEquation;
     }

package/module/es5/Math/mode.js

@@ -33,8 +33,9 @@ var mode = exports.mode = function mode(array) {
     _step;
   try {
     for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var _frequency$get;
       var value = _step.value;
-      var count = (frequency.get(value) || 0) + 1;
+      var count = ((_frequency$get = frequency.get(value)) !== null && _frequency$get !== void 0 ? _frequency$get : 0) + 1;
       frequency.set(value, count);
       maxFrequency = Math.max(maxFrequency, count);
     }

package/module/es5/Math/nCr.js

@@ -16,9 +16,12 @@ var _nPr = require("./nPr");
  * where the order doesn't matter. Uses the formula nCr = nPr / r!
  */
 var nCr = exports.nCr = function nCr(n, r) {
-  if (n === 0 || r === 0 || n < r) {
+  if (n < r || n < 0 || r < 0) {
     return Number.NaN;
   }
+  if (r === 0 || n === r) {
+    return 1;
+  }
   var numerator = (0, _nPr.nPr)(n, r);
   var denominator = 1;
   for (var index = 2; index <= r; index++) {

package/module/es5/Math/nPr.js

@@ -15,9 +15,12 @@ exports.nPr = void 0;
  * nPr = n * (n-1) * (n-2) * ... * (n-r+1)
  */
 var nPr = exports.nPr = function nPr(n, r) {
-  if (n === 0 || r === 0 || n < r) {
+  if (n < r || n < 0 || r < 0) {
     return Number.NaN;
   }
+  if (r === 0) {
+    return 1;
+  }
   var result = 1;
   for (var index = 0; index < r; index++) {
     result *= n - index;

package/module/es5/Math/primeFactorization.js

@@ -17,7 +17,7 @@ var primeFactorization = exports.primeFactorization = function primeFactorizatio
   var n = 0;
   var copyX = x;
   var out = [];
-  for (var index = 2; index <= copyX; index++) {
+  for (var index = 2; index * index <= copyX; index++) {
     if (copyX % index === 0) {
       n = 0;
       while (copyX % index === 0) {
@@ -30,5 +30,12 @@ var primeFactorization = exports.primeFactorization = function primeFactorizatio
       });
     }
   }
+  // If remaining value is greater than 1, it's a prime factor
+  if (copyX > 1) {
+    out.push({
+      number: copyX,
+      count: 1
+    });
+  }
   return out;
 };

package/module/es5/Math/reduce.js

@@ -18,12 +18,19 @@ var _gcd = require("./gcd");
  * - gcd: greatest common divisor used for reduction
  */
 var reduce = exports.reduce = function reduce(x, y) {
-  if (x === 0 || y === 0) {
+  if (y === 0) {
     return {
       x: Number.NaN,
       y: Number.NaN
     };
   }
+  if (x === 0) {
+    return {
+      x: 0,
+      y: 1,
+      gcd: Math.abs(y)
+    };
+  }
   var gcdValue = (0, _gcd.gcd)(Math.abs(x), Math.abs(y));
   var sign = y < 0 ? -1 : 1;
   return {

package/module/es5/Math/uuidv7.js

@@ -4,7 +4,6 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.uuidv7 = void 0;
-var _random = require("./random");
 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; } }
@@ -28,23 +27,23 @@ function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length)
 var uuidv7 = exports.uuidv7 = function uuidv7() {
   var DIGITS = "0123456789abcdef";
   var unixTsMs = Date.now();
-  var randA = (0, _random.random)(0xfff);
-  var randBHi = (0, _random.random)(0x3fffffff);
-  var randBLo = (0, _random.random)(0xffffffff);
   var bytes = new Uint8Array(16);
   for (var index = 0; index < 6; index++) {
     bytes[index] = unixTsMs >>> (5 - index) * 8 & 0xff;
   }
-  bytes[6] = 0x70 | randA >>> 8;
-  bytes[7] = randA & 0xff;
-  bytes[8] = 0x80 | randBHi >>> 24;
-  bytes[9] = randBHi >>> 16 & 0xff;
-  bytes[10] = randBHi >>> 8 & 0xff;
-  bytes[11] = randBHi & 0xff;
-  bytes[12] = randBLo >>> 24 & 0xff;
-  bytes[13] = randBLo >>> 16 & 0xff;
-  bytes[14] = randBLo >>> 8 & 0xff;
-  bytes[15] = randBLo & 0xff;
+
+  // Generate 10 random bytes for the rest
+  var randomBytes = new Uint8Array(10);
+  globalThis.crypto.getRandomValues(randomBytes);
+
+  // Version 7 (0x70) + 4 bits from randomBytes[0]
+  bytes[6] = 0x70 | randomBytes[0] & 0x0f;
+  // Random byte
+  bytes[7] = randomBytes[1];
+  // Variant 2 (0x80) + 6 bits from randomBytes[2]
+  bytes[8] = 0x80 | randomBytes[2] & 0x3f;
+  // Remaining random bytes
+  bytes.set(randomBytes.subarray(3), 9);
   var uuid = "";
   var _iterator = _createForOfIteratorHelper(bytes.entries()),
     _step;

package/module/es5/Object/omit.js

@@ -23,6 +23,7 @@ var omit = exports.omit = function omit(object) {
   }
   for (var _i = 0, _keys = keys; _i < _keys.length; _i++) {
     var key = _keys[_i];
+    // eslint-disable-next-line @typescript-eslint/no-dynamic-delete
     delete result[key];
   }
   return result;

package/module/es5/Object/pickDeep.js

@@ -57,7 +57,8 @@ var pickDeep = exports.pickDeep = function pickDeep(object) {
           if (index === parts.length - 1) {
             target[part] = current[part];
           } else {
-            target[part] = target[part] || {};
+            var _target$part;
+            target[part] = (_target$part = target[part]) !== null && _target$part !== void 0 ? _target$part : {};
             current = current[part];
             target = target[part];
           }

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

@@ -39,7 +39,7 @@ function _arrayWithHoles(r) { if (Array.isArray(r)) return r; }
  * applyFormatter("test", "invalid!@#", {}) // → "test"
  */
 function applyFormatter(value, formatterString, formatters) {
-  var match = formatterString.match(/^(\w+)(?:\(([^)]*)\))?$/);
+  var match = /^(\w+)(?:\(([^)]*)\))?$/.exec(formatterString);
   if (!match) {
     return String(value);
   }

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

@@ -46,7 +46,7 @@ function getValue(object, path) {
   try {
     for (_iterator.s(); !(_step = _iterator.n()).done;) {
       var part = _step.value;
-      var arrayMatch = part.match(/^(.+?)\[(-?\d+)\]$/);
+      var arrayMatch = /^(.+?)\[(-?\d+)\]$/.exec(part);
       if (arrayMatch) {
         var _arrayMatch = _slicedToArray(arrayMatch, 3),
           key = _arrayMatch[1],

package/module/es5/String/fromBase64.js

@@ -4,6 +4,7 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.fromBase64 = void 0;
+var _unwrap = require("@/Tool/unwrap");
 /**
  * Converts Base64 to string
  * @param {string} base64String - Base64 encoded string
@@ -16,7 +17,7 @@ var fromBase64 = exports.fromBase64 = function fromBase64(base64String) {
   }
   try {
     return new TextDecoder().decode(Uint8Array.from(atob(base64String).split("").map(function (c) {
-      return c.codePointAt(0);
+      return (0, _unwrap.unwrap)(c.codePointAt(0), "panic: invalid base64 string");
     })));
   } catch (_unused) {
     throw new Error("Invalid Base64 string");

package/module/es5/String/fuzzySearch.d.ts

@@ -8,7 +8,7 @@
  * fuzzySearch("hello", ["hello", "world", "helo", "help"]);
  * // [{ item: "hello", score: 1 }, { item: "helo", score: 0.8 }, { item: "help", score: 0.6 }]
  */
-export declare const fuzzySearch: (query: string, items: string[], threshold?: number) => Array<{
+export declare const fuzzySearch: (query: string, items: string[], threshold?: number) => {
     item: string;
     score: number;
-}>;
+}[];

package/module/es5/String/levenshteinDistance.d.ts

@@ -1,8 +1,8 @@
 /**
  * Calculates the Levenshtein distance between two strings
  * Returns the minimum number of single-character edits (insertions, deletions, or substitutions)
- * @param str1 - First string to compare
- * @param str2 - Second string to compare
+ * @param string1 - First string to compare
+ * @param string2 - Second string to compare
  * @returns The Levenshtein distance
  */
 export declare const levenshteinDistance: (string1: string, string2: string) => number;

package/module/es5/String/levenshteinDistance.js

@@ -7,15 +7,16 @@ exports.levenshteinDistance = void 0;
 /**
  * Calculates the Levenshtein distance between two strings
  * Returns the minimum number of single-character edits (insertions, deletions, or substitutions)
- * @param str1 - First string to compare
- * @param str2 - Second string to compare
+ * @param string1 - First string to compare
+ * @param string2 - Second string to compare
  * @returns The Levenshtein distance
  */
-var levenshteinDistance = exports.levenshteinDistance = function levenshteinDistance(string1, string2) {
+var _levenshteinDistance = exports.levenshteinDistance = function levenshteinDistance(string1, string2) {
+  if (string1 === string2) {
+    return 0;
+  }
   var length1 = string1.length;
   var length2 = string2.length;
-
-  // Return the length of the other string if one is empty
   if (length1 === 0) {
     return length2;
   }
@@ -23,36 +24,38 @@ var levenshteinDistance = exports.levenshteinDistance = function levenshteinDist
     return length1;
   }
 
-  // Create a 2D array for dynamic programming
-  var matrix = Array.from({
-    length: length1 + 1
-  }, function () {
-    return Array.from({
-      length: length2 + 1
-    }, function () {
-      return 0;
-    });
-  });
+  // Ensure string1 is the shorter string to minimize space complexity to O(min(N, M))
+  if (length1 > length2) {
+    return _levenshteinDistance(string2, string1);
+  }
+
+  // Create a single row array to store distances
+  // We only need the current row and the previous diagonal value
+  // eslint-disable-next-line unicorn/no-new-array
+  var row = new Array(length1 + 1);
 
-  // Initialize first column and row
+  // Initialize first row (0 to length1)
   for (var index = 0; index <= length1; index++) {
-    matrix[index][0] = index;
-  }
-  for (var _index = 0; _index <= length2; _index++) {
-    matrix[0][_index] = _index;
+    row[index] = index;
   }
 
-  // Calculate distances
-  for (var _index2 = 1; _index2 <= length1; _index2++) {
-    for (var index_ = 1; index_ <= length2; index_++) {
-      var cost = string1[_index2 - 1] === string2[index_ - 1] ? 0 : 1;
-      matrix[_index2][index_] = Math.min(matrix[_index2 - 1][index_] + 1,
-      // deletion
-      matrix[_index2][index_ - 1] + 1,
-      // insertion
-      matrix[_index2 - 1][index_ - 1] + cost // substitution
+  // Iterate through each character of string2
+  for (var _index = 1; _index <= length2; _index++) {
+    var previousDiagonal = row[0]; // Stores the value of matrix[i-1][j-1]
+    row[0] = _index; // Update first element for the new row (matrix[0][j])
+
+    var char2 = string2[_index - 1];
+    for (var _index2 = 1; _index2 <= length1; _index2++) {
+      var temporary = row[_index2]; // Store current value to become prevDiagonal for next iteration
+      var cost = string1[_index2 - 1] === char2 ? 0 : 1;
+      row[_index2] = Math.min(row[_index2] + 1,
+      // deletion (value from previous row, same column)
+      row[_index2 - 1] + 1,
+      // insertion (value from current row, previous column)
+      previousDiagonal + cost // substitution (value from previous row, previous column)
       );
+      previousDiagonal = temporary;
     }
   }
-  return matrix[length1][length2];
+  return row[length1];
 };

package/module/es5/String/padStart.d.ts

@@ -5,7 +5,6 @@
  * @param {number} targetLength - The target length after padding
  * @param {string} padString - The string to use for padding
  * @returns {string} The padded string
- * @throws {Error} If padString is empty
  * @example
  * ```typescript
  * padStart("123", 5, "0");     // Returns: "00123"

package/module/es5/String/padStart.js

@@ -11,7 +11,6 @@ exports.padStart = void 0;
  * @param {number} targetLength - The target length after padding
  * @param {string} padString - The string to use for padding
  * @returns {string} The padded string
- * @throws {Error} If padString is empty
  * @example
  * ```typescript
  * padStart("123", 5, "0");     // Returns: "00123"
@@ -19,12 +18,8 @@ exports.padStart = void 0;
  * ```
  */
 var padStart = exports.padStart = function padStart(string_, targetLength, padString) {
-  if (padString === "") {
-    throw new Error("padString cannot be empty");
-  }
-
-  // Return original string if it's longer than target length
-  if (string_.length >= targetLength) {
+  // Return original string if padString is empty or string is already long enough
+  if (padString === "" || string_.length >= targetLength) {
     return string_;
   }
   var padding = "";

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

@@ -1,3 +1,4 @@
 export * from "./createPipeline";
 export * from "./parseJson";
 export * from "./pipe";
+export * from "./unwrap";

package/module/es5/Tool/index.js

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

package/module/es5/Tool/unwrap.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Unwraps a value that may be undefined or null, throwing an error if the value is absent
+ * @template T The type of the value to unwrap
+ * @param value The value to unwrap (may be undefined or null)
+ * @param message The error message to throw if the value is absent
+ * @returns The unwrapped value of type T
+ * @throws {Error} If the value is undefined or null
+ */
+export declare const unwrap: <T>(value: T | undefined | null, message: string) => T;