@vielzeug/arsenal 3.0.0 → 26.10.0

package/dist/string/escape.js.map

@@ -1 +1 @@
-{"version":3,"file":"escape.js","names":[],"sources":["../../src/string/escape.ts"],"sourcesContent":["const escapeMap: Record<string, string> = {\n  \"'\": '&#39;',\n  '\"': '&quot;',\n  '&': '&amp;',\n  '<': '&lt;',\n  '>': '&gt;',\n};\n\n/**\n * Escapes HTML entities.\n */\nexport function escape(value: string): string {\n  return value.replace(/[&<>\"']/g, (char) => escapeMap[char]);\n}\n"],"mappings":";AAAA,IAAM,IAAoC;CACxC,KAAK;CACL,MAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;AACP;AAKA,SAAgB,EAAO,GAAuB;CAC5C,OAAO,EAAM,QAAQ,aAAa,MAAS,EAAU,EAAK;AAC5D"}
+{"version":3,"file":"escape.js","names":[],"sources":["../../src/string/escape.ts"],"sourcesContent":["const escapeMap: Record<string, string> = {\n  \"'\": '&#39;',\n  '\"': '&quot;',\n  '&': '&amp;',\n  '<': '&lt;',\n  '>': '&gt;',\n};\n\n/**\n * Escapes HTML entities.\n */\nexport function escape(value: string): string {\n  return value.replace(/[&<>\"']/g, (char) => escapeMap[char]);\n}\n"],"mappings":"AAAA,IAAM,EAAoC,CACxC,IAAK,QACL,IAAK,SACL,IAAK,QACL,IAAK,OACL,IAAK,MACP,EAKA,SAAgB,OAAO,EAAuB,CAC5C,OAAO,EAAM,QAAQ,WAAa,GAAS,EAAU,EAAK,CAC5D"}

package/dist/string/index.js

@@ -1,12 +1 @@
-import { similarity as e } from "./similarity.js";
-import { camelCase as t } from "./camelCase.js";
-import { escape as n } from "./escape.js";
-import { kebabCase as r } from "./kebabCase.js";
-import { padCenter as i } from "./padCenter.js";
-import { pascalCase as a } from "./pascalCase.js";
-import { snakeCase as o } from "./snakeCase.js";
-import { words as s } from "./words.js";
-import { titleCase as c } from "./titleCase.js";
-import { truncate as l } from "./truncate.js";
-import { unescape as u } from "./unescape.js";
-export { t as camelCase, n as escape, r as kebabCase, i as padCenter, a as pascalCase, e as similarity, o as snakeCase, c as titleCase, l as truncate, u as unescape, s as words };
+import{similarity as e}from"./similarity.js";import{camelCase as t}from"./camelCase.js";import{escape as n}from"./escape.js";import{kebabCase as r}from"./kebabCase.js";import{padCenter as i}from"./padCenter.js";import{pascalCase as a}from"./pascalCase.js";import{snakeCase as o}from"./snakeCase.js";import{words as s}from"./words.js";import{titleCase as c}from"./titleCase.js";import{truncate as l}from"./truncate.js";import{unescape as u}from"./unescape.js";export{t as camelCase,n as escape,r as kebabCase,i as padCenter,a as pascalCase,e as similarity,o as snakeCase,c as titleCase,l as truncate,u as unescape,s as words};

package/dist/string/kebabCase.cjs

@@ -1,2 +1,2 @@
-const e=require("./_caseUtils.cjs");function t(t){return e.normalizeCase(t,`-`).toLowerCase()}exports.kebabCase=t;
+const e=require("./_caseUtils.cjs");function kebabCase(t){return e.normalizeCase(t,`-`).toLowerCase()}exports.kebabCase=kebabCase;
 //# sourceMappingURL=kebabCase.cjs.map

package/dist/string/kebabCase.cjs.map

@@ -1 +1 @@
-{"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,GAAG,CAAC,CAAC,YAAY,CAC7C"}
+{"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,UAAU,EAAqB,CAC7C,OAAO,EAAA,cAAc,EAAK,GAAG,CAAC,CAAC,YAAY,CAC7C"}

package/dist/string/kebabCase.js

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

package/dist/string/kebabCase.js.map

@@ -1 +1 @@
-{"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;CAC7C,OAAO,EAAc,GAAK,GAAG,CAAC,CAAC,YAAY;AAC7C"}
+{"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":"gDAeA,SAAgB,UAAU,EAAqB,CAC7C,OAAO,EAAc,EAAK,GAAG,CAAC,CAAC,YAAY,CAC7C"}

package/dist/string/padCenter.cjs

@@ -1,2 +1,2 @@
-function e(e,t,n=` `){if(t<=e.length)return e;let r=t-e.length,i=Math.floor(r/2);return e.padStart(e.length+i,n).padEnd(t,n)}exports.padCenter=e;
+function padCenter(e,t,n=` `){if(t<=e.length)return e;let r=t-e.length,i=Math.floor(r/2);return e.padStart(e.length+i,n).padEnd(t,n)}exports.padCenter=padCenter;
 //# sourceMappingURL=padCenter.cjs.map

package/dist/string/padCenter.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"padCenter.cjs","names":[],"sources":["../../src/string/padCenter.ts"],"sourcesContent":["/** Pads both sides of a string to reach `targetLength`. */\nexport function padCenter(value: string, targetLength: number, fill = ' '): string {\n  if (targetLength <= value.length) return value;\n\n  const total = targetLength - value.length;\n  const left = Math.floor(total / 2);\n\n  return value.padStart(value.length + left, fill).padEnd(targetLength, fill);\n}\n"],"mappings":"AACA,SAAgB,EAAU,EAAe,EAAsB,EAAO,IAAa,CACjF,GAAI,GAAgB,EAAM,OAAQ,OAAO,EAEzC,IAAM,EAAQ,EAAe,EAAM,OAC7B,EAAO,KAAK,MAAM,EAAQ,CAAC,EAEjC,OAAO,EAAM,SAAS,EAAM,OAAS,EAAM,CAAI,CAAC,CAAC,OAAO,EAAc,CAAI,CAC5E"}
+{"version":3,"file":"padCenter.cjs","names":[],"sources":["../../src/string/padCenter.ts"],"sourcesContent":["/** Pads both sides of a string to reach `targetLength`. */\nexport function padCenter(value: string, targetLength: number, fill = ' '): string {\n  if (targetLength <= value.length) return value;\n\n  const total = targetLength - value.length;\n  const left = Math.floor(total / 2);\n\n  return value.padStart(value.length + left, fill).padEnd(targetLength, fill);\n}\n"],"mappings":"AACA,SAAgB,UAAU,EAAe,EAAsB,EAAO,IAAa,CACjF,GAAI,GAAgB,EAAM,OAAQ,OAAO,EAEzC,IAAM,EAAQ,EAAe,EAAM,OAC7B,EAAO,KAAK,MAAM,EAAQ,CAAC,EAEjC,OAAO,EAAM,SAAS,EAAM,OAAS,EAAM,CAAI,CAAC,CAAC,OAAO,EAAc,CAAI,CAC5E"}

