code-gauge 8.0.1 → 10.0.0

package/dist/checkCommand.js.map

@@ -1 +1 @@
-{"version":3,"file":"checkCommand.js","names":[],"sources":["../src/checkCommand.ts"],"sourcesContent":["import { readFile, realpath, stat } from 'node:fs/promises';\nimport os from 'node:os';\nimport path from 'node:path';\nimport { getErrorMessage, mapConcurrently } from '@willbooster/shared-lib';\nimport { loadConfig, resolveOptions, type CliOptions, type ResolvedOptions } from './cliConfig.js';\nimport type { CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport { keepPaths, loadExclusion, loadRepositoryExclusion } from './exclusion.js';\nimport {\n  isIgnored,\n  listChangedFiles,\n  listLineHunks,\n  listRepositoryFiles,\n  resolveMergeBase,\n  resolveRepoRoot,\n  type ChangedFile,\n  type LineHunk,\n} from './git.js';\nimport {\n  addCrossFileDuplication,\n  configSearchDirectory,\n  formatPath,\n  getLanguage,\n  isWithinDirectory,\n  resolveTarget,\n  scanListedFiles,\n  scanTarget,\n  writeStderr,\n  writeStdout,\n  type ScanResult,\n} from './scan.js';\nimport {\n  checkThresholds,\n  type BlockLocation,\n  type CheckedFile,\n  type CheckResult,\n  type Violation,\n} from './thresholdCheck.js';\nimport { metricNameOf, resolveLimits, thresholds, type LimitsByLevel } from './thresholds.js';\n\n/** Raw options of the `check` subcommand; every field is undefined unless the flag was passed. */\nexport interface CheckCliOptions extends CliOptions {\n  base?: string;\n}\n\n/** The measured files a check covers and the duplication they take part in. */\ninterface CheckScope {\n  files: CheckedFile[];\n  crossFileDuplication?: CrossFileDuplicationMetrics;\n  /** Measurement failures of files the check covers. */\n  errors: string[];\n  warnings: string[];\n  /** The directory the files' paths are relative to. */\n  root: string;\n  mergeBase?: string;\n}\n\n/** Caps how many partner locations a duplicated block lists so the report stays scannable. */\nconst maxListedPartners = 3;\n\n/**\n * Reports every exceeded threshold of the target or, with `base`, of what the working tree changed\n * under it since the merge-base with that ref. Exit codes: 0 no error-level violations, 1 error-level\n * violations, 2 files the check covers could not be measured.\n */\nexport async function runCheckCommand(\n  target: string,\n  cliOptions: CheckCliOptions,\n  cliLimits: LimitsByLevel\n): Promise<void> {\n  try {\n    const resolvedTarget = resolveTarget(target);\n    const config = await loadConfig(cliOptions.config, await configSearchDirectory(resolvedTarget));\n    const options = resolveOptions(cliOptions, config);\n    const scope = await scanScope(resolvedTarget, cliOptions.base, options);\n    const result = checkThresholds(\n      scope.files,\n      scope.crossFileDuplication,\n      resolveLimits(cliLimits, config.config.thresholds)\n    );\n    await endFileViolationsAtLastLine(result.violations, scope.root);\n\n    if (options.json) {\n      printJsonReport(cliOptions, scope, result);\n    } else {\n      printTextReport(cliOptions, scope, result);\n    }\n    if (scope.errors.length > 0) {\n      process.exitCode = 2;\n    } else if (hasErrors(result.violations)) {\n      process.exitCode = 1;\n    }\n  } catch (error) {\n    writeStderr(`Error: ${getErrorMessage(error)}\\n`);\n    process.exitCode = 2;\n  }\n}\n\nfunction hasErrors(violations: readonly Violation[]): boolean {\n  return violations.some(({ level }) => level === 'error');\n}\n\n/**\n * A file's measured line count includes the empty line after a final line terminator, which is\n * not a line of the file, so file-level violations end at the last line that exists.\n */\nasync function endFileViolationsAtLastLine(violations: readonly Violation[], root: string): Promise<void> {\n  for (const violation of violations.filter(({ kind }) => kind === 'file')) {\n    const content = await readFile(path.join(root, violation.file), 'utf8');\n    if (/[\\n\\r]$/u.test(content)) {\n      violation.endLine = Math.max(violation.endLine - 1, 1);\n    }\n  }\n}\n\n/**\n * Inside a git repository, the scope is the repository's git-visible files under the target, and\n * duplication is detected against all of them; `base` only narrows the scope to what changed.\n * Outside a repository, where there is no change to narrow to, the target directory is walked.\n */\nasync function scanScope(\n  resolvedTarget: string,\n  base: string | undefined,\n  options: ResolvedOptions\n): Promise<CheckScope> {\n  const canonicalTarget = await realpath(resolvedTarget);\n  const targetStat = await stat(canonicalTarget);\n  const targetFile = targetStat.isFile() ? canonicalTarget : undefined;\n  if (targetFile && !getLanguage(targetFile, options, true)) {\n    throw new Error(`${path.basename(targetFile)}: unsupported file type`);\n  }\n  let repoRoot;\n  try {\n    repoRoot = await realpath(await resolveRepoRoot(targetFile ? path.dirname(canonicalTarget) : canonicalTarget));\n  } catch (error) {\n    if (base !== undefined) {\n      throw error;\n    }\n    return await scanDirectoryWalk(canonicalTarget, options);\n  }\n  return await scanRepository({ repoRoot, canonicalTarget, targetFile }, base, options);\n}\n\nasync function scanDirectoryWalk(canonicalTarget: string, options: ResolvedOptions): Promise<CheckScope> {\n  const searchDirectory = await configSearchDirectory(canonicalTarget);\n  const scan = await scanTarget(canonicalTarget, {\n    ...options,\n    loadExclusion: (absolutePaths) => loadExclusion(searchDirectory, options.exclude, absolutePaths),\n  });\n  const crossFileDuplication = measureDuplication(scan, options);\n  return {\n    files: scan.files.map(({ file, metrics }) => ({ file: formatPath(file, scan.displayRoot), metrics })),\n    crossFileDuplication,\n    errors: scan.errors,\n    warnings: scan.warnings,\n    root: scan.displayRoot,\n  };\n}\n\ninterface RepositoryTarget {\n  repoRoot: string;\n  canonicalTarget: string;\n  /** Set when the target is a file, which is measured even when git ignores it or it is excluded. */\n  targetFile?: string;\n}\n\n/**\n * Measures every git-visible file (tracked or untracked non-ignored) of the repository, so that\n * code copied from outside the target is detected as duplication, and keeps the files under the\n * target: all of them or, with `base`, the changed ones with their line hunks.\n */\nasync function scanRepository(\n  { repoRoot, canonicalTarget, targetFile }: RepositoryTarget,\n  base: string | undefined,\n  options: ResolvedOptions\n): Promise<CheckScope> {\n  // Only git-visible files are measured, so a directory git ignores would pass as a check of no\n  // files. A directory git lists but whose sources it ignores is not told apart from a repository\n  // or package whose only sources are ignored build output, which must pass.\n  if (targetFile === undefined && canonicalTarget !== repoRoot && (await isIgnored(repoRoot, canonicalTarget))) {\n    throw new Error(\n      `${formatPath(canonicalTarget, repoRoot)}: git ignores this directory, so no file in it is checked; target a file to check it regardless`\n    );\n  }\n  const repositoryFiles = await listRepositoryFiles(repoRoot);\n  const explicitFiles = new Set(targetFile === undefined ? [] : [targetFile]);\n  const unlistedTarget =\n    targetFile !== undefined && !repositoryFiles.has(formatPath(targetFile, repoRoot))\n      ? formatPath(targetFile, repoRoot)\n      : undefined;\n  if (unlistedTarget !== undefined) {\n    repositoryFiles.add(unlistedTarget);\n  }\n  const exclusion = keepPaths(await loadRepositoryExclusion(repoRoot, repositoryFiles, options.exclude), explicitFiles);\n  // Scan errors start with the file or directory they concern.\n  const targetPath = formatPath(canonicalTarget, repoRoot);\n  const scan = await scanListedFiles(\n    repoRoot,\n    repositoryFiles,\n    { ...options, loadExclusion: () => Promise.resolve(exclusion) },\n    explicitFiles,\n    targetFile === undefined && canonicalTarget !== repoRoot ? targetPath : ''\n  );\n  const crossFileDuplication = measureDuplication(scan, options);\n  const isInTarget = (relativePath: string): boolean =>\n    isWithinDirectory(path.join(repoRoot, relativePath), canonicalTarget);\n  const measuredFiles = scan.files.map(({ file, metrics }) => ({ file: formatPath(file, repoRoot), metrics }));\n  let files = measuredFiles.filter(({ file }) => isInTarget(file));\n  let isCovered = (error: string): boolean =>\n    canonicalTarget === repoRoot || error.startsWith(`${targetPath}/`) || error.startsWith(`${targetPath}:`);\n  let mergeBase;\n  if (base !== undefined) {\n    mergeBase = await resolveMergeBase(repoRoot, base);\n    const changedFiles = await listChangedFiles(repoRoot, mergeBase);\n    // A targeted file git does not list has no diff; all of it counts as added.\n    if (unlistedTarget !== undefined) {\n      changedFiles.push({ status: 'added', headPath: unlistedTarget });\n    }\n    const changesInTarget = changedFiles.filter(({ status, headPath }) => status !== 'deleted' && isInTarget(headPath));\n    files = await attachHunks(measuredFiles, changesInTarget, repoRoot, mergeBase);\n    isCovered = (error) => changesInTarget.some(({ headPath }) => error.startsWith(`${headPath}:`));\n  }\n  return { files, crossFileDuplication, ...partitionErrors(scan, isCovered), root: repoRoot, mergeBase };\n}\n\n/** Only a failure on a file the check covers leaves it incomplete; the others are warnings. */\nfunction partitionErrors(\n  scan: ScanResult,\n  isCovered: (error: string) => boolean\n): Pick<CheckScope, 'errors' | 'warnings'> {\n  return {\n    errors: scan.errors.filter((error) => isCovered(error)),\n    warnings: [...scan.warnings, ...scan.errors.filter((error) => !isCovered(error))],\n  };\n}\n\n/** The measured changed files with their line hunks against the merge-base. */\nasync function attachHunks(\n  measuredFiles: readonly CheckedFile[],\n  changedFiles: readonly ChangedFile[],\n  repoRoot: string,\n  mergeBase: string\n): Promise<CheckedFile[]> {\n  const metricsByPath = new Map(measuredFiles.map(({ file, metrics }) => [file, metrics]));\n  const files = await mapConcurrently(changedFiles, os.availableParallelism() * 2, async (changed) => {\n    const metrics = metricsByPath.get(changed.headPath);\n    // A changed file the scan left out (unsupported, excluded, or failed) has nothing to check.\n    if (metrics === undefined) {\n      return [];\n    }\n    const wholeFile: LineHunk = { headStart: 1, headCount: metrics.lines.total };\n    const hunks =\n      changed.basePath === undefined\n        ? [wholeFile]\n        : await listLineHunks(repoRoot, mergeBase, changed.basePath, changed.headPath);\n    if (metrics.language === 'python' && hunks.some(({ headCount }) => headCount === 0)) {\n      anchorDeletionsToCode(hunks, await readFile(path.join(repoRoot, changed.headPath), 'utf8'));\n    }\n    return [{ file: changed.headPath, metrics, hunks }];\n  });\n  return files.flat();\n}\n\n/**\n * Moves each pure deletion up to the last code line before it. A Python function ends at its last\n * statement, so the blank and comment-only lines left above a deleted tail lie outside the span the\n * deletion shortened; anchored to that statement, the deletion counts as touching the function.\n */\nfunction anchorDeletionsToCode(hunks: LineHunk[], content: string): void {\n  const lines = content.split(/\\r\\n|\\n|\\r/u);\n  for (const hunk of hunks) {\n    if (hunk.headCount > 0) continue;\n    while (hunk.headStart > 0 && /^\\s*(?:#.*)?$/u.test(lines[hunk.headStart - 1] ?? '')) {\n      hunk.headStart -= 1;\n    }\n  }\n}\n\n/** A run-wide failure (a missing target or native addon) leaves nothing to check. */\nfunction measureDuplication(scan: ScanResult, options: ResolvedOptions): CrossFileDuplicationMetrics | undefined {\n  if (scan.fatalError) {\n    throw new Error(scan.fatalError);\n  }\n  addCrossFileDuplication(scan, options);\n  return scan.crossFileDuplication;\n}\n\nfunction printTextReport(cliOptions: CheckCliOptions, scope: CheckScope, result: CheckResult): void {\n  const { violations } = result;\n  const checked = `${scope.files.length} ${cliOptions.base === undefined ? '' : 'changed '}files, ${result.checkedFunctionCount} functions checked${describeBase(cliOptions, scope)}`;\n  if (scope.errors.length > 0) {\n    // Unmeasured files were not checked, so \"no violations\" would be vacuous; never claim a pass.\n    writeStdout(\n      `Check could not complete: ${scope.errors.length} measurement failures (details on stderr); ${describeCounts(violations)} in the measured files (${checked}).\\n`\n    );\n  } else if (violations.length === 0) {\n    writeStdout(`No threshold violations: ${checked}.\\n`);\n  } else {\n    writeStdout(`Threshold violations: ${describeCounts(violations)} (${checked}).\\n`);\n  }\n  for (const violation of violations) {\n    writeStdout(`${formatViolation(violation)}\\n`);\n  }\n\n  const violatedMetrics = new Set(violations.flatMap(({ exceeded }) => exceeded.map(({ metric }) => metric)));\n  const violatedThresholds = thresholds.filter((threshold) => violatedMetrics.has(metricNameOf(threshold)));\n  if (violatedThresholds.length > 0) {\n    writeStdout('\\nHow to fix:\\n');\n    for (const { label, hint } of violatedThresholds) {\n      writeStdout(`- ${label}: ${hint}\\n`);\n    }\n  }\n\n  for (const warning of scope.warnings) {\n    writeStderr(`Warning: ${warning}\\n`);\n  }\n  for (const error of scope.errors) {\n    writeStderr(`Error: ${error}\\n`);\n  }\n}\n\nfunction describeBase(cliOptions: CheckCliOptions, scope: CheckScope): string {\n  return scope.mergeBase === undefined ? '' : `; base ${cliOptions.base}, merge-base ${scope.mergeBase.slice(0, 12)}`;\n}\n\nfunction describeCounts(violations: readonly Violation[]): string {\n  const counts = countViolations(violations);\n  return `${counts.errorViolationCount} errors, ${counts.warningViolationCount} warnings (${counts.functionViolationCount} functions, ${counts.fileViolationCount} files, ${counts.duplicationViolationCount} duplicated blocks)`;\n}\n\nfunction countViolations(violations: readonly Violation[]): {\n  violationCount: number;\n  errorViolationCount: number;\n  warningViolationCount: number;\n  functionViolationCount: number;\n  fileViolationCount: number;\n  duplicationViolationCount: number;\n} {\n  const count = (kind: Violation['kind']): number => violations.filter((violation) => violation.kind === kind).length;\n  const errorViolationCount = violations.filter(({ level }) => level === 'error').length;\n  return {\n    violationCount: violations.length,\n    errorViolationCount,\n    warningViolationCount: violations.length - errorViolationCount,\n    functionViolationCount: count('function'),\n    fileViolationCount: count('file'),\n    duplicationViolationCount: count('duplication'),\n  };\n}\n\n/** One violation as a single line: its level, the location, then every limit it exceeds. */\nfunction formatViolation(violation: Violation): string {\n  const labelByMetric = new Map(thresholds.map((threshold) => [metricNameOf(threshold), threshold.label]));\n  const exceeded = violation.exceeded\n    .map(({ metric, value, level, limit }) => {\n      // Halstead values are fractional; rounding up keeps a violating value above the printed maximum.\n      const roundedValue = Math.ceil(value * 10) / 10;\n      const levelPrefix = level === violation.level ? '' : `${level} `;\n      // A duplicated block violates from its limit on, so the largest allowed span is the last whole\n      // line count below it; a limit of 0 allows none.\n      const maxAllowed = violation.kind === 'duplication' ? Math.max(Math.ceil(limit) - 1, 0) : limit;\n      return `${labelByMetric.get(metric)} ${roundedValue} (${levelPrefix}max ${maxAllowed})`;\n    })\n    .join(', ');\n  return `${violation.level}: ${describeViolation(violation, exceeded)}`;\n}\n\nfunction describeViolation(violation: Violation, exceeded: string): string {\n  switch (violation.kind) {\n    case 'file': {\n      return `${violation.file}: ${exceeded}`;\n    }\n    case 'function': {\n      // A computed name can span lines in the source; the report keeps one line per function.\n      return `${formatLocation(violation)} ${violation.name?.replaceAll(/\\s*[\\n\\r]\\s*/gu, ' ')}: ${exceeded}`;\n    }\n    case 'duplication': {\n      const partners = (violation.partners ?? []).map((partner) => formatLocation(partner));\n      const listed = [...partners.slice(0, maxListedPartners), ...(partners.length > maxListedPartners ? ['...'] : [])];\n      return `${formatLocation(violation)}: ${exceeded}${listed.length > 0 ? `, also at ${listed.join(', ')}` : ''}`;\n    }\n  }\n}\n\nfunction formatLocation({ file, startLine, endLine }: BlockLocation): string {\n  return `${file}:${startLine}-${endLine}`;\n}\n\nfunction printJsonReport(cliOptions: CheckCliOptions, scope: CheckScope, result: CheckResult): void {\n  writeStdout(\n    JSON.stringify(\n      {\n        passed: !hasErrors(result.violations) && scope.errors.length === 0,\n        base: cliOptions.base,\n        mergeBase: scope.mergeBase,\n        summary: {\n          ...countViolations(result.violations),\n          checkedFileCount: scope.files.length,\n          checkedFunctionCount: result.checkedFunctionCount,\n        },\n        violations: result.violations,\n        errors: scope.errors,\n        warnings: scope.warnings,\n      },\n      undefined,\n      2\n    ) + '\\n'\n  );\n}\n"],"mappings":"y1BAgEA,eAAsB,EACpB,EACA,EACA,EACe,CACf,GAAI,CACF,IAAM,EAAiB,EAAc,CAAM,EACrC,EAAS,MAAM,EAAW,EAAW,OAAQ,MAAM,EAAsB,CAAc,CAAC,EACxF,EAAU,EAAe,EAAY,CAAM,EAC3C,EAAQ,MAAM,EAAU,EAAgB,EAAW,KAAM,CAAO,EAChE,EAAS,EACb,EAAM,MACN,EAAM,qBACN,EAAc,EAAW,EAAO,OAAO,UAAU,CACnD,EACA,MAAM,EAA4B,EAAO,WAAY,EAAM,IAAI,EAE3D,EAAQ,KACV,EAAgB,EAAY,EAAO,CAAM,EAEzC,EAAgB,EAAY,EAAO,CAAM,EAEvC,EAAM,OAAO,OAAS,EACxB,QAAQ,SAAW,EACV,EAAU,EAAO,UAAU,IACpC,QAAQ,SAAW,EAEvB,OAAS,EAAO,CACd,EAAY,UAAU,EAAgB,CAAK,EAAE,GAAG,EAChD,QAAQ,SAAW,CACrB,CACF,CAEA,SAAS,EAAU,EAA2C,CAC5D,OAAO,EAAW,MAAM,CAAE,WAAY,IAAU,OAAO,CACzD,CAMA,eAAe,EAA4B,EAAkC,EAA6B,CACxG,IAAK,IAAM,KAAa,EAAW,QAAQ,CAAE,UAAW,IAAS,MAAM,EAAG,CACxE,IAAM,EAAU,MAAM,EAAS,EAAK,KAAK,EAAM,EAAU,IAAI,EAAG,MAAM,EAClE,WAAW,KAAK,CAAO,IACzB,EAAU,QAAU,KAAK,IAAI,EAAU,QAAU,EAAG,CAAC,EAEzD,CACF,CAOA,eAAe,EACb,EACA,EACA,EACqB,CACrB,IAAM,EAAkB,MAAM,EAAS,CAAc,EAE/C,GAAa,MADM,EAAK,CAAe,EAAA,CACf,OAAO,EAAI,EAAkB,IAAA,GAC3D,GAAI,GAAc,CAAC,EAAY,EAAY,EAAS,EAAI,EACtD,MAAU,MAAM,GAAG,EAAK,SAAS,CAAU,EAAE,wBAAwB,EAEvE,IAAI,EACJ,GAAI,CACF,EAAW,MAAM,EAAS,MAAM,EAAgB,EAAa,EAAK,QAAQ,CAAe,EAAI,CAAe,CAAC,CAC/G,OAAS,EAAO,CACd,GAAI,IAAS,IAAA,GACX,MAAM,EAER,OAAO,MAAM,EAAkB,EAAiB,CAAO,CACzD,CACA,OAAO,MAAM,EAAe,CAAE,WAAU,kBAAiB,YAAW,EAAG,EAAM,CAAO,CACtF,CAEA,eAAe,EAAkB,EAAyB,EAA+C,CACvG,IAAM,EAAkB,MAAM,EAAsB,CAAe,EAC7D,EAAO,MAAM,EAAW,EAAiB,CAC7C,GAAG,EACH,cAAgB,GAAkB,EAAc,EAAiB,EAAQ,QAAS,CAAa,CACjG,CAAC,EACK,EAAuB,EAAmB,EAAM,CAAO,EAC7D,MAAO,CACL,MAAO,EAAK,MAAM,KAAK,CAAE,OAAM,cAAe,CAAE,KAAM,EAAW,EAAM,EAAK,WAAW,EAAG,SAAQ,EAAE,EACpG,uBACA,OAAQ,EAAK,OACb,SAAU,EAAK,SACf,KAAM,EAAK,WACb,CACF,CAcA,eAAe,EACb,CAAE,WAAU,kBAAiB,cAC7B,EACA,EACqB,CAIrB,GAAI,IAAe,IAAA,IAAa,IAAoB,GAAa,MAAM,EAAU,EAAU,CAAe,EACxG,MAAU,MACR,GAAG,EAAW,EAAiB,CAAQ,EAAE,gGAC3C,EAEF,IAAM,EAAkB,MAAM,EAAoB,CAAQ,EACpD,EAAgB,IAAI,IAAI,IAAe,IAAA,GAAY,CAAC,EAAI,CAAC,CAAU,CAAC,EACpE,EACJ,IAAe,IAAA,IAAa,CAAC,EAAgB,IAAI,EAAW,EAAY,CAAQ,CAAC,EAC7E,EAAW,EAAY,CAAQ,EAC/B,IAAA,GACF,IAAmB,IAAA,IACrB,EAAgB,IAAI,CAAc,EAEpC,IAAM,EAAY,EAAU,MAAM,EAAwB,EAAU,EAAiB,EAAQ,OAAO,EAAG,CAAa,EAE9G,EAAa,EAAW,EAAiB,CAAQ,EACjD,EAAO,MAAM,EACjB,EACA,EACA,CAAE,GAAG,EAAS,kBAAqB,QAAQ,QAAQ,CAAS,CAAE,EAC9D,EACA,IAAe,IAAA,IAAa,IAAoB,EAAW,EAAa,EAC1E,EACM,EAAuB,EAAmB,EAAM,CAAO,EACvD,EAAc,GAClB,EAAkB,EAAK,KAAK,EAAU,CAAY,EAAG,CAAe,EAChE,EAAgB,EAAK,MAAM,KAAK,CAAE,OAAM,cAAe,CAAE,KAAM,EAAW,EAAM,CAAQ,EAAG,SAAQ,EAAE,EACvG,EAAQ,EAAc,QAAQ,CAAE,UAAW,EAAW,CAAI,CAAC,EAC3D,EAAa,GACf,IAAoB,GAAY,EAAM,WAAW,GAAG,EAAW,EAAE,GAAK,EAAM,WAAW,GAAG,EAAW,EAAE,EACrG,EACJ,GAAI,IAAS,IAAA,GAAW,CACtB,EAAY,MAAM,EAAiB,EAAU,CAAI,EACjD,IAAM,EAAe,MAAM,EAAiB,EAAU,CAAS,EAE3D,IAAmB,IAAA,IACrB,EAAa,KAAK,CAAE,OAAQ,QAAS,SAAU,CAAe,CAAC,EAEjE,IAAM,EAAkB,EAAa,QAAQ,CAAE,SAAQ,cAAe,IAAW,WAAa,EAAW,CAAQ,CAAC,EAClH,EAAQ,MAAM,EAAY,EAAe,EAAiB,EAAU,CAAS,EAC7E,EAAa,GAAU,EAAgB,MAAM,CAAE,cAAe,EAAM,WAAW,GAAG,EAAS,EAAE,CAAC,CAChG,CACA,MAAO,CAAE,QAAO,uBAAsB,GAAG,EAAgB,EAAM,CAAS,EAAG,KAAM,EAAU,WAAU,CACvG,CAGA,SAAS,EACP,EACA,EACyC,CACzC,MAAO,CACL,OAAQ,EAAK,OAAO,OAAQ,GAAU,EAAU,CAAK,CAAC,EACtD,SAAU,CAAC,GAAG,EAAK,SAAU,GAAG,EAAK,OAAO,OAAQ,GAAU,CAAC,EAAU,CAAK,CAAC,CAAC,CAClF,CACF,CAGA,eAAe,EACb,EACA,EACA,EACA,EACwB,CACxB,IAAM,EAAgB,IAAI,IAAI,EAAc,KAAK,CAAE,OAAM,aAAc,CAAC,EAAM,CAAO,CAAC,CAAC,EAiBvF,OAAO,MAhBa,EAAgB,EAAc,EAAG,qBAAqB,EAAI,EAAG,KAAO,IAAY,CAClG,IAAM,EAAU,EAAc,IAAI,EAAQ,QAAQ,EAElD,GAAI,IAAY,IAAA,GACd,MAAO,CAAC,EAEV,IAAM,EAAsB,CAAE,UAAW,EAAG,UAAW,EAAQ,MAAM,KAAM,EACrE,EACJ,EAAQ,WAAa,IAAA,GACjB,CAAC,CAAS,EACV,MAAM,EAAc,EAAU,EAAW,EAAQ,SAAU,EAAQ,QAAQ,EAIjF,OAHI,EAAQ,WAAa,UAAY,EAAM,MAAM,CAAE,eAAgB,IAAc,CAAC,GAChF,EAAsB,EAAO,MAAM,EAAS,EAAK,KAAK,EAAU,EAAQ,QAAQ,EAAG,MAAM,CAAC,EAErF,CAAC,CAAE,KAAM,EAAQ,SAAU,UAAS,OAAM,CAAC,CACpD,CAAC,EAAA,CACY,KAAK,CACpB,CAOA,SAAS,EAAsB,EAAmB,EAAuB,CACvE,IAAM,EAAQ,EAAQ,MAAM,aAAa,EACzC,IAAK,IAAM,KAAQ,EACb,OAAK,UAAY,GACrB,KAAO,EAAK,UAAY,GAAK,iBAAiB,KAAK,EAAM,EAAK,UAAY,IAAM,EAAE,GAChF,IAAK,SAGX,CAGA,SAAS,EAAmB,EAAkB,EAAmE,CAC/G,GAAI,EAAK,WACP,MAAU,MAAM,EAAK,UAAU,EAGjC,OADA,EAAwB,EAAM,CAAO,EAC9B,EAAK,oBACd,CAEA,SAAS,EAAgB,EAA6B,EAAmB,EAA2B,CAClG,GAAM,CAAE,cAAe,EACjB,EAAU,GAAG,EAAM,MAAM,OAAO,GAAG,EAAW,OAAS,IAAA,GAAY,GAAK,WAAW,SAAS,EAAO,qBAAqB,oBAAoB,EAAa,EAAY,CAAK,IAC5K,EAAM,OAAO,OAAS,EAExB,EACE,6BAA6B,EAAM,OAAO,OAAO,6CAA6C,EAAe,CAAU,EAAE,0BAA0B,EAAQ,KAC7J,EACS,EAAW,SAAW,EAC/B,EAAY,4BAA4B,EAAQ,IAAI,EAEpD,EAAY,yBAAyB,EAAe,CAAU,EAAE,IAAI,EAAQ,KAAK,EAEnF,IAAK,IAAM,KAAa,EACtB,EAAY,GAAG,EAAgB,CAAS,EAAE,GAAG,EAG/C,IAAM,EAAkB,IAAI,IAAI,EAAW,SAAS,CAAE,cAAe,EAAS,KAAK,CAAE,YAAa,CAAM,CAAC,CAAC,EACpG,EAAqB,EAAW,OAAQ,GAAc,EAAgB,IAAI,EAAa,CAAS,CAAC,CAAC,EACxG,GAAI,EAAmB,OAAS,EAAG,CACjC,EAAY;;CAAiB,EAC7B,IAAK,GAAM,CAAE,QAAO,UAAU,EAC5B,EAAY,KAAK,EAAM,IAAI,EAAK,GAAG,CAEvC,CAEA,IAAK,IAAM,KAAW,EAAM,SAC1B,EAAY,YAAY,EAAQ,GAAG,EAErC,IAAK,IAAM,KAAS,EAAM,OACxB,EAAY,UAAU,EAAM,GAAG,CAEnC,CAEA,SAAS,EAAa,EAA6B,EAA2B,CAC5E,OAAO,EAAM,YAAc,IAAA,GAAY,GAAK,UAAU,EAAW,KAAK,eAAe,EAAM,UAAU,MAAM,EAAG,EAAE,GAClH,CAEA,SAAS,EAAe,EAA0C,CAChE,IAAM,EAAS,EAAgB,CAAU,EACzC,MAAO,GAAG,EAAO,oBAAoB,WAAW,EAAO,sBAAsB,aAAa,EAAO,uBAAuB,cAAc,EAAO,mBAAmB,UAAU,EAAO,0BAA0B,oBAC7M,CAEA,SAAS,EAAgB,EAOvB,CACA,IAAM,EAAS,GAAoC,EAAW,OAAQ,GAAc,EAAU,OAAS,CAAI,CAAC,CAAC,OACvG,EAAsB,EAAW,QAAQ,CAAE,WAAY,IAAU,OAAO,CAAC,CAAC,OAChF,MAAO,CACL,eAAgB,EAAW,OAC3B,sBACA,sBAAuB,EAAW,OAAS,EAC3C,uBAAwB,EAAM,UAAU,EACxC,mBAAoB,EAAM,MAAM,EAChC,0BAA2B,EAAM,aAAa,CAChD,CACF,CAGA,SAAS,EAAgB,EAA8B,CACrD,IAAM,EAAgB,IAAI,IAAI,EAAW,IAAK,GAAc,CAAC,EAAa,CAAS,EAAG,EAAU,KAAK,CAAC,CAAC,EACjG,EAAW,EAAU,SACxB,KAAK,CAAE,SAAQ,QAAO,QAAO,WAAY,CAExC,IAAM,EAAe,KAAK,KAAK,EAAQ,EAAE,EAAI,GACvC,EAAc,IAAU,EAAU,MAAQ,GAAK,GAAG,EAAM,GAGxD,EAAa,EAAU,OAAS,cAAgB,KAAK,IAAI,KAAK,KAAK,CAAK,EAAI,EAAG,CAAC,EAAI,EAC1F,MAAO,GAAG,EAAc,IAAI,CAAM,EAAE,GAAG,EAAa,IAAI,EAAY,MAAM,EAAW,EACvF,CAAC,CAAC,CACD,KAAK,IAAI,EACZ,MAAO,GAAG,EAAU,MAAM,IAAI,EAAkB,EAAW,CAAQ,GACrE,CAEA,SAAS,EAAkB,EAAsB,EAA0B,CACzE,OAAQ,EAAU,KAAlB,CACE,IAAK,OACH,MAAO,GAAG,EAAU,KAAK,IAAI,IAE/B,IAAK,WAEH,MAAO,GAAG,EAAe,CAAS,EAAE,GAAG,EAAU,MAAM,WAAW,iBAAkB,GAAG,EAAE,IAAI,IAE/F,IAAK,cAAe,CAClB,IAAM,GAAY,EAAU,UAAY,CAAC,EAAA,CAAG,IAAK,GAAY,EAAe,CAAO,CAAC,EAC9E,EAAS,CAAC,GAAG,EAAS,MAAM,EAAG,CAAiB,EAAG,GAAI,EAAS,OAAS,EAAoB,CAAC,KAAK,EAAI,CAAC,CAAE,EAChH,MAAO,GAAG,EAAe,CAAS,EAAE,IAAI,IAAW,EAAO,OAAS,EAAI,aAAa,EAAO,KAAK,IAAI,IAAM,IAC5G,CACF,CACF,CAEA,SAAS,EAAe,CAAE,OAAM,YAAW,WAAkC,CAC3E,MAAO,GAAG,EAAK,GAAG,EAAU,GAAG,GACjC,CAEA,SAAS,EAAgB,EAA6B,EAAmB,EAA2B,CAClG,EACE,KAAK,UACH,CACE,OAAQ,CAAC,EAAU,EAAO,UAAU,GAAK,EAAM,OAAO,SAAW,EACjE,KAAM,EAAW,KACjB,UAAW,EAAM,UACjB,QAAS,CACP,GAAG,EAAgB,EAAO,UAAU,EACpC,iBAAkB,EAAM,MAAM,OAC9B,qBAAsB,EAAO,oBAC/B,EACA,WAAY,EAAO,WACnB,OAAQ,EAAM,OACd,SAAU,EAAM,QAClB,EACA,IAAA,GACA,CACF,EAAI;CACN,CACF"}
+{"version":3,"file":"checkCommand.js","names":[],"sources":["../src/checkCommand.ts"],"sourcesContent":["import { readFile, realpath, stat } from 'node:fs/promises';\nimport os from 'node:os';\nimport path from 'node:path';\nimport { getErrorMessage, mapConcurrently } from '@willbooster/shared-lib';\nimport { loadConfig, resolveOptions, type CliOptions, type ResolvedOptions } from './cliConfig.js';\nimport type { CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport { keepPaths, loadExclusion, loadRepositoryExclusion } from './exclusion.js';\nimport {\n  isIgnored,\n  listChangedFiles,\n  listLineHunks,\n  listRepositoryFiles,\n  resolveMergeBase,\n  resolveRepoRoot,\n  type ChangedFile,\n  type LineHunk,\n} from './git.js';\nimport {\n  addCrossFileDuplication,\n  configSearchDirectory,\n  formatPath,\n  getLanguage,\n  isWithinDirectory,\n  resolveTarget,\n  scanListedFiles,\n  scanTarget,\n  writeStderr,\n  writeStdout,\n  type ScanResult,\n} from './scan.js';\nimport {\n  checkThresholds,\n  type BlockLocation,\n  type CheckedFile,\n  type CodeLineNumbersByFile,\n  type CheckResult,\n  type Violation,\n} from './thresholdCheck.js';\nimport { metricNameOf, resolveLimits, thresholds, type LimitsByLevel } from './thresholds.js';\n\n/** Raw options of the `check` subcommand; every field is undefined unless the flag was passed. */\nexport interface CheckCliOptions extends CliOptions {\n  base?: string;\n}\n\n/** The measured files a check covers and the duplication they take part in. */\nexport interface CheckScope {\n  files: CheckedFile[];\n  crossFileDuplication?: CrossFileDuplicationMetrics;\n  /** Of every measured file, so that a copy outside the files the check covers is sized like one inside. */\n  codeLineNumbersByFile: CodeLineNumbersByFile;\n  /** Measurement failures of files the check covers. */\n  errors: string[];\n  warnings: string[];\n  /** The directory the files' paths are relative to. */\n  root: string;\n  mergeBase?: string;\n}\n\n/** Caps how many partner locations a duplicated block lists so the report stays scannable. */\nconst maxListedPartners = 3;\n\n/**\n * Reports every exceeded threshold of the target or, with `base`, of what the working tree changed\n * under it since the merge-base with that ref. Exit codes: 0 no error-level violations, 1 error-level\n * violations, 2 files the check covers could not be measured.\n */\nexport async function runCheckCommand(\n  target: string,\n  cliOptions: CheckCliOptions,\n  cliLimits: LimitsByLevel\n): Promise<void> {\n  try {\n    const resolvedTarget = resolveTarget(target);\n    const config = await loadConfig(cliOptions.config, await configSearchDirectory(resolvedTarget));\n    const options = resolveOptions(cliOptions, config);\n    const scope = await scanCheckScope(resolvedTarget, cliOptions.base, options);\n    const result = checkThresholds(\n      scope.files,\n      scope.crossFileDuplication,\n      resolveLimits(cliLimits, config.config.thresholds),\n      scope.codeLineNumbersByFile\n    );\n    await endFileViolationsAtLastLine(result.violations, scope.root);\n\n    if (options.json) {\n      printJsonReport(cliOptions, scope, result);\n    } else {\n      printTextReport(cliOptions, scope, result);\n    }\n    if (scope.errors.length > 0) {\n      process.exitCode = 2;\n    } else if (hasErrors(result.violations)) {\n      process.exitCode = 1;\n    }\n  } catch (error) {\n    writeStderr(`Error: ${getErrorMessage(error)}\\n`);\n    process.exitCode = 2;\n  }\n}\n\nfunction hasErrors(violations: readonly Violation[]): boolean {\n  return violations.some(({ level }) => level === 'error');\n}\n\n/**\n * A file's measured line count includes the empty line after a final line terminator, which is\n * not a line of the file, so file-level violations end at the last line that exists.\n */\nasync function endFileViolationsAtLastLine(violations: readonly Violation[], root: string): Promise<void> {\n  for (const violation of violations.filter(({ kind }) => kind === 'file')) {\n    const content = await readFile(path.join(root, violation.file), 'utf8');\n    if (/[\\n\\r]$/u.test(content)) {\n      violation.endLine = Math.max(violation.endLine - 1, 1);\n    }\n  }\n}\n\n/**\n * Inside a git repository, the scope is the repository's git-visible files under the target, and\n * duplication is detected against all of them; `base` only narrows the scope to what changed.\n * Outside a repository, where there is no change to narrow to, the target directory is walked.\n */\nexport async function scanCheckScope(\n  resolvedTarget: string,\n  base: string | undefined,\n  options: ResolvedOptions\n): Promise<CheckScope> {\n  const canonicalTarget = await realpath(resolvedTarget);\n  const targetStat = await stat(canonicalTarget);\n  const targetFile = targetStat.isFile() ? canonicalTarget : undefined;\n  if (targetFile && !getLanguage(targetFile, options, true)) {\n    throw new Error(`${path.basename(targetFile)}: unsupported file type`);\n  }\n  let repoRoot;\n  try {\n    repoRoot = await realpath(await resolveRepoRoot(targetFile ? path.dirname(canonicalTarget) : canonicalTarget));\n  } catch (error) {\n    if (base !== undefined) {\n      throw error;\n    }\n    return await scanDirectoryWalk(canonicalTarget, options);\n  }\n  return await scanRepository({ repoRoot, canonicalTarget, targetFile }, base, options);\n}\n\nasync function scanDirectoryWalk(canonicalTarget: string, options: ResolvedOptions): Promise<CheckScope> {\n  const searchDirectory = await configSearchDirectory(canonicalTarget);\n  const scan = await scanTarget(canonicalTarget, {\n    ...options,\n    loadExclusion: (absolutePaths) => loadExclusion(searchDirectory, options.exclude, absolutePaths),\n  });\n  const crossFileDuplication = measureDuplication(scan, options);\n  return {\n    files: scan.files.map(({ file, metrics }) => ({ file: formatPath(file, scan.displayRoot), metrics })),\n    codeLineNumbersByFile: indexCodeLineNumbers(scan, scan.displayRoot),\n    crossFileDuplication,\n    errors: scan.errors,\n    warnings: scan.warnings,\n    root: scan.displayRoot,\n  };\n}\n\ninterface RepositoryTarget {\n  repoRoot: string;\n  canonicalTarget: string;\n  /** Set when the target is a file, which is measured even when git ignores it or it is excluded. */\n  targetFile?: string;\n}\n\n/**\n * Measures every git-visible file (tracked or untracked non-ignored) of the repository, so that\n * code copied from outside the target is detected as duplication, and keeps the files under the\n * target: all of them or, with `base`, the changed ones with their line hunks.\n */\nasync function scanRepository(\n  { repoRoot, canonicalTarget, targetFile }: RepositoryTarget,\n  base: string | undefined,\n  options: ResolvedOptions\n): Promise<CheckScope> {\n  // Only git-visible files are measured, so a directory git ignores would pass as a check of no\n  // files. A directory git lists but whose sources it ignores is not told apart from a repository\n  // or package whose only sources are ignored build output, which must pass.\n  if (targetFile === undefined && canonicalTarget !== repoRoot && (await isIgnored(repoRoot, canonicalTarget))) {\n    throw new Error(\n      `${formatPath(canonicalTarget, repoRoot)}: git ignores this directory, so no file in it is checked; target a file to check it regardless`\n    );\n  }\n  const repositoryFiles = await listRepositoryFiles(repoRoot);\n  const explicitFiles = new Set(targetFile === undefined ? [] : [targetFile]);\n  const unlistedTarget =\n    targetFile !== undefined && !repositoryFiles.has(formatPath(targetFile, repoRoot))\n      ? formatPath(targetFile, repoRoot)\n      : undefined;\n  if (unlistedTarget !== undefined) {\n    repositoryFiles.add(unlistedTarget);\n  }\n  const exclusion = keepPaths(await loadRepositoryExclusion(repoRoot, repositoryFiles, options.exclude), explicitFiles);\n  // Scan errors start with the file or directory they concern.\n  const targetPath = formatPath(canonicalTarget, repoRoot);\n  const scan = await scanListedFiles(\n    repoRoot,\n    repositoryFiles,\n    { ...options, loadExclusion: () => Promise.resolve(exclusion) },\n    explicitFiles,\n    targetFile === undefined && canonicalTarget !== repoRoot ? targetPath : ''\n  );\n  const crossFileDuplication = measureDuplication(scan, options);\n  const isInTarget = (relativePath: string): boolean =>\n    isWithinDirectory(path.join(repoRoot, relativePath), canonicalTarget);\n  const measuredFiles = scan.files.map(({ file, metrics }) => ({ file: formatPath(file, repoRoot), metrics }));\n  let files = measuredFiles.filter(({ file }) => isInTarget(file));\n  let isCovered = (error: string): boolean =>\n    canonicalTarget === repoRoot || error.startsWith(`${targetPath}/`) || error.startsWith(`${targetPath}:`);\n  let mergeBase;\n  if (base !== undefined) {\n    mergeBase = await resolveMergeBase(repoRoot, base);\n    const changedFiles = await listChangedFiles(repoRoot, mergeBase);\n    // A targeted file git does not list has no diff; all of it counts as added.\n    if (unlistedTarget !== undefined) {\n      changedFiles.push({ status: 'added', headPath: unlistedTarget });\n    }\n    const changesInTarget = changedFiles.filter(({ status, headPath }) => status !== 'deleted' && isInTarget(headPath));\n    files = await attachHunks(measuredFiles, changesInTarget, repoRoot, mergeBase);\n    isCovered = (error) => changesInTarget.some(({ headPath }) => error.startsWith(`${headPath}:`));\n  }\n  return {\n    files,\n    crossFileDuplication,\n    codeLineNumbersByFile: indexCodeLineNumbers(scan, repoRoot),\n    ...partitionErrors(scan, isCovered),\n    root: repoRoot,\n    mergeBase,\n  };\n}\n\nfunction indexCodeLineNumbers(scan: ScanResult, root: string): CodeLineNumbersByFile {\n  return new Map(scan.files.map(({ file, metrics }) => [formatPath(file, root), new Set(metrics.codeLineNumbers)]));\n}\n\n/** Only a failure on a file the check covers leaves it incomplete; the others are warnings. */\nfunction partitionErrors(\n  scan: ScanResult,\n  isCovered: (error: string) => boolean\n): Pick<CheckScope, 'errors' | 'warnings'> {\n  return {\n    errors: scan.errors.filter((error) => isCovered(error)),\n    warnings: [...scan.warnings, ...scan.errors.filter((error) => !isCovered(error))],\n  };\n}\n\n/** The measured changed files with their line hunks against the merge-base. */\nasync function attachHunks(\n  measuredFiles: readonly CheckedFile[],\n  changedFiles: readonly ChangedFile[],\n  repoRoot: string,\n  mergeBase: string\n): Promise<CheckedFile[]> {\n  const measuredByPath = new Map(measuredFiles.map((measured) => [measured.file, measured]));\n  const files = await mapConcurrently(changedFiles, os.availableParallelism() * 2, async (changed) => {\n    const measured = measuredByPath.get(changed.headPath);\n    // A changed file the scan left out (unsupported, excluded, or failed) has nothing to check.\n    if (measured === undefined) {\n      return [];\n    }\n    const { metrics } = measured;\n    const wholeFile: LineHunk = { headStart: 1, headCount: metrics.lines.total };\n    const hunks =\n      changed.basePath === undefined\n        ? [wholeFile]\n        : await listLineHunks(repoRoot, mergeBase, changed.basePath, changed.headPath);\n    if (metrics.language === 'python' && hunks.some(({ headCount }) => headCount === 0)) {\n      anchorDeletionsToCode(hunks, await readFile(path.join(repoRoot, changed.headPath), 'utf8'));\n    }\n    return [{ ...measured, hunks }];\n  });\n  return files.flat();\n}\n\n/**\n * Moves each pure deletion up to the last code line before it. A Python function ends at its last\n * statement, so the blank and comment-only lines left above a deleted tail lie outside the span the\n * deletion shortened; anchored to that statement, the deletion counts as touching the function.\n */\nfunction anchorDeletionsToCode(hunks: LineHunk[], content: string): void {\n  const lines = content.split(/\\r\\n|\\n|\\r/u);\n  for (const hunk of hunks) {\n    if (hunk.headCount > 0) continue;\n    while (hunk.headStart > 0 && /^\\s*(?:#.*)?$/u.test(lines[hunk.headStart - 1] ?? '')) {\n      hunk.headStart -= 1;\n    }\n  }\n}\n\n/** A run-wide failure (a missing target or native addon) leaves nothing to check. */\nfunction measureDuplication(scan: ScanResult, options: ResolvedOptions): CrossFileDuplicationMetrics | undefined {\n  if (scan.fatalError) {\n    throw new Error(scan.fatalError);\n  }\n  addCrossFileDuplication(scan, options);\n  return scan.crossFileDuplication;\n}\n\nfunction printTextReport(cliOptions: CheckCliOptions, scope: CheckScope, result: CheckResult): void {\n  const { violations } = result;\n  const checked = `${scope.files.length} ${cliOptions.base === undefined ? '' : 'changed '}files, ${result.checkedFunctionCount} functions checked${describeBase(cliOptions, scope)}`;\n  if (scope.errors.length > 0) {\n    // Unmeasured files were not checked, so \"no violations\" would be vacuous; never claim a pass.\n    writeStdout(\n      `Check could not complete: ${scope.errors.length} measurement failures (details on stderr); ${describeCounts(violations)} in the measured files (${checked}).\\n`\n    );\n  } else if (violations.length === 0) {\n    writeStdout(`No threshold violations: ${checked}.\\n`);\n  } else {\n    writeStdout(`Threshold violations: ${describeCounts(violations)} (${checked}).\\n`);\n  }\n  for (const violation of violations) {\n    writeStdout(`${formatViolation(violation)}\\n`);\n  }\n\n  const violatedMetrics = new Set(violations.flatMap(({ exceeded }) => exceeded.map(({ metric }) => metric)));\n  const violatedThresholds = thresholds.filter((threshold) => violatedMetrics.has(metricNameOf(threshold)));\n  if (violatedThresholds.length > 0) {\n    writeStdout('\\nHow to fix:\\n');\n    for (const { label, hint } of violatedThresholds) {\n      writeStdout(`- ${label}: ${hint}\\n`);\n    }\n  }\n\n  for (const warning of scope.warnings) {\n    writeStderr(`Warning: ${warning}\\n`);\n  }\n  for (const error of scope.errors) {\n    writeStderr(`Error: ${error}\\n`);\n  }\n}\n\nfunction describeBase(cliOptions: CheckCliOptions, scope: CheckScope): string {\n  return scope.mergeBase === undefined ? '' : `; base ${cliOptions.base}, merge-base ${scope.mergeBase.slice(0, 12)}`;\n}\n\nfunction describeCounts(violations: readonly Violation[]): string {\n  const counts = countViolations(violations);\n  return `${counts.errorViolationCount} errors, ${counts.warningViolationCount} warnings (${counts.functionViolationCount} functions, ${counts.fileViolationCount} files, ${counts.duplicationViolationCount} duplicated blocks)`;\n}\n\nfunction countViolations(violations: readonly Violation[]): {\n  violationCount: number;\n  errorViolationCount: number;\n  warningViolationCount: number;\n  functionViolationCount: number;\n  fileViolationCount: number;\n  duplicationViolationCount: number;\n} {\n  const count = (kind: Violation['kind']): number => violations.filter((violation) => violation.kind === kind).length;\n  const errorViolationCount = violations.filter(({ level }) => level === 'error').length;\n  return {\n    violationCount: violations.length,\n    errorViolationCount,\n    warningViolationCount: violations.length - errorViolationCount,\n    functionViolationCount: count('function'),\n    fileViolationCount: count('file'),\n    duplicationViolationCount: count('duplication'),\n  };\n}\n\n/** One violation as a single line: its level, the location, then every limit it exceeds. */\nfunction formatViolation(violation: Violation): string {\n  const labelByMetric = new Map(thresholds.map((threshold) => [metricNameOf(threshold), threshold.label]));\n  const exceeded = violation.exceeded\n    .map(({ metric, value, level, limit }) => {\n      // Halstead values are fractional; rounding up keeps a violating value above the printed maximum.\n      const roundedValue = Math.ceil(value * 10) / 10;\n      const levelPrefix = level === violation.level ? '' : `${level} `;\n      // A duplicated block violates from its limit on, so the largest allowed code-line count is\n      // the last whole number below it; a limit of 0 allows none.\n      const maxAllowed = violation.kind === 'duplication' ? Math.max(Math.ceil(limit) - 1, 0) : limit;\n      const blocks = metric === 'functionCognitiveComplexity' ? describeLargestBlocks(violation) : '';\n      return `${labelByMetric.get(metric)} ${roundedValue} (${levelPrefix}max ${maxAllowed}${blocks})`;\n    })\n    .join(', ');\n  return `${violation.level}: ${describeViolation(violation, exceeded)}`;\n}\n\nfunction describeLargestBlocks({ largestBlocks = [] }: Violation): string {\n  const blocks = largestBlocks.map(\n    ({ startLine, endLine, name, cognitiveComplexity }) =>\n      `L${startLine}${endLine === startLine ? '' : `-${endLine}`}${name ? ` ${toOneLine(name)}` : ''} ${cognitiveComplexity}`\n  );\n  return blocks.length > 0 ? `; largest parts ${blocks.join(', ')}` : '';\n}\n\nfunction describeViolation(violation: Violation, exceeded: string): string {\n  switch (violation.kind) {\n    case 'file': {\n      return `${violation.file}: ${exceeded}`;\n    }\n    case 'function': {\n      return `${formatLocation(violation)} ${toOneLine(violation.name ?? '')}: ${exceeded}`;\n    }\n    case 'duplication': {\n      const partners = (violation.partners ?? []).map((partner) => formatLocation(partner));\n      const listed = [...partners.slice(0, maxListedPartners), ...(partners.length > maxListedPartners ? ['...'] : [])];\n      return `${formatLocation(violation)}: ${exceeded}${listed.length > 0 ? `, also at ${listed.join(', ')}` : ''}`;\n    }\n  }\n}\n\n/** A computed name can span lines in the source; the report keeps one line per function. */\nfunction toOneLine(name: string): string {\n  return name.replaceAll(/\\s*[\\n\\r]\\s*/gu, ' ');\n}\n\nfunction formatLocation({ file, startLine, endLine }: BlockLocation): string {\n  return `${file}:${startLine}-${endLine}`;\n}\n\nfunction printJsonReport(cliOptions: CheckCliOptions, scope: CheckScope, result: CheckResult): void {\n  writeStdout(\n    JSON.stringify(\n      {\n        passed: !hasErrors(result.violations) && scope.errors.length === 0,\n        base: cliOptions.base,\n        mergeBase: scope.mergeBase,\n        summary: {\n          ...countViolations(result.violations),\n          checkedFileCount: scope.files.length,\n          checkedFunctionCount: result.checkedFunctionCount,\n        },\n        violations: result.violations,\n        errors: scope.errors,\n        warnings: scope.warnings,\n      },\n      undefined,\n      2\n    ) + '\\n'\n  );\n}\n"],"mappings":"y1BAmEA,eAAsB,EACpB,EACA,EACA,EACe,CACf,GAAI,CACF,IAAM,EAAiB,EAAc,CAAM,EACrC,EAAS,MAAM,EAAW,EAAW,OAAQ,MAAM,EAAsB,CAAc,CAAC,EACxF,EAAU,EAAe,EAAY,CAAM,EAC3C,EAAQ,MAAM,EAAe,EAAgB,EAAW,KAAM,CAAO,EACrE,EAAS,EACb,EAAM,MACN,EAAM,qBACN,EAAc,EAAW,EAAO,OAAO,UAAU,EACjD,EAAM,qBACR,EACA,MAAM,EAA4B,EAAO,WAAY,EAAM,IAAI,EAE3D,EAAQ,KACV,EAAgB,EAAY,EAAO,CAAM,EAEzC,EAAgB,EAAY,EAAO,CAAM,EAEvC,EAAM,OAAO,OAAS,EACxB,QAAQ,SAAW,EACV,EAAU,EAAO,UAAU,IACpC,QAAQ,SAAW,EAEvB,OAAS,EAAO,CACd,EAAY,UAAU,EAAgB,CAAK,EAAE,GAAG,EAChD,QAAQ,SAAW,CACrB,CACF,CAEA,SAAS,EAAU,EAA2C,CAC5D,OAAO,EAAW,MAAM,CAAE,WAAY,IAAU,OAAO,CACzD,CAMA,eAAe,EAA4B,EAAkC,EAA6B,CACxG,IAAK,IAAM,KAAa,EAAW,QAAQ,CAAE,UAAW,IAAS,MAAM,EAAG,CACxE,IAAM,EAAU,MAAM,EAAS,EAAK,KAAK,EAAM,EAAU,IAAI,EAAG,MAAM,EAClE,WAAW,KAAK,CAAO,IACzB,EAAU,QAAU,KAAK,IAAI,EAAU,QAAU,EAAG,CAAC,EAEzD,CACF,CAOA,eAAsB,EACpB,EACA,EACA,EACqB,CACrB,IAAM,EAAkB,MAAM,EAAS,CAAc,EAE/C,GAAa,MADM,EAAK,CAAe,EAAA,CACf,OAAO,EAAI,EAAkB,IAAA,GAC3D,GAAI,GAAc,CAAC,EAAY,EAAY,EAAS,EAAI,EACtD,MAAU,MAAM,GAAG,EAAK,SAAS,CAAU,EAAE,wBAAwB,EAEvE,IAAI,EACJ,GAAI,CACF,EAAW,MAAM,EAAS,MAAM,EAAgB,EAAa,EAAK,QAAQ,CAAe,EAAI,CAAe,CAAC,CAC/G,OAAS,EAAO,CACd,GAAI,IAAS,IAAA,GACX,MAAM,EAER,OAAO,MAAM,EAAkB,EAAiB,CAAO,CACzD,CACA,OAAO,MAAM,EAAe,CAAE,WAAU,kBAAiB,YAAW,EAAG,EAAM,CAAO,CACtF,CAEA,eAAe,EAAkB,EAAyB,EAA+C,CACvG,IAAM,EAAkB,MAAM,EAAsB,CAAe,EAC7D,EAAO,MAAM,EAAW,EAAiB,CAC7C,GAAG,EACH,cAAgB,GAAkB,EAAc,EAAiB,EAAQ,QAAS,CAAa,CACjG,CAAC,EACK,EAAuB,EAAmB,EAAM,CAAO,EAC7D,MAAO,CACL,MAAO,EAAK,MAAM,KAAK,CAAE,OAAM,cAAe,CAAE,KAAM,EAAW,EAAM,EAAK,WAAW,EAAG,SAAQ,EAAE,EACpG,sBAAuB,EAAqB,EAAM,EAAK,WAAW,EAClE,uBACA,OAAQ,EAAK,OACb,SAAU,EAAK,SACf,KAAM,EAAK,WACb,CACF,CAcA,eAAe,EACb,CAAE,WAAU,kBAAiB,cAC7B,EACA,EACqB,CAIrB,GAAI,IAAe,IAAA,IAAa,IAAoB,GAAa,MAAM,EAAU,EAAU,CAAe,EACxG,MAAU,MACR,GAAG,EAAW,EAAiB,CAAQ,EAAE,gGAC3C,EAEF,IAAM,EAAkB,MAAM,EAAoB,CAAQ,EACpD,EAAgB,IAAI,IAAI,IAAe,IAAA,GAAY,CAAC,EAAI,CAAC,CAAU,CAAC,EACpE,EACJ,IAAe,IAAA,IAAa,CAAC,EAAgB,IAAI,EAAW,EAAY,CAAQ,CAAC,EAC7E,EAAW,EAAY,CAAQ,EAC/B,IAAA,GACF,IAAmB,IAAA,IACrB,EAAgB,IAAI,CAAc,EAEpC,IAAM,EAAY,EAAU,MAAM,EAAwB,EAAU,EAAiB,EAAQ,OAAO,EAAG,CAAa,EAE9G,EAAa,EAAW,EAAiB,CAAQ,EACjD,EAAO,MAAM,EACjB,EACA,EACA,CAAE,GAAG,EAAS,kBAAqB,QAAQ,QAAQ,CAAS,CAAE,EAC9D,EACA,IAAe,IAAA,IAAa,IAAoB,EAAW,EAAa,EAC1E,EACM,EAAuB,EAAmB,EAAM,CAAO,EACvD,EAAc,GAClB,EAAkB,EAAK,KAAK,EAAU,CAAY,EAAG,CAAe,EAChE,EAAgB,EAAK,MAAM,KAAK,CAAE,OAAM,cAAe,CAAE,KAAM,EAAW,EAAM,CAAQ,EAAG,SAAQ,EAAE,EACvG,EAAQ,EAAc,QAAQ,CAAE,UAAW,EAAW,CAAI,CAAC,EAC3D,EAAa,GACf,IAAoB,GAAY,EAAM,WAAW,GAAG,EAAW,EAAE,GAAK,EAAM,WAAW,GAAG,EAAW,EAAE,EACrG,EACJ,GAAI,IAAS,IAAA,GAAW,CACtB,EAAY,MAAM,EAAiB,EAAU,CAAI,EACjD,IAAM,EAAe,MAAM,EAAiB,EAAU,CAAS,EAE3D,IAAmB,IAAA,IACrB,EAAa,KAAK,CAAE,OAAQ,QAAS,SAAU,CAAe,CAAC,EAEjE,IAAM,EAAkB,EAAa,QAAQ,CAAE,SAAQ,cAAe,IAAW,WAAa,EAAW,CAAQ,CAAC,EAClH,EAAQ,MAAM,EAAY,EAAe,EAAiB,EAAU,CAAS,EAC7E,EAAa,GAAU,EAAgB,MAAM,CAAE,cAAe,EAAM,WAAW,GAAG,EAAS,EAAE,CAAC,CAChG,CACA,MAAO,CACL,QACA,uBACA,sBAAuB,EAAqB,EAAM,CAAQ,EAC1D,GAAG,EAAgB,EAAM,CAAS,EAClC,KAAM,EACN,WACF,CACF,CAEA,SAAS,EAAqB,EAAkB,EAAqC,CACnF,OAAO,IAAI,IAAI,EAAK,MAAM,KAAK,CAAE,OAAM,aAAc,CAAC,EAAW,EAAM,CAAI,EAAG,IAAI,IAAI,EAAQ,eAAe,CAAC,CAAC,CAAC,CAClH,CAGA,SAAS,EACP,EACA,EACyC,CACzC,MAAO,CACL,OAAQ,EAAK,OAAO,OAAQ,GAAU,EAAU,CAAK,CAAC,EACtD,SAAU,CAAC,GAAG,EAAK,SAAU,GAAG,EAAK,OAAO,OAAQ,GAAU,CAAC,EAAU,CAAK,CAAC,CAAC,CAClF,CACF,CAGA,eAAe,EACb,EACA,EACA,EACA,EACwB,CACxB,IAAM,EAAiB,IAAI,IAAI,EAAc,IAAK,GAAa,CAAC,EAAS,KAAM,CAAQ,CAAC,CAAC,EAkBzF,OAAO,MAjBa,EAAgB,EAAc,EAAG,qBAAqB,EAAI,EAAG,KAAO,IAAY,CAClG,IAAM,EAAW,EAAe,IAAI,EAAQ,QAAQ,EAEpD,GAAI,IAAa,IAAA,GACf,MAAO,CAAC,EAEV,GAAM,CAAE,WAAY,EACd,EAAsB,CAAE,UAAW,EAAG,UAAW,EAAQ,MAAM,KAAM,EACrE,EACJ,EAAQ,WAAa,IAAA,GACjB,CAAC,CAAS,EACV,MAAM,EAAc,EAAU,EAAW,EAAQ,SAAU,EAAQ,QAAQ,EAIjF,OAHI,EAAQ,WAAa,UAAY,EAAM,MAAM,CAAE,eAAgB,IAAc,CAAC,GAChF,EAAsB,EAAO,MAAM,EAAS,EAAK,KAAK,EAAU,EAAQ,QAAQ,EAAG,MAAM,CAAC,EAErF,CAAC,CAAE,GAAG,EAAU,OAAM,CAAC,CAChC,CAAC,EAAA,CACY,KAAK,CACpB,CAOA,SAAS,EAAsB,EAAmB,EAAuB,CACvE,IAAM,EAAQ,EAAQ,MAAM,aAAa,EACzC,IAAK,IAAM,KAAQ,EACb,OAAK,UAAY,GACrB,KAAO,EAAK,UAAY,GAAK,iBAAiB,KAAK,EAAM,EAAK,UAAY,IAAM,EAAE,GAChF,IAAK,SAGX,CAGA,SAAS,EAAmB,EAAkB,EAAmE,CAC/G,GAAI,EAAK,WACP,MAAU,MAAM,EAAK,UAAU,EAGjC,OADA,EAAwB,EAAM,CAAO,EAC9B,EAAK,oBACd,CAEA,SAAS,EAAgB,EAA6B,EAAmB,EAA2B,CAClG,GAAM,CAAE,cAAe,EACjB,EAAU,GAAG,EAAM,MAAM,OAAO,GAAG,EAAW,OAAS,IAAA,GAAY,GAAK,WAAW,SAAS,EAAO,qBAAqB,oBAAoB,EAAa,EAAY,CAAK,IAC5K,EAAM,OAAO,OAAS,EAExB,EACE,6BAA6B,EAAM,OAAO,OAAO,6CAA6C,EAAe,CAAU,EAAE,0BAA0B,EAAQ,KAC7J,EACS,EAAW,SAAW,EAC/B,EAAY,4BAA4B,EAAQ,IAAI,EAEpD,EAAY,yBAAyB,EAAe,CAAU,EAAE,IAAI,EAAQ,KAAK,EAEnF,IAAK,IAAM,KAAa,EACtB,EAAY,GAAG,EAAgB,CAAS,EAAE,GAAG,EAG/C,IAAM,EAAkB,IAAI,IAAI,EAAW,SAAS,CAAE,cAAe,EAAS,KAAK,CAAE,YAAa,CAAM,CAAC,CAAC,EACpG,EAAqB,EAAW,OAAQ,GAAc,EAAgB,IAAI,EAAa,CAAS,CAAC,CAAC,EACxG,GAAI,EAAmB,OAAS,EAAG,CACjC,EAAY;;CAAiB,EAC7B,IAAK,GAAM,CAAE,QAAO,UAAU,EAC5B,EAAY,KAAK,EAAM,IAAI,EAAK,GAAG,CAEvC,CAEA,IAAK,IAAM,KAAW,EAAM,SAC1B,EAAY,YAAY,EAAQ,GAAG,EAErC,IAAK,IAAM,KAAS,EAAM,OACxB,EAAY,UAAU,EAAM,GAAG,CAEnC,CAEA,SAAS,EAAa,EAA6B,EAA2B,CAC5E,OAAO,EAAM,YAAc,IAAA,GAAY,GAAK,UAAU,EAAW,KAAK,eAAe,EAAM,UAAU,MAAM,EAAG,EAAE,GAClH,CAEA,SAAS,EAAe,EAA0C,CAChE,IAAM,EAAS,EAAgB,CAAU,EACzC,MAAO,GAAG,EAAO,oBAAoB,WAAW,EAAO,sBAAsB,aAAa,EAAO,uBAAuB,cAAc,EAAO,mBAAmB,UAAU,EAAO,0BAA0B,oBAC7M,CAEA,SAAS,EAAgB,EAOvB,CACA,IAAM,EAAS,GAAoC,EAAW,OAAQ,GAAc,EAAU,OAAS,CAAI,CAAC,CAAC,OACvG,EAAsB,EAAW,QAAQ,CAAE,WAAY,IAAU,OAAO,CAAC,CAAC,OAChF,MAAO,CACL,eAAgB,EAAW,OAC3B,sBACA,sBAAuB,EAAW,OAAS,EAC3C,uBAAwB,EAAM,UAAU,EACxC,mBAAoB,EAAM,MAAM,EAChC,0BAA2B,EAAM,aAAa,CAChD,CACF,CAGA,SAAS,EAAgB,EAA8B,CACrD,IAAM,EAAgB,IAAI,IAAI,EAAW,IAAK,GAAc,CAAC,EAAa,CAAS,EAAG,EAAU,KAAK,CAAC,CAAC,EACjG,EAAW,EAAU,SACxB,KAAK,CAAE,SAAQ,QAAO,QAAO,WAAY,CAExC,IAAM,EAAe,KAAK,KAAK,EAAQ,EAAE,EAAI,GACvC,EAAc,IAAU,EAAU,MAAQ,GAAK,GAAG,EAAM,GAGxD,EAAa,EAAU,OAAS,cAAgB,KAAK,IAAI,KAAK,KAAK,CAAK,EAAI,EAAG,CAAC,EAAI,EACpF,EAAS,IAAW,8BAAgC,EAAsB,CAAS,EAAI,GAC7F,MAAO,GAAG,EAAc,IAAI,CAAM,EAAE,GAAG,EAAa,IAAI,EAAY,MAAM,IAAa,EAAO,EAChG,CAAC,CAAC,CACD,KAAK,IAAI,EACZ,MAAO,GAAG,EAAU,MAAM,IAAI,EAAkB,EAAW,CAAQ,GACrE,CAEA,SAAS,EAAsB,CAAE,gBAAgB,CAAC,GAAwB,CACxE,IAAM,EAAS,EAAc,KAC1B,CAAE,YAAW,UAAS,OAAM,yBAC3B,IAAI,IAAY,IAAY,EAAY,GAAK,IAAI,MAAY,EAAO,IAAI,EAAU,CAAI,IAAM,GAAG,GAAG,GACtG,EACA,OAAO,EAAO,OAAS,EAAI,mBAAmB,EAAO,KAAK,IAAI,IAAM,EACtE,CAEA,SAAS,EAAkB,EAAsB,EAA0B,CACzE,OAAQ,EAAU,KAAlB,CACE,IAAK,OACH,MAAO,GAAG,EAAU,KAAK,IAAI,IAE/B,IAAK,WACH,MAAO,GAAG,EAAe,CAAS,EAAE,GAAG,EAAU,EAAU,MAAQ,EAAE,EAAE,IAAI,IAE7E,IAAK,cAAe,CAClB,IAAM,GAAY,EAAU,UAAY,CAAC,EAAA,CAAG,IAAK,GAAY,EAAe,CAAO,CAAC,EAC9E,EAAS,CAAC,GAAG,EAAS,MAAM,EAAG,CAAiB,EAAG,GAAI,EAAS,OAAS,EAAoB,CAAC,KAAK,EAAI,CAAC,CAAE,EAChH,MAAO,GAAG,EAAe,CAAS,EAAE,IAAI,IAAW,EAAO,OAAS,EAAI,aAAa,EAAO,KAAK,IAAI,IAAM,IAC5G,CACF,CACF,CAGA,SAAS,EAAU,EAAsB,CACvC,OAAO,EAAK,WAAW,iBAAkB,GAAG,CAC9C,CAEA,SAAS,EAAe,CAAE,OAAM,YAAW,WAAkC,CAC3E,MAAO,GAAG,EAAK,GAAG,EAAU,GAAG,GACjC,CAEA,SAAS,EAAgB,EAA6B,EAAmB,EAA2B,CAClG,EACE,KAAK,UACH,CACE,OAAQ,CAAC,EAAU,EAAO,UAAU,GAAK,EAAM,OAAO,SAAW,EACjE,KAAM,EAAW,KACjB,UAAW,EAAM,UACjB,QAAS,CACP,GAAG,EAAgB,EAAO,UAAU,EACpC,iBAAkB,EAAM,MAAM,OAC9B,qBAAsB,EAAO,oBAC/B,EACA,WAAY,EAAO,WACnB,OAAQ,EAAM,OACd,SAAU,EAAM,QAClB,EACA,IAAA,GACA,CACF,EAAI;CACN,CACF"}

