umt 2.5.0 → 2.6.0

package/module/String/levenshteinDistance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"levenshteinDistance.js","sourceRoot":"","sources":["../../src/String/levenshteinDistance.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CACjC,OAAe,EACf,OAAe,EACP,EAAE;IACV,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;IAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;IAE/B,wDAAwD;IACxD,IAAI,OAAO,KAAK,CAAC,EAAE,CAAC;QAClB,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,IAAI,OAAO,KAAK,CAAC,EAAE,CAAC;QAClB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,4CAA4C;IAC5C,MAAM,MAAM,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAClE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAC7C,CAAC;IAEF,kCAAkC;IAClC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC;QAC9C,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IAC3B,CAAC;IACD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC;QAC9C,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IAC3B,CAAC;IAED,sBAAsB;IACtB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC;QAC9C,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,IAAI,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC;YACjD,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChE,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAC9B,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,WAAW;YAC1C,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,YAAY;YAC3C,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CACrC,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC;AAClC,CAAC,CAAC"}

package/module/String/stringSimilarity.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Calculates the similarity between two strings as a percentage
+ * Uses Levenshtein distance normalized by the length of the longer string
+ * @param str1 - First string to compare
+ * @param str2 - Second string to compare
+ * @returns Similarity score between 0 (completely different) and 1 (identical)
+ */
+export declare const stringSimilarity: (string1: string, string2: string) => number;

package/module/String/stringSimilarity.js

@@ -0,0 +1,23 @@
+import { levenshteinDistance } from "./levenshteinDistance";
+/**
+ * Calculates the similarity between two strings as a percentage
+ * Uses Levenshtein distance normalized by the length of the longer string
+ * @param str1 - First string to compare
+ * @param str2 - Second string to compare
+ * @returns Similarity score between 0 (completely different) and 1 (identical)
+ */
+export const stringSimilarity = (string1, string2) => {
+    // Identical strings have 100% similarity
+    if (string1 === string2) {
+        return 1;
+    }
+    // Empty strings handling
+    if (string1.length === 0 || string2.length === 0) {
+        return 0;
+    }
+    const distance = levenshteinDistance(string1, string2);
+    const maxLength = Math.max(string1.length, string2.length);
+    // Calculate similarity as 1 - (distance / maxLength)
+    return 1 - distance / maxLength;
+};
+//# sourceMappingURL=stringSimilarity.js.map

package/module/String/stringSimilarity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stringSimilarity.js","sourceRoot":"","sources":["../../src/String/stringSimilarity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAE5D;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,OAAe,EAAE,OAAe,EAAU,EAAE;IAC3E,yCAAyC;IACzC,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;QACxB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,yBAAyB;IACzB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,QAAQ,GAAG,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACvD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IAE3D,qDAAqD;IACrD,OAAO,CAAC,GAAG,QAAQ,GAAG,SAAS,CAAC;AAClC,CAAC,CAAC"}

package/module/Validate/core/index.js