package/dist/string/padCenter.js

@@ -1,10 +1,2 @@
-//#region src/string/padCenter.ts
-function e(e, t, n = " ") {
-	if (t <= e.length) return e;
-	let r = t - e.length, i = Math.floor(r / 2);
-	return e.padStart(e.length + i, n).padEnd(t, n);
-}
-//#endregion
-export { e as padCenter };
-
+function padCenter(e,t,n=` `){if(t<=e.length)return e;let r=t-e.length,i=Math.floor(r/2);return e.padStart(e.length+i,n).padEnd(t,n)}export{padCenter};
 //# sourceMappingURL=padCenter.js.map

package/dist/string/padCenter.js.map

@@ -1 +1 @@
-{"version":3,"file":"padCenter.js","names":[],"sources":["../../src/string/padCenter.ts"],"sourcesContent":["/** Pads both sides of a string to reach `targetLength`. */\nexport function padCenter(value: string, targetLength: number, fill = ' '): string {\n  if (targetLength <= value.length) return value;\n\n  const total = targetLength - value.length;\n  const left = Math.floor(total / 2);\n\n  return value.padStart(value.length + left, fill).padEnd(targetLength, fill);\n}\n"],"mappings":";AACA,SAAgB,EAAU,GAAe,GAAsB,IAAO,KAAa;CACjF,IAAI,KAAgB,EAAM,QAAQ,OAAO;CAEzC,IAAM,IAAQ,IAAe,EAAM,QAC7B,IAAO,KAAK,MAAM,IAAQ,CAAC;CAEjC,OAAO,EAAM,SAAS,EAAM,SAAS,GAAM,CAAI,CAAC,CAAC,OAAO,GAAc,CAAI;AAC5E"}
+{"version":3,"file":"padCenter.js","names":[],"sources":["../../src/string/padCenter.ts"],"sourcesContent":["/** Pads both sides of a string to reach `targetLength`. */\nexport function padCenter(value: string, targetLength: number, fill = ' '): string {\n  if (targetLength <= value.length) return value;\n\n  const total = targetLength - value.length;\n  const left = Math.floor(total / 2);\n\n  return value.padStart(value.length + left, fill).padEnd(targetLength, fill);\n}\n"],"mappings":"AACA,SAAgB,UAAU,EAAe,EAAsB,EAAO,IAAa,CACjF,GAAI,GAAgB,EAAM,OAAQ,OAAO,EAEzC,IAAM,EAAQ,EAAe,EAAM,OAC7B,EAAO,KAAK,MAAM,EAAQ,CAAC,EAEjC,OAAO,EAAM,SAAS,EAAM,OAAS,EAAM,CAAI,CAAC,CAAC,OAAO,EAAc,CAAI,CAC5E"}

package/dist/string/pascalCase.cjs

@@ -1,2 +1,2 @@
-const e=require("./_caseUtils.cjs");function t(t){return e.normalizeCase(t,` `).replace(/(?:^|\s)(\p{L}|\p{N})/gu,(e,t)=>t.toUpperCase()).replace(/\s+/g,``)}exports.pascalCase=t;
+const e=require("./_caseUtils.cjs");function pascalCase(t){return e.normalizeCase(t,` `).replace(/(?:^|\s)(\p{L}|\p{N})/gu,(e,t)=>t.toUpperCase()).replace(/\s+/g,``)}exports.pascalCase=pascalCase;
 //# sourceMappingURL=pascalCase.cjs.map

package/dist/string/pascalCase.cjs.map

@@ -1 +1 @@
-{"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)(\\p{L}|\\p{N})/gu, (_, char) => char.toUpperCase())\n    .replace(/\\s+/g, '');\n}\n"],"mappings":"oCAeA,SAAgB,EAAW,EAAqB,CAC9C,OAAO,EAAA,cAAc,EAAK,GAAG,CAAC,CAC3B,QAAQ,2BAA4B,EAAG,IAAS,EAAK,YAAY,CAAC,CAAC,CACnE,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)(\\p{L}|\\p{N})/gu, (_, char) => char.toUpperCase())\n    .replace(/\\s+/g, '');\n}\n"],"mappings":"oCAeA,SAAgB,WAAW,EAAqB,CAC9C,OAAO,EAAA,cAAc,EAAK,GAAG,CAAC,CAC3B,QAAQ,2BAA4B,EAAG,IAAS,EAAK,YAAY,CAAC,CAAC,CACnE,QAAQ,OAAQ,EAAE,CACvB"}

package/dist/string/pascalCase.js

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

package/dist/string/pascalCase.js.map

@@ -1 +1 @@
-{"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)(\\p{L}|\\p{N})/gu, (_, char) => char.toUpperCase())\n    .replace(/\\s+/g, '');\n}\n"],"mappings":";;AAeA,SAAgB,EAAW,GAAqB;CAC9C,OAAO,EAAc,GAAK,GAAG,CAAC,CAC3B,QAAQ,4BAA4B,GAAG,MAAS,EAAK,YAAY,CAAC,CAAC,CACnE,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)(\\p{L}|\\p{N})/gu, (_, char) => char.toUpperCase())\n    .replace(/\\s+/g, '');\n}\n"],"mappings":"gDAeA,SAAgB,WAAW,EAAqB,CAC9C,OAAO,EAAc,EAAK,GAAG,CAAC,CAC3B,QAAQ,2BAA4B,EAAG,IAAS,EAAK,YAAY,CAAC,CAAC,CACnE,QAAQ,OAAQ,EAAE,CACvB"}

package/dist/string/similarity.cjs

@@ -1,2 +1,2 @@
-var e=1e4;function t(t,n){if(t.length>e||n.length>e)throw RangeError(`similarity: input strings must not exceed ${e} characters to prevent excessive memory usage`);let r=t.toLowerCase(),i=n.toLowerCase();if(r===i)return 1;if(r.length===0)return+(i.length===0);if(i.length===0)return 0;let[a,o]=r.length<i.length?[r,i]:[i,r],s=a.length,c=o.length,l=Array.from({length:s+1},(e,t)=>t),u=Array(s+1);for(let e=1;e<=c;e++){u[0]=e;for(let t=1;t<=s;t++){let n=o[e-1]===a[t-1]?0:1;u[t]=Math.min(u[t-1]+1,l[t]+1,l[t-1]+n)}[l,u]=[u,l]}return 1-l[s]/Math.max(r.length,i.length)}exports.similarity=t;
+var e=1e4;function similarity(t,n){if(t.length>e||n.length>e)throw RangeError(`similarity: input strings must not exceed ${e} characters to prevent excessive memory usage`);let r=t.toLowerCase(),i=n.toLowerCase();if(r===i)return 1;if(r.length===0)return+(i.length===0);if(i.length===0)return 0;let[a,o]=r.length<i.length?[r,i]:[i,r],s=a.length,c=o.length,l=Array.from({length:s+1},(e,t)=>t),u=Array(s+1);for(let e=1;e<=c;e++){u[0]=e;for(let t=1;t<=s;t++){let n=o[e-1]===a[t-1]?0:1;u[t]=Math.min(u[t-1]+1,l[t]+1,l[t-1]+n)}[l,u]=[u,l]}return 1-l[s]/Math.max(r.length,i.length)}exports.similarity=similarity;
 //# sourceMappingURL=similarity.cjs.map

