@scalar/helpers 0.1.0 → 0.1.2

package/CHANGELOG.md

@@ -1,5 +1,21 @@
 # @scalar/helpers
 
+## 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
+
+- [#7289](https://github.com/scalar/scalar/pull/7289) [`9c9dbba`](https://github.com/scalar/scalar/commit/9c9dbbaa940667303f0ace59469fd78c2a741937) Thanks [@amritk](https://github.com/amritk)! - feat: move debounce to helpers and add max wait
+
+- [#7252](https://github.com/scalar/scalar/pull/7252) [`4bec1ba`](https://github.com/scalar/scalar/commit/4bec1ba332e919c4ee32dcfbfb07bd8ee42c4d74) Thanks [@hwkr](https://github.com/hwkr)! - fix(api-reference): improve wrapping of long strings
+
 ## 0.1.0
 
 ### Minor Changes

package/dist/general/debounce.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Options for configuring the debounce behavior.
+ */
+export type DebounceOptions = {
+    /** The delay in milliseconds before executing the function. Defaults to 100ms. */
+    delay?: number;
+    /** Maximum time in milliseconds to wait before forcing execution, even with continuous calls. */
+    maxWait?: number;
+};
+/**
+ * Creates a debounced function executor that delays execution until after a specified time.
+ * Multiple calls with the same key will cancel previous pending executions.
+ *
+ * This is useful for batching rapid updates (like auto-save or API calls) to avoid
+ * unnecessary processing or network requests.
+ *
+ * @param options - Configuration options for delay, maxWait, and key separator
+ * @returns A function that accepts a key array and callback to execute
+ *
+ * @example
+ * const debouncedSave = debounce({ delay: 328 })
+ * debouncedSave.execute(['user', '123'], () => saveUser(user))
+ *
+ * @example
+ * // With maxWait to guarantee execution even with continuous calls
+ * const debouncedSave = debounce({ delay: 328, maxWait: 2000 })
+ * debouncedSave.execute(['user', '123'], () => saveUser(user))
+ */
+export declare const debounce: (options?: DebounceOptions) => {
+    execute: (key: string, fn: () => unknown | Promise<unknown>) => void;
+    cleanup: () => void;
+};
+//# sourceMappingURL=debounce.d.ts.map

package/dist/general/debounce.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"debounce.d.ts","sourceRoot":"","sources":["../../src/general/debounce.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,MAAM,eAAe,GAAG;IAC5B,kFAAkF;IAClF,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,iGAAiG;IACjG,OAAO,CAAC,EAAE,MAAM,CAAA;CACjB,CAAA;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,eAAO,MAAM,QAAQ,GAAI,UAAS,eAAoB;mBA6C9B,MAAM,MAAM,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,KAAG,IAAI;mBAvCrD,IAAI;CAiEzB,CAAA"}

package/dist/general/debounce.js

@@ -0,0 +1,55 @@
+const debounce = (options = {}) => {
+  const { delay = 328, maxWait } = options;
+  const timeouts = /* @__PURE__ */ new Map();
+  const maxWaitTimeouts = /* @__PURE__ */ new Map();
+  const latestFunctions = /* @__PURE__ */ new Map();
+  const cleanup = () => {
+    timeouts.forEach(clearTimeout);
+    maxWaitTimeouts.forEach(clearTimeout);
+    timeouts.clear();
+    maxWaitTimeouts.clear();
+    latestFunctions.clear();
+  };
+  const executeAndCleanup = (key) => {
+    const fn = latestFunctions.get(key);
+    const timeout = timeouts.get(key);
+    if (timeout !== void 0) {
+      clearTimeout(timeout);
+      timeouts.delete(key);
+    }
+    const maxWaitTimeout = maxWaitTimeouts.get(key);
+    if (maxWaitTimeout !== void 0) {
+      clearTimeout(maxWaitTimeout);
+      maxWaitTimeouts.delete(key);
+    }
+    latestFunctions.delete(key);
+    if (fn !== void 0) {
+      try {
+        fn();
+      } catch {
+      }
+    }
+  };
+  const execute = (key, fn) => {
+    latestFunctions.set(key, fn);
+    const existingTimeout = timeouts.get(key);
+    if (existingTimeout !== void 0) {
+      clearTimeout(existingTimeout);
+    }
+    timeouts.set(
+      key,
+      setTimeout(() => executeAndCleanup(key), delay)
+    );
+    if (maxWait !== void 0 && !maxWaitTimeouts.has(key)) {
+      maxWaitTimeouts.set(
+        key,
+        setTimeout(() => executeAndCleanup(key), maxWait)
+      );
+    }
+  };
+  return { execute, cleanup };
+};
+export {
+  debounce
+};
+//# sourceMappingURL=debounce.js.map

package/dist/general/debounce.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/general/debounce.ts"],
+  "sourcesContent": ["/**\n * Options for configuring the debounce behavior.\n */\nexport type DebounceOptions = {\n  /** The delay in milliseconds before executing the function. Defaults to 100ms. */\n  delay?: number\n  /** Maximum time in milliseconds to wait before forcing execution, even with continuous calls. */\n  maxWait?: number\n}\n\n/**\n * Creates a debounced function executor that delays execution until after a specified time.\n * Multiple calls with the same key will cancel previous pending executions.\n *\n * This is useful for batching rapid updates (like auto-save or API calls) to avoid\n * unnecessary processing or network requests.\n *\n * @param options - Configuration options for delay, maxWait, and key separator\n * @returns A function that accepts a key array and callback to execute\n *\n * @example\n * const debouncedSave = debounce({ delay: 328 })\n * debouncedSave.execute(['user', '123'], () => saveUser(user))\n *\n * @example\n * // With maxWait to guarantee execution even with continuous calls\n * const debouncedSave = debounce({ delay: 328, maxWait: 2000 })\n * debouncedSave.execute(['user', '123'], () => saveUser(user))\n */\nexport const debounce = (options: DebounceOptions = {}) => {\n  const { delay = 328, maxWait } = options\n  const timeouts = new Map<string, ReturnType<typeof setTimeout>>()\n  const maxWaitTimeouts = new Map<string, ReturnType<typeof setTimeout>>()\n  const latestFunctions = new Map<string, () => unknown | Promise<unknown>>()\n\n  const cleanup = (): void => {\n    timeouts.forEach(clearTimeout)\n    maxWaitTimeouts.forEach(clearTimeout)\n    timeouts.clear()\n    maxWaitTimeouts.clear()\n    latestFunctions.clear()\n  }\n\n  /** Executes the function and cleans up all associated timeouts */\n  const executeAndCleanup = (key: string): void => {\n    // Get the latest function for this key\n    const fn = latestFunctions.get(key)\n\n    // Clear both timeout types\n    const timeout = timeouts.get(key)\n    if (timeout !== undefined) {\n      clearTimeout(timeout)\n      timeouts.delete(key)\n    }\n\n    const maxWaitTimeout = maxWaitTimeouts.get(key)\n    if (maxWaitTimeout !== undefined) {\n      clearTimeout(maxWaitTimeout)\n      maxWaitTimeouts.delete(key)\n    }\n\n    // Clear the latest function reference\n    latestFunctions.delete(key)\n\n    // Execute the function if it exists\n    if (fn !== undefined) {\n      try {\n        fn()\n      } catch {\n        // Errors are silently caught to prevent the debounce mechanism from breaking\n      }\n    }\n  }\n\n  const execute = (key: string, fn: () => unknown | Promise<unknown>): void => {\n    // Store the latest function for this key\n    latestFunctions.set(key, fn)\n\n    // Clear existing debounce timeout\n    const existingTimeout = timeouts.get(key)\n    if (existingTimeout !== undefined) {\n      clearTimeout(existingTimeout)\n    }\n\n    // Set debounce timeout\n    timeouts.set(\n      key,\n      setTimeout(() => executeAndCleanup(key), delay),\n    )\n\n    // Set maxWait timeout only if configured and this is a new sequence\n    if (maxWait !== undefined && !maxWaitTimeouts.has(key)) {\n      maxWaitTimeouts.set(\n        key,\n        setTimeout(() => executeAndCleanup(key), maxWait),\n      )\n    }\n  }\n\n  return { execute, cleanup }\n}\n"],
+  "mappings": "AA6BO,MAAM,WAAW,CAAC,UAA2B,CAAC,MAAM;AACzD,QAAM,EAAE,QAAQ,KAAK,QAAQ,IAAI;AACjC,QAAM,WAAW,oBAAI,IAA2C;AAChE,QAAM,kBAAkB,oBAAI,IAA2C;AACvE,QAAM,kBAAkB,oBAAI,IAA8C;AAE1E,QAAM,UAAU,MAAY;AAC1B,aAAS,QAAQ,YAAY;AAC7B,oBAAgB,QAAQ,YAAY;AACpC,aAAS,MAAM;AACf,oBAAgB,MAAM;AACtB,oBAAgB,MAAM;AAAA,EACxB;AAGA,QAAM,oBAAoB,CAAC,QAAsB;AAE/C,UAAM,KAAK,gBAAgB,IAAI,GAAG;AAGlC,UAAM,UAAU,SAAS,IAAI,GAAG;AAChC,QAAI,YAAY,QAAW;AACzB,mBAAa,OAAO;AACpB,eAAS,OAAO,GAAG;AAAA,IACrB;AAEA,UAAM,iBAAiB,gBAAgB,IAAI,GAAG;AAC9C,QAAI,mBAAmB,QAAW;AAChC,mBAAa,cAAc;AAC3B,sBAAgB,OAAO,GAAG;AAAA,IAC5B;AAGA,oBAAgB,OAAO,GAAG;AAG1B,QAAI,OAAO,QAAW;AACpB,UAAI;AACF,WAAG;AAAA,MACL,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAU,CAAC,KAAa,OAA+C;AAE3E,oBAAgB,IAAI,KAAK,EAAE;AAG3B,UAAM,kBAAkB,SAAS,IAAI,GAAG;AACxC,QAAI,oBAAoB,QAAW;AACjC,mBAAa,eAAe;AAAA,IAC9B;AAGA,aAAS;AAAA,MACP;AAAA,MACA,WAAW,MAAM,kBAAkB,GAAG,GAAG,KAAK;AAAA,IAChD;AAGA,QAAI,YAAY,UAAa,CAAC,gBAAgB,IAAI,GAAG,GAAG;AACtD,sBAAgB;AAAA,QACd;AAAA,QACA,WAAW,MAAM,kBAAkB,GAAG,GAAG,OAAO;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,QAAQ;AAC5B;",
+  "names": []
+}

package/dist/regex/find-variables.d.ts

@@ -1,5 +1,12 @@
 /**
  * Find all strings wrapped in {} or {{}} in value.
+ *
+ * @param value - The string to find variables in
+ * @param includePath - Whether to include path variables {single}
+ * @param includeEnv - Whether to include environment variables {{double}}
  */
-export declare const findVariables: (value: string) => (string | undefined)[];
+export declare const findVariables: (value: string, { includePath, includeEnv }?: {
+    includePath?: boolean;
+    includeEnv?: boolean;
+}) => string[];
 //# sourceMappingURL=find-variables.d.ts.map

package/dist/regex/find-variables.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"find-variables.d.ts","sourceRoot":"","sources":["../../src/regex/find-variables.ts"],"names":[],"mappings":"AAEA;;GAEG;AACH,eAAO,MAAM,aAAa,GAAI,OAAO,MAAM,2BACiE,CAAA"}
+{"version":3,"file":"find-variables.d.ts","sourceRoot":"","sources":["../../src/regex/find-variables.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,eAAO,MAAM,aAAa,GACxB,OAAO,MAAM,EACb,8BAA2C;IAAE,WAAW,CAAC,EAAE,OAAO,CAAC;IAAC,UAAU,CAAC,EAAE,OAAO,CAAA;CAAO,KAC9F,MAAM,EAON,CAAA"}

package/dist/regex/find-variables.js

@@ -1,5 +1,7 @@
 import { REGEX } from "./regex-helpers.js";
-const findVariables = (value) => [...value.matchAll(REGEX.PATH), ...value.matchAll(REGEX.VARIABLES)].map((match) => match[1]?.trim()) || [];
+const findVariables = (value, { includePath = true, includeEnv = true } = {}) => [includePath && REGEX.PATH, includeEnv && REGEX.VARIABLES].flatMap(
+  (regex) => regex ? [...value.matchAll(regex)].map((match) => match[1]?.trim()).filter((variable) => variable !== void 0) : []
+);
 export {
   findVariables
 };

package/dist/regex/find-variables.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/regex/find-variables.ts"],
-  "sourcesContent": ["import { REGEX } from './regex-helpers'\n\n/**\n * Find all strings wrapped in {} or {{}} in value.\n */\nexport const findVariables = (value: string) =>\n  [...value.matchAll(REGEX.PATH), ...value.matchAll(REGEX.VARIABLES)].map((match) => match[1]?.trim()) || []\n"],
-  "mappings": "AAAA,SAAS,aAAa;AAKf,MAAM,gBAAgB,CAAC,UAC5B,CAAC,GAAG,MAAM,SAAS,MAAM,IAAI,GAAG,GAAG,MAAM,SAAS,MAAM,SAAS,CAAC,EAAE,IAAI,CAAC,UAAU,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;",
+  "sourcesContent": ["import { REGEX } from './regex-helpers'\n\n/**\n * Find all strings wrapped in {} or {{}} in value.\n *\n * @param value - The string to find variables in\n * @param includePath - Whether to include path variables {single}\n * @param includeEnv - Whether to include environment variables {{double}}\n */\nexport const findVariables = (\n  value: string,\n  { includePath = true, includeEnv = true }: { includePath?: boolean; includeEnv?: boolean } = {},\n): string[] =>\n  [includePath && REGEX.PATH, includeEnv && REGEX.VARIABLES].flatMap((regex) =>\n    regex\n      ? [...value.matchAll(regex)]\n          .map((match) => match[1]?.trim())\n          .filter((variable): variable is string => variable !== undefined)\n      : [],\n  )\n"],
+  "mappings": "AAAA,SAAS,aAAa;AASf,MAAM,gBAAgB,CAC3B,OACA,EAAE,cAAc,MAAM,aAAa,KAAK,IAAqD,CAAC,MAE9F,CAAC,eAAe,MAAM,MAAM,cAAc,MAAM,SAAS,EAAE;AAAA,EAAQ,CAAC,UAClE,QACI,CAAC,GAAG,MAAM,SAAS,KAAK,CAAC,EACtB,IAAI,CAAC,UAAU,MAAM,CAAC,GAAG,KAAK,CAAC,EAC/B,OAAO,CAAC,aAAiC,aAAa,MAAS,IAClE,CAAC;AACP;",
   "names": []
 }

