code-gauge 10.2.3 → 10.2.4

package/dist/cli.js.map

@@ -1 +1 @@
-{"version":3,"file":"cli.js","names":[],"sources":["../src/cli.ts"],"sourcesContent":["#!/usr/bin/env node\n\nimport { Command, InvalidArgumentError } from 'commander';\nimport { getErrorMessage, parsePositiveInteger } from '@willbooster/shared-lib';\nimport { type CliOptions, configFileName, loadConfig, type ResolvedOptions, resolveOptions } from './cliConfig.js';\nimport type { CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport { runCheckCommand, type CheckCliOptions } from './checkCommand.js';\nimport { loadExclusion } from './exclusion.js';\nimport {\n  addCrossFileDuplication,\n  collectDuplicatedLineNumbers,\n  configSearchDirectory,\n  formatPath,\n  resolveTarget,\n  scanTarget,\n  writeStderr,\n  writeStdout,\n  type FileMetrics,\n  type ScanResult,\n} from './scan.js';\nimport {\n  duplicationThreshold,\n  fileThresholds,\n  functionThresholds,\n  levels,\n  thresholds,\n  type Level,\n  type Limits,\n} from './thresholds.js';\nimport { qualifyFunctionName } from './thresholdCheck.js';\nimport type { FunctionMetrics } from './types.js';\n\n/** The worst (highest-cognitive-complexity) function of a file, reported as the ranking evidence. */\ninterface WorstFunction {\n  name: string;\n  startLine: number;\n  endLine: number;\n  cognitiveComplexity: number;\n  ncss: number;\n  nestingDepth: number;\n}\n\n/**\n * One ranked refactoring candidate. The score is the sum of the file's repo-relative percentile\n * ranks (each in [0, 1)) over three dimensions: worst-function cognitive complexity, duplicated\n * lines (within-file and cross-file combined), and file NCSS. Ranking is relative to the scanned\n * project, so no absolute threshold is involved.\n */\ninterface RankedFile {\n  file: string;\n  score: number;\n  worstFunction?: WorstFunction;\n  /** Distinct lines covered by within-file duplicate blocks or cross-file duplicate occurrences. */\n  duplicatedLineCount: number;\n  /** duplicatedLineCount / code lines (0 when the file has no code). */\n  duplicatedLineRatio: number;\n  /** Other files sharing cross-file duplicate blocks; filled only for the reported top files. */\n  crossFilePartners: string[];\n  ncss: number;\n  codeLines: number;\n}\n\n/** Caps how many cross-file partners a ranked file lists so the report stays scannable. */\nconst maxCrossFilePartners = 3;\n\n// oxlint-disable-next-line unicorn/prefer-top-level-await -- CommonJS build output cannot preserve top-level await.\nvoid main().catch((error: unknown) => {\n  writeStderr(`Error: ${getErrorMessage(error)}\\n`);\n  process.exitCode = 1;\n});\n\nasync function main(): Promise<void> {\n  const program = new Command()\n    .name('code-gauge')\n    .description('Measure code metrics: rank refactoring candidates (the default command) or check thresholds.');\n\n  addSharedOptions(\n    program\n      .command('rank', { isDefault: true })\n      .description('Rank the files of a project by refactoring priority')\n      .argument('[target]', 'file or directory to measure', '.')\n  )\n    .option('--top <number>', 'number of top-ranked files to report (default: 10)', parsePositiveIntegerOption)\n    .option('--fail-on-error', 'exit with code 1 when files or directories cannot be scanned')\n    .action(runRankCommand);\n\n  const check = addSharedOptions(\n    program\n      .command('check')\n      .description(\n        'Report every exceeded threshold as a warning or an error (exit 1 on errors, 2 when files cannot be measured); with --base, only in what the change touches'\n      )\n      .argument('[target]', 'file or directory to check', '.')\n  ).option('--base <ref>', 'check only what the working tree changed since the merge-base of this git ref and HEAD');\n  for (const level of levels) {\n    for (const { key, defaultLimits } of thresholds) {\n      const defaultLimit = defaultLimits[level];\n      check.option(\n        `--${level}-${toKebabCase(key)} <number>`,\n        `${describeLimit(key, level)} (default ${Number.isFinite(defaultLimit) ? defaultLimit : 'off'}); \"off\" disables it`,\n        parseLimit\n      );\n    }\n  }\n  // Exit code 1 means error-level violations, so a rejected command line must not use it.\n  check.exitOverride((error) => process.exit(error.exitCode === 0 ? 0 : 2));\n  check.action(async (target: string, cliOptions: CheckCliOptions & Record<string, unknown>) => {\n    const readLimits = (level: Level): Limits =>\n      Object.fromEntries(\n        thresholds.flatMap(({ key }) => {\n          const limit = cliOptions[`${level}${key.charAt(0).toUpperCase()}${key.slice(1)}`];\n          return limit === undefined ? [] : [[key, limit as number]];\n        })\n      );\n    await runCheckCommand(target, cliOptions, { warning: readLimits('warning'), error: readLimits('error') });\n  });\n\n  await program.parseAsync();\n}\n\n/** Registers the options shared by the ranking and check commands. */\nfunction addSharedOptions(command: Command): Command {\n  return command\n    .option('--config <path>', `config file to use instead of the auto-detected ${configFileName}`)\n    .option(\n      '--duplication-min-tokens <number>',\n      'minimum normalized token count for a duplicate region (default 40)',\n      parsePositiveIntegerOption\n    )\n    .option(\n      '--duplication-max-gap-tokens <number>',\n      'maximum token gap merged into one gapped clone group; 0 disables merging (default 30)',\n      parseNonNegativeInteger\n    )\n    .option(\n      '--duplication-min-similarity-percent <number>',\n      'minimum similarity percent (1-100) for near-miss (Type-3) clone blocks; 100 reports exact matches only (default 70)',\n      parsePercentInteger\n    )\n    .option('--include-tests', 'include test files and test directories')\n    .option('--json', 'print JSON output');\n}\n\nfunction describeLimit(key: string, level: Level): string {\n  if (key === duplicationThreshold.key) {\n    return `code-line count from which a duplicated block is ${level === 'error' ? 'an error' : 'a warning'}`;\n  }\n  const fileThreshold = fileThresholds.find((threshold) => threshold.key === key);\n  const subject = fileThreshold\n    ? fileThreshold.label\n    : `${functionThresholds.find((threshold) => threshold.key === key)?.label} of a function`;\n  return `maximum ${subject} without ${level === 'error' ? 'an error' : 'a warning'}`;\n}\n\nfunction toKebabCase(key: string): string {\n  return key.replaceAll(/[A-Z]/gu, (letter) => `-${letter.toLowerCase()}`);\n}\n\nasync function runRankCommand(target: string, cliOptions: CliOptions): Promise<void> {\n  const resolvedTarget = resolveTarget(target);\n  const searchDirectory = await configSearchDirectory(resolvedTarget);\n  const config = await loadConfig(cliOptions.config, searchDirectory);\n  const options = resolveOptions(cliOptions, config);\n  const result = await scanTarget(resolvedTarget, {\n    ...options,\n    loadExclusion: (absolutePaths) => loadExclusion(searchDirectory, options.exclude, absolutePaths),\n  });\n  addCrossFileDuplication(result, options);\n  const rankedFiles = rankFiles(result, options.top);\n\n  if (options.json) {\n    printJson(result, rankedFiles, options);\n  } else {\n    printTextReport(resolvedTarget, result, rankedFiles, options);\n  }\n\n  if (result.fatalError || (options.failOnError && result.errors.length > 0)) {\n    process.exitCode = 1;\n  }\n}\n\nfunction rankFiles(result: ScanResult, top: number): RankedFile[] {\n  const candidates = result.files.map(({ file, metrics }) => {\n    const formattedFile = formatPath(file, result.displayRoot);\n    const duplicatedLines = collectDuplicatedLineNumbers(metrics, result.crossFileDuplication, formattedFile);\n    return {\n      file: formattedFile,\n      worstFunction: findWorstFunction(metrics.functions),\n      duplicatedLineCount: duplicatedLines.size,\n      duplicatedLineRatio: metrics.lines.code === 0 ? 0 : duplicatedLines.size / metrics.lines.code,\n      crossFilePartners: [] as string[],\n      ncss: metrics.ncssCount,\n      codeLines: metrics.lines.code,\n    };\n  });\n\n  const cognitivePercentile = makePercentile(candidates.map((c) => c.worstFunction?.cognitiveComplexity ?? 0));\n  const duplicationPercentile = makePercentile(candidates.map((c) => c.duplicatedLineCount));\n  const ncssPercentile = makePercentile(candidates.map((c) => c.ncss));\n\n  const ranked = candidates\n    .map((candidate) => ({\n      ...candidate,\n      score:\n        cognitivePercentile(candidate.worstFunction?.cognitiveComplexity ?? 0) +\n        duplicationPercentile(candidate.duplicatedLineCount) +\n        ncssPercentile(candidate.ncss),\n    }))\n    .toSorted(\n      (left, right) => right.score - left.score || right.ncss - left.ncss || left.file.localeCompare(right.file)\n    );\n  // Partner evidence is attached only to the files that will be reported: expanding partners for\n  // every scanned file first would retain TH(F^2) strings when one clone group spans F files, and\n  // rescanning all groups per file would be O(files x groups) on the post-scan ranking step.\n  attachCrossFilePartners(ranked.slice(0, top), result.crossFileDuplication);\n  return ranked;\n}\n\n/** One pass over the groups fills the reported files' partner lists (other files sharing a group). */\nfunction attachCrossFilePartners(\n  reportedFiles: RankedFile[],\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined\n): void {\n  if (!crossFileDuplication) {\n    return;\n  }\n  const partnersByFile = new Map(reportedFiles.map((ranked) => [ranked.file, new Set<string>()]));\n  for (const group of crossFileDuplication.groups) {\n    for (const file of group.files) {\n      const partners = partnersByFile.get(file);\n      if (!partners) {\n        continue;\n      }\n      for (const partner of group.files) {\n        if (partner !== file) {\n          partners.add(partner);\n        }\n      }\n    }\n  }\n  for (const ranked of reportedFiles) {\n    ranked.crossFilePartners = [...(partnersByFile.get(ranked.file) ?? [])].toSorted();\n  }\n}\n\n/**\n * Percentile rank within the scanned project: the fraction of files with a strictly smaller\n * value, in [0, 1). Relative ranking needs no absolute threshold, which sidesteps the metric\n * calibration problem entirely — the top of the list is worth refactoring first regardless of\n * where any cutoff would sit.\n */\nfunction makePercentile(values: number[]): (value: number) => number {\n  const sorted = values.toSorted((left, right) => left - right);\n  return (value: number) => {\n    let low = 0;\n    let high = sorted.length;\n    while (low < high) {\n      const middle = (low + high) >> 1;\n      if ((sorted[middle] as number) < value) {\n        low = middle + 1;\n      } else {\n        high = middle;\n      }\n    }\n    return sorted.length === 0 ? 0 : low / sorted.length;\n  };\n}\n\n/** The highest-cognitive-complexity function; NCSS breaks ties so the larger body is reported. */\nfunction findWorstFunction(functions: FunctionMetrics[]): WorstFunction | undefined {\n  let worst: FunctionMetrics | undefined;\n  for (const fn of functions) {\n    if (\n      !worst ||\n      fn.cognitiveComplexity > worst.cognitiveComplexity ||\n      (fn.cognitiveComplexity === worst.cognitiveComplexity && fn.ncss > worst.ncss)\n    ) {\n      worst = fn;\n    }\n  }\n  if (!worst) {\n    return undefined;\n  }\n  return {\n    name: qualifyFunctionName(worst),\n    startLine: worst.startLine,\n    endLine: worst.endLine,\n    cognitiveComplexity: worst.cognitiveComplexity,\n    ncss: worst.ncss,\n    nestingDepth: worst.nestingDepth,\n  };\n}\n\nfunction printJson(result: ScanResult, rankedFiles: RankedFile[], options: ResolvedOptions): void {\n  const reportedFiles = rankedFiles.slice(0, options.top);\n  writeStdout(\n    JSON.stringify(\n      {\n        summary: summarize(result.files),\n        totalRankedFiles: rankedFiles.length,\n        truncated: reportedFiles.length < rankedFiles.length,\n        files: reportedFiles,\n        errors: result.errors,\n        warnings: result.warnings,\n      },\n      undefined,\n      2\n    ) + '\\n'\n  );\n}\n\nfunction printTextReport(\n  target: string,\n  result: ScanResult,\n  rankedFiles: RankedFile[],\n  options: ResolvedOptions\n): void {\n  if (result.fatalError) {\n    writeStderr(`Error: ${result.fatalError}\\n`);\n    return;\n  }\n\n  const summary = summarize(result.files);\n  writeStdout(\n    `Measured ${summary.fileCount} files under ${target} (code LOC ${summary.linesOfCode}, NCSS ${summary.ncssCount}, functions ${summary.functionCount})\\n`\n  );\n\n  if (rankedFiles.length === 0) {\n    writeStdout('No measurable files found.\\n');\n  } else {\n    const reportedFiles = rankedFiles.slice(0, options.top);\n    const totalSuffix = rankedFiles.length > reportedFiles.length ? ` of ${rankedFiles.length}` : '';\n    writeStdout(`\\nRefactoring candidates (top ${reportedFiles.length}${totalSuffix}):\\n`);\n    for (const [index, ranked] of reportedFiles.entries()) {\n      writeStdout(`${index + 1}. ${formatRankedFile(ranked)}\\n`);\n    }\n  }\n\n  if (result.warnings.length > 0) {\n    writeStderr(`\\nDegraded ${result.warnings.length} files (measured, but excluded from cross-file matching):\\n`);\n    for (const warning of result.warnings.slice(0, 10)) {\n      writeStderr(`- ${warning}\\n`);\n    }\n    if (result.warnings.length > 10) {\n      writeStderr(`- ... ${result.warnings.length - 10} more\\n`);\n    }\n  }\n\n  if (result.errors.length > 0) {\n    writeStderr(`\\nSkipped ${result.errors.length} files or directories:\\n`);\n    for (const error of result.errors.slice(0, 10)) {\n      writeStderr(`- ${error}\\n`);\n    }\n    if (result.errors.length > 10) {\n      writeStderr(`- ... ${result.errors.length - 10} more\\n`);\n    }\n  }\n}\n\n/** One ranked file as a single line: the location, the evidence, and where the duplication points. */\nfunction formatRankedFile(ranked: RankedFile): string {\n  const reasons: string[] = [];\n  if (ranked.worstFunction) {\n    const fn = ranked.worstFunction;\n    reasons.push(\n      `worst function ${fn.name} (L${fn.startLine}-${fn.endLine}) cognitive ${fn.cognitiveComplexity}, NCSS ${fn.ncss}, nesting ${fn.nestingDepth}`\n    );\n  }\n  if (ranked.duplicatedLineCount > 0) {\n    const partnersSuffix =\n      ranked.crossFilePartners.length > 0\n        ? `, shared with ${ranked.crossFilePartners.slice(0, maxCrossFilePartners).join(', ')}${ranked.crossFilePartners.length > maxCrossFilePartners ? ', ...' : ''}`\n        : '';\n    reasons.push(\n      `duplicated lines ${ranked.duplicatedLineCount} (${Math.round(ranked.duplicatedLineRatio * 100)}%${partnersSuffix})`\n    );\n  }\n  reasons.push(`file NCSS ${ranked.ncss}`);\n  return `${ranked.file} (score ${ranked.score.toFixed(2)}): ${reasons.join('; ')}`;\n}\n\nfunction summarize(files: FileMetrics[]): {\n  fileCount: number;\n  functionCount: number;\n  linesOfCode: number;\n  maxCognitiveComplexity: number;\n  ncssCount: number;\n} {\n  let functionCount = 0;\n  let linesOfCode = 0;\n  let maxCognitiveComplexity = 0;\n  let ncssCount = 0;\n\n  for (const file of files) {\n    functionCount += file.metrics.functions.length;\n    linesOfCode += file.metrics.lines.code;\n    maxCognitiveComplexity = Math.max(maxCognitiveComplexity, file.metrics.maxCognitiveComplexity);\n    ncssCount += file.metrics.ncssCount;\n  }\n\n  return { fileCount: files.length, functionCount, linesOfCode, maxCognitiveComplexity, ncssCount };\n}\n\nfunction parseLimit(value: string): number {\n  if (value === 'off') {\n    return Infinity;\n  }\n  const parsed = value.trim() === '' ? Number.NaN : Number(value);\n  if (!Number.isFinite(parsed) || parsed < 0) {\n    throw new InvalidArgumentError('Expected a non-negative number or \"off\".');\n  }\n  return parsed;\n}\n\nfunction parsePercentInteger(value: string): number {\n  const parsed = parsePositiveIntegerOption(value);\n  if (parsed > 100) {\n    throw new InvalidArgumentError('Expected an integer between 1 and 100.');\n  }\n  return parsed;\n}\n\nfunction parseNonNegativeInteger(value: string): number {\n  if (!/^\\d+$/u.test(value)) {\n    throw new InvalidArgumentError('Expected a non-negative integer.');\n  }\n\n  const parsed = Number(value);\n  if (!Number.isSafeInteger(parsed) || parsed < 0) {\n    throw new InvalidArgumentError('Expected a non-negative integer.');\n  }\n  return parsed;\n}\n\nfunction parsePositiveIntegerOption(value: string): number {\n  const parsed = parsePositiveInteger(value);\n  if (parsed === undefined) {\n    throw new InvalidArgumentError('Expected a positive integer.');\n  }\n  return parsed;\n}\n"],"mappings":";wsBAkEK,EAAK,CAAC,CAAC,MAAO,GAAmB,CACpC,EAAY,UAAU,EAAgB,CAAK,EAAE,GAAG,EAChD,QAAQ,SAAW,CACrB,CAAC,EAED,eAAe,GAAsB,CACnC,IAAM,EAAU,IAAI,EAAQ,CAAC,CAC1B,KAAK,YAAY,CAAC,CAClB,YAAY,8FAA8F,EAE7G,EACE,EACG,QAAQ,OAAQ,CAAE,UAAW,EAAK,CAAC,CAAC,CACpC,YAAY,qDAAqD,CAAC,CAClE,SAAS,WAAY,+BAAgC,GAAG,CAC7D,CAAC,CACE,OAAO,iBAAkB,qDAAsD,CAA0B,CAAC,CAC1G,OAAO,kBAAmB,8DAA8D,CAAC,CACzF,OAAO,CAAc,EAExB,IAAM,EAAQ,EACZ,EACG,QAAQ,OAAO,CAAC,CAChB,YACC,4JACF,CAAC,CACA,SAAS,WAAY,6BAA8B,GAAG,CAC3D,CAAC,CAAC,OAAO,eAAgB,wFAAwF,EACjH,IAAK,IAAM,KAAS,EAClB,IAAK,GAAM,CAAE,MAAK,mBAAmB,EAAY,CAC/C,IAAM,EAAe,EAAc,GACnC,EAAM,OACJ,KAAK,EAAM,GAAG,EAAY,CAAG,EAAE,WAC/B,GAAG,EAAc,EAAK,CAAK,EAAE,YAAY,OAAO,SAAS,CAAY,EAAI,EAAe,MAAM,sBAC9F,CACF,CACF,CAGF,EAAM,aAAc,GAAU,QAAQ,KAAK,EAAM,WAAa,EAAI,EAAI,CAAC,CAAC,EACxE,EAAM,OAAO,MAAO,EAAgB,IAA0D,CAC5F,IAAM,EAAc,GAClB,OAAO,YACL,EAAW,SAAS,CAAE,SAAU,CAC9B,IAAM,EAAQ,EAAW,GAAG,IAAQ,EAAI,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,EAAI,MAAM,CAAC,KAC7E,OAAO,IAAU,IAAA,GAAY,CAAC,EAAI,CAAC,CAAC,EAAK,CAAe,CAAC,CAC3D,CAAC,CACH,EACF,MAAM,EAAgB,EAAQ,EAAY,CAAE,QAAS,EAAW,SAAS,EAAG,MAAO,EAAW,OAAO,CAAE,CAAC,CAC1G,CAAC,EAED,MAAM,EAAQ,WAAW,CAC3B,CAGA,SAAS,EAAiB,EAA2B,CACnD,OAAO,EACJ,OAAO,kBAAmB,mDAAmD,GAAgB,CAAC,CAC9F,OACC,oCACA,qEACA,CACF,CAAC,CACA,OACC,wCACA,wFACA,CACF,CAAC,CACA,OACC,gDACA,sHACA,CACF,CAAC,CACA,OAAO,kBAAmB,yCAAyC,CAAC,CACpE,OAAO,SAAU,mBAAmB,CACzC,CAEA,SAAS,EAAc,EAAa,EAAsB,CACxD,GAAI,IAAQ,EAAqB,IAC/B,MAAO,oDAAoD,IAAU,QAAU,WAAa,cAE9F,IAAM,EAAgB,EAAe,KAAM,GAAc,EAAU,MAAQ,CAAG,EAI9E,MAAO,WAHS,EACZ,EAAc,MACd,GAAG,EAAmB,KAAM,GAAc,EAAU,MAAQ,CAAG,CAAC,EAAE,MAAM,gBAClD,WAAW,IAAU,QAAU,WAAa,aACxE,CAEA,SAAS,EAAY,EAAqB,CACxC,OAAO,EAAI,WAAW,UAAY,GAAW,IAAI,EAAO,YAAY,GAAG,CACzE,CAEA,eAAe,EAAe,EAAgB,EAAuC,CACnF,IAAM,EAAiB,EAAc,CAAM,EACrC,EAAkB,MAAM,EAAsB,CAAc,EAC5D,EAAS,MAAM,EAAW,EAAW,OAAQ,CAAe,EAC5D,EAAU,EAAe,EAAY,CAAM,EAC3C,EAAS,MAAM,EAAW,EAAgB,CAC9C,GAAG,EACH,cAAgB,GAAkB,EAAc,EAAiB,EAAQ,QAAS,CAAa,CACjG,CAAC,EACD,EAAwB,EAAQ,CAAO,EACvC,IAAM,EAAc,EAAU,EAAQ,EAAQ,GAAG,EAE7C,EAAQ,KACV,EAAU,EAAQ,EAAa,CAAO,EAEtC,EAAgB,EAAgB,EAAQ,EAAa,CAAO,GAG1D,EAAO,YAAe,EAAQ,aAAe,EAAO,OAAO,OAAS,KACtE,QAAQ,SAAW,EAEvB,CAEA,SAAS,EAAU,EAAoB,EAA2B,CAChE,IAAM,EAAa,EAAO,MAAM,KAAK,CAAE,OAAM,aAAc,CACzD,IAAM,EAAgB,EAAW,EAAM,EAAO,WAAW,EACnD,EAAkB,EAA6B,EAAS,EAAO,qBAAsB,CAAa,EACxG,MAAO,CACL,KAAM,EACN,cAAe,EAAkB,EAAQ,SAAS,EAClD,oBAAqB,EAAgB,KACrC,oBAAqB,EAAQ,MAAM,OAAS,EAAI,EAAI,EAAgB,KAAO,EAAQ,MAAM,KACzF,kBAAmB,CAAC,EACpB,KAAM,EAAQ,UACd,UAAW,EAAQ,MAAM,IAC3B,CACF,CAAC,EAEK,EAAsB,EAAe,EAAW,IAAK,GAAM,EAAE,eAAe,qBAAuB,CAAC,CAAC,EACrG,EAAwB,EAAe,EAAW,IAAK,GAAM,EAAE,mBAAmB,CAAC,EACnF,EAAiB,EAAe,EAAW,IAAK,GAAM,EAAE,IAAI,CAAC,EAE7D,EAAS,EACZ,IAAK,IAAe,CACnB,GAAG,EACH,MACE,EAAoB,EAAU,eAAe,qBAAuB,CAAC,EACrE,EAAsB,EAAU,mBAAmB,EACnD,EAAe,EAAU,IAAI,CACjC,EAAE,CAAC,CACF,UACE,EAAM,IAAU,EAAM,MAAQ,EAAK,OAAS,EAAM,KAAO,EAAK,MAAQ,EAAK,KAAK,cAAc,EAAM,IAAI,CAC3G,EAKF,OADA,EAAwB,EAAO,MAAM,EAAG,CAAG,EAAG,EAAO,oBAAoB,EAClE,CACT,CAGA,SAAS,EACP,EACA,EACM,CACN,GAAI,CAAC,EACH,OAEF,IAAM,EAAiB,IAAI,IAAI,EAAc,IAAK,GAAW,CAAC,EAAO,qBAAM,IAAI,GAAa,CAAC,CAAC,EAC9F,IAAK,IAAM,KAAS,EAAqB,OACvC,IAAK,IAAM,KAAQ,EAAM,MAAO,CAC9B,IAAM,EAAW,EAAe,IAAI,CAAI,EACnC,KAGL,IAAK,IAAM,KAAW,EAAM,MACtB,IAAY,GACd,EAAS,IAAI,CAAO,CAG1B,CAEF,IAAK,IAAM,KAAU,EACnB,EAAO,kBAAoB,CAAC,GAAI,EAAe,IAAI,EAAO,IAAI,GAAK,CAAC,CAAE,CAAC,CAAC,SAAS,CAErF,CAQA,SAAS,EAAe,EAA6C,CACnE,IAAM,EAAS,EAAO,UAAU,EAAM,IAAU,EAAO,CAAK,EAC5D,MAAQ,IAAkB,CACxB,IAAI,EAAM,EACN,EAAO,EAAO,OAClB,KAAO,EAAM,GAAM,CACjB,IAAM,EAAU,EAAM,GAAS,EAC1B,EAAO,GAAqB,EAC/B,EAAM,EAAS,EAEf,EAAO,CAEX,CACA,OAAO,EAAO,SAAW,EAAI,EAAI,EAAM,EAAO,MAChD,CACF,CAGA,SAAS,EAAkB,EAAyD,CAClF,IAAI,EACJ,IAAK,IAAM,KAAM,GAEb,CAAC,GACD,EAAG,oBAAsB,EAAM,qBAC9B,EAAG,sBAAwB,EAAM,qBAAuB,EAAG,KAAO,EAAM,QAEzE,EAAQ,GAGP,KAGL,MAAO,CACL,KAAM,EAAoB,CAAK,EAC/B,UAAW,EAAM,UACjB,QAAS,EAAM,QACf,oBAAqB,EAAM,oBAC3B,KAAM,EAAM,KACZ,aAAc,EAAM,YACtB,CACF,CAEA,SAAS,EAAU,EAAoB,EAA2B,EAAgC,CAChG,IAAM,EAAgB,EAAY,MAAM,EAAG,EAAQ,GAAG,EACtD,EACE,KAAK,UACH,CACE,QAAS,EAAU,EAAO,KAAK,EAC/B,iBAAkB,EAAY,OAC9B,UAAW,EAAc,OAAS,EAAY,OAC9C,MAAO,EACP,OAAQ,EAAO,OACf,SAAU,EAAO,QACnB,EACA,IAAA,GACA,CACF,EAAI;CACN,CACF,CAEA,SAAS,EACP,EACA,EACA,EACA,EACM,CACN,GAAI,EAAO,WAAY,CACrB,EAAY,UAAU,EAAO,WAAW,GAAG,EAC3C,MACF,CAEA,IAAM,EAAU,EAAU,EAAO,KAAK,EAKtC,GAJA,EACE,YAAY,EAAQ,UAAU,eAAe,EAAO,aAAa,EAAQ,YAAY,SAAS,EAAQ,UAAU,cAAc,EAAQ,cAAc,IACtJ,EAEI,EAAY,SAAW,EACzB,EAAY;CAA8B,MACrC,CACL,IAAM,EAAgB,EAAY,MAAM,EAAG,EAAQ,GAAG,EAChD,EAAc,EAAY,OAAS,EAAc,OAAS,OAAO,EAAY,SAAW,GAC9F,EAAY,iCAAiC,EAAc,SAAS,EAAY,KAAK,EACrF,IAAK,GAAM,CAAC,EAAO,KAAW,EAAc,QAAQ,EAClD,EAAY,GAAG,EAAQ,EAAE,IAAI,EAAiB,CAAM,EAAE,GAAG,CAE7D,CAEA,GAAI,EAAO,SAAS,OAAS,EAAG,CAC9B,EAAY,cAAc,EAAO,SAAS,OAAO,4DAA4D,EAC7G,IAAK,IAAM,KAAW,EAAO,SAAS,MAAM,EAAG,EAAE,EAC/C,EAAY,KAAK,EAAQ,GAAG,EAE1B,EAAO,SAAS,OAAS,IAC3B,EAAY,SAAS,EAAO,SAAS,OAAS,GAAG,QAAQ,CAE7D,CAEA,GAAI,EAAO,OAAO,OAAS,EAAG,CAC5B,EAAY,aAAa,EAAO,OAAO,OAAO,yBAAyB,EACvE,IAAK,IAAM,KAAS,EAAO,OAAO,MAAM,EAAG,EAAE,EAC3C,EAAY,KAAK,EAAM,GAAG,EAExB,EAAO,OAAO,OAAS,IACzB,EAAY,SAAS,EAAO,OAAO,OAAS,GAAG,QAAQ,CAE3D,CACF,CAGA,SAAS,EAAiB,EAA4B,CACpD,IAAM,EAAoB,CAAC,EAC3B,GAAI,EAAO,cAAe,CACxB,IAAM,EAAK,EAAO,cAClB,EAAQ,KACN,kBAAkB,EAAG,KAAK,KAAK,EAAG,UAAU,GAAG,EAAG,QAAQ,cAAc,EAAG,oBAAoB,SAAS,EAAG,KAAK,YAAY,EAAG,cACjI,CACF,CACA,GAAI,EAAO,oBAAsB,EAAG,CAClC,IAAM,EACJ,EAAO,kBAAkB,OAAS,EAC9B,iBAAiB,EAAO,kBAAkB,MAAM,EAAG,CAAoB,CAAC,CAAC,KAAK,IAAI,IAAI,EAAO,kBAAkB,OAAS,EAAuB,QAAU,KACzJ,GACN,EAAQ,KACN,oBAAoB,EAAO,oBAAoB,IAAI,KAAK,MAAM,EAAO,oBAAsB,GAAG,EAAE,GAAG,EAAe,EACpH,CACF,CAEA,OADA,EAAQ,KAAK,aAAa,EAAO,MAAM,EAChC,GAAG,EAAO,KAAK,UAAU,EAAO,MAAM,QAAQ,CAAC,EAAE,KAAK,EAAQ,KAAK,IAAI,GAChF,CAEA,SAAS,EAAU,EAMjB,CACA,IAAI,EAAgB,EAChB,EAAc,EACd,EAAyB,EACzB,EAAY,EAEhB,IAAK,IAAM,KAAQ,EACjB,GAAiB,EAAK,QAAQ,UAAU,OACxC,GAAe,EAAK,QAAQ,MAAM,KAClC,EAAyB,KAAK,IAAI,EAAwB,EAAK,QAAQ,sBAAsB,EAC7F,GAAa,EAAK,QAAQ,UAG5B,MAAO,CAAE,UAAW,EAAM,OAAQ,gBAAe,cAAa,yBAAwB,WAAU,CAClG,CAEA,SAAS,EAAW,EAAuB,CACzC,GAAI,IAAU,MACZ,MAAO,KAET,IAAM,EAAS,EAAM,KAAK,IAAM,GAAK,IAAa,OAAO,CAAK,EAC9D,GAAI,CAAC,OAAO,SAAS,CAAM,GAAK,EAAS,EACvC,MAAM,IAAI,EAAqB,0CAA0C,EAE3E,OAAO,CACT,CAEA,SAAS,EAAoB,EAAuB,CAClD,IAAM,EAAS,EAA2B,CAAK,EAC/C,GAAI,EAAS,IACX,MAAM,IAAI,EAAqB,wCAAwC,EAEzE,OAAO,CACT,CAEA,SAAS,EAAwB,EAAuB,CACtD,GAAI,CAAC,SAAS,KAAK,CAAK,EACtB,MAAM,IAAI,EAAqB,kCAAkC,EAGnE,IAAM,EAAS,OAAO,CAAK,EAC3B,GAAI,CAAC,OAAO,cAAc,CAAM,GAAK,EAAS,EAC5C,MAAM,IAAI,EAAqB,kCAAkC,EAEnE,OAAO,CACT,CAEA,SAAS,EAA2B,EAAuB,CACzD,IAAM,EAAS,EAAqB,CAAK,EACzC,GAAI,IAAW,IAAA,GACb,MAAM,IAAI,EAAqB,8BAA8B,EAE/D,OAAO,CACT"}
+{"version":3,"file":"cli.js","names":["main","writeStderr","getErrorMessage","error","program","Command","addSharedOptions","parsePositiveIntegerOption","runRankCommand","check","level","levels","thresholds","defaultLimit","defaultLimits","toKebabCase","key","describeLimit","parseLimit","readLimits","limit","cliOptions","runCheckCommand","target","command","configFileName","parseNonNegativeInteger","parsePercentInteger","duplicationThreshold","fileThreshold","fileThresholds","threshold","functionThresholds","letter","resolvedTarget","resolveTarget","searchDirectory","configSearchDirectory","config","loadConfig","options","resolveOptions","result","scanTarget","loadExclusion","absolutePaths","addCrossFileDuplication","rankedFiles","rankFiles","printJson","printTextReport","candidates","formattedFile","formatPath","file","duplicatedLines","collectDuplicatedLineNumbers","metrics","findWorstFunction","cognitivePercentile","makePercentile","c","duplicationPercentile","ncssPercentile","ranked","candidate","right","left","attachCrossFilePartners","top","crossFileDuplication","partnersByFile","reportedFiles","group","partners","partner","sorted","values","low","high","middle","value","worst","fn","functions","qualifyFunctionName","writeStdout","summarize","summary","totalSuffix","index","formatRankedFile","warning","reasons","partnersSuffix","functionCount","linesOfCode","maxCognitiveComplexity","ncssCount","files","parsed","InvalidArgumentError","parsePositiveInteger"],"sources":["../src/cli.ts"],"sourcesContent":["#!/usr/bin/env node\n\nimport { Command, InvalidArgumentError } from 'commander';\nimport { getErrorMessage, parsePositiveInteger } from '@willbooster/shared-lib';\nimport { type CliOptions, configFileName, loadConfig, type ResolvedOptions, resolveOptions } from './cliConfig.js';\nimport type { CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport { runCheckCommand, type CheckCliOptions } from './checkCommand.js';\nimport { loadExclusion } from './exclusion.js';\nimport {\n  addCrossFileDuplication,\n  collectDuplicatedLineNumbers,\n  configSearchDirectory,\n  formatPath,\n  resolveTarget,\n  scanTarget,\n  writeStderr,\n  writeStdout,\n  type FileMetrics,\n  type ScanResult,\n} from './scan.js';\nimport {\n  duplicationThreshold,\n  fileThresholds,\n  functionThresholds,\n  levels,\n  thresholds,\n  type Level,\n  type Limits,\n} from './thresholds.js';\nimport { qualifyFunctionName } from './thresholdCheck.js';\nimport type { FunctionMetrics } from './types.js';\n\n/** The worst (highest-cognitive-complexity) function of a file, reported as the ranking evidence. */\ninterface WorstFunction {\n  name: string;\n  startLine: number;\n  endLine: number;\n  cognitiveComplexity: number;\n  ncss: number;\n  nestingDepth: number;\n}\n\n/**\n * One ranked refactoring candidate. The score is the sum of the file's repo-relative percentile\n * ranks (each in [0, 1)) over three dimensions: worst-function cognitive complexity, duplicated\n * lines (within-file and cross-file combined), and file NCSS. Ranking is relative to the scanned\n * project, so no absolute threshold is involved.\n */\ninterface RankedFile {\n  file: string;\n  score: number;\n  worstFunction?: WorstFunction;\n  /** Distinct lines covered by within-file duplicate blocks or cross-file duplicate occurrences. */\n  duplicatedLineCount: number;\n  /** duplicatedLineCount / code lines (0 when the file has no code). */\n  duplicatedLineRatio: number;\n  /** Other files sharing cross-file duplicate blocks; filled only for the reported top files. */\n  crossFilePartners: string[];\n  ncss: number;\n  codeLines: number;\n}\n\n/** Caps how many cross-file partners a ranked file lists so the report stays scannable. */\nconst maxCrossFilePartners = 3;\n\n// oxlint-disable-next-line unicorn/prefer-top-level-await -- CommonJS build output cannot preserve top-level await.\nvoid main().catch((error: unknown) => {\n  writeStderr(`Error: ${getErrorMessage(error)}\\n`);\n  process.exitCode = 1;\n});\n\nasync function main(): Promise<void> {\n  const program = new Command()\n    .name('code-gauge')\n    .description('Measure code metrics: rank refactoring candidates (the default command) or check thresholds.');\n\n  addSharedOptions(\n    program\n      .command('rank', { isDefault: true })\n      .description('Rank the files of a project by refactoring priority')\n      .argument('[target]', 'file or directory to measure', '.')\n  )\n    .option('--top <number>', 'number of top-ranked files to report (default: 10)', parsePositiveIntegerOption)\n    .option('--fail-on-error', 'exit with code 1 when files or directories cannot be scanned')\n    .action(runRankCommand);\n\n  const check = addSharedOptions(\n    program\n      .command('check')\n      .description(\n        'Report every exceeded threshold as a warning or an error (exit 1 on errors, 2 when files cannot be measured); with --base, only in what the change touches'\n      )\n      .argument('[target]', 'file or directory to check', '.')\n  ).option('--base <ref>', 'check only what the working tree changed since the merge-base of this git ref and HEAD');\n  for (const level of levels) {\n    for (const { key, defaultLimits } of thresholds) {\n      const defaultLimit = defaultLimits[level];\n      check.option(\n        `--${level}-${toKebabCase(key)} <number>`,\n        `${describeLimit(key, level)} (default ${Number.isFinite(defaultLimit) ? defaultLimit : 'off'}); \"off\" disables it`,\n        parseLimit\n      );\n    }\n  }\n  // Exit code 1 means error-level violations, so a rejected command line must not use it.\n  check.exitOverride((error) => process.exit(error.exitCode === 0 ? 0 : 2));\n  check.action(async (target: string, cliOptions: CheckCliOptions & Record<string, unknown>) => {\n    const readLimits = (level: Level): Limits =>\n      Object.fromEntries(\n        thresholds.flatMap(({ key }) => {\n          const limit = cliOptions[`${level}${key.charAt(0).toUpperCase()}${key.slice(1)}`];\n          return limit === undefined ? [] : [[key, limit as number]];\n        })\n      );\n    await runCheckCommand(target, cliOptions, { warning: readLimits('warning'), error: readLimits('error') });\n  });\n\n  await program.parseAsync();\n}\n\n/** Registers the options shared by the ranking and check commands. */\nfunction addSharedOptions(command: Command): Command {\n  return command\n    .option('--config <path>', `config file to use instead of the auto-detected ${configFileName}`)\n    .option(\n      '--duplication-min-tokens <number>',\n      'minimum normalized token count for a duplicate region (default 40)',\n      parsePositiveIntegerOption\n    )\n    .option(\n      '--duplication-max-gap-tokens <number>',\n      'maximum token gap merged into one gapped clone group; 0 disables merging (default 30)',\n      parseNonNegativeInteger\n    )\n    .option(\n      '--duplication-min-similarity-percent <number>',\n      'minimum similarity percent (1-100) for near-miss (Type-3) clone blocks; 100 reports exact matches only (default 70)',\n      parsePercentInteger\n    )\n    .option('--include-tests', 'include test files and test directories')\n    .option('--json', 'print JSON output');\n}\n\nfunction describeLimit(key: string, level: Level): string {\n  if (key === duplicationThreshold.key) {\n    return `code-line count from which a duplicated block is ${level === 'error' ? 'an error' : 'a warning'}`;\n  }\n  const fileThreshold = fileThresholds.find((threshold) => threshold.key === key);\n  const subject = fileThreshold\n    ? fileThreshold.label\n    : `${functionThresholds.find((threshold) => threshold.key === key)?.label} of a function`;\n  return `maximum ${subject} without ${level === 'error' ? 'an error' : 'a warning'}`;\n}\n\nfunction toKebabCase(key: string): string {\n  return key.replaceAll(/[A-Z]/gu, (letter) => `-${letter.toLowerCase()}`);\n}\n\nasync function runRankCommand(target: string, cliOptions: CliOptions): Promise<void> {\n  const resolvedTarget = resolveTarget(target);\n  const searchDirectory = await configSearchDirectory(resolvedTarget);\n  const config = await loadConfig(cliOptions.config, searchDirectory);\n  const options = resolveOptions(cliOptions, config);\n  const result = await scanTarget(resolvedTarget, {\n    ...options,\n    loadExclusion: (absolutePaths) => loadExclusion(searchDirectory, options.exclude, absolutePaths),\n  });\n  addCrossFileDuplication(result, options);\n  const rankedFiles = rankFiles(result, options.top);\n\n  if (options.json) {\n    printJson(result, rankedFiles, options);\n  } else {\n    printTextReport(resolvedTarget, result, rankedFiles, options);\n  }\n\n  if (result.fatalError || (options.failOnError && result.errors.length > 0)) {\n    process.exitCode = 1;\n  }\n}\n\nfunction rankFiles(result: ScanResult, top: number): RankedFile[] {\n  const candidates = result.files.map(({ file, metrics }) => {\n    const formattedFile = formatPath(file, result.displayRoot);\n    const duplicatedLines = collectDuplicatedLineNumbers(metrics, result.crossFileDuplication, formattedFile);\n    return {\n      file: formattedFile,\n      worstFunction: findWorstFunction(metrics.functions),\n      duplicatedLineCount: duplicatedLines.size,\n      duplicatedLineRatio: metrics.lines.code === 0 ? 0 : duplicatedLines.size / metrics.lines.code,\n      crossFilePartners: [] as string[],\n      ncss: metrics.ncssCount,\n      codeLines: metrics.lines.code,\n    };\n  });\n\n  const cognitivePercentile = makePercentile(candidates.map((c) => c.worstFunction?.cognitiveComplexity ?? 0));\n  const duplicationPercentile = makePercentile(candidates.map((c) => c.duplicatedLineCount));\n  const ncssPercentile = makePercentile(candidates.map((c) => c.ncss));\n\n  const ranked = candidates\n    .map((candidate) => ({\n      ...candidate,\n      score:\n        cognitivePercentile(candidate.worstFunction?.cognitiveComplexity ?? 0) +\n        duplicationPercentile(candidate.duplicatedLineCount) +\n        ncssPercentile(candidate.ncss),\n    }))\n    .toSorted(\n      (left, right) => right.score - left.score || right.ncss - left.ncss || left.file.localeCompare(right.file)\n    );\n  // Partner evidence is attached only to the files that will be reported: expanding partners for\n  // every scanned file first would retain TH(F^2) strings when one clone group spans F files, and\n  // rescanning all groups per file would be O(files x groups) on the post-scan ranking step.\n  attachCrossFilePartners(ranked.slice(0, top), result.crossFileDuplication);\n  return ranked;\n}\n\n/** One pass over the groups fills the reported files' partner lists (other files sharing a group). */\nfunction attachCrossFilePartners(\n  reportedFiles: RankedFile[],\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined\n): void {\n  if (!crossFileDuplication) {\n    return;\n  }\n  const partnersByFile = new Map(reportedFiles.map((ranked) => [ranked.file, new Set<string>()]));\n  for (const group of crossFileDuplication.groups) {\n    for (const file of group.files) {\n      const partners = partnersByFile.get(file);\n      if (!partners) {\n        continue;\n      }\n      for (const partner of group.files) {\n        if (partner !== file) {\n          partners.add(partner);\n        }\n      }\n    }\n  }\n  for (const ranked of reportedFiles) {\n    ranked.crossFilePartners = [...(partnersByFile.get(ranked.file) ?? [])].toSorted();\n  }\n}\n\n/**\n * Percentile rank within the scanned project: the fraction of files with a strictly smaller\n * value, in [0, 1). Relative ranking needs no absolute threshold, which sidesteps the metric\n * calibration problem entirely — the top of the list is worth refactoring first regardless of\n * where any cutoff would sit.\n */\nfunction makePercentile(values: number[]): (value: number) => number {\n  const sorted = values.toSorted((left, right) => left - right);\n  return (value: number) => {\n    let low = 0;\n    let high = sorted.length;\n    while (low < high) {\n      const middle = (low + high) >> 1;\n      if ((sorted[middle] as number) < value) {\n        low = middle + 1;\n      } else {\n        high = middle;\n      }\n    }\n    return sorted.length === 0 ? 0 : low / sorted.length;\n  };\n}\n\n/** The highest-cognitive-complexity function; NCSS breaks ties so the larger body is reported. */\nfunction findWorstFunction(functions: FunctionMetrics[]): WorstFunction | undefined {\n  let worst: FunctionMetrics | undefined;\n  for (const fn of functions) {\n    if (\n      !worst ||\n      fn.cognitiveComplexity > worst.cognitiveComplexity ||\n      (fn.cognitiveComplexity === worst.cognitiveComplexity && fn.ncss > worst.ncss)\n    ) {\n      worst = fn;\n    }\n  }\n  if (!worst) {\n    return undefined;\n  }\n  return {\n    name: qualifyFunctionName(worst),\n    startLine: worst.startLine,\n    endLine: worst.endLine,\n    cognitiveComplexity: worst.cognitiveComplexity,\n    ncss: worst.ncss,\n    nestingDepth: worst.nestingDepth,\n  };\n}\n\nfunction printJson(result: ScanResult, rankedFiles: RankedFile[], options: ResolvedOptions): void {\n  const reportedFiles = rankedFiles.slice(0, options.top);\n  writeStdout(\n    JSON.stringify(\n      {\n        summary: summarize(result.files),\n        totalRankedFiles: rankedFiles.length,\n        truncated: reportedFiles.length < rankedFiles.length,\n        files: reportedFiles,\n        errors: result.errors,\n        warnings: result.warnings,\n      },\n      undefined,\n      2\n    ) + '\\n'\n  );\n}\n\nfunction printTextReport(\n  target: string,\n  result: ScanResult,\n  rankedFiles: RankedFile[],\n  options: ResolvedOptions\n): void {\n  if (result.fatalError) {\n    writeStderr(`Error: ${result.fatalError}\\n`);\n    return;\n  }\n\n  const summary = summarize(result.files);\n  writeStdout(\n    `Measured ${summary.fileCount} files under ${target} (code LOC ${summary.linesOfCode}, NCSS ${summary.ncssCount}, functions ${summary.functionCount})\\n`\n  );\n\n  if (rankedFiles.length === 0) {\n    writeStdout('No measurable files found.\\n');\n  } else {\n    const reportedFiles = rankedFiles.slice(0, options.top);\n    const totalSuffix = rankedFiles.length > reportedFiles.length ? ` of ${rankedFiles.length}` : '';\n    writeStdout(`\\nRefactoring candidates (top ${reportedFiles.length}${totalSuffix}):\\n`);\n    for (const [index, ranked] of reportedFiles.entries()) {\n      writeStdout(`${index + 1}. ${formatRankedFile(ranked)}\\n`);\n    }\n  }\n\n  if (result.warnings.length > 0) {\n    writeStderr(`\\nDegraded ${result.warnings.length} files (measured, but excluded from cross-file matching):\\n`);\n    for (const warning of result.warnings.slice(0, 10)) {\n      writeStderr(`- ${warning}\\n`);\n    }\n    if (result.warnings.length > 10) {\n      writeStderr(`- ... ${result.warnings.length - 10} more\\n`);\n    }\n  }\n\n  if (result.errors.length > 0) {\n    writeStderr(`\\nSkipped ${result.errors.length} files or directories:\\n`);\n    for (const error of result.errors.slice(0, 10)) {\n      writeStderr(`- ${error}\\n`);\n    }\n    if (result.errors.length > 10) {\n      writeStderr(`- ... ${result.errors.length - 10} more\\n`);\n    }\n  }\n}\n\n/** One ranked file as a single line: the location, the evidence, and where the duplication points. */\nfunction formatRankedFile(ranked: RankedFile): string {\n  const reasons: string[] = [];\n  if (ranked.worstFunction) {\n    const fn = ranked.worstFunction;\n    reasons.push(\n      `worst function ${fn.name} (L${fn.startLine}-${fn.endLine}) cognitive ${fn.cognitiveComplexity}, NCSS ${fn.ncss}, nesting ${fn.nestingDepth}`\n    );\n  }\n  if (ranked.duplicatedLineCount > 0) {\n    const partnersSuffix =\n      ranked.crossFilePartners.length > 0\n        ? `, shared with ${ranked.crossFilePartners.slice(0, maxCrossFilePartners).join(', ')}${ranked.crossFilePartners.length > maxCrossFilePartners ? ', ...' : ''}`\n        : '';\n    reasons.push(\n      `duplicated lines ${ranked.duplicatedLineCount} (${Math.round(ranked.duplicatedLineRatio * 100)}%${partnersSuffix})`\n    );\n  }\n  reasons.push(`file NCSS ${ranked.ncss}`);\n  return `${ranked.file} (score ${ranked.score.toFixed(2)}): ${reasons.join('; ')}`;\n}\n\nfunction summarize(files: FileMetrics[]): {\n  fileCount: number;\n  functionCount: number;\n  linesOfCode: number;\n  maxCognitiveComplexity: number;\n  ncssCount: number;\n} {\n  let functionCount = 0;\n  let linesOfCode = 0;\n  let maxCognitiveComplexity = 0;\n  let ncssCount = 0;\n\n  for (const file of files) {\n    functionCount += file.metrics.functions.length;\n    linesOfCode += file.metrics.lines.code;\n    maxCognitiveComplexity = Math.max(maxCognitiveComplexity, file.metrics.maxCognitiveComplexity);\n    ncssCount += file.metrics.ncssCount;\n  }\n\n  return { fileCount: files.length, functionCount, linesOfCode, maxCognitiveComplexity, ncssCount };\n}\n\nfunction parseLimit(value: string): number {\n  if (value === 'off') {\n    return Infinity;\n  }\n  const parsed = value.trim() === '' ? Number.NaN : Number(value);\n  if (!Number.isFinite(parsed) || parsed < 0) {\n    throw new InvalidArgumentError('Expected a non-negative number or \"off\".');\n  }\n  return parsed;\n}\n\nfunction parsePercentInteger(value: string): number {\n  const parsed = parsePositiveIntegerOption(value);\n  if (parsed > 100) {\n    throw new InvalidArgumentError('Expected an integer between 1 and 100.');\n  }\n  return parsed;\n}\n\nfunction parseNonNegativeInteger(value: string): number {\n  if (!/^\\d+$/u.test(value)) {\n    throw new InvalidArgumentError('Expected a non-negative integer.');\n  }\n\n  const parsed = Number(value);\n  if (!Number.isSafeInteger(parsed) || parsed < 0) {\n    throw new InvalidArgumentError('Expected a non-negative integer.');\n  }\n  return parsed;\n}\n\nfunction parsePositiveIntegerOption(value: string): number {\n  const parsed = parsePositiveInteger(value);\n  if (parsed === undefined) {\n    throw new InvalidArgumentError('Expected a positive integer.');\n  }\n  return parsed;\n}\n"],"mappings":";wsBAkEKA,EAAK,CAAC,CAAC,MAAO,GAAmB,CACpCC,EAAY,UAAUC,EAAgBC,CAAK,EAAE,GAAG,EAChD,QAAQ,SAAW,CACrB,CAAC,EAED,eAAeH,GAAsB,CACnC,IAAMI,EAAU,IAAIC,EAAQ,CAAC,CAC1B,KAAK,YAAY,CAAC,CAClB,YAAY,8FAA8F,EAE7GC,EACEF,EACG,QAAQ,OAAQ,CAAE,UAAW,EAAK,CAAC,CAAC,CACpC,YAAY,qDAAqD,CAAC,CAClE,SAAS,WAAY,+BAAgC,GAAG,CAC7D,CAAC,CACE,OAAO,iBAAkB,qDAAsDG,CAA0B,CAAC,CAC1G,OAAO,kBAAmB,8DAA8D,CAAC,CACzF,OAAOC,CAAc,EAExB,IAAMC,EAAQH,EACZF,EACG,QAAQ,OAAO,CAAC,CAChB,YACC,4JACF,CAAC,CACA,SAAS,WAAY,6BAA8B,GAAG,CAC3D,CAAC,CAAC,OAAO,eAAgB,wFAAwF,EACjH,IAAK,IAAMM,KAASC,EAClB,IAAK,GAAM,CAAE,MAAK,mBAAmBC,EAAY,CAC/C,IAAMC,EAAeC,EAAcJ,GACnCD,EAAM,OACJ,KAAKC,EAAM,GAAGK,EAAYC,CAAG,EAAE,WAC/B,GAAGC,EAAcD,EAAKN,CAAK,EAAE,YAAY,OAAO,SAASG,CAAY,EAAIA,EAAe,MAAM,sBAC9FK,CACF,CACF,CAGFT,EAAM,aAAc,GAAU,QAAQ,KAAKN,EAAM,WAAa,EAAI,EAAI,CAAC,CAAC,EACxEM,EAAM,OAAO,MAAO,EAAgB,IAA0D,CAC5F,IAAMU,EAAc,GAClB,OAAO,YACLP,EAAW,SAAS,CAAE,SAAU,CAC9B,IAAMQ,EAAQC,EAAW,GAAGX,IAAQM,EAAI,OAAO,CAAC,CAAC,CAAC,YAAY,IAAIA,EAAI,MAAM,CAAC,KAC7E,OAAOI,IAAU,IAAA,GAAY,CAAC,EAAI,CAAC,CAACJ,EAAKI,CAAe,CAAC,CAC3D,CAAC,CACH,EACF,MAAME,EAAgBC,EAAQF,EAAY,CAAE,QAASF,EAAW,SAAS,EAAG,MAAOA,EAAW,OAAO,CAAE,CAAC,CAC1G,CAAC,EAED,MAAMf,EAAQ,WAAW,CAC3B,CAGA,SAASE,EAAiB,EAA2B,CACnD,OAAOkB,EACJ,OAAO,kBAAmB,mDAAmDC,GAAgB,CAAC,CAC9F,OACC,oCACA,qEACAlB,CACF,CAAC,CACA,OACC,wCACA,wFACAmB,CACF,CAAC,CACA,OACC,gDACA,sHACAC,CACF,CAAC,CACA,OAAO,kBAAmB,yCAAyC,CAAC,CACpE,OAAO,SAAU,mBAAmB,CACzC,CAEA,SAASV,EAAc,EAAa,EAAsB,CACxD,GAAID,IAAQY,EAAqB,IAC/B,MAAO,oDAAoDlB,IAAU,QAAU,WAAa,cAE9F,IAAMmB,EAAgBC,EAAe,KAAM,GAAcC,EAAU,MAAQf,CAAG,EAI9E,MAAO,WAHSa,EACZA,EAAc,MACd,GAAGG,EAAmB,KAAM,GAAcD,EAAU,MAAQf,CAAG,CAAC,EAAE,MAAM,gBAClD,WAAWN,IAAU,QAAU,WAAa,aACxE,CAEA,SAASK,EAAY,EAAqB,CACxC,OAAOC,EAAI,WAAW,UAAY,GAAW,IAAIiB,EAAO,YAAY,GAAG,CACzE,CAEA,eAAezB,EAAe,EAAgB,EAAuC,CACnF,IAAM0B,EAAiBC,EAAcZ,CAAM,EACrCa,EAAkB,MAAMC,EAAsBH,CAAc,EAC5DI,EAAS,MAAMC,EAAWlB,EAAW,OAAQe,CAAe,EAC5DI,EAAUC,EAAepB,EAAYiB,CAAM,EAC3CI,EAAS,MAAMC,EAAWT,EAAgB,CAC9C,GAAGM,EACH,cAAgB,GAAkBI,EAAcR,EAAiBI,EAAQ,QAASK,CAAa,CACjG,CAAC,EACDC,EAAwBJ,EAAQF,CAAO,EACvC,IAAMO,EAAcC,EAAUN,EAAQF,EAAQ,GAAG,EAE7CA,EAAQ,KACVS,EAAUP,EAAQK,EAAaP,CAAO,EAEtCU,EAAgBhB,EAAgBQ,EAAQK,EAAaP,CAAO,GAG1DE,EAAO,YAAeF,EAAQ,aAAeE,EAAO,OAAO,OAAS,KACtE,QAAQ,SAAW,EAEvB,CAEA,SAASM,EAAU,EAAoB,EAA2B,CAChE,IAAMG,EAAaT,EAAO,MAAM,KAAK,CAAE,OAAM,aAAc,CACzD,IAAMU,EAAgBC,EAAWC,EAAMZ,EAAO,WAAW,EACnDa,EAAkBC,EAA6BC,EAASf,EAAO,qBAAsBU,CAAa,EACxG,MAAO,CACL,KAAMA,EACN,cAAeM,EAAkBD,EAAQ,SAAS,EAClD,oBAAqBF,EAAgB,KACrC,oBAAqBE,EAAQ,MAAM,OAAS,EAAI,EAAIF,EAAgB,KAAOE,EAAQ,MAAM,KACzF,kBAAmB,CAAC,EACpB,KAAMA,EAAQ,UACd,UAAWA,EAAQ,MAAM,IAC3B,CACF,CAAC,EAEKE,EAAsBC,EAAeT,EAAW,IAAK,GAAMU,EAAE,eAAe,qBAAuB,CAAC,CAAC,EACrGC,EAAwBF,EAAeT,EAAW,IAAK,GAAMU,EAAE,mBAAmB,CAAC,EACnFE,EAAiBH,EAAeT,EAAW,IAAK,GAAMU,EAAE,IAAI,CAAC,EAE7DG,EAASb,EACZ,IAAK,IAAe,CACnB,GAAGc,EACH,MACEN,EAAoBM,EAAU,eAAe,qBAAuB,CAAC,EACrEH,EAAsBG,EAAU,mBAAmB,EACnDF,EAAeE,EAAU,IAAI,CACjC,EAAE,CAAC,CACF,UACE,EAAM,IAAUC,EAAM,MAAQC,EAAK,OAASD,EAAM,KAAOC,EAAK,MAAQA,EAAK,KAAK,cAAcD,EAAM,IAAI,CAC3G,EAKF,OADAE,EAAwBJ,EAAO,MAAM,EAAGK,CAAG,EAAG3B,EAAO,oBAAoB,EAClEsB,CACT,CAGA,SAASI,EACP,EACA,EACM,CACN,GAAI,CAACE,EACH,OAEF,IAAMC,EAAiB,IAAI,IAAIC,EAAc,IAAK,GAAW,CAACR,EAAO,qBAAM,IAAI,GAAa,CAAC,CAAC,EAC9F,IAAK,IAAMS,KAASH,EAAqB,OACvC,IAAK,IAAMhB,KAAQmB,EAAM,MAAO,CAC9B,IAAMC,EAAWH,EAAe,IAAIjB,CAAI,EACxC,GAAKoB,EAGL,IAAK,IAAMC,KAAWF,EAAM,MACtBE,IAAYrB,GACdoB,EAAS,IAAIC,CAAO,CAG1B,CAEF,IAAK,IAAMX,KAAUQ,EACnB,EAAO,kBAAoB,CAAC,GAAID,EAAe,IAAIP,EAAO,IAAI,GAAK,CAAC,CAAE,CAAC,CAAC,SAAS,CAErF,CAQA,SAASJ,EAAe,EAA6C,CACnE,IAAMgB,EAASC,EAAO,UAAU,EAAM,IAAUV,EAAOD,CAAK,EAC5D,MAAQ,IAAkB,CACxB,IAAIY,EAAM,EACNC,EAAOH,EAAO,OAClB,KAAOE,EAAMC,GAAM,CACjB,IAAMC,EAAUF,EAAMC,GAAS,EAC1BH,EAAOI,GAAqBC,EAC/B,EAAMD,EAAS,EAEf,EAAOA,CAEX,CACA,OAAOJ,EAAO,SAAW,EAAI,EAAIE,EAAMF,EAAO,MAChD,CACF,CAGA,SAASlB,EAAkB,EAAyD,CAClF,IAAIwB,EACJ,IAAK,IAAMC,KAAMC,GAEb,CAACF,GACDC,EAAG,oBAAsBD,EAAM,qBAC9BC,EAAG,sBAAwBD,EAAM,qBAAuBC,EAAG,KAAOD,EAAM,QAEzE,EAAQC,GAGZ,GAAKD,EAGL,MAAO,CACL,KAAMG,EAAoBH,CAAK,EAC/B,UAAWA,EAAM,UACjB,QAASA,EAAM,QACf,oBAAqBA,EAAM,oBAC3B,KAAMA,EAAM,KACZ,aAAcA,EAAM,YACtB,CACF,CAEA,SAASjC,EAAU,EAAoB,EAA2B,EAAgC,CAChG,IAAMuB,EAAgBzB,EAAY,MAAM,EAAGP,EAAQ,GAAG,EACtD8C,EACE,KAAK,UACH,CACE,QAASC,EAAU7C,EAAO,KAAK,EAC/B,iBAAkBK,EAAY,OAC9B,UAAWyB,EAAc,OAASzB,EAAY,OAC9C,MAAOyB,EACP,OAAQ9B,EAAO,OACf,SAAUA,EAAO,QACnB,EACA,IAAA,GACA,CACF,EAAI;CACN,CACF,CAEA,SAASQ,EACP,EACA,EACA,EACA,EACM,CACN,GAAIR,EAAO,WAAY,CACrBzC,EAAY,UAAUyC,EAAO,WAAW,GAAG,EAC3C,MACF,CAEA,IAAM8C,EAAUD,EAAU7C,EAAO,KAAK,EAKtC,GAJA4C,EACE,YAAYE,EAAQ,UAAU,eAAejE,EAAO,aAAaiE,EAAQ,YAAY,SAASA,EAAQ,UAAU,cAAcA,EAAQ,cAAc,IACtJ,EAEIzC,EAAY,SAAW,EACzBuC,EAAY;CAA8B,MACrC,CACL,IAAMd,EAAgBzB,EAAY,MAAM,EAAGP,EAAQ,GAAG,EAChDiD,EAAc1C,EAAY,OAASyB,EAAc,OAAS,OAAOzB,EAAY,SAAW,GAC9FuC,EAAY,iCAAiCd,EAAc,SAASiB,EAAY,KAAK,EACrF,IAAK,GAAM,CAACC,EAAO1B,KAAWQ,EAAc,QAAQ,EAClDc,EAAY,GAAGI,EAAQ,EAAE,IAAIC,EAAiB3B,CAAM,EAAE,GAAG,CAE7D,CAEA,GAAItB,EAAO,SAAS,OAAS,EAAG,CAC9BzC,EAAY,cAAcyC,EAAO,SAAS,OAAO,4DAA4D,EAC7G,IAAK,IAAMkD,KAAWlD,EAAO,SAAS,MAAM,EAAG,EAAE,EAC/CzC,EAAY,KAAK2F,EAAQ,GAAG,EAE1BlD,EAAO,SAAS,OAAS,IAC3BzC,EAAY,SAASyC,EAAO,SAAS,OAAS,GAAG,QAAQ,CAE7D,CAEA,GAAIA,EAAO,OAAO,OAAS,EAAG,CAC5BzC,EAAY,aAAayC,EAAO,OAAO,OAAO,yBAAyB,EACvE,IAAK,IAAMvC,KAASuC,EAAO,OAAO,MAAM,EAAG,EAAE,EAC3CzC,EAAY,KAAKE,EAAM,GAAG,EAExBuC,EAAO,OAAO,OAAS,IACzBzC,EAAY,SAASyC,EAAO,OAAO,OAAS,GAAG,QAAQ,CAE3D,CACF,CAGA,SAASiD,EAAiB,EAA4B,CACpD,IAAME,EAAoB,CAAC,EAC3B,GAAI7B,EAAO,cAAe,CACxB,IAAMmB,EAAKnB,EAAO,cAClB6B,EAAQ,KACN,kBAAkBV,EAAG,KAAK,KAAKA,EAAG,UAAU,GAAGA,EAAG,QAAQ,cAAcA,EAAG,oBAAoB,SAASA,EAAG,KAAK,YAAYA,EAAG,cACjI,CACF,CACA,GAAInB,EAAO,oBAAsB,EAAG,CAClC,IAAM8B,EACJ9B,EAAO,kBAAkB,OAAS,EAC9B,iBAAiBA,EAAO,kBAAkB,MAAM,EAAG,CAAoB,CAAC,CAAC,KAAK,IAAI,IAAIA,EAAO,kBAAkB,OAAS,EAAuB,QAAU,KACzJ,GACN6B,EAAQ,KACN,oBAAoB7B,EAAO,oBAAoB,IAAI,KAAK,MAAMA,EAAO,oBAAsB,GAAG,EAAE,GAAG8B,EAAe,EACpH,CACF,CAEA,OADAD,EAAQ,KAAK,aAAa7B,EAAO,MAAM,EAChC,GAAGA,EAAO,KAAK,UAAUA,EAAO,MAAM,QAAQ,CAAC,EAAE,KAAK6B,EAAQ,KAAK,IAAI,GAChF,CAEA,SAASN,EAAU,EAMjB,CACA,IAAIQ,EAAgB,EAChBC,EAAc,EACdC,EAAyB,EACzBC,EAAY,EAEhB,IAAK,IAAM5C,KAAQ6C,EACjB,GAAiB7C,EAAK,QAAQ,UAAU,OACxC,GAAeA,EAAK,QAAQ,MAAM,KAClC,EAAyB,KAAK,IAAI2C,EAAwB3C,EAAK,QAAQ,sBAAsB,EAC7F,GAAaA,EAAK,QAAQ,UAG5B,MAAO,CAAE,UAAW6C,EAAM,OAAQ,gBAAe,cAAa,yBAAwB,WAAU,CAClG,CAEA,SAASjF,EAAW,EAAuB,CACzC,GAAI+D,IAAU,MACZ,MAAO,KAET,IAAMmB,EAASnB,EAAM,KAAK,IAAM,GAAK,IAAa,OAAOA,CAAK,EAC9D,GAAI,CAAC,OAAO,SAASmB,CAAM,GAAKA,EAAS,EACvC,MAAM,IAAIC,EAAqB,0CAA0C,EAE3E,OAAOD,CACT,CAEA,SAASzE,EAAoB,EAAuB,CAClD,IAAMyE,EAAS7F,EAA2B0E,CAAK,EAC/C,GAAImB,EAAS,IACX,MAAM,IAAIC,EAAqB,wCAAwC,EAEzE,OAAOD,CACT,CAEA,SAAS1E,EAAwB,EAAuB,CACtD,GAAI,CAAC,SAAS,KAAKuD,CAAK,EACtB,MAAM,IAAIoB,EAAqB,kCAAkC,EAGnE,IAAMD,EAAS,OAAOnB,CAAK,EAC3B,GAAI,CAAC,OAAO,cAAcmB,CAAM,GAAKA,EAAS,EAC5C,MAAM,IAAIC,EAAqB,kCAAkC,EAEnE,OAAOD,CACT,CAEA,SAAS7F,EAA2B,EAAuB,CACzD,IAAM6F,EAASE,EAAqBrB,CAAK,EACzC,GAAImB,IAAW,IAAA,GACb,MAAM,IAAIC,EAAqB,8BAA8B,EAE/D,OAAOD,CACT"}