package/dist/string/similarity.cjs.map

@@ -1 +1 @@
-{"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 *\n * @throws {RangeError} If either input string exceeds 10 000 characters.\n */\nconst MAX_SIMILARITY_LENGTH = 10_000;\n\nexport function similarity(str1: string, str2: string): number {\n  if (str1.length > MAX_SIMILARITY_LENGTH || str2.length > MAX_SIMILARITY_LENGTH) {\n    throw new RangeError(\n      `similarity: input strings must not exceed ${MAX_SIMILARITY_LENGTH} characters to prevent excessive memory usage`,\n    );\n  }\n\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":"AAoBA,IAAM,EAAwB,IAE9B,SAAgB,EAAW,EAAc,EAAsB,CAC7D,GAAI,EAAK,OAAS,GAAyB,EAAK,OAAS,EACvD,MAAU,WACR,6CAA6C,EAAsB,8CACrE,EAGF,IAAM,EAAI,EAAK,YAAY,EACrB,EAAI,EAAK,YAAY,EAE3B,GAAI,IAAM,EAAG,MAAO,GAEpB,GAAI,EAAE,SAAW,EAAG,MAAO,IAAE,SAAW,GAExC,GAAI,EAAE,SAAW,EAAG,MAAO,GAG3B,GAAM,CAAC,EAAS,GAAU,EAAE,OAAS,EAAE,OAAS,CAAC,EAAG,CAAC,EAAI,CAAC,EAAG,CAAC,EACxD,EAAgB,EAAQ,OACxB,EAAe,EAAO,OAExB,EAAU,MAAM,KAAK,CAAE,OAAQ,EAAgB,CAAE,GAAI,EAAG,IAAM,CAAC,EAC/D,EAAc,MAAM,EAAgB,CAAC,EAEzC,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,CACnB,CACF,CAEA,CAAC,EAAS,GAAW,CAAC,EAAS,CAAO,CACxC,CAKA,MAAO,GAFU,EAAQ,GAEH,KAAK,IAAI,EAAE,OAAQ,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 *\n * @throws {RangeError} If either input string exceeds 10 000 characters.\n */\nconst MAX_SIMILARITY_LENGTH = 10_000;\n\nexport function similarity(str1: string, str2: string): number {\n  if (str1.length > MAX_SIMILARITY_LENGTH || str2.length > MAX_SIMILARITY_LENGTH) {\n    throw new RangeError(\n      `similarity: input strings must not exceed ${MAX_SIMILARITY_LENGTH} characters to prevent excessive memory usage`,\n    );\n  }\n\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":"AAoBA,IAAM,EAAwB,IAE9B,SAAgB,WAAW,EAAc,EAAsB,CAC7D,GAAI,EAAK,OAAS,GAAyB,EAAK,OAAS,EACvD,MAAU,WACR,6CAA6C,EAAsB,8CACrE,EAGF,IAAM,EAAI,EAAK,YAAY,EACrB,EAAI,EAAK,YAAY,EAE3B,GAAI,IAAM,EAAG,MAAO,GAEpB,GAAI,EAAE,SAAW,EAAG,MAAO,IAAE,SAAW,GAExC,GAAI,EAAE,SAAW,EAAG,MAAO,GAG3B,GAAM,CAAC,EAAS,GAAU,EAAE,OAAS,EAAE,OAAS,CAAC,EAAG,CAAC,EAAI,CAAC,EAAG,CAAC,EACxD,EAAgB,EAAQ,OACxB,EAAe,EAAO,OAExB,EAAU,MAAM,KAAK,CAAE,OAAQ,EAAgB,CAAE,GAAI,EAAG,IAAM,CAAC,EAC/D,EAAc,MAAM,EAAgB,CAAC,EAEzC,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,CACnB,CACF,CAEA,CAAC,EAAS,GAAW,CAAC,EAAS,CAAO,CACxC,CAKA,MAAO,GAFU,EAAQ,GAEH,KAAK,IAAI,EAAE,OAAQ,EAAE,MAAM,CACnD"}

package/dist/string/similarity.js

@@ -1,23 +1,2 @@
-//#region src/string/similarity.ts
-var e = 1e4;
-function t(t, n) {
-	if (t.length > e || n.length > e) throw RangeError(`similarity: input strings must not exceed ${e} characters to prevent excessive memory usage`);
-	let r = t.toLowerCase(), i = n.toLowerCase();
-	if (r === i) return 1;
-	if (r.length === 0) return +(i.length === 0);
-	if (i.length === 0) return 0;
-	let [a, o] = r.length < i.length ? [r, i] : [i, r], s = a.length, c = o.length, l = Array.from({ length: s + 1 }, (e, t) => t), u = Array(s + 1);
-	for (let e = 1; e <= c; e++) {
-		u[0] = e;
-		for (let t = 1; t <= s; t++) {
-			let n = o[e - 1] === a[t - 1] ? 0 : 1;
-			u[t] = Math.min(u[t - 1] + 1, l[t] + 1, l[t - 1] + n);
-		}
-		[l, u] = [u, l];
-	}
-	return 1 - l[s] / Math.max(r.length, i.length);
-}
-//#endregion
-export { t as similarity };
-
+var e=1e4;function similarity(t,n){if(t.length>e||n.length>e)throw RangeError(`similarity: input strings must not exceed ${e} characters to prevent excessive memory usage`);let r=t.toLowerCase(),i=n.toLowerCase();if(r===i)return 1;if(r.length===0)return+(i.length===0);if(i.length===0)return 0;let[a,o]=r.length<i.length?[r,i]:[i,r],s=a.length,c=o.length,l=Array.from({length:s+1},(e,t)=>t),u=Array(s+1);for(let e=1;e<=c;e++){u[0]=e;for(let t=1;t<=s;t++){let n=o[e-1]===a[t-1]?0:1;u[t]=Math.min(u[t-1]+1,l[t]+1,l[t-1]+n)}[l,u]=[u,l]}return 1-l[s]/Math.max(r.length,i.length)}export{similarity};
 //# sourceMappingURL=similarity.js.map

package/dist/string/similarity.js.map

