@scalar/helpers 0.1.1 → 0.1.3

package/CHANGELOG.md

@@ -1,5 +1,21 @@
 # @scalar/helpers
 
+## 0.1.3
+
+### Patch Changes
+
+- [#7387](https://github.com/scalar/scalar/pull/7387) [`bfd814a`](https://github.com/scalar/scalar/commit/bfd814a4219660face190041cc4845182b56ab03) Thanks [@geoffgscott](https://github.com/geoffgscott)! - hotfix: patch exports from build tooling bug
+
+- [#7416](https://github.com/scalar/scalar/pull/7416) [`86f028d`](https://github.com/scalar/scalar/commit/86f028deb0b456f923edd261f5f4b0fa9b616b7d) Thanks [@amritk](https://github.com/amritk)! - feat: add update method to client v2
+
+## 0.1.2
+
+### Patch Changes
+
+- [#7392](https://github.com/scalar/scalar/pull/7392) [`d86f1d6`](https://github.com/scalar/scalar/commit/d86f1d6911ecbca70b011a2a0efb6d6e0eca59bb) Thanks [@amritk](https://github.com/amritk)! - fix: move away from wasm hashing algo
+
+- [#7348](https://github.com/scalar/scalar/pull/7348) [`cded2d6`](https://github.com/scalar/scalar/commit/cded2d6c087418c3c44731d344d0827a87b78b74) Thanks [@hwkr](https://github.com/hwkr)! - feat(components): add ScalarWrappingText component
+
 ## 0.1.1
 
 ### Patch Changes

package/dist/object/prevent-pollution.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Validates that a key is safe to use and does not pose a prototype pollution risk.
+ * Throws an error if a dangerous key is detected.
+ *
+ * @param key - The key to validate
+ * @param context - Optional context string to help identify where the validation failed
+ * @throws {Error} If the key matches a known prototype pollution vector
+ *
+ * @example
+ * ```ts
+ * preventPollution('__proto__') // throws Error
+ * preventPollution('safeName') // passes
+ * preventPollution('constructor', 'operation update') // throws Error with context
+ * ```
+ */
+export declare const preventPollution: (key: string, context?: string) => void;
+//# sourceMappingURL=prevent-pollution.d.ts.map

package/dist/object/prevent-pollution.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prevent-pollution.d.ts","sourceRoot":"","sources":["../../src/object/prevent-pollution.ts"],"names":[],"mappings":"AAMA;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,gBAAgB,GAAI,KAAK,MAAM,EAAE,UAAU,MAAM,KAAG,IAQhE,CAAA"}

package/dist/object/prevent-pollution.js

@@ -0,0 +1,11 @@
+const PROTOTYPE_POLLUTION_KEYS = ["__proto__", "prototype", "constructor"];
+const preventPollution = (key, context) => {
+  if (PROTOTYPE_POLLUTION_KEYS.includes(key)) {
+    const errorMessage = context ? `Prototype pollution key detected: "${key}" in ${context}` : `Prototype pollution key detected: "${key}"`;
+    throw new Error(errorMessage);
+  }
+};
+export {
+  preventPollution
+};
+//# sourceMappingURL=prevent-pollution.js.map

package/dist/object/prevent-pollution.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/object/prevent-pollution.ts"],
+  "sourcesContent": ["/**\n * List of dangerous keys that can be used for prototype pollution attacks.\n * These keys should never be used as property names in dynamic object operations.\n */\nconst PROTOTYPE_POLLUTION_KEYS = ['__proto__', 'prototype', 'constructor'] as const\n\n/**\n * Validates that a key is safe to use and does not pose a prototype pollution risk.\n * Throws an error if a dangerous key is detected.\n *\n * @param key - The key to validate\n * @param context - Optional context string to help identify where the validation failed\n * @throws {Error} If the key matches a known prototype pollution vector\n *\n * @example\n * ```ts\n * preventPollution('__proto__') // throws Error\n * preventPollution('safeName') // passes\n * preventPollution('constructor', 'operation update') // throws Error with context\n * ```\n */\nexport const preventPollution = (key: string, context?: string): void => {\n  if (PROTOTYPE_POLLUTION_KEYS.includes(key as never)) {\n    const errorMessage = context\n      ? `Prototype pollution key detected: \"${key}\" in ${context}`\n      : `Prototype pollution key detected: \"${key}\"`\n\n    throw new Error(errorMessage)\n  }\n}\n"],
+  "mappings": "AAIA,MAAM,2BAA2B,CAAC,aAAa,aAAa,aAAa;AAiBlE,MAAM,mBAAmB,CAAC,KAAa,YAA2B;AACvE,MAAI,yBAAyB,SAAS,GAAY,GAAG;AACnD,UAAM,eAAe,UACjB,sCAAsC,GAAG,QAAQ,OAAO,KACxD,sCAAsC,GAAG;AAE7C,UAAM,IAAI,MAAM,YAAY;AAAA,EAC9B;AACF;",
+  "names": []
+}

package/dist/string/create-hash.d.ts

@@ -1,7 +1,7 @@
 /**
  * Simple 32 bit non-secure hash from a string input
  *
- * @deprecated Use generateHash from @scalar/json-magic/helpers/generate-hash instead
+ * @deprecated Please use generateHash from ./generate-hash.ts instead
  *
  * @see https://stackoverflow.com/a/7616484/1624255
  */

package/dist/string/create-hash.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/string/create-hash.ts"],
-  "sourcesContent": ["/**\n * Simple 32 bit non-secure hash from a string input\n *\n * @deprecated Use generateHash from @scalar/json-magic/helpers/generate-hash instead\n *\n * @see https://stackoverflow.com/a/7616484/1624255\n */\nexport const createHash = (input?: string): number => {\n  let chr = 0\n  let hash = 0\n  let i = 0\n\n  if (!input?.length) {\n    return hash\n  }\n\n  for (i = 0; i < input.length; i++) {\n    chr = input.charCodeAt(i)\n    hash = (hash << 5) - hash + chr\n    hash |= 0 // Convert to 32bit integer\n  }\n  return hash\n}\n"],
+  "sourcesContent": ["/**\n * Simple 32 bit non-secure hash from a string input\n *\n * @deprecated Please use generateHash from ./generate-hash.ts instead\n *\n * @see https://stackoverflow.com/a/7616484/1624255\n */\nexport const createHash = (input?: string): number => {\n  let chr = 0\n  let hash = 0\n  let i = 0\n\n  if (!input?.length) {\n    return hash\n  }\n\n  for (i = 0; i < input.length; i++) {\n    chr = input.charCodeAt(i)\n    hash = (hash << 5) - hash + chr\n    hash |= 0 // Convert to 32bit integer\n  }\n  return hash\n}\n"],
   "mappings": "AAOO,MAAM,aAAa,CAAC,UAA2B;AACpD,MAAI,MAAM;AACV,MAAI,OAAO;AACX,MAAI,IAAI;AAER,MAAI,CAAC,OAAO,QAAQ;AAClB,WAAO;AAAA,EACT;AAEA,OAAK,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACjC,UAAM,MAAM,WAAW,CAAC;AACxB,YAAQ,QAAQ,KAAK,OAAO;AAC5B,YAAQ;AAAA,EACV;AACA,SAAO;AACT;",
   "names": []
 }

package/dist/string/generate-hash.d.ts

@@ -0,0 +1,15 @@
+/**
+ * MurmurHash3 64-bit (x64_128) implementation
+ *
+ * Generate a hash from a string using the MurmurHash3 algorithm
+ * Provides 128-bit hash output with excellent speed and distribution
+ *
+ * We had to move away from xxhash-wasm since it was causing issues with content security policy (CSP) violations.
+ *
+ * We cannot use crypto.subtle because it is only available in secure contexts (HTTPS) or on localhost.
+ *
+ * @param input - The string to hash
+ * @returns The hash of the input string
+ */
+export declare const generateHash: (input: string) => string;
+//# sourceMappingURL=generate-hash.d.ts.map

package/dist/string/generate-hash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"generate-hash.d.ts","sourceRoot":"","sources":["../../src/string/generate-hash.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,YAAY,GAAI,OAAO,MAAM,KAAG,MA4K5C,CAAA"}

package/dist/string/generate-hash.js

@@ -0,0 +1,130 @@
+const generateHash = (input) => {
+  const seed = 0;
+  let h1 = seed;
+  let h2 = seed;
+  const len = input.length;
+  const remainder = len & 15;
+  const bytes = len - remainder;
+  const c1 = 2277735313;
+  const c2 = 1291169091;
+  const c3 = 1390208809;
+  const c4 = 944331445;
+  for (let i = 0; i < bytes; i += 16) {
+    let k1 = input.charCodeAt(i) & 255 | (input.charCodeAt(i + 1) & 255) << 8 | (input.charCodeAt(i + 2) & 255) << 16 | (input.charCodeAt(i + 3) & 255) << 24;
+    let k2 = input.charCodeAt(i + 4) & 255 | (input.charCodeAt(i + 5) & 255) << 8 | (input.charCodeAt(i + 6) & 255) << 16 | (input.charCodeAt(i + 7) & 255) << 24;
+    let k3 = input.charCodeAt(i + 8) & 255 | (input.charCodeAt(i + 9) & 255) << 8 | (input.charCodeAt(i + 10) & 255) << 16 | (input.charCodeAt(i + 11) & 255) << 24;
+    let k4 = input.charCodeAt(i + 12) & 255 | (input.charCodeAt(i + 13) & 255) << 8 | (input.charCodeAt(i + 14) & 255) << 16 | (input.charCodeAt(i + 15) & 255) << 24;
+    k1 = Math.imul(k1, c1);
+    k1 = k1 << 15 | k1 >>> 17;
+    k1 = Math.imul(k1, c2);
+    h1 ^= k1;
+    h1 = h1 << 13 | h1 >>> 19;
+    h1 = Math.imul(h1, 5) + 3864292196;
+    k2 = Math.imul(k2, c2);
+    k2 = k2 << 16 | k2 >>> 16;
+    k2 = Math.imul(k2, c3);
+    h2 ^= k2;
+    h2 = h2 << 17 | h2 >>> 15;
+    h2 = Math.imul(h2, 5) + 461845907;
+    k3 = Math.imul(k3, c3);
+    k3 = k3 << 17 | k3 >>> 15;
+    k3 = Math.imul(k3, c4);
+    h1 ^= k3;
+    h1 = h1 << 15 | h1 >>> 17;
+    h1 = Math.imul(h1, 5) + 1390208809;
+    k4 = Math.imul(k4, c4);
+    k4 = k4 << 18 | k4 >>> 14;
+    k4 = Math.imul(k4, c1);
+    h2 ^= k4;
+    h2 = h2 << 13 | h2 >>> 19;
+    h2 = Math.imul(h2, 5) + 944331445;
+  }
+  if (remainder > 0) {
+    let k1 = 0;
+    let k2 = 0;
+    let k3 = 0;
+    let k4 = 0;
+    if (remainder >= 15) {
+      k4 ^= (input.charCodeAt(bytes + 14) & 255) << 16;
+    }
+    if (remainder >= 14) {
+      k4 ^= (input.charCodeAt(bytes + 13) & 255) << 8;
+    }
+    if (remainder >= 13) {
+      k4 ^= input.charCodeAt(bytes + 12) & 255;
+      k4 = Math.imul(k4, c4);
+      k4 = k4 << 18 | k4 >>> 14;
+      k4 = Math.imul(k4, c1);
+      h2 ^= k4;
+    }
+    if (remainder >= 12) {
+      k3 ^= (input.charCodeAt(bytes + 11) & 255) << 24;
+    }
+    if (remainder >= 11) {
+      k3 ^= (input.charCodeAt(bytes + 10) & 255) << 16;
+    }
+    if (remainder >= 10) {
+      k3 ^= (input.charCodeAt(bytes + 9) & 255) << 8;
+    }
+    if (remainder >= 9) {
+      k3 ^= input.charCodeAt(bytes + 8) & 255;
+      k3 = Math.imul(k3, c3);
+      k3 = k3 << 17 | k3 >>> 15;
+      k3 = Math.imul(k3, c4);
+      h1 ^= k3;
+    }
+    if (remainder >= 8) {
+      k2 ^= (input.charCodeAt(bytes + 7) & 255) << 24;
+    }
+    if (remainder >= 7) {
+      k2 ^= (input.charCodeAt(bytes + 6) & 255) << 16;
+    }
+    if (remainder >= 6) {
+      k2 ^= (input.charCodeAt(bytes + 5) & 255) << 8;
+    }
+    if (remainder >= 5) {
+      k2 ^= input.charCodeAt(bytes + 4) & 255;
+      k2 = Math.imul(k2, c2);
+      k2 = k2 << 16 | k2 >>> 16;
+      k2 = Math.imul(k2, c3);
+      h2 ^= k2;
+    }
+    if (remainder >= 4) {
+      k1 ^= (input.charCodeAt(bytes + 3) & 255) << 24;
+    }
+    if (remainder >= 3) {
+      k1 ^= (input.charCodeAt(bytes + 2) & 255) << 16;
+    }
+    if (remainder >= 2) {
+      k1 ^= (input.charCodeAt(bytes + 1) & 255) << 8;
+    }
+    if (remainder >= 1) {
+      k1 ^= input.charCodeAt(bytes) & 255;
+      k1 = Math.imul(k1, c1);
+      k1 = k1 << 15 | k1 >>> 17;
+      k1 = Math.imul(k1, c2);
+      h1 ^= k1;
+    }
+  }
+  h1 ^= len;
+  h2 ^= len;
+  h1 += h2;
+  h2 += h1;
+  h1 ^= h1 >>> 16;
+  h1 = Math.imul(h1, 2246822507);
+  h1 ^= h1 >>> 13;
+  h1 = Math.imul(h1, 3266489909);
+  h1 ^= h1 >>> 16;
+  h2 ^= h2 >>> 16;
+  h2 = Math.imul(h2, 2246822507);
+  h2 ^= h2 >>> 13;
+  h2 = Math.imul(h2, 3266489909);
+  h2 ^= h2 >>> 16;
+  h1 += h2;
+  h2 += h1;
+  return (h1 >>> 0).toString(16).padStart(8, "0") + (h2 >>> 0).toString(16).padStart(8, "0");
+};
+export {
+  generateHash
+};
+//# sourceMappingURL=generate-hash.js.map

package/dist/string/generate-hash.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/string/generate-hash.ts"],
+  "sourcesContent": ["/**\n * MurmurHash3 64-bit (x64_128) implementation\n *\n * Generate a hash from a string using the MurmurHash3 algorithm\n * Provides 128-bit hash output with excellent speed and distribution\n *\n * We had to move away from xxhash-wasm since it was causing issues with content security policy (CSP) violations.\n *\n * We cannot use crypto.subtle because it is only available in secure contexts (HTTPS) or on localhost.\n *\n * @param input - The string to hash\n * @returns The hash of the input string\n */\nexport const generateHash = (input: string): string => {\n  const seed = 0\n\n  // Working with 64-bit values using pairs of 32-bit integers\n  let h1 = seed\n  let h2 = seed\n\n  const len = input.length\n  const remainder = len & 15 // len % 16\n  const bytes = len - remainder\n\n  const c1 = 0x87c37b91\n  const c2 = 0x4cf5ad43\n  const c3 = 0x52dce729\n  const c4 = 0x38495ab5\n\n  // Process 16-byte chunks\n  for (let i = 0; i < bytes; i += 16) {\n    let k1 =\n      (input.charCodeAt(i) & 0xff) |\n      ((input.charCodeAt(i + 1) & 0xff) << 8) |\n      ((input.charCodeAt(i + 2) & 0xff) << 16) |\n      ((input.charCodeAt(i + 3) & 0xff) << 24)\n\n    let k2 =\n      (input.charCodeAt(i + 4) & 0xff) |\n      ((input.charCodeAt(i + 5) & 0xff) << 8) |\n      ((input.charCodeAt(i + 6) & 0xff) << 16) |\n      ((input.charCodeAt(i + 7) & 0xff) << 24)\n\n    let k3 =\n      (input.charCodeAt(i + 8) & 0xff) |\n      ((input.charCodeAt(i + 9) & 0xff) << 8) |\n      ((input.charCodeAt(i + 10) & 0xff) << 16) |\n      ((input.charCodeAt(i + 11) & 0xff) << 24)\n\n    let k4 =\n      (input.charCodeAt(i + 12) & 0xff) |\n      ((input.charCodeAt(i + 13) & 0xff) << 8) |\n      ((input.charCodeAt(i + 14) & 0xff) << 16) |\n      ((input.charCodeAt(i + 15) & 0xff) << 24)\n\n    k1 = Math.imul(k1, c1)\n    k1 = (k1 << 15) | (k1 >>> 17)\n    k1 = Math.imul(k1, c2)\n    h1 ^= k1\n\n    h1 = (h1 << 13) | (h1 >>> 19)\n    h1 = Math.imul(h1, 5) + 0xe6546b64\n\n    k2 = Math.imul(k2, c2)\n    k2 = (k2 << 16) | (k2 >>> 16)\n    k2 = Math.imul(k2, c3)\n    h2 ^= k2\n\n    h2 = (h2 << 17) | (h2 >>> 15)\n    h2 = Math.imul(h2, 5) + 0x1b873593\n\n    k3 = Math.imul(k3, c3)\n    k3 = (k3 << 17) | (k3 >>> 15)\n    k3 = Math.imul(k3, c4)\n    h1 ^= k3\n\n    h1 = (h1 << 15) | (h1 >>> 17)\n    h1 = Math.imul(h1, 5) + 0x52dce729\n\n    k4 = Math.imul(k4, c4)\n    k4 = (k4 << 18) | (k4 >>> 14)\n    k4 = Math.imul(k4, c1)\n    h2 ^= k4\n\n    h2 = (h2 << 13) | (h2 >>> 19)\n    h2 = Math.imul(h2, 5) + 0x38495ab5\n  }\n\n  // Process remaining bytes\n  if (remainder > 0) {\n    let k1 = 0\n    let k2 = 0\n    let k3 = 0\n    let k4 = 0\n\n    if (remainder >= 15) {\n      k4 ^= (input.charCodeAt(bytes + 14) & 0xff) << 16\n    }\n    if (remainder >= 14) {\n      k4 ^= (input.charCodeAt(bytes + 13) & 0xff) << 8\n    }\n    if (remainder >= 13) {\n      k4 ^= input.charCodeAt(bytes + 12) & 0xff\n      k4 = Math.imul(k4, c4)\n      k4 = (k4 << 18) | (k4 >>> 14)\n      k4 = Math.imul(k4, c1)\n      h2 ^= k4\n    }\n\n    if (remainder >= 12) {\n      k3 ^= (input.charCodeAt(bytes + 11) & 0xff) << 24\n    }\n    if (remainder >= 11) {\n      k3 ^= (input.charCodeAt(bytes + 10) & 0xff) << 16\n    }\n    if (remainder >= 10) {\n      k3 ^= (input.charCodeAt(bytes + 9) & 0xff) << 8\n    }\n    if (remainder >= 9) {\n      k3 ^= input.charCodeAt(bytes + 8) & 0xff\n      k3 = Math.imul(k3, c3)\n      k3 = (k3 << 17) | (k3 >>> 15)\n      k3 = Math.imul(k3, c4)\n      h1 ^= k3\n    }\n\n    if (remainder >= 8) {\n      k2 ^= (input.charCodeAt(bytes + 7) & 0xff) << 24\n    }\n    if (remainder >= 7) {\n      k2 ^= (input.charCodeAt(bytes + 6) & 0xff) << 16\n    }\n    if (remainder >= 6) {\n      k2 ^= (input.charCodeAt(bytes + 5) & 0xff) << 8\n    }\n    if (remainder >= 5) {\n      k2 ^= input.charCodeAt(bytes + 4) & 0xff\n      k2 = Math.imul(k2, c2)\n      k2 = (k2 << 16) | (k2 >>> 16)\n      k2 = Math.imul(k2, c3)\n      h2 ^= k2\n    }\n\n    if (remainder >= 4) {\n      k1 ^= (input.charCodeAt(bytes + 3) & 0xff) << 24\n    }\n    if (remainder >= 3) {\n      k1 ^= (input.charCodeAt(bytes + 2) & 0xff) << 16\n    }\n    if (remainder >= 2) {\n      k1 ^= (input.charCodeAt(bytes + 1) & 0xff) << 8\n    }\n    if (remainder >= 1) {\n      k1 ^= input.charCodeAt(bytes) & 0xff\n      k1 = Math.imul(k1, c1)\n      k1 = (k1 << 15) | (k1 >>> 17)\n      k1 = Math.imul(k1, c2)\n      h1 ^= k1\n    }\n  }\n\n  // Finalization\n  h1 ^= len\n  h2 ^= len\n\n  h1 += h2\n  h2 += h1\n\n  h1 ^= h1 >>> 16\n  h1 = Math.imul(h1, 0x85ebca6b)\n  h1 ^= h1 >>> 13\n  h1 = Math.imul(h1, 0xc2b2ae35)\n  h1 ^= h1 >>> 16\n\n  h2 ^= h2 >>> 16\n  h2 = Math.imul(h2, 0x85ebca6b)\n  h2 ^= h2 >>> 13\n  h2 = Math.imul(h2, 0xc2b2ae35)\n  h2 ^= h2 >>> 16\n\n  h1 += h2\n  h2 += h1\n\n  // Return 128-bit hash as hex string\n  return (h1 >>> 0).toString(16).padStart(8, '0') + (h2 >>> 0).toString(16).padStart(8, '0')\n}\n"],
+  "mappings": "AAaO,MAAM,eAAe,CAAC,UAA0B;AACrD,QAAM,OAAO;AAGb,MAAI,KAAK;AACT,MAAI,KAAK;AAET,QAAM,MAAM,MAAM;AAClB,QAAM,YAAY,MAAM;AACxB,QAAM,QAAQ,MAAM;AAEpB,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,KAAK;AAGX,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK,IAAI;AAClC,QAAI,KACD,MAAM,WAAW,CAAC,IAAI,OACrB,MAAM,WAAW,IAAI,CAAC,IAAI,QAAS,KACnC,MAAM,WAAW,IAAI,CAAC,IAAI,QAAS,MACnC,MAAM,WAAW,IAAI,CAAC,IAAI,QAAS;AAEvC,QAAI,KACD,MAAM,WAAW,IAAI,CAAC,IAAI,OACzB,MAAM,WAAW,IAAI,CAAC,IAAI,QAAS,KACnC,MAAM,WAAW,IAAI,CAAC,IAAI,QAAS,MACnC,MAAM,WAAW,IAAI,CAAC,IAAI,QAAS;AAEvC,QAAI,KACD,MAAM,WAAW,IAAI,CAAC,IAAI,OACzB,MAAM,WAAW,IAAI,CAAC,IAAI,QAAS,KACnC,MAAM,WAAW,IAAI,EAAE,IAAI,QAAS,MACpC,MAAM,WAAW,IAAI,EAAE,IAAI,QAAS;AAExC,QAAI,KACD,MAAM,WAAW,IAAI,EAAE,IAAI,OAC1B,MAAM,WAAW,IAAI,EAAE,IAAI,QAAS,KACpC,MAAM,WAAW,IAAI,EAAE,IAAI,QAAS,MACpC,MAAM,WAAW,IAAI,EAAE,IAAI,QAAS;AAExC,SAAK,KAAK,KAAK,IAAI,EAAE;AACrB,SAAM,MAAM,KAAO,OAAO;AAC1B,SAAK,KAAK,KAAK,IAAI,EAAE;AACrB,UAAM;AAEN,SAAM,MAAM,KAAO,OAAO;AAC1B,SAAK,KAAK,KAAK,IAAI,CAAC,IAAI;AAExB,SAAK,KAAK,KAAK,IAAI,EAAE;AACrB,SAAM,MAAM,KAAO,OAAO;AAC1B,SAAK,KAAK,KAAK,IAAI,EAAE;AACrB,UAAM;AAEN,SAAM,MAAM,KAAO,OAAO;AAC1B,SAAK,KAAK,KAAK,IAAI,CAAC,IAAI;AAExB,SAAK,KAAK,KAAK,IAAI,EAAE;AACrB,SAAM,MAAM,KAAO,OAAO;AAC1B,SAAK,KAAK,KAAK,IAAI,EAAE;AACrB,UAAM;AAEN,SAAM,MAAM,KAAO,OAAO;AAC1B,SAAK,KAAK,KAAK,IAAI,CAAC,IAAI;AAExB,SAAK,KAAK,KAAK,IAAI,EAAE;AACrB,SAAM,MAAM,KAAO,OAAO;AAC1B,SAAK,KAAK,KAAK,IAAI,EAAE;AACrB,UAAM;AAEN,SAAM,MAAM,KAAO,OAAO;AAC1B,SAAK,KAAK,KAAK,IAAI,CAAC,IAAI;AAAA,EAC1B;AAGA,MAAI,YAAY,GAAG;AACjB,QAAI,KAAK;AACT,QAAI,KAAK;AACT,QAAI,KAAK;AACT,QAAI,KAAK;AAET,QAAI,aAAa,IAAI;AACnB,aAAO,MAAM,WAAW,QAAQ,EAAE,IAAI,QAAS;AAAA,IACjD;AACA,QAAI,aAAa,IAAI;AACnB,aAAO,MAAM,WAAW,QAAQ,EAAE,IAAI,QAAS;AAAA,IACjD;AACA,QAAI,aAAa,IAAI;AACnB,YAAM,MAAM,WAAW,QAAQ,EAAE,IAAI;AACrC,WAAK,KAAK,KAAK,IAAI,EAAE;AACrB,WAAM,MAAM,KAAO,OAAO;AAC1B,WAAK,KAAK,KAAK,IAAI,EAAE;AACrB,YAAM;AAAA,IACR;AAEA,QAAI,aAAa,IAAI;AACnB,aAAO,MAAM,WAAW,QAAQ,EAAE,IAAI,QAAS;AAAA,IACjD;AACA,QAAI,aAAa,IAAI;AACnB,aAAO,MAAM,WAAW,QAAQ,EAAE,IAAI,QAAS;AAAA,IACjD;AACA,QAAI,aAAa,IAAI;AACnB,aAAO,MAAM,WAAW,QAAQ,CAAC,IAAI,QAAS;AAAA,IAChD;AACA,QAAI,aAAa,GAAG;AAClB,YAAM,MAAM,WAAW,QAAQ,CAAC,IAAI;AACpC,WAAK,KAAK,KAAK,IAAI,EAAE;AACrB,WAAM,MAAM,KAAO,OAAO;AAC1B,WAAK,KAAK,KAAK,IAAI,EAAE;AACrB,YAAM;AAAA,IACR;AAEA,QAAI,aAAa,GAAG;AAClB,aAAO,MAAM,WAAW,QAAQ,CAAC,IAAI,QAAS;AAAA,IAChD;AACA,QAAI,aAAa,GAAG;AAClB,aAAO,MAAM,WAAW,QAAQ,CAAC,IAAI,QAAS;AAAA,IAChD;AACA,QAAI,aAAa,GAAG;AAClB,aAAO,MAAM,WAAW,QAAQ,CAAC,IAAI,QAAS;AAAA,IAChD;AACA,QAAI,aAAa,GAAG;AAClB,YAAM,MAAM,WAAW,QAAQ,CAAC,IAAI;AACpC,WAAK,KAAK,KAAK,IAAI,EAAE;AACrB,WAAM,MAAM,KAAO,OAAO;AAC1B,WAAK,KAAK,KAAK,IAAI,EAAE;AACrB,YAAM;AAAA,IACR;AAEA,QAAI,aAAa,GAAG;AAClB,aAAO,MAAM,WAAW,QAAQ,CAAC,IAAI,QAAS;AAAA,IAChD;AACA,QAAI,aAAa,GAAG;AAClB,aAAO,MAAM,WAAW,QAAQ,CAAC,IAAI,QAAS;AAAA,IAChD;AACA,QAAI,aAAa,GAAG;AAClB,aAAO,MAAM,WAAW,QAAQ,CAAC,IAAI,QAAS;AAAA,IAChD;AACA,QAAI,aAAa,GAAG;AAClB,YAAM,MAAM,WAAW,KAAK,IAAI;AAChC,WAAK,KAAK,KAAK,IAAI,EAAE;AACrB,WAAM,MAAM,KAAO,OAAO;AAC1B,WAAK,KAAK,KAAK,IAAI,EAAE;AACrB,YAAM;AAAA,IACR;AAAA,EACF;AAGA,QAAM;AACN,QAAM;AAEN,QAAM;AACN,QAAM;AAEN,QAAM,OAAO;AACb,OAAK,KAAK,KAAK,IAAI,UAAU;AAC7B,QAAM,OAAO;AACb,OAAK,KAAK,KAAK,IAAI,UAAU;AAC7B,QAAM,OAAO;AAEb,QAAM,OAAO;AACb,OAAK,KAAK,KAAK,IAAI,UAAU;AAC7B,QAAM,OAAO;AACb,OAAK,KAAK,KAAK,IAAI,UAAU;AAC7B,QAAM,OAAO;AAEb,QAAM;AACN,QAAM;AAGN,UAAQ,OAAO,GAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,KAAK,OAAO,GAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAC3F;",
+  "names": []
+}

package/package.json

@@ -14,18 +14,24 @@
     "helpers",
     "js"
   ],
