umt 2.12.2 → 2.13.0

package/module/Math/median.js

@@ -1,4 +1,4 @@
-import { quickSort } from "../Array/quickSort";
+import { ultraNumberSort } from "../Array/ultraNumberSort";
 /**
  * Calculate the median of an array of numbers
  * @param {number[]} array Array of numbers
@@ -6,7 +6,7 @@ import { quickSort } from "../Array/quickSort";
  * @example median([1, 3, 3, 6, 7, 8, 9]); // 6
  */
 export const median = (array) => {
-    const sortedArray = quickSort(array);
+    const sortedArray = ultraNumberSort(array);
     const mid = Math.floor(sortedArray.length / 2);
     return sortedArray.length % 2 === 0
         ? (sortedArray[mid - 1] + sortedArray[mid]) / 2

package/module/Math/median.js.map

@@ -1 +1 @@
-{"version":3,"file":"median.js","sourceRoot":"","sources":["../../src/Math/median.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAE9C;;;;;GAKG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,KAAe,EAAU,EAAE;IAChD,MAAM,WAAW,GAAa,SAAS,CAAC,KAAK,CAAC,CAAC;IAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE/C,OAAO,WAAW,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC;QACjC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;QAC/C,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;AACvB,CAAC,CAAC"}
+{"version":3,"file":"median.js","sourceRoot":"","sources":["../../src/Math/median.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAE1D;;;;;GAKG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,KAAe,EAAU,EAAE;IAChD,MAAM,WAAW,GAAa,eAAe,CAAC,KAAK,CAAC,CAAC;IACrD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE/C,OAAO,WAAW,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC;QACjC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;QAC/C,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;AACvB,CAAC,CAAC"}

package/module/Math/nCr.js

@@ -1,3 +1,4 @@
+import { factorial } from "./factorial";
 import { nPr } from "./nPr";
 /**
  * Calculates combinations (nCr) - number of ways to choose r items from n items
@@ -17,10 +18,7 @@ export const nCr = (n, r) => {
         return 1;
     }
     const numerator = nPr(n, r);
-    let denominator = 1;
-    for (let index = 2; index <= r; index++) {
-        denominator *= index;
-    }
+    const denominator = factorial(r);
     const result = numerator / denominator;
     return result;
 };

package/module/Math/nCr.js.map

@@ -1 +1 @@
-{"version":3,"file":"nCr.js","sourceRoot":"","sources":["../../src/Math/nCr.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,OAAO,CAAC;AAE5B;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;IAClD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5B,OAAO,MAAM,CAAC,GAAG,CAAC;IACpB,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5B,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACxC,WAAW,IAAI,KAAK,CAAC;IACvB,CAAC;IAED,MAAM,MAAM,GAAG,SAAS,GAAG,WAAW,CAAC;IAEvC,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}
+{"version":3,"file":"nCr.js","sourceRoot":"","sources":["../../src/Math/nCr.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,GAAG,EAAE,MAAM,OAAO,CAAC;AAE5B;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;IAClD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5B,OAAO,MAAM,CAAC,GAAG,CAAC;IACpB,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5B,MAAM,WAAW,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAEjC,MAAM,MAAM,GAAG,SAAS,GAAG,WAAW,CAAC;IAEvC,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}

package/module/Math/percentile.js

@@ -1,4 +1,4 @@
-import { quickSort } from "../Array/quickSort";
+import { ultraNumberSort } from "../Array/ultraNumberSort";
 /**
  * Calculate the nth percentile of values in an array
  * @param array - Array of numbers
@@ -13,10 +13,7 @@ export const percentile = (array, percentile) => {
     if (array.length === 0) {
         return Number.NaN;
     }
-    if (percentile < 0 || percentile > 100) {
-        throw new Error("Percentile must be between 0 and 100");
-    }
-    const sortedArray = quickSort([...array]);
+    const sortedArray = ultraNumberSort(array);
     const index = (percentile / 100) * (sortedArray.length - 1);
     const lowerIndex = Math.floor(index);
     const upperIndex = Math.ceil(index);

package/module/Math/percentile.js.map

@@ -1 +1 @@
-{"version":3,"file":"percentile.js","sourceRoot":"","sources":["../../src/Math/percentile.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAE9C;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAe,EAAE,UAAkB,EAAU,EAAE;IACxE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,MAAM,CAAC,GAAG,CAAC;IACpB,CAAC;IAED,IAAI,UAAU,GAAG,CAAC,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC1D,CAAC;IAED,MAAM,WAAW,GAAG,SAAS,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5D,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACrC,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAEpC,IAAI,UAAU,KAAK,UAAU,EAAE,CAAC;QAC9B,OAAO,WAAW,CAAC,UAAU,CAAC,CAAC;IACjC,CAAC;IAED,MAAM,UAAU,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,UAAU,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,MAAM,GAAG,KAAK,GAAG,UAAU,CAAC;IAElC,OAAO,UAAU,GAAG,CAAC,UAAU,GAAG,UAAU,CAAC,GAAG,MAAM,CAAC;AACzD,CAAC,CAAC"}
+{"version":3,"file":"percentile.js","sourceRoot":"","sources":["../../src/Math/percentile.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAE1D;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAe,EAAE,UAAkB,EAAU,EAAE;IACxE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,MAAM,CAAC,GAAG,CAAC;IACpB,CAAC;IAED,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5D,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACrC,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAEpC,IAAI,UAAU,KAAK,UAAU,EAAE,CAAC;QAC9B,OAAO,WAAW,CAAC,UAAU,CAAC,CAAC;IACjC,CAAC;IAED,MAAM,UAAU,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,UAAU,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,MAAM,GAAG,KAAK,GAAG,UAAU,CAAC;IAElC,OAAO,UAAU,GAAG,CAAC,UAAU,GAAG,UAAU,CAAC,GAAG,MAAM,CAAC;AACzD,CAAC,CAAC"}

package/module/Math/primeFactorization.js

@@ -8,7 +8,7 @@
  * For example, 12 = 2^2 * 3^1 is represented as [{number: 2, count: 2}, {number: 3, count: 1}]
  */
 export const primeFactorization = (x) => {
-    let n = 0;
+    let n;
     let copyX = x;
     const out = [];
     for (let index = 2; index * index <= copyX; index++) {

package/module/Math/primeFactorization.js.map

@@ -1 +1 @@
-{"version":3,"file":"primeFactorization.js","sourceRoot":"","sources":["../../src/Math/primeFactorization.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAS,EAAE,EAAE;IAC9C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,GAAG,GAAwC,EAAE,CAAC;IACpD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,IAAI,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC;QACpD,IAAI,KAAK,GAAG,KAAK,KAAK,CAAC,EAAE,CAAC;YACxB,CAAC,GAAG,CAAC,CAAC;YACN,OAAO,KAAK,GAAG,KAAK,KAAK,CAAC,EAAE,CAAC;gBAC3B,CAAC,EAAE,CAAC;gBACJ,KAAK,IAAI,KAAK,CAAC;YACjB,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IACD,4DAA4D;IAC5D,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC"}
+{"version":3,"file":"primeFactorization.js","sourceRoot":"","sources":["../../src/Math/primeFactorization.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAS,EAAE,EAAE;IAC9C,IAAI,CAAS,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,GAAG,GAAwC,EAAE,CAAC;IACpD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,IAAI,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC;QACpD,IAAI,KAAK,GAAG,KAAK,KAAK,CAAC,EAAE,CAAC;YACxB,CAAC,GAAG,CAAC,CAAC;YACN,OAAO,KAAK,GAAG,KAAK,KAAK,CAAC,EAAE,CAAC;gBAC3B,CAAC,EAAE,CAAC;gBACJ,KAAK,IAAI,KAAK,CAAC;YACjB,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IACD,4DAA4D;IAC5D,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC"}

package/module/Math/sumPrecise.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Computes the sum of an array of numbers using the Neumaier
+ * summation algorithm for improved floating-point precision.
+ *
+ * @param numbers - The array of numbers to sum.
+ * @returns The precise sum of all numbers.
+ *
+ * @example
+ * ```typescript
+ * sumPrecise([0.1, 0.2, 0.3]);    // 0.6
+ * sumPrecise([1e20, 1, -1e20]);    // 1
+ * ```
+ */
+export declare const sumPrecise: (numbers: number[]) => number;

package/module/Math/sumPrecise.js

@@ -0,0 +1,27 @@
+/**
+ * Computes the sum of an array of numbers using the Neumaier
+ * summation algorithm for improved floating-point precision.
+ *
+ * @param numbers - The array of numbers to sum.
+ * @returns The precise sum of all numbers.
+ *
+ * @example
+ * ```typescript
+ * sumPrecise([0.1, 0.2, 0.3]);    // 0.6
+ * sumPrecise([1e20, 1, -1e20]);    // 1
+ * ```
+ */
+export const sumPrecise = (numbers) => {
+    let sum = 0;
+    let compensation = 0;
+    for (const number_ of numbers) {
+        const t = sum + number_;
+        compensation +=
+            Math.abs(sum) >= Math.abs(number_)
+                ? sum - t + number_
+                : number_ - t + sum;
+        sum = t;
+    }
+    return sum + compensation;
+};
+//# sourceMappingURL=sumPrecise.js.map

package/module/Math/sumPrecise.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sumPrecise.js","sourceRoot":"","sources":["../../src/Math/sumPrecise.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,OAAiB,EAAU,EAAE;IACtD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,KAAK,MAAM,OAAO,IAAI,OAAO,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,GAAG,GAAG,OAAO,CAAC;QACxB,YAAY;YACV,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC;gBAChC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,OAAO;gBACnB,CAAC,CAAC,OAAO,GAAG,CAAC,GAAG,GAAG,CAAC;QACxB,GAAG,GAAG,CAAC,CAAC;IACV,CAAC;IAED,OAAO,GAAG,GAAG,YAAY,CAAC;AAC5B,CAAC,CAAC"}

package/module/Math/uuidv7.js

@@ -14,28 +14,62 @@
 export const uuidv7 = () => {
     const DIGITS = "0123456789abcdef";
     const unixTsMs = Date.now();
+    // Create a single 16-byte buffer for the UUID
     const bytes = new Uint8Array(16);
-    for (let index = 0; index < 6; index++) {
-        bytes[index] = (unixTsMs >>> ((5 - index) * 8)) & 0xff;
-    }
-    // Generate 10 random bytes for the rest
-    const 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);
-    let uuid = "";
-    for (const [index, byte] of bytes.entries()) {
-        uuid += DIGITS[byte >>> 4] + DIGITS[byte & 0xf];
-        if (index === 3 || index === 5 || index === 7 || index === 9) {
-            uuid += "-";
-        }
-    }
-    return uuid;
+    // Fill the entire buffer with random data first.
+    // This avoids allocating a separate 10-byte buffer for randomness.
+    // We will overwrite the first 6 bytes with the timestamp.
+    globalThis.crypto.getRandomValues(bytes);
+    // Overwrite first 6 bytes with 48-bit timestamp (Big-Endian)
+    // Note: We use division for the high 16 bits because JS bitwise operators (>>>)
+    // truncate to 32 bits, which would corrupt the 48-bit timestamp.
+    bytes[0] = (unixTsMs / 0x1_00_00_00_00_00) & 0xff;
+    bytes[1] = (unixTsMs / 0x1_00_00_00_00) & 0xff;
+    bytes[2] = (unixTsMs >>> 24) & 0xff;
+    bytes[3] = (unixTsMs >>> 16) & 0xff;
+    bytes[4] = (unixTsMs >>> 8) & 0xff;
+    bytes[5] = unixTsMs & 0xff;
+    // Version 7 (0x70) + 4 bits from random data (already in bytes[6])
+    bytes[6] = 0x70 | (bytes[6] & 0x0f);
+    // Variant 2 (0x80) + 6 bits from random data (already in bytes[8])
+    bytes[8] = 0x80 | (bytes[8] & 0x3f);
+    // Convert to string (unrolled for performance)
+    // Format: 8-4-4-4-12 hex digits (xxxxxxxx-xxxx-7xxx-8xxx-xxxxxxxxxxxx)
+    return (DIGITS[bytes[0] >>> 4] +
+        DIGITS[bytes[0] & 0xf] +
+        DIGITS[bytes[1] >>> 4] +
+        DIGITS[bytes[1] & 0xf] +
+        DIGITS[bytes[2] >>> 4] +
+        DIGITS[bytes[2] & 0xf] +
+        DIGITS[bytes[3] >>> 4] +
+        DIGITS[bytes[3] & 0xf] +
+        "-" +
+        DIGITS[bytes[4] >>> 4] +
+        DIGITS[bytes[4] & 0xf] +
+        DIGITS[bytes[5] >>> 4] +
+        DIGITS[bytes[5] & 0xf] +
+        "-" +
+        DIGITS[bytes[6] >>> 4] +
+        DIGITS[bytes[6] & 0xf] +
+        DIGITS[bytes[7] >>> 4] +
+        DIGITS[bytes[7] & 0xf] +
+        "-" +
+        DIGITS[bytes[8] >>> 4] +
+        DIGITS[bytes[8] & 0xf] +
+        DIGITS[bytes[9] >>> 4] +
+        DIGITS[bytes[9] & 0xf] +
+        "-" +
+        DIGITS[bytes[10] >>> 4] +
+        DIGITS[bytes[10] & 0xf] +
+        DIGITS[bytes[11] >>> 4] +
+        DIGITS[bytes[11] & 0xf] +
+        DIGITS[bytes[12] >>> 4] +
+        DIGITS[bytes[12] & 0xf] +
+        DIGITS[bytes[13] >>> 4] +
+        DIGITS[bytes[13] & 0xf] +
+        DIGITS[bytes[14] >>> 4] +
+        DIGITS[bytes[14] & 0xf] +
+        DIGITS[bytes[15] >>> 4] +
+        DIGITS[bytes[15] & 0xf]);
 };
 //# sourceMappingURL=uuidv7.js.map

package/module/Math/uuidv7.js.map

@@ -1 +1 @@
-{"version":3,"file":"uuidv7.js","sourceRoot":"","sources":["../../src/Math/uuidv7.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,GAAW,EAAE;IACjC,MAAM,MAAM,GAAG,kBAAkB,CAAC;IAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE5B,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;IACjC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACvC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACzD,CAAC;IAED,wCAAwC;IACxC,MAAM,WAAW,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;IACvC,UAAU,CAAC,MAAM,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC;IAE/C,gDAAgD;IAChD,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IAC1C,cAAc;IACd,KAAK,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IAC1B,gDAAgD;IAChD,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IAC1C,yBAAyB;IACzB,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEtC,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5C,IAAI,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC;QAChD,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YAC7D,IAAI,IAAI,GAAG,CAAC;QACd,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC,CAAC"}
+{"version":3,"file":"uuidv7.js","sourceRoot":"","sources":["../../src/Math/uuidv7.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,GAAW,EAAE;IACjC,MAAM,MAAM,GAAG,kBAAkB,CAAC;IAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE5B,8CAA8C;IAC9C,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;IAEjC,iDAAiD;IACjD,mEAAmE;IACnE,0DAA0D;IAC1D,UAAU,CAAC,MAAM,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;IAEzC,6DAA6D;IAC7D,gFAAgF;IAChF,iEAAiE;IACjE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,GAAG,kBAAkB,CAAC,GAAG,IAAI,CAAC;IAClD,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,GAAG,eAAe,CAAC,GAAG,IAAI,CAAC;IAC/C,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IACpC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IACpC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;IACnC,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC;IAE3B,mEAAmE;IACnE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IAEpC,mEAAmE;IACnE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IAEpC,+CAA+C;IAC/C,uEAAuE;IACvE,OAAO,CACL,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,GAAG;QACH,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,GAAG;QACH,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,GAAG;QACH,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,GAAG;QACH,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CACxB,CAAC;AACJ,CAAC,CAAC"}

package/module/Number/formatNumber.d.ts

@@ -0,0 +1,42 @@
+/**
+ * Options for formatting a number.
+ */
+export interface FormatNumberOptions {
+    /** The locale to use for formatting (e.g., "en-US", "ja-JP") */
+    locale?: string;
+    /** Minimum number of fraction digits */
+    minimumFractionDigits?: number;
+    /** Maximum number of fraction digits */
+    maximumFractionDigits?: number;
+    /** The formatting style */
+    style?: "decimal" | "currency" | "percent";
+    /** The currency code (required when style is "currency") */
+    currency?: string;
+}
+/**
+ * Formats a number using Intl.NumberFormat.
+ *
+ * @param value - The number to format
+ * @param options - Formatting options
+ * @returns The formatted number string
+ *
+ * @example
+ * ```typescript
+ * formatNumber(1234567.89);
+ * // "1,234,567.89" (in en-US locale)
+ *
+ * formatNumber(1234567.89, { locale: "de-DE" });
+ * // "1.234.567,89"
+ *
+ * formatNumber(0.75, { style: "percent" });
+ * // "75%"
+ *
+ * formatNumber(1234.5, {
+ *   style: "currency",
+ *   currency: "USD",
+ *   locale: "en-US",
+ * });
+ * // "$1,234.50"
+ * ```
+ */
+export declare const formatNumber: (value: number, options?: FormatNumberOptions) => string;

package/module/Number/formatNumber.js

@@ -0,0 +1,44 @@
+/**
+ * Formats a number using Intl.NumberFormat.
+ *
+ * @param value - The number to format
+ * @param options - Formatting options
+ * @returns The formatted number string
+ *
+ * @example
+ * ```typescript
+ * formatNumber(1234567.89);
+ * // "1,234,567.89" (in en-US locale)
+ *
+ * formatNumber(1234567.89, { locale: "de-DE" });
+ * // "1.234.567,89"
+ *
+ * formatNumber(0.75, { style: "percent" });
+ * // "75%"
+ *
+ * formatNumber(1234.5, {
+ *   style: "currency",
+ *   currency: "USD",
+ *   locale: "en-US",
+ * });
+ * // "$1,234.50"
+ * ```
+ */
+export const formatNumber = (value, options = {}) => {
+    const { locale, minimumFractionDigits, maximumFractionDigits, style, currency, } = options;
+    const formatOptions = {};
+    if (style !== undefined) {
+        formatOptions.style = style;
+    }
+    if (currency !== undefined) {
+        formatOptions.currency = currency;
+    }
+    if (minimumFractionDigits !== undefined) {
+        formatOptions.minimumFractionDigits = minimumFractionDigits;
+    }
+    if (maximumFractionDigits !== undefined) {
+        formatOptions.maximumFractionDigits = maximumFractionDigits;
+    }
+    return new Intl.NumberFormat(locale, formatOptions).format(value);
+};
+//# sourceMappingURL=formatNumber.js.map

package/module/Number/formatNumber.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"formatNumber.js","sourceRoot":"","sources":["../../src/Number/formatNumber.ts"],"names":[],"mappings":"AAgBA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,KAAa,EACb,UAA+B,EAAE,EACzB,EAAE;IACV,MAAM,EACJ,MAAM,EACN,qBAAqB,EACrB,qBAAqB,EACrB,KAAK,EACL,QAAQ,GACT,GAAG,OAAO,CAAC;IAEZ,MAAM,aAAa,GAA6B,EAAE,CAAC;IAEnD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,aAAa,CAAC,KAAK,GAAG,KAAK,CAAC;IAC9B,CAAC;IACD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,aAAa,CAAC,QAAQ,GAAG,QAAQ,CAAC;IACpC,CAAC;IACD,IAAI,qBAAqB,KAAK,SAAS,EAAE,CAAC;QACxC,aAAa,CAAC,qBAAqB,GAAG,qBAAqB,CAAC;IAC9D,CAAC;IACD,IAAI,qBAAqB,KAAK,SAAS,EAAE,CAAC;QACxC,aAAa,CAAC,qBAAqB,GAAG,qBAAqB,CAAC;IAC9D,CAAC;IAED,OAAO,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACpE,CAAC,CAAC"}

package/module/Number/index.d.ts

@@ -0,0 +1,3 @@
+export * from "./formatNumber";
+export * from "./toOrdinal";
+export * from "./toPercentage";

package/module/Number/index.js

@@ -0,0 +1,4 @@
+export * from "./formatNumber";
+export * from "./toOrdinal";
+export * from "./toPercentage";
+//# sourceMappingURL=index.js.map

package/module/Number/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/Number/index.ts"],"names":[],"mappings":"AAAA,cAAc,gBAAgB,CAAC;AAC/B,cAAc,aAAa,CAAC;AAC5B,cAAc,gBAAgB,CAAC"}

package/module/Number/toOrdinal.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Converts a number to its English ordinal string representation.
+ *
+ * Handles the special cases for 11th, 12th, and 13th
+ * (which end in "th" despite their last digit).
+ *
+ * @param value - The number to convert to ordinal form
+ * @returns The ordinal string (e.g., "1st", "2nd", "3rd", "11th")
+ *
+ * @example
+ * ```typescript
+ * toOrdinal(1);   // "1st"
+ * toOrdinal(2);   // "2nd"
+ * toOrdinal(3);   // "3rd"
+ * toOrdinal(11);  // "11th"
+ * toOrdinal(21);  // "21st"
+ * toOrdinal(112); // "112th"
+ * ```
+ */
+export declare const toOrdinal: (value: number) => string;

package/module/Number/toOrdinal.js

@@ -0,0 +1,37 @@
+/**
+ * Converts a number to its English ordinal string representation.
+ *
+ * Handles the special cases for 11th, 12th, and 13th
+ * (which end in "th" despite their last digit).
+ *
+ * @param value - The number to convert to ordinal form
+ * @returns The ordinal string (e.g., "1st", "2nd", "3rd", "11th")
+ *
+ * @example
+ * ```typescript
+ * toOrdinal(1);   // "1st"
+ * toOrdinal(2);   // "2nd"
+ * toOrdinal(3);   // "3rd"
+ * toOrdinal(11);  // "11th"
+ * toOrdinal(21);  // "21st"
+ * toOrdinal(112); // "112th"
+ * ```
+ */
+export const toOrdinal = (value) => {
+    const module100 = value % 100;
+    if (module100 >= 11 && module100 <= 13) {
+        return `${value}th`;
+    }
+    const module10 = value % 10;
+    if (module10 === 1) {
+        return `${value}st`;
+    }
+    if (module10 === 2) {
+        return `${value}nd`;
+    }
+    if (module10 === 3) {
+        return `${value}rd`;
+    }
+    return `${value}th`;
+};
+//# sourceMappingURL=toOrdinal.js.map

package/module/Number/toOrdinal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"toOrdinal.js","sourceRoot":"","sources":["../../src/Number/toOrdinal.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,KAAa,EAAU,EAAE;IACjD,MAAM,SAAS,GAAG,KAAK,GAAG,GAAG,CAAC;IAC9B,IAAI,SAAS,IAAI,EAAE,IAAI,SAAS,IAAI,EAAE,EAAE,CAAC;QACvC,OAAO,GAAG,KAAK,IAAI,CAAC;IACtB,CAAC;IAED,MAAM,QAAQ,GAAG,KAAK,GAAG,EAAE,CAAC;IAC5B,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,GAAG,KAAK,IAAI,CAAC;IACtB,CAAC;IACD,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,GAAG,KAAK,IAAI,CAAC;IACtB,CAAC;IACD,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,GAAG,KAAK,IAAI,CAAC;IACtB,CAAC;IAED,OAAO,GAAG,KAAK,IAAI,CAAC;AACtB,CAAC,CAAC"}

package/module/Number/toPercentage.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Calculates the percentage of a value relative to a total.
+ *
+ * Returns 0 when the total is 0 to avoid division by zero.
+ *
+ * @param value - The partial value
+ * @param total - The total value
+ * @param decimals - The number of decimal places (default 2)
+ * @returns The percentage value
+ *
+ * @example
+ * ```typescript
+ * toPercentage(25, 100);      // 25
+ * toPercentage(1, 3);         // 33.33
+ * toPercentage(1, 3, 0);      // 33
+ * toPercentage(0, 0);         // 0
+ * toPercentage(50, 200, 1);   // 25.0 -> 25
+ * ```
+ */
+export declare const toPercentage: (value: number, total: number, decimals?: number) => number;

package/module/Number/toPercentage.js

@@ -0,0 +1,27 @@
+/**
+ * Calculates the percentage of a value relative to a total.
+ *
+ * Returns 0 when the total is 0 to avoid division by zero.
+ *
+ * @param value - The partial value
+ * @param total - The total value
+ * @param decimals - The number of decimal places (default 2)
+ * @returns The percentage value
+ *
+ * @example
+ * ```typescript
+ * toPercentage(25, 100);      // 25
+ * toPercentage(1, 3);         // 33.33
+ * toPercentage(1, 3, 0);      // 33
+ * toPercentage(0, 0);         // 0
+ * toPercentage(50, 200, 1);   // 25.0 -> 25
+ * ```
+ */
+export const toPercentage = (value, total, decimals = 2) => {
+    if (total === 0) {
+        return 0;
+    }
+    const factor = 10 ** decimals;
+    return Math.round((value / total) * 100 * factor) / factor;
+};
+//# sourceMappingURL=toPercentage.js.map

package/module/Number/toPercentage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"toPercentage.js","sourceRoot":"","sources":["../../src/Number/toPercentage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,KAAa,EACb,KAAa,EACb,QAAQ,GAAG,CAAC,EACJ,EAAE;IACV,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,MAAM,GAAG,EAAE,IAAI,QAAQ,CAAC;IAC9B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC;AAC7D,CAAC,CAAC"}

package/module/Object/deepClone.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Creates a deep clone of the given value.
+ *
+ * @param value - The value to deep clone.
+ * @returns A deep clone of the input value.
+ *
+ * @example
+ * ```typescript
+ * const original = { a: 1, b: { c: 2 } };
+ * const cloned = deepClone(original);
+ * cloned.b.c = 99;
+ * original.b.c; // still 2
+ * ```
+ */
+export declare const deepClone: <T>(value: T) => T;

package/module/Object/deepClone.js

@@ -0,0 +1,62 @@
+/**
+ * Recursively clones a value.
+ */
+const cloneValue = (value) => {
+    if (value === null || typeof value !== "object") {
+        return value;
+    }
+    if (Array.isArray(value)) {
+        const result = [];
+        for (const element of value) {
+            result.push(cloneValue(element));
+        }
+        return result;
+    }
+    if (value instanceof Date) {
+        return new Date(value);
+    }
+    if (value instanceof RegExp) {
+        return new RegExp(value.source, value.flags);
+    }
+    if (value instanceof Map) {
+        const result = new Map();
+        for (const [k, v] of value) {
+            result.set(cloneValue(k), cloneValue(v));
+        }
+        return result;
+    }
+    if (value instanceof Set) {
+        const result = new Set();
+        for (const v of value) {
+            result.add(cloneValue(v));
+        }
+        return result;
+    }
+    // Plain object
+    const result = {};
+    for (const key of Object.keys(value)) {
+        result[key] = cloneValue(value[key]);
+    }
+    return result;
+};
+/**
+ * Creates a deep clone of the given value.
+ *
+ * @param value - The value to deep clone.
+ * @returns A deep clone of the input value.
+ *
+ * @example
+ * ```typescript
+ * const original = { a: 1, b: { c: 2 } };
+ * const cloned = deepClone(original);
+ * cloned.b.c = 99;
+ * original.b.c; // still 2
+ * ```
+ */
+export const deepClone = (value) => {
+    if (value === null || typeof value !== "object") {
+        return value;
+    }
+    return cloneValue(value);
+};
+//# sourceMappingURL=deepClone.js.map

package/module/Object/deepClone.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deepClone.js","sourceRoot":"","sources":["../../src/Object/deepClone.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,UAAU,GAAG,CAAC,KAAc,EAAW,EAAE;IAC7C,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAChD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,IAAI,KAAK,YAAY,IAAI,EAAE,CAAC;QAC1B,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,IAAI,KAAK,YAAY,MAAM,EAAE,CAAC;QAC5B,OAAO,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED,IAAI,KAAK,YAAY,GAAG,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,IAAI,KAAK,YAAY,GAAG,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,eAAe;IACf,MAAM,MAAM,GAA4B,EAAE,CAAC;IAC3C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAgC,CAAC,EAAE,CAAC;QAChE,MAAM,CAAC,GAAG,CAAC,GAAG,UAAU,CAAE,KAAiC,CAAC,GAAG,CAAC,CAAC,CAAC;IACpE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CAAI,KAAQ,EAAK,EAAE;IAC1C,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAChD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,UAAU,CAAC,KAAK,CAAM,CAAC;AAChC,CAAC,CAAC"}

package/module/Object/getObjectsCommon.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Extract key-value pairs common to all input objects.
+ *
+ * A key-value pair is considered common when the key exists in every object
+ * and the value is strictly equal (===) across all objects.
+ * When all values for a key are plain objects, the function recurses to find
+ * the common subset. If the recursive result is empty, the key is excluded.
+ *
+ * @template T - Type of the input objects.
+ * @param {T} object - The first object.
+ * @param {...Record<string, unknown>[]} objects - Additional objects to compare.
+ * @returns {Partial<T>} Object containing only the key-value pairs shared by all inputs.
+ *
+ * @example
+ * ```typescript
+ * getObjectsCommon({ a: 1, b: 2 }, { a: 1, c: 3 });
+ * // { a: 1 }
+ *
+ * getObjectsCommon({ a: { b: 1, c: 2 }, d: 3 }, { a: { b: 1, d: 4 }, d: 3 });
+ * // { a: { b: 1 }, d: 3 }
+ * ```
+ */
+export declare const getObjectsCommon: <T extends Record<string, unknown>>(object: T, ...objects: Record<string, unknown>[]) => Partial<T>;

package/module/Object/getObjectsCommon.js

@@ -0,0 +1,60 @@
+import { isPlainObject } from "../Object/isPlainObject";
+/**
+ * Extract key-value pairs common to all input objects.
+ *
+ * A key-value pair is considered common when the key exists in every object
+ * and the value is strictly equal (===) across all objects.
+ * When all values for a key are plain objects, the function recurses to find
+ * the common subset. If the recursive result is empty, the key is excluded.
+ *
+ * @template T - Type of the input objects.
+ * @param {T} object - The first object.
+ * @param {...Record<string, unknown>[]} objects - Additional objects to compare.
+ * @returns {Partial<T>} Object containing only the key-value pairs shared by all inputs.
+ *
+ * @example
+ * ```typescript
+ * getObjectsCommon({ a: 1, b: 2 }, { a: 1, c: 3 });
+ * // { a: 1 }
+ *
+ * getObjectsCommon({ a: { b: 1, c: 2 }, d: 3 }, { a: { b: 1, d: 4 }, d: 3 });
+ * // { a: { b: 1 }, d: 3 }
+ * ```
+ */
+export const getObjectsCommon = (object, ...objects) => {
+    if (objects.length === 0) {
+        return { ...object };
+    }
+    const result = {};
+    for (const [key, value] of Object.entries(object)) {
+        let isCommon = true;
+        let allPlainObjects = isPlainObject(value);
+        for (const other of objects) {
+            if (!Object.hasOwn(other, key)) {
+                isCommon = false;
+                break;
+            }
+            if (!isPlainObject(other[key])) {
+                allPlainObjects = false;
+            }
+            if (!allPlainObjects && other[key] !== value) {
+                isCommon = false;
+                break;
+            }
+        }
+        if (!isCommon) {
+            continue;
+        }
+        if (allPlainObjects) {
+            const nested = getObjectsCommon(value, ...objects.map((other) => other[key]));
+            if (Object.keys(nested).length > 0) {
+                result[key] = nested;
+            }
+        }
+        else {
+            result[key] = value;
+        }
+    }
+    return result;
+};
+//# sourceMappingURL=getObjectsCommon.js.map

package/module/Object/getObjectsCommon.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getObjectsCommon.js","sourceRoot":"","sources":["../../src/Object/getObjectsCommon.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAEvD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,MAAS,EACT,GAAG,OAAkC,EACzB,EAAE;IACd,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,GAAG,MAAM,EAAE,CAAC;IACvB,CAAC;IAED,MAAM,MAAM,GAAG,EAAgB,CAAC;IAEhC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAClD,IAAI,QAAQ,GAAG,IAAI,CAAC;QACpB,IAAI,eAAe,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;QAE3C,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC/B,QAAQ,GAAG,KAAK,CAAC;gBACjB,MAAM;YACR,CAAC;YAED,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC/B,eAAe,GAAG,KAAK,CAAC;YAC1B,CAAC;YAED,IAAI,CAAC,eAAe,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,KAAK,EAAE,CAAC;gBAC7C,QAAQ,GAAG,KAAK,CAAC;gBACjB,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,SAAS;QACX,CAAC;QAED,IAAI,eAAe,EAAE,CAAC;YACpB,MAAM,MAAM,GAAG,gBAAgB,CAC7B,KAAgC,EAChC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAA4B,CAAC,CACjE,CAAC;YAEF,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAClC,MAAkC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;YACpD,CAAC;QACH,CAAC;aAAM,CAAC;YACL,MAAkC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACnD,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}