package/dist/cli.cjs

@@ -1,5 +1,5 @@
 #!/usr/bin/env node
-"use strict";const e=require("./thresholds.cjs"),t=require("./cliConfig.cjs"),n=require("./exclusion.cjs"),r=require("./scan.cjs"),i=require("./checkCommand.cjs");let a=require("@willbooster/shared-lib"),o=require("commander");s().catch(e=>{r.writeStderr(`Error: ${(0,a.getErrorMessage)(e)}\n`),process.exitCode=1});async function s(){let t=new o.Command().name(`code-gauge`).description(`Measure code metrics: rank refactoring candidates (the default command) or check thresholds.`);c(t.command(`rank`,{isDefault:!0}).description(`Rank the files of a project by refactoring priority`).argument(`[target]`,`file or directory to measure`,`.`)).option(`--top <number>`,`number of top-ranked files to report (default: 10)`,C).option(`--fail-on-error`,`exit with code 1 when files or directories cannot be scanned`).action(d);let n=c(t.command(`check`).description(`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`).argument(`[target]`,`file or directory to check`,`.`)).option(`--base <ref>`,`check only what the working tree changed since the merge-base of this git ref and HEAD`);for(let t of e.levels)for(let{key:r,defaultLimits:i}of e.thresholds){let e=i[t];n.option(`--${t}-${u(r)} <number>`,`${l(r,t)} (default ${Number.isFinite(e)?e:`off`}); "off" disables it`,b)}n.exitOverride(e=>process.exit(e.exitCode===0?0:2)),n.action(async(t,n)=>{let r=t=>Object.fromEntries(e.thresholds.flatMap(({key:e})=>{let r=n[`${t}${e.charAt(0).toUpperCase()}${e.slice(1)}`];return r===void 0?[]:[[e,r]]}));await i.runCheckCommand(t,n,{warning:r(`warning`),error:r(`error`)})}),await t.parseAsync()}function c(e){return e.option(`--config <path>`,`config file to use instead of the auto-detected ${t.configFileName}`).option(`--duplication-min-tokens <number>`,`minimum normalized token count for a duplicate region (default 40)`,C).option(`--duplication-max-gap-tokens <number>`,`maximum token gap merged into one gapped clone group; 0 disables merging (default 30)`,S).option(`--duplication-min-similarity-percent <number>`,`minimum similarity percent (1-100) for near-miss (Type-3) clone blocks; 100 reports exact matches only (default 70)`,x).option(`--include-tests`,`include test files and test directories`).option(`--json`,`print JSON output`)}function l(t,n){if(t===e.duplicationThreshold.key)return`line count from which a duplicated block is ${n===`error`?`an error`:`a warning`}`;let r=e.fileThresholds.find(e=>e.key===t);return`maximum ${r?r.label:`${e.functionThresholds.find(e=>e.key===t)?.label} of a function`} without ${n===`error`?`an error`:`a warning`}`}function u(e){return e.replaceAll(/[A-Z]/gu,e=>`-${e.toLowerCase()}`)}async function d(e,i){let a=r.resolveTarget(e),o=await r.configSearchDirectory(a),s=await t.loadConfig(i.config,o),c=t.resolveOptions(i,s),l=await r.scanTarget(a,{...c,loadExclusion:e=>n.loadExclusion(o,c.exclude,e)});r.addCrossFileDuplication(l,c);let u=f(l,c.top);c.json?g(l,u,c):_(a,l,u,c),(l.fatalError||c.failOnError&&l.errors.length>0)&&(process.exitCode=1)}function f(e,t){let n=e.files.map(({file:t,metrics:n})=>{let i=r.formatPath(t,e.displayRoot),a=r.collectDuplicatedLineNumbers(n,e.crossFileDuplication,i);return{file:i,worstFunction:h(n.functions),duplicatedLineCount:a.size,duplicatedLineRatio:n.lines.code===0?0:a.size/n.lines.code,crossFilePartners:[],ncss:n.ncssCount,codeLines:n.lines.code}}),i=m(n.map(e=>e.worstFunction?.cognitiveComplexity??0)),a=m(n.map(e=>e.duplicatedLineCount)),o=m(n.map(e=>e.ncss)),s=n.map(e=>({...e,score:i(e.worstFunction?.cognitiveComplexity??0)+a(e.duplicatedLineCount)+o(e.ncss)})).toSorted((e,t)=>t.score-e.score||t.ncss-e.ncss||e.file.localeCompare(t.file));return p(s.slice(0,t),e.crossFileDuplication),s}function p(e,t){if(!t)return;let n=new Map(e.map(e=>[e.file,/* @__PURE__ */ new Set]));for(let e of t.groups)for(let t of e.files){let r=n.get(t);if(r)for(let n of e.files)n!==t&&r.add(n)}for(let t of e)t.crossFilePartners=[...n.get(t.file)??[]].toSorted()}function m(e){let t=e.toSorted((e,t)=>e-t);return e=>{let n=0,r=t.length;for(;n<r;){let i=n+r>>1;t[i]<e?n=i+1:r=i}return t.length===0?0:n/t.length}}function h(e){let t;for(let n of e)(!t||n.cognitiveComplexity>t.cognitiveComplexity||n.cognitiveComplexity===t.cognitiveComplexity&&n.ncss>t.ncss)&&(t=n);if(t)return{name:t.name??`<anonymous>`,startLine:t.startLine,endLine:t.endLine,cognitiveComplexity:t.cognitiveComplexity,ncss:t.ncss,nestingDepth:t.nestingDepth}}function g(e,t,n){let i=t.slice(0,n.top);r.writeStdout(JSON.stringify({summary:y(e.files),totalRankedFiles:t.length,truncated:i.length<t.length,files:i,errors:e.errors,warnings:e.warnings},void 0,2)+`
-`)}function _(e,t,n,i){if(t.fatalError){r.writeStderr(`Error: ${t.fatalError}\n`);return}let a=y(t.files);if(r.writeStdout(`Measured ${a.fileCount} files under ${e} (code LOC ${a.linesOfCode}, NCSS ${a.ncssCount}, functions ${a.functionCount})\n`),n.length===0)r.writeStdout(`No measurable files found.
-`);else{let e=n.slice(0,i.top),t=n.length>e.length?` of ${n.length}`:``;r.writeStdout(`\nRefactoring candidates (top ${e.length}${t}):\n`);for(let[t,n]of e.entries())r.writeStdout(`${t+1}. ${v(n)}\n`)}if(t.warnings.length>0){r.writeStderr(`\nDegraded ${t.warnings.length} files (measured, but excluded from cross-file matching):\n`);for(let e of t.warnings.slice(0,10))r.writeStderr(`- ${e}\n`);t.warnings.length>10&&r.writeStderr(`- ... ${t.warnings.length-10} more\n`)}if(t.errors.length>0){r.writeStderr(`\nSkipped ${t.errors.length} files or directories:\n`);for(let e of t.errors.slice(0,10))r.writeStderr(`- ${e}\n`);t.errors.length>10&&r.writeStderr(`- ... ${t.errors.length-10} more\n`)}}function v(e){let t=[];if(e.worstFunction){let n=e.worstFunction;t.push(`worst function ${n.name} (L${n.startLine}-${n.endLine}) cognitive ${n.cognitiveComplexity}, NCSS ${n.ncss}, nesting ${n.nestingDepth}`)}if(e.duplicatedLineCount>0){let n=e.crossFilePartners.length>0?`, shared with ${e.crossFilePartners.slice(0,3).join(`, `)}${e.crossFilePartners.length>3?`, ...`:``}`:``;t.push(`duplicated lines ${e.duplicatedLineCount} (${Math.round(e.duplicatedLineRatio*100)}%${n})`)}return t.push(`file NCSS ${e.ncss}`),`${e.file} (score ${e.score.toFixed(2)}): ${t.join(`; `)}`}function y(e){let t=0,n=0,r=0,i=0;for(let a of e)t+=a.metrics.functions.length,n+=a.metrics.lines.code,r=Math.max(r,a.metrics.maxCognitiveComplexity),i+=a.metrics.ncssCount;return{fileCount:e.length,functionCount:t,linesOfCode:n,maxCognitiveComplexity:r,ncssCount:i}}function b(e){if(e===`off`)return 1/0;let t=e.trim()===``?NaN:Number(e);if(!Number.isFinite(t)||t<0)throw new o.InvalidArgumentError(`Expected a non-negative number or "off".`);return t}function x(e){let t=C(e);if(t>100)throw new o.InvalidArgumentError(`Expected an integer between 1 and 100.`);return t}function S(e){if(!/^\d+$/u.test(e))throw new o.InvalidArgumentError(`Expected a non-negative integer.`);let t=Number(e);if(!Number.isSafeInteger(t)||t<0)throw new o.InvalidArgumentError(`Expected a non-negative integer.`);return t}function C(e){let t=(0,a.parsePositiveInteger)(e);if(t===void 0)throw new o.InvalidArgumentError(`Expected a positive integer.`);return t}
+"use strict";const e=require("./thresholds.cjs"),t=require("./cliConfig.cjs"),n=require("./exclusion.cjs"),r=require("./scan.cjs"),i=require("./thresholdCheck.cjs"),a=require("./checkCommand.cjs");let o=require("@willbooster/shared-lib"),s=require("commander");c().catch(e=>{r.writeStderr(`Error: ${(0,o.getErrorMessage)(e)}\n`),process.exitCode=1});async function c(){let t=new s.Command().name(`code-gauge`).description(`Measure code metrics: rank refactoring candidates (the default command) or check thresholds.`);l(t.command(`rank`,{isDefault:!0}).description(`Rank the files of a project by refactoring priority`).argument(`[target]`,`file or directory to measure`,`.`)).option(`--top <number>`,`number of top-ranked files to report (default: 10)`,w).option(`--fail-on-error`,`exit with code 1 when files or directories cannot be scanned`).action(f);let n=l(t.command(`check`).description(`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`).argument(`[target]`,`file or directory to check`,`.`)).option(`--base <ref>`,`check only what the working tree changed since the merge-base of this git ref and HEAD`);for(let t of e.levels)for(let{key:r,defaultLimits:i}of e.thresholds){let e=i[t];n.option(`--${t}-${d(r)} <number>`,`${u(r,t)} (default ${Number.isFinite(e)?e:`off`}); "off" disables it`,x)}n.exitOverride(e=>process.exit(e.exitCode===0?0:2)),n.action(async(t,n)=>{let r=t=>Object.fromEntries(e.thresholds.flatMap(({key:e})=>{let r=n[`${t}${e.charAt(0).toUpperCase()}${e.slice(1)}`];return r===void 0?[]:[[e,r]]}));await a.runCheckCommand(t,n,{warning:r(`warning`),error:r(`error`)})}),await t.parseAsync()}function l(e){return e.option(`--config <path>`,`config file to use instead of the auto-detected ${t.configFileName}`).option(`--duplication-min-tokens <number>`,`minimum normalized token count for a duplicate region (default 40)`,w).option(`--duplication-max-gap-tokens <number>`,`maximum token gap merged into one gapped clone group; 0 disables merging (default 30)`,C).option(`--duplication-min-similarity-percent <number>`,`minimum similarity percent (1-100) for near-miss (Type-3) clone blocks; 100 reports exact matches only (default 70)`,S).option(`--include-tests`,`include test files and test directories`).option(`--json`,`print JSON output`)}function u(t,n){if(t===e.duplicationThreshold.key)return`code-line count from which a duplicated block is ${n===`error`?`an error`:`a warning`}`;let r=e.fileThresholds.find(e=>e.key===t);return`maximum ${r?r.label:`${e.functionThresholds.find(e=>e.key===t)?.label} of a function`} without ${n===`error`?`an error`:`a warning`}`}function d(e){return e.replaceAll(/[A-Z]/gu,e=>`-${e.toLowerCase()}`)}async function f(e,i){let a=r.resolveTarget(e),o=await r.configSearchDirectory(a),s=await t.loadConfig(i.config,o),c=t.resolveOptions(i,s),l=await r.scanTarget(a,{...c,loadExclusion:e=>n.loadExclusion(o,c.exclude,e)});r.addCrossFileDuplication(l,c);let u=p(l,c.top);c.json?_(l,u,c):v(a,l,u,c),(l.fatalError||c.failOnError&&l.errors.length>0)&&(process.exitCode=1)}function p(e,t){let n=e.files.map(({file:t,metrics:n})=>{let i=r.formatPath(t,e.displayRoot),a=r.collectDuplicatedLineNumbers(n,e.crossFileDuplication,i);return{file:i,worstFunction:g(n.functions),duplicatedLineCount:a.size,duplicatedLineRatio:n.lines.code===0?0:a.size/n.lines.code,crossFilePartners:[],ncss:n.ncssCount,codeLines:n.lines.code}}),i=h(n.map(e=>e.worstFunction?.cognitiveComplexity??0)),a=h(n.map(e=>e.duplicatedLineCount)),o=h(n.map(e=>e.ncss)),s=n.map(e=>({...e,score:i(e.worstFunction?.cognitiveComplexity??0)+a(e.duplicatedLineCount)+o(e.ncss)})).toSorted((e,t)=>t.score-e.score||t.ncss-e.ncss||e.file.localeCompare(t.file));return m(s.slice(0,t),e.crossFileDuplication),s}function m(e,t){if(!t)return;let n=new Map(e.map(e=>[e.file,/* @__PURE__ */ new Set]));for(let e of t.groups)for(let t of e.files){let r=n.get(t);if(r)for(let n of e.files)n!==t&&r.add(n)}for(let t of e)t.crossFilePartners=[...n.get(t.file)??[]].toSorted()}function h(e){let t=e.toSorted((e,t)=>e-t);return e=>{let n=0,r=t.length;for(;n<r;){let i=n+r>>1;t[i]<e?n=i+1:r=i}return t.length===0?0:n/t.length}}function g(e){let t;for(let n of e)(!t||n.cognitiveComplexity>t.cognitiveComplexity||n.cognitiveComplexity===t.cognitiveComplexity&&n.ncss>t.ncss)&&(t=n);if(t)return{name:i.qualifyFunctionName(t),startLine:t.startLine,endLine:t.endLine,cognitiveComplexity:t.cognitiveComplexity,ncss:t.ncss,nestingDepth:t.nestingDepth}}function _(e,t,n){let i=t.slice(0,n.top);r.writeStdout(JSON.stringify({summary:b(e.files),totalRankedFiles:t.length,truncated:i.length<t.length,files:i,errors:e.errors,warnings:e.warnings},void 0,2)+`
+`)}function v(e,t,n,i){if(t.fatalError){r.writeStderr(`Error: ${t.fatalError}\n`);return}let a=b(t.files);if(r.writeStdout(`Measured ${a.fileCount} files under ${e} (code LOC ${a.linesOfCode}, NCSS ${a.ncssCount}, functions ${a.functionCount})\n`),n.length===0)r.writeStdout(`No measurable files found.
+`);else{let e=n.slice(0,i.top),t=n.length>e.length?` of ${n.length}`:``;r.writeStdout(`\nRefactoring candidates (top ${e.length}${t}):\n`);for(let[t,n]of e.entries())r.writeStdout(`${t+1}. ${y(n)}\n`)}if(t.warnings.length>0){r.writeStderr(`\nDegraded ${t.warnings.length} files (measured, but excluded from cross-file matching):\n`);for(let e of t.warnings.slice(0,10))r.writeStderr(`- ${e}\n`);t.warnings.length>10&&r.writeStderr(`- ... ${t.warnings.length-10} more\n`)}if(t.errors.length>0){r.writeStderr(`\nSkipped ${t.errors.length} files or directories:\n`);for(let e of t.errors.slice(0,10))r.writeStderr(`- ${e}\n`);t.errors.length>10&&r.writeStderr(`- ... ${t.errors.length-10} more\n`)}}function y(e){let t=[];if(e.worstFunction){let n=e.worstFunction;t.push(`worst function ${n.name} (L${n.startLine}-${n.endLine}) cognitive ${n.cognitiveComplexity}, NCSS ${n.ncss}, nesting ${n.nestingDepth}`)}if(e.duplicatedLineCount>0){let n=e.crossFilePartners.length>0?`, shared with ${e.crossFilePartners.slice(0,3).join(`, `)}${e.crossFilePartners.length>3?`, ...`:``}`:``;t.push(`duplicated lines ${e.duplicatedLineCount} (${Math.round(e.duplicatedLineRatio*100)}%${n})`)}return t.push(`file NCSS ${e.ncss}`),`${e.file} (score ${e.score.toFixed(2)}): ${t.join(`; `)}`}function b(e){let t=0,n=0,r=0,i=0;for(let a of e)t+=a.metrics.functions.length,n+=a.metrics.lines.code,r=Math.max(r,a.metrics.maxCognitiveComplexity),i+=a.metrics.ncssCount;return{fileCount:e.length,functionCount:t,linesOfCode:n,maxCognitiveComplexity:r,ncssCount:i}}function x(e){if(e===`off`)return 1/0;let t=e.trim()===``?NaN:Number(e);if(!Number.isFinite(t)||t<0)throw new s.InvalidArgumentError(`Expected a non-negative number or "off".`);return t}function S(e){let t=w(e);if(t>100)throw new s.InvalidArgumentError(`Expected an integer between 1 and 100.`);return t}function C(e){if(!/^\d+$/u.test(e))throw new s.InvalidArgumentError(`Expected a non-negative integer.`);let t=Number(e);if(!Number.isSafeInteger(t)||t<0)throw new s.InvalidArgumentError(`Expected a non-negative integer.`);return t}function w(e){let t=(0,o.parsePositiveInteger)(e);if(t===void 0)throw new s.InvalidArgumentError(`Expected a positive integer.`);return t}
 //# sourceMappingURL=cli.cjs.map

