@vielzeug/toolkit 1.1.2 → 2.0.0

package/dist/random/shuffle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shuffle.d.ts","sourceRoot":"","sources":["../../src/random/shuffle.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAY1C"}

package/dist/random/shuffle.js

@@ -1,15 +1,19 @@
-import { assert as s } from "../function/assert.js";
-import { IS_ARRAY_ERROR_MSG as f, isArray as n } from "../typed/isArray.js";
-function m(o) {
-  s(n(o), f, { args: { array: o }, type: TypeError });
-  const r = [...o];
-  for (let t = r.length - 1; t > 0; t--) {
-    const e = Math.floor(Math.random() * (t + 1));
-    [r[t], r[e]] = [r[e], r[t]];
-  }
-  return r;
+import { assert as e } from "../function/assert.js";
+import { IS_ARRAY_ERROR_MSG as t, isArray as n } from "../typed/isArray.js";
+//#region src/random/shuffle.ts
+function r(r) {
+	e(n(r), t, {
+		args: { array: r },
+		type: TypeError
+	});
+	let i = [...r];
+	for (let e = i.length - 1; e > 0; e--) {
+		let t = Math.floor(crypto.getRandomValues(new Uint32Array(1))[0] / 4294967295 * (e + 1));
+		[i[e], i[t]] = [i[t], i[e]];
+	}
+	return i;
 }
-export {
-  m as shuffle
-};
-//# sourceMappingURL=shuffle.js.map
+//#endregion
+export { r as shuffle };
+
+//# sourceMappingURL=shuffle.js.map

package/dist/random/shuffle.js.map

@@ -1 +1 @@
-{"version":3,"file":"shuffle.js","sources":["../../src/random/shuffle.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\n\n/**\n * Shuffles an array randomly.\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4];\n * shuffle(arr); // a shuffled version of the array\n * ```\n *\n * @param array - The array to shuffle.\n *\n * @returns A new shuffled array.\n *\n * @throws {TypeError} If the provided array is not an array.\n */\nexport function shuffle<T>(array: T[]): T[] {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  const result = [...array];\n\n  for (let i = result.length - 1; i > 0; i--) {\n    const j = Math.floor(Math.random() * (i + 1));\n    [result[i], result[j]] = [result[j], result[i]];\n  }\n\n  return result;\n}\n"],"names":["shuffle","array","assert","isArray","IS_ARRAY_ERROR_MSG","result","i","j"],"mappings":";;AAkBO,SAASA,EAAWC,GAAiB;AAC1C,EAAAC,EAAOC,EAAQF,CAAK,GAAGG,GAAoB,EAAE,MAAM,EAAE,OAAAH,EAAA,GAAS,MAAM,WAAW;AAE/E,QAAMI,IAAS,CAAC,GAAGJ,CAAK;AAExB,WAASK,IAAID,EAAO,SAAS,GAAGC,IAAI,GAAGA,KAAK;AAC1C,UAAMC,IAAI,KAAK,MAAM,KAAK,YAAYD,IAAI,EAAE;AAC5C,KAACD,EAAOC,CAAC,GAAGD,EAAOE,CAAC,CAAC,IAAI,CAACF,EAAOE,CAAC,GAAGF,EAAOC,CAAC,CAAC;AAAA,EAChD;AAEA,SAAOD;AACT;"}
+{"version":3,"file":"shuffle.js","names":[],"sources":["../../src/random/shuffle.ts"],"sourcesContent":["import { assert } from '../function/assert';\nimport { IS_ARRAY_ERROR_MSG, isArray } from '../typed/isArray';\n\n/**\n * Shuffles an array randomly.\n *\n * @example\n * ```ts\n * const arr = [1, 2, 3, 4];\n * shuffle(arr); // a shuffled version of the array\n * ```\n *\n * @param array - The array to shuffle.\n *\n * @returns A new shuffled array.\n *\n * @throws {TypeError} If the provided array is not an array.\n */\nexport function shuffle<T>(array: T[]): T[] {\n  assert(isArray(array), IS_ARRAY_ERROR_MSG, { args: { array }, type: TypeError });\n\n  const result = [...array];\n\n  for (let i = result.length - 1; i > 0; i--) {\n    const j = Math.floor((crypto.getRandomValues(new Uint32Array(1))[0] / 0xffffffff) * (i + 1));\n\n    [result[i], result[j]] = [result[j], result[i]];\n  }\n\n  return result;\n}\n"],"mappings":";;;AAkBA,SAAgB,EAAW,GAAiB;AAC1C,GAAO,EAAQ,EAAM,EAAE,GAAoB;EAAE,MAAM,EAAE,UAAO;EAAE,MAAM;EAAW,CAAC;CAEhF,IAAM,IAAS,CAAC,GAAG,EAAM;AAEzB,MAAK,IAAI,IAAI,EAAO,SAAS,GAAG,IAAI,GAAG,KAAK;EAC1C,IAAM,IAAI,KAAK,MAAO,OAAO,gBAAgB,IAAI,YAAY,EAAE,CAAC,CAAC,KAAK,cAAe,IAAI,GAAG;AAE5F,GAAC,EAAO,IAAI,EAAO,MAAM,CAAC,EAAO,IAAI,EAAO,GAAG;;AAGjD,QAAO"}

package/dist/random/uuid.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function t(){return typeof crypto<"u"&&crypto.randomUUID?crypto.randomUUID():"xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx".replace(/x/g,r=>{const x=Math.random()*16|0;return(r==="x"?x:x&3|8).toString(16)})}exports.uuid=t;
-//# sourceMappingURL=uuid.cjs.map
+function e(){return crypto.randomUUID()}exports.uuid=e;
+//# sourceMappingURL=uuid.cjs.map

package/dist/random/uuid.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"uuid.cjs","sources":["../../src/random/uuid.ts"],"sourcesContent":["/**\n * Generates a unique identifier.\n *\n * @example\n * ```ts\n * uuid(); // a unique identifier, e.g., '22a746d0-08be-4aff-bbc2-4deddf0914e0'\n * ```\n *\n * @returns A unique identifier.\n */\nexport function uuid(): string {\n  if (typeof crypto !== 'undefined' && crypto.randomUUID) {\n    return crypto.randomUUID();\n  }\n\n  return 'xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx'.replace(/x/g, (c) => {\n    const r = (Math.random() * 16) | 0;\n    const v = c === 'x' ? r : (r & 0x3) | 0x8;\n    return v.toString(16);\n  });\n}\n"],"names":["uuid","c","r"],"mappings":"gFAUO,SAASA,GAAe,CAC7B,OAAI,OAAO,OAAW,KAAe,OAAO,WACnC,OAAO,WAAA,EAGT,uCAAuC,QAAQ,KAAOC,GAAM,CACjE,MAAMC,EAAK,KAAK,OAAA,EAAW,GAAM,EAEjC,OADUD,IAAM,IAAMC,EAAKA,EAAI,EAAO,GAC7B,SAAS,EAAE,CACtB,CAAC,CACH"}
+{"version":3,"file":"uuid.cjs","names":[],"sources":["../../src/random/uuid.ts"],"sourcesContent":["/**\n * Generates a unique identifier.\n *\n * @example\n * ```ts\n * uuid(); // a unique identifier, e.g., '22a746d0-08be-4aff-bbc2-4deddf0914e0'\n * ```\n *\n * @returns A unique identifier.\n */\nexport function uuid(): string {\n  return crypto.randomUUID();\n}\n"],"mappings":"AAUA,SAAgB,GAAe,CAC7B,OAAO,OAAO,YAAY"}

package/dist/random/uuid.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Generates a unique identifier.
+ *
+ * @example
+ * ```ts
+ * uuid(); // a unique identifier, e.g., '22a746d0-08be-4aff-bbc2-4deddf0914e0'
+ * ```
+ *
+ * @returns A unique identifier.
+ */
+export declare function uuid(): string;
+//# sourceMappingURL=uuid.d.ts.map

