code-gauge 5.1.0 → 6.0.0

package/dist/scan.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"scan.cjs","names":["os","path","stat","realpath","getErrorMessage","lstat","readFile","readdir","measureCode","NativeAddonError","measureCodeWithCrossFileDataAsync","measureCrossFileDuplication","detectLanguage"],"sources":["../src/scan.ts"],"sourcesContent":["import { lstat, readdir, readFile, realpath, stat } from 'node:fs/promises';\nimport os from 'node:os';\nimport path from 'node:path';\nimport { getErrorMessage } from '@willbooster/shared-lib';\nimport { measureCrossFileDuplication, type CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport type { CrossFileDuplicationFileData } from './duplication.js';\nimport type { Exclusion } from './exclusion.js';\nimport { detectLanguage } from './languages.js';\nimport { measureCode, measureCodeWithCrossFileDataAsync } from './metrics.js';\nimport { NativeAddonError } from './nativeMetrics.js';\nimport type { CodeMetrics, DuplicationOptions, LanguageName, MeasureOptions } from './types.js';\n\n/** The scan settings shared by every command (a structural subset of each command's options). */\nexport interface ScanOptions {\n  duplication: Required<DuplicationOptions>;\n  includeTests: boolean;\n  /**\n   * Loads the exclusion covering the files a directory scan found (absolute paths); an explicitly\n   * targeted file is always measured.\n   */\n  loadExclusion?: (absolutePaths: readonly string[]) => Promise<Exclusion>;\n}\n\nexport interface FileMetrics {\n  file: string;\n  metrics: CodeMetrics;\n  /** Cross-file duplicate candidates and token/statement data, collected only for directory scans. */\n  duplicationCandidates?: CrossFileDuplicationFileData;\n}\n\nexport interface ScanResult {\n  crossFileDuplication?: CrossFileDuplicationMetrics;\n  displayRoot: string;\n  errors: string[];\n  /** Non-fatal degradations (e.g. cross-file candidates unavailable); the file is still measured. */\n  warnings: string[];\n  /** Files skipped because their content is generated code (see Exclusion.isGeneratedCode). */\n  generatedFiles: string[];\n  fatalError?: string;\n  files: FileMetrics[];\n}\n\nconst ignoredDirectoryNames = new Set([\n  '.agents',\n  '.claude',\n  '.cursor',\n  '.git',\n  '.next',\n  '.playwright-cli',\n  '.tox',\n  '.tmp',\n  '.turbo',\n  '.venv',\n  '.yarn',\n  '__fixtures__',\n  '__generated__',\n  '__pycache__',\n  'coverage',\n  'dist',\n  'fixtures',\n  'generated',\n  'node_modules',\n  // .NET SDK intermediate output (generated sources such as `*.GlobalUsings.g.cs`).\n  'obj',\n  'target',\n  'test-fixtures',\n  'vendor',\n  'venv',\n]);\n\nconst testDirectoryNames = new Set(['__tests__', 'test', 'tests', 'spec']);\nconst testFilePattern = /(?:^test(?:[_-].*)?|\\.(?:spec|test)|[_-](?:test|spec))\\.[^.]+$/iu;\n// JUnit (Java/Kotlin) and xUnit/NUnit (C#) tests use case-sensitive `Test`/`Tests` class-name\n// suffixes; case-insensitive matching would catch production files like `contest.java`.\nconst suffixTestFilePattern = /Tests?\\.(?:java|kt|cs)$/u;\n\nexport function resolveTarget(target: string): string {\n  if (target === '~') {\n    return os.homedir();\n  }\n\n  if (target.startsWith('~/')) {\n    return path.join(os.homedir(), target.slice(2));\n  }\n\n  return path.resolve(target);\n}\n\n/** Returns the directory from which the config file search should start (the target itself if it is a directory). */\nexport async function configSearchDirectory(target: string): Promise<string> {\n  try {\n    const targetStat = await stat(target);\n    return targetStat.isDirectory() ? target : path.dirname(target);\n  } catch {\n    return path.dirname(target);\n  }\n}\n\n/** Shared state of one scan, threaded through the directory walk instead of positional plumbing. */\ninterface ScanContext {\n  options: ScanOptions;\n  /**\n   * Outcomes in discovery order. Files are measured concurrently, so a measurement is recorded as\n   * a promise here and applied in this order once all have settled, keeping results deterministic.\n   */\n  outcomes: (ScanOutcome | Promise<ScanOutcome>)[];\n  /** Measurements in flight, bounded so file contents and payloads do not pile up. */\n  inFlight: Set<Promise<ScanOutcome>>;\n  /** Set once a measurement fails fatally; no further measurement starts. */\n  fatalSeen: boolean;\n  visitedDirectories: Set<string>;\n  visitedFiles: Set<string>;\n  /** Scan root: paths are displayed relative to it, and symbolic links may not escape it. */\n  rootDirectory: string;\n  /** Files the walk found, measured once the exclusion covering all of them is loaded. */\n  candidates: ScanCandidate[];\n  exclusion?: Exclusion;\n}\n\ninterface ScanCandidate {\n  file: string;\n  language: LanguageName;\n  /** The resolved path when the file was reached through a symbolic link. */\n  realFile?: string;\n}\n\n/**\n * A missing native addon fails every file identically, so it ends the scan as one fatal error\n * instead of one \"skipped\" entry per file behind a successful exit code.\n */\ntype ScanOutcome =\n  | { file: FileMetrics; warning?: string }\n  | { generatedFile: string }\n  | { error: string }\n  | { fatal: NativeAddonError };\n\n// Twice the addon's worker count keeps its pool busy while finished payloads are parsed.\nconst maxMeasurementsInFlight = os.availableParallelism() * 2;\n\nexport async function scanTarget(target: string, options: ScanOptions): Promise<ScanResult> {\n  let canonicalTarget = target;\n  try {\n    canonicalTarget = await realpath(target);\n  } catch {\n    // stat below reports missing targets with the original path.\n  }\n\n  const fallbackDisplayRoot = path.dirname(canonicalTarget);\n  let targetStat;\n\n  try {\n    targetStat = await stat(canonicalTarget);\n  } catch (error) {\n    const fatalError = `${formatPath(canonicalTarget, fallbackDisplayRoot)}: ${getErrorMessage(error)}`;\n    return {\n      displayRoot: fallbackDisplayRoot,\n      files: [],\n      errors: [fatalError],\n      warnings: [],\n      generatedFiles: [],\n      fatalError,\n    };\n  }\n\n  if (targetStat.isFile()) {\n    const displayRoot = path.dirname(canonicalTarget);\n    const language = getLanguage(canonicalTarget, options, true);\n    if (!language) {\n      const fatalError = `${formatPath(canonicalTarget, displayRoot)}: unsupported file type`;\n      return { displayRoot, files: [], errors: [fatalError], warnings: [], generatedFiles: [], fatalError };\n    }\n\n    const context = makeScanContext(options, displayRoot);\n    await measureFile(canonicalTarget, language, 'single-file', context, canonicalTarget);\n    return settleScan(context, displayRoot);\n  }\n\n  const context = makeScanContext(options, canonicalTarget);\n  await scanDirectory(canonicalTarget, context);\n  await measureCandidates(context);\n  return settleScan(context, canonicalTarget);\n}\n\n/**\n * Measures an explicit list of repository-relative files (the diff gate's git-visible allowlist)\n * instead of walking the directory tree, so ignored artifact directories are never parsed. Paths\n * outside the scan scope (ignored/test directories, unsupported or test file names) are skipped\n * with the same rules as the walk.\n */\nexport async function scanListedFiles(\n  rootDirectory: string,\n  relativePaths: Iterable<string>,\n  options: ScanOptions,\n  explicitFiles: ReadonlySet<string> = new Set()\n): Promise<ScanResult> {\n  const context = makeScanContext(options, rootDirectory);\n  for (const relativePath of relativePaths) {\n    const absolutePath = path.join(rootDirectory, relativePath);\n    const language = isScannedPath(relativePath, options, explicitFiles.has(absolutePath))\n      ? getLanguage(relativePath, options, explicitFiles.has(absolutePath))\n      : undefined;\n    if (!language) {\n      continue;\n    }\n    // Symbolic links are not source files: git stores only their target string, so measuring\n    // through them would diverge from what any revision of the repository actually contains.\n    const stats = await lstat(absolutePath).catch(() => {});\n    if (!stats?.isSymbolicLink()) {\n      context.candidates.push({ file: absolutePath, language });\n    }\n  }\n  await measureCandidates(context);\n  return settleScan(context, rootDirectory);\n}\n\nasync function measureCandidates(context: ScanContext): Promise<void> {\n  const exclusion = await context.options.loadExclusion?.(\n    context.candidates.flatMap(({ file, realFile }) => (realFile === undefined ? [file] : [file, realFile]))\n  );\n  context.exclusion = exclusion;\n  // Every path reaching the same real file, in discovery order, so one alias cannot decide alone.\n  const pathsByRealFile = new Map<string, ScanCandidate[]>();\n  for (const candidate of context.candidates) {\n    let realFile;\n    try {\n      realFile = candidate.realFile ?? (await realpath(candidate.file));\n    } catch (error) {\n      recordError(context, candidate.file, error);\n      continue;\n    }\n    pathsByRealFile.set(realFile, [...(pathsByRealFile.get(realFile) ?? []), candidate]);\n  }\n  for (const [realFile, candidates] of pathsByRealFile) {\n    if (context.fatalSeen) {\n      return;\n    }\n    const chosen = await chooseMeasuredPath(realFile, candidates, exclusion);\n    if (chosen !== undefined) {\n      await measureFile(chosen.file, chosen.language, 'directory', context, realFile);\n    }\n  }\n}\n\n/**\n * The path to measure a real file through. A path is excluded when its own exclusion or the real\n * file's applies, so the real path, when the scan reached it directly, is never less measurable\n * than an alias; otherwise the first alias not excluded, preferring one whose own attributes do\n * not judge the content generated.\n */\nasync function chooseMeasuredPath(\n  realFile: string,\n  candidates: readonly ScanCandidate[],\n  exclusion: Exclusion | undefined\n): Promise<ScanCandidate | undefined> {\n  if (exclusion === undefined) {\n    return candidates[0];\n  }\n  if (exclusion.isExcludedPath(realFile)) {\n    return undefined;\n  }\n  const measurable = candidates.filter(({ file }) => !exclusion.isExcludedPath(file));\n  const direct = measurable.find(({ file }) => file === realFile);\n  if (direct !== undefined || measurable.length <= 1) {\n    return direct ?? measurable[0];\n  }\n  const code = await readFile(realFile, 'utf8').catch(() => {});\n  return measurable.find(({ file }) => code !== undefined && !exclusion.isGeneratedCode(file, code)) ?? measurable[0];\n}\n\n/** Applies the scan's outcomes in discovery order once every measurement has settled. */\nasync function settleScan(context: ScanContext, displayRoot: string): Promise<ScanResult> {\n  const files: FileMetrics[] = [];\n  const errors: string[] = [];\n  const warnings: string[] = [];\n  const generatedFiles: string[] = [];\n  for (const pending of context.outcomes) {\n    const outcome = await pending;\n    if ('fatal' in outcome) {\n      const fatalError = getErrorMessage(outcome.fatal);\n      // Errors the walk recorded before the fatal failure stay reported alongside it.\n      return { displayRoot, files, errors: [...errors, fatalError], warnings, generatedFiles, fatalError };\n    }\n    if ('generatedFile' in outcome) {\n      generatedFiles.push(outcome.generatedFile);\n      continue;\n    }\n    if ('error' in outcome) {\n      errors.push(outcome.error);\n      continue;\n    }\n    files.push(outcome.file);\n    if (outcome.warning !== undefined) {\n      warnings.push(outcome.warning);\n    }\n  }\n  return { displayRoot, files, errors, warnings, generatedFiles };\n}\n\nfunction makeScanContext(options: ScanOptions, rootDirectory: string): ScanContext {\n  return {\n    options,\n    outcomes: [],\n    inFlight: new Set(),\n    fatalSeen: false,\n    visitedDirectories: new Set(),\n    visitedFiles: new Set(),\n    rootDirectory,\n    candidates: [],\n  };\n}\n\nfunction recordError(context: ScanContext, target: string, error: unknown): void {\n  context.outcomes.push({ error: `${formatPath(target, context.rootDirectory)}: ${getErrorMessage(error)}` });\n}\n\n/** Runs a filesystem operation, recording a scan error and returning undefined when it fails. */\nasync function tryFileSystem<T>(\n  operation: () => Promise<T>,\n  target: string,\n  context: ScanContext\n): Promise<T | undefined> {\n  try {\n    return await operation();\n  } catch (error) {\n    recordError(context, target, error);\n    return undefined;\n  }\n}\n\n/** Resolves the path (recording errors); undefined when that fails or the result escapes the root. */\nasync function resolveWithinRoot(target: string, context: ScanContext): Promise<string | undefined> {\n  const resolved = await tryFileSystem(() => realpath(target), target, context);\n  return resolved !== undefined && isWithinDirectory(resolved, context.rootDirectory) ? resolved : undefined;\n}\n\nasync function scanDirectory(directory: string, context: ScanContext): Promise<void> {\n  const resolvedDirectory = await resolveWithinRoot(directory, context);\n  if (resolvedDirectory === undefined || context.visitedDirectories.has(resolvedDirectory)) {\n    return;\n  }\n  context.visitedDirectories.add(resolvedDirectory);\n\n  const entries = await tryFileSystem(() => readdir(directory, { withFileTypes: true }), directory, context);\n  if (entries === undefined) {\n    return;\n  }\n  // readdir order differs between file systems; sorting keeps which path reaches a file first,\n  // and so the scan's result, the same everywhere.\n  entries.sort((left, right) => (left.name < right.name ? -1 : left.name > right.name ? 1 : 0));\n\n  for (const entry of entries) {\n    const entryPath = path.join(directory, entry.name);\n    if (entry.isSymbolicLink()) {\n      await scanSymbolicLink(entry.name, entryPath, context);\n      continue;\n    }\n\n    if (entry.isDirectory()) {\n      if (shouldSkipDirectory(entry.name, context.options)) {\n        continue;\n      }\n      await scanDirectory(entryPath, context);\n      continue;\n    }\n\n    if (entry.isFile()) {\n      // Under a symbolically linked directory the real path differs, and exclusion checks both.\n      const realFile = resolvedDirectory === directory ? undefined : path.join(resolvedDirectory, entry.name);\n      collectScannableFile(entryPath, context, entryPath, realFile);\n    }\n  }\n}\n\nasync function scanSymbolicLink(name: string, entryPath: string, context: ScanContext): Promise<void> {\n  const resolvedPath = await resolveWithinRoot(entryPath, context);\n  if (resolvedPath === undefined) {\n    return;\n  }\n\n  const entryStat = await tryFileSystem(() => stat(entryPath), entryPath, context);\n  if (entryStat === undefined) {\n    return;\n  }\n\n  if (entryStat.isDirectory()) {\n    if (\n      shouldSkipDirectory(name, context.options) ||\n      shouldSkipDirectory(path.basename(resolvedPath), context.options)\n    ) {\n      return;\n    }\n    await scanDirectory(entryPath, context);\n    return;\n  }\n\n  if (entryStat.isFile()) {\n    collectScannableFile(entryPath, context, resolvedPath, resolvedPath);\n  }\n}\n\nfunction collectScannableFile(file: string, context: ScanContext, languageFile = file, realFile?: string): void {\n  const language = getLanguage(languageFile, context.options);\n  if (language) {\n    context.candidates.push({ file, language, realFile });\n  }\n}\n\n/**\n * Resolves and deduplicates the file in discovery order, then starts measuring it concurrently; its\n * outcome is recorded in discovery order (see ScanContext.outcomes).\n */\nasync function measureFile(\n  file: string,\n  language: LanguageName,\n  mode: 'single-file' | 'directory',\n  context: ScanContext,\n  realFile?: string\n): Promise<void> {\n  if (context.fatalSeen) {\n    return;\n  }\n  let resolvedFile;\n  try {\n    resolvedFile = realFile ?? (await realpath(file));\n  } catch (error) {\n    recordError(context, file, error);\n    return;\n  }\n  if (context.visitedFiles.has(resolvedFile)) {\n    return;\n  }\n  context.visitedFiles.add(resolvedFile);\n\n  // Any settled measurement frees its slot (removed by the callback below, which runs before the\n  // race resumes), so one slow file never idles the pool.\n  while (context.inFlight.size >= maxMeasurementsInFlight) {\n    await Promise.race(context.inFlight);\n  }\n  const outcome = readAndMeasureFile(file, resolvedFile, language, mode, context);\n  context.inFlight.add(outcome);\n  void outcome.then(() => context.inFlight.delete(outcome));\n  context.outcomes.push(outcome);\n}\n\nasync function readAndMeasureFile(\n  file: string,\n  resolvedFile: string,\n  language: LanguageName,\n  mode: 'single-file' | 'directory',\n  context: ScanContext\n): Promise<ScanOutcome> {\n  try {\n    const code = await readFile(file, 'utf8');\n    const measureOptions = { language, duplication: context.options.duplication };\n    // Only directory scans compare files against each other; a single-file target has no peers.\n    if (mode === 'single-file') {\n      return { file: { file, metrics: measureCode(code, measureOptions) } };\n    }\n    // Like path exclusion, either the scanned path or the real one can judge the code generated.\n    const exclusion = context.exclusion;\n    if (exclusion && (exclusion.isGeneratedCode(file, code) || exclusion.isGeneratedCode(resolvedFile, code))) {\n      return { generatedFile: file };\n    }\n    const { metrics, crossFileData, crossFileError } = await measureWithCrossFileData(code, measureOptions);\n    return {\n      file: { file, metrics, duplicationCandidates: crossFileData },\n      // A warning, not an error: the file's metrics are complete, only its participation in\n      // cross-file matching is lost, so it is not \"skipped\" and must not fail --fail-on-error.\n      warning:\n        crossFileError === undefined\n          ? undefined\n          : `${formatPath(file, context.rootDirectory)}: cross-file duplication candidates unavailable: ${crossFileError}`,\n    };\n  } catch (error) {\n    if (error instanceof NativeAddonError) {\n      context.fatalSeen = true;\n      return { fatal: error };\n    }\n    return { error: `${formatPath(file, context.rootDirectory)}: ${getErrorMessage(error)}` };\n  }\n}\n\n/**\n * Measures a file together with its cross-file contribution from one parse. The contribution is\n * auxiliary: if collecting it fails where plain measurement succeeds (e.g. a payload too large to\n * cross the addon boundary), the metrics are still returned with the failure message, which\n * callers report as a warning rather than an error.\n */\nexport async function measureWithCrossFileData(\n  code: string,\n  measureOptions: MeasureOptions\n): Promise<{ metrics: CodeMetrics; crossFileData?: CrossFileDuplicationFileData; crossFileError?: string }> {\n  try {\n    return await measureCodeWithCrossFileDataAsync(code, measureOptions);\n  } catch (error) {\n    if (error instanceof NativeAddonError) {\n      throw error;\n    }\n    return { metrics: measureCode(code, measureOptions), crossFileError: getErrorMessage(error) };\n  }\n}\n\n/** Runs after the scan so every measured file's candidates participate. */\nexport function addCrossFileDuplication(result: ScanResult, options: ScanOptions): void {\n  if (result.fatalError || result.files.length < 2) {\n    return;\n  }\n  const sourceFiles = result.files.flatMap(({ file, duplicationCandidates }) =>\n    duplicationCandidates ? [{ file: formatPath(file, result.displayRoot), ...duplicationCandidates }] : []\n  );\n  if (sourceFiles.length < 2) {\n    return;\n  }\n  result.crossFileDuplication = measureCrossFileDuplication(sourceFiles, options.duplication);\n}\n\n/**\n * Distinct 1-based code lines covered by within-file or cross-file duplicated content. Both\n * sources expose the exact lines carrying matched tokens (never block bounding ranges, which\n * would over-count comment/blank lines and the unmatched gap of a merged clone), so the union is\n * a subset of the file's code lines and a ratio derived over code lines can never exceed 1.\n */\nexport function collectDuplicatedLineNumbers(\n  metrics: CodeMetrics | undefined,\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  formattedFile: string\n): Set<number> {\n  const lines = new Set(metrics?.duplication.duplicateLineNumbers);\n  // Object.hasOwn: a file named like an Object.prototype member must not read an inherited value.\n  const crossFileLines =\n    crossFileDuplication && Object.hasOwn(crossFileDuplication.duplicateLineNumbersByFile, formattedFile)\n      ? (crossFileDuplication.duplicateLineNumbersByFile[formattedFile] ?? [])\n      : [];\n  for (const line of crossFileLines) {\n    lines.add(line);\n  }\n  return lines;\n}\n\nfunction shouldSkipDirectory(name: string, options: ScanOptions): boolean {\n  if (ignoredDirectoryNames.has(name)) {\n    return true;\n  }\n\n  if (options.includeTests) {\n    return false;\n  }\n\n  return testDirectoryNames.has(name);\n}\n\nfunction isWithinDirectory(candidate: string, directory: string): boolean {\n  const relative = path.relative(directory, candidate);\n  return relative === '' || (relative !== '..' && !relative.startsWith(`..${path.sep}`) && !path.isAbsolute(relative));\n}\n\n/**\n * Whether a repository-relative path would be scanned: no ignored or excluded-test directory\n * segment and a supported, non-test file name. The diff gate uses this for base-revision\n * eligibility, so code renamed into scan scope gates as new code instead of ratcheting against\n * a blob the scanner would never have measured. An explicitly targeted file only needs a supported\n * language, as in the ranking command.\n */\nexport function isScannedPath(relativePath: string, options: ScanOptions, explicitTarget = false): boolean {\n  if (explicitTarget) {\n    return getLanguage(relativePath, options, true) !== undefined;\n  }\n  const segments = relativePath.split('/');\n  for (const segment of segments.slice(0, -1)) {\n    if (ignoredDirectoryNames.has(segment) || (!options.includeTests && testDirectoryNames.has(segment))) {\n      return false;\n    }\n  }\n  return getLanguage(relativePath, options) !== undefined;\n}\n\nexport function getLanguage(file: string, options: ScanOptions, explicitTarget = false): LanguageName | undefined {\n  const lowerFile = file.toLowerCase();\n  if (\n    !explicitTarget &&\n    (lowerFile.endsWith('.d.ts') ||\n      lowerFile.endsWith('.d.mts') ||\n      lowerFile.endsWith('.d.cts') ||\n      lowerFile.endsWith('.min.js') ||\n      lowerFile.endsWith('.pnp.cjs'))\n  ) {\n    return undefined;\n  }\n\n  if (\n    !explicitTarget &&\n    !options.includeTests &&\n    (testFilePattern.test(path.basename(file)) || suffixTestFilePattern.test(path.basename(file)))\n  ) {\n    return undefined;\n  }\n\n  return detectLanguage(file);\n}\n\nexport function formatPath(file: string, base: string): string {\n  return path.relative(base, file) || path.basename(file);\n}\n\nexport function writeStdout(message: string): void {\n  process.stdout.write(message);\n}\n\nexport function writeStderr(message: string): void {\n  process.stderr.write(message);\n}\n"],"mappings":"2VA0CA,MAAM,kBAAwB,IAAI,IAAI,CACpC,UACA,UACA,UACA,OACA,QACA,kBACA,OACA,OACA,SACA,QACA,QACA,eACA,gBACA,cACA,WACA,OACA,WACA,YACA,eAEA,MACA,SACA,gBACA,SACA,MACF,CAAC,EAEK,kBAAqB,IAAI,IAAI,CAAC,YAAa,OAAQ,QAAS,MAAM,CAAC,EACnE,EAAkB,mEAGlB,EAAwB,2BAE9B,SAAgB,EAAc,EAAwB,CASpD,OARI,IAAW,IACNA,EAAAA,QAAG,QAAQ,EAGhB,EAAO,WAAW,IAAI,EACjBC,EAAAA,QAAK,KAAKD,EAAAA,QAAG,QAAQ,EAAG,EAAO,MAAM,CAAC,CAAC,EAGzCC,EAAAA,QAAK,QAAQ,CAAM,CAC5B,CAGA,eAAsB,EAAsB,EAAiC,CAC3E,GAAI,CAEF,OAAO,MAAA,EADkBC,EAAAA,KAAAA,CAAK,CAAM,EAAA,CAClB,YAAY,EAAI,EAASD,EAAAA,QAAK,QAAQ,CAAM,CAChE,MAAQ,CACN,OAAOA,EAAAA,QAAK,QAAQ,CAAM,CAC5B,CACF,CAyCA,MAAM,EAA0BD,EAAAA,QAAG,qBAAqB,EAAI,EAE5D,eAAsB,EAAW,EAAgB,EAA2C,CAC1F,IAAI,EAAkB,EACtB,GAAI,CACF,EAAkB,MAAA,EAAMG,EAAAA,SAAAA,CAAS,CAAM,CACzC,MAAQ,CAER,CAEA,IAAM,EAAsBF,EAAAA,QAAK,QAAQ,CAAe,EACpD,EAEJ,GAAI,CACF,EAAa,MAAA,EAAMC,EAAAA,KAAAA,CAAK,CAAe,CACzC,OAAS,EAAO,CACd,IAAM,EAAa,GAAG,EAAW,EAAiB,CAAmB,EAAE,KAAA,EAAIE,EAAAA,gBAAAA,CAAgB,CAAK,IAChG,MAAO,CACL,YAAa,EACb,MAAO,CAAC,EACR,OAAQ,CAAC,CAAU,EACnB,SAAU,CAAC,EACX,eAAgB,CAAC,EACjB,YACF,CACF,CAEA,GAAI,EAAW,OAAO,EAAG,CACvB,IAAM,EAAcH,EAAAA,QAAK,QAAQ,CAAe,EAC1C,EAAW,EAAY,EAAiB,EAAS,EAAI,EAC3D,GAAI,CAAC,EAAU,CACb,IAAM,EAAa,GAAG,EAAW,EAAiB,CAAW,EAAE,yBAC/D,MAAO,CAAE,cAAa,MAAO,CAAC,EAAG,OAAQ,CAAC,CAAU,EAAG,SAAU,CAAC,EAAG,eAAgB,CAAC,EAAG,YAAW,CACtG,CAEA,IAAM,EAAU,EAAgB,EAAS,CAAW,EAEpD,OADA,MAAM,EAAY,EAAiB,EAAU,cAAe,EAAS,CAAe,EAC7E,EAAW,EAAS,CAAW,CACxC,CAEA,IAAM,EAAU,EAAgB,EAAS,CAAe,EAGxD,OAFA,MAAM,EAAc,EAAiB,CAAO,EAC5C,MAAM,EAAkB,CAAO,EACxB,EAAW,EAAS,CAAe,CAC5C,CAQA,eAAsB,EACpB,EACA,EACA,EACA,kBAAqC,IAAI,IACpB,CACrB,IAAM,EAAU,EAAgB,EAAS,CAAa,EACtD,IAAK,IAAM,KAAgB,EAAe,CACxC,IAAM,EAAeA,EAAAA,QAAK,KAAK,EAAe,CAAY,EACpD,EAAW,EAAc,EAAc,EAAS,EAAc,IAAI,CAAY,CAAC,EACjF,EAAY,EAAc,EAAS,EAAc,IAAI,CAAY,CAAC,EAClE,IAAA,GACC,KAMA,MAAA,EADeI,EAAAA,MAAAA,CAAM,CAAY,CAAC,CAAC,UAAY,CAAC,CAAC,EAAA,EAC1C,eAAe,GACzB,EAAQ,WAAW,KAAK,CAAE,KAAM,EAAc,UAAS,CAAC,EAE5D,CAEA,OADA,MAAM,EAAkB,CAAO,EACxB,EAAW,EAAS,CAAa,CAC1C,CAEA,eAAe,EAAkB,EAAqC,CACpE,IAAM,EAAY,MAAM,EAAQ,QAAQ,gBACtC,EAAQ,WAAW,SAAS,CAAE,OAAM,cAAgB,IAAa,IAAA,GAAY,CAAC,CAAI,EAAI,CAAC,EAAM,CAAQ,CAAE,CACzG,EACA,EAAQ,UAAY,EAEpB,IAAM,kBAAkB,IAAI,IAC5B,IAAK,IAAM,KAAa,EAAQ,WAAY,CAC1C,IAAI,EACJ,GAAI,CACF,EAAW,EAAU,UAAa,MAAA,EAAMF,EAAAA,SAAAA,CAAS,EAAU,IAAI,CACjE,OAAS,EAAO,CACd,EAAY,EAAS,EAAU,KAAM,CAAK,EAC1C,QACF,CACA,EAAgB,IAAI,EAAU,CAAC,GAAI,EAAgB,IAAI,CAAQ,GAAK,CAAC,EAAI,CAAS,CAAC,CACrF,CACA,IAAK,GAAM,CAAC,EAAU,KAAe,EAAiB,CACpD,GAAI,EAAQ,UACV,OAEF,IAAM,EAAS,MAAM,EAAmB,EAAU,EAAY,CAAS,EACnE,IAAW,IAAA,IACb,MAAM,EAAY,EAAO,KAAM,EAAO,SAAU,YAAa,EAAS,CAAQ,CAElF,CACF,CAQA,eAAe,EACb,EACA,EACA,EACoC,CACpC,GAAI,IAAc,IAAA,GAChB,OAAO,EAAW,GAEpB,GAAI,EAAU,eAAe,CAAQ,EACnC,OAEF,IAAM,EAAa,EAAW,QAAQ,CAAE,UAAW,CAAC,EAAU,eAAe,CAAI,CAAC,EAC5E,EAAS,EAAW,MAAM,CAAE,UAAW,IAAS,CAAQ,EAC9D,GAAI,IAAW,IAAA,IAAa,EAAW,QAAU,EAC/C,OAAO,GAAU,EAAW,GAE9B,IAAM,EAAO,MAAA,EAAMG,EAAAA,SAAAA,CAAS,EAAU,MAAM,CAAC,CAAC,UAAY,CAAC,CAAC,EAC5D,OAAO,EAAW,MAAM,CAAE,UAAW,IAAS,IAAA,IAAa,CAAC,EAAU,gBAAgB,EAAM,CAAI,CAAC,GAAK,EAAW,EACnH,CAGA,eAAe,EAAW,EAAsB,EAA0C,CACxF,IAAM,EAAuB,CAAC,EACxB,EAAmB,CAAC,EACpB,EAAqB,CAAC,EACtB,EAA2B,CAAC,EAClC,IAAK,IAAM,KAAW,EAAQ,SAAU,CACtC,IAAM,EAAU,MAAM,EACtB,GAAI,UAAW,EAAS,CACtB,IAAM,GAAA,EAAaF,EAAAA,gBAAAA,CAAgB,EAAQ,KAAK,EAEhD,MAAO,CAAE,cAAa,QAAO,OAAQ,CAAC,GAAG,EAAQ,CAAU,EAAG,WAAU,iBAAgB,YAAW,CACrG,CACA,GAAI,kBAAmB,EAAS,CAC9B,EAAe,KAAK,EAAQ,aAAa,EACzC,QACF,CACA,GAAI,UAAW,EAAS,CACtB,EAAO,KAAK,EAAQ,KAAK,EACzB,QACF,CACA,EAAM,KAAK,EAAQ,IAAI,EACnB,EAAQ,UAAY,IAAA,IACtB,EAAS,KAAK,EAAQ,OAAO,CAEjC,CACA,MAAO,CAAE,cAAa,QAAO,SAAQ,WAAU,gBAAe,CAChE,CAEA,SAAS,EAAgB,EAAsB,EAAoC,CACjF,MAAO,CACL,UACA,SAAU,CAAC,EACX,yBAAU,IAAI,IACd,UAAW,GACX,mCAAoB,IAAI,IACxB,6BAAc,IAAI,IAClB,gBACA,WAAY,CAAC,CACf,CACF,CAEA,SAAS,EAAY,EAAsB,EAAgB,EAAsB,CAC/E,EAAQ,SAAS,KAAK,CAAE,MAAO,GAAG,EAAW,EAAQ,EAAQ,aAAa,EAAE,KAAA,EAAIA,EAAAA,gBAAAA,CAAgB,CAAK,GAAI,CAAC,CAC5G,CAGA,eAAe,EACb,EACA,EACA,EACwB,CACxB,GAAI,CACF,OAAO,MAAM,EAAU,CACzB,OAAS,EAAO,CACd,EAAY,EAAS,EAAQ,CAAK,EAClC,MACF,CACF,CAGA,eAAe,EAAkB,EAAgB,EAAmD,CAClG,IAAM,EAAW,MAAM,OAAA,EAAoBD,EAAAA,SAAAA,CAAS,CAAM,EAAG,EAAQ,CAAO,EAC5E,OAAO,IAAa,IAAA,IAAa,EAAkB,EAAU,EAAQ,aAAa,EAAI,EAAW,IAAA,EACnG,CAEA,eAAe,EAAc,EAAmB,EAAqC,CACnF,IAAM,EAAoB,MAAM,EAAkB,EAAW,CAAO,EACpE,GAAI,IAAsB,IAAA,IAAa,EAAQ,mBAAmB,IAAI,CAAiB,EACrF,OAEF,EAAQ,mBAAmB,IAAI,CAAiB,EAEhD,IAAM,EAAU,MAAM,OAAA,EAAoBI,EAAAA,QAAAA,CAAQ,EAAW,CAAE,cAAe,EAAK,CAAC,EAAG,EAAW,CAAO,EACrG,OAAY,IAAA,GAKhB,GAAQ,MAAM,EAAM,IAAW,EAAK,KAAO,EAAM,KAAO,GAAK,IAAK,KAAO,EAAM,KAAa,EAE5F,IAAK,IAAM,KAAS,EAAS,CAC3B,IAAM,EAAYN,EAAAA,QAAK,KAAK,EAAW,EAAM,IAAI,EACjD,GAAI,EAAM,eAAe,EAAG,CAC1B,MAAM,EAAiB,EAAM,KAAM,EAAW,CAAO,EACrD,QACF,CAEA,GAAI,EAAM,YAAY,EAAG,CACvB,GAAI,EAAoB,EAAM,KAAM,EAAQ,OAAO,EACjD,SAEF,MAAM,EAAc,EAAW,CAAO,EACtC,QACF,CAEI,EAAM,OAAO,GAGf,EAAqB,EAAW,EAAS,EADxB,IAAsB,EAAY,IAAA,GAAYA,EAAAA,QAAK,KAAK,EAAmB,EAAM,IAAI,CAC1C,CAEhE,CAtB4F,CAuB9F,CAEA,eAAe,EAAiB,EAAc,EAAmB,EAAqC,CACpG,IAAM,EAAe,MAAM,EAAkB,EAAW,CAAO,EAC/D,GAAI,IAAiB,IAAA,GACnB,OAGF,IAAM,EAAY,MAAM,OAAA,EAAoBC,EAAAA,KAAAA,CAAK,CAAS,EAAG,EAAW,CAAO,EAC3E,OAAc,IAAA,GAIlB,IAAI,EAAU,YAAY,EAAG,CAC3B,GACE,EAAoB,EAAM,EAAQ,OAAO,GACzC,EAAoBD,EAAAA,QAAK,SAAS,CAAY,EAAG,EAAQ,OAAO,EAEhE,OAEF,MAAM,EAAc,EAAW,CAAO,EACtC,MACF,CAEI,EAAU,OAAO,GACnB,EAAqB,EAAW,EAAS,EAAc,CAAY,CAHrE,CAKF,CAEA,SAAS,EAAqB,EAAc,EAAsB,EAAe,EAAM,EAAyB,CAC9G,IAAM,EAAW,EAAY,EAAc,EAAQ,OAAO,EACtD,GACF,EAAQ,WAAW,KAAK,CAAE,OAAM,WAAU,UAAS,CAAC,CAExD,CAMA,eAAe,EACb,EACA,EACA,EACA,EACA,EACe,CACf,GAAI,EAAQ,UACV,OAEF,IAAI,EACJ,GAAI,CACF,EAAe,GAAa,MAAA,EAAME,EAAAA,SAAAA,CAAS,CAAI,CACjD,OAAS,EAAO,CACd,EAAY,EAAS,EAAM,CAAK,EAChC,MACF,CACA,GAAI,EAAQ,aAAa,IAAI,CAAY,EACvC,OAMF,IAJA,EAAQ,aAAa,IAAI,CAAY,EAI9B,EAAQ,SAAS,MAAQ,GAC9B,MAAM,QAAQ,KAAK,EAAQ,QAAQ,EAErC,IAAM,EAAU,EAAmB,EAAM,EAAc,EAAU,EAAM,CAAO,EAC9E,EAAQ,SAAS,IAAI,CAAO,EAC5B,EAAa,SAAW,EAAQ,SAAS,OAAO,CAAO,CAAC,EACxD,EAAQ,SAAS,KAAK,CAAO,CAC/B,CAEA,eAAe,EACb,EACA,EACA,EACA,EACA,EACsB,CACtB,GAAI,CACF,IAAM,EAAO,MAAA,EAAMG,EAAAA,SAAAA,CAAS,EAAM,MAAM,EAClC,EAAiB,CAAE,WAAU,YAAa,EAAQ,QAAQ,WAAY,EAE5E,GAAI,IAAS,cACX,MAAO,CAAE,KAAM,CAAE,OAAM,QAASE,EAAAA,YAAY,EAAM,CAAc,CAAE,CAAE,EAGtE,IAAM,EAAY,EAAQ,UAC1B,GAAI,IAAc,EAAU,gBAAgB,EAAM,CAAI,GAAK,EAAU,gBAAgB,EAAc,CAAI,GACrG,MAAO,CAAE,cAAe,CAAK,EAE/B,GAAM,CAAE,UAAS,gBAAe,kBAAmB,MAAM,EAAyB,EAAM,CAAc,EACtG,MAAO,CACL,KAAM,CAAE,OAAM,UAAS,sBAAuB,CAAc,EAG5D,QACE,IAAmB,IAAA,GACf,IAAA,GACA,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,mDAAmD,GACtG,CACF,OAAS,EAAO,CAKd,OAJI,aAAiBC,EAAAA,kBACnB,EAAQ,UAAY,GACb,CAAE,MAAO,CAAM,GAEjB,CAAE,MAAO,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,KAAA,EAAIL,EAAAA,gBAAAA,CAAgB,CAAK,GAAI,CAC1F,CACF,CAQA,eAAsB,EACpB,EACA,EAC0G,CAC1G,GAAI,CACF,OAAO,MAAMM,EAAAA,kCAAkC,EAAM,CAAc,CACrE,OAAS,EAAO,CACd,GAAI,aAAiBD,EAAAA,iBACnB,MAAM,EAER,MAAO,CAAE,QAASD,EAAAA,YAAY,EAAM,CAAc,EAAG,gBAAA,EAAgBJ,EAAAA,gBAAAA,CAAgB,CAAK,CAAE,CAC9F,CACF,CAGA,SAAgB,EAAwB,EAAoB,EAA4B,CACtF,GAAI,EAAO,YAAc,EAAO,MAAM,OAAS,EAC7C,OAEF,IAAM,EAAc,EAAO,MAAM,SAAS,CAAE,OAAM,2BAChD,EAAwB,CAAC,CAAE,KAAM,EAAW,EAAM,EAAO,WAAW,EAAG,GAAG,CAAsB,CAAC,EAAI,CAAC,CACxG,EACI,EAAY,OAAS,IAGzB,EAAO,qBAAuBO,EAAAA,4BAA4B,EAAa,EAAQ,WAAW,EAC5F,CAQA,SAAgB,EACd,EACA,EACA,EACa,CACb,IAAM,EAAQ,IAAI,IAAI,GAAS,YAAY,oBAAoB,EAEzD,EACJ,GAAwB,OAAO,OAAO,EAAqB,2BAA4B,CAAa,EAC/F,EAAqB,2BAA2B,IAAkB,CAAC,EACpE,CAAC,EACP,IAAK,IAAM,KAAQ,EACjB,EAAM,IAAI,CAAI,EAEhB,OAAO,CACT,CAEA,SAAS,EAAoB,EAAc,EAA+B,CASxE,OARI,EAAsB,IAAI,CAAI,EACzB,GAGT,CAAI,EAAQ,cAIL,EAAmB,IAAI,CAAI,CACpC,CAEA,SAAS,EAAkB,EAAmB,EAA4B,CACxE,IAAM,EAAWV,EAAAA,QAAK,SAAS,EAAW,CAAS,EACnD,OAAO,IAAa,IAAO,IAAa,MAAQ,CAAC,EAAS,WAAW,KAAKA,EAAAA,QAAK,KAAK,GAAK,CAACA,EAAAA,QAAK,WAAW,CAAQ,CACpH,CASA,SAAgB,EAAc,EAAsB,EAAsB,EAAiB,GAAgB,CACzG,GAAI,EACF,OAAO,EAAY,EAAc,EAAS,EAAI,IAAM,IAAA,GAEtD,IAAM,EAAW,EAAa,MAAM,GAAG,EACvC,IAAK,IAAM,KAAW,EAAS,MAAM,EAAG,EAAE,EACxC,GAAI,EAAsB,IAAI,CAAO,GAAM,CAAC,EAAQ,cAAgB,EAAmB,IAAI,CAAO,EAChG,MAAO,GAGX,OAAO,EAAY,EAAc,CAAO,IAAM,IAAA,EAChD,CAEA,SAAgB,EAAY,EAAc,EAAsB,EAAiB,GAAiC,CAChH,IAAM,EAAY,EAAK,YAAY,EAEjC,MAAC,IACA,EAAU,SAAS,OAAO,GACzB,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,SAAS,GAC5B,EAAU,SAAS,UAAU,MAM9B,GACA,EAAQ,cACR,GAAgB,KAAKA,EAAAA,QAAK,SAAS,CAAI,CAAC,GAAK,GAAsB,KAAKA,EAAAA,QAAK,SAAS,CAAI,CAAC,GAK9F,OAAOW,EAAAA,eAAe,CAAI,CAC5B,CAEA,SAAgB,EAAW,EAAc,EAAsB,CAC7D,OAAOX,EAAAA,QAAK,SAAS,EAAM,CAAI,GAAKA,EAAAA,QAAK,SAAS,CAAI,CACxD,CAEA,SAAgB,EAAY,EAAuB,CACjD,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAgB,EAAY,EAAuB,CACjD,QAAQ,OAAO,MAAM,CAAO,CAC9B"}
+{"version":3,"file":"scan.cjs","names":["os","path","stat","realpath","getErrorMessage","lstat","readFile","readdir","measureCode","NativeAddonError","measureCodeWithCrossFileDataAsync","measureCrossFileDuplication","detectLanguage"],"sources":["../src/scan.ts"],"sourcesContent":["import { lstat, readdir, readFile, realpath, stat } from 'node:fs/promises';\nimport os from 'node:os';\nimport path from 'node:path';\nimport { getErrorMessage } from '@willbooster/shared-lib';\nimport { measureCrossFileDuplication, type CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport type { CrossFileDuplicationFileData } from './duplication.js';\nimport type { Exclusion } from './exclusion.js';\nimport { detectLanguage } from './languages.js';\nimport { measureCode, measureCodeWithCrossFileDataAsync } from './metrics.js';\nimport { NativeAddonError } from './nativeMetrics.js';\nimport type { CodeMetrics, DuplicationOptions, LanguageName, MeasureOptions } from './types.js';\n\n/** The scan settings shared by every command (a structural subset of each command's options). */\nexport interface ScanOptions {\n  duplication: Required<DuplicationOptions>;\n  includeTests: boolean;\n  /**\n   * Loads the exclusion covering the files a directory scan found (absolute paths); an explicitly\n   * targeted file is always measured.\n   */\n  loadExclusion?: (absolutePaths: readonly string[]) => Promise<Exclusion>;\n}\n\nexport interface FileMetrics {\n  file: string;\n  metrics: CodeMetrics;\n  /** Cross-file duplicate candidates and token/statement data, collected only for directory scans. */\n  duplicationCandidates?: CrossFileDuplicationFileData;\n}\n\nexport interface ScanResult {\n  crossFileDuplication?: CrossFileDuplicationMetrics;\n  displayRoot: string;\n  errors: string[];\n  /** Non-fatal degradations (e.g. cross-file candidates unavailable); the file is still measured. */\n  warnings: string[];\n  /** Files skipped because their content is generated code (see Exclusion.isGeneratedCode). */\n  generatedFiles: string[];\n  fatalError?: string;\n  files: FileMetrics[];\n}\n\nconst ignoredDirectoryNames = new Set([\n  '.agents',\n  '.claude',\n  '.cursor',\n  '.git',\n  '.next',\n  '.playwright-cli',\n  '.tox',\n  '.tmp',\n  '.turbo',\n  '.venv',\n  '.yarn',\n  '__fixtures__',\n  '__generated__',\n  '__pycache__',\n  'coverage',\n  'dist',\n  'fixtures',\n  'generated',\n  'node_modules',\n  // .NET SDK intermediate output (generated sources such as `*.GlobalUsings.g.cs`).\n  'obj',\n  'target',\n  'test-fixtures',\n  'vendor',\n  'venv',\n]);\n\nconst testDirectoryNames = new Set(['__tests__', 'test', 'tests', 'spec']);\nconst testFilePattern = /(?:^test(?:[_-].*)?|\\.(?:spec|test)|[_-](?:test|spec))\\.[^.]+$/iu;\n// JUnit (Java/Kotlin) and xUnit/NUnit (C#) tests use case-sensitive `Test`/`Tests` class-name\n// suffixes; case-insensitive matching would catch production files like `contest.java`.\nconst suffixTestFilePattern = /Tests?\\.(?:java|kt|cs)$/u;\n\nexport function resolveTarget(target: string): string {\n  if (target === '~') {\n    return os.homedir();\n  }\n\n  if (target.startsWith('~/')) {\n    return path.join(os.homedir(), target.slice(2));\n  }\n\n  return path.resolve(target);\n}\n\n/** Returns the directory from which the config file search should start (the target itself if it is a directory). */\nexport async function configSearchDirectory(target: string): Promise<string> {\n  try {\n    const targetStat = await stat(target);\n    return targetStat.isDirectory() ? target : path.dirname(target);\n  } catch {\n    return path.dirname(target);\n  }\n}\n\n/** Shared state of one scan, threaded through the directory walk instead of positional plumbing. */\ninterface ScanContext {\n  options: ScanOptions;\n  /**\n   * Outcomes in discovery order. Files are measured concurrently, so a measurement is recorded as\n   * a promise here and applied in this order once all have settled, keeping results deterministic.\n   */\n  outcomes: (ScanOutcome | Promise<ScanOutcome>)[];\n  /** Measurements in flight, bounded so file contents and payloads do not pile up. */\n  inFlight: Set<Promise<ScanOutcome>>;\n  /** Set once a measurement fails fatally; no further measurement starts. */\n  fatalSeen: boolean;\n  visitedDirectories: Set<string>;\n  visitedFiles: Set<string>;\n  /** Scan root: paths are displayed relative to it, and symbolic links may not escape it. */\n  rootDirectory: string;\n  /** Files the walk found, measured once the exclusion covering all of them is loaded. */\n  candidates: ScanCandidate[];\n  exclusion?: Exclusion;\n}\n\ninterface ScanCandidate {\n  file: string;\n  language: LanguageName;\n  /** The resolved path when the file was reached through a symbolic link. */\n  realFile?: string;\n}\n\n/**\n * A missing native addon fails every file identically, so it ends the scan as one fatal error\n * instead of one \"skipped\" entry per file behind a successful exit code.\n */\ntype ScanOutcome =\n  | { file: FileMetrics; warning?: string }\n  | { generatedFile: string }\n  | { error: string }\n  | { fatal: NativeAddonError };\n\n// Twice the addon's worker count keeps its pool busy while finished payloads are parsed.\nconst maxMeasurementsInFlight = os.availableParallelism() * 2;\n\nexport async function scanTarget(target: string, options: ScanOptions): Promise<ScanResult> {\n  let canonicalTarget = target;\n  try {\n    canonicalTarget = await realpath(target);\n  } catch {\n    // stat below reports missing targets with the original path.\n  }\n\n  const fallbackDisplayRoot = path.dirname(canonicalTarget);\n  let targetStat;\n\n  try {\n    targetStat = await stat(canonicalTarget);\n  } catch (error) {\n    const fatalError = `${formatPath(canonicalTarget, fallbackDisplayRoot)}: ${getErrorMessage(error)}`;\n    return {\n      displayRoot: fallbackDisplayRoot,\n      files: [],\n      errors: [fatalError],\n      warnings: [],\n      generatedFiles: [],\n      fatalError,\n    };\n  }\n\n  if (targetStat.isFile()) {\n    const displayRoot = path.dirname(canonicalTarget);\n    const language = getLanguage(canonicalTarget, options, true);\n    if (!language) {\n      const fatalError = `${formatPath(canonicalTarget, displayRoot)}: unsupported file type`;\n      return { displayRoot, files: [], errors: [fatalError], warnings: [], generatedFiles: [], fatalError };\n    }\n\n    const context = makeScanContext(options, displayRoot);\n    await measureFile(canonicalTarget, language, 'single-file', context, canonicalTarget);\n    return settleScan(context, displayRoot);\n  }\n\n  const context = makeScanContext(options, canonicalTarget);\n  await scanDirectory(canonicalTarget, context);\n  await measureCandidates(context);\n  return settleScan(context, canonicalTarget);\n}\n\n/**\n * Measures an explicit list of repository-relative files (the git-visible ones of `check`) instead\n * of walking the directory tree, so ignored artifact directories are never parsed. Paths outside\n * the scan scope (ignored/test directories, unsupported or test file names) are skipped with the\n * same rules as the walk. Like the walk, which never tests the directory it starts in, the rules\n * apply to a file under `targetDirectory` (repository-relative, forward slashes) by its path below\n * that directory, so naming `vendor` or `test` as the target measures what is in it.\n */\nexport async function scanListedFiles(\n  rootDirectory: string,\n  relativePaths: Iterable<string>,\n  options: ScanOptions,\n  explicitFiles: ReadonlySet<string> = new Set(),\n  targetDirectory = ''\n): Promise<ScanResult> {\n  const context = makeScanContext(options, rootDirectory);\n  const targetPrefix = targetDirectory === '' ? '' : `${targetDirectory}/`;\n  for (const relativePath of relativePaths) {\n    const absolutePath = path.join(rootDirectory, relativePath);\n    const scopedPath = relativePath.startsWith(targetPrefix) ? relativePath.slice(targetPrefix.length) : relativePath;\n    const language = isScannedPath(scopedPath, options, explicitFiles.has(absolutePath))\n      ? getLanguage(relativePath, options, explicitFiles.has(absolutePath))\n      : undefined;\n    if (!language) {\n      continue;\n    }\n    // Like the walk, only regular files are sources. A symbolic link is not one: git stores only its\n    // target string, so measuring through it would diverge from what any revision of the repository\n    // contains. Reading a FIFO would block forever. A path lstat cannot inspect stays a candidate so\n    // that measuring it reports the error.\n    const stats = await lstat(absolutePath).catch(() => {});\n    if (!stats || stats.isFile()) {\n      context.candidates.push({ file: absolutePath, language });\n    }\n  }\n  await measureCandidates(context);\n  return settleScan(context, rootDirectory);\n}\n\nasync function measureCandidates(context: ScanContext): Promise<void> {\n  const exclusion = await context.options.loadExclusion?.(\n    context.candidates.flatMap(({ file, realFile }) => (realFile === undefined ? [file] : [file, realFile]))\n  );\n  context.exclusion = exclusion;\n  // Every path reaching the same real file, in discovery order, so one alias cannot decide alone.\n  const pathsByRealFile = new Map<string, ScanCandidate[]>();\n  for (const candidate of context.candidates) {\n    let realFile;\n    try {\n      realFile = candidate.realFile ?? (await realpath(candidate.file));\n    } catch (error) {\n      recordError(context, candidate.file, error);\n      continue;\n    }\n    pathsByRealFile.set(realFile, [...(pathsByRealFile.get(realFile) ?? []), candidate]);\n  }\n  for (const [realFile, candidates] of pathsByRealFile) {\n    if (context.fatalSeen) {\n      return;\n    }\n    const chosen = await chooseMeasuredPath(realFile, candidates, exclusion);\n    if (chosen !== undefined) {\n      await measureFile(chosen.file, chosen.language, 'directory', context, realFile);\n    }\n  }\n}\n\n/**\n * The path to measure a real file through. A path is excluded when its own exclusion or the real\n * file's applies, so the real path, when the scan reached it directly, is never less measurable\n * than an alias; otherwise the first alias not excluded, preferring one whose own attributes do\n * not judge the content generated.\n */\nasync function chooseMeasuredPath(\n  realFile: string,\n  candidates: readonly ScanCandidate[],\n  exclusion: Exclusion | undefined\n): Promise<ScanCandidate | undefined> {\n  if (exclusion === undefined) {\n    return candidates[0];\n  }\n  if (exclusion.isExcludedPath(realFile)) {\n    return undefined;\n  }\n  const measurable = candidates.filter(({ file }) => !exclusion.isExcludedPath(file));\n  const direct = measurable.find(({ file }) => file === realFile);\n  if (direct !== undefined || measurable.length <= 1) {\n    return direct ?? measurable[0];\n  }\n  const code = await readFile(realFile, 'utf8').catch(() => {});\n  return measurable.find(({ file }) => code !== undefined && !exclusion.isGeneratedCode(file, code)) ?? measurable[0];\n}\n\n/** Applies the scan's outcomes in discovery order once every measurement has settled. */\nasync function settleScan(context: ScanContext, displayRoot: string): Promise<ScanResult> {\n  const files: FileMetrics[] = [];\n  const errors: string[] = [];\n  const warnings: string[] = [];\n  const generatedFiles: string[] = [];\n  for (const pending of context.outcomes) {\n    const outcome = await pending;\n    if ('fatal' in outcome) {\n      const fatalError = getErrorMessage(outcome.fatal);\n      // Errors the walk recorded before the fatal failure stay reported alongside it.\n      return { displayRoot, files, errors: [...errors, fatalError], warnings, generatedFiles, fatalError };\n    }\n    if ('generatedFile' in outcome) {\n      generatedFiles.push(outcome.generatedFile);\n      continue;\n    }\n    if ('error' in outcome) {\n      errors.push(outcome.error);\n      continue;\n    }\n    files.push(outcome.file);\n    if (outcome.warning !== undefined) {\n      warnings.push(outcome.warning);\n    }\n  }\n  return { displayRoot, files, errors, warnings, generatedFiles };\n}\n\nfunction makeScanContext(options: ScanOptions, rootDirectory: string): ScanContext {\n  return {\n    options,\n    outcomes: [],\n    inFlight: new Set(),\n    fatalSeen: false,\n    visitedDirectories: new Set(),\n    visitedFiles: new Set(),\n    rootDirectory,\n    candidates: [],\n  };\n}\n\nfunction recordError(context: ScanContext, target: string, error: unknown): void {\n  context.outcomes.push({ error: `${formatPath(target, context.rootDirectory)}: ${getErrorMessage(error)}` });\n}\n\n/** Runs a filesystem operation, recording a scan error and returning undefined when it fails. */\nasync function tryFileSystem<T>(\n  operation: () => Promise<T>,\n  target: string,\n  context: ScanContext\n): Promise<T | undefined> {\n  try {\n    return await operation();\n  } catch (error) {\n    recordError(context, target, error);\n    return undefined;\n  }\n}\n\n/** Resolves the path (recording errors); undefined when that fails or the result escapes the root. */\nasync function resolveWithinRoot(target: string, context: ScanContext): Promise<string | undefined> {\n  const resolved = await tryFileSystem(() => realpath(target), target, context);\n  return resolved !== undefined && isWithinDirectory(resolved, context.rootDirectory) ? resolved : undefined;\n}\n\nasync function scanDirectory(directory: string, context: ScanContext): Promise<void> {\n  const resolvedDirectory = await resolveWithinRoot(directory, context);\n  if (resolvedDirectory === undefined || context.visitedDirectories.has(resolvedDirectory)) {\n    return;\n  }\n  context.visitedDirectories.add(resolvedDirectory);\n\n  const entries = await tryFileSystem(() => readdir(directory, { withFileTypes: true }), directory, context);\n  if (entries === undefined) {\n    return;\n  }\n  // readdir order differs between file systems; sorting keeps which path reaches a file first,\n  // and so the scan's result, the same everywhere.\n  entries.sort((left, right) => (left.name < right.name ? -1 : left.name > right.name ? 1 : 0));\n\n  for (const entry of entries) {\n    const entryPath = path.join(directory, entry.name);\n    if (entry.isSymbolicLink()) {\n      await scanSymbolicLink(entry.name, entryPath, context);\n      continue;\n    }\n\n    if (entry.isDirectory()) {\n      if (shouldSkipDirectory(entry.name, context.options)) {\n        continue;\n      }\n      await scanDirectory(entryPath, context);\n      continue;\n    }\n\n    if (entry.isFile()) {\n      // Under a symbolically linked directory the real path differs, and exclusion checks both.\n      const realFile = resolvedDirectory === directory ? undefined : path.join(resolvedDirectory, entry.name);\n      collectScannableFile(entryPath, context, entryPath, realFile);\n    }\n  }\n}\n\nasync function scanSymbolicLink(name: string, entryPath: string, context: ScanContext): Promise<void> {\n  const resolvedPath = await resolveWithinRoot(entryPath, context);\n  if (resolvedPath === undefined) {\n    return;\n  }\n\n  const entryStat = await tryFileSystem(() => stat(entryPath), entryPath, context);\n  if (entryStat === undefined) {\n    return;\n  }\n\n  if (entryStat.isDirectory()) {\n    if (\n      shouldSkipDirectory(name, context.options) ||\n      shouldSkipDirectory(path.basename(resolvedPath), context.options)\n    ) {\n      return;\n    }\n    await scanDirectory(entryPath, context);\n    return;\n  }\n\n  if (entryStat.isFile()) {\n    collectScannableFile(entryPath, context, resolvedPath, resolvedPath);\n  }\n}\n\nfunction collectScannableFile(file: string, context: ScanContext, languageFile = file, realFile?: string): void {\n  const language = getLanguage(languageFile, context.options);\n  if (language) {\n    context.candidates.push({ file, language, realFile });\n  }\n}\n\n/**\n * Resolves and deduplicates the file in discovery order, then starts measuring it concurrently; its\n * outcome is recorded in discovery order (see ScanContext.outcomes).\n */\nasync function measureFile(\n  file: string,\n  language: LanguageName,\n  mode: 'single-file' | 'directory',\n  context: ScanContext,\n  realFile?: string\n): Promise<void> {\n  if (context.fatalSeen) {\n    return;\n  }\n  let resolvedFile;\n  try {\n    resolvedFile = realFile ?? (await realpath(file));\n  } catch (error) {\n    recordError(context, file, error);\n    return;\n  }\n  if (context.visitedFiles.has(resolvedFile)) {\n    return;\n  }\n  context.visitedFiles.add(resolvedFile);\n\n  // Any settled measurement frees its slot (removed by the callback below, which runs before the\n  // race resumes), so one slow file never idles the pool.\n  while (context.inFlight.size >= maxMeasurementsInFlight) {\n    await Promise.race(context.inFlight);\n  }\n  const outcome = readAndMeasureFile(file, resolvedFile, language, mode, context);\n  context.inFlight.add(outcome);\n  void outcome.then(() => context.inFlight.delete(outcome));\n  context.outcomes.push(outcome);\n}\n\nasync function readAndMeasureFile(\n  file: string,\n  resolvedFile: string,\n  language: LanguageName,\n  mode: 'single-file' | 'directory',\n  context: ScanContext\n): Promise<ScanOutcome> {\n  try {\n    const code = await readFile(file, 'utf8');\n    const measureOptions = { language, duplication: context.options.duplication };\n    // Only directory scans compare files against each other; a single-file target has no peers.\n    if (mode === 'single-file') {\n      return { file: { file, metrics: measureCode(code, measureOptions) } };\n    }\n    // Like path exclusion, either the scanned path or the real one can judge the code generated.\n    const exclusion = context.exclusion;\n    if (exclusion && (exclusion.isGeneratedCode(file, code) || exclusion.isGeneratedCode(resolvedFile, code))) {\n      return { generatedFile: file };\n    }\n    const { metrics, crossFileData, crossFileError } = await measureWithCrossFileData(code, measureOptions);\n    return {\n      file: { file, metrics, duplicationCandidates: crossFileData },\n      // A warning, not an error: the file's metrics are complete, only its participation in\n      // cross-file matching is lost, so it is not \"skipped\" and must not fail --fail-on-error.\n      warning:\n        crossFileError === undefined\n          ? undefined\n          : `${formatPath(file, context.rootDirectory)}: cross-file duplication candidates unavailable: ${crossFileError}`,\n    };\n  } catch (error) {\n    if (error instanceof NativeAddonError) {\n      context.fatalSeen = true;\n      return { fatal: error };\n    }\n    return { error: `${formatPath(file, context.rootDirectory)}: ${getErrorMessage(error)}` };\n  }\n}\n\n/**\n * Measures a file together with its cross-file contribution from one parse. The contribution is\n * auxiliary: if collecting it fails where plain measurement succeeds (e.g. a payload too large to\n * cross the addon boundary), the metrics are still returned with the failure message, which\n * callers report as a warning rather than an error.\n */\nasync function measureWithCrossFileData(\n  code: string,\n  measureOptions: MeasureOptions\n): Promise<{ metrics: CodeMetrics; crossFileData?: CrossFileDuplicationFileData; crossFileError?: string }> {\n  try {\n    return await measureCodeWithCrossFileDataAsync(code, measureOptions);\n  } catch (error) {\n    if (error instanceof NativeAddonError) {\n      throw error;\n    }\n    return { metrics: measureCode(code, measureOptions), crossFileError: getErrorMessage(error) };\n  }\n}\n\n/** Runs after the scan so every measured file's candidates participate. */\nexport function addCrossFileDuplication(result: ScanResult, options: ScanOptions): void {\n  if (result.fatalError || result.files.length < 2) {\n    return;\n  }\n  const sourceFiles = result.files.flatMap(({ file, duplicationCandidates }) =>\n    duplicationCandidates ? [{ file: formatPath(file, result.displayRoot), ...duplicationCandidates }] : []\n  );\n  if (sourceFiles.length < 2) {\n    return;\n  }\n  result.crossFileDuplication = measureCrossFileDuplication(sourceFiles, options.duplication);\n}\n\n/**\n * Distinct 1-based code lines covered by within-file or cross-file duplicated content. Both\n * sources expose the exact lines carrying matched tokens (never block bounding ranges, which\n * would over-count comment/blank lines and the unmatched gap of a merged clone), so the union is\n * a subset of the file's code lines and a ratio derived over code lines can never exceed 1.\n */\nexport function collectDuplicatedLineNumbers(\n  metrics: CodeMetrics | undefined,\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  formattedFile: string\n): Set<number> {\n  const lines = new Set(metrics?.duplication.duplicateLineNumbers);\n  // Object.hasOwn: a file named like an Object.prototype member must not read an inherited value.\n  const crossFileLines =\n    crossFileDuplication && Object.hasOwn(crossFileDuplication.duplicateLineNumbersByFile, formattedFile)\n      ? (crossFileDuplication.duplicateLineNumbersByFile[formattedFile] ?? [])\n      : [];\n  for (const line of crossFileLines) {\n    lines.add(line);\n  }\n  return lines;\n}\n\nfunction shouldSkipDirectory(name: string, options: ScanOptions): boolean {\n  if (ignoredDirectoryNames.has(name)) {\n    return true;\n  }\n\n  if (options.includeTests) {\n    return false;\n  }\n\n  return testDirectoryNames.has(name);\n}\n\nexport function isWithinDirectory(candidate: string, directory: string): boolean {\n  const relative = path.relative(directory, candidate);\n  return relative === '' || (relative !== '..' && !relative.startsWith(`..${path.sep}`) && !path.isAbsolute(relative));\n}\n\n/**\n * Whether a repository-relative path would be scanned: no ignored or excluded-test directory\n * segment and a supported, non-test file name. An explicitly targeted file only needs a supported\n * language, as in the ranking command.\n */\nfunction isScannedPath(relativePath: string, options: ScanOptions, explicitTarget = false): boolean {\n  if (explicitTarget) {\n    return getLanguage(relativePath, options, true) !== undefined;\n  }\n  const segments = relativePath.split('/');\n  for (const segment of segments.slice(0, -1)) {\n    if (ignoredDirectoryNames.has(segment) || (!options.includeTests && testDirectoryNames.has(segment))) {\n      return false;\n    }\n  }\n  return getLanguage(relativePath, options) !== undefined;\n}\n\nexport function getLanguage(file: string, options: ScanOptions, explicitTarget = false): LanguageName | undefined {\n  const lowerFile = file.toLowerCase();\n  if (\n    !explicitTarget &&\n    (lowerFile.endsWith('.d.ts') ||\n      lowerFile.endsWith('.d.mts') ||\n      lowerFile.endsWith('.d.cts') ||\n      lowerFile.endsWith('.min.js') ||\n      lowerFile.endsWith('.pnp.cjs'))\n  ) {\n    return undefined;\n  }\n\n  if (\n    !explicitTarget &&\n    !options.includeTests &&\n    (testFilePattern.test(path.basename(file)) || suffixTestFilePattern.test(path.basename(file)))\n  ) {\n    return undefined;\n  }\n\n  return detectLanguage(file);\n}\n\n/** The path relative to `base` with forward slashes on every platform, so it compares equal to the paths git prints. */\nexport function formatPath(file: string, base: string): string {\n  return path.relative(base, file).replaceAll(path.sep, '/') || path.basename(file);\n}\n\nexport function writeStdout(message: string): void {\n  process.stdout.write(message);\n}\n\nexport function writeStderr(message: string): void {\n  process.stderr.write(message);\n}\n"],"mappings":"2VA0CA,MAAM,kBAAwB,IAAI,IAAI,CACpC,UACA,UACA,UACA,OACA,QACA,kBACA,OACA,OACA,SACA,QACA,QACA,eACA,gBACA,cACA,WACA,OACA,WACA,YACA,eAEA,MACA,SACA,gBACA,SACA,MACF,CAAC,EAEK,kBAAqB,IAAI,IAAI,CAAC,YAAa,OAAQ,QAAS,MAAM,CAAC,EACnE,EAAkB,mEAGlB,EAAwB,2BAE9B,SAAgB,EAAc,EAAwB,CASpD,OARI,IAAW,IACNA,EAAAA,QAAG,QAAQ,EAGhB,EAAO,WAAW,IAAI,EACjBC,EAAAA,QAAK,KAAKD,EAAAA,QAAG,QAAQ,EAAG,EAAO,MAAM,CAAC,CAAC,EAGzCC,EAAAA,QAAK,QAAQ,CAAM,CAC5B,CAGA,eAAsB,EAAsB,EAAiC,CAC3E,GAAI,CAEF,OAAO,MAAA,EADkBC,EAAAA,KAAAA,CAAK,CAAM,EAAA,CAClB,YAAY,EAAI,EAASD,EAAAA,QAAK,QAAQ,CAAM,CAChE,MAAQ,CACN,OAAOA,EAAAA,QAAK,QAAQ,CAAM,CAC5B,CACF,CAyCA,MAAM,EAA0BD,EAAAA,QAAG,qBAAqB,EAAI,EAE5D,eAAsB,EAAW,EAAgB,EAA2C,CAC1F,IAAI,EAAkB,EACtB,GAAI,CACF,EAAkB,MAAA,EAAMG,EAAAA,SAAAA,CAAS,CAAM,CACzC,MAAQ,CAER,CAEA,IAAM,EAAsBF,EAAAA,QAAK,QAAQ,CAAe,EACpD,EAEJ,GAAI,CACF,EAAa,MAAA,EAAMC,EAAAA,KAAAA,CAAK,CAAe,CACzC,OAAS,EAAO,CACd,IAAM,EAAa,GAAG,EAAW,EAAiB,CAAmB,EAAE,KAAA,EAAIE,EAAAA,gBAAAA,CAAgB,CAAK,IAChG,MAAO,CACL,YAAa,EACb,MAAO,CAAC,EACR,OAAQ,CAAC,CAAU,EACnB,SAAU,CAAC,EACX,eAAgB,CAAC,EACjB,YACF,CACF,CAEA,GAAI,EAAW,OAAO,EAAG,CACvB,IAAM,EAAcH,EAAAA,QAAK,QAAQ,CAAe,EAC1C,EAAW,EAAY,EAAiB,EAAS,EAAI,EAC3D,GAAI,CAAC,EAAU,CACb,IAAM,EAAa,GAAG,EAAW,EAAiB,CAAW,EAAE,yBAC/D,MAAO,CAAE,cAAa,MAAO,CAAC,EAAG,OAAQ,CAAC,CAAU,EAAG,SAAU,CAAC,EAAG,eAAgB,CAAC,EAAG,YAAW,CACtG,CAEA,IAAM,EAAU,EAAgB,EAAS,CAAW,EAEpD,OADA,MAAM,EAAY,EAAiB,EAAU,cAAe,EAAS,CAAe,EAC7E,EAAW,EAAS,CAAW,CACxC,CAEA,IAAM,EAAU,EAAgB,EAAS,CAAe,EAGxD,OAFA,MAAM,EAAc,EAAiB,CAAO,EAC5C,MAAM,EAAkB,CAAO,EACxB,EAAW,EAAS,CAAe,CAC5C,CAUA,eAAsB,EACpB,EACA,EACA,EACA,kBAAqC,IAAI,IACzC,EAAkB,GACG,CACrB,IAAM,EAAU,EAAgB,EAAS,CAAa,EAChD,EAAe,IAAoB,GAAK,GAAK,GAAG,EAAgB,GACtE,IAAK,IAAM,KAAgB,EAAe,CACxC,IAAM,EAAeA,EAAAA,QAAK,KAAK,EAAe,CAAY,EAEpD,EAAW,EADE,EAAa,WAAW,CAAY,EAAI,EAAa,MAAM,EAAa,MAAM,EAAI,EAC1D,EAAS,EAAc,IAAI,CAAY,CAAC,EAC/E,EAAY,EAAc,EAAS,EAAc,IAAI,CAAY,CAAC,EAClE,IAAA,GACJ,GAAI,CAAC,EACH,SAMF,IAAM,EAAQ,MAAA,EAAMI,EAAAA,MAAAA,CAAM,CAAY,CAAC,CAAC,UAAY,CAAC,CAAC,GAClD,CAAC,GAAS,EAAM,OAAO,IACzB,EAAQ,WAAW,KAAK,CAAE,KAAM,EAAc,UAAS,CAAC,CAE5D,CAEA,OADA,MAAM,EAAkB,CAAO,EACxB,EAAW,EAAS,CAAa,CAC1C,CAEA,eAAe,EAAkB,EAAqC,CACpE,IAAM,EAAY,MAAM,EAAQ,QAAQ,gBACtC,EAAQ,WAAW,SAAS,CAAE,OAAM,cAAgB,IAAa,IAAA,GAAY,CAAC,CAAI,EAAI,CAAC,EAAM,CAAQ,CAAE,CACzG,EACA,EAAQ,UAAY,EAEpB,IAAM,kBAAkB,IAAI,IAC5B,IAAK,IAAM,KAAa,EAAQ,WAAY,CAC1C,IAAI,EACJ,GAAI,CACF,EAAW,EAAU,UAAa,MAAA,EAAMF,EAAAA,SAAAA,CAAS,EAAU,IAAI,CACjE,OAAS,EAAO,CACd,EAAY,EAAS,EAAU,KAAM,CAAK,EAC1C,QACF,CACA,EAAgB,IAAI,EAAU,CAAC,GAAI,EAAgB,IAAI,CAAQ,GAAK,CAAC,EAAI,CAAS,CAAC,CACrF,CACA,IAAK,GAAM,CAAC,EAAU,KAAe,EAAiB,CACpD,GAAI,EAAQ,UACV,OAEF,IAAM,EAAS,MAAM,EAAmB,EAAU,EAAY,CAAS,EACnE,IAAW,IAAA,IACb,MAAM,EAAY,EAAO,KAAM,EAAO,SAAU,YAAa,EAAS,CAAQ,CAElF,CACF,CAQA,eAAe,EACb,EACA,EACA,EACoC,CACpC,GAAI,IAAc,IAAA,GAChB,OAAO,EAAW,GAEpB,GAAI,EAAU,eAAe,CAAQ,EACnC,OAEF,IAAM,EAAa,EAAW,QAAQ,CAAE,UAAW,CAAC,EAAU,eAAe,CAAI,CAAC,EAC5E,EAAS,EAAW,MAAM,CAAE,UAAW,IAAS,CAAQ,EAC9D,GAAI,IAAW,IAAA,IAAa,EAAW,QAAU,EAC/C,OAAO,GAAU,EAAW,GAE9B,IAAM,EAAO,MAAA,EAAMG,EAAAA,SAAAA,CAAS,EAAU,MAAM,CAAC,CAAC,UAAY,CAAC,CAAC,EAC5D,OAAO,EAAW,MAAM,CAAE,UAAW,IAAS,IAAA,IAAa,CAAC,EAAU,gBAAgB,EAAM,CAAI,CAAC,GAAK,EAAW,EACnH,CAGA,eAAe,EAAW,EAAsB,EAA0C,CACxF,IAAM,EAAuB,CAAC,EACxB,EAAmB,CAAC,EACpB,EAAqB,CAAC,EACtB,EAA2B,CAAC,EAClC,IAAK,IAAM,KAAW,EAAQ,SAAU,CACtC,IAAM,EAAU,MAAM,EACtB,GAAI,UAAW,EAAS,CACtB,IAAM,GAAA,EAAaF,EAAAA,gBAAAA,CAAgB,EAAQ,KAAK,EAEhD,MAAO,CAAE,cAAa,QAAO,OAAQ,CAAC,GAAG,EAAQ,CAAU,EAAG,WAAU,iBAAgB,YAAW,CACrG,CACA,GAAI,kBAAmB,EAAS,CAC9B,EAAe,KAAK,EAAQ,aAAa,EACzC,QACF,CACA,GAAI,UAAW,EAAS,CACtB,EAAO,KAAK,EAAQ,KAAK,EACzB,QACF,CACA,EAAM,KAAK,EAAQ,IAAI,EACnB,EAAQ,UAAY,IAAA,IACtB,EAAS,KAAK,EAAQ,OAAO,CAEjC,CACA,MAAO,CAAE,cAAa,QAAO,SAAQ,WAAU,gBAAe,CAChE,CAEA,SAAS,EAAgB,EAAsB,EAAoC,CACjF,MAAO,CACL,UACA,SAAU,CAAC,EACX,yBAAU,IAAI,IACd,UAAW,GACX,mCAAoB,IAAI,IACxB,6BAAc,IAAI,IAClB,gBACA,WAAY,CAAC,CACf,CACF,CAEA,SAAS,EAAY,EAAsB,EAAgB,EAAsB,CAC/E,EAAQ,SAAS,KAAK,CAAE,MAAO,GAAG,EAAW,EAAQ,EAAQ,aAAa,EAAE,KAAA,EAAIA,EAAAA,gBAAAA,CAAgB,CAAK,GAAI,CAAC,CAC5G,CAGA,eAAe,EACb,EACA,EACA,EACwB,CACxB,GAAI,CACF,OAAO,MAAM,EAAU,CACzB,OAAS,EAAO,CACd,EAAY,EAAS,EAAQ,CAAK,EAClC,MACF,CACF,CAGA,eAAe,EAAkB,EAAgB,EAAmD,CAClG,IAAM,EAAW,MAAM,OAAA,EAAoBD,EAAAA,SAAAA,CAAS,CAAM,EAAG,EAAQ,CAAO,EAC5E,OAAO,IAAa,IAAA,IAAa,EAAkB,EAAU,EAAQ,aAAa,EAAI,EAAW,IAAA,EACnG,CAEA,eAAe,EAAc,EAAmB,EAAqC,CACnF,IAAM,EAAoB,MAAM,EAAkB,EAAW,CAAO,EACpE,GAAI,IAAsB,IAAA,IAAa,EAAQ,mBAAmB,IAAI,CAAiB,EACrF,OAEF,EAAQ,mBAAmB,IAAI,CAAiB,EAEhD,IAAM,EAAU,MAAM,OAAA,EAAoBI,EAAAA,QAAAA,CAAQ,EAAW,CAAE,cAAe,EAAK,CAAC,EAAG,EAAW,CAAO,EACrG,OAAY,IAAA,GAKhB,GAAQ,MAAM,EAAM,IAAW,EAAK,KAAO,EAAM,KAAO,GAAK,IAAK,KAAO,EAAM,KAAa,EAE5F,IAAK,IAAM,KAAS,EAAS,CAC3B,IAAM,EAAYN,EAAAA,QAAK,KAAK,EAAW,EAAM,IAAI,EACjD,GAAI,EAAM,eAAe,EAAG,CAC1B,MAAM,EAAiB,EAAM,KAAM,EAAW,CAAO,EACrD,QACF,CAEA,GAAI,EAAM,YAAY,EAAG,CACvB,GAAI,EAAoB,EAAM,KAAM,EAAQ,OAAO,EACjD,SAEF,MAAM,EAAc,EAAW,CAAO,EACtC,QACF,CAEI,EAAM,OAAO,GAGf,EAAqB,EAAW,EAAS,EADxB,IAAsB,EAAY,IAAA,GAAYA,EAAAA,QAAK,KAAK,EAAmB,EAAM,IAAI,CAC1C,CAEhE,CAtB4F,CAuB9F,CAEA,eAAe,EAAiB,EAAc,EAAmB,EAAqC,CACpG,IAAM,EAAe,MAAM,EAAkB,EAAW,CAAO,EAC/D,GAAI,IAAiB,IAAA,GACnB,OAGF,IAAM,EAAY,MAAM,OAAA,EAAoBC,EAAAA,KAAAA,CAAK,CAAS,EAAG,EAAW,CAAO,EAC3E,OAAc,IAAA,GAIlB,IAAI,EAAU,YAAY,EAAG,CAC3B,GACE,EAAoB,EAAM,EAAQ,OAAO,GACzC,EAAoBD,EAAAA,QAAK,SAAS,CAAY,EAAG,EAAQ,OAAO,EAEhE,OAEF,MAAM,EAAc,EAAW,CAAO,EACtC,MACF,CAEI,EAAU,OAAO,GACnB,EAAqB,EAAW,EAAS,EAAc,CAAY,CAHrE,CAKF,CAEA,SAAS,EAAqB,EAAc,EAAsB,EAAe,EAAM,EAAyB,CAC9G,IAAM,EAAW,EAAY,EAAc,EAAQ,OAAO,EACtD,GACF,EAAQ,WAAW,KAAK,CAAE,OAAM,WAAU,UAAS,CAAC,CAExD,CAMA,eAAe,EACb,EACA,EACA,EACA,EACA,EACe,CACf,GAAI,EAAQ,UACV,OAEF,IAAI,EACJ,GAAI,CACF,EAAe,GAAa,MAAA,EAAME,EAAAA,SAAAA,CAAS,CAAI,CACjD,OAAS,EAAO,CACd,EAAY,EAAS,EAAM,CAAK,EAChC,MACF,CACA,GAAI,EAAQ,aAAa,IAAI,CAAY,EACvC,OAMF,IAJA,EAAQ,aAAa,IAAI,CAAY,EAI9B,EAAQ,SAAS,MAAQ,GAC9B,MAAM,QAAQ,KAAK,EAAQ,QAAQ,EAErC,IAAM,EAAU,EAAmB,EAAM,EAAc,EAAU,EAAM,CAAO,EAC9E,EAAQ,SAAS,IAAI,CAAO,EAC5B,EAAa,SAAW,EAAQ,SAAS,OAAO,CAAO,CAAC,EACxD,EAAQ,SAAS,KAAK,CAAO,CAC/B,CAEA,eAAe,EACb,EACA,EACA,EACA,EACA,EACsB,CACtB,GAAI,CACF,IAAM,EAAO,MAAA,EAAMG,EAAAA,SAAAA,CAAS,EAAM,MAAM,EAClC,EAAiB,CAAE,WAAU,YAAa,EAAQ,QAAQ,WAAY,EAE5E,GAAI,IAAS,cACX,MAAO,CAAE,KAAM,CAAE,OAAM,QAASE,EAAAA,YAAY,EAAM,CAAc,CAAE,CAAE,EAGtE,IAAM,EAAY,EAAQ,UAC1B,GAAI,IAAc,EAAU,gBAAgB,EAAM,CAAI,GAAK,EAAU,gBAAgB,EAAc,CAAI,GACrG,MAAO,CAAE,cAAe,CAAK,EAE/B,GAAM,CAAE,UAAS,gBAAe,kBAAmB,MAAM,EAAyB,EAAM,CAAc,EACtG,MAAO,CACL,KAAM,CAAE,OAAM,UAAS,sBAAuB,CAAc,EAG5D,QACE,IAAmB,IAAA,GACf,IAAA,GACA,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,mDAAmD,GACtG,CACF,OAAS,EAAO,CAKd,OAJI,aAAiBC,EAAAA,kBACnB,EAAQ,UAAY,GACb,CAAE,MAAO,CAAM,GAEjB,CAAE,MAAO,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,KAAA,EAAIL,EAAAA,gBAAAA,CAAgB,CAAK,GAAI,CAC1F,CACF,CAQA,eAAe,EACb,EACA,EAC0G,CAC1G,GAAI,CACF,OAAO,MAAMM,EAAAA,kCAAkC,EAAM,CAAc,CACrE,OAAS,EAAO,CACd,GAAI,aAAiBD,EAAAA,iBACnB,MAAM,EAER,MAAO,CAAE,QAASD,EAAAA,YAAY,EAAM,CAAc,EAAG,gBAAA,EAAgBJ,EAAAA,gBAAAA,CAAgB,CAAK,CAAE,CAC9F,CACF,CAGA,SAAgB,EAAwB,EAAoB,EAA4B,CACtF,GAAI,EAAO,YAAc,EAAO,MAAM,OAAS,EAC7C,OAEF,IAAM,EAAc,EAAO,MAAM,SAAS,CAAE,OAAM,2BAChD,EAAwB,CAAC,CAAE,KAAM,EAAW,EAAM,EAAO,WAAW,EAAG,GAAG,CAAsB,CAAC,EAAI,CAAC,CACxG,EACI,EAAY,OAAS,IAGzB,EAAO,qBAAuBO,EAAAA,4BAA4B,EAAa,EAAQ,WAAW,EAC5F,CAQA,SAAgB,EACd,EACA,EACA,EACa,CACb,IAAM,EAAQ,IAAI,IAAI,GAAS,YAAY,oBAAoB,EAEzD,EACJ,GAAwB,OAAO,OAAO,EAAqB,2BAA4B,CAAa,EAC/F,EAAqB,2BAA2B,IAAkB,CAAC,EACpE,CAAC,EACP,IAAK,IAAM,KAAQ,EACjB,EAAM,IAAI,CAAI,EAEhB,OAAO,CACT,CAEA,SAAS,EAAoB,EAAc,EAA+B,CASxE,OARI,EAAsB,IAAI,CAAI,EACzB,GAGT,CAAI,EAAQ,cAIL,EAAmB,IAAI,CAAI,CACpC,CAEA,SAAgB,EAAkB,EAAmB,EAA4B,CAC/E,IAAM,EAAWV,EAAAA,QAAK,SAAS,EAAW,CAAS,EACnD,OAAO,IAAa,IAAO,IAAa,MAAQ,CAAC,EAAS,WAAW,KAAKA,EAAAA,QAAK,KAAK,GAAK,CAACA,EAAAA,QAAK,WAAW,CAAQ,CACpH,CAOA,SAAS,EAAc,EAAsB,EAAsB,EAAiB,GAAgB,CAClG,GAAI,EACF,OAAO,EAAY,EAAc,EAAS,EAAI,IAAM,IAAA,GAEtD,IAAM,EAAW,EAAa,MAAM,GAAG,EACvC,IAAK,IAAM,KAAW,EAAS,MAAM,EAAG,EAAE,EACxC,GAAI,EAAsB,IAAI,CAAO,GAAM,CAAC,EAAQ,cAAgB,EAAmB,IAAI,CAAO,EAChG,MAAO,GAGX,OAAO,EAAY,EAAc,CAAO,IAAM,IAAA,EAChD,CAEA,SAAgB,EAAY,EAAc,EAAsB,EAAiB,GAAiC,CAChH,IAAM,EAAY,EAAK,YAAY,EAEjC,MAAC,IACA,EAAU,SAAS,OAAO,GACzB,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,SAAS,GAC5B,EAAU,SAAS,UAAU,MAM9B,GACA,EAAQ,cACR,GAAgB,KAAKA,EAAAA,QAAK,SAAS,CAAI,CAAC,GAAK,GAAsB,KAAKA,EAAAA,QAAK,SAAS,CAAI,CAAC,GAK9F,OAAOW,EAAAA,eAAe,CAAI,CAC5B,CAGA,SAAgB,EAAW,EAAc,EAAsB,CAC7D,OAAOX,EAAAA,QAAK,SAAS,EAAM,CAAI,CAAC,CAAC,WAAWA,EAAAA,QAAK,IAAK,GAAG,GAAKA,EAAAA,QAAK,SAAS,CAAI,CAClF,CAEA,SAAgB,EAAY,EAAuB,CACjD,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAgB,EAAY,EAAuB,CACjD,QAAQ,OAAO,MAAM,CAAO,CAC9B"}

