superjs-core 0.1.0 → 0.3.0

package/dist/async/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/async/index.ts"],"sourcesContent":["import type { RetryOptions } from '../core/index.js'\n\n/**\n * Delays execution for the given number of milliseconds.\n */\nexport function sleep(ms: number): Promise<void> {\n  return new Promise(resolve => setTimeout(resolve, ms))\n}\n\n/**\n * Rejects a promise if it does not resolve within the specified timeout.\n */\nexport async function timeout<T>(promise: Promise<T>, ms: number, errorMessage?: string): Promise<T> {\n  let timer: ReturnType<typeof setTimeout> | undefined\n  const timeoutPromise = new Promise<never>((_, reject) => {\n    timer = setTimeout(() => reject(new Error(errorMessage ?? `Promise timed out after ${ms}ms`)), ms)\n  })\n  try {\n    return await Promise.race([promise, timeoutPromise])\n  } finally {\n    if (timer !== undefined) clearTimeout(timer)\n  }\n}\n\n/**\n * Races a promise against a timeout, returning 'timeout' if the timer wins.\n */\nexport async function raceWithTimeout<T>(promise: Promise<T>, ms: number): Promise<T | 'timeout'> {\n  let timer: ReturnType<typeof setTimeout> | undefined\n  const timeoutPromise = new Promise<'timeout'>(resolve => {\n    timer = setTimeout(() => resolve('timeout'), ms)\n  })\n  try {\n    return await Promise.race([promise, timeoutPromise])\n  } finally {\n    if (timer !== undefined) clearTimeout(timer)\n  }\n}\n\n/**\n * Maps over an array with an async function, using Promise.allSettled.\n * Returns an array of PromiseSettledResult.\n */\nexport async function allSettledMap<T, R>(\n  items: T[],\n  fn: (item: T) => Promise<R>,\n): Promise<PromiseSettledResult<R>[]> {\n  return await Promise.allSettled(items.map(fn))\n}\n\n/**\n * Maps over an array with an async function, limiting concurrency.\n *\n * @param concurrency - Maximum number of concurrent operations (default Infinity)\n */\nexport async function parallelMap<T, R>(\n  items: T[],\n  fn: (item: T) => Promise<R>,\n  concurrency = Number.POSITIVE_INFINITY,\n): Promise<R[]> {\n  if (concurrency === Number.POSITIVE_INFINITY) {\n    return await Promise.all(items.map(fn))\n  }\n\n  const results: R[] = []\n  const queue = [...items]\n\n  const worker = async (): Promise<void> => {\n    while (queue.length > 0) {\n      const item = queue.shift()!\n      results.push(await fn(item))\n    }\n  }\n\n  const workerCount = Math.min(concurrency, items.length)\n  const workers = Array.from({ length: workerCount }, () => worker())\n  await Promise.all(workers)\n  return results\n}\n\n/**\n * Retries an async function with exponential backoff.\n */\nexport async function retryAsync<T>(fn: () => Promise<T>, options?: RetryOptions): Promise<T> {\n  const { attempts = 3, baseDelay = 1000, maxDelay = 30000, shouldRetry = () => true } = options ?? {}\n  let lastError: unknown\n  for (let attempt = 0; attempt < attempts; attempt++) {\n    try {\n      return await fn()\n    } catch (error) {\n      lastError = error\n      if (!shouldRetry(error) || attempt >= attempts - 1) break\n      const delay = Math.min(baseDelay * 2 ** attempt + Math.random() * baseDelay, maxDelay)\n      await sleep(delay)\n    }\n  }\n  throw lastError\n}\n\n/**\n * Composes async functions, passing the result of each to the next.\n */\nexport async function pipeline<T>(initial: T, ...fns: Array<(arg: T) => Promise<T>>): Promise<T> {\n  let result = initial\n  for (const fn of fns) {\n    result = await fn(result)\n  }\n  return result\n}\n\n/**\n * Creates a deferred promise with external resolve and reject methods.\n */\nexport function deferred<T>(): Deferred<T> {\n  let resolve!: (value: T) => void\n  let reject!: (reason: unknown) => void\n  const promise = new Promise<T>((res, rej) => {\n    resolve = res\n    reject = rej\n  })\n  return { promise, resolve, reject }\n}\n\nexport interface Deferred<T> {\n  promise: Promise<T>\n  resolve: (value: T) => void\n  reject: (reason: unknown) => void\n}\n"],"mappings":";AAKO,SAAS,MAAM,IAA2B;AAC/C,SAAO,IAAI,QAAQ,aAAW,WAAW,SAAS,EAAE,CAAC;AACvD;AAKA,eAAsB,QAAW,SAAqB,IAAY,cAAmC;AACnG,MAAI;AACJ,QAAM,iBAAiB,IAAI,QAAe,CAAC,GAAG,WAAW;AACvD,YAAQ,WAAW,MAAM,OAAO,IAAI,MAAM,gBAAgB,2BAA2B,EAAE,IAAI,CAAC,GAAG,EAAE;AAAA,EACnG,CAAC;AACD,MAAI;AACF,WAAO,MAAM,QAAQ,KAAK,CAAC,SAAS,cAAc,CAAC;AAAA,EACrD,UAAE;AACA,QAAI,UAAU,OAAW,cAAa,KAAK;AAAA,EAC7C;AACF;AAKA,eAAsB,gBAAmB,SAAqB,IAAoC;AAChG,MAAI;AACJ,QAAM,iBAAiB,IAAI,QAAmB,aAAW;AACvD,YAAQ,WAAW,MAAM,QAAQ,SAAS,GAAG,EAAE;AAAA,EACjD,CAAC;AACD,MAAI;AACF,WAAO,MAAM,QAAQ,KAAK,CAAC,SAAS,cAAc,CAAC;AAAA,EACrD,UAAE;AACA,QAAI,UAAU,OAAW,cAAa,KAAK;AAAA,EAC7C;AACF;AAMA,eAAsB,cACpB,OACA,IACoC;AACpC,SAAO,MAAM,QAAQ,WAAW,MAAM,IAAI,EAAE,CAAC;AAC/C;AAOA,eAAsB,YACpB,OACA,IACA,cAAc,OAAO,mBACP;AACd,MAAI,gBAAgB,OAAO,mBAAmB;AAC5C,WAAO,MAAM,QAAQ,IAAI,MAAM,IAAI,EAAE,CAAC;AAAA,EACxC;AAEA,QAAM,UAAe,CAAC;AACtB,QAAM,QAAQ,CAAC,GAAG,KAAK;AAEvB,QAAM,SAAS,YAA2B;AACxC,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,OAAO,MAAM,MAAM;AACzB,cAAQ,KAAK,MAAM,GAAG,IAAI,CAAC;AAAA,IAC7B;AAAA,EACF;AAEA,QAAM,cAAc,KAAK,IAAI,aAAa,MAAM,MAAM;AACtD,QAAM,UAAU,MAAM,KAAK,EAAE,QAAQ,YAAY,GAAG,MAAM,OAAO,CAAC;AAClE,QAAM,QAAQ,IAAI,OAAO;AACzB,SAAO;AACT;AAKA,eAAsB,WAAc,IAAsB,SAAoC;AAC5F,QAAM,EAAE,WAAW,GAAG,YAAY,KAAM,WAAW,KAAO,cAAc,MAAM,KAAK,IAAI,WAAW,CAAC;AACnG,MAAI;AACJ,WAAS,UAAU,GAAG,UAAU,UAAU,WAAW;AACnD,QAAI;AACF,aAAO,MAAM,GAAG;AAAA,IAClB,SAAS,OAAO;AACd,kBAAY;AACZ,UAAI,CAAC,YAAY,KAAK,KAAK,WAAW,WAAW,EAAG;AACpD,YAAM,QAAQ,KAAK,IAAI,YAAY,KAAK,UAAU,KAAK,OAAO,IAAI,WAAW,QAAQ;AACrF,YAAM,MAAM,KAAK;AAAA,IACnB;AAAA,EACF;AACA,QAAM;AACR;AAKA,eAAsB,SAAY,YAAe,KAAgD;AAC/F,MAAI,SAAS;AACb,aAAW,MAAM,KAAK;AACpB,aAAS,MAAM,GAAG,MAAM;AAAA,EAC1B;AACA,SAAO;AACT;AAKO,SAAS,WAA2B;AACzC,MAAI;AACJ,MAAI;AACJ,QAAM,UAAU,IAAI,QAAW,CAAC,KAAK,QAAQ;AAC3C,cAAU;AACV,aAAS;AAAA,EACX,CAAC;AACD,SAAO,EAAE,SAAS,SAAS,OAAO;AACpC;","names":[]}
+{"version":3,"sources":["../../src/async/index.ts"],"sourcesContent":["import type { RetryOptions } from '../core/index.js'\r\n\r\n/**\r\n * Delays execution for the given number of milliseconds.\r\n */\r\nexport function sleep(ms: number): Promise<void> {\r\n  return new Promise(resolve => setTimeout(resolve, ms))\r\n}\r\n\r\n/**\r\n * Rejects a promise if it does not resolve within the specified timeout.\r\n */\r\nexport async function timeout<T>(promise: Promise<T>, ms: number, errorMessage?: string): Promise<T> {\r\n  let timer: ReturnType<typeof setTimeout> | undefined\r\n  const timeoutPromise = new Promise<never>((_, reject) => {\r\n    timer = setTimeout(() => reject(new Error(errorMessage ?? `Promise timed out after ${ms}ms`)), ms)\r\n  })\r\n  try {\r\n    return await Promise.race([promise, timeoutPromise])\r\n  } finally {\r\n    if (timer !== undefined) clearTimeout(timer)\r\n  }\r\n}\r\n\r\n/**\r\n * Races a promise against a timeout, returning 'timeout' if the timer wins.\r\n */\r\nexport async function raceWithTimeout<T>(promise: Promise<T>, ms: number): Promise<T | 'timeout'> {\r\n  let timer: ReturnType<typeof setTimeout> | undefined\r\n  const timeoutPromise = new Promise<'timeout'>(resolve => {\r\n    timer = setTimeout(() => resolve('timeout'), ms)\r\n  })\r\n  try {\r\n    return await Promise.race([promise, timeoutPromise])\r\n  } finally {\r\n    if (timer !== undefined) clearTimeout(timer)\r\n  }\r\n}\r\n\r\n/**\r\n * Maps over an array with an async function, using Promise.allSettled.\r\n * Returns an array of PromiseSettledResult.\r\n */\r\nexport async function allSettledMap<T, R>(\r\n  items: T[],\r\n  fn: (item: T) => Promise<R>,\r\n): Promise<PromiseSettledResult<R>[]> {\r\n  return await Promise.allSettled(items.map(fn))\r\n}\r\n\r\n/**\r\n * Maps over an array with an async function, limiting concurrency.\r\n *\r\n * @param concurrency - Maximum number of concurrent operations (default Infinity)\r\n */\r\nexport async function parallelMap<T, R>(\r\n  items: T[],\r\n  fn: (item: T) => Promise<R>,\r\n  concurrency = Number.POSITIVE_INFINITY,\r\n): Promise<R[]> {\r\n  if (concurrency === Number.POSITIVE_INFINITY) {\r\n    return await Promise.all(items.map(fn))\r\n  }\r\n\r\n  const results: R[] = []\r\n  const queue = [...items]\r\n\r\n  const worker = async (): Promise<void> => {\r\n    while (queue.length > 0) {\r\n      const item = queue.shift()!\r\n      results.push(await fn(item))\r\n    }\r\n  }\r\n\r\n  const workerCount = Math.min(concurrency, items.length)\r\n  const workers = Array.from({ length: workerCount }, () => worker())\r\n  await Promise.all(workers)\r\n  return results\r\n}\r\n\r\n/**\r\n * Retries an async function with exponential backoff.\r\n */\r\nexport async function retryAsync<T>(fn: () => Promise<T>, options?: RetryOptions): Promise<T> {\r\n  const { attempts = 3, baseDelay = 1000, maxDelay = 30000, shouldRetry = () => true } = options ?? {}\r\n  let lastError: unknown\r\n  for (let attempt = 0; attempt < attempts; attempt++) {\r\n    try {\r\n      return await fn()\r\n    } catch (error) {\r\n      lastError = error\r\n      if (!shouldRetry(error) || attempt >= attempts - 1) break\r\n      const delay = Math.min(baseDelay * 2 ** attempt + Math.random() * baseDelay, maxDelay)\r\n      await sleep(delay)\r\n    }\r\n  }\r\n  throw lastError\r\n}\r\n\r\n/**\r\n * Composes async functions, passing the result of each to the next.\r\n */\r\nexport async function pipeline<T>(initial: T, ...fns: Array<(arg: T) => Promise<T>>): Promise<T> {\r\n  let result = initial\r\n  for (const fn of fns) {\r\n    result = await fn(result)\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Creates a deferred promise with external resolve and reject methods.\r\n */\r\nexport function deferred<T>(): Deferred<T> {\r\n  let resolve!: (value: T) => void\r\n  let reject!: (reason: unknown) => void\r\n  const promise = new Promise<T>((res, rej) => {\r\n    resolve = res\r\n    reject = rej\r\n  })\r\n  return { promise, resolve, reject }\r\n}\r\n\r\nexport interface Deferred<T> {\r\n  promise: Promise<T>\r\n  resolve: (value: T) => void\r\n  reject: (reason: unknown) => void\r\n}\r\n"],"mappings":";AAKO,SAAS,MAAM,IAA2B;AAC/C,SAAO,IAAI,QAAQ,aAAW,WAAW,SAAS,EAAE,CAAC;AACvD;AAKA,eAAsB,QAAW,SAAqB,IAAY,cAAmC;AACnG,MAAI;AACJ,QAAM,iBAAiB,IAAI,QAAe,CAAC,GAAG,WAAW;AACvD,YAAQ,WAAW,MAAM,OAAO,IAAI,MAAM,gBAAgB,2BAA2B,EAAE,IAAI,CAAC,GAAG,EAAE;AAAA,EACnG,CAAC;AACD,MAAI;AACF,WAAO,MAAM,QAAQ,KAAK,CAAC,SAAS,cAAc,CAAC;AAAA,EACrD,UAAE;AACA,QAAI,UAAU,OAAW,cAAa,KAAK;AAAA,EAC7C;AACF;AAKA,eAAsB,gBAAmB,SAAqB,IAAoC;AAChG,MAAI;AACJ,QAAM,iBAAiB,IAAI,QAAmB,aAAW;AACvD,YAAQ,WAAW,MAAM,QAAQ,SAAS,GAAG,EAAE;AAAA,EACjD,CAAC;AACD,MAAI;AACF,WAAO,MAAM,QAAQ,KAAK,CAAC,SAAS,cAAc,CAAC;AAAA,EACrD,UAAE;AACA,QAAI,UAAU,OAAW,cAAa,KAAK;AAAA,EAC7C;AACF;AAMA,eAAsB,cACpB,OACA,IACoC;AACpC,SAAO,MAAM,QAAQ,WAAW,MAAM,IAAI,EAAE,CAAC;AAC/C;AAOA,eAAsB,YACpB,OACA,IACA,cAAc,OAAO,mBACP;AACd,MAAI,gBAAgB,OAAO,mBAAmB;AAC5C,WAAO,MAAM,QAAQ,IAAI,MAAM,IAAI,EAAE,CAAC;AAAA,EACxC;AAEA,QAAM,UAAe,CAAC;AACtB,QAAM,QAAQ,CAAC,GAAG,KAAK;AAEvB,QAAM,SAAS,YAA2B;AACxC,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,OAAO,MAAM,MAAM;AACzB,cAAQ,KAAK,MAAM,GAAG,IAAI,CAAC;AAAA,IAC7B;AAAA,EACF;AAEA,QAAM,cAAc,KAAK,IAAI,aAAa,MAAM,MAAM;AACtD,QAAM,UAAU,MAAM,KAAK,EAAE,QAAQ,YAAY,GAAG,MAAM,OAAO,CAAC;AAClE,QAAM,QAAQ,IAAI,OAAO;AACzB,SAAO;AACT;AAKA,eAAsB,WAAc,IAAsB,SAAoC;AAC5F,QAAM,EAAE,WAAW,GAAG,YAAY,KAAM,WAAW,KAAO,cAAc,MAAM,KAAK,IAAI,WAAW,CAAC;AACnG,MAAI;AACJ,WAAS,UAAU,GAAG,UAAU,UAAU,WAAW;AACnD,QAAI;AACF,aAAO,MAAM,GAAG;AAAA,IAClB,SAAS,OAAO;AACd,kBAAY;AACZ,UAAI,CAAC,YAAY,KAAK,KAAK,WAAW,WAAW,EAAG;AACpD,YAAM,QAAQ,KAAK,IAAI,YAAY,KAAK,UAAU,KAAK,OAAO,IAAI,WAAW,QAAQ;AACrF,YAAM,MAAM,KAAK;AAAA,IACnB;AAAA,EACF;AACA,QAAM;AACR;AAKA,eAAsB,SAAY,YAAe,KAAgD;AAC/F,MAAI,SAAS;AACb,aAAW,MAAM,KAAK;AACpB,aAAS,MAAM,GAAG,MAAM;AAAA,EAC1B;AACA,SAAO;AACT;AAKO,SAAS,WAA2B;AACzC,MAAI;AACJ,MAAI;AACJ,QAAM,UAAU,IAAI,QAAW,CAAC,KAAK,QAAQ;AAC3C,cAAU;AACV,aAAS;AAAA,EACX,CAAC;AACD,SAAO,EAAE,SAAS,SAAS,OAAO;AACpC;","names":[]}