@@ -1 +1 @@
-{"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 *\n * @throws {RangeError} If either input string exceeds 10 000 characters.\n */\nconst MAX_SIMILARITY_LENGTH = 10_000;\n\nexport function similarity(str1: string, str2: string): number {\n  if (str1.length > MAX_SIMILARITY_LENGTH || str2.length > MAX_SIMILARITY_LENGTH) {\n    throw new RangeError(\n      `similarity: input strings must not exceed ${MAX_SIMILARITY_LENGTH} characters to prevent excessive memory usage`,\n    );\n  }\n\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":";AAoBA,IAAM,IAAwB;AAE9B,SAAgB,EAAW,GAAc,GAAsB;CAC7D,IAAI,EAAK,SAAS,KAAyB,EAAK,SAAS,GACvD,MAAU,WACR,6CAA6C,EAAsB,8CACrE;CAGF,IAAM,IAAI,EAAK,YAAY,GACrB,IAAI,EAAK,YAAY;CAE3B,IAAI,MAAM,GAAG,OAAO;CAEpB,IAAI,EAAE,WAAW,GAAG,OAAO,IAAE,WAAW;CAExC,IAAI,EAAE,WAAW,GAAG,OAAO;CAG3B,IAAM,CAAC,GAAS,KAAU,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GACxD,IAAgB,EAAQ,QACxB,IAAe,EAAO,QAExB,IAAU,MAAM,KAAK,EAAE,QAAQ,IAAgB,EAAE,IAAI,GAAG,MAAM,CAAC,GAC/D,IAAc,MAAM,IAAgB,CAAC;CAEzC,KAAK,IAAI,IAAI,GAAG,KAAK,GAAc,KAAK;EACtC,EAAQ,KAAK;EACb,KAAK,IAAI,IAAI,GAAG,KAAK,GAAe,KAAK;GACvC,IAAM,IAAO,EAAO,IAAI,OAAO,EAAQ,IAAI,KAAK,IAAI;GAEpD,EAAQ,KAAK,KAAK,IAChB,EAAQ,IAAI,KAAK,GACjB,EAAQ,KAAK,GACb,EAAQ,IAAI,KAAK,CACnB;EACF;EAEA,CAAC,GAAS,KAAW,CAAC,GAAS,CAAO;CACxC;CAKA,OAAO,IAFU,EAAQ,KAEH,KAAK,IAAI,EAAE,QAAQ,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 *\n * @throws {RangeError} If either input string exceeds 10 000 characters.\n */\nconst MAX_SIMILARITY_LENGTH = 10_000;\n\nexport function similarity(str1: string, str2: string): number {\n  if (str1.length > MAX_SIMILARITY_LENGTH || str2.length > MAX_SIMILARITY_LENGTH) {\n    throw new RangeError(\n      `similarity: input strings must not exceed ${MAX_SIMILARITY_LENGTH} characters to prevent excessive memory usage`,\n    );\n  }\n\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":"AAoBA,IAAM,EAAwB,IAE9B,SAAgB,WAAW,EAAc,EAAsB,CAC7D,GAAI,EAAK,OAAS,GAAyB,EAAK,OAAS,EACvD,MAAU,WACR,6CAA6C,EAAsB,8CACrE,EAGF,IAAM,EAAI,EAAK,YAAY,EACrB,EAAI,EAAK,YAAY,EAE3B,GAAI,IAAM,EAAG,MAAO,GAEpB,GAAI,EAAE,SAAW,EAAG,MAAO,IAAE,SAAW,GAExC,GAAI,EAAE,SAAW,EAAG,MAAO,GAG3B,GAAM,CAAC,EAAS,GAAU,EAAE,OAAS,EAAE,OAAS,CAAC,EAAG,CAAC,EAAI,CAAC,EAAG,CAAC,EACxD,EAAgB,EAAQ,OACxB,EAAe,EAAO,OAExB,EAAU,MAAM,KAAK,CAAE,OAAQ,EAAgB,CAAE,GAAI,EAAG,IAAM,CAAC,EAC/D,EAAc,MAAM,EAAgB,CAAC,EAEzC,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,CACnB,CACF,CAEA,CAAC,EAAS,GAAW,CAAC,EAAS,CAAO,CACxC,CAKA,MAAO,GAFU,EAAQ,GAEH,KAAK,IAAI,EAAE,OAAQ,EAAE,MAAM,CACnD"}

package/dist/string/snakeCase.cjs

@@ -1,2 +1,2 @@
-const e=require("./_caseUtils.cjs");function t(t){return e.normalizeCase(t,`_`).toLowerCase()}exports.snakeCase=t;
+const e=require("./_caseUtils.cjs");function snakeCase(t){return e.normalizeCase(t,`_`).toLowerCase()}exports.snakeCase=snakeCase;
 //# sourceMappingURL=snakeCase.cjs.map

package/dist/string/snakeCase.cjs.map

@@ -1 +1 @@
-{"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 * snakeCase(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,GAAG,CAAC,CAAC,YAAY,CAC7C"}
+{"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 * snakeCase(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,UAAU,EAAqB,CAC7C,OAAO,EAAA,cAAc,EAAK,GAAG,CAAC,CAAC,YAAY,CAC7C"}

package/dist/string/snakeCase.js

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

package/dist/string/snakeCase.js.map

@@ -1 +1 @@
-{"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 * snakeCase(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;CAC7C,OAAO,EAAc,GAAK,GAAG,CAAC,CAAC,YAAY;AAC7C"}
+{"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 * snakeCase(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":"gDAeA,SAAgB,UAAU,EAAqB,CAC7C,OAAO,EAAc,EAAK,GAAG,CAAC,CAAC,YAAY,CAC7C"}

package/dist/string/titleCase.cjs

@@ -1,2 +1,2 @@
-const e=require("./words.cjs");function t(t){return e.words(t).map(e=>e.charAt(0).toUpperCase()+e.slice(1).toLowerCase()).join(` `)}exports.titleCase=t;
+const e=require("./words.cjs");function titleCase(t){return e.words(t).map(e=>e.charAt(0).toUpperCase()+e.slice(1).toLowerCase()).join(` `)}exports.titleCase=titleCase;
 //# sourceMappingURL=titleCase.cjs.map

package/dist/string/titleCase.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"titleCase.cjs","names":[],"sources":["../../src/string/titleCase.ts"],"sourcesContent":["import { words } from './words';\n\n/**\n * Converts a string to title case.\n */\nexport function titleCase(str: string): string {\n  return words(str)\n    .map((word) => word.charAt(0).toUpperCase() + word.slice(1).toLowerCase())\n    .join(' ');\n}\n"],"mappings":"+BAKA,SAAgB,EAAU,EAAqB,CAC7C,OAAO,EAAA,MAAM,CAAG,CAAC,CACd,IAAK,GAAS,EAAK,OAAO,CAAC,CAAC,CAAC,YAAY,EAAI,EAAK,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CACzE,KAAK,GAAG,CACb"}
+{"version":3,"file":"titleCase.cjs","names":[],"sources":["../../src/string/titleCase.ts"],"sourcesContent":["import { words } from './words';\n\n/**\n * Converts a string to title case.\n */\nexport function titleCase(str: string): string {\n  return words(str)\n    .map((word) => word.charAt(0).toUpperCase() + word.slice(1).toLowerCase())\n    .join(' ');\n}\n"],"mappings":"+BAKA,SAAgB,UAAU,EAAqB,CAC7C,OAAO,EAAA,MAAM,CAAG,CAAC,CACd,IAAK,GAAS,EAAK,OAAO,CAAC,CAAC,CAAC,YAAY,EAAI,EAAK,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CACzE,KAAK,GAAG,CACb"}

package/dist/string/titleCase.js