package/dist/scan.d.ts

@@ -1,7 +1,7 @@
 import { type CrossFileDuplicationMetrics } from './crossFileDuplication.js';
 import type { CrossFileDuplicationFileData } from './duplication.js';
 import type { Exclusion } from './exclusion.js';
-import type { CodeMetrics, DuplicationOptions, LanguageName, MeasureOptions } from './types.js';
+import type { CodeMetrics, DuplicationOptions, LanguageName } from './types.js';
 /** The scan settings shared by every command (a structural subset of each command's options). */
 export interface ScanOptions {
     duplication: Required<DuplicationOptions>;
@@ -34,23 +34,14 @@ export declare function resolveTarget(target: string): string;
 export declare function configSearchDirectory(target: string): Promise<string>;
 export declare function scanTarget(target: string, options: ScanOptions): Promise<ScanResult>;
 /**
- * Measures an explicit list of repository-relative files (the diff gate's git-visible allowlist)
- * instead of walking the directory tree, so ignored artifact directories are never parsed. Paths
- * outside the scan scope (ignored/test directories, unsupported or test file names) are skipped
- * with the same rules as the walk.
+ * Measures an explicit list of repository-relative files (the git-visible ones of `check`) instead
+ * of walking the directory tree, so ignored artifact directories are never parsed. Paths outside
+ * the scan scope (ignored/test directories, unsupported or test file names) are skipped with the
+ * same rules as the walk. Like the walk, which never tests the directory it starts in, the rules
+ * apply to a file under `targetDirectory` (repository-relative, forward slashes) by its path below
+ * that directory, so naming `vendor` or `test` as the target measures what is in it.
  */
-export declare function scanListedFiles(rootDirectory: string, relativePaths: Iterable<string>, options: ScanOptions, explicitFiles?: ReadonlySet<string>): Promise<ScanResult>;
-/**
- * Measures a file together with its cross-file contribution from one parse. The contribution is
- * auxiliary: if collecting it fails where plain measurement succeeds (e.g. a payload too large to
- * cross the addon boundary), the metrics are still returned with the failure message, which
- * callers report as a warning rather than an error.
- */
-export declare function measureWithCrossFileData(code: string, measureOptions: MeasureOptions): Promise<{
-    metrics: CodeMetrics;
-    crossFileData?: CrossFileDuplicationFileData;
-    crossFileError?: string;
-}>;
+export declare function scanListedFiles(rootDirectory: string, relativePaths: Iterable<string>, options: ScanOptions, explicitFiles?: ReadonlySet<string>, targetDirectory?: string): Promise<ScanResult>;
 /** Runs after the scan so every measured file's candidates participate. */
 export declare function addCrossFileDuplication(result: ScanResult, options: ScanOptions): void;
 /**
@@ -60,15 +51,9 @@ export declare function addCrossFileDuplication(result: ScanResult, options: Sca
  * a subset of the file's code lines and a ratio derived over code lines can never exceed 1.
  */
 export declare function collectDuplicatedLineNumbers(metrics: CodeMetrics | undefined, crossFileDuplication: CrossFileDuplicationMetrics | undefined, formattedFile: string): Set<number>;
-/**
- * Whether a repository-relative path would be scanned: no ignored or excluded-test directory
- * segment and a supported, non-test file name. The diff gate uses this for base-revision
- * eligibility, so code renamed into scan scope gates as new code instead of ratcheting against
- * a blob the scanner would never have measured. An explicitly targeted file only needs a supported
- * language, as in the ranking command.
- */
-export declare function isScannedPath(relativePath: string, options: ScanOptions, explicitTarget?: boolean): boolean;
+export declare function isWithinDirectory(candidate: string, directory: string): boolean;
 export declare function getLanguage(file: string, options: ScanOptions, explicitTarget?: boolean): LanguageName | undefined;
+/** The path relative to `base` with forward slashes on every platform, so it compares equal to the paths git prints. */
 export declare function formatPath(file: string, base: string): string;
 export declare function writeStdout(message: string): void;
 export declare function writeStderr(message: string): void;

package/dist/scan.js

@@ -1,2 +1,2 @@
-import{measureCrossFileDuplication as e}from"./crossFileDuplication.js";import{detectLanguage as t}from"./languages.js";import{NativeAddonError as n}from"./nativeMetrics.js";import{measureCode as r,measureCodeWithCrossFileDataAsync as i}from"./metrics.js";import{getErrorMessage as a}from"@willbooster/shared-lib";import{lstat as o,readFile as s,readdir as c,realpath as l,stat as u}from"node:fs/promises";import d from"node:path";import f from"node:os";const p=/* @__PURE__ */ new Set([`.agents`,`.claude`,`.cursor`,`.git`,`.next`,`.playwright-cli`,`.tox`,`.tmp`,`.turbo`,`.venv`,`.yarn`,`__fixtures__`,`__generated__`,`__pycache__`,`coverage`,`dist`,`fixtures`,`generated`,`node_modules`,`obj`,`target`,`test-fixtures`,`vendor`,`venv`]),m=/* @__PURE__ */ new Set([`__tests__`,`test`,`tests`,`spec`]),h=/(?:^test(?:[_-].*)?|\.(?:spec|test)|[_-](?:test|spec))\.[^.]+$/iu,g=/Tests?\.(?:java|kt|cs)$/u;function _(e){return e===`~`?f.homedir():e.startsWith(`~/`)?d.join(f.homedir(),e.slice(2)):d.resolve(e)}async function v(e){try{return(await u(e)).isDirectory()?e:d.dirname(e)}catch{return d.dirname(e)}}const y=f.availableParallelism()*2;async function b(e,t){let n=e;try{n=await l(e)}catch{}let r=d.dirname(n),i;try{i=await u(n)}catch(e){let t=`${V(n,r)}: ${a(e)}`;return{displayRoot:r,files:[],errors:[t],warnings:[],generatedFiles:[],fatalError:t}}if(i.isFile()){let e=d.dirname(n),r=B(n,t,!0);if(!r){let t=`${V(n,e)}: unsupported file type`;return{displayRoot:e,files:[],errors:[t],warnings:[],generatedFiles:[],fatalError:t}}let i=T(t,e);return await M(n,r,`single-file`,i,n),w(i,e)}let o=T(t,n);return await k(n,o),await S(o),w(o,n)}async function x(e,t,n,r=/* @__PURE__ */ new Set){let i=T(n,e);for(let a of t){let t=d.join(e,a),s=z(a,n,r.has(t))?B(a,n,r.has(t)):void 0;s&&((await o(t).catch(()=>{}))?.isSymbolicLink()||i.candidates.push({file:t,language:s}))}return await S(i),w(i,e)}async function S(e){let t=await e.options.loadExclusion?.(e.candidates.flatMap(({file:e,realFile:t})=>t===void 0?[e]:[e,t]));e.exclusion=t;let n=/* @__PURE__ */ new Map;for(let t of e.candidates){let r;try{r=t.realFile??await l(t.file)}catch(n){E(e,t.file,n);continue}n.set(r,[...n.get(r)??[],t])}for(let[r,i]of n){if(e.fatalSeen)return;let n=await C(r,i,t);n!==void 0&&await M(n.file,n.language,`directory`,e,r)}}async function C(e,t,n){if(n===void 0)return t[0];if(n.isExcludedPath(e))return;let r=t.filter(({file:e})=>!n.isExcludedPath(e)),i=r.find(({file:t})=>t===e);if(i!==void 0||r.length<=1)return i??r[0];let a=await s(e,`utf8`).catch(()=>{});return r.find(({file:e})=>a!==void 0&&!n.isGeneratedCode(e,a))??r[0]}async function w(e,t){let n=[],r=[],i=[],o=[];for(let s of e.outcomes){let e=await s;if(`fatal`in e){let s=a(e.fatal);return{displayRoot:t,files:n,errors:[...r,s],warnings:i,generatedFiles:o,fatalError:s}}if(`generatedFile`in e){o.push(e.generatedFile);continue}if(`error`in e){r.push(e.error);continue}n.push(e.file),e.warning!==void 0&&i.push(e.warning)}return{displayRoot:t,files:n,errors:r,warnings:i,generatedFiles:o}}function T(e,t){return{options:e,outcomes:[],inFlight:/* @__PURE__ */ new Set,fatalSeen:!1,visitedDirectories:/* @__PURE__ */ new Set,visitedFiles:/* @__PURE__ */ new Set,rootDirectory:t,candidates:[]}}function E(e,t,n){e.outcomes.push({error:`${V(t,e.rootDirectory)}: ${a(n)}`})}async function D(e,t,n){try{return await e()}catch(e){E(n,t,e);return}}async function O(e,t){let n=await D(()=>l(e),e,t);return n!==void 0&&R(n,t.rootDirectory)?n:void 0}async function k(e,t){let n=await O(e,t);if(n===void 0||t.visitedDirectories.has(n))return;t.visitedDirectories.add(n);let r=await D(()=>c(e,{withFileTypes:!0}),e,t);if(r!==void 0){r.sort((e,t)=>e.name<t.name?-1:+(e.name>t.name));for(let i of r){let r=d.join(e,i.name);if(i.isSymbolicLink()){await A(i.name,r,t);continue}if(i.isDirectory()){if(L(i.name,t.options))continue;await k(r,t);continue}i.isFile()&&j(r,t,r,n===e?void 0:d.join(n,i.name))}}}async function A(e,t,n){let r=await O(t,n);if(r===void 0)return;let i=await D(()=>u(t),t,n);if(i!==void 0){if(i.isDirectory()){if(L(e,n.options)||L(d.basename(r),n.options))return;await k(t,n);return}i.isFile()&&j(t,n,r,r)}}function j(e,t,n=e,r){let i=B(n,t.options);i&&t.candidates.push({file:e,language:i,realFile:r})}async function M(e,t,n,r,i){if(r.fatalSeen)return;let a;try{a=i??await l(e)}catch(t){E(r,e,t);return}if(r.visitedFiles.has(a))return;for(r.visitedFiles.add(a);r.inFlight.size>=y;)await Promise.race(r.inFlight);let o=N(e,a,t,n,r);r.inFlight.add(o),o.then(()=>r.inFlight.delete(o)),r.outcomes.push(o)}async function N(e,t,i,o,c){try{let n=await s(e,`utf8`),a={language:i,duplication:c.options.duplication};if(o===`single-file`)return{file:{file:e,metrics:r(n,a)}};let l=c.exclusion;if(l&&(l.isGeneratedCode(e,n)||l.isGeneratedCode(t,n)))return{generatedFile:e};let{metrics:u,crossFileData:d,crossFileError:f}=await P(n,a);return{file:{file:e,metrics:u,duplicationCandidates:d},warning:f===void 0?void 0:`${V(e,c.rootDirectory)}: cross-file duplication candidates unavailable: ${f}`}}catch(t){return t instanceof n?(c.fatalSeen=!0,{fatal:t}):{error:`${V(e,c.rootDirectory)}: ${a(t)}`}}}async function P(e,t){try{return await i(e,t)}catch(i){if(i instanceof n)throw i;return{metrics:r(e,t),crossFileError:a(i)}}}function F(t,n){if(t.fatalError||t.files.length<2)return;let r=t.files.flatMap(({file:e,duplicationCandidates:n})=>n?[{file:V(e,t.displayRoot),...n}]:[]);r.length<2||(t.crossFileDuplication=e(r,n.duplication))}function I(e,t,n){let r=new Set(e?.duplication.duplicateLineNumbers),i=t&&Object.hasOwn(t.duplicateLineNumbersByFile,n)?t.duplicateLineNumbersByFile[n]??[]:[];for(let e of i)r.add(e);return r}function L(e,t){return p.has(e)?!0:!t.includeTests&&m.has(e)}function R(e,t){let n=d.relative(t,e);return n===``||n!==`..`&&!n.startsWith(`..${d.sep}`)&&!d.isAbsolute(n)}function z(e,t,n=!1){if(n)return B(e,t,!0)!==void 0;let r=e.split(`/`);for(let e of r.slice(0,-1))if(p.has(e)||!t.includeTests&&m.has(e))return!1;return B(e,t)!==void 0}function B(e,n,r=!1){let i=e.toLowerCase();if(!(!r&&(i.endsWith(`.d.ts`)||i.endsWith(`.d.mts`)||i.endsWith(`.d.cts`)||i.endsWith(`.min.js`)||i.endsWith(`.pnp.cjs`)))&&(r||n.includeTests||!h.test(d.basename(e))&&!g.test(d.basename(e))))return t(e)}function V(e,t){return d.relative(t,e)||d.basename(e)}function H(e){process.stdout.write(e)}function U(e){process.stderr.write(e)}export{F as addCrossFileDuplication,I as collectDuplicatedLineNumbers,v as configSearchDirectory,V as formatPath,B as getLanguage,z as isScannedPath,P as measureWithCrossFileData,_ as resolveTarget,x as scanListedFiles,b as scanTarget,U as writeStderr,H as writeStdout};
+import{measureCrossFileDuplication as e}from"./crossFileDuplication.js";import{detectLanguage as t}from"./languages.js";import{NativeAddonError as n}from"./nativeMetrics.js";import{measureCode as r,measureCodeWithCrossFileDataAsync as i}from"./metrics.js";import{getErrorMessage as a}from"@willbooster/shared-lib";import{lstat as o,readFile as s,readdir as c,realpath as l,stat as u}from"node:fs/promises";import d from"node:path";import f from"node:os";const p=/* @__PURE__ */ new Set([`.agents`,`.claude`,`.cursor`,`.git`,`.next`,`.playwright-cli`,`.tox`,`.tmp`,`.turbo`,`.venv`,`.yarn`,`__fixtures__`,`__generated__`,`__pycache__`,`coverage`,`dist`,`fixtures`,`generated`,`node_modules`,`obj`,`target`,`test-fixtures`,`vendor`,`venv`]),m=/* @__PURE__ */ new Set([`__tests__`,`test`,`tests`,`spec`]),h=/(?:^test(?:[_-].*)?|\.(?:spec|test)|[_-](?:test|spec))\.[^.]+$/iu,g=/Tests?\.(?:java|kt|cs)$/u;function _(e){return e===`~`?f.homedir():e.startsWith(`~/`)?d.join(f.homedir(),e.slice(2)):d.resolve(e)}async function v(e){try{return(await u(e)).isDirectory()?e:d.dirname(e)}catch{return d.dirname(e)}}const y=f.availableParallelism()*2;async function b(e,t){let n=e;try{n=await l(e)}catch{}let r=d.dirname(n),i;try{i=await u(n)}catch(e){let t=`${V(n,r)}: ${a(e)}`;return{displayRoot:r,files:[],errors:[t],warnings:[],generatedFiles:[],fatalError:t}}if(i.isFile()){let e=d.dirname(n),r=B(n,t,!0);if(!r){let t=`${V(n,e)}: unsupported file type`;return{displayRoot:e,files:[],errors:[t],warnings:[],generatedFiles:[],fatalError:t}}let i=T(t,e);return await M(n,r,`single-file`,i,n),w(i,e)}let o=T(t,n);return await k(n,o),await S(o),w(o,n)}async function x(e,t,n,r=/* @__PURE__ */ new Set,i=``){let a=T(n,e),s=i===``?``:`${i}/`;for(let i of t){let t=d.join(e,i),c=z(i.startsWith(s)?i.slice(s.length):i,n,r.has(t))?B(i,n,r.has(t)):void 0;if(!c)continue;let l=await o(t).catch(()=>{});(!l||l.isFile())&&a.candidates.push({file:t,language:c})}return await S(a),w(a,e)}async function S(e){let t=await e.options.loadExclusion?.(e.candidates.flatMap(({file:e,realFile:t})=>t===void 0?[e]:[e,t]));e.exclusion=t;let n=/* @__PURE__ */ new Map;for(let t of e.candidates){let r;try{r=t.realFile??await l(t.file)}catch(n){E(e,t.file,n);continue}n.set(r,[...n.get(r)??[],t])}for(let[r,i]of n){if(e.fatalSeen)return;let n=await C(r,i,t);n!==void 0&&await M(n.file,n.language,`directory`,e,r)}}async function C(e,t,n){if(n===void 0)return t[0];if(n.isExcludedPath(e))return;let r=t.filter(({file:e})=>!n.isExcludedPath(e)),i=r.find(({file:t})=>t===e);if(i!==void 0||r.length<=1)return i??r[0];let a=await s(e,`utf8`).catch(()=>{});return r.find(({file:e})=>a!==void 0&&!n.isGeneratedCode(e,a))??r[0]}async function w(e,t){let n=[],r=[],i=[],o=[];for(let s of e.outcomes){let e=await s;if(`fatal`in e){let s=a(e.fatal);return{displayRoot:t,files:n,errors:[...r,s],warnings:i,generatedFiles:o,fatalError:s}}if(`generatedFile`in e){o.push(e.generatedFile);continue}if(`error`in e){r.push(e.error);continue}n.push(e.file),e.warning!==void 0&&i.push(e.warning)}return{displayRoot:t,files:n,errors:r,warnings:i,generatedFiles:o}}function T(e,t){return{options:e,outcomes:[],inFlight:/* @__PURE__ */ new Set,fatalSeen:!1,visitedDirectories:/* @__PURE__ */ new Set,visitedFiles:/* @__PURE__ */ new Set,rootDirectory:t,candidates:[]}}function E(e,t,n){e.outcomes.push({error:`${V(t,e.rootDirectory)}: ${a(n)}`})}async function D(e,t,n){try{return await e()}catch(e){E(n,t,e);return}}async function O(e,t){let n=await D(()=>l(e),e,t);return n!==void 0&&R(n,t.rootDirectory)?n:void 0}async function k(e,t){let n=await O(e,t);if(n===void 0||t.visitedDirectories.has(n))return;t.visitedDirectories.add(n);let r=await D(()=>c(e,{withFileTypes:!0}),e,t);if(r!==void 0){r.sort((e,t)=>e.name<t.name?-1:+(e.name>t.name));for(let i of r){let r=d.join(e,i.name);if(i.isSymbolicLink()){await A(i.name,r,t);continue}if(i.isDirectory()){if(L(i.name,t.options))continue;await k(r,t);continue}i.isFile()&&j(r,t,r,n===e?void 0:d.join(n,i.name))}}}async function A(e,t,n){let r=await O(t,n);if(r===void 0)return;let i=await D(()=>u(t),t,n);if(i!==void 0){if(i.isDirectory()){if(L(e,n.options)||L(d.basename(r),n.options))return;await k(t,n);return}i.isFile()&&j(t,n,r,r)}}function j(e,t,n=e,r){let i=B(n,t.options);i&&t.candidates.push({file:e,language:i,realFile:r})}async function M(e,t,n,r,i){if(r.fatalSeen)return;let a;try{a=i??await l(e)}catch(t){E(r,e,t);return}if(r.visitedFiles.has(a))return;for(r.visitedFiles.add(a);r.inFlight.size>=y;)await Promise.race(r.inFlight);let o=N(e,a,t,n,r);r.inFlight.add(o),o.then(()=>r.inFlight.delete(o)),r.outcomes.push(o)}async function N(e,t,i,o,c){try{let n=await s(e,`utf8`),a={language:i,duplication:c.options.duplication};if(o===`single-file`)return{file:{file:e,metrics:r(n,a)}};let l=c.exclusion;if(l&&(l.isGeneratedCode(e,n)||l.isGeneratedCode(t,n)))return{generatedFile:e};let{metrics:u,crossFileData:d,crossFileError:f}=await P(n,a);return{file:{file:e,metrics:u,duplicationCandidates:d},warning:f===void 0?void 0:`${V(e,c.rootDirectory)}: cross-file duplication candidates unavailable: ${f}`}}catch(t){return t instanceof n?(c.fatalSeen=!0,{fatal:t}):{error:`${V(e,c.rootDirectory)}: ${a(t)}`}}}async function P(e,t){try{return await i(e,t)}catch(i){if(i instanceof n)throw i;return{metrics:r(e,t),crossFileError:a(i)}}}function F(t,n){if(t.fatalError||t.files.length<2)return;let r=t.files.flatMap(({file:e,duplicationCandidates:n})=>n?[{file:V(e,t.displayRoot),...n}]:[]);r.length<2||(t.crossFileDuplication=e(r,n.duplication))}function I(e,t,n){let r=new Set(e?.duplication.duplicateLineNumbers),i=t&&Object.hasOwn(t.duplicateLineNumbersByFile,n)?t.duplicateLineNumbersByFile[n]??[]:[];for(let e of i)r.add(e);return r}function L(e,t){return p.has(e)?!0:!t.includeTests&&m.has(e)}function R(e,t){let n=d.relative(t,e);return n===``||n!==`..`&&!n.startsWith(`..${d.sep}`)&&!d.isAbsolute(n)}function z(e,t,n=!1){if(n)return B(e,t,!0)!==void 0;let r=e.split(`/`);for(let e of r.slice(0,-1))if(p.has(e)||!t.includeTests&&m.has(e))return!1;return B(e,t)!==void 0}function B(e,n,r=!1){let i=e.toLowerCase();if(!(!r&&(i.endsWith(`.d.ts`)||i.endsWith(`.d.mts`)||i.endsWith(`.d.cts`)||i.endsWith(`.min.js`)||i.endsWith(`.pnp.cjs`)))&&(r||n.includeTests||!h.test(d.basename(e))&&!g.test(d.basename(e))))return t(e)}function V(e,t){return d.relative(t,e).replaceAll(d.sep,`/`)||d.basename(e)}function H(e){process.stdout.write(e)}function U(e){process.stderr.write(e)}export{F as addCrossFileDuplication,I as collectDuplicatedLineNumbers,v as configSearchDirectory,V as formatPath,B as getLanguage,R as isWithinDirectory,_ as resolveTarget,x as scanListedFiles,b as scanTarget,U as writeStderr,H as writeStdout};
 //# sourceMappingURL=scan.js.map

package/dist/scan.js.map

@@ -1 +1 @@
-{"version":3,"file":"scan.js","names":[],"sources":["../src/scan.ts"],"sourcesContent":["import { lstat, readdir, readFile, realpath, stat } from 'node:fs/promises';\nimport os from 'node:os';\nimport path from 'node:path';\nimport { getErrorMessage } from '@willbooster/shared-lib';\nimport { measureCrossFileDuplication, type CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport type { CrossFileDuplicationFileData } from './duplication.js';\nimport type { Exclusion } from './exclusion.js';\nimport { detectLanguage } from './languages.js';\nimport { measureCode, measureCodeWithCrossFileDataAsync } from './metrics.js';\nimport { NativeAddonError } from './nativeMetrics.js';\nimport type { CodeMetrics, DuplicationOptions, LanguageName, MeasureOptions } from './types.js';\n\n/** The scan settings shared by every command (a structural subset of each command's options). */\nexport interface ScanOptions {\n  duplication: Required<DuplicationOptions>;\n  includeTests: boolean;\n  /**\n   * Loads the exclusion covering the files a directory scan found (absolute paths); an explicitly\n   * targeted file is always measured.\n   */\n  loadExclusion?: (absolutePaths: readonly string[]) => Promise<Exclusion>;\n}\n\nexport interface FileMetrics {\n  file: string;\n  metrics: CodeMetrics;\n  /** Cross-file duplicate candidates and token/statement data, collected only for directory scans. */\n  duplicationCandidates?: CrossFileDuplicationFileData;\n}\n\nexport interface ScanResult {\n  crossFileDuplication?: CrossFileDuplicationMetrics;\n  displayRoot: string;\n  errors: string[];\n  /** Non-fatal degradations (e.g. cross-file candidates unavailable); the file is still measured. */\n  warnings: string[];\n  /** Files skipped because their content is generated code (see Exclusion.isGeneratedCode). */\n  generatedFiles: string[];\n  fatalError?: string;\n  files: FileMetrics[];\n}\n\nconst ignoredDirectoryNames = new Set([\n  '.agents',\n  '.claude',\n  '.cursor',\n  '.git',\n  '.next',\n  '.playwright-cli',\n  '.tox',\n  '.tmp',\n  '.turbo',\n  '.venv',\n  '.yarn',\n  '__fixtures__',\n  '__generated__',\n  '__pycache__',\n  'coverage',\n  'dist',\n  'fixtures',\n  'generated',\n  'node_modules',\n  // .NET SDK intermediate output (generated sources such as `*.GlobalUsings.g.cs`).\n  'obj',\n  'target',\n  'test-fixtures',\n  'vendor',\n  'venv',\n]);\n\nconst testDirectoryNames = new Set(['__tests__', 'test', 'tests', 'spec']);\nconst testFilePattern = /(?:^test(?:[_-].*)?|\\.(?:spec|test)|[_-](?:test|spec))\\.[^.]+$/iu;\n// JUnit (Java/Kotlin) and xUnit/NUnit (C#) tests use case-sensitive `Test`/`Tests` class-name\n// suffixes; case-insensitive matching would catch production files like `contest.java`.\nconst suffixTestFilePattern = /Tests?\\.(?:java|kt|cs)$/u;\n\nexport function resolveTarget(target: string): string {\n  if (target === '~') {\n    return os.homedir();\n  }\n\n  if (target.startsWith('~/')) {\n    return path.join(os.homedir(), target.slice(2));\n  }\n\n  return path.resolve(target);\n}\n\n/** Returns the directory from which the config file search should start (the target itself if it is a directory). */\nexport async function configSearchDirectory(target: string): Promise<string> {\n  try {\n    const targetStat = await stat(target);\n    return targetStat.isDirectory() ? target : path.dirname(target);\n  } catch {\n    return path.dirname(target);\n  }\n}\n\n/** Shared state of one scan, threaded through the directory walk instead of positional plumbing. */\ninterface ScanContext {\n  options: ScanOptions;\n  /**\n   * Outcomes in discovery order. Files are measured concurrently, so a measurement is recorded as\n   * a promise here and applied in this order once all have settled, keeping results deterministic.\n   */\n  outcomes: (ScanOutcome | Promise<ScanOutcome>)[];\n  /** Measurements in flight, bounded so file contents and payloads do not pile up. */\n  inFlight: Set<Promise<ScanOutcome>>;\n  /** Set once a measurement fails fatally; no further measurement starts. */\n  fatalSeen: boolean;\n  visitedDirectories: Set<string>;\n  visitedFiles: Set<string>;\n  /** Scan root: paths are displayed relative to it, and symbolic links may not escape it. */\n  rootDirectory: string;\n  /** Files the walk found, measured once the exclusion covering all of them is loaded. */\n  candidates: ScanCandidate[];\n  exclusion?: Exclusion;\n}\n\ninterface ScanCandidate {\n  file: string;\n  language: LanguageName;\n  /** The resolved path when the file was reached through a symbolic link. */\n  realFile?: string;\n}\n\n/**\n * A missing native addon fails every file identically, so it ends the scan as one fatal error\n * instead of one \"skipped\" entry per file behind a successful exit code.\n */\ntype ScanOutcome =\n  | { file: FileMetrics; warning?: string }\n  | { generatedFile: string }\n  | { error: string }\n  | { fatal: NativeAddonError };\n\n// Twice the addon's worker count keeps its pool busy while finished payloads are parsed.\nconst maxMeasurementsInFlight = os.availableParallelism() * 2;\n\nexport async function scanTarget(target: string, options: ScanOptions): Promise<ScanResult> {\n  let canonicalTarget = target;\n  try {\n    canonicalTarget = await realpath(target);\n  } catch {\n    // stat below reports missing targets with the original path.\n  }\n\n  const fallbackDisplayRoot = path.dirname(canonicalTarget);\n  let targetStat;\n\n  try {\n    targetStat = await stat(canonicalTarget);\n  } catch (error) {\n    const fatalError = `${formatPath(canonicalTarget, fallbackDisplayRoot)}: ${getErrorMessage(error)}`;\n    return {\n      displayRoot: fallbackDisplayRoot,\n      files: [],\n      errors: [fatalError],\n      warnings: [],\n      generatedFiles: [],\n      fatalError,\n    };\n  }\n\n  if (targetStat.isFile()) {\n    const displayRoot = path.dirname(canonicalTarget);\n    const language = getLanguage(canonicalTarget, options, true);\n    if (!language) {\n      const fatalError = `${formatPath(canonicalTarget, displayRoot)}: unsupported file type`;\n      return { displayRoot, files: [], errors: [fatalError], warnings: [], generatedFiles: [], fatalError };\n    }\n\n    const context = makeScanContext(options, displayRoot);\n    await measureFile(canonicalTarget, language, 'single-file', context, canonicalTarget);\n    return settleScan(context, displayRoot);\n  }\n\n  const context = makeScanContext(options, canonicalTarget);\n  await scanDirectory(canonicalTarget, context);\n  await measureCandidates(context);\n  return settleScan(context, canonicalTarget);\n}\n\n/**\n * Measures an explicit list of repository-relative files (the diff gate's git-visible allowlist)\n * instead of walking the directory tree, so ignored artifact directories are never parsed. Paths\n * outside the scan scope (ignored/test directories, unsupported or test file names) are skipped\n * with the same rules as the walk.\n */\nexport async function scanListedFiles(\n  rootDirectory: string,\n  relativePaths: Iterable<string>,\n  options: ScanOptions,\n  explicitFiles: ReadonlySet<string> = new Set()\n): Promise<ScanResult> {\n  const context = makeScanContext(options, rootDirectory);\n  for (const relativePath of relativePaths) {\n    const absolutePath = path.join(rootDirectory, relativePath);\n    const language = isScannedPath(relativePath, options, explicitFiles.has(absolutePath))\n      ? getLanguage(relativePath, options, explicitFiles.has(absolutePath))\n      : undefined;\n    if (!language) {\n      continue;\n    }\n    // Symbolic links are not source files: git stores only their target string, so measuring\n    // through them would diverge from what any revision of the repository actually contains.\n    const stats = await lstat(absolutePath).catch(() => {});\n    if (!stats?.isSymbolicLink()) {\n      context.candidates.push({ file: absolutePath, language });\n    }\n  }\n  await measureCandidates(context);\n  return settleScan(context, rootDirectory);\n}\n\nasync function measureCandidates(context: ScanContext): Promise<void> {\n  const exclusion = await context.options.loadExclusion?.(\n    context.candidates.flatMap(({ file, realFile }) => (realFile === undefined ? [file] : [file, realFile]))\n  );\n  context.exclusion = exclusion;\n  // Every path reaching the same real file, in discovery order, so one alias cannot decide alone.\n  const pathsByRealFile = new Map<string, ScanCandidate[]>();\n  for (const candidate of context.candidates) {\n    let realFile;\n    try {\n      realFile = candidate.realFile ?? (await realpath(candidate.file));\n    } catch (error) {\n      recordError(context, candidate.file, error);\n      continue;\n    }\n    pathsByRealFile.set(realFile, [...(pathsByRealFile.get(realFile) ?? []), candidate]);\n  }\n  for (const [realFile, candidates] of pathsByRealFile) {\n    if (context.fatalSeen) {\n      return;\n    }\n    const chosen = await chooseMeasuredPath(realFile, candidates, exclusion);\n    if (chosen !== undefined) {\n      await measureFile(chosen.file, chosen.language, 'directory', context, realFile);\n    }\n  }\n}\n\n/**\n * The path to measure a real file through. A path is excluded when its own exclusion or the real\n * file's applies, so the real path, when the scan reached it directly, is never less measurable\n * than an alias; otherwise the first alias not excluded, preferring one whose own attributes do\n * not judge the content generated.\n */\nasync function chooseMeasuredPath(\n  realFile: string,\n  candidates: readonly ScanCandidate[],\n  exclusion: Exclusion | undefined\n): Promise<ScanCandidate | undefined> {\n  if (exclusion === undefined) {\n    return candidates[0];\n  }\n  if (exclusion.isExcludedPath(realFile)) {\n    return undefined;\n  }\n  const measurable = candidates.filter(({ file }) => !exclusion.isExcludedPath(file));\n  const direct = measurable.find(({ file }) => file === realFile);\n  if (direct !== undefined || measurable.length <= 1) {\n    return direct ?? measurable[0];\n  }\n  const code = await readFile(realFile, 'utf8').catch(() => {});\n  return measurable.find(({ file }) => code !== undefined && !exclusion.isGeneratedCode(file, code)) ?? measurable[0];\n}\n\n/** Applies the scan's outcomes in discovery order once every measurement has settled. */\nasync function settleScan(context: ScanContext, displayRoot: string): Promise<ScanResult> {\n  const files: FileMetrics[] = [];\n  const errors: string[] = [];\n  const warnings: string[] = [];\n  const generatedFiles: string[] = [];\n  for (const pending of context.outcomes) {\n    const outcome = await pending;\n    if ('fatal' in outcome) {\n      const fatalError = getErrorMessage(outcome.fatal);\n      // Errors the walk recorded before the fatal failure stay reported alongside it.\n      return { displayRoot, files, errors: [...errors, fatalError], warnings, generatedFiles, fatalError };\n    }\n    if ('generatedFile' in outcome) {\n      generatedFiles.push(outcome.generatedFile);\n      continue;\n    }\n    if ('error' in outcome) {\n      errors.push(outcome.error);\n      continue;\n    }\n    files.push(outcome.file);\n    if (outcome.warning !== undefined) {\n      warnings.push(outcome.warning);\n    }\n  }\n  return { displayRoot, files, errors, warnings, generatedFiles };\n}\n\nfunction makeScanContext(options: ScanOptions, rootDirectory: string): ScanContext {\n  return {\n    options,\n    outcomes: [],\n    inFlight: new Set(),\n    fatalSeen: false,\n    visitedDirectories: new Set(),\n    visitedFiles: new Set(),\n    rootDirectory,\n    candidates: [],\n  };\n}\n\nfunction recordError(context: ScanContext, target: string, error: unknown): void {\n  context.outcomes.push({ error: `${formatPath(target, context.rootDirectory)}: ${getErrorMessage(error)}` });\n}\n\n/** Runs a filesystem operation, recording a scan error and returning undefined when it fails. */\nasync function tryFileSystem<T>(\n  operation: () => Promise<T>,\n  target: string,\n  context: ScanContext\n): Promise<T | undefined> {\n  try {\n    return await operation();\n  } catch (error) {\n    recordError(context, target, error);\n    return undefined;\n  }\n}\n\n/** Resolves the path (recording errors); undefined when that fails or the result escapes the root. */\nasync function resolveWithinRoot(target: string, context: ScanContext): Promise<string | undefined> {\n  const resolved = await tryFileSystem(() => realpath(target), target, context);\n  return resolved !== undefined && isWithinDirectory(resolved, context.rootDirectory) ? resolved : undefined;\n}\n\nasync function scanDirectory(directory: string, context: ScanContext): Promise<void> {\n  const resolvedDirectory = await resolveWithinRoot(directory, context);\n  if (resolvedDirectory === undefined || context.visitedDirectories.has(resolvedDirectory)) {\n    return;\n  }\n  context.visitedDirectories.add(resolvedDirectory);\n\n  const entries = await tryFileSystem(() => readdir(directory, { withFileTypes: true }), directory, context);\n  if (entries === undefined) {\n    return;\n  }\n  // readdir order differs between file systems; sorting keeps which path reaches a file first,\n  // and so the scan's result, the same everywhere.\n  entries.sort((left, right) => (left.name < right.name ? -1 : left.name > right.name ? 1 : 0));\n\n  for (const entry of entries) {\n    const entryPath = path.join(directory, entry.name);\n    if (entry.isSymbolicLink()) {\n      await scanSymbolicLink(entry.name, entryPath, context);\n      continue;\n    }\n\n    if (entry.isDirectory()) {\n      if (shouldSkipDirectory(entry.name, context.options)) {\n        continue;\n      }\n      await scanDirectory(entryPath, context);\n      continue;\n    }\n\n    if (entry.isFile()) {\n      // Under a symbolically linked directory the real path differs, and exclusion checks both.\n      const realFile = resolvedDirectory === directory ? undefined : path.join(resolvedDirectory, entry.name);\n      collectScannableFile(entryPath, context, entryPath, realFile);\n    }\n  }\n}\n\nasync function scanSymbolicLink(name: string, entryPath: string, context: ScanContext): Promise<void> {\n  const resolvedPath = await resolveWithinRoot(entryPath, context);\n  if (resolvedPath === undefined) {\n    return;\n  }\n\n  const entryStat = await tryFileSystem(() => stat(entryPath), entryPath, context);\n  if (entryStat === undefined) {\n    return;\n  }\n\n  if (entryStat.isDirectory()) {\n    if (\n      shouldSkipDirectory(name, context.options) ||\n      shouldSkipDirectory(path.basename(resolvedPath), context.options)\n    ) {\n      return;\n    }\n    await scanDirectory(entryPath, context);\n    return;\n  }\n\n  if (entryStat.isFile()) {\n    collectScannableFile(entryPath, context, resolvedPath, resolvedPath);\n  }\n}\n\nfunction collectScannableFile(file: string, context: ScanContext, languageFile = file, realFile?: string): void {\n  const language = getLanguage(languageFile, context.options);\n  if (language) {\n    context.candidates.push({ file, language, realFile });\n  }\n}\n\n/**\n * Resolves and deduplicates the file in discovery order, then starts measuring it concurrently; its\n * outcome is recorded in discovery order (see ScanContext.outcomes).\n */\nasync function measureFile(\n  file: string,\n  language: LanguageName,\n  mode: 'single-file' | 'directory',\n  context: ScanContext,\n  realFile?: string\n): Promise<void> {\n  if (context.fatalSeen) {\n    return;\n  }\n  let resolvedFile;\n  try {\n    resolvedFile = realFile ?? (await realpath(file));\n  } catch (error) {\n    recordError(context, file, error);\n    return;\n  }\n  if (context.visitedFiles.has(resolvedFile)) {\n    return;\n  }\n  context.visitedFiles.add(resolvedFile);\n\n  // Any settled measurement frees its slot (removed by the callback below, which runs before the\n  // race resumes), so one slow file never idles the pool.\n  while (context.inFlight.size >= maxMeasurementsInFlight) {\n    await Promise.race(context.inFlight);\n  }\n  const outcome = readAndMeasureFile(file, resolvedFile, language, mode, context);\n  context.inFlight.add(outcome);\n  void outcome.then(() => context.inFlight.delete(outcome));\n  context.outcomes.push(outcome);\n}\n\nasync function readAndMeasureFile(\n  file: string,\n  resolvedFile: string,\n  language: LanguageName,\n  mode: 'single-file' | 'directory',\n  context: ScanContext\n): Promise<ScanOutcome> {\n  try {\n    const code = await readFile(file, 'utf8');\n    const measureOptions = { language, duplication: context.options.duplication };\n    // Only directory scans compare files against each other; a single-file target has no peers.\n    if (mode === 'single-file') {\n      return { file: { file, metrics: measureCode(code, measureOptions) } };\n    }\n    // Like path exclusion, either the scanned path or the real one can judge the code generated.\n    const exclusion = context.exclusion;\n    if (exclusion && (exclusion.isGeneratedCode(file, code) || exclusion.isGeneratedCode(resolvedFile, code))) {\n      return { generatedFile: file };\n    }\n    const { metrics, crossFileData, crossFileError } = await measureWithCrossFileData(code, measureOptions);\n    return {\n      file: { file, metrics, duplicationCandidates: crossFileData },\n      // A warning, not an error: the file's metrics are complete, only its participation in\n      // cross-file matching is lost, so it is not \"skipped\" and must not fail --fail-on-error.\n      warning:\n        crossFileError === undefined\n          ? undefined\n          : `${formatPath(file, context.rootDirectory)}: cross-file duplication candidates unavailable: ${crossFileError}`,\n    };\n  } catch (error) {\n    if (error instanceof NativeAddonError) {\n      context.fatalSeen = true;\n      return { fatal: error };\n    }\n    return { error: `${formatPath(file, context.rootDirectory)}: ${getErrorMessage(error)}` };\n  }\n}\n\n/**\n * Measures a file together with its cross-file contribution from one parse. The contribution is\n * auxiliary: if collecting it fails where plain measurement succeeds (e.g. a payload too large to\n * cross the addon boundary), the metrics are still returned with the failure message, which\n * callers report as a warning rather than an error.\n */\nexport async function measureWithCrossFileData(\n  code: string,\n  measureOptions: MeasureOptions\n): Promise<{ metrics: CodeMetrics; crossFileData?: CrossFileDuplicationFileData; crossFileError?: string }> {\n  try {\n    return await measureCodeWithCrossFileDataAsync(code, measureOptions);\n  } catch (error) {\n    if (error instanceof NativeAddonError) {\n      throw error;\n    }\n    return { metrics: measureCode(code, measureOptions), crossFileError: getErrorMessage(error) };\n  }\n}\n\n/** Runs after the scan so every measured file's candidates participate. */\nexport function addCrossFileDuplication(result: ScanResult, options: ScanOptions): void {\n  if (result.fatalError || result.files.length < 2) {\n    return;\n  }\n  const sourceFiles = result.files.flatMap(({ file, duplicationCandidates }) =>\n    duplicationCandidates ? [{ file: formatPath(file, result.displayRoot), ...duplicationCandidates }] : []\n  );\n  if (sourceFiles.length < 2) {\n    return;\n  }\n  result.crossFileDuplication = measureCrossFileDuplication(sourceFiles, options.duplication);\n}\n\n/**\n * Distinct 1-based code lines covered by within-file or cross-file duplicated content. Both\n * sources expose the exact lines carrying matched tokens (never block bounding ranges, which\n * would over-count comment/blank lines and the unmatched gap of a merged clone), so the union is\n * a subset of the file's code lines and a ratio derived over code lines can never exceed 1.\n */\nexport function collectDuplicatedLineNumbers(\n  metrics: CodeMetrics | undefined,\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  formattedFile: string\n): Set<number> {\n  const lines = new Set(metrics?.duplication.duplicateLineNumbers);\n  // Object.hasOwn: a file named like an Object.prototype member must not read an inherited value.\n  const crossFileLines =\n    crossFileDuplication && Object.hasOwn(crossFileDuplication.duplicateLineNumbersByFile, formattedFile)\n      ? (crossFileDuplication.duplicateLineNumbersByFile[formattedFile] ?? [])\n      : [];\n  for (const line of crossFileLines) {\n    lines.add(line);\n  }\n  return lines;\n}\n\nfunction shouldSkipDirectory(name: string, options: ScanOptions): boolean {\n  if (ignoredDirectoryNames.has(name)) {\n    return true;\n  }\n\n  if (options.includeTests) {\n    return false;\n  }\n\n  return testDirectoryNames.has(name);\n}\n\nfunction isWithinDirectory(candidate: string, directory: string): boolean {\n  const relative = path.relative(directory, candidate);\n  return relative === '' || (relative !== '..' && !relative.startsWith(`..${path.sep}`) && !path.isAbsolute(relative));\n}\n\n/**\n * Whether a repository-relative path would be scanned: no ignored or excluded-test directory\n * segment and a supported, non-test file name. The diff gate uses this for base-revision\n * eligibility, so code renamed into scan scope gates as new code instead of ratcheting against\n * a blob the scanner would never have measured. An explicitly targeted file only needs a supported\n * language, as in the ranking command.\n */\nexport function isScannedPath(relativePath: string, options: ScanOptions, explicitTarget = false): boolean {\n  if (explicitTarget) {\n    return getLanguage(relativePath, options, true) !== undefined;\n  }\n  const segments = relativePath.split('/');\n  for (const segment of segments.slice(0, -1)) {\n    if (ignoredDirectoryNames.has(segment) || (!options.includeTests && testDirectoryNames.has(segment))) {\n      return false;\n    }\n  }\n  return getLanguage(relativePath, options) !== undefined;\n}\n\nexport function getLanguage(file: string, options: ScanOptions, explicitTarget = false): LanguageName | undefined {\n  const lowerFile = file.toLowerCase();\n  if (\n    !explicitTarget &&\n    (lowerFile.endsWith('.d.ts') ||\n      lowerFile.endsWith('.d.mts') ||\n      lowerFile.endsWith('.d.cts') ||\n      lowerFile.endsWith('.min.js') ||\n      lowerFile.endsWith('.pnp.cjs'))\n  ) {\n    return undefined;\n  }\n\n  if (\n    !explicitTarget &&\n    !options.includeTests &&\n    (testFilePattern.test(path.basename(file)) || suffixTestFilePattern.test(path.basename(file)))\n  ) {\n    return undefined;\n  }\n\n  return detectLanguage(file);\n}\n\nexport function formatPath(file: string, base: string): string {\n  return path.relative(base, file) || path.basename(file);\n}\n\nexport function writeStdout(message: string): void {\n  process.stdout.write(message);\n}\n\nexport function writeStderr(message: string): void {\n  process.stderr.write(message);\n}\n"],"mappings":"scA0CA,MAAM,kBAAwB,IAAI,IAAI,CACpC,UACA,UACA,UACA,OACA,QACA,kBACA,OACA,OACA,SACA,QACA,QACA,eACA,gBACA,cACA,WACA,OACA,WACA,YACA,eAEA,MACA,SACA,gBACA,SACA,MACF,CAAC,EAEK,kBAAqB,IAAI,IAAI,CAAC,YAAa,OAAQ,QAAS,MAAM,CAAC,EACnE,EAAkB,mEAGlB,EAAwB,2BAE9B,SAAgB,EAAc,EAAwB,CASpD,OARI,IAAW,IACN,EAAG,QAAQ,EAGhB,EAAO,WAAW,IAAI,EACjB,EAAK,KAAK,EAAG,QAAQ,EAAG,EAAO,MAAM,CAAC,CAAC,EAGzC,EAAK,QAAQ,CAAM,CAC5B,CAGA,eAAsB,EAAsB,EAAiC,CAC3E,GAAI,CAEF,OAAO,MADkB,EAAK,CAAM,EAAA,CAClB,YAAY,EAAI,EAAS,EAAK,QAAQ,CAAM,CAChE,MAAQ,CACN,OAAO,EAAK,QAAQ,CAAM,CAC5B,CACF,CAyCA,MAAM,EAA0B,EAAG,qBAAqB,EAAI,EAE5D,eAAsB,EAAW,EAAgB,EAA2C,CAC1F,IAAI,EAAkB,EACtB,GAAI,CACF,EAAkB,MAAM,EAAS,CAAM,CACzC,MAAQ,CAER,CAEA,IAAM,EAAsB,EAAK,QAAQ,CAAe,EACpD,EAEJ,GAAI,CACF,EAAa,MAAM,EAAK,CAAe,CACzC,OAAS,EAAO,CACd,IAAM,EAAa,GAAG,EAAW,EAAiB,CAAmB,EAAE,IAAI,EAAgB,CAAK,IAChG,MAAO,CACL,YAAa,EACb,MAAO,CAAC,EACR,OAAQ,CAAC,CAAU,EACnB,SAAU,CAAC,EACX,eAAgB,CAAC,EACjB,YACF,CACF,CAEA,GAAI,EAAW,OAAO,EAAG,CACvB,IAAM,EAAc,EAAK,QAAQ,CAAe,EAC1C,EAAW,EAAY,EAAiB,EAAS,EAAI,EAC3D,GAAI,CAAC,EAAU,CACb,IAAM,EAAa,GAAG,EAAW,EAAiB,CAAW,EAAE,yBAC/D,MAAO,CAAE,cAAa,MAAO,CAAC,EAAG,OAAQ,CAAC,CAAU,EAAG,SAAU,CAAC,EAAG,eAAgB,CAAC,EAAG,YAAW,CACtG,CAEA,IAAM,EAAU,EAAgB,EAAS,CAAW,EAEpD,OADA,MAAM,EAAY,EAAiB,EAAU,cAAe,EAAS,CAAe,EAC7E,EAAW,EAAS,CAAW,CACxC,CAEA,IAAM,EAAU,EAAgB,EAAS,CAAe,EAGxD,OAFA,MAAM,EAAc,EAAiB,CAAO,EAC5C,MAAM,EAAkB,CAAO,EACxB,EAAW,EAAS,CAAe,CAC5C,CAQA,eAAsB,EACpB,EACA,EACA,EACA,kBAAqC,IAAI,IACpB,CACrB,IAAM,EAAU,EAAgB,EAAS,CAAa,EACtD,IAAK,IAAM,KAAgB,EAAe,CACxC,IAAM,EAAe,EAAK,KAAK,EAAe,CAAY,EACpD,EAAW,EAAc,EAAc,EAAS,EAAc,IAAI,CAAY,CAAC,EACjF,EAAY,EAAc,EAAS,EAAc,IAAI,CAAY,CAAC,EAClE,IAAA,GACC,KAMA,MADe,EAAM,CAAY,CAAC,CAAC,UAAY,CAAC,CAAC,EAAA,EAC1C,eAAe,GACzB,EAAQ,WAAW,KAAK,CAAE,KAAM,EAAc,UAAS,CAAC,EAE5D,CAEA,OADA,MAAM,EAAkB,CAAO,EACxB,EAAW,EAAS,CAAa,CAC1C,CAEA,eAAe,EAAkB,EAAqC,CACpE,IAAM,EAAY,MAAM,EAAQ,QAAQ,gBACtC,EAAQ,WAAW,SAAS,CAAE,OAAM,cAAgB,IAAa,IAAA,GAAY,CAAC,CAAI,EAAI,CAAC,EAAM,CAAQ,CAAE,CACzG,EACA,EAAQ,UAAY,EAEpB,IAAM,kBAAkB,IAAI,IAC5B,IAAK,IAAM,KAAa,EAAQ,WAAY,CAC1C,IAAI,EACJ,GAAI,CACF,EAAW,EAAU,UAAa,MAAM,EAAS,EAAU,IAAI,CACjE,OAAS,EAAO,CACd,EAAY,EAAS,EAAU,KAAM,CAAK,EAC1C,QACF,CACA,EAAgB,IAAI,EAAU,CAAC,GAAI,EAAgB,IAAI,CAAQ,GAAK,CAAC,EAAI,CAAS,CAAC,CACrF,CACA,IAAK,GAAM,CAAC,EAAU,KAAe,EAAiB,CACpD,GAAI,EAAQ,UACV,OAEF,IAAM,EAAS,MAAM,EAAmB,EAAU,EAAY,CAAS,EACnE,IAAW,IAAA,IACb,MAAM,EAAY,EAAO,KAAM,EAAO,SAAU,YAAa,EAAS,CAAQ,CAElF,CACF,CAQA,eAAe,EACb,EACA,EACA,EACoC,CACpC,GAAI,IAAc,IAAA,GAChB,OAAO,EAAW,GAEpB,GAAI,EAAU,eAAe,CAAQ,EACnC,OAEF,IAAM,EAAa,EAAW,QAAQ,CAAE,UAAW,CAAC,EAAU,eAAe,CAAI,CAAC,EAC5E,EAAS,EAAW,MAAM,CAAE,UAAW,IAAS,CAAQ,EAC9D,GAAI,IAAW,IAAA,IAAa,EAAW,QAAU,EAC/C,OAAO,GAAU,EAAW,GAE9B,IAAM,EAAO,MAAM,EAAS,EAAU,MAAM,CAAC,CAAC,UAAY,CAAC,CAAC,EAC5D,OAAO,EAAW,MAAM,CAAE,UAAW,IAAS,IAAA,IAAa,CAAC,EAAU,gBAAgB,EAAM,CAAI,CAAC,GAAK,EAAW,EACnH,CAGA,eAAe,EAAW,EAAsB,EAA0C,CACxF,IAAM,EAAuB,CAAC,EACxB,EAAmB,CAAC,EACpB,EAAqB,CAAC,EACtB,EAA2B,CAAC,EAClC,IAAK,IAAM,KAAW,EAAQ,SAAU,CACtC,IAAM,EAAU,MAAM,EACtB,GAAI,UAAW,EAAS,CACtB,IAAM,EAAa,EAAgB,EAAQ,KAAK,EAEhD,MAAO,CAAE,cAAa,QAAO,OAAQ,CAAC,GAAG,EAAQ,CAAU,EAAG,WAAU,iBAAgB,YAAW,CACrG,CACA,GAAI,kBAAmB,EAAS,CAC9B,EAAe,KAAK,EAAQ,aAAa,EACzC,QACF,CACA,GAAI,UAAW,EAAS,CACtB,EAAO,KAAK,EAAQ,KAAK,EACzB,QACF,CACA,EAAM,KAAK,EAAQ,IAAI,EACnB,EAAQ,UAAY,IAAA,IACtB,EAAS,KAAK,EAAQ,OAAO,CAEjC,CACA,MAAO,CAAE,cAAa,QAAO,SAAQ,WAAU,gBAAe,CAChE,CAEA,SAAS,EAAgB,EAAsB,EAAoC,CACjF,MAAO,CACL,UACA,SAAU,CAAC,EACX,yBAAU,IAAI,IACd,UAAW,GACX,mCAAoB,IAAI,IACxB,6BAAc,IAAI,IAClB,gBACA,WAAY,CAAC,CACf,CACF,CAEA,SAAS,EAAY,EAAsB,EAAgB,EAAsB,CAC/E,EAAQ,SAAS,KAAK,CAAE,MAAO,GAAG,EAAW,EAAQ,EAAQ,aAAa,EAAE,IAAI,EAAgB,CAAK,GAAI,CAAC,CAC5G,CAGA,eAAe,EACb,EACA,EACA,EACwB,CACxB,GAAI,CACF,OAAO,MAAM,EAAU,CACzB,OAAS,EAAO,CACd,EAAY,EAAS,EAAQ,CAAK,EAClC,MACF,CACF,CAGA,eAAe,EAAkB,EAAgB,EAAmD,CAClG,IAAM,EAAW,MAAM,MAAoB,EAAS,CAAM,EAAG,EAAQ,CAAO,EAC5E,OAAO,IAAa,IAAA,IAAa,EAAkB,EAAU,EAAQ,aAAa,EAAI,EAAW,IAAA,EACnG,CAEA,eAAe,EAAc,EAAmB,EAAqC,CACnF,IAAM,EAAoB,MAAM,EAAkB,EAAW,CAAO,EACpE,GAAI,IAAsB,IAAA,IAAa,EAAQ,mBAAmB,IAAI,CAAiB,EACrF,OAEF,EAAQ,mBAAmB,IAAI,CAAiB,EAEhD,IAAM,EAAU,MAAM,MAAoB,EAAQ,EAAW,CAAE,cAAe,EAAK,CAAC,EAAG,EAAW,CAAO,EACrG,OAAY,IAAA,GAKhB,GAAQ,MAAM,EAAM,IAAW,EAAK,KAAO,EAAM,KAAO,GAAK,IAAK,KAAO,EAAM,KAAa,EAE5F,IAAK,IAAM,KAAS,EAAS,CAC3B,IAAM,EAAY,EAAK,KAAK,EAAW,EAAM,IAAI,EACjD,GAAI,EAAM,eAAe,EAAG,CAC1B,MAAM,EAAiB,EAAM,KAAM,EAAW,CAAO,EACrD,QACF,CAEA,GAAI,EAAM,YAAY,EAAG,CACvB,GAAI,EAAoB,EAAM,KAAM,EAAQ,OAAO,EACjD,SAEF,MAAM,EAAc,EAAW,CAAO,EACtC,QACF,CAEI,EAAM,OAAO,GAGf,EAAqB,EAAW,EAAS,EADxB,IAAsB,EAAY,IAAA,GAAY,EAAK,KAAK,EAAmB,EAAM,IAAI,CAC1C,CAEhE,CAtB4F,CAuB9F,CAEA,eAAe,EAAiB,EAAc,EAAmB,EAAqC,CACpG,IAAM,EAAe,MAAM,EAAkB,EAAW,CAAO,EAC/D,GAAI,IAAiB,IAAA,GACnB,OAGF,IAAM,EAAY,MAAM,MAAoB,EAAK,CAAS,EAAG,EAAW,CAAO,EAC3E,OAAc,IAAA,GAIlB,IAAI,EAAU,YAAY,EAAG,CAC3B,GACE,EAAoB,EAAM,EAAQ,OAAO,GACzC,EAAoB,EAAK,SAAS,CAAY,EAAG,EAAQ,OAAO,EAEhE,OAEF,MAAM,EAAc,EAAW,CAAO,EACtC,MACF,CAEI,EAAU,OAAO,GACnB,EAAqB,EAAW,EAAS,EAAc,CAAY,CAHrE,CAKF,CAEA,SAAS,EAAqB,EAAc,EAAsB,EAAe,EAAM,EAAyB,CAC9G,IAAM,EAAW,EAAY,EAAc,EAAQ,OAAO,EACtD,GACF,EAAQ,WAAW,KAAK,CAAE,OAAM,WAAU,UAAS,CAAC,CAExD,CAMA,eAAe,EACb,EACA,EACA,EACA,EACA,EACe,CACf,GAAI,EAAQ,UACV,OAEF,IAAI,EACJ,GAAI,CACF,EAAe,GAAa,MAAM,EAAS,CAAI,CACjD,OAAS,EAAO,CACd,EAAY,EAAS,EAAM,CAAK,EAChC,MACF,CACA,GAAI,EAAQ,aAAa,IAAI,CAAY,EACvC,OAMF,IAJA,EAAQ,aAAa,IAAI,CAAY,EAI9B,EAAQ,SAAS,MAAQ,GAC9B,MAAM,QAAQ,KAAK,EAAQ,QAAQ,EAErC,IAAM,EAAU,EAAmB,EAAM,EAAc,EAAU,EAAM,CAAO,EAC9E,EAAQ,SAAS,IAAI,CAAO,EAC5B,EAAa,SAAW,EAAQ,SAAS,OAAO,CAAO,CAAC,EACxD,EAAQ,SAAS,KAAK,CAAO,CAC/B,CAEA,eAAe,EACb,EACA,EACA,EACA,EACA,EACsB,CACtB,GAAI,CACF,IAAM,EAAO,MAAM,EAAS,EAAM,MAAM,EAClC,EAAiB,CAAE,WAAU,YAAa,EAAQ,QAAQ,WAAY,EAE5E,GAAI,IAAS,cACX,MAAO,CAAE,KAAM,CAAE,OAAM,QAAS,EAAY,EAAM,CAAc,CAAE,CAAE,EAGtE,IAAM,EAAY,EAAQ,UAC1B,GAAI,IAAc,EAAU,gBAAgB,EAAM,CAAI,GAAK,EAAU,gBAAgB,EAAc,CAAI,GACrG,MAAO,CAAE,cAAe,CAAK,EAE/B,GAAM,CAAE,UAAS,gBAAe,kBAAmB,MAAM,EAAyB,EAAM,CAAc,EACtG,MAAO,CACL,KAAM,CAAE,OAAM,UAAS,sBAAuB,CAAc,EAG5D,QACE,IAAmB,IAAA,GACf,IAAA,GACA,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,mDAAmD,GACtG,CACF,OAAS,EAAO,CAKd,OAJI,aAAiB,GACnB,EAAQ,UAAY,GACb,CAAE,MAAO,CAAM,GAEjB,CAAE,MAAO,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,IAAI,EAAgB,CAAK,GAAI,CAC1F,CACF,CAQA,eAAsB,EACpB,EACA,EAC0G,CAC1G,GAAI,CACF,OAAO,MAAM,EAAkC,EAAM,CAAc,CACrE,OAAS,EAAO,CACd,GAAI,aAAiB,EACnB,MAAM,EAER,MAAO,CAAE,QAAS,EAAY,EAAM,CAAc,EAAG,eAAgB,EAAgB,CAAK,CAAE,CAC9F,CACF,CAGA,SAAgB,EAAwB,EAAoB,EAA4B,CACtF,GAAI,EAAO,YAAc,EAAO,MAAM,OAAS,EAC7C,OAEF,IAAM,EAAc,EAAO,MAAM,SAAS,CAAE,OAAM,2BAChD,EAAwB,CAAC,CAAE,KAAM,EAAW,EAAM,EAAO,WAAW,EAAG,GAAG,CAAsB,CAAC,EAAI,CAAC,CACxG,EACI,EAAY,OAAS,IAGzB,EAAO,qBAAuB,EAA4B,EAAa,EAAQ,WAAW,EAC5F,CAQA,SAAgB,EACd,EACA,EACA,EACa,CACb,IAAM,EAAQ,IAAI,IAAI,GAAS,YAAY,oBAAoB,EAEzD,EACJ,GAAwB,OAAO,OAAO,EAAqB,2BAA4B,CAAa,EAC/F,EAAqB,2BAA2B,IAAkB,CAAC,EACpE,CAAC,EACP,IAAK,IAAM,KAAQ,EACjB,EAAM,IAAI,CAAI,EAEhB,OAAO,CACT,CAEA,SAAS,EAAoB,EAAc,EAA+B,CASxE,OARI,EAAsB,IAAI,CAAI,EACzB,GAGT,CAAI,EAAQ,cAIL,EAAmB,IAAI,CAAI,CACpC,CAEA,SAAS,EAAkB,EAAmB,EAA4B,CACxE,IAAM,EAAW,EAAK,SAAS,EAAW,CAAS,EACnD,OAAO,IAAa,IAAO,IAAa,MAAQ,CAAC,EAAS,WAAW,KAAK,EAAK,KAAK,GAAK,CAAC,EAAK,WAAW,CAAQ,CACpH,CASA,SAAgB,EAAc,EAAsB,EAAsB,EAAiB,GAAgB,CACzG,GAAI,EACF,OAAO,EAAY,EAAc,EAAS,EAAI,IAAM,IAAA,GAEtD,IAAM,EAAW,EAAa,MAAM,GAAG,EACvC,IAAK,IAAM,KAAW,EAAS,MAAM,EAAG,EAAE,EACxC,GAAI,EAAsB,IAAI,CAAO,GAAM,CAAC,EAAQ,cAAgB,EAAmB,IAAI,CAAO,EAChG,MAAO,GAGX,OAAO,EAAY,EAAc,CAAO,IAAM,IAAA,EAChD,CAEA,SAAgB,EAAY,EAAc,EAAsB,EAAiB,GAAiC,CAChH,IAAM,EAAY,EAAK,YAAY,EAEjC,MAAC,IACA,EAAU,SAAS,OAAO,GACzB,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,SAAS,GAC5B,EAAU,SAAS,UAAU,MAM9B,GACA,EAAQ,cACR,GAAgB,KAAK,EAAK,SAAS,CAAI,CAAC,GAAK,GAAsB,KAAK,EAAK,SAAS,CAAI,CAAC,GAK9F,OAAO,EAAe,CAAI,CAC5B,CAEA,SAAgB,EAAW,EAAc,EAAsB,CAC7D,OAAO,EAAK,SAAS,EAAM,CAAI,GAAK,EAAK,SAAS,CAAI,CACxD,CAEA,SAAgB,EAAY,EAAuB,CACjD,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAgB,EAAY,EAAuB,CACjD,QAAQ,OAAO,MAAM,CAAO,CAC9B"}
+{"version":3,"file":"scan.js","names":[],"sources":["../src/scan.ts"],"sourcesContent":["import { lstat, readdir, readFile, realpath, stat } from 'node:fs/promises';\nimport os from 'node:os';\nimport path from 'node:path';\nimport { getErrorMessage } from '@willbooster/shared-lib';\nimport { measureCrossFileDuplication, type CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport type { CrossFileDuplicationFileData } from './duplication.js';\nimport type { Exclusion } from './exclusion.js';\nimport { detectLanguage } from './languages.js';\nimport { measureCode, measureCodeWithCrossFileDataAsync } from './metrics.js';\nimport { NativeAddonError } from './nativeMetrics.js';\nimport type { CodeMetrics, DuplicationOptions, LanguageName, MeasureOptions } from './types.js';\n\n/** The scan settings shared by every command (a structural subset of each command's options). */\nexport interface ScanOptions {\n  duplication: Required<DuplicationOptions>;\n  includeTests: boolean;\n  /**\n   * Loads the exclusion covering the files a directory scan found (absolute paths); an explicitly\n   * targeted file is always measured.\n   */\n  loadExclusion?: (absolutePaths: readonly string[]) => Promise<Exclusion>;\n}\n\nexport interface FileMetrics {\n  file: string;\n  metrics: CodeMetrics;\n  /** Cross-file duplicate candidates and token/statement data, collected only for directory scans. */\n  duplicationCandidates?: CrossFileDuplicationFileData;\n}\n\nexport interface ScanResult {\n  crossFileDuplication?: CrossFileDuplicationMetrics;\n  displayRoot: string;\n  errors: string[];\n  /** Non-fatal degradations (e.g. cross-file candidates unavailable); the file is still measured. */\n  warnings: string[];\n  /** Files skipped because their content is generated code (see Exclusion.isGeneratedCode). */\n  generatedFiles: string[];\n  fatalError?: string;\n  files: FileMetrics[];\n}\n\nconst ignoredDirectoryNames = new Set([\n  '.agents',\n  '.claude',\n  '.cursor',\n  '.git',\n  '.next',\n  '.playwright-cli',\n  '.tox',\n  '.tmp',\n  '.turbo',\n  '.venv',\n  '.yarn',\n  '__fixtures__',\n  '__generated__',\n  '__pycache__',\n  'coverage',\n  'dist',\n  'fixtures',\n  'generated',\n  'node_modules',\n  // .NET SDK intermediate output (generated sources such as `*.GlobalUsings.g.cs`).\n  'obj',\n  'target',\n  'test-fixtures',\n  'vendor',\n  'venv',\n]);\n\nconst testDirectoryNames = new Set(['__tests__', 'test', 'tests', 'spec']);\nconst testFilePattern = /(?:^test(?:[_-].*)?|\\.(?:spec|test)|[_-](?:test|spec))\\.[^.]+$/iu;\n// JUnit (Java/Kotlin) and xUnit/NUnit (C#) tests use case-sensitive `Test`/`Tests` class-name\n// suffixes; case-insensitive matching would catch production files like `contest.java`.\nconst suffixTestFilePattern = /Tests?\\.(?:java|kt|cs)$/u;\n\nexport function resolveTarget(target: string): string {\n  if (target === '~') {\n    return os.homedir();\n  }\n\n  if (target.startsWith('~/')) {\n    return path.join(os.homedir(), target.slice(2));\n  }\n\n  return path.resolve(target);\n}\n\n/** Returns the directory from which the config file search should start (the target itself if it is a directory). */\nexport async function configSearchDirectory(target: string): Promise<string> {\n  try {\n    const targetStat = await stat(target);\n    return targetStat.isDirectory() ? target : path.dirname(target);\n  } catch {\n    return path.dirname(target);\n  }\n}\n\n/** Shared state of one scan, threaded through the directory walk instead of positional plumbing. */\ninterface ScanContext {\n  options: ScanOptions;\n  /**\n   * Outcomes in discovery order. Files are measured concurrently, so a measurement is recorded as\n   * a promise here and applied in this order once all have settled, keeping results deterministic.\n   */\n  outcomes: (ScanOutcome | Promise<ScanOutcome>)[];\n  /** Measurements in flight, bounded so file contents and payloads do not pile up. */\n  inFlight: Set<Promise<ScanOutcome>>;\n  /** Set once a measurement fails fatally; no further measurement starts. */\n  fatalSeen: boolean;\n  visitedDirectories: Set<string>;\n  visitedFiles: Set<string>;\n  /** Scan root: paths are displayed relative to it, and symbolic links may not escape it. */\n  rootDirectory: string;\n  /** Files the walk found, measured once the exclusion covering all of them is loaded. */\n  candidates: ScanCandidate[];\n  exclusion?: Exclusion;\n}\n\ninterface ScanCandidate {\n  file: string;\n  language: LanguageName;\n  /** The resolved path when the file was reached through a symbolic link. */\n  realFile?: string;\n}\n\n/**\n * A missing native addon fails every file identically, so it ends the scan as one fatal error\n * instead of one \"skipped\" entry per file behind a successful exit code.\n */\ntype ScanOutcome =\n  | { file: FileMetrics; warning?: string }\n  | { generatedFile: string }\n  | { error: string }\n  | { fatal: NativeAddonError };\n\n// Twice the addon's worker count keeps its pool busy while finished payloads are parsed.\nconst maxMeasurementsInFlight = os.availableParallelism() * 2;\n\nexport async function scanTarget(target: string, options: ScanOptions): Promise<ScanResult> {\n  let canonicalTarget = target;\n  try {\n    canonicalTarget = await realpath(target);\n  } catch {\n    // stat below reports missing targets with the original path.\n  }\n\n  const fallbackDisplayRoot = path.dirname(canonicalTarget);\n  let targetStat;\n\n  try {\n    targetStat = await stat(canonicalTarget);\n  } catch (error) {\n    const fatalError = `${formatPath(canonicalTarget, fallbackDisplayRoot)}: ${getErrorMessage(error)}`;\n    return {\n      displayRoot: fallbackDisplayRoot,\n      files: [],\n      errors: [fatalError],\n      warnings: [],\n      generatedFiles: [],\n      fatalError,\n    };\n  }\n\n  if (targetStat.isFile()) {\n    const displayRoot = path.dirname(canonicalTarget);\n    const language = getLanguage(canonicalTarget, options, true);\n    if (!language) {\n      const fatalError = `${formatPath(canonicalTarget, displayRoot)}: unsupported file type`;\n      return { displayRoot, files: [], errors: [fatalError], warnings: [], generatedFiles: [], fatalError };\n    }\n\n    const context = makeScanContext(options, displayRoot);\n    await measureFile(canonicalTarget, language, 'single-file', context, canonicalTarget);\n    return settleScan(context, displayRoot);\n  }\n\n  const context = makeScanContext(options, canonicalTarget);\n  await scanDirectory(canonicalTarget, context);\n  await measureCandidates(context);\n  return settleScan(context, canonicalTarget);\n}\n\n/**\n * Measures an explicit list of repository-relative files (the git-visible ones of `check`) instead\n * of walking the directory tree, so ignored artifact directories are never parsed. Paths outside\n * the scan scope (ignored/test directories, unsupported or test file names) are skipped with the\n * same rules as the walk. Like the walk, which never tests the directory it starts in, the rules\n * apply to a file under `targetDirectory` (repository-relative, forward slashes) by its path below\n * that directory, so naming `vendor` or `test` as the target measures what is in it.\n */\nexport async function scanListedFiles(\n  rootDirectory: string,\n  relativePaths: Iterable<string>,\n  options: ScanOptions,\n  explicitFiles: ReadonlySet<string> = new Set(),\n  targetDirectory = ''\n): Promise<ScanResult> {\n  const context = makeScanContext(options, rootDirectory);\n  const targetPrefix = targetDirectory === '' ? '' : `${targetDirectory}/`;\n  for (const relativePath of relativePaths) {\n    const absolutePath = path.join(rootDirectory, relativePath);\n    const scopedPath = relativePath.startsWith(targetPrefix) ? relativePath.slice(targetPrefix.length) : relativePath;\n    const language = isScannedPath(scopedPath, options, explicitFiles.has(absolutePath))\n      ? getLanguage(relativePath, options, explicitFiles.has(absolutePath))\n      : undefined;\n    if (!language) {\n      continue;\n    }\n    // Like the walk, only regular files are sources. A symbolic link is not one: git stores only its\n    // target string, so measuring through it would diverge from what any revision of the repository\n    // contains. Reading a FIFO would block forever. A path lstat cannot inspect stays a candidate so\n    // that measuring it reports the error.\n    const stats = await lstat(absolutePath).catch(() => {});\n    if (!stats || stats.isFile()) {\n      context.candidates.push({ file: absolutePath, language });\n    }\n  }\n  await measureCandidates(context);\n  return settleScan(context, rootDirectory);\n}\n\nasync function measureCandidates(context: ScanContext): Promise<void> {\n  const exclusion = await context.options.loadExclusion?.(\n    context.candidates.flatMap(({ file, realFile }) => (realFile === undefined ? [file] : [file, realFile]))\n  );\n  context.exclusion = exclusion;\n  // Every path reaching the same real file, in discovery order, so one alias cannot decide alone.\n  const pathsByRealFile = new Map<string, ScanCandidate[]>();\n  for (const candidate of context.candidates) {\n    let realFile;\n    try {\n      realFile = candidate.realFile ?? (await realpath(candidate.file));\n    } catch (error) {\n      recordError(context, candidate.file, error);\n      continue;\n    }\n    pathsByRealFile.set(realFile, [...(pathsByRealFile.get(realFile) ?? []), candidate]);\n  }\n  for (const [realFile, candidates] of pathsByRealFile) {\n    if (context.fatalSeen) {\n      return;\n    }\n    const chosen = await chooseMeasuredPath(realFile, candidates, exclusion);\n    if (chosen !== undefined) {\n      await measureFile(chosen.file, chosen.language, 'directory', context, realFile);\n    }\n  }\n}\n\n/**\n * The path to measure a real file through. A path is excluded when its own exclusion or the real\n * file's applies, so the real path, when the scan reached it directly, is never less measurable\n * than an alias; otherwise the first alias not excluded, preferring one whose own attributes do\n * not judge the content generated.\n */\nasync function chooseMeasuredPath(\n  realFile: string,\n  candidates: readonly ScanCandidate[],\n  exclusion: Exclusion | undefined\n): Promise<ScanCandidate | undefined> {\n  if (exclusion === undefined) {\n    return candidates[0];\n  }\n  if (exclusion.isExcludedPath(realFile)) {\n    return undefined;\n  }\n  const measurable = candidates.filter(({ file }) => !exclusion.isExcludedPath(file));\n  const direct = measurable.find(({ file }) => file === realFile);\n  if (direct !== undefined || measurable.length <= 1) {\n    return direct ?? measurable[0];\n  }\n  const code = await readFile(realFile, 'utf8').catch(() => {});\n  return measurable.find(({ file }) => code !== undefined && !exclusion.isGeneratedCode(file, code)) ?? measurable[0];\n}\n\n/** Applies the scan's outcomes in discovery order once every measurement has settled. */\nasync function settleScan(context: ScanContext, displayRoot: string): Promise<ScanResult> {\n  const files: FileMetrics[] = [];\n  const errors: string[] = [];\n  const warnings: string[] = [];\n  const generatedFiles: string[] = [];\n  for (const pending of context.outcomes) {\n    const outcome = await pending;\n    if ('fatal' in outcome) {\n      const fatalError = getErrorMessage(outcome.fatal);\n      // Errors the walk recorded before the fatal failure stay reported alongside it.\n      return { displayRoot, files, errors: [...errors, fatalError], warnings, generatedFiles, fatalError };\n    }\n    if ('generatedFile' in outcome) {\n      generatedFiles.push(outcome.generatedFile);\n      continue;\n    }\n    if ('error' in outcome) {\n      errors.push(outcome.error);\n      continue;\n    }\n    files.push(outcome.file);\n    if (outcome.warning !== undefined) {\n      warnings.push(outcome.warning);\n    }\n  }\n  return { displayRoot, files, errors, warnings, generatedFiles };\n}\n\nfunction makeScanContext(options: ScanOptions, rootDirectory: string): ScanContext {\n  return {\n    options,\n    outcomes: [],\n    inFlight: new Set(),\n    fatalSeen: false,\n    visitedDirectories: new Set(),\n    visitedFiles: new Set(),\n    rootDirectory,\n    candidates: [],\n  };\n}\n\nfunction recordError(context: ScanContext, target: string, error: unknown): void {\n  context.outcomes.push({ error: `${formatPath(target, context.rootDirectory)}: ${getErrorMessage(error)}` });\n}\n\n/** Runs a filesystem operation, recording a scan error and returning undefined when it fails. */\nasync function tryFileSystem<T>(\n  operation: () => Promise<T>,\n  target: string,\n  context: ScanContext\n): Promise<T | undefined> {\n  try {\n    return await operation();\n  } catch (error) {\n    recordError(context, target, error);\n    return undefined;\n  }\n}\n\n/** Resolves the path (recording errors); undefined when that fails or the result escapes the root. */\nasync function resolveWithinRoot(target: string, context: ScanContext): Promise<string | undefined> {\n  const resolved = await tryFileSystem(() => realpath(target), target, context);\n  return resolved !== undefined && isWithinDirectory(resolved, context.rootDirectory) ? resolved : undefined;\n}\n\nasync function scanDirectory(directory: string, context: ScanContext): Promise<void> {\n  const resolvedDirectory = await resolveWithinRoot(directory, context);\n  if (resolvedDirectory === undefined || context.visitedDirectories.has(resolvedDirectory)) {\n    return;\n  }\n  context.visitedDirectories.add(resolvedDirectory);\n\n  const entries = await tryFileSystem(() => readdir(directory, { withFileTypes: true }), directory, context);\n  if (entries === undefined) {\n    return;\n  }\n  // readdir order differs between file systems; sorting keeps which path reaches a file first,\n  // and so the scan's result, the same everywhere.\n  entries.sort((left, right) => (left.name < right.name ? -1 : left.name > right.name ? 1 : 0));\n\n  for (const entry of entries) {\n    const entryPath = path.join(directory, entry.name);\n    if (entry.isSymbolicLink()) {\n      await scanSymbolicLink(entry.name, entryPath, context);\n      continue;\n    }\n\n    if (entry.isDirectory()) {\n      if (shouldSkipDirectory(entry.name, context.options)) {\n        continue;\n      }\n      await scanDirectory(entryPath, context);\n      continue;\n    }\n\n    if (entry.isFile()) {\n      // Under a symbolically linked directory the real path differs, and exclusion checks both.\n      const realFile = resolvedDirectory === directory ? undefined : path.join(resolvedDirectory, entry.name);\n      collectScannableFile(entryPath, context, entryPath, realFile);\n    }\n  }\n}\n\nasync function scanSymbolicLink(name: string, entryPath: string, context: ScanContext): Promise<void> {\n  const resolvedPath = await resolveWithinRoot(entryPath, context);\n  if (resolvedPath === undefined) {\n    return;\n  }\n\n  const entryStat = await tryFileSystem(() => stat(entryPath), entryPath, context);\n  if (entryStat === undefined) {\n    return;\n  }\n\n  if (entryStat.isDirectory()) {\n    if (\n      shouldSkipDirectory(name, context.options) ||\n      shouldSkipDirectory(path.basename(resolvedPath), context.options)\n    ) {\n      return;\n    }\n    await scanDirectory(entryPath, context);\n    return;\n  }\n\n  if (entryStat.isFile()) {\n    collectScannableFile(entryPath, context, resolvedPath, resolvedPath);\n  }\n}\n\nfunction collectScannableFile(file: string, context: ScanContext, languageFile = file, realFile?: string): void {\n  const language = getLanguage(languageFile, context.options);\n  if (language) {\n    context.candidates.push({ file, language, realFile });\n  }\n}\n\n/**\n * Resolves and deduplicates the file in discovery order, then starts measuring it concurrently; its\n * outcome is recorded in discovery order (see ScanContext.outcomes).\n */\nasync function measureFile(\n  file: string,\n  language: LanguageName,\n  mode: 'single-file' | 'directory',\n  context: ScanContext,\n  realFile?: string\n): Promise<void> {\n  if (context.fatalSeen) {\n    return;\n  }\n  let resolvedFile;\n  try {\n    resolvedFile = realFile ?? (await realpath(file));\n  } catch (error) {\n    recordError(context, file, error);\n    return;\n  }\n  if (context.visitedFiles.has(resolvedFile)) {\n    return;\n  }\n  context.visitedFiles.add(resolvedFile);\n\n  // Any settled measurement frees its slot (removed by the callback below, which runs before the\n  // race resumes), so one slow file never idles the pool.\n  while (context.inFlight.size >= maxMeasurementsInFlight) {\n    await Promise.race(context.inFlight);\n  }\n  const outcome = readAndMeasureFile(file, resolvedFile, language, mode, context);\n  context.inFlight.add(outcome);\n  void outcome.then(() => context.inFlight.delete(outcome));\n  context.outcomes.push(outcome);\n}\n\nasync function readAndMeasureFile(\n  file: string,\n  resolvedFile: string,\n  language: LanguageName,\n  mode: 'single-file' | 'directory',\n  context: ScanContext\n): Promise<ScanOutcome> {\n  try {\n    const code = await readFile(file, 'utf8');\n    const measureOptions = { language, duplication: context.options.duplication };\n    // Only directory scans compare files against each other; a single-file target has no peers.\n    if (mode === 'single-file') {\n      return { file: { file, metrics: measureCode(code, measureOptions) } };\n    }\n    // Like path exclusion, either the scanned path or the real one can judge the code generated.\n    const exclusion = context.exclusion;\n    if (exclusion && (exclusion.isGeneratedCode(file, code) || exclusion.isGeneratedCode(resolvedFile, code))) {\n      return { generatedFile: file };\n    }\n    const { metrics, crossFileData, crossFileError } = await measureWithCrossFileData(code, measureOptions);\n    return {\n      file: { file, metrics, duplicationCandidates: crossFileData },\n      // A warning, not an error: the file's metrics are complete, only its participation in\n      // cross-file matching is lost, so it is not \"skipped\" and must not fail --fail-on-error.\n      warning:\n        crossFileError === undefined\n          ? undefined\n          : `${formatPath(file, context.rootDirectory)}: cross-file duplication candidates unavailable: ${crossFileError}`,\n    };\n  } catch (error) {\n    if (error instanceof NativeAddonError) {\n      context.fatalSeen = true;\n      return { fatal: error };\n    }\n    return { error: `${formatPath(file, context.rootDirectory)}: ${getErrorMessage(error)}` };\n  }\n}\n\n/**\n * Measures a file together with its cross-file contribution from one parse. The contribution is\n * auxiliary: if collecting it fails where plain measurement succeeds (e.g. a payload too large to\n * cross the addon boundary), the metrics are still returned with the failure message, which\n * callers report as a warning rather than an error.\n */\nasync function measureWithCrossFileData(\n  code: string,\n  measureOptions: MeasureOptions\n): Promise<{ metrics: CodeMetrics; crossFileData?: CrossFileDuplicationFileData; crossFileError?: string }> {\n  try {\n    return await measureCodeWithCrossFileDataAsync(code, measureOptions);\n  } catch (error) {\n    if (error instanceof NativeAddonError) {\n      throw error;\n    }\n    return { metrics: measureCode(code, measureOptions), crossFileError: getErrorMessage(error) };\n  }\n}\n\n/** Runs after the scan so every measured file's candidates participate. */\nexport function addCrossFileDuplication(result: ScanResult, options: ScanOptions): void {\n  if (result.fatalError || result.files.length < 2) {\n    return;\n  }\n  const sourceFiles = result.files.flatMap(({ file, duplicationCandidates }) =>\n    duplicationCandidates ? [{ file: formatPath(file, result.displayRoot), ...duplicationCandidates }] : []\n  );\n  if (sourceFiles.length < 2) {\n    return;\n  }\n  result.crossFileDuplication = measureCrossFileDuplication(sourceFiles, options.duplication);\n}\n\n/**\n * Distinct 1-based code lines covered by within-file or cross-file duplicated content. Both\n * sources expose the exact lines carrying matched tokens (never block bounding ranges, which\n * would over-count comment/blank lines and the unmatched gap of a merged clone), so the union is\n * a subset of the file's code lines and a ratio derived over code lines can never exceed 1.\n */\nexport function collectDuplicatedLineNumbers(\n  metrics: CodeMetrics | undefined,\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  formattedFile: string\n): Set<number> {\n  const lines = new Set(metrics?.duplication.duplicateLineNumbers);\n  // Object.hasOwn: a file named like an Object.prototype member must not read an inherited value.\n  const crossFileLines =\n    crossFileDuplication && Object.hasOwn(crossFileDuplication.duplicateLineNumbersByFile, formattedFile)\n      ? (crossFileDuplication.duplicateLineNumbersByFile[formattedFile] ?? [])\n      : [];\n  for (const line of crossFileLines) {\n    lines.add(line);\n  }\n  return lines;\n}\n\nfunction shouldSkipDirectory(name: string, options: ScanOptions): boolean {\n  if (ignoredDirectoryNames.has(name)) {\n    return true;\n  }\n\n  if (options.includeTests) {\n    return false;\n  }\n\n  return testDirectoryNames.has(name);\n}\n\nexport function isWithinDirectory(candidate: string, directory: string): boolean {\n  const relative = path.relative(directory, candidate);\n  return relative === '' || (relative !== '..' && !relative.startsWith(`..${path.sep}`) && !path.isAbsolute(relative));\n}\n\n/**\n * Whether a repository-relative path would be scanned: no ignored or excluded-test directory\n * segment and a supported, non-test file name. An explicitly targeted file only needs a supported\n * language, as in the ranking command.\n */\nfunction isScannedPath(relativePath: string, options: ScanOptions, explicitTarget = false): boolean {\n  if (explicitTarget) {\n    return getLanguage(relativePath, options, true) !== undefined;\n  }\n  const segments = relativePath.split('/');\n  for (const segment of segments.slice(0, -1)) {\n    if (ignoredDirectoryNames.has(segment) || (!options.includeTests && testDirectoryNames.has(segment))) {\n      return false;\n    }\n  }\n  return getLanguage(relativePath, options) !== undefined;\n}\n\nexport function getLanguage(file: string, options: ScanOptions, explicitTarget = false): LanguageName | undefined {\n  const lowerFile = file.toLowerCase();\n  if (\n    !explicitTarget &&\n    (lowerFile.endsWith('.d.ts') ||\n      lowerFile.endsWith('.d.mts') ||\n      lowerFile.endsWith('.d.cts') ||\n      lowerFile.endsWith('.min.js') ||\n      lowerFile.endsWith('.pnp.cjs'))\n  ) {\n    return undefined;\n  }\n\n  if (\n    !explicitTarget &&\n    !options.includeTests &&\n    (testFilePattern.test(path.basename(file)) || suffixTestFilePattern.test(path.basename(file)))\n  ) {\n    return undefined;\n  }\n\n  return detectLanguage(file);\n}\n\n/** The path relative to `base` with forward slashes on every platform, so it compares equal to the paths git prints. */\nexport function formatPath(file: string, base: string): string {\n  return path.relative(base, file).replaceAll(path.sep, '/') || path.basename(file);\n}\n\nexport function writeStdout(message: string): void {\n  process.stdout.write(message);\n}\n\nexport function writeStderr(message: string): void {\n  process.stderr.write(message);\n}\n"],"mappings":"scA0CA,MAAM,kBAAwB,IAAI,IAAI,CACpC,UACA,UACA,UACA,OACA,QACA,kBACA,OACA,OACA,SACA,QACA,QACA,eACA,gBACA,cACA,WACA,OACA,WACA,YACA,eAEA,MACA,SACA,gBACA,SACA,MACF,CAAC,EAEK,kBAAqB,IAAI,IAAI,CAAC,YAAa,OAAQ,QAAS,MAAM,CAAC,EACnE,EAAkB,mEAGlB,EAAwB,2BAE9B,SAAgB,EAAc,EAAwB,CASpD,OARI,IAAW,IACN,EAAG,QAAQ,EAGhB,EAAO,WAAW,IAAI,EACjB,EAAK,KAAK,EAAG,QAAQ,EAAG,EAAO,MAAM,CAAC,CAAC,EAGzC,EAAK,QAAQ,CAAM,CAC5B,CAGA,eAAsB,EAAsB,EAAiC,CAC3E,GAAI,CAEF,OAAO,MADkB,EAAK,CAAM,EAAA,CAClB,YAAY,EAAI,EAAS,EAAK,QAAQ,CAAM,CAChE,MAAQ,CACN,OAAO,EAAK,QAAQ,CAAM,CAC5B,CACF,CAyCA,MAAM,EAA0B,EAAG,qBAAqB,EAAI,EAE5D,eAAsB,EAAW,EAAgB,EAA2C,CAC1F,IAAI,EAAkB,EACtB,GAAI,CACF,EAAkB,MAAM,EAAS,CAAM,CACzC,MAAQ,CAER,CAEA,IAAM,EAAsB,EAAK,QAAQ,CAAe,EACpD,EAEJ,GAAI,CACF,EAAa,MAAM,EAAK,CAAe,CACzC,OAAS,EAAO,CACd,IAAM,EAAa,GAAG,EAAW,EAAiB,CAAmB,EAAE,IAAI,EAAgB,CAAK,IAChG,MAAO,CACL,YAAa,EACb,MAAO,CAAC,EACR,OAAQ,CAAC,CAAU,EACnB,SAAU,CAAC,EACX,eAAgB,CAAC,EACjB,YACF,CACF,CAEA,GAAI,EAAW,OAAO,EAAG,CACvB,IAAM,EAAc,EAAK,QAAQ,CAAe,EAC1C,EAAW,EAAY,EAAiB,EAAS,EAAI,EAC3D,GAAI,CAAC,EAAU,CACb,IAAM,EAAa,GAAG,EAAW,EAAiB,CAAW,EAAE,yBAC/D,MAAO,CAAE,cAAa,MAAO,CAAC,EAAG,OAAQ,CAAC,CAAU,EAAG,SAAU,CAAC,EAAG,eAAgB,CAAC,EAAG,YAAW,CACtG,CAEA,IAAM,EAAU,EAAgB,EAAS,CAAW,EAEpD,OADA,MAAM,EAAY,EAAiB,EAAU,cAAe,EAAS,CAAe,EAC7E,EAAW,EAAS,CAAW,CACxC,CAEA,IAAM,EAAU,EAAgB,EAAS,CAAe,EAGxD,OAFA,MAAM,EAAc,EAAiB,CAAO,EAC5C,MAAM,EAAkB,CAAO,EACxB,EAAW,EAAS,CAAe,CAC5C,CAUA,eAAsB,EACpB,EACA,EACA,EACA,kBAAqC,IAAI,IACzC,EAAkB,GACG,CACrB,IAAM,EAAU,EAAgB,EAAS,CAAa,EAChD,EAAe,IAAoB,GAAK,GAAK,GAAG,EAAgB,GACtE,IAAK,IAAM,KAAgB,EAAe,CACxC,IAAM,EAAe,EAAK,KAAK,EAAe,CAAY,EAEpD,EAAW,EADE,EAAa,WAAW,CAAY,EAAI,EAAa,MAAM,EAAa,MAAM,EAAI,EAC1D,EAAS,EAAc,IAAI,CAAY,CAAC,EAC/E,EAAY,EAAc,EAAS,EAAc,IAAI,CAAY,CAAC,EAClE,IAAA,GACJ,GAAI,CAAC,EACH,SAMF,IAAM,EAAQ,MAAM,EAAM,CAAY,CAAC,CAAC,UAAY,CAAC,CAAC,GAClD,CAAC,GAAS,EAAM,OAAO,IACzB,EAAQ,WAAW,KAAK,CAAE,KAAM,EAAc,UAAS,CAAC,CAE5D,CAEA,OADA,MAAM,EAAkB,CAAO,EACxB,EAAW,EAAS,CAAa,CAC1C,CAEA,eAAe,EAAkB,EAAqC,CACpE,IAAM,EAAY,MAAM,EAAQ,QAAQ,gBACtC,EAAQ,WAAW,SAAS,CAAE,OAAM,cAAgB,IAAa,IAAA,GAAY,CAAC,CAAI,EAAI,CAAC,EAAM,CAAQ,CAAE,CACzG,EACA,EAAQ,UAAY,EAEpB,IAAM,kBAAkB,IAAI,IAC5B,IAAK,IAAM,KAAa,EAAQ,WAAY,CAC1C,IAAI,EACJ,GAAI,CACF,EAAW,EAAU,UAAa,MAAM,EAAS,EAAU,IAAI,CACjE,OAAS,EAAO,CACd,EAAY,EAAS,EAAU,KAAM,CAAK,EAC1C,QACF,CACA,EAAgB,IAAI,EAAU,CAAC,GAAI,EAAgB,IAAI,CAAQ,GAAK,CAAC,EAAI,CAAS,CAAC,CACrF,CACA,IAAK,GAAM,CAAC,EAAU,KAAe,EAAiB,CACpD,GAAI,EAAQ,UACV,OAEF,IAAM,EAAS,MAAM,EAAmB,EAAU,EAAY,CAAS,EACnE,IAAW,IAAA,IACb,MAAM,EAAY,EAAO,KAAM,EAAO,SAAU,YAAa,EAAS,CAAQ,CAElF,CACF,CAQA,eAAe,EACb,EACA,EACA,EACoC,CACpC,GAAI,IAAc,IAAA,GAChB,OAAO,EAAW,GAEpB,GAAI,EAAU,eAAe,CAAQ,EACnC,OAEF,IAAM,EAAa,EAAW,QAAQ,CAAE,UAAW,CAAC,EAAU,eAAe,CAAI,CAAC,EAC5E,EAAS,EAAW,MAAM,CAAE,UAAW,IAAS,CAAQ,EAC9D,GAAI,IAAW,IAAA,IAAa,EAAW,QAAU,EAC/C,OAAO,GAAU,EAAW,GAE9B,IAAM,EAAO,MAAM,EAAS,EAAU,MAAM,CAAC,CAAC,UAAY,CAAC,CAAC,EAC5D,OAAO,EAAW,MAAM,CAAE,UAAW,IAAS,IAAA,IAAa,CAAC,EAAU,gBAAgB,EAAM,CAAI,CAAC,GAAK,EAAW,EACnH,CAGA,eAAe,EAAW,EAAsB,EAA0C,CACxF,IAAM,EAAuB,CAAC,EACxB,EAAmB,CAAC,EACpB,EAAqB,CAAC,EACtB,EAA2B,CAAC,EAClC,IAAK,IAAM,KAAW,EAAQ,SAAU,CACtC,IAAM,EAAU,MAAM,EACtB,GAAI,UAAW,EAAS,CACtB,IAAM,EAAa,EAAgB,EAAQ,KAAK,EAEhD,MAAO,CAAE,cAAa,QAAO,OAAQ,CAAC,GAAG,EAAQ,CAAU,EAAG,WAAU,iBAAgB,YAAW,CACrG,CACA,GAAI,kBAAmB,EAAS,CAC9B,EAAe,KAAK,EAAQ,aAAa,EACzC,QACF,CACA,GAAI,UAAW,EAAS,CACtB,EAAO,KAAK,EAAQ,KAAK,EACzB,QACF,CACA,EAAM,KAAK,EAAQ,IAAI,EACnB,EAAQ,UAAY,IAAA,IACtB,EAAS,KAAK,EAAQ,OAAO,CAEjC,CACA,MAAO,CAAE,cAAa,QAAO,SAAQ,WAAU,gBAAe,CAChE,CAEA,SAAS,EAAgB,EAAsB,EAAoC,CACjF,MAAO,CACL,UACA,SAAU,CAAC,EACX,yBAAU,IAAI,IACd,UAAW,GACX,mCAAoB,IAAI,IACxB,6BAAc,IAAI,IAClB,gBACA,WAAY,CAAC,CACf,CACF,CAEA,SAAS,EAAY,EAAsB,EAAgB,EAAsB,CAC/E,EAAQ,SAAS,KAAK,CAAE,MAAO,GAAG,EAAW,EAAQ,EAAQ,aAAa,EAAE,IAAI,EAAgB,CAAK,GAAI,CAAC,CAC5G,CAGA,eAAe,EACb,EACA,EACA,EACwB,CACxB,GAAI,CACF,OAAO,MAAM,EAAU,CACzB,OAAS,EAAO,CACd,EAAY,EAAS,EAAQ,CAAK,EAClC,MACF,CACF,CAGA,eAAe,EAAkB,EAAgB,EAAmD,CAClG,IAAM,EAAW,MAAM,MAAoB,EAAS,CAAM,EAAG,EAAQ,CAAO,EAC5E,OAAO,IAAa,IAAA,IAAa,EAAkB,EAAU,EAAQ,aAAa,EAAI,EAAW,IAAA,EACnG,CAEA,eAAe,EAAc,EAAmB,EAAqC,CACnF,IAAM,EAAoB,MAAM,EAAkB,EAAW,CAAO,EACpE,GAAI,IAAsB,IAAA,IAAa,EAAQ,mBAAmB,IAAI,CAAiB,EACrF,OAEF,EAAQ,mBAAmB,IAAI,CAAiB,EAEhD,IAAM,EAAU,MAAM,MAAoB,EAAQ,EAAW,CAAE,cAAe,EAAK,CAAC,EAAG,EAAW,CAAO,EACrG,OAAY,IAAA,GAKhB,GAAQ,MAAM,EAAM,IAAW,EAAK,KAAO,EAAM,KAAO,GAAK,IAAK,KAAO,EAAM,KAAa,EAE5F,IAAK,IAAM,KAAS,EAAS,CAC3B,IAAM,EAAY,EAAK,KAAK,EAAW,EAAM,IAAI,EACjD,GAAI,EAAM,eAAe,EAAG,CAC1B,MAAM,EAAiB,EAAM,KAAM,EAAW,CAAO,EACrD,QACF,CAEA,GAAI,EAAM,YAAY,EAAG,CACvB,GAAI,EAAoB,EAAM,KAAM,EAAQ,OAAO,EACjD,SAEF,MAAM,EAAc,EAAW,CAAO,EACtC,QACF,CAEI,EAAM,OAAO,GAGf,EAAqB,EAAW,EAAS,EADxB,IAAsB,EAAY,IAAA,GAAY,EAAK,KAAK,EAAmB,EAAM,IAAI,CAC1C,CAEhE,CAtB4F,CAuB9F,CAEA,eAAe,EAAiB,EAAc,EAAmB,EAAqC,CACpG,IAAM,EAAe,MAAM,EAAkB,EAAW,CAAO,EAC/D,GAAI,IAAiB,IAAA,GACnB,OAGF,IAAM,EAAY,MAAM,MAAoB,EAAK,CAAS,EAAG,EAAW,CAAO,EAC3E,OAAc,IAAA,GAIlB,IAAI,EAAU,YAAY,EAAG,CAC3B,GACE,EAAoB,EAAM,EAAQ,OAAO,GACzC,EAAoB,EAAK,SAAS,CAAY,EAAG,EAAQ,OAAO,EAEhE,OAEF,MAAM,EAAc,EAAW,CAAO,EACtC,MACF,CAEI,EAAU,OAAO,GACnB,EAAqB,EAAW,EAAS,EAAc,CAAY,CAHrE,CAKF,CAEA,SAAS,EAAqB,EAAc,EAAsB,EAAe,EAAM,EAAyB,CAC9G,IAAM,EAAW,EAAY,EAAc,EAAQ,OAAO,EACtD,GACF,EAAQ,WAAW,KAAK,CAAE,OAAM,WAAU,UAAS,CAAC,CAExD,CAMA,eAAe,EACb,EACA,EACA,EACA,EACA,EACe,CACf,GAAI,EAAQ,UACV,OAEF,IAAI,EACJ,GAAI,CACF,EAAe,GAAa,MAAM,EAAS,CAAI,CACjD,OAAS,EAAO,CACd,EAAY,EAAS,EAAM,CAAK,EAChC,MACF,CACA,GAAI,EAAQ,aAAa,IAAI,CAAY,EACvC,OAMF,IAJA,EAAQ,aAAa,IAAI,CAAY,EAI9B,EAAQ,SAAS,MAAQ,GAC9B,MAAM,QAAQ,KAAK,EAAQ,QAAQ,EAErC,IAAM,EAAU,EAAmB,EAAM,EAAc,EAAU,EAAM,CAAO,EAC9E,EAAQ,SAAS,IAAI,CAAO,EAC5B,EAAa,SAAW,EAAQ,SAAS,OAAO,CAAO,CAAC,EACxD,EAAQ,SAAS,KAAK,CAAO,CAC/B,CAEA,eAAe,EACb,EACA,EACA,EACA,EACA,EACsB,CACtB,GAAI,CACF,IAAM,EAAO,MAAM,EAAS,EAAM,MAAM,EAClC,EAAiB,CAAE,WAAU,YAAa,EAAQ,QAAQ,WAAY,EAE5E,GAAI,IAAS,cACX,MAAO,CAAE,KAAM,CAAE,OAAM,QAAS,EAAY,EAAM,CAAc,CAAE,CAAE,EAGtE,IAAM,EAAY,EAAQ,UAC1B,GAAI,IAAc,EAAU,gBAAgB,EAAM,CAAI,GAAK,EAAU,gBAAgB,EAAc,CAAI,GACrG,MAAO,CAAE,cAAe,CAAK,EAE/B,GAAM,CAAE,UAAS,gBAAe,kBAAmB,MAAM,EAAyB,EAAM,CAAc,EACtG,MAAO,CACL,KAAM,CAAE,OAAM,UAAS,sBAAuB,CAAc,EAG5D,QACE,IAAmB,IAAA,GACf,IAAA,GACA,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,mDAAmD,GACtG,CACF,OAAS,EAAO,CAKd,OAJI,aAAiB,GACnB,EAAQ,UAAY,GACb,CAAE,MAAO,CAAM,GAEjB,CAAE,MAAO,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,IAAI,EAAgB,CAAK,GAAI,CAC1F,CACF,CAQA,eAAe,EACb,EACA,EAC0G,CAC1G,GAAI,CACF,OAAO,MAAM,EAAkC,EAAM,CAAc,CACrE,OAAS,EAAO,CACd,GAAI,aAAiB,EACnB,MAAM,EAER,MAAO,CAAE,QAAS,EAAY,EAAM,CAAc,EAAG,eAAgB,EAAgB,CAAK,CAAE,CAC9F,CACF,CAGA,SAAgB,EAAwB,EAAoB,EAA4B,CACtF,GAAI,EAAO,YAAc,EAAO,MAAM,OAAS,EAC7C,OAEF,IAAM,EAAc,EAAO,MAAM,SAAS,CAAE,OAAM,2BAChD,EAAwB,CAAC,CAAE,KAAM,EAAW,EAAM,EAAO,WAAW,EAAG,GAAG,CAAsB,CAAC,EAAI,CAAC,CACxG,EACI,EAAY,OAAS,IAGzB,EAAO,qBAAuB,EAA4B,EAAa,EAAQ,WAAW,EAC5F,CAQA,SAAgB,EACd,EACA,EACA,EACa,CACb,IAAM,EAAQ,IAAI,IAAI,GAAS,YAAY,oBAAoB,EAEzD,EACJ,GAAwB,OAAO,OAAO,EAAqB,2BAA4B,CAAa,EAC/F,EAAqB,2BAA2B,IAAkB,CAAC,EACpE,CAAC,EACP,IAAK,IAAM,KAAQ,EACjB,EAAM,IAAI,CAAI,EAEhB,OAAO,CACT,CAEA,SAAS,EAAoB,EAAc,EAA+B,CASxE,OARI,EAAsB,IAAI,CAAI,EACzB,GAGT,CAAI,EAAQ,cAIL,EAAmB,IAAI,CAAI,CACpC,CAEA,SAAgB,EAAkB,EAAmB,EAA4B,CAC/E,IAAM,EAAW,EAAK,SAAS,EAAW,CAAS,EACnD,OAAO,IAAa,IAAO,IAAa,MAAQ,CAAC,EAAS,WAAW,KAAK,EAAK,KAAK,GAAK,CAAC,EAAK,WAAW,CAAQ,CACpH,CAOA,SAAS,EAAc,EAAsB,EAAsB,EAAiB,GAAgB,CAClG,GAAI,EACF,OAAO,EAAY,EAAc,EAAS,EAAI,IAAM,IAAA,GAEtD,IAAM,EAAW,EAAa,MAAM,GAAG,EACvC,IAAK,IAAM,KAAW,EAAS,MAAM,EAAG,EAAE,EACxC,GAAI,EAAsB,IAAI,CAAO,GAAM,CAAC,EAAQ,cAAgB,EAAmB,IAAI,CAAO,EAChG,MAAO,GAGX,OAAO,EAAY,EAAc,CAAO,IAAM,IAAA,EAChD,CAEA,SAAgB,EAAY,EAAc,EAAsB,EAAiB,GAAiC,CAChH,IAAM,EAAY,EAAK,YAAY,EAEjC,MAAC,IACA,EAAU,SAAS,OAAO,GACzB,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,SAAS,GAC5B,EAAU,SAAS,UAAU,MAM9B,GACA,EAAQ,cACR,GAAgB,KAAK,EAAK,SAAS,CAAI,CAAC,GAAK,GAAsB,KAAK,EAAK,SAAS,CAAI,CAAC,GAK9F,OAAO,EAAe,CAAI,CAC5B,CAGA,SAAgB,EAAW,EAAc,EAAsB,CAC7D,OAAO,EAAK,SAAS,EAAM,CAAI,CAAC,CAAC,WAAW,EAAK,IAAK,GAAG,GAAK,EAAK,SAAS,CAAI,CAClF,CAEA,SAAgB,EAAY,EAAuB,CACjD,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAgB,EAAY,EAAuB,CACjD,QAAQ,OAAO,MAAM,CAAO,CAC9B"}

package/dist/thresholdCheck.cjs

@@ -0,0 +1,2 @@
+"use strict";const e=require("./thresholds.cjs"),t=[`file`,`function`,`duplication`];function n(t,n,o){let l=s(n,new Set(t.map(({file:e})=>e))),u=[],d=0;for(let n of t){let{file:t,metrics:r,hunks:s}=n,f=o(r.language),p=s?.length===0?[]:a(e.fileThresholds,r,f);p.length>0&&u.push({kind:`file`,file:t,startLine:1,endLine:r.lines.total,exceeded:p});let m=i(n);d+=m.length;for(let n of m){let r=a(e.functionThresholds,n,f);if(r.length>0){let{startLine:e,endLine:i}=n;u.push({kind:`function`,file:t,startLine:e,endLine:i,name:n.name??`<anonymous>`,exceeded:r})}}u.push(...c(t,r,l.get(t)??[],s,f[e.duplicationThreshold.key]))}return{violations:u.toSorted(r),checkedFunctionCount:d}}function r(e,n){return d(e.file,n.file)||e.startLine-n.startLine||t.indexOf(e.kind)-t.indexOf(n.kind)||e.endLine-n.endLine}function i({metrics:e,hunks:t}){let n=e.language===`python`;return t?e.functions.filter(e=>t.some(t=>o(t,e.startLine,e.endLine,n))):e.functions}function a(t,n,r){return t.flatMap(t=>{let i=t.measure(n),a=r[t.key];return i>a?[{metric:e.metricNameOf(t),value:i,limit:a}]:[]})}function o(e,t,n,r=!1){return e.headCount===0?e.headStart>=t&&(e.headStart<n||r&&e.headStart===n):e.headStart<=n&&e.headStart+e.headCount>t}function s(e,t){let n=/* @__PURE__ */ new Map;for(let r of e?.groups??[])for(let e of r.files)if(t.has(e)){let t=n.get(e)??[];t.push(r),n.set(e,t)}return n}function c(t,n,r,i,a){let s=[...n.duplication.duplicateBlockGroups.map(e=>e.map(e=>({...e,file:t}))),...r.map(e=>e.occurrences)],c=n=>n.file===t&&e.duplicationThreshold.measure(n)>=a&&(!i||i.some(e=>e.headCount>0&&o(e,n.startLine,n.endLine))),d=/* @__PURE__ */ new Map;for(let e of s)for(let t of e.filter(e=>c(e)))d.set(t,e);return l([...d.keys()]).map(({merged:t,sources:n})=>({kind:`duplication`,...t,exceeded:[{metric:e.metricNameOf(e.duplicationThreshold),value:e.duplicationThreshold.measure(t),limit:a}],partners:l(n.flatMap(e=>d.get(e)??[])).map(e=>e.merged).filter(e=>!u(e,t))}))}function l(e){let t=[],n=e.toSorted((e,t)=>d(e.file,t.file)||e.startLine-t.startLine);for(let e of n){let n=t.at(-1);if(n&&u(n.merged,e))n.merged.endLine=Math.max(n.merged.endLine,e.endLine),n.sources.push(e);else{let{file:n,startLine:r,endLine:i}=e;t.push({merged:{file:n,startLine:r,endLine:i},sources:[e]})}}return t}function u(e,t){return e.file===t.file&&e.startLine<=t.endLine&&t.startLine<=e.endLine}function d(e,t){return e<t?-1:+(e>t)}exports.checkThresholds=n;
+//# sourceMappingURL=thresholdCheck.cjs.map

package/dist/thresholdCheck.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"thresholdCheck.cjs","names":["fileThresholds","functionThresholds","duplicationThreshold","metricNameOf"],"sources":["../src/thresholdCheck.ts"],"sourcesContent":["import type { CrossFileDuplicateBlockGroup, CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport type { LineHunk } from './git.js';\nimport {\n  duplicationThreshold,\n  fileThresholds,\n  functionThresholds,\n  metricNameOf,\n  type Limits,\n  type Threshold,\n} from './thresholds.js';\nimport type { CodeMetrics, FunctionMetrics } from './types.js';\n\n/** A measured file to check, under the path cross-file duplication knows it by. */\nexport interface CheckedFile {\n  file: string;\n  metrics: CodeMetrics;\n  /** The change to the file; when set, only what the change touches is checked. */\n  hunks?: readonly LineHunk[];\n}\n\nexport interface ExceededLimit {\n  metric: string;\n  value: number;\n  /** The value is allowed up to this limit; a duplicated block is allowed below it. */\n  limit: number;\n}\n\nexport interface BlockLocation {\n  file: string;\n  startLine: number;\n  endLine: number;\n}\n\nexport interface Violation extends BlockLocation {\n  kind: 'function' | 'file' | 'duplication';\n  /** The function's name, for kind `function`. */\n  name?: string;\n  exceeded: ExceededLimit[];\n  /** The other copies of the block, for kind `duplication`. */\n  partners?: BlockLocation[];\n}\n\nexport interface CheckResult {\n  violations: Violation[];\n  checkedFunctionCount: number;\n}\n\nconst violationKinds: readonly Violation['kind'][] = ['file', 'function', 'duplication'];\n\n/** Every limit the files exceed, ordered by path, then line. */\nexport function checkThresholds(\n  files: readonly CheckedFile[],\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  limitsOf: (language: string) => Limits\n): CheckResult {\n  const crossFileGroupsByFile = indexGroupsByFile(crossFileDuplication, new Set(files.map(({ file }) => file)));\n  const violations: Violation[] = [];\n  let checkedFunctionCount = 0;\n  for (const checkedFile of files) {\n    const { file, metrics, hunks } = checkedFile;\n    const limits = limitsOf(metrics.language);\n    // A rename or a mode change lists the file as changed without touching any of its lines.\n    const fileExceeded = hunks?.length === 0 ? [] : collectExceeded(fileThresholds, metrics, limits);\n    if (fileExceeded.length > 0) {\n      violations.push({ kind: 'file', file, startLine: 1, endLine: metrics.lines.total, exceeded: fileExceeded });\n    }\n    const checkedFunctions = listCheckedFunctions(checkedFile);\n    checkedFunctionCount += checkedFunctions.length;\n    for (const fn of checkedFunctions) {\n      const exceeded = collectExceeded(functionThresholds, fn, limits);\n      if (exceeded.length > 0) {\n        const { startLine, endLine } = fn;\n        violations.push({ kind: 'function', file, startLine, endLine, name: fn.name ?? '<anonymous>', exceeded });\n      }\n    }\n    violations.push(\n      ...collectDuplicationViolations(\n        file,\n        metrics,\n        crossFileGroupsByFile.get(file) ?? [],\n        hunks,\n        limits[duplicationThreshold.key] as number\n      )\n    );\n  }\n  return { violations: violations.toSorted(compareViolations), checkedFunctionCount };\n}\n\n// The kind is compared before the end line because a file violation's end line is corrected after\n// this ordering (to the last line that exists), and the order must not depend on that correction.\nfunction compareViolations(left: Violation, right: Violation): number {\n  return (\n    compareStrings(left.file, right.file) ||\n    left.startLine - right.startLine ||\n    violationKinds.indexOf(left.kind) - violationKinds.indexOf(right.kind) ||\n    left.endLine - right.endLine\n  );\n}\n\n/** The file's functions or, for a changed file, those the change touches. */\nfunction listCheckedFunctions({ metrics, hunks }: CheckedFile): FunctionMetrics[] {\n  const endsByIndentation = metrics.language === 'python';\n  return hunks\n    ? metrics.functions.filter((fn) =>\n        hunks.some((hunk) => touchesSpan(hunk, fn.startLine, fn.endLine, endsByIndentation))\n      )\n    : metrics.functions;\n}\n\nfunction collectExceeded<Subject>(\n  thresholds: readonly Threshold<Subject>[],\n  subject: Subject,\n  limits: Limits\n): ExceededLimit[] {\n  return thresholds.flatMap((threshold) => {\n    const value = threshold.measure(subject);\n    const limit = limits[threshold.key] as number;\n    return value > limit ? [{ metric: metricNameOf(threshold), value, limit }] : [];\n  });\n}\n\n/**\n * Whether the hunk changes the head lines [startLine, endLine]. A hunk without head lines (a pure\n * deletion) sits between its headStart line and the next one. Where indentation ends a span, its\n * last line is a statement rather than a closing delimiter, so a deletion right after that line may\n * have removed the span's tail; `endsByIndentation` counts it as touching, since the head alone\n * cannot tell it from a deletion after the span.\n */\nfunction touchesSpan(hunk: LineHunk, startLine: number, endLine: number, endsByIndentation = false): boolean {\n  return hunk.headCount === 0\n    ? hunk.headStart >= startLine && (hunk.headStart < endLine || (endsByIndentation && hunk.headStart === endLine))\n    : hunk.headStart <= endLine && hunk.headStart + hunk.headCount > startLine;\n}\n\n/** The cross-file groups with an occurrence in each of the given files. */\nfunction indexGroupsByFile(\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  files: ReadonlySet<string>\n): Map<string, CrossFileDuplicateBlockGroup[]> {\n  const groupsByFile = new Map<string, CrossFileDuplicateBlockGroup[]>();\n  for (const group of crossFileDuplication?.groups ?? []) {\n    for (const file of group.files) {\n      if (files.has(file)) {\n        const groups = groupsByFile.get(file) ?? [];\n        groups.push(group);\n        groupsByFile.set(file, groups);\n      }\n    }\n  }\n  return groupsByFile;\n}\n\n/**\n * One violation per duplicated region of the file: its clone occurrences, within-file and\n * cross-file, that span at least `minLines` (with `hunks`, only those overlapping added lines),\n * with overlapping occurrences merged into one region.\n */\nfunction collectDuplicationViolations(\n  file: string,\n  metrics: CodeMetrics,\n  crossFileGroups: readonly CrossFileDuplicateBlockGroup[],\n  hunks: readonly LineHunk[] | undefined,\n  minLines: number\n): Violation[] {\n  const groups: BlockLocation[][] = [\n    ...metrics.duplication.duplicateBlockGroups.map((group) => group.map((occurrence) => ({ ...occurrence, file }))),\n    ...crossFileGroups.map((group) => group.occurrences),\n  ];\n  const isReported = (block: BlockLocation): boolean =>\n    block.file === file &&\n    duplicationThreshold.measure(block) >= minLines &&\n    (!hunks || hunks.some((hunk) => hunk.headCount > 0 && touchesSpan(hunk, block.startLine, block.endLine)));\n  const copiesByBlock = new Map<BlockLocation, BlockLocation[]>();\n  for (const group of groups) {\n    for (const block of group.filter((occurrence) => isReported(occurrence))) {\n      copiesByBlock.set(block, group);\n    }\n  }\n  return mergeOverlapping([...copiesByBlock.keys()]).map(({ merged, sources }) => ({\n    kind: 'duplication',\n    ...merged,\n    exceeded: [\n      { metric: metricNameOf(duplicationThreshold), value: duplicationThreshold.measure(merged), limit: minLines },\n    ],\n    // The region's own occurrences are among the copies of the groups it belongs to.\n    partners: mergeOverlapping(sources.flatMap((source) => copiesByBlock.get(source) ?? []))\n      .map((partner) => partner.merged)\n      .filter((partner) => !overlaps(partner, merged)),\n  }));\n}\n\n/** The locations with those overlapping in the same file merged, ordered by file, then line. */\nfunction mergeOverlapping(locations: readonly BlockLocation[]): { merged: BlockLocation; sources: BlockLocation[] }[] {\n  const regions: { merged: BlockLocation; sources: BlockLocation[] }[] = [];\n  const ordered = locations.toSorted(\n    (left, right) => compareStrings(left.file, right.file) || left.startLine - right.startLine\n  );\n  for (const location of ordered) {\n    const last = regions.at(-1);\n    if (last && overlaps(last.merged, location)) {\n      last.merged.endLine = Math.max(last.merged.endLine, location.endLine);\n      last.sources.push(location);\n    } else {\n      const { file, startLine, endLine } = location;\n      regions.push({ merged: { file, startLine, endLine }, sources: [location] });\n    }\n  }\n  return regions;\n}\n\nfunction overlaps(left: BlockLocation, right: BlockLocation): boolean {\n  return left.file === right.file && left.startLine <= right.endLine && right.startLine <= left.endLine;\n}\n\n/** Code-unit order, so reports do not depend on the locale. */\nfunction compareStrings(left: string, right: string): number {\n  return left < right ? -1 : left > right ? 1 : 0;\n}\n"],"mappings":"iDA+CM,EAA+C,CAAC,OAAQ,WAAY,aAAa,EAGvF,SAAgB,EACd,EACA,EACA,EACa,CACb,IAAM,EAAwB,EAAkB,EAAsB,IAAI,IAAI,EAAM,KAAK,CAAE,UAAW,CAAI,CAAC,CAAC,EACtG,EAA0B,CAAC,EAC7B,EAAuB,EAC3B,IAAK,IAAM,KAAe,EAAO,CAC/B,GAAM,CAAE,OAAM,UAAS,SAAU,EAC3B,EAAS,EAAS,EAAQ,QAAQ,EAElC,EAAe,GAAO,SAAW,EAAI,CAAC,EAAI,EAAgBA,EAAAA,eAAgB,EAAS,CAAM,EAC3F,EAAa,OAAS,GACxB,EAAW,KAAK,CAAE,KAAM,OAAQ,OAAM,UAAW,EAAG,QAAS,EAAQ,MAAM,MAAO,SAAU,CAAa,CAAC,EAE5G,IAAM,EAAmB,EAAqB,CAAW,EACzD,GAAwB,EAAiB,OACzC,IAAK,IAAM,KAAM,EAAkB,CACjC,IAAM,EAAW,EAAgBC,EAAAA,mBAAoB,EAAI,CAAM,EAC/D,GAAI,EAAS,OAAS,EAAG,CACvB,GAAM,CAAE,YAAW,WAAY,EAC/B,EAAW,KAAK,CAAE,KAAM,WAAY,OAAM,YAAW,UAAS,KAAM,EAAG,MAAQ,cAAe,UAAS,CAAC,CAC1G,CACF,CACA,EAAW,KACT,GAAG,EACD,EACA,EACA,EAAsB,IAAI,CAAI,GAAK,CAAC,EACpC,EACA,EAAOC,EAAAA,qBAAqB,IAC9B,CACF,CACF,CACA,MAAO,CAAE,WAAY,EAAW,SAAS,CAAiB,EAAG,sBAAqB,CACpF,CAIA,SAAS,EAAkB,EAAiB,EAA0B,CACpE,OACE,EAAe,EAAK,KAAM,EAAM,IAAI,GACpC,EAAK,UAAY,EAAM,WACvB,EAAe,QAAQ,EAAK,IAAI,EAAI,EAAe,QAAQ,EAAM,IAAI,GACrE,EAAK,QAAU,EAAM,OAEzB,CAGA,SAAS,EAAqB,CAAE,UAAS,SAAyC,CAChF,IAAM,EAAoB,EAAQ,WAAa,SAC/C,OAAO,EACH,EAAQ,UAAU,OAAQ,GACxB,EAAM,KAAM,GAAS,EAAY,EAAM,EAAG,UAAW,EAAG,QAAS,CAAiB,CAAC,CACrF,EACA,EAAQ,SACd,CAEA,SAAS,EACP,EACA,EACA,EACiB,CACjB,OAAO,EAAW,QAAS,GAAc,CACvC,IAAM,EAAQ,EAAU,QAAQ,CAAO,EACjC,EAAQ,EAAO,EAAU,KAC/B,OAAO,EAAQ,EAAQ,CAAC,CAAE,OAAQC,EAAAA,aAAa,CAAS,EAAG,QAAO,OAAM,CAAC,EAAI,CAAC,CAChF,CAAC,CACH,CASA,SAAS,EAAY,EAAgB,EAAmB,EAAiB,EAAoB,GAAgB,CAC3G,OAAO,EAAK,YAAc,EACtB,EAAK,WAAa,IAAc,EAAK,UAAY,GAAY,GAAqB,EAAK,YAAc,GACrG,EAAK,WAAa,GAAW,EAAK,UAAY,EAAK,UAAY,CACrE,CAGA,SAAS,EACP,EACA,EAC6C,CAC7C,IAAM,kBAAe,IAAI,IACzB,IAAK,IAAM,KAAS,GAAsB,QAAU,CAAC,EACnD,IAAK,IAAM,KAAQ,EAAM,MACvB,GAAI,EAAM,IAAI,CAAI,EAAG,CACnB,IAAM,EAAS,EAAa,IAAI,CAAI,GAAK,CAAC,EAC1C,EAAO,KAAK,CAAK,EACjB,EAAa,IAAI,EAAM,CAAM,CAC/B,CAGJ,OAAO,CACT,CAOA,SAAS,EACP,EACA,EACA,EACA,EACA,EACa,CACb,IAAM,EAA4B,CAChC,GAAG,EAAQ,YAAY,qBAAqB,IAAK,GAAU,EAAM,IAAK,IAAgB,CAAE,GAAG,EAAY,MAAK,EAAE,CAAC,EAC/G,GAAG,EAAgB,IAAK,GAAU,EAAM,WAAW,CACrD,EACM,EAAc,GAClB,EAAM,OAAS,GACfD,EAAAA,qBAAqB,QAAQ,CAAK,GAAK,IACtC,CAAC,GAAS,EAAM,KAAM,GAAS,EAAK,UAAY,GAAK,EAAY,EAAM,EAAM,UAAW,EAAM,OAAO,CAAC,GACnG,kBAAgB,IAAI,IAC1B,IAAK,IAAM,KAAS,EAClB,IAAK,IAAM,KAAS,EAAM,OAAQ,GAAe,EAAW,CAAU,CAAC,EACrE,EAAc,IAAI,EAAO,CAAK,EAGlC,OAAO,EAAiB,CAAC,GAAG,EAAc,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAE,SAAQ,cAAe,CAC/E,KAAM,cACN,GAAG,EACH,SAAU,CACR,CAAE,OAAQC,EAAAA,aAAaD,EAAAA,oBAAoB,EAAG,MAAOA,EAAAA,qBAAqB,QAAQ,CAAM,EAAG,MAAO,CAAS,CAC7G,EAEA,SAAU,EAAiB,EAAQ,QAAS,GAAW,EAAc,IAAI,CAAM,GAAK,CAAC,CAAC,CAAC,CAAC,CACrF,IAAK,GAAY,EAAQ,MAAM,CAAC,CAChC,OAAQ,GAAY,CAAC,EAAS,EAAS,CAAM,CAAC,CACnD,EAAE,CACJ,CAGA,SAAS,EAAiB,EAA4F,CACpH,IAAM,EAAiE,CAAC,EAClE,EAAU,EAAU,UACvB,EAAM,IAAU,EAAe,EAAK,KAAM,EAAM,IAAI,GAAK,EAAK,UAAY,EAAM,SACnF,EACA,IAAK,IAAM,KAAY,EAAS,CAC9B,IAAM,EAAO,EAAQ,GAAG,EAAE,EAC1B,GAAI,GAAQ,EAAS,EAAK,OAAQ,CAAQ,EACxC,EAAK,OAAO,QAAU,KAAK,IAAI,EAAK,OAAO,QAAS,EAAS,OAAO,EACpE,EAAK,QAAQ,KAAK,CAAQ,MACrB,CACL,GAAM,CAAE,OAAM,YAAW,WAAY,EACrC,EAAQ,KAAK,CAAE,OAAQ,CAAE,OAAM,YAAW,SAAQ,EAAG,QAAS,CAAC,CAAQ,CAAE,CAAC,CAC5E,CACF,CACA,OAAO,CACT,CAEA,SAAS,EAAS,EAAqB,EAA+B,CACpE,OAAO,EAAK,OAAS,EAAM,MAAQ,EAAK,WAAa,EAAM,SAAW,EAAM,WAAa,EAAK,OAChG,CAGA,SAAS,EAAe,EAAc,EAAuB,CAC3D,OAAO,EAAO,EAAQ,GAAK,IAAO,EACpC"}