package/dist/random/uuid.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"uuid.d.ts","sourceRoot":"","sources":["../../src/random/uuid.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,wBAAgB,IAAI,IAAI,MAAM,CAE7B"}

package/dist/random/uuid.js

@@ -1,10 +1,8 @@
-function n() {
-  return typeof crypto < "u" && crypto.randomUUID ? crypto.randomUUID() : "xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx".replace(/x/g, (r) => {
-    const x = Math.random() * 16 | 0;
-    return (r === "x" ? x : x & 3 | 8).toString(16);
-  });
+//#region src/random/uuid.ts
+function e() {
+	return crypto.randomUUID();
 }
-export {
-  n as uuid
-};
-//# sourceMappingURL=uuid.js.map
+//#endregion
+export { e as uuid };
+
+//# sourceMappingURL=uuid.js.map

package/dist/random/uuid.js.map

@@ -1 +1 @@
-{"version":3,"file":"uuid.js","sources":["../../src/random/uuid.ts"],"sourcesContent":["/**\n * Generates a unique identifier.\n *\n * @example\n * ```ts\n * uuid(); // a unique identifier, e.g., '22a746d0-08be-4aff-bbc2-4deddf0914e0'\n * ```\n *\n * @returns A unique identifier.\n */\nexport function uuid(): string {\n  if (typeof crypto !== 'undefined' && crypto.randomUUID) {\n    return crypto.randomUUID();\n  }\n\n  return 'xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx'.replace(/x/g, (c) => {\n    const r = (Math.random() * 16) | 0;\n    const v = c === 'x' ? r : (r & 0x3) | 0x8;\n    return v.toString(16);\n  });\n}\n"],"names":["uuid","c","r"],"mappings":"AAUO,SAASA,IAAe;AAC7B,SAAI,OAAO,SAAW,OAAe,OAAO,aACnC,OAAO,WAAA,IAGT,uCAAuC,QAAQ,MAAM,CAACC,MAAM;AACjE,UAAMC,IAAK,KAAK,OAAA,IAAW,KAAM;AAEjC,YADUD,MAAM,MAAMC,IAAKA,IAAI,IAAO,GAC7B,SAAS,EAAE;AAAA,EACtB,CAAC;AACH;"}
+{"version":3,"file":"uuid.js","names":[],"sources":["../../src/random/uuid.ts"],"sourcesContent":["/**\n * Generates a unique identifier.\n *\n * @example\n * ```ts\n * uuid(); // a unique identifier, e.g., '22a746d0-08be-4aff-bbc2-4deddf0914e0'\n * ```\n *\n * @returns A unique identifier.\n */\nexport function uuid(): string {\n  return crypto.randomUUID();\n}\n"],"mappings":";AAUA,SAAgB,IAAe;AAC7B,QAAO,OAAO,YAAY"}

package/dist/string/_caseUtils.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const $=/([a-z])([A-Z\d])|([A-Z\d])([A-Z][a-z])|(\d)([a-zA-Z])/g;function i(n,e=" "){return n.trim().replace($,`$1$3$5${e}$2$4$6`).replace(/[^a-z\d]+/gi,e).replace(new RegExp(`^${e}+|${e}+$`,"g"),"")}exports.CASE_SPLIT_PATTERN=$;exports.normalizeCase=i;
-//# sourceMappingURL=_caseUtils.cjs.map
+var e=/([a-z])([A-Z\d])|([A-Z\d])([A-Z][a-z])|(\d)([a-zA-Z])/g;function t(t,n=` `){return t.trim().replace(e,`$1$3$5${n}$2$4$6`).replace(/[^a-z\d]+/gi,n).replace(RegExp(`^${n}+|${n}+$`,`g`),``)}exports.normalizeCase=t;
+//# sourceMappingURL=_caseUtils.cjs.map

package/dist/string/_caseUtils.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"_caseUtils.cjs","sources":["../../src/string/_caseUtils.ts"],"sourcesContent":["/**\n * Shared regex pattern for splitting words in case conversion utilities\n */\nexport const CASE_SPLIT_PATTERN = /([a-z])([A-Z\\d])|([A-Z\\d])([A-Z][a-z])|(\\d)([a-zA-Z])/g;\n\n/**\n * Normalizes a string by splitting on word boundaries and removing special characters\n *\n * @param str - The string to normalize\n * @param separator - The separator to use for splitting (default: space)\n * @returns The normalized string\n */\nexport function normalizeCase(str: string, separator = ' '): string {\n  return str\n    .trim()\n    .replace(CASE_SPLIT_PATTERN, `$1$3$5${separator}$2$4$6`)\n    .replace(/[^a-z\\d]+/gi, separator)\n    .replace(new RegExp(`^${separator}+|${separator}+$`, 'g'), '');\n}\n"],"names":["CASE_SPLIT_PATTERN","normalizeCase","str","separator"],"mappings":"gFAGO,MAAMA,EAAqB,yDAS3B,SAASC,EAAcC,EAAaC,EAAY,IAAa,CAClE,OAAOD,EACJ,OACA,QAAQF,EAAoB,SAASG,CAAS,QAAQ,EACtD,QAAQ,cAAeA,CAAS,EAChC,QAAQ,IAAI,OAAO,IAAIA,CAAS,KAAKA,CAAS,KAAM,GAAG,EAAG,EAAE,CACjE"}
+{"version":3,"file":"_caseUtils.cjs","names":[],"sources":["../../src/string/_caseUtils.ts"],"sourcesContent":["/**\n * Shared regex pattern for splitting words in case conversion utilities\n */\nexport const CASE_SPLIT_PATTERN = /([a-z])([A-Z\\d])|([A-Z\\d])([A-Z][a-z])|(\\d)([a-zA-Z])/g;\n\n/**\n * Normalizes a string by splitting on word boundaries and removing special characters\n *\n * @param str - The string to normalize\n * @param separator - The separator to use for splitting (default: space)\n * @returns The normalized string\n */\nexport function normalizeCase(str: string, separator = ' '): string {\n  return str\n    .trim()\n    .replace(CASE_SPLIT_PATTERN, `$1$3$5${separator}$2$4$6`)\n    .replace(/[^a-z\\d]+/gi, separator)\n    .replace(new RegExp(`^${separator}+|${separator}+$`, 'g'), '');\n}\n"],"mappings":"AAGA,IAAa,EAAqB,yDASlC,SAAgB,EAAc,EAAa,EAAY,IAAa,CAClE,OAAO,EACJ,MAAM,CACN,QAAQ,EAAoB,SAAS,EAAU,QAAQ,CACvD,QAAQ,cAAe,EAAU,CACjC,QAAY,OAAO,IAAI,EAAU,IAAI,EAAU,IAAK,IAAI,CAAE,GAAG"}

package/dist/string/_caseUtils.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Shared regex pattern for splitting words in case conversion utilities
+ */
+export declare const CASE_SPLIT_PATTERN: RegExp;
+/**
+ * Normalizes a string by splitting on word boundaries and removing special characters
+ *
+ * @param str - The string to normalize
+ * @param separator - The separator to use for splitting (default: space)
+ * @returns The normalized string
+ */
+export declare function normalizeCase(str: string, separator?: string): string;
+//# sourceMappingURL=_caseUtils.d.ts.map

package/dist/string/_caseUtils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_caseUtils.d.ts","sourceRoot":"","sources":["../../src/string/_caseUtils.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,eAAO,MAAM,kBAAkB,QAA2D,CAAC;AAE3F;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,SAAM,GAAG,MAAM,CAMlE"}

package/dist/string/_caseUtils.js