package/dist/cliConfig.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"cliConfig.cjs","names":["defaultDuplicationOptions","readFile","getErrorMessage","path","stat","isRecord","levels","supportedLanguages","thresholds"],"sources":["../src/cliConfig.ts"],"sourcesContent":["import { readFile, stat } from 'node:fs/promises';\nimport path from 'node:path';\nimport { getErrorMessage, isRecord } from '@willbooster/shared-lib';\nimport { defaultDuplicationOptions } from './duplication.js';\nimport type { ExcludePatterns } from './exclusion.js';\nimport { supportedLanguages } from './languages.js';\nimport {\n  levels,\n  thresholds,\n  type Level,\n  type LevelThresholdsConfig,\n  type Limits,\n  type ThresholdsConfig,\n} from './thresholds.js';\nimport type { DuplicationOptions } from './types.js';\n\nexport const configFileName = 'code-gauge.config.json';\nexport const defaultTopFileCount = 10;\n\n/** Shape of the JSON configuration file. All fields are optional and fall back to the built-in defaults. */\nexport interface CodeGaugeConfig {\n  /** Duplication detection settings applied to every measured file. */\n  duplication?: DuplicationOptions;\n  /** Refactoring-candidate ranking settings. */\n  rank?: { top?: number };\n  /** Limits of `code-gauge check`. */\n  thresholds?: ThresholdsConfig;\n  /** Glob patterns, relative to the config file's directory, of files left out of every command. */\n  exclude?: string[];\n  includeTests?: boolean;\n  failOnError?: boolean;\n}\n\n/** A parsed configuration file and the directory its relative settings resolve against. */\nexport interface LoadedConfig {\n  config: CodeGaugeConfig;\n  /** The config file's directory; the search start directory when no config file was found. */\n  directory: string;\n}\n\n/** Raw command-line options; every field is undefined unless the user passed the flag. */\nexport interface CliOptions {\n  config?: string;\n  top?: number;\n  duplicationMinTokens?: number;\n  duplicationMaxGapTokens?: number;\n  duplicationMinSimilarityPercent?: number;\n  includeTests?: boolean;\n  failOnError?: boolean;\n  json?: boolean;\n}\n\n/** Options after merging command-line flags, the configuration file, and the built-in defaults. */\nexport interface ResolvedOptions {\n  duplication: Required<DuplicationOptions>;\n  exclude: ExcludePatterns;\n  /** Number of top-ranked files to report. */\n  top: number;\n  includeTests: boolean;\n  failOnError: boolean;\n  json: boolean;\n}\n\n/** Resolves options with precedence command-line flags > configuration file > built-in defaults. */\nexport function resolveOptions(cli: CliOptions, { config, directory }: LoadedConfig): ResolvedOptions {\n  return {\n    duplication: {\n      minTokens: cli.duplicationMinTokens ?? config.duplication?.minTokens ?? defaultDuplicationOptions.minTokens,\n      maxGapTokens:\n        cli.duplicationMaxGapTokens ?? config.duplication?.maxGapTokens ?? defaultDuplicationOptions.maxGapTokens,\n      minSimilarityPercent:\n        cli.duplicationMinSimilarityPercent ??\n        config.duplication?.minSimilarityPercent ??\n        defaultDuplicationOptions.minSimilarityPercent,\n    },\n    exclude: { patterns: config.exclude ?? [], root: directory },\n    top: cli.top ?? config.rank?.top ?? defaultTopFileCount,\n    includeTests: cli.includeTests ?? config.includeTests ?? false,\n    failOnError: cli.failOnError ?? config.failOnError ?? false,\n    json: cli.json ?? false,\n  };\n}\n\n/**\n * Loads the configuration file. An explicit path must exist; otherwise the nearest\n * `code-gauge.config.json` is searched by walking up from the target directory.\n */\nexport async function loadConfig(explicitPath: string | undefined, targetDirectory: string): Promise<LoadedConfig> {\n  const configFile = explicitPath ?? (await findNearestConfig(targetDirectory));\n  if (!configFile) {\n    return { config: {}, directory: targetDirectory };\n  }\n\n  let content;\n  try {\n    content = await readFile(configFile, 'utf8');\n  } catch (error) {\n    if (explicitPath) {\n      throw new Error(`Cannot read config file \"${configFile}\": ${getErrorMessage(error)}`);\n    }\n    return { config: {}, directory: targetDirectory };\n  }\n\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(content);\n  } catch (error) {\n    throw new Error(`Invalid JSON in config file \"${configFile}\": ${getErrorMessage(error)}`);\n  }\n\n  return { config: validateConfig(parsed, configFile), directory: path.dirname(path.resolve(configFile)) };\n}\n\nasync function findNearestConfig(targetDirectory: string): Promise<string | undefined> {\n  let currentDirectory = targetDirectory;\n  while (true) {\n    const configFile = path.join(currentDirectory, configFileName);\n    if (await fileExists(configFile)) {\n      return configFile;\n    }\n\n    const parentDirectory = path.dirname(currentDirectory);\n    if (parentDirectory === currentDirectory) {\n      return undefined;\n    }\n    currentDirectory = parentDirectory;\n  }\n}\n\nasync function fileExists(file: string): Promise<boolean> {\n  try {\n    const fileStat = await stat(file);\n    return fileStat.isFile();\n  } catch {\n    return false;\n  }\n}\n\nfunction validateConfig(value: unknown, configFile: string): CodeGaugeConfig {\n  if (!isRecord(value)) {\n    throw new Error(`Config file \"${configFile}\" must contain a JSON object.`);\n  }\n\n  const knownKeys = new Set(['duplication', 'rank', 'thresholds', 'exclude', 'includeTests', 'failOnError']);\n  for (const key of Object.keys(value)) {\n    if (!knownKeys.has(key)) {\n      throw new Error(`Config file \"${configFile}\": unknown setting \"${key}\" (expected ${[...knownKeys].join(', ')}).`);\n    }\n  }\n  const config: CodeGaugeConfig = {};\n\n  if (value.duplication !== undefined) {\n    config.duplication = validateDuplicationObject(value.duplication, configFile);\n  }\n\n  if (value.rank !== undefined) {\n    config.rank = validateRankObject(value.rank, configFile);\n  }\n\n  if (value.thresholds !== undefined) {\n    config.thresholds = validateThresholdsObject(value.thresholds, configFile);\n  }\n\n  if (value.exclude !== undefined) {\n    config.exclude = validateExcludePatterns(value.exclude, configFile);\n  }\n\n  for (const key of ['includeTests', 'failOnError'] as const) {\n    if (value[key] !== undefined) {\n      config[key] = requireBoolean(value[key], key, configFile);\n    }\n  }\n\n  return config;\n}\n\nfunction validateExcludePatterns(value: unknown, configFile: string): string[] {\n  if (!Array.isArray(value) || !value.every((pattern) => typeof pattern === 'string' && pattern !== '')) {\n    throw new TypeError(`Config file \"${configFile}\": \"exclude\" must be an array of non-empty glob patterns.`);\n  }\n  return value as string[];\n}\n\nfunction validateRankObject(value: unknown, configFile: string): { top?: number } {\n  if (!isRecord(value)) {\n    throw new Error(`Config file \"${configFile}\": \"rank\" must be an object.`);\n  }\n  const rank: { top?: number } = {};\n  for (const [key, setting] of Object.entries(value)) {\n    if (key !== 'top') {\n      throw new Error(`Config file \"${configFile}\": unknown setting \"${key}\" in \"rank\" (expected top).`);\n    }\n    rank.top = requirePositiveInteger(setting, 'rank.top', configFile);\n  }\n  return rank;\n}\n\nfunction validateThresholdsObject(value: unknown, configFile: string): ThresholdsConfig {\n  return Object.fromEntries(\n    Object.entries(requireRecord(value, 'thresholds', configFile)).map(([level, levelThresholds]) => {\n      if (!levels.includes(level as Level)) {\n        throw new Error(\n          `Config file \"${configFile}\": unknown setting \"${level}\" in \"thresholds\" (expected ${levels.join(', ')}).`\n        );\n      }\n      return [level, validateLevelThresholds(levelThresholds, `thresholds.${level}`, configFile)];\n    })\n  );\n}\n\nfunction validateLevelThresholds(value: unknown, settingName: string, configFile: string): LevelThresholdsConfig {\n  const { languages, ...limits } = requireRecord(value, settingName, configFile);\n  const languagesName = `${settingName}.languages`;\n  return {\n    limits: validateLimits(limits, settingName, ['languages'], configFile),\n    languages: Object.fromEntries(\n      Object.entries(languages === undefined ? {} : requireRecord(languages, languagesName, configFile)).map(\n        ([language, overrides]) => {\n          if (!supportedLanguages.includes(language)) {\n            throw new Error(\n              `Config file \"${configFile}\": unknown language \"${language}\" in \"${languagesName}\" (expected ${supportedLanguages.join(', ')}).`\n            );\n          }\n          const languageName = `${languagesName}.${language}`;\n          return [\n            language,\n            validateLimits(requireRecord(overrides, languageName, configFile), languageName, [], configFile),\n          ];\n        }\n      )\n    ),\n  };\n}\n\n/** Limits as written in the config file, where `null` disables one. */\nfunction validateLimits(\n  value: Record<string, unknown>,\n  settingName: string,\n  otherKeys: string[],\n  configFile: string\n): Limits {\n  const knownKeys = thresholds.map(({ key }) => key);\n  return Object.fromEntries(\n    Object.entries(value).map(([key, limit]) => {\n      if (!knownKeys.includes(key)) {\n        throw new Error(\n          `Config file \"${configFile}\": unknown setting \"${key}\" in \"${settingName}\" (expected ${[...knownKeys, ...otherKeys].join(', ')}).`\n        );\n      }\n      if (limit !== null && (typeof limit !== 'number' || !Number.isFinite(limit) || limit < 0)) {\n        throw new Error(`Config file \"${configFile}\": \"${settingName}.${key}\" must be a non-negative number or null.`);\n      }\n      return [key, limit ?? Infinity];\n    })\n  );\n}\n\nfunction requireRecord(value: unknown, settingName: string, configFile: string): Record<string, unknown> {\n  if (!isRecord(value)) {\n    throw new Error(`Config file \"${configFile}\": \"${settingName}\" must be an object.`);\n  }\n  return value;\n}\n\nfunction validateDuplicationObject(value: unknown, configFile: string): DuplicationOptions {\n  if (!isRecord(value)) {\n    throw new Error(`Config file \"${configFile}\": \"duplication\" must be an object.`);\n  }\n  const duplication: DuplicationOptions = {};\n  for (const [key, setting] of Object.entries(value)) {\n    if (key === 'minTokens') {\n      duplication.minTokens = requirePositiveInteger(setting, 'duplication.minTokens', configFile);\n    } else if (key === 'maxGapTokens') {\n      // 0 is meaningful: it disables gapped-clone merging.\n      duplication.maxGapTokens = requireNonNegativeInteger(setting, 'duplication.maxGapTokens', configFile);\n    } else if (key === 'minSimilarityPercent') {\n      const parsed = requirePositiveInteger(setting, 'duplication.minSimilarityPercent', configFile);\n      if (parsed > 100) {\n        throw new Error(`Config file \"${configFile}\": \"duplication.minSimilarityPercent\" must be between 1 and 100.`);\n      }\n      duplication.minSimilarityPercent = parsed;\n    } else {\n      throw new Error(\n        `Config file \"${configFile}\": unknown setting \"${key}\" in \"duplication\" (expected minTokens, maxGapTokens, or minSimilarityPercent).`\n      );\n    }\n  }\n  return duplication;\n}\n\nfunction requireNonNegativeInteger(value: unknown, key: string, configFile: string): number {\n  return requireNumber(value, key, configFile, Number.isSafeInteger, 'a non-negative integer');\n}\n\nfunction requirePositiveInteger(value: unknown, key: string, configFile: string): number {\n  const parsed = requireNumber(value, key, configFile, Number.isSafeInteger, 'a positive integer');\n  if (parsed < 1) {\n    throw new Error(`Config file \"${configFile}\": \"${key}\" must be a positive integer.`);\n  }\n  return parsed;\n}\n\n/** Shared core of the numeric validators: the right kind of number, and never negative. */\nfunction requireNumber(\n  value: unknown,\n  key: string,\n  configFile: string,\n  isValidKind: (value: unknown) => boolean,\n  description: string\n): number {\n  if (typeof value !== 'number' || !isValidKind(value) || value < 0) {\n    throw new Error(`Config file \"${configFile}\": \"${key}\" must be ${description}.`);\n  }\n  return value;\n}\n\nfunction requireBoolean(value: unknown, key: string, configFile: string): boolean {\n  if (typeof value !== 'boolean') {\n    throw new TypeError(`Config file \"${configFile}\": \"${key}\" must be a boolean.`);\n  }\n  return value;\n}\n"],"mappings":"0QAgBA,MAAa,EAAiB,yBAgD9B,SAAgB,EAAe,EAAiB,CAAE,SAAQ,aAA4C,CACpG,MAAO,CACL,YAAa,CACX,UAAW,EAAI,sBAAwB,EAAO,aAAa,WAAaA,EAAAA,0BAA0B,UAClG,aACE,EAAI,yBAA2B,EAAO,aAAa,cAAgBA,EAAAA,0BAA0B,aAC/F,qBACE,EAAI,iCACJ,EAAO,aAAa,sBACpBA,EAAAA,0BAA0B,oBAC9B,EACA,QAAS,CAAE,SAAU,EAAO,SAAW,CAAC,EAAG,KAAM,CAAU,EAC3D,IAAK,EAAI,KAAO,EAAO,MAAM,KAAA,GAC7B,aAAc,EAAI,cAAgB,EAAO,cAAgB,GACzD,YAAa,EAAI,aAAe,EAAO,aAAe,GACtD,KAAM,EAAI,MAAQ,EACpB,CACF,CAMA,eAAsB,EAAW,EAAkC,EAAgD,CACjH,IAAM,EAAa,GAAiB,MAAM,EAAkB,CAAe,EAC3E,GAAI,CAAC,EACH,MAAO,CAAE,OAAQ,CAAC,EAAG,UAAW,CAAgB,EAGlD,IAAI,EACJ,GAAI,CACF,EAAU,MAAA,EAAMC,EAAAA,SAAAA,CAAS,EAAY,MAAM,CAC7C,OAAS,EAAO,CACd,GAAI,EACF,MAAU,MAAM,4BAA4B,EAAW,MAAA,EAAKC,EAAAA,gBAAAA,CAAgB,CAAK,GAAG,EAEtF,MAAO,CAAE,OAAQ,CAAC,EAAG,UAAW,CAAgB,CAClD,CAEA,IAAI,EACJ,GAAI,CACF,EAAS,KAAK,MAAM,CAAO,CAC7B,OAAS,EAAO,CACd,MAAU,MAAM,gCAAgC,EAAW,MAAA,EAAKA,EAAAA,gBAAAA,CAAgB,CAAK,GAAG,CAC1F,CAEA,MAAO,CAAE,OAAQ,EAAe,EAAQ,CAAU,EAAG,UAAWC,EAAAA,QAAK,QAAQA,EAAAA,QAAK,QAAQ,CAAU,CAAC,CAAE,CACzG,CAEA,eAAe,EAAkB,EAAsD,CACrF,IAAI,EAAmB,EACvB,OAAa,CACX,IAAM,EAAaA,EAAAA,QAAK,KAAK,EAAkB,CAAc,EAC7D,GAAI,MAAM,EAAW,CAAU,EAC7B,OAAO,EAGT,IAAM,EAAkBA,EAAAA,QAAK,QAAQ,CAAgB,EACrD,GAAI,IAAoB,EACtB,OAEF,EAAmB,CACrB,CACF,CAEA,eAAe,EAAW,EAAgC,CACxD,GAAI,CAEF,OAAO,MAAA,EADgBC,EAAAA,KAAAA,CAAK,CAAI,EAAA,CAChB,OAAO,CACzB,MAAQ,CACN,MAAO,EACT,CACF,CAEA,SAAS,EAAe,EAAgB,EAAqC,CAC3E,GAAI,EAAA,EAACC,EAAAA,SAAAA,CAAS,CAAK,EACjB,MAAU,MAAM,gBAAgB,EAAW,8BAA8B,EAG3E,IAAM,kBAAY,IAAI,IAAI,CAAC,cAAe,OAAQ,aAAc,UAAW,eAAgB,aAAa,CAAC,EACzG,IAAK,IAAM,KAAO,OAAO,KAAK,CAAK,EACjC,GAAI,CAAC,EAAU,IAAI,CAAG,EACpB,MAAU,MAAM,gBAAgB,EAAW,sBAAsB,EAAI,cAAc,CAAC,GAAG,CAAS,CAAC,CAAC,KAAK,IAAI,EAAE,GAAG,EAGpH,IAAM,EAA0B,CAAC,EAE7B,EAAM,cAAgB,IAAA,KACxB,EAAO,YAAc,EAA0B,EAAM,YAAa,CAAU,GAG1E,EAAM,OAAS,IAAA,KACjB,EAAO,KAAO,EAAmB,EAAM,KAAM,CAAU,GAGrD,EAAM,aAAe,IAAA,KACvB,EAAO,WAAa,EAAyB,EAAM,WAAY,CAAU,GAGvE,EAAM,UAAY,IAAA,KACpB,EAAO,QAAU,EAAwB,EAAM,QAAS,CAAU,GAGpE,IAAK,IAAM,IAAO,CAAC,eAAgB,aAAa,EAC1C,EAAM,KAAS,IAAA,KACjB,EAAO,GAAO,EAAe,EAAM,GAAM,EAAK,CAAU,GAI5D,OAAO,CACT,CAEA,SAAS,EAAwB,EAAgB,EAA8B,CAC7E,GAAI,CAAC,MAAM,QAAQ,CAAK,GAAK,CAAC,EAAM,MAAO,GAAY,OAAO,GAAY,UAAY,IAAY,EAAE,EAClG,MAAU,UAAU,gBAAgB,EAAW,0DAA0D,EAE3G,OAAO,CACT,CAEA,SAAS,EAAmB,EAAgB,EAAsC,CAChF,GAAI,EAAA,EAACA,EAAAA,SAAAA,CAAS,CAAK,EACjB,MAAU,MAAM,gBAAgB,EAAW,6BAA6B,EAE1E,IAAM,EAAyB,CAAC,EAChC,IAAK,GAAM,CAAC,EAAK,KAAY,OAAO,QAAQ,CAAK,EAAG,CAClD,GAAI,IAAQ,MACV,MAAU,MAAM,gBAAgB,EAAW,sBAAsB,EAAI,4BAA4B,EAEnG,EAAK,IAAM,EAAuB,EAAS,WAAY,CAAU,CACnE,CACA,OAAO,CACT,CAEA,SAAS,EAAyB,EAAgB,EAAsC,CACtF,OAAO,OAAO,YACZ,OAAO,QAAQ,EAAc,EAAO,aAAc,CAAU,CAAC,CAAC,CAAC,KAAK,CAAC,EAAO,KAAqB,CAC/F,GAAI,CAACC,EAAAA,OAAO,SAAS,CAAc,EACjC,MAAU,MACR,gBAAgB,EAAW,sBAAsB,EAAM,8BAA8BA,EAAAA,OAAO,KAAK,IAAI,EAAE,GACzG,EAEF,MAAO,CAAC,EAAO,EAAwB,EAAiB,cAAc,IAAS,CAAU,CAAC,CAC5F,CAAC,CACH,CACF,CAEA,SAAS,EAAwB,EAAgB,EAAqB,EAA2C,CAC/G,GAAM,CAAE,YAAW,GAAG,GAAW,EAAc,EAAO,EAAa,CAAU,EACvE,EAAgB,GAAG,EAAY,YACrC,MAAO,CACL,OAAQ,EAAe,EAAQ,EAAa,CAAC,WAAW,EAAG,CAAU,EACrE,UAAW,OAAO,YAChB,OAAO,QAAQ,IAAc,IAAA,GAAY,CAAC,EAAI,EAAc,EAAW,EAAe,CAAU,CAAC,CAAC,CAAC,KAChG,CAAC,EAAU,KAAe,CACzB,GAAI,CAACC,EAAAA,mBAAmB,SAAS,CAAQ,EACvC,MAAU,MACR,gBAAgB,EAAW,uBAAuB,EAAS,QAAQ,EAAc,cAAcA,EAAAA,mBAAmB,KAAK,IAAI,EAAE,GAC/H,EAEF,IAAM,EAAe,GAAG,EAAc,GAAG,IACzC,MAAO,CACL,EACA,EAAe,EAAc,EAAW,EAAc,CAAU,EAAG,EAAc,CAAC,EAAG,CAAU,CACjG,CACF,CACF,CACF,CACF,CACF,CAGA,SAAS,EACP,EACA,EACA,EACA,EACQ,CACR,IAAM,EAAYC,EAAAA,WAAW,KAAK,CAAE,SAAU,CAAG,EACjD,OAAO,OAAO,YACZ,OAAO,QAAQ,CAAK,CAAC,CAAC,KAAK,CAAC,EAAK,KAAW,CAC1C,GAAI,CAAC,EAAU,SAAS,CAAG,EACzB,MAAU,MACR,gBAAgB,EAAW,sBAAsB,EAAI,QAAQ,EAAY,cAAc,CAAC,GAAG,EAAW,GAAG,CAAS,CAAC,CAAC,KAAK,IAAI,EAAE,GACjI,EAEF,GAAI,IAAU,OAAS,OAAO,GAAU,UAAY,CAAC,OAAO,SAAS,CAAK,GAAK,EAAQ,GACrF,MAAU,MAAM,gBAAgB,EAAW,MAAM,EAAY,GAAG,EAAI,yCAAyC,EAE/G,MAAO,CAAC,EAAK,GAAS,GAAQ,CAChC,CAAC,CACH,CACF,CAEA,SAAS,EAAc,EAAgB,EAAqB,EAA6C,CACvG,GAAI,EAAA,EAACH,EAAAA,SAAAA,CAAS,CAAK,EACjB,MAAU,MAAM,gBAAgB,EAAW,MAAM,EAAY,qBAAqB,EAEpF,OAAO,CACT,CAEA,SAAS,EAA0B,EAAgB,EAAwC,CACzF,GAAI,EAAA,EAACA,EAAAA,SAAAA,CAAS,CAAK,EACjB,MAAU,MAAM,gBAAgB,EAAW,oCAAoC,EAEjF,IAAM,EAAkC,CAAC,EACzC,IAAK,GAAM,CAAC,EAAK,KAAY,OAAO,QAAQ,CAAK,EAC/C,GAAI,IAAQ,YACV,EAAY,UAAY,EAAuB,EAAS,wBAAyB,CAAU,OACtF,GAAI,IAAQ,eAEjB,EAAY,aAAe,EAA0B,EAAS,2BAA4B,CAAU,OAC/F,GAAI,IAAQ,uBAAwB,CACzC,IAAM,EAAS,EAAuB,EAAS,mCAAoC,CAAU,EAC7F,GAAI,EAAS,IACX,MAAU,MAAM,gBAAgB,EAAW,iEAAiE,EAE9G,EAAY,qBAAuB,CACrC,MACE,MAAU,MACR,gBAAgB,EAAW,sBAAsB,EAAI,gFACvD,EAGJ,OAAO,CACT,CAEA,SAAS,EAA0B,EAAgB,EAAa,EAA4B,CAC1F,OAAO,EAAc,EAAO,EAAK,EAAY,OAAO,cAAe,wBAAwB,CAC7F,CAEA,SAAS,EAAuB,EAAgB,EAAa,EAA4B,CACvF,IAAM,EAAS,EAAc,EAAO,EAAK,EAAY,OAAO,cAAe,oBAAoB,EAC/F,GAAI,EAAS,EACX,MAAU,MAAM,gBAAgB,EAAW,MAAM,EAAI,8BAA8B,EAErF,OAAO,CACT,CAGA,SAAS,EACP,EACA,EACA,EACA,EACA,EACQ,CACR,GAAI,OAAO,GAAU,UAAY,CAAC,EAAY,CAAK,GAAK,EAAQ,EAC9D,MAAU,MAAM,gBAAgB,EAAW,MAAM,EAAI,YAAY,EAAY,EAAE,EAEjF,OAAO,CACT,CAEA,SAAS,EAAe,EAAgB,EAAa,EAA6B,CAChF,GAAI,OAAO,GAAU,UACnB,MAAU,UAAU,gBAAgB,EAAW,MAAM,EAAI,qBAAqB,EAEhF,OAAO,CACT"}
+{"version":3,"file":"cliConfig.cjs","names":["defaultDuplicationOptions","readFile","getErrorMessage","path","stat","isRecord","levels","supportedLanguages","thresholds","require_runtime","require_duplication","require_languages","require_thresholds","_willbooster_shared_lib","node_fs_promises","node_path","configFileName","resolveOptions","cli","config","directory","loadConfig","configFile","explicitPath","findNearestConfig","targetDirectory","content","error","parsed","validateConfig","currentDirectory","fileExists","parentDirectory","file","value","knownKeys","key","validateDuplicationObject","validateRankObject","validateThresholdsObject","validateExcludePatterns","requireBoolean","pattern","rank","setting","requirePositiveInteger","requireRecord","level","levelThresholds","validateLevelThresholds","limits","settingName","languagesName","validateLimits","languages","language","overrides","languageName","limit","otherKeys","duplication","requireNonNegativeInteger","requireNumber","isValidKind","description"],"sources":["../src/cliConfig.ts"],"sourcesContent":["import { readFile, stat } from 'node:fs/promises';\nimport path from 'node:path';\nimport { getErrorMessage, isRecord } from '@willbooster/shared-lib';\nimport { defaultDuplicationOptions } from './duplication.js';\nimport type { ExcludePatterns } from './exclusion.js';\nimport { supportedLanguages } from './languages.js';\nimport {\n  levels,\n  thresholds,\n  type Level,\n  type LevelThresholdsConfig,\n  type Limits,\n  type ThresholdsConfig,\n} from './thresholds.js';\nimport type { DuplicationOptions } from './types.js';\n\nexport const configFileName = 'code-gauge.config.json';\nexport const defaultTopFileCount = 10;\n\n/** Shape of the JSON configuration file. All fields are optional and fall back to the built-in defaults. */\nexport interface CodeGaugeConfig {\n  /** Duplication detection settings applied to every measured file. */\n  duplication?: DuplicationOptions;\n  /** Refactoring-candidate ranking settings. */\n  rank?: { top?: number };\n  /** Limits of `code-gauge check`. */\n  thresholds?: ThresholdsConfig;\n  /** Glob patterns, relative to the config file's directory, of files left out of every command. */\n  exclude?: string[];\n  includeTests?: boolean;\n  failOnError?: boolean;\n}\n\n/** A parsed configuration file and the directory its relative settings resolve against. */\nexport interface LoadedConfig {\n  config: CodeGaugeConfig;\n  /** The config file's directory; the search start directory when no config file was found. */\n  directory: string;\n}\n\n/** Raw command-line options; every field is undefined unless the user passed the flag. */\nexport interface CliOptions {\n  config?: string;\n  top?: number;\n  duplicationMinTokens?: number;\n  duplicationMaxGapTokens?: number;\n  duplicationMinSimilarityPercent?: number;\n  includeTests?: boolean;\n  failOnError?: boolean;\n  json?: boolean;\n}\n\n/** Options after merging command-line flags, the configuration file, and the built-in defaults. */\nexport interface ResolvedOptions {\n  duplication: Required<DuplicationOptions>;\n  exclude: ExcludePatterns;\n  /** Number of top-ranked files to report. */\n  top: number;\n  includeTests: boolean;\n  failOnError: boolean;\n  json: boolean;\n}\n\n/** Resolves options with precedence command-line flags > configuration file > built-in defaults. */\nexport function resolveOptions(cli: CliOptions, { config, directory }: LoadedConfig): ResolvedOptions {\n  return {\n    duplication: {\n      minTokens: cli.duplicationMinTokens ?? config.duplication?.minTokens ?? defaultDuplicationOptions.minTokens,\n      maxGapTokens:\n        cli.duplicationMaxGapTokens ?? config.duplication?.maxGapTokens ?? defaultDuplicationOptions.maxGapTokens,\n      minSimilarityPercent:\n        cli.duplicationMinSimilarityPercent ??\n        config.duplication?.minSimilarityPercent ??\n        defaultDuplicationOptions.minSimilarityPercent,\n    },\n    exclude: { patterns: config.exclude ?? [], root: directory },\n    top: cli.top ?? config.rank?.top ?? defaultTopFileCount,\n    includeTests: cli.includeTests ?? config.includeTests ?? false,\n    failOnError: cli.failOnError ?? config.failOnError ?? false,\n    json: cli.json ?? false,\n  };\n}\n\n/**\n * Loads the configuration file. An explicit path must exist; otherwise the nearest\n * `code-gauge.config.json` is searched by walking up from the target directory.\n */\nexport async function loadConfig(explicitPath: string | undefined, targetDirectory: string): Promise<LoadedConfig> {\n  const configFile = explicitPath ?? (await findNearestConfig(targetDirectory));\n  if (!configFile) {\n    return { config: {}, directory: targetDirectory };\n  }\n\n  let content;\n  try {\n    content = await readFile(configFile, 'utf8');\n  } catch (error) {\n    if (explicitPath) {\n      throw new Error(`Cannot read config file \"${configFile}\": ${getErrorMessage(error)}`);\n    }\n    return { config: {}, directory: targetDirectory };\n  }\n\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(content);\n  } catch (error) {\n    throw new Error(`Invalid JSON in config file \"${configFile}\": ${getErrorMessage(error)}`);\n  }\n\n  return { config: validateConfig(parsed, configFile), directory: path.dirname(path.resolve(configFile)) };\n}\n\nasync function findNearestConfig(targetDirectory: string): Promise<string | undefined> {\n  let currentDirectory = targetDirectory;\n  while (true) {\n    const configFile = path.join(currentDirectory, configFileName);\n    if (await fileExists(configFile)) {\n      return configFile;\n    }\n\n    const parentDirectory = path.dirname(currentDirectory);\n    if (parentDirectory === currentDirectory) {\n      return undefined;\n    }\n    currentDirectory = parentDirectory;\n  }\n}\n\nasync function fileExists(file: string): Promise<boolean> {\n  try {\n    const fileStat = await stat(file);\n    return fileStat.isFile();\n  } catch {\n    return false;\n  }\n}\n\nfunction validateConfig(value: unknown, configFile: string): CodeGaugeConfig {\n  if (!isRecord(value)) {\n    throw new Error(`Config file \"${configFile}\" must contain a JSON object.`);\n  }\n\n  const knownKeys = new Set(['duplication', 'rank', 'thresholds', 'exclude', 'includeTests', 'failOnError']);\n  for (const key of Object.keys(value)) {\n    if (!knownKeys.has(key)) {\n      throw new Error(`Config file \"${configFile}\": unknown setting \"${key}\" (expected ${[...knownKeys].join(', ')}).`);\n    }\n  }\n  const config: CodeGaugeConfig = {};\n\n  if (value.duplication !== undefined) {\n    config.duplication = validateDuplicationObject(value.duplication, configFile);\n  }\n\n  if (value.rank !== undefined) {\n    config.rank = validateRankObject(value.rank, configFile);\n  }\n\n  if (value.thresholds !== undefined) {\n    config.thresholds = validateThresholdsObject(value.thresholds, configFile);\n  }\n\n  if (value.exclude !== undefined) {\n    config.exclude = validateExcludePatterns(value.exclude, configFile);\n  }\n\n  for (const key of ['includeTests', 'failOnError'] as const) {\n    if (value[key] !== undefined) {\n      config[key] = requireBoolean(value[key], key, configFile);\n    }\n  }\n\n  return config;\n}\n\nfunction validateExcludePatterns(value: unknown, configFile: string): string[] {\n  if (!Array.isArray(value) || !value.every((pattern) => typeof pattern === 'string' && pattern !== '')) {\n    throw new TypeError(`Config file \"${configFile}\": \"exclude\" must be an array of non-empty glob patterns.`);\n  }\n  return value as string[];\n}\n\nfunction validateRankObject(value: unknown, configFile: string): { top?: number } {\n  if (!isRecord(value)) {\n    throw new Error(`Config file \"${configFile}\": \"rank\" must be an object.`);\n  }\n  const rank: { top?: number } = {};\n  for (const [key, setting] of Object.entries(value)) {\n    if (key !== 'top') {\n      throw new Error(`Config file \"${configFile}\": unknown setting \"${key}\" in \"rank\" (expected top).`);\n    }\n    rank.top = requirePositiveInteger(setting, 'rank.top', configFile);\n  }\n  return rank;\n}\n\nfunction validateThresholdsObject(value: unknown, configFile: string): ThresholdsConfig {\n  return Object.fromEntries(\n    Object.entries(requireRecord(value, 'thresholds', configFile)).map(([level, levelThresholds]) => {\n      if (!levels.includes(level as Level)) {\n        throw new Error(\n          `Config file \"${configFile}\": unknown setting \"${level}\" in \"thresholds\" (expected ${levels.join(', ')}).`\n        );\n      }\n      return [level, validateLevelThresholds(levelThresholds, `thresholds.${level}`, configFile)];\n    })\n  );\n}\n\nfunction validateLevelThresholds(value: unknown, settingName: string, configFile: string): LevelThresholdsConfig {\n  const { languages, ...limits } = requireRecord(value, settingName, configFile);\n  const languagesName = `${settingName}.languages`;\n  return {\n    limits: validateLimits(limits, settingName, ['languages'], configFile),\n    languages: Object.fromEntries(\n      Object.entries(languages === undefined ? {} : requireRecord(languages, languagesName, configFile)).map(\n        ([language, overrides]) => {\n          if (!supportedLanguages.includes(language)) {\n            throw new Error(\n              `Config file \"${configFile}\": unknown language \"${language}\" in \"${languagesName}\" (expected ${supportedLanguages.join(', ')}).`\n            );\n          }\n          const languageName = `${languagesName}.${language}`;\n          return [\n            language,\n            validateLimits(requireRecord(overrides, languageName, configFile), languageName, [], configFile),\n          ];\n        }\n      )\n    ),\n  };\n}\n\n/** Limits as written in the config file, where `null` disables one. */\nfunction validateLimits(\n  value: Record<string, unknown>,\n  settingName: string,\n  otherKeys: string[],\n  configFile: string\n): Limits {\n  const knownKeys = thresholds.map(({ key }) => key);\n  return Object.fromEntries(\n    Object.entries(value).map(([key, limit]) => {\n      if (!knownKeys.includes(key)) {\n        throw new Error(\n          `Config file \"${configFile}\": unknown setting \"${key}\" in \"${settingName}\" (expected ${[...knownKeys, ...otherKeys].join(', ')}).`\n        );\n      }\n      if (limit !== null && (typeof limit !== 'number' || !Number.isFinite(limit) || limit < 0)) {\n        throw new Error(`Config file \"${configFile}\": \"${settingName}.${key}\" must be a non-negative number or null.`);\n      }\n      return [key, limit ?? Infinity];\n    })\n  );\n}\n\nfunction requireRecord(value: unknown, settingName: string, configFile: string): Record<string, unknown> {\n  if (!isRecord(value)) {\n    throw new Error(`Config file \"${configFile}\": \"${settingName}\" must be an object.`);\n  }\n  return value;\n}\n\nfunction validateDuplicationObject(value: unknown, configFile: string): DuplicationOptions {\n  if (!isRecord(value)) {\n    throw new Error(`Config file \"${configFile}\": \"duplication\" must be an object.`);\n  }\n  const duplication: DuplicationOptions = {};\n  for (const [key, setting] of Object.entries(value)) {\n    if (key === 'minTokens') {\n      duplication.minTokens = requirePositiveInteger(setting, 'duplication.minTokens', configFile);\n    } else if (key === 'maxGapTokens') {\n      // 0 is meaningful: it disables gapped-clone merging.\n      duplication.maxGapTokens = requireNonNegativeInteger(setting, 'duplication.maxGapTokens', configFile);\n    } else if (key === 'minSimilarityPercent') {\n      const parsed = requirePositiveInteger(setting, 'duplication.minSimilarityPercent', configFile);\n      if (parsed > 100) {\n        throw new Error(`Config file \"${configFile}\": \"duplication.minSimilarityPercent\" must be between 1 and 100.`);\n      }\n      duplication.minSimilarityPercent = parsed;\n    } else {\n      throw new Error(\n        `Config file \"${configFile}\": unknown setting \"${key}\" in \"duplication\" (expected minTokens, maxGapTokens, or minSimilarityPercent).`\n      );\n    }\n  }\n  return duplication;\n}\n\nfunction requireNonNegativeInteger(value: unknown, key: string, configFile: string): number {\n  return requireNumber(value, key, configFile, Number.isSafeInteger, 'a non-negative integer');\n}\n\nfunction requirePositiveInteger(value: unknown, key: string, configFile: string): number {\n  const parsed = requireNumber(value, key, configFile, Number.isSafeInteger, 'a positive integer');\n  if (parsed < 1) {\n    throw new Error(`Config file \"${configFile}\": \"${key}\" must be a positive integer.`);\n  }\n  return parsed;\n}\n\n/** Shared core of the numeric validators: the right kind of number, and never negative. */\nfunction requireNumber(\n  value: unknown,\n  key: string,\n  configFile: string,\n  isValidKind: (value: unknown) => boolean,\n  description: string\n): number {\n  if (typeof value !== 'number' || !isValidKind(value) || value < 0) {\n    throw new Error(`Config file \"${configFile}\": \"${key}\" must be ${description}.`);\n  }\n  return value;\n}\n\nfunction requireBoolean(value: unknown, key: string, configFile: string): boolean {\n  if (typeof value !== 'boolean') {\n    throw new TypeError(`Config file \"${configFile}\": \"${key}\" must be a boolean.`);\n  }\n  return value;\n}\n"],"mappings":"0QAgBA,MAAagB,EAAiB,yBAgD9B,SAAgBC,EAAe,EAAiB,CAAE,SAAQ,aAA4C,CACpG,MAAO,CACL,YAAa,CACX,UAAWC,EAAI,sBAAwBC,EAAO,aAAa,WAAanB,EAAAA,0BAA0B,UAClG,aACEkB,EAAI,yBAA2BC,EAAO,aAAa,cAAgBnB,EAAAA,0BAA0B,aAC/F,qBACEkB,EAAI,iCACJC,EAAO,aAAa,sBACpBnB,EAAAA,0BAA0B,oBAC9B,EACA,QAAS,CAAE,SAAUmB,EAAO,SAAW,CAAC,EAAG,KAAMC,CAAU,EAC3D,IAAKF,EAAI,KAAOC,EAAO,MAAM,KAAA,GAC7B,aAAcD,EAAI,cAAgBC,EAAO,cAAgB,GACzD,YAAaD,EAAI,aAAeC,EAAO,aAAe,GACtD,KAAMD,EAAI,MAAQ,EACpB,CACF,CAMA,eAAsBG,EAAW,EAAkC,EAAgD,CACjH,IAAMC,EAAaC,GAAiB,MAAMC,EAAkBC,CAAe,EAC3E,GAAI,CAACH,EACH,MAAO,CAAE,OAAQ,CAAC,EAAG,UAAWG,CAAgB,EAGlD,IAAIC,EACJ,GAAI,CACF,EAAU,MAAA,EAAMzB,EAAAA,SAAAA,CAASqB,EAAY,MAAM,CAC7C,OAASK,EAAO,CACd,GAAIJ,EACF,MAAU,MAAM,4BAA4BD,EAAW,MAAA,EAAKpB,EAAAA,gBAAAA,CAAgByB,CAAK,GAAG,EAEtF,MAAO,CAAE,OAAQ,CAAC,EAAG,UAAWF,CAAgB,CAClD,CAEA,IAAIG,EACJ,GAAI,CACF,EAAS,KAAK,MAAMF,CAAO,CAC7B,OAASC,EAAO,CACd,MAAU,MAAM,gCAAgCL,EAAW,MAAA,EAAKpB,EAAAA,gBAAAA,CAAgByB,CAAK,GAAG,CAC1F,CAEA,MAAO,CAAE,OAAQE,EAAeD,EAAQN,CAAU,EAAG,UAAWnB,EAAAA,QAAK,QAAQA,EAAAA,QAAK,QAAQmB,CAAU,CAAC,CAAE,CACzG,CAEA,eAAeE,EAAkB,EAAsD,CACrF,IAAIM,EAAmBL,EACvB,OAAa,CACX,IAAMH,EAAanB,EAAAA,QAAK,KAAK2B,EAAkBd,CAAc,EAC7D,GAAI,MAAMe,EAAWT,CAAU,EAC7B,OAAOA,EAGT,IAAMU,EAAkB7B,EAAAA,QAAK,QAAQ2B,CAAgB,EACrD,GAAIE,IAAoBF,EACtB,OAEF,EAAmBE,CACrB,CACF,CAEA,eAAeD,EAAW,EAAgC,CACxD,GAAI,CAEF,OAAO,MAAA,EADgB3B,EAAAA,KAAAA,CAAK6B,CAAI,EAAA,CAChB,OAAO,CACzB,MAAQ,CACN,MAAO,EACT,CACF,CAEA,SAASJ,EAAe,EAAgB,EAAqC,CAC3E,GAAI,EAAA,EAACxB,EAAAA,SAAAA,CAAS6B,CAAK,EACjB,MAAU,MAAM,gBAAgBZ,EAAW,8BAA8B,EAG3E,IAAMa,kBAAY,IAAI,IAAI,CAAC,cAAe,OAAQ,aAAc,UAAW,eAAgB,aAAa,CAAC,EACzG,IAAK,IAAMC,KAAO,OAAO,KAAKF,CAAK,EACjC,GAAI,CAACC,EAAU,IAAIC,CAAG,EACpB,MAAU,MAAM,gBAAgBd,EAAW,sBAAsBc,EAAI,cAAc,CAAC,GAAGD,CAAS,CAAC,CAAC,KAAK,IAAI,EAAE,GAAG,EAGpH,IAAMhB,EAA0B,CAAC,EAE7Be,EAAM,cAAgB,IAAA,KACxB,EAAO,YAAcG,EAA0BH,EAAM,YAAaZ,CAAU,GAG1EY,EAAM,OAAS,IAAA,KACjB,EAAO,KAAOI,EAAmBJ,EAAM,KAAMZ,CAAU,GAGrDY,EAAM,aAAe,IAAA,KACvB,EAAO,WAAaK,EAAyBL,EAAM,WAAYZ,CAAU,GAGvEY,EAAM,UAAY,IAAA,KACpB,EAAO,QAAUM,EAAwBN,EAAM,QAASZ,CAAU,GAGpE,IAAK,IAAMc,IAAO,CAAC,eAAgB,aAAa,EAC1CF,EAAME,KAAS,IAAA,KACjB,EAAOA,GAAOK,EAAeP,EAAME,GAAMA,EAAKd,CAAU,GAI5D,OAAOH,CACT,CAEA,SAASqB,EAAwB,EAAgB,EAA8B,CAC7E,GAAI,CAAC,MAAM,QAAQN,CAAK,GAAK,CAACA,EAAM,MAAO,GAAY,OAAOQ,GAAY,UAAYA,IAAY,EAAE,EAClG,MAAU,UAAU,gBAAgBpB,EAAW,0DAA0D,EAE3G,OAAOY,CACT,CAEA,SAASI,EAAmB,EAAgB,EAAsC,CAChF,GAAI,EAAA,EAACjC,EAAAA,SAAAA,CAAS6B,CAAK,EACjB,MAAU,MAAM,gBAAgBZ,EAAW,6BAA6B,EAE1E,IAAMqB,EAAyB,CAAC,EAChC,IAAK,GAAM,CAACP,EAAKQ,KAAY,OAAO,QAAQV,CAAK,EAAG,CAClD,GAAIE,IAAQ,MACV,MAAU,MAAM,gBAAgBd,EAAW,sBAAsBc,EAAI,4BAA4B,EAEnG,EAAK,IAAMS,EAAuBD,EAAS,WAAYtB,CAAU,CACnE,CACA,OAAOqB,CACT,CAEA,SAASJ,EAAyB,EAAgB,EAAsC,CACtF,OAAO,OAAO,YACZ,OAAO,QAAQO,EAAcZ,EAAO,aAAcZ,CAAU,CAAC,CAAC,CAAC,KAAK,CAACyB,EAAOC,KAAqB,CAC/F,GAAI,CAAC1C,EAAAA,OAAO,SAASyC,CAAc,EACjC,MAAU,MACR,gBAAgBzB,EAAW,sBAAsByB,EAAM,8BAA8BzC,EAAAA,OAAO,KAAK,IAAI,EAAE,GACzG,EAEF,MAAO,CAACyC,EAAOE,EAAwBD,EAAiB,cAAcD,IAASzB,CAAU,CAAC,CAC5F,CAAC,CACH,CACF,CAEA,SAAS2B,EAAwB,EAAgB,EAAqB,EAA2C,CAC/G,GAAM,CAAE,YAAW,GAAGC,GAAWJ,EAAcZ,EAAOiB,EAAa7B,CAAU,EACvE8B,EAAgB,GAAGD,EAAY,YACrC,MAAO,CACL,OAAQE,EAAeH,EAAQC,EAAa,CAAC,WAAW,EAAG7B,CAAU,EACrE,UAAW,OAAO,YAChB,OAAO,QAAQgC,IAAc,IAAA,GAAY,CAAC,EAAIR,EAAcQ,EAAWF,EAAe9B,CAAU,CAAC,CAAC,CAAC,KAChG,CAACiC,EAAUC,KAAe,CACzB,GAAI,CAACjD,EAAAA,mBAAmB,SAASgD,CAAQ,EACvC,MAAU,MACR,gBAAgBjC,EAAW,uBAAuBiC,EAAS,QAAQH,EAAc,cAAc7C,EAAAA,mBAAmB,KAAK,IAAI,EAAE,GAC/H,EAEF,IAAMkD,EAAe,GAAGL,EAAc,GAAGG,IACzC,MAAO,CACLA,EACAF,EAAeP,EAAcU,EAAWC,EAAcnC,CAAU,EAAGmC,EAAc,CAAC,EAAGnC,CAAU,CACjG,CACF,CACF,CACF,CACF,CACF,CAGA,SAAS+B,EACP,EACA,EACA,EACA,EACQ,CACR,IAAMlB,EAAY3B,EAAAA,WAAW,KAAK,CAAE,SAAU4B,CAAG,EACjD,OAAO,OAAO,YACZ,OAAO,QAAQF,CAAK,CAAC,CAAC,KAAK,CAACE,EAAKsB,KAAW,CAC1C,GAAI,CAACvB,EAAU,SAASC,CAAG,EACzB,MAAU,MACR,gBAAgBd,EAAW,sBAAsBc,EAAI,QAAQe,EAAY,cAAc,CAAC,GAAGhB,EAAW,GAAGwB,CAAS,CAAC,CAAC,KAAK,IAAI,EAAE,GACjI,EAEF,GAAID,IAAU,OAAS,OAAOA,GAAU,UAAY,CAAC,OAAO,SAASA,CAAK,GAAKA,EAAQ,GACrF,MAAU,MAAM,gBAAgBpC,EAAW,MAAM6B,EAAY,GAAGf,EAAI,yCAAyC,EAE/G,MAAO,CAACA,EAAKsB,GAAS,GAAQ,CAChC,CAAC,CACH,CACF,CAEA,SAASZ,EAAc,EAAgB,EAAqB,EAA6C,CACvG,GAAI,EAAA,EAACzC,EAAAA,SAAAA,CAAS6B,CAAK,EACjB,MAAU,MAAM,gBAAgBZ,EAAW,MAAM6B,EAAY,qBAAqB,EAEpF,OAAOjB,CACT,CAEA,SAASG,EAA0B,EAAgB,EAAwC,CACzF,GAAI,EAAA,EAAChC,EAAAA,SAAAA,CAAS6B,CAAK,EACjB,MAAU,MAAM,gBAAgBZ,EAAW,oCAAoC,EAEjF,IAAMsC,EAAkC,CAAC,EACzC,IAAK,GAAM,CAACxB,EAAKQ,KAAY,OAAO,QAAQV,CAAK,EAC/C,GAAIE,IAAQ,YACV,EAAY,UAAYS,EAAuBD,EAAS,wBAAyBtB,CAAU,OACtF,GAAIc,IAAQ,eAEjB,EAAY,aAAeyB,EAA0BjB,EAAS,2BAA4BtB,CAAU,OAC/F,GAAIc,IAAQ,uBAAwB,CACzC,IAAMR,EAASiB,EAAuBD,EAAS,mCAAoCtB,CAAU,EAC7F,GAAIM,EAAS,IACX,MAAU,MAAM,gBAAgBN,EAAW,iEAAiE,EAE9G,EAAY,qBAAuBM,CACrC,MACE,MAAU,MACR,gBAAgBN,EAAW,sBAAsBc,EAAI,gFACvD,EAGJ,OAAOwB,CACT,CAEA,SAASC,EAA0B,EAAgB,EAAa,EAA4B,CAC1F,OAAOC,EAAc5B,EAAOE,EAAKd,EAAY,OAAO,cAAe,wBAAwB,CAC7F,CAEA,SAASuB,EAAuB,EAAgB,EAAa,EAA4B,CACvF,IAAMjB,EAASkC,EAAc5B,EAAOE,EAAKd,EAAY,OAAO,cAAe,oBAAoB,EAC/F,GAAIM,EAAS,EACX,MAAU,MAAM,gBAAgBN,EAAW,MAAMc,EAAI,8BAA8B,EAErF,OAAOR,CACT,CAGA,SAASkC,EACP,EACA,EACA,EACA,EACA,EACQ,CACR,GAAI,OAAO5B,GAAU,UAAY,CAAC6B,EAAY7B,CAAK,GAAKA,EAAQ,EAC9D,MAAU,MAAM,gBAAgBZ,EAAW,MAAMc,EAAI,YAAY4B,EAAY,EAAE,EAEjF,OAAO9B,CACT,CAEA,SAASO,EAAe,EAAgB,EAAa,EAA6B,CAChF,GAAI,OAAOP,GAAU,UACnB,MAAU,UAAU,gBAAgBZ,EAAW,MAAMc,EAAI,qBAAqB,EAEhF,OAAOF,CACT"}