package/dist/thresholdCheck.d.ts

@@ -0,0 +1,36 @@
+import type { CrossFileDuplicationMetrics } from './crossFileDuplication.js';
+import type { LineHunk } from './git.js';
+import { type Limits } from './thresholds.js';
+import type { CodeMetrics } from './types.js';
+/** A measured file to check, under the path cross-file duplication knows it by. */
+export interface CheckedFile {
+    file: string;
+    metrics: CodeMetrics;
+    /** The change to the file; when set, only what the change touches is checked. */
+    hunks?: readonly LineHunk[];
+}
+export interface ExceededLimit {
+    metric: string;
+    value: number;
+    /** The value is allowed up to this limit; a duplicated block is allowed below it. */
+    limit: number;
+}
+export interface BlockLocation {
+    file: string;
+    startLine: number;
+    endLine: number;
+}
+export interface Violation extends BlockLocation {
+    kind: 'function' | 'file' | 'duplication';
+    /** The function's name, for kind `function`. */
+    name?: string;
+    exceeded: ExceededLimit[];
+    /** The other copies of the block, for kind `duplication`. */
+    partners?: BlockLocation[];
+}
+export interface CheckResult {
+    violations: Violation[];
+    checkedFunctionCount: number;
+}
+/** Every limit the files exceed, ordered by path, then line. */
+export declare function checkThresholds(files: readonly CheckedFile[], crossFileDuplication: CrossFileDuplicationMetrics | undefined, limitsOf: (language: string) => Limits): CheckResult;