@@ -1,9 +1,9 @@
-const n = /([a-z])([A-Z\d])|([A-Z\d])([A-Z][a-z])|(\d)([a-zA-Z])/g;
-function A(e, $ = " ") {
-  return e.trim().replace(n, `$1$3$5${$}$2$4$6`).replace(/[^a-z\d]+/gi, $).replace(new RegExp(`^${$}+|${$}+$`, "g"), "");
+//#region src/string/_caseUtils.ts
+var e = /([a-z])([A-Z\d])|([A-Z\d])([A-Z][a-z])|(\d)([a-zA-Z])/g;
+function t(t, n = " ") {
+	return t.trim().replace(e, `$1$3$5${n}$2$4$6`).replace(/[^a-z\d]+/gi, n).replace(RegExp(`^${n}+|${n}+$`, "g"), "");
 }
-export {
-  n as CASE_SPLIT_PATTERN,
-  A as normalizeCase
-};
-//# sourceMappingURL=_caseUtils.js.map
+//#endregion
+export { t as normalizeCase };
+
+//# sourceMappingURL=_caseUtils.js.map

package/dist/string/_caseUtils.js.map

@@ -1 +1 @@
-{"version":3,"file":"_caseUtils.js","sources":["../../src/string/_caseUtils.ts"],"sourcesContent":["/**\n * Shared regex pattern for splitting words in case conversion utilities\n */\nexport const CASE_SPLIT_PATTERN = /([a-z])([A-Z\\d])|([A-Z\\d])([A-Z][a-z])|(\\d)([a-zA-Z])/g;\n\n/**\n * Normalizes a string by splitting on word boundaries and removing special characters\n *\n * @param str - The string to normalize\n * @param separator - The separator to use for splitting (default: space)\n * @returns The normalized string\n */\nexport function normalizeCase(str: string, separator = ' '): string {\n  return str\n    .trim()\n    .replace(CASE_SPLIT_PATTERN, `$1$3$5${separator}$2$4$6`)\n    .replace(/[^a-z\\d]+/gi, separator)\n    .replace(new RegExp(`^${separator}+|${separator}+$`, 'g'), '');\n}\n"],"names":["CASE_SPLIT_PATTERN","normalizeCase","str","separator"],"mappings":"AAGO,MAAMA,IAAqB;AAS3B,SAASC,EAAcC,GAAaC,IAAY,KAAa;AAClE,SAAOD,EACJ,OACA,QAAQF,GAAoB,SAASG,CAAS,QAAQ,EACtD,QAAQ,eAAeA,CAAS,EAChC,QAAQ,IAAI,OAAO,IAAIA,CAAS,KAAKA,CAAS,MAAM,GAAG,GAAG,EAAE;AACjE;"}
+{"version":3,"file":"_caseUtils.js","names":[],"sources":["../../src/string/_caseUtils.ts"],"sourcesContent":["/**\n * Shared regex pattern for splitting words in case conversion utilities\n */\nexport const CASE_SPLIT_PATTERN = /([a-z])([A-Z\\d])|([A-Z\\d])([A-Z][a-z])|(\\d)([a-zA-Z])/g;\n\n/**\n * Normalizes a string by splitting on word boundaries and removing special characters\n *\n * @param str - The string to normalize\n * @param separator - The separator to use for splitting (default: space)\n * @returns The normalized string\n */\nexport function normalizeCase(str: string, separator = ' '): string {\n  return str\n    .trim()\n    .replace(CASE_SPLIT_PATTERN, `$1$3$5${separator}$2$4$6`)\n    .replace(/[^a-z\\d]+/gi, separator)\n    .replace(new RegExp(`^${separator}+|${separator}+$`, 'g'), '');\n}\n"],"mappings":";AAGA,IAAa,IAAqB;AASlC,SAAgB,EAAc,GAAa,IAAY,KAAa;AAClE,QAAO,EACJ,MAAM,CACN,QAAQ,GAAoB,SAAS,EAAU,QAAQ,CACvD,QAAQ,eAAe,EAAU,CACjC,QAAY,OAAO,IAAI,EAAU,IAAI,EAAU,KAAK,IAAI,EAAE,GAAG"}

package/dist/string/camelCase.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./_caseUtils.cjs");function o(a){return t.normalizeCase(a," ").replace(/[^a-zA-Z0-9]+(.)/g,(e,r)=>r.toUpperCase()).replace(/^./,e=>e.toLowerCase())}exports.camelCase=o;
-//# sourceMappingURL=camelCase.cjs.map
+const e=require(`./_caseUtils.cjs`);function t(t){return e.normalizeCase(t,` `).replace(/[^a-zA-Z0-9]+(.)/g,(e,t)=>t.toUpperCase()).replace(/^./,e=>e.toLowerCase())}exports.camelCase=t;
+//# sourceMappingURL=camelCase.cjs.map

package/dist/string/camelCase.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"camelCase.cjs","sources":["../../src/string/camelCase.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Converts a string to camel case.\n *\n * @example\n * ```ts\n * const text = 'hello world';\n * camelCase(text); // 'helloWorld'\n * ```\n *\n * @param str - The string to convert.\n * @returns The converted string.\n */\nexport function camelCase(str: string): string {\n  return normalizeCase(str, ' ')\n    .replace(/[^a-zA-Z0-9]+(.)/g, (_, char) => char.toUpperCase()) // Basic split by non-alphanumeric\n    .replace(/^./, (char) => char.toLowerCase());\n}\n"],"names":["camelCase","str","normalizeCase","_","char"],"mappings":"oHAcO,SAASA,EAAUC,EAAqB,CAC7C,OAAOC,EAAAA,cAAcD,EAAK,GAAG,EAC1B,QAAQ,oBAAqB,CAACE,EAAGC,IAASA,EAAK,YAAA,CAAa,EAC5D,QAAQ,KAAOA,GAASA,EAAK,aAAa,CAC/C"}
+{"version":3,"file":"camelCase.cjs","names":[],"sources":["../../src/string/camelCase.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Converts a string to camel case.\n *\n * @example\n * ```ts\n * const text = 'hello world';\n * camelCase(text); // 'helloWorld'\n * ```\n *\n * @param str - The string to convert.\n * @returns The converted string.\n */\nexport function camelCase(str: string): string {\n  return normalizeCase(str, ' ')\n    .replace(/[^a-zA-Z0-9]+(.)/g, (_, char) => char.toUpperCase())\n    .replace(/^./, (char) => char.toLowerCase());\n}\n"],"mappings":"oCAcA,SAAgB,EAAU,EAAqB,CAC7C,OAAO,EAAA,cAAc,EAAK,IAAI,CAC3B,QAAQ,qBAAsB,EAAG,IAAS,EAAK,aAAa,CAAC,CAC7D,QAAQ,KAAO,GAAS,EAAK,aAAa,CAAC"}

package/dist/string/camelCase.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Converts a string to camel case.
+ *
+ * @example
+ * ```ts
+ * const text = 'hello world';
+ * camelCase(text); // 'helloWorld'
+ * ```
+ *
+ * @param str - The string to convert.
+ * @returns The converted string.
+ */
+export declare function camelCase(str: string): string;
+//# sourceMappingURL=camelCase.d.ts.map

package/dist/string/camelCase.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"camelCase.d.ts","sourceRoot":"","sources":["../../src/string/camelCase.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;GAWG;AACH,wBAAgB,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAI7C"}

package/dist/string/camelCase.js