package/dist/cliConfig.js.map

@@ -1 +1 @@
-{"version":3,"file":"cliConfig.js","names":[],"sources":["../src/cliConfig.ts"],"sourcesContent":["import { readFile, stat } from 'node:fs/promises';\nimport path from 'node:path';\nimport { getErrorMessage, isRecord } from '@willbooster/shared-lib';\nimport { defaultDuplicationOptions } from './duplication.js';\nimport type { ExcludePatterns } from './exclusion.js';\nimport { supportedLanguages } from './languages.js';\nimport {\n  levels,\n  thresholds,\n  type Level,\n  type LevelThresholdsConfig,\n  type Limits,\n  type ThresholdsConfig,\n} from './thresholds.js';\nimport type { DuplicationOptions } from './types.js';\n\nexport const configFileName = 'code-gauge.config.json';\nexport const defaultTopFileCount = 10;\n\n/** Shape of the JSON configuration file. All fields are optional and fall back to the built-in defaults. */\nexport interface CodeGaugeConfig {\n  /** Duplication detection settings applied to every measured file. */\n  duplication?: DuplicationOptions;\n  /** Refactoring-candidate ranking settings. */\n  rank?: { top?: number };\n  /** Limits of `code-gauge check`. */\n  thresholds?: ThresholdsConfig;\n  /** Glob patterns, relative to the config file's directory, of files left out of every command. */\n  exclude?: string[];\n  includeTests?: boolean;\n  failOnError?: boolean;\n}\n\n/** A parsed configuration file and the directory its relative settings resolve against. */\nexport interface LoadedConfig {\n  config: CodeGaugeConfig;\n  /** The config file's directory; the search start directory when no config file was found. */\n  directory: string;\n}\n\n/** Raw command-line options; every field is undefined unless the user passed the flag. */\nexport interface CliOptions {\n  config?: string;\n  top?: number;\n  duplicationMinTokens?: number;\n  duplicationMaxGapTokens?: number;\n  duplicationMinSimilarityPercent?: number;\n  includeTests?: boolean;\n  failOnError?: boolean;\n  json?: boolean;\n}\n\n/** Options after merging command-line flags, the configuration file, and the built-in defaults. */\nexport interface ResolvedOptions {\n  duplication: Required<DuplicationOptions>;\n  exclude: ExcludePatterns;\n  /** Number of top-ranked files to report. */\n  top: number;\n  includeTests: boolean;\n  failOnError: boolean;\n  json: boolean;\n}\n\n/** Resolves options with precedence command-line flags > configuration file > built-in defaults. */\nexport function resolveOptions(cli: CliOptions, { config, directory }: LoadedConfig): ResolvedOptions {\n  return {\n    duplication: {\n      minTokens: cli.duplicationMinTokens ?? config.duplication?.minTokens ?? defaultDuplicationOptions.minTokens,\n      maxGapTokens:\n        cli.duplicationMaxGapTokens ?? config.duplication?.maxGapTokens ?? defaultDuplicationOptions.maxGapTokens,\n      minSimilarityPercent:\n        cli.duplicationMinSimilarityPercent ??\n        config.duplication?.minSimilarityPercent ??\n        defaultDuplicationOptions.minSimilarityPercent,\n    },\n    exclude: { patterns: config.exclude ?? [], root: directory },\n    top: cli.top ?? config.rank?.top ?? defaultTopFileCount,\n    includeTests: cli.includeTests ?? config.includeTests ?? false,\n    failOnError: cli.failOnError ?? config.failOnError ?? false,\n    json: cli.json ?? false,\n  };\n}\n\n/**\n * Loads the configuration file. An explicit path must exist; otherwise the nearest\n * `code-gauge.config.json` is searched by walking up from the target directory.\n */\nexport async function loadConfig(explicitPath: string | undefined, targetDirectory: string): Promise<LoadedConfig> {\n  const configFile = explicitPath ?? (await findNearestConfig(targetDirectory));\n  if (!configFile) {\n    return { config: {}, directory: targetDirectory };\n  }\n\n  let content;\n  try {\n    content = await readFile(configFile, 'utf8');\n  } catch (error) {\n    if (explicitPath) {\n      throw new Error(`Cannot read config file \"${configFile}\": ${getErrorMessage(error)}`);\n    }\n    return { config: {}, directory: targetDirectory };\n  }\n\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(content);\n  } catch (error) {\n    throw new Error(`Invalid JSON in config file \"${configFile}\": ${getErrorMessage(error)}`);\n  }\n\n  return { config: validateConfig(parsed, configFile), directory: path.dirname(path.resolve(configFile)) };\n}\n\nasync function findNearestConfig(targetDirectory: string): Promise<string | undefined> {\n  let currentDirectory = targetDirectory;\n  while (true) {\n    const configFile = path.join(currentDirectory, configFileName);\n    if (await fileExists(configFile)) {\n      return configFile;\n    }\n\n    const parentDirectory = path.dirname(currentDirectory);\n    if (parentDirectory === currentDirectory) {\n      return undefined;\n    }\n    currentDirectory = parentDirectory;\n  }\n}\n\nasync function fileExists(file: string): Promise<boolean> {\n  try {\n    const fileStat = await stat(file);\n    return fileStat.isFile();\n  } catch {\n    return false;\n  }\n}\n\nfunction validateConfig(value: unknown, configFile: string): CodeGaugeConfig {\n  if (!isRecord(value)) {\n    throw new Error(`Config file \"${configFile}\" must contain a JSON object.`);\n  }\n\n  const knownKeys = new Set(['duplication', 'rank', 'thresholds', 'exclude', 'includeTests', 'failOnError']);\n  for (const key of Object.keys(value)) {\n    if (!knownKeys.has(key)) {\n      throw new Error(`Config file \"${configFile}\": unknown setting \"${key}\" (expected ${[...knownKeys].join(', ')}).`);\n    }\n  }\n  const config: CodeGaugeConfig = {};\n\n  if (value.duplication !== undefined) {\n    config.duplication = validateDuplicationObject(value.duplication, configFile);\n  }\n\n  if (value.rank !== undefined) {\n    config.rank = validateRankObject(value.rank, configFile);\n  }\n\n  if (value.thresholds !== undefined) {\n    config.thresholds = validateThresholdsObject(value.thresholds, configFile);\n  }\n\n  if (value.exclude !== undefined) {\n    config.exclude = validateExcludePatterns(value.exclude, configFile);\n  }\n\n  for (const key of ['includeTests', 'failOnError'] as const) {\n    if (value[key] !== undefined) {\n      config[key] = requireBoolean(value[key], key, configFile);\n    }\n  }\n\n  return config;\n}\n\nfunction validateExcludePatterns(value: unknown, configFile: string): string[] {\n  if (!Array.isArray(value) || !value.every((pattern) => typeof pattern === 'string' && pattern !== '')) {\n    throw new TypeError(`Config file \"${configFile}\": \"exclude\" must be an array of non-empty glob patterns.`);\n  }\n  return value as string[];\n}\n\nfunction validateRankObject(value: unknown, configFile: string): { top?: number } {\n  if (!isRecord(value)) {\n    throw new Error(`Config file \"${configFile}\": \"rank\" must be an object.`);\n  }\n  const rank: { top?: number } = {};\n  for (const [key, setting] of Object.entries(value)) {\n    if (key !== 'top') {\n      throw new Error(`Config file \"${configFile}\": unknown setting \"${key}\" in \"rank\" (expected top).`);\n    }\n    rank.top = requirePositiveInteger(setting, 'rank.top', configFile);\n  }\n  return rank;\n}\n\nfunction validateThresholdsObject(value: unknown, configFile: string): ThresholdsConfig {\n  return Object.fromEntries(\n    Object.entries(requireRecord(value, 'thresholds', configFile)).map(([level, levelThresholds]) => {\n      if (!levels.includes(level as Level)) {\n        throw new Error(\n          `Config file \"${configFile}\": unknown setting \"${level}\" in \"thresholds\" (expected ${levels.join(', ')}).`\n        );\n      }\n      return [level, validateLevelThresholds(levelThresholds, `thresholds.${level}`, configFile)];\n    })\n  );\n}\n\nfunction validateLevelThresholds(value: unknown, settingName: string, configFile: string): LevelThresholdsConfig {\n  const { languages, ...limits } = requireRecord(value, settingName, configFile);\n  const languagesName = `${settingName}.languages`;\n  return {\n    limits: validateLimits(limits, settingName, ['languages'], configFile),\n    languages: Object.fromEntries(\n      Object.entries(languages === undefined ? {} : requireRecord(languages, languagesName, configFile)).map(\n        ([language, overrides]) => {\n          if (!supportedLanguages.includes(language)) {\n            throw new Error(\n              `Config file \"${configFile}\": unknown language \"${language}\" in \"${languagesName}\" (expected ${supportedLanguages.join(', ')}).`\n            );\n          }\n          const languageName = `${languagesName}.${language}`;\n          return [\n            language,\n            validateLimits(requireRecord(overrides, languageName, configFile), languageName, [], configFile),\n          ];\n        }\n      )\n    ),\n  };\n}\n\n/** Limits as written in the config file, where `null` disables one. */\nfunction validateLimits(\n  value: Record<string, unknown>,\n  settingName: string,\n  otherKeys: string[],\n  configFile: string\n): Limits {\n  const knownKeys = thresholds.map(({ key }) => key);\n  return Object.fromEntries(\n    Object.entries(value).map(([key, limit]) => {\n      if (!knownKeys.includes(key)) {\n        throw new Error(\n          `Config file \"${configFile}\": unknown setting \"${key}\" in \"${settingName}\" (expected ${[...knownKeys, ...otherKeys].join(', ')}).`\n        );\n      }\n      if (limit !== null && (typeof limit !== 'number' || !Number.isFinite(limit) || limit < 0)) {\n        throw new Error(`Config file \"${configFile}\": \"${settingName}.${key}\" must be a non-negative number or null.`);\n      }\n      return [key, limit ?? Infinity];\n    })\n  );\n}\n\nfunction requireRecord(value: unknown, settingName: string, configFile: string): Record<string, unknown> {\n  if (!isRecord(value)) {\n    throw new Error(`Config file \"${configFile}\": \"${settingName}\" must be an object.`);\n  }\n  return value;\n}\n\nfunction validateDuplicationObject(value: unknown, configFile: string): DuplicationOptions {\n  if (!isRecord(value)) {\n    throw new Error(`Config file \"${configFile}\": \"duplication\" must be an object.`);\n  }\n  const duplication: DuplicationOptions = {};\n  for (const [key, setting] of Object.entries(value)) {\n    if (key === 'minTokens') {\n      duplication.minTokens = requirePositiveInteger(setting, 'duplication.minTokens', configFile);\n    } else if (key === 'maxGapTokens') {\n      // 0 is meaningful: it disables gapped-clone merging.\n      duplication.maxGapTokens = requireNonNegativeInteger(setting, 'duplication.maxGapTokens', configFile);\n    } else if (key === 'minSimilarityPercent') {\n      const parsed = requirePositiveInteger(setting, 'duplication.minSimilarityPercent', configFile);\n      if (parsed > 100) {\n        throw new Error(`Config file \"${configFile}\": \"duplication.minSimilarityPercent\" must be between 1 and 100.`);\n      }\n      duplication.minSimilarityPercent = parsed;\n    } else {\n      throw new Error(\n        `Config file \"${configFile}\": unknown setting \"${key}\" in \"duplication\" (expected minTokens, maxGapTokens, or minSimilarityPercent).`\n      );\n    }\n  }\n  return duplication;\n}\n\nfunction requireNonNegativeInteger(value: unknown, key: string, configFile: string): number {\n  return requireNumber(value, key, configFile, Number.isSafeInteger, 'a non-negative integer');\n}\n\nfunction requirePositiveInteger(value: unknown, key: string, configFile: string): number {\n  const parsed = requireNumber(value, key, configFile, Number.isSafeInteger, 'a positive integer');\n  if (parsed < 1) {\n    throw new Error(`Config file \"${configFile}\": \"${key}\" must be a positive integer.`);\n  }\n  return parsed;\n}\n\n/** Shared core of the numeric validators: the right kind of number, and never negative. */\nfunction requireNumber(\n  value: unknown,\n  key: string,\n  configFile: string,\n  isValidKind: (value: unknown) => boolean,\n  description: string\n): number {\n  if (typeof value !== 'number' || !isValidKind(value) || value < 0) {\n    throw new Error(`Config file \"${configFile}\": \"${key}\" must be ${description}.`);\n  }\n  return value;\n}\n\nfunction requireBoolean(value: unknown, key: string, configFile: string): boolean {\n  if (typeof value !== 'boolean') {\n    throw new TypeError(`Config file \"${configFile}\": \"${key}\" must be a boolean.`);\n  }\n  return value;\n}\n"],"mappings":"iUAgBA,MAAa,EAAiB,yBAgD9B,SAAgB,EAAe,EAAiB,CAAE,SAAQ,aAA4C,CACpG,MAAO,CACL,YAAa,CACX,UAAW,EAAI,sBAAwB,EAAO,aAAa,WAAa,EAA0B,UAClG,aACE,EAAI,yBAA2B,EAAO,aAAa,cAAgB,EAA0B,aAC/F,qBACE,EAAI,iCACJ,EAAO,aAAa,sBACpB,EAA0B,oBAC9B,EACA,QAAS,CAAE,SAAU,EAAO,SAAW,CAAC,EAAG,KAAM,CAAU,EAC3D,IAAK,EAAI,KAAO,EAAO,MAAM,KAAA,GAC7B,aAAc,EAAI,cAAgB,EAAO,cAAgB,GACzD,YAAa,EAAI,aAAe,EAAO,aAAe,GACtD,KAAM,EAAI,MAAQ,EACpB,CACF,CAMA,eAAsB,EAAW,EAAkC,EAAgD,CACjH,IAAM,EAAa,GAAiB,MAAM,EAAkB,CAAe,EAC3E,GAAI,CAAC,EACH,MAAO,CAAE,OAAQ,CAAC,EAAG,UAAW,CAAgB,EAGlD,IAAI,EACJ,GAAI,CACF,EAAU,MAAM,EAAS,EAAY,MAAM,CAC7C,OAAS,EAAO,CACd,GAAI,EACF,MAAU,MAAM,4BAA4B,EAAW,KAAK,EAAgB,CAAK,GAAG,EAEtF,MAAO,CAAE,OAAQ,CAAC,EAAG,UAAW,CAAgB,CAClD,CAEA,IAAI,EACJ,GAAI,CACF,EAAS,KAAK,MAAM,CAAO,CAC7B,OAAS,EAAO,CACd,MAAU,MAAM,gCAAgC,EAAW,KAAK,EAAgB,CAAK,GAAG,CAC1F,CAEA,MAAO,CAAE,OAAQ,EAAe,EAAQ,CAAU,EAAG,UAAW,EAAK,QAAQ,EAAK,QAAQ,CAAU,CAAC,CAAE,CACzG,CAEA,eAAe,EAAkB,EAAsD,CACrF,IAAI,EAAmB,EACvB,OAAa,CACX,IAAM,EAAa,EAAK,KAAK,EAAkB,CAAc,EAC7D,GAAI,MAAM,EAAW,CAAU,EAC7B,OAAO,EAGT,IAAM,EAAkB,EAAK,QAAQ,CAAgB,EACrD,GAAI,IAAoB,EACtB,OAEF,EAAmB,CACrB,CACF,CAEA,eAAe,EAAW,EAAgC,CACxD,GAAI,CAEF,OAAO,MADgB,EAAK,CAAI,EAAA,CAChB,OAAO,CACzB,MAAQ,CACN,MAAO,EACT,CACF,CAEA,SAAS,EAAe,EAAgB,EAAqC,CAC3E,GAAI,CAAC,EAAS,CAAK,EACjB,MAAU,MAAM,gBAAgB,EAAW,8BAA8B,EAG3E,IAAM,kBAAY,IAAI,IAAI,CAAC,cAAe,OAAQ,aAAc,UAAW,eAAgB,aAAa,CAAC,EACzG,IAAK,IAAM,KAAO,OAAO,KAAK,CAAK,EACjC,GAAI,CAAC,EAAU,IAAI,CAAG,EACpB,MAAU,MAAM,gBAAgB,EAAW,sBAAsB,EAAI,cAAc,CAAC,GAAG,CAAS,CAAC,CAAC,KAAK,IAAI,EAAE,GAAG,EAGpH,IAAM,EAA0B,CAAC,EAE7B,EAAM,cAAgB,IAAA,KACxB,EAAO,YAAc,EAA0B,EAAM,YAAa,CAAU,GAG1E,EAAM,OAAS,IAAA,KACjB,EAAO,KAAO,EAAmB,EAAM,KAAM,CAAU,GAGrD,EAAM,aAAe,IAAA,KACvB,EAAO,WAAa,EAAyB,EAAM,WAAY,CAAU,GAGvE,EAAM,UAAY,IAAA,KACpB,EAAO,QAAU,EAAwB,EAAM,QAAS,CAAU,GAGpE,IAAK,IAAM,IAAO,CAAC,eAAgB,aAAa,EAC1C,EAAM,KAAS,IAAA,KACjB,EAAO,GAAO,EAAe,EAAM,GAAM,EAAK,CAAU,GAI5D,OAAO,CACT,CAEA,SAAS,EAAwB,EAAgB,EAA8B,CAC7E,GAAI,CAAC,MAAM,QAAQ,CAAK,GAAK,CAAC,EAAM,MAAO,GAAY,OAAO,GAAY,UAAY,IAAY,EAAE,EAClG,MAAU,UAAU,gBAAgB,EAAW,0DAA0D,EAE3G,OAAO,CACT,CAEA,SAAS,EAAmB,EAAgB,EAAsC,CAChF,GAAI,CAAC,EAAS,CAAK,EACjB,MAAU,MAAM,gBAAgB,EAAW,6BAA6B,EAE1E,IAAM,EAAyB,CAAC,EAChC,IAAK,GAAM,CAAC,EAAK,KAAY,OAAO,QAAQ,CAAK,EAAG,CAClD,GAAI,IAAQ,MACV,MAAU,MAAM,gBAAgB,EAAW,sBAAsB,EAAI,4BAA4B,EAEnG,EAAK,IAAM,EAAuB,EAAS,WAAY,CAAU,CACnE,CACA,OAAO,CACT,CAEA,SAAS,EAAyB,EAAgB,EAAsC,CACtF,OAAO,OAAO,YACZ,OAAO,QAAQ,EAAc,EAAO,aAAc,CAAU,CAAC,CAAC,CAAC,KAAK,CAAC,EAAO,KAAqB,CAC/F,GAAI,CAAC,EAAO,SAAS,CAAc,EACjC,MAAU,MACR,gBAAgB,EAAW,sBAAsB,EAAM,8BAA8B,EAAO,KAAK,IAAI,EAAE,GACzG,EAEF,MAAO,CAAC,EAAO,EAAwB,EAAiB,cAAc,IAAS,CAAU,CAAC,CAC5F,CAAC,CACH,CACF,CAEA,SAAS,EAAwB,EAAgB,EAAqB,EAA2C,CAC/G,GAAM,CAAE,YAAW,GAAG,GAAW,EAAc,EAAO,EAAa,CAAU,EACvE,EAAgB,GAAG,EAAY,YACrC,MAAO,CACL,OAAQ,EAAe,EAAQ,EAAa,CAAC,WAAW,EAAG,CAAU,EACrE,UAAW,OAAO,YAChB,OAAO,QAAQ,IAAc,IAAA,GAAY,CAAC,EAAI,EAAc,EAAW,EAAe,CAAU,CAAC,CAAC,CAAC,KAChG,CAAC,EAAU,KAAe,CACzB,GAAI,CAAC,EAAmB,SAAS,CAAQ,EACvC,MAAU,MACR,gBAAgB,EAAW,uBAAuB,EAAS,QAAQ,EAAc,cAAc,EAAmB,KAAK,IAAI,EAAE,GAC/H,EAEF,IAAM,EAAe,GAAG,EAAc,GAAG,IACzC,MAAO,CACL,EACA,EAAe,EAAc,EAAW,EAAc,CAAU,EAAG,EAAc,CAAC,EAAG,CAAU,CACjG,CACF,CACF,CACF,CACF,CACF,CAGA,SAAS,EACP,EACA,EACA,EACA,EACQ,CACR,IAAM,EAAY,EAAW,KAAK,CAAE,SAAU,CAAG,EACjD,OAAO,OAAO,YACZ,OAAO,QAAQ,CAAK,CAAC,CAAC,KAAK,CAAC,EAAK,KAAW,CAC1C,GAAI,CAAC,EAAU,SAAS,CAAG,EACzB,MAAU,MACR,gBAAgB,EAAW,sBAAsB,EAAI,QAAQ,EAAY,cAAc,CAAC,GAAG,EAAW,GAAG,CAAS,CAAC,CAAC,KAAK,IAAI,EAAE,GACjI,EAEF,GAAI,IAAU,OAAS,OAAO,GAAU,UAAY,CAAC,OAAO,SAAS,CAAK,GAAK,EAAQ,GACrF,MAAU,MAAM,gBAAgB,EAAW,MAAM,EAAY,GAAG,EAAI,yCAAyC,EAE/G,MAAO,CAAC,EAAK,GAAS,GAAQ,CAChC,CAAC,CACH,CACF,CAEA,SAAS,EAAc,EAAgB,EAAqB,EAA6C,CACvG,GAAI,CAAC,EAAS,CAAK,EACjB,MAAU,MAAM,gBAAgB,EAAW,MAAM,EAAY,qBAAqB,EAEpF,OAAO,CACT,CAEA,SAAS,EAA0B,EAAgB,EAAwC,CACzF,GAAI,CAAC,EAAS,CAAK,EACjB,MAAU,MAAM,gBAAgB,EAAW,oCAAoC,EAEjF,IAAM,EAAkC,CAAC,EACzC,IAAK,GAAM,CAAC,EAAK,KAAY,OAAO,QAAQ,CAAK,EAC/C,GAAI,IAAQ,YACV,EAAY,UAAY,EAAuB,EAAS,wBAAyB,CAAU,OACtF,GAAI,IAAQ,eAEjB,EAAY,aAAe,EAA0B,EAAS,2BAA4B,CAAU,OAC/F,GAAI,IAAQ,uBAAwB,CACzC,IAAM,EAAS,EAAuB,EAAS,mCAAoC,CAAU,EAC7F,GAAI,EAAS,IACX,MAAU,MAAM,gBAAgB,EAAW,iEAAiE,EAE9G,EAAY,qBAAuB,CACrC,MACE,MAAU,MACR,gBAAgB,EAAW,sBAAsB,EAAI,gFACvD,EAGJ,OAAO,CACT,CAEA,SAAS,EAA0B,EAAgB,EAAa,EAA4B,CAC1F,OAAO,EAAc,EAAO,EAAK,EAAY,OAAO,cAAe,wBAAwB,CAC7F,CAEA,SAAS,EAAuB,EAAgB,EAAa,EAA4B,CACvF,IAAM,EAAS,EAAc,EAAO,EAAK,EAAY,OAAO,cAAe,oBAAoB,EAC/F,GAAI,EAAS,EACX,MAAU,MAAM,gBAAgB,EAAW,MAAM,EAAI,8BAA8B,EAErF,OAAO,CACT,CAGA,SAAS,EACP,EACA,EACA,EACA,EACA,EACQ,CACR,GAAI,OAAO,GAAU,UAAY,CAAC,EAAY,CAAK,GAAK,EAAQ,EAC9D,MAAU,MAAM,gBAAgB,EAAW,MAAM,EAAI,YAAY,EAAY,EAAE,EAEjF,OAAO,CACT,CAEA,SAAS,EAAe,EAAgB,EAAa,EAA6B,CAChF,GAAI,OAAO,GAAU,UACnB,MAAU,UAAU,gBAAgB,EAAW,MAAM,EAAI,qBAAqB,EAEhF,OAAO,CACT"}
+{"version":3,"file":"cliConfig.js","names":["path","configFileName","resolveOptions","cli","config","defaultDuplicationOptions","directory","loadConfig","configFile","explicitPath","findNearestConfig","targetDirectory","content","readFile","error","getErrorMessage","parsed","validateConfig","currentDirectory","fileExists","parentDirectory","stat","file","isRecord","value","knownKeys","key","validateDuplicationObject","validateRankObject","validateThresholdsObject","validateExcludePatterns","requireBoolean","pattern","rank","setting","requirePositiveInteger","requireRecord","level","levelThresholds","levels","validateLevelThresholds","limits","settingName","languagesName","validateLimits","languages","language","overrides","supportedLanguages","languageName","thresholds","limit","otherKeys","duplication","requireNonNegativeInteger","requireNumber","isValidKind","description"],"sources":["../src/cliConfig.ts"],"sourcesContent":["import { readFile, stat } from 'node:fs/promises';\nimport path from 'node:path';\nimport { getErrorMessage, isRecord } from '@willbooster/shared-lib';\nimport { defaultDuplicationOptions } from './duplication.js';\nimport type { ExcludePatterns } from './exclusion.js';\nimport { supportedLanguages } from './languages.js';\nimport {\n  levels,\n  thresholds,\n  type Level,\n  type LevelThresholdsConfig,\n  type Limits,\n  type ThresholdsConfig,\n} from './thresholds.js';\nimport type { DuplicationOptions } from './types.js';\n\nexport const configFileName = 'code-gauge.config.json';\nexport const defaultTopFileCount = 10;\n\n/** Shape of the JSON configuration file. All fields are optional and fall back to the built-in defaults. */\nexport interface CodeGaugeConfig {\n  /** Duplication detection settings applied to every measured file. */\n  duplication?: DuplicationOptions;\n  /** Refactoring-candidate ranking settings. */\n  rank?: { top?: number };\n  /** Limits of `code-gauge check`. */\n  thresholds?: ThresholdsConfig;\n  /** Glob patterns, relative to the config file's directory, of files left out of every command. */\n  exclude?: string[];\n  includeTests?: boolean;\n  failOnError?: boolean;\n}\n\n/** A parsed configuration file and the directory its relative settings resolve against. */\nexport interface LoadedConfig {\n  config: CodeGaugeConfig;\n  /** The config file's directory; the search start directory when no config file was found. */\n  directory: string;\n}\n\n/** Raw command-line options; every field is undefined unless the user passed the flag. */\nexport interface CliOptions {\n  config?: string;\n  top?: number;\n  duplicationMinTokens?: number;\n  duplicationMaxGapTokens?: number;\n  duplicationMinSimilarityPercent?: number;\n  includeTests?: boolean;\n  failOnError?: boolean;\n  json?: boolean;\n}\n\n/** Options after merging command-line flags, the configuration file, and the built-in defaults. */\nexport interface ResolvedOptions {\n  duplication: Required<DuplicationOptions>;\n  exclude: ExcludePatterns;\n  /** Number of top-ranked files to report. */\n  top: number;\n  includeTests: boolean;\n  failOnError: boolean;\n  json: boolean;\n}\n\n/** Resolves options with precedence command-line flags > configuration file > built-in defaults. */\nexport function resolveOptions(cli: CliOptions, { config, directory }: LoadedConfig): ResolvedOptions {\n  return {\n    duplication: {\n      minTokens: cli.duplicationMinTokens ?? config.duplication?.minTokens ?? defaultDuplicationOptions.minTokens,\n      maxGapTokens:\n        cli.duplicationMaxGapTokens ?? config.duplication?.maxGapTokens ?? defaultDuplicationOptions.maxGapTokens,\n      minSimilarityPercent:\n        cli.duplicationMinSimilarityPercent ??\n        config.duplication?.minSimilarityPercent ??\n        defaultDuplicationOptions.minSimilarityPercent,\n    },\n    exclude: { patterns: config.exclude ?? [], root: directory },\n    top: cli.top ?? config.rank?.top ?? defaultTopFileCount,\n    includeTests: cli.includeTests ?? config.includeTests ?? false,\n    failOnError: cli.failOnError ?? config.failOnError ?? false,\n    json: cli.json ?? false,\n  };\n}\n\n/**\n * Loads the configuration file. An explicit path must exist; otherwise the nearest\n * `code-gauge.config.json` is searched by walking up from the target directory.\n */\nexport async function loadConfig(explicitPath: string | undefined, targetDirectory: string): Promise<LoadedConfig> {\n  const configFile = explicitPath ?? (await findNearestConfig(targetDirectory));\n  if (!configFile) {\n    return { config: {}, directory: targetDirectory };\n  }\n\n  let content;\n  try {\n    content = await readFile(configFile, 'utf8');\n  } catch (error) {\n    if (explicitPath) {\n      throw new Error(`Cannot read config file \"${configFile}\": ${getErrorMessage(error)}`);\n    }\n    return { config: {}, directory: targetDirectory };\n  }\n\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(content);\n  } catch (error) {\n    throw new Error(`Invalid JSON in config file \"${configFile}\": ${getErrorMessage(error)}`);\n  }\n\n  return { config: validateConfig(parsed, configFile), directory: path.dirname(path.resolve(configFile)) };\n}\n\nasync function findNearestConfig(targetDirectory: string): Promise<string | undefined> {\n  let currentDirectory = targetDirectory;\n  while (true) {\n    const configFile = path.join(currentDirectory, configFileName);\n    if (await fileExists(configFile)) {\n      return configFile;\n    }\n\n    const parentDirectory = path.dirname(currentDirectory);\n    if (parentDirectory === currentDirectory) {\n      return undefined;\n    }\n    currentDirectory = parentDirectory;\n  }\n}\n\nasync function fileExists(file: string): Promise<boolean> {\n  try {\n    const fileStat = await stat(file);\n    return fileStat.isFile();\n  } catch {\n    return false;\n  }\n}\n\nfunction validateConfig(value: unknown, configFile: string): CodeGaugeConfig {\n  if (!isRecord(value)) {\n    throw new Error(`Config file \"${configFile}\" must contain a JSON object.`);\n  }\n\n  const knownKeys = new Set(['duplication', 'rank', 'thresholds', 'exclude', 'includeTests', 'failOnError']);\n  for (const key of Object.keys(value)) {\n    if (!knownKeys.has(key)) {\n      throw new Error(`Config file \"${configFile}\": unknown setting \"${key}\" (expected ${[...knownKeys].join(', ')}).`);\n    }\n  }\n  const config: CodeGaugeConfig = {};\n\n  if (value.duplication !== undefined) {\n    config.duplication = validateDuplicationObject(value.duplication, configFile);\n  }\n\n  if (value.rank !== undefined) {\n    config.rank = validateRankObject(value.rank, configFile);\n  }\n\n  if (value.thresholds !== undefined) {\n    config.thresholds = validateThresholdsObject(value.thresholds, configFile);\n  }\n\n  if (value.exclude !== undefined) {\n    config.exclude = validateExcludePatterns(value.exclude, configFile);\n  }\n\n  for (const key of ['includeTests', 'failOnError'] as const) {\n    if (value[key] !== undefined) {\n      config[key] = requireBoolean(value[key], key, configFile);\n    }\n  }\n\n  return config;\n}\n\nfunction validateExcludePatterns(value: unknown, configFile: string): string[] {\n  if (!Array.isArray(value) || !value.every((pattern) => typeof pattern === 'string' && pattern !== '')) {\n    throw new TypeError(`Config file \"${configFile}\": \"exclude\" must be an array of non-empty glob patterns.`);\n  }\n  return value as string[];\n}\n\nfunction validateRankObject(value: unknown, configFile: string): { top?: number } {\n  if (!isRecord(value)) {\n    throw new Error(`Config file \"${configFile}\": \"rank\" must be an object.`);\n  }\n  const rank: { top?: number } = {};\n  for (const [key, setting] of Object.entries(value)) {\n    if (key !== 'top') {\n      throw new Error(`Config file \"${configFile}\": unknown setting \"${key}\" in \"rank\" (expected top).`);\n    }\n    rank.top = requirePositiveInteger(setting, 'rank.top', configFile);\n  }\n  return rank;\n}\n\nfunction validateThresholdsObject(value: unknown, configFile: string): ThresholdsConfig {\n  return Object.fromEntries(\n    Object.entries(requireRecord(value, 'thresholds', configFile)).map(([level, levelThresholds]) => {\n      if (!levels.includes(level as Level)) {\n        throw new Error(\n          `Config file \"${configFile}\": unknown setting \"${level}\" in \"thresholds\" (expected ${levels.join(', ')}).`\n        );\n      }\n      return [level, validateLevelThresholds(levelThresholds, `thresholds.${level}`, configFile)];\n    })\n  );\n}\n\nfunction validateLevelThresholds(value: unknown, settingName: string, configFile: string): LevelThresholdsConfig {\n  const { languages, ...limits } = requireRecord(value, settingName, configFile);\n  const languagesName = `${settingName}.languages`;\n  return {\n    limits: validateLimits(limits, settingName, ['languages'], configFile),\n    languages: Object.fromEntries(\n      Object.entries(languages === undefined ? {} : requireRecord(languages, languagesName, configFile)).map(\n        ([language, overrides]) => {\n          if (!supportedLanguages.includes(language)) {\n            throw new Error(\n              `Config file \"${configFile}\": unknown language \"${language}\" in \"${languagesName}\" (expected ${supportedLanguages.join(', ')}).`\n            );\n          }\n          const languageName = `${languagesName}.${language}`;\n          return [\n            language,\n            validateLimits(requireRecord(overrides, languageName, configFile), languageName, [], configFile),\n          ];\n        }\n      )\n    ),\n  };\n}\n\n/** Limits as written in the config file, where `null` disables one. */\nfunction validateLimits(\n  value: Record<string, unknown>,\n  settingName: string,\n  otherKeys: string[],\n  configFile: string\n): Limits {\n  const knownKeys = thresholds.map(({ key }) => key);\n  return Object.fromEntries(\n    Object.entries(value).map(([key, limit]) => {\n      if (!knownKeys.includes(key)) {\n        throw new Error(\n          `Config file \"${configFile}\": unknown setting \"${key}\" in \"${settingName}\" (expected ${[...knownKeys, ...otherKeys].join(', ')}).`\n        );\n      }\n      if (limit !== null && (typeof limit !== 'number' || !Number.isFinite(limit) || limit < 0)) {\n        throw new Error(`Config file \"${configFile}\": \"${settingName}.${key}\" must be a non-negative number or null.`);\n      }\n      return [key, limit ?? Infinity];\n    })\n  );\n}\n\nfunction requireRecord(value: unknown, settingName: string, configFile: string): Record<string, unknown> {\n  if (!isRecord(value)) {\n    throw new Error(`Config file \"${configFile}\": \"${settingName}\" must be an object.`);\n  }\n  return value;\n}\n\nfunction validateDuplicationObject(value: unknown, configFile: string): DuplicationOptions {\n  if (!isRecord(value)) {\n    throw new Error(`Config file \"${configFile}\": \"duplication\" must be an object.`);\n  }\n  const duplication: DuplicationOptions = {};\n  for (const [key, setting] of Object.entries(value)) {\n    if (key === 'minTokens') {\n      duplication.minTokens = requirePositiveInteger(setting, 'duplication.minTokens', configFile);\n    } else if (key === 'maxGapTokens') {\n      // 0 is meaningful: it disables gapped-clone merging.\n      duplication.maxGapTokens = requireNonNegativeInteger(setting, 'duplication.maxGapTokens', configFile);\n    } else if (key === 'minSimilarityPercent') {\n      const parsed = requirePositiveInteger(setting, 'duplication.minSimilarityPercent', configFile);\n      if (parsed > 100) {\n        throw new Error(`Config file \"${configFile}\": \"duplication.minSimilarityPercent\" must be between 1 and 100.`);\n      }\n      duplication.minSimilarityPercent = parsed;\n    } else {\n      throw new Error(\n        `Config file \"${configFile}\": unknown setting \"${key}\" in \"duplication\" (expected minTokens, maxGapTokens, or minSimilarityPercent).`\n      );\n    }\n  }\n  return duplication;\n}\n\nfunction requireNonNegativeInteger(value: unknown, key: string, configFile: string): number {\n  return requireNumber(value, key, configFile, Number.isSafeInteger, 'a non-negative integer');\n}\n\nfunction requirePositiveInteger(value: unknown, key: string, configFile: string): number {\n  const parsed = requireNumber(value, key, configFile, Number.isSafeInteger, 'a positive integer');\n  if (parsed < 1) {\n    throw new Error(`Config file \"${configFile}\": \"${key}\" must be a positive integer.`);\n  }\n  return parsed;\n}\n\n/** Shared core of the numeric validators: the right kind of number, and never negative. */\nfunction requireNumber(\n  value: unknown,\n  key: string,\n  configFile: string,\n  isValidKind: (value: unknown) => boolean,\n  description: string\n): number {\n  if (typeof value !== 'number' || !isValidKind(value) || value < 0) {\n    throw new Error(`Config file \"${configFile}\": \"${key}\" must be ${description}.`);\n  }\n  return value;\n}\n\nfunction requireBoolean(value: unknown, key: string, configFile: string): boolean {\n  if (typeof value !== 'boolean') {\n    throw new TypeError(`Config file \"${configFile}\": \"${key}\" must be a boolean.`);\n  }\n  return value;\n}\n"],"mappings":"iUAgBA,MAAaC,EAAiB,yBAgD9B,SAAgBC,EAAe,EAAiB,CAAE,SAAQ,aAA4C,CACpG,MAAO,CACL,YAAa,CACX,UAAWC,EAAI,sBAAwBC,EAAO,aAAa,WAAaC,EAA0B,UAClG,aACEF,EAAI,yBAA2BC,EAAO,aAAa,cAAgBC,EAA0B,aAC/F,qBACEF,EAAI,iCACJC,EAAO,aAAa,sBACpBC,EAA0B,oBAC9B,EACA,QAAS,CAAE,SAAUD,EAAO,SAAW,CAAC,EAAG,KAAME,CAAU,EAC3D,IAAKH,EAAI,KAAOC,EAAO,MAAM,KAAA,GAC7B,aAAcD,EAAI,cAAgBC,EAAO,cAAgB,GACzD,YAAaD,EAAI,aAAeC,EAAO,aAAe,GACtD,KAAMD,EAAI,MAAQ,EACpB,CACF,CAMA,eAAsBI,EAAW,EAAkC,EAAgD,CACjH,IAAMC,EAAaC,GAAiB,MAAMC,EAAkBC,CAAe,EAC3E,GAAI,CAACH,EACH,MAAO,CAAE,OAAQ,CAAC,EAAG,UAAWG,CAAgB,EAGlD,IAAIC,EACJ,GAAI,CACF,EAAU,MAAMC,EAASL,EAAY,MAAM,CAC7C,OAASM,EAAO,CACd,GAAIL,EACF,MAAU,MAAM,4BAA4BD,EAAW,KAAKO,EAAgBD,CAAK,GAAG,EAEtF,MAAO,CAAE,OAAQ,CAAC,EAAG,UAAWH,CAAgB,CAClD,CAEA,IAAIK,EACJ,GAAI,CACF,EAAS,KAAK,MAAMJ,CAAO,CAC7B,OAASE,EAAO,CACd,MAAU,MAAM,gCAAgCN,EAAW,KAAKO,EAAgBD,CAAK,GAAG,CAC1F,CAEA,MAAO,CAAE,OAAQG,EAAeD,EAAQR,CAAU,EAAG,UAAWR,EAAK,QAAQA,EAAK,QAAQQ,CAAU,CAAC,CAAE,CACzG,CAEA,eAAeE,EAAkB,EAAsD,CACrF,IAAIQ,EAAmBP,EACvB,OAAa,CACX,IAAMH,EAAaR,EAAK,KAAKkB,EAAkBjB,CAAc,EAC7D,GAAI,MAAMkB,EAAWX,CAAU,EAC7B,OAAOA,EAGT,IAAMY,EAAkBpB,EAAK,QAAQkB,CAAgB,EACrD,GAAIE,IAAoBF,EACtB,OAEF,EAAmBE,CACrB,CACF,CAEA,eAAeD,EAAW,EAAgC,CACxD,GAAI,CAEF,OAAO,MADgBE,EAAKC,CAAI,EAAA,CAChB,OAAO,CACzB,MAAQ,CACN,MAAO,EACT,CACF,CAEA,SAASL,EAAe,EAAgB,EAAqC,CAC3E,GAAI,CAACM,EAASC,CAAK,EACjB,MAAU,MAAM,gBAAgBhB,EAAW,8BAA8B,EAG3E,IAAMiB,kBAAY,IAAI,IAAI,CAAC,cAAe,OAAQ,aAAc,UAAW,eAAgB,aAAa,CAAC,EACzG,IAAK,IAAMC,KAAO,OAAO,KAAKF,CAAK,EACjC,GAAI,CAACC,EAAU,IAAIC,CAAG,EACpB,MAAU,MAAM,gBAAgBlB,EAAW,sBAAsBkB,EAAI,cAAc,CAAC,GAAGD,CAAS,CAAC,CAAC,KAAK,IAAI,EAAE,GAAG,EAGpH,IAAMrB,EAA0B,CAAC,EAE7BoB,EAAM,cAAgB,IAAA,KACxB,EAAO,YAAcG,EAA0BH,EAAM,YAAahB,CAAU,GAG1EgB,EAAM,OAAS,IAAA,KACjB,EAAO,KAAOI,EAAmBJ,EAAM,KAAMhB,CAAU,GAGrDgB,EAAM,aAAe,IAAA,KACvB,EAAO,WAAaK,EAAyBL,EAAM,WAAYhB,CAAU,GAGvEgB,EAAM,UAAY,IAAA,KACpB,EAAO,QAAUM,EAAwBN,EAAM,QAAShB,CAAU,GAGpE,IAAK,IAAMkB,IAAO,CAAC,eAAgB,aAAa,EAC1CF,EAAME,KAAS,IAAA,KACjB,EAAOA,GAAOK,EAAeP,EAAME,GAAMA,EAAKlB,CAAU,GAI5D,OAAOJ,CACT,CAEA,SAAS0B,EAAwB,EAAgB,EAA8B,CAC7E,GAAI,CAAC,MAAM,QAAQN,CAAK,GAAK,CAACA,EAAM,MAAO,GAAY,OAAOQ,GAAY,UAAYA,IAAY,EAAE,EAClG,MAAU,UAAU,gBAAgBxB,EAAW,0DAA0D,EAE3G,OAAOgB,CACT,CAEA,SAASI,EAAmB,EAAgB,EAAsC,CAChF,GAAI,CAACL,EAASC,CAAK,EACjB,MAAU,MAAM,gBAAgBhB,EAAW,6BAA6B,EAE1E,IAAMyB,EAAyB,CAAC,EAChC,IAAK,GAAM,CAACP,EAAKQ,KAAY,OAAO,QAAQV,CAAK,EAAG,CAClD,GAAIE,IAAQ,MACV,MAAU,MAAM,gBAAgBlB,EAAW,sBAAsBkB,EAAI,4BAA4B,EAEnG,EAAK,IAAMS,EAAuBD,EAAS,WAAY1B,CAAU,CACnE,CACA,OAAOyB,CACT,CAEA,SAASJ,EAAyB,EAAgB,EAAsC,CACtF,OAAO,OAAO,YACZ,OAAO,QAAQO,EAAcZ,EAAO,aAAchB,CAAU,CAAC,CAAC,CAAC,KAAK,CAAC6B,EAAOC,KAAqB,CAC/F,GAAI,CAACC,EAAO,SAASF,CAAc,EACjC,MAAU,MACR,gBAAgB7B,EAAW,sBAAsB6B,EAAM,8BAA8BE,EAAO,KAAK,IAAI,EAAE,GACzG,EAEF,MAAO,CAACF,EAAOG,EAAwBF,EAAiB,cAAcD,IAAS7B,CAAU,CAAC,CAC5F,CAAC,CACH,CACF,CAEA,SAASgC,EAAwB,EAAgB,EAAqB,EAA2C,CAC/G,GAAM,CAAE,YAAW,GAAGC,GAAWL,EAAcZ,EAAOkB,EAAalC,CAAU,EACvEmC,EAAgB,GAAGD,EAAY,YACrC,MAAO,CACL,OAAQE,EAAeH,EAAQC,EAAa,CAAC,WAAW,EAAGlC,CAAU,EACrE,UAAW,OAAO,YAChB,OAAO,QAAQqC,IAAc,IAAA,GAAY,CAAC,EAAIT,EAAcS,EAAWF,EAAenC,CAAU,CAAC,CAAC,CAAC,KAChG,CAACsC,EAAUC,KAAe,CACzB,GAAI,CAACC,EAAmB,SAASF,CAAQ,EACvC,MAAU,MACR,gBAAgBtC,EAAW,uBAAuBsC,EAAS,QAAQH,EAAc,cAAcK,EAAmB,KAAK,IAAI,EAAE,GAC/H,EAEF,IAAMC,EAAe,GAAGN,EAAc,GAAGG,IACzC,MAAO,CACLA,EACAF,EAAeR,EAAcW,EAAWE,EAAczC,CAAU,EAAGyC,EAAc,CAAC,EAAGzC,CAAU,CACjG,CACF,CACF,CACF,CACF,CACF,CAGA,SAASoC,EACP,EACA,EACA,EACA,EACQ,CACR,IAAMnB,EAAYyB,EAAW,KAAK,CAAE,SAAUxB,CAAG,EACjD,OAAO,OAAO,YACZ,OAAO,QAAQF,CAAK,CAAC,CAAC,KAAK,CAACE,EAAKyB,KAAW,CAC1C,GAAI,CAAC1B,EAAU,SAASC,CAAG,EACzB,MAAU,MACR,gBAAgBlB,EAAW,sBAAsBkB,EAAI,QAAQgB,EAAY,cAAc,CAAC,GAAGjB,EAAW,GAAG2B,CAAS,CAAC,CAAC,KAAK,IAAI,EAAE,GACjI,EAEF,GAAID,IAAU,OAAS,OAAOA,GAAU,UAAY,CAAC,OAAO,SAASA,CAAK,GAAKA,EAAQ,GACrF,MAAU,MAAM,gBAAgB3C,EAAW,MAAMkC,EAAY,GAAGhB,EAAI,yCAAyC,EAE/G,MAAO,CAACA,EAAKyB,GAAS,GAAQ,CAChC,CAAC,CACH,CACF,CAEA,SAASf,EAAc,EAAgB,EAAqB,EAA6C,CACvG,GAAI,CAACb,EAASC,CAAK,EACjB,MAAU,MAAM,gBAAgBhB,EAAW,MAAMkC,EAAY,qBAAqB,EAEpF,OAAOlB,CACT,CAEA,SAASG,EAA0B,EAAgB,EAAwC,CACzF,GAAI,CAACJ,EAASC,CAAK,EACjB,MAAU,MAAM,gBAAgBhB,EAAW,oCAAoC,EAEjF,IAAM6C,EAAkC,CAAC,EACzC,IAAK,GAAM,CAAC3B,EAAKQ,KAAY,OAAO,QAAQV,CAAK,EAC/C,GAAIE,IAAQ,YACV,EAAY,UAAYS,EAAuBD,EAAS,wBAAyB1B,CAAU,OACtF,GAAIkB,IAAQ,eAEjB,EAAY,aAAe4B,EAA0BpB,EAAS,2BAA4B1B,CAAU,OAC/F,GAAIkB,IAAQ,uBAAwB,CACzC,IAAMV,EAASmB,EAAuBD,EAAS,mCAAoC1B,CAAU,EAC7F,GAAIQ,EAAS,IACX,MAAU,MAAM,gBAAgBR,EAAW,iEAAiE,EAE9G,EAAY,qBAAuBQ,CACrC,MACE,MAAU,MACR,gBAAgBR,EAAW,sBAAsBkB,EAAI,gFACvD,EAGJ,OAAO2B,CACT,CAEA,SAASC,EAA0B,EAAgB,EAAa,EAA4B,CAC1F,OAAOC,EAAc/B,EAAOE,EAAKlB,EAAY,OAAO,cAAe,wBAAwB,CAC7F,CAEA,SAAS2B,EAAuB,EAAgB,EAAa,EAA4B,CACvF,IAAMnB,EAASuC,EAAc/B,EAAOE,EAAKlB,EAAY,OAAO,cAAe,oBAAoB,EAC/F,GAAIQ,EAAS,EACX,MAAU,MAAM,gBAAgBR,EAAW,MAAMkB,EAAI,8BAA8B,EAErF,OAAOV,CACT,CAGA,SAASuC,EACP,EACA,EACA,EACA,EACA,EACQ,CACR,GAAI,OAAO/B,GAAU,UAAY,CAACgC,EAAYhC,CAAK,GAAKA,EAAQ,EAC9D,MAAU,MAAM,gBAAgBhB,EAAW,MAAMkB,EAAI,YAAY+B,EAAY,EAAE,EAEjF,OAAOjC,CACT,CAEA,SAASO,EAAe,EAAgB,EAAa,EAA6B,CAChF,GAAI,OAAOP,GAAU,UACnB,MAAU,UAAU,gBAAgBhB,EAAW,MAAMkB,EAAI,qBAAqB,EAEhF,OAAOF,CACT"}