package/dist/thresholdCheck.js

@@ -0,0 +1,2 @@
+import{duplicationThreshold as e,fileThresholds as t,functionThresholds as n,metricNameOf as r}from"./thresholds.js";const i=[`file`,`function`,`duplication`];function a(r,i,a){let l=u(i,new Set(r.map(({file:e})=>e))),f=[],p=0;for(let i of r){let{file:r,metrics:o,hunks:u}=i,m=a(o.language),h=u?.length===0?[]:c(t,o,m);h.length>0&&f.push({kind:`file`,file:r,startLine:1,endLine:o.lines.total,exceeded:h});let g=s(i);p+=g.length;for(let e of g){let t=c(n,e,m);if(t.length>0){let{startLine:n,endLine:i}=e;f.push({kind:`function`,file:r,startLine:n,endLine:i,name:e.name??`<anonymous>`,exceeded:t})}}f.push(...d(r,o,l.get(r)??[],u,m[e.key]))}return{violations:f.toSorted(o),checkedFunctionCount:p}}function o(e,t){return m(e.file,t.file)||e.startLine-t.startLine||i.indexOf(e.kind)-i.indexOf(t.kind)||e.endLine-t.endLine}function s({metrics:e,hunks:t}){let n=e.language===`python`;return t?e.functions.filter(e=>t.some(t=>l(t,e.startLine,e.endLine,n))):e.functions}function c(e,t,n){return e.flatMap(e=>{let i=e.measure(t),a=n[e.key];return i>a?[{metric:r(e),value:i,limit:a}]:[]})}function l(e,t,n,r=!1){return e.headCount===0?e.headStart>=t&&(e.headStart<n||r&&e.headStart===n):e.headStart<=n&&e.headStart+e.headCount>t}function u(e,t){let n=/* @__PURE__ */ new Map;for(let r of e?.groups??[])for(let e of r.files)if(t.has(e)){let t=n.get(e)??[];t.push(r),n.set(e,t)}return n}function d(t,n,i,a,o){let s=[...n.duplication.duplicateBlockGroups.map(e=>e.map(e=>({...e,file:t}))),...i.map(e=>e.occurrences)],c=n=>n.file===t&&e.measure(n)>=o&&(!a||a.some(e=>e.headCount>0&&l(e,n.startLine,n.endLine))),u=/* @__PURE__ */ new Map;for(let e of s)for(let t of e.filter(e=>c(e)))u.set(t,e);return f([...u.keys()]).map(({merged:t,sources:n})=>({kind:`duplication`,...t,exceeded:[{metric:r(e),value:e.measure(t),limit:o}],partners:f(n.flatMap(e=>u.get(e)??[])).map(e=>e.merged).filter(e=>!p(e,t))}))}function f(e){let t=[],n=e.toSorted((e,t)=>m(e.file,t.file)||e.startLine-t.startLine);for(let e of n){let n=t.at(-1);if(n&&p(n.merged,e))n.merged.endLine=Math.max(n.merged.endLine,e.endLine),n.sources.push(e);else{let{file:n,startLine:r,endLine:i}=e;t.push({merged:{file:n,startLine:r,endLine:i},sources:[e]})}}return t}function p(e,t){return e.file===t.file&&e.startLine<=t.endLine&&t.startLine<=e.endLine}function m(e,t){return e<t?-1:+(e>t)}export{a as checkThresholds};
+//# sourceMappingURL=thresholdCheck.js.map