package/dist/collection/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/collection/index.ts"],"sourcesContent":["/**\n * Groups an array of items by a key extracted from each item.\n *\n * @example groupBy([{ type: 'a' }, { type: 'b' }, { type: 'a' }], x => x.type)\n *          // => { a: [{ type: 'a' }, { type: 'a' }], b: [{ type: 'b' }] }\n */\nexport function groupBy<T, K extends string | number | symbol>(items: T[], keyFn: (item: T) => K): Record<K, T[]> {\n  const result = {} as Record<K, T[]>\n  for (const item of items) {\n    const key = keyFn(item)\n    if (!result[key]) result[key] = []\n    result[key]!.push(item)\n  }\n  return result\n}\n\n/**\n * Creates an object keyed by the result of keyFn for each item.\n *\n * @example keyBy([{ id: 1, name: 'a' }, { id: 2, name: 'b' }], x => x.id)\n *          // => { 1: { id: 1, name: 'a' }, 2: { id: 2, name: 'b' } }\n */\nexport function keyBy<T, K extends string | number | symbol>(items: T[], keyFn: (item: T) => K): Record<K, T> {\n  const result = {} as Record<K, T>\n  for (const item of items) {\n    const key = keyFn(item)\n    result[key] = item\n  }\n  return result\n}\n\n/**\n * Returns a copy of the object with the specified keys omitted.\n */\nexport function omit<T extends Record<string, unknown>, K extends keyof T>(obj: T, keys: K[]): Omit<T, K> {\n  const result = { ...obj } as T\n  for (const key of keys) {\n    delete result[key]\n  }\n  return result as Omit<T, K>\n}\n\n/**\n * Returns a copy of the object with only the specified keys.\n */\nexport function pick<T extends Record<string, unknown>, K extends keyof T>(obj: T, keys: K[]): Pick<T, K> {\n  const result = {} as Pick<T, K>\n  for (const key of keys) {\n    if (key in obj) {\n      result[key] = obj[key]\n    }\n  }\n  return result\n}\n\n/**\n * Extracts a property value from each item in an array.\n */\nexport function pluck<T, K extends keyof T>(items: T[], key: K): T[K][] {\n  return items.map(item => item[key])\n}\n\n/**\n * Randomizes array order in-place using the Fisher-Yates algorithm.\n */\nexport function shuffle<T>(items: T[]): T[] {\n  const result = [...items]\n  for (let i = result.length - 1; i > 0; i--) {\n    const j = Math.floor(Math.random() * (i + 1))\n    const temp = result[i]!\n    result[i] = result[j]!\n    result[j] = temp\n  }\n  return result\n}\n\n/**\n * Returns a random element from the array, or undefined if empty.\n */\nexport function sample<T>(items: T[]): T | undefined {\n  return items.length > 0 ? items[Math.floor(Math.random() * items.length)] : undefined\n}\n\n/**\n * Returns an array of `size` random elements (without duplicates).\n */\nexport function sampleSize<T>(items: T[], size: number): T[] {\n  if (size <= 0 || items.length === 0) return []\n  const pool = shuffle(items)\n  return pool.slice(0, Math.min(size, items.length))\n}\n\n/**\n * Splits an array into chunks of the specified size.\n */\nexport function chunk<T>(items: T[], size: number): T[][] {\n  if (size <= 0 || items.length === 0) return []\n  const result: T[][] = []\n  for (let i = 0; i < items.length; i += size) {\n    result.push(items.slice(i, i + size))\n  }\n  return result\n}\n\n/**\n * Returns a sorted copy of the array using the provided criteria functions.\n * Earlier criteria take precedence.\n */\nfunction compareValues(a: unknown, b: unknown): number {\n  if (a === b) return 0\n  if (a == null) return -1\n  if (b == null) return 1\n  if (typeof a === 'string' && typeof b === 'string') return a < b ? -1 : 1\n  if (typeof a === 'number' && typeof b === 'number') return a < b ? -1 : 1\n  return String(a) < String(b) ? -1 : 1\n}\n\nexport function sortBy<T>(items: T[], ...criteria: Array<(item: T) => unknown>): T[] {\n  return [...items].sort((a, b) => {\n    for (const criterion of criteria) {\n      const cmp = compareValues(criterion(a), criterion(b))\n      if (cmp !== 0) return cmp\n    }\n    return 0\n  })\n}\n\n/**\n * Returns a sorted copy of the array by a single key and direction.\n */\nexport function orderBy<T>(items: T[], key: (item: T) => unknown, direction: SortDirection = 'asc'): T[] {\n  return [...items].sort((a, b) => {\n    const cmp = compareValues(key(a), key(b))\n    return direction === 'asc' ? cmp : -cmp\n  })\n}\n\n/**\n * Returns unique elements based on the result of keyFn.\n */\nexport function uniqueBy<T>(items: T[], keyFn: (item: T) => unknown): T[] {\n  const seen = new Set<unknown>()\n  return items.filter(item => {\n    const key = keyFn(item)\n    if (seen.has(key)) return false\n    seen.add(key)\n    return true\n  })\n}\n\n/**\n * Flattens an array of arrays one level.\n */\nexport function flatten<T>(items: T[][]): T[] {\n  const result: T[] = []\n  for (const sub of items) {\n    for (const item of sub) {\n      result.push(item)\n    }\n  }\n  return result\n}\n\n/**\n * Returns an array with unique primitive values.\n */\nexport function uniq<T>(items: T[]): T[] {\n  return [...new Set(items)]\n}\n\n/**\n * Returns the first element, or undefined if empty.\n */\nexport function first<T>(items: T[]): T | undefined {\n  return items[0]\n}\n\n/**\n * Returns the last element, or undefined if empty.\n */\nexport function last<T>(items: T[]): T | undefined {\n  return items[items.length - 1]\n}\n\n/**\n * Checks if a value is empty.\n * Works for arrays, objects, strings, Map, and Set.\n */\nexport function isEmpty(value: unknown): boolean {\n  if (Array.isArray(value)) return value.length === 0\n  if (typeof value === 'string') return value.length === 0\n  if (value instanceof Map || value instanceof Set) return value.size === 0\n  if (value !== null && typeof value === 'object') return Object.keys(value as Record<string, unknown>).length === 0\n  return false\n}\n\nexport type SortDirection = 'asc' | 'desc'\n"],"mappings":";AAMO,SAAS,QAA+C,OAAY,OAAuC;AAChH,QAAM,SAAS,CAAC;AAChB,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,MAAM,IAAI;AACtB,QAAI,CAAC,OAAO,GAAG,EAAG,QAAO,GAAG,IAAI,CAAC;AACjC,WAAO,GAAG,EAAG,KAAK,IAAI;AAAA,EACxB;AACA,SAAO;AACT;AAQO,SAAS,MAA6C,OAAY,OAAqC;AAC5G,QAAM,SAAS,CAAC;AAChB,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,MAAM,IAAI;AACtB,WAAO,GAAG,IAAI;AAAA,EAChB;AACA,SAAO;AACT;AAKO,SAAS,KAA2D,KAAQ,MAAuB;AACxG,QAAM,SAAS,EAAE,GAAG,IAAI;AACxB,aAAW,OAAO,MAAM;AACtB,WAAO,OAAO,GAAG;AAAA,EACnB;AACA,SAAO;AACT;AAKO,SAAS,KAA2D,KAAQ,MAAuB;AACxG,QAAM,SAAS,CAAC;AAChB,aAAW,OAAO,MAAM;AACtB,QAAI,OAAO,KAAK;AACd,aAAO,GAAG,IAAI,IAAI,GAAG;AAAA,IACvB;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,MAA4B,OAAY,KAAgB;AACtE,SAAO,MAAM,IAAI,UAAQ,KAAK,GAAG,CAAC;AACpC;AAKO,SAAS,QAAW,OAAiB;AAC1C,QAAM,SAAS,CAAC,GAAG,KAAK;AACxB,WAAS,IAAI,OAAO,SAAS,GAAG,IAAI,GAAG,KAAK;AAC1C,UAAM,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI,EAAE;AAC5C,UAAM,OAAO,OAAO,CAAC;AACrB,WAAO,CAAC,IAAI,OAAO,CAAC;AACpB,WAAO,CAAC,IAAI;AAAA,EACd;AACA,SAAO;AACT;AAKO,SAAS,OAAU,OAA2B;AACnD,SAAO,MAAM,SAAS,IAAI,MAAM,KAAK,MAAM,KAAK,OAAO,IAAI,MAAM,MAAM,CAAC,IAAI;AAC9E;AAKO,SAAS,WAAc,OAAY,MAAmB;AAC3D,MAAI,QAAQ,KAAK,MAAM,WAAW,EAAG,QAAO,CAAC;AAC7C,QAAM,OAAO,QAAQ,KAAK;AAC1B,SAAO,KAAK,MAAM,GAAG,KAAK,IAAI,MAAM,MAAM,MAAM,CAAC;AACnD;AAKO,SAAS,MAAS,OAAY,MAAqB;AACxD,MAAI,QAAQ,KAAK,MAAM,WAAW,EAAG,QAAO,CAAC;AAC7C,QAAM,SAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,MAAM;AAC3C,WAAO,KAAK,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC;AAAA,EACtC;AACA,SAAO;AACT;AAMA,SAAS,cAAc,GAAY,GAAoB;AACrD,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,KAAK,KAAM,QAAO;AACtB,MAAI,KAAK,KAAM,QAAO;AACtB,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,IAAI,IAAI,KAAK;AACxE,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,IAAI,IAAI,KAAK;AACxE,SAAO,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,KAAK;AACtC;AAEO,SAAS,OAAU,UAAe,UAA4C;AACnF,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM;AAC/B,eAAW,aAAa,UAAU;AAChC,YAAM,MAAM,cAAc,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC;AACpD,UAAI,QAAQ,EAAG,QAAO;AAAA,IACxB;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAKO,SAAS,QAAW,OAAY,KAA2B,YAA2B,OAAY;AACvG,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM;AAC/B,UAAM,MAAM,cAAc,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACxC,WAAO,cAAc,QAAQ,MAAM,CAAC;AAAA,EACtC,CAAC;AACH;AAKO,SAAS,SAAY,OAAY,OAAkC;AACxE,QAAM,OAAO,oBAAI,IAAa;AAC9B,SAAO,MAAM,OAAO,UAAQ;AAC1B,UAAM,MAAM,MAAM,IAAI;AACtB,QAAI,KAAK,IAAI,GAAG,EAAG,QAAO;AAC1B,SAAK,IAAI,GAAG;AACZ,WAAO;AAAA,EACT,CAAC;AACH;AAKO,SAAS,QAAW,OAAmB;AAC5C,QAAM,SAAc,CAAC;AACrB,aAAW,OAAO,OAAO;AACvB,eAAW,QAAQ,KAAK;AACtB,aAAO,KAAK,IAAI;AAAA,IAClB;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,KAAQ,OAAiB;AACvC,SAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;AAC3B;AAKO,SAAS,MAAS,OAA2B;AAClD,SAAO,MAAM,CAAC;AAChB;AAKO,SAAS,KAAQ,OAA2B;AACjD,SAAO,MAAM,MAAM,SAAS,CAAC;AAC/B;AAMO,SAAS,QAAQ,OAAyB;AAC/C,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,WAAW;AAClD,MAAI,OAAO,UAAU,SAAU,QAAO,MAAM,WAAW;AACvD,MAAI,iBAAiB,OAAO,iBAAiB,IAAK,QAAO,MAAM,SAAS;AACxE,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO,OAAO,KAAK,KAAgC,EAAE,WAAW;AACjH,SAAO;AACT;","names":[]}
+{"version":3,"sources":["../../src/collection/index.ts"],"sourcesContent":["/**\r\n * Groups an array of items by a key extracted from each item.\r\n *\r\n * @example groupBy([{ type: 'a' }, { type: 'b' }, { type: 'a' }], x => x.type)\r\n *          // => { a: [{ type: 'a' }, { type: 'a' }], b: [{ type: 'b' }] }\r\n */\r\nexport function groupBy<T, K extends string | number | symbol>(items: T[], keyFn: (item: T) => K): Record<K, T[]> {\r\n  const result = {} as Record<K, T[]>\r\n  for (const item of items) {\r\n    const key = keyFn(item)\r\n    if (!result[key]) result[key] = []\r\n    result[key]!.push(item)\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Creates an object keyed by the result of keyFn for each item.\r\n *\r\n * @example keyBy([{ id: 1, name: 'a' }, { id: 2, name: 'b' }], x => x.id)\r\n *          // => { 1: { id: 1, name: 'a' }, 2: { id: 2, name: 'b' } }\r\n */\r\nexport function keyBy<T, K extends string | number | symbol>(items: T[], keyFn: (item: T) => K): Record<K, T> {\r\n  const result = {} as Record<K, T>\r\n  for (const item of items) {\r\n    const key = keyFn(item)\r\n    result[key] = item\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Returns a copy of the object with the specified keys omitted.\r\n */\r\nexport function omit<T extends Record<string, unknown>, K extends keyof T>(obj: T, keys: K[]): Omit<T, K> {\r\n  const result = { ...obj } as T\r\n  for (const key of keys) {\r\n    delete result[key]\r\n  }\r\n  return result as Omit<T, K>\r\n}\r\n\r\n/**\r\n * Returns a copy of the object with only the specified keys.\r\n */\r\nexport function pick<T extends Record<string, unknown>, K extends keyof T>(obj: T, keys: K[]): Pick<T, K> {\r\n  const result = {} as Pick<T, K>\r\n  for (const key of keys) {\r\n    if (key in obj) {\r\n      result[key] = obj[key]\r\n    }\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Extracts a property value from each item in an array.\r\n */\r\nexport function pluck<T, K extends keyof T>(items: T[], key: K): T[K][] {\r\n  return items.map(item => item[key])\r\n}\r\n\r\n/**\r\n * Randomizes array order in-place using the Fisher-Yates algorithm.\r\n */\r\nexport function shuffle<T>(items: T[]): T[] {\r\n  const result = [...items]\r\n  for (let i = result.length - 1; i > 0; i--) {\r\n    const j = Math.floor(Math.random() * (i + 1))\r\n    const temp = result[i]!\r\n    result[i] = result[j]!\r\n    result[j] = temp\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Returns a random element from the array, or undefined if empty.\r\n */\r\nexport function sample<T>(items: T[]): T | undefined {\r\n  return items.length > 0 ? items[Math.floor(Math.random() * items.length)] : undefined\r\n}\r\n\r\n/**\r\n * Returns an array of `size` random elements (without duplicates).\r\n */\r\nexport function sampleSize<T>(items: T[], size: number): T[] {\r\n  if (size <= 0 || items.length === 0) return []\r\n  const pool = shuffle(items)\r\n  return pool.slice(0, Math.min(size, items.length))\r\n}\r\n\r\n/**\r\n * Splits an array into chunks of the specified size.\r\n */\r\nexport function chunk<T>(items: T[], size: number): T[][] {\r\n  if (size <= 0 || items.length === 0) return []\r\n  const result: T[][] = []\r\n  for (let i = 0; i < items.length; i += size) {\r\n    result.push(items.slice(i, i + size))\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Returns a sorted copy of the array using the provided criteria functions.\r\n * Earlier criteria take precedence.\r\n */\r\nfunction compareValues(a: unknown, b: unknown): number {\r\n  if (a === b) return 0\r\n  if (a == null) return -1\r\n  if (b == null) return 1\r\n  if (typeof a === 'string' && typeof b === 'string') return a < b ? -1 : 1\r\n  if (typeof a === 'number' && typeof b === 'number') return a < b ? -1 : 1\r\n  return String(a) < String(b) ? -1 : 1\r\n}\r\n\r\nexport function sortBy<T>(items: T[], ...criteria: Array<(item: T) => unknown>): T[] {\r\n  return [...items].sort((a, b) => {\r\n    for (const criterion of criteria) {\r\n      const cmp = compareValues(criterion(a), criterion(b))\r\n      if (cmp !== 0) return cmp\r\n    }\r\n    return 0\r\n  })\r\n}\r\n\r\n/**\r\n * Returns a sorted copy of the array by a single key and direction.\r\n */\r\nexport function orderBy<T>(items: T[], key: (item: T) => unknown, direction: SortDirection = 'asc'): T[] {\r\n  return [...items].sort((a, b) => {\r\n    const cmp = compareValues(key(a), key(b))\r\n    return direction === 'asc' ? cmp : -cmp\r\n  })\r\n}\r\n\r\n/**\r\n * Returns unique elements based on the result of keyFn.\r\n */\r\nexport function uniqueBy<T>(items: T[], keyFn: (item: T) => unknown): T[] {\r\n  const seen = new Set<unknown>()\r\n  return items.filter(item => {\r\n    const key = keyFn(item)\r\n    if (seen.has(key)) return false\r\n    seen.add(key)\r\n    return true\r\n  })\r\n}\r\n\r\n/**\r\n * Flattens an array of arrays one level.\r\n */\r\nexport function flatten<T>(items: T[][]): T[] {\r\n  const result: T[] = []\r\n  for (const sub of items) {\r\n    for (const item of sub) {\r\n      result.push(item)\r\n    }\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Returns an array with unique primitive values.\r\n */\r\nexport function uniq<T>(items: T[]): T[] {\r\n  return [...new Set(items)]\r\n}\r\n\r\n/**\r\n * Returns the first element, or undefined if empty.\r\n */\r\nexport function first<T>(items: T[]): T | undefined {\r\n  return items[0]\r\n}\r\n\r\n/**\r\n * Returns the last element, or undefined if empty.\r\n */\r\nexport function last<T>(items: T[]): T | undefined {\r\n  return items[items.length - 1]\r\n}\r\n\r\n/**\r\n * Checks if a value is empty.\r\n * Works for arrays, objects, strings, Map, and Set.\r\n */\r\nexport function isEmpty(value: unknown): boolean {\r\n  if (Array.isArray(value)) return value.length === 0\r\n  if (typeof value === 'string') return value.length === 0\r\n  if (value instanceof Map || value instanceof Set) return value.size === 0\r\n  if (value !== null && typeof value === 'object') return Object.keys(value as Record<string, unknown>).length === 0\r\n  return false\r\n}\r\n\r\nexport type SortDirection = 'asc' | 'desc'\r\n"],"mappings":";AAMO,SAAS,QAA+C,OAAY,OAAuC;AAChH,QAAM,SAAS,CAAC;AAChB,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,MAAM,IAAI;AACtB,QAAI,CAAC,OAAO,GAAG,EAAG,QAAO,GAAG,IAAI,CAAC;AACjC,WAAO,GAAG,EAAG,KAAK,IAAI;AAAA,EACxB;AACA,SAAO;AACT;AAQO,SAAS,MAA6C,OAAY,OAAqC;AAC5G,QAAM,SAAS,CAAC;AAChB,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,MAAM,IAAI;AACtB,WAAO,GAAG,IAAI;AAAA,EAChB;AACA,SAAO;AACT;AAKO,SAAS,KAA2D,KAAQ,MAAuB;AACxG,QAAM,SAAS,EAAE,GAAG,IAAI;AACxB,aAAW,OAAO,MAAM;AACtB,WAAO,OAAO,GAAG;AAAA,EACnB;AACA,SAAO;AACT;AAKO,SAAS,KAA2D,KAAQ,MAAuB;AACxG,QAAM,SAAS,CAAC;AAChB,aAAW,OAAO,MAAM;AACtB,QAAI,OAAO,KAAK;AACd,aAAO,GAAG,IAAI,IAAI,GAAG;AAAA,IACvB;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,MAA4B,OAAY,KAAgB;AACtE,SAAO,MAAM,IAAI,UAAQ,KAAK,GAAG,CAAC;AACpC;AAKO,SAAS,QAAW,OAAiB;AAC1C,QAAM,SAAS,CAAC,GAAG,KAAK;AACxB,WAAS,IAAI,OAAO,SAAS,GAAG,IAAI,GAAG,KAAK;AAC1C,UAAM,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI,EAAE;AAC5C,UAAM,OAAO,OAAO,CAAC;AACrB,WAAO,CAAC,IAAI,OAAO,CAAC;AACpB,WAAO,CAAC,IAAI;AAAA,EACd;AACA,SAAO;AACT;AAKO,SAAS,OAAU,OAA2B;AACnD,SAAO,MAAM,SAAS,IAAI,MAAM,KAAK,MAAM,KAAK,OAAO,IAAI,MAAM,MAAM,CAAC,IAAI;AAC9E;AAKO,SAAS,WAAc,OAAY,MAAmB;AAC3D,MAAI,QAAQ,KAAK,MAAM,WAAW,EAAG,QAAO,CAAC;AAC7C,QAAM,OAAO,QAAQ,KAAK;AAC1B,SAAO,KAAK,MAAM,GAAG,KAAK,IAAI,MAAM,MAAM,MAAM,CAAC;AACnD;AAKO,SAAS,MAAS,OAAY,MAAqB;AACxD,MAAI,QAAQ,KAAK,MAAM,WAAW,EAAG,QAAO,CAAC;AAC7C,QAAM,SAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,MAAM;AAC3C,WAAO,KAAK,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC;AAAA,EACtC;AACA,SAAO;AACT;AAMA,SAAS,cAAc,GAAY,GAAoB;AACrD,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,KAAK,KAAM,QAAO;AACtB,MAAI,KAAK,KAAM,QAAO;AACtB,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,IAAI,IAAI,KAAK;AACxE,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,IAAI,IAAI,KAAK;AACxE,SAAO,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,KAAK;AACtC;AAEO,SAAS,OAAU,UAAe,UAA4C;AACnF,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM;AAC/B,eAAW,aAAa,UAAU;AAChC,YAAM,MAAM,cAAc,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC;AACpD,UAAI,QAAQ,EAAG,QAAO;AAAA,IACxB;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAKO,SAAS,QAAW,OAAY,KAA2B,YAA2B,OAAY;AACvG,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM;AAC/B,UAAM,MAAM,cAAc,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACxC,WAAO,cAAc,QAAQ,MAAM,CAAC;AAAA,EACtC,CAAC;AACH;AAKO,SAAS,SAAY,OAAY,OAAkC;AACxE,QAAM,OAAO,oBAAI,IAAa;AAC9B,SAAO,MAAM,OAAO,UAAQ;AAC1B,UAAM,MAAM,MAAM,IAAI;AACtB,QAAI,KAAK,IAAI,GAAG,EAAG,QAAO;AAC1B,SAAK,IAAI,GAAG;AACZ,WAAO;AAAA,EACT,CAAC;AACH;AAKO,SAAS,QAAW,OAAmB;AAC5C,QAAM,SAAc,CAAC;AACrB,aAAW,OAAO,OAAO;AACvB,eAAW,QAAQ,KAAK;AACtB,aAAO,KAAK,IAAI;AAAA,IAClB;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,KAAQ,OAAiB;AACvC,SAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;AAC3B;AAKO,SAAS,MAAS,OAA2B;AAClD,SAAO,MAAM,CAAC;AAChB;AAKO,SAAS,KAAQ,OAA2B;AACjD,SAAO,MAAM,MAAM,SAAS,CAAC;AAC/B;AAMO,SAAS,QAAQ,OAAyB;AAC/C,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,WAAW;AAClD,MAAI,OAAO,UAAU,SAAU,QAAO,MAAM,WAAW;AACvD,MAAI,iBAAiB,OAAO,iBAAiB,IAAK,QAAO,MAAM,SAAS;AACxE,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO,OAAO,KAAK,KAAgC,EAAE,WAAW;AACjH,SAAO;AACT;","names":[]}

