umt 2.14.0 → 2.16.0

package/module/es5/Object/merge.js

@@ -9,10 +9,28 @@ exports.merge = void 0;
  * @param target - The target object to merge into
  * @param sources - The source objects to merge from
  * @returns The merged object
+ *
+ * @remarks
+ * **Prototype pollution warning:** This function does not filter out
+ * prototype-polluting keys (`__proto__`, `constructor`, `prototype`).
+ * If processing user-controlled input, sanitize with the appropriate
+ * `removePrototype*` helper before calling this function:
+ * - `removePrototype` — shallow sanitization of a single object
+ * - `removePrototypeDeep` — recursive sanitization of a single object (for deeply nested data)
+ * - `removePrototypeMap` — shallow sanitization of an array of objects
+ * - `removePrototypeMapDeep` — recursive sanitization of an array of objects (for deeply nested data)
  */
 var merge = exports.merge = function merge(target) {
+  var result = {};
   for (var _len = arguments.length, sources = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
     sources[_key - 1] = arguments[_key];
   }
-  return Object.assign.apply(Object, [{}, target].concat(sources));
+  for (var _i = 0, _arr = [target].concat(sources); _i < _arr.length; _i++) {
+    var object = _arr[_i];
+    for (var _i2 = 0, _Object$keys = Object.keys(object); _i2 < _Object$keys.length; _i2++) {
+      var key = _Object$keys[_i2];
+      result[key] = object[key];
+    }
+  }
+  return result;
 };

package/module/es5/Object/mergeDeep.d.ts

@@ -4,5 +4,15 @@ import type { UnionToIntersection } from "../types/logic/unionToIntersection";
  * @param target - The target object to merge into
  * @param sources - The source objects to merge from
  * @returns The deeply merged object
+ *
+ * @remarks
+ * **Prototype pollution warning:** This function does not filter out
+ * prototype-polluting keys (`__proto__`, `constructor`, `prototype`).
+ * If processing user-controlled input, sanitize with the appropriate
+ * `removePrototype*` helper before calling this function:
+ * - `removePrototype` — shallow sanitization of a single object
+ * - `removePrototypeDeep` — recursive sanitization of a single object (for deeply nested data)
+ * - `removePrototypeMap` — shallow sanitization of an array of objects
+ * - `removePrototypeMapDeep` — recursive sanitization of an array of objects (for deeply nested data)
  */
 export declare const mergeDeep: <T extends Record<string, unknown>, U extends Record<string, unknown>[]>(target: T, ...sources: U) => T & UnionToIntersection<U[number]>;

package/module/es5/Object/mergeDeep.js

@@ -11,33 +11,49 @@ function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t =
 function _defineProperty(e, r, t) { return (r = _toPropertyKey(r)) in e ? Object.defineProperty(e, r, { value: t, enumerable: !0, configurable: !0, writable: !0 }) : e[r] = t, e; }
 function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : i + ""; }
 function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
