superjs-core 0.2.0 → 0.3.1

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/core/index.ts","../src/math/index.ts","../src/date/index.ts","../src/crypto/index.ts","../src/path/index.ts","../src/collection/index.ts","../src/string/index.ts","../src/async/index.ts","../src/io/index.ts","../src/type/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","/**\n * Error thrown when attempting to divide by zero.\n */\nexport class DivisionByZeroError extends Error {\n  constructor() {\n    super('Division by zero')\n    this.name = 'DivisionByZeroError'\n  }\n}\n\nfunction getPrecision(value: number): number {\n  if (!isFinite(value)) return 0\n  const eIndex = String(value).indexOf('e')\n  if (eIndex > -1) {\n    const exp = parseInt(String(value).slice(eIndex + 1), 10)\n    if (exp < 0) return Math.abs(exp)\n    return 0\n  }\n  const str = String(value)\n  const dot = str.indexOf('.')\n  return dot === -1 ? 0 : str.length - dot - 1\n}\n\nfunction toPrecisionFactor(a: number, b: number): number {\n  return Math.pow(10, Math.max(getPrecision(a), getPrecision(b)))\n}\n\n/**\n * Safely adds two numbers, handling floating-point precision.\n *\n * @param a - First number.\n * @param b - Second number.\n * @returns The sum.\n */\nexport function add(a: number, b: number): number {\n  const factor = toPrecisionFactor(a, b)\n  return (Math.round(a * factor) + Math.round(b * factor)) / factor\n}\n\n/**\n * Safely subtracts two numbers, handling floating-point precision.\n *\n * @param a - First number.\n * @param b - Second number.\n * @returns The difference.\n */\nexport function sub(a: number, b: number): number {\n  const factor = toPrecisionFactor(a, b)\n  return (Math.round(a * factor) - Math.round(b * factor)) / factor\n}\n\n/**\n * Safely multiplies two numbers, handling floating-point precision.\n *\n * @param a - First number.\n * @param b - Second number.\n * @returns The product.\n */\nexport function mul(a: number, b: number): number {\n  const factorA = toPrecisionFactor(a, 1)\n  const factorB = toPrecisionFactor(1, b)\n  const result = (Math.round(a * factorA) * Math.round(b * factorB)) / (factorA * factorB)\n  return result\n}\n\n/**\n * Safely divides two numbers.\n *\n * @param a - The dividend.\n * @param b - The divisor.\n * @returns The quotient.\n * @throws {DivisionByZeroError} If `b` is zero.\n */\nexport function div(a: number, b: number): number {\n  if (b === 0) throw new DivisionByZeroError()\n  const factor = toPrecisionFactor(a, b)\n  return Math.round(a * factor) / Math.round(b * factor)\n}\n\n/**\n * Rounds a number to the given precision.\n *\n * @param value - The number to round.\n * @param precision - Number of decimal places (default 0).\n * @returns The rounded value.\n */\nexport function round(value: number, precision: number = 0): number {\n  const factor = Math.pow(10, precision)\n  return Math.round(value * factor) / factor\n}\n\n/**\n * Floors a number to the given precision.\n *\n * @param value - The number to floor.\n * @param precision - Number of decimal places (default 0).\n * @returns The floored value.\n */\nexport function floor(value: number, precision: number = 0): number {\n  const factor = Math.pow(10, precision)\n  return Math.floor(value * factor) / factor\n}\n\n/**\n * Ceils a number to the given precision.\n *\n * @param value - The number to ceil.\n * @param precision - Number of decimal places (default 0).\n * @returns The ceiled value.\n */\nexport function ceil(value: number, precision: number = 0): number {\n  const factor = Math.pow(10, precision)\n  return Math.ceil(value * factor) / factor\n}\n\n/**\n * Checks if two numbers are approximately equal within a tolerance.\n *\n * @param a - First number.\n * @param b - Second number.\n * @param tolerance - Maximum difference (default `Number.EPSILON`).\n * @returns Whether the numbers are approximately equal.\n */\nexport function approxEqual(a: number, b: number, tolerance: number = Number.EPSILON): boolean {\n  return Math.abs(a - b) <= tolerance\n}\n\n/**\n * Clamps a value within the inclusive range [min, max].\n *\n * @param value - The value to clamp.\n * @param min - The lower bound.\n * @param max - The upper bound.\n * @returns The clamped value.\n * @throws {RangeError} If `min` exceeds `max`.\n */\nexport function clamp(value: number, min: number, max: number): number {\n  if (min > max) {\n    throw new RangeError('Minimum value cannot exceed maximum value')\n  }\n  return Math.min(Math.max(value, min), max)\n}\n\n/**\n * Computes the sum of an array of numbers.\n *\n * @param values - Array of numbers.\n * @returns The total sum.\n */\nexport function sum(values: number[]): number {\n  let total = 0\n  for (let i = 0; i < values.length; i++) {\n    total += values[i]!\n  }\n  return total\n}\n\n/**\n * Computes the average (mean) of an array of numbers.\n *\n * @param values - Array of numbers.\n * @returns The average.\n * @throws {RangeError} If the array is empty.\n */\nexport function average(values: number[]): number {\n  if (values.length === 0) {\n    throw new RangeError('Cannot compute average of an empty array')\n  }\n  return sum(values) / values.length\n}\n\n/**\n * Generates a random integer between `min` and `max` (inclusive).\n *\n * @param min - The minimum integer.\n * @param max - The maximum integer.\n * @returns A random integer.\n * @throws {RangeError} If arguments are not integers or `min > max`.\n */\nexport function randomInt(min: number, max: number): number {\n  if (!Number.isInteger(min) || !Number.isInteger(max)) {\n    throw new RangeError('Arguments must be integers')\n  }\n  if (min > max) {\n    throw new RangeError('Minimum value cannot exceed maximum value')\n  }\n  return Math.floor(Math.random() * (max - min + 1)) + min\n}\n\n/**\n * Checks if a number is within the inclusive range [min, max].\n *\n * @param value - The number to check.\n * @param min - The lower bound.\n * @param max - The upper bound.\n * @returns Whether the value is in range.\n */\nexport function inRange(value: number, min: number, max: number): boolean {\n  return value >= min && value <= max\n}\n\n// ─── Trigonometry ────────────────────────────────────────────────────────────\n\n/**\n * Converts radians to degrees.\n *\n * @param radians - Angle in radians.\n * @returns Angle in degrees.\n */\nexport function toDegrees(radians: number): number {\n  return radians * (180 / Math.PI)\n}\n\n/**\n * Converts degrees to radians.\n *\n * @param degrees - Angle in degrees.\n * @returns Angle in radians.\n */\nexport function toRadians(degrees: number): number {\n  return degrees * (Math.PI / 180)\n}\n\n/**\n * Computes the sine of an angle.\n *\n * @param angle - The angle.\n * @param unit - Unit of the angle: `'rad'` (default) or `'deg'`.\n * @returns The sine value.\n */\nexport function sin(angle: number, unit: 'rad' | 'deg' = 'rad'): number {\n  const rad = unit === 'deg' ? toRadians(angle) : angle\n  return Math.sin(rad)\n}\n\n/**\n * Computes the cosine of an angle.\n *\n * @param angle - The angle.\n * @param unit - Unit of the angle: `'rad'` (default) or `'deg'`.\n * @returns The cosine value.\n */\nexport function cos(angle: number, unit: 'rad' | 'deg' = 'rad'): number {\n  const rad = unit === 'deg' ? toRadians(angle) : angle\n  return Math.cos(rad)\n}\n\n/**\n * Computes the tangent of an angle.\n *\n * @param angle - The angle.\n * @param unit - Unit of the angle: `'rad'` (default) or `'deg'`.\n * @returns The tangent value.\n */\nexport function tan(angle: number, unit: 'rad' | 'deg' = 'rad'): number {\n  const rad = unit === 'deg' ? toRadians(angle) : angle\n  return Math.tan(rad)\n}\n\n/**\n * Computes the arcsine (inverse sine) of a value.\n *\n * @param value - A number between -1 and 1.\n * @returns The angle in radians.\n * @throws {RangeError} If value is outside [-1, 1].\n */\nexport function asin(value: number): number {\n  if (value < -1 || value > 1) {\n    throw new RangeError('Input to asin must be between -1 and 1')\n  }\n  return Math.asin(value)\n}\n\n/**\n * Computes the arccosine (inverse cosine) of a value.\n *\n * @param value - A number between -1 and 1.\n * @returns The angle in radians.\n * @throws {RangeError} If value is outside [-1, 1].\n */\nexport function acos(value: number): number {\n  if (value < -1 || value > 1) {\n    throw new RangeError('Input to acos must be between -1 and 1')\n  }\n  return Math.acos(value)\n}\n\n/**\n * Computes the arctangent (inverse tangent) of a value.\n *\n * @param value - Any real number.\n * @returns The angle in radians.\n */\nexport function atan(value: number): number {\n  return Math.atan(value)\n}\n\n/**\n * Computes the angle whose tangent is the quotient of two numbers.\n *\n * @param y - The y-coordinate.\n * @param x - The x-coordinate.\n * @returns The angle in radians from the positive x-axis.\n */\nexport function atan2(y: number, x: number): number {\n  return Math.atan2(y, x)\n}\n\n/**\n * Computes the square root of the sum of squares of the arguments (hypotenuse).\n *\n * @param values - Variable number of values.\n * @returns The hypotenuse.\n */\nexport function hypot(...values: number[]): number {\n  return Math.hypot(...values)\n}\n\n// ─── Statistics ──────────────────────────────────────────────────────────────\n\n/**\n * Computes the median of a numeric array.\n *\n * @param values - Array of numbers.\n * @returns The median value.\n * @throws {RangeError} If the array is empty.\n */\nexport function median(values: number[]): number {\n  if (values.length === 0) {\n    throw new RangeError('Cannot compute median of an empty array')\n  }\n  const sorted = [...values].sort((a, b) => a - b)\n  const mid = Math.floor(sorted.length / 2)\n  if (sorted.length % 2 === 0) {\n    return (sorted[mid - 1]! + sorted[mid]!) / 2\n  }\n  return sorted[mid]!\n}\n\n/**\n * Computes the mode(s) of a numeric array.\n *\n * @param values - Array of numbers.\n * @returns Array of mode values (may be multiple).\n * @throws {RangeError} If the array is empty.\n */\nexport function mode(values: number[]): number[] {\n  if (values.length === 0) {\n    throw new RangeError('Cannot compute mode of an empty array')\n  }\n  const freq = new Map<number, number>()\n  let maxFreq = 0\n  for (const v of values) {\n    const f = (freq.get(v) ?? 0) + 1\n    freq.set(v, f)\n    if (f > maxFreq) maxFreq = f\n  }\n  if (maxFreq === 1) return []\n  return Array.from(freq.entries())\n    .filter(([, f]) => f === maxFreq)\n    .map(([v]) => v)\n    .sort((a, b) => a - b)\n}\n\n/**\n * Computes the p-th percentile of a numeric array.\n *\n * @param values - Array of numbers.\n * @param p - Percentile between 0 and 100.\n * @returns The percentile value.\n * @throws {RangeError} If array is empty or p is out of range.\n */\nexport function percentile(values: number[], p: number): number {\n  if (values.length === 0) {\n    throw new RangeError('Cannot compute percentile of an empty array')\n  }\n  if (p < 0 || p > 100) {\n    throw new RangeError('Percentile must be between 0 and 100')\n  }\n  const sorted = [...values].sort((a, b) => a - b)\n  const index = (p / 100) * (sorted.length - 1)\n  const lower = Math.floor(index)\n  const upper = Math.ceil(index)\n  if (lower === upper) return sorted[lower]!\n  return sorted[lower]! + (sorted[upper]! - sorted[lower]!) * (index - lower)\n}\n\n/**\n * Computes the quartiles (Q1, Q2, Q3) of a numeric array.\n *\n * @param values - Array of numbers.\n * @returns An object with q1, q2, q3.\n * @throws {RangeError} If the array is empty.\n */\nexport function quartiles(values: number[]): { q1: number; q2: number; q3: number } {\n  if (values.length === 0) {\n    throw new RangeError('Cannot compute quartiles of an empty array')\n  }\n  const sorted = [...values].sort((a, b) => a - b)\n  if (sorted.length === 1) {\n    return { q1: sorted[0]!, q2: sorted[0]!, q3: sorted[0]! }\n  }\n  const q2 = median(sorted)\n  const mid = Math.floor(sorted.length / 2)\n  const lowerHalf = sorted.slice(0, mid)\n  const upperHalf = sorted.length % 2 === 0\n    ? sorted.slice(mid)\n    : sorted.slice(mid + 1)\n  return {\n    q1: median(lowerHalf),\n    q2,\n    q3: median(upperHalf),\n  }\n}\n\n/**\n * Computes the variance of a numeric array.\n *\n * @param values - Array of numbers.\n * @param sample - If true, use sample variance (n-1). Default false.\n * @returns The variance.\n * @throws {RangeError} If array has fewer than 2 elements for sample variance.\n */\nexport function variance(values: number[], sample: boolean = false): number {\n  if (values.length === 0) {\n    throw new RangeError('Cannot compute variance of an empty array')\n  }\n  if (sample && values.length < 2) {\n    throw new RangeError('Sample variance requires at least 2 values')\n  }\n  const mean = average(values)\n  const sqDiffs = values.map(v => (v - mean) ** 2)\n  const divisor = sample ? values.length - 1 : values.length\n  return sum(sqDiffs) / divisor\n}\n\n/**\n * Computes the standard deviation of a numeric array.\n *\n * @param values - Array of numbers.\n * @param sample - If true, use sample standard deviation (n-1). Default false.\n * @returns The standard deviation.\n */\nexport function stddev(values: number[], sample: boolean = false): number {\n  return Math.sqrt(variance(values, sample))\n}\n\n/**\n * Computes the covariance between two numeric arrays.\n *\n * @param x - First array.\n * @param y - Second array.\n * @returns The covariance.\n * @throws {RangeError} If arrays have different lengths or fewer than 2 elements.\n */\nexport function covariance(x: number[], y: number[]): number {\n  if (x.length !== y.length) {\n    throw new RangeError('Arrays must have the same length')\n  }\n  if (x.length < 2) {\n    throw new RangeError('Covariance requires at least 2 values')\n  }\n  const meanX = average(x)\n  const meanY = average(y)\n  let total = 0\n  for (let i = 0; i < x.length; i++) {\n    total += (x[i]! - meanX) * (y[i]! - meanY)\n  }\n  return total / (x.length - 1)\n}\n\n/**\n * Computes the Pearson correlation coefficient between two arrays.\n *\n * @param x - First array.\n * @param y - Second array.\n * @returns The correlation coefficient between -1 and 1.\n */\nexport function correlation(x: number[], y: number[]): number {\n  const cov = covariance(x, y)\n  const stdX = stddev(x, true)\n  const stdY = stddev(y, true)\n  if (stdX === 0 || stdY === 0) return 0\n  return cov / (stdX * stdY)\n}\n\n/**\n * Computes the sample skewness of a numeric array.\n *\n * @param values - Array of numbers.\n * @returns The skewness.\n */\nexport function skewness(values: number[]): number {\n  if (values.length < 3) {\n    throw new RangeError('Skewness requires at least 3 values')\n  }\n  const mean = average(values)\n  const n = values.length\n  const m2 = sum(values.map(v => (v - mean) ** 2)) / n\n  const m3 = sum(values.map(v => (v - mean) ** 3)) / n\n  if (m2 === 0) return 0\n  return (m3 / Math.pow(m2, 1.5)) * Math.sqrt(n * (n - 1)) / (n - 2)\n}\n\n/**\n * Computes the excess kurtosis of a numeric array.\n *\n * @param values - Array of numbers.\n * @returns The excess kurtosis (kurtosis - 3).\n */\nexport function kurtosis(values: number[]): number {\n  if (values.length < 4) {\n    throw new RangeError('Kurtosis requires at least 4 values')\n  }\n  const mean = average(values)\n  const n = values.length\n  const m2 = sum(values.map(v => (v - mean) ** 2)) / n\n  const m4 = sum(values.map(v => (v - mean) ** 4)) / n\n  if (m2 === 0) return 0\n  const kurt = m4 / (m2 * m2)\n  const adjustment = ((n - 1) * (n + 1)) / ((n - 2) * (n - 3))\n  return adjustment * (kurt - 3 * (n - 1) / (n + 1))\n}\n\n/**\n * Computes the weighted mean of values with given weights.\n *\n * @param values - Array of numbers.\n * @param weights - Array of weights.\n * @returns The weighted mean.\n * @throws {RangeError} If arrays differ in length or weights sum to zero.\n */\nexport function weightedMean(values: number[], weights: number[]): number {\n  if (values.length !== weights.length) {\n    throw new RangeError('Values and weights must have the same length')\n  }\n  if (values.length === 0) {\n    throw new RangeError('Cannot compute weighted mean of empty arrays')\n  }\n  const totalWeight = sum(weights)\n  if (totalWeight === 0) {\n    throw new RangeError('Sum of weights cannot be zero')\n  }\n  let total = 0\n  for (let i = 0; i < values.length; i++) {\n    total += values[i]! * weights[i]!\n  }\n  return total / totalWeight\n}\n\n/**\n * Computes the geometric mean of a numeric array.\n *\n * @param values - Array of positive numbers.\n * @returns The geometric mean.\n * @throws {RangeError} If array is empty or contains non-positive values.\n */\nexport function geometricMean(values: number[]): number {\n  if (values.length === 0) {\n    throw new RangeError('Cannot compute geometric mean of an empty array')\n  }\n  if (values.some(v => v <= 0)) {\n    throw new RangeError('Geometric mean requires positive values only')\n  }\n  const logSum = sum(values.map(v => Math.log(v)))\n  return Math.exp(logSum / values.length)\n}\n\n/**\n * Computes the harmonic mean of a numeric array.\n *\n * @param values - Array of positive numbers.\n * @returns The harmonic mean.\n * @throws {RangeError} If array is empty or contains non-positive values.\n */\nexport function harmonicMean(values: number[]): number {\n  if (values.length === 0) {\n    throw new RangeError('Cannot compute harmonic mean of an empty array')\n  }\n  if (values.some(v => v <= 0)) {\n    throw new RangeError('Harmonic mean requires positive values only')\n  }\n  const reciprocalSum = sum(values.map(v => 1 / v))\n  return values.length / reciprocalSum\n}\n\n/**\n * Computes the z-score of a value relative to a distribution.\n *\n * @param value - The value to standardize.\n * @param mean - The mean of the distribution.\n * @param stddev - The standard deviation of the distribution.\n * @returns The z-score.\n */\nexport function zScore(value: number, mean: number, stddev: number): number {\n  if (stddev === 0) return 0\n  return (value - mean) / stddev\n}\n\n/**\n * Normalizes an array to [0, 1] range using min-max scaling.\n *\n * @param values - Array of numbers.\n * @returns The normalized array.\n */\nexport function normalize(values: number[]): number[] {\n  if (values.length === 0) return []\n  const min = Math.min(...values)\n  const max = Math.max(...values)\n  if (max === min) return values.map(() => 0)\n  return values.map(v => (v - min) / (max - min))\n}\n\n/**\n * Standardizes an array to have mean 0 and standard deviation 1 (z-scores).\n *\n * @param values - Array of numbers.\n * @returns The standardized array.\n */\nexport function standardize(values: number[]): number[] {\n  if (values.length === 0) return []\n  const mean = average(values)\n  const sd = stddev(values, true)\n  if (sd === 0) return values.map(() => 0)\n  return values.map(v => (v - mean) / sd)\n}\n\n// ─── Combinatorics & Number Theory ───────────────────────────────────────────\n\n/**\n * Computes the factorial of a non-negative integer.\n *\n * @param n - Non-negative integer.\n * @returns n!.\n * @throws {RangeError} If n is negative or not an integer.\n */\nexport function factorial(n: number): number {\n  if (!Number.isInteger(n) || n < 0) {\n    throw new RangeError('Factorial requires a non-negative integer')\n  }\n  if (n === 0 || n === 1) return 1\n  let result = 1\n  for (let i = 2; i <= n; i++) {\n    result *= i\n  }\n  return result\n}\n\n/**\n * Computes the binomial coefficient \"n choose k\".\n *\n * @param n - Total number of items.\n * @param k - Number of items to choose.\n * @returns The binomial coefficient.\n * @throws {RangeError} If n < k or arguments are not non-negative integers.\n */\nexport function binomial(n: number, k: number): number {\n  if (!Number.isInteger(n) || !Number.isInteger(k) || n < 0 || k < 0) {\n    throw new RangeError('Binomial requires non-negative integers')\n  }\n  if (k > n) {\n    throw new RangeError('k cannot be greater than n')\n  }\n  if (k === 0 || k === n) return 1\n  if (k > n - k) return binomial(n, n - k)\n  let result = 1\n  for (let i = 1; i <= k; i++) {\n    result = (result * (n - k + i)) / i\n  }\n  return result\n}\n\n/**\n * Computes the number of permutations \"n P k\".\n *\n * @param n - Total number of items.\n * @param k - Number of items to arrange.\n * @returns The number of permutations.\n * @throws {RangeError} If n < k or arguments are not non-negative integers.\n */\nexport function permutation(n: number, k: number): number {\n  if (!Number.isInteger(n) || !Number.isInteger(k) || n < 0 || k < 0) {\n    throw new RangeError('Permutation requires non-negative integers')\n  }\n  if (k > n) {\n    throw new RangeError('k cannot be greater than n')\n  }\n  let result = 1\n  for (let i = n; i > n - k; i--) {\n    result *= i\n  }\n  return result\n}\n\n/**\n * Computes the greatest common divisor of two or more numbers.\n *\n * @param values - Two or more integers.\n * @returns The GCD.\n * @throws {RangeError} If fewer than 2 values are provided.\n */\nexport function gcd(...values: number[]): number {\n  if (values.length < 2) {\n    throw new RangeError('GCD requires at least 2 values')\n  }\n  const gcd2 = (a: number, b: number): number => {\n    a = Math.abs(a)\n    b = Math.abs(b)\n    while (b !== 0) {\n      const t = b\n      b = a % b\n      a = t\n    }\n    return a\n  }\n  return values.reduce((a, b) => gcd2(a, b))\n}\n\n/**\n * Computes the least common multiple of two or more numbers.\n *\n * @param values - Two or more integers.\n * @returns The LCM.\n * @throws {RangeError} If fewer than 2 values are provided.\n */\nexport function lcm(...values: number[]): number {\n  if (values.length < 2) {\n    throw new RangeError('LCM requires at least 2 values')\n  }\n  const lcm2 = (a: number, b: number): number => {\n    if (a === 0 || b === 0) return 0\n    return Math.abs(a * b) / gcd(a, b)\n  }\n  return values.reduce((a, b) => lcm2(a, b))\n}\n\n/**\n * Checks if a number is prime.\n *\n * @param n - Integer to check.\n * @returns True if prime.\n */\nexport function isPrime(n: number): boolean {\n  if (!Number.isInteger(n) || n < 2) return false\n  if (n === 2) return true\n  if (n % 2 === 0) return false\n  const sqrt = Math.sqrt(n)\n  for (let i = 3; i <= sqrt; i += 2) {\n    if (n % i === 0) return false\n  }\n  return true\n}\n\n/**\n * Computes the prime factors of a number.\n *\n * @param n - Integer greater than 1.\n * @returns Array of prime factors.\n * @throws {RangeError} If n is less than 2.\n */\nexport function primeFactors(n: number): number[] {\n  if (!Number.isInteger(n) || n < 2) {\n    throw new RangeError('Prime factors require an integer greater than 1')\n  }\n  const factors: number[] = []\n  let num = n\n  while (num % 2 === 0) {\n    factors.push(2)\n    num /= 2\n  }\n  for (let i = 3; i <= Math.sqrt(num); i += 2) {\n    while (num % i === 0) {\n      factors.push(i)\n      num /= i\n    }\n  }\n  if (num > 1) factors.push(num)\n  return factors\n}\n\n/**\n * Computes the n-th Fibonacci number.\n *\n * @param n - Non-negative integer (0-indexed: F(0)=0, F(1)=1).\n * @returns The n-th Fibonacci number.\n * @throws {RangeError} If n is negative or not an integer.\n */\nexport function fibonacci(n: number): number {\n  if (!Number.isInteger(n) || n < 0) {\n    throw new RangeError('Fibonacci requires a non-negative integer')\n  }\n  if (n === 0) return 0\n  if (n === 1) return 1\n  let a = 0\n  let b = 1\n  for (let i = 2; i <= n; i++) {\n    const temp = a + b\n    a = b\n    b = temp\n  }\n  return b\n}\n\n/**\n * Checks if a number is even.\n *\n * @param n - The number to check.\n * @returns True if even.\n */\nexport function isEven(n: number): boolean {\n  return n % 2 === 0\n}\n\n/**\n * Checks if a number is odd.\n *\n * @param n - The number to check.\n * @returns True if odd.\n */\nexport function isOdd(n: number): boolean {\n  return n % 2 !== 0\n}\n\n/**\n * Returns the sign of a number.\n *\n * @param n - The number.\n * @returns -1 if negative, 1 if positive, 0 if zero.\n */\nexport function sign(n: number): number {\n  if (n > 0) return 1\n  if (n < 0) return -1\n  return 0\n}\n\n// ─── Matrix Operations ───────────────────────────────────────────────────────\n\n/**\n * Represents a 2D matrix.\n */\nexport type Matrix = number[][]\n\nfunction validateMatrix(a: Matrix): void {\n  if (a.length === 0) throw new RangeError('Matrix cannot be empty')\n  const cols = a[0]!.length\n  if (cols === 0) throw new RangeError('Matrix rows cannot be empty')\n  if (a.some(row => row.length !== cols)) {\n    throw new RangeError('All rows must have the same length')\n  }\n}\n\n/**\n * Adds two matrices element-wise.\n *\n * @param a - First matrix.\n * @param b - Second matrix.\n * @returns The sum matrix.\n */\nexport function matrixAdd(a: Matrix, b: Matrix): Matrix {\n  if (a.length !== b.length || a[0]!.length !== b[0]!.length) {\n    throw new RangeError('Matrices must have same dimensions for addition')\n  }\n  validateMatrix(a)\n  return a.map((row, i) => row.map((val, j) => val + b[i]![j]!))\n}\n\n/**\n * Subtracts two matrices element-wise.\n *\n * @param a - First matrix.\n * @param b - Second matrix.\n * @returns The difference matrix.\n */\nexport function matrixSub(a: Matrix, b: Matrix): Matrix {\n  if (a.length !== b.length || a[0]!.length !== b[0]!.length) {\n    throw new RangeError('Matrices must have same dimensions for subtraction')\n  }\n  validateMatrix(a)\n  return a.map((row, i) => row.map((val, j) => val - b[i]![j]!))\n}\n\n/**\n * Multiplies two matrices element-wise (Hadamard product).\n *\n * @param a - First matrix.\n * @param b - Second matrix.\n * @returns The element-wise product matrix.\n */\nexport function matrixMul(a: Matrix, b: Matrix): Matrix {\n  if (a.length !== b.length || a[0]!.length !== b[0]!.length) {\n    throw new RangeError('Matrices must have same dimensions for element-wise multiplication')\n  }\n  validateMatrix(a)\n  return a.map((row, i) => row.map((val, j) => val * b[i]![j]!))\n}\n\n/**\n * Multiplies a matrix by a scalar.\n *\n * @param a - The matrix.\n * @param scalar - The scalar value.\n * @returns The scaled matrix.\n */\nexport function matrixScale(a: Matrix, scalar: number): Matrix {\n  validateMatrix(a)\n  return a.map(row => row.map(val => val * scalar))\n}\n\n/**\n * Transposes a matrix (rows become columns).\n *\n * @param a - The matrix.\n * @returns The transposed matrix.\n */\nexport function matrixTranspose(a: Matrix): Matrix {\n  if (a.length === 0) return []\n  validateMatrix(a)\n  return a[0]!.map((_, j) => a.map(row => row[j]!))\n}\n\n/**\n * Computes the determinant of a square matrix (max 3x3).\n *\n * @param a - The square matrix.\n * @returns The determinant.\n */\nexport function matrixDeterminant(a: Matrix): number {\n  validateMatrix(a)\n  const n = a.length\n  if (a.some(row => row.length !== n)) {\n    throw new RangeError('Matrix must be square for determinant')\n  }\n  if (n > 3) {\n    throw new RangeError('Determinant only supported for max 3x3 matrices')\n  }\n  if (n === 1) return a[0]![0]!\n  if (n === 2) return a[0]![0]! * a[1]![1]! - a[0]![1]! * a[1]![0]!\n  const [a00, a01, a02] = a[0]!\n  const [a10, a11, a12] = a[1]!\n  const [a20, a21, a22] = a[2]!\n  return a00! * (a11! * a22! - a12! * a21!)\n       - a01! * (a10! * a22! - a12! * a20!)\n       + a02! * (a10! * a21! - a11! * a20!)\n}\n\n/**\n * Computes the inverse of a square matrix (max 3x3).\n *\n * @param a - The square matrix.\n * @returns The inverse matrix.\n */\nexport function matrixInverse(a: Matrix): Matrix {\n  const det = matrixDeterminant(a)\n  if (det === 0) throw new RangeError('Matrix is singular and cannot be inverted')\n  const n = a.length\n  if (n === 1) return [[1 / a[0]![0]!]]\n  if (n === 2) {\n    return [\n      [a[1]![1]! / det, -a[0]![1]! / det],\n      [-a[1]![0]! / det, a[0]![0]! / det],\n    ]\n  }\n  const [a00, a01, a02] = a[0]!\n  const [a10, a11, a12] = a[1]!\n  const [a20, a21, a22] = a[2]!\n  return [\n    [(a11! * a22! - a12! * a21!) / det, -(a01! * a22! - a02! * a21!) / det, (a01! * a12! - a02! * a11!) / det],\n    [-(a10! * a22! - a12! * a20!) / det, (a00! * a22! - a02! * a20!) / det, -(a00! * a12! - a02! * a10!) / det],\n    [(a10! * a21! - a11! * a20!) / det, -(a00! * a21! - a01! * a20!) / det, (a00! * a11! - a01! * a10!) / det],\n  ]\n}\n\n/**\n * Creates an n x n identity matrix.\n *\n * @param n - The size of the matrix.\n * @returns The identity matrix.\n */\nexport function matrixIdentity(n: number): Matrix {\n  if (!Number.isInteger(n) || n < 1) {\n    throw new RangeError('Matrix size must be a positive integer')\n  }\n  return Array.from({ length: n }, (_, i) =>\n    Array.from({ length: n }, (_, j) => (i === j ? 1 : 0))\n  )\n}\n\n/**\n * Multiplies two matrices using standard matrix multiplication (dot product).\n *\n * @param a - First matrix.\n * @param b - Second matrix.\n * @returns The product matrix.\n */\nexport function matrixMultiply(a: Matrix, b: Matrix): Matrix {\n  validateMatrix(a)\n  validateMatrix(b)\n  if (a[0]!.length !== b.length) {\n    throw new RangeError('Matrix dimensions incompatible for multiplication')\n  }\n  const result: Matrix = Array.from({ length: a.length }, () =>\n    Array(b[0]!.length).fill(0)\n  )\n  for (let i = 0; i < a.length; i++) {\n    for (let j = 0; j < b[0]!.length; j++) {\n      for (let k = 0; k < b.length; k++) {\n        result[i]![j] = (result[i]![j] ?? 0) + (a[i]![k] ?? 0) * (b[k]![j] ?? 0)\n      }\n    }\n  }\n  return result\n}\n\n/**\n * Computes the trace of a square matrix.\n *\n * @param a - The square matrix.\n * @returns The trace (sum of diagonal elements).\n */\nexport function matrixTrace(a: Matrix): number {\n  validateMatrix(a)\n  const n = a.length\n  if (a.some(row => row.length !== n)) {\n    throw new RangeError('Matrix must be square for trace')\n  }\n  let trace = 0\n  for (let i = 0; i < n; i++) {\n    trace += a[i]![i]!\n  }\n  return trace\n}\n\n// ─── Complex Numbers ─────────────────────────────────────────────────────────\n\n/**\n * Represents a complex number with real and imaginary parts.\n */\nexport class Complex {\n  constructor(\n    /** The real part. */\n    public re: number,\n    /** The imaginary part. */\n    public im: number = 0,\n  ) {}\n\n  /**\n   * Adds another complex number.\n   *\n   * @param other - The complex number to add.\n   * @returns A new Complex instance.\n   */\n  add(other: Complex): Complex {\n    return new Complex(this.re + other.re, this.im + other.im)\n  }\n\n  /**\n   * Subtracts another complex number.\n   *\n   * @param other - The complex number to subtract.\n   * @returns A new Complex instance.\n   */\n  sub(other: Complex): Complex {\n    return new Complex(this.re - other.re, this.im - other.im)\n  }\n\n  /**\n   * Multiplies by another complex number.\n   *\n   * @param other - The complex number to multiply by.\n   * @returns A new Complex instance.\n   */\n  mul(other: Complex): Complex {\n    return new Complex(\n      this.re * other.re - this.im * other.im,\n      this.re * other.im + this.im * other.re,\n    )\n  }\n\n  /**\n   * Divides by another complex number.\n   *\n   * @param other - The complex number to divide by.\n   * @returns A new Complex instance.\n   * @throws {DivisionByZeroError} If the divisor is zero.\n   */\n  div(other: Complex): Complex {\n    const denom = other.re * other.re + other.im * other.im\n    if (denom === 0) throw new DivisionByZeroError()\n    return new Complex(\n      (this.re * other.re + this.im * other.im) / denom,\n      (this.im * other.re - this.re * other.im) / denom,\n    )\n  }\n\n  /**\n   * Computes the magnitude (absolute value) of the complex number.\n   *\n   * @returns The magnitude.\n   */\n  abs(): number {\n    return Math.sqrt(this.re * this.re + this.im * this.im)\n  }\n\n  /**\n   * Computes the complex conjugate.\n   *\n   * @returns A new Complex instance with negated imaginary part.\n   */\n  conj(): Complex {\n    return new Complex(this.re, this.im === 0 ? 0 : -this.im)\n  }\n\n  /**\n   * Computes the argument (phase angle) in radians.\n   *\n   * @returns The phase angle.\n   */\n  arg(): number {\n    return Math.atan2(this.im, this.re)\n  }\n\n  /**\n   * Raises the complex number to a real power.\n   *\n   * @param n - The exponent.\n   * @returns A new Complex instance.\n   */\n  pow(n: number): Complex {\n    const r = this.abs()\n    const theta = this.arg()\n    return Complex.fromPolar(Math.pow(r, n), theta * n)\n  }\n\n  /**\n   * Computes the square root of the complex number.\n   *\n   * @returns A new Complex instance.\n   */\n  sqrt(): Complex {\n    const r = this.abs()\n    const theta = this.arg()\n    return Complex.fromPolar(Math.sqrt(r), theta / 2)\n  }\n\n  /**\n   * Computes e raised to this complex number.\n   *\n   * @returns A new Complex instance.\n   */\n  exp(): Complex {\n    return new Complex(\n      Math.exp(this.re) * Math.cos(this.im),\n      Math.exp(this.re) * Math.sin(this.im),\n    )\n  }\n\n  /**\n   * Computes the natural logarithm of the complex number.\n   *\n   * @returns A new Complex instance.\n   */\n  log(): Complex {\n    return new Complex(Math.log(this.abs()), this.arg())\n  }\n\n  /**\n   * Computes the sine of the complex number.\n   *\n   * @returns A new Complex instance.\n   */\n  sin(): Complex {\n    return new Complex(\n      Math.sin(this.re) * Math.cosh(this.im),\n      Math.cos(this.re) * Math.sinh(this.im),\n    )\n  }\n\n  /**\n   * Computes the cosine of the complex number.\n   *\n   * @returns A new Complex instance.\n   */\n  cos(): Complex {\n    return new Complex(\n      Math.cos(this.re) * Math.cosh(this.im),\n      -Math.sin(this.re) * Math.sinh(this.im),\n    )\n  }\n\n  /**\n   * Returns a string representation of the complex number.\n   *\n   * @returns String like \"a + bi\".\n   */\n  toString(): string {\n    if (this.im === 0) return `${this.re}`\n    if (this.re === 0) return `${this.im}i`\n    if (this.im < 0) return `${this.re} - ${Math.abs(this.im)}i`\n    return `${this.re} + ${this.im}i`\n  }\n\n  /**\n   * Creates a complex number from polar coordinates.\n   *\n   * @param r - The magnitude.\n   * @param theta - The angle in radians.\n   * @returns A new Complex instance.\n   */\n  static fromPolar(r: number, theta: number): Complex {\n    return new Complex(r * Math.cos(theta), r * Math.sin(theta))\n  }\n\n  /** The real part. */\n  get real(): number {\n    return this.re\n  }\n\n  /** The imaginary part. */\n  get imag(): number {\n    return this.im\n  }\n}\n\n// ─── Financial Math ──────────────────────────────────────────────────────────\n\n/**\n * Computes compound interest.\n *\n * @param principal - Initial amount.\n * @param rate - Annual interest rate (decimal, e.g. 0.05 for 5%).\n * @param time - Time in years.\n * @param n - Number of compounding periods per year (default 12).\n * @returns The future value including interest.\n */\nexport function compoundInterest(principal: number, rate: number, time: number, n: number = 12): number {\n  return principal * Math.pow(1 + rate / n, n * time)\n}\n\n/**\n * Computes the future value of a present sum.\n *\n * @param pv - Present value.\n * @param rate - Periodic interest rate.\n * @param nper - Number of periods.\n * @returns Future value.\n */\nexport function futureValue(pv: number, rate: number, nper: number): number {\n  return pv * Math.pow(1 + rate, nper)\n}\n\n/**\n * Computes the present value of a future sum.\n *\n * @param fv - Future value.\n * @param rate - Periodic interest rate.\n * @param nper - Number of periods.\n * @returns Present value.\n */\nexport function presentValue(fv: number, rate: number, nper: number): number {\n  return fv / Math.pow(1 + rate, nper)\n}\n\n/**\n * Computes the periodic payment for a loan (PMT).\n *\n * @param rate - Periodic interest rate.\n * @param nper - Total number of payments.\n * @param pv - Present value (loan amount).\n * @param fv - Future value (default 0).\n * @returns The periodic payment amount.\n */\nexport function pmt(rate: number, nper: number, pv: number, fv: number = 0): number {\n  if (rate === 0) return -(pv + fv) / nper\n  const pvif = Math.pow(1 + rate, nper)\n  return -(pv * pvif + fv) / ((pvif - 1) / rate)\n}\n\n/**\n * Computes the net present value (NPV) of cashflows.\n *\n * @param rate - Discount rate per period.\n * @param cashflows - Array of cashflow values (negative for outflows).\n * @returns The net present value.\n */\nexport function npv(rate: number, cashflows: number[]): number {\n  if (cashflows.length === 0) return 0\n  let result = 0\n  for (let i = 0; i < cashflows.length; i++) {\n    result += cashflows[i]! / Math.pow(1 + rate, i)\n  }\n  return result\n}\n\n/**\n * Computes the internal rate of return (IRR) of cashflows using Newton's method.\n *\n * @param cashflows - Array of cashflow values.\n * @returns The IRR as a decimal.\n */\nexport function irr(cashflows: number[]): number {\n  if (cashflows.length < 2) {\n    throw new RangeError('IRR requires at least 2 cashflows')\n  }\n  let guess = 0.1\n  const tolerance = 1e-7\n  const maxIter = 1000\n  for (let i = 0; i < maxIter; i++) {\n    let npvVal = 0\n    let dnpv = 0\n    for (let j = 0; j < cashflows.length; j++) {\n      npvVal += cashflows[j]! / Math.pow(1 + guess, j)\n      dnpv -= j * cashflows[j]! / Math.pow(1 + guess, j + 1)\n    }\n    if (Math.abs(npvVal) < tolerance) return guess\n    if (dnpv === 0) return NaN\n    guess -= npvVal / dnpv\n  }\n  return NaN\n}\n\n/**\n * Computes the return on investment (ROI).\n *\n * @param gain - The gain from the investment.\n * @param cost - The cost of the investment.\n * @returns The ROI as a decimal.\n */\nexport function roi(gain: number, cost: number): number {\n  if (cost === 0) throw new RangeError('Cost cannot be zero')\n  return (gain - cost) / cost\n}\n\n/**\n * Generates an amortization schedule for a loan.\n *\n * @param principal - Loan amount.\n * @param rate - Periodic interest rate.\n * @param nper - Total number of payments.\n * @returns Array of period details.\n */\nexport function amortizationSchedule(\n  principal: number,\n  rate: number,\n  nper: number,\n): { period: number; payment: number; interest: number; principal: number; balance: number }[] {\n  const payment = -pmt(rate, nper, principal)\n  let balance = principal\n  const schedule: { period: number; payment: number; interest: number; principal: number; balance: number }[] = []\n  for (let period = 1; period <= nper; period++) {\n    const interest = balance * rate\n    const principalPart = payment - interest\n    balance -= principalPart\n    schedule.push({\n      period,\n      payment: Math.round(payment * 100) / 100,\n      interest: Math.round(interest * 100) / 100,\n      principal: Math.round(principalPart * 100) / 100,\n      balance: Math.round(Math.max(balance, 0) * 100) / 100,\n    })\n  }\n  return schedule\n}\n\n// ─── Random Distributions ────────────────────────────────────────────────────\n\n/**\n * Generates a random number from a normal (Gaussian) distribution.\n *\n * @param mean - The mean (default 0).\n * @param stddev - The standard deviation (default 1).\n * @returns A normally distributed random number.\n */\nexport function randomNormal(mean: number = 0, stddev: number = 1): number {\n  let u = 0\n  let v = 0\n  while (u === 0) u = Math.random()\n  while (v === 0) v = Math.random()\n  const z = Math.sqrt(-2 * Math.log(u)) * Math.cos(2 * Math.PI * v)\n  return mean + z * stddev\n}\n\n/**\n * Generates a random number from a Poisson distribution.\n *\n * @param lambda - The rate parameter (mean).\n * @returns A Poisson-distributed random integer.\n */\nexport function randomPoisson(lambda: number): number {\n  if (lambda <= 0) throw new RangeError('Lambda must be positive')\n  const L = Math.exp(-lambda)\n  let k = 0\n  let p = 1\n  do {\n    k++\n    p *= Math.random()\n  } while (p > L)\n  return k - 1\n}\n\n/**\n * Generates a random number from a binomial distribution.\n *\n * @param n - Number of trials.\n * @param p - Probability of success per trial.\n * @returns Number of successes.\n */\nexport function randomBinomial(n: number, p: number): number {\n  if (!Number.isInteger(n) || n < 0) throw new RangeError('n must be a non-negative integer')\n  if (p < 0 || p > 1) throw new RangeError('p must be between 0 and 1')\n  let successes = 0\n  for (let i = 0; i < n; i++) {\n    if (Math.random() < p) successes++\n  }\n  return successes\n}\n\n/**\n * Generates a random number from an exponential distribution.\n *\n * @param lambda - The rate parameter.\n * @returns An exponentially distributed random number.\n */\nexport function randomExponential(lambda: number): number {\n  if (lambda <= 0) throw new RangeError('Lambda must be positive')\n  return -Math.log(1 - Math.random()) / lambda\n}\n\n/**\n * Generates a random number from a uniform distribution.\n *\n * @param min - Lower bound (default 0).\n * @param max - Upper bound (default 1).\n * @returns A uniformly distributed random number.\n */\nexport function randomUniform(min: number = 0, max: number = 1): number {\n  return Math.random() * (max - min) + min\n}\n\n// ─── Calculus ─────────────────────────────────────────────────────────────────\n\n/**\n * Computes the numerical derivative of a function at a point.\n *\n * @param f - The function.\n * @param x - The point to evaluate at.\n * @param h - Step size (default 1e-10).\n * @returns The derivative value.\n */\nexport function derivative(f: (x: number) => number, x: number, h: number = 1e-10): number {\n  return (f(x + h) - f(x - h)) / (2 * h)\n}\n\n/**\n * Computes the definite integral of a function using Simpson's rule.\n *\n * @param f - The function to integrate.\n * @param a - Lower bound.\n * @param b - Upper bound.\n * @param n - Number of subintervals (must be even, default 100).\n * @returns The approximate integral value.\n */\nexport function integral(f: (x: number) => number, a: number, b: number, n: number = 100): number {\n  if (n % 2 !== 0) {\n    throw new RangeError('Number of subintervals must be even for Simpson\\'s rule')\n  }\n  const h = (b - a) / n\n  let sum = f(a) + f(b)\n  for (let i = 1; i < n; i++) {\n    const x = a + i * h\n    sum += i % 2 === 0 ? 2 * f(x) : 4 * f(x)\n  }\n  return (h / 3) * sum\n}\n\n/**\n * Computes the definite integral using the trapezoidal rule.\n *\n * @param f - The function to integrate.\n * @param a - Lower bound.\n * @param b - Upper bound.\n * @param n - Number of subintervals (default 100).\n * @returns The approximate integral value.\n */\nexport function trapezoidal(f: (x: number) => number, a: number, b: number, n: number = 100): number {\n  const h = (b - a) / n\n  let sum = (f(a) + f(b)) / 2\n  for (let i = 1; i < n; i++) {\n    sum += f(a + i * h)\n  }\n  return h * sum\n}\n\n/**\n * Finds a root of a function using Newton's method.\n *\n * @param f - The function.\n * @param guess - Initial guess.\n * @param tolerance - Convergence tolerance (default 1e-7).\n * @param maxIter - Maximum iterations (default 100).\n * @returns The root value, or NaN if not converged.\n */\nexport function newtonRoot(\n  f: (x: number) => number,\n  guess: number,\n  tolerance: number = 1e-7,\n  maxIter: number = 100,\n): number {\n  let x = guess\n  for (let i = 0; i < maxIter; i++) {\n    const fx = f(x)\n    if (Math.abs(fx) < tolerance) return x\n    const df = derivative(f, x)\n    if (df === 0) return NaN\n    x -= fx / df\n  }\n  return NaN\n}\n\n/**\n * Linearly interpolates between two values.\n *\n * @param a - Start value.\n * @param b - End value.\n * @param t - Interpolation factor (0 to 1).\n * @returns The interpolated value.\n */\nexport function lerp(a: number, b: number, t: number): number {\n  return a + (b - a) * t\n}\n\n/**\n * Maps a value from one range to another.\n *\n * @param value - The input value.\n * @param inMin - Input range minimum.\n * @param inMax - Input range maximum.\n * @param outMin - Output range minimum.\n * @param outMax - Output range maximum.\n * @returns The mapped value.\n */\nexport function mapRange(value: number, inMin: number, inMax: number, outMin: number, outMax: number): number {\n  if (inMax === inMin) throw new RangeError('Input range cannot be zero')\n  return ((value - inMin) / (inMax - inMin)) * (outMax - outMin) + outMin\n}\n","/**\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","/**\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","const SEP = '/'\n\n/**\n * Joins path segments with the proper separator.\n *\n * @param segments - Path segments to join.\n * @returns The joined path.\n */\nexport function join(...segments: string[]): string {\n  const parts: string[] = []\n  for (const seg of segments) {\n    if (seg === '') continue\n    const split = seg.split(/[\\\\/]/)\n    for (const part of split) {\n      if (part === '' || part === '.') continue\n      if (part === '..') {\n        if (parts.length > 0 && parts[parts.length - 1] !== '..') {\n          parts.pop()\n        } else {\n          parts.push('..')\n        }\n      } else {\n        parts.push(part)\n      }\n    }\n  }\n  if (parts.length === 0) return '.'\n  const result = parts.join(SEP)\n  if (segments.length > 0 && segments[0]!.startsWith('/')) {\n    return SEP + result\n  }\n  return result\n}\n\n/**\n * Resolves path segments to an absolute path.\n *\n * @param segments - Path segments to resolve.\n * @returns The resolved absolute path.\n */\nexport function resolve(...segments: string[]): string {\n  let resolved = ''\n  let isAbs = false\n\n  for (const seg of segments) {\n    if (seg.startsWith('/')) {\n      resolved = seg\n      isAbs = true\n    } else if (isAbs) {\n      resolved = join(resolved, seg)\n    } else {\n      resolved = resolved ? join(resolved, seg) : seg\n    }\n  }\n\n  if (!isAbs) {\n    resolved = join(SEP, resolved)\n  }\n\n  return normalize(resolved)\n}\n\n/**\n * Returns the filename from a path.\n *\n * @param p - The path.\n * @param ext - Optional extension to strip.\n * @returns The filename.\n */\nexport function basename(p: string, ext?: string): string {\n  const normalized = p.replace(/[\\\\/]+$/, '')\n  const idx = normalized.lastIndexOf(SEP)\n  let base = idx === -1 ? normalized : normalized.slice(idx + 1)\n  if (ext && base.endsWith(ext)) {\n    base = base.slice(0, -ext.length)\n  }\n  return base\n}\n\n/**\n * Returns the directory portion of a path.\n *\n * @param p - The path.\n * @returns The directory path.\n */\nexport function dirname(p: string): string {\n  if (p === SEP) return SEP\n  const normalized = p.replace(/[\\\\/]+$/, '')\n  if (normalized === '') return '.'\n  const idx = normalized.lastIndexOf(SEP)\n  if (idx === -1) return '.'\n  if (idx === 0) return SEP\n  return normalized.slice(0, idx)\n}\n\n/**\n * Returns the file extension from a path.\n *\n * @param p - The path.\n * @returns The extension including the dot, or empty string.\n */\nexport function extname(p: string): string {\n  const base = basename(p)\n  const idx = base.lastIndexOf('.')\n  if (idx === -1 || idx === 0) return ''\n  return base.slice(idx)\n}\n\n/**\n * Normalizes a path, resolving '..' and '.' segments.\n *\n * @param p - The path to normalize.\n * @returns The normalized path.\n */\nexport function normalize(p: string): string {\n  const parts = p.split(/[\\\\/]+/)\n  const stack: string[] = []\n  let isAbs = p.startsWith('/')\n\n  for (const part of parts) {\n    if (part === '' || part === '.') continue\n    if (part === '..') {\n      if (stack.length > 0 && stack[stack.length - 1] !== '..') {\n        stack.pop()\n      } else if (!isAbs) {\n        stack.push('..')\n      }\n    } else {\n      stack.push(part)\n    }\n  }\n\n  const result = stack.join(SEP)\n  if (isAbs) return SEP + result\n  if (result === '') return '.'\n  return result\n}\n\n/**\n * Checks if a path is absolute.\n *\n * @param p - The path to check.\n * @returns Whether the path is absolute.\n */\nexport function isAbsolute(p: string): boolean {\n  return p.startsWith('/')\n}\n\n/**\n * Computes the relative path from `from` to `to`.\n *\n * @param from - The base path.\n * @param to - The target path.\n * @returns The relative path.\n */\nexport function relative(from: string, to: string): string {\n  const fromParts = normalize(from).split(SEP)\n  const toParts = normalize(to).split(SEP)\n\n  let i = 0\n  while (i < fromParts.length && i < toParts.length && fromParts[i] === toParts[i]) {\n    i++\n  }\n\n  const up = fromParts.slice(i).map(() => '..')\n  const down = toParts.slice(i)\n  const result = [...up, ...down].join(SEP)\n\n  return result || '.'\n}\n\nexport interface ParsedPath {\n  root: string\n  dir: string\n  base: string\n  name: string\n  ext: string\n}\n\n/**\n * Parses a path into its components.\n *\n * @param p - The path to parse.\n * @returns An object with root, dir, base, name, and ext.\n */\nexport function parse(p: string): ParsedPath {\n  const root = p.startsWith(SEP) ? SEP : ''\n  const base = basename(p)\n  const ext = extname(base)\n  const name = ext ? base.slice(0, -ext.length) : base\n  const dir = root ? dirname(p) : (dirname(p) === '.' ? '' : dirname(p))\n\n  return { root, dir, base, name, ext }\n}\n\n/**\n * Formats a parsed path object back into a path string.\n *\n * @param parsed - The parsed path components.\n * @returns The formatted path string.\n */\nexport function format(parsed: Partial<ParsedPath>): string {\n  const { root = '', dir = '', base = '', name = '', ext = '' } = parsed\n  const baseName = base || name + ext\n  if (dir) {\n    return dir + SEP + baseName\n  }\n  return root + baseName\n}\n","/**\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","const WORD_SPLIT_RE = /[A-Z]?[a-z]+|[A-Z]+(?=[A-Z][a-z]|\\d|\\b)|\\d+/g\n\nfunction splitWords(str: string): string[] {\n  return str.match(WORD_SPLIT_RE) ?? []\n}\n\n/**\n * Capitalizes the first character and lowercases the rest.\n */\nexport function capitalize(str: string): string {\n  if (str.length === 0) return str\n  return str[0]!.toUpperCase() + str.slice(1).toLowerCase()\n}\n\n/**\n * Converts a string to camelCase.\n */\nexport function camelCase(str: string): string {\n  const words = splitWords(str)\n  if (words.length === 0) return ''\n  const [firstWord, ...rest] = words\n  return firstWord!.toLowerCase() + rest.map(w => w[0]!.toUpperCase() + w.slice(1).toLowerCase()).join('')\n}\n\n/**\n * Converts a string to kebab-case.\n */\nexport function kebabCase(str: string): string {\n  return splitWords(str).map(w => w.toLowerCase()).join('-')\n}\n\n/**\n * Converts a string to snake_case.\n */\nexport function snakeCase(str: string): string {\n  return splitWords(str).map(w => w.toLowerCase()).join('_')\n}\n\n/**\n * Converts a string to PascalCase.\n */\nexport function pascalCase(str: string): string {\n  return splitWords(str).map(w => w[0]!.toUpperCase() + w.slice(1).toLowerCase()).join('')\n}\n\n/**\n * Truncates a string to the specified length, appending a suffix (default \"...\").\n */\nexport function truncate(str: string, maxLength: number, suffix = '...'): string {\n  if (str.length <= maxLength) return str\n  return str.slice(0, Math.max(0, maxLength - suffix.length)) + suffix\n}\n\n/**\n * Simple string interpolation using {{key}} syntax.\n *\n * @example template(\"Hello {{name}}\", { name: \"world\" }) // => \"Hello world\"\n */\nexport function template(str: string, data: Record<string, string | number>): string {\n  return str.replace(/\\{\\{(\\w+)\\}\\}/g, (_, key: string) => {\n    const value = data[key]\n    return value !== undefined ? String(value) : `{{${key}}}`\n  })\n}\n\n/**\n * Generates a UUID v4 string.\n * Uses crypto.randomUUID when available, falls back to manual implementation.\n */\nexport function uuid(): string {\n  if (typeof crypto !== 'undefined' && typeof crypto.randomUUID === 'function') {\n    return crypto.randomUUID()\n  }\n  const hex = '0123456789abcdef'\n  const chars: string[] = []\n  for (let i = 0; i < 36; i++) {\n    if (i === 8 || i === 13 || i === 18 || i === 23) {\n      chars.push('-')\n    } else if (i === 14) {\n      chars.push('4')\n    } else if (i === 19) {\n      chars.push(hex[Math.floor(Math.random() * 4) + 8]!)\n    } else {\n      chars.push(hex[Math.floor(Math.random() * 16)]!)\n    }\n  }\n  return chars.join('')\n}\n\n/**\n * Generates a short random ID with configurable length and alphabet.\n *\n * @default size = 21, alphabet = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz_-\"\n */\nexport function nanoid(size = 21, alphabet = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz_-'): string {\n  const len = alphabet.length\n  let result = ''\n  for (let i = 0; i < size; i++) {\n    result += alphabet[Math.floor(Math.random() * len)]!\n  }\n  return result\n}\n\nconst HTML_ESCAPE_MAP: Record<string, string> = {\n  '&': '&amp;',\n  '<': '&lt;',\n  '>': '&gt;',\n  '\"': '&quot;',\n  \"'\": '&#39;',\n}\n\nconst HTML_UNESCAPE_MAP: Record<string, string> = {\n  '&amp;': '&',\n  '&lt;': '<',\n  '&gt;': '>',\n  '&quot;': '\"',\n  '&#39;': \"'\",\n  '&#x27;': \"'\",\n}\n\n/**\n * Escapes HTML special characters (&, <, >, \", ').\n */\nexport function escapeHtml(str: string): string {\n  return str.replace(/[&<>\"']/g, ch => HTML_ESCAPE_MAP[ch] ?? ch)\n}\n\n/**\n * Unescapes common HTML entities.\n */\nexport function unescapeHtml(str: string): string {\n  return str.replace(/&(?:amp|lt|gt|quot|#39|#x27);/g, entity => HTML_UNESCAPE_MAP[entity] ?? entity)\n}\n\n/**\n * Removes whitespace from both ends of a string.\n */\nexport function trim(str: string): string {\n  return str.trim()\n}\n\n/**\n * Removes whitespace from the start of a string.\n */\nexport function trimStart(str: string): string {\n  return str.trimStart()\n}\n\n/**\n * Removes whitespace from the end of a string.\n */\nexport function trimEnd(str: string): string {\n  return str.trimEnd()\n}\n\n/**\n * Pads a string to the given length by adding characters to both sides.\n */\nexport function pad(str: string, length: number, char = ' '): string {\n  const totalPadding = Math.max(0, length - str.length)\n  const leftPad = Math.floor(totalPadding / 2)\n  const rightPad = totalPadding - leftPad\n  return char.repeat(leftPad) + str + char.repeat(rightPad)\n}\n\n/**\n * Pads the start of a string to the given length.\n */\nexport function padStart(str: string, length: number, char = ' '): string {\n  return str.padStart(length, char)\n}\n\n/**\n * Pads the end of a string to the given length.\n */\nexport function padEnd(str: string, length: number, char = ' '): string {\n  return str.padEnd(length, char)\n}\n\n/**\n * Reverses a string.\n */\nexport function reverse(str: string): string {\n  return str.split('').reverse().join('')\n}\n\n/**\n * Splits a string into words.\n */\nexport function words(str: string): string[] {\n  return splitWords(str)\n}\n\n/**\n * Converts a string to a URL-friendly slug.\n */\nexport function slugify(str: string): string {\n  return str\n    .toLowerCase()\n    .replace(/[^\\w\\s-]/g, '')\n    .replace(/[\\s_]+/g, '-')\n    .replace(/-+/g, '-')\n    .replace(/^-+/, '')\n    .replace(/-+$/, '')\n}\n\n/**\n * Counts occurrences of a substring in a string.\n */\nexport function countOccurrences(str: string, substring: string): number {\n  if (substring.length === 0 || str.length === 0) return 0\n  let count = 0\n  let pos = 0\n  while ((pos = str.indexOf(substring, pos)) !== -1) {\n    count++\n    pos += substring.length\n  }\n  return count\n}\n","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","/**\n * Options for CSV parsing.\n */\nexport interface CsvOptions {\n  delimiter?: string\n  header?: boolean\n  skipEmptyLines?: boolean\n}\n\n/**\n * Parses a CSV string into an array of records (objects).\n *\n * @param input - CSV string\n * @param options - Optional parsing options\n */\nexport function parseCsv(input: string, options?: CsvOptions): Record<string, string>[] {\n  const { delimiter = ',', header = true, skipEmptyLines = true } = options ?? {}\n\n  const lines = input.split(/\\r?\\n/)\n  const rows: string[][] = []\n\n  for (const line of lines) {\n    const trimmed = line.trim()\n    if (skipEmptyLines && trimmed.length === 0) continue\n    const values = parseCsvLine(trimmed, delimiter)\n    rows.push(values)\n  }\n\n  if (rows.length === 0) return []\n\n  if (header) {\n    const [head, ...body] = rows\n    if (head === undefined) return []\n    return body.map(row => {\n      const record: Record<string, string> = {}\n      for (let i = 0; i < head.length; i++) {\n        record[head[i]!] = row[i] ?? ''\n      }\n      return record\n    })\n  }\n\n  return rows.map(row => {\n    const record: Record<string, string> = {}\n    for (let i = 0; i < row.length; i++) {\n      record[String(i)] = row[i]!\n    }\n    return record\n  })\n}\n\nfunction parseCsvLine(line: string, delimiter: string): string[] {\n  const result: string[] = []\n  let current = ''\n  let inQuotes = false\n\n  for (let i = 0; i < line.length; i++) {\n    const ch = line[i]!\n    if (inQuotes) {\n      if (ch === '\"') {\n        if (line[i + 1] === '\"') {\n          current += '\"'\n          i++\n        } else {\n          inQuotes = false\n        }\n      } else {\n        current += ch\n      }\n    } else {\n      if (ch === '\"') {\n        inQuotes = true\n      } else if (ch === delimiter) {\n        result.push(current)\n        current = ''\n      } else {\n        current += ch\n      }\n    }\n  }\n  result.push(current)\n  return result\n}\n\n/**\n * Converts an array of records to a CSV string.\n */\nexport function stringifyCsv(data: Record<string, unknown>[], options?: { delimiter?: string }): string {\n  const { delimiter = ',' } = options ?? {}\n  if (data.length === 0) return ''\n\n  const headers = Object.keys(data[0]!)\n  const lines: string[] = [headers.map(v => escapeCsvField(v, delimiter)).join(delimiter)]\n\n  for (const record of data) {\n    const row = headers.map(h => escapeCsvField(String(record[h] ?? ''), delimiter))\n    lines.push(row.join(delimiter))\n  }\n\n  return lines.join('\\n')\n}\n\nfunction escapeCsvField(value: string, delimiter: string): string {\n  if (value.includes('\"') || value.includes(delimiter) || value.includes('\\n') || value.includes('\\r')) {\n    return '\"' + value.replace(/\"/g, '\"\"') + '\"'\n  }\n  return value\n}\n\n/**\n * Safely parses a JSON string, returning the default value or null on failure.\n */\nexport function safeJsonParse<T>(input: string, default_?: T): T | null {\n  try {\n    return JSON.parse(input) as T\n  } catch {\n    return default_ ?? null\n  }\n}\n\n/**\n * Reads an environment variable with optional default.\n */\nexport function env(name: string, default_?: string): string {\n  const value = process.env[name]\n  return value ?? default_ ?? ''\n}\n\n/**\n * Reads an environment variable as an integer.\n */\nexport function envInt(name: string, default_?: number): number {\n  const value = process.env[name]\n  if (value === undefined || value === '') return default_ ?? 0\n  const parsed = Number.parseInt(value, 10)\n  return Number.isNaN(parsed) ? (default_ ?? 0) : parsed\n}\n\n/**\n * Reads an environment variable as a boolean.\n */\nexport function envBool(name: string, default_?: boolean): boolean {\n  const value = process.env[name]\n  if (value === undefined || value === '') return default_ ?? false\n  return value === 'true' || value === '1' || value === 'yes'\n}\n","/**\n * Checks if a value is a string.\n */\nexport function isString(value: unknown): value is string {\n  return typeof value === 'string'\n}\n\n/**\n * Checks if a value is a number (not NaN, not Infinity).\n */\nexport function isNumber(value: unknown): value is number {\n  return typeof value === 'number' && Number.isFinite(value)\n}\n\n/**\n * Checks if a value is a boolean.\n */\nexport function isBoolean(value: unknown): value is boolean {\n  return typeof value === 'boolean'\n}\n\n/**\n * Checks if a value is a plain object (not null, not array, typeof 'object').\n */\nexport function isObject(value: unknown): value is Record<string, unknown> {\n  return value !== null && typeof value === 'object' && !Array.isArray(value)\n}\n\n/**\n * Checks if a value is an array.\n */\nexport function isArray(value: unknown): value is unknown[] {\n  return Array.isArray(value)\n}\n\n/**\n * Checks if a value is a function.\n */\nexport function isFunction(value: unknown): value is (...args: unknown[]) => unknown {\n  return typeof value === 'function'\n}\n\n/**\n * Checks if a value is a Date.\n */\nexport function isDate(value: unknown): value is Date {\n  return value instanceof Date && !Number.isNaN(value.getTime())\n}\n\n/**\n * Checks if a value is a RegExp.\n */\nexport function isRegExp(value: unknown): value is RegExp {\n  return value instanceof RegExp\n}\n\n/**\n * Checks if a value is a Map.\n */\nexport function isMap(value: unknown): value is Map<unknown, unknown> {\n  return value instanceof Map\n}\n\n/**\n * Checks if a value is a Set.\n */\nexport function isSet(value: unknown): value is Set<unknown> {\n  return value instanceof Set\n}\n\n/**\n * Checks if a value is a Promise.\n */\nexport function isPromise(value: unknown): value is Promise<unknown> {\n  return value instanceof Promise\n}\n\n/**\n * Checks if a value is null.\n */\nexport function isNull(value: unknown): value is null {\n  return value === null\n}\n\n/**\n * Checks if a value is undefined.\n */\nexport function isUndefined(value: unknown): value is undefined {\n  return value === undefined\n}\n\n/**\n * Checks if a value is null or undefined.\n */\nexport function isNil(value: unknown): value is null | undefined {\n  return value === null || value === undefined\n}\n\n/**\n * Checks if a value is empty.\n * Works for strings, arrays, objects, Map, and Set.\n */\nexport function isEmpty(value: unknown): boolean {\n  if (value === null || value === undefined) return true\n  if (typeof value === 'string') return value.length === 0\n  if (Array.isArray(value)) return value.length === 0\n  if (value instanceof Map || value instanceof Set) return value.size === 0\n  if (typeof value === 'object') return Object.keys(value as Record<string, unknown>).length === 0\n  return false\n}\n\n/**\n * Asserts that a value is defined (not null or undefined).\n * Throws if the value is null or undefined.\n */\nexport function assertDefined<T>(value: T, message?: string): asserts value is NonNullable<T> {\n  if (value === null || value === undefined) {\n    throw new Error(message ?? 'Expected value to be defined')\n  }\n}\n\n/**\n * Asserts that a value matches a type guard. Throws if it doesn't.\n */\nexport function assertType<T>(value: unknown, guard: (v: unknown) => v is T, message?: string): asserts value is T {\n  if (!guard(value)) {\n    throw new Error(message ?? 'Value does not match expected type')\n  }\n}\n\n/**\n * Wraps a value in an array if it is not already one.\n */\nexport function ensureArray<T>(value: T | T[]): T[] {\n  return Array.isArray(value) ? value : [value]\n}\n\n/**\n * Alias for ensureArray.\n */\nexport function castArray<T>(value: T | T[]): T[] {\n  return ensureArray(value)\n}\n\n/**\n * Returns a string representation of the value's type.\n *\n * Possible values: \"string\", \"number\", \"boolean\", \"array\", \"object\", \"function\",\n * \"date\", \"regexp\", \"map\", \"set\", \"promise\", \"null\", \"undefined\", \"nan\", \"infinity\"\n */\nexport function getType(value: unknown): string {\n  if (value === null) return 'null'\n  if (value === undefined) return 'undefined'\n  if (typeof value === 'string') return 'string'\n  if (typeof value === 'boolean') return 'boolean'\n  if (typeof value === 'function') return 'function'\n  if (typeof value === 'number') {\n    if (Number.isNaN(value)) return 'nan'\n    if (!Number.isFinite(value)) return 'infinity'\n    return 'number'\n  }\n  if (Array.isArray(value)) return 'array'\n  if (value instanceof Date) return 'date'\n  if (value instanceof RegExp) return 'regexp'\n  if (value instanceof Map) return 'map'\n  if (value instanceof Set) return 'set'\n  if (value instanceof Promise) return 'promise'\n  return 'object'\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,CAAAA,aAAW;AAC/B,mBAAW,MAAM;AACf,UAAAA,SAAQ,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;;;AC1ZO,IAAM,sBAAN,cAAkC,MAAM;AAAA,EAC7C,cAAc;AACZ,UAAM,kBAAkB;AACxB,SAAK,OAAO;AAAA,EACd;AACF;AAEA,SAAS,aAAa,OAAuB;AAC3C,MAAI,CAAC,SAAS,KAAK,EAAG,QAAO;AAC7B,QAAM,SAAS,OAAO,KAAK,EAAE,QAAQ,GAAG;AACxC,MAAI,SAAS,IAAI;AACf,UAAM,MAAM,SAAS,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC,GAAG,EAAE;AACxD,QAAI,MAAM,EAAG,QAAO,KAAK,IAAI,GAAG;AAChC,WAAO;AAAA,EACT;AACA,QAAM,MAAM,OAAO,KAAK;AACxB,QAAM,MAAM,IAAI,QAAQ,GAAG;AAC3B,SAAO,QAAQ,KAAK,IAAI,IAAI,SAAS,MAAM;AAC7C;AAEA,SAAS,kBAAkB,GAAW,GAAmB;AACvD,SAAO,KAAK,IAAI,IAAI,KAAK,IAAI,aAAa,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC;AAChE;AASO,SAAS,IAAI,GAAW,GAAmB;AAChD,QAAM,SAAS,kBAAkB,GAAG,CAAC;AACrC,UAAQ,KAAK,MAAM,IAAI,MAAM,IAAI,KAAK,MAAM,IAAI,MAAM,KAAK;AAC7D;AASO,SAAS,IAAI,GAAW,GAAmB;AAChD,QAAM,SAAS,kBAAkB,GAAG,CAAC;AACrC,UAAQ,KAAK,MAAM,IAAI,MAAM,IAAI,KAAK,MAAM,IAAI,MAAM,KAAK;AAC7D;AASO,SAAS,IAAI,GAAW,GAAmB;AAChD,QAAM,UAAU,kBAAkB,GAAG,CAAC;AACtC,QAAM,UAAU,kBAAkB,GAAG,CAAC;AACtC,QAAM,SAAU,KAAK,MAAM,IAAI,OAAO,IAAI,KAAK,MAAM,IAAI,OAAO,KAAM,UAAU;AAChF,SAAO;AACT;AAUO,SAAS,IAAI,GAAW,GAAmB;AAChD,MAAI,MAAM,EAAG,OAAM,IAAI,oBAAoB;AAC3C,QAAM,SAAS,kBAAkB,GAAG,CAAC;AACrC,SAAO,KAAK,MAAM,IAAI,MAAM,IAAI,KAAK,MAAM,IAAI,MAAM;AACvD;AASO,SAAS,MAAM,OAAe,YAAoB,GAAW;AAClE,QAAM,SAAS,KAAK,IAAI,IAAI,SAAS;AACrC,SAAO,KAAK,MAAM,QAAQ,MAAM,IAAI;AACtC;AASO,SAAS,MAAM,OAAe,YAAoB,GAAW;AAClE,QAAM,SAAS,KAAK,IAAI,IAAI,SAAS;AACrC,SAAO,KAAK,MAAM,QAAQ,MAAM,IAAI;AACtC;AASO,SAAS,KAAK,OAAe,YAAoB,GAAW;AACjE,QAAM,SAAS,KAAK,IAAI,IAAI,SAAS;AACrC,SAAO,KAAK,KAAK,QAAQ,MAAM,IAAI;AACrC;AAUO,SAAS,YAAY,GAAW,GAAW,YAAoB,OAAO,SAAkB;AAC7F,SAAO,KAAK,IAAI,IAAI,CAAC,KAAK;AAC5B;AAWO,SAAS,MAAM,OAAe,KAAa,KAAqB;AACrE,MAAI,MAAM,KAAK;AACb,UAAM,IAAI,WAAW,2CAA2C;AAAA,EAClE;AACA,SAAO,KAAK,IAAI,KAAK,IAAI,OAAO,GAAG,GAAG,GAAG;AAC3C;AAQO,SAAS,IAAI,QAA0B;AAC5C,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,aAAS,OAAO,CAAC;AAAA,EACnB;AACA,SAAO;AACT;AASO,SAAS,QAAQ,QAA0B;AAChD,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,WAAW,0CAA0C;AAAA,EACjE;AACA,SAAO,IAAI,MAAM,IAAI,OAAO;AAC9B;AAUO,SAAS,UAAU,KAAa,KAAqB;AAC1D,MAAI,CAAC,OAAO,UAAU,GAAG,KAAK,CAAC,OAAO,UAAU,GAAG,GAAG;AACpD,UAAM,IAAI,WAAW,4BAA4B;AAAA,EACnD;AACA,MAAI,MAAM,KAAK;AACb,UAAM,IAAI,WAAW,2CAA2C;AAAA,EAClE;AACA,SAAO,KAAK,MAAM,KAAK,OAAO,KAAK,MAAM,MAAM,EAAE,IAAI;AACvD;AAUO,SAAS,QAAQ,OAAe,KAAa,KAAsB;AACxE,SAAO,SAAS,OAAO,SAAS;AAClC;AAUO,SAAS,UAAU,SAAyB;AACjD,SAAO,WAAW,MAAM,KAAK;AAC/B;AAQO,SAAS,UAAU,SAAyB;AACjD,SAAO,WAAW,KAAK,KAAK;AAC9B;AASO,SAAS,IAAI,OAAe,OAAsB,OAAe;AACtE,QAAM,MAAM,SAAS,QAAQ,UAAU,KAAK,IAAI;AAChD,SAAO,KAAK,IAAI,GAAG;AACrB;AASO,SAAS,IAAI,OAAe,OAAsB,OAAe;AACtE,QAAM,MAAM,SAAS,QAAQ,UAAU,KAAK,IAAI;AAChD,SAAO,KAAK,IAAI,GAAG;AACrB;AASO,SAAS,IAAI,OAAe,OAAsB,OAAe;AACtE,QAAM,MAAM,SAAS,QAAQ,UAAU,KAAK,IAAI;AAChD,SAAO,KAAK,IAAI,GAAG;AACrB;AASO,SAAS,KAAK,OAAuB;AAC1C,MAAI,QAAQ,MAAM,QAAQ,GAAG;AAC3B,UAAM,IAAI,WAAW,wCAAwC;AAAA,EAC/D;AACA,SAAO,KAAK,KAAK,KAAK;AACxB;AASO,SAAS,KAAK,OAAuB;AAC1C,MAAI,QAAQ,MAAM,QAAQ,GAAG;AAC3B,UAAM,IAAI,WAAW,wCAAwC;AAAA,EAC/D;AACA,SAAO,KAAK,KAAK,KAAK;AACxB;AAQO,SAAS,KAAK,OAAuB;AAC1C,SAAO,KAAK,KAAK,KAAK;AACxB;AASO,SAAS,MAAM,GAAW,GAAmB;AAClD,SAAO,KAAK,MAAM,GAAG,CAAC;AACxB;AAQO,SAAS,SAAS,QAA0B;AACjD,SAAO,KAAK,MAAM,GAAG,MAAM;AAC7B;AAWO,SAAS,OAAO,QAA0B;AAC/C,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,WAAW,yCAAyC;AAAA,EAChE;AACA,QAAM,SAAS,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC/C,QAAM,MAAM,KAAK,MAAM,OAAO,SAAS,CAAC;AACxC,MAAI,OAAO,SAAS,MAAM,GAAG;AAC3B,YAAQ,OAAO,MAAM,CAAC,IAAK,OAAO,GAAG,KAAM;AAAA,EAC7C;AACA,SAAO,OAAO,GAAG;AACnB;AASO,SAAS,KAAK,QAA4B;AAC/C,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,WAAW,uCAAuC;AAAA,EAC9D;AACA,QAAM,OAAO,oBAAI,IAAoB;AACrC,MAAI,UAAU;AACd,aAAW,KAAK,QAAQ;AACtB,UAAM,KAAK,KAAK,IAAI,CAAC,KAAK,KAAK;AAC/B,SAAK,IAAI,GAAG,CAAC;AACb,QAAI,IAAI,QAAS,WAAU;AAAA,EAC7B;AACA,MAAI,YAAY,EAAG,QAAO,CAAC;AAC3B,SAAO,MAAM,KAAK,KAAK,QAAQ,CAAC,EAC7B,OAAO,CAAC,CAAC,EAAE,CAAC,MAAM,MAAM,OAAO,EAC/B,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,EACd,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACzB;AAUO,SAAS,WAAW,QAAkB,GAAmB;AAC9D,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,WAAW,6CAA6C;AAAA,EACpE;AACA,MAAI,IAAI,KAAK,IAAI,KAAK;AACpB,UAAM,IAAI,WAAW,sCAAsC;AAAA,EAC7D;AACA,QAAM,SAAS,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC/C,QAAM,QAAS,IAAI,OAAQ,OAAO,SAAS;AAC3C,QAAM,QAAQ,KAAK,MAAM,KAAK;AAC9B,QAAM,QAAQ,KAAK,KAAK,KAAK;AAC7B,MAAI,UAAU,MAAO,QAAO,OAAO,KAAK;AACxC,SAAO,OAAO,KAAK,KAAM,OAAO,KAAK,IAAK,OAAO,KAAK,MAAO,QAAQ;AACvE;AASO,SAAS,UAAU,QAA0D;AAClF,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,WAAW,4CAA4C;AAAA,EACnE;AACA,QAAM,SAAS,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC/C,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,EAAE,IAAI,OAAO,CAAC,GAAI,IAAI,OAAO,CAAC,GAAI,IAAI,OAAO,CAAC,EAAG;AAAA,EAC1D;AACA,QAAM,KAAK,OAAO,MAAM;AACxB,QAAM,MAAM,KAAK,MAAM,OAAO,SAAS,CAAC;AACxC,QAAM,YAAY,OAAO,MAAM,GAAG,GAAG;AACrC,QAAM,YAAY,OAAO,SAAS,MAAM,IACpC,OAAO,MAAM,GAAG,IAChB,OAAO,MAAM,MAAM,CAAC;AACxB,SAAO;AAAA,IACL,IAAI,OAAO,SAAS;AAAA,IACpB;AAAA,IACA,IAAI,OAAO,SAAS;AAAA,EACtB;AACF;AAUO,SAAS,SAAS,QAAkBC,UAAkB,OAAe;AAC1E,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,WAAW,2CAA2C;AAAA,EAClE;AACA,MAAIA,WAAU,OAAO,SAAS,GAAG;AAC/B,UAAM,IAAI,WAAW,4CAA4C;AAAA,EACnE;AACA,QAAM,OAAO,QAAQ,MAAM;AAC3B,QAAM,UAAU,OAAO,IAAI,QAAM,IAAI,SAAS,CAAC;AAC/C,QAAM,UAAUA,UAAS,OAAO,SAAS,IAAI,OAAO;AACpD,SAAO,IAAI,OAAO,IAAI;AACxB;AASO,SAAS,OAAO,QAAkBA,UAAkB,OAAe;AACxE,SAAO,KAAK,KAAK,SAAS,QAAQA,OAAM,CAAC;AAC3C;AAUO,SAAS,WAAW,GAAa,GAAqB;AAC3D,MAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,UAAM,IAAI,WAAW,kCAAkC;AAAA,EACzD;AACA,MAAI,EAAE,SAAS,GAAG;AAChB,UAAM,IAAI,WAAW,uCAAuC;AAAA,EAC9D;AACA,QAAM,QAAQ,QAAQ,CAAC;AACvB,QAAM,QAAQ,QAAQ,CAAC;AACvB,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,cAAU,EAAE,CAAC,IAAK,UAAU,EAAE,CAAC,IAAK;AAAA,EACtC;AACA,SAAO,SAAS,EAAE,SAAS;AAC7B;AASO,SAAS,YAAY,GAAa,GAAqB;AAC5D,QAAM,MAAM,WAAW,GAAG,CAAC;AAC3B,QAAM,OAAO,OAAO,GAAG,IAAI;AAC3B,QAAM,OAAO,OAAO,GAAG,IAAI;AAC3B,MAAI,SAAS,KAAK,SAAS,EAAG,QAAO;AACrC,SAAO,OAAO,OAAO;AACvB;AAQO,SAAS,SAAS,QAA0B;AACjD,MAAI,OAAO,SAAS,GAAG;AACrB,UAAM,IAAI,WAAW,qCAAqC;AAAA,EAC5D;AACA,QAAM,OAAO,QAAQ,MAAM;AAC3B,QAAM,IAAI,OAAO;AACjB,QAAM,KAAK,IAAI,OAAO,IAAI,QAAM,IAAI,SAAS,CAAC,CAAC,IAAI;AACnD,QAAM,KAAK,IAAI,OAAO,IAAI,QAAM,IAAI,SAAS,CAAC,CAAC,IAAI;AACnD,MAAI,OAAO,EAAG,QAAO;AACrB,SAAQ,KAAK,KAAK,IAAI,IAAI,GAAG,IAAK,KAAK,KAAK,KAAK,IAAI,EAAE,KAAK,IAAI;AAClE;AAQO,SAAS,SAAS,QAA0B;AACjD,MAAI,OAAO,SAAS,GAAG;AACrB,UAAM,IAAI,WAAW,qCAAqC;AAAA,EAC5D;AACA,QAAM,OAAO,QAAQ,MAAM;AAC3B,QAAM,IAAI,OAAO;AACjB,QAAM,KAAK,IAAI,OAAO,IAAI,QAAM,IAAI,SAAS,CAAC,CAAC,IAAI;AACnD,QAAM,KAAK,IAAI,OAAO,IAAI,QAAM,IAAI,SAAS,CAAC,CAAC,IAAI;AACnD,MAAI,OAAO,EAAG,QAAO;AACrB,QAAM,OAAO,MAAM,KAAK;AACxB,QAAM,cAAe,IAAI,MAAM,IAAI,OAAQ,IAAI,MAAM,IAAI;AACzD,SAAO,cAAc,OAAO,KAAK,IAAI,MAAM,IAAI;AACjD;AAUO,SAAS,aAAa,QAAkB,SAA2B;AACxE,MAAI,OAAO,WAAW,QAAQ,QAAQ;AACpC,UAAM,IAAI,WAAW,8CAA8C;AAAA,EACrE;AACA,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,WAAW,8CAA8C;AAAA,EACrE;AACA,QAAM,cAAc,IAAI,OAAO;AAC/B,MAAI,gBAAgB,GAAG;AACrB,UAAM,IAAI,WAAW,+BAA+B;AAAA,EACtD;AACA,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,aAAS,OAAO,CAAC,IAAK,QAAQ,CAAC;AAAA,EACjC;AACA,SAAO,QAAQ;AACjB;AASO,SAAS,cAAc,QAA0B;AACtD,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,WAAW,iDAAiD;AAAA,EACxE;AACA,MAAI,OAAO,KAAK,OAAK,KAAK,CAAC,GAAG;AAC5B,UAAM,IAAI,WAAW,8CAA8C;AAAA,EACrE;AACA,QAAM,SAAS,IAAI,OAAO,IAAI,OAAK,KAAK,IAAI,CAAC,CAAC,CAAC;AAC/C,SAAO,KAAK,IAAI,SAAS,OAAO,MAAM;AACxC;AASO,SAAS,aAAa,QAA0B;AACrD,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,WAAW,gDAAgD;AAAA,EACvE;AACA,MAAI,OAAO,KAAK,OAAK,KAAK,CAAC,GAAG;AAC5B,UAAM,IAAI,WAAW,6CAA6C;AAAA,EACpE;AACA,QAAM,gBAAgB,IAAI,OAAO,IAAI,OAAK,IAAI,CAAC,CAAC;AAChD,SAAO,OAAO,SAAS;AACzB;AAUO,SAAS,OAAO,OAAe,MAAcC,SAAwB;AAC1E,MAAIA,YAAW,EAAG,QAAO;AACzB,UAAQ,QAAQ,QAAQA;AAC1B;AAsBO,SAAS,YAAY,QAA4B;AACtD,MAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AACjC,QAAM,OAAO,QAAQ,MAAM;AAC3B,QAAM,KAAK,OAAO,QAAQ,IAAI;AAC9B,MAAI,OAAO,EAAG,QAAO,OAAO,IAAI,MAAM,CAAC;AACvC,SAAO,OAAO,IAAI,QAAM,IAAI,QAAQ,EAAE;AACxC;AAWO,SAAS,UAAU,GAAmB;AAC3C,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI,GAAG;AACjC,UAAM,IAAI,WAAW,2CAA2C;AAAA,EAClE;AACA,MAAI,MAAM,KAAK,MAAM,EAAG,QAAO;AAC/B,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,cAAU;AAAA,EACZ;AACA,SAAO;AACT;AAUO,SAAS,SAAS,GAAW,GAAmB;AACrD,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI,KAAK,IAAI,GAAG;AAClE,UAAM,IAAI,WAAW,yCAAyC;AAAA,EAChE;AACA,MAAI,IAAI,GAAG;AACT,UAAM,IAAI,WAAW,4BAA4B;AAAA,EACnD;AACA,MAAI,MAAM,KAAK,MAAM,EAAG,QAAO;AAC/B,MAAI,IAAI,IAAI,EAAG,QAAO,SAAS,GAAG,IAAI,CAAC;AACvC,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,aAAU,UAAU,IAAI,IAAI,KAAM;AAAA,EACpC;AACA,SAAO;AACT;AAUO,SAAS,YAAY,GAAW,GAAmB;AACxD,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI,KAAK,IAAI,GAAG;AAClE,UAAM,IAAI,WAAW,4CAA4C;AAAA,EACnE;AACA,MAAI,IAAI,GAAG;AACT,UAAM,IAAI,WAAW,4BAA4B;AAAA,EACnD;AACA,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC9B,cAAU;AAAA,EACZ;AACA,SAAO;AACT;AASO,SAAS,OAAO,QAA0B;AAC/C,MAAI,OAAO,SAAS,GAAG;AACrB,UAAM,IAAI,WAAW,gCAAgC;AAAA,EACvD;AACA,QAAM,OAAO,CAAC,GAAW,MAAsB;AAC7C,QAAI,KAAK,IAAI,CAAC;AACd,QAAI,KAAK,IAAI,CAAC;AACd,WAAO,MAAM,GAAG;AACd,YAAM,IAAI;AACV,UAAI,IAAI;AACR,UAAI;AAAA,IACN;AACA,WAAO;AAAA,EACT;AACA,SAAO,OAAO,OAAO,CAAC,GAAG,MAAM,KAAK,GAAG,CAAC,CAAC;AAC3C;AASO,SAAS,OAAO,QAA0B;AAC/C,MAAI,OAAO,SAAS,GAAG;AACrB,UAAM,IAAI,WAAW,gCAAgC;AAAA,EACvD;AACA,QAAM,OAAO,CAAC,GAAW,MAAsB;AAC7C,QAAI,MAAM,KAAK,MAAM,EAAG,QAAO;AAC/B,WAAO,KAAK,IAAI,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC;AAAA,EACnC;AACA,SAAO,OAAO,OAAO,CAAC,GAAG,MAAM,KAAK,GAAG,CAAC,CAAC;AAC3C;AAQO,SAAS,QAAQ,GAAoB;AAC1C,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI,EAAG,QAAO;AAC1C,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,IAAI,MAAM,EAAG,QAAO;AACxB,QAAM,OAAO,KAAK,KAAK,CAAC;AACxB,WAAS,IAAI,GAAG,KAAK,MAAM,KAAK,GAAG;AACjC,QAAI,IAAI,MAAM,EAAG,QAAO;AAAA,EAC1B;AACA,SAAO;AACT;AASO,SAAS,aAAa,GAAqB;AAChD,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI,GAAG;AACjC,UAAM,IAAI,WAAW,iDAAiD;AAAA,EACxE;AACA,QAAM,UAAoB,CAAC;AAC3B,MAAI,MAAM;AACV,SAAO,MAAM,MAAM,GAAG;AACpB,YAAQ,KAAK,CAAC;AACd,WAAO;AAAA,EACT;AACA,WAAS,IAAI,GAAG,KAAK,KAAK,KAAK,GAAG,GAAG,KAAK,GAAG;AAC3C,WAAO,MAAM,MAAM,GAAG;AACpB,cAAQ,KAAK,CAAC;AACd,aAAO;AAAA,IACT;AAAA,EACF;AACA,MAAI,MAAM,EAAG,SAAQ,KAAK,GAAG;AAC7B,SAAO;AACT;AASO,SAAS,UAAU,GAAmB;AAC3C,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI,GAAG;AACjC,UAAM,IAAI,WAAW,2CAA2C;AAAA,EAClE;AACA,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,IAAI;AACR,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,UAAM,OAAO,IAAI;AACjB,QAAI;AACJ,QAAI;AAAA,EACN;AACA,SAAO;AACT;AAQO,SAAS,OAAO,GAAoB;AACzC,SAAO,IAAI,MAAM;AACnB;AAQO,SAAS,MAAM,GAAoB;AACxC,SAAO,IAAI,MAAM;AACnB;AAQO,SAAS,KAAK,GAAmB;AACtC,MAAI,IAAI,EAAG,QAAO;AAClB,MAAI,IAAI,EAAG,QAAO;AAClB,SAAO;AACT;AASA,SAAS,eAAe,GAAiB;AACvC,MAAI,EAAE,WAAW,EAAG,OAAM,IAAI,WAAW,wBAAwB;AACjE,QAAM,OAAO,EAAE,CAAC,EAAG;AACnB,MAAI,SAAS,EAAG,OAAM,IAAI,WAAW,6BAA6B;AAClE,MAAI,EAAE,KAAK,SAAO,IAAI,WAAW,IAAI,GAAG;AACtC,UAAM,IAAI,WAAW,oCAAoC;AAAA,EAC3D;AACF;AASO,SAAS,UAAU,GAAW,GAAmB;AACtD,MAAI,EAAE,WAAW,EAAE,UAAU,EAAE,CAAC,EAAG,WAAW,EAAE,CAAC,EAAG,QAAQ;AAC1D,UAAM,IAAI,WAAW,iDAAiD;AAAA,EACxE;AACA,iBAAe,CAAC;AAChB,SAAO,EAAE,IAAI,CAAC,KAAK,MAAM,IAAI,IAAI,CAAC,KAAK,MAAM,MAAM,EAAE,CAAC,EAAG,CAAC,CAAE,CAAC;AAC/D;AASO,SAAS,UAAU,GAAW,GAAmB;AACtD,MAAI,EAAE,WAAW,EAAE,UAAU,EAAE,CAAC,EAAG,WAAW,EAAE,CAAC,EAAG,QAAQ;AAC1D,UAAM,IAAI,WAAW,oDAAoD;AAAA,EAC3E;AACA,iBAAe,CAAC;AAChB,SAAO,EAAE,IAAI,CAAC,KAAK,MAAM,IAAI,IAAI,CAAC,KAAK,MAAM,MAAM,EAAE,CAAC,EAAG,CAAC,CAAE,CAAC;AAC/D;AASO,SAAS,UAAU,GAAW,GAAmB;AACtD,MAAI,EAAE,WAAW,EAAE,UAAU,EAAE,CAAC,EAAG,WAAW,EAAE,CAAC,EAAG,QAAQ;AAC1D,UAAM,IAAI,WAAW,oEAAoE;AAAA,EAC3F;AACA,iBAAe,CAAC;AAChB,SAAO,EAAE,IAAI,CAAC,KAAK,MAAM,IAAI,IAAI,CAAC,KAAK,MAAM,MAAM,EAAE,CAAC,EAAG,CAAC,CAAE,CAAC;AAC/D;AASO,SAAS,YAAY,GAAW,QAAwB;AAC7D,iBAAe,CAAC;AAChB,SAAO,EAAE,IAAI,SAAO,IAAI,IAAI,SAAO,MAAM,MAAM,CAAC;AAClD;AAQO,SAAS,gBAAgB,GAAmB;AACjD,MAAI,EAAE,WAAW,EAAG,QAAO,CAAC;AAC5B,iBAAe,CAAC;AAChB,SAAO,EAAE,CAAC,EAAG,IAAI,CAAC,GAAG,MAAM,EAAE,IAAI,SAAO,IAAI,CAAC,CAAE,CAAC;AAClD;AAQO,SAAS,kBAAkB,GAAmB;AACnD,iBAAe,CAAC;AAChB,QAAM,IAAI,EAAE;AACZ,MAAI,EAAE,KAAK,SAAO,IAAI,WAAW,CAAC,GAAG;AACnC,UAAM,IAAI,WAAW,uCAAuC;AAAA,EAC9D;AACA,MAAI,IAAI,GAAG;AACT,UAAM,IAAI,WAAW,iDAAiD;AAAA,EACxE;AACA,MAAI,MAAM,EAAG,QAAO,EAAE,CAAC,EAAG,CAAC;AAC3B,MAAI,MAAM,EAAG,QAAO,EAAE,CAAC,EAAG,CAAC,IAAK,EAAE,CAAC,EAAG,CAAC,IAAK,EAAE,CAAC,EAAG,CAAC,IAAK,EAAE,CAAC,EAAG,CAAC;AAC/D,QAAM,CAAC,KAAK,KAAK,GAAG,IAAI,EAAE,CAAC;AAC3B,QAAM,CAAC,KAAK,KAAK,GAAG,IAAI,EAAE,CAAC;AAC3B,QAAM,CAAC,KAAK,KAAK,GAAG,IAAI,EAAE,CAAC;AAC3B,SAAO,OAAQ,MAAO,MAAO,MAAO,OAC7B,OAAQ,MAAO,MAAO,MAAO,OAC7B,OAAQ,MAAO,MAAO,MAAO;AACtC;AAQO,SAAS,cAAc,GAAmB;AAC/C,QAAM,MAAM,kBAAkB,CAAC;AAC/B,MAAI,QAAQ,EAAG,OAAM,IAAI,WAAW,2CAA2C;AAC/E,QAAM,IAAI,EAAE;AACZ,MAAI,MAAM,EAAG,QAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAG,CAAC,CAAE,CAAC;AACpC,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,MACL,CAAC,EAAE,CAAC,EAAG,CAAC,IAAK,KAAK,CAAC,EAAE,CAAC,EAAG,CAAC,IAAK,GAAG;AAAA,MAClC,CAAC,CAAC,EAAE,CAAC,EAAG,CAAC,IAAK,KAAK,EAAE,CAAC,EAAG,CAAC,IAAK,GAAG;AAAA,IACpC;AAAA,EACF;AACA,QAAM,CAAC,KAAK,KAAK,GAAG,IAAI,EAAE,CAAC;AAC3B,QAAM,CAAC,KAAK,KAAK,GAAG,IAAI,EAAE,CAAC;AAC3B,QAAM,CAAC,KAAK,KAAK,GAAG,IAAI,EAAE,CAAC;AAC3B,SAAO;AAAA,IACL,EAAE,MAAO,MAAO,MAAO,OAAQ,KAAK,EAAE,MAAO,MAAO,MAAO,OAAQ,MAAM,MAAO,MAAO,MAAO,OAAQ,GAAG;AAAA,IACzG,CAAC,EAAE,MAAO,MAAO,MAAO,OAAQ,MAAM,MAAO,MAAO,MAAO,OAAQ,KAAK,EAAE,MAAO,MAAO,MAAO,OAAQ,GAAG;AAAA,IAC1G,EAAE,MAAO,MAAO,MAAO,OAAQ,KAAK,EAAE,MAAO,MAAO,MAAO,OAAQ,MAAM,MAAO,MAAO,MAAO,OAAQ,GAAG;AAAA,EAC3G;AACF;AAQO,SAAS,eAAe,GAAmB;AAChD,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI,GAAG;AACjC,UAAM,IAAI,WAAW,wCAAwC;AAAA,EAC/D;AACA,SAAO,MAAM;AAAA,IAAK,EAAE,QAAQ,EAAE;AAAA,IAAG,CAAC,GAAG,MACnC,MAAM,KAAK,EAAE,QAAQ,EAAE,GAAG,CAACC,IAAG,MAAO,MAAM,IAAI,IAAI,CAAE;AAAA,EACvD;AACF;AASO,SAAS,eAAe,GAAW,GAAmB;AAC3D,iBAAe,CAAC;AAChB,iBAAe,CAAC;AAChB,MAAI,EAAE,CAAC,EAAG,WAAW,EAAE,QAAQ;AAC7B,UAAM,IAAI,WAAW,mDAAmD;AAAA,EAC1E;AACA,QAAM,SAAiB,MAAM;AAAA,IAAK,EAAE,QAAQ,EAAE,OAAO;AAAA,IAAG,MACtD,MAAM,EAAE,CAAC,EAAG,MAAM,EAAE,KAAK,CAAC;AAAA,EAC5B;AACA,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,aAAS,IAAI,GAAG,IAAI,EAAE,CAAC,EAAG,QAAQ,KAAK;AACrC,eAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,eAAO,CAAC,EAAG,CAAC,KAAK,OAAO,CAAC,EAAG,CAAC,KAAK,MAAM,EAAE,CAAC,EAAG,CAAC,KAAK,MAAM,EAAE,CAAC,EAAG,CAAC,KAAK;AAAA,MACxE;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAQO,SAAS,YAAY,GAAmB;AAC7C,iBAAe,CAAC;AAChB,QAAM,IAAI,EAAE;AACZ,MAAI,EAAE,KAAK,SAAO,IAAI,WAAW,CAAC,GAAG;AACnC,UAAM,IAAI,WAAW,iCAAiC;AAAA,EACxD;AACA,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAS,EAAE,CAAC,EAAG,CAAC;AAAA,EAClB;AACA,SAAO;AACT;AAOO,IAAM,UAAN,MAAM,SAAQ;AAAA,EACnB,YAES,IAEA,KAAa,GACpB;AAHO;AAEA;AAAA,EACN;AAAA,EAHM;AAAA,EAEA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAST,IAAI,OAAyB;AAC3B,WAAO,IAAI,SAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,KAAK,MAAM,EAAE;AAAA,EAC3D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,OAAyB;AAC3B,WAAO,IAAI,SAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,KAAK,MAAM,EAAE;AAAA,EAC3D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,OAAyB;AAC3B,WAAO,IAAI;AAAA,MACT,KAAK,KAAK,MAAM,KAAK,KAAK,KAAK,MAAM;AAAA,MACrC,KAAK,KAAK,MAAM,KAAK,KAAK,KAAK,MAAM;AAAA,IACvC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,IAAI,OAAyB;AAC3B,UAAM,QAAQ,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM;AACrD,QAAI,UAAU,EAAG,OAAM,IAAI,oBAAoB;AAC/C,WAAO,IAAI;AAAA,OACR,KAAK,KAAK,MAAM,KAAK,KAAK,KAAK,MAAM,MAAM;AAAA,OAC3C,KAAK,KAAK,MAAM,KAAK,KAAK,KAAK,MAAM,MAAM;AAAA,IAC9C;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAc;AACZ,WAAO,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,EAAE;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAgB;AACd,WAAO,IAAI,SAAQ,KAAK,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,KAAK,EAAE;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAc;AACZ,WAAO,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,GAAoB;AACtB,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,QAAQ,KAAK,IAAI;AACvB,WAAO,SAAQ,UAAU,KAAK,IAAI,GAAG,CAAC,GAAG,QAAQ,CAAC;AAAA,EACpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAgB;AACd,UAAM,IAAI,KAAK,IAAI;AACnB,UAAM,QAAQ,KAAK,IAAI;AACvB,WAAO,SAAQ,UAAU,KAAK,KAAK,CAAC,GAAG,QAAQ,CAAC;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAe;AACb,WAAO,IAAI;AAAA,MACT,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAI,KAAK,EAAE;AAAA,MACpC,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAI,KAAK,EAAE;AAAA,IACtC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAe;AACb,WAAO,IAAI,SAAQ,KAAK,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAe;AACb,WAAO,IAAI;AAAA,MACT,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,KAAK,KAAK,EAAE;AAAA,MACrC,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,KAAK,KAAK,EAAE;AAAA,IACvC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAe;AACb,WAAO,IAAI;AAAA,MACT,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,KAAK,KAAK,EAAE;AAAA,MACrC,CAAC,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,KAAK,KAAK,EAAE;AAAA,IACxC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAmB;AACjB,QAAI,KAAK,OAAO,EAAG,QAAO,GAAG,KAAK,EAAE;AACpC,QAAI,KAAK,OAAO,EAAG,QAAO,GAAG,KAAK,EAAE;AACpC,QAAI,KAAK,KAAK,EAAG,QAAO,GAAG,KAAK,EAAE,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;AACzD,WAAO,GAAG,KAAK,EAAE,MAAM,KAAK,EAAE;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,UAAU,GAAW,OAAwB;AAClD,WAAO,IAAI,SAAQ,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK,IAAI,KAAK,CAAC;AAAA,EAC7D;AAAA;AAAA,EAGA,IAAI,OAAe;AACjB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,OAAe;AACjB,WAAO,KAAK;AAAA,EACd;AACF;AAaO,SAAS,iBAAiB,WAAmB,MAAc,MAAc,IAAY,IAAY;AACtG,SAAO,YAAY,KAAK,IAAI,IAAI,OAAO,GAAG,IAAI,IAAI;AACpD;AAUO,SAAS,YAAY,IAAY,MAAc,MAAsB;AAC1E,SAAO,KAAK,KAAK,IAAI,IAAI,MAAM,IAAI;AACrC;AAUO,SAAS,aAAa,IAAY,MAAc,MAAsB;AAC3E,SAAO,KAAK,KAAK,IAAI,IAAI,MAAM,IAAI;AACrC;AAWO,SAAS,IAAI,MAAc,MAAc,IAAY,KAAa,GAAW;AAClF,MAAI,SAAS,EAAG,QAAO,EAAE,KAAK,MAAM;AACpC,QAAM,OAAO,KAAK,IAAI,IAAI,MAAM,IAAI;AACpC,SAAO,EAAE,KAAK,OAAO,QAAQ,OAAO,KAAK;AAC3C;AASO,SAAS,IAAI,MAAc,WAA6B;AAC7D,MAAI,UAAU,WAAW,EAAG,QAAO;AACnC,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,cAAU,UAAU,CAAC,IAAK,KAAK,IAAI,IAAI,MAAM,CAAC;AAAA,EAChD;AACA,SAAO;AACT;AAQO,SAAS,IAAI,WAA6B;AAC/C,MAAI,UAAU,SAAS,GAAG;AACxB,UAAM,IAAI,WAAW,mCAAmC;AAAA,EAC1D;AACA,MAAI,QAAQ;AACZ,QAAM,YAAY;AAClB,QAAM,UAAU;AAChB,WAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,QAAI,SAAS;AACb,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,gBAAU,UAAU,CAAC,IAAK,KAAK,IAAI,IAAI,OAAO,CAAC;AAC/C,cAAQ,IAAI,UAAU,CAAC,IAAK,KAAK,IAAI,IAAI,OAAO,IAAI,CAAC;AAAA,IACvD;AACA,QAAI,KAAK,IAAI,MAAM,IAAI,UAAW,QAAO;AACzC,QAAI,SAAS,EAAG,QAAO;AACvB,aAAS,SAAS;AAAA,EACpB;AACA,SAAO;AACT;AASO,SAAS,IAAI,MAAc,MAAsB;AACtD,MAAI,SAAS,EAAG,OAAM,IAAI,WAAW,qBAAqB;AAC1D,UAAQ,OAAO,QAAQ;AACzB;AAUO,SAAS,qBACd,WACA,MACA,MAC6F;AAC7F,QAAM,UAAU,CAAC,IAAI,MAAM,MAAM,SAAS;AAC1C,MAAI,UAAU;AACd,QAAM,WAAwG,CAAC;AAC/G,WAAS,SAAS,GAAG,UAAU,MAAM,UAAU;AAC7C,UAAM,WAAW,UAAU;AAC3B,UAAM,gBAAgB,UAAU;AAChC,eAAW;AACX,aAAS,KAAK;AAAA,MACZ;AAAA,MACA,SAAS,KAAK,MAAM,UAAU,GAAG,IAAI;AAAA,MACrC,UAAU,KAAK,MAAM,WAAW,GAAG,IAAI;AAAA,MACvC,WAAW,KAAK,MAAM,gBAAgB,GAAG,IAAI;AAAA,MAC7C,SAAS,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,IAAI,GAAG,IAAI;AAAA,IACpD,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAWO,SAAS,aAAa,OAAe,GAAGC,UAAiB,GAAW;AACzE,MAAI,IAAI;AACR,MAAI,IAAI;AACR,SAAO,MAAM,EAAG,KAAI,KAAK,OAAO;AAChC,SAAO,MAAM,EAAG,KAAI,KAAK,OAAO;AAChC,QAAM,IAAI,KAAK,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC;AAChE,SAAO,OAAO,IAAIA;AACpB;AAQO,SAAS,cAAc,QAAwB;AACpD,MAAI,UAAU,EAAG,OAAM,IAAI,WAAW,yBAAyB;AAC/D,QAAM,IAAI,KAAK,IAAI,CAAC,MAAM;AAC1B,MAAI,IAAI;AACR,MAAI,IAAI;AACR,KAAG;AACD;AACA,SAAK,KAAK,OAAO;AAAA,EACnB,SAAS,IAAI;AACb,SAAO,IAAI;AACb;AASO,SAAS,eAAe,GAAW,GAAmB;AAC3D,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI,EAAG,OAAM,IAAI,WAAW,kCAAkC;AAC1F,MAAI,IAAI,KAAK,IAAI,EAAG,OAAM,IAAI,WAAW,2BAA2B;AACpE,MAAI,YAAY;AAChB,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,KAAK,OAAO,IAAI,EAAG;AAAA,EACzB;AACA,SAAO;AACT;AAQO,SAAS,kBAAkB,QAAwB;AACxD,MAAI,UAAU,EAAG,OAAM,IAAI,WAAW,yBAAyB;AAC/D,SAAO,CAAC,KAAK,IAAI,IAAI,KAAK,OAAO,CAAC,IAAI;AACxC;AASO,SAAS,cAAc,MAAc,GAAG,MAAc,GAAW;AACtE,SAAO,KAAK,OAAO,KAAK,MAAM,OAAO;AACvC;AAYO,SAAS,WAAW,GAA0B,GAAW,IAAY,OAAe;AACzF,UAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,IAAI;AACtC;AAWO,SAAS,SAAS,GAA0B,GAAW,GAAW,IAAY,KAAa;AAChG,MAAI,IAAI,MAAM,GAAG;AACf,UAAM,IAAI,WAAW,wDAAyD;AAAA,EAChF;AACA,QAAM,KAAK,IAAI,KAAK;AACpB,MAAIC,OAAM,EAAE,CAAC,IAAI,EAAE,CAAC;AACpB,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,IAAI,IAAI,IAAI;AAClB,IAAAA,QAAO,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;AAAA,EACzC;AACA,SAAQ,IAAI,IAAKA;AACnB;AAWO,SAAS,YAAY,GAA0B,GAAW,GAAW,IAAY,KAAa;AACnG,QAAM,KAAK,IAAI,KAAK;AACpB,MAAIA,QAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK;AAC1B,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,IAAAA,QAAO,EAAE,IAAI,IAAI,CAAC;AAAA,EACpB;AACA,SAAO,IAAIA;AACb;AAWO,SAAS,WACd,GACA,OACA,YAAoB,MACpB,UAAkB,KACV;AACR,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,UAAM,KAAK,EAAE,CAAC;AACd,QAAI,KAAK,IAAI,EAAE,IAAI,UAAW,QAAO;AACrC,UAAM,KAAK,WAAW,GAAG,CAAC;AAC1B,QAAI,OAAO,EAAG,QAAO;AACrB,SAAK,KAAK;AAAA,EACZ;AACA,SAAO;AACT;AAUO,SAAS,KAAK,GAAW,GAAW,GAAmB;AAC5D,SAAO,KAAK,IAAI,KAAK;AACvB;AAYO,SAAS,SAAS,OAAe,OAAe,OAAe,QAAgB,QAAwB;AAC5G,MAAI,UAAU,MAAO,OAAM,IAAI,WAAW,4BAA4B;AACtE,UAAS,QAAQ,UAAU,QAAQ,UAAW,SAAS,UAAU;AACnE;;;ACpgDO,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,MAAYC,UAAiB,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,QAAMC,OAAM,CAAC,GAAW,MAAc,MAAc,OAAO,CAAC,EAAE,SAAS,KAAK,GAAG;AAE/E,SAAOD,QACJ,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,OAAOC,KAAI,QAAQ,CAAC,CAAC,EAC7B,QAAQ,OAAOA,KAAI,GAAG,CAAC,EACvB,QAAQ,OAAOA,KAAI,KAAK,CAAC,EACzB,QAAQ,OAAOA,KAAI,OAAO,CAAC,EAC3B,QAAQ,OAAOA,KAAI,OAAO,CAAC,EAC3B,QAAQ,QAAQA,KAAI,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;;;AC9cO,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;;;ACtNA,IAAM,MAAM;AAQL,SAAS,QAAQ,UAA4B;AAClD,QAAM,QAAkB,CAAC;AACzB,aAAW,OAAO,UAAU;AAC1B,QAAI,QAAQ,GAAI;AAChB,UAAM,QAAQ,IAAI,MAAM,OAAO;AAC/B,eAAW,QAAQ,OAAO;AACxB,UAAI,SAAS,MAAM,SAAS,IAAK;AACjC,UAAI,SAAS,MAAM;AACjB,YAAI,MAAM,SAAS,KAAK,MAAM,MAAM,SAAS,CAAC,MAAM,MAAM;AACxD,gBAAM,IAAI;AAAA,QACZ,OAAO;AACL,gBAAM,KAAK,IAAI;AAAA,QACjB;AAAA,MACF,OAAO;AACL,cAAM,KAAK,IAAI;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AACA,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,QAAM,SAAS,MAAM,KAAK,GAAG;AAC7B,MAAI,SAAS,SAAS,KAAK,SAAS,CAAC,EAAG,WAAW,GAAG,GAAG;AACvD,WAAO,MAAM;AAAA,EACf;AACA,SAAO;AACT;AAQO,SAAS,WAAW,UAA4B;AACrD,MAAI,WAAW;AACf,MAAI,QAAQ;AAEZ,aAAW,OAAO,UAAU;AAC1B,QAAI,IAAI,WAAW,GAAG,GAAG;AACvB,iBAAW;AACX,cAAQ;AAAA,IACV,WAAW,OAAO;AAChB,iBAAW,KAAK,UAAU,GAAG;AAAA,IAC/B,OAAO;AACL,iBAAW,WAAW,KAAK,UAAU,GAAG,IAAI;AAAA,IAC9C;AAAA,EACF;AAEA,MAAI,CAAC,OAAO;AACV,eAAW,KAAK,KAAK,QAAQ;AAAA,EAC/B;AAEA,SAAO,UAAU,QAAQ;AAC3B;AASO,SAAS,SAAS,GAAW,KAAsB;AACxD,QAAM,aAAa,EAAE,QAAQ,WAAW,EAAE;AAC1C,QAAM,MAAM,WAAW,YAAY,GAAG;AACtC,MAAI,OAAO,QAAQ,KAAK,aAAa,WAAW,MAAM,MAAM,CAAC;AAC7D,MAAI,OAAO,KAAK,SAAS,GAAG,GAAG;AAC7B,WAAO,KAAK,MAAM,GAAG,CAAC,IAAI,MAAM;AAAA,EAClC;AACA,SAAO;AACT;AAQO,SAAS,QAAQ,GAAmB;AACzC,MAAI,MAAM,IAAK,QAAO;AACtB,QAAM,aAAa,EAAE,QAAQ,WAAW,EAAE;AAC1C,MAAI,eAAe,GAAI,QAAO;AAC9B,QAAM,MAAM,WAAW,YAAY,GAAG;AACtC,MAAI,QAAQ,GAAI,QAAO;AACvB,MAAI,QAAQ,EAAG,QAAO;AACtB,SAAO,WAAW,MAAM,GAAG,GAAG;AAChC;AAQO,SAAS,QAAQ,GAAmB;AACzC,QAAM,OAAO,SAAS,CAAC;AACvB,QAAM,MAAM,KAAK,YAAY,GAAG;AAChC,MAAI,QAAQ,MAAM,QAAQ,EAAG,QAAO;AACpC,SAAO,KAAK,MAAM,GAAG;AACvB;AAQO,SAAS,UAAU,GAAmB;AAC3C,QAAM,QAAQ,EAAE,MAAM,QAAQ;AAC9B,QAAM,QAAkB,CAAC;AACzB,MAAI,QAAQ,EAAE,WAAW,GAAG;AAE5B,aAAW,QAAQ,OAAO;AACxB,QAAI,SAAS,MAAM,SAAS,IAAK;AACjC,QAAI,SAAS,MAAM;AACjB,UAAI,MAAM,SAAS,KAAK,MAAM,MAAM,SAAS,CAAC,MAAM,MAAM;AACxD,cAAM,IAAI;AAAA,MACZ,WAAW,CAAC,OAAO;AACjB,cAAM,KAAK,IAAI;AAAA,MACjB;AAAA,IACF,OAAO;AACL,YAAM,KAAK,IAAI;AAAA,IACjB;AAAA,EACF;AAEA,QAAM,SAAS,MAAM,KAAK,GAAG;AAC7B,MAAI,MAAO,QAAO,MAAM;AACxB,MAAI,WAAW,GAAI,QAAO;AAC1B,SAAO;AACT;AAQO,SAAS,WAAW,GAAoB;AAC7C,SAAO,EAAE,WAAW,GAAG;AACzB;AASO,SAAS,SAAS,MAAc,IAAoB;AACzD,QAAM,YAAY,UAAU,IAAI,EAAE,MAAM,GAAG;AAC3C,QAAM,UAAU,UAAU,EAAE,EAAE,MAAM,GAAG;AAEvC,MAAI,IAAI;AACR,SAAO,IAAI,UAAU,UAAU,IAAI,QAAQ,UAAU,UAAU,CAAC,MAAM,QAAQ,CAAC,GAAG;AAChF;AAAA,EACF;AAEA,QAAM,KAAK,UAAU,MAAM,CAAC,EAAE,IAAI,MAAM,IAAI;AAC5C,QAAM,OAAO,QAAQ,MAAM,CAAC;AAC5B,QAAM,SAAS,CAAC,GAAG,IAAI,GAAG,IAAI,EAAE,KAAK,GAAG;AAExC,SAAO,UAAU;AACnB;AAgBO,SAAS,MAAM,GAAuB;AAC3C,QAAM,OAAO,EAAE,WAAW,GAAG,IAAI,MAAM;AACvC,QAAM,OAAO,SAAS,CAAC;AACvB,QAAM,MAAM,QAAQ,IAAI;AACxB,QAAM,OAAO,MAAM,KAAK,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI;AAChD,QAAM,MAAM,OAAO,QAAQ,CAAC,IAAK,QAAQ,CAAC,MAAM,MAAM,KAAK,QAAQ,CAAC;AAEpE,SAAO,EAAE,MAAM,KAAK,MAAM,MAAM,IAAI;AACtC;AAQO,SAAS,OAAO,QAAqC;AAC1D,QAAM,EAAE,OAAO,IAAI,MAAM,IAAI,OAAO,IAAI,OAAO,IAAI,MAAM,GAAG,IAAI;AAChE,QAAM,WAAW,QAAQ,OAAO;AAChC,MAAI,KAAK;AACP,WAAO,MAAM,MAAM;AAAA,EACrB;AACA,SAAO,OAAO;AAChB;;;AC1MO,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,aAAWC,QAAO,OAAO;AACvB,eAAW,QAAQA,MAAK;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;;;AClMA,IAAM,gBAAgB;AAEtB,SAAS,WAAW,KAAuB;AACzC,SAAO,IAAI,MAAM,aAAa,KAAK,CAAC;AACtC;AAKO,SAAS,WAAW,KAAqB;AAC9C,MAAI,IAAI,WAAW,EAAG,QAAO;AAC7B,SAAO,IAAI,CAAC,EAAG,YAAY,IAAI,IAAI,MAAM,CAAC,EAAE,YAAY;AAC1D;AAKO,SAAS,UAAU,KAAqB;AAC7C,QAAMC,SAAQ,WAAW,GAAG;AAC5B,MAAIA,OAAM,WAAW,EAAG,QAAO;AAC/B,QAAM,CAAC,WAAW,GAAG,IAAI,IAAIA;AAC7B,SAAO,UAAW,YAAY,IAAI,KAAK,IAAI,OAAK,EAAE,CAAC,EAAG,YAAY,IAAI,EAAE,MAAM,CAAC,EAAE,YAAY,CAAC,EAAE,KAAK,EAAE;AACzG;AAKO,SAAS,UAAU,KAAqB;AAC7C,SAAO,WAAW,GAAG,EAAE,IAAI,OAAK,EAAE,YAAY,CAAC,EAAE,KAAK,GAAG;AAC3D;AAKO,SAAS,UAAU,KAAqB;AAC7C,SAAO,WAAW,GAAG,EAAE,IAAI,OAAK,EAAE,YAAY,CAAC,EAAE,KAAK,GAAG;AAC3D;AAKO,SAAS,WAAW,KAAqB;AAC9C,SAAO,WAAW,GAAG,EAAE,IAAI,OAAK,EAAE,CAAC,EAAG,YAAY,IAAI,EAAE,MAAM,CAAC,EAAE,YAAY,CAAC,EAAE,KAAK,EAAE;AACzF;AAKO,SAAS,SAAS,KAAa,WAAmB,SAAS,OAAe;AAC/E,MAAI,IAAI,UAAU,UAAW,QAAO;AACpC,SAAO,IAAI,MAAM,GAAG,KAAK,IAAI,GAAG,YAAY,OAAO,MAAM,CAAC,IAAI;AAChE;AAOO,SAAS,SAAS,KAAa,MAA+C;AACnF,SAAO,IAAI,QAAQ,kBAAkB,CAAC,GAAG,QAAgB;AACvD,UAAM,QAAQ,KAAK,GAAG;AACtB,WAAO,UAAU,SAAY,OAAO,KAAK,IAAI,KAAK,GAAG;AAAA,EACvD,CAAC;AACH;AAMO,SAAS,OAAe;AAC7B,MAAI,OAAO,WAAW,eAAe,OAAO,OAAO,eAAe,YAAY;AAC5E,WAAO,OAAO,WAAW;AAAA,EAC3B;AACA,QAAM,MAAM;AACZ,QAAM,QAAkB,CAAC;AACzB,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,QAAI,MAAM,KAAK,MAAM,MAAM,MAAM,MAAM,MAAM,IAAI;AAC/C,YAAM,KAAK,GAAG;AAAA,IAChB,WAAW,MAAM,IAAI;AACnB,YAAM,KAAK,GAAG;AAAA,IAChB,WAAW,MAAM,IAAI;AACnB,YAAM,KAAK,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,CAAE;AAAA,IACpD,OAAO;AACL,YAAM,KAAK,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,EAAE,CAAC,CAAE;AAAA,IACjD;AAAA,EACF;AACA,SAAO,MAAM,KAAK,EAAE;AACtB;AAOO,SAAS,OAAO,OAAO,IAAI,WAAW,oEAA4E;AACvH,QAAM,MAAM,SAAS;AACrB,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,cAAU,SAAS,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG,CAAC;AAAA,EACpD;AACA,SAAO;AACT;AAEA,IAAM,kBAA0C;AAAA,EAC9C,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AACP;AAEA,IAAM,oBAA4C;AAAA,EAChD,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,SAAS;AAAA,EACT,UAAU;AACZ;AAKO,SAAS,WAAW,KAAqB;AAC9C,SAAO,IAAI,QAAQ,YAAY,QAAM,gBAAgB,EAAE,KAAK,EAAE;AAChE;AAKO,SAAS,aAAa,KAAqB;AAChD,SAAO,IAAI,QAAQ,kCAAkC,YAAU,kBAAkB,MAAM,KAAK,MAAM;AACpG;AAKO,SAAS,KAAK,KAAqB;AACxC,SAAO,IAAI,KAAK;AAClB;AAKO,SAAS,UAAU,KAAqB;AAC7C,SAAO,IAAI,UAAU;AACvB;AAKO,SAAS,QAAQ,KAAqB;AAC3C,SAAO,IAAI,QAAQ;AACrB;AAKO,SAAS,IAAI,KAAa,QAAgB,OAAO,KAAa;AACnE,QAAM,eAAe,KAAK,IAAI,GAAG,SAAS,IAAI,MAAM;AACpD,QAAM,UAAU,KAAK,MAAM,eAAe,CAAC;AAC3C,QAAM,WAAW,eAAe;AAChC,SAAO,KAAK,OAAO,OAAO,IAAI,MAAM,KAAK,OAAO,QAAQ;AAC1D;AAKO,SAAS,SAAS,KAAa,QAAgB,OAAO,KAAa;AACxE,SAAO,IAAI,SAAS,QAAQ,IAAI;AAClC;AAKO,SAAS,OAAO,KAAa,QAAgB,OAAO,KAAa;AACtE,SAAO,IAAI,OAAO,QAAQ,IAAI;AAChC;AAKO,SAAS,QAAQ,KAAqB;AAC3C,SAAO,IAAI,MAAM,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE;AACxC;AAKO,SAAS,MAAM,KAAuB;AAC3C,SAAO,WAAW,GAAG;AACvB;AAKO,SAAS,QAAQ,KAAqB;AAC3C,SAAO,IACJ,YAAY,EACZ,QAAQ,aAAa,EAAE,EACvB,QAAQ,WAAW,GAAG,EACtB,QAAQ,OAAO,GAAG,EAClB,QAAQ,OAAO,EAAE,EACjB,QAAQ,OAAO,EAAE;AACtB;AAKO,SAAS,iBAAiB,KAAa,WAA2B;AACvE,MAAI,UAAU,WAAW,KAAK,IAAI,WAAW,EAAG,QAAO;AACvD,MAAI,QAAQ;AACZ,MAAI,MAAM;AACV,UAAQ,MAAM,IAAI,QAAQ,WAAW,GAAG,OAAO,IAAI;AACjD;AACA,WAAO,UAAU;AAAA,EACnB;AACA,SAAO;AACT;;;ACrNO,SAAS,MAAM,IAA2B;AAC/C,SAAO,IAAI,QAAQ,CAAAC,aAAW,WAAWA,UAAS,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,CAAAA,aAAW;AACvD,YAAQ,WAAW,MAAMA,SAAQ,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,MAAIA;AACJ,MAAI;AACJ,QAAM,UAAU,IAAI,QAAW,CAAC,KAAK,QAAQ;AAC3C,IAAAA,WAAU;AACV,aAAS;AAAA,EACX,CAAC;AACD,SAAO,EAAE,SAAS,SAAAA,UAAS,OAAO;AACpC;;;AC1GO,SAAS,SAAS,OAAe,SAAgD;AACtF,QAAM,EAAE,YAAY,KAAK,SAAS,MAAM,iBAAiB,KAAK,IAAI,WAAW,CAAC;AAE9E,QAAM,QAAQ,MAAM,MAAM,OAAO;AACjC,QAAM,OAAmB,CAAC;AAE1B,aAAW,QAAQ,OAAO;AACxB,UAAM,UAAU,KAAK,KAAK;AAC1B,QAAI,kBAAkB,QAAQ,WAAW,EAAG;AAC5C,UAAM,SAAS,aAAa,SAAS,SAAS;AAC9C,SAAK,KAAK,MAAM;AAAA,EAClB;AAEA,MAAI,KAAK,WAAW,EAAG,QAAO,CAAC;AAE/B,MAAI,QAAQ;AACV,UAAM,CAAC,MAAM,GAAG,IAAI,IAAI;AACxB,QAAI,SAAS,OAAW,QAAO,CAAC;AAChC,WAAO,KAAK,IAAI,SAAO;AACrB,YAAM,SAAiC,CAAC;AACxC,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,eAAO,KAAK,CAAC,CAAE,IAAI,IAAI,CAAC,KAAK;AAAA,MAC/B;AACA,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAEA,SAAO,KAAK,IAAI,SAAO;AACrB,UAAM,SAAiC,CAAC;AACxC,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,aAAO,OAAO,CAAC,CAAC,IAAI,IAAI,CAAC;AAAA,IAC3B;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAEA,SAAS,aAAa,MAAc,WAA6B;AAC/D,QAAM,SAAmB,CAAC;AAC1B,MAAI,UAAU;AACd,MAAI,WAAW;AAEf,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,KAAK,KAAK,CAAC;AACjB,QAAI,UAAU;AACZ,UAAI,OAAO,KAAK;AACd,YAAI,KAAK,IAAI,CAAC,MAAM,KAAK;AACvB,qBAAW;AACX;AAAA,QACF,OAAO;AACL,qBAAW;AAAA,QACb;AAAA,MACF,OAAO;AACL,mBAAW;AAAA,MACb;AAAA,IACF,OAAO;AACL,UAAI,OAAO,KAAK;AACd,mBAAW;AAAA,MACb,WAAW,OAAO,WAAW;AAC3B,eAAO,KAAK,OAAO;AACnB,kBAAU;AAAA,MACZ,OAAO;AACL,mBAAW;AAAA,MACb;AAAA,IACF;AAAA,EACF;AACA,SAAO,KAAK,OAAO;AACnB,SAAO;AACT;AAKO,SAAS,aAAa,MAAiC,SAA0C;AACtG,QAAM,EAAE,YAAY,IAAI,IAAI,WAAW,CAAC;AACxC,MAAI,KAAK,WAAW,EAAG,QAAO;AAE9B,QAAM,UAAU,OAAO,KAAK,KAAK,CAAC,CAAE;AACpC,QAAM,QAAkB,CAAC,QAAQ,IAAI,OAAK,eAAe,GAAG,SAAS,CAAC,EAAE,KAAK,SAAS,CAAC;AAEvF,aAAW,UAAU,MAAM;AACzB,UAAM,MAAM,QAAQ,IAAI,OAAK,eAAe,OAAO,OAAO,CAAC,KAAK,EAAE,GAAG,SAAS,CAAC;AAC/E,UAAM,KAAK,IAAI,KAAK,SAAS,CAAC;AAAA,EAChC;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,eAAe,OAAe,WAA2B;AAChE,MAAI,MAAM,SAAS,GAAG,KAAK,MAAM,SAAS,SAAS,KAAK,MAAM,SAAS,IAAI,KAAK,MAAM,SAAS,IAAI,GAAG;AACpG,WAAO,MAAM,MAAM,QAAQ,MAAM,IAAI,IAAI;AAAA,EAC3C;AACA,SAAO;AACT;AAKO,SAAS,cAAiB,OAAe,UAAwB;AACtE,MAAI;AACF,WAAO,KAAK,MAAM,KAAK;AAAA,EACzB,QAAQ;AACN,WAAO,YAAY;AAAA,EACrB;AACF;AAKO,SAAS,IAAI,MAAc,UAA2B;AAC3D,QAAM,QAAQ,QAAQ,IAAI,IAAI;AAC9B,SAAO,SAAS,YAAY;AAC9B;AAKO,SAAS,OAAO,MAAc,UAA2B;AAC9D,QAAM,QAAQ,QAAQ,IAAI,IAAI;AAC9B,MAAI,UAAU,UAAa,UAAU,GAAI,QAAO,YAAY;AAC5D,QAAM,SAAS,OAAO,SAAS,OAAO,EAAE;AACxC,SAAO,OAAO,MAAM,MAAM,IAAK,YAAY,IAAK;AAClD;AAKO,SAAS,QAAQ,MAAc,UAA6B;AACjE,QAAM,QAAQ,QAAQ,IAAI,IAAI;AAC9B,MAAI,UAAU,UAAa,UAAU,GAAI,QAAO,YAAY;AAC5D,SAAO,UAAU,UAAU,UAAU,OAAO,UAAU;AACxD;;;AC9IO,SAAS,SAAS,OAAiC;AACxD,SAAO,OAAO,UAAU;AAC1B;AAKO,SAAS,SAAS,OAAiC;AACxD,SAAO,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK;AAC3D;AAKO,SAAS,UAAU,OAAkC;AAC1D,SAAO,OAAO,UAAU;AAC1B;AAKO,SAAS,SAAS,OAAkD;AACzE,SAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK;AAC5E;AAKO,SAAS,QAAQ,OAAoC;AAC1D,SAAO,MAAM,QAAQ,KAAK;AAC5B;AAKO,SAAS,WAAW,OAA0D;AACnF,SAAO,OAAO,UAAU;AAC1B;AAKO,SAAS,OAAO,OAA+B;AACpD,SAAO,iBAAiB,QAAQ,CAAC,OAAO,MAAM,MAAM,QAAQ,CAAC;AAC/D;AAKO,SAAS,SAAS,OAAiC;AACxD,SAAO,iBAAiB;AAC1B;AAKO,SAAS,MAAM,OAAgD;AACpE,SAAO,iBAAiB;AAC1B;AAKO,SAAS,MAAM,OAAuC;AAC3D,SAAO,iBAAiB;AAC1B;AAKO,SAAS,UAAU,OAA2C;AACnE,SAAO,iBAAiB;AAC1B;AAKO,SAAS,OAAO,OAA+B;AACpD,SAAO,UAAU;AACnB;AAKO,SAAS,YAAY,OAAoC;AAC9D,SAAO,UAAU;AACnB;AAKO,SAAS,MAAM,OAA2C;AAC/D,SAAO,UAAU,QAAQ,UAAU;AACrC;AAmBO,SAAS,cAAiB,OAAU,SAAmD;AAC5F,MAAI,UAAU,QAAQ,UAAU,QAAW;AACzC,UAAM,IAAI,MAAM,WAAW,8BAA8B;AAAA,EAC3D;AACF;AAKO,SAAS,WAAc,OAAgB,OAA+B,SAAsC;AACjH,MAAI,CAAC,MAAM,KAAK,GAAG;AACjB,UAAM,IAAI,MAAM,WAAW,oCAAoC;AAAA,EACjE;AACF;AAKO,SAAS,YAAe,OAAqB;AAClD,SAAO,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,KAAK;AAC9C;AAKO,SAAS,UAAa,OAAqB;AAChD,SAAO,YAAY,KAAK;AAC1B;AAQO,SAASC,SAAQ,OAAwB;AAC9C,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,MAAI,OAAO,UAAU,UAAW,QAAO;AACvC,MAAI,OAAO,UAAU,WAAY,QAAO;AACxC,MAAI,OAAO,UAAU,UAAU;AAC7B,QAAI,OAAO,MAAM,KAAK,EAAG,QAAO;AAChC,QAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,WAAO;AAAA,EACT;AACA,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO;AACjC,MAAI,iBAAiB,KAAM,QAAO;AAClC,MAAI,iBAAiB,OAAQ,QAAO;AACpC,MAAI,iBAAiB,IAAK,QAAO;AACjC,MAAI,iBAAiB,IAAK,QAAO;AACjC,MAAI,iBAAiB,QAAS,QAAO;AACrC,SAAO;AACT;","names":["resolve","sample","stddev","_","stddev","sum","format","pad","sub","words","resolve","getType"]}
+{"version":3,"sources":["../src/core/index.ts","../src/math/index.ts","../src/date/index.ts","../src/crypto/index.ts","../src/path/index.ts","../src/collection/index.ts","../src/string/index.ts","../src/async/index.ts","../src/io/index.ts","../src/type/index.ts","../src/dep-exray/scanner/index.ts","../src/dep-exray/known-mappings.ts","../src/dep-exray/reporter/index.ts","../src/dep-exray/analyzer/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","/**\r\n * Error thrown when attempting to divide by zero.\r\n */\r\nexport class DivisionByZeroError extends Error {\r\n  constructor() {\r\n    super('Division by zero')\r\n    this.name = 'DivisionByZeroError'\r\n  }\r\n}\r\n\r\nfunction getPrecision(value: number): number {\r\n  if (!isFinite(value)) return 0\r\n  const eIndex = String(value).indexOf('e')\r\n  if (eIndex > -1) {\r\n    const exp = parseInt(String(value).slice(eIndex + 1), 10)\r\n    if (exp < 0) return Math.abs(exp)\r\n    return 0\r\n  }\r\n  const str = String(value)\r\n  const dot = str.indexOf('.')\r\n  return dot === -1 ? 0 : str.length - dot - 1\r\n}\r\n\r\nfunction toPrecisionFactor(a: number, b: number): number {\r\n  return Math.pow(10, Math.max(getPrecision(a), getPrecision(b)))\r\n}\r\n\r\n/**\r\n * Safely adds two numbers, handling floating-point precision.\r\n *\r\n * @param a - First number.\r\n * @param b - Second number.\r\n * @returns The sum.\r\n */\r\nexport function add(a: number, b: number): number {\r\n  const factor = toPrecisionFactor(a, b)\r\n  return (Math.round(a * factor) + Math.round(b * factor)) / factor\r\n}\r\n\r\n/**\r\n * Safely subtracts two numbers, handling floating-point precision.\r\n *\r\n * @param a - First number.\r\n * @param b - Second number.\r\n * @returns The difference.\r\n */\r\nexport function sub(a: number, b: number): number {\r\n  const factor = toPrecisionFactor(a, b)\r\n  return (Math.round(a * factor) - Math.round(b * factor)) / factor\r\n}\r\n\r\n/**\r\n * Safely multiplies two numbers, handling floating-point precision.\r\n *\r\n * @param a - First number.\r\n * @param b - Second number.\r\n * @returns The product.\r\n */\r\nexport function mul(a: number, b: number): number {\r\n  const factorA = toPrecisionFactor(a, 1)\r\n  const factorB = toPrecisionFactor(1, b)\r\n  const result = (Math.round(a * factorA) * Math.round(b * factorB)) / (factorA * factorB)\r\n  return result\r\n}\r\n\r\n/**\r\n * Safely divides two numbers.\r\n *\r\n * @param a - The dividend.\r\n * @param b - The divisor.\r\n * @returns The quotient.\r\n * @throws {DivisionByZeroError} If `b` is zero.\r\n */\r\nexport function div(a: number, b: number): number {\r\n  if (b === 0) throw new DivisionByZeroError()\r\n  const factor = toPrecisionFactor(a, b)\r\n  return Math.round(a * factor) / Math.round(b * factor)\r\n}\r\n\r\n/**\r\n * Rounds a number to the given precision.\r\n *\r\n * @param value - The number to round.\r\n * @param precision - Number of decimal places (default 0).\r\n * @returns The rounded value.\r\n */\r\nexport function round(value: number, precision: number = 0): number {\r\n  const factor = Math.pow(10, precision)\r\n  return Math.round(value * factor) / factor\r\n}\r\n\r\n/**\r\n * Floors a number to the given precision.\r\n *\r\n * @param value - The number to floor.\r\n * @param precision - Number of decimal places (default 0).\r\n * @returns The floored value.\r\n */\r\nexport function floor(value: number, precision: number = 0): number {\r\n  const factor = Math.pow(10, precision)\r\n  return Math.floor(value * factor) / factor\r\n}\r\n\r\n/**\r\n * Ceils a number to the given precision.\r\n *\r\n * @param value - The number to ceil.\r\n * @param precision - Number of decimal places (default 0).\r\n * @returns The ceiled value.\r\n */\r\nexport function ceil(value: number, precision: number = 0): number {\r\n  const factor = Math.pow(10, precision)\r\n  return Math.ceil(value * factor) / factor\r\n}\r\n\r\n/**\r\n * Checks if two numbers are approximately equal within a tolerance.\r\n *\r\n * @param a - First number.\r\n * @param b - Second number.\r\n * @param tolerance - Maximum difference (default `Number.EPSILON`).\r\n * @returns Whether the numbers are approximately equal.\r\n */\r\nexport function approxEqual(a: number, b: number, tolerance: number = Number.EPSILON): boolean {\r\n  return Math.abs(a - b) <= tolerance\r\n}\r\n\r\n/**\r\n * Clamps a value within the inclusive range [min, max].\r\n *\r\n * @param value - The value to clamp.\r\n * @param min - The lower bound.\r\n * @param max - The upper bound.\r\n * @returns The clamped value.\r\n * @throws {RangeError} If `min` exceeds `max`.\r\n */\r\nexport function clamp(value: number, min: number, max: number): number {\r\n  if (min > max) {\r\n    throw new RangeError('Minimum value cannot exceed maximum value')\r\n  }\r\n  return Math.min(Math.max(value, min), max)\r\n}\r\n\r\n/**\r\n * Computes the sum of an array of numbers.\r\n *\r\n * @param values - Array of numbers.\r\n * @returns The total sum.\r\n */\r\nexport function sum(values: number[]): number {\r\n  let total = 0\r\n  for (let i = 0; i < values.length; i++) {\r\n    total += values[i]!\r\n  }\r\n  return total\r\n}\r\n\r\n/**\r\n * Computes the average (mean) of an array of numbers.\r\n *\r\n * @param values - Array of numbers.\r\n * @returns The average.\r\n * @throws {RangeError} If the array is empty.\r\n */\r\nexport function average(values: number[]): number {\r\n  if (values.length === 0) {\r\n    throw new RangeError('Cannot compute average of an empty array')\r\n  }\r\n  return sum(values) / values.length\r\n}\r\n\r\n/**\r\n * Generates a random integer between `min` and `max` (inclusive).\r\n *\r\n * @param min - The minimum integer.\r\n * @param max - The maximum integer.\r\n * @returns A random integer.\r\n * @throws {RangeError} If arguments are not integers or `min > max`.\r\n */\r\nexport function randomInt(min: number, max: number): number {\r\n  if (!Number.isInteger(min) || !Number.isInteger(max)) {\r\n    throw new RangeError('Arguments must be integers')\r\n  }\r\n  if (min > max) {\r\n    throw new RangeError('Minimum value cannot exceed maximum value')\r\n  }\r\n  return Math.floor(Math.random() * (max - min + 1)) + min\r\n}\r\n\r\n/**\r\n * Checks if a number is within the inclusive range [min, max].\r\n *\r\n * @param value - The number to check.\r\n * @param min - The lower bound.\r\n * @param max - The upper bound.\r\n * @returns Whether the value is in range.\r\n */\r\nexport function inRange(value: number, min: number, max: number): boolean {\r\n  return value >= min && value <= max\r\n}\r\n","/**\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","/**\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","const SEP = '/'\r\n\r\n/**\r\n * Joins path segments with the proper separator.\r\n *\r\n * @param segments - Path segments to join.\r\n * @returns The joined path.\r\n */\r\nexport function join(...segments: string[]): string {\r\n  const parts: string[] = []\r\n  for (const seg of segments) {\r\n    if (seg === '') continue\r\n    const split = seg.split(/[\\\\/]/)\r\n    for (const part of split) {\r\n      if (part === '' || part === '.') continue\r\n      if (part === '..') {\r\n        if (parts.length > 0 && parts[parts.length - 1] !== '..') {\r\n          parts.pop()\r\n        } else {\r\n          parts.push('..')\r\n        }\r\n      } else {\r\n        parts.push(part)\r\n      }\r\n    }\r\n  }\r\n  if (parts.length === 0) return '.'\r\n  const result = parts.join(SEP)\r\n  if (segments.length > 0 && segments[0]!.startsWith('/')) {\r\n    return SEP + result\r\n  }\r\n  return result\r\n}\r\n\r\n/**\r\n * Resolves path segments to an absolute path.\r\n *\r\n * @param segments - Path segments to resolve.\r\n * @returns The resolved absolute path.\r\n */\r\nexport function resolve(...segments: string[]): string {\r\n  let resolved = ''\r\n  let isAbs = false\r\n\r\n  for (const seg of segments) {\r\n    if (seg.startsWith('/')) {\r\n      resolved = seg\r\n      isAbs = true\r\n    } else if (isAbs) {\r\n      resolved = join(resolved, seg)\r\n    } else {\r\n      resolved = resolved ? join(resolved, seg) : seg\r\n    }\r\n  }\r\n\r\n  if (!isAbs) {\r\n    resolved = join(SEP, resolved)\r\n  }\r\n\r\n  return normalize(resolved)\r\n}\r\n\r\n/**\r\n * Returns the filename from a path.\r\n *\r\n * @param p - The path.\r\n * @param ext - Optional extension to strip.\r\n * @returns The filename.\r\n */\r\nexport function basename(p: string, ext?: string): string {\r\n  const normalized = p.replace(/[\\\\/]+$/, '')\r\n  const idx = normalized.lastIndexOf(SEP)\r\n  let base = idx === -1 ? normalized : normalized.slice(idx + 1)\r\n  if (ext && base.endsWith(ext)) {\r\n    base = base.slice(0, -ext.length)\r\n  }\r\n  return base\r\n}\r\n\r\n/**\r\n * Returns the directory portion of a path.\r\n *\r\n * @param p - The path.\r\n * @returns The directory path.\r\n */\r\nexport function dirname(p: string): string {\r\n  if (p === SEP) return SEP\r\n  const normalized = p.replace(/[\\\\/]+$/, '')\r\n  if (normalized === '') return '.'\r\n  const idx = normalized.lastIndexOf(SEP)\r\n  if (idx === -1) return '.'\r\n  if (idx === 0) return SEP\r\n  return normalized.slice(0, idx)\r\n}\r\n\r\n/**\r\n * Returns the file extension from a path.\r\n *\r\n * @param p - The path.\r\n * @returns The extension including the dot, or empty string.\r\n */\r\nexport function extname(p: string): string {\r\n  const base = basename(p)\r\n  const idx = base.lastIndexOf('.')\r\n  if (idx === -1 || idx === 0) return ''\r\n  return base.slice(idx)\r\n}\r\n\r\n/**\r\n * Normalizes a path, resolving '..' and '.' segments.\r\n *\r\n * @param p - The path to normalize.\r\n * @returns The normalized path.\r\n */\r\nexport function normalize(p: string): string {\r\n  const parts = p.split(/[\\\\/]+/)\r\n  const stack: string[] = []\r\n  let isAbs = p.startsWith('/')\r\n\r\n  for (const part of parts) {\r\n    if (part === '' || part === '.') continue\r\n    if (part === '..') {\r\n      if (stack.length > 0 && stack[stack.length - 1] !== '..') {\r\n        stack.pop()\r\n      } else if (!isAbs) {\r\n        stack.push('..')\r\n      }\r\n    } else {\r\n      stack.push(part)\r\n    }\r\n  }\r\n\r\n  const result = stack.join(SEP)\r\n  if (isAbs) return SEP + result\r\n  if (result === '') return '.'\r\n  return result\r\n}\r\n\r\n/**\r\n * Checks if a path is absolute.\r\n *\r\n * @param p - The path to check.\r\n * @returns Whether the path is absolute.\r\n */\r\nexport function isAbsolute(p: string): boolean {\r\n  return p.startsWith('/')\r\n}\r\n\r\n/**\r\n * Computes the relative path from `from` to `to`.\r\n *\r\n * @param from - The base path.\r\n * @param to - The target path.\r\n * @returns The relative path.\r\n */\r\nexport function relative(from: string, to: string): string {\r\n  const fromParts = normalize(from).split(SEP)\r\n  const toParts = normalize(to).split(SEP)\r\n\r\n  let i = 0\r\n  while (i < fromParts.length && i < toParts.length && fromParts[i] === toParts[i]) {\r\n    i++\r\n  }\r\n\r\n  const up = fromParts.slice(i).map(() => '..')\r\n  const down = toParts.slice(i)\r\n  const result = [...up, ...down].join(SEP)\r\n\r\n  return result || '.'\r\n}\r\n\r\nexport interface ParsedPath {\r\n  root: string\r\n  dir: string\r\n  base: string\r\n  name: string\r\n  ext: string\r\n}\r\n\r\n/**\r\n * Parses a path into its components.\r\n *\r\n * @param p - The path to parse.\r\n * @returns An object with root, dir, base, name, and ext.\r\n */\r\nexport function parse(p: string): ParsedPath {\r\n  const root = p.startsWith(SEP) ? SEP : ''\r\n  const base = basename(p)\r\n  const ext = extname(base)\r\n  const name = ext ? base.slice(0, -ext.length) : base\r\n  const dir = root ? dirname(p) : (dirname(p) === '.' ? '' : dirname(p))\r\n\r\n  return { root, dir, base, name, ext }\r\n}\r\n\r\n/**\r\n * Formats a parsed path object back into a path string.\r\n *\r\n * @param parsed - The parsed path components.\r\n * @returns The formatted path string.\r\n */\r\nexport function format(parsed: Partial<ParsedPath>): string {\r\n  const { root = '', dir = '', base = '', name = '', ext = '' } = parsed\r\n  const baseName = base || name + ext\r\n  if (dir) {\r\n    return dir + SEP + baseName\r\n  }\r\n  return root + baseName\r\n}\r\n","/**\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","const WORD_SPLIT_RE = /[A-Z]?[a-z]+|[A-Z]+(?=[A-Z][a-z]|\\d|\\b)|\\d+/g\r\n\r\nfunction splitWords(str: string): string[] {\r\n  return str.match(WORD_SPLIT_RE) ?? []\r\n}\r\n\r\n/**\r\n * Capitalizes the first character and lowercases the rest.\r\n */\r\nexport function capitalize(str: string): string {\r\n  if (str.length === 0) return str\r\n  return str[0]!.toUpperCase() + str.slice(1).toLowerCase()\r\n}\r\n\r\n/**\r\n * Converts a string to camelCase.\r\n */\r\nexport function camelCase(str: string): string {\r\n  const words = splitWords(str)\r\n  if (words.length === 0) return ''\r\n  const [firstWord, ...rest] = words\r\n  return firstWord!.toLowerCase() + rest.map(w => w[0]!.toUpperCase() + w.slice(1).toLowerCase()).join('')\r\n}\r\n\r\n/**\r\n * Converts a string to kebab-case.\r\n */\r\nexport function kebabCase(str: string): string {\r\n  return splitWords(str).map(w => w.toLowerCase()).join('-')\r\n}\r\n\r\n/**\r\n * Converts a string to snake_case.\r\n */\r\nexport function snakeCase(str: string): string {\r\n  return splitWords(str).map(w => w.toLowerCase()).join('_')\r\n}\r\n\r\n/**\r\n * Converts a string to PascalCase.\r\n */\r\nexport function pascalCase(str: string): string {\r\n  return splitWords(str).map(w => w[0]!.toUpperCase() + w.slice(1).toLowerCase()).join('')\r\n}\r\n\r\n/**\r\n * Truncates a string to the specified length, appending a suffix (default \"...\").\r\n */\r\nexport function truncate(str: string, maxLength: number, suffix = '...'): string {\r\n  if (str.length <= maxLength) return str\r\n  return str.slice(0, Math.max(0, maxLength - suffix.length)) + suffix\r\n}\r\n\r\n/**\r\n * Simple string interpolation using {{key}} syntax.\r\n *\r\n * @example template(\"Hello {{name}}\", { name: \"world\" }) // => \"Hello world\"\r\n */\r\nexport function template(str: string, data: Record<string, string | number>): string {\r\n  return str.replace(/\\{\\{(\\w+)\\}\\}/g, (_, key: string) => {\r\n    const value = data[key]\r\n    return value !== undefined ? String(value) : `{{${key}}}`\r\n  })\r\n}\r\n\r\n/**\r\n * Generates a UUID v4 string.\r\n * Uses crypto.randomUUID when available, falls back to manual implementation.\r\n */\r\nexport function uuid(): string {\r\n  if (typeof crypto !== 'undefined' && typeof crypto.randomUUID === 'function') {\r\n    return crypto.randomUUID()\r\n  }\r\n  const hex = '0123456789abcdef'\r\n  const chars: string[] = []\r\n  for (let i = 0; i < 36; i++) {\r\n    if (i === 8 || i === 13 || i === 18 || i === 23) {\r\n      chars.push('-')\r\n    } else if (i === 14) {\r\n      chars.push('4')\r\n    } else if (i === 19) {\r\n      chars.push(hex[Math.floor(Math.random() * 4) + 8]!)\r\n    } else {\r\n      chars.push(hex[Math.floor(Math.random() * 16)]!)\r\n    }\r\n  }\r\n  return chars.join('')\r\n}\r\n\r\n/**\r\n * Generates a short random ID with configurable length and alphabet.\r\n *\r\n * @default size = 21, alphabet = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz_-\"\r\n */\r\nexport function nanoid(size = 21, alphabet = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz_-'): string {\r\n  const len = alphabet.length\r\n  let result = ''\r\n  for (let i = 0; i < size; i++) {\r\n    result += alphabet[Math.floor(Math.random() * len)]!\r\n  }\r\n  return result\r\n}\r\n\r\nconst HTML_ESCAPE_MAP: Record<string, string> = {\r\n  '&': '&amp;',\r\n  '<': '&lt;',\r\n  '>': '&gt;',\r\n  '\"': '&quot;',\r\n  \"'\": '&#39;',\r\n}\r\n\r\nconst HTML_UNESCAPE_MAP: Record<string, string> = {\r\n  '&amp;': '&',\r\n  '&lt;': '<',\r\n  '&gt;': '>',\r\n  '&quot;': '\"',\r\n  '&#39;': \"'\",\r\n  '&#x27;': \"'\",\r\n}\r\n\r\n/**\r\n * Escapes HTML special characters (&, <, >, \", ').\r\n */\r\nexport function escapeHtml(str: string): string {\r\n  return str.replace(/[&<>\"']/g, ch => HTML_ESCAPE_MAP[ch] ?? ch)\r\n}\r\n\r\n/**\r\n * Unescapes common HTML entities.\r\n */\r\nexport function unescapeHtml(str: string): string {\r\n  return str.replace(/&(?:amp|lt|gt|quot|#39|#x27);/g, entity => HTML_UNESCAPE_MAP[entity] ?? entity)\r\n}\r\n\r\n/**\r\n * Removes whitespace from both ends of a string.\r\n */\r\nexport function trim(str: string): string {\r\n  return str.trim()\r\n}\r\n\r\n/**\r\n * Removes whitespace from the start of a string.\r\n */\r\nexport function trimStart(str: string): string {\r\n  return str.trimStart()\r\n}\r\n\r\n/**\r\n * Removes whitespace from the end of a string.\r\n */\r\nexport function trimEnd(str: string): string {\r\n  return str.trimEnd()\r\n}\r\n\r\n/**\r\n * Pads a string to the given length by adding characters to both sides.\r\n */\r\nexport function pad(str: string, length: number, char = ' '): string {\r\n  const totalPadding = Math.max(0, length - str.length)\r\n  const leftPad = Math.floor(totalPadding / 2)\r\n  const rightPad = totalPadding - leftPad\r\n  return char.repeat(leftPad) + str + char.repeat(rightPad)\r\n}\r\n\r\n/**\r\n * Pads the start of a string to the given length.\r\n */\r\nexport function padStart(str: string, length: number, char = ' '): string {\r\n  return str.padStart(length, char)\r\n}\r\n\r\n/**\r\n * Pads the end of a string to the given length.\r\n */\r\nexport function padEnd(str: string, length: number, char = ' '): string {\r\n  return str.padEnd(length, char)\r\n}\r\n\r\n/**\r\n * Reverses a string.\r\n */\r\nexport function reverse(str: string): string {\r\n  return str.split('').reverse().join('')\r\n}\r\n\r\n/**\r\n * Splits a string into words.\r\n */\r\nexport function words(str: string): string[] {\r\n  return splitWords(str)\r\n}\r\n\r\n/**\r\n * Converts a string to a URL-friendly slug.\r\n */\r\nexport function slugify(str: string): string {\r\n  return str\r\n    .toLowerCase()\r\n    .replace(/[^\\w\\s-]/g, '')\r\n    .replace(/[\\s_]+/g, '-')\r\n    .replace(/-+/g, '-')\r\n    .replace(/^-+/, '')\r\n    .replace(/-+$/, '')\r\n}\r\n\r\n/**\r\n * Counts occurrences of a substring in a string.\r\n */\r\nexport function countOccurrences(str: string, substring: string): number {\r\n  if (substring.length === 0 || str.length === 0) return 0\r\n  let count = 0\r\n  let pos = 0\r\n  while ((pos = str.indexOf(substring, pos)) !== -1) {\r\n    count++\r\n    pos += substring.length\r\n  }\r\n  return count\r\n}\r\n","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","/**\r\n * Options for CSV parsing.\r\n */\r\nexport interface CsvOptions {\r\n  delimiter?: string\r\n  header?: boolean\r\n  skipEmptyLines?: boolean\r\n}\r\n\r\n/**\r\n * Parses a CSV string into an array of records (objects).\r\n *\r\n * @param input - CSV string\r\n * @param options - Optional parsing options\r\n */\r\nexport function parseCsv(input: string, options?: CsvOptions): Record<string, string>[] {\r\n  const { delimiter = ',', header = true, skipEmptyLines = true } = options ?? {}\r\n\r\n  const lines = input.split(/\\r?\\n/)\r\n  const rows: string[][] = []\r\n\r\n  for (const line of lines) {\r\n    const trimmed = line.trim()\r\n    if (skipEmptyLines && trimmed.length === 0) continue\r\n    const values = parseCsvLine(trimmed, delimiter)\r\n    rows.push(values)\r\n  }\r\n\r\n  if (rows.length === 0) return []\r\n\r\n  if (header) {\r\n    const [head, ...body] = rows\r\n    if (head === undefined) return []\r\n    return body.map(row => {\r\n      const record: Record<string, string> = {}\r\n      for (let i = 0; i < head.length; i++) {\r\n        record[head[i]!] = row[i] ?? ''\r\n      }\r\n      return record\r\n    })\r\n  }\r\n\r\n  return rows.map(row => {\r\n    const record: Record<string, string> = {}\r\n    for (let i = 0; i < row.length; i++) {\r\n      record[String(i)] = row[i]!\r\n    }\r\n    return record\r\n  })\r\n}\r\n\r\nfunction parseCsvLine(line: string, delimiter: string): string[] {\r\n  const result: string[] = []\r\n  let current = ''\r\n  let inQuotes = false\r\n\r\n  for (let i = 0; i < line.length; i++) {\r\n    const ch = line[i]!\r\n    if (inQuotes) {\r\n      if (ch === '\"') {\r\n        if (line[i + 1] === '\"') {\r\n          current += '\"'\r\n          i++\r\n        } else {\r\n          inQuotes = false\r\n        }\r\n      } else {\r\n        current += ch\r\n      }\r\n    } else {\r\n      if (ch === '\"') {\r\n        inQuotes = true\r\n      } else if (ch === delimiter) {\r\n        result.push(current)\r\n        current = ''\r\n      } else {\r\n        current += ch\r\n      }\r\n    }\r\n  }\r\n  result.push(current)\r\n  return result\r\n}\r\n\r\n/**\r\n * Converts an array of records to a CSV string.\r\n */\r\nexport function stringifyCsv(data: Record<string, unknown>[], options?: { delimiter?: string }): string {\r\n  const { delimiter = ',' } = options ?? {}\r\n  if (data.length === 0) return ''\r\n\r\n  const headers = Object.keys(data[0]!)\r\n  const lines: string[] = [headers.map(v => escapeCsvField(v, delimiter)).join(delimiter)]\r\n\r\n  for (const record of data) {\r\n    const row = headers.map(h => escapeCsvField(String(record[h] ?? ''), delimiter))\r\n    lines.push(row.join(delimiter))\r\n  }\r\n\r\n  return lines.join('\\n')\r\n}\r\n\r\nfunction escapeCsvField(value: string, delimiter: string): string {\r\n  if (value.includes('\"') || value.includes(delimiter) || value.includes('\\n') || value.includes('\\r')) {\r\n    return '\"' + value.replace(/\"/g, '\"\"') + '\"'\r\n  }\r\n  return value\r\n}\r\n\r\n/**\r\n * Safely parses a JSON string, returning the default value or null on failure.\r\n */\r\nexport function safeJsonParse<T>(input: string, default_?: T): T | null {\r\n  try {\r\n    return JSON.parse(input) as T\r\n  } catch {\r\n    return default_ ?? null\r\n  }\r\n}\r\n\r\n/**\r\n * Reads an environment variable with optional default.\r\n */\r\nexport function env(name: string, default_?: string): string {\r\n  const value = process.env[name]\r\n  return value ?? default_ ?? ''\r\n}\r\n\r\n/**\r\n * Reads an environment variable as an integer.\r\n */\r\nexport function envInt(name: string, default_?: number): number {\r\n  const value = process.env[name]\r\n  if (value === undefined || value === '') return default_ ?? 0\r\n  const parsed = Number.parseInt(value, 10)\r\n  return Number.isNaN(parsed) ? (default_ ?? 0) : parsed\r\n}\r\n\r\n/**\r\n * Reads an environment variable as a boolean.\r\n */\r\nexport function envBool(name: string, default_?: boolean): boolean {\r\n  const value = process.env[name]\r\n  if (value === undefined || value === '') return default_ ?? false\r\n  return value === 'true' || value === '1' || value === 'yes'\r\n}\r\n","/**\r\n * Checks if a value is a string.\r\n */\r\nexport function isString(value: unknown): value is string {\r\n  return typeof value === 'string'\r\n}\r\n\r\n/**\r\n * Checks if a value is a number (not NaN, not Infinity).\r\n */\r\nexport function isNumber(value: unknown): value is number {\r\n  return typeof value === 'number' && Number.isFinite(value)\r\n}\r\n\r\n/**\r\n * Checks if a value is a boolean.\r\n */\r\nexport function isBoolean(value: unknown): value is boolean {\r\n  return typeof value === 'boolean'\r\n}\r\n\r\n/**\r\n * Checks if a value is a plain object (not null, not array, typeof 'object').\r\n */\r\nexport function isObject(value: unknown): value is Record<string, unknown> {\r\n  return value !== null && typeof value === 'object' && !Array.isArray(value)\r\n}\r\n\r\n/**\r\n * Checks if a value is an array.\r\n */\r\nexport function isArray(value: unknown): value is unknown[] {\r\n  return Array.isArray(value)\r\n}\r\n\r\n/**\r\n * Checks if a value is a function.\r\n */\r\nexport function isFunction(value: unknown): value is (...args: unknown[]) => unknown {\r\n  return typeof value === 'function'\r\n}\r\n\r\n/**\r\n * Checks if a value is a Date.\r\n */\r\nexport function isDate(value: unknown): value is Date {\r\n  return value instanceof Date && !Number.isNaN(value.getTime())\r\n}\r\n\r\n/**\r\n * Checks if a value is a RegExp.\r\n */\r\nexport function isRegExp(value: unknown): value is RegExp {\r\n  return value instanceof RegExp\r\n}\r\n\r\n/**\r\n * Checks if a value is a Map.\r\n */\r\nexport function isMap(value: unknown): value is Map<unknown, unknown> {\r\n  return value instanceof Map\r\n}\r\n\r\n/**\r\n * Checks if a value is a Set.\r\n */\r\nexport function isSet(value: unknown): value is Set<unknown> {\r\n  return value instanceof Set\r\n}\r\n\r\n/**\r\n * Checks if a value is a Promise.\r\n */\r\nexport function isPromise(value: unknown): value is Promise<unknown> {\r\n  return value instanceof Promise\r\n}\r\n\r\n/**\r\n * Checks if a value is null.\r\n */\r\nexport function isNull(value: unknown): value is null {\r\n  return value === null\r\n}\r\n\r\n/**\r\n * Checks if a value is undefined.\r\n */\r\nexport function isUndefined(value: unknown): value is undefined {\r\n  return value === undefined\r\n}\r\n\r\n/**\r\n * Checks if a value is null or undefined.\r\n */\r\nexport function isNil(value: unknown): value is null | undefined {\r\n  return value === null || value === undefined\r\n}\r\n\r\n/**\r\n * Checks if a value is empty.\r\n * Works for strings, arrays, objects, Map, and Set.\r\n */\r\nexport function isEmpty(value: unknown): boolean {\r\n  if (value === null || value === undefined) return true\r\n  if (typeof value === 'string') return value.length === 0\r\n  if (Array.isArray(value)) return value.length === 0\r\n  if (value instanceof Map || value instanceof Set) return value.size === 0\r\n  if (typeof value === 'object') return Object.keys(value as Record<string, unknown>).length === 0\r\n  return false\r\n}\r\n\r\n/**\r\n * Asserts that a value is defined (not null or undefined).\r\n * Throws if the value is null or undefined.\r\n */\r\nexport function assertDefined<T>(value: T, message?: string): asserts value is NonNullable<T> {\r\n  if (value === null || value === undefined) {\r\n    throw new Error(message ?? 'Expected value to be defined')\r\n  }\r\n}\r\n\r\n/**\r\n * Asserts that a value matches a type guard. Throws if it doesn't.\r\n */\r\nexport function assertType<T>(value: unknown, guard: (v: unknown) => v is T, message?: string): asserts value is T {\r\n  if (!guard(value)) {\r\n    throw new Error(message ?? 'Value does not match expected type')\r\n  }\r\n}\r\n\r\n/**\r\n * Wraps a value in an array if it is not already one.\r\n */\r\nexport function ensureArray<T>(value: T | T[]): T[] {\r\n  return Array.isArray(value) ? value : [value]\r\n}\r\n\r\n/**\r\n * Alias for ensureArray.\r\n */\r\nexport function castArray<T>(value: T | T[]): T[] {\r\n  return ensureArray(value)\r\n}\r\n\r\n/**\r\n * Returns a string representation of the value's type.\r\n *\r\n * Possible values: \"string\", \"number\", \"boolean\", \"array\", \"object\", \"function\",\r\n * \"date\", \"regexp\", \"map\", \"set\", \"promise\", \"null\", \"undefined\", \"nan\", \"infinity\"\r\n */\r\nexport function getType(value: unknown): string {\r\n  if (value === null) return 'null'\r\n  if (value === undefined) return 'undefined'\r\n  if (typeof value === 'string') return 'string'\r\n  if (typeof value === 'boolean') return 'boolean'\r\n  if (typeof value === 'function') return 'function'\r\n  if (typeof value === 'number') {\r\n    if (Number.isNaN(value)) return 'nan'\r\n    if (!Number.isFinite(value)) return 'infinity'\r\n    return 'number'\r\n  }\r\n  if (Array.isArray(value)) return 'array'\r\n  if (value instanceof Date) return 'date'\r\n  if (value instanceof RegExp) return 'regexp'\r\n  if (value instanceof Map) return 'map'\r\n  if (value instanceof Set) return 'set'\r\n  if (value instanceof Promise) return 'promise'\r\n  return 'object'\r\n}\r\n","import { readFileSync, readdirSync, existsSync } from 'node:fs'\r\nimport { join, basename } from 'node:path'\r\nimport type { ScanResult, ReplacementSuggestion, SecurityIssue, ScannerConfig } from '../types.js'\r\nimport { KNOWN_MAPPINGS, KNOWN_CVES, type PackageMapping } from '../known-mappings.js'\r\n\r\ninterface LockfilePackages {\r\n  [key: string]: { version?: string; dependencies?: Record<string, string> } | undefined\r\n}\r\n\r\ninterface LockfileData {\r\n  packages: LockfilePackages\r\n}\r\n\r\nfunction parsePackageJson(path: string): { name: string; dependencies: Record<string, string>; devDependencies: Record<string, string> } {\r\n  const raw = readFileSync(path, 'utf-8')\r\n  const json = JSON.parse(raw)\r\n  return {\r\n    name: json.name ?? basename(join(path, '..')),\r\n    dependencies: (json.dependencies as Record<string, string>) ?? {},\r\n    devDependencies: (json.devDependencies as Record<string, string>) ?? {},\r\n  }\r\n}\r\n\r\nfunction parseLockfile(projectPath: string): LockfileData | null {\r\n  const lockPath = join(projectPath, 'package-lock.json')\r\n  if (!existsSync(lockPath)) return null\r\n  try {\r\n    const raw = readFileSync(lockPath, 'utf-8')\r\n    const json = JSON.parse(raw)\r\n    const packages: LockfilePackages = {}\r\n\r\n    if (json.packages) {\r\n      for (const [key, val] of Object.entries(json.packages as Record<string, { version?: string }>)) {\r\n        if (key) {\r\n          packages[key] = val\r\n        }\r\n      }\r\n    }\r\n\r\n    if (json.dependencies && Object.keys(packages).length === 0) {\r\n      for (const [key, val] of Object.entries(json.dependencies as Record<string, { version?: string; requires?: Record<string, string> }>)) {\r\n        packages[key] = { version: val.version, dependencies: val.requires }\r\n      }\r\n    }\r\n\r\n    return { packages }\r\n  } catch {\r\n    return null\r\n  }\r\n}\r\n\r\nfunction detectImportInFile(filePath: string, regex: RegExp): boolean {\r\n  try {\r\n    const content = readFileSync(filePath, 'utf-8')\r\n    return regex.test(content)\r\n  } catch {\r\n    return false\r\n  }\r\n}\r\n\r\nfunction detectImportsInSrc(projectPath: string, mapping: PackageMapping): boolean {\r\n  const regex = new RegExp(mapping.detectionPattern)\r\n  const srcDir = join(projectPath, 'src')\r\n  if (!existsSync(srcDir)) return false\r\n\r\n  try {\r\n    const files = collectSourceFiles(srcDir)\r\n    for (const file of files) {\r\n      if (detectImportInFile(file, regex)) return true\r\n    }\r\n  } catch {\r\n    return false\r\n  }\r\n  return false\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      if (entry.name === 'node_modules' || entry.name === 'dist' || entry.name === '.git' || entry.name === 'coverage' || entry.name === '.tsup') {\r\n        continue\r\n      }\r\n      const full = join(dir, entry.name)\r\n      if (entry.isDirectory()) {\r\n        results.push(...collectSourceFiles(full))\r\n      } else if (entry.isFile()) {\r\n        const ext = entry.name.split('.').pop()\r\n        if (ext === 'ts' || ext === 'tsx' || ext === 'js' || ext === 'jsx' || ext === 'mjs' || ext === 'cjs') {\r\n          results.push(full)\r\n        }\r\n      }\r\n    }\r\n  } catch {\r\n    // skip inaccessible dirs\r\n  }\r\n  return results\r\n}\r\n\r\nfunction estimateTransitiveCount(lockfile: LockfileData | null, directNames: Set<string>): number {\r\n  if (!lockfile) return 0\r\n  let count = 0\r\n  for (const key of Object.keys(lockfile.packages)) {\r\n    if (!key || key === '') continue\r\n    const name = key.startsWith('node_modules/') ? key.slice('node_modules/'.length) : key\r\n    const rootName = name.startsWith('@') ? `${name.split('/')[0]}/${name.split('/')[1]}` : name.split('/')[0]\r\n    if (rootName && !directNames.has(rootName)) {\r\n      count++\r\n    }\r\n  }\r\n  return count\r\n}\r\n\r\nfunction parseSize(value: string): number {\r\n  const cleaned = value.replace(/\\(.*?\\)/g, '').trim()\r\n  const match = cleaned.match(/^([\\d.]+)\\s*(KB|MB)/i)\r\n  if (!match) return 0\r\n  const num = Number.parseFloat(match[1]!)\r\n  if (!match[2]) return 0\r\n  if (match[2].toUpperCase() === 'MB') return num * 1024\r\n  return num\r\n}\r\n\r\nexport async function scanProject(config: ScannerConfig): Promise<ScanResult> {\r\n  const projectPath = config.path ?? '.'\r\n  const pkgPath = join(projectPath, 'package.json')\r\n\r\n  if (!existsSync(pkgPath)) {\r\n    throw new Error(`No package.json found at ${projectPath}. Run dep-exray in a JavaScript/TypeScript project directory.`)\r\n  }\r\n\r\n  const pkg = parsePackageJson(pkgPath)\r\n  const lockfile = parseLockfile(projectPath)\r\n\r\n  const allDeps: Record<string, string> = { ...pkg.dependencies, ...pkg.devDependencies }\r\n  const directNames = new Set(Object.keys(allDeps))\r\n\r\n  const transitiveCount = estimateTransitiveCount(lockfile, directNames)\r\n\r\n  const highImpactReplacements: ReplacementSuggestion[] = []\r\n  const mediumImpactReplacements: ReplacementSuggestion[] = []\r\n  const securityIssues: SecurityIssue[] = []\r\n\r\n  const sizeMap: Record<string, string> = {}\r\n  for (const m of KNOWN_MAPPINGS) {\r\n    sizeMap[m.name] = m.size\r\n  }\r\n\r\n  for (const mapping of KNOWN_MAPPINGS) {\r\n    const isDirect = directNames.has(mapping.name)\r\n    if (!isDirect) continue\r\n\r\n    const isUsed = detectImportsInSrc(projectPath, mapping)\r\n    if (!isUsed && !config.verbose) continue\r\n\r\n    const mappingSize = parseSize(sizeMap[mapping.name] ?? '0 KB')\r\n    const replacementSize = mapping.replacement.startsWith('native') ? 0 : 5\r\n    const reductionStr = mappingSize > 1024\r\n      ? `${(mappingSize / 1024).toFixed(1)} MB → ${replacementSize} KB`\r\n      : `${mappingSize.toFixed(0)} KB → ${replacementSize} KB`\r\n\r\n    const suggestion: ReplacementSuggestion = {\r\n      packageName: mapping.name,\r\n      reason: mapping.reason,\r\n      replacement: mapping.replacement,\r\n      estimatedSizeReduction: reductionStr,\r\n      confidence: mapping.confidence,\r\n      autoPrReady: mapping.autoPrReady,\r\n    }\r\n\r\n    if (mapping.confidence === 'high') {\r\n      highImpactReplacements.push(suggestion)\r\n    } else {\r\n      mediumImpactReplacements.push(suggestion)\r\n    }\r\n  }\r\n\r\n  for (const [name, cves] of Object.entries(KNOWN_CVES)) {\r\n    if (directNames.has(name)) {\r\n      for (const cveItem of cves) {\r\n        securityIssues.push({\r\n          packageName: name,\r\n          cveId: cveItem.cve,\r\n          severity: cveItem.severity as SecurityIssue['severity'],\r\n          fix: cveItem.fix,\r\n        })\r\n      }\r\n    }\r\n  }\r\n\r\n  let totalSizeKB = 0\r\n  for (const depName of directNames) {\r\n    const sizeStr = sizeMap[depName]\r\n    if (sizeStr) {\r\n      totalSizeKB += parseSize(sizeStr)\r\n    } else {\r\n      totalSizeKB += 50\r\n    }\r\n  }\r\n  totalSizeKB += transitiveCount * 30\r\n\r\n  const totalSizeStr = totalSizeKB > 1024\r\n    ? `${(totalSizeKB / 1024).toFixed(1)} MB`\r\n    : `${totalSizeKB.toFixed(0)} KB`\r\n\r\n  return {\r\n    projectName: pkg.name,\r\n    directDeps: directNames.size,\r\n    transitiveDeps: transitiveCount,\r\n    totalEstimatedSize: totalSizeStr,\r\n    highImpactReplacements,\r\n    mediumImpactReplacements,\r\n    securityIssues,\r\n  }\r\n}\r\n","\r\n\r\nexport interface PackageMapping {\r\n  name: string\r\n  size: string\r\n  replacement: string\r\n  confidence: 'high' | 'medium' | 'low'\r\n  autoPrReady: boolean\r\n  reason: string\r\n  detectionPattern: string\r\n}\r\n\r\nexport const KNOWN_MAPPINGS: PackageMapping[] = [\r\n  {\r\n    name: 'lodash',\r\n    size: '4.2 MB',\r\n    replacement: 'jscore-core',\r\n    confidence: 'high',\r\n    autoPrReady: true,\r\n    reason: 'Most lodash functions have direct replacements in jscore-core with 99% API compatibility',\r\n    detectionPattern: 'from [\\'\"]lodash[\\'\"]|require\\\\([\\'\"]lodash[\\'\"]\\\\)',\r\n  },\r\n  {\r\n    name: 'moment',\r\n    size: '2.5 MB',\r\n    replacement: 'jscore-core/date',\r\n    confidence: 'high',\r\n    autoPrReady: true,\r\n    reason: 'date utilities in jscore-core cover 95% of common moment use cases',\r\n    detectionPattern: 'from [\\'\"]moment[\\'\"]|require\\\\([\\'\"]moment[\\'\"]\\\\)',\r\n  },\r\n  {\r\n    name: 'date-fns',\r\n    size: '1.2 MB (tree-shaked ~50KB)',\r\n    replacement: 'jscore-core/date',\r\n    confidence: 'medium',\r\n    autoPrReady: false,\r\n    reason: 'Partially overlapping — jscore-core covers basic date ops but not all locale support',\r\n    detectionPattern: 'from [\\'\"]date-fns[\\'\"]|require\\\\([\\'\"]date-fns[\\'\"]\\\\)',\r\n  },\r\n  {\r\n    name: 'axios',\r\n    size: '1.6 MB',\r\n    replacement: 'native fetch + jscore-core/async/retry',\r\n    confidence: 'medium',\r\n    autoPrReady: false,\r\n    reason: 'Native fetch covers most use cases; needs manual review for interceptors',\r\n    detectionPattern: 'from [\\'\"]axios[\\'\"]|require\\\\([\\'\"]axios[\\'\"]\\\\)',\r\n  },\r\n  {\r\n    name: 'uuid',\r\n    size: '30 KB',\r\n    replacement: 'crypto.randomUUID() (native)',\r\n    confidence: 'high',\r\n    autoPrReady: true,\r\n    reason: 'crypto.randomUUID() is available in all modern Node.js and browsers',\r\n    detectionPattern: 'from [\\'\"]uuid[\\'\"]|require\\\\([\\'\"]uuid[\\'\"]\\\\)',\r\n  },\r\n  {\r\n    name: 'deepmerge',\r\n    size: '15 KB',\r\n    replacement: 'jscore-core',\r\n    confidence: 'high',\r\n    autoPrReady: true,\r\n    reason: 'jscore-core provides deepMerge out of the box',\r\n    detectionPattern: 'from [\\'\"]deepmerge[\\'\"]|require\\\\([\\'\"]deepmerge[\\'\"]\\\\)',\r\n  },\r\n  {\r\n    name: 'lodash.merge',\r\n    size: '25 KB',\r\n    replacement: 'jscore-core',\r\n    confidence: 'high',\r\n    autoPrReady: true,\r\n    reason: 'jscore-core provides deepMerge out of the box',\r\n    detectionPattern: 'from [\\'\"]lodash\\\\.(merge|clone|pick|omit|get|set)[\\'\"]',\r\n  },\r\n  {\r\n    name: 'chalk',\r\n    size: '45 KB',\r\n    replacement: 'picocolors',\r\n    confidence: 'medium',\r\n    autoPrReady: false,\r\n    reason: \"picocolors is 3KB vs chalk's 45KB with same API\",\r\n    detectionPattern: 'from [\\'\"]chalk[\\'\"]|require\\\\([\\'\"]chalk[\\'\"]\\\\)',\r\n  },\r\n  {\r\n    name: 'nanoid',\r\n    size: '8 KB',\r\n    replacement: 'jscore-core/string (nanoid)',\r\n    confidence: 'high',\r\n    autoPrReady: true,\r\n    reason: 'jscore-core provides nanoid with same API',\r\n    detectionPattern: 'from [\\'\"]nanoid[\\'\"]|require\\\\([\\'\"]nanoid[\\'\"]\\\\)',\r\n  },\r\n  {\r\n    name: 'dayjs',\r\n    size: '50 KB',\r\n    replacement: 'jscore-core/date',\r\n    confidence: 'medium',\r\n    autoPrReady: false,\r\n    reason: 'Partially overlapping — covers basics but not all plugins',\r\n    detectionPattern: 'from [\\'\"]dayjs[\\'\"]|require\\\\([\\'\"]dayjs[\\'\"]\\\\)',\r\n  },\r\n  {\r\n    name: 'clsx',\r\n    size: '5 KB',\r\n    replacement: 'native template literals',\r\n    confidence: 'high',\r\n    autoPrReady: true,\r\n    reason: 'Can be replaced with simple template literal conditional pattern',\r\n    detectionPattern: 'from [\\'\"]clsx[\\'\"]|require\\\\([\\'\"]clsx[\\'\"]\\\\)',\r\n  },\r\n]\r\n\r\nexport const KNOWN_CVES: Record<string, { cve: string; severity: string; fix: string }[]> = {\r\n  'ansi-regex': [\r\n    { cve: 'CVE-2021-3807', severity: 'high', fix: 'Update to ansi-regex@6.0.1 or later' },\r\n  ],\r\n  'semver': [\r\n    { cve: 'CVE-2022-25883', severity: 'medium', fix: 'Update to semver@7.5.2 or later' },\r\n  ],\r\n  'json5': [\r\n    { cve: 'CVE-2022-46175', severity: 'high', fix: 'Update to json5@2.2.3 or later' },\r\n  ],\r\n  'lodash': [\r\n    { cve: 'CVE-2020-28502', severity: 'high', fix: 'Update to lodash@4.17.21 or later' },\r\n    { cve: 'CVE-2020-8203', severity: 'medium', fix: 'Update to lodash@4.17.21 or later' },\r\n  ],\r\n}\r\n","import pc from 'picocolors'\r\nimport type { ScanResult, ReplacementSuggestion, SecurityIssue } from '../types.js'\r\n\r\nfunction severityColor(severity: SecurityIssue['severity']): string {\r\n  switch (severity) {\r\n    case 'critical': return pc.bold(pc.red(severity.toUpperCase()))\r\n    case 'high': return pc.red(severity.toUpperCase())\r\n    case 'medium': return pc.yellow(severity.toUpperCase())\r\n    case 'low': return pc.dim(severity.toUpperCase())\r\n  }\r\n}\r\n\r\nfunction confidenceIcon(confidence: ReplacementSuggestion['confidence']): string {\r\n  switch (confidence) {\r\n    case 'high': return pc.green('●')\r\n    case 'medium': return pc.yellow('●')\r\n    case 'low': return pc.red('●')\r\n  }\r\n}\r\n\r\nexport function generateReport(result: ScanResult, jsonOutput?: boolean): string {\r\n  if (jsonOutput) {\r\n    return JSON.stringify(result, null, 2)\r\n  }\r\n\r\n  const lines: string[] = []\r\n\r\n  // ┌─┐│└┘─\r\n  lines.push(pc.bold(pc.cyan(`┌${'─'.repeat(58)}┐`)))\r\n  lines.push(pc.bold(pc.cyan(`│${' '.repeat(18)}dep-exray Report${' '.repeat(21)}│`)))\r\n  lines.push(pc.bold(pc.cyan(`├${'─'.repeat(58)}┤`)))\r\n  lines.push(pc.bold(pc.cyan(`│  ${pc.white('📦 PROJECT:')} ${pc.bold(result.projectName)}${' '.repeat(Math.max(1, 47 - result.projectName.length))}│`)))\r\n  lines.push(pc.bold(pc.cyan(`│  ${pc.white('📊 DEPENDENCIES:')} ${pc.bold(String(result.directDeps))} direct + ${pc.bold(String(result.transitiveDeps))} transitive${' '.repeat(Math.max(1, 27 - String(result.transitiveDeps).length))}│`)))\r\n  lines.push(pc.bold(pc.cyan(`│  ${pc.white('💾 TOTAL SIZE:')} ${pc.bold(result.totalEstimatedSize)}${' '.repeat(Math.max(1, 42 - result.totalEstimatedSize.length))}│`)))\r\n  lines.push(pc.bold(pc.cyan(`├${'─'.repeat(58)}┤`)))\r\n\r\n  if (result.highImpactReplacements.length > 0) {\r\n    lines.push(pc.bold(pc.cyan(`│  ${pc.green('🟢')} ${pc.bold(pc.green('HIGH IMPACT REPLACEMENTS'))}${' '.repeat(23)}│`)))\r\n    for (const item of result.highImpactReplacements) {\r\n      const autoPr = item.autoPrReady ? pc.green('✓ Auto-PR ready') : pc.dim('Manual review needed')\r\n      const confIcon = confidenceIcon(item.confidence)\r\n      lines.push(pc.bold(pc.cyan(`├${'─'.repeat(58)}┤`)))\r\n      lines.push(pc.bold(pc.cyan(`│  ${pc.red('✗')} ${pc.bold(item.packageName)} (${item.estimatedSizeReduction})${' '.repeat(Math.max(1, 38 - item.estimatedSizeReduction.length))}│`)))\r\n      lines.push(pc.bold(pc.cyan(`│  ${pc.dim('→')} ${pc.cyan(item.replacement)}${' '.repeat(Math.max(1, 51 - item.replacement.length))}│`)))\r\n      lines.push(pc.bold(pc.cyan(`│  ${pc.dim('└─')} ${autoPr}  ${confIcon} ${item.confidence}${' '.repeat(Math.max(1, 35))}│`)))\r\n    }\r\n  }\r\n\r\n  if (result.mediumImpactReplacements.length > 0) {\r\n    lines.push(pc.bold(pc.cyan(`├${'─'.repeat(58)}┤`)))\r\n    lines.push(pc.bold(pc.cyan(`│  ${pc.yellow('🟡')} ${pc.bold(pc.yellow('MEDIUM IMPACT REPLACEMENTS'))}${' '.repeat(20)}│`)))\r\n    for (const item of result.mediumImpactReplacements) {\r\n      const autoPr = item.autoPrReady ? pc.green('✓ Auto-PR ready') : pc.dim('Manual review needed')\r\n      const confIcon = confidenceIcon(item.confidence)\r\n      lines.push(pc.bold(pc.cyan(`├${'─'.repeat(58)}┤`)))\r\n      lines.push(pc.bold(pc.cyan(`│  ${pc.red('✗')} ${pc.bold(item.packageName)} (${item.estimatedSizeReduction})${' '.repeat(Math.max(1, 38 - item.estimatedSizeReduction.length))}│`)))\r\n      lines.push(pc.bold(pc.cyan(`│  ${pc.dim('→')} ${pc.cyan(item.replacement)}${' '.repeat(Math.max(1, 51 - item.replacement.length))}│`)))\r\n      lines.push(pc.bold(pc.cyan(`│  ${pc.dim('└─')} ${autoPr}  ${confIcon} ${item.confidence}${' '.repeat(Math.max(1, 35))}│`)))\r\n    }\r\n  }\r\n\r\n  if (result.securityIssues.length > 0) {\r\n    lines.push(pc.bold(pc.cyan(`├${'─'.repeat(58)}┤`)))\r\n    lines.push(pc.bold(pc.cyan(`│  ${pc.red('🔴')} ${pc.bold(pc.red('SECURITY ISSUES'))}${' '.repeat(33)}│`)))\r\n    for (const issue of result.securityIssues) {\r\n      lines.push(pc.bold(pc.cyan(`├${'─'.repeat(58)}┤`)))\r\n      lines.push(pc.bold(pc.cyan(`│  ${severityColor(issue.severity)} ${pc.bold(issue.cveId)} in ${issue.packageName}${' '.repeat(Math.max(1, 40 - issue.packageName.length))}│`)))\r\n      lines.push(pc.bold(pc.cyan(`│  ${pc.dim('→')} ${issue.fix}${' '.repeat(Math.max(1, 52 - issue.fix.length))}│`)))\r\n    }\r\n  }\r\n\r\n  lines.push(pc.bold(pc.cyan(`└${'─'.repeat(58)}┘`)))\r\n\r\n  return lines.join('\\n')\r\n}\r\n","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":";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,CAAAA,aAAW;AAC/B,mBAAW,MAAM;AACf,UAAAA,SAAQ,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;;;AC1ZO,IAAM,sBAAN,cAAkC,MAAM;AAAA,EAC7C,cAAc;AACZ,UAAM,kBAAkB;AACxB,SAAK,OAAO;AAAA,EACd;AACF;AAEA,SAAS,aAAa,OAAuB;AAC3C,MAAI,CAAC,SAAS,KAAK,EAAG,QAAO;AAC7B,QAAM,SAAS,OAAO,KAAK,EAAE,QAAQ,GAAG;AACxC,MAAI,SAAS,IAAI;AACf,UAAM,MAAM,SAAS,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC,GAAG,EAAE;AACxD,QAAI,MAAM,EAAG,QAAO,KAAK,IAAI,GAAG;AAChC,WAAO;AAAA,EACT;AACA,QAAM,MAAM,OAAO,KAAK;AACxB,QAAM,MAAM,IAAI,QAAQ,GAAG;AAC3B,SAAO,QAAQ,KAAK,IAAI,IAAI,SAAS,MAAM;AAC7C;AAEA,SAAS,kBAAkB,GAAW,GAAmB;AACvD,SAAO,KAAK,IAAI,IAAI,KAAK,IAAI,aAAa,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC;AAChE;AASO,SAAS,IAAI,GAAW,GAAmB;AAChD,QAAM,SAAS,kBAAkB,GAAG,CAAC;AACrC,UAAQ,KAAK,MAAM,IAAI,MAAM,IAAI,KAAK,MAAM,IAAI,MAAM,KAAK;AAC7D;AASO,SAAS,IAAI,GAAW,GAAmB;AAChD,QAAM,SAAS,kBAAkB,GAAG,CAAC;AACrC,UAAQ,KAAK,MAAM,IAAI,MAAM,IAAI,KAAK,MAAM,IAAI,MAAM,KAAK;AAC7D;AASO,SAAS,IAAI,GAAW,GAAmB;AAChD,QAAM,UAAU,kBAAkB,GAAG,CAAC;AACtC,QAAM,UAAU,kBAAkB,GAAG,CAAC;AACtC,QAAM,SAAU,KAAK,MAAM,IAAI,OAAO,IAAI,KAAK,MAAM,IAAI,OAAO,KAAM,UAAU;AAChF,SAAO;AACT;AAUO,SAAS,IAAI,GAAW,GAAmB;AAChD,MAAI,MAAM,EAAG,OAAM,IAAI,oBAAoB;AAC3C,QAAM,SAAS,kBAAkB,GAAG,CAAC;AACrC,SAAO,KAAK,MAAM,IAAI,MAAM,IAAI,KAAK,MAAM,IAAI,MAAM;AACvD;AASO,SAAS,MAAM,OAAe,YAAoB,GAAW;AAClE,QAAM,SAAS,KAAK,IAAI,IAAI,SAAS;AACrC,SAAO,KAAK,MAAM,QAAQ,MAAM,IAAI;AACtC;AASO,SAAS,MAAM,OAAe,YAAoB,GAAW;AAClE,QAAM,SAAS,KAAK,IAAI,IAAI,SAAS;AACrC,SAAO,KAAK,MAAM,QAAQ,MAAM,IAAI;AACtC;AASO,SAAS,KAAK,OAAe,YAAoB,GAAW;AACjE,QAAM,SAAS,KAAK,IAAI,IAAI,SAAS;AACrC,SAAO,KAAK,KAAK,QAAQ,MAAM,IAAI;AACrC;AAUO,SAAS,YAAY,GAAW,GAAW,YAAoB,OAAO,SAAkB;AAC7F,SAAO,KAAK,IAAI,IAAI,CAAC,KAAK;AAC5B;AAWO,SAAS,MAAM,OAAe,KAAa,KAAqB;AACrE,MAAI,MAAM,KAAK;AACb,UAAM,IAAI,WAAW,2CAA2C;AAAA,EAClE;AACA,SAAO,KAAK,IAAI,KAAK,IAAI,OAAO,GAAG,GAAG,GAAG;AAC3C;AAQO,SAAS,IAAI,QAA0B;AAC5C,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,aAAS,OAAO,CAAC;AAAA,EACnB;AACA,SAAO;AACT;AASO,SAAS,QAAQ,QAA0B;AAChD,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,WAAW,0CAA0C;AAAA,EACjE;AACA,SAAO,IAAI,MAAM,IAAI,OAAO;AAC9B;AAUO,SAAS,UAAU,KAAa,KAAqB;AAC1D,MAAI,CAAC,OAAO,UAAU,GAAG,KAAK,CAAC,OAAO,UAAU,GAAG,GAAG;AACpD,UAAM,IAAI,WAAW,4BAA4B;AAAA,EACnD;AACA,MAAI,MAAM,KAAK;AACb,UAAM,IAAI,WAAW,2CAA2C;AAAA,EAClE;AACA,SAAO,KAAK,MAAM,KAAK,OAAO,KAAK,MAAM,MAAM,EAAE,IAAI;AACvD;AAUO,SAAS,QAAQ,OAAe,KAAa,KAAsB;AACxE,SAAO,SAAS,OAAO,SAAS;AAClC;;;ACpMO,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,MAAYC,UAAiB,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,QAAMC,OAAM,CAAC,GAAW,MAAc,MAAc,OAAO,CAAC,EAAE,SAAS,KAAK,GAAG;AAE/E,SAAOD,QACJ,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,OAAOC,KAAI,QAAQ,CAAC,CAAC,EAC7B,QAAQ,OAAOA,KAAI,GAAG,CAAC,EACvB,QAAQ,OAAOA,KAAI,KAAK,CAAC,EACzB,QAAQ,OAAOA,KAAI,OAAO,CAAC,EAC3B,QAAQ,OAAOA,KAAI,OAAO,CAAC,EAC3B,QAAQ,QAAQA,KAAI,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;;;AC9cO,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;;;ACtNA,IAAM,MAAM;AAQL,SAAS,QAAQ,UAA4B;AAClD,QAAM,QAAkB,CAAC;AACzB,aAAW,OAAO,UAAU;AAC1B,QAAI,QAAQ,GAAI;AAChB,UAAM,QAAQ,IAAI,MAAM,OAAO;AAC/B,eAAW,QAAQ,OAAO;AACxB,UAAI,SAAS,MAAM,SAAS,IAAK;AACjC,UAAI,SAAS,MAAM;AACjB,YAAI,MAAM,SAAS,KAAK,MAAM,MAAM,SAAS,CAAC,MAAM,MAAM;AACxD,gBAAM,IAAI;AAAA,QACZ,OAAO;AACL,gBAAM,KAAK,IAAI;AAAA,QACjB;AAAA,MACF,OAAO;AACL,cAAM,KAAK,IAAI;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AACA,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,QAAM,SAAS,MAAM,KAAK,GAAG;AAC7B,MAAI,SAAS,SAAS,KAAK,SAAS,CAAC,EAAG,WAAW,GAAG,GAAG;AACvD,WAAO,MAAM;AAAA,EACf;AACA,SAAO;AACT;AAQO,SAAS,WAAW,UAA4B;AACrD,MAAI,WAAW;AACf,MAAI,QAAQ;AAEZ,aAAW,OAAO,UAAU;AAC1B,QAAI,IAAI,WAAW,GAAG,GAAG;AACvB,iBAAW;AACX,cAAQ;AAAA,IACV,WAAW,OAAO;AAChB,iBAAW,KAAK,UAAU,GAAG;AAAA,IAC/B,OAAO;AACL,iBAAW,WAAW,KAAK,UAAU,GAAG,IAAI;AAAA,IAC9C;AAAA,EACF;AAEA,MAAI,CAAC,OAAO;AACV,eAAW,KAAK,KAAK,QAAQ;AAAA,EAC/B;AAEA,SAAO,UAAU,QAAQ;AAC3B;AASO,SAAS,SAAS,GAAW,KAAsB;AACxD,QAAM,aAAa,EAAE,QAAQ,WAAW,EAAE;AAC1C,QAAM,MAAM,WAAW,YAAY,GAAG;AACtC,MAAI,OAAO,QAAQ,KAAK,aAAa,WAAW,MAAM,MAAM,CAAC;AAC7D,MAAI,OAAO,KAAK,SAAS,GAAG,GAAG;AAC7B,WAAO,KAAK,MAAM,GAAG,CAAC,IAAI,MAAM;AAAA,EAClC;AACA,SAAO;AACT;AAQO,SAAS,QAAQ,GAAmB;AACzC,MAAI,MAAM,IAAK,QAAO;AACtB,QAAM,aAAa,EAAE,QAAQ,WAAW,EAAE;AAC1C,MAAI,eAAe,GAAI,QAAO;AAC9B,QAAM,MAAM,WAAW,YAAY,GAAG;AACtC,MAAI,QAAQ,GAAI,QAAO;AACvB,MAAI,QAAQ,EAAG,QAAO;AACtB,SAAO,WAAW,MAAM,GAAG,GAAG;AAChC;AAQO,SAAS,QAAQ,GAAmB;AACzC,QAAM,OAAO,SAAS,CAAC;AACvB,QAAM,MAAM,KAAK,YAAY,GAAG;AAChC,MAAI,QAAQ,MAAM,QAAQ,EAAG,QAAO;AACpC,SAAO,KAAK,MAAM,GAAG;AACvB;AAQO,SAAS,UAAU,GAAmB;AAC3C,QAAM,QAAQ,EAAE,MAAM,QAAQ;AAC9B,QAAM,QAAkB,CAAC;AACzB,MAAI,QAAQ,EAAE,WAAW,GAAG;AAE5B,aAAW,QAAQ,OAAO;AACxB,QAAI,SAAS,MAAM,SAAS,IAAK;AACjC,QAAI,SAAS,MAAM;AACjB,UAAI,MAAM,SAAS,KAAK,MAAM,MAAM,SAAS,CAAC,MAAM,MAAM;AACxD,cAAM,IAAI;AAAA,MACZ,WAAW,CAAC,OAAO;AACjB,cAAM,KAAK,IAAI;AAAA,MACjB;AAAA,IACF,OAAO;AACL,YAAM,KAAK,IAAI;AAAA,IACjB;AAAA,EACF;AAEA,QAAM,SAAS,MAAM,KAAK,GAAG;AAC7B,MAAI,MAAO,QAAO,MAAM;AACxB,MAAI,WAAW,GAAI,QAAO;AAC1B,SAAO;AACT;AAQO,SAAS,WAAW,GAAoB;AAC7C,SAAO,EAAE,WAAW,GAAG;AACzB;AASO,SAAS,SAAS,MAAc,IAAoB;AACzD,QAAM,YAAY,UAAU,IAAI,EAAE,MAAM,GAAG;AAC3C,QAAM,UAAU,UAAU,EAAE,EAAE,MAAM,GAAG;AAEvC,MAAI,IAAI;AACR,SAAO,IAAI,UAAU,UAAU,IAAI,QAAQ,UAAU,UAAU,CAAC,MAAM,QAAQ,CAAC,GAAG;AAChF;AAAA,EACF;AAEA,QAAM,KAAK,UAAU,MAAM,CAAC,EAAE,IAAI,MAAM,IAAI;AAC5C,QAAM,OAAO,QAAQ,MAAM,CAAC;AAC5B,QAAM,SAAS,CAAC,GAAG,IAAI,GAAG,IAAI,EAAE,KAAK,GAAG;AAExC,SAAO,UAAU;AACnB;AAgBO,SAAS,MAAM,GAAuB;AAC3C,QAAM,OAAO,EAAE,WAAW,GAAG,IAAI,MAAM;AACvC,QAAM,OAAO,SAAS,CAAC;AACvB,QAAM,MAAM,QAAQ,IAAI;AACxB,QAAM,OAAO,MAAM,KAAK,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI;AAChD,QAAM,MAAM,OAAO,QAAQ,CAAC,IAAK,QAAQ,CAAC,MAAM,MAAM,KAAK,QAAQ,CAAC;AAEpE,SAAO,EAAE,MAAM,KAAK,MAAM,MAAM,IAAI;AACtC;AAQO,SAAS,OAAO,QAAqC;AAC1D,QAAM,EAAE,OAAO,IAAI,MAAM,IAAI,OAAO,IAAI,OAAO,IAAI,MAAM,GAAG,IAAI;AAChE,QAAM,WAAW,QAAQ,OAAO;AAChC,MAAI,KAAK;AACP,WAAO,MAAM,MAAM;AAAA,EACrB;AACA,SAAO,OAAO;AAChB;;;AC1MO,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,aAAWC,QAAO,OAAO;AACvB,eAAW,QAAQA,MAAK;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;;;AClMA,IAAM,gBAAgB;AAEtB,SAAS,WAAW,KAAuB;AACzC,SAAO,IAAI,MAAM,aAAa,KAAK,CAAC;AACtC;AAKO,SAAS,WAAW,KAAqB;AAC9C,MAAI,IAAI,WAAW,EAAG,QAAO;AAC7B,SAAO,IAAI,CAAC,EAAG,YAAY,IAAI,IAAI,MAAM,CAAC,EAAE,YAAY;AAC1D;AAKO,SAAS,UAAU,KAAqB;AAC7C,QAAMC,SAAQ,WAAW,GAAG;AAC5B,MAAIA,OAAM,WAAW,EAAG,QAAO;AAC/B,QAAM,CAAC,WAAW,GAAG,IAAI,IAAIA;AAC7B,SAAO,UAAW,YAAY,IAAI,KAAK,IAAI,OAAK,EAAE,CAAC,EAAG,YAAY,IAAI,EAAE,MAAM,CAAC,EAAE,YAAY,CAAC,EAAE,KAAK,EAAE;AACzG;AAKO,SAAS,UAAU,KAAqB;AAC7C,SAAO,WAAW,GAAG,EAAE,IAAI,OAAK,EAAE,YAAY,CAAC,EAAE,KAAK,GAAG;AAC3D;AAKO,SAAS,UAAU,KAAqB;AAC7C,SAAO,WAAW,GAAG,EAAE,IAAI,OAAK,EAAE,YAAY,CAAC,EAAE,KAAK,GAAG;AAC3D;AAKO,SAAS,WAAW,KAAqB;AAC9C,SAAO,WAAW,GAAG,EAAE,IAAI,OAAK,EAAE,CAAC,EAAG,YAAY,IAAI,EAAE,MAAM,CAAC,EAAE,YAAY,CAAC,EAAE,KAAK,EAAE;AACzF;AAKO,SAAS,SAAS,KAAa,WAAmB,SAAS,OAAe;AAC/E,MAAI,IAAI,UAAU,UAAW,QAAO;AACpC,SAAO,IAAI,MAAM,GAAG,KAAK,IAAI,GAAG,YAAY,OAAO,MAAM,CAAC,IAAI;AAChE;AAOO,SAAS,SAAS,KAAa,MAA+C;AACnF,SAAO,IAAI,QAAQ,kBAAkB,CAAC,GAAG,QAAgB;AACvD,UAAM,QAAQ,KAAK,GAAG;AACtB,WAAO,UAAU,SAAY,OAAO,KAAK,IAAI,KAAK,GAAG;AAAA,EACvD,CAAC;AACH;AAMO,SAAS,OAAe;AAC7B,MAAI,OAAO,WAAW,eAAe,OAAO,OAAO,eAAe,YAAY;AAC5E,WAAO,OAAO,WAAW;AAAA,EAC3B;AACA,QAAM,MAAM;AACZ,QAAM,QAAkB,CAAC;AACzB,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,QAAI,MAAM,KAAK,MAAM,MAAM,MAAM,MAAM,MAAM,IAAI;AAC/C,YAAM,KAAK,GAAG;AAAA,IAChB,WAAW,MAAM,IAAI;AACnB,YAAM,KAAK,GAAG;AAAA,IAChB,WAAW,MAAM,IAAI;AACnB,YAAM,KAAK,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,CAAE;AAAA,IACpD,OAAO;AACL,YAAM,KAAK,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,EAAE,CAAC,CAAE;AAAA,IACjD;AAAA,EACF;AACA,SAAO,MAAM,KAAK,EAAE;AACtB;AAOO,SAAS,OAAO,OAAO,IAAI,WAAW,oEAA4E;AACvH,QAAM,MAAM,SAAS;AACrB,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,cAAU,SAAS,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG,CAAC;AAAA,EACpD;AACA,SAAO;AACT;AAEA,IAAM,kBAA0C;AAAA,EAC9C,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AACP;AAEA,IAAM,oBAA4C;AAAA,EAChD,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,SAAS;AAAA,EACT,UAAU;AACZ;AAKO,SAAS,WAAW,KAAqB;AAC9C,SAAO,IAAI,QAAQ,YAAY,QAAM,gBAAgB,EAAE,KAAK,EAAE;AAChE;AAKO,SAAS,aAAa,KAAqB;AAChD,SAAO,IAAI,QAAQ,kCAAkC,YAAU,kBAAkB,MAAM,KAAK,MAAM;AACpG;AAKO,SAAS,KAAK,KAAqB;AACxC,SAAO,IAAI,KAAK;AAClB;AAKO,SAAS,UAAU,KAAqB;AAC7C,SAAO,IAAI,UAAU;AACvB;AAKO,SAAS,QAAQ,KAAqB;AAC3C,SAAO,IAAI,QAAQ;AACrB;AAKO,SAAS,IAAI,KAAa,QAAgB,OAAO,KAAa;AACnE,QAAM,eAAe,KAAK,IAAI,GAAG,SAAS,IAAI,MAAM;AACpD,QAAM,UAAU,KAAK,MAAM,eAAe,CAAC;AAC3C,QAAM,WAAW,eAAe;AAChC,SAAO,KAAK,OAAO,OAAO,IAAI,MAAM,KAAK,OAAO,QAAQ;AAC1D;AAKO,SAAS,SAAS,KAAa,QAAgB,OAAO,KAAa;AACxE,SAAO,IAAI,SAAS,QAAQ,IAAI;AAClC;AAKO,SAAS,OAAO,KAAa,QAAgB,OAAO,KAAa;AACtE,SAAO,IAAI,OAAO,QAAQ,IAAI;AAChC;AAKO,SAAS,QAAQ,KAAqB;AAC3C,SAAO,IAAI,MAAM,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE;AACxC;AAKO,SAAS,MAAM,KAAuB;AAC3C,SAAO,WAAW,GAAG;AACvB;AAKO,SAAS,QAAQ,KAAqB;AAC3C,SAAO,IACJ,YAAY,EACZ,QAAQ,aAAa,EAAE,EACvB,QAAQ,WAAW,GAAG,EACtB,QAAQ,OAAO,GAAG,EAClB,QAAQ,OAAO,EAAE,EACjB,QAAQ,OAAO,EAAE;AACtB;AAKO,SAAS,iBAAiB,KAAa,WAA2B;AACvE,MAAI,UAAU,WAAW,KAAK,IAAI,WAAW,EAAG,QAAO;AACvD,MAAI,QAAQ;AACZ,MAAI,MAAM;AACV,UAAQ,MAAM,IAAI,QAAQ,WAAW,GAAG,OAAO,IAAI;AACjD;AACA,WAAO,UAAU;AAAA,EACnB;AACA,SAAO;AACT;;;ACrNO,SAAS,MAAM,IAA2B;AAC/C,SAAO,IAAI,QAAQ,CAAAC,aAAW,WAAWA,UAAS,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,CAAAA,aAAW;AACvD,YAAQ,WAAW,MAAMA,SAAQ,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,MAAIA;AACJ,MAAI;AACJ,QAAM,UAAU,IAAI,QAAW,CAAC,KAAK,QAAQ;AAC3C,IAAAA,WAAU;AACV,aAAS;AAAA,EACX,CAAC;AACD,SAAO,EAAE,SAAS,SAAAA,UAAS,OAAO;AACpC;;;AC1GO,SAAS,SAAS,OAAe,SAAgD;AACtF,QAAM,EAAE,YAAY,KAAK,SAAS,MAAM,iBAAiB,KAAK,IAAI,WAAW,CAAC;AAE9E,QAAM,QAAQ,MAAM,MAAM,OAAO;AACjC,QAAM,OAAmB,CAAC;AAE1B,aAAW,QAAQ,OAAO;AACxB,UAAM,UAAU,KAAK,KAAK;AAC1B,QAAI,kBAAkB,QAAQ,WAAW,EAAG;AAC5C,UAAM,SAAS,aAAa,SAAS,SAAS;AAC9C,SAAK,KAAK,MAAM;AAAA,EAClB;AAEA,MAAI,KAAK,WAAW,EAAG,QAAO,CAAC;AAE/B,MAAI,QAAQ;AACV,UAAM,CAAC,MAAM,GAAG,IAAI,IAAI;AACxB,QAAI,SAAS,OAAW,QAAO,CAAC;AAChC,WAAO,KAAK,IAAI,SAAO;AACrB,YAAM,SAAiC,CAAC;AACxC,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,eAAO,KAAK,CAAC,CAAE,IAAI,IAAI,CAAC,KAAK;AAAA,MAC/B;AACA,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAEA,SAAO,KAAK,IAAI,SAAO;AACrB,UAAM,SAAiC,CAAC;AACxC,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,aAAO,OAAO,CAAC,CAAC,IAAI,IAAI,CAAC;AAAA,IAC3B;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAEA,SAAS,aAAa,MAAc,WAA6B;AAC/D,QAAM,SAAmB,CAAC;AAC1B,MAAI,UAAU;AACd,MAAI,WAAW;AAEf,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,KAAK,KAAK,CAAC;AACjB,QAAI,UAAU;AACZ,UAAI,OAAO,KAAK;AACd,YAAI,KAAK,IAAI,CAAC,MAAM,KAAK;AACvB,qBAAW;AACX;AAAA,QACF,OAAO;AACL,qBAAW;AAAA,QACb;AAAA,MACF,OAAO;AACL,mBAAW;AAAA,MACb;AAAA,IACF,OAAO;AACL,UAAI,OAAO,KAAK;AACd,mBAAW;AAAA,MACb,WAAW,OAAO,WAAW;AAC3B,eAAO,KAAK,OAAO;AACnB,kBAAU;AAAA,MACZ,OAAO;AACL,mBAAW;AAAA,MACb;AAAA,IACF;AAAA,EACF;AACA,SAAO,KAAK,OAAO;AACnB,SAAO;AACT;AAKO,SAAS,aAAa,MAAiC,SAA0C;AACtG,QAAM,EAAE,YAAY,IAAI,IAAI,WAAW,CAAC;AACxC,MAAI,KAAK,WAAW,EAAG,QAAO;AAE9B,QAAM,UAAU,OAAO,KAAK,KAAK,CAAC,CAAE;AACpC,QAAM,QAAkB,CAAC,QAAQ,IAAI,OAAK,eAAe,GAAG,SAAS,CAAC,EAAE,KAAK,SAAS,CAAC;AAEvF,aAAW,UAAU,MAAM;AACzB,UAAM,MAAM,QAAQ,IAAI,OAAK,eAAe,OAAO,OAAO,CAAC,KAAK,EAAE,GAAG,SAAS,CAAC;AAC/E,UAAM,KAAK,IAAI,KAAK,SAAS,CAAC;AAAA,EAChC;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,eAAe,OAAe,WAA2B;AAChE,MAAI,MAAM,SAAS,GAAG,KAAK,MAAM,SAAS,SAAS,KAAK,MAAM,SAAS,IAAI,KAAK,MAAM,SAAS,IAAI,GAAG;AACpG,WAAO,MAAM,MAAM,QAAQ,MAAM,IAAI,IAAI;AAAA,EAC3C;AACA,SAAO;AACT;AAKO,SAAS,cAAiB,OAAe,UAAwB;AACtE,MAAI;AACF,WAAO,KAAK,MAAM,KAAK;AAAA,EACzB,QAAQ;AACN,WAAO,YAAY;AAAA,EACrB;AACF;AAKO,SAAS,IAAI,MAAc,UAA2B;AAC3D,QAAM,QAAQ,QAAQ,IAAI,IAAI;AAC9B,SAAO,SAAS,YAAY;AAC9B;AAKO,SAAS,OAAO,MAAc,UAA2B;AAC9D,QAAM,QAAQ,QAAQ,IAAI,IAAI;AAC9B,MAAI,UAAU,UAAa,UAAU,GAAI,QAAO,YAAY;AAC5D,QAAM,SAAS,OAAO,SAAS,OAAO,EAAE;AACxC,SAAO,OAAO,MAAM,MAAM,IAAK,YAAY,IAAK;AAClD;AAKO,SAAS,QAAQ,MAAc,UAA6B;AACjE,QAAM,QAAQ,QAAQ,IAAI,IAAI;AAC9B,MAAI,UAAU,UAAa,UAAU,GAAI,QAAO,YAAY;AAC5D,SAAO,UAAU,UAAU,UAAU,OAAO,UAAU;AACxD;;;AC9IO,SAAS,SAAS,OAAiC;AACxD,SAAO,OAAO,UAAU;AAC1B;AAKO,SAAS,SAAS,OAAiC;AACxD,SAAO,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK;AAC3D;AAKO,SAAS,UAAU,OAAkC;AAC1D,SAAO,OAAO,UAAU;AAC1B;AAKO,SAAS,SAAS,OAAkD;AACzE,SAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK;AAC5E;AAKO,SAAS,QAAQ,OAAoC;AAC1D,SAAO,MAAM,QAAQ,KAAK;AAC5B;AAKO,SAAS,WAAW,OAA0D;AACnF,SAAO,OAAO,UAAU;AAC1B;AAKO,SAAS,OAAO,OAA+B;AACpD,SAAO,iBAAiB,QAAQ,CAAC,OAAO,MAAM,MAAM,QAAQ,CAAC;AAC/D;AAKO,SAAS,SAAS,OAAiC;AACxD,SAAO,iBAAiB;AAC1B;AAKO,SAAS,MAAM,OAAgD;AACpE,SAAO,iBAAiB;AAC1B;AAKO,SAAS,MAAM,OAAuC;AAC3D,SAAO,iBAAiB;AAC1B;AAKO,SAAS,UAAU,OAA2C;AACnE,SAAO,iBAAiB;AAC1B;AAKO,SAAS,OAAO,OAA+B;AACpD,SAAO,UAAU;AACnB;AAKO,SAAS,YAAY,OAAoC;AAC9D,SAAO,UAAU;AACnB;AAKO,SAAS,MAAM,OAA2C;AAC/D,SAAO,UAAU,QAAQ,UAAU;AACrC;AAmBO,SAAS,cAAiB,OAAU,SAAmD;AAC5F,MAAI,UAAU,QAAQ,UAAU,QAAW;AACzC,UAAM,IAAI,MAAM,WAAW,8BAA8B;AAAA,EAC3D;AACF;AAKO,SAAS,WAAc,OAAgB,OAA+B,SAAsC;AACjH,MAAI,CAAC,MAAM,KAAK,GAAG;AACjB,UAAM,IAAI,MAAM,WAAW,oCAAoC;AAAA,EACjE;AACF;AAKO,SAAS,YAAe,OAAqB;AAClD,SAAO,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,KAAK;AAC9C;AAKO,SAAS,UAAa,OAAqB;AAChD,SAAO,YAAY,KAAK;AAC1B;AAQO,SAASC,SAAQ,OAAwB;AAC9C,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,MAAI,OAAO,UAAU,UAAW,QAAO;AACvC,MAAI,OAAO,UAAU,WAAY,QAAO;AACxC,MAAI,OAAO,UAAU,UAAU;AAC7B,QAAI,OAAO,MAAM,KAAK,EAAG,QAAO;AAChC,QAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,WAAO;AAAA,EACT;AACA,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO;AACjC,MAAI,iBAAiB,KAAM,QAAO;AAClC,MAAI,iBAAiB,OAAQ,QAAO;AACpC,MAAI,iBAAiB,IAAK,QAAO;AACjC,MAAI,iBAAiB,IAAK,QAAO;AACjC,MAAI,iBAAiB,QAAS,QAAO;AACrC,SAAO;AACT;;;ACxKA,SAAS,cAAc,aAAa,kBAAkB;AACtD,SAAS,QAAAC,OAAM,YAAAC,iBAAgB;;;ACWxB,IAAM,iBAAmC;AAAA,EAC9C;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,kBAAkB;AAAA,EACpB;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,kBAAkB;AAAA,EACpB;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,kBAAkB;AAAA,EACpB;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,kBAAkB;AAAA,EACpB;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,kBAAkB;AAAA,EACpB;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,kBAAkB;AAAA,EACpB;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,kBAAkB;AAAA,EACpB;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,kBAAkB;AAAA,EACpB;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,kBAAkB;AAAA,EACpB;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,kBAAkB;AAAA,EACpB;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,kBAAkB;AAAA,EACpB;AACF;AAEO,IAAM,aAA+E;AAAA,EAC1F,cAAc;AAAA,IACZ,EAAE,KAAK,iBAAiB,UAAU,QAAQ,KAAK,sCAAsC;AAAA,EACvF;AAAA,EACA,UAAU;AAAA,IACR,EAAE,KAAK,kBAAkB,UAAU,UAAU,KAAK,kCAAkC;AAAA,EACtF;AAAA,EACA,SAAS;AAAA,IACP,EAAE,KAAK,kBAAkB,UAAU,QAAQ,KAAK,iCAAiC;AAAA,EACnF;AAAA,EACA,UAAU;AAAA,IACR,EAAE,KAAK,kBAAkB,UAAU,QAAQ,KAAK,oCAAoC;AAAA,IACpF,EAAE,KAAK,iBAAiB,UAAU,UAAU,KAAK,oCAAoC;AAAA,EACvF;AACF;;;ADnHA,SAAS,iBAAiB,MAA+G;AACvI,QAAM,MAAM,aAAa,MAAM,OAAO;AACtC,QAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,SAAO;AAAA,IACL,MAAM,KAAK,QAAQC,UAASC,MAAK,MAAM,IAAI,CAAC;AAAA,IAC5C,cAAe,KAAK,gBAA2C,CAAC;AAAA,IAChE,iBAAkB,KAAK,mBAA8C,CAAC;AAAA,EACxE;AACF;AAEA,SAAS,cAAc,aAA0C;AAC/D,QAAM,WAAWA,MAAK,aAAa,mBAAmB;AACtD,MAAI,CAAC,WAAW,QAAQ,EAAG,QAAO;AAClC,MAAI;AACF,UAAM,MAAM,aAAa,UAAU,OAAO;AAC1C,UAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,UAAM,WAA6B,CAAC;AAEpC,QAAI,KAAK,UAAU;AACjB,iBAAW,CAAC,KAAK,GAAG,KAAK,OAAO,QAAQ,KAAK,QAAgD,GAAG;AAC9F,YAAI,KAAK;AACP,mBAAS,GAAG,IAAI;AAAA,QAClB;AAAA,MACF;AAAA,IACF;AAEA,QAAI,KAAK,gBAAgB,OAAO,KAAK,QAAQ,EAAE,WAAW,GAAG;AAC3D,iBAAW,CAAC,KAAK,GAAG,KAAK,OAAO,QAAQ,KAAK,YAAuF,GAAG;AACrI,iBAAS,GAAG,IAAI,EAAE,SAAS,IAAI,SAAS,cAAc,IAAI,SAAS;AAAA,MACrE;AAAA,IACF;AAEA,WAAO,EAAE,SAAS;AAAA,EACpB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,mBAAmB,UAAkB,OAAwB;AACpE,MAAI;AACF,UAAM,UAAU,aAAa,UAAU,OAAO;AAC9C,WAAO,MAAM,KAAK,OAAO;AAAA,EAC3B,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,mBAAmB,aAAqB,SAAkC;AACjF,QAAM,QAAQ,IAAI,OAAO,QAAQ,gBAAgB;AACjD,QAAM,SAASA,MAAK,aAAa,KAAK;AACtC,MAAI,CAAC,WAAW,MAAM,EAAG,QAAO;AAEhC,MAAI;AACF,UAAM,QAAQ,mBAAmB,MAAM;AACvC,eAAW,QAAQ,OAAO;AACxB,UAAI,mBAAmB,MAAM,KAAK,EAAG,QAAO;AAAA,IAC9C;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,KAAuB;AACjD,QAAM,UAAoB,CAAC;AAC3B,MAAI;AACF,UAAM,UAAU,YAAY,KAAK,EAAE,eAAe,KAAK,CAAC;AACxD,eAAW,SAAS,SAAS;AAC3B,UAAI,MAAM,SAAS,kBAAkB,MAAM,SAAS,UAAU,MAAM,SAAS,UAAU,MAAM,SAAS,cAAc,MAAM,SAAS,SAAS;AAC1I;AAAA,MACF;AACA,YAAM,OAAOA,MAAK,KAAK,MAAM,IAAI;AACjC,UAAI,MAAM,YAAY,GAAG;AACvB,gBAAQ,KAAK,GAAG,mBAAmB,IAAI,CAAC;AAAA,MAC1C,WAAW,MAAM,OAAO,GAAG;AACzB,cAAM,MAAM,MAAM,KAAK,MAAM,GAAG,EAAE,IAAI;AACtC,YAAI,QAAQ,QAAQ,QAAQ,SAAS,QAAQ,QAAQ,QAAQ,SAAS,QAAQ,SAAS,QAAQ,OAAO;AACpG,kBAAQ,KAAK,IAAI;AAAA,QACnB;AAAA,MACF;AAAA,IACF;AAAA,EACF,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAEA,SAAS,wBAAwB,UAA+B,aAAkC;AAChG,MAAI,CAAC,SAAU,QAAO;AACtB,MAAI,QAAQ;AACZ,aAAW,OAAO,OAAO,KAAK,SAAS,QAAQ,GAAG;AAChD,QAAI,CAAC,OAAO,QAAQ,GAAI;AACxB,UAAM,OAAO,IAAI,WAAW,eAAe,IAAI,IAAI,MAAM,gBAAgB,MAAM,IAAI;AACnF,UAAM,WAAW,KAAK,WAAW,GAAG,IAAI,GAAG,KAAK,MAAM,GAAG,EAAE,CAAC,CAAC,IAAI,KAAK,MAAM,GAAG,EAAE,CAAC,CAAC,KAAK,KAAK,MAAM,GAAG,EAAE,CAAC;AACzG,QAAI,YAAY,CAAC,YAAY,IAAI,QAAQ,GAAG;AAC1C;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,UAAU,OAAuB;AACxC,QAAM,UAAU,MAAM,QAAQ,YAAY,EAAE,EAAE,KAAK;AACnD,QAAM,QAAQ,QAAQ,MAAM,sBAAsB;AAClD,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,MAAM,OAAO,WAAW,MAAM,CAAC,CAAE;AACvC,MAAI,CAAC,MAAM,CAAC,EAAG,QAAO;AACtB,MAAI,MAAM,CAAC,EAAE,YAAY,MAAM,KAAM,QAAO,MAAM;AAClD,SAAO;AACT;AAEA,eAAsB,YAAY,QAA4C;AAC5E,QAAM,cAAc,OAAO,QAAQ;AACnC,QAAM,UAAUA,MAAK,aAAa,cAAc;AAEhD,MAAI,CAAC,WAAW,OAAO,GAAG;AACxB,UAAM,IAAI,MAAM,4BAA4B,WAAW,+DAA+D;AAAA,EACxH;AAEA,QAAM,MAAM,iBAAiB,OAAO;AACpC,QAAM,WAAW,cAAc,WAAW;AAE1C,QAAM,UAAkC,EAAE,GAAG,IAAI,cAAc,GAAG,IAAI,gBAAgB;AACtF,QAAM,cAAc,IAAI,IAAI,OAAO,KAAK,OAAO,CAAC;AAEhD,QAAM,kBAAkB,wBAAwB,UAAU,WAAW;AAErE,QAAM,yBAAkD,CAAC;AACzD,QAAM,2BAAoD,CAAC;AAC3D,QAAM,iBAAkC,CAAC;AAEzC,QAAM,UAAkC,CAAC;AACzC,aAAW,KAAK,gBAAgB;AAC9B,YAAQ,EAAE,IAAI,IAAI,EAAE;AAAA,EACtB;AAEA,aAAW,WAAW,gBAAgB;AACpC,UAAM,WAAW,YAAY,IAAI,QAAQ,IAAI;AAC7C,QAAI,CAAC,SAAU;AAEf,UAAM,SAAS,mBAAmB,aAAa,OAAO;AACtD,QAAI,CAAC,UAAU,CAAC,OAAO,QAAS;AAEhC,UAAM,cAAc,UAAU,QAAQ,QAAQ,IAAI,KAAK,MAAM;AAC7D,UAAM,kBAAkB,QAAQ,YAAY,WAAW,QAAQ,IAAI,IAAI;AACvE,UAAM,eAAe,cAAc,OAC/B,IAAI,cAAc,MAAM,QAAQ,CAAC,CAAC,cAAS,eAAe,QAC1D,GAAG,YAAY,QAAQ,CAAC,CAAC,cAAS,eAAe;AAErD,UAAM,aAAoC;AAAA,MACxC,aAAa,QAAQ;AAAA,MACrB,QAAQ,QAAQ;AAAA,MAChB,aAAa,QAAQ;AAAA,MACrB,wBAAwB;AAAA,MACxB,YAAY,QAAQ;AAAA,MACpB,aAAa,QAAQ;AAAA,IACvB;AAEA,QAAI,QAAQ,eAAe,QAAQ;AACjC,6BAAuB,KAAK,UAAU;AAAA,IACxC,OAAO;AACL,+BAAyB,KAAK,UAAU;AAAA,IAC1C;AAAA,EACF;AAEA,aAAW,CAAC,MAAM,IAAI,KAAK,OAAO,QAAQ,UAAU,GAAG;AACrD,QAAI,YAAY,IAAI,IAAI,GAAG;AACzB,iBAAW,WAAW,MAAM;AAC1B,uBAAe,KAAK;AAAA,UAClB,aAAa;AAAA,UACb,OAAO,QAAQ;AAAA,UACf,UAAU,QAAQ;AAAA,UAClB,KAAK,QAAQ;AAAA,QACf,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,MAAI,cAAc;AAClB,aAAW,WAAW,aAAa;AACjC,UAAM,UAAU,QAAQ,OAAO;AAC/B,QAAI,SAAS;AACX,qBAAe,UAAU,OAAO;AAAA,IAClC,OAAO;AACL,qBAAe;AAAA,IACjB;AAAA,EACF;AACA,iBAAe,kBAAkB;AAEjC,QAAM,eAAe,cAAc,OAC/B,IAAI,cAAc,MAAM,QAAQ,CAAC,CAAC,QAClC,GAAG,YAAY,QAAQ,CAAC,CAAC;AAE7B,SAAO;AAAA,IACL,aAAa,IAAI;AAAA,IACjB,YAAY,YAAY;AAAA,IACxB,gBAAgB;AAAA,IAChB,oBAAoB;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AEvNA,OAAO,QAAQ;AAGf,SAAS,cAAc,UAA6C;AAClE,UAAQ,UAAU;AAAA,IAChB,KAAK;AAAY,aAAO,GAAG,KAAK,GAAG,IAAI,SAAS,YAAY,CAAC,CAAC;AAAA,IAC9D,KAAK;AAAQ,aAAO,GAAG,IAAI,SAAS,YAAY,CAAC;AAAA,IACjD,KAAK;AAAU,aAAO,GAAG,OAAO,SAAS,YAAY,CAAC;AAAA,IACtD,KAAK;AAAO,aAAO,GAAG,IAAI,SAAS,YAAY,CAAC;AAAA,EAClD;AACF;AAEA,SAAS,eAAe,YAAyD;AAC/E,UAAQ,YAAY;AAAA,IAClB,KAAK;AAAQ,aAAO,GAAG,MAAM,QAAG;AAAA,IAChC,KAAK;AAAU,aAAO,GAAG,OAAO,QAAG;AAAA,IACnC,KAAK;AAAO,aAAO,GAAG,IAAI,QAAG;AAAA,EAC/B;AACF;AAEO,SAAS,eAAe,QAAoB,YAA8B;AAC/E,MAAI,YAAY;AACd,WAAO,KAAK,UAAU,QAAQ,MAAM,CAAC;AAAA,EACvC;AAEA,QAAM,QAAkB,CAAC;AAGzB,QAAM,KAAK,GAAG,KAAK,GAAG,KAAK,SAAI,SAAI,OAAO,EAAE,CAAC,QAAG,CAAC,CAAC;AAClD,QAAM,KAAK,GAAG,KAAK,GAAG,KAAK,SAAI,IAAI,OAAO,EAAE,CAAC,mBAAmB,IAAI,OAAO,EAAE,CAAC,QAAG,CAAC,CAAC;AACnF,QAAM,KAAK,GAAG,KAAK,GAAG,KAAK,SAAI,SAAI,OAAO,EAAE,CAAC,QAAG,CAAC,CAAC;AAClD,QAAM,KAAK,GAAG,KAAK,GAAG,KAAK,WAAM,GAAG,MAAM,oBAAa,CAAC,IAAI,GAAG,KAAK,OAAO,WAAW,CAAC,GAAG,IAAI,OAAO,KAAK,IAAI,GAAG,KAAK,OAAO,YAAY,MAAM,CAAC,CAAC,QAAG,CAAC,CAAC;AACtJ,QAAM,KAAK,GAAG,KAAK,GAAG,KAAK,WAAM,GAAG,MAAM,yBAAkB,CAAC,IAAI,GAAG,KAAK,OAAO,OAAO,UAAU,CAAC,CAAC,aAAa,GAAG,KAAK,OAAO,OAAO,cAAc,CAAC,CAAC,cAAc,IAAI,OAAO,KAAK,IAAI,GAAG,KAAK,OAAO,OAAO,cAAc,EAAE,MAAM,CAAC,CAAC,QAAG,CAAC,CAAC;AAC3O,QAAM,KAAK,GAAG,KAAK,GAAG,KAAK,WAAM,GAAG,MAAM,uBAAgB,CAAC,IAAI,GAAG,KAAK,OAAO,kBAAkB,CAAC,GAAG,IAAI,OAAO,KAAK,IAAI,GAAG,KAAK,OAAO,mBAAmB,MAAM,CAAC,CAAC,QAAG,CAAC,CAAC;AACvK,QAAM,KAAK,GAAG,KAAK,GAAG,KAAK,SAAI,SAAI,OAAO,EAAE,CAAC,QAAG,CAAC,CAAC;AAElD,MAAI,OAAO,uBAAuB,SAAS,GAAG;AAC5C,UAAM,KAAK,GAAG,KAAK,GAAG,KAAK,WAAM,GAAG,MAAM,WAAI,CAAC,IAAI,GAAG,KAAK,GAAG,MAAM,0BAA0B,CAAC,CAAC,GAAG,IAAI,OAAO,EAAE,CAAC,QAAG,CAAC,CAAC;AACtH,eAAW,QAAQ,OAAO,wBAAwB;AAChD,YAAM,SAAS,KAAK,cAAc,GAAG,MAAM,sBAAiB,IAAI,GAAG,IAAI,sBAAsB;AAC7F,YAAM,WAAW,eAAe,KAAK,UAAU;AAC/C,YAAM,KAAK,GAAG,KAAK,GAAG,KAAK,SAAI,SAAI,OAAO,EAAE,CAAC,QAAG,CAAC,CAAC;AAClD,YAAM,KAAK,GAAG,KAAK,GAAG,KAAK,WAAM,GAAG,IAAI,QAAG,CAAC,IAAI,GAAG,KAAK,KAAK,WAAW,CAAC,KAAK,KAAK,sBAAsB,IAAI,IAAI,OAAO,KAAK,IAAI,GAAG,KAAK,KAAK,uBAAuB,MAAM,CAAC,CAAC,QAAG,CAAC,CAAC;AAClL,YAAM,KAAK,GAAG,KAAK,GAAG,KAAK,WAAM,GAAG,IAAI,QAAG,CAAC,IAAI,GAAG,KAAK,KAAK,WAAW,CAAC,GAAG,IAAI,OAAO,KAAK,IAAI,GAAG,KAAK,KAAK,YAAY,MAAM,CAAC,CAAC,QAAG,CAAC,CAAC;AACtI,YAAM,KAAK,GAAG,KAAK,GAAG,KAAK,WAAM,GAAG,IAAI,cAAI,CAAC,IAAI,MAAM,KAAK,QAAQ,IAAI,KAAK,UAAU,GAAG,IAAI,OAAO,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,QAAG,CAAC,CAAC;AAAA,IAC5H;AAAA,EACF;AAEA,MAAI,OAAO,yBAAyB,SAAS,GAAG;AAC9C,UAAM,KAAK,GAAG,KAAK,GAAG,KAAK,SAAI,SAAI,OAAO,EAAE,CAAC,QAAG,CAAC,CAAC;AAClD,UAAM,KAAK,GAAG,KAAK,GAAG,KAAK,WAAM,GAAG,OAAO,WAAI,CAAC,IAAI,GAAG,KAAK,GAAG,OAAO,4BAA4B,CAAC,CAAC,GAAG,IAAI,OAAO,EAAE,CAAC,QAAG,CAAC,CAAC;AAC1H,eAAW,QAAQ,OAAO,0BAA0B;AAClD,YAAM,SAAS,KAAK,cAAc,GAAG,MAAM,sBAAiB,IAAI,GAAG,IAAI,sBAAsB;AAC7F,YAAM,WAAW,eAAe,KAAK,UAAU;AAC/C,YAAM,KAAK,GAAG,KAAK,GAAG,KAAK,SAAI,SAAI,OAAO,EAAE,CAAC,QAAG,CAAC,CAAC;AAClD,YAAM,KAAK,GAAG,KAAK,GAAG,KAAK,WAAM,GAAG,IAAI,QAAG,CAAC,IAAI,GAAG,KAAK,KAAK,WAAW,CAAC,KAAK,KAAK,sBAAsB,IAAI,IAAI,OAAO,KAAK,IAAI,GAAG,KAAK,KAAK,uBAAuB,MAAM,CAAC,CAAC,QAAG,CAAC,CAAC;AAClL,YAAM,KAAK,GAAG,KAAK,GAAG,KAAK,WAAM,GAAG,IAAI,QAAG,CAAC,IAAI,GAAG,KAAK,KAAK,WAAW,CAAC,GAAG,IAAI,OAAO,KAAK,IAAI,GAAG,KAAK,KAAK,YAAY,MAAM,CAAC,CAAC,QAAG,CAAC,CAAC;AACtI,YAAM,KAAK,GAAG,KAAK,GAAG,KAAK,WAAM,GAAG,IAAI,cAAI,CAAC,IAAI,MAAM,KAAK,QAAQ,IAAI,KAAK,UAAU,GAAG,IAAI,OAAO,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,QAAG,CAAC,CAAC;AAAA,IAC5H;AAAA,EACF;AAEA,MAAI,OAAO,eAAe,SAAS,GAAG;AACpC,UAAM,KAAK,GAAG,KAAK,GAAG,KAAK,SAAI,SAAI,OAAO,EAAE,CAAC,QAAG,CAAC,CAAC;AAClD,UAAM,KAAK,GAAG,KAAK,GAAG,KAAK,WAAM,GAAG,IAAI,WAAI,CAAC,IAAI,GAAG,KAAK,GAAG,IAAI,iBAAiB,CAAC,CAAC,GAAG,IAAI,OAAO,EAAE,CAAC,QAAG,CAAC,CAAC;AACzG,eAAW,SAAS,OAAO,gBAAgB;AACzC,YAAM,KAAK,GAAG,KAAK,GAAG,KAAK,SAAI,SAAI,OAAO,EAAE,CAAC,QAAG,CAAC,CAAC;AAClD,YAAM,KAAK,GAAG,KAAK,GAAG,KAAK,WAAM,cAAc,MAAM,QAAQ,CAAC,IAAI,GAAG,KAAK,MAAM,KAAK,CAAC,OAAO,MAAM,WAAW,GAAG,IAAI,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,YAAY,MAAM,CAAC,CAAC,QAAG,CAAC,CAAC;AAC5K,YAAM,KAAK,GAAG,KAAK,GAAG,KAAK,WAAM,GAAG,IAAI,QAAG,CAAC,IAAI,MAAM,GAAG,GAAG,IAAI,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,IAAI,MAAM,CAAC,CAAC,QAAG,CAAC,CAAC;AAAA,IACjH;AAAA,EACF;AAEA,QAAM,KAAK,GAAG,KAAK,GAAG,KAAK,SAAI,SAAI,OAAO,EAAE,CAAC,QAAG,CAAC,CAAC;AAElD,SAAO,MAAM,KAAK,IAAI;AACxB;;;AC1EA,SAAS,gBAAAC,qBAAoB;AAC7B,SAAS,eAAAC,cAAa,gBAAgB;AACtC,SAAS,QAAAC,OAAM,WAAAC,gBAAe;AAE9B,IAAM,oBAAoB,oBAAI,IAAI,CAAC,OAAO,QAAQ,OAAO,QAAQ,QAAQ,MAAM,CAAC;AAEhF,SAAS,aAAa,MAAuB;AAC3C,SAAO,kBAAkB,IAAIA,SAAQ,IAAI,CAAC;AAC5C;AAEA,SAASC,oBAAmB,KAAuB;AACjD,QAAM,UAAoB,CAAC;AAC3B,MAAI;AACF,UAAM,UAAUH,aAAY,KAAK,EAAE,eAAe,KAAK,CAAC;AACxD,eAAW,SAAS,SAAS;AAC3B,YAAM,WAAWC,MAAK,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,GAAGE,oBAAmB,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,SAASF,MAAK,aAAa,KAAK;AACtC,MAAI;AACJ,MAAI;AACF,QAAI,SAAS,MAAM,EAAE,YAAY,GAAG;AAClC,cAAQE,oBAAmB,MAAM;AAAA,IACnC,OAAO;AACL,cAAQA,oBAAmB,WAAW;AAAA,IACxC;AAAA,EACF,QAAQ;AACN,YAAQA,oBAAmB,WAAW;AAAA,EACxC;AAEA,aAAW,QAAQ,OAAO;AACxB,QAAI;AACF,YAAM,UAAUJ,cAAa,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":["resolve","format","pad","sub","words","resolve","getType","join","basename","basename","join","readFileSync","readdirSync","join","extname","collectSourceFiles"]}