package/dist/thresholdCheck.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"thresholdCheck.js","names":[],"sources":["../src/thresholdCheck.ts"],"sourcesContent":["import type { CrossFileDuplicateBlockGroup, CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport type { LineHunk } from './git.js';\nimport {\n  duplicationThreshold,\n  fileThresholds,\n  functionThresholds,\n  metricNameOf,\n  type Limits,\n  type Threshold,\n} from './thresholds.js';\nimport type { CodeMetrics, FunctionMetrics } from './types.js';\n\n/** A measured file to check, under the path cross-file duplication knows it by. */\nexport interface CheckedFile {\n  file: string;\n  metrics: CodeMetrics;\n  /** The change to the file; when set, only what the change touches is checked. */\n  hunks?: readonly LineHunk[];\n}\n\nexport interface ExceededLimit {\n  metric: string;\n  value: number;\n  /** The value is allowed up to this limit; a duplicated block is allowed below it. */\n  limit: number;\n}\n\nexport interface BlockLocation {\n  file: string;\n  startLine: number;\n  endLine: number;\n}\n\nexport interface Violation extends BlockLocation {\n  kind: 'function' | 'file' | 'duplication';\n  /** The function's name, for kind `function`. */\n  name?: string;\n  exceeded: ExceededLimit[];\n  /** The other copies of the block, for kind `duplication`. */\n  partners?: BlockLocation[];\n}\n\nexport interface CheckResult {\n  violations: Violation[];\n  checkedFunctionCount: number;\n}\n\nconst violationKinds: readonly Violation['kind'][] = ['file', 'function', 'duplication'];\n\n/** Every limit the files exceed, ordered by path, then line. */\nexport function checkThresholds(\n  files: readonly CheckedFile[],\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  limitsOf: (language: string) => Limits\n): CheckResult {\n  const crossFileGroupsByFile = indexGroupsByFile(crossFileDuplication, new Set(files.map(({ file }) => file)));\n  const violations: Violation[] = [];\n  let checkedFunctionCount = 0;\n  for (const checkedFile of files) {\n    const { file, metrics, hunks } = checkedFile;\n    const limits = limitsOf(metrics.language);\n    // A rename or a mode change lists the file as changed without touching any of its lines.\n    const fileExceeded = hunks?.length === 0 ? [] : collectExceeded(fileThresholds, metrics, limits);\n    if (fileExceeded.length > 0) {\n      violations.push({ kind: 'file', file, startLine: 1, endLine: metrics.lines.total, exceeded: fileExceeded });\n    }\n    const checkedFunctions = listCheckedFunctions(checkedFile);\n    checkedFunctionCount += checkedFunctions.length;\n    for (const fn of checkedFunctions) {\n      const exceeded = collectExceeded(functionThresholds, fn, limits);\n      if (exceeded.length > 0) {\n        const { startLine, endLine } = fn;\n        violations.push({ kind: 'function', file, startLine, endLine, name: fn.name ?? '<anonymous>', exceeded });\n      }\n    }\n    violations.push(\n      ...collectDuplicationViolations(\n        file,\n        metrics,\n        crossFileGroupsByFile.get(file) ?? [],\n        hunks,\n        limits[duplicationThreshold.key] as number\n      )\n    );\n  }\n  return { violations: violations.toSorted(compareViolations), checkedFunctionCount };\n}\n\n// The kind is compared before the end line because a file violation's end line is corrected after\n// this ordering (to the last line that exists), and the order must not depend on that correction.\nfunction compareViolations(left: Violation, right: Violation): number {\n  return (\n    compareStrings(left.file, right.file) ||\n    left.startLine - right.startLine ||\n    violationKinds.indexOf(left.kind) - violationKinds.indexOf(right.kind) ||\n    left.endLine - right.endLine\n  );\n}\n\n/** The file's functions or, for a changed file, those the change touches. */\nfunction listCheckedFunctions({ metrics, hunks }: CheckedFile): FunctionMetrics[] {\n  const endsByIndentation = metrics.language === 'python';\n  return hunks\n    ? metrics.functions.filter((fn) =>\n        hunks.some((hunk) => touchesSpan(hunk, fn.startLine, fn.endLine, endsByIndentation))\n      )\n    : metrics.functions;\n}\n\nfunction collectExceeded<Subject>(\n  thresholds: readonly Threshold<Subject>[],\n  subject: Subject,\n  limits: Limits\n): ExceededLimit[] {\n  return thresholds.flatMap((threshold) => {\n    const value = threshold.measure(subject);\n    const limit = limits[threshold.key] as number;\n    return value > limit ? [{ metric: metricNameOf(threshold), value, limit }] : [];\n  });\n}\n\n/**\n * Whether the hunk changes the head lines [startLine, endLine]. A hunk without head lines (a pure\n * deletion) sits between its headStart line and the next one. Where indentation ends a span, its\n * last line is a statement rather than a closing delimiter, so a deletion right after that line may\n * have removed the span's tail; `endsByIndentation` counts it as touching, since the head alone\n * cannot tell it from a deletion after the span.\n */\nfunction touchesSpan(hunk: LineHunk, startLine: number, endLine: number, endsByIndentation = false): boolean {\n  return hunk.headCount === 0\n    ? hunk.headStart >= startLine && (hunk.headStart < endLine || (endsByIndentation && hunk.headStart === endLine))\n    : hunk.headStart <= endLine && hunk.headStart + hunk.headCount > startLine;\n}\n\n/** The cross-file groups with an occurrence in each of the given files. */\nfunction indexGroupsByFile(\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  files: ReadonlySet<string>\n): Map<string, CrossFileDuplicateBlockGroup[]> {\n  const groupsByFile = new Map<string, CrossFileDuplicateBlockGroup[]>();\n  for (const group of crossFileDuplication?.groups ?? []) {\n    for (const file of group.files) {\n      if (files.has(file)) {\n        const groups = groupsByFile.get(file) ?? [];\n        groups.push(group);\n        groupsByFile.set(file, groups);\n      }\n    }\n  }\n  return groupsByFile;\n}\n\n/**\n * One violation per duplicated region of the file: its clone occurrences, within-file and\n * cross-file, that span at least `minLines` (with `hunks`, only those overlapping added lines),\n * with overlapping occurrences merged into one region.\n */\nfunction collectDuplicationViolations(\n  file: string,\n  metrics: CodeMetrics,\n  crossFileGroups: readonly CrossFileDuplicateBlockGroup[],\n  hunks: readonly LineHunk[] | undefined,\n  minLines: number\n): Violation[] {\n  const groups: BlockLocation[][] = [\n    ...metrics.duplication.duplicateBlockGroups.map((group) => group.map((occurrence) => ({ ...occurrence, file }))),\n    ...crossFileGroups.map((group) => group.occurrences),\n  ];\n  const isReported = (block: BlockLocation): boolean =>\n    block.file === file &&\n    duplicationThreshold.measure(block) >= minLines &&\n    (!hunks || hunks.some((hunk) => hunk.headCount > 0 && touchesSpan(hunk, block.startLine, block.endLine)));\n  const copiesByBlock = new Map<BlockLocation, BlockLocation[]>();\n  for (const group of groups) {\n    for (const block of group.filter((occurrence) => isReported(occurrence))) {\n      copiesByBlock.set(block, group);\n    }\n  }\n  return mergeOverlapping([...copiesByBlock.keys()]).map(({ merged, sources }) => ({\n    kind: 'duplication',\n    ...merged,\n    exceeded: [\n      { metric: metricNameOf(duplicationThreshold), value: duplicationThreshold.measure(merged), limit: minLines },\n    ],\n    // The region's own occurrences are among the copies of the groups it belongs to.\n    partners: mergeOverlapping(sources.flatMap((source) => copiesByBlock.get(source) ?? []))\n      .map((partner) => partner.merged)\n      .filter((partner) => !overlaps(partner, merged)),\n  }));\n}\n\n/** The locations with those overlapping in the same file merged, ordered by file, then line. */\nfunction mergeOverlapping(locations: readonly BlockLocation[]): { merged: BlockLocation; sources: BlockLocation[] }[] {\n  const regions: { merged: BlockLocation; sources: BlockLocation[] }[] = [];\n  const ordered = locations.toSorted(\n    (left, right) => compareStrings(left.file, right.file) || left.startLine - right.startLine\n  );\n  for (const location of ordered) {\n    const last = regions.at(-1);\n    if (last && overlaps(last.merged, location)) {\n      last.merged.endLine = Math.max(last.merged.endLine, location.endLine);\n      last.sources.push(location);\n    } else {\n      const { file, startLine, endLine } = location;\n      regions.push({ merged: { file, startLine, endLine }, sources: [location] });\n    }\n  }\n  return regions;\n}\n\nfunction overlaps(left: BlockLocation, right: BlockLocation): boolean {\n  return left.file === right.file && left.startLine <= right.endLine && right.startLine <= left.endLine;\n}\n\n/** Code-unit order, so reports do not depend on the locale. */\nfunction compareStrings(left: string, right: string): number {\n  return left < right ? -1 : left > right ? 1 : 0;\n}\n"],"mappings":"qHA+CA,MAAM,EAA+C,CAAC,OAAQ,WAAY,aAAa,EAGvF,SAAgB,EACd,EACA,EACA,EACa,CACb,IAAM,EAAwB,EAAkB,EAAsB,IAAI,IAAI,EAAM,KAAK,CAAE,UAAW,CAAI,CAAC,CAAC,EACtG,EAA0B,CAAC,EAC7B,EAAuB,EAC3B,IAAK,IAAM,KAAe,EAAO,CAC/B,GAAM,CAAE,OAAM,UAAS,SAAU,EAC3B,EAAS,EAAS,EAAQ,QAAQ,EAElC,EAAe,GAAO,SAAW,EAAI,CAAC,EAAI,EAAgB,EAAgB,EAAS,CAAM,EAC3F,EAAa,OAAS,GACxB,EAAW,KAAK,CAAE,KAAM,OAAQ,OAAM,UAAW,EAAG,QAAS,EAAQ,MAAM,MAAO,SAAU,CAAa,CAAC,EAE5G,IAAM,EAAmB,EAAqB,CAAW,EACzD,GAAwB,EAAiB,OACzC,IAAK,IAAM,KAAM,EAAkB,CACjC,IAAM,EAAW,EAAgB,EAAoB,EAAI,CAAM,EAC/D,GAAI,EAAS,OAAS,EAAG,CACvB,GAAM,CAAE,YAAW,WAAY,EAC/B,EAAW,KAAK,CAAE,KAAM,WAAY,OAAM,YAAW,UAAS,KAAM,EAAG,MAAQ,cAAe,UAAS,CAAC,CAC1G,CACF,CACA,EAAW,KACT,GAAG,EACD,EACA,EACA,EAAsB,IAAI,CAAI,GAAK,CAAC,EACpC,EACA,EAAO,EAAqB,IAC9B,CACF,CACF,CACA,MAAO,CAAE,WAAY,EAAW,SAAS,CAAiB,EAAG,sBAAqB,CACpF,CAIA,SAAS,EAAkB,EAAiB,EAA0B,CACpE,OACE,EAAe,EAAK,KAAM,EAAM,IAAI,GACpC,EAAK,UAAY,EAAM,WACvB,EAAe,QAAQ,EAAK,IAAI,EAAI,EAAe,QAAQ,EAAM,IAAI,GACrE,EAAK,QAAU,EAAM,OAEzB,CAGA,SAAS,EAAqB,CAAE,UAAS,SAAyC,CAChF,IAAM,EAAoB,EAAQ,WAAa,SAC/C,OAAO,EACH,EAAQ,UAAU,OAAQ,GACxB,EAAM,KAAM,GAAS,EAAY,EAAM,EAAG,UAAW,EAAG,QAAS,CAAiB,CAAC,CACrF,EACA,EAAQ,SACd,CAEA,SAAS,EACP,EACA,EACA,EACiB,CACjB,OAAO,EAAW,QAAS,GAAc,CACvC,IAAM,EAAQ,EAAU,QAAQ,CAAO,EACjC,EAAQ,EAAO,EAAU,KAC/B,OAAO,EAAQ,EAAQ,CAAC,CAAE,OAAQ,EAAa,CAAS,EAAG,QAAO,OAAM,CAAC,EAAI,CAAC,CAChF,CAAC,CACH,CASA,SAAS,EAAY,EAAgB,EAAmB,EAAiB,EAAoB,GAAgB,CAC3G,OAAO,EAAK,YAAc,EACtB,EAAK,WAAa,IAAc,EAAK,UAAY,GAAY,GAAqB,EAAK,YAAc,GACrG,EAAK,WAAa,GAAW,EAAK,UAAY,EAAK,UAAY,CACrE,CAGA,SAAS,EACP,EACA,EAC6C,CAC7C,IAAM,kBAAe,IAAI,IACzB,IAAK,IAAM,KAAS,GAAsB,QAAU,CAAC,EACnD,IAAK,IAAM,KAAQ,EAAM,MACvB,GAAI,EAAM,IAAI,CAAI,EAAG,CACnB,IAAM,EAAS,EAAa,IAAI,CAAI,GAAK,CAAC,EAC1C,EAAO,KAAK,CAAK,EACjB,EAAa,IAAI,EAAM,CAAM,CAC/B,CAGJ,OAAO,CACT,CAOA,SAAS,EACP,EACA,EACA,EACA,EACA,EACa,CACb,IAAM,EAA4B,CAChC,GAAG,EAAQ,YAAY,qBAAqB,IAAK,GAAU,EAAM,IAAK,IAAgB,CAAE,GAAG,EAAY,MAAK,EAAE,CAAC,EAC/G,GAAG,EAAgB,IAAK,GAAU,EAAM,WAAW,CACrD,EACM,EAAc,GAClB,EAAM,OAAS,GACf,EAAqB,QAAQ,CAAK,GAAK,IACtC,CAAC,GAAS,EAAM,KAAM,GAAS,EAAK,UAAY,GAAK,EAAY,EAAM,EAAM,UAAW,EAAM,OAAO,CAAC,GACnG,kBAAgB,IAAI,IAC1B,IAAK,IAAM,KAAS,EAClB,IAAK,IAAM,KAAS,EAAM,OAAQ,GAAe,EAAW,CAAU,CAAC,EACrE,EAAc,IAAI,EAAO,CAAK,EAGlC,OAAO,EAAiB,CAAC,GAAG,EAAc,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAE,SAAQ,cAAe,CAC/E,KAAM,cACN,GAAG,EACH,SAAU,CACR,CAAE,OAAQ,EAAa,CAAoB,EAAG,MAAO,EAAqB,QAAQ,CAAM,EAAG,MAAO,CAAS,CAC7G,EAEA,SAAU,EAAiB,EAAQ,QAAS,GAAW,EAAc,IAAI,CAAM,GAAK,CAAC,CAAC,CAAC,CAAC,CACrF,IAAK,GAAY,EAAQ,MAAM,CAAC,CAChC,OAAQ,GAAY,CAAC,EAAS,EAAS,CAAM,CAAC,CACnD,EAAE,CACJ,CAGA,SAAS,EAAiB,EAA4F,CACpH,IAAM,EAAiE,CAAC,EAClE,EAAU,EAAU,UACvB,EAAM,IAAU,EAAe,EAAK,KAAM,EAAM,IAAI,GAAK,EAAK,UAAY,EAAM,SACnF,EACA,IAAK,IAAM,KAAY,EAAS,CAC9B,IAAM,EAAO,EAAQ,GAAG,EAAE,EAC1B,GAAI,GAAQ,EAAS,EAAK,OAAQ,CAAQ,EACxC,EAAK,OAAO,QAAU,KAAK,IAAI,EAAK,OAAO,QAAS,EAAS,OAAO,EACpE,EAAK,QAAQ,KAAK,CAAQ,MACrB,CACL,GAAM,CAAE,OAAM,YAAW,WAAY,EACrC,EAAQ,KAAK,CAAE,OAAQ,CAAE,OAAM,YAAW,SAAQ,EAAG,QAAS,CAAC,CAAQ,CAAE,CAAC,CAC5E,CACF,CACA,OAAO,CACT,CAEA,SAAS,EAAS,EAAqB,EAA+B,CACpE,OAAO,EAAK,OAAS,EAAM,MAAQ,EAAK,WAAa,EAAM,SAAW,EAAM,WAAa,EAAK,OAChG,CAGA,SAAS,EAAe,EAAc,EAAuB,CAC3D,OAAO,EAAO,EAAQ,GAAK,IAAO,EACpC"}