@@ -1,8 +1,9 @@
-import { normalizeCase as o } from "./_caseUtils.js";
-function t(r) {
-  return o(r, " ").replace(/[^a-zA-Z0-9]+(.)/g, (e, a) => a.toUpperCase()).replace(/^./, (e) => e.toLowerCase());
+import { normalizeCase as e } from "./_caseUtils.js";
+//#region src/string/camelCase.ts
+function t(t) {
+	return e(t, " ").replace(/[^a-zA-Z0-9]+(.)/g, (e, t) => t.toUpperCase()).replace(/^./, (e) => e.toLowerCase());
 }
-export {
-  t as camelCase
-};
-//# sourceMappingURL=camelCase.js.map
+//#endregion
+export { t as camelCase };
+
+//# sourceMappingURL=camelCase.js.map

package/dist/string/camelCase.js.map

@@ -1 +1 @@
-{"version":3,"file":"camelCase.js","sources":["../../src/string/camelCase.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Converts a string to camel case.\n *\n * @example\n * ```ts\n * const text = 'hello world';\n * camelCase(text); // 'helloWorld'\n * ```\n *\n * @param str - The string to convert.\n * @returns The converted string.\n */\nexport function camelCase(str: string): string {\n  return normalizeCase(str, ' ')\n    .replace(/[^a-zA-Z0-9]+(.)/g, (_, char) => char.toUpperCase()) // Basic split by non-alphanumeric\n    .replace(/^./, (char) => char.toLowerCase());\n}\n"],"names":["camelCase","str","normalizeCase","_","char"],"mappings":";AAcO,SAASA,EAAUC,GAAqB;AAC7C,SAAOC,EAAcD,GAAK,GAAG,EAC1B,QAAQ,qBAAqB,CAACE,GAAGC,MAASA,EAAK,YAAA,CAAa,EAC5D,QAAQ,MAAM,CAACA,MAASA,EAAK,aAAa;AAC/C;"}
+{"version":3,"file":"camelCase.js","names":[],"sources":["../../src/string/camelCase.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Converts a string to camel case.\n *\n * @example\n * ```ts\n * const text = 'hello world';\n * camelCase(text); // 'helloWorld'\n * ```\n *\n * @param str - The string to convert.\n * @returns The converted string.\n */\nexport function camelCase(str: string): string {\n  return normalizeCase(str, ' ')\n    .replace(/[^a-zA-Z0-9]+(.)/g, (_, char) => char.toUpperCase())\n    .replace(/^./, (char) => char.toLowerCase());\n}\n"],"mappings":";;AAcA,SAAgB,EAAU,GAAqB;AAC7C,QAAO,EAAc,GAAK,IAAI,CAC3B,QAAQ,sBAAsB,GAAG,MAAS,EAAK,aAAa,CAAC,CAC7D,QAAQ,OAAO,MAAS,EAAK,aAAa,CAAC"}

package/dist/string/index.d.ts

@@ -0,0 +1,7 @@
+export * from './camelCase';
+export * from './kebabCase';
+export * from './pascalCase';
+export * from './similarity';
+export * from './snakeCase';
+export * from './truncate';
+//# sourceMappingURL=index.d.ts.map

package/dist/string/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/string/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC"}

package/dist/string/kebabCase.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./_caseUtils.cjs");function a(e){return t.normalizeCase(e,"-").toLowerCase()}exports.kebabCase=a;
-//# sourceMappingURL=kebabCase.cjs.map
+const e=require(`./_caseUtils.cjs`);function t(t){return e.normalizeCase(t,`-`).toLowerCase()}exports.kebabCase=t;
+//# sourceMappingURL=kebabCase.cjs.map

package/dist/string/kebabCase.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"kebabCase.cjs","sources":["../../src/string/kebabCase.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Converts a string to kebab case.\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * kebabCase(text); // 'hello-world'\n * ```\n *\n * @param str - The string to convert.\n *\n * @returns The converted string.\n */\nexport function kebabCase(str: string): string {\n  return normalizeCase(str, '-').toLowerCase();\n}\n"],"names":["kebabCase","str","normalizeCase"],"mappings":"oHAeO,SAASA,EAAUC,EAAqB,CAC7C,OAAOC,gBAAcD,EAAK,GAAG,EAAE,YAAA,CACjC"}
+{"version":3,"file":"kebabCase.cjs","names":[],"sources":["../../src/string/kebabCase.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Converts a string to kebab case.\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * kebabCase(text); // 'hello-world'\n * ```\n *\n * @param str - The string to convert.\n *\n * @returns The converted string.\n */\nexport function kebabCase(str: string): string {\n  return normalizeCase(str, '-').toLowerCase();\n}\n"],"mappings":"oCAeA,SAAgB,EAAU,EAAqB,CAC7C,OAAO,EAAA,cAAc,EAAK,IAAI,CAAC,aAAa"}

package/dist/string/kebabCase.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Converts a string to kebab case.
+ *
+ * @example
+ * ```ts
+ * const text = 'Hello World';
+ * kebabCase(text); // 'hello-world'
+ * ```
+ *
+ * @param str - The string to convert.
+ *
+ * @returns The converted string.
+ */
+export declare function kebabCase(str: string): string;
+//# sourceMappingURL=kebabCase.d.ts.map

package/dist/string/kebabCase.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"kebabCase.d.ts","sourceRoot":"","sources":["../../src/string/kebabCase.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;GAYG;AACH,wBAAgB,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAE7C"}

package/dist/string/kebabCase.js

@@ -1,8 +1,9 @@
-import { normalizeCase as o } from "./_caseUtils.js";
-function a(e) {
-  return o(e, "-").toLowerCase();
+import { normalizeCase as e } from "./_caseUtils.js";
+//#region src/string/kebabCase.ts
+function t(t) {
+	return e(t, "-").toLowerCase();
 }
-export {
-  a as kebabCase
-};
-//# sourceMappingURL=kebabCase.js.map
+//#endregion
+export { t as kebabCase };
+
+//# sourceMappingURL=kebabCase.js.map

package/dist/string/kebabCase.js.map

@@ -1 +1 @@
-{"version":3,"file":"kebabCase.js","sources":["../../src/string/kebabCase.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Converts a string to kebab case.\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * kebabCase(text); // 'hello-world'\n * ```\n *\n * @param str - The string to convert.\n *\n * @returns The converted string.\n */\nexport function kebabCase(str: string): string {\n  return normalizeCase(str, '-').toLowerCase();\n}\n"],"names":["kebabCase","str","normalizeCase"],"mappings":";AAeO,SAASA,EAAUC,GAAqB;AAC7C,SAAOC,EAAcD,GAAK,GAAG,EAAE,YAAA;AACjC;"}
+{"version":3,"file":"kebabCase.js","names":[],"sources":["../../src/string/kebabCase.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Converts a string to kebab case.\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * kebabCase(text); // 'hello-world'\n * ```\n *\n * @param str - The string to convert.\n *\n * @returns The converted string.\n */\nexport function kebabCase(str: string): string {\n  return normalizeCase(str, '-').toLowerCase();\n}\n"],"mappings":";;AAeA,SAAgB,EAAU,GAAqB;AAC7C,QAAO,EAAc,GAAK,IAAI,CAAC,aAAa"}

package/dist/string/pascalCase.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./_caseUtils.cjs");function r(e){return s.normalizeCase(e," ").replace(/(?:^|\s)(\w)/g,(t,a)=>a.toUpperCase()).replace(/\s+/g,"")}exports.pascalCase=r;
-//# sourceMappingURL=pascalCase.cjs.map
+const e=require(`./_caseUtils.cjs`);function t(t){return e.normalizeCase(t,` `).replace(/(?:^|\s)(\w)/g,(e,t)=>t.toUpperCase()).replace(/\s+/g,``)}exports.pascalCase=t;
+//# sourceMappingURL=pascalCase.cjs.map

package/dist/string/pascalCase.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"pascalCase.cjs","sources":["../../src/string/pascalCase.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Converts a string to Pascal case.\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * pascalCase(text) // 'HelloWorld';\n * ```\n *\n * @param str - The string to convert.\n *\n * @returns The converted string.\n */\nexport function pascalCase(str: string): string {\n  return normalizeCase(str, ' ')\n    .replace(/(?:^|\\s)(\\w)/g, (_, char) => char.toUpperCase())\n    .replace(/\\s+/g, '');\n}\n"],"names":["pascalCase","str","normalizeCase","_","char"],"mappings":"oHAeO,SAASA,EAAWC,EAAqB,CAC9C,OAAOC,EAAAA,cAAcD,EAAK,GAAG,EAC1B,QAAQ,gBAAiB,CAACE,EAAGC,IAASA,EAAK,YAAA,CAAa,EACxD,QAAQ,OAAQ,EAAE,CACvB"}
+{"version":3,"file":"pascalCase.cjs","names":[],"sources":["../../src/string/pascalCase.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Converts a string to Pascal case.\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * pascalCase(text) // 'HelloWorld';\n * ```\n *\n * @param str - The string to convert.\n *\n * @returns The converted string.\n */\nexport function pascalCase(str: string): string {\n  return normalizeCase(str, ' ')\n    .replace(/(?:^|\\s)(\\w)/g, (_, char) => char.toUpperCase())\n    .replace(/\\s+/g, '');\n}\n"],"mappings":"oCAeA,SAAgB,EAAW,EAAqB,CAC9C,OAAO,EAAA,cAAc,EAAK,IAAI,CAC3B,QAAQ,iBAAkB,EAAG,IAAS,EAAK,aAAa,CAAC,CACzD,QAAQ,OAAQ,GAAG"}