@@ -9,7 +9,6 @@
  * @returns {Function} - A validator function that accepts a value, options, and message
  */
 export const core = (type) => (value, option = [], message) => {
-    // biome-ignore lint/suspicious/useValidTypeof: Type parameter is a string literal type from Types<T>
     if (typeof value !== type) {
         return {
             validate: false,

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

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/Validate/core/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAQH;;;;;GAKG;AAEH,MAAM,CAAC,MAAM,IAAI,GACf,CAAI,IAAc,EAAE,EAAE,CACtB,CACE,KAAQ,EACR,SAAY,EAAkB,EAC9B,OAAgB,EACW,EAAE;IAC7B,qGAAqG;IACrG,IAAI,OAAO,KAAK,KAAK,IAAI,EAAE,CAAC;QAC1B,OAAO;YACL,QAAQ,EAAE,KAAK;YACf,OAAO,EAAE,OAAO,IAAI,EAAE;YACtB,IAAI;SACL,CAAC;IACJ,CAAC;IACD,KAAK,MAAM,QAAQ,IAAI,MAAM,EAAE,CAAC;QAC9B,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9B,OAAO;gBACL,QAAQ,EAAE,KAAK;gBACf,OAAO,EAAE,QAAQ,CAAC,OAAO,IAAI,EAAE;gBAC/B,IAAI;aACL,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO;QACL,QAAQ,EAAE,IAAI;QACd,OAAO,EAAE,EAAE;QACX,IAAI;KACL,CAAC;AACJ,CAAC,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/Validate/core/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAQH;;;;;GAKG;AAEH,MAAM,CAAC,MAAM,IAAI,GACf,CAAI,IAAc,EAAE,EAAE,CACtB,CACE,KAAQ,EACR,SAAY,EAAkB,EAC9B,OAAgB,EACW,EAAE;IAC7B,IAAI,OAAO,KAAK,KAAK,IAAI,EAAE,CAAC;QAC1B,OAAO;YACL,QAAQ,EAAE,KAAK;YACf,OAAO,EAAE,OAAO,IAAI,EAAE;YACtB,IAAI;SACL,CAAC;IACJ,CAAC;IACD,KAAK,MAAM,QAAQ,IAAI,MAAM,EAAE,CAAC;QAC9B,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9B,OAAO;gBACL,QAAQ,EAAE,KAAK;gBACf,OAAO,EAAE,QAAQ,CAAC,OAAO,IAAI,EAAE;gBAC/B,IAAI;aACL,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO;QACL,QAAQ,EAAE,IAAI;QACd,OAAO,EAAE,EAAE;QACX,IAAI;KACL,CAAC;AACJ,CAAC,CAAC"}

package/module/Validate/isDouble.js

@@ -10,7 +10,7 @@
 const isDouble = (x, loose = true) => {
     if (loose) {
         return (
-        // biome-ignore lint/suspicious/noGlobalIsFinite: <explanation>
+        // biome-ignore lint/suspicious/noGlobalIsFinite: ignore
         isFinite(x) &&
             !Number.isNaN(x) &&
             Number.isFinite(Number(x)) &&

package/module/Validate/isDouble.js.map

@@ -1 +1 @@
-{"version":3,"file":"isDouble.js","sourceRoot":"","sources":["../../src/Validate/isDouble.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,MAAM,QAAQ,GAAG,CACf,CAAU,EACV,QAAW,IAAS,EAC4B,EAAE;IAClD,IAAI,KAAK,EAAE,CAAC;QACV,OAAO;QACL,+DAA+D;QAC/D,QAAQ,CAAC,CAAW,CAAC;YACrB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAC7B,CAAC;IACJ,CAAC;IACD,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC,CAAC;AAEF,OAAO,EAAE,QAAQ,EAAE,CAAC"}
+{"version":3,"file":"isDouble.js","sourceRoot":"","sources":["../../src/Validate/isDouble.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,MAAM,QAAQ,GAAG,CACf,CAAU,EACV,QAAW,IAAS,EAC4B,EAAE;IAClD,IAAI,KAAK,EAAE,CAAC;QACV,OAAO;QACL,wDAAwD;QACxD,QAAQ,CAAC,CAAW,CAAC;YACrB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAC7B,CAAC;IACJ,CAAC;IACD,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC,CAAC;AAEF,OAAO,EAAE,QAAQ,EAAE,CAAC"}

package/module/Validate/isNode.js

@@ -3,6 +3,7 @@
  */
 export const isNode = () => {
     try {
+        // biome-ignore lint/nursery/noProcessGlobal: ignore
         return typeof process !== "undefined" && typeof require !== "undefined";
     }
     catch {

package/module/Validate/isNode.js.map

@@ -1 +1 @@
-{"version":3,"file":"isNode.js","sourceRoot":"","sources":["../../src/Validate/isNode.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,GAAG,EAAE;IACzB,IAAI,CAAC;QACH,OAAO,OAAO,OAAO,KAAK,WAAW,IAAI,OAAO,OAAO,KAAK,WAAW,CAAC;IAC1E,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC,CAAC"}
+{"version":3,"file":"isNode.js","sourceRoot":"","sources":["../../src/Validate/isNode.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,GAAG,EAAE;IACzB,IAAI,CAAC;QACH,oDAAoD;QACpD,OAAO,OAAO,OAAO,KAAK,WAAW,IAAI,OAAO,OAAO,KAAK,WAAW,CAAC;IAC1E,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC,CAAC"}

package/module/Validate/isNumber.js

@@ -15,7 +15,7 @@ const isNumber = (number, loose = true) => {
         return false;
     }
     return number !== null && typeof number !== "boolean" && loose
-        ? // biome-ignore lint/suspicious/noGlobalIsFinite: <explanation>
+        ? // biome-ignore lint/suspicious/noGlobalIsFinite: ignore
             isFinite(number)
         : Number.isFinite(number);
 };

package/module/Validate/isNumber.js.map

@@ -1 +1 @@
-{"version":3,"file":"isNumber.js","sourceRoot":"","sources":["../../src/Validate/isNumber.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,QAAQ,GAAG,CACf,MAAe,EACf,QAAW,IAAS,EACiC,EAAE;IACvD,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC1B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;QAC/B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,MAAM,KAAK,IAAI,IAAI,OAAO,MAAM,KAAK,SAAS,IAAI,KAAK;QAC5D,CAAC,CAAC,+DAA+D;YAC/D,QAAQ,CAAC,MAAgB,CAAC;QAC5B,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAgB,CAAC,CAAC;AACxC,CAAC,CAAC;AAEF,OAAO,EAAE,QAAQ,EAAE,CAAC"}
+{"version":3,"file":"isNumber.js","sourceRoot":"","sources":["../../src/Validate/isNumber.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,QAAQ,GAAG,CACf,MAAe,EACf,QAAW,IAAS,EACiC,EAAE;IACvD,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC1B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;QAC/B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,MAAM,KAAK,IAAI,IAAI,OAAO,MAAM,KAAK,SAAS,IAAI,KAAK;QAC5D,CAAC,CAAC,wDAAwD;YACxD,QAAQ,CAAC,MAAgB,CAAC;QAC5B,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAgB,CAAC,CAAC;AACxC,CAAC,CAAC;AAEF,OAAO,EAAE,QAAQ,EAAE,CAAC"}

package/module/Validate/isValueNaN.js

@@ -10,7 +10,7 @@
  * isValueNaN(parseInt("not a number")); // true
  */
 export const isValueNaN = (value, loose = false) => {
-    // biome-ignore lint/suspicious/noGlobalIsNan: <explanation>
+    // biome-ignore lint/suspicious/noGlobalIsNan: ignore
     return loose ? isNaN(value) : Number.isNaN(value);
 };
 //# sourceMappingURL=isValueNaN.js.map

package/module/Validate/isValueNaN.js.map

@@ -1 +1 @@
-{"version":3,"file":"isValueNaN.js","sourceRoot":"","sources":["../../src/Validate/isValueNaN.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAc,EAAE,KAAK,GAAG,KAAK,EAAW,EAAE;IACnE,4DAA4D;IAC5D,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAe,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AAC9D,CAAC,CAAC"}
+{"version":3,"file":"isValueNaN.js","sourceRoot":"","sources":["../../src/Validate/isValueNaN.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAc,EAAE,KAAK,GAAG,KAAK,EAAW,EAAE;IACnE,qDAAqD;IACrD,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAe,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AAC9D,CAAC,CAAC"}

package/module/Validate/number/even.js

@@ -2,6 +2,7 @@
  * Number validation module for even numbers
  * Provides validation functionality for checking if a number is even
  */
+import { isDouble } from "../../Validate/isDouble";
 /**
  * Creates a validator for checking if a number is even
  * @param {string} [message] - Custom error message for validation failure
@@ -11,7 +12,12 @@ export const even = (message) => {
     return {
         type: "number",
         message,
-        validate: (value) => value % 2 === 0,
+        validate: (value) => {
+            if (isDouble(value, false)) {
+                return false;
+            }
+            return value % 2 === 0;
+        },
     };
 };
 //# sourceMappingURL=even.js.map

package/module/Validate/number/even.js.map

@@ -1 +1 @@
-{"version":3,"file":"even.js","sourceRoot":"","sources":["../../../src/Validate/number/even.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;;;GAIG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,OAAgB,EAA8B,EAAE;IACnE,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,OAAO;QACP,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,KAAK,CAAC;KACrC,CAAC;AACJ,CAAC,CAAC"}
+{"version":3,"file":"even.js","sourceRoot":"","sources":["../../../src/Validate/number/even.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAG/C;;;;GAIG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,OAAgB,EAA8B,EAAE;IACnE,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,OAAO;QACP,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE;YAClB,IAAI,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC3B,OAAO,KAAK,CAAC;YACf,CAAC;YACD,OAAO,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;KACF,CAAC;AACJ,CAAC,CAAC"}

package/module/Validate/number/odd.js

@@ -1,8 +1,14 @@
+import { isDouble } from "../../Validate/isDouble";
 export const odd = (message) => {
     return {
         type: "number",
         message,
-        validate: (value) => value % 2 !== 0,
+        validate: (value) => {
+            if (isDouble(value, false)) {
+                return false;
+            }
+            return value % 2 !== 0;
+        },
     };
 };
 //# sourceMappingURL=odd.js.map

package/module/Validate/number/odd.js.map

@@ -1 +1 @@
-{"version":3,"file":"odd.js","sourceRoot":"","sources":["../../../src/Validate/number/odd.ts"],"names":[],"mappings":"AAEA,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,OAAgB,EAA8B,EAAE;IAClE,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,OAAO;QACP,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,KAAK,CAAC;KACrC,CAAC;AACJ,CAAC,CAAC"}
+{"version":3,"file":"odd.js","sourceRoot":"","sources":["../../../src/Validate/number/odd.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAG/C,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,OAAgB,EAA8B,EAAE;IAClE,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,OAAO;QACP,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE;YAClB,IAAI,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC3B,OAAO,KAAK,CAAC;YACf,CAAC;YACD,OAAO,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;KACF,CAAC;AACJ,CAAC,CAAC"}

package/module/Validate/string/email.js

@@ -9,11 +9,29 @@
  */
 export const email = (message) => {
     // Regular expression for email address validation
-    const emailRegex = /^[\w+-]+(?:\.[\w+-]+)*@[\da-z]+(?:[.-][\da-z]+)*\.[a-z]{2,}$/iu;
+    const emailRegex = /^[a-zA-Z0-9]([a-zA-Z0-9._+-]*[a-zA-Z0-9])?@[a-zA-Z0-9]([a-zA-Z0-9.-]*[a-zA-Z0-9])?\.[a-zA-Z]{2,}$/;
     return {
         type: "string",
         message,
-        validate: (value) => emailRegex.test(value),
+        validate: (value) => {
+            // Check for consecutive dots
+            if (value.includes("..")) {
+                return false;
+            }
+            // Check for leading/trailing dots in local part
+            const [localPart, domainPart] = value.split("@");
+            if (!(localPart && domainPart)) {
+                return false;
+            }
+            if (localPart.startsWith(".") || localPart.endsWith(".")) {
+                return false;
+            }
+            if (domainPart.startsWith(".") || domainPart.endsWith(".")) {
+                return false;
+            }
+            // Use regex for final validation
+            return emailRegex.test(value);
+        },
     };
 };
 //# sourceMappingURL=email.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"email.js","sourceRoot":"","sources":["../../../src/Validate/string/email.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;;;GAIG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,OAAgB,EAA8B,EAAE;IACpE,kDAAkD;IAClD,MAAM,UAAU,GACd,gEAAgE,CAAC;IACnE,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,OAAO;QACP,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC;KAC5C,CAAC;AACJ,CAAC,CAAC"}
+{"version":3,"file":"email.js","sourceRoot":"","sources":["../../../src/Validate/string/email.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;;;GAIG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,OAAgB,EAA8B,EAAE;IACpE,kDAAkD;IAClD,MAAM,UAAU,GACd,mGAAmG,CAAC;IACtG,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,OAAO;QACP,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE;YAClB,6BAA6B;YAC7B,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBACzB,OAAO,KAAK,CAAC;YACf,CAAC;YACD,gDAAgD;YAChD,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACjD,IAAI,CAAC,CAAC,SAAS,IAAI,UAAU,CAAC,EAAE,CAAC;gBAC/B,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzD,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC3D,OAAO,KAAK,CAAC;YACf,CAAC;YACD,iCAAiC;YACjC,OAAO,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;KACF,CAAC;AACJ,CAAC,CAAC"}

package/module/es5/Array/generateNumberArray.js

@@ -4,6 +4,10 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.generateNumberArray = void 0;
+var _addition = require("@/Math/addition");
+var _division = require("@/Math/division");
+var _multiplication = require("@/Math/multiplication");
+var _subtract = require("@/Math/subtract");
 /**
  * Generates an array of numbers with the specified length
  * @param length The length of the array
@@ -16,28 +20,30 @@ exports.generateNumberArray = void 0;
  */
 var generateNumberArray = exports.generateNumberArray = function generateNumberArray(length) {
   var min = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
-  var max = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : length - 1;
+  var max = arguments.length > 2 ? arguments[2] : undefined;
   var random = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;
-  if (length <= 0) {
+  var actualLength = Math.floor(length);
+  var actualMax = max !== null && max !== void 0 ? max : actualLength - 1;
+  if (actualLength <= 0) {
     return [];
   }
-  if (min > max) {
+  if (min > actualMax) {
     throw new Error("min should be less than or equal to max");
   }
-  if (length === 1) {
+  if (actualLength === 1) {
     return [min];
   }
   if (random) {
     return Array.from({
-      length: length
+      length: actualLength
     }, function () {
-      return Math.floor(Math.random() * (max - min + 1)) + min;
+      return (0, _addition.addition)(Math.floor((0, _multiplication.multiplication)(Math.random(), (0, _addition.addition)((0, _subtract.subtract)(actualMax, min), 1))), min);
     });
   }
-  var step = (max - min) / (length - 1);
+  var step = (0, _division.division)((0, _subtract.subtract)(actualMax, min), (0, _subtract.subtract)(actualLength, 1));
   return Array.from({
-    length: length
+    length: actualLength
   }, function (_, index) {
-    return min + index * step;
+    return (0, _addition.addition)(min, (0, _multiplication.multiplication)(index, step));
   });
 };

package/module/es5/Array/getArraysCommon.js

@@ -4,6 +4,9 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.getArraysCommon = void 0;
+function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
+function _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; }
 /**
  * Extract common elements from multiple arrays
  * @param {T[]} array The first array
@@ -15,10 +18,42 @@ var getArraysCommon = exports.getArraysCommon = function getArraysCommon(array)
   for (var _len = arguments.length, arrays = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
     arrays[_key - 1] = arguments[_key];
   }
-  var result = [array].concat(arrays).reduce(function (previous, current) {
-    return previous.filter(function (item) {
-      return current.includes(item);
+  if (arrays.length === 0) {
+    return array;
+  }
+  var result = array.filter(function (item) {
+    // Handle NaN specially since NaN !== NaN
+    if (Number.isNaN(item)) {
+      return arrays.every(function (currentArray) {
+        return currentArray.some(function (arrayItem) {
+          return Number.isNaN(arrayItem);
+        });
+      });
+    }
+    return arrays.every(function (currentArray) {
+      return currentArray.includes(item);
     });
   });
-  return result;
+  var uniqueResult = [];
+  var _iterator = _createForOfIteratorHelper(result),
+    _step;
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var item = _step.value;
+      if (Number.isNaN(item)) {
+        if (!uniqueResult.some(function (existing) {
+          return Number.isNaN(existing);
+        })) {
+          uniqueResult.push(item);
+        }
+      } else if (!uniqueResult.includes(item)) {
+        uniqueResult.push(item);
+      }
+    }
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+  return uniqueResult;
 };

package/module/es5/Array/groupBy.js

@@ -20,7 +20,7 @@ var groupBy = exports.groupBy = function groupBy(array, iteratee) {
   for (var index = 0; index < length; index++) {
     var value = array[index];
     var key = iteratee(value, index, array);
-    // biome-ignore lint/suspicious/noAssignInExpressions: <explanation>
+    // biome-ignore lint/suspicious/noAssignInExpressions: ignore
     (result[key] || (result[key] = [])).push(value);
   }
   return result;

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

@@ -21,5 +21,7 @@ export * from "./shuffle2DArray";
 export * from "./sum";
 export * from "./timSort";
 export * from "./ultraNumberSort";
+export * from "./uniqBy";
+export * from "./unique";
 export * from "./zip";
 export * from "./zipLongest";

package/module/es5/Array/index.js

@@ -256,6 +256,28 @@ Object.keys(_ultraNumberSort).forEach(function (key) {
     }
   });
 });
+var _uniqBy = require("./uniqBy");
+Object.keys(_uniqBy).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _uniqBy[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _uniqBy[key];
+    }
+  });
+});
+var _unique = require("./unique");
+Object.keys(_unique).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _unique[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _unique[key];
+    }
+  });
+});
 var _zip = require("./zip");
 Object.keys(_zip).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;

package/module/es5/Array/ultraNumberSort.js

@@ -41,7 +41,7 @@ var ultraNumberSort = exports.ultraNumberSort = function ultraNumberSort(array)
   var hasNaN = false;
   for (var index = 0; index < length; index++) {
     var value = array[index];
-    // biome-ignore lint/suspicious/noSelfCompare: <explanation>
+    // biome-ignore lint/suspicious/noSelfCompare: ignore
     if (value !== value) {
       hasNaN = true;
       break;
@@ -132,7 +132,7 @@ var handleNaNSort = function handleNaNSort(array, ascending) {
   try {
     for (_iterator.s(); !(_step = _iterator.n()).done;) {
       var element = _step.value;
-      // biome-ignore lint/suspicious/noSelfCompare: <explanation>
+      // biome-ignore lint/suspicious/noSelfCompare: ignore
       if (element === element) {
         valid.push(element);
       } else {

package/module/es5/Array/uniqBy.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Removes duplicate values from an array based on a selector function
+ * @param array - The array to process
+ * @param selector - Function that returns the value to compare for uniqueness
+ * @returns A new array with unique values based on the selector
+ */
+export declare const uniqBy: <T extends unknown[], K>(array: T, selector: (item: T[number]) => K) => T;

package/module/es5/Array/uniqBy.js

@@ -0,0 +1,36 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.uniqBy = void 0;
+function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
+function _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; }
+/**
+ * Removes duplicate values from an array based on a selector function
+ * @param array - The array to process
+ * @param selector - Function that returns the value to compare for uniqueness
+ * @returns A new array with unique values based on the selector
+ */
+var uniqBy = exports.uniqBy = function uniqBy(array, selector) {
+  var seen = new Set();
+  var result = [];
+  var _iterator = _createForOfIteratorHelper(array),
+    _step;
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var item = _step.value;
+      var key = selector(item);
+      if (!seen.has(key)) {
+        seen.add(key);
+        result.push(item);
+      }
+    }
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+  return result;
+};

package/module/es5/Array/unique.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Removes duplicate values from an array
+ * @param array - The array to process
+ * @returns A new array with unique values
+ */
+export declare const unique: <T>(array: T[]) => T[];

package/module/es5/Array/unique.js

@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unique = void 0;
+function _toConsumableArray(r) { return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _nonIterableSpread(); }
+function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _iterableToArray(r) { if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r); }
+function _arrayWithoutHoles(r) { if (Array.isArray(r)) return _arrayLikeToArray(r); }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
+/**
+ * Removes duplicate values from an array
+ * @param array - The array to process
+ * @returns A new array with unique values
+ */
+var unique = exports.unique = function unique(array) {
+  return _toConsumableArray(new Set(array));
+};

package/module/es5/Color/rgbaToHsla.js

@@ -36,7 +36,7 @@ var rgbaToHsla = exports.rgbaToHsla = function rgbaToHsla(_ref) {
   var l = (0, _division.division)((0, _addition.addition)(max, min), 2);
   var s = diff === 0 ? 0 : (0, _division.division)(diff, (0, _subtract.subtract)(1, Math.abs((0, _subtract.subtract)((0, _addition.addition)(max, min), 1))));
   if (diff !== 0) {
-    // biome-ignore lint/style/useDefaultSwitchClause: <explanation>
+    // biome-ignore lint/style/useDefaultSwitchClause: ignore
     switch (max) {
       case rPrime:
         {

package/module/es5/Date/birthday.js

@@ -19,7 +19,21 @@ var birthday = exports.birthday = function birthday(year, mon, day) {
   var timeDifference = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 9;
   var birthdayDate = new Date((0, _new.newDateInt)(year, mon, day));
   var nowTime = (0, _now.now)(timeDifference);
-  var y = nowTime.getFullYear() - birthdayDate.getFullYear();
-  var r = nowTime < (0, _new.newDateInt)(nowTime.getFullYear(), birthdayDate.getMonth() - 1, birthdayDate.getDay()) ? y - 1 : y;
-  return year < 100 ? 1900 + y : r;
+  var currentYear = nowTime.getFullYear();
+  var birthYear = birthdayDate.getFullYear();
+
+  // Calculate base age
+  var age = currentYear - birthYear;
+
+  // Check if birthday hasn't occurred this year yet
+  var thisYearBirthday = new Date(currentYear, birthdayDate.getMonth(), birthdayDate.getDate());
+  if (nowTime < thisYearBirthday) {
+    age -= 1;
+  }
+
+  // Handle future birthdays (should return 0 or non-negative)
+  if (age < 0) {
+    return 0;
+  }
+  return age;
 };

package/module/es5/Date/isLeapYear.js

@@ -15,5 +15,8 @@ exports.isLeapYear = void 0;
  * isLeapYear(2023); // Returns false (not divisible by 4)
  */
 var isLeapYear = exports.isLeapYear = function isLeapYear(year) {
+  if (!Number.isInteger(year)) {
+    return false;
+  }
   return year % 4 === 0 && year % 100 !== 0 || year % 400 === 0;
 };

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

@@ -1 +1,2 @@
+export * from "./retry";
 export * from "./safeExecute";

package/module/es5/Error/index.js

@@ -3,6 +3,17 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
+var _retry = require("./retry");
+Object.keys(_retry).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _retry[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _retry[key];
+    }
+  });
+});
 var _safeExecute = require("./safeExecute");
 Object.keys(_safeExecute).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;

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

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