package/dist/crossFileDuplication.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"crossFileDuplication.cjs","names":["resolveDuplicationOptions","selectMaximalGroups","collectCrossFileNearMissGroups","buildLiteralCountPrefix","collectSequenceWindowCandidates","mergeAdjacentGroups","countRedundantFragments","collectMatchedLines"],"sources":["../src/crossFileDuplication.ts"],"sourcesContent":["import { collectCrossFileNearMissGroups } from './crossFileNearMiss.js';\nimport { selectMaximalGroups, type SelectableRegion } from './duplicateSelection.js';\nimport {\n  buildLiteralCountPrefix,\n  collectMatchedLines,\n  collectSequenceWindowCandidates,\n  countRedundantFragments,\n  mergeAdjacentGroups,\n  resolveDuplicationOptions,\n  type CountedOccurrence,\n  type CrossFileDuplicateCandidate,\n  type CrossFileDuplicationFileData,\n  type SequenceWindowContext,\n  type TokenSegment,\n} from './duplication.js';\nimport type { DuplicationOptions } from './types.js';\n\nexport interface CrossFileDuplicationSourceFile extends Partial<CrossFileDuplicationFileData> {\n  file: string;\n  candidates: CrossFileDuplicateCandidate[];\n}\n\nexport interface CrossFileDuplicateOccurrence {\n  endLine: number;\n  file: string;\n  /**\n   * The code lines carrying the occurrence's matched tokens (see\n   * DuplicateBlockOccurrence.lineNumbers). Absent for a file that supplied only candidates (no\n   * `tokens`), whose matched lines are unknowable.\n   */\n  lineNumbers?: number[];\n  startLine: number;\n  /**\n   * The tokens of its matched runs, or of a near-miss block or its matched cores with the edited\n   * tokens among them; the group's `tokenCount` is the smallest of its occurrences'.\n   */\n  tokenCount: number;\n}\n\nexport interface CrossFileDuplicateBlockGroup {\n  files: string[];\n  occurrences: CrossFileDuplicateOccurrence[];\n  /**\n   * Token count of the smallest occurrence. For exact and gapped groups it is the matched token\n   * count every occurrence shares (gaps are not counted); for near-miss (Type-3) groups it is the\n   * token count of the smallest whole block or set of matched cores, edited tokens included.\n   */\n  tokenCount: number;\n}\n\nexport interface CrossFileDuplicationMetrics {\n  /** Number of redundant copies across all groups, counted per matched fragment like within-file. */\n  duplicateBlockCount: number;\n  /** Groups the file participates in, keyed by the file name passed in. */\n  duplicateBlockGroupCountByFile: Record<string, number>;\n  /**\n   * Per file, the 1-based code lines covered by the tokens of its cross-file occurrences, sorted\n   * ascending: the matched tokens of exact and gapped occurrences, and the lines of a near-miss\n   * block or its matched cores more than half of whose tokens its partners match or which a part of it\n   * matched exactly reaches (like within-file near-miss coverage). The unmatched gap of a merged\n   * clone and comment/blank lines inside an occurrence's bounding range are excluded (blank rows\n   * inside multi-row tokens only when the file supplied codeLineNumbers). A file that supplied\n   * only candidates (no `tokens`) has no entry — without its token stream the covered lines are\n   * unknowable, and an approximate bounding range would break this field's exactness.\n   */\n  duplicateLineNumbersByFile: Record<string, number[]>;\n  groups: CrossFileDuplicateBlockGroup[];\n}\n\ninterface SelectableCandidate extends CrossFileDuplicateCandidate, SelectableRegion {\n  regionBucket: number;\n  file: string;\n}\n\n/** A cross-file occurrence: a within-file occurrence in the project-wide token index space. */\ninterface CrossFileOccurrence extends CountedOccurrence {\n  file: string;\n  fileIndex: number;\n}\n\n/**\n * Detects code regions duplicated across files. Per-file candidates (whole block subtrees and full\n * container runs, fingerprinted with the same normalization as within-file duplication) are joined\n * by a project-level window index over per-statement fingerprint sequences (CPD-style), so a\n * copy-pasted partial statement run embedded in different surrounding code is matched even though\n * no single file can know it repeats elsewhere. Candidates are grouped by fingerprint, and only\n * maximal, non-overlapping regions whose group spans at least two files are counted. Groups that\n * shrink to a single file during selection are shed — a within-file repeat is already reported by\n * that file's own duplication metrics. A copy nested inside a larger group's region (two files share\n * a whole function, a third file only a block of it) is reported with its group, so the third\n * file's copy still shows what it duplicates. Groups separated by a small token gap within each file then\n * merge into gapped (Type-3) clone groups under `maxGapTokens`, exactly like within-file merging.\n * Finally, blocks of files that supplied `nearMissBlocks` are compared across files for near-miss\n * (Type-3) clones under `minSimilarityPercent` (see crossFileNearMiss.ts).\n */\nexport function measureCrossFileDuplication(\n  files: CrossFileDuplicationSourceFile[],\n  options?: DuplicationOptions\n): CrossFileDuplicationMetrics {\n  const { minTokens, maxGapTokens, minSimilarityPercent } = resolveDuplicationOptions(options);\n  const candidates: SelectableCandidate[] = files.flatMap(({ file, candidates }, fileIndex) =>\n    candidates.map((candidate) => ({ ...candidate, regionBucket: fileIndex, file }))\n  );\n  // Pushed one by one: spreading the project-scale window-candidate array as call arguments\n  // overflows V8's argument limit (~124k) and crashes on Node, though Bun/JSC tolerates it.\n  for (const candidate of collectWindowCandidates(files, minTokens)) {\n    candidates.push(candidate);\n  }\n  const counted = selectMaximalGroups(\n    candidates,\n    spansMultipleFiles,\n    // File index and position break coverage ties deterministically.\n    (left, right) => left.regionBucket - right.regionBucket || left.startIndex - right.startIndex\n  );\n  const tokenOffsets = computeTokenOffsets(files, maxGapTokens);\n  const exactGroups = mergeGapAdjacentGroups([...counted.values()], tokenOffsets, maxGapTokens);\n  const nearMissGroups = collectNearMissGroups(files, exactGroups, tokenOffsets, minTokens, minSimilarityPercent);\n  return summarize(takeOverExactGroups(exactGroups, nearMissGroups, minTokens), files, tokenOffsets);\n}\n\n/**\n * Lets a near-miss group take over the exact groups standing for the same copies, as within a\n * file (collect_near_miss_groups in native/src/duplication.rs): every occurrence of such a group\n * overlaps exactly one copy of the near-miss group (one overlapping none reports content the copies\n * do not share, and one reaching into two would make one copy take over lines of the next), exceeds\n * its span by less than `minTokens` (a copy is listed at the size it matched, not at that of a\n * clone larger by a reportable part, which may run into code no copy matched), and no two overlap\n * the same copy (those repeat within the copy, not between the copies).\n * Each copy then becomes one occurrence with the exact fragments it holds, so the copies are\n * listed once.\n */\nfunction takeOverExactGroups(\n  exactGroups: CrossFileOccurrence[][],\n  nearMissGroups: CrossFileOccurrence[][],\n  minTokens: number\n): CrossFileOccurrence[][] {\n  const exactGroupIndexesByFile = new Map<number, Set<number>>();\n  for (const [groupIndex, group] of exactGroups.entries()) {\n    for (const { fileIndex } of group) {\n      const indexes = exactGroupIndexesByFile.get(fileIndex) ?? new Set();\n      indexes.add(groupIndex);\n      exactGroupIndexesByFile.set(fileIndex, indexes);\n    }\n  }\n  const taken = new Set<number>();\n  const coalesced = new Set<CrossFileOccurrence>();\n  const merged = nearMissGroups.map((copies) => {\n    const copyOf = (occurrence: CrossFileOccurrence): CrossFileOccurrence | undefined => {\n      const overlapped = copies.filter((copy) =>\n        copy.segments.some((segment) => occurrence.segments.some((matched) => overlap(matched, segment)))\n      );\n      const [copy] = overlapped;\n      if (overlapped.length !== 1 || !copy) {\n        return undefined;\n      }\n      const excess =\n        Math.max(0, copy.startTokenIndex - occurrence.startTokenIndex) +\n        Math.max(0, occurrence.endTokenIndex - copy.endTokenIndex);\n      return excess < minTokens ? copy : undefined;\n    };\n    const fragmentsByCopy = new Map<CrossFileOccurrence, CrossFileOccurrence[]>();\n    const candidateIndexes = new Set<number>();\n    for (const copy of copies) {\n      for (const groupIndex of copy.spanCountedElsewhere ? (exactGroupIndexesByFile.get(copy.fileIndex) ?? []) : []) {\n        candidateIndexes.add(groupIndex);\n      }\n    }\n    for (const groupIndex of [...candidateIndexes].toSorted((left, right) => left - right)) {\n      const group = exactGroups[groupIndex] ?? [];\n      const owners = group.map(copyOf);\n      if (taken.has(groupIndex) || owners.includes(undefined) || new Set(owners).size !== owners.length) {\n        continue;\n      }\n      taken.add(groupIndex);\n      for (const [index, owner] of owners.entries()) {\n        const fragment = group[index];\n        if (owner && fragment) {\n          const fragments = fragmentsByCopy.get(owner) ?? [];\n          fragments.push(fragment);\n          fragmentsByCopy.set(owner, fragments);\n        }\n      }\n    }\n    return copies.map((copy): CrossFileOccurrence => {\n      const fragments = fragmentsByCopy.get(copy);\n      if (!fragments) {\n        return copy;\n      }\n      const whole = coalesceOccurrences([copy, ...fragments]);\n      coalesced.add(whole);\n      return whole;\n    });\n  });\n  // A copy that took its fragments over counts them itself, unless a group left in place still\n  // counts all of it: a larger clone whose matched segments enclose those of the copy, which its\n  // fragments were nested in. A smaller run left in place inside the copy counts its own repeats,\n  // not the copy.\n  for (const copy of coalesced) {\n    for (const groupIndex of exactGroupIndexesByFile.get(copy.fileIndex) ?? []) {\n      const enclosed =\n        !taken.has(groupIndex) &&\n        exactGroups[groupIndex]?.some(\n          (occurrence) =>\n            !occurrence.spanCountedElsewhere &&\n            copy.segments.every((segment) =>\n              occurrence.segments.some(\n                (matched) =>\n                  matched.startTokenIndex <= segment.startTokenIndex && segment.endTokenIndex <= matched.endTokenIndex\n              )\n            )\n        );\n      if (enclosed) {\n        copy.spanCountedElsewhere = true;\n        break;\n      }\n    }\n  }\n  return [...exactGroups.filter((_, groupIndex) => !taken.has(groupIndex)), ...merged];\n}\n\nfunction overlap(left: TokenSegment, right: TokenSegment): boolean {\n  return left.startTokenIndex < right.endTokenIndex && right.startTokenIndex < left.endTokenIndex;\n}\n\n/** The parts of one copy as one occurrence: an exact part is matched throughout, a near-miss part where its partners match it. */\nfunction coalesceOccurrences(parts: [CrossFileOccurrence, ...CrossFileOccurrence[]]): CrossFileOccurrence {\n  const segments = mergeSegments(parts.flatMap((part) => part.segments));\n  return {\n    ...parts[0],\n    spanCountedElsewhere: undefined,\n    nestedInLargerGroup: undefined,\n    segments,\n    matchedRuns: mergeSegments(parts.flatMap((part) => part.matchedRuns ?? part.segments)),\n    exactSegments: mergeSegments(\n      parts.flatMap((part) => (part.matchedRuns ? (part.exactSegments ?? []) : part.segments))\n    ),\n    tokenCount: segments.reduce((sum, segment) => sum + segment.endTokenIndex - segment.startTokenIndex, 0),\n    startTokenIndex: Math.min(...parts.map((part) => part.startTokenIndex)),\n    endTokenIndex: Math.max(...parts.map((part) => part.endTokenIndex)),\n    startIndex: Math.min(...parts.map((part) => part.startIndex)),\n    endIndex: Math.max(...parts.map((part) => part.endIndex)),\n    startLine: Math.min(...parts.map((part) => part.startLine)),\n    endLine: Math.max(...parts.map((part) => part.endLine)),\n  };\n}\n\n/** The unions of overlapping segments, in position order. */\nfunction mergeSegments(segments: TokenSegment[]): TokenSegment[] {\n  const merged: TokenSegment[] = [];\n  for (const segment of segments.toSorted((left, right) => left.startTokenIndex - right.startTokenIndex)) {\n    const last = merged.at(-1);\n    if (last && segment.startTokenIndex < last.endTokenIndex) {\n      last.endTokenIndex = Math.max(last.endTokenIndex, segment.endTokenIndex);\n    } else {\n      merged.push({ ...segment });\n    }\n  }\n  return merged;\n}\n\n/** Near-miss groups among the blocks the exact groups leave unreported, in the project token space. */\nfunction collectNearMissGroups(\n  files: CrossFileDuplicationSourceFile[],\n  exactGroups: CrossFileOccurrence[][],\n  tokenOffsets: number[],\n  minTokens: number,\n  minSimilarityPercent: number\n): CrossFileOccurrence[][] {\n  // Segment by segment: the gap of a gapped clone is not reported content.\n  const spansByFile = (groups: CrossFileOccurrence[][]): TokenSegment[][] => {\n    const spans: TokenSegment[][] = files.map(() => []);\n    for (const { fileIndex, segments } of groups.flat()) {\n      const offset = tokenOffsets[fileIndex] ?? 0;\n      for (const segment of segments) {\n        spans[fileIndex]?.push(shift(segment, -offset));\n      }\n    }\n    return spans;\n  };\n  return collectCrossFileNearMissGroups(\n    files,\n    spansByFile(exactGroups),\n    spansByFile(exactGroups.filter((group) => !group.some((occurrence) => occurrence.nestedInLargerGroup))),\n    minTokens,\n    minSimilarityPercent\n  ).map((group) =>\n    group.map((occurrence) => {\n      const offset = tokenOffsets[occurrence.fileIndex] ?? 0;\n      return {\n        ...occurrence,\n        file: files[occurrence.fileIndex]?.file ?? '',\n        segments: occurrence.segments.map((segment) => shift(segment, offset)),\n        matchedRuns: occurrence.matchedRuns?.map((run) => shift(run, offset)),\n        startTokenIndex: occurrence.startTokenIndex + offset,\n        endTokenIndex: occurrence.endTokenIndex + offset,\n      };\n    })\n  );\n}\n\nfunction shift({ startTokenIndex, endTokenIndex }: TokenSegment, offset: number): TokenSegment {\n  return { startTokenIndex: startTokenIndex + offset, endTokenIndex: endTokenIndex + offset };\n}\n\n/** Repeated sub-windows of sibling statements matched across the whole project's files. */\nfunction collectWindowCandidates(files: CrossFileDuplicationSourceFile[], minTokens: number): SelectableCandidate[] {\n  const fileIndexByContext: number[] = [];\n  const contexts: SequenceWindowContext[] = [];\n  for (const [fileIndex, { tokens, containerStatements }] of files.entries()) {\n    if (tokens && containerStatements) {\n      fileIndexByContext.push(fileIndex);\n      contexts.push({ tokens, literalCountPrefix: buildLiteralCountPrefix(tokens), containers: containerStatements });\n    }\n  }\n  if (contexts.length < 2) {\n    return [];\n  }\n  return collectSequenceWindowCandidates(contexts, minTokens, true).flatMap(({ candidate, contextIndex }) => {\n    const fileIndex = fileIndexByContext[contextIndex];\n    const file = fileIndex === undefined ? undefined : files[fileIndex];\n    return fileIndex === undefined || file === undefined\n      ? []\n      : [{ ...candidate, regionBucket: fileIndex, file: file.file }];\n  });\n}\n\n/** A merged group is reported only while it still covers more than one file. */\nfunction spansMultipleFilesAfterMerge(group: CrossFileOccurrence[]): boolean {\n  return new Set(group.map((occurrence) => occurrence.file)).size >= 2;\n}\n\nfunction spansMultipleFiles(group: SelectableCandidate[]): boolean {\n  return group.length >= 2 && new Set(group.map((candidate) => candidate.regionBucket)).size >= 2;\n}\n\n/**\n * Per-file token offsets that map every file into one project-wide token index space: each file's\n * tokens are offset by more than `maxGapTokens` past the previous file's, so occurrences in\n * different files are never gap-adjacent and merged pairs always stay within one file.\n */\nfunction computeTokenOffsets(files: CrossFileDuplicationSourceFile[], maxGapTokens: number): number[] {\n  const tokenOffsets: number[] = [];\n  let offset = 0;\n  for (const { tokens, candidates } of files) {\n    tokenOffsets.push(offset);\n    // Accumulated in a loop: spreading a project-scale candidate array as call arguments would\n    // overflow V8's argument limit (~124k) and crash on Node.\n    let tokenCount = tokens?.length ?? 0;\n    if (!tokens) {\n      for (const candidate of candidates) {\n        tokenCount = Math.max(tokenCount, candidate.endTokenIndex);\n      }\n    }\n    offset += tokenCount + maxGapTokens + 1;\n  }\n  return tokenOffsets;\n}\n\n/** Reuses the within-file gapped (Type-3) merging in the project-wide token index space. */\nfunction mergeGapAdjacentGroups(\n  groups: SelectableCandidate[][],\n  tokenOffsets: number[],\n  maxGapTokens: number\n): CrossFileOccurrence[][] {\n  const occurrenceGroups = groups.map((group) =>\n    group\n      .map((candidate): CrossFileOccurrence => {\n        const start = candidate.startTokenIndex + (tokenOffsets[candidate.regionBucket] ?? 0);\n        const end = candidate.endTokenIndex + (tokenOffsets[candidate.regionBucket] ?? 0);\n        return {\n          file: candidate.file,\n          fileIndex: candidate.regionBucket,\n          spanCountedElsewhere: candidate.nestedInLargerGroup,\n          nestedInLargerGroup: candidate.nestedInLargerGroup,\n          segments: [{ startTokenIndex: start, endTokenIndex: end }],\n          tokenCount: candidate.tokenCount,\n          startTokenIndex: start,\n          endTokenIndex: end,\n          startIndex: candidate.startIndex,\n          endIndex: candidate.endIndex,\n          startLine: candidate.startLine,\n          endLine: candidate.endLine,\n        };\n      })\n      .toSorted((left, right) => left.startTokenIndex - right.startTokenIndex)\n  );\n  return mergeAdjacentGroups(occurrenceGroups, maxGapTokens, spansMultipleFilesAfterMerge);\n}\n\nfunction summarize(\n  groups: CrossFileOccurrence[][],\n  files: CrossFileDuplicationSourceFile[],\n  tokenOffsets: number[]\n): CrossFileDuplicationMetrics {\n  const reported: CrossFileDuplicateBlockGroup[] = [];\n  // Accumulated in Maps: file names are arbitrary strings, and a plain object would read\n  // inherited properties for names like \"constructor\".\n  const groupCountByFile = new Map<string, number>();\n  const fileDataByName = new Map(\n    files.map((file, index) => [\n      file.file,\n      { tokens: file.tokens, codeLineNumbers: file.codeLineNumbers, offset: tokenOffsets[index] ?? 0 },\n    ])\n  );\n  const lineNumbersByFile = new Map<string, Set<number>>();\n  let duplicateBlockCount = 0;\n  for (const group of groups) {\n    // Mirrors within-file counting: each redundant occurrence contributes one count per matched\n    // fragment, gapped merging consolidates the grouping without halving the count, and spans a\n    // partial merge shares between a retained group and the merged group count once.\n    duplicateBlockCount += countRedundantFragments(group);\n    const occurrences = group\n      .map((occurrence) => {\n        const { file, startLine, endLine, tokenCount } = occurrence;\n        const lineNumbers = collectOccurrenceLines(occurrence, fileDataByName, lineNumbersByFile);\n        return { file, startLine, endLine, ...(lineNumbers && { lineNumbers }), tokenCount };\n      })\n      .toSorted((left, right) => left.file.localeCompare(right.file) || left.startLine - right.startLine);\n    const files = [...new Set(occurrences.map(({ file }) => file))];\n    for (const file of files) {\n      groupCountByFile.set(file, (groupCountByFile.get(file) ?? 0) + 1);\n    }\n    reported.push({ files, occurrences, tokenCount: Math.min(...group.map(({ tokenCount }) => tokenCount)) });\n  }\n  reported.sort(\n    (left, right) =>\n      right.tokenCount - left.tokenCount ||\n      (left.occurrences[0]?.file ?? '').localeCompare(right.occurrences[0]?.file ?? '') ||\n      (left.occurrences[0]?.startLine ?? 0) - (right.occurrences[0]?.startLine ?? 0)\n  );\n  return {\n    duplicateBlockCount,\n    duplicateBlockGroupCountByFile: Object.fromEntries(groupCountByFile),\n    duplicateLineNumbersByFile: Object.fromEntries(\n      [...lineNumbersByFile].map(([file, lines]) => [file, [...lines].toSorted((left, right) => left - right)])\n    ),\n    groups: reported,\n  };\n}\n\n/**\n * Adds the code lines an occurrence's matched tokens cover (see collectMatchedLines) to its file's\n * line set, mapping the project-wide token segments back into the file's own token stream, and\n * returns them in order.\n * A file that supplied only candidates (no token stream) is skipped rather than approximated from\n * the bounding line range, which would include gap and comment/blank lines and break the field's\n * exactness contract.\n */\nfunction collectOccurrenceLines(\n  occurrence: CrossFileOccurrence,\n  fileDataByName: Map<\n    string,\n    { tokens?: CrossFileDuplicationSourceFile['tokens']; codeLineNumbers?: Set<number>; offset: number }\n  >,\n  lineNumbersByFile: Map<string, Set<number>>\n): number[] | undefined {\n  const fileData = fileDataByName.get(occurrence.file);\n  if (!fileData?.tokens) {\n    return undefined;\n  }\n  let fileLines = lineNumbersByFile.get(occurrence.file);\n  if (!fileLines) {\n    fileLines = new Set();\n    lineNumbersByFile.set(occurrence.file, fileLines);\n  }\n  const lines = collectMatchedLines(\n    occurrence.segments.map((segment) => shift(segment, -fileData.offset)),\n    occurrence.matchedRuns?.map((run) => shift(run, -fileData.offset)),\n    fileData.tokens,\n    fileData.codeLineNumbers,\n    occurrence.exactSegments?.map((segment) => shift(segment, -fileData.offset))\n  );\n  for (const line of lines) {\n    fileLines.add(line);\n  }\n  return [...lines].toSorted((left, right) => left - right);\n}\n"],"mappings":"6HA+FA,SAAgB,EACd,EACA,EAC6B,CAC7B,GAAM,CAAE,YAAW,eAAc,wBAAyBA,EAAAA,0BAA0B,CAAO,EACrF,EAAoC,EAAM,SAAS,CAAE,OAAM,cAAc,IAC7E,EAAW,IAAK,IAAe,CAAE,GAAG,EAAW,aAAc,EAAW,MAAK,EAAE,CACjF,EAGA,IAAK,IAAM,KAAa,EAAwB,EAAO,CAAS,EAC9D,EAAW,KAAK,CAAS,EAE3B,IAAM,EAAUC,EAAAA,oBACd,EACA,GAEC,EAAM,IAAU,EAAK,aAAe,EAAM,cAAgB,EAAK,WAAa,EAAM,UACrF,EACM,EAAe,EAAoB,EAAO,CAAY,EACtD,EAAc,EAAuB,CAAC,GAAG,EAAQ,OAAO,CAAC,EAAG,EAAc,CAAY,EAE5F,OAAO,EAAU,EAAoB,EADd,EAAsB,EAAO,EAAa,EAAc,EAAW,CAC3B,EAAG,CAAS,EAAG,EAAO,CAAY,CACnG,CAaA,SAAS,EACP,EACA,EACA,EACyB,CACzB,IAAM,kBAA0B,IAAI,IACpC,IAAK,GAAM,CAAC,EAAY,KAAU,EAAY,QAAQ,EACpD,IAAK,GAAM,CAAE,eAAe,EAAO,CACjC,IAAM,EAAU,EAAwB,IAAI,CAAS,mBAAK,IAAI,IAC9D,EAAQ,IAAI,CAAU,EACtB,EAAwB,IAAI,EAAW,CAAO,CAChD,CAEF,IAAM,kBAAQ,IAAI,IACZ,kBAAY,IAAI,IAChB,EAAS,EAAe,IAAK,GAAW,CAC5C,IAAM,EAAU,GAAqE,CACnF,IAAM,EAAa,EAAO,OAAQ,GAChC,EAAK,SAAS,KAAM,GAAY,EAAW,SAAS,KAAM,GAAY,EAAQ,EAAS,CAAO,CAAC,CAAC,CAClG,EACM,CAAC,GAAQ,EACX,KAAW,SAAW,GAAM,EAMhC,OAFE,KAAK,IAAI,EAAG,EAAK,gBAAkB,EAAW,eAAe,EAC7D,KAAK,IAAI,EAAG,EAAW,cAAgB,EAAK,aAAa,EAC3C,EAAY,EAAO,IAAA,EACrC,EACM,kBAAkB,IAAI,IACtB,kBAAmB,IAAI,IAC7B,IAAK,IAAM,KAAQ,EACjB,IAAK,IAAM,KAAc,EAAK,qBAAwB,EAAwB,IAAI,EAAK,SAAS,GAAK,CAAC,EAAK,CAAC,EAC1G,EAAiB,IAAI,CAAU,EAGnC,IAAK,IAAM,IAAc,CAAC,GAAG,CAAgB,CAAC,CAAC,UAAU,EAAM,IAAU,EAAO,CAAK,EAAG,CACtF,IAAM,EAAQ,EAAY,IAAe,CAAC,EACpC,EAAS,EAAM,IAAI,CAAM,EAC3B,OAAM,IAAI,CAAU,GAAK,EAAO,SAAS,IAAA,EAAS,GAAK,IAAI,IAAI,CAAM,CAAC,CAAC,OAAS,EAAO,QAG3F,GAAM,IAAI,CAAU,EACpB,IAAK,GAAM,CAAC,EAAO,KAAU,EAAO,QAAQ,EAAG,CAC7C,IAAM,EAAW,EAAM,GACvB,GAAI,GAAS,EAAU,CACrB,IAAM,EAAY,EAAgB,IAAI,CAAK,GAAK,CAAC,EACjD,EAAU,KAAK,CAAQ,EACvB,EAAgB,IAAI,EAAO,CAAS,CACtC,CACF,CARoB,CAStB,CACA,OAAO,EAAO,IAAK,GAA8B,CAC/C,IAAM,EAAY,EAAgB,IAAI,CAAI,EAC1C,GAAI,CAAC,EACH,OAAO,EAET,IAAM,EAAQ,EAAoB,CAAC,EAAM,GAAG,CAAS,CAAC,EAEtD,OADA,EAAU,IAAI,CAAK,EACZ,CACT,CAAC,CACH,CAAC,EAKD,IAAK,IAAM,KAAQ,EACjB,IAAK,IAAM,KAAc,EAAwB,IAAI,EAAK,SAAS,GAAK,CAAC,EAavE,GAXE,CAAC,EAAM,IAAI,CAAU,GACrB,EAAY,EAAW,EAAE,KACtB,GACC,CAAC,EAAW,sBACZ,EAAK,SAAS,MAAO,GACnB,EAAW,SAAS,KACjB,GACC,EAAQ,iBAAmB,EAAQ,iBAAmB,EAAQ,eAAiB,EAAQ,aAC3F,CACF,CACJ,EACY,CACZ,EAAK,qBAAuB,GAC5B,KACF,CAGJ,MAAO,CAAC,GAAG,EAAY,QAAQ,EAAG,IAAe,CAAC,EAAM,IAAI,CAAU,CAAC,EAAG,GAAG,CAAM,CACrF,CAEA,SAAS,EAAQ,EAAoB,EAA8B,CACjE,OAAO,EAAK,gBAAkB,EAAM,eAAiB,EAAM,gBAAkB,EAAK,aACpF,CAGA,SAAS,EAAoB,EAA6E,CACxG,IAAM,EAAW,EAAc,EAAM,QAAS,GAAS,EAAK,QAAQ,CAAC,EACrE,MAAO,CACL,GAAG,EAAM,GACT,qBAAsB,IAAA,GACtB,oBAAqB,IAAA,GACrB,WACA,YAAa,EAAc,EAAM,QAAS,GAAS,EAAK,aAAe,EAAK,QAAQ,CAAC,EACrF,cAAe,EACb,EAAM,QAAS,GAAU,EAAK,YAAe,EAAK,eAAiB,CAAC,EAAK,EAAK,QAAS,CACzF,EACA,WAAY,EAAS,QAAQ,EAAK,IAAY,EAAM,EAAQ,cAAgB,EAAQ,gBAAiB,CAAC,EACtG,gBAAiB,KAAK,IAAI,GAAG,EAAM,IAAK,GAAS,EAAK,eAAe,CAAC,EACtE,cAAe,KAAK,IAAI,GAAG,EAAM,IAAK,GAAS,EAAK,aAAa,CAAC,EAClE,WAAY,KAAK,IAAI,GAAG,EAAM,IAAK,GAAS,EAAK,UAAU,CAAC,EAC5D,SAAU,KAAK,IAAI,GAAG,EAAM,IAAK,GAAS,EAAK,QAAQ,CAAC,EACxD,UAAW,KAAK,IAAI,GAAG,EAAM,IAAK,GAAS,EAAK,SAAS,CAAC,EAC1D,QAAS,KAAK,IAAI,GAAG,EAAM,IAAK,GAAS,EAAK,OAAO,CAAC,CACxD,CACF,CAGA,SAAS,EAAc,EAA0C,CAC/D,IAAM,EAAyB,CAAC,EAChC,IAAK,IAAM,KAAW,EAAS,UAAU,EAAM,IAAU,EAAK,gBAAkB,EAAM,eAAe,EAAG,CACtG,IAAM,EAAO,EAAO,GAAG,EAAE,EACrB,GAAQ,EAAQ,gBAAkB,EAAK,cACzC,EAAK,cAAgB,KAAK,IAAI,EAAK,cAAe,EAAQ,aAAa,EAEvE,EAAO,KAAK,CAAE,GAAG,CAAQ,CAAC,CAE9B,CACA,OAAO,CACT,CAGA,SAAS,EACP,EACA,EACA,EACA,EACA,EACyB,CAEzB,IAAM,EAAe,GAAsD,CACzE,IAAM,EAA0B,EAAM,QAAU,CAAC,CAAC,EAClD,IAAK,GAAM,CAAE,YAAW,cAAc,EAAO,KAAK,EAAG,CACnD,IAAM,EAAS,EAAa,IAAc,EAC1C,IAAK,IAAM,KAAW,EACpB,EAAM,EAAU,EAAE,KAAK,EAAM,EAAS,CAAC,CAAM,CAAC,CAElD,CACA,OAAO,CACT,EACA,OAAOC,EAAAA,+BACL,EACA,EAAY,CAAW,EACvB,EAAY,EAAY,OAAQ,GAAU,CAAC,EAAM,KAAM,GAAe,EAAW,mBAAmB,CAAC,CAAC,EACtG,EACA,CACF,CAAC,CAAC,IAAK,GACL,EAAM,IAAK,GAAe,CACxB,IAAM,EAAS,EAAa,EAAW,YAAc,EACrD,MAAO,CACL,GAAG,EACH,KAAM,EAAM,EAAW,UAAU,EAAE,MAAQ,GAC3C,SAAU,EAAW,SAAS,IAAK,GAAY,EAAM,EAAS,CAAM,CAAC,EACrE,YAAa,EAAW,aAAa,IAAK,GAAQ,EAAM,EAAK,CAAM,CAAC,EACpE,gBAAiB,EAAW,gBAAkB,EAC9C,cAAe,EAAW,cAAgB,CAC5C,CACF,CAAC,CACH,CACF,CAEA,SAAS,EAAM,CAAE,kBAAiB,iBAA+B,EAA8B,CAC7F,MAAO,CAAE,gBAAiB,EAAkB,EAAQ,cAAe,EAAgB,CAAO,CAC5F,CAGA,SAAS,EAAwB,EAAyC,EAA0C,CAClH,IAAM,EAA+B,CAAC,EAChC,EAAoC,CAAC,EAC3C,IAAK,GAAM,CAAC,EAAW,CAAE,SAAQ,0BAA0B,EAAM,QAAQ,EACnE,GAAU,IACZ,EAAmB,KAAK,CAAS,EACjC,EAAS,KAAK,CAAE,SAAQ,mBAAoBC,EAAAA,wBAAwB,CAAM,EAAG,WAAY,CAAoB,CAAC,GAMlH,OAHI,EAAS,OAAS,EACb,CAAC,EAEHC,EAAAA,gCAAgC,EAAU,EAAW,EAAI,CAAC,CAAC,SAAS,CAAE,YAAW,kBAAmB,CACzG,IAAM,EAAY,EAAmB,GAC/B,EAAO,IAAc,IAAA,GAAY,IAAA,GAAY,EAAM,GACzD,OAAO,IAAc,IAAA,IAAa,IAAS,IAAA,GACvC,CAAC,EACD,CAAC,CAAE,GAAG,EAAW,aAAc,EAAW,KAAM,EAAK,IAAK,CAAC,CACjE,CAAC,CACH,CAGA,SAAS,EAA6B,EAAuC,CAC3E,OAAO,IAAI,IAAI,EAAM,IAAK,GAAe,EAAW,IAAI,CAAC,CAAC,CAAC,MAAQ,CACrE,CAEA,SAAS,EAAmB,EAAuC,CACjE,OAAO,EAAM,QAAU,GAAK,IAAI,IAAI,EAAM,IAAK,GAAc,EAAU,YAAY,CAAC,CAAC,CAAC,MAAQ,CAChG,CAOA,SAAS,EAAoB,EAAyC,EAAgC,CACpG,IAAM,EAAyB,CAAC,EAC5B,EAAS,EACb,IAAK,GAAM,CAAE,SAAQ,gBAAgB,EAAO,CAC1C,EAAa,KAAK,CAAM,EAGxB,IAAI,EAAa,GAAQ,QAAU,EACnC,GAAI,CAAC,EACH,IAAK,IAAM,KAAa,EACtB,EAAa,KAAK,IAAI,EAAY,EAAU,aAAa,EAG7D,GAAU,EAAa,EAAe,CACxC,CACA,OAAO,CACT,CAGA,SAAS,EACP,EACA,EACA,EACyB,CACzB,IAAM,EAAmB,EAAO,IAAK,GACnC,EACG,IAAK,GAAmC,CACvC,IAAM,EAAQ,EAAU,iBAAmB,EAAa,EAAU,eAAiB,GAC7E,EAAM,EAAU,eAAiB,EAAa,EAAU,eAAiB,GAC/E,MAAO,CACL,KAAM,EAAU,KAChB,UAAW,EAAU,aACrB,qBAAsB,EAAU,oBAChC,oBAAqB,EAAU,oBAC/B,SAAU,CAAC,CAAE,gBAAiB,EAAO,cAAe,CAAI,CAAC,EACzD,WAAY,EAAU,WACtB,gBAAiB,EACjB,cAAe,EACf,WAAY,EAAU,WACtB,SAAU,EAAU,SACpB,UAAW,EAAU,UACrB,QAAS,EAAU,OACrB,CACF,CAAC,CAAC,CACD,UAAU,EAAM,IAAU,EAAK,gBAAkB,EAAM,eAAe,CAC3E,EACA,OAAOC,EAAAA,oBAAoB,EAAkB,EAAc,CAA4B,CACzF,CAEA,SAAS,EACP,EACA,EACA,EAC6B,CAC7B,IAAM,EAA2C,CAAC,EAG5C,kBAAmB,IAAI,IACvB,EAAiB,IAAI,IACzB,EAAM,KAAK,EAAM,IAAU,CACzB,EAAK,KACL,CAAE,OAAQ,EAAK,OAAQ,gBAAiB,EAAK,gBAAiB,OAAQ,EAAa,IAAU,CAAE,CACjG,CAAC,CACH,EACM,kBAAoB,IAAI,IAC1B,EAAsB,EAC1B,IAAK,IAAM,KAAS,EAAQ,CAI1B,GAAuBC,EAAAA,wBAAwB,CAAK,EACpD,IAAM,EAAc,EACjB,IAAK,GAAe,CACnB,GAAM,CAAE,OAAM,YAAW,UAAS,cAAe,EAC3C,EAAc,EAAuB,EAAY,EAAgB,CAAiB,EACxF,MAAO,CAAE,OAAM,YAAW,UAAS,GAAI,GAAe,CAAE,aAAY,EAAI,YAAW,CACrF,CAAC,CAAC,CACD,UAAU,EAAM,IAAU,EAAK,KAAK,cAAc,EAAM,IAAI,GAAK,EAAK,UAAY,EAAM,SAAS,EAC9F,EAAQ,CAAC,GAAG,IAAI,IAAI,EAAY,KAAK,CAAE,UAAW,CAAI,CAAC,CAAC,EAC9D,IAAK,IAAM,KAAQ,EACjB,EAAiB,IAAI,GAAO,EAAiB,IAAI,CAAI,GAAK,GAAK,CAAC,EAElE,EAAS,KAAK,CAAE,QAAO,cAAa,WAAY,KAAK,IAAI,GAAG,EAAM,KAAK,CAAE,gBAAiB,CAAU,CAAC,CAAE,CAAC,CAC1G,CAOA,OANA,EAAS,MACN,EAAM,IACL,EAAM,WAAa,EAAK,aACvB,EAAK,YAAY,EAAE,EAAE,MAAQ,GAAA,CAAI,cAAc,EAAM,YAAY,EAAE,EAAE,MAAQ,EAAE,IAC/E,EAAK,YAAY,EAAE,EAAE,WAAa,IAAM,EAAM,YAAY,EAAE,EAAE,WAAa,EAChF,EACO,CACL,sBACA,+BAAgC,OAAO,YAAY,CAAgB,EACnE,2BAA4B,OAAO,YACjC,CAAC,GAAG,CAAiB,CAAC,CAAC,KAAK,CAAC,EAAM,KAAW,CAAC,EAAM,CAAC,GAAG,CAAK,CAAC,CAAC,UAAU,EAAM,IAAU,EAAO,CAAK,CAAC,CAAC,CAC1G,EACA,OAAQ,CACV,CACF,CAUA,SAAS,EACP,EACA,EAIA,EACsB,CACtB,IAAM,EAAW,EAAe,IAAI,EAAW,IAAI,EACnD,GAAI,CAAC,GAAU,OACb,OAEF,IAAI,EAAY,EAAkB,IAAI,EAAW,IAAI,EAChD,IACH,kBAAY,IAAI,IAChB,EAAkB,IAAI,EAAW,KAAM,CAAS,GAElD,IAAM,EAAQC,EAAAA,oBACZ,EAAW,SAAS,IAAK,GAAY,EAAM,EAAS,CAAC,EAAS,MAAM,CAAC,EACrE,EAAW,aAAa,IAAK,GAAQ,EAAM,EAAK,CAAC,EAAS,MAAM,CAAC,EACjE,EAAS,OACT,EAAS,gBACT,EAAW,eAAe,IAAK,GAAY,EAAM,EAAS,CAAC,EAAS,MAAM,CAAC,CAC7E,EACA,IAAK,IAAM,KAAQ,EACjB,EAAU,IAAI,CAAI,EAEpB,MAAO,CAAC,GAAG,CAAK,CAAC,CAAC,UAAU,EAAM,IAAU,EAAO,CAAK,CAC1D"}
+{"version":3,"file":"crossFileDuplication.cjs","names":["resolveDuplicationOptions","selectMaximalGroups","collectCrossFileNearMissGroups","buildLiteralCountPrefix","collectSequenceWindowCandidates","mergeAdjacentGroups","countRedundantFragments","collectMatchedLines","require_duplication","require_crossFileNearMiss","require_duplicateSelection","measureCrossFileDuplication","options","candidates","files","candidate","fileIndex","collectWindowCandidates","minTokens","counted","spansMultipleFiles","left","right","tokenOffsets","computeTokenOffsets","maxGapTokens","exactGroups","mergeGapAdjacentGroups","summarize","takeOverExactGroups","collectNearMissGroups","minSimilarityPercent","exactGroupIndexesByFile","groupIndex","group","indexes","taken","coalesced","merged","nearMissGroups","copyOf","overlapped","copies","copy","occurrence","overlap","matched","segment","fragmentsByCopy","candidateIndexes","owners","index","owner","fragment","fragments","whole","coalesceOccurrences","segments","mergeSegments","parts","part","sum","last","spansByFile","spans","groups","offset","shift","run","startTokenIndex","endTokenIndex","fileIndexByContext","contexts","tokens","containerStatements","contextIndex","file","spansMultipleFilesAfterMerge","tokenCount","occurrenceGroups","start","end","reported","groupCountByFile","fileDataByName","lineNumbersByFile","duplicateBlockCount","occurrences","lineNumbers","collectOccurrenceLines","lines","fileData","fileLines","line"],"sources":["../src/crossFileDuplication.ts"],"sourcesContent":["import { collectCrossFileNearMissGroups } from './crossFileNearMiss.js';\nimport { selectMaximalGroups, type SelectableRegion } from './duplicateSelection.js';\nimport {\n  buildLiteralCountPrefix,\n  collectMatchedLines,\n  collectSequenceWindowCandidates,\n  countRedundantFragments,\n  mergeAdjacentGroups,\n  resolveDuplicationOptions,\n  type CountedOccurrence,\n  type CrossFileDuplicateCandidate,\n  type CrossFileDuplicationFileData,\n  type SequenceWindowContext,\n  type TokenSegment,\n} from './duplication.js';\nimport type { DuplicationOptions } from './types.js';\n\nexport interface CrossFileDuplicationSourceFile extends Partial<CrossFileDuplicationFileData> {\n  file: string;\n  candidates: CrossFileDuplicateCandidate[];\n}\n\nexport interface CrossFileDuplicateOccurrence {\n  endLine: number;\n  file: string;\n  /**\n   * The code lines carrying the occurrence's matched tokens (see\n   * DuplicateBlockOccurrence.lineNumbers). Absent for a file that supplied only candidates (no\n   * `tokens`), whose matched lines are unknowable.\n   */\n  lineNumbers?: number[];\n  startLine: number;\n  /**\n   * The tokens of its matched runs, or of a near-miss block or its matched cores with the edited\n   * tokens among them; the group's `tokenCount` is the smallest of its occurrences'.\n   */\n  tokenCount: number;\n}\n\nexport interface CrossFileDuplicateBlockGroup {\n  files: string[];\n  occurrences: CrossFileDuplicateOccurrence[];\n  /**\n   * Token count of the smallest occurrence. For exact and gapped groups it is the matched token\n   * count every occurrence shares (gaps are not counted); for near-miss (Type-3) groups it is the\n   * token count of the smallest whole block or set of matched cores, edited tokens included.\n   */\n  tokenCount: number;\n}\n\nexport interface CrossFileDuplicationMetrics {\n  /** Number of redundant copies across all groups, counted per matched fragment like within-file. */\n  duplicateBlockCount: number;\n  /** Groups the file participates in, keyed by the file name passed in. */\n  duplicateBlockGroupCountByFile: Record<string, number>;\n  /**\n   * Per file, the 1-based code lines covered by the tokens of its cross-file occurrences, sorted\n   * ascending: the matched tokens of exact and gapped occurrences, and the lines of a near-miss\n   * block or its matched cores more than half of whose tokens its partners match or which a part of it\n   * matched exactly reaches (like within-file near-miss coverage). The unmatched gap of a merged\n   * clone and comment/blank lines inside an occurrence's bounding range are excluded (blank rows\n   * inside multi-row tokens only when the file supplied codeLineNumbers). A file that supplied\n   * only candidates (no `tokens`) has no entry — without its token stream the covered lines are\n   * unknowable, and an approximate bounding range would break this field's exactness.\n   */\n  duplicateLineNumbersByFile: Record<string, number[]>;\n  groups: CrossFileDuplicateBlockGroup[];\n}\n\ninterface SelectableCandidate extends CrossFileDuplicateCandidate, SelectableRegion {\n  regionBucket: number;\n  file: string;\n}\n\n/** A cross-file occurrence: a within-file occurrence in the project-wide token index space. */\ninterface CrossFileOccurrence extends CountedOccurrence {\n  file: string;\n  fileIndex: number;\n}\n\n/**\n * Detects code regions duplicated across files. Per-file candidates (whole block subtrees and full\n * container runs, fingerprinted with the same normalization as within-file duplication) are joined\n * by a project-level window index over per-statement fingerprint sequences (CPD-style), so a\n * copy-pasted partial statement run embedded in different surrounding code is matched even though\n * no single file can know it repeats elsewhere. Candidates are grouped by fingerprint, and only\n * maximal, non-overlapping regions whose group spans at least two files are counted. Groups that\n * shrink to a single file during selection are shed — a within-file repeat is already reported by\n * that file's own duplication metrics. A copy nested inside a larger group's region (two files share\n * a whole function, a third file only a block of it) is reported with its group, so the third\n * file's copy still shows what it duplicates. Groups separated by a small token gap within each file then\n * merge into gapped (Type-3) clone groups under `maxGapTokens`, exactly like within-file merging.\n * Finally, blocks of files that supplied `nearMissBlocks` are compared across files for near-miss\n * (Type-3) clones under `minSimilarityPercent` (see crossFileNearMiss.ts).\n */\nexport function measureCrossFileDuplication(\n  files: CrossFileDuplicationSourceFile[],\n  options?: DuplicationOptions\n): CrossFileDuplicationMetrics {\n  const { minTokens, maxGapTokens, minSimilarityPercent } = resolveDuplicationOptions(options);\n  const candidates: SelectableCandidate[] = files.flatMap(({ file, candidates }, fileIndex) =>\n    candidates.map((candidate) => ({ ...candidate, regionBucket: fileIndex, file }))\n  );\n  // Pushed one by one: spreading the project-scale window-candidate array as call arguments\n  // overflows V8's argument limit (~124k) and crashes on Node, though Bun/JSC tolerates it.\n  for (const candidate of collectWindowCandidates(files, minTokens)) {\n    candidates.push(candidate);\n  }\n  const counted = selectMaximalGroups(\n    candidates,\n    spansMultipleFiles,\n    // File index and position break coverage ties deterministically.\n    (left, right) => left.regionBucket - right.regionBucket || left.startIndex - right.startIndex\n  );\n  const tokenOffsets = computeTokenOffsets(files, maxGapTokens);\n  const exactGroups = mergeGapAdjacentGroups([...counted.values()], tokenOffsets, maxGapTokens);\n  const nearMissGroups = collectNearMissGroups(files, exactGroups, tokenOffsets, minTokens, minSimilarityPercent);\n  return summarize(takeOverExactGroups(exactGroups, nearMissGroups, minTokens), files, tokenOffsets);\n}\n\n/**\n * Lets a near-miss group take over the exact groups standing for the same copies, as within a\n * file (collect_near_miss_groups in native/src/duplication.rs): every occurrence of such a group\n * overlaps exactly one copy of the near-miss group (one overlapping none reports content the copies\n * do not share, and one reaching into two would make one copy take over lines of the next), exceeds\n * its span by less than `minTokens` (a copy is listed at the size it matched, not at that of a\n * clone larger by a reportable part, which may run into code no copy matched), and no two overlap\n * the same copy (those repeat within the copy, not between the copies).\n * Each copy then becomes one occurrence with the exact fragments it holds, so the copies are\n * listed once.\n */\nfunction takeOverExactGroups(\n  exactGroups: CrossFileOccurrence[][],\n  nearMissGroups: CrossFileOccurrence[][],\n  minTokens: number\n): CrossFileOccurrence[][] {\n  const exactGroupIndexesByFile = new Map<number, Set<number>>();\n  for (const [groupIndex, group] of exactGroups.entries()) {\n    for (const { fileIndex } of group) {\n      const indexes = exactGroupIndexesByFile.get(fileIndex) ?? new Set();\n      indexes.add(groupIndex);\n      exactGroupIndexesByFile.set(fileIndex, indexes);\n    }\n  }\n  const taken = new Set<number>();\n  const coalesced = new Set<CrossFileOccurrence>();\n  const merged = nearMissGroups.map((copies) => {\n    const copyOf = (occurrence: CrossFileOccurrence): CrossFileOccurrence | undefined => {\n      const overlapped = copies.filter((copy) =>\n        copy.segments.some((segment) => occurrence.segments.some((matched) => overlap(matched, segment)))\n      );\n      const [copy] = overlapped;\n      if (overlapped.length !== 1 || !copy) {\n        return undefined;\n      }\n      const excess =\n        Math.max(0, copy.startTokenIndex - occurrence.startTokenIndex) +\n        Math.max(0, occurrence.endTokenIndex - copy.endTokenIndex);\n      return excess < minTokens ? copy : undefined;\n    };\n    const fragmentsByCopy = new Map<CrossFileOccurrence, CrossFileOccurrence[]>();\n    const candidateIndexes = new Set<number>();\n    for (const copy of copies) {\n      for (const groupIndex of copy.spanCountedElsewhere ? (exactGroupIndexesByFile.get(copy.fileIndex) ?? []) : []) {\n        candidateIndexes.add(groupIndex);\n      }\n    }\n    for (const groupIndex of [...candidateIndexes].toSorted((left, right) => left - right)) {\n      const group = exactGroups[groupIndex] ?? [];\n      const owners = group.map(copyOf);\n      if (taken.has(groupIndex) || owners.includes(undefined) || new Set(owners).size !== owners.length) {\n        continue;\n      }\n      taken.add(groupIndex);\n      for (const [index, owner] of owners.entries()) {\n        const fragment = group[index];\n        if (owner && fragment) {\n          const fragments = fragmentsByCopy.get(owner) ?? [];\n          fragments.push(fragment);\n          fragmentsByCopy.set(owner, fragments);\n        }\n      }\n    }\n    return copies.map((copy): CrossFileOccurrence => {\n      const fragments = fragmentsByCopy.get(copy);\n      if (!fragments) {\n        return copy;\n      }\n      const whole = coalesceOccurrences([copy, ...fragments]);\n      coalesced.add(whole);\n      return whole;\n    });\n  });\n  // A copy that took its fragments over counts them itself, unless a group left in place still\n  // counts all of it: a larger clone whose matched segments enclose those of the copy, which its\n  // fragments were nested in. A smaller run left in place inside the copy counts its own repeats,\n  // not the copy.\n  for (const copy of coalesced) {\n    for (const groupIndex of exactGroupIndexesByFile.get(copy.fileIndex) ?? []) {\n      const enclosed =\n        !taken.has(groupIndex) &&\n        exactGroups[groupIndex]?.some(\n          (occurrence) =>\n            !occurrence.spanCountedElsewhere &&\n            copy.segments.every((segment) =>\n              occurrence.segments.some(\n                (matched) =>\n                  matched.startTokenIndex <= segment.startTokenIndex && segment.endTokenIndex <= matched.endTokenIndex\n              )\n            )\n        );\n      if (enclosed) {\n        copy.spanCountedElsewhere = true;\n        break;\n      }\n    }\n  }\n  return [...exactGroups.filter((_, groupIndex) => !taken.has(groupIndex)), ...merged];\n}\n\nfunction overlap(left: TokenSegment, right: TokenSegment): boolean {\n  return left.startTokenIndex < right.endTokenIndex && right.startTokenIndex < left.endTokenIndex;\n}\n\n/** The parts of one copy as one occurrence: an exact part is matched throughout, a near-miss part where its partners match it. */\nfunction coalesceOccurrences(parts: [CrossFileOccurrence, ...CrossFileOccurrence[]]): CrossFileOccurrence {\n  const segments = mergeSegments(parts.flatMap((part) => part.segments));\n  return {\n    ...parts[0],\n    spanCountedElsewhere: undefined,\n    nestedInLargerGroup: undefined,\n    segments,\n    matchedRuns: mergeSegments(parts.flatMap((part) => part.matchedRuns ?? part.segments)),\n    exactSegments: mergeSegments(\n      parts.flatMap((part) => (part.matchedRuns ? (part.exactSegments ?? []) : part.segments))\n    ),\n    tokenCount: segments.reduce((sum, segment) => sum + segment.endTokenIndex - segment.startTokenIndex, 0),\n    startTokenIndex: Math.min(...parts.map((part) => part.startTokenIndex)),\n    endTokenIndex: Math.max(...parts.map((part) => part.endTokenIndex)),\n    startIndex: Math.min(...parts.map((part) => part.startIndex)),\n    endIndex: Math.max(...parts.map((part) => part.endIndex)),\n    startLine: Math.min(...parts.map((part) => part.startLine)),\n    endLine: Math.max(...parts.map((part) => part.endLine)),\n  };\n}\n\n/** The unions of overlapping segments, in position order. */\nfunction mergeSegments(segments: TokenSegment[]): TokenSegment[] {\n  const merged: TokenSegment[] = [];\n  for (const segment of segments.toSorted((left, right) => left.startTokenIndex - right.startTokenIndex)) {\n    const last = merged.at(-1);\n    if (last && segment.startTokenIndex < last.endTokenIndex) {\n      last.endTokenIndex = Math.max(last.endTokenIndex, segment.endTokenIndex);\n    } else {\n      merged.push({ ...segment });\n    }\n  }\n  return merged;\n}\n\n/** Near-miss groups among the blocks the exact groups leave unreported, in the project token space. */\nfunction collectNearMissGroups(\n  files: CrossFileDuplicationSourceFile[],\n  exactGroups: CrossFileOccurrence[][],\n  tokenOffsets: number[],\n  minTokens: number,\n  minSimilarityPercent: number\n): CrossFileOccurrence[][] {\n  // Segment by segment: the gap of a gapped clone is not reported content.\n  const spansByFile = (groups: CrossFileOccurrence[][]): TokenSegment[][] => {\n    const spans: TokenSegment[][] = files.map(() => []);\n    for (const { fileIndex, segments } of groups.flat()) {\n      const offset = tokenOffsets[fileIndex] ?? 0;\n      for (const segment of segments) {\n        spans[fileIndex]?.push(shift(segment, -offset));\n      }\n    }\n    return spans;\n  };\n  return collectCrossFileNearMissGroups(\n    files,\n    spansByFile(exactGroups),\n    spansByFile(exactGroups.filter((group) => !group.some((occurrence) => occurrence.nestedInLargerGroup))),\n    minTokens,\n    minSimilarityPercent\n  ).map((group) =>\n    group.map((occurrence) => {\n      const offset = tokenOffsets[occurrence.fileIndex] ?? 0;\n      return {\n        ...occurrence,\n        file: files[occurrence.fileIndex]?.file ?? '',\n        segments: occurrence.segments.map((segment) => shift(segment, offset)),\n        matchedRuns: occurrence.matchedRuns?.map((run) => shift(run, offset)),\n        startTokenIndex: occurrence.startTokenIndex + offset,\n        endTokenIndex: occurrence.endTokenIndex + offset,\n      };\n    })\n  );\n}\n\nfunction shift({ startTokenIndex, endTokenIndex }: TokenSegment, offset: number): TokenSegment {\n  return { startTokenIndex: startTokenIndex + offset, endTokenIndex: endTokenIndex + offset };\n}\n\n/** Repeated sub-windows of sibling statements matched across the whole project's files. */\nfunction collectWindowCandidates(files: CrossFileDuplicationSourceFile[], minTokens: number): SelectableCandidate[] {\n  const fileIndexByContext: number[] = [];\n  const contexts: SequenceWindowContext[] = [];\n  for (const [fileIndex, { tokens, containerStatements }] of files.entries()) {\n    if (tokens && containerStatements) {\n      fileIndexByContext.push(fileIndex);\n      contexts.push({ tokens, literalCountPrefix: buildLiteralCountPrefix(tokens), containers: containerStatements });\n    }\n  }\n  if (contexts.length < 2) {\n    return [];\n  }\n  return collectSequenceWindowCandidates(contexts, minTokens, true).flatMap(({ candidate, contextIndex }) => {\n    const fileIndex = fileIndexByContext[contextIndex];\n    const file = fileIndex === undefined ? undefined : files[fileIndex];\n    return fileIndex === undefined || file === undefined\n      ? []\n      : [{ ...candidate, regionBucket: fileIndex, file: file.file }];\n  });\n}\n\n/** A merged group is reported only while it still covers more than one file. */\nfunction spansMultipleFilesAfterMerge(group: CrossFileOccurrence[]): boolean {\n  return new Set(group.map((occurrence) => occurrence.file)).size >= 2;\n}\n\nfunction spansMultipleFiles(group: SelectableCandidate[]): boolean {\n  return group.length >= 2 && new Set(group.map((candidate) => candidate.regionBucket)).size >= 2;\n}\n\n/**\n * Per-file token offsets that map every file into one project-wide token index space: each file's\n * tokens are offset by more than `maxGapTokens` past the previous file's, so occurrences in\n * different files are never gap-adjacent and merged pairs always stay within one file.\n */\nfunction computeTokenOffsets(files: CrossFileDuplicationSourceFile[], maxGapTokens: number): number[] {\n  const tokenOffsets: number[] = [];\n  let offset = 0;\n  for (const { tokens, candidates } of files) {\n    tokenOffsets.push(offset);\n    // Accumulated in a loop: spreading a project-scale candidate array as call arguments would\n    // overflow V8's argument limit (~124k) and crash on Node.\n    let tokenCount = tokens?.length ?? 0;\n    if (!tokens) {\n      for (const candidate of candidates) {\n        tokenCount = Math.max(tokenCount, candidate.endTokenIndex);\n      }\n    }\n    offset += tokenCount + maxGapTokens + 1;\n  }\n  return tokenOffsets;\n}\n\n/** Reuses the within-file gapped (Type-3) merging in the project-wide token index space. */\nfunction mergeGapAdjacentGroups(\n  groups: SelectableCandidate[][],\n  tokenOffsets: number[],\n  maxGapTokens: number\n): CrossFileOccurrence[][] {\n  const occurrenceGroups = groups.map((group) =>\n    group\n      .map((candidate): CrossFileOccurrence => {\n        const start = candidate.startTokenIndex + (tokenOffsets[candidate.regionBucket] ?? 0);\n        const end = candidate.endTokenIndex + (tokenOffsets[candidate.regionBucket] ?? 0);\n        return {\n          file: candidate.file,\n          fileIndex: candidate.regionBucket,\n          spanCountedElsewhere: candidate.nestedInLargerGroup,\n          nestedInLargerGroup: candidate.nestedInLargerGroup,\n          segments: [{ startTokenIndex: start, endTokenIndex: end }],\n          tokenCount: candidate.tokenCount,\n          startTokenIndex: start,\n          endTokenIndex: end,\n          startIndex: candidate.startIndex,\n          endIndex: candidate.endIndex,\n          startLine: candidate.startLine,\n          endLine: candidate.endLine,\n        };\n      })\n      .toSorted((left, right) => left.startTokenIndex - right.startTokenIndex)\n  );\n  return mergeAdjacentGroups(occurrenceGroups, maxGapTokens, spansMultipleFilesAfterMerge);\n}\n\nfunction summarize(\n  groups: CrossFileOccurrence[][],\n  files: CrossFileDuplicationSourceFile[],\n  tokenOffsets: number[]\n): CrossFileDuplicationMetrics {\n  const reported: CrossFileDuplicateBlockGroup[] = [];\n  // Accumulated in Maps: file names are arbitrary strings, and a plain object would read\n  // inherited properties for names like \"constructor\".\n  const groupCountByFile = new Map<string, number>();\n  const fileDataByName = new Map(\n    files.map((file, index) => [\n      file.file,\n      { tokens: file.tokens, codeLineNumbers: file.codeLineNumbers, offset: tokenOffsets[index] ?? 0 },\n    ])\n  );\n  const lineNumbersByFile = new Map<string, Set<number>>();\n  let duplicateBlockCount = 0;\n  for (const group of groups) {\n    // Mirrors within-file counting: each redundant occurrence contributes one count per matched\n    // fragment, gapped merging consolidates the grouping without halving the count, and spans a\n    // partial merge shares between a retained group and the merged group count once.\n    duplicateBlockCount += countRedundantFragments(group);\n    const occurrences = group\n      .map((occurrence) => {\n        const { file, startLine, endLine, tokenCount } = occurrence;\n        const lineNumbers = collectOccurrenceLines(occurrence, fileDataByName, lineNumbersByFile);\n        return { file, startLine, endLine, ...(lineNumbers && { lineNumbers }), tokenCount };\n      })\n      .toSorted((left, right) => left.file.localeCompare(right.file) || left.startLine - right.startLine);\n    const files = [...new Set(occurrences.map(({ file }) => file))];\n    for (const file of files) {\n      groupCountByFile.set(file, (groupCountByFile.get(file) ?? 0) + 1);\n    }\n    reported.push({ files, occurrences, tokenCount: Math.min(...group.map(({ tokenCount }) => tokenCount)) });\n  }\n  reported.sort(\n    (left, right) =>\n      right.tokenCount - left.tokenCount ||\n      (left.occurrences[0]?.file ?? '').localeCompare(right.occurrences[0]?.file ?? '') ||\n      (left.occurrences[0]?.startLine ?? 0) - (right.occurrences[0]?.startLine ?? 0)\n  );\n  return {\n    duplicateBlockCount,\n    duplicateBlockGroupCountByFile: Object.fromEntries(groupCountByFile),\n    duplicateLineNumbersByFile: Object.fromEntries(\n      [...lineNumbersByFile].map(([file, lines]) => [file, [...lines].toSorted((left, right) => left - right)])\n    ),\n    groups: reported,\n  };\n}\n\n/**\n * Adds the code lines an occurrence's matched tokens cover (see collectMatchedLines) to its file's\n * line set, mapping the project-wide token segments back into the file's own token stream, and\n * returns them in order.\n * A file that supplied only candidates (no token stream) is skipped rather than approximated from\n * the bounding line range, which would include gap and comment/blank lines and break the field's\n * exactness contract.\n */\nfunction collectOccurrenceLines(\n  occurrence: CrossFileOccurrence,\n  fileDataByName: Map<\n    string,\n    { tokens?: CrossFileDuplicationSourceFile['tokens']; codeLineNumbers?: Set<number>; offset: number }\n  >,\n  lineNumbersByFile: Map<string, Set<number>>\n): number[] | undefined {\n  const fileData = fileDataByName.get(occurrence.file);\n  if (!fileData?.tokens) {\n    return undefined;\n  }\n  let fileLines = lineNumbersByFile.get(occurrence.file);\n  if (!fileLines) {\n    fileLines = new Set();\n    lineNumbersByFile.set(occurrence.file, fileLines);\n  }\n  const lines = collectMatchedLines(\n    occurrence.segments.map((segment) => shift(segment, -fileData.offset)),\n    occurrence.matchedRuns?.map((run) => shift(run, -fileData.offset)),\n    fileData.tokens,\n    fileData.codeLineNumbers,\n    occurrence.exactSegments?.map((segment) => shift(segment, -fileData.offset))\n  );\n  for (const line of lines) {\n    fileLines.add(line);\n  }\n  return [...lines].toSorted((left, right) => left - right);\n}\n"],"mappings":"6HA+FA,SAAgBW,EACd,EACA,EAC6B,CAC7B,GAAM,CAAE,YAAW,eAAc,wBAAyBX,EAAAA,0BAA0BY,CAAO,EACrFC,EAAoCC,EAAM,SAAS,CAAE,OAAM,cAAc,IAC7ED,EAAW,IAAK,IAAe,CAAE,GAAGE,EAAW,aAAcC,EAAW,MAAK,EAAE,CACjF,EAGA,IAAK,IAAMD,KAAaE,EAAwBH,EAAOI,CAAS,EAC9DL,EAAW,KAAKE,CAAS,EAE3B,IAAMI,EAAUlB,EAAAA,oBACdY,EACAO,GAEC,EAAM,IAAUC,EAAK,aAAeC,EAAM,cAAgBD,EAAK,WAAaC,EAAM,UACrF,EACMC,EAAeC,EAAoBV,EAAOW,CAAY,EACtDC,EAAcC,EAAuB,CAAC,GAAGR,EAAQ,OAAO,CAAC,EAAGI,EAAcE,CAAY,EAE5F,OAAOG,EAAUC,EAAoBH,EADdI,EAAsBhB,EAAOY,EAAaH,EAAcL,EAAWa,CAC3B,EAAGb,CAAS,EAAGJ,EAAOS,CAAY,CACnG,CAaA,SAASM,EACP,EACA,EACA,EACyB,CACzB,IAAMG,kBAA0B,IAAI,IACpC,IAAK,GAAM,CAACC,EAAYC,KAAUR,EAAY,QAAQ,EACpD,IAAK,GAAM,CAAE,eAAeQ,EAAO,CACjC,IAAMC,EAAUH,EAAwB,IAAIhB,CAAS,mBAAK,IAAI,IAC9DmB,EAAQ,IAAIF,CAAU,EACtBD,EAAwB,IAAIhB,EAAWmB,CAAO,CAChD,CAEF,IAAMC,kBAAQ,IAAI,IACZC,kBAAY,IAAI,IAChBC,EAASC,EAAe,IAAK,GAAW,CAC5C,IAAMC,EAAU,GAAqE,CACnF,IAAMC,EAAaC,EAAO,OAAQ,GAChCC,EAAK,SAAS,KAAM,GAAYC,EAAW,SAAS,KAAM,GAAYC,EAAQC,EAASC,CAAO,CAAC,CAAC,CAClG,EACM,CAACJ,GAAQF,EACf,GAAIA,EAAW,SAAW,GAAME,EAMhC,OAFE,KAAK,IAAI,EAAGA,EAAK,gBAAkBC,EAAW,eAAe,EAC7D,KAAK,IAAI,EAAGA,EAAW,cAAgBD,EAAK,aAAa,EAC3CzB,EAAYyB,EAAO,IAAA,EACrC,EACMK,kBAAkB,IAAI,IACtBC,kBAAmB,IAAI,IAC7B,IAAK,IAAMN,KAAQD,EACjB,IAAK,IAAMT,KAAcU,EAAK,qBAAwBX,EAAwB,IAAIW,EAAK,SAAS,GAAK,CAAC,EAAK,CAAC,EAC1GM,EAAiB,IAAIhB,CAAU,EAGnC,IAAK,IAAMA,IAAc,CAAC,GAAGgB,CAAgB,CAAC,CAAC,UAAU,EAAM,IAAU5B,EAAOC,CAAK,EAAG,CACtF,IAAMY,EAAQR,EAAYO,IAAe,CAAC,EACpCiB,EAAShB,EAAM,IAAIM,CAAM,EAC/B,GAAI,IAAM,IAAIP,CAAU,GAAKiB,EAAO,SAAS,IAAA,EAAS,GAAK,IAAI,IAAIA,CAAM,CAAC,CAAC,OAASA,EAAO,QAG3F,GAAM,IAAIjB,CAAU,EACpB,IAAK,GAAM,CAACkB,EAAOC,KAAUF,EAAO,QAAQ,EAAG,CAC7C,IAAMG,EAAWnB,EAAMiB,GACvB,GAAIC,GAASC,EAAU,CACrB,IAAMC,EAAYN,EAAgB,IAAII,CAAK,GAAK,CAAC,EACjDE,EAAU,KAAKD,CAAQ,EACvBL,EAAgB,IAAII,EAAOE,CAAS,CACtC,CACF,CARoB,CAStB,CACA,OAAOZ,EAAO,IAAK,GAA8B,CAC/C,IAAMY,EAAYN,EAAgB,IAAIL,CAAI,EAC1C,GAAI,CAACW,EACH,OAAOX,EAET,IAAMY,EAAQC,EAAoB,CAACb,EAAM,GAAGW,CAAS,CAAC,EAEtD,OADAjB,EAAU,IAAIkB,CAAK,EACZA,CACT,CAAC,CACH,CAAC,EAKD,IAAK,IAAMZ,KAAQN,EACjB,IAAK,IAAMJ,KAAcD,EAAwB,IAAIW,EAAK,SAAS,GAAK,CAAC,EAavE,GAXE,CAACP,EAAM,IAAIH,CAAU,GACrBP,EAAYO,EAAW,EAAE,KACtB,GACC,CAACW,EAAW,sBACZD,EAAK,SAAS,MAAO,GACnBC,EAAW,SAAS,KACjB,GACCE,EAAQ,iBAAmBC,EAAQ,iBAAmBA,EAAQ,eAAiBD,EAAQ,aAC3F,CACF,CACJ,EACY,CACZ,EAAK,qBAAuB,GAC5B,KACF,CAGJ,MAAO,CAAC,GAAGpB,EAAY,QAAQ,EAAG,IAAe,CAACU,EAAM,IAAIH,CAAU,CAAC,EAAG,GAAGK,CAAM,CACrF,CAEA,SAASO,EAAQ,EAAoB,EAA8B,CACjE,OAAOxB,EAAK,gBAAkBC,EAAM,eAAiBA,EAAM,gBAAkBD,EAAK,aACpF,CAGA,SAASmC,EAAoB,EAA6E,CACxG,IAAMC,EAAWC,EAAcC,EAAM,QAAS,GAASC,EAAK,QAAQ,CAAC,EACrE,MAAO,CACL,GAAGD,EAAM,GACT,qBAAsB,IAAA,GACtB,oBAAqB,IAAA,GACrB,WACA,YAAaD,EAAcC,EAAM,QAAS,GAASC,EAAK,aAAeA,EAAK,QAAQ,CAAC,EACrF,cAAeF,EACbC,EAAM,QAAS,GAAUC,EAAK,YAAeA,EAAK,eAAiB,CAAC,EAAKA,EAAK,QAAS,CACzF,EACA,WAAYH,EAAS,QAAQ,EAAK,IAAYI,EAAMd,EAAQ,cAAgBA,EAAQ,gBAAiB,CAAC,EACtG,gBAAiB,KAAK,IAAI,GAAGY,EAAM,IAAK,GAASC,EAAK,eAAe,CAAC,EACtE,cAAe,KAAK,IAAI,GAAGD,EAAM,IAAK,GAASC,EAAK,aAAa,CAAC,EAClE,WAAY,KAAK,IAAI,GAAGD,EAAM,IAAK,GAASC,EAAK,UAAU,CAAC,EAC5D,SAAU,KAAK,IAAI,GAAGD,EAAM,IAAK,GAASC,EAAK,QAAQ,CAAC,EACxD,UAAW,KAAK,IAAI,GAAGD,EAAM,IAAK,GAASC,EAAK,SAAS,CAAC,EAC1D,QAAS,KAAK,IAAI,GAAGD,EAAM,IAAK,GAASC,EAAK,OAAO,CAAC,CACxD,CACF,CAGA,SAASF,EAAc,EAA0C,CAC/D,IAAMpB,EAAyB,CAAC,EAChC,IAAK,IAAMS,KAAWU,EAAS,UAAU,EAAM,IAAUpC,EAAK,gBAAkBC,EAAM,eAAe,EAAG,CACtG,IAAMwC,EAAOxB,EAAO,GAAG,EAAE,EACrBwB,GAAQf,EAAQ,gBAAkBe,EAAK,cACzC,EAAK,cAAgB,KAAK,IAAIA,EAAK,cAAef,EAAQ,aAAa,EAEvET,EAAO,KAAK,CAAE,GAAGS,CAAQ,CAAC,CAE9B,CACA,OAAOT,CACT,CAGA,SAASR,EACP,EACA,EACA,EACA,EACA,EACyB,CAEzB,IAAMiC,EAAe,GAAsD,CACzE,IAAMC,EAA0BlD,EAAM,QAAU,CAAC,CAAC,EAClD,IAAK,GAAM,CAAE,YAAW,cAAcmD,EAAO,KAAK,EAAG,CACnD,IAAMC,EAAS3C,EAAaP,IAAc,EAC1C,IAAK,IAAM+B,KAAWU,EACpBO,EAAMhD,EAAU,EAAE,KAAKmD,EAAMpB,EAAS,CAACmB,CAAM,CAAC,CAElD,CACA,OAAOF,CACT,EACA,OAAO9D,EAAAA,+BACLY,EACAiD,EAAYrC,CAAW,EACvBqC,EAAYrC,EAAY,OAAQ,GAAU,CAACQ,EAAM,KAAM,GAAeU,EAAW,mBAAmB,CAAC,CAAC,EACtG1B,EACAa,CACF,CAAC,CAAC,IAAK,GACLG,EAAM,IAAK,GAAe,CACxB,IAAMgC,EAAS3C,EAAaqB,EAAW,YAAc,EACrD,MAAO,CACL,GAAGA,EACH,KAAM9B,EAAM8B,EAAW,UAAU,EAAE,MAAQ,GAC3C,SAAUA,EAAW,SAAS,IAAK,GAAYuB,EAAMpB,EAASmB,CAAM,CAAC,EACrE,YAAatB,EAAW,aAAa,IAAK,GAAQuB,EAAMC,EAAKF,CAAM,CAAC,EACpE,gBAAiBtB,EAAW,gBAAkBsB,EAC9C,cAAetB,EAAW,cAAgBsB,CAC5C,CACF,CAAC,CACH,CACF,CAEA,SAASC,EAAM,CAAE,kBAAiB,iBAA+B,EAA8B,CAC7F,MAAO,CAAE,gBAAiBE,EAAkBH,EAAQ,cAAeI,EAAgBJ,CAAO,CAC5F,CAGA,SAASjD,EAAwB,EAAyC,EAA0C,CAClH,IAAMsD,EAA+B,CAAC,EAChCC,EAAoC,CAAC,EAC3C,IAAK,GAAM,CAACxD,EAAW,CAAE,SAAQ,0BAA0BF,EAAM,QAAQ,EACnE2D,GAAUC,IACZH,EAAmB,KAAKvD,CAAS,EACjCwD,EAAS,KAAK,CAAE,SAAQ,mBAAoBrE,EAAAA,wBAAwBsE,CAAM,EAAG,WAAYC,CAAoB,CAAC,GAMlH,OAHIF,EAAS,OAAS,EACb,CAAC,EAEHpE,EAAAA,gCAAgCoE,EAAUtD,EAAW,EAAI,CAAC,CAAC,SAAS,CAAE,YAAW,kBAAmB,CACzG,IAAMF,EAAYuD,EAAmBI,GAC/BC,EAAO5D,IAAc,IAAA,GAAY,IAAA,GAAYF,EAAME,GACzD,OAAOA,IAAc,IAAA,IAAa4D,IAAS,IAAA,GACvC,CAAC,EACD,CAAC,CAAE,GAAG7D,EAAW,aAAcC,EAAW,KAAM4D,EAAK,IAAK,CAAC,CACjE,CAAC,CACH,CAGA,SAASC,EAA6B,EAAuC,CAC3E,OAAO,IAAI,IAAI3C,EAAM,IAAK,GAAeU,EAAW,IAAI,CAAC,CAAC,CAAC,MAAQ,CACrE,CAEA,SAASxB,EAAmB,EAAuC,CACjE,OAAOc,EAAM,QAAU,GAAK,IAAI,IAAIA,EAAM,IAAK,GAAcnB,EAAU,YAAY,CAAC,CAAC,CAAC,MAAQ,CAChG,CAOA,SAASS,EAAoB,EAAyC,EAAgC,CACpG,IAAMD,EAAyB,CAAC,EAC5B2C,EAAS,EACb,IAAK,GAAM,CAAE,SAAQ,gBAAgBpD,EAAO,CAC1CS,EAAa,KAAK2C,CAAM,EAGxB,IAAIY,EAAaL,GAAQ,QAAU,EACnC,GAAI,CAACA,EACH,IAAK,IAAM1D,KAAaF,EACtB,EAAa,KAAK,IAAIiE,EAAY/D,EAAU,aAAa,EAG7D,GAAU+D,EAAarD,EAAe,CACxC,CACA,OAAOF,CACT,CAGA,SAASI,EACP,EACA,EACA,EACyB,CACzB,IAAMoD,EAAmBd,EAAO,IAAK,GACnC/B,EACG,IAAK,GAAmC,CACvC,IAAM8C,EAAQjE,EAAU,iBAAmBQ,EAAaR,EAAU,eAAiB,GAC7EkE,EAAMlE,EAAU,eAAiBQ,EAAaR,EAAU,eAAiB,GAC/E,MAAO,CACL,KAAMA,EAAU,KAChB,UAAWA,EAAU,aACrB,qBAAsBA,EAAU,oBAChC,oBAAqBA,EAAU,oBAC/B,SAAU,CAAC,CAAE,gBAAiBiE,EAAO,cAAeC,CAAI,CAAC,EACzD,WAAYlE,EAAU,WACtB,gBAAiBiE,EACjB,cAAeC,EACf,WAAYlE,EAAU,WACtB,SAAUA,EAAU,SACpB,UAAWA,EAAU,UACrB,QAASA,EAAU,OACrB,CACF,CAAC,CAAC,CACD,UAAU,EAAM,IAAUM,EAAK,gBAAkBC,EAAM,eAAe,CAC3E,EACA,OAAOjB,EAAAA,oBAAoB0E,EAAkBtD,EAAcoD,CAA4B,CACzF,CAEA,SAASjD,EACP,EACA,EACA,EAC6B,CAC7B,IAAMsD,EAA2C,CAAC,EAG5CC,kBAAmB,IAAI,IACvBC,EAAiB,IAAI,IACzBtE,EAAM,KAAK,EAAM,IAAU,CACzB8D,EAAK,KACL,CAAE,OAAQA,EAAK,OAAQ,gBAAiBA,EAAK,gBAAiB,OAAQrD,EAAa4B,IAAU,CAAE,CACjG,CAAC,CACH,EACMkC,kBAAoB,IAAI,IAC1BC,EAAsB,EAC1B,IAAK,IAAMpD,KAAS+B,EAAQ,CAI1B,GAAuB3D,EAAAA,wBAAwB4B,CAAK,EACpD,IAAMqD,EAAcrD,EACjB,IAAK,GAAe,CACnB,GAAM,CAAE,OAAM,YAAW,UAAS,cAAeU,EAC3C4C,EAAcC,EAAuB7C,EAAYwC,EAAgBC,CAAiB,EACxF,MAAO,CAAE,OAAM,YAAW,UAAS,GAAIG,GAAe,CAAE,aAAY,EAAI,YAAW,CACrF,CAAC,CAAC,CACD,UAAU,EAAM,IAAUnE,EAAK,KAAK,cAAcC,EAAM,IAAI,GAAKD,EAAK,UAAYC,EAAM,SAAS,EAC9FR,EAAQ,CAAC,GAAG,IAAI,IAAIyE,EAAY,KAAK,CAAE,UAAWX,CAAI,CAAC,CAAC,EAC9D,IAAK,IAAMA,KAAQ9D,EACjBqE,EAAiB,IAAIP,GAAOO,EAAiB,IAAIP,CAAI,GAAK,GAAK,CAAC,EAElEM,EAAS,KAAK,CAAE,QAAO,cAAa,WAAY,KAAK,IAAI,GAAGhD,EAAM,KAAK,CAAE,gBAAiB4C,CAAU,CAAC,CAAE,CAAC,CAC1G,CAOA,OANAI,EAAS,MACN,EAAM,IACL5D,EAAM,WAAaD,EAAK,aACvBA,EAAK,YAAY,EAAE,EAAE,MAAQ,GAAA,CAAI,cAAcC,EAAM,YAAY,EAAE,EAAE,MAAQ,EAAE,IAC/ED,EAAK,YAAY,EAAE,EAAE,WAAa,IAAMC,EAAM,YAAY,EAAE,EAAE,WAAa,EAChF,EACO,CACL,sBACA,+BAAgC,OAAO,YAAY6D,CAAgB,EACnE,2BAA4B,OAAO,YACjC,CAAC,GAAGE,CAAiB,CAAC,CAAC,KAAK,CAACT,EAAMc,KAAW,CAACd,EAAM,CAAC,GAAGc,CAAK,CAAC,CAAC,UAAU,EAAM,IAAUrE,EAAOC,CAAK,CAAC,CAAC,CAC1G,EACA,OAAQ4D,CACV,CACF,CAUA,SAASO,EACP,EACA,EAIA,EACsB,CACtB,IAAME,EAAWP,EAAe,IAAIxC,EAAW,IAAI,EACnD,GAAI,CAAC+C,GAAU,OACb,OAEF,IAAIC,EAAYP,EAAkB,IAAIzC,EAAW,IAAI,EAChDgD,IACH,kBAAY,IAAI,IAChBP,EAAkB,IAAIzC,EAAW,KAAMgD,CAAS,GAElD,IAAMF,EAAQnF,EAAAA,oBACZqC,EAAW,SAAS,IAAK,GAAYuB,EAAMpB,EAAS,CAAC4C,EAAS,MAAM,CAAC,EACrE/C,EAAW,aAAa,IAAK,GAAQuB,EAAMC,EAAK,CAACuB,EAAS,MAAM,CAAC,EACjEA,EAAS,OACTA,EAAS,gBACT/C,EAAW,eAAe,IAAK,GAAYuB,EAAMpB,EAAS,CAAC4C,EAAS,MAAM,CAAC,CAC7E,EACA,IAAK,IAAME,KAAQH,EACjBE,EAAU,IAAIC,CAAI,EAEpB,MAAO,CAAC,GAAGH,CAAK,CAAC,CAAC,UAAU,EAAM,IAAUrE,EAAOC,CAAK,CAC1D"}