package/dist/string/pascalCase.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Converts a string to Pascal case.
+ *
+ * @example
+ * ```ts
+ * const text = 'Hello World';
+ * pascalCase(text) // 'HelloWorld';
+ * ```
+ *
+ * @param str - The string to convert.
+ *
+ * @returns The converted string.
+ */
+export declare function pascalCase(str: string): string;
+//# sourceMappingURL=pascalCase.d.ts.map

package/dist/string/pascalCase.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pascalCase.d.ts","sourceRoot":"","sources":["../../src/string/pascalCase.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;GAYG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAI9C"}

package/dist/string/pascalCase.js

@@ -1,8 +1,9 @@
-import { normalizeCase as a } from "./_caseUtils.js";
-function s(e) {
-  return a(e, " ").replace(/(?:^|\s)(\w)/g, (p, r) => r.toUpperCase()).replace(/\s+/g, "");
+import { normalizeCase as e } from "./_caseUtils.js";
+//#region src/string/pascalCase.ts
+function t(t) {
+	return e(t, " ").replace(/(?:^|\s)(\w)/g, (e, t) => t.toUpperCase()).replace(/\s+/g, "");
 }
-export {
-  s as pascalCase
-};
-//# sourceMappingURL=pascalCase.js.map
+//#endregion
+export { t as pascalCase };
+
+//# sourceMappingURL=pascalCase.js.map

package/dist/string/pascalCase.js.map

@@ -1 +1 @@
-{"version":3,"file":"pascalCase.js","sources":["../../src/string/pascalCase.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Converts a string to Pascal case.\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * pascalCase(text) // 'HelloWorld';\n * ```\n *\n * @param str - The string to convert.\n *\n * @returns The converted string.\n */\nexport function pascalCase(str: string): string {\n  return normalizeCase(str, ' ')\n    .replace(/(?:^|\\s)(\\w)/g, (_, char) => char.toUpperCase())\n    .replace(/\\s+/g, '');\n}\n"],"names":["pascalCase","str","normalizeCase","_","char"],"mappings":";AAeO,SAASA,EAAWC,GAAqB;AAC9C,SAAOC,EAAcD,GAAK,GAAG,EAC1B,QAAQ,iBAAiB,CAACE,GAAGC,MAASA,EAAK,YAAA,CAAa,EACxD,QAAQ,QAAQ,EAAE;AACvB;"}
+{"version":3,"file":"pascalCase.js","names":[],"sources":["../../src/string/pascalCase.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Converts a string to Pascal case.\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * pascalCase(text) // 'HelloWorld';\n * ```\n *\n * @param str - The string to convert.\n *\n * @returns The converted string.\n */\nexport function pascalCase(str: string): string {\n  return normalizeCase(str, ' ')\n    .replace(/(?:^|\\s)(\\w)/g, (_, char) => char.toUpperCase())\n    .replace(/\\s+/g, '');\n}\n"],"mappings":";;AAeA,SAAgB,EAAW,GAAqB;AAC9C,QAAO,EAAc,GAAK,IAAI,CAC3B,QAAQ,kBAAkB,GAAG,MAAS,EAAK,aAAa,CAAC,CACzD,QAAQ,QAAQ,GAAG"}

package/dist/string/similarity.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("../function/assert.cjs");function y(l,g){f.assert(["string","number"].includes(typeof l)&&["string","number"].includes(typeof g),"Invalid arguments",{args:{str1:l,str2:g},type:TypeError});const n=String(l).toLowerCase(),t=String(g).toLowerCase();if(n===t)return 1;if(n.length===0)return t.length===0?1:0;if(t.length===0)return 0;const[a,c]=n.length<t.length?[n,t]:[t,n],s=a.length,h=c.length;let r=Array.from({length:s+1},(i,e)=>e),o=new Array(s+1);for(let i=1;i<=h;i++){o[0]=i;for(let e=1;e<=s;e++){const u=c[i-1]===a[e-1]?0:1;o[e]=Math.min(o[e-1]+1,r[e]+1,r[e-1]+u)}[r,o]=[o,r]}return 1-r[s]/Math.max(n.length,t.length)}exports.similarity=y;
-//# sourceMappingURL=similarity.cjs.map
+function e(e,t){let n=e.toLowerCase(),r=t.toLowerCase();if(n===r)return 1;if(n.length===0)return r.length===0?1:0;if(r.length===0)return 0;let[i,a]=n.length<r.length?[n,r]:[r,n],o=i.length,s=a.length,c=Array.from({length:o+1},(e,t)=>t),l=Array(o+1);for(let e=1;e<=s;e++){l[0]=e;for(let t=1;t<=o;t++){let n=a[e-1]===i[t-1]?0:1;l[t]=Math.min(l[t-1]+1,c[t]+1,c[t-1]+n)}[c,l]=[l,c]}return 1-c[o]/Math.max(n.length,r.length)}exports.similarity=e;
+//# sourceMappingURL=similarity.cjs.map

package/dist/string/similarity.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"similarity.cjs","sources":["../../src/string/similarity.ts"],"sourcesContent":["import { assert } from '../function/assert';\n\n/**\n * Calculate the similarity between two strings using the Levenshtein distance algorithm.\n *\n * @example\n * ```ts\n * similarity('abc', 'abc') // 1\n * similarity('a', 'b') // 0\n * similarity('ab', 'ac') // 0.5\n * similarity('doe', 'John Doe') // 0.25\n * similarity('abc', 'axc') // 0.6666666666666667\n * similarity('kitten', 'sitting') // 0.5714285714285714\n * ```\n *\n * @param str1 - The first string.\n * @param str2 - The second string.\n *\n * @returns A number between 0 and 1 representing the similarity between the two strings.\n */\nexport function similarity(str1: unknown, str2: unknown): number {\n  assert(\n    ['string', 'number'].includes(typeof str1) && ['string', 'number'].includes(typeof str2),\n    'Invalid arguments',\n    {\n      args: { str1, str2 },\n      type: TypeError,\n    },\n  );\n\n  const a = String(str1).toLowerCase();\n  const b = String(str2).toLowerCase();\n\n  if (a === b) return 1;\n  if (a.length === 0) return b.length === 0 ? 1 : 0;\n  if (b.length === 0) return 0;\n\n  // Swap to ensure we use the smaller string for columns (O(min(A,B)) space)\n  const [shorter, longer] = a.length < b.length ? [a, b] : [b, a];\n  const shorterLength = shorter.length;\n  const longerLength = longer.length;\n\n  let prevRow = Array.from({ length: shorterLength + 1 }, (_, i) => i);\n  let currRow = new Array(shorterLength + 1);\n\n  for (let i = 1; i <= longerLength; i++) {\n    currRow[0] = i;\n    for (let j = 1; j <= shorterLength; j++) {\n      const cost = longer[i - 1] === shorter[j - 1] ? 0 : 1;\n      currRow[j] = Math.min(\n        currRow[j - 1] + 1, // insertion\n        prevRow[j] + 1, // deletion\n        prevRow[j - 1] + cost, // substitution\n      );\n    }\n    // Swap rows for the next iteration (avoid allocation)\n    [prevRow, currRow] = [currRow, prevRow];\n  }\n\n  // After the loop, a result is in prevRow because of the swap\n  const distance = prevRow[shorterLength];\n\n  return 1 - distance / Math.max(a.length, b.length);\n}\n"],"names":["similarity","str1","str2","assert","a","b","shorter","longer","shorterLength","longerLength","prevRow","_","i","currRow","j","cost"],"mappings":"0HAoBO,SAASA,EAAWC,EAAeC,EAAuB,CAC/DC,EAAAA,OACE,CAAC,SAAU,QAAQ,EAAE,SAAS,OAAOF,CAAI,GAAK,CAAC,SAAU,QAAQ,EAAE,SAAS,OAAOC,CAAI,EACvF,oBACA,CACE,KAAM,CAAE,KAAAD,EAAM,KAAAC,CAAA,EACd,KAAM,SAAA,CACR,EAGF,MAAME,EAAI,OAAOH,CAAI,EAAE,YAAA,EACjBI,EAAI,OAAOH,CAAI,EAAE,YAAA,EAEvB,GAAIE,IAAMC,EAAG,MAAO,GACpB,GAAID,EAAE,SAAW,SAAUC,EAAE,SAAW,EAAI,EAAI,EAChD,GAAIA,EAAE,SAAW,EAAG,MAAO,GAG3B,KAAM,CAACC,EAASC,CAAM,EAAIH,EAAE,OAASC,EAAE,OAAS,CAACD,EAAGC,CAAC,EAAI,CAACA,EAAGD,CAAC,EACxDI,EAAgBF,EAAQ,OACxBG,EAAeF,EAAO,OAE5B,IAAIG,EAAU,MAAM,KAAK,CAAE,OAAQF,EAAgB,GAAK,CAACG,EAAGC,IAAMA,CAAC,EAC/DC,EAAU,IAAI,MAAML,EAAgB,CAAC,EAEzC,QAAS,EAAI,EAAG,GAAKC,EAAc,IAAK,CACtCI,EAAQ,CAAC,EAAI,EACb,QAASC,EAAI,EAAGA,GAAKN,EAAeM,IAAK,CACvC,MAAMC,EAAOR,EAAO,EAAI,CAAC,IAAMD,EAAQQ,EAAI,CAAC,EAAI,EAAI,EACpDD,EAAQC,CAAC,EAAI,KAAK,IAChBD,EAAQC,EAAI,CAAC,EAAI,EACjBJ,EAAQI,CAAC,EAAI,EACbJ,EAAQI,EAAI,CAAC,EAAIC,CAAA,CAErB,CAEA,CAACL,EAASG,CAAO,EAAI,CAACA,EAASH,CAAO,CACxC,CAKA,MAAO,GAFUA,EAAQF,CAAa,EAEhB,KAAK,IAAIJ,EAAE,OAAQC,EAAE,MAAM,CACnD"}
+{"version":3,"file":"similarity.cjs","names":[],"sources":["../../src/string/similarity.ts"],"sourcesContent":["/**\n * Calculate the similarity between two strings using the Levenshtein distance algorithm.\n *\n * @example\n * ```ts\n * similarity('abc', 'abc') // 1\n * similarity('a', 'b') // 0\n * similarity('ab', 'ac') // 0.5\n * similarity('doe', 'John Doe') // 0.25\n * similarity('abc', 'axc') // 0.6666666666666667\n * similarity('kitten', 'sitting') // 0.5714285714285714\n * ```\n *\n * @param str1 - The first string.\n * @param str2 - The second string.\n *\n * @returns A number between 0 and 1 representing the similarity between the two strings.\n */\nexport function similarity(str1: string, str2: string): number {\n  const a = str1.toLowerCase();\n  const b = str2.toLowerCase();\n\n  if (a === b) return 1;\n\n  if (a.length === 0) return b.length === 0 ? 1 : 0;\n\n  if (b.length === 0) return 0;\n\n  // Swap to ensure we use the smaller string for columns (O(min(A,B)) space)\n  const [shorter, longer] = a.length < b.length ? [a, b] : [b, a];\n  const shorterLength = shorter.length;\n  const longerLength = longer.length;\n\n  let prevRow = Array.from({ length: shorterLength + 1 }, (_, i) => i);\n  let currRow = new Array(shorterLength + 1);\n\n  for (let i = 1; i <= longerLength; i++) {\n    currRow[0] = i;\n    for (let j = 1; j <= shorterLength; j++) {\n      const cost = longer[i - 1] === shorter[j - 1] ? 0 : 1;\n\n      currRow[j] = Math.min(\n        currRow[j - 1] + 1, // insertion\n        prevRow[j] + 1, // deletion\n        prevRow[j - 1] + cost, // substitution\n      );\n    }\n    // Swap rows for the next iteration (avoid allocation)\n    [prevRow, currRow] = [currRow, prevRow];\n  }\n\n  // After the loop, a result is in prevRow because of the swap\n  const distance = prevRow[shorterLength];\n\n  return 1 - distance / Math.max(a.length, b.length);\n}\n"],"mappings":"AAkBA,SAAgB,EAAW,EAAc,EAAsB,CAC7D,IAAM,EAAI,EAAK,aAAa,CACtB,EAAI,EAAK,aAAa,CAE5B,GAAI,IAAM,EAAG,MAAO,GAEpB,GAAI,EAAE,SAAW,EAAG,OAAO,EAAE,SAAW,EAAI,EAAI,EAEhD,GAAI,EAAE,SAAW,EAAG,MAAO,GAG3B,GAAM,CAAC,EAAS,GAAU,EAAE,OAAS,EAAE,OAAS,CAAC,EAAG,EAAE,CAAG,CAAC,EAAG,EAAE,CACzD,EAAgB,EAAQ,OACxB,EAAe,EAAO,OAExB,EAAU,MAAM,KAAK,CAAE,OAAQ,EAAgB,EAAG,EAAG,EAAG,IAAM,EAAE,CAChE,EAAc,MAAM,EAAgB,EAAE,CAE1C,IAAK,IAAI,EAAI,EAAG,GAAK,EAAc,IAAK,CACtC,EAAQ,GAAK,EACb,IAAK,IAAI,EAAI,EAAG,GAAK,EAAe,IAAK,CACvC,IAAM,EAAO,EAAO,EAAI,KAAO,EAAQ,EAAI,GAAK,EAAI,EAEpD,EAAQ,GAAK,KAAK,IAChB,EAAQ,EAAI,GAAK,EACjB,EAAQ,GAAK,EACb,EAAQ,EAAI,GAAK,EAClB,CAGH,CAAC,EAAS,GAAW,CAAC,EAAS,EAAQ,CAMzC,MAAO,GAFU,EAAQ,GAEH,KAAK,IAAI,EAAE,OAAQ,EAAE,OAAO"}