package/dist/thresholds.cjs

@@ -0,0 +1,2 @@
+"use strict";const e=[{key:`maxFunctionCognitiveComplexity`,label:`cognitive complexity`,defaultLimit:15,hint:`flatten nested branching with early returns and extract nested blocks into named functions.`,measure:e=>e.cognitiveComplexity},{key:`maxFunctionCyclomaticComplexity`,label:`cyclomatic complexity`,defaultLimit:10,hint:`the function has too many independent paths; split it by decision or replace condition chains with a lookup table.`,measure:e=>e.cyclomaticComplexity},{key:`maxFunctionNcss`,label:`NCSS`,defaultLimit:60,hint:`split the function into smaller functions that each do one step.`,measure:e=>e.ncss},{key:`maxFunctionNestingDepth`,label:`nesting depth`,defaultLimit:4,hint:`replace nested conditions with guard clauses or move inner blocks into functions.`,measure:e=>e.nestingDepth},{key:`maxFunctionParameterCount`,label:`parameters`,defaultLimit:7,hint:`group related parameters into one object or split the function.`,measure:e=>e.parameterCount},{key:`maxFunctionHalsteadVolume`,label:`Halstead volume`,defaultLimit:2e3,hint:`the function holds too many operators and operands; move cohesive parts into helper functions.`,measure:e=>e.halstead.volume},{key:`maxFunctionHalsteadDifficulty`,label:`Halstead difficulty`,defaultLimit:20,hint:`the function reuses the same operands many times; split it so each part handles fewer values.`,measure:e=>e.halstead.difficulty},{key:`maxFunctionHalsteadEffort`,label:`Halstead effort`,defaultLimit:3e4,hint:`the function is both large and dense; split it into smaller functions with fewer values each.`,measure:e=>e.halstead.effort},{key:`maxFunctionDepDegree`,label:`DepDegree`,defaultLimit:50,hint:`too many values flow between the variables of the function; split it so each part works on fewer variables.`,measure:e=>e.depDegree}],t=[{key:`maxFileNcss`,label:`file NCSS`,defaultLimit:500,hint:`split the file into smaller modules with one responsibility each.`,measure:e=>e.ncssCount}],n={key:`minDuplicateLines`,label:`duplicated lines`,defaultLimit:10,hint:`extract the repeated code into one shared function or module and call it from every location.`,measure:e=>e.endLine-e.startLine+1},r=[...e,...t,n];function i(e){let t=e.key.slice(3);return t.charAt(0).toLowerCase()+t.slice(1)}function a(e,t){let n={...Object.fromEntries(r.map(({key:e,defaultLimit:t})=>[e,t])),...t?.limits};return r=>({...n,...t&&Object.hasOwn(t.languages,r)?t.languages[r]:void 0,...e})}exports.duplicationThreshold=n,exports.fileThresholds=t,exports.functionThresholds=e,exports.metricNameOf=i,exports.resolveLimits=a,exports.thresholds=r;
+//# sourceMappingURL=thresholds.cjs.map