package/dist/cli.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"cli.cjs","names":["getErrorMessage","Command","levels","thresholds","runCheckCommand","configFileName","duplicationThreshold","fileThresholds","functionThresholds","resolveTarget","configSearchDirectory","loadConfig","resolveOptions","scanTarget","loadExclusion","formatPath","collectDuplicatedLineNumbers","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 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 `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: worst.name ?? '<anonymous>',\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":";mOAiEK,EAAK,CAAC,CAAC,MAAO,GAAmB,CACpC,EAAA,YAAY,WAAA,EAAUA,EAAAA,gBAAAA,CAAgB,CAAK,EAAE,GAAG,EAChD,QAAQ,SAAW,CACrB,CAAC,EAED,eAAe,GAAsB,CACnC,IAAM,EAAU,IAAIC,EAAAA,QAAQ,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,KAASC,EAAAA,OAClB,IAAK,GAAM,CAAE,MAAK,mBAAmBC,EAAAA,WAAY,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,YACLA,EAAAA,WAAW,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,MAAMC,EAAAA,gBAAgB,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,mDAAmDC,EAAAA,gBAAgB,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,IAAQC,EAAAA,qBAAqB,IAC/B,MAAO,+CAA+C,IAAU,QAAU,WAAa,cAEzF,IAAM,EAAgBC,EAAAA,eAAe,KAAM,GAAc,EAAU,MAAQ,CAAG,EAI9E,MAAO,WAHS,EACZ,EAAc,MACd,GAAGC,EAAAA,mBAAmB,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,EAAiBC,EAAAA,cAAc,CAAM,EACrC,EAAkB,MAAMC,EAAAA,sBAAsB,CAAc,EAC5D,EAAS,MAAMC,EAAAA,WAAW,EAAW,OAAQ,CAAe,EAC5D,EAAUC,EAAAA,eAAe,EAAY,CAAM,EAC3C,EAAS,MAAMC,EAAAA,WAAW,EAAgB,CAC9C,GAAG,EACH,cAAgB,GAAkBC,EAAAA,cAAc,EAAiB,EAAQ,QAAS,CAAa,CACjG,CAAC,EACD,EAAA,wBAAwB,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,EAAgBC,EAAAA,WAAW,EAAM,EAAO,WAAW,EACnD,EAAkBC,EAAAA,6BAA6B,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,EAAM,MAAQ,cACpB,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,EAAA,YACE,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,EAAA,YAAY,UAAU,EAAO,WAAW,GAAG,EAC3C,MACF,CAEA,IAAM,EAAU,EAAU,EAAO,KAAK,EAKtC,GAJA,EAAA,YACE,YAAY,EAAQ,UAAU,eAAe,EAAO,aAAa,EAAQ,YAAY,SAAS,EAAQ,UAAU,cAAc,EAAQ,cAAc,IACtJ,EAEI,EAAY,SAAW,EACzB,EAAA,YAAY;CAA8B,MACrC,CACL,IAAM,EAAgB,EAAY,MAAM,EAAG,EAAQ,GAAG,EAChD,EAAc,EAAY,OAAS,EAAc,OAAS,OAAO,EAAY,SAAW,GAC9F,EAAA,YAAY,iCAAiC,EAAc,SAAS,EAAY,KAAK,EACrF,IAAK,GAAM,CAAC,EAAO,KAAW,EAAc,QAAQ,EAClD,EAAA,YAAY,GAAG,EAAQ,EAAE,IAAI,EAAiB,CAAM,EAAE,GAAG,CAE7D,CAEA,GAAI,EAAO,SAAS,OAAS,EAAG,CAC9B,EAAA,YAAY,cAAc,EAAO,SAAS,OAAO,4DAA4D,EAC7G,IAAK,IAAM,KAAW,EAAO,SAAS,MAAM,EAAG,EAAE,EAC/C,EAAA,YAAY,KAAK,EAAQ,GAAG,EAE1B,EAAO,SAAS,OAAS,IAC3B,EAAA,YAAY,SAAS,EAAO,SAAS,OAAS,GAAG,QAAQ,CAE7D,CAEA,GAAI,EAAO,OAAO,OAAS,EAAG,CAC5B,EAAA,YAAY,aAAa,EAAO,OAAO,OAAO,yBAAyB,EACvE,IAAK,IAAM,KAAS,EAAO,OAAO,MAAM,EAAG,EAAE,EAC3C,EAAA,YAAY,KAAK,EAAM,GAAG,EAExB,EAAO,OAAO,OAAS,IACzB,EAAA,YAAY,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,IAAIC,EAAAA,qBAAqB,0CAA0C,EAE3E,OAAO,CACT,CAEA,SAAS,EAAoB,EAAuB,CAClD,IAAM,EAAS,EAA2B,CAAK,EAC/C,GAAI,EAAS,IACX,MAAM,IAAIA,EAAAA,qBAAqB,wCAAwC,EAEzE,OAAO,CACT,CAEA,SAAS,EAAwB,EAAuB,CACtD,GAAI,CAAC,SAAS,KAAK,CAAK,EACtB,MAAM,IAAIA,EAAAA,qBAAqB,kCAAkC,EAGnE,IAAM,EAAS,OAAO,CAAK,EAC3B,GAAI,CAAC,OAAO,cAAc,CAAM,GAAK,EAAS,EAC5C,MAAM,IAAIA,EAAAA,qBAAqB,kCAAkC,EAEnE,OAAO,CACT,CAEA,SAAS,EAA2B,EAAuB,CACzD,IAAM,GAAA,EAASC,EAAAA,qBAAAA,CAAqB,CAAK,EACzC,GAAI,IAAW,IAAA,GACb,MAAM,IAAID,EAAAA,qBAAqB,8BAA8B,EAE/D,OAAO,CACT"}
+{"version":3,"file":"cli.cjs","names":["getErrorMessage","Command","levels","thresholds","runCheckCommand","configFileName","duplicationThreshold","fileThresholds","functionThresholds","resolveTarget","configSearchDirectory","loadConfig","resolveOptions","scanTarget","loadExclusion","formatPath","collectDuplicatedLineNumbers","qualifyFunctionName","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":";qQAkEK,EAAK,CAAC,CAAC,MAAO,GAAmB,CACpC,EAAA,YAAY,WAAA,EAAUA,EAAAA,gBAAAA,CAAgB,CAAK,EAAE,GAAG,EAChD,QAAQ,SAAW,CACrB,CAAC,EAED,eAAe,GAAsB,CACnC,IAAM,EAAU,IAAIC,EAAAA,QAAQ,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,KAASC,EAAAA,OAClB,IAAK,GAAM,CAAE,MAAK,mBAAmBC,EAAAA,WAAY,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,YACLA,EAAAA,WAAW,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,MAAMC,EAAAA,gBAAgB,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,mDAAmDC,EAAAA,gBAAgB,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,IAAQC,EAAAA,qBAAqB,IAC/B,MAAO,oDAAoD,IAAU,QAAU,WAAa,cAE9F,IAAM,EAAgBC,EAAAA,eAAe,KAAM,GAAc,EAAU,MAAQ,CAAG,EAI9E,MAAO,WAHS,EACZ,EAAc,MACd,GAAGC,EAAAA,mBAAmB,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,EAAiBC,EAAAA,cAAc,CAAM,EACrC,EAAkB,MAAMC,EAAAA,sBAAsB,CAAc,EAC5D,EAAS,MAAMC,EAAAA,WAAW,EAAW,OAAQ,CAAe,EAC5D,EAAUC,EAAAA,eAAe,EAAY,CAAM,EAC3C,EAAS,MAAMC,EAAAA,WAAW,EAAgB,CAC9C,GAAG,EACH,cAAgB,GAAkBC,EAAAA,cAAc,EAAiB,EAAQ,QAAS,CAAa,CACjG,CAAC,EACD,EAAA,wBAAwB,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,EAAgBC,EAAAA,WAAW,EAAM,EAAO,WAAW,EACnD,EAAkBC,EAAAA,6BAA6B,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,KAAMC,EAAAA,oBAAoB,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,EAAA,YACE,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,EAAA,YAAY,UAAU,EAAO,WAAW,GAAG,EAC3C,MACF,CAEA,IAAM,EAAU,EAAU,EAAO,KAAK,EAKtC,GAJA,EAAA,YACE,YAAY,EAAQ,UAAU,eAAe,EAAO,aAAa,EAAQ,YAAY,SAAS,EAAQ,UAAU,cAAc,EAAQ,cAAc,IACtJ,EAEI,EAAY,SAAW,EACzB,EAAA,YAAY;CAA8B,MACrC,CACL,IAAM,EAAgB,EAAY,MAAM,EAAG,EAAQ,GAAG,EAChD,EAAc,EAAY,OAAS,EAAc,OAAS,OAAO,EAAY,SAAW,GAC9F,EAAA,YAAY,iCAAiC,EAAc,SAAS,EAAY,KAAK,EACrF,IAAK,GAAM,CAAC,EAAO,KAAW,EAAc,QAAQ,EAClD,EAAA,YAAY,GAAG,EAAQ,EAAE,IAAI,EAAiB,CAAM,EAAE,GAAG,CAE7D,CAEA,GAAI,EAAO,SAAS,OAAS,EAAG,CAC9B,EAAA,YAAY,cAAc,EAAO,SAAS,OAAO,4DAA4D,EAC7G,IAAK,IAAM,KAAW,EAAO,SAAS,MAAM,EAAG,EAAE,EAC/C,EAAA,YAAY,KAAK,EAAQ,GAAG,EAE1B,EAAO,SAAS,OAAS,IAC3B,EAAA,YAAY,SAAS,EAAO,SAAS,OAAS,GAAG,QAAQ,CAE7D,CAEA,GAAI,EAAO,OAAO,OAAS,EAAG,CAC5B,EAAA,YAAY,aAAa,EAAO,OAAO,OAAO,yBAAyB,EACvE,IAAK,IAAM,KAAS,EAAO,OAAO,MAAM,EAAG,EAAE,EAC3C,EAAA,YAAY,KAAK,EAAM,GAAG,EAExB,EAAO,OAAO,OAAS,IACzB,EAAA,YAAY,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,IAAIC,EAAAA,qBAAqB,0CAA0C,EAE3E,OAAO,CACT,CAEA,SAAS,EAAoB,EAAuB,CAClD,IAAM,EAAS,EAA2B,CAAK,EAC/C,GAAI,EAAS,IACX,MAAM,IAAIA,EAAAA,qBAAqB,wCAAwC,EAEzE,OAAO,CACT,CAEA,SAAS,EAAwB,EAAuB,CACtD,GAAI,CAAC,SAAS,KAAK,CAAK,EACtB,MAAM,IAAIA,EAAAA,qBAAqB,kCAAkC,EAGnE,IAAM,EAAS,OAAO,CAAK,EAC3B,GAAI,CAAC,OAAO,cAAc,CAAM,GAAK,EAAS,EAC5C,MAAM,IAAIA,EAAAA,qBAAqB,kCAAkC,EAEnE,OAAO,CACT,CAEA,SAAS,EAA2B,EAAuB,CACzD,IAAM,GAAA,EAASC,EAAAA,qBAAAA,CAAqB,CAAK,EACzC,GAAI,IAAW,IAAA,GACb,MAAM,IAAID,EAAAA,qBAAqB,8BAA8B,EAE/D,OAAO,CACT"}

package/dist/cli.js

@@ -1,5 +1,5 @@
 #!/usr/bin/env node
-import{duplicationThreshold as e,fileThresholds as t,functionThresholds as n,levels as r,thresholds as i}from"./thresholds.js";import{configFileName as a,loadConfig as o,resolveOptions as s}from"./cliConfig.js";import{loadExclusion as c}from"./exclusion.js";import{addCrossFileDuplication as l,collectDuplicatedLineNumbers as u,configSearchDirectory as d,formatPath as f,resolveTarget as p,scanTarget as m,writeStderr as h,writeStdout as g}from"./scan.js";import{runCheckCommand as _}from"./checkCommand.js";import{getErrorMessage as v,parsePositiveInteger as y}from"@willbooster/shared-lib";import{Command as b,InvalidArgumentError as x}from"commander";S().catch(e=>{h(`Error: ${v(e)}\n`),process.exitCode=1});async function S(){let e=new b().name(`code-gauge`).description(`Measure code metrics: rank refactoring candidates (the default command) or check thresholds.`);C(e.command(`rank`,{isDefault:!0}).description(`Rank the files of a project by refactoring priority`).argument(`[target]`,`file or directory to measure`,`.`)).option(`--top <number>`,`number of top-ranked files to report (default: 10)`,R).option(`--fail-on-error`,`exit with code 1 when files or directories cannot be scanned`).action(E);let t=C(e.command(`check`).description(`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`).argument(`[target]`,`file or directory to check`,`.`)).option(`--base <ref>`,`check only what the working tree changed since the merge-base of this git ref and HEAD`);for(let e of r)for(let{key:n,defaultLimits:r}of i){let i=r[e];t.option(`--${e}-${T(n)} <number>`,`${w(n,e)} (default ${Number.isFinite(i)?i:`off`}); "off" disables it`,F)}t.exitOverride(e=>process.exit(e.exitCode===0?0:2)),t.action(async(e,t)=>{let n=e=>Object.fromEntries(i.flatMap(({key:n})=>{let r=t[`${e}${n.charAt(0).toUpperCase()}${n.slice(1)}`];return r===void 0?[]:[[n,r]]}));await _(e,t,{warning:n(`warning`),error:n(`error`)})}),await e.parseAsync()}function C(e){return e.option(`--config <path>`,`config file to use instead of the auto-detected ${a}`).option(`--duplication-min-tokens <number>`,`minimum normalized token count for a duplicate region (default 40)`,R).option(`--duplication-max-gap-tokens <number>`,`maximum token gap merged into one gapped clone group; 0 disables merging (default 30)`,L).option(`--duplication-min-similarity-percent <number>`,`minimum similarity percent (1-100) for near-miss (Type-3) clone blocks; 100 reports exact matches only (default 70)`,I).option(`--include-tests`,`include test files and test directories`).option(`--json`,`print JSON output`)}function w(r,i){if(r===e.key)return`line count from which a duplicated block is ${i===`error`?`an error`:`a warning`}`;let a=t.find(e=>e.key===r);return`maximum ${a?a.label:`${n.find(e=>e.key===r)?.label} of a function`} without ${i===`error`?`an error`:`a warning`}`}function T(e){return e.replaceAll(/[A-Z]/gu,e=>`-${e.toLowerCase()}`)}async function E(e,t){let n=p(e),r=await d(n),i=await o(t.config,r),a=s(t,i),u=await m(n,{...a,loadExclusion:e=>c(r,a.exclude,e)});l(u,a);let f=D(u,a.top);a.json?j(u,f,a):M(n,u,f,a),(u.fatalError||a.failOnError&&u.errors.length>0)&&(process.exitCode=1)}function D(e,t){let n=e.files.map(({file:t,metrics:n})=>{let r=f(t,e.displayRoot),i=u(n,e.crossFileDuplication,r);return{file:r,worstFunction:A(n.functions),duplicatedLineCount:i.size,duplicatedLineRatio:n.lines.code===0?0:i.size/n.lines.code,crossFilePartners:[],ncss:n.ncssCount,codeLines:n.lines.code}}),r=k(n.map(e=>e.worstFunction?.cognitiveComplexity??0)),i=k(n.map(e=>e.duplicatedLineCount)),a=k(n.map(e=>e.ncss)),o=n.map(e=>({...e,score:r(e.worstFunction?.cognitiveComplexity??0)+i(e.duplicatedLineCount)+a(e.ncss)})).toSorted((e,t)=>t.score-e.score||t.ncss-e.ncss||e.file.localeCompare(t.file));return O(o.slice(0,t),e.crossFileDuplication),o}function O(e,t){if(!t)return;let n=new Map(e.map(e=>[e.file,/* @__PURE__ */ new Set]));for(let e of t.groups)for(let t of e.files){let r=n.get(t);if(r)for(let n of e.files)n!==t&&r.add(n)}for(let t of e)t.crossFilePartners=[...n.get(t.file)??[]].toSorted()}function k(e){let t=e.toSorted((e,t)=>e-t);return e=>{let n=0,r=t.length;for(;n<r;){let i=n+r>>1;t[i]<e?n=i+1:r=i}return t.length===0?0:n/t.length}}function A(e){let t;for(let n of e)(!t||n.cognitiveComplexity>t.cognitiveComplexity||n.cognitiveComplexity===t.cognitiveComplexity&&n.ncss>t.ncss)&&(t=n);if(t)return{name:t.name??`<anonymous>`,startLine:t.startLine,endLine:t.endLine,cognitiveComplexity:t.cognitiveComplexity,ncss:t.ncss,nestingDepth:t.nestingDepth}}function j(e,t,n){let r=t.slice(0,n.top);g(JSON.stringify({summary:P(e.files),totalRankedFiles:t.length,truncated:r.length<t.length,files:r,errors:e.errors,warnings:e.warnings},void 0,2)+`
-`)}function M(e,t,n,r){if(t.fatalError){h(`Error: ${t.fatalError}\n`);return}let i=P(t.files);if(g(`Measured ${i.fileCount} files under ${e} (code LOC ${i.linesOfCode}, NCSS ${i.ncssCount}, functions ${i.functionCount})\n`),n.length===0)g(`No measurable files found.
-`);else{let e=n.slice(0,r.top),t=n.length>e.length?` of ${n.length}`:``;g(`\nRefactoring candidates (top ${e.length}${t}):\n`);for(let[t,n]of e.entries())g(`${t+1}. ${N(n)}\n`)}if(t.warnings.length>0){h(`\nDegraded ${t.warnings.length} files (measured, but excluded from cross-file matching):\n`);for(let e of t.warnings.slice(0,10))h(`- ${e}\n`);t.warnings.length>10&&h(`- ... ${t.warnings.length-10} more\n`)}if(t.errors.length>0){h(`\nSkipped ${t.errors.length} files or directories:\n`);for(let e of t.errors.slice(0,10))h(`- ${e}\n`);t.errors.length>10&&h(`- ... ${t.errors.length-10} more\n`)}}function N(e){let t=[];if(e.worstFunction){let n=e.worstFunction;t.push(`worst function ${n.name} (L${n.startLine}-${n.endLine}) cognitive ${n.cognitiveComplexity}, NCSS ${n.ncss}, nesting ${n.nestingDepth}`)}if(e.duplicatedLineCount>0){let n=e.crossFilePartners.length>0?`, shared with ${e.crossFilePartners.slice(0,3).join(`, `)}${e.crossFilePartners.length>3?`, ...`:``}`:``;t.push(`duplicated lines ${e.duplicatedLineCount} (${Math.round(e.duplicatedLineRatio*100)}%${n})`)}return t.push(`file NCSS ${e.ncss}`),`${e.file} (score ${e.score.toFixed(2)}): ${t.join(`; `)}`}function P(e){let t=0,n=0,r=0,i=0;for(let a of e)t+=a.metrics.functions.length,n+=a.metrics.lines.code,r=Math.max(r,a.metrics.maxCognitiveComplexity),i+=a.metrics.ncssCount;return{fileCount:e.length,functionCount:t,linesOfCode:n,maxCognitiveComplexity:r,ncssCount:i}}function F(e){if(e===`off`)return 1/0;let t=e.trim()===``?NaN:Number(e);if(!Number.isFinite(t)||t<0)throw new x(`Expected a non-negative number or "off".`);return t}function I(e){let t=R(e);if(t>100)throw new x(`Expected an integer between 1 and 100.`);return t}function L(e){if(!/^\d+$/u.test(e))throw new x(`Expected a non-negative integer.`);let t=Number(e);if(!Number.isSafeInteger(t)||t<0)throw new x(`Expected a non-negative integer.`);return t}function R(e){let t=y(e);if(t===void 0)throw new x(`Expected a positive integer.`);return t}
+import{duplicationThreshold as e,fileThresholds as t,functionThresholds as n,levels as r,thresholds as i}from"./thresholds.js";import{configFileName as a,loadConfig as o,resolveOptions as s}from"./cliConfig.js";import{loadExclusion as c}from"./exclusion.js";import{addCrossFileDuplication as l,collectDuplicatedLineNumbers as u,configSearchDirectory as d,formatPath as f,resolveTarget as p,scanTarget as m,writeStderr as h,writeStdout as g}from"./scan.js";import{qualifyFunctionName as _}from"./thresholdCheck.js";import{runCheckCommand as v}from"./checkCommand.js";import{getErrorMessage as y,parsePositiveInteger as b}from"@willbooster/shared-lib";import{Command as x,InvalidArgumentError as S}from"commander";C().catch(e=>{h(`Error: ${y(e)}\n`),process.exitCode=1});async function C(){let e=new x().name(`code-gauge`).description(`Measure code metrics: rank refactoring candidates (the default command) or check thresholds.`);w(e.command(`rank`,{isDefault:!0}).description(`Rank the files of a project by refactoring priority`).argument(`[target]`,`file or directory to measure`,`.`)).option(`--top <number>`,`number of top-ranked files to report (default: 10)`,z).option(`--fail-on-error`,`exit with code 1 when files or directories cannot be scanned`).action(D);let t=w(e.command(`check`).description(`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`).argument(`[target]`,`file or directory to check`,`.`)).option(`--base <ref>`,`check only what the working tree changed since the merge-base of this git ref and HEAD`);for(let e of r)for(let{key:n,defaultLimits:r}of i){let i=r[e];t.option(`--${e}-${E(n)} <number>`,`${T(n,e)} (default ${Number.isFinite(i)?i:`off`}); "off" disables it`,I)}t.exitOverride(e=>process.exit(e.exitCode===0?0:2)),t.action(async(e,t)=>{let n=e=>Object.fromEntries(i.flatMap(({key:n})=>{let r=t[`${e}${n.charAt(0).toUpperCase()}${n.slice(1)}`];return r===void 0?[]:[[n,r]]}));await v(e,t,{warning:n(`warning`),error:n(`error`)})}),await e.parseAsync()}function w(e){return e.option(`--config <path>`,`config file to use instead of the auto-detected ${a}`).option(`--duplication-min-tokens <number>`,`minimum normalized token count for a duplicate region (default 40)`,z).option(`--duplication-max-gap-tokens <number>`,`maximum token gap merged into one gapped clone group; 0 disables merging (default 30)`,R).option(`--duplication-min-similarity-percent <number>`,`minimum similarity percent (1-100) for near-miss (Type-3) clone blocks; 100 reports exact matches only (default 70)`,L).option(`--include-tests`,`include test files and test directories`).option(`--json`,`print JSON output`)}function T(r,i){if(r===e.key)return`code-line count from which a duplicated block is ${i===`error`?`an error`:`a warning`}`;let a=t.find(e=>e.key===r);return`maximum ${a?a.label:`${n.find(e=>e.key===r)?.label} of a function`} without ${i===`error`?`an error`:`a warning`}`}function E(e){return e.replaceAll(/[A-Z]/gu,e=>`-${e.toLowerCase()}`)}async function D(e,t){let n=p(e),r=await d(n),i=await o(t.config,r),a=s(t,i),u=await m(n,{...a,loadExclusion:e=>c(r,a.exclude,e)});l(u,a);let f=O(u,a.top);a.json?M(u,f,a):N(n,u,f,a),(u.fatalError||a.failOnError&&u.errors.length>0)&&(process.exitCode=1)}function O(e,t){let n=e.files.map(({file:t,metrics:n})=>{let r=f(t,e.displayRoot),i=u(n,e.crossFileDuplication,r);return{file:r,worstFunction:j(n.functions),duplicatedLineCount:i.size,duplicatedLineRatio:n.lines.code===0?0:i.size/n.lines.code,crossFilePartners:[],ncss:n.ncssCount,codeLines:n.lines.code}}),r=A(n.map(e=>e.worstFunction?.cognitiveComplexity??0)),i=A(n.map(e=>e.duplicatedLineCount)),a=A(n.map(e=>e.ncss)),o=n.map(e=>({...e,score:r(e.worstFunction?.cognitiveComplexity??0)+i(e.duplicatedLineCount)+a(e.ncss)})).toSorted((e,t)=>t.score-e.score||t.ncss-e.ncss||e.file.localeCompare(t.file));return k(o.slice(0,t),e.crossFileDuplication),o}function k(e,t){if(!t)return;let n=new Map(e.map(e=>[e.file,/* @__PURE__ */ new Set]));for(let e of t.groups)for(let t of e.files){let r=n.get(t);if(r)for(let n of e.files)n!==t&&r.add(n)}for(let t of e)t.crossFilePartners=[...n.get(t.file)??[]].toSorted()}function A(e){let t=e.toSorted((e,t)=>e-t);return e=>{let n=0,r=t.length;for(;n<r;){let i=n+r>>1;t[i]<e?n=i+1:r=i}return t.length===0?0:n/t.length}}function j(e){let t;for(let n of e)(!t||n.cognitiveComplexity>t.cognitiveComplexity||n.cognitiveComplexity===t.cognitiveComplexity&&n.ncss>t.ncss)&&(t=n);if(t)return{name:_(t),startLine:t.startLine,endLine:t.endLine,cognitiveComplexity:t.cognitiveComplexity,ncss:t.ncss,nestingDepth:t.nestingDepth}}function M(e,t,n){let r=t.slice(0,n.top);g(JSON.stringify({summary:F(e.files),totalRankedFiles:t.length,truncated:r.length<t.length,files:r,errors:e.errors,warnings:e.warnings},void 0,2)+`
+`)}function N(e,t,n,r){if(t.fatalError){h(`Error: ${t.fatalError}\n`);return}let i=F(t.files);if(g(`Measured ${i.fileCount} files under ${e} (code LOC ${i.linesOfCode}, NCSS ${i.ncssCount}, functions ${i.functionCount})\n`),n.length===0)g(`No measurable files found.
+`);else{let e=n.slice(0,r.top),t=n.length>e.length?` of ${n.length}`:``;g(`\nRefactoring candidates (top ${e.length}${t}):\n`);for(let[t,n]of e.entries())g(`${t+1}. ${P(n)}\n`)}if(t.warnings.length>0){h(`\nDegraded ${t.warnings.length} files (measured, but excluded from cross-file matching):\n`);for(let e of t.warnings.slice(0,10))h(`- ${e}\n`);t.warnings.length>10&&h(`- ... ${t.warnings.length-10} more\n`)}if(t.errors.length>0){h(`\nSkipped ${t.errors.length} files or directories:\n`);for(let e of t.errors.slice(0,10))h(`- ${e}\n`);t.errors.length>10&&h(`- ... ${t.errors.length-10} more\n`)}}function P(e){let t=[];if(e.worstFunction){let n=e.worstFunction;t.push(`worst function ${n.name} (L${n.startLine}-${n.endLine}) cognitive ${n.cognitiveComplexity}, NCSS ${n.ncss}, nesting ${n.nestingDepth}`)}if(e.duplicatedLineCount>0){let n=e.crossFilePartners.length>0?`, shared with ${e.crossFilePartners.slice(0,3).join(`, `)}${e.crossFilePartners.length>3?`, ...`:``}`:``;t.push(`duplicated lines ${e.duplicatedLineCount} (${Math.round(e.duplicatedLineRatio*100)}%${n})`)}return t.push(`file NCSS ${e.ncss}`),`${e.file} (score ${e.score.toFixed(2)}): ${t.join(`; `)}`}function F(e){let t=0,n=0,r=0,i=0;for(let a of e)t+=a.metrics.functions.length,n+=a.metrics.lines.code,r=Math.max(r,a.metrics.maxCognitiveComplexity),i+=a.metrics.ncssCount;return{fileCount:e.length,functionCount:t,linesOfCode:n,maxCognitiveComplexity:r,ncssCount:i}}function I(e){if(e===`off`)return 1/0;let t=e.trim()===``?NaN:Number(e);if(!Number.isFinite(t)||t<0)throw new S(`Expected a non-negative number or "off".`);return t}function L(e){let t=z(e);if(t>100)throw new S(`Expected an integer between 1 and 100.`);return t}function R(e){if(!/^\d+$/u.test(e))throw new S(`Expected a non-negative integer.`);let t=Number(e);if(!Number.isSafeInteger(t)||t<0)throw new S(`Expected a non-negative integer.`);return t}function z(e){let t=b(e);if(t===void 0)throw new S(`Expected a positive integer.`);return t}
 //# sourceMappingURL=cli.js.map

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 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 `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: worst.name ?? '<anonymous>',\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":";8oBAiEK,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,+CAA+C,IAAU,QAAU,WAAa,cAEzF,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,EAAM,MAAQ,cACpB,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":[],"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"}

package/dist/index.d.ts

@@ -3,4 +3,4 @@ export type { CrossFileDuplicateBlockGroup, CrossFileDuplicateOccurrence, CrossF
 export type { CrossFileDuplicateCandidate, CrossFileDuplicationFileData } from './duplication.js';
 export { defaultLanguages, detectLanguage, supportedLanguages } from './languages.js';
 export { TreeMeasurer, collectCrossFileDuplicationFileData, collectDuplicationCandidates, collectFunctionTokenSequences, defaultMeasurer, measureCode, } from './metrics.js';
-export type { CodeMetrics, DuplicationMetrics, DuplicationOptions, FunctionMetrics, HalsteadMetrics, LanguageDefinition, LanguageName, LineMetrics, MeasureOptions, SupportedLanguage, } from './types.js';
+export type { CodeMetrics, CognitiveBlock, DuplicationMetrics, DuplicationOptions, FunctionMetrics, HalsteadMetrics, LanguageDefinition, LanguageName, LineMetrics, MeasureOptions, SupportedLanguage, } from './types.js';

package/dist/metrics.cjs

@@ -1,2 +1,2 @@
-"use strict";const e=require("./languages.cjs"),t=require("./nativeMetrics.cjs");var n=class{registry=e.createLanguageRegistry();getSupportedLanguages(){return[...new Set([...this.registry.values()].map(e=>e.name))]}measure(e,n){let r=this.resolveLanguage(n.language),i=n.includeSyntaxTree??!1;return a(t.measureCodeNative(e,r.name,i,n.duplication),i)}measureWithCrossFileData(e,n){let i=this.resolveLanguage(n.language),a=n.includeSyntaxTree??!1;return r(t.measureCodeNative(e,i.name,a,n.duplication,!0),a)}async measureWithCrossFileDataAsync(e,n){let i=this.resolveLanguage(n.language),a=n.includeSyntaxTree??!1;return r(await t.measureCodeNativeAsync(e,i.name,a,n.duplication,!0),a)}collectDuplicationCandidates(e,t){return this.collectCrossFileDuplicationFileData(e,t).candidates}collectCrossFileDuplicationFileData(e,n){let r=this.resolveLanguage(n.language);return i(t.collectCrossFileDataNative(e,r.name,n.duplication?.minTokens))}collectFunctionTokenSequences(e,n){let r=this.resolveLanguage(n.language);return t.collectFunctionTokenSequencesNative(e,r.name)}resolveLanguage(e){let t=this.registry.get(e);if(!t)throw Error(`Unsupported language: ${e}`);return t}};function r(e,t){if(!e.crossFileData)throw Error(`The native addon returned no cross-file duplication data`);return{metrics:a(e,t),crossFileData:i(e.crossFileData)}}function i(e){return{candidates:e.candidates,tokens:e.tokens,containerStatements:e.containerStatements,nearMissBlocks:e.nearMissBlocks,codeLineNumbers:new Set(e.codeLineNumbers)}}function a(e,t){return{language:e.language,bytes:e.bytes,lines:e.lines,functions:e.functions.map(e=>({name:e.name,nodeType:e.nodeType,startLine:e.startLine,startColumn:e.startColumn,endLine:e.endLine,endColumn:e.endColumn,cyclomaticComplexity:e.cyclomaticComplexity,cognitiveComplexity:e.cognitiveComplexity,nestingDepth:e.nestingDepth,ncss:e.ncss,parameterCount:e.parameterCount,halstead:o(e.halsteadCounts),depDegree:e.depDegree})),cyclomaticComplexity:e.cyclomaticComplexity,cognitiveComplexity:e.cognitiveComplexity,maxCognitiveComplexity:e.maxCognitiveComplexity,nestingDepth:e.nestingDepth,ncssCount:e.ncssCount,duplication:e.duplication,halstead:o(e.halsteadCounts),syntaxTree:t?e.syntaxTree:void 0}}function o(e){let{distinctOperators:t,distinctOperands:n,totalOperators:r,totalOperands:i}=e,a=t+n,o=r+i,s=a===0?0:o*Math.log2(a),c=n===0?0:t/2*(i/n);return{distinctOperators:t,distinctOperands:n,totalOperators:r,totalOperands:i,vocabulary:a,length:o,volume:s,difficulty:c,effort:c*s}}const s=new n;function c(e,t){return s.measure(e,t)}function l(e,t){return s.measureWithCrossFileDataAsync(e,t)}function u(e,t){return s.collectDuplicationCandidates(e,t)}function d(e,t){return s.collectFunctionTokenSequences(e,t)}function f(e,t){return s.collectCrossFileDuplicationFileData(e,t)}exports.TreeMeasurer=n,exports.collectCrossFileDuplicationFileData=f,exports.collectDuplicationCandidates=u,exports.collectFunctionTokenSequences=d,exports.defaultMeasurer=s,exports.measureCode=c,exports.measureCodeWithCrossFileDataAsync=l;
+"use strict";const e=require("./languages.cjs"),t=require("./nativeMetrics.cjs");var n=class{registry=e.createLanguageRegistry();getSupportedLanguages(){return[...new Set([...this.registry.values()].map(e=>e.name))]}measure(e,n){let r=this.resolveLanguage(n.language),i=n.includeSyntaxTree??!1;return a(t.measureCodeNative(e,r.name,i,n.duplication),i)}measureWithCrossFileData(e,n){let i=this.resolveLanguage(n.language),a=n.includeSyntaxTree??!1;return r(t.measureCodeNative(e,i.name,a,n.duplication,!0),a)}async measureWithCrossFileDataAsync(e,n){let i=this.resolveLanguage(n.language),a=n.includeSyntaxTree??!1;return r(await t.measureCodeNativeAsync(e,i.name,a,n.duplication,!0),a)}collectDuplicationCandidates(e,t){return this.collectCrossFileDuplicationFileData(e,t).candidates}collectCrossFileDuplicationFileData(e,n){let r=this.resolveLanguage(n.language);return i(t.collectCrossFileDataNative(e,r.name,n.duplication?.minTokens))}collectFunctionTokenSequences(e,n){let r=this.resolveLanguage(n.language);return t.collectFunctionTokenSequencesNative(e,r.name)}resolveLanguage(e){let t=this.registry.get(e);if(!t)throw Error(`Unsupported language: ${e}`);return t}};function r(e,t){if(!e.crossFileData)throw Error(`The native addon returned no cross-file duplication data`);return{metrics:a(e,t),crossFileData:i(e.crossFileData)}}function i(e){return{candidates:e.candidates,tokens:e.tokens,containerStatements:e.containerStatements,nearMissBlocks:e.nearMissBlocks,codeLineNumbers:new Set(e.codeLineNumbers)}}function a(e,t){return{language:e.language,bytes:e.bytes,lines:e.lines,codeLineNumbers:e.codeLineNumbers,functions:e.functions.map(e=>({name:e.name,containerName:e.containerName,nodeType:e.nodeType,startLine:e.startLine,startColumn:e.startColumn,endLine:e.endLine,endColumn:e.endColumn,cyclomaticComplexity:e.cyclomaticComplexity,cognitiveComplexity:e.cognitiveComplexity,cognitiveBlocks:e.cognitiveBlocks??[],nestingDepth:e.nestingDepth,ncss:e.ncss,parameterCount:e.parameterCount,halstead:o(e.halsteadCounts),depDegree:e.depDegree})),cyclomaticComplexity:e.cyclomaticComplexity,cognitiveComplexity:e.cognitiveComplexity,maxCognitiveComplexity:e.maxCognitiveComplexity,nestingDepth:e.nestingDepth,ncssCount:e.ncssCount,duplication:e.duplication,halstead:o(e.halsteadCounts),syntaxTree:t?e.syntaxTree:void 0}}function o(e){let{distinctOperators:t,distinctOperands:n,totalOperators:r,totalOperands:i}=e,a=t+n,o=r+i,s=a===0?0:o*Math.log2(a),c=n===0?0:t/2*(i/n);return{distinctOperators:t,distinctOperands:n,totalOperators:r,totalOperands:i,vocabulary:a,length:o,volume:s,difficulty:c,effort:c*s}}const s=new n;function c(e,t){return s.measure(e,t)}function l(e,t){return s.measureWithCrossFileDataAsync(e,t)}function u(e,t){return s.collectDuplicationCandidates(e,t)}function d(e,t){return s.collectFunctionTokenSequences(e,t)}function f(e,t){return s.collectCrossFileDuplicationFileData(e,t)}exports.TreeMeasurer=n,exports.collectCrossFileDuplicationFileData=f,exports.collectDuplicationCandidates=u,exports.collectFunctionTokenSequences=d,exports.defaultMeasurer=s,exports.measureCode=c,exports.measureCodeWithCrossFileDataAsync=l;
 //# sourceMappingURL=metrics.cjs.map

package/dist/metrics.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"metrics.cjs","names":["createLanguageRegistry","measureCodeNative","measureCodeNativeAsync","collectCrossFileDataNative","collectFunctionTokenSequencesNative"],"sources":["../src/metrics.ts"],"sourcesContent":["import type { CrossFileDuplicateCandidate, CrossFileDuplicationFileData } from './duplication.js';\nimport { createLanguageRegistry } from './languages.js';\nimport {\n  collectCrossFileDataNative,\n  collectFunctionTokenSequencesNative,\n  measureCodeNative,\n  measureCodeNativeAsync,\n  type NativeCrossFileDataPayload,\n  type NativeHalsteadCounts,\n  type NativeMetricsPayload,\n} from './nativeMetrics.js';\nimport type { CodeMetrics, HalsteadMetrics, LanguageDefinition, LanguageName, MeasureOptions } from './types.js';\n\n/**\n * Measures code metrics for the built-in languages. Parsing and metric passes run in the bundled\n * Rust addon (tree-sitter); this class resolves language aliases, crosses the N-API boundary, and\n * derives the Halstead float metrics from the natively measured counts.\n */\nexport class TreeMeasurer {\n  private readonly registry = createLanguageRegistry();\n\n  getSupportedLanguages(): LanguageName[] {\n    return [...new Set([...this.registry.values()].map((language) => language.name))];\n  }\n\n  measure(code: string, options: MeasureOptions): CodeMetrics {\n    const language = this.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = measureCodeNative(code, language.name, includeSyntaxTree, options.duplication);\n    return assembleNativeMetrics(payload, includeSyntaxTree);\n  }\n\n  /** Measures a file and collects its cross-file clone-detection contribution from one parse. */\n  measureWithCrossFileData(\n    code: string,\n    options: MeasureOptions\n  ): { metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData } {\n    const language = this.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = measureCodeNative(code, language.name, includeSyntaxTree, options.duplication, true);\n    return assembleMetricsWithCrossFileData(payload, includeSyntaxTree);\n  }\n\n  /** measureWithCrossFileData on the native addon's worker threads, for measuring files in parallel. */\n  async measureWithCrossFileDataAsync(\n    code: string,\n    options: MeasureOptions\n  ): Promise<{ metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData }> {\n    const language = this.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = await measureCodeNativeAsync(code, language.name, includeSyntaxTree, options.duplication, true);\n    return assembleMetricsWithCrossFileData(payload, includeSyntaxTree);\n  }\n\n  /** Collects one file's duplicate candidates for cross-file clone detection. */\n  collectDuplicationCandidates(code: string, options: MeasureOptions): CrossFileDuplicateCandidate[] {\n    return this.collectCrossFileDuplicationFileData(code, options).candidates;\n  }\n\n  /**\n   * Collects one file's duplicate candidates, normalized tokens, and statement structure for\n   * cross-file clone detection with measureCrossFileDuplication.\n   */\n  collectCrossFileDuplicationFileData(code: string, options: MeasureOptions): CrossFileDuplicationFileData {\n    const language = this.resolveLanguage(options.language);\n    return toCrossFileDuplicationFileData(\n      collectCrossFileDataNative(code, language.name, options.duplication?.minTokens)\n    );\n  }\n\n  /**\n   * Normalized token hash sequences of every function, index-parallel to the functions array of\n   * measure(): identifiers are anonymized by first occurrence within the function, literals by\n   * kind, and keywords/operators kept verbatim.\n   */\n  collectFunctionTokenSequences(code: string, options: MeasureOptions): Int32Array[] {\n    const language = this.resolveLanguage(options.language);\n    return collectFunctionTokenSequencesNative(code, language.name);\n  }\n\n  private resolveLanguage(name: LanguageName): LanguageDefinition {\n    const language = this.registry.get(name);\n    if (!language) {\n      throw new Error(`Unsupported language: ${name}`);\n    }\n    return language;\n  }\n}\n\nfunction assembleMetricsWithCrossFileData(\n  payload: NativeMetricsPayload,\n  includeSyntaxTree: boolean\n): { metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData } {\n  if (!payload.crossFileData) {\n    throw new Error('The native addon returned no cross-file duplication data');\n  }\n  return {\n    metrics: assembleNativeMetrics(payload, includeSyntaxTree),\n    crossFileData: toCrossFileDuplicationFileData(payload.crossFileData),\n  };\n}\n\nfunction toCrossFileDuplicationFileData(payload: NativeCrossFileDataPayload): CrossFileDuplicationFileData {\n  return {\n    candidates: payload.candidates,\n    tokens: payload.tokens,\n    containerStatements: payload.containerStatements,\n    nearMissBlocks: payload.nearMissBlocks,\n    // Lets cross-file line coverage count only code lines, like within-file coverage.\n    codeLineNumbers: new Set(payload.codeLineNumbers),\n  };\n}\n\n/**\n * Completes a native measurement into CodeMetrics. The object is rebuilt field by field (rather\n * than spread from the parsed JSON) so the result has a stable shape, including\n * explicitly-undefined optional keys.\n */\nfunction assembleNativeMetrics(payload: NativeMetricsPayload, includeSyntaxTree: boolean): CodeMetrics {\n  return {\n    language: payload.language,\n    bytes: payload.bytes,\n    lines: payload.lines,\n    functions: payload.functions.map((fn) => ({\n      name: fn.name,\n      nodeType: fn.nodeType,\n      startLine: fn.startLine,\n      startColumn: fn.startColumn,\n      endLine: fn.endLine,\n      endColumn: fn.endColumn,\n      cyclomaticComplexity: fn.cyclomaticComplexity,\n      cognitiveComplexity: fn.cognitiveComplexity,\n      nestingDepth: fn.nestingDepth,\n      ncss: fn.ncss,\n      parameterCount: fn.parameterCount,\n      halstead: deriveHalsteadMetrics(fn.halsteadCounts),\n      depDegree: fn.depDegree,\n    })),\n    cyclomaticComplexity: payload.cyclomaticComplexity,\n    cognitiveComplexity: payload.cognitiveComplexity,\n    maxCognitiveComplexity: payload.maxCognitiveComplexity,\n    nestingDepth: payload.nestingDepth,\n    ncssCount: payload.ncssCount,\n    duplication: payload.duplication,\n    halstead: deriveHalsteadMetrics(payload.halsteadCounts),\n    syntaxTree: includeSyntaxTree ? payload.syntaxTree : undefined,\n  };\n}\n\nfunction deriveHalsteadMetrics(counts: NativeHalsteadCounts): HalsteadMetrics {\n  const { distinctOperators, distinctOperands, totalOperators, totalOperands } = counts;\n  const vocabulary = distinctOperators + distinctOperands;\n  const length = totalOperators + totalOperands;\n  const volume = vocabulary === 0 ? 0 : length * Math.log2(vocabulary);\n  const difficulty = distinctOperands === 0 ? 0 : (distinctOperators / 2) * (totalOperands / distinctOperands);\n  const effort = difficulty * volume;\n\n  return {\n    distinctOperators,\n    distinctOperands,\n    totalOperators,\n    totalOperands,\n    vocabulary,\n    length,\n    volume,\n    difficulty,\n    effort,\n  };\n}\n\nexport const defaultMeasurer = new TreeMeasurer();\n\nexport function measureCode(code: string, options: MeasureOptions): CodeMetrics {\n  return defaultMeasurer.measure(code, options);\n}\n\n/** Standalone helper mirroring TreeMeasurer.measureWithCrossFileDataAsync for the default measurer. */\nexport function measureCodeWithCrossFileDataAsync(\n  code: string,\n  options: MeasureOptions\n): Promise<{ metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData }> {\n  return defaultMeasurer.measureWithCrossFileDataAsync(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectDuplicationCandidates(code: string, options: MeasureOptions): CrossFileDuplicateCandidate[] {\n  return defaultMeasurer.collectDuplicationCandidates(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectFunctionTokenSequences(code: string, options: MeasureOptions): Int32Array[] {\n  return defaultMeasurer.collectFunctionTokenSequences(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectCrossFileDuplicationFileData(\n  code: string,\n  options: MeasureOptions\n): CrossFileDuplicationFileData {\n  return defaultMeasurer.collectCrossFileDuplicationFileData(code, options);\n}\n"],"mappings":"iFAkBA,IAAa,EAAb,KAA0B,CACxB,SAA4BA,EAAAA,uBAAuB,EAEnD,uBAAwC,CACtC,MAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS,OAAO,CAAC,CAAC,CAAC,IAAK,GAAa,EAAS,IAAI,CAAC,CAAC,CAClF,CAEA,QAAQ,EAAc,EAAsC,CAC1D,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EADSC,EAAAA,kBAAkB,EAAM,EAAS,KAAM,EAAmB,EAAQ,WAC/C,EAAG,CAAiB,CACzD,CAGA,yBACE,EACA,EACuE,CACvE,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EADSA,EAAAA,kBAAkB,EAAM,EAAS,KAAM,EAAmB,EAAQ,YAAa,EACjD,EAAG,CAAiB,CACpE,CAGA,MAAM,8BACJ,EACA,EACgF,CAChF,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EAAiC,MADlBC,EAAAA,uBAAuB,EAAM,EAAS,KAAM,EAAmB,EAAQ,YAAa,EAAI,EAC7D,CAAiB,CACpE,CAGA,6BAA6B,EAAc,EAAwD,CACjG,OAAO,KAAK,oCAAoC,EAAM,CAAO,CAAC,CAAC,UACjE,CAMA,oCAAoC,EAAc,EAAuD,CACvG,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EACtD,OAAO,EACLC,EAAAA,2BAA2B,EAAM,EAAS,KAAM,EAAQ,aAAa,SAAS,CAChF,CACF,CAOA,8BAA8B,EAAc,EAAuC,CACjF,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EACtD,OAAOC,EAAAA,oCAAoC,EAAM,EAAS,IAAI,CAChE,CAEA,gBAAwB,EAAwC,CAC9D,IAAM,EAAW,KAAK,SAAS,IAAI,CAAI,EACvC,GAAI,CAAC,EACH,MAAU,MAAM,yBAAyB,GAAM,EAEjD,OAAO,CACT,CACF,EAEA,SAAS,EACP,EACA,EACuE,CACvE,GAAI,CAAC,EAAQ,cACX,MAAU,MAAM,0DAA0D,EAE5E,MAAO,CACL,QAAS,EAAsB,EAAS,CAAiB,EACzD,cAAe,EAA+B,EAAQ,aAAa,CACrE,CACF,CAEA,SAAS,EAA+B,EAAmE,CACzG,MAAO,CACL,WAAY,EAAQ,WACpB,OAAQ,EAAQ,OAChB,oBAAqB,EAAQ,oBAC7B,eAAgB,EAAQ,eAExB,gBAAiB,IAAI,IAAI,EAAQ,eAAe,CAClD,CACF,CAOA,SAAS,EAAsB,EAA+B,EAAyC,CACrG,MAAO,CACL,SAAU,EAAQ,SAClB,MAAO,EAAQ,MACf,MAAO,EAAQ,MACf,UAAW,EAAQ,UAAU,IAAK,IAAQ,CACxC,KAAM,EAAG,KACT,SAAU,EAAG,SACb,UAAW,EAAG,UACd,YAAa,EAAG,YAChB,QAAS,EAAG,QACZ,UAAW,EAAG,UACd,qBAAsB,EAAG,qBACzB,oBAAqB,EAAG,oBACxB,aAAc,EAAG,aACjB,KAAM,EAAG,KACT,eAAgB,EAAG,eACnB,SAAU,EAAsB,EAAG,cAAc,EACjD,UAAW,EAAG,SAChB,EAAE,EACF,qBAAsB,EAAQ,qBAC9B,oBAAqB,EAAQ,oBAC7B,uBAAwB,EAAQ,uBAChC,aAAc,EAAQ,aACtB,UAAW,EAAQ,UACnB,YAAa,EAAQ,YACrB,SAAU,EAAsB,EAAQ,cAAc,EACtD,WAAY,EAAoB,EAAQ,WAAa,IAAA,EACvD,CACF,CAEA,SAAS,EAAsB,EAA+C,CAC5E,GAAM,CAAE,oBAAmB,mBAAkB,iBAAgB,iBAAkB,EACzE,EAAa,EAAoB,EACjC,EAAS,EAAiB,EAC1B,EAAS,IAAe,EAAI,EAAI,EAAS,KAAK,KAAK,CAAU,EAC7D,EAAa,IAAqB,EAAI,EAAK,EAAoB,GAAM,EAAgB,GAG3F,MAAO,CACL,oBACA,mBACA,iBACA,gBACA,aACA,SACA,SACA,aACA,OAXa,EAAa,CAY5B,CACF,CAEA,MAAa,EAAkB,IAAI,EAEnC,SAAgB,EAAY,EAAc,EAAsC,CAC9E,OAAO,EAAgB,QAAQ,EAAM,CAAO,CAC9C,CAGA,SAAgB,EACd,EACA,EACgF,CAChF,OAAO,EAAgB,8BAA8B,EAAM,CAAO,CACpE,CAGA,SAAgB,EAA6B,EAAc,EAAwD,CACjH,OAAO,EAAgB,6BAA6B,EAAM,CAAO,CACnE,CAGA,SAAgB,EAA8B,EAAc,EAAuC,CACjG,OAAO,EAAgB,8BAA8B,EAAM,CAAO,CACpE,CAGA,SAAgB,EACd,EACA,EAC8B,CAC9B,OAAO,EAAgB,oCAAoC,EAAM,CAAO,CAC1E"}
+{"version":3,"file":"metrics.cjs","names":["createLanguageRegistry","measureCodeNative","measureCodeNativeAsync","collectCrossFileDataNative","collectFunctionTokenSequencesNative"],"sources":["../src/metrics.ts"],"sourcesContent":["import type { CrossFileDuplicateCandidate, CrossFileDuplicationFileData } from './duplication.js';\nimport { createLanguageRegistry } from './languages.js';\nimport {\n  collectCrossFileDataNative,\n  collectFunctionTokenSequencesNative,\n  measureCodeNative,\n  measureCodeNativeAsync,\n  type NativeCrossFileDataPayload,\n  type NativeHalsteadCounts,\n  type NativeMetricsPayload,\n} from './nativeMetrics.js';\nimport type { CodeMetrics, HalsteadMetrics, LanguageDefinition, LanguageName, MeasureOptions } from './types.js';\n\n/**\n * Measures code metrics for the built-in languages. Parsing and metric passes run in the bundled\n * Rust addon (tree-sitter); this class resolves language aliases, crosses the N-API boundary, and\n * derives the Halstead float metrics from the natively measured counts.\n */\nexport class TreeMeasurer {\n  private readonly registry = createLanguageRegistry();\n\n  getSupportedLanguages(): LanguageName[] {\n    return [...new Set([...this.registry.values()].map((language) => language.name))];\n  }\n\n  measure(code: string, options: MeasureOptions): CodeMetrics {\n    const language = this.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = measureCodeNative(code, language.name, includeSyntaxTree, options.duplication);\n    return assembleNativeMetrics(payload, includeSyntaxTree);\n  }\n\n  /** Measures a file and collects its cross-file clone-detection contribution from one parse. */\n  measureWithCrossFileData(\n    code: string,\n    options: MeasureOptions\n  ): { metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData } {\n    const language = this.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = measureCodeNative(code, language.name, includeSyntaxTree, options.duplication, true);\n    return assembleMetricsWithCrossFileData(payload, includeSyntaxTree);\n  }\n\n  /** measureWithCrossFileData on the native addon's worker threads, for measuring files in parallel. */\n  async measureWithCrossFileDataAsync(\n    code: string,\n    options: MeasureOptions\n  ): Promise<{ metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData }> {\n    const language = this.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = await measureCodeNativeAsync(code, language.name, includeSyntaxTree, options.duplication, true);\n    return assembleMetricsWithCrossFileData(payload, includeSyntaxTree);\n  }\n\n  /** Collects one file's duplicate candidates for cross-file clone detection. */\n  collectDuplicationCandidates(code: string, options: MeasureOptions): CrossFileDuplicateCandidate[] {\n    return this.collectCrossFileDuplicationFileData(code, options).candidates;\n  }\n\n  /**\n   * Collects one file's duplicate candidates, normalized tokens, and statement structure for\n   * cross-file clone detection with measureCrossFileDuplication.\n   */\n  collectCrossFileDuplicationFileData(code: string, options: MeasureOptions): CrossFileDuplicationFileData {\n    const language = this.resolveLanguage(options.language);\n    return toCrossFileDuplicationFileData(\n      collectCrossFileDataNative(code, language.name, options.duplication?.minTokens)\n    );\n  }\n\n  /**\n   * Normalized token hash sequences of every function, index-parallel to the functions array of\n   * measure(): identifiers are anonymized by first occurrence within the function, literals by\n   * kind, and keywords/operators kept verbatim.\n   */\n  collectFunctionTokenSequences(code: string, options: MeasureOptions): Int32Array[] {\n    const language = this.resolveLanguage(options.language);\n    return collectFunctionTokenSequencesNative(code, language.name);\n  }\n\n  private resolveLanguage(name: LanguageName): LanguageDefinition {\n    const language = this.registry.get(name);\n    if (!language) {\n      throw new Error(`Unsupported language: ${name}`);\n    }\n    return language;\n  }\n}\n\nfunction assembleMetricsWithCrossFileData(\n  payload: NativeMetricsPayload,\n  includeSyntaxTree: boolean\n): { metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData } {\n  if (!payload.crossFileData) {\n    throw new Error('The native addon returned no cross-file duplication data');\n  }\n  return {\n    metrics: assembleNativeMetrics(payload, includeSyntaxTree),\n    crossFileData: toCrossFileDuplicationFileData(payload.crossFileData),\n  };\n}\n\nfunction toCrossFileDuplicationFileData(payload: NativeCrossFileDataPayload): CrossFileDuplicationFileData {\n  return {\n    candidates: payload.candidates,\n    tokens: payload.tokens,\n    containerStatements: payload.containerStatements,\n    nearMissBlocks: payload.nearMissBlocks,\n    // Lets cross-file line coverage count only code lines, like within-file coverage.\n    codeLineNumbers: new Set(payload.codeLineNumbers),\n  };\n}\n\n/**\n * Completes a native measurement into CodeMetrics. The object is rebuilt field by field (rather\n * than spread from the parsed JSON) so the result has a stable shape, including\n * explicitly-undefined optional keys.\n */\nfunction assembleNativeMetrics(payload: NativeMetricsPayload, includeSyntaxTree: boolean): CodeMetrics {\n  return {\n    language: payload.language,\n    bytes: payload.bytes,\n    lines: payload.lines,\n    codeLineNumbers: payload.codeLineNumbers,\n    functions: payload.functions.map((fn) => ({\n      name: fn.name,\n      containerName: fn.containerName,\n      nodeType: fn.nodeType,\n      startLine: fn.startLine,\n      startColumn: fn.startColumn,\n      endLine: fn.endLine,\n      endColumn: fn.endColumn,\n      cyclomaticComplexity: fn.cyclomaticComplexity,\n      cognitiveComplexity: fn.cognitiveComplexity,\n      cognitiveBlocks: fn.cognitiveBlocks ?? [],\n      nestingDepth: fn.nestingDepth,\n      ncss: fn.ncss,\n      parameterCount: fn.parameterCount,\n      halstead: deriveHalsteadMetrics(fn.halsteadCounts),\n      depDegree: fn.depDegree,\n    })),\n    cyclomaticComplexity: payload.cyclomaticComplexity,\n    cognitiveComplexity: payload.cognitiveComplexity,\n    maxCognitiveComplexity: payload.maxCognitiveComplexity,\n    nestingDepth: payload.nestingDepth,\n    ncssCount: payload.ncssCount,\n    duplication: payload.duplication,\n    halstead: deriveHalsteadMetrics(payload.halsteadCounts),\n    syntaxTree: includeSyntaxTree ? payload.syntaxTree : undefined,\n  };\n}\n\nfunction deriveHalsteadMetrics(counts: NativeHalsteadCounts): HalsteadMetrics {\n  const { distinctOperators, distinctOperands, totalOperators, totalOperands } = counts;\n  const vocabulary = distinctOperators + distinctOperands;\n  const length = totalOperators + totalOperands;\n  const volume = vocabulary === 0 ? 0 : length * Math.log2(vocabulary);\n  const difficulty = distinctOperands === 0 ? 0 : (distinctOperators / 2) * (totalOperands / distinctOperands);\n  const effort = difficulty * volume;\n\n  return {\n    distinctOperators,\n    distinctOperands,\n    totalOperators,\n    totalOperands,\n    vocabulary,\n    length,\n    volume,\n    difficulty,\n    effort,\n  };\n}\n\nexport const defaultMeasurer = new TreeMeasurer();\n\nexport function measureCode(code: string, options: MeasureOptions): CodeMetrics {\n  return defaultMeasurer.measure(code, options);\n}\n\n/** Standalone helper mirroring TreeMeasurer.measureWithCrossFileDataAsync for the default measurer. */\nexport function measureCodeWithCrossFileDataAsync(\n  code: string,\n  options: MeasureOptions\n): Promise<{ metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData }> {\n  return defaultMeasurer.measureWithCrossFileDataAsync(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectDuplicationCandidates(code: string, options: MeasureOptions): CrossFileDuplicateCandidate[] {\n  return defaultMeasurer.collectDuplicationCandidates(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectFunctionTokenSequences(code: string, options: MeasureOptions): Int32Array[] {\n  return defaultMeasurer.collectFunctionTokenSequences(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectCrossFileDuplicationFileData(\n  code: string,\n  options: MeasureOptions\n): CrossFileDuplicationFileData {\n  return defaultMeasurer.collectCrossFileDuplicationFileData(code, options);\n}\n"],"mappings":"iFAkBA,IAAa,EAAb,KAA0B,CACxB,SAA4BA,EAAAA,uBAAuB,EAEnD,uBAAwC,CACtC,MAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS,OAAO,CAAC,CAAC,CAAC,IAAK,GAAa,EAAS,IAAI,CAAC,CAAC,CAClF,CAEA,QAAQ,EAAc,EAAsC,CAC1D,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EADSC,EAAAA,kBAAkB,EAAM,EAAS,KAAM,EAAmB,EAAQ,WAC/C,EAAG,CAAiB,CACzD,CAGA,yBACE,EACA,EACuE,CACvE,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EADSA,EAAAA,kBAAkB,EAAM,EAAS,KAAM,EAAmB,EAAQ,YAAa,EACjD,EAAG,CAAiB,CACpE,CAGA,MAAM,8BACJ,EACA,EACgF,CAChF,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EAAiC,MADlBC,EAAAA,uBAAuB,EAAM,EAAS,KAAM,EAAmB,EAAQ,YAAa,EAAI,EAC7D,CAAiB,CACpE,CAGA,6BAA6B,EAAc,EAAwD,CACjG,OAAO,KAAK,oCAAoC,EAAM,CAAO,CAAC,CAAC,UACjE,CAMA,oCAAoC,EAAc,EAAuD,CACvG,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EACtD,OAAO,EACLC,EAAAA,2BAA2B,EAAM,EAAS,KAAM,EAAQ,aAAa,SAAS,CAChF,CACF,CAOA,8BAA8B,EAAc,EAAuC,CACjF,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EACtD,OAAOC,EAAAA,oCAAoC,EAAM,EAAS,IAAI,CAChE,CAEA,gBAAwB,EAAwC,CAC9D,IAAM,EAAW,KAAK,SAAS,IAAI,CAAI,EACvC,GAAI,CAAC,EACH,MAAU,MAAM,yBAAyB,GAAM,EAEjD,OAAO,CACT,CACF,EAEA,SAAS,EACP,EACA,EACuE,CACvE,GAAI,CAAC,EAAQ,cACX,MAAU,MAAM,0DAA0D,EAE5E,MAAO,CACL,QAAS,EAAsB,EAAS,CAAiB,EACzD,cAAe,EAA+B,EAAQ,aAAa,CACrE,CACF,CAEA,SAAS,EAA+B,EAAmE,CACzG,MAAO,CACL,WAAY,EAAQ,WACpB,OAAQ,EAAQ,OAChB,oBAAqB,EAAQ,oBAC7B,eAAgB,EAAQ,eAExB,gBAAiB,IAAI,IAAI,EAAQ,eAAe,CAClD,CACF,CAOA,SAAS,EAAsB,EAA+B,EAAyC,CACrG,MAAO,CACL,SAAU,EAAQ,SAClB,MAAO,EAAQ,MACf,MAAO,EAAQ,MACf,gBAAiB,EAAQ,gBACzB,UAAW,EAAQ,UAAU,IAAK,IAAQ,CACxC,KAAM,EAAG,KACT,cAAe,EAAG,cAClB,SAAU,EAAG,SACb,UAAW,EAAG,UACd,YAAa,EAAG,YAChB,QAAS,EAAG,QACZ,UAAW,EAAG,UACd,qBAAsB,EAAG,qBACzB,oBAAqB,EAAG,oBACxB,gBAAiB,EAAG,iBAAmB,CAAC,EACxC,aAAc,EAAG,aACjB,KAAM,EAAG,KACT,eAAgB,EAAG,eACnB,SAAU,EAAsB,EAAG,cAAc,EACjD,UAAW,EAAG,SAChB,EAAE,EACF,qBAAsB,EAAQ,qBAC9B,oBAAqB,EAAQ,oBAC7B,uBAAwB,EAAQ,uBAChC,aAAc,EAAQ,aACtB,UAAW,EAAQ,UACnB,YAAa,EAAQ,YACrB,SAAU,EAAsB,EAAQ,cAAc,EACtD,WAAY,EAAoB,EAAQ,WAAa,IAAA,EACvD,CACF,CAEA,SAAS,EAAsB,EAA+C,CAC5E,GAAM,CAAE,oBAAmB,mBAAkB,iBAAgB,iBAAkB,EACzE,EAAa,EAAoB,EACjC,EAAS,EAAiB,EAC1B,EAAS,IAAe,EAAI,EAAI,EAAS,KAAK,KAAK,CAAU,EAC7D,EAAa,IAAqB,EAAI,EAAK,EAAoB,GAAM,EAAgB,GAG3F,MAAO,CACL,oBACA,mBACA,iBACA,gBACA,aACA,SACA,SACA,aACA,OAXa,EAAa,CAY5B,CACF,CAEA,MAAa,EAAkB,IAAI,EAEnC,SAAgB,EAAY,EAAc,EAAsC,CAC9E,OAAO,EAAgB,QAAQ,EAAM,CAAO,CAC9C,CAGA,SAAgB,EACd,EACA,EACgF,CAChF,OAAO,EAAgB,8BAA8B,EAAM,CAAO,CACpE,CAGA,SAAgB,EAA6B,EAAc,EAAwD,CACjH,OAAO,EAAgB,6BAA6B,EAAM,CAAO,CACnE,CAGA,SAAgB,EAA8B,EAAc,EAAuC,CACjG,OAAO,EAAgB,8BAA8B,EAAM,CAAO,CACpE,CAGA,SAAgB,EACd,EACA,EAC8B,CAC9B,OAAO,EAAgB,oCAAoC,EAAM,CAAO,CAC1E"}

package/dist/metrics.js

@@ -1,2 +1,2 @@
-import{createLanguageRegistry as e}from"./languages.js";import{collectCrossFileDataNative as t,collectFunctionTokenSequencesNative as n,measureCodeNative as r,measureCodeNativeAsync as i}from"./nativeMetrics.js";var a=class{registry=e();getSupportedLanguages(){return[...new Set([...this.registry.values()].map(e=>e.name))]}measure(e,t){let n=this.resolveLanguage(t.language),i=t.includeSyntaxTree??!1;return c(r(e,n.name,i,t.duplication),i)}measureWithCrossFileData(e,t){let n=this.resolveLanguage(t.language),i=t.includeSyntaxTree??!1;return o(r(e,n.name,i,t.duplication,!0),i)}async measureWithCrossFileDataAsync(e,t){let n=this.resolveLanguage(t.language),r=t.includeSyntaxTree??!1;return o(await i(e,n.name,r,t.duplication,!0),r)}collectDuplicationCandidates(e,t){return this.collectCrossFileDuplicationFileData(e,t).candidates}collectCrossFileDuplicationFileData(e,n){let r=this.resolveLanguage(n.language);return s(t(e,r.name,n.duplication?.minTokens))}collectFunctionTokenSequences(e,t){let r=this.resolveLanguage(t.language);return n(e,r.name)}resolveLanguage(e){let t=this.registry.get(e);if(!t)throw Error(`Unsupported language: ${e}`);return t}};function o(e,t){if(!e.crossFileData)throw Error(`The native addon returned no cross-file duplication data`);return{metrics:c(e,t),crossFileData:s(e.crossFileData)}}function s(e){return{candidates:e.candidates,tokens:e.tokens,containerStatements:e.containerStatements,nearMissBlocks:e.nearMissBlocks,codeLineNumbers:new Set(e.codeLineNumbers)}}function c(e,t){return{language:e.language,bytes:e.bytes,lines:e.lines,functions:e.functions.map(e=>({name:e.name,nodeType:e.nodeType,startLine:e.startLine,startColumn:e.startColumn,endLine:e.endLine,endColumn:e.endColumn,cyclomaticComplexity:e.cyclomaticComplexity,cognitiveComplexity:e.cognitiveComplexity,nestingDepth:e.nestingDepth,ncss:e.ncss,parameterCount:e.parameterCount,halstead:l(e.halsteadCounts),depDegree:e.depDegree})),cyclomaticComplexity:e.cyclomaticComplexity,cognitiveComplexity:e.cognitiveComplexity,maxCognitiveComplexity:e.maxCognitiveComplexity,nestingDepth:e.nestingDepth,ncssCount:e.ncssCount,duplication:e.duplication,halstead:l(e.halsteadCounts),syntaxTree:t?e.syntaxTree:void 0}}function l(e){let{distinctOperators:t,distinctOperands:n,totalOperators:r,totalOperands:i}=e,a=t+n,o=r+i,s=a===0?0:o*Math.log2(a),c=n===0?0:t/2*(i/n);return{distinctOperators:t,distinctOperands:n,totalOperators:r,totalOperands:i,vocabulary:a,length:o,volume:s,difficulty:c,effort:c*s}}const u=new a;function d(e,t){return u.measure(e,t)}function f(e,t){return u.measureWithCrossFileDataAsync(e,t)}function p(e,t){return u.collectDuplicationCandidates(e,t)}function m(e,t){return u.collectFunctionTokenSequences(e,t)}function h(e,t){return u.collectCrossFileDuplicationFileData(e,t)}export{a as TreeMeasurer,h as collectCrossFileDuplicationFileData,p as collectDuplicationCandidates,m as collectFunctionTokenSequences,u as defaultMeasurer,d as measureCode,f as measureCodeWithCrossFileDataAsync};
+import{createLanguageRegistry as e}from"./languages.js";import{collectCrossFileDataNative as t,collectFunctionTokenSequencesNative as n,measureCodeNative as r,measureCodeNativeAsync as i}from"./nativeMetrics.js";var a=class{registry=e();getSupportedLanguages(){return[...new Set([...this.registry.values()].map(e=>e.name))]}measure(e,t){let n=this.resolveLanguage(t.language),i=t.includeSyntaxTree??!1;return c(r(e,n.name,i,t.duplication),i)}measureWithCrossFileData(e,t){let n=this.resolveLanguage(t.language),i=t.includeSyntaxTree??!1;return o(r(e,n.name,i,t.duplication,!0),i)}async measureWithCrossFileDataAsync(e,t){let n=this.resolveLanguage(t.language),r=t.includeSyntaxTree??!1;return o(await i(e,n.name,r,t.duplication,!0),r)}collectDuplicationCandidates(e,t){return this.collectCrossFileDuplicationFileData(e,t).candidates}collectCrossFileDuplicationFileData(e,n){let r=this.resolveLanguage(n.language);return s(t(e,r.name,n.duplication?.minTokens))}collectFunctionTokenSequences(e,t){let r=this.resolveLanguage(t.language);return n(e,r.name)}resolveLanguage(e){let t=this.registry.get(e);if(!t)throw Error(`Unsupported language: ${e}`);return t}};function o(e,t){if(!e.crossFileData)throw Error(`The native addon returned no cross-file duplication data`);return{metrics:c(e,t),crossFileData:s(e.crossFileData)}}function s(e){return{candidates:e.candidates,tokens:e.tokens,containerStatements:e.containerStatements,nearMissBlocks:e.nearMissBlocks,codeLineNumbers:new Set(e.codeLineNumbers)}}function c(e,t){return{language:e.language,bytes:e.bytes,lines:e.lines,codeLineNumbers:e.codeLineNumbers,functions:e.functions.map(e=>({name:e.name,containerName:e.containerName,nodeType:e.nodeType,startLine:e.startLine,startColumn:e.startColumn,endLine:e.endLine,endColumn:e.endColumn,cyclomaticComplexity:e.cyclomaticComplexity,cognitiveComplexity:e.cognitiveComplexity,cognitiveBlocks:e.cognitiveBlocks??[],nestingDepth:e.nestingDepth,ncss:e.ncss,parameterCount:e.parameterCount,halstead:l(e.halsteadCounts),depDegree:e.depDegree})),cyclomaticComplexity:e.cyclomaticComplexity,cognitiveComplexity:e.cognitiveComplexity,maxCognitiveComplexity:e.maxCognitiveComplexity,nestingDepth:e.nestingDepth,ncssCount:e.ncssCount,duplication:e.duplication,halstead:l(e.halsteadCounts),syntaxTree:t?e.syntaxTree:void 0}}function l(e){let{distinctOperators:t,distinctOperands:n,totalOperators:r,totalOperands:i}=e,a=t+n,o=r+i,s=a===0?0:o*Math.log2(a),c=n===0?0:t/2*(i/n);return{distinctOperators:t,distinctOperands:n,totalOperators:r,totalOperands:i,vocabulary:a,length:o,volume:s,difficulty:c,effort:c*s}}const u=new a;function d(e,t){return u.measure(e,t)}function f(e,t){return u.measureWithCrossFileDataAsync(e,t)}function p(e,t){return u.collectDuplicationCandidates(e,t)}function m(e,t){return u.collectFunctionTokenSequences(e,t)}function h(e,t){return u.collectCrossFileDuplicationFileData(e,t)}export{a as TreeMeasurer,h as collectCrossFileDuplicationFileData,p as collectDuplicationCandidates,m as collectFunctionTokenSequences,u as defaultMeasurer,d as measureCode,f as measureCodeWithCrossFileDataAsync};
 //# sourceMappingURL=metrics.js.map