@@ -1,9 +1,2 @@
-import { words as e } from "./words.js";
-//#region src/string/titleCase.ts
-function t(t) {
-	return e(t).map((e) => e.charAt(0).toUpperCase() + e.slice(1).toLowerCase()).join(" ");
-}
-//#endregion
-export { t as titleCase };
-
+import{words as e}from"./words.js";function titleCase(t){return e(t).map(e=>e.charAt(0).toUpperCase()+e.slice(1).toLowerCase()).join(` `)}export{titleCase};
 //# sourceMappingURL=titleCase.js.map

package/dist/string/titleCase.js.map

@@ -1 +1 @@
-{"version":3,"file":"titleCase.js","names":[],"sources":["../../src/string/titleCase.ts"],"sourcesContent":["import { words } from './words';\n\n/**\n * Converts a string to title case.\n */\nexport function titleCase(str: string): string {\n  return words(str)\n    .map((word) => word.charAt(0).toUpperCase() + word.slice(1).toLowerCase())\n    .join(' ');\n}\n"],"mappings":";;AAKA,SAAgB,EAAU,GAAqB;CAC7C,OAAO,EAAM,CAAG,CAAC,CACd,KAAK,MAAS,EAAK,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,EAAK,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CACzE,KAAK,GAAG;AACb"}
+{"version":3,"file":"titleCase.js","names":[],"sources":["../../src/string/titleCase.ts"],"sourcesContent":["import { words } from './words';\n\n/**\n * Converts a string to title case.\n */\nexport function titleCase(str: string): string {\n  return words(str)\n    .map((word) => word.charAt(0).toUpperCase() + word.slice(1).toLowerCase())\n    .join(' ');\n}\n"],"mappings":"mCAKA,SAAgB,UAAU,EAAqB,CAC7C,OAAO,EAAM,CAAG,CAAC,CACd,IAAK,GAAS,EAAK,OAAO,CAAC,CAAC,CAAC,YAAY,EAAI,EAAK,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CACzE,KAAK,GAAG,CACb"}

package/dist/string/truncate.cjs

@@ -1,2 +1,2 @@
-function e(e,t=25,{completeWords:n=!1,ellipsis:r=`…`}={}){if(typeof e!=`string`)throw TypeError(`truncate: str must be a string`);if(typeof t!=`number`||!Number.isFinite(t)||t<0)throw RangeError(`truncate: limit must be a non-negative finite number`);if(e.length<=t)return e;let i=t;if(n){let n=e.substring(0,t).lastIndexOf(` `);n>0&&(i=n)}return`${e.substring(0,i).trim()}${r}`}exports.truncate=e;
+function truncate(e,t=25,{completeWords:n=!1,ellipsis:r=`…`}={}){if(typeof e!=`string`)throw TypeError(`truncate: str must be a string`);if(typeof t!=`number`||!Number.isFinite(t)||t<0)throw RangeError(`truncate: limit must be a non-negative finite number`);if(e.length<=t)return e;let i=t;if(n){let n=e.substring(0,t).lastIndexOf(` `);n>0&&(i=n)}return`${e.substring(0,i).trim()}${r}`}exports.truncate=truncate;
 //# sourceMappingURL=truncate.cjs.map

package/dist/string/truncate.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"truncate.cjs","names":[],"sources":["../../src/string/truncate.ts"],"sourcesContent":["export type TruncateOptions = {\n  completeWords?: boolean;\n  ellipsis?: string;\n};\n\n/**\n * Truncates a string if it is longer than the given maximum string length. The last characters of the truncated string are replaced with the ellipsis sign \"…\".\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * truncate(text, 5); // 'Hello…'\n * truncate(text, 8, { completeWords: true }); // 'Hello…'\n * truncate(text, 5, { ellipsis: '...' }); // 'Hello...'\n * ```\n *\n * @param str - The string to truncate.\n * @param limit - The maximum string length.\n * @param options - Options for truncation.\n * @param [options.completeWords] - If true, truncate to the nearest word boundary.\n * @param [options.ellipsis] - Suffix appended after truncation (default: '…').\n *\n * @returns The truncated string.\n *\n * @throws {TypeError} If str is not a string.\n * @throws {RangeError} If limit is not a non-negative finite number.\n */\nexport function truncate(\n  str: string,\n  limit = 25,\n  { completeWords = false, ellipsis = '…' }: TruncateOptions = {},\n): string {\n  if (typeof str !== 'string') {\n    throw new TypeError('truncate: str must be a string');\n  }\n\n  if (typeof limit !== 'number' || !Number.isFinite(limit) || limit < 0) {\n    throw new RangeError('truncate: limit must be a non-negative finite number');\n  }\n\n  if (str.length <= limit) {\n    return str;\n  }\n\n  let end = limit;\n\n  if (completeWords) {\n    const wordEnd = str.substring(0, limit).lastIndexOf(' ');\n\n    if (wordEnd > 0) end = wordEnd;\n  }\n\n  return `${str.substring(0, end).trim()}${ellipsis}`;\n}\n"],"mappings":"AA2BA,SAAgB,EACd,EACA,EAAQ,GACR,CAAE,gBAAgB,GAAO,WAAW,KAAyB,CAAC,EACtD,CACR,GAAI,OAAO,GAAQ,SACjB,MAAU,UAAU,gCAAgC,EAGtD,GAAI,OAAO,GAAU,UAAY,CAAC,OAAO,SAAS,CAAK,GAAK,EAAQ,EAClE,MAAU,WAAW,sDAAsD,EAG7E,GAAI,EAAI,QAAU,EAChB,OAAO,EAGT,IAAI,EAAM,EAEV,GAAI,EAAe,CACjB,IAAM,EAAU,EAAI,UAAU,EAAG,CAAK,CAAC,CAAC,YAAY,GAAG,EAEnD,EAAU,IAAG,EAAM,EACzB,CAEA,MAAO,GAAG,EAAI,UAAU,EAAG,CAAG,CAAC,CAAC,KAAK,IAAI,GAC3C"}
+{"version":3,"file":"truncate.cjs","names":[],"sources":["../../src/string/truncate.ts"],"sourcesContent":["export type TruncateOptions = {\n  completeWords?: boolean;\n  ellipsis?: string;\n};\n\n/**\n * Truncates a string if it is longer than the given maximum string length. The last characters of the truncated string are replaced with the ellipsis sign \"…\".\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * truncate(text, 5); // 'Hello…'\n * truncate(text, 8, { completeWords: true }); // 'Hello…'\n * truncate(text, 5, { ellipsis: '...' }); // 'Hello...'\n * ```\n *\n * @param str - The string to truncate.\n * @param limit - The maximum string length.\n * @param options - Options for truncation.\n * @param [options.completeWords] - If true, truncate to the nearest word boundary.\n * @param [options.ellipsis] - Suffix appended after truncation (default: '…').\n *\n * @returns The truncated string.\n *\n * @throws {TypeError} If str is not a string.\n * @throws {RangeError} If limit is not a non-negative finite number.\n */\nexport function truncate(\n  str: string,\n  limit = 25,\n  { completeWords = false, ellipsis = '…' }: TruncateOptions = {},\n): string {\n  if (typeof str !== 'string') {\n    throw new TypeError('truncate: str must be a string');\n  }\n\n  if (typeof limit !== 'number' || !Number.isFinite(limit) || limit < 0) {\n    throw new RangeError('truncate: limit must be a non-negative finite number');\n  }\n\n  if (str.length <= limit) {\n    return str;\n  }\n\n  let end = limit;\n\n  if (completeWords) {\n    const wordEnd = str.substring(0, limit).lastIndexOf(' ');\n\n    if (wordEnd > 0) end = wordEnd;\n  }\n\n  return `${str.substring(0, end).trim()}${ellipsis}`;\n}\n"],"mappings":"AA2BA,SAAgB,SACd,EACA,EAAQ,GACR,CAAE,gBAAgB,GAAO,WAAW,KAAyB,CAAC,EACtD,CACR,GAAI,OAAO,GAAQ,SACjB,MAAU,UAAU,gCAAgC,EAGtD,GAAI,OAAO,GAAU,UAAY,CAAC,OAAO,SAAS,CAAK,GAAK,EAAQ,EAClE,MAAU,WAAW,sDAAsD,EAG7E,GAAI,EAAI,QAAU,EAChB,OAAO,EAGT,IAAI,EAAM,EAEV,GAAI,EAAe,CACjB,IAAM,EAAU,EAAI,UAAU,EAAG,CAAK,CAAC,CAAC,YAAY,GAAG,EAEnD,EAAU,IAAG,EAAM,EACzB,CAEA,MAAO,GAAG,EAAI,UAAU,EAAG,CAAG,CAAC,CAAC,KAAK,IAAI,GAC3C"}