-  "version": "0.1.1",
+  "version": "0.1.3",
   "engines": {
     "node": ">=20"
   },
   "type": "module",
   "main": "dist/index.js",
+  "module": "dist/index.js",
   "exports": {
     "./array/*": {
       "import": "./dist/array/*.js",
       "types": "./dist/array/*.d.ts",
       "default": "./dist/array/*.js"
     },
+    "./crypto/*": {
+      "import": "./dist/crypto/*.js",
+      "types": "./dist/crypto/*.d.ts",
+      "default": "./dist/crypto/*.js"
+    },
     "./dom/*": {
       "import": "./dist/dom/*.js",
       "types": "./dist/dom/*.d.ts",
@@ -75,29 +81,23 @@
       "import": "./dist/url/*.js",
       "types": "./dist/url/*.d.ts",
       "default": "./dist/url/*.js"
-    },
-    "./crypto/*": {
-      "import": "./dist/crypto/*.js",
-      "types": "./dist/crypto/*.d.ts",
-      "default": "./dist/crypto/*.js"
     }
   },
   "files": [
     "dist",
     "CHANGELOG.md"
   ],
-  "module": "dist/index.js",
   "devDependencies": {
+    "jsdom": "26.1.0",
     "vite": "7.1.11",
     "vitest": "3.2.4",
-    "@scalar/build-tooling": "0.2.8"
+    "@scalar/build-tooling": "0.3.1"
   },
   "scripts": {
     "build": "scalar-build-esbuild",
     "lint:check": "biome lint --diagnostic-level=error",
     "lint:fix": "biome lint --write",
     "test": "vitest",
-    "test:coverage": "vitest run --coverage",
     "types:build": "scalar-types-build",
     "types:check": "scalar-types-check"
   }