package/dist/regex/regex-helpers.d.ts

@@ -1,12 +1,19 @@
+/**
+ * Collection of regular expressions used throughout the application.
+ * These patterns handle URL parsing, variable detection, and reference path extraction.
+ */
 export declare const REGEX: {
     /** Checks for a valid scheme */
     readonly PROTOCOL: RegExp;
     /** Finds multiple slashes after the scheme to replace with a single slash */
     readonly MULTIPLE_SLASHES: RegExp;
+    /** Finds all variables wrapped in {{double}} */
     readonly VARIABLES: RegExp;
+    /** Finds all variables wrapped in {single} */
     readonly PATH: RegExp;
     /** Finds the name of the schema from the ref path */
     readonly REF_NAME: RegExp;
+    /** Finds template variables in multiple formats: {{var}}, {var}, or :var */
     readonly TEMPLATE_VARIABLE: RegExp;
 };
 //# sourceMappingURL=regex-helpers.d.ts.map

package/dist/regex/regex-helpers.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"regex-helpers.d.ts","sourceRoot":"","sources":["../../src/regex/regex-helpers.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,KAAK;IAChB,gCAAgC;;IAEhC,6EAA6E;;;;IAI7E,qDAAqD;;;CAG7C,CAAA"}
+{"version":3,"file":"regex-helpers.d.ts","sourceRoot":"","sources":["../../src/regex/regex-helpers.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,eAAO,MAAM,KAAK;IAChB,gCAAgC;;IAEhC,6EAA6E;;IAE7E,gDAAgD;;IAEhD,8CAA8C;;IAE9C,qDAAqD;;IAErD,4EAA4E;;CAEpE,CAAA"}

package/dist/regex/regex-helpers.js

@@ -3,10 +3,13 @@ const REGEX = {
   PROTOCOL: /^(?:https?|ftp|file|mailto|tel|data|wss?)*:\/\//,
   /** Finds multiple slashes after the scheme to replace with a single slash */
   MULTIPLE_SLASHES: /(?<!:)\/{2,}/g,
+  /** Finds all variables wrapped in {{double}} */
   VARIABLES: /{{((?:[^{}]|{[^{}]*})*)}}/g,
+  /** Finds all variables wrapped in {single} */
   PATH: /(?:{)([^{}]+)}(?!})/g,
   /** Finds the name of the schema from the ref path */
   REF_NAME: /\/([^\/]+)$/,
+  /** Finds template variables in multiple formats: {{var}}, {var}, or :var */
   TEMPLATE_VARIABLE: /{{\s*([^}\s]+?)\s*}}|{\s*([^}\s]+?)\s*}|:\b[\w.]+\b/g
 };
 export {

package/dist/regex/regex-helpers.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/regex/regex-helpers.ts"],
-  "sourcesContent": ["export const REGEX = {\n  /** Checks for a valid scheme */\n  PROTOCOL: /^(?:https?|ftp|file|mailto|tel|data|wss?)*:\\/\\//,\n  /** Finds multiple slashes after the scheme to replace with a single slash */\n  MULTIPLE_SLASHES: /(?<!:)\\/{2,}/g,\n  VARIABLES: /{{((?:[^{}]|{[^{}]*})*)}}/g,\n  PATH: /(?:{)([^{}]+)}(?!})/g,\n  /** Finds the name of the schema from the ref path */\n  REF_NAME: /\\/([^\\/]+)$/,\n  TEMPLATE_VARIABLE: /{{\\s*([^}\\s]+?)\\s*}}|{\\s*([^}\\s]+?)\\s*}|:\\b[\\w.]+\\b/g,\n} as const\n"],
-  "mappings": "AAAO,MAAM,QAAQ;AAAA;AAAA,EAEnB,UAAU;AAAA;AAAA,EAEV,kBAAkB;AAAA,EAClB,WAAW;AAAA,EACX,MAAM;AAAA;AAAA,EAEN,UAAU;AAAA,EACV,mBAAmB;AACrB;",
+  "sourcesContent": ["/**\n * Collection of regular expressions used throughout the application.\n * These patterns handle URL parsing, variable detection, and reference path extraction.\n */\nexport const REGEX = {\n  /** Checks for a valid scheme */\n  PROTOCOL: /^(?:https?|ftp|file|mailto|tel|data|wss?)*:\\/\\//,\n  /** Finds multiple slashes after the scheme to replace with a single slash */\n  MULTIPLE_SLASHES: /(?<!:)\\/{2,}/g,\n  /** Finds all variables wrapped in {{double}} */\n  VARIABLES: /{{((?:[^{}]|{[^{}]*})*)}}/g,\n  /** Finds all variables wrapped in {single} */\n  PATH: /(?:{)([^{}]+)}(?!})/g,\n  /** Finds the name of the schema from the ref path */\n  REF_NAME: /\\/([^\\/]+)$/,\n  /** Finds template variables in multiple formats: {{var}}, {var}, or :var */\n  TEMPLATE_VARIABLE: /{{\\s*([^}\\s]+?)\\s*}}|{\\s*([^}\\s]+?)\\s*}|:\\b[\\w.]+\\b/g,\n} as const\n"],
+  "mappings": "AAIO,MAAM,QAAQ;AAAA;AAAA,EAEnB,UAAU;AAAA;AAAA,EAEV,kBAAkB;AAAA;AAAA,EAElB,WAAW;AAAA;AAAA,EAEX,MAAM;AAAA;AAAA,EAEN,UAAU;AAAA;AAAA,EAEV,mBAAmB;AACrB;",
   "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/dist/string/truncate.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Truncates a string to a specified length and adds an ellipsis if it's longer in JS
+ *
+ * @param str - The string to truncate
+ * @param maxLength - The maximum length before truncation (default: 18)
+ * @returns The truncated string with ellipsis if needed
+ *
+ * @example
+ * truncate('Very long name that needs truncation') // 'Very long name th…'
+ * truncate('Short') // 'Short'
+ */
+export declare const truncate: (str: string, maxLength?: number) => string;
+//# sourceMappingURL=truncate.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"truncate.d.ts","sourceRoot":"","sources":["../../src/string/truncate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,eAAO,MAAM,QAAQ,GAAI,KAAK,MAAM,EAAE,kBAAc,KAAG,MAKtD,CAAA"}

package/dist/string/truncate.js

@@ -0,0 +1,10 @@
+const truncate = (str, maxLength = 18) => {
+  if (str.length <= maxLength) {
+    return str;
+  }
+  return str.slice(0, maxLength) + "\u2026";
+};
+export {
+  truncate
+};
+//# sourceMappingURL=truncate.js.map

package/dist/string/truncate.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/string/truncate.ts"],
+  "sourcesContent": ["/**\n * Truncates a string to a specified length and adds an ellipsis if it's longer in JS\n *\n * @param str - The string to truncate\n * @param maxLength - The maximum length before truncation (default: 18)\n * @returns The truncated string with ellipsis if needed\n *\n * @example\n * truncate('Very long name that needs truncation') // 'Very long name th\u2026'\n * truncate('Short') // 'Short'\n */\nexport const truncate = (str: string, maxLength = 18): string => {\n  if (str.length <= maxLength) {\n    return str\n  }\n  return str.slice(0, maxLength) + '\u2026'\n}\n"],
+  "mappings": "AAWO,MAAM,WAAW,CAAC,KAAa,YAAY,OAAe;AAC/D,MAAI,IAAI,UAAU,WAAW;AAC3B,WAAO;AAAA,EACT;AACA,SAAO,IAAI,MAAM,GAAG,SAAS,IAAI;AACnC;",
+  "names": []
+}

package/package.json

@@ -14,12 +14,13 @@
     "helpers",
     "js"
   ],
-  "version": "0.1.0",
+  "version": "0.1.2",
   "engines": {
     "node": ">=20"
   },
   "type": "module",
   "main": "dist/index.js",
+  "module": "dist/index.js",
   "exports": {
     "./array/*": {
       "import": "./dist/array/*.js",
@@ -86,18 +87,17 @@
     "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.0"
   },
   "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"
   }