package/dist/string/truncate.js

@@ -1,16 +1,2 @@
-//#region src/string/truncate.ts
-function e(e, t = 25, { completeWords: n = !1, ellipsis: r = "…" } = {}) {
-	if (typeof e != "string") throw TypeError("truncate: str must be a string");
-	if (typeof t != "number" || !Number.isFinite(t) || t < 0) throw RangeError("truncate: limit must be a non-negative finite number");
-	if (e.length <= t) return e;
-	let i = t;
-	if (n) {
-		let n = e.substring(0, t).lastIndexOf(" ");
-		n > 0 && (i = n);
-	}
-	return `${e.substring(0, i).trim()}${r}`;
-}
-//#endregion
-export { e as truncate };
-
+function truncate(e,t=25,{completeWords:n=!1,ellipsis:r=`…`}={}){if(typeof e!=`string`)throw TypeError(`truncate: str must be a string`);if(typeof t!=`number`||!Number.isFinite(t)||t<0)throw RangeError(`truncate: limit must be a non-negative finite number`);if(e.length<=t)return e;let i=t;if(n){let n=e.substring(0,t).lastIndexOf(` `);n>0&&(i=n)}return`${e.substring(0,i).trim()}${r}`}export{truncate};
 //# sourceMappingURL=truncate.js.map

package/dist/string/truncate.js.map

@@ -1 +1 @@
-{"version":3,"file":"truncate.js","names":[],"sources":["../../src/string/truncate.ts"],"sourcesContent":["export type TruncateOptions = {\n  completeWords?: boolean;\n  ellipsis?: string;\n};\n\n/**\n * Truncates a string if it is longer than the given maximum string length. The last characters of the truncated string are replaced with the ellipsis sign \"…\".\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * truncate(text, 5); // 'Hello…'\n * truncate(text, 8, { completeWords: true }); // 'Hello…'\n * truncate(text, 5, { ellipsis: '...' }); // 'Hello...'\n * ```\n *\n * @param str - The string to truncate.\n * @param limit - The maximum string length.\n * @param options - Options for truncation.\n * @param [options.completeWords] - If true, truncate to the nearest word boundary.\n * @param [options.ellipsis] - Suffix appended after truncation (default: '…').\n *\n * @returns The truncated string.\n *\n * @throws {TypeError} If str is not a string.\n * @throws {RangeError} If limit is not a non-negative finite number.\n */\nexport function truncate(\n  str: string,\n  limit = 25,\n  { completeWords = false, ellipsis = '…' }: TruncateOptions = {},\n): string {\n  if (typeof str !== 'string') {\n    throw new TypeError('truncate: str must be a string');\n  }\n\n  if (typeof limit !== 'number' || !Number.isFinite(limit) || limit < 0) {\n    throw new RangeError('truncate: limit must be a non-negative finite number');\n  }\n\n  if (str.length <= limit) {\n    return str;\n  }\n\n  let end = limit;\n\n  if (completeWords) {\n    const wordEnd = str.substring(0, limit).lastIndexOf(' ');\n\n    if (wordEnd > 0) end = wordEnd;\n  }\n\n  return `${str.substring(0, end).trim()}${ellipsis}`;\n}\n"],"mappings":";AA2BA,SAAgB,EACd,GACA,IAAQ,IACR,EAAE,mBAAgB,IAAO,cAAW,QAAyB,CAAC,GACtD;CACR,IAAI,OAAO,KAAQ,UACjB,MAAU,UAAU,gCAAgC;CAGtD,IAAI,OAAO,KAAU,YAAY,CAAC,OAAO,SAAS,CAAK,KAAK,IAAQ,GAClE,MAAU,WAAW,sDAAsD;CAG7E,IAAI,EAAI,UAAU,GAChB,OAAO;CAGT,IAAI,IAAM;CAEV,IAAI,GAAe;EACjB,IAAM,IAAU,EAAI,UAAU,GAAG,CAAK,CAAC,CAAC,YAAY,GAAG;EAEvD,AAAI,IAAU,MAAG,IAAM;CACzB;CAEA,OAAO,GAAG,EAAI,UAAU,GAAG,CAAG,CAAC,CAAC,KAAK,IAAI;AAC3C"}
+{"version":3,"file":"truncate.js","names":[],"sources":["../../src/string/truncate.ts"],"sourcesContent":["export type TruncateOptions = {\n  completeWords?: boolean;\n  ellipsis?: string;\n};\n\n/**\n * Truncates a string if it is longer than the given maximum string length. The last characters of the truncated string are replaced with the ellipsis sign \"…\".\n *\n * @example\n * ```ts\n * const text = 'Hello World';\n * truncate(text, 5); // 'Hello…'\n * truncate(text, 8, { completeWords: true }); // 'Hello…'\n * truncate(text, 5, { ellipsis: '...' }); // 'Hello...'\n * ```\n *\n * @param str - The string to truncate.\n * @param limit - The maximum string length.\n * @param options - Options for truncation.\n * @param [options.completeWords] - If true, truncate to the nearest word boundary.\n * @param [options.ellipsis] - Suffix appended after truncation (default: '…').\n *\n * @returns The truncated string.\n *\n * @throws {TypeError} If str is not a string.\n * @throws {RangeError} If limit is not a non-negative finite number.\n */\nexport function truncate(\n  str: string,\n  limit = 25,\n  { completeWords = false, ellipsis = '…' }: TruncateOptions = {},\n): string {\n  if (typeof str !== 'string') {\n    throw new TypeError('truncate: str must be a string');\n  }\n\n  if (typeof limit !== 'number' || !Number.isFinite(limit) || limit < 0) {\n    throw new RangeError('truncate: limit must be a non-negative finite number');\n  }\n\n  if (str.length <= limit) {\n    return str;\n  }\n\n  let end = limit;\n\n  if (completeWords) {\n    const wordEnd = str.substring(0, limit).lastIndexOf(' ');\n\n    if (wordEnd > 0) end = wordEnd;\n  }\n\n  return `${str.substring(0, end).trim()}${ellipsis}`;\n}\n"],"mappings":"AA2BA,SAAgB,SACd,EACA,EAAQ,GACR,CAAE,gBAAgB,GAAO,WAAW,KAAyB,CAAC,EACtD,CACR,GAAI,OAAO,GAAQ,SACjB,MAAU,UAAU,gCAAgC,EAGtD,GAAI,OAAO,GAAU,UAAY,CAAC,OAAO,SAAS,CAAK,GAAK,EAAQ,EAClE,MAAU,WAAW,sDAAsD,EAG7E,GAAI,EAAI,QAAU,EAChB,OAAO,EAGT,IAAI,EAAM,EAEV,GAAI,EAAe,CACjB,IAAM,EAAU,EAAI,UAAU,EAAG,CAAK,CAAC,CAAC,YAAY,GAAG,EAEnD,EAAU,IAAG,EAAM,EACzB,CAEA,MAAO,GAAG,EAAI,UAAU,EAAG,CAAG,CAAC,CAAC,KAAK,IAAI,GAC3C"}