package/dist/core/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/core/index.ts"],"sourcesContent":["export interface DebounceOptions {\n  leading?: boolean\n  trailing?: boolean\n  maxWait?: number\n}\n\nexport interface DebouncedFunction<T extends (...args: unknown[]) => unknown> {\n  (...args: Parameters<T>): void\n  cancel(): void\n  flush(): void\n}\n\nexport interface MemoizedFunction<T extends (...args: unknown[]) => unknown> {\n  (...args: Parameters<T>): ReturnType<T>\n  cache: Map<string, ReturnType<T>>\n}\n\nexport interface RetryOptions {\n  attempts?: number\n  baseDelay?: number\n  maxDelay?: number\n  shouldRetry?: (error: unknown) => boolean\n}\n\nfunction isPlainObject(value: unknown): value is Record<string, unknown> {\n  if (value === null || typeof value !== 'object') return false\n  const proto = Object.getPrototypeOf(value)\n  return proto === Object.prototype || proto === null\n}\n\nfunction getType(value: unknown): string {\n  return Object.prototype.toString.call(value)\n}\n\nfunction clone<T>(value: T, seen: WeakMap<object, unknown>): T {\n  if (value === null || typeof value !== 'object') return value\n\n  if (seen.has(value as object)) return seen.get(value as object) as T\n\n  const tag = getType(value)\n\n  if (tag === '[object Date]') {\n    const cloned = new Date((value as unknown as Date).getTime())\n    seen.set(value as object, cloned)\n    return cloned as unknown as T\n  }\n\n  if (tag === '[object RegExp]') {\n    const regExp = value as unknown as RegExp\n    const cloned = new RegExp(regExp.source, regExp.flags)\n    cloned.lastIndex = regExp.lastIndex\n    seen.set(value as object, cloned)\n    return cloned as unknown as T\n  }\n\n  if (tag === '[object Map]') {\n    const cloned = new Map<unknown, unknown>()\n    seen.set(value as object, cloned)\n    ;(value as unknown as Map<unknown, unknown>).forEach((v, k) => {\n      cloned.set(clone(k, seen), clone(v, seen))\n    })\n    return cloned as unknown as T\n  }\n\n  if (tag === '[object Set]') {\n    const cloned = new Set<unknown>()\n    seen.set(value as object, cloned)\n    ;(value as unknown as Set<unknown>).forEach(v => {\n      cloned.add(clone(v, seen))\n    })\n    return cloned as unknown as T\n  }\n\n  if (Array.isArray(value)) {\n    const cloned: unknown[] = []\n    seen.set(value as object, cloned)\n    for (let i = 0; i < value.length; i++) {\n      cloned[i] = clone(value[i], seen)\n    }\n    return cloned as unknown as T\n  }\n\n  if (tag === '[object Object]') {\n    const cloned: Record<string, unknown> = {}\n    seen.set(value as object, cloned)\n    const keys = Object.keys(value as Record<string, unknown>)\n    for (let i = 0; i < keys.length; i++) {\n      const key = keys[i]!\n      cloned[key] = clone((value as Record<string, unknown>)[key], seen)\n    }\n    return cloned as unknown as T\n  }\n\n  return value\n}\n\n/**\n * Deep clone a value, supporting objects, arrays, Date, RegExp, Map, Set,\n * and cyclic references.\n *\n * @param value - The value to clone.\n * @returns A deep copy of the input value.\n */\nexport function deepClone<T>(value: T): T {\n  const seen = new WeakMap<object, unknown>()\n  return clone(value, seen)\n}\n\n/**\n * Deep merge multiple objects. Arrays are overwritten, not concatenated.\n * `null` and `undefined` source objects are skipped.\n *\n * @param objects - The objects to merge.\n * @returns A new object with merged properties.\n */\nexport function deepMerge<T extends Record<string, unknown>>(...objects: Partial<T>[]): T {\n  const result = {} as T\n\n  for (let i = 0; i < objects.length; i++) {\n    const obj = objects[i]\n    if (obj === null || obj === undefined) continue\n\n    const keys = Object.keys(obj) as (keyof T)[]\n    for (let j = 0; j < keys.length; j++) {\n      const key = keys[j]!\n      const val = obj[key]\n      const existing = result[key]\n\n      if (val !== undefined && isPlainObject(val) && isPlainObject(existing)) {\n        result[key] = deepMerge(\n          existing as Record<string, unknown>,\n          val as Record<string, unknown>\n        ) as T[keyof T]\n      } else if (val !== undefined) {\n        result[key] = val as T[keyof T]\n      }\n    }\n  }\n\n  return result\n}\n\n/**\n * Creates a debounced function that delays invoking `fn` until after `wait`\n * milliseconds have elapsed since the last invocation. Supports leading,\n * trailing, and maxWait options. The returned function also has `.cancel()`\n * and `.flush()` methods.\n *\n * @param fn - The function to debounce.\n * @param wait - The number of milliseconds to delay.\n * @param options - Optional configuration.\n * @returns A debounced function with `.cancel()` and `.flush()`.\n */\nexport function debounce<T extends (...args: unknown[]) => unknown>(\n  fn: T,\n  wait: number,\n  options?: DebounceOptions\n): DebouncedFunction<T> {\n  const { leading = false, trailing = true, maxWait } = options ?? {}\n\n  let timer: ReturnType<typeof setTimeout> | null = null\n  let maxTimer: ReturnType<typeof setTimeout> | null = null\n  let lastArgs: Parameters<T> | null = null\n  let lastCallTime: number | null = null\n  let lastInvokeTime = 0\n\n  function invoke(time: number): void {\n    lastInvokeTime = time\n    if (lastArgs) {\n      fn(...lastArgs)\n      lastArgs = null\n    }\n  }\n\n  function startTimer(waitTime: number): void {\n    if (timer) clearTimeout(timer)\n    timer = setTimeout(() => {\n      const now = Date.now()\n      if (lastArgs && trailing) {\n        invoke(now)\n      }\n      timer = null\n      lastCallTime = null\n    }, waitTime)\n  }\n\n  function startMaxTimer(): void {\n    if (maxWait === undefined || maxTimer) return\n    maxTimer = setTimeout(() => {\n      if (lastArgs) {\n        invoke(Date.now())\n        if (timer) {\n          clearTimeout(timer)\n          timer = null\n        }\n        lastCallTime = null\n      }\n    }, maxWait)\n  }\n\n  function clearAllTimers(): void {\n    if (timer) {\n      clearTimeout(timer)\n      timer = null\n    }\n    if (maxTimer) {\n      clearTimeout(maxTimer)\n      maxTimer = null\n    }\n  }\n\n  function shouldInvoke(time: number): boolean {\n    if (lastCallTime === null) return true\n    const timeSinceLastCall = time - lastCallTime\n    const timeSinceLastInvoke = time - lastInvokeTime\n    return (\n      timeSinceLastCall >= wait ||\n      (maxWait !== undefined && timeSinceLastInvoke >= maxWait)\n    )\n  }\n\n  const debounced = function (this: unknown, ...args: Parameters<T>): void {\n    const time = Date.now()\n    const isInvoking = shouldInvoke(time)\n\n    lastArgs = args\n    lastCallTime = time\n\n    if (isInvoking && !timer && leading) {\n      invoke(time)\n    }\n\n    if (!timer) {\n      startTimer(wait)\n      if (maxWait !== undefined) {\n        startMaxTimer()\n      }\n    }\n  } as DebouncedFunction<T>\n\n  debounced.cancel = (): void => {\n    clearAllTimers()\n    lastArgs = null\n    lastCallTime = null\n    lastInvokeTime = 0\n  }\n\n  debounced.flush = (): void => {\n    if (timer && lastArgs) {\n      invoke(Date.now())\n      clearAllTimers()\n      lastCallTime = null\n    }\n  }\n\n  return debounced\n}\n\n/**\n * Creates a throttled function that only invokes `fn` at most once per\n * `wait` milliseconds.\n *\n * @param fn - The function to throttle.\n * @param wait - The number of milliseconds to throttle invocations to.\n * @returns A throttled function.\n */\nexport function throttle<T extends (...args: unknown[]) => unknown>(\n  fn: T,\n  wait: number\n): (...args: Parameters<T>) => void {\n  let lastTime = 0\n  let timer: ReturnType<typeof setTimeout> | null = null\n  let lastArgs: Parameters<T> | null = null\n\n  const throttled = function (this: unknown, ...args: Parameters<T>): void {\n    const now = Date.now()\n    const remaining = wait - (now - lastTime)\n\n    if (remaining <= 0) {\n      if (timer) {\n        clearTimeout(timer)\n        timer = null\n      }\n      lastTime = now\n      lastArgs = null\n      fn.apply(this, args)\n    } else {\n      lastArgs = args\n      if (!timer) {\n        timer = setTimeout(() => {\n          lastTime = Date.now()\n          timer = null\n          if (lastArgs) {\n            fn.apply(this, lastArgs)\n            lastArgs = null\n          }\n        }, remaining)\n      }\n    }\n  }\n\n  return throttled\n}\n\n/**\n * Creates a memoized version of `fn`. Uses a `Map` cache keyed by the\n * first argument by default, or by a custom `resolver` function.\n *\n * @param fn - The function to memoize.\n * @param resolver - Optional function to determine the cache key.\n * @returns The memoized function with a `.cache` property.\n */\nexport function memoize<T extends (...args: unknown[]) => unknown>(\n  fn: T,\n  resolver?: (...args: Parameters<T>) => string\n): MemoizedFunction<T> {\n  const cache = new Map<string, ReturnType<T>>()\n\n  const memoized = function (this: unknown, ...args: Parameters<T>): ReturnType<T> {\n    const key = resolver ? resolver(...args) : String(args[0])\n    if (cache.has(key)) {\n      return cache.get(key) as ReturnType<T>\n    }\n    const result = fn.apply(this, args) as ReturnType<T>\n    cache.set(key, result)\n    return result\n  }\n\n  memoized.cache = cache\n\n  return memoized as MemoizedFunction<T>\n}\n\n/**\n * Retries an async function with exponential backoff and jitter.\n *\n * @param fn - The async function to retry.\n * @param options - Retry configuration.\n * @returns A promise that resolves with the function result.\n */\nexport function retry<T>(\n  fn: () => Promise<T>,\n  options?: RetryOptions\n): Promise<T> {\n  const {\n    attempts = 3,\n    baseDelay = 1000,\n    maxDelay = 30000,\n    shouldRetry = () => true,\n  } = options ?? {}\n\n  let attempt = 0\n\n  const execute = (): Promise<T> => {\n    attempt++\n    return fn().catch((error: unknown) => {\n      if (attempt >= attempts || !shouldRetry(error)) {\n        throw error\n      }\n\n      const delay = Math.min(\n        baseDelay * Math.pow(2, attempt - 1) + Math.random() * baseDelay,\n        maxDelay\n      )\n\n      return new Promise<T>(resolve => {\n        setTimeout(() => {\n          resolve(execute())\n        }, delay)\n      })\n    })\n  }\n\n  return execute()\n}\n\n/**\n * A no-operation function that returns `undefined`.\n */\nexport function noop(): void {\n  return undefined\n}\n\n/**\n * Returns the given value unchanged.\n *\n * @param value - The value to return.\n * @returns The same value.\n */\nexport function identity<T>(value: T): T {\n  return value\n}\n\n/**\n * Creates a function that invokes `fn` only once. Subsequent calls return\n * the result of the first invocation.\n *\n * @param fn - The function to wrap.\n * @returns A function that runs only once.\n */\nexport function once<T extends (...args: unknown[]) => unknown>(\n  fn: T\n): (...args: Parameters<T>) => ReturnType<T> {\n  let called = false\n  let result: ReturnType<T>\n\n  return function (this: unknown, ...args: Parameters<T>): ReturnType<T> {\n    if (!called) {\n      called = true\n      result = fn.apply(this, args) as ReturnType<T>\n    }\n    return result\n  }\n}\n"],"mappings":";AAwBA,SAAS,cAAc,OAAkD;AACvE,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO;AACxD,QAAM,QAAQ,OAAO,eAAe,KAAK;AACzC,SAAO,UAAU,OAAO,aAAa,UAAU;AACjD;AAEA,SAAS,QAAQ,OAAwB;AACvC,SAAO,OAAO,UAAU,SAAS,KAAK,KAAK;AAC7C;AAEA,SAAS,MAAS,OAAU,MAAmC;AAC7D,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO;AAExD,MAAI,KAAK,IAAI,KAAe,EAAG,QAAO,KAAK,IAAI,KAAe;AAE9D,QAAM,MAAM,QAAQ,KAAK;AAEzB,MAAI,QAAQ,iBAAiB;AAC3B,UAAM,SAAS,IAAI,KAAM,MAA0B,QAAQ,CAAC;AAC5D,SAAK,IAAI,OAAiB,MAAM;AAChC,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,mBAAmB;AAC7B,UAAM,SAAS;AACf,UAAM,SAAS,IAAI,OAAO,OAAO,QAAQ,OAAO,KAAK;AACrD,WAAO,YAAY,OAAO;AAC1B,SAAK,IAAI,OAAiB,MAAM;AAChC,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,gBAAgB;AAC1B,UAAM,SAAS,oBAAI,IAAsB;AACzC,SAAK,IAAI,OAAiB,MAAM;AAC/B,IAAC,MAA2C,QAAQ,CAAC,GAAG,MAAM;AAC7D,aAAO,IAAI,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC;AAAA,IAC3C,CAAC;AACD,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,gBAAgB;AAC1B,UAAM,SAAS,oBAAI,IAAa;AAChC,SAAK,IAAI,OAAiB,MAAM;AAC/B,IAAC,MAAkC,QAAQ,OAAK;AAC/C,aAAO,IAAI,MAAM,GAAG,IAAI,CAAC;AAAA,IAC3B,CAAC;AACD,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAM,SAAoB,CAAC;AAC3B,SAAK,IAAI,OAAiB,MAAM;AAChC,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,aAAO,CAAC,IAAI,MAAM,MAAM,CAAC,GAAG,IAAI;AAAA,IAClC;AACA,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,mBAAmB;AAC7B,UAAM,SAAkC,CAAC;AACzC,SAAK,IAAI,OAAiB,MAAM;AAChC,UAAM,OAAO,OAAO,KAAK,KAAgC;AACzD,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,MAAM,KAAK,CAAC;AAClB,aAAO,GAAG,IAAI,MAAO,MAAkC,GAAG,GAAG,IAAI;AAAA,IACnE;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AASO,SAAS,UAAa,OAAa;AACxC,QAAM,OAAO,oBAAI,QAAyB;AAC1C,SAAO,MAAM,OAAO,IAAI;AAC1B;AASO,SAAS,aAAgD,SAA0B;AACxF,QAAM,SAAS,CAAC;AAEhB,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,UAAM,MAAM,QAAQ,CAAC;AACrB,QAAI,QAAQ,QAAQ,QAAQ,OAAW;AAEvC,UAAM,OAAO,OAAO,KAAK,GAAG;AAC5B,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,MAAM,KAAK,CAAC;AAClB,YAAM,MAAM,IAAI,GAAG;AACnB,YAAM,WAAW,OAAO,GAAG;AAE3B,UAAI,QAAQ,UAAa,cAAc,GAAG,KAAK,cAAc,QAAQ,GAAG;AACtE,eAAO,GAAG,IAAI;AAAA,UACZ;AAAA,UACA;AAAA,QACF;AAAA,MACF,WAAW,QAAQ,QAAW;AAC5B,eAAO,GAAG,IAAI;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAaO,SAAS,SACd,IACA,MACA,SACsB;AACtB,QAAM,EAAE,UAAU,OAAO,WAAW,MAAM,QAAQ,IAAI,WAAW,CAAC;AAElE,MAAI,QAA8C;AAClD,MAAI,WAAiD;AACrD,MAAI,WAAiC;AACrC,MAAI,eAA8B;AAClC,MAAI,iBAAiB;AAErB,WAAS,OAAO,MAAoB;AAClC,qBAAiB;AACjB,QAAI,UAAU;AACZ,SAAG,GAAG,QAAQ;AACd,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,WAAS,WAAW,UAAwB;AAC1C,QAAI,MAAO,cAAa,KAAK;AAC7B,YAAQ,WAAW,MAAM;AACvB,YAAM,MAAM,KAAK,IAAI;AACrB,UAAI,YAAY,UAAU;AACxB,eAAO,GAAG;AAAA,MACZ;AACA,cAAQ;AACR,qBAAe;AAAA,IACjB,GAAG,QAAQ;AAAA,EACb;AAEA,WAAS,gBAAsB;AAC7B,QAAI,YAAY,UAAa,SAAU;AACvC,eAAW,WAAW,MAAM;AAC1B,UAAI,UAAU;AACZ,eAAO,KAAK,IAAI,CAAC;AACjB,YAAI,OAAO;AACT,uBAAa,KAAK;AAClB,kBAAQ;AAAA,QACV;AACA,uBAAe;AAAA,MACjB;AAAA,IACF,GAAG,OAAO;AAAA,EACZ;AAEA,WAAS,iBAAuB;AAC9B,QAAI,OAAO;AACT,mBAAa,KAAK;AAClB,cAAQ;AAAA,IACV;AACA,QAAI,UAAU;AACZ,mBAAa,QAAQ;AACrB,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,WAAS,aAAa,MAAuB;AAC3C,QAAI,iBAAiB,KAAM,QAAO;AAClC,UAAM,oBAAoB,OAAO;AACjC,UAAM,sBAAsB,OAAO;AACnC,WACE,qBAAqB,QACpB,YAAY,UAAa,uBAAuB;AAAA,EAErD;AAEA,QAAM,YAAY,YAA4B,MAA2B;AACvE,UAAM,OAAO,KAAK,IAAI;AACtB,UAAM,aAAa,aAAa,IAAI;AAEpC,eAAW;AACX,mBAAe;AAEf,QAAI,cAAc,CAAC,SAAS,SAAS;AACnC,aAAO,IAAI;AAAA,IACb;AAEA,QAAI,CAAC,OAAO;AACV,iBAAW,IAAI;AACf,UAAI,YAAY,QAAW;AACzB,sBAAc;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAEA,YAAU,SAAS,MAAY;AAC7B,mBAAe;AACf,eAAW;AACX,mBAAe;AACf,qBAAiB;AAAA,EACnB;AAEA,YAAU,QAAQ,MAAY;AAC5B,QAAI,SAAS,UAAU;AACrB,aAAO,KAAK,IAAI,CAAC;AACjB,qBAAe;AACf,qBAAe;AAAA,IACjB;AAAA,EACF;AAEA,SAAO;AACT;AAUO,SAAS,SACd,IACA,MACkC;AAClC,MAAI,WAAW;AACf,MAAI,QAA8C;AAClD,MAAI,WAAiC;AAErC,QAAM,YAAY,YAA4B,MAA2B;AACvE,UAAM,MAAM,KAAK,IAAI;AACrB,UAAM,YAAY,QAAQ,MAAM;AAEhC,QAAI,aAAa,GAAG;AAClB,UAAI,OAAO;AACT,qBAAa,KAAK;AAClB,gBAAQ;AAAA,MACV;AACA,iBAAW;AACX,iBAAW;AACX,SAAG,MAAM,MAAM,IAAI;AAAA,IACrB,OAAO;AACL,iBAAW;AACX,UAAI,CAAC,OAAO;AACV,gBAAQ,WAAW,MAAM;AACvB,qBAAW,KAAK,IAAI;AACpB,kBAAQ;AACR,cAAI,UAAU;AACZ,eAAG,MAAM,MAAM,QAAQ;AACvB,uBAAW;AAAA,UACb;AAAA,QACF,GAAG,SAAS;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAUO,SAAS,QACd,IACA,UACqB;AACrB,QAAM,QAAQ,oBAAI,IAA2B;AAE7C,QAAM,WAAW,YAA4B,MAAoC;AAC/E,UAAM,MAAM,WAAW,SAAS,GAAG,IAAI,IAAI,OAAO,KAAK,CAAC,CAAC;AACzD,QAAI,MAAM,IAAI,GAAG,GAAG;AAClB,aAAO,MAAM,IAAI,GAAG;AAAA,IACtB;AACA,UAAM,SAAS,GAAG,MAAM,MAAM,IAAI;AAClC,UAAM,IAAI,KAAK,MAAM;AACrB,WAAO;AAAA,EACT;AAEA,WAAS,QAAQ;AAEjB,SAAO;AACT;AASO,SAAS,MACd,IACA,SACY;AACZ,QAAM;AAAA,IACJ,WAAW;AAAA,IACX,YAAY;AAAA,IACZ,WAAW;AAAA,IACX,cAAc,MAAM;AAAA,EACtB,IAAI,WAAW,CAAC;AAEhB,MAAI,UAAU;AAEd,QAAM,UAAU,MAAkB;AAChC;AACA,WAAO,GAAG,EAAE,MAAM,CAAC,UAAmB;AACpC,UAAI,WAAW,YAAY,CAAC,YAAY,KAAK,GAAG;AAC9C,cAAM;AAAA,MACR;AAEA,YAAM,QAAQ,KAAK;AAAA,QACjB,YAAY,KAAK,IAAI,GAAG,UAAU,CAAC,IAAI,KAAK,OAAO,IAAI;AAAA,QACvD;AAAA,MACF;AAEA,aAAO,IAAI,QAAW,aAAW;AAC/B,mBAAW,MAAM;AACf,kBAAQ,QAAQ,CAAC;AAAA,QACnB,GAAG,KAAK;AAAA,MACV,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAEA,SAAO,QAAQ;AACjB;AAKO,SAAS,OAAa;AAC3B,SAAO;AACT;AAQO,SAAS,SAAY,OAAa;AACvC,SAAO;AACT;AASO,SAAS,KACd,IAC2C;AAC3C,MAAI,SAAS;AACb,MAAI;AAEJ,SAAO,YAA4B,MAAoC;AACrE,QAAI,CAAC,QAAQ;AACX,eAAS;AACT,eAAS,GAAG,MAAM,MAAM,IAAI;AAAA,IAC9B;AACA,WAAO;AAAA,EACT;AACF;","names":[]}
+{"version":3,"sources":["../../src/core/index.ts"],"sourcesContent":["export interface DebounceOptions {\r\n  leading?: boolean\r\n  trailing?: boolean\r\n  maxWait?: number\r\n}\r\n\r\nexport interface DebouncedFunction<T extends (...args: unknown[]) => unknown> {\r\n  (...args: Parameters<T>): void\r\n  cancel(): void\r\n  flush(): void\r\n}\r\n\r\nexport interface MemoizedFunction<T extends (...args: unknown[]) => unknown> {\r\n  (...args: Parameters<T>): ReturnType<T>\r\n  cache: Map<string, ReturnType<T>>\r\n}\r\n\r\nexport interface RetryOptions {\r\n  attempts?: number\r\n  baseDelay?: number\r\n  maxDelay?: number\r\n  shouldRetry?: (error: unknown) => boolean\r\n}\r\n\r\nfunction isPlainObject(value: unknown): value is Record<string, unknown> {\r\n  if (value === null || typeof value !== 'object') return false\r\n  const proto = Object.getPrototypeOf(value)\r\n  return proto === Object.prototype || proto === null\r\n}\r\n\r\nfunction getType(value: unknown): string {\r\n  return Object.prototype.toString.call(value)\r\n}\r\n\r\nfunction clone<T>(value: T, seen: WeakMap<object, unknown>): T {\r\n  if (value === null || typeof value !== 'object') return value\r\n\r\n  if (seen.has(value as object)) return seen.get(value as object) as T\r\n\r\n  const tag = getType(value)\r\n\r\n  if (tag === '[object Date]') {\r\n    const cloned = new Date((value as unknown as Date).getTime())\r\n    seen.set(value as object, cloned)\r\n    return cloned as unknown as T\r\n  }\r\n\r\n  if (tag === '[object RegExp]') {\r\n    const regExp = value as unknown as RegExp\r\n    const cloned = new RegExp(regExp.source, regExp.flags)\r\n    cloned.lastIndex = regExp.lastIndex\r\n    seen.set(value as object, cloned)\r\n    return cloned as unknown as T\r\n  }\r\n\r\n  if (tag === '[object Map]') {\r\n    const cloned = new Map<unknown, unknown>()\r\n    seen.set(value as object, cloned)\r\n    ;(value as unknown as Map<unknown, unknown>).forEach((v, k) => {\r\n      cloned.set(clone(k, seen), clone(v, seen))\r\n    })\r\n    return cloned as unknown as T\r\n  }\r\n\r\n  if (tag === '[object Set]') {\r\n    const cloned = new Set<unknown>()\r\n    seen.set(value as object, cloned)\r\n    ;(value as unknown as Set<unknown>).forEach(v => {\r\n      cloned.add(clone(v, seen))\r\n    })\r\n    return cloned as unknown as T\r\n  }\r\n\r\n  if (Array.isArray(value)) {\r\n    const cloned: unknown[] = []\r\n    seen.set(value as object, cloned)\r\n    for (let i = 0; i < value.length; i++) {\r\n      cloned[i] = clone(value[i], seen)\r\n    }\r\n    return cloned as unknown as T\r\n  }\r\n\r\n  if (tag === '[object Object]') {\r\n    const cloned: Record<string, unknown> = {}\r\n    seen.set(value as object, cloned)\r\n    const keys = Object.keys(value as Record<string, unknown>)\r\n    for (let i = 0; i < keys.length; i++) {\r\n      const key = keys[i]!\r\n      cloned[key] = clone((value as Record<string, unknown>)[key], seen)\r\n    }\r\n    return cloned as unknown as T\r\n  }\r\n\r\n  return value\r\n}\r\n\r\n/**\r\n * Deep clone a value, supporting objects, arrays, Date, RegExp, Map, Set,\r\n * and cyclic references.\r\n *\r\n * @param value - The value to clone.\r\n * @returns A deep copy of the input value.\r\n */\r\nexport function deepClone<T>(value: T): T {\r\n  const seen = new WeakMap<object, unknown>()\r\n  return clone(value, seen)\r\n}\r\n\r\n/**\r\n * Deep merge multiple objects. Arrays are overwritten, not concatenated.\r\n * `null` and `undefined` source objects are skipped.\r\n *\r\n * @param objects - The objects to merge.\r\n * @returns A new object with merged properties.\r\n */\r\nexport function deepMerge<T extends Record<string, unknown>>(...objects: Partial<T>[]): T {\r\n  const result = {} as T\r\n\r\n  for (let i = 0; i < objects.length; i++) {\r\n    const obj = objects[i]\r\n    if (obj === null || obj === undefined) continue\r\n\r\n    const keys = Object.keys(obj) as (keyof T)[]\r\n    for (let j = 0; j < keys.length; j++) {\r\n      const key = keys[j]!\r\n      const val = obj[key]\r\n      const existing = result[key]\r\n\r\n      if (val !== undefined && isPlainObject(val) && isPlainObject(existing)) {\r\n        result[key] = deepMerge(\r\n          existing as Record<string, unknown>,\r\n          val as Record<string, unknown>\r\n        ) as T[keyof T]\r\n      } else if (val !== undefined) {\r\n        result[key] = val as T[keyof T]\r\n      }\r\n    }\r\n  }\r\n\r\n  return result\r\n}\r\n\r\n/**\r\n * Creates a debounced function that delays invoking `fn` until after `wait`\r\n * milliseconds have elapsed since the last invocation. Supports leading,\r\n * trailing, and maxWait options. The returned function also has `.cancel()`\r\n * and `.flush()` methods.\r\n *\r\n * @param fn - The function to debounce.\r\n * @param wait - The number of milliseconds to delay.\r\n * @param options - Optional configuration.\r\n * @returns A debounced function with `.cancel()` and `.flush()`.\r\n */\r\nexport function debounce<T extends (...args: unknown[]) => unknown>(\r\n  fn: T,\r\n  wait: number,\r\n  options?: DebounceOptions\r\n): DebouncedFunction<T> {\r\n  const { leading = false, trailing = true, maxWait } = options ?? {}\r\n\r\n  let timer: ReturnType<typeof setTimeout> | null = null\r\n  let maxTimer: ReturnType<typeof setTimeout> | null = null\r\n  let lastArgs: Parameters<T> | null = null\r\n  let lastCallTime: number | null = null\r\n  let lastInvokeTime = 0\r\n\r\n  function invoke(time: number): void {\r\n    lastInvokeTime = time\r\n    if (lastArgs) {\r\n      fn(...lastArgs)\r\n      lastArgs = null\r\n    }\r\n  }\r\n\r\n  function startTimer(waitTime: number): void {\r\n    if (timer) clearTimeout(timer)\r\n    timer = setTimeout(() => {\r\n      const now = Date.now()\r\n      if (lastArgs && trailing) {\r\n        invoke(now)\r\n      }\r\n      timer = null\r\n      lastCallTime = null\r\n    }, waitTime)\r\n  }\r\n\r\n  function startMaxTimer(): void {\r\n    if (maxWait === undefined || maxTimer) return\r\n    maxTimer = setTimeout(() => {\r\n      if (lastArgs) {\r\n        invoke(Date.now())\r\n        if (timer) {\r\n          clearTimeout(timer)\r\n          timer = null\r\n        }\r\n        lastCallTime = null\r\n      }\r\n    }, maxWait)\r\n  }\r\n\r\n  function clearAllTimers(): void {\r\n    if (timer) {\r\n      clearTimeout(timer)\r\n      timer = null\r\n    }\r\n    if (maxTimer) {\r\n      clearTimeout(maxTimer)\r\n      maxTimer = null\r\n    }\r\n  }\r\n\r\n  function shouldInvoke(time: number): boolean {\r\n    if (lastCallTime === null) return true\r\n    const timeSinceLastCall = time - lastCallTime\r\n    const timeSinceLastInvoke = time - lastInvokeTime\r\n    return (\r\n      timeSinceLastCall >= wait ||\r\n      (maxWait !== undefined && timeSinceLastInvoke >= maxWait)\r\n    )\r\n  }\r\n\r\n  const debounced = function (this: unknown, ...args: Parameters<T>): void {\r\n    const time = Date.now()\r\n    const isInvoking = shouldInvoke(time)\r\n\r\n    lastArgs = args\r\n    lastCallTime = time\r\n\r\n    if (isInvoking && !timer && leading) {\r\n      invoke(time)\r\n    }\r\n\r\n    if (!timer) {\r\n      startTimer(wait)\r\n      if (maxWait !== undefined) {\r\n        startMaxTimer()\r\n      }\r\n    }\r\n  } as DebouncedFunction<T>\r\n\r\n  debounced.cancel = (): void => {\r\n    clearAllTimers()\r\n    lastArgs = null\r\n    lastCallTime = null\r\n    lastInvokeTime = 0\r\n  }\r\n\r\n  debounced.flush = (): void => {\r\n    if (timer && lastArgs) {\r\n      invoke(Date.now())\r\n      clearAllTimers()\r\n      lastCallTime = null\r\n    }\r\n  }\r\n\r\n  return debounced\r\n}\r\n\r\n/**\r\n * Creates a throttled function that only invokes `fn` at most once per\r\n * `wait` milliseconds.\r\n *\r\n * @param fn - The function to throttle.\r\n * @param wait - The number of milliseconds to throttle invocations to.\r\n * @returns A throttled function.\r\n */\r\nexport function throttle<T extends (...args: unknown[]) => unknown>(\r\n  fn: T,\r\n  wait: number\r\n): (...args: Parameters<T>) => void {\r\n  let lastTime = 0\r\n  let timer: ReturnType<typeof setTimeout> | null = null\r\n  let lastArgs: Parameters<T> | null = null\r\n\r\n  const throttled = function (this: unknown, ...args: Parameters<T>): void {\r\n    const now = Date.now()\r\n    const remaining = wait - (now - lastTime)\r\n\r\n    if (remaining <= 0) {\r\n      if (timer) {\r\n        clearTimeout(timer)\r\n        timer = null\r\n      }\r\n      lastTime = now\r\n      lastArgs = null\r\n      fn.apply(this, args)\r\n    } else {\r\n      lastArgs = args\r\n      if (!timer) {\r\n        timer = setTimeout(() => {\r\n          lastTime = Date.now()\r\n          timer = null\r\n          if (lastArgs) {\r\n            fn.apply(this, lastArgs)\r\n            lastArgs = null\r\n          }\r\n        }, remaining)\r\n      }\r\n    }\r\n  }\r\n\r\n  return throttled\r\n}\r\n\r\n/**\r\n * Creates a memoized version of `fn`. Uses a `Map` cache keyed by the\r\n * first argument by default, or by a custom `resolver` function.\r\n *\r\n * @param fn - The function to memoize.\r\n * @param resolver - Optional function to determine the cache key.\r\n * @returns The memoized function with a `.cache` property.\r\n */\r\nexport function memoize<T extends (...args: unknown[]) => unknown>(\r\n  fn: T,\r\n  resolver?: (...args: Parameters<T>) => string\r\n): MemoizedFunction<T> {\r\n  const cache = new Map<string, ReturnType<T>>()\r\n\r\n  const memoized = function (this: unknown, ...args: Parameters<T>): ReturnType<T> {\r\n    const key = resolver ? resolver(...args) : String(args[0])\r\n    if (cache.has(key)) {\r\n      return cache.get(key) as ReturnType<T>\r\n    }\r\n    const result = fn.apply(this, args) as ReturnType<T>\r\n    cache.set(key, result)\r\n    return result\r\n  }\r\n\r\n  memoized.cache = cache\r\n\r\n  return memoized as MemoizedFunction<T>\r\n}\r\n\r\n/**\r\n * Retries an async function with exponential backoff and jitter.\r\n *\r\n * @param fn - The async function to retry.\r\n * @param options - Retry configuration.\r\n * @returns A promise that resolves with the function result.\r\n */\r\nexport function retry<T>(\r\n  fn: () => Promise<T>,\r\n  options?: RetryOptions\r\n): Promise<T> {\r\n  const {\r\n    attempts = 3,\r\n    baseDelay = 1000,\r\n    maxDelay = 30000,\r\n    shouldRetry = () => true,\r\n  } = options ?? {}\r\n\r\n  let attempt = 0\r\n\r\n  const execute = (): Promise<T> => {\r\n    attempt++\r\n    return fn().catch((error: unknown) => {\r\n      if (attempt >= attempts || !shouldRetry(error)) {\r\n        throw error\r\n      }\r\n\r\n      const delay = Math.min(\r\n        baseDelay * Math.pow(2, attempt - 1) + Math.random() * baseDelay,\r\n        maxDelay\r\n      )\r\n\r\n      return new Promise<T>(resolve => {\r\n        setTimeout(() => {\r\n          resolve(execute())\r\n        }, delay)\r\n      })\r\n    })\r\n  }\r\n\r\n  return execute()\r\n}\r\n\r\n/**\r\n * A no-operation function that returns `undefined`.\r\n */\r\nexport function noop(): void {\r\n  return undefined\r\n}\r\n\r\n/**\r\n * Returns the given value unchanged.\r\n *\r\n * @param value - The value to return.\r\n * @returns The same value.\r\n */\r\nexport function identity<T>(value: T): T {\r\n  return value\r\n}\r\n\r\n/**\r\n * Creates a function that invokes `fn` only once. Subsequent calls return\r\n * the result of the first invocation.\r\n *\r\n * @param fn - The function to wrap.\r\n * @returns A function that runs only once.\r\n */\r\nexport function once<T extends (...args: unknown[]) => unknown>(\r\n  fn: T\r\n): (...args: Parameters<T>) => ReturnType<T> {\r\n  let called = false\r\n  let result: ReturnType<T>\r\n\r\n  return function (this: unknown, ...args: Parameters<T>): ReturnType<T> {\r\n    if (!called) {\r\n      called = true\r\n      result = fn.apply(this, args) as ReturnType<T>\r\n    }\r\n    return result\r\n  }\r\n}\r\n"],"mappings":";AAwBA,SAAS,cAAc,OAAkD;AACvE,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO;AACxD,QAAM,QAAQ,OAAO,eAAe,KAAK;AACzC,SAAO,UAAU,OAAO,aAAa,UAAU;AACjD;AAEA,SAAS,QAAQ,OAAwB;AACvC,SAAO,OAAO,UAAU,SAAS,KAAK,KAAK;AAC7C;AAEA,SAAS,MAAS,OAAU,MAAmC;AAC7D,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO;AAExD,MAAI,KAAK,IAAI,KAAe,EAAG,QAAO,KAAK,IAAI,KAAe;AAE9D,QAAM,MAAM,QAAQ,KAAK;AAEzB,MAAI,QAAQ,iBAAiB;AAC3B,UAAM,SAAS,IAAI,KAAM,MAA0B,QAAQ,CAAC;AAC5D,SAAK,IAAI,OAAiB,MAAM;AAChC,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,mBAAmB;AAC7B,UAAM,SAAS;AACf,UAAM,SAAS,IAAI,OAAO,OAAO,QAAQ,OAAO,KAAK;AACrD,WAAO,YAAY,OAAO;AAC1B,SAAK,IAAI,OAAiB,MAAM;AAChC,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,gBAAgB;AAC1B,UAAM,SAAS,oBAAI,IAAsB;AACzC,SAAK,IAAI,OAAiB,MAAM;AAC/B,IAAC,MAA2C,QAAQ,CAAC,GAAG,MAAM;AAC7D,aAAO,IAAI,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC;AAAA,IAC3C,CAAC;AACD,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,gBAAgB;AAC1B,UAAM,SAAS,oBAAI,IAAa;AAChC,SAAK,IAAI,OAAiB,MAAM;AAC/B,IAAC,MAAkC,QAAQ,OAAK;AAC/C,aAAO,IAAI,MAAM,GAAG,IAAI,CAAC;AAAA,IAC3B,CAAC;AACD,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAM,SAAoB,CAAC;AAC3B,SAAK,IAAI,OAAiB,MAAM;AAChC,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,aAAO,CAAC,IAAI,MAAM,MAAM,CAAC,GAAG,IAAI;AAAA,IAClC;AACA,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,mBAAmB;AAC7B,UAAM,SAAkC,CAAC;AACzC,SAAK,IAAI,OAAiB,MAAM;AAChC,UAAM,OAAO,OAAO,KAAK,KAAgC;AACzD,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,MAAM,KAAK,CAAC;AAClB,aAAO,GAAG,IAAI,MAAO,MAAkC,GAAG,GAAG,IAAI;AAAA,IACnE;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AASO,SAAS,UAAa,OAAa;AACxC,QAAM,OAAO,oBAAI,QAAyB;AAC1C,SAAO,MAAM,OAAO,IAAI;AAC1B;AASO,SAAS,aAAgD,SAA0B;AACxF,QAAM,SAAS,CAAC;AAEhB,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,UAAM,MAAM,QAAQ,CAAC;AACrB,QAAI,QAAQ,QAAQ,QAAQ,OAAW;AAEvC,UAAM,OAAO,OAAO,KAAK,GAAG;AAC5B,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,MAAM,KAAK,CAAC;AAClB,YAAM,MAAM,IAAI,GAAG;AACnB,YAAM,WAAW,OAAO,GAAG;AAE3B,UAAI,QAAQ,UAAa,cAAc,GAAG,KAAK,cAAc,QAAQ,GAAG;AACtE,eAAO,GAAG,IAAI;AAAA,UACZ;AAAA,UACA;AAAA,QACF;AAAA,MACF,WAAW,QAAQ,QAAW;AAC5B,eAAO,GAAG,IAAI;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAaO,SAAS,SACd,IACA,MACA,SACsB;AACtB,QAAM,EAAE,UAAU,OAAO,WAAW,MAAM,QAAQ,IAAI,WAAW,CAAC;AAElE,MAAI,QAA8C;AAClD,MAAI,WAAiD;AACrD,MAAI,WAAiC;AACrC,MAAI,eAA8B;AAClC,MAAI,iBAAiB;AAErB,WAAS,OAAO,MAAoB;AAClC,qBAAiB;AACjB,QAAI,UAAU;AACZ,SAAG,GAAG,QAAQ;AACd,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,WAAS,WAAW,UAAwB;AAC1C,QAAI,MAAO,cAAa,KAAK;AAC7B,YAAQ,WAAW,MAAM;AACvB,YAAM,MAAM,KAAK,IAAI;AACrB,UAAI,YAAY,UAAU;AACxB,eAAO,GAAG;AAAA,MACZ;AACA,cAAQ;AACR,qBAAe;AAAA,IACjB,GAAG,QAAQ;AAAA,EACb;AAEA,WAAS,gBAAsB;AAC7B,QAAI,YAAY,UAAa,SAAU;AACvC,eAAW,WAAW,MAAM;AAC1B,UAAI,UAAU;AACZ,eAAO,KAAK,IAAI,CAAC;AACjB,YAAI,OAAO;AACT,uBAAa,KAAK;AAClB,kBAAQ;AAAA,QACV;AACA,uBAAe;AAAA,MACjB;AAAA,IACF,GAAG,OAAO;AAAA,EACZ;AAEA,WAAS,iBAAuB;AAC9B,QAAI,OAAO;AACT,mBAAa,KAAK;AAClB,cAAQ;AAAA,IACV;AACA,QAAI,UAAU;AACZ,mBAAa,QAAQ;AACrB,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,WAAS,aAAa,MAAuB;AAC3C,QAAI,iBAAiB,KAAM,QAAO;AAClC,UAAM,oBAAoB,OAAO;AACjC,UAAM,sBAAsB,OAAO;AACnC,WACE,qBAAqB,QACpB,YAAY,UAAa,uBAAuB;AAAA,EAErD;AAEA,QAAM,YAAY,YAA4B,MAA2B;AACvE,UAAM,OAAO,KAAK,IAAI;AACtB,UAAM,aAAa,aAAa,IAAI;AAEpC,eAAW;AACX,mBAAe;AAEf,QAAI,cAAc,CAAC,SAAS,SAAS;AACnC,aAAO,IAAI;AAAA,IACb;AAEA,QAAI,CAAC,OAAO;AACV,iBAAW,IAAI;AACf,UAAI,YAAY,QAAW;AACzB,sBAAc;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAEA,YAAU,SAAS,MAAY;AAC7B,mBAAe;AACf,eAAW;AACX,mBAAe;AACf,qBAAiB;AAAA,EACnB;AAEA,YAAU,QAAQ,MAAY;AAC5B,QAAI,SAAS,UAAU;AACrB,aAAO,KAAK,IAAI,CAAC;AACjB,qBAAe;AACf,qBAAe;AAAA,IACjB;AAAA,EACF;AAEA,SAAO;AACT;AAUO,SAAS,SACd,IACA,MACkC;AAClC,MAAI,WAAW;AACf,MAAI,QAA8C;AAClD,MAAI,WAAiC;AAErC,QAAM,YAAY,YAA4B,MAA2B;AACvE,UAAM,MAAM,KAAK,IAAI;AACrB,UAAM,YAAY,QAAQ,MAAM;AAEhC,QAAI,aAAa,GAAG;AAClB,UAAI,OAAO;AACT,qBAAa,KAAK;AAClB,gBAAQ;AAAA,MACV;AACA,iBAAW;AACX,iBAAW;AACX,SAAG,MAAM,MAAM,IAAI;AAAA,IACrB,OAAO;AACL,iBAAW;AACX,UAAI,CAAC,OAAO;AACV,gBAAQ,WAAW,MAAM;AACvB,qBAAW,KAAK,IAAI;AACpB,kBAAQ;AACR,cAAI,UAAU;AACZ,eAAG,MAAM,MAAM,QAAQ;AACvB,uBAAW;AAAA,UACb;AAAA,QACF,GAAG,SAAS;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAUO,SAAS,QACd,IACA,UACqB;AACrB,QAAM,QAAQ,oBAAI,IAA2B;AAE7C,QAAM,WAAW,YAA4B,MAAoC;AAC/E,UAAM,MAAM,WAAW,SAAS,GAAG,IAAI,IAAI,OAAO,KAAK,CAAC,CAAC;AACzD,QAAI,MAAM,IAAI,GAAG,GAAG;AAClB,aAAO,MAAM,IAAI,GAAG;AAAA,IACtB;AACA,UAAM,SAAS,GAAG,MAAM,MAAM,IAAI;AAClC,UAAM,IAAI,KAAK,MAAM;AACrB,WAAO;AAAA,EACT;AAEA,WAAS,QAAQ;AAEjB,SAAO;AACT;AASO,SAAS,MACd,IACA,SACY;AACZ,QAAM;AAAA,IACJ,WAAW;AAAA,IACX,YAAY;AAAA,IACZ,WAAW;AAAA,IACX,cAAc,MAAM;AAAA,EACtB,IAAI,WAAW,CAAC;AAEhB,MAAI,UAAU;AAEd,QAAM,UAAU,MAAkB;AAChC;AACA,WAAO,GAAG,EAAE,MAAM,CAAC,UAAmB;AACpC,UAAI,WAAW,YAAY,CAAC,YAAY,KAAK,GAAG;AAC9C,cAAM;AAAA,MACR;AAEA,YAAM,QAAQ,KAAK;AAAA,QACjB,YAAY,KAAK,IAAI,GAAG,UAAU,CAAC,IAAI,KAAK,OAAO,IAAI;AAAA,QACvD;AAAA,MACF;AAEA,aAAO,IAAI,QAAW,aAAW;AAC/B,mBAAW,MAAM;AACf,kBAAQ,QAAQ,CAAC;AAAA,QACnB,GAAG,KAAK;AAAA,MACV,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAEA,SAAO,QAAQ;AACjB;AAKO,SAAS,OAAa;AAC3B,SAAO;AACT;AAQO,SAAS,SAAY,OAAa;AACvC,SAAO;AACT;AASO,SAAS,KACd,IAC2C;AAC3C,MAAI,SAAS;AACb,MAAI;AAEJ,SAAO,YAA4B,MAAoC;AACrE,QAAI,CAAC,QAAQ;AACX,eAAS;AACT,eAAS,GAAG,MAAM,MAAM,IAAI;AAAA,IAC9B;AACA,WAAO;AAAA,EACT;AACF;","names":[]}