package/dist/thresholds.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"thresholds.cjs","names":[],"sources":["../src/thresholds.ts"],"sourcesContent":["import type { CodeMetrics, FunctionMetrics } from './types.js';\n\n/**\n * One limit of `code-gauge check`. Its `key` is the config setting, the per-language override\n * setting, and (kebab-cased) the command-line option, so a new entry here is all a new thresholded\n * metric needs.\n */\nexport interface Threshold<Subject = never> {\n  key: string;\n  /** How the report names the measured value. */\n  label: string;\n  defaultLimit: number;\n  /** What to change in the code when the limit is exceeded. */\n  hint: string;\n  measure: (subject: Subject) => number;\n}\n\n/** Limits by threshold key; `Infinity` disables a limit. */\nexport type Limits = Readonly<Record<string, number>>;\n\nexport const functionThresholds: readonly Threshold<FunctionMetrics>[] = [\n  {\n    key: 'maxFunctionCognitiveComplexity',\n    label: 'cognitive complexity',\n    defaultLimit: 15,\n    hint: 'flatten nested branching with early returns and extract nested blocks into named functions.',\n    measure: (fn) => fn.cognitiveComplexity,\n  },\n  {\n    key: 'maxFunctionCyclomaticComplexity',\n    label: 'cyclomatic complexity',\n    defaultLimit: 10,\n    hint: 'the function has too many independent paths; split it by decision or replace condition chains with a lookup table.',\n    measure: (fn) => fn.cyclomaticComplexity,\n  },\n  {\n    key: 'maxFunctionNcss',\n    label: 'NCSS',\n    defaultLimit: 60,\n    hint: 'split the function into smaller functions that each do one step.',\n    measure: (fn) => fn.ncss,\n  },\n  {\n    key: 'maxFunctionNestingDepth',\n    label: 'nesting depth',\n    defaultLimit: 4,\n    hint: 'replace nested conditions with guard clauses or move inner blocks into functions.',\n    measure: (fn) => fn.nestingDepth,\n  },\n  {\n    key: 'maxFunctionParameterCount',\n    label: 'parameters',\n    defaultLimit: 7,\n    hint: 'group related parameters into one object or split the function.',\n    measure: (fn) => fn.parameterCount,\n  },\n  {\n    key: 'maxFunctionHalsteadVolume',\n    label: 'Halstead volume',\n    defaultLimit: 2000,\n    hint: 'the function holds too many operators and operands; move cohesive parts into helper functions.',\n    measure: (fn) => fn.halstead.volume,\n  },\n  {\n    key: 'maxFunctionHalsteadDifficulty',\n    label: 'Halstead difficulty',\n    defaultLimit: 20,\n    hint: 'the function reuses the same operands many times; split it so each part handles fewer values.',\n    measure: (fn) => fn.halstead.difficulty,\n  },\n  {\n    key: 'maxFunctionHalsteadEffort',\n    label: 'Halstead effort',\n    defaultLimit: 30_000,\n    hint: 'the function is both large and dense; split it into smaller functions with fewer values each.',\n    measure: (fn) => fn.halstead.effort,\n  },\n  {\n    key: 'maxFunctionDepDegree',\n    label: 'DepDegree',\n    defaultLimit: 50,\n    hint: 'too many values flow between the variables of the function; split it so each part works on fewer variables.',\n    measure: (fn) => fn.depDegree,\n  },\n];\n\nexport const fileThresholds: readonly Threshold<CodeMetrics>[] = [\n  {\n    key: 'maxFileNcss',\n    label: 'file NCSS',\n    defaultLimit: 500,\n    hint: 'split the file into smaller modules with one responsibility each.',\n    measure: (file) => file.ncssCount,\n  },\n];\n\n/** A duplicated block violates when it spans at least this many lines. */\nexport const duplicationThreshold: Threshold<{ startLine: number; endLine: number }> = {\n  key: 'minDuplicateLines',\n  label: 'duplicated lines',\n  defaultLimit: 10,\n  hint: 'extract the repeated code into one shared function or module and call it from every location.',\n  measure: (block) => block.endLine - block.startLine + 1,\n};\n\nexport const thresholds: readonly Threshold[] = [...functionThresholds, ...fileThresholds, duplicationThreshold];\n\n/** The name a report gives a threshold's measured value: its key without the `max`/`min` prefix. */\nexport function metricNameOf(threshold: Threshold): string {\n  const name = threshold.key.slice(3);\n  return name.charAt(0).toLowerCase() + name.slice(1);\n}\n\n/** The `thresholds` config section; a missing key falls back to the less specific layer. */\nexport interface ThresholdsConfig {\n  limits: Limits;\n  /** Overrides for the files of one language, keyed by language name. */\n  languages: Readonly<Record<string, Limits>>;\n}\n\n/**\n * The limits applying to files of each language, with precedence command-line options > the\n * config's per-language overrides > the config's limits > built-in defaults.\n */\nexport function resolveLimits(cliLimits: Limits, config: ThresholdsConfig | undefined): (language: string) => Limits {\n  const defaults = Object.fromEntries(thresholds.map(({ key, defaultLimit }) => [key, defaultLimit]));\n  const shared = { ...defaults, ...config?.limits };\n  return (language) => ({\n    ...shared,\n    // Object.hasOwn: a language named like an Object.prototype member must not read an inherited value.\n    ...(config && Object.hasOwn(config.languages, language) ? config.languages[language] : undefined),\n    ...cliLimits,\n  });\n}\n"],"mappings":"aAoBA,MAAa,EAA4D,CACvE,CACE,IAAK,iCACL,MAAO,uBACP,aAAc,GACd,KAAM,8FACN,QAAU,GAAO,EAAG,mBACtB,EACA,CACE,IAAK,kCACL,MAAO,wBACP,aAAc,GACd,KAAM,qHACN,QAAU,GAAO,EAAG,oBACtB,EACA,CACE,IAAK,kBACL,MAAO,OACP,aAAc,GACd,KAAM,mEACN,QAAU,GAAO,EAAG,IACtB,EACA,CACE,IAAK,0BACL,MAAO,gBACP,aAAc,EACd,KAAM,oFACN,QAAU,GAAO,EAAG,YACtB,EACA,CACE,IAAK,4BACL,MAAO,aACP,aAAc,EACd,KAAM,kEACN,QAAU,GAAO,EAAG,cACtB,EACA,CACE,IAAK,4BACL,MAAO,kBACP,aAAc,IACd,KAAM,iGACN,QAAU,GAAO,EAAG,SAAS,MAC/B,EACA,CACE,IAAK,gCACL,MAAO,sBACP,aAAc,GACd,KAAM,gGACN,QAAU,GAAO,EAAG,SAAS,UAC/B,EACA,CACE,IAAK,4BACL,MAAO,kBACP,aAAc,IACd,KAAM,gGACN,QAAU,GAAO,EAAG,SAAS,MAC/B,EACA,CACE,IAAK,uBACL,MAAO,YACP,aAAc,GACd,KAAM,8GACN,QAAU,GAAO,EAAG,SACtB,CACF,EAEa,EAAoD,CAC/D,CACE,IAAK,cACL,MAAO,YACP,aAAc,IACd,KAAM,oEACN,QAAU,GAAS,EAAK,SAC1B,CACF,EAGa,EAA0E,CACrF,IAAK,oBACL,MAAO,mBACP,aAAc,GACd,KAAM,gGACN,QAAU,GAAU,EAAM,QAAU,EAAM,UAAY,CACxD,EAEa,EAAmC,CAAC,GAAG,EAAoB,GAAG,EAAgB,CAAoB,EAG/G,SAAgB,EAAa,EAA8B,CACzD,IAAM,EAAO,EAAU,IAAI,MAAM,CAAC,EAClC,OAAO,EAAK,OAAO,CAAC,CAAC,CAAC,YAAY,EAAI,EAAK,MAAM,CAAC,CACpD,CAaA,SAAgB,EAAc,EAAmB,EAAoE,CAEnH,IAAM,EAAS,CAAE,GADA,OAAO,YAAY,EAAW,KAAK,CAAE,MAAK,kBAAmB,CAAC,EAAK,CAAY,CAAC,CACtE,EAAG,GAAG,GAAQ,MAAO,EAChD,MAAQ,KAAc,CACpB,GAAG,EAEH,GAAI,GAAU,OAAO,OAAO,EAAO,UAAW,CAAQ,EAAI,EAAO,UAAU,GAAY,IAAA,GACvF,GAAG,CACL,EACF"}