package/dist/string/similarity.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Calculate the similarity between two strings using the Levenshtein distance algorithm.
+ *
+ * @example
+ * ```ts
+ * similarity('abc', 'abc') // 1
+ * similarity('a', 'b') // 0
+ * similarity('ab', 'ac') // 0.5
+ * similarity('doe', 'John Doe') // 0.25
+ * similarity('abc', 'axc') // 0.6666666666666667
+ * similarity('kitten', 'sitting') // 0.5714285714285714
+ * ```
+ *
+ * @param str1 - The first string.
+ * @param str2 - The second string.
+ *
+ * @returns A number between 0 and 1 representing the similarity between the two strings.
+ */
+export declare function similarity(str1: string, str2: string): number;
+//# sourceMappingURL=similarity.d.ts.map

package/dist/string/similarity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"similarity.d.ts","sourceRoot":"","sources":["../../src/string/similarity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAqC7D"}

package/dist/string/similarity.js

@@ -1,37 +1,21 @@
-import { assert as f } from "../function/assert.js";
-function y(i, s) {
-  f(
-    ["string", "number"].includes(typeof i) && ["string", "number"].includes(typeof s),
-    "Invalid arguments",
-    {
-      args: { str1: i, str2: s },
-      type: TypeError
-    }
-  );
-  const n = String(i).toLowerCase(), e = String(s).toLowerCase();
-  if (n === e) return 1;
-  if (n.length === 0) return e.length === 0 ? 1 : 0;
-  if (e.length === 0) return 0;
-  const [h, a] = n.length < e.length ? [n, e] : [e, n], l = h.length, c = a.length;
-  let r = Array.from({ length: l + 1 }, (g, t) => t), o = new Array(l + 1);
-  for (let g = 1; g <= c; g++) {
-    o[0] = g;
-    for (let t = 1; t <= l; t++) {
-      const u = a[g - 1] === h[t - 1] ? 0 : 1;
-      o[t] = Math.min(
-        o[t - 1] + 1,
-        // insertion
-        r[t] + 1,
-        // deletion
-        r[t - 1] + u
-        // substitution
-      );
-    }
-    [r, o] = [o, r];
-  }
-  return 1 - r[l] / Math.max(n.length, e.length);
+//#region src/string/similarity.ts
+function e(e, t) {
+	let n = e.toLowerCase(), r = t.toLowerCase();
+	if (n === r) return 1;
+	if (n.length === 0) return r.length === 0 ? 1 : 0;
+	if (r.length === 0) return 0;
+	let [i, a] = n.length < r.length ? [n, r] : [r, n], o = i.length, s = a.length, c = Array.from({ length: o + 1 }, (e, t) => t), l = Array(o + 1);
+	for (let e = 1; e <= s; e++) {
+		l[0] = e;
+		for (let t = 1; t <= o; t++) {
+			let n = a[e - 1] === i[t - 1] ? 0 : 1;
+			l[t] = Math.min(l[t - 1] + 1, c[t] + 1, c[t - 1] + n);
+		}
+		[c, l] = [l, c];
+	}
+	return 1 - c[o] / Math.max(n.length, r.length);
 }
-export {
-  y as similarity
-};
-//# sourceMappingURL=similarity.js.map
+//#endregion
+export { e as similarity };
+
+//# sourceMappingURL=similarity.js.map

package/dist/string/similarity.js.map

@@ -1 +1 @@
-{"version":3,"file":"similarity.js","sources":["../../src/string/similarity.ts"],"sourcesContent":["import { assert } from '../function/assert';\n\n/**\n * Calculate the similarity between two strings using the Levenshtein distance algorithm.\n *\n * @example\n * ```ts\n * similarity('abc', 'abc') // 1\n * similarity('a', 'b') // 0\n * similarity('ab', 'ac') // 0.5\n * similarity('doe', 'John Doe') // 0.25\n * similarity('abc', 'axc') // 0.6666666666666667\n * similarity('kitten', 'sitting') // 0.5714285714285714\n * ```\n *\n * @param str1 - The first string.\n * @param str2 - The second string.\n *\n * @returns A number between 0 and 1 representing the similarity between the two strings.\n */\nexport function similarity(str1: unknown, str2: unknown): number {\n  assert(\n    ['string', 'number'].includes(typeof str1) && ['string', 'number'].includes(typeof str2),\n    'Invalid arguments',\n    {\n      args: { str1, str2 },\n      type: TypeError,\n    },\n  );\n\n  const a = String(str1).toLowerCase();\n  const b = String(str2).toLowerCase();\n\n  if (a === b) return 1;\n  if (a.length === 0) return b.length === 0 ? 1 : 0;\n  if (b.length === 0) return 0;\n\n  // Swap to ensure we use the smaller string for columns (O(min(A,B)) space)\n  const [shorter, longer] = a.length < b.length ? [a, b] : [b, a];\n  const shorterLength = shorter.length;\n  const longerLength = longer.length;\n\n  let prevRow = Array.from({ length: shorterLength + 1 }, (_, i) => i);\n  let currRow = new Array(shorterLength + 1);\n\n  for (let i = 1; i <= longerLength; i++) {\n    currRow[0] = i;\n    for (let j = 1; j <= shorterLength; j++) {\n      const cost = longer[i - 1] === shorter[j - 1] ? 0 : 1;\n      currRow[j] = Math.min(\n        currRow[j - 1] + 1, // insertion\n        prevRow[j] + 1, // deletion\n        prevRow[j - 1] + cost, // substitution\n      );\n    }\n    // Swap rows for the next iteration (avoid allocation)\n    [prevRow, currRow] = [currRow, prevRow];\n  }\n\n  // After the loop, a result is in prevRow because of the swap\n  const distance = prevRow[shorterLength];\n\n  return 1 - distance / Math.max(a.length, b.length);\n}\n"],"names":["similarity","str1","str2","assert","a","b","shorter","longer","shorterLength","longerLength","prevRow","_","i","currRow","j","cost"],"mappings":";AAoBO,SAASA,EAAWC,GAAeC,GAAuB;AAC/D,EAAAC;AAAA,IACE,CAAC,UAAU,QAAQ,EAAE,SAAS,OAAOF,CAAI,KAAK,CAAC,UAAU,QAAQ,EAAE,SAAS,OAAOC,CAAI;AAAA,IACvF;AAAA,IACA;AAAA,MACE,MAAM,EAAE,MAAAD,GAAM,MAAAC,EAAA;AAAA,MACd,MAAM;AAAA,IAAA;AAAA,EACR;AAGF,QAAME,IAAI,OAAOH,CAAI,EAAE,YAAA,GACjBI,IAAI,OAAOH,CAAI,EAAE,YAAA;AAEvB,MAAIE,MAAMC,EAAG,QAAO;AACpB,MAAID,EAAE,WAAW,UAAUC,EAAE,WAAW,IAAI,IAAI;AAChD,MAAIA,EAAE,WAAW,EAAG,QAAO;AAG3B,QAAM,CAACC,GAASC,CAAM,IAAIH,EAAE,SAASC,EAAE,SAAS,CAACD,GAAGC,CAAC,IAAI,CAACA,GAAGD,CAAC,GACxDI,IAAgBF,EAAQ,QACxBG,IAAeF,EAAO;AAE5B,MAAIG,IAAU,MAAM,KAAK,EAAE,QAAQF,IAAgB,KAAK,CAACG,GAAGC,MAAMA,CAAC,GAC/DC,IAAU,IAAI,MAAML,IAAgB,CAAC;AAEzC,WAASI,IAAI,GAAGA,KAAKH,GAAcG,KAAK;AACtC,IAAAC,EAAQ,CAAC,IAAID;AACb,aAASE,IAAI,GAAGA,KAAKN,GAAeM,KAAK;AACvC,YAAMC,IAAOR,EAAOK,IAAI,CAAC,MAAMN,EAAQQ,IAAI,CAAC,IAAI,IAAI;AACpD,MAAAD,EAAQC,CAAC,IAAI,KAAK;AAAA,QAChBD,EAAQC,IAAI,CAAC,IAAI;AAAA;AAAA,QACjBJ,EAAQI,CAAC,IAAI;AAAA;AAAA,QACbJ,EAAQI,IAAI,CAAC,IAAIC;AAAA;AAAA,MAAA;AAAA,IAErB;AAEA,KAACL,GAASG,CAAO,IAAI,CAACA,GAASH,CAAO;AAAA,EACxC;AAKA,SAAO,IAFUA,EAAQF,CAAa,IAEhB,KAAK,IAAIJ,EAAE,QAAQC,EAAE,MAAM;AACnD;"}
+{"version":3,"file":"similarity.js","names":[],"sources":["../../src/string/similarity.ts"],"sourcesContent":["/**\n * Calculate the similarity between two strings using the Levenshtein distance algorithm.\n *\n * @example\n * ```ts\n * similarity('abc', 'abc') // 1\n * similarity('a', 'b') // 0\n * similarity('ab', 'ac') // 0.5\n * similarity('doe', 'John Doe') // 0.25\n * similarity('abc', 'axc') // 0.6666666666666667\n * similarity('kitten', 'sitting') // 0.5714285714285714\n * ```\n *\n * @param str1 - The first string.\n * @param str2 - The second string.\n *\n * @returns A number between 0 and 1 representing the similarity between the two strings.\n */\nexport function similarity(str1: string, str2: string): number {\n  const a = str1.toLowerCase();\n  const b = str2.toLowerCase();\n\n  if (a === b) return 1;\n\n  if (a.length === 0) return b.length === 0 ? 1 : 0;\n\n  if (b.length === 0) return 0;\n\n  // Swap to ensure we use the smaller string for columns (O(min(A,B)) space)\n  const [shorter, longer] = a.length < b.length ? [a, b] : [b, a];\n  const shorterLength = shorter.length;\n  const longerLength = longer.length;\n\n  let prevRow = Array.from({ length: shorterLength + 1 }, (_, i) => i);\n  let currRow = new Array(shorterLength + 1);\n\n  for (let i = 1; i <= longerLength; i++) {\n    currRow[0] = i;\n    for (let j = 1; j <= shorterLength; j++) {\n      const cost = longer[i - 1] === shorter[j - 1] ? 0 : 1;\n\n      currRow[j] = Math.min(\n        currRow[j - 1] + 1, // insertion\n        prevRow[j] + 1, // deletion\n        prevRow[j - 1] + cost, // substitution\n      );\n    }\n    // Swap rows for the next iteration (avoid allocation)\n    [prevRow, currRow] = [currRow, prevRow];\n  }\n\n  // After the loop, a result is in prevRow because of the swap\n  const distance = prevRow[shorterLength];\n\n  return 1 - distance / Math.max(a.length, b.length);\n}\n"],"mappings":";AAkBA,SAAgB,EAAW,GAAc,GAAsB;CAC7D,IAAM,IAAI,EAAK,aAAa,EACtB,IAAI,EAAK,aAAa;AAE5B,KAAI,MAAM,EAAG,QAAO;AAEpB,KAAI,EAAE,WAAW,EAAG,QAAO,EAAE,WAAW,IAAI,IAAI;AAEhD,KAAI,EAAE,WAAW,EAAG,QAAO;CAG3B,IAAM,CAAC,GAAS,KAAU,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,EACzD,IAAgB,EAAQ,QACxB,IAAe,EAAO,QAExB,IAAU,MAAM,KAAK,EAAE,QAAQ,IAAgB,GAAG,GAAG,GAAG,MAAM,EAAE,EAChE,IAAc,MAAM,IAAgB,EAAE;AAE1C,MAAK,IAAI,IAAI,GAAG,KAAK,GAAc,KAAK;AACtC,IAAQ,KAAK;AACb,OAAK,IAAI,IAAI,GAAG,KAAK,GAAe,KAAK;GACvC,IAAM,IAAO,EAAO,IAAI,OAAO,EAAQ,IAAI,KAAK,IAAI;AAEpD,KAAQ,KAAK,KAAK,IAChB,EAAQ,IAAI,KAAK,GACjB,EAAQ,KAAK,GACb,EAAQ,IAAI,KAAK,EAClB;;AAGH,GAAC,GAAS,KAAW,CAAC,GAAS,EAAQ;;AAMzC,QAAO,IAFU,EAAQ,KAEH,KAAK,IAAI,EAAE,QAAQ,EAAE,OAAO"}

package/dist/string/snakeCase.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./_caseUtils.cjs");function t(e){return s.normalizeCase(e,"_").toLowerCase()}exports.snakeCase=t;
-//# sourceMappingURL=snakeCase.cjs.map
+const e=require(`./_caseUtils.cjs`);function t(t){return e.normalizeCase(t,`_`).toLowerCase()}exports.snakeCase=t;
+//# sourceMappingURL=snakeCase.cjs.map

package/dist/string/snakeCase.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"snakeCase.cjs","sources":["../../src/string/snakeCase.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Converts a string to snake case.\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * toSnakeCase(text) // 'hello_world';\n * ```\n *\n * @param str - The string to convert.\n *\n * @returns The converted string.\n */\nexport function snakeCase(str: string): string {\n  return normalizeCase(str, '_').toLowerCase();\n}\n"],"names":["snakeCase","str","normalizeCase"],"mappings":"oHAeO,SAASA,EAAUC,EAAqB,CAC7C,OAAOC,gBAAcD,EAAK,GAAG,EAAE,YAAA,CACjC"}
+{"version":3,"file":"snakeCase.cjs","names":[],"sources":["../../src/string/snakeCase.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Converts a string to snake case.\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * toSnakeCase(text) // 'hello_world';\n * ```\n *\n * @param str - The string to convert.\n *\n * @returns The converted string.\n */\nexport function snakeCase(str: string): string {\n  return normalizeCase(str, '_').toLowerCase();\n}\n"],"mappings":"oCAeA,SAAgB,EAAU,EAAqB,CAC7C,OAAO,EAAA,cAAc,EAAK,IAAI,CAAC,aAAa"}