package/dist/string/add-word-breaks.d.ts

@@ -1,32 +0,0 @@
-/**
- * A list of preset styles for word breaks
- */
-declare const PRESETS: {
-    /** Breaks on `/` and `-` for urls or file paths */
-    readonly path: RegExp;
-    /**
-     * Breaks on capitals, `_` and `.` for properties written in
-     * camel, pascal or snake case
-     */
-    readonly property: RegExp;
-};
-/** Word break options */
-type WordBreakOptions = {
-    /**
-     * Presets for word wrapping
-     */
-    preset?: keyof typeof PRESETS;
-    /**
-     * Explicit regex to allow wrapping on, overrides any `preset`
-     */
-    regex?: RegExp;
-};
-/**
- * String utility to add word break opportunities
- *
- * Adds a zero-width space before certain characters to allow improved
- * line wrapping in the. Allows wrapping on "/" and * "-" by default.
- */
-export declare const addWordBreaks: (label: string, opts?: WordBreakOptions) => string;
-export {};
-//# sourceMappingURL=add-word-breaks.d.ts.map

package/dist/string/add-word-breaks.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"add-word-breaks.d.ts","sourceRoot":"","sources":["../../src/string/add-word-breaks.ts"],"names":[],"mappings":"AAOA;;GAEG;AACH,QAAA,MAAM,OAAO;IACX,mDAAmD;;IAEnD;;;OAGG;;CAEsC,CAAA;AAE3C,yBAAyB;AACzB,KAAK,gBAAgB,GAAG;IACtB;;OAEG;IACH,MAAM,CAAC,EAAE,MAAM,OAAO,OAAO,CAAA;IAC7B;;OAEG;IACH,KAAK,CAAC,EAAE,MAAM,CAAA;CACf,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,aAAa,GAAI,OAAO,MAAM,EAAE,OAAM,gBAAqB,KAAG,MAI1E,CAAA"}