package/dist/thresholds.d.ts

@@ -0,0 +1,38 @@
+import type { CodeMetrics, FunctionMetrics } from './types.js';
+/**
+ * One limit of `code-gauge check`. Its `key` is the config setting, the per-language override
+ * setting, and (kebab-cased) the command-line option, so a new entry here is all a new thresholded
+ * metric needs.
+ */
+export interface Threshold<Subject = never> {
+    key: string;
+    /** How the report names the measured value. */
+    label: string;
+    defaultLimit: number;
+    /** What to change in the code when the limit is exceeded. */
+    hint: string;
+    measure: (subject: Subject) => number;
+}
+/** Limits by threshold key; `Infinity` disables a limit. */
+export type Limits = Readonly<Record<string, number>>;
+export declare const functionThresholds: readonly Threshold<FunctionMetrics>[];
+export declare const fileThresholds: readonly Threshold<CodeMetrics>[];
+/** A duplicated block violates when it spans at least this many lines. */
+export declare const duplicationThreshold: Threshold<{
+    startLine: number;
+    endLine: number;
+}>;
+export declare const thresholds: readonly Threshold[];
+/** The name a report gives a threshold's measured value: its key without the `max`/`min` prefix. */
+export declare function metricNameOf(threshold: Threshold): string;
+/** The `thresholds` config section; a missing key falls back to the less specific layer. */
+export interface ThresholdsConfig {
+    limits: Limits;
+    /** Overrides for the files of one language, keyed by language name. */
+    languages: Readonly<Record<string, Limits>>;
+}
+/**
+ * The limits applying to files of each language, with precedence command-line options > the
+ * config's per-language overrides > the config's limits > built-in defaults.
+ */
+export declare function resolveLimits(cliLimits: Limits, config: ThresholdsConfig | undefined): (language: string) => Limits;