package/dist/string/snakeCase.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Converts a string to snake case.
+ *
+ * @example
+ * ```ts
+ * const text = 'Hello World';
+ * toSnakeCase(text) // 'hello_world';
+ * ```
+ *
+ * @param str - The string to convert.
+ *
+ * @returns The converted string.
+ */
+export declare function snakeCase(str: string): string;
+//# sourceMappingURL=snakeCase.d.ts.map

package/dist/string/snakeCase.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"snakeCase.d.ts","sourceRoot":"","sources":["../../src/string/snakeCase.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;GAYG;AACH,wBAAgB,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAE7C"}

package/dist/string/snakeCase.js

@@ -1,8 +1,9 @@
-import { normalizeCase as o } from "./_caseUtils.js";
-function a(e) {
-  return o(e, "_").toLowerCase();
+import { normalizeCase as e } from "./_caseUtils.js";
+//#region src/string/snakeCase.ts
+function t(t) {
+	return e(t, "_").toLowerCase();
 }
-export {
-  a as snakeCase
-};
-//# sourceMappingURL=snakeCase.js.map
+//#endregion
+export { t as snakeCase };
+
+//# sourceMappingURL=snakeCase.js.map

package/dist/string/snakeCase.js.map

@@ -1 +1 @@
-{"version":3,"file":"snakeCase.js","sources":["../../src/string/snakeCase.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Converts a string to snake case.\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * toSnakeCase(text) // 'hello_world';\n * ```\n *\n * @param str - The string to convert.\n *\n * @returns The converted string.\n */\nexport function snakeCase(str: string): string {\n  return normalizeCase(str, '_').toLowerCase();\n}\n"],"names":["snakeCase","str","normalizeCase"],"mappings":";AAeO,SAASA,EAAUC,GAAqB;AAC7C,SAAOC,EAAcD,GAAK,GAAG,EAAE,YAAA;AACjC;"}
+{"version":3,"file":"snakeCase.js","names":[],"sources":["../../src/string/snakeCase.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Converts a string to snake case.\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * toSnakeCase(text) // 'hello_world';\n * ```\n *\n * @param str - The string to convert.\n *\n * @returns The converted string.\n */\nexport function snakeCase(str: string): string {\n  return normalizeCase(str, '_').toLowerCase();\n}\n"],"mappings":";;AAeA,SAAgB,EAAU,GAAqB;AAC7C,QAAO,EAAc,GAAK,IAAI,CAAC,aAAa"}

package/dist/string/truncate.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("../function/assert.cjs");function o(t,e=25,s=!1,u="…"){if(n.assert(typeof t=="string","First argument must be a string",{args:{str:t},type:TypeError}),n.assert(typeof e=="number"&&e>=0&&Number.isFinite(e),"Limit must be a non-negative finite number",{args:{limit:e},type:TypeError}),t.length<=e)return t;const r=s?t.substring(0,e).lastIndexOf(" "):e,a=r>0?r:e;return`${t.substring(0,a).trim()}${u}`}exports.truncate=o;
-//# sourceMappingURL=truncate.cjs.map
+const e=require(`../function/assert.cjs`);function t(t,n=25,{completeWords:r=!1,ellipsis:i=`…`}={}){if(e.assert(typeof t==`string`,`First argument must be a string`,{args:{str:t},type:TypeError}),e.assert(typeof n==`number`&&n>=0&&Number.isFinite(n),`Limit must be a non-negative finite number`,{args:{limit:n},type:TypeError}),t.length<=n)return t;let a=n;if(r){let e=t.substring(0,n).lastIndexOf(` `);e>0&&(a=e)}return`${t.substring(0,a).trim()}${i}`}exports.truncate=t;
+//# sourceMappingURL=truncate.cjs.map