package/dist/crypto/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/crypto/index.ts"],"sourcesContent":["/**\n * Simple hash function using the djb2 algorithm.\n * Fast, non-cryptographic — suitable for hashtables, not security.\n *\n * @param str - The string to hash.\n * @returns A 32-bit integer hash.\n */\nexport function hash(str: string): number {\n  let h = 5381\n  for (let i = 0; i < str.length; i++) {\n    h = ((h << 5) + h + str.charCodeAt(i)) | 0\n  }\n  return h >>> 0\n}\n\n/**\n * Produces a deterministic hex hash from a string.\n * NOT actual MD5 — use for cache keys / deterministic IDs.\n *\n * @param str - The string to hash.\n * @returns A 32-character hex string.\n */\nexport function simpleHash(str: string): string {\n  let h1 = 0x67452301\n  let h2 = 0xefcdab89\n  let h3 = 0x98badcfe\n  let h4 = 0x10325476\n\n  for (let i = 0; i < str.length; i++) {\n    const c = str.charCodeAt(i)\n    h1 = (h1 + c) | 0\n    h2 = (h2 + (c << 3) + i) | 0\n    h3 = (h3 ^ c) | 0\n    h4 = (h4 + (c << 5) + (c << 1)) | 0\n  }\n\n  const toHex = (n: number): string => (n >>> 0).toString(16).padStart(8, '0')\n  return toHex(h1) + toHex(h2) + toHex(h3) + toHex(h4)\n}\n\nfunction getRandomBytes(size: number): Uint8Array {\n  const bytes = new Uint8Array(size)\n  if (typeof crypto !== 'undefined' && typeof crypto.getRandomValues === 'function') {\n    crypto.getRandomValues(bytes)\n  } else {\n    for (let i = 0; i < size; i++) {\n      bytes[i] = Math.floor(Math.random() * 256)\n    }\n  }\n  return bytes\n}\n\n/**\n * Generates random bytes as a hex string.\n *\n * @param size - Number of random bytes (default 16).\n * @returns A hex string of length `size * 2`.\n */\nexport function randomHex(size: number = 16): string {\n  const bytes = getRandomBytes(size)\n  let result = ''\n  for (let i = 0; i < bytes.length; i++) {\n    result += bytes[i]!.toString(16).padStart(2, '0')\n  }\n  return result\n}\n\nfunction utf8ToBytes(str: string): Uint8Array {\n  if (typeof TextEncoder !== 'undefined') {\n    return new TextEncoder().encode(str)\n  }\n  const bytes = new Uint8Array(str.length)\n  for (let i = 0; i < str.length; i++) {\n    bytes[i] = str.charCodeAt(i)\n  }\n  return bytes\n}\n\nfunction bytesToUtf8(bytes: Uint8Array): string {\n  if (typeof TextDecoder !== 'undefined') {\n    return new TextDecoder().decode(bytes)\n  }\n  let result = ''\n  for (let i = 0; i < bytes.length; i++) {\n    result += String.fromCharCode(bytes[i]!)\n  }\n  return result\n}\n\nfunction bytesToBase64(bytes: Uint8Array): string {\n  let binary = ''\n  for (let i = 0; i < bytes.length; i++) {\n    binary += String.fromCharCode(bytes[i]!)\n  }\n  if (typeof btoa === 'function') {\n    return btoa(binary)\n  }\n  return Buffer.from(binary, 'latin1').toString('base64')\n}\n\nfunction base64ToBytes(str: string): Uint8Array {\n  let binary: string\n  if (typeof atob === 'function') {\n    binary = atob(str)\n  } else {\n    binary = Buffer.from(str, 'base64').toString('latin1')\n  }\n  const bytes = new Uint8Array(binary.length)\n  for (let i = 0; i < binary.length; i++) {\n    bytes[i] = binary.charCodeAt(i)\n  }\n  return bytes\n}\n\n/**\n * Encodes a string to base64. Works in both Node.js and browser.\n * Handles UTF-8 characters correctly.\n *\n * @param str - The string to encode.\n * @returns The base64-encoded string.\n */\nexport function base64Encode(str: string): string {\n  const bytes = utf8ToBytes(str)\n  return bytesToBase64(bytes)\n}\n\n/**\n * Decodes a base64-encoded string. Works in both Node.js and browser.\n *\n * @param str - The base64 string to decode.\n * @returns The decoded string.\n */\nexport function base64Decode(str: string): string {\n  const bytes = base64ToBytes(str)\n  return bytesToUtf8(bytes)\n}\n\n/**\n * Generates a cryptographically random token string.\n *\n * @param bytes - Number of random bytes (default 32 → 64-char hex).\n * @returns A hex string suitable for API keys, reset tokens, etc.\n */\nexport function generateToken(bytes: number = 32): string {\n  return randomHex(bytes)\n}\n\n/**\n * Generates a numeric OTP of the given length.\n *\n * @param length - Number of digits (default 6).\n * @returns A numeric string of the specified length.\n */\nexport function generateOTP(length: number = 6): string {\n  const bytes = getRandomBytes(length)\n  let otp = ''\n  for (let i = 0; i < length; i++) {\n    otp += (bytes[i]! % 10).toString()\n  }\n  return otp\n}\n\n/**\n * Simple XOR cipher — symmetrical, for light obfuscation only.\n * NOT real encryption.\n *\n * @param str - The input string.\n * @param key - The cipher key.\n * @returns The XOR-transformed string.\n */\nexport function xorCipher(str: string, key: string): string {\n  let result = ''\n  for (let i = 0; i < str.length; i++) {\n    const code = str.charCodeAt(i) ^ key.charCodeAt(i % key.length)\n    result += String.fromCharCode(code)\n  }\n  return result\n}\n\n/**\n * Computes a simple checksum (CRC-like) for file integrity checks.\n *\n * @param input - The input string.\n * @returns An 8-character hex checksum.\n */\nexport function checksum(input: string): string {\n  let crc = 0xffffffff\n  for (let i = 0; i < input.length; i++) {\n    crc ^= input.charCodeAt(i)\n    for (let j = 0; j < 8; j++) {\n      if (crc & 1) {\n        crc = (crc >>> 1) ^ 0xedb88320\n      } else {\n        crc = crc >>> 1\n      }\n    }\n  }\n  return ((crc ^ 0xffffffff) >>> 0).toString(16).padStart(8, '0')\n}\n\n/**\n * Constant-time string comparison to prevent timing attacks.\n *\n * @param a - First string.\n * @param b - Second string.\n * @returns Whether the strings are equal.\n */\nexport function constantTimeEqual(a: string, b: string): boolean {\n  if (a.length !== b.length) return false\n  let result = 0\n  for (let i = 0; i < a.length; i++) {\n    result |= a.charCodeAt(i) ^ b.charCodeAt(i)\n  }\n  return result === 0\n}\n"],"mappings":";AAOO,SAAS,KAAK,KAAqB;AACxC,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,SAAM,KAAK,KAAK,IAAI,IAAI,WAAW,CAAC,IAAK;AAAA,EAC3C;AACA,SAAO,MAAM;AACf;AASO,SAAS,WAAW,KAAqB;AAC9C,MAAI,KAAK;AACT,MAAI,KAAK;AACT,MAAI,KAAK;AACT,MAAI,KAAK;AAET,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,IAAI,IAAI,WAAW,CAAC;AAC1B,SAAM,KAAK,IAAK;AAChB,SAAM,MAAM,KAAK,KAAK,IAAK;AAC3B,SAAM,KAAK,IAAK;AAChB,SAAM,MAAM,KAAK,MAAM,KAAK,KAAM;AAAA,EACpC;AAEA,QAAM,QAAQ,CAAC,OAAuB,MAAM,GAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAC3E,SAAO,MAAM,EAAE,IAAI,MAAM,EAAE,IAAI,MAAM,EAAE,IAAI,MAAM,EAAE;AACrD;AAEA,SAAS,eAAe,MAA0B;AAChD,QAAM,QAAQ,IAAI,WAAW,IAAI;AACjC,MAAI,OAAO,WAAW,eAAe,OAAO,OAAO,oBAAoB,YAAY;AACjF,WAAO,gBAAgB,KAAK;AAAA,EAC9B,OAAO;AACL,aAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,YAAM,CAAC,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG;AAAA,IAC3C;AAAA,EACF;AACA,SAAO;AACT;AAQO,SAAS,UAAU,OAAe,IAAY;AACnD,QAAM,QAAQ,eAAe,IAAI;AACjC,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,cAAU,MAAM,CAAC,EAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAAA,EAClD;AACA,SAAO;AACT;AAEA,SAAS,YAAY,KAAyB;AAC5C,MAAI,OAAO,gBAAgB,aAAa;AACtC,WAAO,IAAI,YAAY,EAAE,OAAO,GAAG;AAAA,EACrC;AACA,QAAM,QAAQ,IAAI,WAAW,IAAI,MAAM;AACvC,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,CAAC,IAAI,IAAI,WAAW,CAAC;AAAA,EAC7B;AACA,SAAO;AACT;AAEA,SAAS,YAAY,OAA2B;AAC9C,MAAI,OAAO,gBAAgB,aAAa;AACtC,WAAO,IAAI,YAAY,EAAE,OAAO,KAAK;AAAA,EACvC;AACA,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,cAAU,OAAO,aAAa,MAAM,CAAC,CAAE;AAAA,EACzC;AACA,SAAO;AACT;AAEA,SAAS,cAAc,OAA2B;AAChD,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,cAAU,OAAO,aAAa,MAAM,CAAC,CAAE;AAAA,EACzC;AACA,MAAI,OAAO,SAAS,YAAY;AAC9B,WAAO,KAAK,MAAM;AAAA,EACpB;AACA,SAAO,OAAO,KAAK,QAAQ,QAAQ,EAAE,SAAS,QAAQ;AACxD;AAEA,SAAS,cAAc,KAAyB;AAC9C,MAAI;AACJ,MAAI,OAAO,SAAS,YAAY;AAC9B,aAAS,KAAK,GAAG;AAAA,EACnB,OAAO;AACL,aAAS,OAAO,KAAK,KAAK,QAAQ,EAAE,SAAS,QAAQ;AAAA,EACvD;AACA,QAAM,QAAQ,IAAI,WAAW,OAAO,MAAM;AAC1C,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,CAAC,IAAI,OAAO,WAAW,CAAC;AAAA,EAChC;AACA,SAAO;AACT;AASO,SAAS,aAAa,KAAqB;AAChD,QAAM,QAAQ,YAAY,GAAG;AAC7B,SAAO,cAAc,KAAK;AAC5B;AAQO,SAAS,aAAa,KAAqB;AAChD,QAAM,QAAQ,cAAc,GAAG;AAC/B,SAAO,YAAY,KAAK;AAC1B;AAQO,SAAS,cAAc,QAAgB,IAAY;AACxD,SAAO,UAAU,KAAK;AACxB;AAQO,SAAS,YAAY,SAAiB,GAAW;AACtD,QAAM,QAAQ,eAAe,MAAM;AACnC,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,YAAQ,MAAM,CAAC,IAAK,IAAI,SAAS;AAAA,EACnC;AACA,SAAO;AACT;AAUO,SAAS,UAAU,KAAa,KAAqB;AAC1D,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,OAAO,IAAI,WAAW,CAAC,IAAI,IAAI,WAAW,IAAI,IAAI,MAAM;AAC9D,cAAU,OAAO,aAAa,IAAI;AAAA,EACpC;AACA,SAAO;AACT;AAQO,SAAS,SAAS,OAAuB;AAC9C,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,WAAO,MAAM,WAAW,CAAC;AACzB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,MAAM,GAAG;AACX,cAAO,QAAQ,IAAK;AAAA,MACtB,OAAO;AACL,cAAM,QAAQ;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AACA,WAAS,MAAM,gBAAgB,GAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAChE;AASO,SAAS,kBAAkB,GAAW,GAAoB;AAC/D,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,cAAU,EAAE,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC;AAAA,EAC5C;AACA,SAAO,WAAW;AACpB;","names":[]}
+{"version":3,"sources":["../../src/crypto/index.ts"],"sourcesContent":["/**\r\n * Simple hash function using the djb2 algorithm.\r\n * Fast, non-cryptographic — suitable for hashtables, not security.\r\n *\r\n * @param str - The string to hash.\r\n * @returns A 32-bit integer hash.\r\n */\r\nexport function hash(str: string): number {\r\n  let h = 5381\r\n  for (let i = 0; i < str.length; i++) {\r\n    h = ((h << 5) + h + str.charCodeAt(i)) | 0\r\n  }\r\n  return h >>> 0\r\n}\r\n\r\n/**\r\n * Produces a deterministic hex hash from a string.\r\n * NOT actual MD5 — use for cache keys / deterministic IDs.\r\n *\r\n * @param str - The string to hash.\r\n * @returns A 32-character hex string.\r\n */\r\nexport function simpleHash(str: string): string {\r\n  let h1 = 0x67452301\r\n  let h2 = 0xefcdab89\r\n  let h3 = 0x98badcfe\r\n  let h4 = 0x10325476\r\n\r\n  for (let i = 0; i < str.length; i++) {\r\n    const c = str.charCodeAt(i)\r\n    h1 = (h1 + c) | 0\r\n    h2 = (h2 + (c << 3) + i) | 0\r\n    h3 = (h3 ^ c) | 0\r\n    h4 = (h4 + (c << 5) + (c << 1)) | 0\r\n  }\r\n\r\n  const toHex = (n: number): string => (n >>> 0).toString(16).padStart(8, '0')\r\n  return toHex(h1) + toHex(h2) + toHex(h3) + toHex(h4)\r\n}\r\n\r\nfunction getRandomBytes(size: number): Uint8Array {\r\n  const bytes = new Uint8Array(size)\r\n  if (typeof crypto !== 'undefined' && typeof crypto.getRandomValues === 'function') {\r\n    crypto.getRandomValues(bytes)\r\n  } else {\r\n    for (let i = 0; i < size; i++) {\r\n      bytes[i] = Math.floor(Math.random() * 256)\r\n    }\r\n  }\r\n  return bytes\r\n}\r\n\r\n/**\r\n * Generates random bytes as a hex string.\r\n *\r\n * @param size - Number of random bytes (default 16).\r\n * @returns A hex string of length `size * 2`.\r\n */\r\nexport function randomHex(size: number = 16): string {\r\n  const bytes = getRandomBytes(size)\r\n  let result = ''\r\n  for (let i = 0; i < bytes.length; i++) {\r\n    result += bytes[i]!.toString(16).padStart(2, '0')\r\n  }\r\n  return result\r\n}\r\n\r\nfunction utf8ToBytes(str: string): Uint8Array {\r\n  if (typeof TextEncoder !== 'undefined') {\r\n    return new TextEncoder().encode(str)\r\n  }\r\n  const bytes = new Uint8Array(str.length)\r\n  for (let i = 0; i < str.length; i++) {\r\n    bytes[i] = str.charCodeAt(i)\r\n  }\r\n  return bytes\r\n}\r\n\r\nfunction bytesToUtf8(bytes: Uint8Array): string {\r\n  if (typeof TextDecoder !== 'undefined') {\r\n    return new TextDecoder().decode(bytes)\r\n  }\r\n  let result = ''\r\n  for (let i = 0; i < bytes.length; i++) {\r\n    result += String.fromCharCode(bytes[i]!)\r\n  }\r\n  return result\r\n}\r\n\r\nfunction bytesToBase64(bytes: Uint8Array): string {\r\n  let binary = ''\r\n  for (let i = 0; i < bytes.length; i++) {\r\n    binary += String.fromCharCode(bytes[i]!)\r\n  }\r\n  if (typeof btoa === 'function') {\r\n    return btoa(binary)\r\n  }\r\n  return Buffer.from(binary, 'latin1').toString('base64')\r\n}\r\n\r\nfunction base64ToBytes(str: string): Uint8Array {\r\n  let binary: string\r\n  if (typeof atob === 'function') {\r\n    binary = atob(str)\r\n  } else {\r\n    binary = Buffer.from(str, 'base64').toString('latin1')\r\n  }\r\n  const bytes = new Uint8Array(binary.length)\r\n  for (let i = 0; i < binary.length; i++) {\r\n    bytes[i] = binary.charCodeAt(i)\r\n  }\r\n  return bytes\r\n}\r\n\r\n/**\r\n * Encodes a string to base64. Works in both Node.js and browser.\r\n * Handles UTF-8 characters correctly.\r\n *\r\n * @param str - The string to encode.\r\n * @returns The base64-encoded string.\r\n */\r\nexport function base64Encode(str: string): string {\r\n  const bytes = utf8ToBytes(str)\r\n  return bytesToBase64(bytes)\r\n}\r\n\r\n/**\r\n * Decodes a base64-encoded string. Works in both Node.js and browser.\r\n *\r\n * @param str - The base64 string to decode.\r\n * @returns The decoded string.\r\n */\r\nexport function base64Decode(str: string): string {\r\n  const bytes = base64ToBytes(str)\r\n  return bytesToUtf8(bytes)\r\n}\r\n\r\n/**\r\n * Generates a cryptographically random token string.\r\n *\r\n * @param bytes - Number of random bytes (default 32 → 64-char hex).\r\n * @returns A hex string suitable for API keys, reset tokens, etc.\r\n */\r\nexport function generateToken(bytes: number = 32): string {\r\n  return randomHex(bytes)\r\n}\r\n\r\n/**\r\n * Generates a numeric OTP of the given length.\r\n *\r\n * @param length - Number of digits (default 6).\r\n * @returns A numeric string of the specified length.\r\n */\r\nexport function generateOTP(length: number = 6): string {\r\n  const bytes = getRandomBytes(length)\r\n  let otp = ''\r\n  for (let i = 0; i < length; i++) {\r\n    otp += (bytes[i]! % 10).toString()\r\n  }\r\n  return otp\r\n}\r\n\r\n/**\r\n * Simple XOR cipher — symmetrical, for light obfuscation only.\r\n * NOT real encryption.\r\n *\r\n * @param str - The input string.\r\n * @param key - The cipher key.\r\n * @returns The XOR-transformed string.\r\n */\r\nexport function xorCipher(str: string, key: string): string {\r\n  let result = ''\r\n  for (let i = 0; i < str.length; i++) {\r\n    const code = str.charCodeAt(i) ^ key.charCodeAt(i % key.length)\r\n    result += String.fromCharCode(code)\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Computes a simple checksum (CRC-like) for file integrity checks.\r\n *\r\n * @param input - The input string.\r\n * @returns An 8-character hex checksum.\r\n */\r\nexport function checksum(input: string): string {\r\n  let crc = 0xffffffff\r\n  for (let i = 0; i < input.length; i++) {\r\n    crc ^= input.charCodeAt(i)\r\n    for (let j = 0; j < 8; j++) {\r\n      if (crc & 1) {\r\n        crc = (crc >>> 1) ^ 0xedb88320\r\n      } else {\r\n        crc = crc >>> 1\r\n      }\r\n    }\r\n  }\r\n  return ((crc ^ 0xffffffff) >>> 0).toString(16).padStart(8, '0')\r\n}\r\n\r\n/**\r\n * Constant-time string comparison to prevent timing attacks.\r\n *\r\n * @param a - First string.\r\n * @param b - Second string.\r\n * @returns Whether the strings are equal.\r\n */\r\nexport function constantTimeEqual(a: string, b: string): boolean {\r\n  if (a.length !== b.length) return false\r\n  let result = 0\r\n  for (let i = 0; i < a.length; i++) {\r\n    result |= a.charCodeAt(i) ^ b.charCodeAt(i)\r\n  }\r\n  return result === 0\r\n}\r\n"],"mappings":";AAOO,SAAS,KAAK,KAAqB;AACxC,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,SAAM,KAAK,KAAK,IAAI,IAAI,WAAW,CAAC,IAAK;AAAA,EAC3C;AACA,SAAO,MAAM;AACf;AASO,SAAS,WAAW,KAAqB;AAC9C,MAAI,KAAK;AACT,MAAI,KAAK;AACT,MAAI,KAAK;AACT,MAAI,KAAK;AAET,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,IAAI,IAAI,WAAW,CAAC;AAC1B,SAAM,KAAK,IAAK;AAChB,SAAM,MAAM,KAAK,KAAK,IAAK;AAC3B,SAAM,KAAK,IAAK;AAChB,SAAM,MAAM,KAAK,MAAM,KAAK,KAAM;AAAA,EACpC;AAEA,QAAM,QAAQ,CAAC,OAAuB,MAAM,GAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAC3E,SAAO,MAAM,EAAE,IAAI,MAAM,EAAE,IAAI,MAAM,EAAE,IAAI,MAAM,EAAE;AACrD;AAEA,SAAS,eAAe,MAA0B;AAChD,QAAM,QAAQ,IAAI,WAAW,IAAI;AACjC,MAAI,OAAO,WAAW,eAAe,OAAO,OAAO,oBAAoB,YAAY;AACjF,WAAO,gBAAgB,KAAK;AAAA,EAC9B,OAAO;AACL,aAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,YAAM,CAAC,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG;AAAA,IAC3C;AAAA,EACF;AACA,SAAO;AACT;AAQO,SAAS,UAAU,OAAe,IAAY;AACnD,QAAM,QAAQ,eAAe,IAAI;AACjC,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,cAAU,MAAM,CAAC,EAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAAA,EAClD;AACA,SAAO;AACT;AAEA,SAAS,YAAY,KAAyB;AAC5C,MAAI,OAAO,gBAAgB,aAAa;AACtC,WAAO,IAAI,YAAY,EAAE,OAAO,GAAG;AAAA,EACrC;AACA,QAAM,QAAQ,IAAI,WAAW,IAAI,MAAM;AACvC,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,CAAC,IAAI,IAAI,WAAW,CAAC;AAAA,EAC7B;AACA,SAAO;AACT;AAEA,SAAS,YAAY,OAA2B;AAC9C,MAAI,OAAO,gBAAgB,aAAa;AACtC,WAAO,IAAI,YAAY,EAAE,OAAO,KAAK;AAAA,EACvC;AACA,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,cAAU,OAAO,aAAa,MAAM,CAAC,CAAE;AAAA,EACzC;AACA,SAAO;AACT;AAEA,SAAS,cAAc,OAA2B;AAChD,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,cAAU,OAAO,aAAa,MAAM,CAAC,CAAE;AAAA,EACzC;AACA,MAAI,OAAO,SAAS,YAAY;AAC9B,WAAO,KAAK,MAAM;AAAA,EACpB;AACA,SAAO,OAAO,KAAK,QAAQ,QAAQ,EAAE,SAAS,QAAQ;AACxD;AAEA,SAAS,cAAc,KAAyB;AAC9C,MAAI;AACJ,MAAI,OAAO,SAAS,YAAY;AAC9B,aAAS,KAAK,GAAG;AAAA,EACnB,OAAO;AACL,aAAS,OAAO,KAAK,KAAK,QAAQ,EAAE,SAAS,QAAQ;AAAA,EACvD;AACA,QAAM,QAAQ,IAAI,WAAW,OAAO,MAAM;AAC1C,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,CAAC,IAAI,OAAO,WAAW,CAAC;AAAA,EAChC;AACA,SAAO;AACT;AASO,SAAS,aAAa,KAAqB;AAChD,QAAM,QAAQ,YAAY,GAAG;AAC7B,SAAO,cAAc,KAAK;AAC5B;AAQO,SAAS,aAAa,KAAqB;AAChD,QAAM,QAAQ,cAAc,GAAG;AAC/B,SAAO,YAAY,KAAK;AAC1B;AAQO,SAAS,cAAc,QAAgB,IAAY;AACxD,SAAO,UAAU,KAAK;AACxB;AAQO,SAAS,YAAY,SAAiB,GAAW;AACtD,QAAM,QAAQ,eAAe,MAAM;AACnC,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,YAAQ,MAAM,CAAC,IAAK,IAAI,SAAS;AAAA,EACnC;AACA,SAAO;AACT;AAUO,SAAS,UAAU,KAAa,KAAqB;AAC1D,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,OAAO,IAAI,WAAW,CAAC,IAAI,IAAI,WAAW,IAAI,IAAI,MAAM;AAC9D,cAAU,OAAO,aAAa,IAAI;AAAA,EACpC;AACA,SAAO;AACT;AAQO,SAAS,SAAS,OAAuB;AAC9C,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,WAAO,MAAM,WAAW,CAAC;AACzB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,MAAM,GAAG;AACX,cAAO,QAAQ,IAAK;AAAA,MACtB,OAAO;AACL,cAAM,QAAQ;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AACA,WAAS,MAAM,gBAAgB,GAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAChE;AASO,SAAS,kBAAkB,GAAW,GAAoB;AAC/D,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,cAAU,EAAE,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC;AAAA,EAC5C;AACA,SAAO,WAAW;AACpB;","names":[]}