package/dist/string/add-word-breaks.js

@@ -1,19 +0,0 @@
-const ZWSP = "\u200B";
-const PRESETS = {
-  /** Breaks on `/` and `-` for urls or file paths */
-  "path": /[\/-]/,
-  /**
-   * Breaks on capitals, `_` and `.` for properties written in
-   * camel, pascal or snake case
-   */
-  "property": /[A-Z\_\.-]/
-};
-const addWordBreaks = (label, opts = {}) => {
-  const { preset = "path", regex } = opts;
-  const wrapRegex = new RegExp(regex ?? PRESETS[preset], "g");
-  return label.replace(wrapRegex, `${ZWSP}$&`);
-};
-export {
-  addWordBreaks
-};
-//# sourceMappingURL=add-word-breaks.js.map

package/dist/string/add-word-breaks.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../src/string/add-word-breaks.ts"],
-  "sourcesContent": ["/**\n * Unicode character for zero-width space\n *\n * @see https://en.wikipedia.org/wiki/Zero-width_space\n */\nconst ZWSP = '\\u200B'\n\n/**\n * A list of preset styles for word breaks\n */\nconst PRESETS = {\n  /** Breaks on `/` and `-` for urls or file paths */\n  'path': /[\\/-]/,\n  /**\n   * Breaks on capitals, `_` and `.` for properties written in\n   * camel, pascal or snake case\n   */\n  'property': /[A-Z\\_\\.-]/,\n} as const satisfies Record<string, RegExp>\n\n/** Word break options */\ntype WordBreakOptions = {\n  /**\n   * Presets for word wrapping\n   */\n  preset?: keyof typeof PRESETS\n  /**\n   * Explicit regex to allow wrapping on, overrides any `preset`\n   */\n  regex?: RegExp\n}\n\n/**\n * String utility to add word break opportunities\n *\n * Adds a zero-width space before certain characters to allow improved\n * line wrapping in the. Allows wrapping on \"/\" and * \"-\" by default.\n */\nexport const addWordBreaks = (label: string, opts: WordBreakOptions = {}): string => {\n  const { preset = 'path', regex } = opts\n  const wrapRegex = new RegExp(regex ?? PRESETS[preset], 'g')\n  return label.replace(wrapRegex, `${ZWSP}$&`)\n}\n"],
-  "mappings": "AAKA,MAAM,OAAO;AAKb,MAAM,UAAU;AAAA;AAAA,EAEd,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,EAKR,YAAY;AACd;AAoBO,MAAM,gBAAgB,CAAC,OAAe,OAAyB,CAAC,MAAc;AACnF,QAAM,EAAE,SAAS,QAAQ,MAAM,IAAI;AACnC,QAAM,YAAY,IAAI,OAAO,SAAS,QAAQ,MAAM,GAAG,GAAG;AAC1D,SAAO,MAAM,QAAQ,WAAW,GAAG,IAAI,IAAI;AAC7C;",
-  "names": []
-}