-/**
- * Deeply merges multiple objects into a single object
- * @param target - The target object to merge into
- * @param sources - The source objects to merge from
- * @returns The deeply merged object
- */
-var _mergeDeep = exports.mergeDeep = function mergeDeep(target) {
-  for (var _len = arguments.length, sources = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
-    sources[_key - 1] = arguments[_key];
-  }
-  if (sources.length === 0) {
+// Performance: use an index parameter instead of Array.shift() to advance
+// through sources. shift() is O(n) because it re-indexes every remaining
+// element, making the overall merge O(n²) in the number of sources.
+// An index makes each step O(1) and avoids mutating the sources array.
+var _mergeDeepInternal = function mergeDeepInternal(target, sources, depth) {
+  var sourceIndex = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 0;
+  if (sourceIndex >= sources.length) {
     return target;
   }
-  var source = sources.shift();
+  var source = sources[sourceIndex];
   if ((0, _isPlainObject.isPlainObject)(target) && (0, _isPlainObject.isPlainObject)(source)) {
     var result = _objectSpread({}, target);
     for (var key in source) {
-      if (key === "__proto__" || key === "constructor" || key === "prototype") {
-        continue;
-      }
       if (Object.hasOwn(source, key)) {
         var sourceValue = source[key];
         var targetValue = result[key];
-        result[key] = (0, _isPlainObject.isPlainObject)(targetValue) && (0, _isPlainObject.isPlainObject)(sourceValue) ? _mergeDeep(targetValue, sourceValue) : sourceValue;
+        result[key] = (0, _isPlainObject.isPlainObject)(targetValue) && (0, _isPlainObject.isPlainObject)(sourceValue) ? _mergeDeepInternal(targetValue, [sourceValue], depth + 1) : sourceValue;
       }
     }
-    return _mergeDeep.apply(void 0, [result].concat(sources));
+    return _mergeDeepInternal(result, sources, depth + 1, sourceIndex + 1);
+  }
+  return _mergeDeepInternal(source, sources, depth + 1, sourceIndex + 1);
+};
+
+/**
+ * Deeply merges multiple objects into a single object
+ * @param target - The target object to merge into
+ * @param sources - The source objects to merge from
+ * @returns The deeply merged object
+ *
+ * @remarks
+ * **Prototype pollution warning:** This function does not filter out
+ * prototype-polluting keys (`__proto__`, `constructor`, `prototype`).
+ * If processing user-controlled input, sanitize with the appropriate
+ * `removePrototype*` helper before calling this function:
+ * - `removePrototype` — shallow sanitization of a single object
+ * - `removePrototypeDeep` — recursive sanitization of a single object (for deeply nested data)
+ * - `removePrototypeMap` — shallow sanitization of an array of objects
+ * - `removePrototypeMapDeep` — recursive sanitization of an array of objects (for deeply nested data)
+ */
+var mergeDeep = exports.mergeDeep = function mergeDeep(target) {
+  for (var _len = arguments.length, sources = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+    sources[_key - 1] = arguments[_key];
   }
-  return _mergeDeep.apply(void 0, [source].concat(sources));
+  return _mergeDeepInternal(target, sources, 0);
 };

package/module/es5/Object/pick.d.ts

@@ -7,6 +7,16 @@
  * @param {...K[]} keys - The property keys to extract.
  * @returns {Pick<T, K>} A new object containing only the specified properties.
  *
+ * @remarks
+ * **Prototype pollution warning:** This function does not filter out
+ * prototype-polluting keys (`__proto__`, `constructor`, `prototype`).
+ * If processing user-controlled input, sanitize with the appropriate
+ * `removePrototype*` helper before calling this function:
+ * - `removePrototype` — shallow sanitization of a single object
+ * - `removePrototypeDeep` — recursive sanitization of a single object (for deeply nested data)
+ * - `removePrototypeMap` — shallow sanitization of an array of objects
+ * - `removePrototypeMapDeep` — recursive sanitization of an array of objects (for deeply nested data)
+ *
  * @example
  * ```typescript
  * const user = { id: 1, name: 'Alice', age: 30 };

package/module/es5/Object/pick.js

@@ -13,6 +13,16 @@ exports.pick = void 0;
  * @param {...K[]} keys - The property keys to extract.
  * @returns {Pick<T, K>} A new object containing only the specified properties.
  *
+ * @remarks
+ * **Prototype pollution warning:** This function does not filter out
+ * prototype-polluting keys (`__proto__`, `constructor`, `prototype`).
+ * If processing user-controlled input, sanitize with the appropriate
+ * `removePrototype*` helper before calling this function:
+ * - `removePrototype` — shallow sanitization of a single object
+ * - `removePrototypeDeep` — recursive sanitization of a single object (for deeply nested data)
+ * - `removePrototypeMap` — shallow sanitization of an array of objects
+ * - `removePrototypeMapDeep` — recursive sanitization of an array of objects (for deeply nested data)
+ *
  * @example
  * ```typescript
  * const user = { id: 1, name: 'Alice', age: 30 };

package/module/es5/Object/pickDeep.d.ts

@@ -9,6 +9,16 @@ import type { PickDeepKey } from "../types/object/pickDeepKey";
  * @param {...K[]} keys - Property keys to extract. Can use dot notation for nested properties.
  * @returns {PickDeep<T, K>} A new object containing only the specified properties.
  *
+ * @remarks
+ * **Prototype pollution warning:** This function does not filter out
+ * prototype-polluting keys (`__proto__`, `constructor`, `prototype`).
+ * If processing user-controlled input, sanitize with the appropriate
+ * `removePrototype*` helper before calling this function:
+ * - `removePrototype` — shallow sanitization of a single object
+ * - `removePrototypeDeep` — recursive sanitization of a single object (for deeply nested data)
+ * - `removePrototypeMap` — shallow sanitization of an array of objects
+ * - `removePrototypeMapDeep` — recursive sanitization of an array of objects (for deeply nested data)
+ *
  * @example
  * ```typescript
  * const obj = { a: { b: { c: 1, d: 2 }, e: 3 }, f: 4 };

package/module/es5/Object/pickDeep.js

@@ -21,6 +21,16 @@ function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length)
  * @param {...K[]} keys - Property keys to extract. Can use dot notation for nested properties.
  * @returns {PickDeep<T, K>} A new object containing only the specified properties.
  *
+ * @remarks
+ * **Prototype pollution warning:** This function does not filter out
+ * prototype-polluting keys (`__proto__`, `constructor`, `prototype`).
+ * If processing user-controlled input, sanitize with the appropriate
+ * `removePrototype*` helper before calling this function:
+ * - `removePrototype` — shallow sanitization of a single object
+ * - `removePrototypeDeep` — recursive sanitization of a single object (for deeply nested data)
+ * - `removePrototypeMap` — shallow sanitization of an array of objects
+ * - `removePrototypeMapDeep` — recursive sanitization of an array of objects (for deeply nested data)
+ *
  * @example
  * ```typescript
  * const obj = { a: { b: { c: 1, d: 2 }, e: 3 }, f: 4 };
@@ -48,9 +58,6 @@ var pickDeep = exports.pickDeep = function pickDeep(object) {
         var _step$value = _slicedToArray(_step.value, 2),
           index = _step$value[0],
           part = _step$value[1];
-        if (part === "__proto__" || part === "constructor" || part === "prototype") {
-          continue;
-        }
         if (current && _typeof(current) === "object" && part in current) {
           if (index === parts.length - 1) {
             target[part] = current[part];

package/module/es5/Object/removePrototype.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Creates a new object with the same properties as the given object, but with the prototype polluting properties removed.
+ * ("__proto__", "constructor", "prototype" are excluded from the shallow copy)
+ *
+ * @param object - The object to remove the prototype polluting properties from.
+ * @returns A new object with the prototype polluting properties removed.
+ *
+ * @example
+ * ```typescript
+ * const obj = JSON.parse('{"__proto__":{"polluted":true},"a":1,"b":2}');
+ * const safeObj = removePrototype(obj);
+ * // safeObj is { a: 1, b: 2 } and "__proto__" is removed
+ * ```
+ */
+export declare const removePrototype: <T extends Record<string, unknown>>(object: T) => Omit<T, "__proto__" | "constructor" | "prototype">;

package/module/es5/Object/removePrototype.js

@@ -0,0 +1,31 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.removePrototype = void 0;
+/**
+ * Creates a new object with the same properties as the given object, but with the prototype polluting properties removed.
+ * ("__proto__", "constructor", "prototype" are excluded from the shallow copy)
+ *
+ * @param object - The object to remove the prototype polluting properties from.
+ * @returns A new object with the prototype polluting properties removed.
+ *
+ * @example
+ * ```typescript
+ * const obj = JSON.parse('{"__proto__":{"polluted":true},"a":1,"b":2}');
+ * const safeObj = removePrototype(obj);
+ * // safeObj is { a: 1, b: 2 } and "__proto__" is removed
+ * ```
+ */
+var removePrototype = exports.removePrototype = function removePrototype(object) {
+  var result = Object.create(null);
+  var keys = Object.keys(object);
+  for (var _i = 0, _keys = keys; _i < _keys.length; _i++) {
+    var key = _keys[_i];
+    if (key !== "__proto__" && key !== "constructor" && key !== "prototype") {
+      result[key] = object[key];
+    }
+  }
+  return result;
+};

package/module/es5/Object/removePrototypeDeep.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Creates a new object with the same properties as the given object, but with
+ * the prototype polluting properties removed recursively.
+ * ("__proto__", "constructor", "prototype" are excluded from nested objects
+ * and objects inside arrays)
+ *
+ * @param object - The object to remove the prototype polluting properties from.
+ * @returns A new object with the prototype polluting properties removed
+ * recursively.
+ */
+export declare const removePrototypeDeep: <T extends Record<string, unknown>>(object: T) => T;

package/module/es5/Object/removePrototypeDeep.js

@@ -0,0 +1,81 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.removePrototypeDeep = void 0;
+var _isPlainObject = require("../Object/isPlainObject");
+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 _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 _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; }
+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; }
+/**
+ * Creates a new object with the same properties as the given object, but with
+ * the prototype polluting properties removed recursively.
+ * ("__proto__", "constructor", "prototype" are excluded from nested objects
+ * and objects inside arrays)
+ *
+ * @param object - The object to remove the prototype polluting properties from.
+ * @returns A new object with the prototype polluting properties removed
+ * recursively.
+ */
+var removePrototypeDeep = exports.removePrototypeDeep = function removePrototypeDeep(object) {
+  var result = Object.create(null);
+  var stack = [[object, result]];
+  while (stack.length > 0) {
+    // biome-ignore lint/style/noNonNullAssertion: stack.length > 0 guarantees pop() returns a value
+    var _ref = stack.pop(),
+      _ref2 = _slicedToArray(_ref, 2),
+      source = _ref2[0],
+      destination = _ref2[1];
+    if (Array.isArray(source)) {
+      var array = destination;
+      var _iterator = _createForOfIteratorHelper(source),
+        _step;
+      try {
+        for (_iterator.s(); !(_step = _iterator.n()).done;) {
+          var value = _step.value;
+          if (Array.isArray(value)) {
+            var child = [];
+            array.push(child);
+            stack.push([value, child]);
+          } else if ((0, _isPlainObject.isPlainObject)(value)) {
+            var _child = Object.create(null);
+            array.push(_child);
+            stack.push([value, _child]);
+          } else {
+            array.push(value);
+          }
+        }
+      } catch (err) {
+        _iterator.e(err);
+      } finally {
+        _iterator.f();
+      }
+      continue;
+    }
+    var target = destination;
+    for (var _i = 0, _Object$keys = Object.keys(source); _i < _Object$keys.length; _i++) {
+      var key = _Object$keys[_i];
+      if (key === "__proto__" || key === "constructor" || key === "prototype") {
+        continue;
+      }
+      var _value = source[key];
+      if (Array.isArray(_value)) {
+        var _child2 = [];
+        target[key] = _child2;
+        stack.push([_value, _child2]);
+      } else if ((0, _isPlainObject.isPlainObject)(_value)) {
+        var _child3 = Object.create(null);
+        target[key] = _child3;
+        stack.push([_value, _child3]);
+      } else {
+        target[key] = _value;
+      }
+    }
+  }
+  return result;
+};

package/module/es5/Object/removePrototypeMap.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Creates a new array of objects with prototype polluting properties removed
+ * from each item.
+ *
+ * @param objects - The objects to remove the prototype polluting properties
+ * from.
+ * @returns A new array with shallowly sanitized objects.
+ */
+export declare const removePrototypeMap: <T extends Record<string, unknown>>(objects: readonly T[]) => Omit<T, "__proto__" | "constructor" | "prototype">[];

package/module/es5/Object/removePrototypeMap.js

@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.removePrototypeMap = void 0;
+var _removePrototype = require("../Object/removePrototype");
+/**
+ * Creates a new array of objects with prototype polluting properties removed
+ * from each item.
+ *
+ * @param objects - The objects to remove the prototype polluting properties
+ * from.
+ * @returns A new array with shallowly sanitized objects.
+ */
+var removePrototypeMap = exports.removePrototypeMap = function removePrototypeMap(objects) {
+  return objects.map(function (object) {
+    return (0, _removePrototype.removePrototype)(object);
+  });
+};

package/module/es5/Object/removePrototypeMapDeep.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Creates a new array of objects with prototype polluting properties removed
+ * recursively from each item.
+ *
+ * @param objects - The objects to remove the prototype polluting properties
+ * from recursively.
+ * @returns A new array with deeply sanitized objects.
+ */
+export declare const removePrototypeMapDeep: <T extends Record<string, unknown>>(objects: readonly T[]) => T[];

package/module/es5/Object/removePrototypeMapDeep.js

@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.removePrototypeMapDeep = void 0;
+var _removePrototypeDeep = require("../Object/removePrototypeDeep");
+/**
+ * Creates a new array of objects with prototype polluting properties removed
+ * recursively from each item.
+ *
+ * @param objects - The objects to remove the prototype polluting properties
+ * from recursively.
+ * @returns A new array with deeply sanitized objects.
+ */
+var removePrototypeMapDeep = exports.removePrototypeMapDeep = function removePrototypeMapDeep(objects) {
+  return objects.map(function (object) {
+    return (0, _removePrototypeDeep.removePrototypeDeep)(object);
+  });
+};

package/module/es5/String/escapeHtml.js

@@ -5,14 +5,23 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.escapeHtml = void 0;
 /**
- * HTML entities map for escaping
+ * HTML entities map for escaping.
+ *
+ * Security: The backtick (`) is included because it can be used as an HTML
+ * attribute delimiter in older browsers (e.g. IE), enabling XSS via
+ * constructs like <img src=`javascript:alert(1)`>. The forward slash (/)
+ * is included per OWASP XSS prevention recommendations to mitigate tag-
+ * closing injection (e.g. "</script>") when user input is embedded inside
+ * HTML elements.
  */
 var htmlEscapeMap = {
   "&": "&amp;",
   "<": "&lt;",
   ">": "&gt;",
   '"': "&quot;",
-  "'": "&#39;"
+  "'": "&#39;",
+  "`": "&#x60;",
+  "/": "&#x2F;"
 };
 
 /**
@@ -21,7 +30,7 @@ var htmlEscapeMap = {
  * @returns The escaped string
  */
 var escapeHtml = exports.escapeHtml = function escapeHtml(string_) {
-  return string_.replaceAll(/["&'<>]/g, function (match) {
+  return string_.replaceAll(/["&'/<>`]/g, function (match) {
     return htmlEscapeMap[match];
   });
 };

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

@@ -61,7 +61,7 @@ function applyFormatter(value, formatterString, formatters) {
  */
 function parseArguments(argumentsString) {
   var arguments_ = [];
-  var current = "";
+  var chars = [];
   var inQuotes = false;
   var quoteChar = "";
   var _iterator = _createForOfIteratorHelper(argumentsString),
@@ -80,12 +80,12 @@ function parseArguments(argumentsString) {
         continue;
       }
       if (!inQuotes && _char === ",") {
-        var _trimmed = current.trim();
+        var _trimmed = chars.join("").trim();
         arguments_.push(_trimmed === "" ? " " : _trimmed);
-        current = "";
+        chars.length = 0;
         continue;
       }
-      current += _char;
+      chars.push(_char);
     }
 
     // Handle last argument
@@ -94,7 +94,7 @@ function parseArguments(argumentsString) {
   } finally {
     _iterator.f();
   }
-  var trimmed = current.trim();
+  var trimmed = chars.join("").trim();
   arguments_.push(trimmed === "" ? " " : trimmed);
   return arguments_;
 }

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

@@ -12,6 +12,9 @@ function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" ==
 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; }
+// Pre-compiled regex pattern for array index notation to avoid recompilation per path segment
+var ARRAY_INDEX_PATTERN = /^(.+?)\[(-?\d+)]$/;
+
 /**
  * Retrieves a value from an object using a dot-notation path with array index support.
  *
@@ -46,7 +49,7 @@ function getValue(object, path) {
   try {
     for (_iterator.s(); !(_step = _iterator.n()).done;) {
       var part = _step.value;
-      var arrayMatch = /^(.+?)\[(-?\d+)]$/.exec(part);
+      var arrayMatch = ARRAY_INDEX_PATTERN.exec(part);
       if (arrayMatch) {
         var _arrayMatch = _slicedToArray(arrayMatch, 3),
           key = _arrayMatch[1],

package/module/es5/String/levenshteinDistance.js

@@ -11,52 +11,67 @@ exports.levenshteinDistance = void 0;
  * @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;
-  if (length1 === 0) {
-    return length2;
+  var _short = string1;
+  var _long = string2;
+  var shortLength = _short.length;
+  var longLength = _long.length;
+  if (shortLength === 0) {
+    return longLength;
   }
-  if (length2 === 0) {
-    return length1;
+  if (longLength === 0) {
+    return shortLength;
   }
 
-  // Ensure string1 is the shorter string to minimize space complexity to O(min(N, M))
-  if (length1 > length2) {
-    return _levenshteinDistance(string2, string1);
+  // Ensure short is the shorter string to minimize space complexity to O(min(N, M))
+  if (shortLength > longLength) {
+    _short = string2;
+    _long = string1;
+    shortLength = _short.length;
+    longLength = _long.length;
   }
 
   // Create a single row array to store distances
   // We only need the current row and the previous diagonal value
   var row = Array.from({
-    length: length1 + 1
+    length: shortLength + 1
   });
 
-  // Initialize first row (0 to length1)
-  for (var index = 0; index <= length1; index++) {
+  // Initialize first row (0 to shortLength)
+  for (var index = 0; index <= shortLength; index++) {
     row[index] = index;
   }
 
-  // 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])
+  // Iterate through each character of the longer string (rows)
+  for (var rowIndex = 1; rowIndex <= longLength; rowIndex++) {
+    var previousDiagonal = row[0];
+    row[0] = rowIndex;
 
-    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)
-      );
+    // eslint-disable-next-line unicorn/prefer-code-point
+    var charCode = _long.charCodeAt(rowIndex - 1);
+    for (var colIndex = 1; colIndex <= shortLength; colIndex++) {
+      var temporary = row[colIndex];
+      // eslint-disable-next-line unicorn/prefer-code-point
+      var cost = _short.charCodeAt(colIndex - 1) === charCode ? 0 : 1;
+
+      // Inline min of three values instead of Math.min() call to avoid
+      // function-call overhead in this hot loop
+      var deletion = row[colIndex] + 1;
+      var insertion = row[colIndex - 1] + 1;
+      var substitution = previousDiagonal + cost;
+      var value = deletion;
+      if (insertion < value) {
+        value = insertion;
+      }
+      if (substitution < value) {
+        value = substitution;
+      }
+      row[colIndex] = value;
       previousDiagonal = temporary;
     }
   }
-  return row[length1];
+  return row[shortLength];
 };

package/module/es5/String/slugify.js

@@ -14,5 +14,12 @@ exports.slugify = void 0;
  * slugify("Japanese: こんにちは"); // "japanese"
  */
 var slugify = exports.slugify = function slugify(string_) {
-  return string_.normalize("NFD").replaceAll(/[\u0300-\u036F]/g, "").toLowerCase().replaceAll(/[^\s\w-]/g, "-").replaceAll(/\s+/g, "-").replaceAll(/_+/g, "-").replaceAll(/-+/g, "-").replaceAll(/^-+|-+$/g, "");
+  return string_.normalize("NFD")
+  // Strip combining diacritical marks (e.g. accents)
+  .replaceAll(/[\u0300-\u036F]/g, "").toLowerCase()
+  // Consolidate non-word chars, whitespace, and underscores into a single
+  // hyphen in one pass instead of three separate regex scans
+  .replaceAll(/[^\w-]+|_+/g, "-")
+  // Collapse consecutive hyphens and strip leading/trailing hyphens
+  .replaceAll(/-+/g, "-").replaceAll(/^-|-$/g, "");
 };

package/module/es5/String/trimEndCharacters.js

@@ -18,8 +18,10 @@ exports.trimEndCharacters = void 0;
  * ```
  */
 var trimEndCharacters = exports.trimEndCharacters = function trimEndCharacters(string_, chars) {
+  // Use Set for O(1) character lookups instead of O(m) string.includes()
+  var charSet = new Set(chars);
   var endIndex = string_.length - 1;
-  while (endIndex >= 0 && chars.includes(string_[endIndex])) {
+  while (endIndex >= 0 && charSet.has(string_[endIndex])) {
     endIndex--;
   }
   return string_.slice(0, endIndex + 1);

package/module/es5/String/trimStartCharacters.js

@@ -18,8 +18,10 @@ exports.trimStartCharacters = void 0;
  * ```
  */
 var trimStartCharacters = exports.trimStartCharacters = function trimStartCharacters(string_, chars) {
+  // Use Set for O(1) character lookups instead of O(m) string.includes()
+  var charSet = new Set(chars);
   var startIndex = 0;
-  while (startIndex < string_.length && chars.includes(string_[startIndex])) {
+  while (startIndex < string_.length && charSet.has(string_[startIndex])) {
     startIndex++;
   }
   return string_.slice(startIndex);

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

@@ -5,7 +5,7 @@
  * @example
  * ```typescript
  * unescapeHtml("<script>alert("Hello");</script>");
- * // Returns: "<script>alert("Hello");</script>"
+ * // Returns: "<script>alert(\"Hello\");</script>"
  *
  * unescapeHtml("Tom &amp; Jerry");
  * // Returns: "Tom & Jerry"