package/dist/date/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/date/index.ts"],"sourcesContent":["/**\n * Error thrown when a date value is invalid.\n */\nexport class InvalidDateError extends Error {\n  constructor(input: unknown) {\n    super(`Invalid date: ${String(input)}`)\n    this.name = 'InvalidDateError'\n  }\n}\n\nexport interface DateDiff {\n  years: number\n  months: number\n  days: number\n  hours: number\n  minutes: number\n  seconds: number\n}\n\nconst MONTH_NAMES_SHORT = [\n  'Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun',\n  'Jul', 'Aug', 'Sep', 'Oct', 'Nov', 'Dec',\n] as const\n\nconst MONTH_NAMES_FULL = [\n  'January', 'February', 'March', 'April', 'May', 'June',\n  'July', 'August', 'September', 'October', 'November', 'December',\n] as const\n\nconst MONTH_MAP: Record<string, number> = {\n  jan: 0, january: 0,\n  feb: 1, february: 1,\n  mar: 2, march: 2,\n  apr: 3, april: 3,\n  may: 4,\n  jun: 5, june: 5,\n  jul: 6, july: 6,\n  aug: 7, august: 7,\n  sep: 8, september: 8,\n  oct: 9, october: 9,\n  nov: 10, november: 10,\n  dec: 11, december: 11,\n}\n\n/**\n * Formats a Date to a string using the given format pattern.\n *\n * Supported tokens:\n * - `YYYY` — 4-digit year\n * - `YY` — 2-digit year\n * - `MMMM` — full month name\n * - `MMM` — abbreviated month name\n * - `MM` — 2-digit month (01–12)\n * - `DD` — 2-digit day (01–31)\n * - `HH` — 2-digit hours (00–23)\n * - `mm` — 2-digit minutes\n * - `ss` — 2-digit seconds\n * - `SSS` — milliseconds\n *\n * @param date - The date to format.\n * @param format - The format string (default `'YYYY-MM-DD'`).\n * @returns The formatted date string.\n */\nexport function formatDate(date: Date, format: string = 'YYYY-MM-DD'): string {\n  const year = date.getFullYear()\n  const month = date.getMonth()\n  const day = date.getDate()\n  const hours = date.getHours()\n  const minutes = date.getMinutes()\n  const seconds = date.getSeconds()\n  const ms = date.getMilliseconds()\n\n  const pad = (n: number, len: number = 2): string => String(n).padStart(len, '0')\n\n  return format\n    .replace(/YYYY/g, String(year))\n    .replace(/YY/g, String(year).slice(-2))\n    .replace(/MMMM/g, MONTH_NAMES_FULL[month]!)\n    .replace(/MMM/g, MONTH_NAMES_SHORT[month]!)\n    .replace(/MM/g, pad(month + 1))\n    .replace(/DD/g, pad(day))\n    .replace(/HH/g, pad(hours))\n    .replace(/mm/g, pad(minutes))\n    .replace(/ss/g, pad(seconds))\n    .replace(/SSS/g, pad(ms, 3))\n}\n\n/**\n * Parses a date from a string, number (timestamp in ms), or Date object.\n *\n * Supported string formats:\n * - ISO (`YYYY-MM-DD`, `YYYY-MM-DDTHH:mm:ss`)\n * - `DD/MM/YYYY` or `DD-MM-YYYY`\n * - `DD MMM YYYY` or `DD MMMM YYYY`\n * - Unix timestamp (milliseconds)\n *\n * @param input - The value to parse.\n * @returns A valid Date object.\n * @throws {InvalidDateError} If the input cannot be parsed.\n */\nexport function parseDate(input: string | number | Date): Date {\n  if (input instanceof Date) {\n    if (isNaN(input.getTime())) throw new InvalidDateError(input)\n    return new Date(input.getTime())\n  }\n\n  if (typeof input === 'number') {\n    const d = new Date(input)\n    if (isNaN(d.getTime())) throw new InvalidDateError(input)\n    return d\n  }\n\n  const trimmed = input.trim()\n\n  // ISO format: YYYY-MM-DD or YYYY-MM-DDTHH:mm:ss\n  const isoMatch = trimmed.match(/^(\\d{4})-(\\d{2})-(\\d{2})(?:T(\\d{2}):(\\d{2}):(\\d{2})(?:\\.(\\d+))?)?(?:Z|[+-]\\d{2}:?\\d{2})?$/)\n  if (isoMatch) {\n    const d = new Date(\n      parseInt(isoMatch[1]!, 10),\n      parseInt(isoMatch[2]!, 10) - 1,\n      parseInt(isoMatch[3]!, 10),\n      isoMatch[4] ? parseInt(isoMatch[4]!, 10) : 0,\n      isoMatch[5] ? parseInt(isoMatch[5]!, 10) : 0,\n      isoMatch[6] ? parseInt(isoMatch[6]!, 10) : 0,\n      isoMatch[7] ? parseInt(isoMatch[7]!.padEnd(3, '0'), 10) : 0\n    )\n    if (!isNaN(d.getTime())) return d\n  }\n\n  // DD/MM/YYYY or DD-MM-YYYY\n  const dmyMatch = trimmed.match(/^(\\d{1,2})[\\/-](\\d{1,2})[\\/-](\\d{4})$/)\n  if (dmyMatch) {\n    const d = new Date(\n      parseInt(dmyMatch[3]!, 10),\n      parseInt(dmyMatch[2]!, 10) - 1,\n      parseInt(dmyMatch[1]!, 10)\n    )\n    if (!isNaN(d.getTime())) return d\n  }\n\n  // DD MMM YYYY or DD MMMM YYYY\n  const textMatch = trimmed.match(/^(\\d{1,2})\\s+([a-zA-Z]+)\\s+(\\d{4})$/)\n  if (textMatch) {\n    const monthIndex = MONTH_MAP[textMatch[2]!.toLowerCase()]\n    if (monthIndex !== undefined) {\n      const d = new Date(\n        parseInt(textMatch[3]!, 10),\n        monthIndex,\n        parseInt(textMatch[1]!, 10)\n      )\n      if (!isNaN(d.getTime())) return d\n    }\n  }\n\n  // Unix timestamp (milliseconds) as string\n  const numMatch = trimmed.match(/^-?\\d+$/)\n  if (numMatch) {\n    const d = new Date(parseInt(numMatch[0], 10))\n    if (!isNaN(d.getTime())) return d\n  }\n\n  // Fallback: let Date.parse try\n  const fallback = new Date(trimmed)\n  if (!isNaN(fallback.getTime())) return fallback\n\n  throw new InvalidDateError(input)\n}\n\nfunction isValidDate(d: Date): boolean {\n  return d instanceof Date && !isNaN(d.getTime())\n}\n\nconst MS_IN_SECOND = 1000\nconst MS_IN_MINUTE = 60 * MS_IN_SECOND\nconst MS_IN_HOUR = 60 * MS_IN_MINUTE\nconst MS_IN_DAY = 24 * MS_IN_HOUR\n\n/**\n * Computes the difference between two dates.\n *\n * @param date1 - Start date.\n * @param date2 - End date.\n * @returns An object with years, months, days, hours, minutes, seconds.\n * @throws {InvalidDateError} If either date is invalid.\n */\nexport function dateDiff(date1: Date, date2: Date): DateDiff {\n  if (!isValidDate(date1) || !isValidDate(date2)) {\n    throw new InvalidDateError('Invalid date provided to dateDiff')\n  }\n\n  let years = date2.getFullYear() - date1.getFullYear()\n  let months = date2.getMonth() - date1.getMonth()\n  let days = date2.getDate() - date1.getDate()\n\n  if (days < 0) {\n    months -= 1\n    const prevMonth = new Date(date2.getFullYear(), date2.getMonth(), 0)\n    days += prevMonth.getDate()\n  }\n\n  if (months < 0) {\n    years -= 1\n    months += 12\n  }\n\n  const msDiff = Math.abs(date2.getTime() - date1.getTime())\n  const totalSeconds = Math.floor(msDiff / MS_IN_SECOND)\n  const hours = Math.floor((msDiff % MS_IN_DAY) / MS_IN_HOUR)\n  const minutes = Math.floor((msDiff % MS_IN_HOUR) / MS_IN_MINUTE)\n  const seconds = totalSeconds % 60\n\n  return { years, months, days, hours, minutes, seconds }\n}\n\n/**\n * Adds days to a date.\n *\n * @param date - The original date.\n * @param days - Number of days to add (negative to subtract).\n * @returns A new Date.\n * @throws {InvalidDateError} If the input date is invalid.\n */\nexport function addDays(date: Date, days: number): Date {\n  if (!isValidDate(date)) throw new InvalidDateError(date)\n  const result = new Date(date.getTime())\n  result.setDate(result.getDate() + days)\n  return result\n}\n\n/**\n * Adds months to a date. Handles month-end overflow (e.g., Jan 31 + 1 month\n * becomes Feb 28).\n *\n * @param date - The original date.\n * @param months - Number of months to add (negative to subtract).\n * @returns A new Date.\n * @throws {InvalidDateError} If the input date is invalid.\n */\nexport function addMonths(date: Date, months: number): Date {\n  if (!isValidDate(date)) throw new InvalidDateError(date)\n  const result = new Date(date.getTime())\n  const targetMonth = result.getMonth() + months\n  result.setMonth(targetMonth)\n\n  if (result.getMonth() !== ((targetMonth % 12) + 12) % 12) {\n    result.setDate(0)\n  }\n\n  return result\n}\n\n/**\n * Adds years to a date. Handles leap-year overflow (e.g., Feb 29 + 1 year\n * becomes Feb 28).\n *\n * @param date - The original date.\n * @param years - Number of years to add (negative to subtract).\n * @returns A new Date.\n * @throws {InvalidDateError} If the input date is invalid.\n */\nexport function addYears(date: Date, years: number): Date {\n  if (!isValidDate(date)) throw new InvalidDateError(date)\n  const result = new Date(date.getTime())\n  const targetYear = result.getFullYear() + years\n  result.setFullYear(targetYear)\n\n  if (result.getFullYear() !== targetYear) {\n    result.setDate(0)\n  }\n\n  return result\n}\n\n/**\n * Returns the start of the day (00:00:00.000) for the given date.\n *\n * @param date - The date.\n * @returns A new Date set to midnight.\n * @throws {InvalidDateError} If the input date is invalid.\n */\nexport function startOfDay(date: Date): Date {\n  if (!isValidDate(date)) throw new InvalidDateError(date)\n  return new Date(date.getFullYear(), date.getMonth(), date.getDate(), 0, 0, 0, 0)\n}\n\n/**\n * Returns the end of the day (23:59:59.999) for the given date.\n *\n * @param date - The date.\n * @returns A new Date set to the last millisecond of the day.\n * @throws {InvalidDateError} If the input date is invalid.\n */\nexport function endOfDay(date: Date): Date {\n  if (!isValidDate(date)) throw new InvalidDateError(date)\n  return new Date(date.getFullYear(), date.getMonth(), date.getDate(), 23, 59, 59, 999)\n}\n\n/**\n * Returns the first moment of the month for the given date.\n *\n * @param date - The date.\n * @returns A new Date set to the start of the month.\n * @throws {InvalidDateError} If the input date is invalid.\n */\nexport function startOfMonth(date: Date): Date {\n  if (!isValidDate(date)) throw new InvalidDateError(date)\n  return new Date(date.getFullYear(), date.getMonth(), 1, 0, 0, 0, 0)\n}\n\n/**\n * Returns the last moment of the month for the given date.\n *\n * @param date - The date.\n * @returns A new Date set to the end of the month.\n * @throws {InvalidDateError} If the input date is invalid.\n */\nexport function endOfMonth(date: Date): Date {\n  if (!isValidDate(date)) throw new InvalidDateError(date)\n  return new Date(date.getFullYear(), date.getMonth() + 1, 0, 23, 59, 59, 999)\n}\n\n/**\n * Returns the first moment of the year for the given date.\n *\n * @param date - The date.\n * @returns A new Date set to Jan 1 00:00:00.000.\n * @throws {InvalidDateError} If the input date is invalid.\n */\nexport function startOfYear(date: Date): Date {\n  if (!isValidDate(date)) throw new InvalidDateError(date)\n  return new Date(date.getFullYear(), 0, 1, 0, 0, 0, 0)\n}\n\n/**\n * Returns the last moment of the year for the given date.\n *\n * @param date - The date.\n * @returns A new Date set to Dec 31 23:59:59.999.\n * @throws {InvalidDateError} If the input date is invalid.\n */\nexport function endOfYear(date: Date): Date {\n  if (!isValidDate(date)) throw new InvalidDateError(date)\n  return new Date(date.getFullYear(), 12, 0, 23, 59, 59, 999)\n}\n\n/**\n * Checks if the date falls on a weekend (Saturday or Sunday).\n *\n * @param date - The date to check.\n * @returns Whether the date is a weekend.\n * @throws {InvalidDateError} If the input date is invalid.\n */\nexport function isWeekend(date: Date): boolean {\n  if (!isValidDate(date)) throw new InvalidDateError(date)\n  const day = date.getDay()\n  return day === 0 || day === 6\n}\n\n/**\n * Checks if a year is a leap year.\n *\n * @param year - The year to check.\n * @returns Whether the year is a leap year.\n */\nexport function isLeapYear(year: number): boolean {\n  return (year % 4 === 0 && year % 100 !== 0) || year % 400 === 0\n}\n\n/**\n * Checks if `date1` is before `date2`.\n *\n * @param date1 - First date.\n * @param date2 - Second date.\n * @returns Whether `date1` is before `date2`.\n * @throws {InvalidDateError} If either date is invalid.\n */\nexport function isBefore(date1: Date, date2: Date): boolean {\n  if (!isValidDate(date1) || !isValidDate(date2)) {\n    throw new InvalidDateError('Invalid date provided to isBefore')\n  }\n  return date1.getTime() < date2.getTime()\n}\n\n/**\n * Checks if `date1` is after `date2`.\n *\n * @param date1 - First date.\n * @param date2 - Second date.\n * @returns Whether `date1` is after `date2`.\n * @throws {InvalidDateError} If either date is invalid.\n */\nexport function isAfter(date1: Date, date2: Date): boolean {\n  if (!isValidDate(date1) || !isValidDate(date2)) {\n    throw new InvalidDateError('Invalid date provided to isAfter')\n  }\n  return date1.getTime() > date2.getTime()\n}\n\n/**\n * Checks if a date is within the inclusive range [start, end].\n *\n * @param date - The date to check.\n * @param start - Start of the range.\n * @param end - End of the range.\n * @returns Whether the date is between start and end.\n * @throws {InvalidDateError} If any date is invalid.\n */\nexport function isBetween(date: Date, start: Date, end: Date): boolean {\n  if (!isValidDate(date) || !isValidDate(start) || !isValidDate(end)) {\n    throw new InvalidDateError('Invalid date provided to isBetween')\n  }\n  return date.getTime() >= start.getTime() && date.getTime() <= end.getTime()\n}\n\n/**\n * Checks if a date is a business day (Monday to Friday).\n *\n * @param date - The date to check.\n * @returns Whether the date is a business day.\n */\nexport function isBusinessDay(date: Date): boolean {\n  return isValidDate(date) && !isWeekend(date)\n}\n\n/**\n * Adds business days (skipping weekends) to a date.\n *\n * @param date - The starting date.\n * @param days - Number of business days to add (negative to subtract).\n * @returns A new Date.\n * @throws {InvalidDateError} If the input date is invalid.\n */\nexport function addBusinessDays(date: Date, days: number): Date {\n  if (!isValidDate(date)) throw new InvalidDateError(date)\n\n  const result = new Date(date.getTime())\n  let remaining = Math.abs(days)\n  const step = days >= 0 ? 1 : -1\n\n  while (remaining > 0) {\n    result.setDate(result.getDate() + step)\n    const day = result.getDay()\n    if (day !== 0 && day !== 6) {\n      remaining--\n    }\n  }\n\n  return result\n}\n\n/**\n * Calculates age in years from a birth date.\n *\n * @param birthDate - The date of birth.\n * @returns The age in years.\n * @throws {InvalidDateError} If the birth date is invalid.\n */\nexport function calculateAge(birthDate: Date): number {\n  if (!isValidDate(birthDate)) throw new InvalidDateError(birthDate)\n\n  const today = new Date()\n  let age = today.getFullYear() - birthDate.getFullYear()\n  const monthDiff = today.getMonth() - birthDate.getMonth()\n\n  if (monthDiff < 0 || (monthDiff === 0 && today.getDate() < birthDate.getDate())) {\n    age--\n  }\n\n  return age\n}\n"],"mappings":";AAGO,IAAM,mBAAN,cAA+B,MAAM;AAAA,EAC1C,YAAY,OAAgB;AAC1B,UAAM,iBAAiB,OAAO,KAAK,CAAC,EAAE;AACtC,SAAK,OAAO;AAAA,EACd;AACF;AAWA,IAAM,oBAAoB;AAAA,EACxB;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EACnC;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AACrC;AAEA,IAAM,mBAAmB;AAAA,EACvB;AAAA,EAAW;AAAA,EAAY;AAAA,EAAS;AAAA,EAAS;AAAA,EAAO;AAAA,EAChD;AAAA,EAAQ;AAAA,EAAU;AAAA,EAAa;AAAA,EAAW;AAAA,EAAY;AACxD;AAEA,IAAM,YAAoC;AAAA,EACxC,KAAK;AAAA,EAAG,SAAS;AAAA,EACjB,KAAK;AAAA,EAAG,UAAU;AAAA,EAClB,KAAK;AAAA,EAAG,OAAO;AAAA,EACf,KAAK;AAAA,EAAG,OAAO;AAAA,EACf,KAAK;AAAA,EACL,KAAK;AAAA,EAAG,MAAM;AAAA,EACd,KAAK;AAAA,EAAG,MAAM;AAAA,EACd,KAAK;AAAA,EAAG,QAAQ;AAAA,EAChB,KAAK;AAAA,EAAG,WAAW;AAAA,EACnB,KAAK;AAAA,EAAG,SAAS;AAAA,EACjB,KAAK;AAAA,EAAI,UAAU;AAAA,EACnB,KAAK;AAAA,EAAI,UAAU;AACrB;AAqBO,SAAS,WAAW,MAAY,SAAiB,cAAsB;AAC5E,QAAM,OAAO,KAAK,YAAY;AAC9B,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,MAAM,KAAK,QAAQ;AACzB,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,UAAU,KAAK,WAAW;AAChC,QAAM,UAAU,KAAK,WAAW;AAChC,QAAM,KAAK,KAAK,gBAAgB;AAEhC,QAAM,MAAM,CAAC,GAAW,MAAc,MAAc,OAAO,CAAC,EAAE,SAAS,KAAK,GAAG;AAE/E,SAAO,OACJ,QAAQ,SAAS,OAAO,IAAI,CAAC,EAC7B,QAAQ,OAAO,OAAO,IAAI,EAAE,MAAM,EAAE,CAAC,EACrC,QAAQ,SAAS,iBAAiB,KAAK,CAAE,EACzC,QAAQ,QAAQ,kBAAkB,KAAK,CAAE,EACzC,QAAQ,OAAO,IAAI,QAAQ,CAAC,CAAC,EAC7B,QAAQ,OAAO,IAAI,GAAG,CAAC,EACvB,QAAQ,OAAO,IAAI,KAAK,CAAC,EACzB,QAAQ,OAAO,IAAI,OAAO,CAAC,EAC3B,QAAQ,OAAO,IAAI,OAAO,CAAC,EAC3B,QAAQ,QAAQ,IAAI,IAAI,CAAC,CAAC;AAC/B;AAeO,SAAS,UAAU,OAAqC;AAC7D,MAAI,iBAAiB,MAAM;AACzB,QAAI,MAAM,MAAM,QAAQ,CAAC,EAAG,OAAM,IAAI,iBAAiB,KAAK;AAC5D,WAAO,IAAI,KAAK,MAAM,QAAQ,CAAC;AAAA,EACjC;AAEA,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,IAAI,IAAI,KAAK,KAAK;AACxB,QAAI,MAAM,EAAE,QAAQ,CAAC,EAAG,OAAM,IAAI,iBAAiB,KAAK;AACxD,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,MAAM,KAAK;AAG3B,QAAM,WAAW,QAAQ,MAAM,2FAA2F;AAC1H,MAAI,UAAU;AACZ,UAAM,IAAI,IAAI;AAAA,MACZ,SAAS,SAAS,CAAC,GAAI,EAAE;AAAA,MACzB,SAAS,SAAS,CAAC,GAAI,EAAE,IAAI;AAAA,MAC7B,SAAS,SAAS,CAAC,GAAI,EAAE;AAAA,MACzB,SAAS,CAAC,IAAI,SAAS,SAAS,CAAC,GAAI,EAAE,IAAI;AAAA,MAC3C,SAAS,CAAC,IAAI,SAAS,SAAS,CAAC,GAAI,EAAE,IAAI;AAAA,MAC3C,SAAS,CAAC,IAAI,SAAS,SAAS,CAAC,GAAI,EAAE,IAAI;AAAA,MAC3C,SAAS,CAAC,IAAI,SAAS,SAAS,CAAC,EAAG,OAAO,GAAG,GAAG,GAAG,EAAE,IAAI;AAAA,IAC5D;AACA,QAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAG,QAAO;AAAA,EAClC;AAGA,QAAM,WAAW,QAAQ,MAAM,uCAAuC;AACtE,MAAI,UAAU;AACZ,UAAM,IAAI,IAAI;AAAA,MACZ,SAAS,SAAS,CAAC,GAAI,EAAE;AAAA,MACzB,SAAS,SAAS,CAAC,GAAI,EAAE,IAAI;AAAA,MAC7B,SAAS,SAAS,CAAC,GAAI,EAAE;AAAA,IAC3B;AACA,QAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAG,QAAO;AAAA,EAClC;AAGA,QAAM,YAAY,QAAQ,MAAM,qCAAqC;AACrE,MAAI,WAAW;AACb,UAAM,aAAa,UAAU,UAAU,CAAC,EAAG,YAAY,CAAC;AACxD,QAAI,eAAe,QAAW;AAC5B,YAAM,IAAI,IAAI;AAAA,QACZ,SAAS,UAAU,CAAC,GAAI,EAAE;AAAA,QAC1B;AAAA,QACA,SAAS,UAAU,CAAC,GAAI,EAAE;AAAA,MAC5B;AACA,UAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAG,QAAO;AAAA,IAClC;AAAA,EACF;AAGA,QAAM,WAAW,QAAQ,MAAM,SAAS;AACxC,MAAI,UAAU;AACZ,UAAM,IAAI,IAAI,KAAK,SAAS,SAAS,CAAC,GAAG,EAAE,CAAC;AAC5C,QAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAG,QAAO;AAAA,EAClC;AAGA,QAAM,WAAW,IAAI,KAAK,OAAO;AACjC,MAAI,CAAC,MAAM,SAAS,QAAQ,CAAC,EAAG,QAAO;AAEvC,QAAM,IAAI,iBAAiB,KAAK;AAClC;AAEA,SAAS,YAAY,GAAkB;AACrC,SAAO,aAAa,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC;AAChD;AAEA,IAAM,eAAe;AACrB,IAAM,eAAe,KAAK;AAC1B,IAAM,aAAa,KAAK;AACxB,IAAM,YAAY,KAAK;AAUhB,SAAS,SAAS,OAAa,OAAuB;AAC3D,MAAI,CAAC,YAAY,KAAK,KAAK,CAAC,YAAY,KAAK,GAAG;AAC9C,UAAM,IAAI,iBAAiB,mCAAmC;AAAA,EAChE;AAEA,MAAI,QAAQ,MAAM,YAAY,IAAI,MAAM,YAAY;AACpD,MAAI,SAAS,MAAM,SAAS,IAAI,MAAM,SAAS;AAC/C,MAAI,OAAO,MAAM,QAAQ,IAAI,MAAM,QAAQ;AAE3C,MAAI,OAAO,GAAG;AACZ,cAAU;AACV,UAAM,YAAY,IAAI,KAAK,MAAM,YAAY,GAAG,MAAM,SAAS,GAAG,CAAC;AACnE,YAAQ,UAAU,QAAQ;AAAA,EAC5B;AAEA,MAAI,SAAS,GAAG;AACd,aAAS;AACT,cAAU;AAAA,EACZ;AAEA,QAAM,SAAS,KAAK,IAAI,MAAM,QAAQ,IAAI,MAAM,QAAQ,CAAC;AACzD,QAAM,eAAe,KAAK,MAAM,SAAS,YAAY;AACrD,QAAM,QAAQ,KAAK,MAAO,SAAS,YAAa,UAAU;AAC1D,QAAM,UAAU,KAAK,MAAO,SAAS,aAAc,YAAY;AAC/D,QAAM,UAAU,eAAe;AAE/B,SAAO,EAAE,OAAO,QAAQ,MAAM,OAAO,SAAS,QAAQ;AACxD;AAUO,SAAS,QAAQ,MAAY,MAAoB;AACtD,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,QAAM,SAAS,IAAI,KAAK,KAAK,QAAQ,CAAC;AACtC,SAAO,QAAQ,OAAO,QAAQ,IAAI,IAAI;AACtC,SAAO;AACT;AAWO,SAAS,UAAU,MAAY,QAAsB;AAC1D,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,QAAM,SAAS,IAAI,KAAK,KAAK,QAAQ,CAAC;AACtC,QAAM,cAAc,OAAO,SAAS,IAAI;AACxC,SAAO,SAAS,WAAW;AAE3B,MAAI,OAAO,SAAS,OAAQ,cAAc,KAAM,MAAM,IAAI;AACxD,WAAO,QAAQ,CAAC;AAAA,EAClB;AAEA,SAAO;AACT;AAWO,SAAS,SAAS,MAAY,OAAqB;AACxD,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,QAAM,SAAS,IAAI,KAAK,KAAK,QAAQ,CAAC;AACtC,QAAM,aAAa,OAAO,YAAY,IAAI;AAC1C,SAAO,YAAY,UAAU;AAE7B,MAAI,OAAO,YAAY,MAAM,YAAY;AACvC,WAAO,QAAQ,CAAC;AAAA,EAClB;AAEA,SAAO;AACT;AASO,SAAS,WAAW,MAAkB;AAC3C,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,SAAO,IAAI,KAAK,KAAK,YAAY,GAAG,KAAK,SAAS,GAAG,KAAK,QAAQ,GAAG,GAAG,GAAG,GAAG,CAAC;AACjF;AASO,SAAS,SAAS,MAAkB;AACzC,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,SAAO,IAAI,KAAK,KAAK,YAAY,GAAG,KAAK,SAAS,GAAG,KAAK,QAAQ,GAAG,IAAI,IAAI,IAAI,GAAG;AACtF;AASO,SAAS,aAAa,MAAkB;AAC7C,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,SAAO,IAAI,KAAK,KAAK,YAAY,GAAG,KAAK,SAAS,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AACpE;AASO,SAAS,WAAW,MAAkB;AAC3C,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,SAAO,IAAI,KAAK,KAAK,YAAY,GAAG,KAAK,SAAS,IAAI,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG;AAC7E;AASO,SAAS,YAAY,MAAkB;AAC5C,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,SAAO,IAAI,KAAK,KAAK,YAAY,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AACtD;AASO,SAAS,UAAU,MAAkB;AAC1C,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,SAAO,IAAI,KAAK,KAAK,YAAY,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG;AAC5D;AASO,SAAS,UAAU,MAAqB;AAC7C,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,QAAM,MAAM,KAAK,OAAO;AACxB,SAAO,QAAQ,KAAK,QAAQ;AAC9B;AAQO,SAAS,WAAW,MAAuB;AAChD,SAAQ,OAAO,MAAM,KAAK,OAAO,QAAQ,KAAM,OAAO,QAAQ;AAChE;AAUO,SAAS,SAAS,OAAa,OAAsB;AAC1D,MAAI,CAAC,YAAY,KAAK,KAAK,CAAC,YAAY,KAAK,GAAG;AAC9C,UAAM,IAAI,iBAAiB,mCAAmC;AAAA,EAChE;AACA,SAAO,MAAM,QAAQ,IAAI,MAAM,QAAQ;AACzC;AAUO,SAAS,QAAQ,OAAa,OAAsB;AACzD,MAAI,CAAC,YAAY,KAAK,KAAK,CAAC,YAAY,KAAK,GAAG;AAC9C,UAAM,IAAI,iBAAiB,kCAAkC;AAAA,EAC/D;AACA,SAAO,MAAM,QAAQ,IAAI,MAAM,QAAQ;AACzC;AAWO,SAAS,UAAU,MAAY,OAAa,KAAoB;AACrE,MAAI,CAAC,YAAY,IAAI,KAAK,CAAC,YAAY,KAAK,KAAK,CAAC,YAAY,GAAG,GAAG;AAClE,UAAM,IAAI,iBAAiB,oCAAoC;AAAA,EACjE;AACA,SAAO,KAAK,QAAQ,KAAK,MAAM,QAAQ,KAAK,KAAK,QAAQ,KAAK,IAAI,QAAQ;AAC5E;AAQO,SAAS,cAAc,MAAqB;AACjD,SAAO,YAAY,IAAI,KAAK,CAAC,UAAU,IAAI;AAC7C;AAUO,SAAS,gBAAgB,MAAY,MAAoB;AAC9D,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AAEvD,QAAM,SAAS,IAAI,KAAK,KAAK,QAAQ,CAAC;AACtC,MAAI,YAAY,KAAK,IAAI,IAAI;AAC7B,QAAM,OAAO,QAAQ,IAAI,IAAI;AAE7B,SAAO,YAAY,GAAG;AACpB,WAAO,QAAQ,OAAO,QAAQ,IAAI,IAAI;AACtC,UAAM,MAAM,OAAO,OAAO;AAC1B,QAAI,QAAQ,KAAK,QAAQ,GAAG;AAC1B;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AASO,SAAS,aAAa,WAAyB;AACpD,MAAI,CAAC,YAAY,SAAS,EAAG,OAAM,IAAI,iBAAiB,SAAS;AAEjE,QAAM,QAAQ,oBAAI,KAAK;AACvB,MAAI,MAAM,MAAM,YAAY,IAAI,UAAU,YAAY;AACtD,QAAM,YAAY,MAAM,SAAS,IAAI,UAAU,SAAS;AAExD,MAAI,YAAY,KAAM,cAAc,KAAK,MAAM,QAAQ,IAAI,UAAU,QAAQ,GAAI;AAC/E;AAAA,EACF;AAEA,SAAO;AACT;","names":[]}
+{"version":3,"sources":["../../src/date/index.ts"],"sourcesContent":["/**\r\n * Error thrown when a date value is invalid.\r\n */\r\nexport class InvalidDateError extends Error {\r\n  constructor(input: unknown) {\r\n    super(`Invalid date: ${String(input)}`)\r\n    this.name = 'InvalidDateError'\r\n  }\r\n}\r\n\r\nexport interface DateDiff {\r\n  years: number\r\n  months: number\r\n  days: number\r\n  hours: number\r\n  minutes: number\r\n  seconds: number\r\n}\r\n\r\nconst MONTH_NAMES_SHORT = [\r\n  'Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun',\r\n  'Jul', 'Aug', 'Sep', 'Oct', 'Nov', 'Dec',\r\n] as const\r\n\r\nconst MONTH_NAMES_FULL = [\r\n  'January', 'February', 'March', 'April', 'May', 'June',\r\n  'July', 'August', 'September', 'October', 'November', 'December',\r\n] as const\r\n\r\nconst MONTH_MAP: Record<string, number> = {\r\n  jan: 0, january: 0,\r\n  feb: 1, february: 1,\r\n  mar: 2, march: 2,\r\n  apr: 3, april: 3,\r\n  may: 4,\r\n  jun: 5, june: 5,\r\n  jul: 6, july: 6,\r\n  aug: 7, august: 7,\r\n  sep: 8, september: 8,\r\n  oct: 9, october: 9,\r\n  nov: 10, november: 10,\r\n  dec: 11, december: 11,\r\n}\r\n\r\n/**\r\n * Formats a Date to a string using the given format pattern.\r\n *\r\n * Supported tokens:\r\n * - `YYYY` — 4-digit year\r\n * - `YY` — 2-digit year\r\n * - `MMMM` — full month name\r\n * - `MMM` — abbreviated month name\r\n * - `MM` — 2-digit month (01–12)\r\n * - `DD` — 2-digit day (01–31)\r\n * - `HH` — 2-digit hours (00–23)\r\n * - `mm` — 2-digit minutes\r\n * - `ss` — 2-digit seconds\r\n * - `SSS` — milliseconds\r\n *\r\n * @param date - The date to format.\r\n * @param format - The format string (default `'YYYY-MM-DD'`).\r\n * @returns The formatted date string.\r\n */\r\nexport function formatDate(date: Date, format: string = 'YYYY-MM-DD'): string {\r\n  const year = date.getFullYear()\r\n  const month = date.getMonth()\r\n  const day = date.getDate()\r\n  const hours = date.getHours()\r\n  const minutes = date.getMinutes()\r\n  const seconds = date.getSeconds()\r\n  const ms = date.getMilliseconds()\r\n\r\n  const pad = (n: number, len: number = 2): string => String(n).padStart(len, '0')\r\n\r\n  return format\r\n    .replace(/YYYY/g, String(year))\r\n    .replace(/YY/g, String(year).slice(-2))\r\n    .replace(/MMMM/g, MONTH_NAMES_FULL[month]!)\r\n    .replace(/MMM/g, MONTH_NAMES_SHORT[month]!)\r\n    .replace(/MM/g, pad(month + 1))\r\n    .replace(/DD/g, pad(day))\r\n    .replace(/HH/g, pad(hours))\r\n    .replace(/mm/g, pad(minutes))\r\n    .replace(/ss/g, pad(seconds))\r\n    .replace(/SSS/g, pad(ms, 3))\r\n}\r\n\r\n/**\r\n * Parses a date from a string, number (timestamp in ms), or Date object.\r\n *\r\n * Supported string formats:\r\n * - ISO (`YYYY-MM-DD`, `YYYY-MM-DDTHH:mm:ss`)\r\n * - `DD/MM/YYYY` or `DD-MM-YYYY`\r\n * - `DD MMM YYYY` or `DD MMMM YYYY`\r\n * - Unix timestamp (milliseconds)\r\n *\r\n * @param input - The value to parse.\r\n * @returns A valid Date object.\r\n * @throws {InvalidDateError} If the input cannot be parsed.\r\n */\r\nexport function parseDate(input: string | number | Date): Date {\r\n  if (input instanceof Date) {\r\n    if (isNaN(input.getTime())) throw new InvalidDateError(input)\r\n    return new Date(input.getTime())\r\n  }\r\n\r\n  if (typeof input === 'number') {\r\n    const d = new Date(input)\r\n    if (isNaN(d.getTime())) throw new InvalidDateError(input)\r\n    return d\r\n  }\r\n\r\n  const trimmed = input.trim()\r\n\r\n  // ISO format: YYYY-MM-DD or YYYY-MM-DDTHH:mm:ss\r\n  const isoMatch = trimmed.match(/^(\\d{4})-(\\d{2})-(\\d{2})(?:T(\\d{2}):(\\d{2}):(\\d{2})(?:\\.(\\d+))?)?(?:Z|[+-]\\d{2}:?\\d{2})?$/)\r\n  if (isoMatch) {\r\n    const d = new Date(\r\n      parseInt(isoMatch[1]!, 10),\r\n      parseInt(isoMatch[2]!, 10) - 1,\r\n      parseInt(isoMatch[3]!, 10),\r\n      isoMatch[4] ? parseInt(isoMatch[4]!, 10) : 0,\r\n      isoMatch[5] ? parseInt(isoMatch[5]!, 10) : 0,\r\n      isoMatch[6] ? parseInt(isoMatch[6]!, 10) : 0,\r\n      isoMatch[7] ? parseInt(isoMatch[7]!.padEnd(3, '0'), 10) : 0\r\n    )\r\n    if (!isNaN(d.getTime())) return d\r\n  }\r\n\r\n  // DD/MM/YYYY or DD-MM-YYYY\r\n  const dmyMatch = trimmed.match(/^(\\d{1,2})[\\/-](\\d{1,2})[\\/-](\\d{4})$/)\r\n  if (dmyMatch) {\r\n    const d = new Date(\r\n      parseInt(dmyMatch[3]!, 10),\r\n      parseInt(dmyMatch[2]!, 10) - 1,\r\n      parseInt(dmyMatch[1]!, 10)\r\n    )\r\n    if (!isNaN(d.getTime())) return d\r\n  }\r\n\r\n  // DD MMM YYYY or DD MMMM YYYY\r\n  const textMatch = trimmed.match(/^(\\d{1,2})\\s+([a-zA-Z]+)\\s+(\\d{4})$/)\r\n  if (textMatch) {\r\n    const monthIndex = MONTH_MAP[textMatch[2]!.toLowerCase()]\r\n    if (monthIndex !== undefined) {\r\n      const d = new Date(\r\n        parseInt(textMatch[3]!, 10),\r\n        monthIndex,\r\n        parseInt(textMatch[1]!, 10)\r\n      )\r\n      if (!isNaN(d.getTime())) return d\r\n    }\r\n  }\r\n\r\n  // Unix timestamp (milliseconds) as string\r\n  const numMatch = trimmed.match(/^-?\\d+$/)\r\n  if (numMatch) {\r\n    const d = new Date(parseInt(numMatch[0], 10))\r\n    if (!isNaN(d.getTime())) return d\r\n  }\r\n\r\n  // Fallback: let Date.parse try\r\n  const fallback = new Date(trimmed)\r\n  if (!isNaN(fallback.getTime())) return fallback\r\n\r\n  throw new InvalidDateError(input)\r\n}\r\n\r\nfunction isValidDate(d: Date): boolean {\r\n  return d instanceof Date && !isNaN(d.getTime())\r\n}\r\n\r\nconst MS_IN_SECOND = 1000\r\nconst MS_IN_MINUTE = 60 * MS_IN_SECOND\r\nconst MS_IN_HOUR = 60 * MS_IN_MINUTE\r\nconst MS_IN_DAY = 24 * MS_IN_HOUR\r\n\r\n/**\r\n * Computes the difference between two dates.\r\n *\r\n * @param date1 - Start date.\r\n * @param date2 - End date.\r\n * @returns An object with years, months, days, hours, minutes, seconds.\r\n * @throws {InvalidDateError} If either date is invalid.\r\n */\r\nexport function dateDiff(date1: Date, date2: Date): DateDiff {\r\n  if (!isValidDate(date1) || !isValidDate(date2)) {\r\n    throw new InvalidDateError('Invalid date provided to dateDiff')\r\n  }\r\n\r\n  let years = date2.getFullYear() - date1.getFullYear()\r\n  let months = date2.getMonth() - date1.getMonth()\r\n  let days = date2.getDate() - date1.getDate()\r\n\r\n  if (days < 0) {\r\n    months -= 1\r\n    const prevMonth = new Date(date2.getFullYear(), date2.getMonth(), 0)\r\n    days += prevMonth.getDate()\r\n  }\r\n\r\n  if (months < 0) {\r\n    years -= 1\r\n    months += 12\r\n  }\r\n\r\n  const msDiff = Math.abs(date2.getTime() - date1.getTime())\r\n  const totalSeconds = Math.floor(msDiff / MS_IN_SECOND)\r\n  const hours = Math.floor((msDiff % MS_IN_DAY) / MS_IN_HOUR)\r\n  const minutes = Math.floor((msDiff % MS_IN_HOUR) / MS_IN_MINUTE)\r\n  const seconds = totalSeconds % 60\r\n\r\n  return { years, months, days, hours, minutes, seconds }\r\n}\r\n\r\n/**\r\n * Adds days to a date.\r\n *\r\n * @param date - The original date.\r\n * @param days - Number of days to add (negative to subtract).\r\n * @returns A new Date.\r\n * @throws {InvalidDateError} If the input date is invalid.\r\n */\r\nexport function addDays(date: Date, days: number): Date {\r\n  if (!isValidDate(date)) throw new InvalidDateError(date)\r\n  const result = new Date(date.getTime())\r\n  result.setDate(result.getDate() + days)\r\n  return result\r\n}\r\n\r\n/**\r\n * Adds months to a date. Handles month-end overflow (e.g., Jan 31 + 1 month\r\n * becomes Feb 28).\r\n *\r\n * @param date - The original date.\r\n * @param months - Number of months to add (negative to subtract).\r\n * @returns A new Date.\r\n * @throws {InvalidDateError} If the input date is invalid.\r\n */\r\nexport function addMonths(date: Date, months: number): Date {\r\n  if (!isValidDate(date)) throw new InvalidDateError(date)\r\n  const result = new Date(date.getTime())\r\n  const targetMonth = result.getMonth() + months\r\n  result.setMonth(targetMonth)\r\n\r\n  if (result.getMonth() !== ((targetMonth % 12) + 12) % 12) {\r\n    result.setDate(0)\r\n  }\r\n\r\n  return result\r\n}\r\n\r\n/**\r\n * Adds years to a date. Handles leap-year overflow (e.g., Feb 29 + 1 year\r\n * becomes Feb 28).\r\n *\r\n * @param date - The original date.\r\n * @param years - Number of years to add (negative to subtract).\r\n * @returns A new Date.\r\n * @throws {InvalidDateError} If the input date is invalid.\r\n */\r\nexport function addYears(date: Date, years: number): Date {\r\n  if (!isValidDate(date)) throw new InvalidDateError(date)\r\n  const result = new Date(date.getTime())\r\n  const targetYear = result.getFullYear() + years\r\n  result.setFullYear(targetYear)\r\n\r\n  if (result.getFullYear() !== targetYear) {\r\n    result.setDate(0)\r\n  }\r\n\r\n  return result\r\n}\r\n\r\n/**\r\n * Returns the start of the day (00:00:00.000) for the given date.\r\n *\r\n * @param date - The date.\r\n * @returns A new Date set to midnight.\r\n * @throws {InvalidDateError} If the input date is invalid.\r\n */\r\nexport function startOfDay(date: Date): Date {\r\n  if (!isValidDate(date)) throw new InvalidDateError(date)\r\n  return new Date(date.getFullYear(), date.getMonth(), date.getDate(), 0, 0, 0, 0)\r\n}\r\n\r\n/**\r\n * Returns the end of the day (23:59:59.999) for the given date.\r\n *\r\n * @param date - The date.\r\n * @returns A new Date set to the last millisecond of the day.\r\n * @throws {InvalidDateError} If the input date is invalid.\r\n */\r\nexport function endOfDay(date: Date): Date {\r\n  if (!isValidDate(date)) throw new InvalidDateError(date)\r\n  return new Date(date.getFullYear(), date.getMonth(), date.getDate(), 23, 59, 59, 999)\r\n}\r\n\r\n/**\r\n * Returns the first moment of the month for the given date.\r\n *\r\n * @param date - The date.\r\n * @returns A new Date set to the start of the month.\r\n * @throws {InvalidDateError} If the input date is invalid.\r\n */\r\nexport function startOfMonth(date: Date): Date {\r\n  if (!isValidDate(date)) throw new InvalidDateError(date)\r\n  return new Date(date.getFullYear(), date.getMonth(), 1, 0, 0, 0, 0)\r\n}\r\n\r\n/**\r\n * Returns the last moment of the month for the given date.\r\n *\r\n * @param date - The date.\r\n * @returns A new Date set to the end of the month.\r\n * @throws {InvalidDateError} If the input date is invalid.\r\n */\r\nexport function endOfMonth(date: Date): Date {\r\n  if (!isValidDate(date)) throw new InvalidDateError(date)\r\n  return new Date(date.getFullYear(), date.getMonth() + 1, 0, 23, 59, 59, 999)\r\n}\r\n\r\n/**\r\n * Returns the first moment of the year for the given date.\r\n *\r\n * @param date - The date.\r\n * @returns A new Date set to Jan 1 00:00:00.000.\r\n * @throws {InvalidDateError} If the input date is invalid.\r\n */\r\nexport function startOfYear(date: Date): Date {\r\n  if (!isValidDate(date)) throw new InvalidDateError(date)\r\n  return new Date(date.getFullYear(), 0, 1, 0, 0, 0, 0)\r\n}\r\n\r\n/**\r\n * Returns the last moment of the year for the given date.\r\n *\r\n * @param date - The date.\r\n * @returns A new Date set to Dec 31 23:59:59.999.\r\n * @throws {InvalidDateError} If the input date is invalid.\r\n */\r\nexport function endOfYear(date: Date): Date {\r\n  if (!isValidDate(date)) throw new InvalidDateError(date)\r\n  return new Date(date.getFullYear(), 12, 0, 23, 59, 59, 999)\r\n}\r\n\r\n/**\r\n * Checks if the date falls on a weekend (Saturday or Sunday).\r\n *\r\n * @param date - The date to check.\r\n * @returns Whether the date is a weekend.\r\n * @throws {InvalidDateError} If the input date is invalid.\r\n */\r\nexport function isWeekend(date: Date): boolean {\r\n  if (!isValidDate(date)) throw new InvalidDateError(date)\r\n  const day = date.getDay()\r\n  return day === 0 || day === 6\r\n}\r\n\r\n/**\r\n * Checks if a year is a leap year.\r\n *\r\n * @param year - The year to check.\r\n * @returns Whether the year is a leap year.\r\n */\r\nexport function isLeapYear(year: number): boolean {\r\n  return (year % 4 === 0 && year % 100 !== 0) || year % 400 === 0\r\n}\r\n\r\n/**\r\n * Checks if `date1` is before `date2`.\r\n *\r\n * @param date1 - First date.\r\n * @param date2 - Second date.\r\n * @returns Whether `date1` is before `date2`.\r\n * @throws {InvalidDateError} If either date is invalid.\r\n */\r\nexport function isBefore(date1: Date, date2: Date): boolean {\r\n  if (!isValidDate(date1) || !isValidDate(date2)) {\r\n    throw new InvalidDateError('Invalid date provided to isBefore')\r\n  }\r\n  return date1.getTime() < date2.getTime()\r\n}\r\n\r\n/**\r\n * Checks if `date1` is after `date2`.\r\n *\r\n * @param date1 - First date.\r\n * @param date2 - Second date.\r\n * @returns Whether `date1` is after `date2`.\r\n * @throws {InvalidDateError} If either date is invalid.\r\n */\r\nexport function isAfter(date1: Date, date2: Date): boolean {\r\n  if (!isValidDate(date1) || !isValidDate(date2)) {\r\n    throw new InvalidDateError('Invalid date provided to isAfter')\r\n  }\r\n  return date1.getTime() > date2.getTime()\r\n}\r\n\r\n/**\r\n * Checks if a date is within the inclusive range [start, end].\r\n *\r\n * @param date - The date to check.\r\n * @param start - Start of the range.\r\n * @param end - End of the range.\r\n * @returns Whether the date is between start and end.\r\n * @throws {InvalidDateError} If any date is invalid.\r\n */\r\nexport function isBetween(date: Date, start: Date, end: Date): boolean {\r\n  if (!isValidDate(date) || !isValidDate(start) || !isValidDate(end)) {\r\n    throw new InvalidDateError('Invalid date provided to isBetween')\r\n  }\r\n  return date.getTime() >= start.getTime() && date.getTime() <= end.getTime()\r\n}\r\n\r\n/**\r\n * Checks if a date is a business day (Monday to Friday).\r\n *\r\n * @param date - The date to check.\r\n * @returns Whether the date is a business day.\r\n */\r\nexport function isBusinessDay(date: Date): boolean {\r\n  return isValidDate(date) && !isWeekend(date)\r\n}\r\n\r\n/**\r\n * Adds business days (skipping weekends) to a date.\r\n *\r\n * @param date - The starting date.\r\n * @param days - Number of business days to add (negative to subtract).\r\n * @returns A new Date.\r\n * @throws {InvalidDateError} If the input date is invalid.\r\n */\r\nexport function addBusinessDays(date: Date, days: number): Date {\r\n  if (!isValidDate(date)) throw new InvalidDateError(date)\r\n\r\n  const result = new Date(date.getTime())\r\n  let remaining = Math.abs(days)\r\n  const step = days >= 0 ? 1 : -1\r\n\r\n  while (remaining > 0) {\r\n    result.setDate(result.getDate() + step)\r\n    const day = result.getDay()\r\n    if (day !== 0 && day !== 6) {\r\n      remaining--\r\n    }\r\n  }\r\n\r\n  return result\r\n}\r\n\r\n/**\r\n * Calculates age in years from a birth date.\r\n *\r\n * @param birthDate - The date of birth.\r\n * @returns The age in years.\r\n * @throws {InvalidDateError} If the birth date is invalid.\r\n */\r\nexport function calculateAge(birthDate: Date): number {\r\n  if (!isValidDate(birthDate)) throw new InvalidDateError(birthDate)\r\n\r\n  const today = new Date()\r\n  let age = today.getFullYear() - birthDate.getFullYear()\r\n  const monthDiff = today.getMonth() - birthDate.getMonth()\r\n\r\n  if (monthDiff < 0 || (monthDiff === 0 && today.getDate() < birthDate.getDate())) {\r\n    age--\r\n  }\r\n\r\n  return age\r\n}\r\n"],"mappings":";AAGO,IAAM,mBAAN,cAA+B,MAAM;AAAA,EAC1C,YAAY,OAAgB;AAC1B,UAAM,iBAAiB,OAAO,KAAK,CAAC,EAAE;AACtC,SAAK,OAAO;AAAA,EACd;AACF;AAWA,IAAM,oBAAoB;AAAA,EACxB;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EACnC;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AACrC;AAEA,IAAM,mBAAmB;AAAA,EACvB;AAAA,EAAW;AAAA,EAAY;AAAA,EAAS;AAAA,EAAS;AAAA,EAAO;AAAA,EAChD;AAAA,EAAQ;AAAA,EAAU;AAAA,EAAa;AAAA,EAAW;AAAA,EAAY;AACxD;AAEA,IAAM,YAAoC;AAAA,EACxC,KAAK;AAAA,EAAG,SAAS;AAAA,EACjB,KAAK;AAAA,EAAG,UAAU;AAAA,EAClB,KAAK;AAAA,EAAG,OAAO;AAAA,EACf,KAAK;AAAA,EAAG,OAAO;AAAA,EACf,KAAK;AAAA,EACL,KAAK;AAAA,EAAG,MAAM;AAAA,EACd,KAAK;AAAA,EAAG,MAAM;AAAA,EACd,KAAK;AAAA,EAAG,QAAQ;AAAA,EAChB,KAAK;AAAA,EAAG,WAAW;AAAA,EACnB,KAAK;AAAA,EAAG,SAAS;AAAA,EACjB,KAAK;AAAA,EAAI,UAAU;AAAA,EACnB,KAAK;AAAA,EAAI,UAAU;AACrB;AAqBO,SAAS,WAAW,MAAY,SAAiB,cAAsB;AAC5E,QAAM,OAAO,KAAK,YAAY;AAC9B,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,MAAM,KAAK,QAAQ;AACzB,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,UAAU,KAAK,WAAW;AAChC,QAAM,UAAU,KAAK,WAAW;AAChC,QAAM,KAAK,KAAK,gBAAgB;AAEhC,QAAM,MAAM,CAAC,GAAW,MAAc,MAAc,OAAO,CAAC,EAAE,SAAS,KAAK,GAAG;AAE/E,SAAO,OACJ,QAAQ,SAAS,OAAO,IAAI,CAAC,EAC7B,QAAQ,OAAO,OAAO,IAAI,EAAE,MAAM,EAAE,CAAC,EACrC,QAAQ,SAAS,iBAAiB,KAAK,CAAE,EACzC,QAAQ,QAAQ,kBAAkB,KAAK,CAAE,EACzC,QAAQ,OAAO,IAAI,QAAQ,CAAC,CAAC,EAC7B,QAAQ,OAAO,IAAI,GAAG,CAAC,EACvB,QAAQ,OAAO,IAAI,KAAK,CAAC,EACzB,QAAQ,OAAO,IAAI,OAAO,CAAC,EAC3B,QAAQ,OAAO,IAAI,OAAO,CAAC,EAC3B,QAAQ,QAAQ,IAAI,IAAI,CAAC,CAAC;AAC/B;AAeO,SAAS,UAAU,OAAqC;AAC7D,MAAI,iBAAiB,MAAM;AACzB,QAAI,MAAM,MAAM,QAAQ,CAAC,EAAG,OAAM,IAAI,iBAAiB,KAAK;AAC5D,WAAO,IAAI,KAAK,MAAM,QAAQ,CAAC;AAAA,EACjC;AAEA,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,IAAI,IAAI,KAAK,KAAK;AACxB,QAAI,MAAM,EAAE,QAAQ,CAAC,EAAG,OAAM,IAAI,iBAAiB,KAAK;AACxD,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,MAAM,KAAK;AAG3B,QAAM,WAAW,QAAQ,MAAM,2FAA2F;AAC1H,MAAI,UAAU;AACZ,UAAM,IAAI,IAAI;AAAA,MACZ,SAAS,SAAS,CAAC,GAAI,EAAE;AAAA,MACzB,SAAS,SAAS,CAAC,GAAI,EAAE,IAAI;AAAA,MAC7B,SAAS,SAAS,CAAC,GAAI,EAAE;AAAA,MACzB,SAAS,CAAC,IAAI,SAAS,SAAS,CAAC,GAAI,EAAE,IAAI;AAAA,MAC3C,SAAS,CAAC,IAAI,SAAS,SAAS,CAAC,GAAI,EAAE,IAAI;AAAA,MAC3C,SAAS,CAAC,IAAI,SAAS,SAAS,CAAC,GAAI,EAAE,IAAI;AAAA,MAC3C,SAAS,CAAC,IAAI,SAAS,SAAS,CAAC,EAAG,OAAO,GAAG,GAAG,GAAG,EAAE,IAAI;AAAA,IAC5D;AACA,QAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAG,QAAO;AAAA,EAClC;AAGA,QAAM,WAAW,QAAQ,MAAM,uCAAuC;AACtE,MAAI,UAAU;AACZ,UAAM,IAAI,IAAI;AAAA,MACZ,SAAS,SAAS,CAAC,GAAI,EAAE;AAAA,MACzB,SAAS,SAAS,CAAC,GAAI,EAAE,IAAI;AAAA,MAC7B,SAAS,SAAS,CAAC,GAAI,EAAE;AAAA,IAC3B;AACA,QAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAG,QAAO;AAAA,EAClC;AAGA,QAAM,YAAY,QAAQ,MAAM,qCAAqC;AACrE,MAAI,WAAW;AACb,UAAM,aAAa,UAAU,UAAU,CAAC,EAAG,YAAY,CAAC;AACxD,QAAI,eAAe,QAAW;AAC5B,YAAM,IAAI,IAAI;AAAA,QACZ,SAAS,UAAU,CAAC,GAAI,EAAE;AAAA,QAC1B;AAAA,QACA,SAAS,UAAU,CAAC,GAAI,EAAE;AAAA,MAC5B;AACA,UAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAG,QAAO;AAAA,IAClC;AAAA,EACF;AAGA,QAAM,WAAW,QAAQ,MAAM,SAAS;AACxC,MAAI,UAAU;AACZ,UAAM,IAAI,IAAI,KAAK,SAAS,SAAS,CAAC,GAAG,EAAE,CAAC;AAC5C,QAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAG,QAAO;AAAA,EAClC;AAGA,QAAM,WAAW,IAAI,KAAK,OAAO;AACjC,MAAI,CAAC,MAAM,SAAS,QAAQ,CAAC,EAAG,QAAO;AAEvC,QAAM,IAAI,iBAAiB,KAAK;AAClC;AAEA,SAAS,YAAY,GAAkB;AACrC,SAAO,aAAa,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC;AAChD;AAEA,IAAM,eAAe;AACrB,IAAM,eAAe,KAAK;AAC1B,IAAM,aAAa,KAAK;AACxB,IAAM,YAAY,KAAK;AAUhB,SAAS,SAAS,OAAa,OAAuB;AAC3D,MAAI,CAAC,YAAY,KAAK,KAAK,CAAC,YAAY,KAAK,GAAG;AAC9C,UAAM,IAAI,iBAAiB,mCAAmC;AAAA,EAChE;AAEA,MAAI,QAAQ,MAAM,YAAY,IAAI,MAAM,YAAY;AACpD,MAAI,SAAS,MAAM,SAAS,IAAI,MAAM,SAAS;AAC/C,MAAI,OAAO,MAAM,QAAQ,IAAI,MAAM,QAAQ;AAE3C,MAAI,OAAO,GAAG;AACZ,cAAU;AACV,UAAM,YAAY,IAAI,KAAK,MAAM,YAAY,GAAG,MAAM,SAAS,GAAG,CAAC;AACnE,YAAQ,UAAU,QAAQ;AAAA,EAC5B;AAEA,MAAI,SAAS,GAAG;AACd,aAAS;AACT,cAAU;AAAA,EACZ;AAEA,QAAM,SAAS,KAAK,IAAI,MAAM,QAAQ,IAAI,MAAM,QAAQ,CAAC;AACzD,QAAM,eAAe,KAAK,MAAM,SAAS,YAAY;AACrD,QAAM,QAAQ,KAAK,MAAO,SAAS,YAAa,UAAU;AAC1D,QAAM,UAAU,KAAK,MAAO,SAAS,aAAc,YAAY;AAC/D,QAAM,UAAU,eAAe;AAE/B,SAAO,EAAE,OAAO,QAAQ,MAAM,OAAO,SAAS,QAAQ;AACxD;AAUO,SAAS,QAAQ,MAAY,MAAoB;AACtD,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,QAAM,SAAS,IAAI,KAAK,KAAK,QAAQ,CAAC;AACtC,SAAO,QAAQ,OAAO,QAAQ,IAAI,IAAI;AACtC,SAAO;AACT;AAWO,SAAS,UAAU,MAAY,QAAsB;AAC1D,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,QAAM,SAAS,IAAI,KAAK,KAAK,QAAQ,CAAC;AACtC,QAAM,cAAc,OAAO,SAAS,IAAI;AACxC,SAAO,SAAS,WAAW;AAE3B,MAAI,OAAO,SAAS,OAAQ,cAAc,KAAM,MAAM,IAAI;AACxD,WAAO,QAAQ,CAAC;AAAA,EAClB;AAEA,SAAO;AACT;AAWO,SAAS,SAAS,MAAY,OAAqB;AACxD,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,QAAM,SAAS,IAAI,KAAK,KAAK,QAAQ,CAAC;AACtC,QAAM,aAAa,OAAO,YAAY,IAAI;AAC1C,SAAO,YAAY,UAAU;AAE7B,MAAI,OAAO,YAAY,MAAM,YAAY;AACvC,WAAO,QAAQ,CAAC;AAAA,EAClB;AAEA,SAAO;AACT;AASO,SAAS,WAAW,MAAkB;AAC3C,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,SAAO,IAAI,KAAK,KAAK,YAAY,GAAG,KAAK,SAAS,GAAG,KAAK,QAAQ,GAAG,GAAG,GAAG,GAAG,CAAC;AACjF;AASO,SAAS,SAAS,MAAkB;AACzC,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,SAAO,IAAI,KAAK,KAAK,YAAY,GAAG,KAAK,SAAS,GAAG,KAAK,QAAQ,GAAG,IAAI,IAAI,IAAI,GAAG;AACtF;AASO,SAAS,aAAa,MAAkB;AAC7C,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,SAAO,IAAI,KAAK,KAAK,YAAY,GAAG,KAAK,SAAS,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AACpE;AASO,SAAS,WAAW,MAAkB;AAC3C,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,SAAO,IAAI,KAAK,KAAK,YAAY,GAAG,KAAK,SAAS,IAAI,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG;AAC7E;AASO,SAAS,YAAY,MAAkB;AAC5C,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,SAAO,IAAI,KAAK,KAAK,YAAY,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AACtD;AASO,SAAS,UAAU,MAAkB;AAC1C,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,SAAO,IAAI,KAAK,KAAK,YAAY,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG;AAC5D;AASO,SAAS,UAAU,MAAqB;AAC7C,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AACvD,QAAM,MAAM,KAAK,OAAO;AACxB,SAAO,QAAQ,KAAK,QAAQ;AAC9B;AAQO,SAAS,WAAW,MAAuB;AAChD,SAAQ,OAAO,MAAM,KAAK,OAAO,QAAQ,KAAM,OAAO,QAAQ;AAChE;AAUO,SAAS,SAAS,OAAa,OAAsB;AAC1D,MAAI,CAAC,YAAY,KAAK,KAAK,CAAC,YAAY,KAAK,GAAG;AAC9C,UAAM,IAAI,iBAAiB,mCAAmC;AAAA,EAChE;AACA,SAAO,MAAM,QAAQ,IAAI,MAAM,QAAQ;AACzC;AAUO,SAAS,QAAQ,OAAa,OAAsB;AACzD,MAAI,CAAC,YAAY,KAAK,KAAK,CAAC,YAAY,KAAK,GAAG;AAC9C,UAAM,IAAI,iBAAiB,kCAAkC;AAAA,EAC/D;AACA,SAAO,MAAM,QAAQ,IAAI,MAAM,QAAQ;AACzC;AAWO,SAAS,UAAU,MAAY,OAAa,KAAoB;AACrE,MAAI,CAAC,YAAY,IAAI,KAAK,CAAC,YAAY,KAAK,KAAK,CAAC,YAAY,GAAG,GAAG;AAClE,UAAM,IAAI,iBAAiB,oCAAoC;AAAA,EACjE;AACA,SAAO,KAAK,QAAQ,KAAK,MAAM,QAAQ,KAAK,KAAK,QAAQ,KAAK,IAAI,QAAQ;AAC5E;AAQO,SAAS,cAAc,MAAqB;AACjD,SAAO,YAAY,IAAI,KAAK,CAAC,UAAU,IAAI;AAC7C;AAUO,SAAS,gBAAgB,MAAY,MAAoB;AAC9D,MAAI,CAAC,YAAY,IAAI,EAAG,OAAM,IAAI,iBAAiB,IAAI;AAEvD,QAAM,SAAS,IAAI,KAAK,KAAK,QAAQ,CAAC;AACtC,MAAI,YAAY,KAAK,IAAI,IAAI;AAC7B,QAAM,OAAO,QAAQ,IAAI,IAAI;AAE7B,SAAO,YAAY,GAAG;AACpB,WAAO,QAAQ,OAAO,QAAQ,IAAI,IAAI;AACtC,UAAM,MAAM,OAAO,OAAO;AAC1B,QAAI,QAAQ,KAAK,QAAQ,GAAG;AAC1B;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AASO,SAAS,aAAa,WAAyB;AACpD,MAAI,CAAC,YAAY,SAAS,EAAG,OAAM,IAAI,iBAAiB,SAAS;AAEjE,QAAM,QAAQ,oBAAI,KAAK;AACvB,MAAI,MAAM,MAAM,YAAY,IAAI,UAAU,YAAY;AACtD,QAAM,YAAY,MAAM,SAAS,IAAI,UAAU,SAAS;AAExD,MAAI,YAAY,KAAM,cAAc,KAAK,MAAM,QAAQ,IAAI,UAAU,QAAQ,GAAI;AAC/E;AAAA,EACF;AAEA,SAAO;AACT;","names":[]}

package/dist/dep-exray/analyzer/index.d.ts

@@ -0,0 +1,7 @@
+declare function analyzeUsage(projectPath: string, packageName: string): Promise<{
+    isUsed: boolean;
+    importCount: number;
+    importLocations: string[];
+}>;
+
+export { analyzeUsage };

package/dist/dep-exray/analyzer/index.js

@@ -0,0 +1,68 @@
+// src/dep-exray/analyzer/index.ts
+import { readFileSync } from "fs";
+import { readdirSync, statSync } from "fs";
+import { join, extname } from "path";
+var SOURCE_EXTENSIONS = /* @__PURE__ */ new Set([".ts", ".tsx", ".js", ".jsx", ".mjs", ".cjs"]);
+function isSourceFile(file) {
+  return SOURCE_EXTENSIONS.has(extname(file));
+}
+function collectSourceFiles(dir) {
+  const results = [];
+  try {
+    const entries = readdirSync(dir, { withFileTypes: true });
+    for (const entry of entries) {
+      const fullPath = join(dir, entry.name);
+      if (entry.name === "node_modules" || entry.name === "dist" || entry.name === ".git" || entry.name === "coverage" || entry.name === ".tsup") {
+        continue;
+      }
+      if (entry.isDirectory()) {
+        results.push(...collectSourceFiles(fullPath));
+      } else if (entry.isFile() && isSourceFile(entry.name)) {
+        results.push(fullPath);
+      }
+    }
+  } catch {
+  }
+  return results;
+}
+function escapeRegex(str) {
+  return str.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+async function analyzeUsage(projectPath, packageName) {
+  const importLocations = [];
+  const escaped = escapeRegex(packageName);
+  const importRegex = new RegExp(
+    `(?:from\\s+['"]${escaped}(?:/['"]|['"])|require\\(\\s*['"]${escaped}(?:/|['"]))`,
+    "g"
+  );
+  const srcDir = join(projectPath, "src");
+  let files;
+  try {
+    if (statSync(srcDir).isDirectory()) {
+      files = collectSourceFiles(srcDir);
+    } else {
+      files = collectSourceFiles(projectPath);
+    }
+  } catch {
+    files = collectSourceFiles(projectPath);
+  }
+  for (const file of files) {
+    try {
+      const content = readFileSync(file, "utf-8");
+      importRegex.lastIndex = 0;
+      if (importRegex.test(content)) {
+        importLocations.push(file);
+      }
+    } catch {
+    }
+  }
+  return {
+    isUsed: importLocations.length > 0,
+    importCount: importLocations.length,
+    importLocations
+  };
+}
+export {
+  analyzeUsage
+};
+//# sourceMappingURL=index.js.map

package/dist/dep-exray/analyzer/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/dep-exray/analyzer/index.ts"],"sourcesContent":["import { readFileSync } from 'node:fs'\r\nimport { readdirSync, statSync } from 'node:fs'\r\nimport { join, extname } from 'node:path'\r\n\r\nconst SOURCE_EXTENSIONS = new Set(['.ts', '.tsx', '.js', '.jsx', '.mjs', '.cjs'])\r\n\r\nfunction isSourceFile(file: string): boolean {\r\n  return SOURCE_EXTENSIONS.has(extname(file))\r\n}\r\n\r\nfunction collectSourceFiles(dir: string): string[] {\r\n  const results: string[] = []\r\n  try {\r\n    const entries = readdirSync(dir, { withFileTypes: true })\r\n    for (const entry of entries) {\r\n      const fullPath = join(dir, entry.name)\r\n      if (entry.name === 'node_modules' || entry.name === 'dist' || entry.name === '.git' || entry.name === 'coverage' || entry.name === '.tsup') {\r\n        continue\r\n      }\r\n      if (entry.isDirectory()) {\r\n        results.push(...collectSourceFiles(fullPath))\r\n      } else if (entry.isFile() && isSourceFile(entry.name)) {\r\n        results.push(fullPath)\r\n      }\r\n    }\r\n  } catch {\r\n    // skip directories we can't read\r\n  }\r\n  return results\r\n}\r\n\r\nfunction escapeRegex(str: string): string {\r\n  return str.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&')\r\n}\r\n\r\nexport async function analyzeUsage(\r\n  projectPath: string,\r\n  packageName: string,\r\n): Promise<{\r\n  isUsed: boolean\r\n  importCount: number\r\n  importLocations: string[]\r\n}> {\r\n  const importLocations: string[] = []\r\n  const escaped = escapeRegex(packageName)\r\n  const importRegex = new RegExp(\r\n    `(?:from\\\\s+['\"]${escaped}(?:/['\"]|['\"])|require\\\\(\\\\s*['\"]${escaped}(?:/|['\"]))`,\r\n    'g',\r\n  )\r\n\r\n  const srcDir = join(projectPath, 'src')\r\n  let files: string[]\r\n  try {\r\n    if (statSync(srcDir).isDirectory()) {\r\n      files = collectSourceFiles(srcDir)\r\n    } else {\r\n      files = collectSourceFiles(projectPath)\r\n    }\r\n  } catch {\r\n    files = collectSourceFiles(projectPath)\r\n  }\r\n\r\n  for (const file of files) {\r\n    try {\r\n      const content = readFileSync(file, 'utf-8')\r\n      importRegex.lastIndex = 0\r\n      if (importRegex.test(content)) {\r\n        importLocations.push(file)\r\n      }\r\n    } catch {\r\n      // skip unreadable files\r\n    }\r\n  }\r\n\r\n  return {\r\n    isUsed: importLocations.length > 0,\r\n    importCount: importLocations.length,\r\n    importLocations,\r\n  }\r\n}\r\n"],"mappings":";AAAA,SAAS,oBAAoB;AAC7B,SAAS,aAAa,gBAAgB;AACtC,SAAS,MAAM,eAAe;AAE9B,IAAM,oBAAoB,oBAAI,IAAI,CAAC,OAAO,QAAQ,OAAO,QAAQ,QAAQ,MAAM,CAAC;AAEhF,SAAS,aAAa,MAAuB;AAC3C,SAAO,kBAAkB,IAAI,QAAQ,IAAI,CAAC;AAC5C;AAEA,SAAS,mBAAmB,KAAuB;AACjD,QAAM,UAAoB,CAAC;AAC3B,MAAI;AACF,UAAM,UAAU,YAAY,KAAK,EAAE,eAAe,KAAK,CAAC;AACxD,eAAW,SAAS,SAAS;AAC3B,YAAM,WAAW,KAAK,KAAK,MAAM,IAAI;AACrC,UAAI,MAAM,SAAS,kBAAkB,MAAM,SAAS,UAAU,MAAM,SAAS,UAAU,MAAM,SAAS,cAAc,MAAM,SAAS,SAAS;AAC1I;AAAA,MACF;AACA,UAAI,MAAM,YAAY,GAAG;AACvB,gBAAQ,KAAK,GAAG,mBAAmB,QAAQ,CAAC;AAAA,MAC9C,WAAW,MAAM,OAAO,KAAK,aAAa,MAAM,IAAI,GAAG;AACrD,gBAAQ,KAAK,QAAQ;AAAA,MACvB;AAAA,IACF;AAAA,EACF,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAEA,SAAS,YAAY,KAAqB;AACxC,SAAO,IAAI,QAAQ,uBAAuB,MAAM;AAClD;AAEA,eAAsB,aACpB,aACA,aAKC;AACD,QAAM,kBAA4B,CAAC;AACnC,QAAM,UAAU,YAAY,WAAW;AACvC,QAAM,cAAc,IAAI;AAAA,IACtB,kBAAkB,OAAO,oCAAoC,OAAO;AAAA,IACpE;AAAA,EACF;AAEA,QAAM,SAAS,KAAK,aAAa,KAAK;AACtC,MAAI;AACJ,MAAI;AACF,QAAI,SAAS,MAAM,EAAE,YAAY,GAAG;AAClC,cAAQ,mBAAmB,MAAM;AAAA,IACnC,OAAO;AACL,cAAQ,mBAAmB,WAAW;AAAA,IACxC;AAAA,EACF,QAAQ;AACN,YAAQ,mBAAmB,WAAW;AAAA,EACxC;AAEA,aAAW,QAAQ,OAAO;AACxB,QAAI;AACF,YAAM,UAAU,aAAa,MAAM,OAAO;AAC1C,kBAAY,YAAY;AACxB,UAAI,YAAY,KAAK,OAAO,GAAG;AAC7B,wBAAgB,KAAK,IAAI;AAAA,MAC3B;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO;AAAA,IACL,QAAQ,gBAAgB,SAAS;AAAA,IACjC,aAAa,gBAAgB;AAAA,IAC7B;AAAA,EACF;AACF;","names":[]}

package/dist/dep-exray/cli.d.ts

@@ -0,0 +1 @@
+#!/usr/bin/env node