package/dist/string/unescape.cjs

@@ -1,2 +1,2 @@
-var e={"&#39;":`'`,"&amp;":`&`,"&gt;":`>`,"&lt;":`<`,"&quot;":`"`};function t(t){return t.replace(/&(amp|lt|gt|quot|#39);/g,t=>e[t]??t)}exports.unescape=t;
+var e={"&#39;":`'`,"&amp;":`&`,"&gt;":`>`,"&lt;":`<`,"&quot;":`"`};function unescape(t){return t.replace(/&(amp|lt|gt|quot|#39);/g,t=>e[t]??t)}exports.unescape=unescape;
 //# sourceMappingURL=unescape.cjs.map

package/dist/string/unescape.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"unescape.cjs","names":[],"sources":["../../src/string/unescape.ts"],"sourcesContent":["const unescapeMap: Record<string, string> = {\n  '&#39;': \"'\",\n  '&amp;': '&',\n  '&gt;': '>',\n  '&lt;': '<',\n  '&quot;': '\"',\n};\n\n/**\n * Unescapes HTML entities.\n */\nexport function unescape(value: string): string {\n  return value.replace(/&(amp|lt|gt|quot|#39);/g, (entity) => unescapeMap[entity] ?? entity);\n}\n"],"mappings":"AAAA,IAAM,EAAsC,CAC1C,QAAS,IACT,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,GACZ,EAKA,SAAgB,EAAS,EAAuB,CAC9C,OAAO,EAAM,QAAQ,0BAA4B,GAAW,EAAY,IAAW,CAAM,CAC3F"}
+{"version":3,"file":"unescape.cjs","names":[],"sources":["../../src/string/unescape.ts"],"sourcesContent":["const unescapeMap: Record<string, string> = {\n  '&#39;': \"'\",\n  '&amp;': '&',\n  '&gt;': '>',\n  '&lt;': '<',\n  '&quot;': '\"',\n};\n\n/**\n * Unescapes HTML entities.\n */\nexport function unescape(value: string): string {\n  return value.replace(/&(amp|lt|gt|quot|#39);/g, (entity) => unescapeMap[entity] ?? entity);\n}\n"],"mappings":"AAAA,IAAM,EAAsC,CAC1C,QAAS,IACT,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,GACZ,EAKA,SAAgB,SAAS,EAAuB,CAC9C,OAAO,EAAM,QAAQ,0BAA4B,GAAW,EAAY,IAAW,CAAM,CAC3F"}

package/dist/string/unescape.js

@@ -1,15 +1,2 @@
-//#region src/string/unescape.ts
-var e = {
-	"'": "'",
-	"&": "&",
-	">": ">",
-	"&lt;": "<",
-	"&quot;": "\""
-};
-function t(t) {
-	return t.replace(/&(amp|lt|gt|quot|#39);/g, (t) => e[t] ?? t);
-}
-//#endregion
-export { t as unescape };
-
+var e={"&#39;":`'`,"&amp;":`&`,"&gt;":`>`,"&lt;":`<`,"&quot;":`"`};function unescape(t){return t.replace(/&(amp|lt|gt|quot|#39);/g,t=>e[t]??t)}export{unescape};
 //# sourceMappingURL=unescape.js.map

package/dist/string/unescape.js.map

@@ -1 +1 @@
-{"version":3,"file":"unescape.js","names":[],"sources":["../../src/string/unescape.ts"],"sourcesContent":["const unescapeMap: Record<string, string> = {\n  '&#39;': \"'\",\n  '&amp;': '&',\n  '&gt;': '>',\n  '&lt;': '<',\n  '&quot;': '\"',\n};\n\n/**\n * Unescapes HTML entities.\n */\nexport function unescape(value: string): string {\n  return value.replace(/&(amp|lt|gt|quot|#39);/g, (entity) => unescapeMap[entity] ?? entity);\n}\n"],"mappings":";AAAA,IAAM,IAAsC;CAC1C,SAAS;CACT,SAAS;CACT,QAAQ;CACR,QAAQ;CACR,UAAU;AACZ;AAKA,SAAgB,EAAS,GAAuB;CAC9C,OAAO,EAAM,QAAQ,4BAA4B,MAAW,EAAY,MAAW,CAAM;AAC3F"}
+{"version":3,"file":"unescape.js","names":[],"sources":["../../src/string/unescape.ts"],"sourcesContent":["const unescapeMap: Record<string, string> = {\n  '&#39;': \"'\",\n  '&amp;': '&',\n  '&gt;': '>',\n  '&lt;': '<',\n  '&quot;': '\"',\n};\n\n/**\n * Unescapes HTML entities.\n */\nexport function unescape(value: string): string {\n  return value.replace(/&(amp|lt|gt|quot|#39);/g, (entity) => unescapeMap[entity] ?? entity);\n}\n"],"mappings":"AAAA,IAAM,EAAsC,CAC1C,QAAS,IACT,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,GACZ,EAKA,SAAgB,SAAS,EAAuB,CAC9C,OAAO,EAAM,QAAQ,0BAA4B,GAAW,EAAY,IAAW,CAAM,CAC3F"}

package/dist/string/words.cjs

@@ -1,2 +1,2 @@
-const e=require("./_caseUtils.cjs");function t(t){let n=e.normalizeCase(t,` `);return n?n.split(` `).filter(Boolean):[]}exports.words=t;
+const e=require("./_caseUtils.cjs");function words(t){let n=e.normalizeCase(t,` `);return n?n.split(` `).filter(Boolean):[]}exports.words=words;
 //# sourceMappingURL=words.cjs.map

package/dist/string/words.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"words.cjs","names":[],"sources":["../../src/string/words.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Splits a string into normalized words.\n */\nexport function words(str: string): string[] {\n  const normalized = normalizeCase(str, ' ');\n\n  if (!normalized) return [];\n\n  return normalized.split(' ').filter(Boolean);\n}\n"],"mappings":"oCAKA,SAAgB,EAAM,EAAuB,CAC3C,IAAM,EAAa,EAAA,cAAc,EAAK,GAAG,EAIzC,OAFK,EAEE,EAAW,MAAM,GAAG,CAAC,CAAC,OAAO,OAAO,EAFnB,CAAC,CAG3B"}
+{"version":3,"file":"words.cjs","names":[],"sources":["../../src/string/words.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Splits a string into normalized words.\n */\nexport function words(str: string): string[] {\n  const normalized = normalizeCase(str, ' ');\n\n  if (!normalized) return [];\n\n  return normalized.split(' ').filter(Boolean);\n}\n"],"mappings":"oCAKA,SAAgB,MAAM,EAAuB,CAC3C,IAAM,EAAa,EAAA,cAAc,EAAK,GAAG,EAIzC,OAFK,EAEE,EAAW,MAAM,GAAG,CAAC,CAAC,OAAO,OAAO,EAFnB,CAAC,CAG3B"}

package/dist/string/words.js

@@ -1,10 +1,2 @@
-import { normalizeCase as e } from "./_caseUtils.js";
-//#region src/string/words.ts
-function t(t) {
-	let n = e(t, " ");
-	return n ? n.split(" ").filter(Boolean) : [];
-}
-//#endregion
-export { t as words };
-
+import{normalizeCase as e}from"./_caseUtils.js";function words(t){let n=e(t,` `);return n?n.split(` `).filter(Boolean):[]}export{words};
 //# sourceMappingURL=words.js.map

package/dist/string/words.js.map

@@ -1 +1 @@
-{"version":3,"file":"words.js","names":[],"sources":["../../src/string/words.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Splits a string into normalized words.\n */\nexport function words(str: string): string[] {\n  const normalized = normalizeCase(str, ' ');\n\n  if (!normalized) return [];\n\n  return normalized.split(' ').filter(Boolean);\n}\n"],"mappings":";;AAKA,SAAgB,EAAM,GAAuB;CAC3C,IAAM,IAAa,EAAc,GAAK,GAAG;CAIzC,OAFK,IAEE,EAAW,MAAM,GAAG,CAAC,CAAC,OAAO,OAAO,IAFnB,CAAC;AAG3B"}
+{"version":3,"file":"words.js","names":[],"sources":["../../src/string/words.ts"],"sourcesContent":["import { normalizeCase } from './_caseUtils';\n\n/**\n * Splits a string into normalized words.\n */\nexport function words(str: string): string[] {\n  const normalized = normalizeCase(str, ' ');\n\n  if (!normalized) return [];\n\n  return normalized.split(' ').filter(Boolean);\n}\n"],"mappings":"gDAKA,SAAgB,MAAM,EAAuB,CAC3C,IAAM,EAAa,EAAc,EAAK,GAAG,EAIzC,OAFK,EAEE,EAAW,MAAM,GAAG,CAAC,CAAC,OAAO,OAAO,EAFnB,CAAC,CAG3B"}

package/dist/types.d.ts

@@ -1,5 +1,15 @@
 /** A function that tears down a subscription or listener registration. */
 export type Unsubscribe = () => void;
+/**
+ * Canonical read-only observable contract: `getSnapshot()` reads current state,
+ * `subscribe()` registers a change listener and returns an unsubscribe function.
+ * Structural by design — implementations live in other packages (ripple,
+ * sentinel, wayfinder, ledger) without depending on arsenal at runtime.
+ */
+export interface Subscribable<T> {
+    getSnapshot(): T;
+    subscribe(listener: () => void): Unsubscribe;
+}
 export type Fn<Args extends unknown[] = never[], Result = unknown> = (...args: Args) => Result;
 export type Obj = Record<string, unknown>;
 /**

package/dist/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,MAAM,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC;AAErC,MAAM,MAAM,EAAE,CAAC,IAAI,SAAS,OAAO,EAAE,GAAG,KAAK,EAAE,EAAE,MAAM,GAAG,OAAO,IAAI,CAAC,GAAG,IAAI,EAAE,IAAI,KAAK,MAAM,CAAC;AAE/F,MAAM,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAE1C;;;;GAIG;AACH,MAAM,MAAM,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC;AAEjD,MAAM,MAAM,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;AAE/C,MAAM,MAAM,SAAS,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,MAAM,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC;AAErC;;;;;GAKG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC;IAC7B,WAAW,IAAI,CAAC,CAAC;IACjB,SAAS,CAAC,QAAQ,EAAE,MAAM,IAAI,GAAG,WAAW,CAAC;CAC9C;AAED,MAAM,MAAM,EAAE,CAAC,IAAI,SAAS,OAAO,EAAE,GAAG,KAAK,EAAE,EAAE,MAAM,GAAG,OAAO,IAAI,CAAC,GAAG,IAAI,EAAE,IAAI,KAAK,MAAM,CAAC;AAE/F,MAAM,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAE1C;;;;GAIG;AACH,MAAM,MAAM,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC;AAEjD,MAAM,MAAM,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;AAE/C,MAAM,MAAM,SAAS,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC"}

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@vielzeug/arsenal",
-  "version": "3.0.0",
-  "description": "Tree-shakeable TypeScript utility library — array, object, string, async, cache, math, and more",
+  "version": "26.10.0",
+  "description": "Non-trivial TypeScript utilities — retry, cancellation, cache, safe-path, serialization, prototype-pollution-guarded collections",
   "repository": {
     "type": "git",
     "url": "https://github.com/helmuthdu/vielzeug",
@@ -38,6 +38,11 @@
       "import": "./dist/cache/index.js",
       "require": "./dist/cache/index.cjs"
     },
+    "./encoding": {
+      "types": "./dist/encoding/index.d.ts",
+      "import": "./dist/encoding/index.js",
+      "require": "./dist/encoding/index.cjs"
+    },
     "./function": {
       "types": "./dist/function/index.d.ts",
       "import": "./dist/function/index.js",
@@ -80,6 +85,9 @@
       "cache": [
         "dist/cache/index.d.ts"
       ],
+      "encoding": [
+        "dist/encoding/index.d.ts"
+      ],
       "function": [
         "dist/function/index.d.ts"
       ],
@@ -118,9 +126,9 @@
     "verify:exports": "node ./scripts/sync-exports.mjs --check"
   },
   "devDependencies": {
-    "@types/node": "^26.4.1",
+    "@types/node": "^26.6.2",
     "typescript": "^6.0.3",
-    "vite": "^8.2.2",
-    "vitest": "^5.0.0"
+    "vite": "^8.3.0",
+    "vitest": "^5.0.1"
   }
 }