code-gauge 1.14.0 → 2.0.0

package/dist/cli.js.map

@@ -1 +1 @@
-{"version":3,"file":"cli.js","names":[],"sources":["../src/cli.ts"],"sourcesContent":["#!/usr/bin/env node\n\nimport { readdir, readFile, realpath, stat } from 'node:fs/promises';\nimport os from 'node:os';\nimport path from 'node:path';\nimport { Command, InvalidArgumentError } from 'commander';\nimport { measureArchitecture, type ArchitectureFileMetrics, type ArchitectureMetrics } from './architectureMetrics.js';\nimport {\n  type CliOptions,\n  configFileName,\n  loadConfig,\n  type ResolvedOptions,\n  resolveOptions,\n  resolveThresholds,\n  type Thresholds,\n} from './cliConfig.js';\nimport { measureCrossFileDuplication, type CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport type { CrossFileDuplicateCandidate } from './duplication.js';\nimport { collectDuplicationCandidates, measureCode } from './metrics.js';\nimport { measureTypeScriptProject, type TypeScriptProjectMetrics } from './typescriptProject.js';\nimport type { CodeMetrics, FunctionMetrics, LanguageName } from './types.js';\n\ninterface FileMetrics {\n  file: string;\n  metrics: CodeMetrics;\n  /** Cross-file duplicate candidates, collected only for directory scans. */\n  duplicationCandidates?: CrossFileDuplicateCandidate[];\n}\n\ninterface RiskTrigger {\n  /** Optional location hint (e.g. duplicated block line ranges) appended to the printed trigger. */\n  detail?: string;\n  metric: string;\n  score: number;\n  threshold: number;\n  value: number;\n}\n\ninterface RiskFinding {\n  cognitiveComplexity: number;\n  cyclomaticComplexity: number;\n  endLine?: number;\n  file: string;\n  kind: 'component' | 'file' | 'function';\n  language: LanguageName;\n  name?: string;\n  score: number;\n  startLine?: number;\n  triggers: RiskTrigger[];\n}\n\ninterface ScanResult {\n  architecture?: ArchitectureMetrics;\n  componentFunctionKeys?: Set<string>;\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  fatalError?: string;\n  files: FileMetrics[];\n  namedComponentFunctionKeys?: Set<string>;\n  typeScriptProject?: TypeScriptProjectMetrics;\n}\n\nconst languageByExtension = new Map<string, LanguageName>([\n  ['.c', 'c'],\n  ['.c++', 'cpp'],\n  ['.cc', 'cpp'],\n  ['.cjs', 'javascript'],\n  ['.cp', 'cpp'],\n  ['.cpp', 'cpp'],\n  ['.tcc', 'cpp'],\n  ['.cts', 'typescript'],\n  ['.cxx', 'cpp'],\n  ['.go', 'go'],\n  // Headers may be C or C++; the C++ grammar parses both.\n  ['.h', 'cpp'],\n  ['.hh', 'cpp'],\n  ['.hpp', 'cpp'],\n  ['.hxx', 'cpp'],\n  ['.java', 'java'],\n  ['.js', 'javascript'],\n  ['.jsx', 'jsx'],\n  ['.mjs', 'javascript'],\n  ['.mts', 'typescript'],\n  ['.py', 'python'],\n  ['.rb', 'ruby'],\n  ['.rs', 'rust'],\n  ['.ts', 'typescript'],\n  ['.tsx', 'tsx'],\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  'target',\n  'test-fixtures',\n  'vendor',\n  'venv',\n]);\n\n/** Caps the `Duplicate symbols` section so large repositories do not flood the report. */\nconst maxDuplicateSymbolGroupLines = 10;\n/** Caps the `Cross-file duplicate blocks` section so large repositories do not flood the report. */\nconst maxCrossFileDuplicateGroupLines = 10;\n/** Caps how many cross-file group locations a single risk finding repeats as detail. */\nconst maxCrossFileDuplicateDetailGroups = 3;\n\nconst testDirectoryNames = new Set(['__tests__', 'test', 'tests', 'spec']);\nconst testFilePattern = /(?:^test(?:[_-].*)?|\\.(?:spec|test)|[_-](?:test|spec))\\.[^.]+$/iu;\n// JUnit tests use a case-sensitive `Test.java` suffix; case-insensitive matching would catch\n// production files like `contest.java`.\nconst javaTestFilePattern = /Test\\.java$/u;\n\n// oxlint-disable-next-line unicorn/prefer-top-level-await -- CommonJS build output cannot preserve top-level await.\nvoid main().catch((error: unknown) => {\n  writeStderr(`Error: ${formatError(error)}\\n`);\n  process.exitCode = 1;\n});\n\nasync function main(): Promise<void> {\n  const program = new Command()\n    .name('code-gauge')\n    .description('Measure code metrics and list high-risk findings.')\n    .argument('[target]', 'file or directory to measure', '.')\n    .option('--config <path>', `config file to use instead of the auto-detected ${configFileName}`)\n    .option('--file-loc-threshold <number>', 'minimum file code LOC to report', parsePositiveInteger)\n    .option('--function-loc-threshold <number>', 'minimum function physical LOC span to report', parsePositiveInteger)\n    .option(\n      '--component-loc-threshold <number>',\n      'minimum React component physical LOC span to report',\n      parsePositiveInteger\n    )\n    .option('--cognitive-threshold <number>', 'minimum cognitive complexity to report', parsePositiveInteger)\n    .option('--cyclomatic-threshold <number>', 'minimum cyclomatic complexity to report', parsePositiveInteger)\n    .option('--call-threshold <number>', 'minimum function call count to report', parsePositiveInteger)\n    .option('--import-threshold <number>', 'minimum unique import sources per file to report', parsePositiveInteger)\n    .option('--fan-out-threshold <number>', 'minimum intra-file fan-out per function to report', parsePositiveInteger)\n    .option('--parameter-threshold <number>', 'minimum function parameter count to report', parsePositiveInteger)\n    .option(\n      '--duplicate-block-threshold <number>',\n      'minimum count of duplicated code blocks per file to report',\n      parsePositiveInteger\n    )\n    .option(\n      '--duplication-ratio-percent-threshold <number>',\n      'minimum percentage (1-100) of duplicated lines per file to report',\n      parsePercentInteger\n    )\n    .option(\n      '--cross-file-duplicate-block-threshold <number>',\n      'minimum count of cross-file duplicate block groups per file to report',\n      parsePositiveInteger\n    )\n    .option(\n      '--duplication-min-tokens <number>',\n      'minimum normalized token count for a duplicate region (default 40)',\n      parsePositiveInteger\n    )\n    .option(\n      '--duplication-max-gap-tokens <number>',\n      'maximum token gap merged into one gapped clone group; 0 disables merging (default 30)',\n      parseNonNegativeInteger\n    )\n    .option(\n      '--duplication-min-similarity-percent <number>',\n      'minimum similarity percent (1-100) for near-miss (Type-3) clone blocks; 100 reports exact matches only (default 70)',\n      parsePercentInteger\n    )\n    .option(\n      '--transitive-dependency-threshold <number>',\n      'minimum transitively reachable local files to report',\n      parsePositiveInteger\n    )\n    .option(\n      '--structural-breadth-threshold <number>',\n      'minimum structural breadth score to report',\n      parsePositiveInteger\n    )\n    .option(\n      '--structural-coordination-threshold <number>',\n      'minimum structural coordination score to report',\n      parsePositiveInteger\n    )\n    .option('--state-mutation-threshold <number>', 'minimum state mutation score to report', parsePositiveInteger)\n    .option(\n      '--duplicate-symbol-group-threshold <number>',\n      'minimum duplicate symbol group count to report',\n      parsePositiveInteger\n    )\n    .option('--max-findings <number>', 'maximum number of risk findings to print', parsePositiveInteger)\n    .option('--largest-files <number>', 'number of largest files by code LOC to list', parsePositiveInteger)\n    .option('--include-tests', 'include test files and test directories')\n    .option('--tsconfig <path>', 'TypeScript project file to use instead of auto-detected tsconfig.json')\n    .option('--json', 'print JSON output')\n    .option('--fail-on-error', 'exit with code 1 when files or directories cannot be scanned')\n    .option('--fail-on-risk', 'exit with code 1 when high-risk findings are found');\n\n  program.action(async (target: string, cliOptions: CliOptions) => {\n    const resolvedTarget = resolveTarget(target);\n    const config = await loadConfig(cliOptions.config, await configSearchDirectory(resolvedTarget));\n    const options = resolveOptions(cliOptions, config);\n    const result = await scanTarget(resolvedTarget, options);\n    addCrossFileDuplication(result);\n    await addArchitectureMetrics(result);\n    await addTypeScriptProjectMetrics(result, options, resolvedTarget);\n    const risks = findRiskyFunctions(\n      result.files,\n      result.architecture,\n      result.crossFileDuplication,\n      result.componentFunctionKeys,\n      result.namedComponentFunctionKeys,\n      options,\n      result.displayRoot\n    );\n\n    if (options.json) {\n      printJson(result, risks, options);\n    } else {\n      printTextReport(resolvedTarget, result, risks, options);\n    }\n\n    if (\n      result.fatalError ||\n      (options.failOnError && result.errors.length > 0) ||\n      (options.failOnRisk && risks.length > 0)\n    ) {\n      process.exitCode = 1;\n    }\n  });\n\n  await program.parseAsync();\n}\n\nfunction 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). */\nasync 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: ResolvedOptions;\n  files: FileMetrics[];\n  errors: string[];\n  warnings: string[];\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}\n\nasync function scanTarget(target: string, options: ResolvedOptions): Promise<ScanResult> {\n  const files: FileMetrics[] = [];\n  const errors: string[] = [];\n  const warnings: string[] = [];\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)}: ${formatError(error)}`;\n    return { displayRoot: fallbackDisplayRoot, files, errors: [fatalError], warnings, fatalError };\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, fatalError };\n    }\n\n    const context = makeScanContext(options, files, errors, warnings, displayRoot);\n    await measureFile(canonicalTarget, language, 'single-file', context, canonicalTarget);\n    return { displayRoot, files, errors, warnings };\n  }\n\n  await scanDirectory(canonicalTarget, makeScanContext(options, files, errors, warnings, canonicalTarget));\n  return { displayRoot: canonicalTarget, files, errors, warnings };\n}\n\nfunction makeScanContext(\n  options: ResolvedOptions,\n  files: FileMetrics[],\n  errors: string[],\n  warnings: string[],\n  rootDirectory: string\n): ScanContext {\n  return { options, files, errors, warnings, visitedDirectories: new Set(), visitedFiles: new Set(), rootDirectory };\n}\n\nasync function addTypeScriptProjectMetrics(\n  result: ScanResult,\n  options: ResolvedOptions,\n  resolvedTarget: string\n): Promise<void> {\n  if (result.fatalError) {\n    return;\n  }\n  if (result.files.length === 0) {\n    return;\n  }\n\n  const explicitConfigFile = options.tsconfig;\n  const isExplicitConfig = explicitConfigFile !== undefined;\n  if (!isExplicitConfig && !result.files.some(({ file }) => isTypeScriptProjectCandidateFile(file))) {\n    return;\n  }\n\n  const configFile = explicitConfigFile ? resolveTarget(explicitConfigFile) : await findNearestTsconfig(resolvedTarget);\n  if (!configFile) {\n    return;\n  }\n\n  try {\n    result.typeScriptProject = await measureTypeScriptProject(\n      configFile,\n      result.files.map(({ file }) => file)\n    );\n    result.componentFunctionKeys = new Set(\n      result.typeScriptProject.reactComponentFunctions.map((component) =>\n        functionLocationKey(component.file, component.startLine, component.startColumn)\n      )\n    );\n    result.namedComponentFunctionKeys = new Set(\n      result.typeScriptProject.reactComponentFunctions.flatMap((component) =>\n        component.name ? [functionNameLocationKey(component.file, component.name, component.startLine)] : []\n      )\n    );\n  } catch (error) {\n    if (isExplicitConfig) {\n      result.errors.push(`${formatPath(configFile, result.displayRoot)}: ${formatError(error)}`);\n    }\n  }\n}\n\nfunction isTypeScriptProjectCandidateFile(file: string): boolean {\n  return ['.cjs', '.cts', '.js', '.jsx', '.mjs', '.mts', '.ts', '.tsx'].includes(path.extname(file));\n}\n\nasync function findNearestTsconfig(target: string): Promise<string | undefined> {\n  const targetStat = await stat(target);\n  let currentDirectory = targetStat.isDirectory() ? target : path.dirname(target);\n  while (true) {\n    const configFile = path.join(currentDirectory, 'tsconfig.json');\n    if (await fileExists(configFile)) {\n      return configFile;\n    }\n\n    const parentDirectory = path.dirname(currentDirectory);\n    if (parentDirectory === currentDirectory) {\n      return undefined;\n    }\n    currentDirectory = parentDirectory;\n  }\n}\n\nasync function fileExists(file: string): Promise<boolean> {\n  try {\n    const fileStat = await stat(file);\n    return fileStat.isFile();\n  } catch {\n    return false;\n  }\n}\n\nasync function addArchitectureMetrics(result: ScanResult): Promise<void> {\n  if (result.fatalError) {\n    return;\n  }\n\n  try {\n    result.architecture = measureArchitecture(\n      result.files.map(({ file, metrics }) => ({ file, metrics })),\n      result.displayRoot\n    );\n  } catch (error) {\n    result.errors.push(`architecture metrics: ${formatError(error)}`);\n  }\n}\n\nasync function scanDirectory(directory: string, context: ScanContext): Promise<void> {\n  let resolvedDirectory;\n  try {\n    resolvedDirectory = await realpath(directory);\n  } catch (error) {\n    context.errors.push(`${formatPath(directory, context.rootDirectory)}: ${formatError(error)}`);\n    return;\n  }\n\n  if (!isWithinDirectory(resolvedDirectory, context.rootDirectory)) {\n    return;\n  }\n\n  if (context.visitedDirectories.has(resolvedDirectory)) {\n    return;\n  }\n  context.visitedDirectories.add(resolvedDirectory);\n\n  let entries;\n  try {\n    entries = await readdir(directory, { withFileTypes: true });\n  } catch (error) {\n    context.errors.push(`${formatPath(directory, context.rootDirectory)}: ${formatError(error)}`);\n    return;\n  }\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      await measureScannableFile(entryPath, context);\n    }\n  }\n}\n\nasync function scanSymbolicLink(name: string, entryPath: string, context: ScanContext): Promise<void> {\n  let resolvedPath;\n  try {\n    resolvedPath = await realpath(entryPath);\n  } catch (error) {\n    context.errors.push(`${formatPath(entryPath, context.rootDirectory)}: ${formatError(error)}`);\n    return;\n  }\n\n  if (!isWithinDirectory(resolvedPath, context.rootDirectory)) {\n    return;\n  }\n\n  let entryStat;\n  try {\n    entryStat = await stat(entryPath);\n  } catch (error) {\n    context.errors.push(`${formatPath(entryPath, context.rootDirectory)}: ${formatError(error)}`);\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    await measureScannableFile(entryPath, context, resolvedPath, resolvedPath);\n  }\n}\n\nasync function measureScannableFile(\n  file: string,\n  context: ScanContext,\n  languageFile = file,\n  realFile?: string\n): Promise<void> {\n  const language = getLanguage(languageFile, context.options);\n  if (language) {\n    await measureFile(file, language, 'directory', context, realFile);\n  }\n}\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  try {\n    const resolvedFile = realFile ?? (await realpath(file));\n    if (context.visitedFiles.has(resolvedFile)) {\n      return;\n    }\n    context.visitedFiles.add(resolvedFile);\n\n    const code = await readFile(file, 'utf8');\n    const measureOptions = { language, duplication: context.options.duplication };\n    const fileMetrics: FileMetrics = { file, metrics: measureCode(code, measureOptions) };\n    // Only directory scans compare files against each other; a single-file target has no peers.\n    // Candidate collection failing (it always parses with the JavaScript binding, which can give\n    // up where the native backend measured fine) must not discard the measured metrics.\n    if (mode === 'directory') {\n      try {\n        fileMetrics.duplicationCandidates = collectDuplicationCandidates(code, measureOptions);\n      } catch (error) {\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        context.warnings.push(\n          `${formatPath(file, context.rootDirectory)}: cross-file duplication candidates unavailable: ${formatError(error)}`\n        );\n      }\n    }\n    context.files.push(fileMetrics);\n  } catch (error) {\n    context.errors.push(`${formatPath(file, context.rootDirectory)}: ${formatError(error)}`);\n  }\n}\n\n/** Runs after the scan so every measured file's candidates participate. */\nfunction addCrossFileDuplication(result: ScanResult): 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), candidates: duplicationCandidates }] : []\n  );\n  if (sourceFiles.length < 2) {\n    return;\n  }\n  result.crossFileDuplication = measureCrossFileDuplication(sourceFiles);\n}\n\nfunction findRiskyFunctions(\n  files: FileMetrics[],\n  architecture: ArchitectureMetrics | undefined,\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  componentFunctionKeys: Set<string> | undefined,\n  namedComponentFunctionKeys: Set<string> | undefined,\n  options: ResolvedOptions,\n  displayRoot: string\n): RiskFinding[] {\n  const architectureByFile = new Map(architecture?.files.map((file) => [file.file, file]));\n  const findings = files.flatMap(({ file, metrics }) => {\n    const isReactFile = metrics.functions.some(\n      (fn) => fn.returnsJsx || isReactComponent(file, fn, componentFunctionKeys, namedComponentFunctionKeys)\n    );\n    const thresholds = resolveThresholds(options, metrics.language, isReactFile);\n    return [\n      ...findRiskyFileMetrics(\n        file,\n        metrics,\n        architectureByFile.get(formatPath(file, displayRoot)),\n        crossFileDuplication,\n        thresholds,\n        displayRoot\n      ),\n      ...metrics.functions.flatMap((fn) =>\n        findRiskyFunctionMetrics(\n          file,\n          metrics.language,\n          fn,\n          thresholds,\n          displayRoot,\n          componentFunctionKeys,\n          namedComponentFunctionKeys\n        )\n      ),\n    ];\n  });\n\n  findings.sort(compareRiskFindings);\n  return findings;\n}\n\nfunction findRiskyFileMetrics(\n  file: string,\n  metrics: CodeMetrics,\n  architecture: ArchitectureFileMetrics | undefined,\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  thresholds: Thresholds,\n  displayRoot: string\n): RiskFinding[] {\n  const triggers: RiskTrigger[] = [];\n  const formattedFile = formatPath(file, displayRoot);\n  addTrigger(triggers, 'file LOC', metrics.lines.code, thresholds.fileLoc);\n  addTrigger(triggers, 'import sources', metrics.coupling.importSourceCount, thresholds.import);\n  const duplicateBlockDetail = formatDuplicateBlockGroups(metrics.duplication.duplicateBlockGroups);\n  addTrigger(\n    triggers,\n    'duplicated blocks',\n    metrics.duplication.duplicateBlockCount,\n    thresholds.duplicateBlock,\n    duplicateBlockDetail\n  );\n  // Maximal-region selection deliberately compresses adjacent clones into few blocks, so severity\n  // must track line coverage, not the block count. Flooring compares like the unrounded ratio\n  // against the integer threshold (29.5% must not trigger a >= 30 threshold). The block ranges are\n  // repeated as detail because this trigger can fire alone, and a percentage without locations is\n  // not actionable.\n  addTrigger(\n    triggers,\n    'duplicated lines (%)',\n    Math.floor(metrics.duplication.duplicationRatio * 100),\n    thresholds.duplicationRatioPercent,\n    duplicateBlockDetail\n  );\n  if (crossFileDuplication) {\n    // Object.hasOwn: a file named like an Object.prototype member must not read an inherited value.\n    addTrigger(\n      triggers,\n      'cross-file duplicated blocks',\n      Object.hasOwn(crossFileDuplication.duplicateBlockGroupCountByFile, formattedFile)\n        ? (crossFileDuplication.duplicateBlockGroupCountByFile[formattedFile] ?? 0)\n        : 0,\n      thresholds.crossFileDuplicateBlock,\n      formatCrossFileDuplicateDetail(crossFileDuplication, formattedFile)\n    );\n  }\n  if (architecture) {\n    const hasFileScaleRisk = metrics.lines.code >= 100 || architecture.directLocalDependencyCount >= 8;\n    if (hasFileScaleRisk) {\n      addTrigger(\n        triggers,\n        'transitive local dependencies',\n        architecture.transitiveLocalDependencyCount,\n        thresholds.transitiveDependency\n      );\n    }\n    if (\n      triggers.length > 0 ||\n      architecture.directLocalDependencyCount >= 8 ||\n      architecture.structuralCoordination.score >= thresholds.structuralCoordination\n    ) {\n      addTrigger(triggers, 'structural breadth', architecture.structuralBreadthScore, thresholds.structuralBreadth);\n    }\n    addTrigger(\n      triggers,\n      'structural coordination',\n      architecture.structuralCoordination.score,\n      thresholds.structuralCoordination\n    );\n    addTrigger(\n      triggers,\n      'state mutation',\n      architecture.structuralCoordination.stateMutationScore,\n      thresholds.stateMutation\n    );\n    addTrigger(\n      triggers,\n      'duplicate symbol groups',\n      architecture.duplicateSymbolGroupCount,\n      thresholds.duplicateSymbolGroup\n    );\n  }\n  if (triggers.length === 0) {\n    return [];\n  }\n\n  return [\n    {\n      file: formattedFile,\n      language: metrics.language,\n      kind: 'file',\n      cyclomaticComplexity: metrics.cyclomaticComplexity,\n      cognitiveComplexity: metrics.cognitiveComplexity,\n      triggers,\n      score: maxTriggerScore(triggers),\n    },\n  ];\n}\n\nfunction findRiskyFunctionMetrics(\n  file: string,\n  language: LanguageName,\n  fn: FunctionMetrics,\n  thresholds: Thresholds,\n  displayRoot: string,\n  componentFunctionKeys?: Set<string>,\n  namedComponentFunctionKeys?: Set<string>\n): RiskFinding[] {\n  const loc = fn.endLine - fn.startLine + 1;\n  const isComponent = isReactComponent(file, fn, componentFunctionKeys, namedComponentFunctionKeys);\n  const kind = isComponent ? 'component' : 'function';\n  const triggers: RiskTrigger[] = [];\n  addTrigger(triggers, 'cognitive complexity', fn.cognitiveComplexity, thresholds.cognitive);\n  addTrigger(triggers, 'cyclomatic complexity', fn.cyclomaticComplexity, thresholds.cyclomatic);\n  addTrigger(triggers, isComponent ? 'component LOC' : 'function LOC', loc, getLocThreshold(isComponent, thresholds));\n  addTrigger(triggers, 'function calls', fn.callCount, thresholds.call);\n  addTrigger(triggers, 'fan-out', fn.fanOut, thresholds.fanOut);\n  addTrigger(triggers, 'parameters', fn.parameterCount, thresholds.parameter);\n  if (triggers.length === 0) {\n    return [];\n  }\n\n  return [\n    {\n      file: formatPath(file, displayRoot),\n      language,\n      kind,\n      name: fn.name ?? '<anonymous>',\n      startLine: fn.startLine,\n      endLine: fn.endLine,\n      cyclomaticComplexity: fn.cyclomaticComplexity,\n      cognitiveComplexity: fn.cognitiveComplexity,\n      triggers,\n      score: maxTriggerScore(triggers),\n    },\n  ];\n}\n\nfunction addTrigger(triggers: RiskTrigger[], metric: string, value: number, threshold: number, detail?: string): void {\n  if (value < threshold) {\n    return;\n  }\n\n  triggers.push({ metric, value, threshold, score: value / threshold, detail });\n}\n\n/** Formats the cross-file groups a file participates in as `12-34 ~ b.ts:56-78; ...` (capped). */\nfunction formatCrossFileDuplicateDetail(\n  crossFileDuplication: CrossFileDuplicationMetrics,\n  formattedFile: string\n): string | undefined {\n  const involved = crossFileDuplication.groups.filter((group) => group.files.includes(formattedFile));\n  if (involved.length === 0) {\n    return undefined;\n  }\n  const formatted = involved\n    .slice(0, maxCrossFileDuplicateDetailGroups)\n    .map((group) =>\n      group.occurrences\n        .map(({ file, startLine, endLine }) =>\n          file === formattedFile ? `${startLine}-${endLine}` : `${file}:${startLine}-${endLine}`\n        )\n        .join(' ~ ')\n    )\n    .join('; ');\n  const truncatedSuffix = involved.length > maxCrossFileDuplicateDetailGroups ? '; ...' : '';\n  return `${formatted}${truncatedSuffix}`;\n}\n\n/** Formats duplicated block groups as `12-34 ~ 56-78; 90-99 ~ 100-109` (copies joined by ` ~ `, groups by `; `). */\nfunction formatDuplicateBlockGroups(groups: { endLine: number; startLine: number }[][]): string | undefined {\n  if (groups.length === 0) {\n    return undefined;\n  }\n\n  return groups.map((group) => group.map(({ startLine, endLine }) => `${startLine}-${endLine}`).join(' ~ ')).join('; ');\n}\n\nfunction isReactComponent(\n  file: string,\n  fn: FunctionMetrics,\n  componentFunctionKeys: Set<string> | undefined,\n  namedComponentFunctionKeys: Set<string> | undefined\n): boolean {\n  return (\n    componentFunctionKeys?.has(functionLocationKey(file, fn.startLine, fn.startColumn)) ||\n    (fn.name ? namedComponentFunctionKeys?.has(functionNameLocationKey(file, fn.name, fn.startLine)) : false) ||\n    false\n  );\n}\n\nfunction getLocThreshold(isComponent: boolean, thresholds: Thresholds): number {\n  return isComponent ? thresholds.componentLoc : thresholds.functionLoc;\n}\n\nfunction functionLocationKey(file: string, startLine: number, startColumn: number): string {\n  return `${path.resolve(file)}:${startLine}:${startColumn}`;\n}\n\nfunction functionNameLocationKey(file: string, name: string, startLine: number): string {\n  return `${path.resolve(file)}:${name}:${startLine}`;\n}\n\nfunction maxTriggerScore(triggers: RiskTrigger[]): number {\n  return Math.max(...triggers.map((trigger) => trigger.score));\n}\n\nfunction compareRiskFindings(left: RiskFinding, right: RiskFinding): number {\n  return (\n    right.score - left.score ||\n    left.file.localeCompare(right.file) ||\n    (left.startLine ?? 0) - (right.startLine ?? 0) ||\n    (left.endLine ?? 0) - (right.endLine ?? 0) ||\n    left.kind.localeCompare(right.kind)\n  );\n}\n\nfunction printJson(result: ScanResult, risks: RiskFinding[], options: ResolvedOptions): void {\n  const summary = summarize(result.files);\n  const reportedRisks = risks.slice(0, options.maxFindings);\n  writeStdout(\n    JSON.stringify(\n      {\n        summary,\n        thresholds: options.thresholds,\n        profileThresholds: options.profileThresholds,\n        totalRisks: risks.length,\n        truncated: reportedRisks.length < risks.length,\n        largestFiles:\n          options.largestFiles > 0\n            ? findLargestFiles(result.files, options.largestFiles, result.displayRoot)\n            : undefined,\n        architecture: result.architecture,\n        crossFileDuplication: result.crossFileDuplication,\n        typeScriptProject: result.typeScriptProject,\n        risks: reportedRisks,\n        errors: result.errors,\n        warnings: result.warnings,\n      },\n      undefined,\n      2\n    ) + '\\n'\n  );\n}\n\nfunction printTextReport(target: string, result: ScanResult, risks: RiskFinding[], options: ResolvedOptions): void {\n  if (result.fatalError) {\n    writeStderr(`Error: ${result.fatalError}\\n`);\n    return;\n  }\n\n  const { thresholds } = options;\n  const summary = summarize(result.files);\n  writeStdout(`Measured ${summary.fileCount} files under ${target}\\n`);\n  writeStdout(\n    `LOC ${summary.linesOfCode}, NCSS ${summary.ncssCount}, functions ${summary.functionCount}, max cyclomatic ${summary.maxCyclomaticComplexity}, max cognitive ${summary.maxCognitiveComplexity}\\n`\n  );\n  writeStdout(\n    `Calls ${summary.callCount}, internal edges ${summary.internalCallCount}, max call depth ${summary.maxCallDepth}, imports ${summary.importSourceCount}, exports ${summary.exportCount}\\n`\n  );\n  writeStdout(\n    `Type annotations ${summary.typeAnnotationCount}, type aliases ${summary.typeAliasCount}, interfaces ${summary.interfaceCount}, avg cohesion ${summary.averageFunctionIdentifierOverlap.toFixed(2)}\\n`\n  );\n  if (result.architecture) {\n    writeStdout(`${formatArchitectureMetrics(result.architecture)}\\n`);\n  }\n  if (result.typeScriptProject) {\n    writeStdout(`${formatTypeScriptProjectMetrics(result.typeScriptProject)}\\n`);\n  }\n  writeStdout(\n    `Risk thresholds: file LOC >= ${thresholds.fileLoc}, function LOC >= ${thresholds.functionLoc}, component LOC >= ${thresholds.componentLoc}, cognitive >= ${thresholds.cognitive}, cyclomatic >= ${thresholds.cyclomatic}, calls >= ${thresholds.call}, imports >= ${thresholds.import}, fan-out >= ${thresholds.fanOut}, parameters >= ${thresholds.parameter}, duplicated blocks >= ${thresholds.duplicateBlock}, duplicated lines (%) >= ${thresholds.duplicationRatioPercent}, cross-file duplicated blocks >= ${thresholds.crossFileDuplicateBlock}\\n`\n  );\n  const profileOverrides = formatProfileOverrides(options.profileThresholds);\n  if (profileOverrides) {\n    writeStdout(`Per-language overrides: ${profileOverrides}\\n`);\n  }\n\n  if (risks.length === 0) {\n    writeStdout('No high-risk findings found.\\n');\n  } else {\n    const reportedRisks = risks.slice(0, options.maxFindings);\n    const totalSuffix = risks.length > reportedRisks.length ? ` of ${risks.length}` : '';\n    writeStdout(`\\nHigh-risk findings (top ${reportedRisks.length}${totalSuffix}):\\n`);\n    for (const risk of reportedRisks) {\n      writeStdout(`${formatRiskLocation(risk)} ${formatRiskName(risk)} ${formatRiskMetrics(risk)}\\n`);\n    }\n  }\n\n  const crossFileGroups = result.crossFileDuplication?.groups ?? [];\n  if (crossFileGroups.length > 0) {\n    const reportedGroups = crossFileGroups.slice(0, maxCrossFileDuplicateGroupLines);\n    const totalSuffix = crossFileGroups.length > reportedGroups.length ? ` of ${crossFileGroups.length}` : '';\n    writeStdout(`\\nCross-file duplicate blocks (top ${reportedGroups.length}${totalSuffix}):\\n`);\n    for (const group of reportedGroups) {\n      writeStdout(\n        `${group.tokenCount} tokens: ${group.occurrences\n          .map(({ file, startLine, endLine }) => `${file}:${startLine}-${endLine}`)\n          .join(', ')}\\n`\n      );\n    }\n  }\n\n  const duplicateSymbolGroups = result.architecture?.duplicateSymbolGroups ?? [];\n  if (duplicateSymbolGroups.length > 0) {\n    const reportedGroups = duplicateSymbolGroups\n      .toSorted((left, right) => right.files.length - left.files.length || left.name.localeCompare(right.name))\n      .slice(0, maxDuplicateSymbolGroupLines);\n    const totalSuffix =\n      duplicateSymbolGroups.length > reportedGroups.length ? ` of ${duplicateSymbolGroups.length}` : '';\n    writeStdout(`\\nDuplicate symbols (top ${reportedGroups.length}${totalSuffix}):\\n`);\n    for (const group of reportedGroups) {\n      writeStdout(\n        `${group.name}: ${group.declarations.map((declaration) => `${declaration.file}:${declaration.line}`).join(', ')}\\n`\n      );\n    }\n  }\n\n  if (options.largestFiles > 0) {\n    const largestFiles = findLargestFiles(result.files, options.largestFiles, result.displayRoot);\n    writeStdout(`\\nLargest files by code LOC (top ${largestFiles.length}):\\n`);\n    for (const { file, codeLoc } of largestFiles) {\n      writeStdout(`${file} (code LOC ${codeLoc})\\n`);\n    }\n  }\n\n  if (result.warnings.length > 0) {\n    writeStderr(`\\nDegraded ${result.warnings.length} files (measured, but excluded from cross-file matching):\\n`);\n    for (const warning of result.warnings.slice(0, 10)) {\n      writeStderr(`- ${warning}\\n`);\n    }\n    if (result.warnings.length > 10) {\n      writeStderr(`- ... ${result.warnings.length - 10} more\\n`);\n    }\n  }\n\n  if (result.errors.length > 0) {\n    writeStderr(`\\nSkipped ${result.errors.length} files or directories:\\n`);\n    for (const error of result.errors.slice(0, 10)) {\n      writeStderr(`- ${error}\\n`);\n    }\n    if (result.errors.length > 10) {\n      writeStderr(`- ... ${result.errors.length - 10} more\\n`);\n    }\n  }\n}\n\nfunction findLargestFiles(\n  files: FileMetrics[],\n  count: number,\n  displayRoot: string\n): { file: string; codeLoc: number }[] {\n  return files\n    .map(({ file, metrics }) => ({ file: formatPath(file, displayRoot), codeLoc: metrics.lines.code }))\n    .toSorted((left, right) => right.codeLoc - left.codeLoc || left.file.localeCompare(right.file))\n    .slice(0, count);\n}\n\nfunction formatProfileOverrides(profileThresholds: ResolvedOptions['profileThresholds']): string {\n  return Object.entries(profileThresholds)\n    .map(\n      ([profile, overrides]) =>\n        `${profile} { ${Object.entries(overrides)\n          .map(([metric, value]) => `${metric} ${value}`)\n          .join(', ')} }`\n    )\n    .join('; ');\n}\n\nfunction formatRiskLocation(risk: RiskFinding): string {\n  return risk.startLine === undefined || risk.endLine === undefined\n    ? risk.file\n    : `${risk.file}:${risk.startLine}-${risk.endLine}`;\n}\n\nfunction formatRiskName(risk: RiskFinding): string {\n  return risk.name ? `${risk.kind} ${risk.name}` : risk.kind;\n}\n\nfunction formatRiskMetrics(risk: RiskFinding): string {\n  const triggerText = risk.triggers\n    .map(\n      (trigger) =>\n        `${trigger.metric} ${formatMetricValue(trigger.value)} >= ${formatMetricValue(trigger.threshold)}${trigger.detail ? ` [${trigger.detail}]` : ''}`\n    )\n    .join(', ');\n  return `(${triggerText}; cyclomatic ${risk.cyclomaticComplexity}, cognitive ${risk.cognitiveComplexity})`;\n}\n\nfunction formatMetricValue(value: number): string {\n  return Number.isInteger(value) ? String(value) : value.toFixed(2);\n}\n\nfunction formatArchitectureMetrics(metrics: ArchitectureMetrics): string {\n  const maxStateMutationScore = Math.max(\n    0,\n    ...metrics.files.map((file) => file.structuralCoordination.stateMutationScore)\n  );\n  return `Architecture max reachable files ${metrics.maxTransitiveLocalDependencyCount}, max structural breadth ${metrics.maxStructuralBreadthScore}, max structural coordination ${metrics.maxStructuralCoordinationScore}, max state mutation ${maxStateMutationScore}, duplicate symbol groups ${metrics.duplicateSymbolGroups.length}`;\n}\n\nfunction formatTypeScriptProjectMetrics(metrics: TypeScriptProjectMetrics): string {\n  return `TypeScript project root files ${metrics.rootFileCount}, measured roots ${metrics.measuredRootFileCount}, semantic diagnostics ${metrics.semanticDiagnosticCount}, resolved calls ${metrics.resolvedCallExpressionCount}/${metrics.callExpressionCount} (${(metrics.resolvedCallExpressionRatio * 100).toFixed(1)}%)`;\n}\n\nfunction summarize(files: FileMetrics[]): {\n  fileCount: number;\n  functionCount: number;\n  linesOfCode: number;\n  maxCognitiveComplexity: number;\n  maxCyclomaticComplexity: number;\n  ncssCount: number;\n  callCount: number;\n  internalCallCount: number;\n  maxCallDepth: number;\n  importSourceCount: number;\n  relativeImportCount: number;\n  externalImportCount: number;\n  exportCount: number;\n  averageFunctionIdentifierOverlap: number;\n  typeAnnotationCount: number;\n  typeAliasCount: number;\n  interfaceCount: number;\n  genericParameterCount: number;\n} {\n  let functionCount = 0;\n  let linesOfCode = 0;\n  let maxCyclomaticComplexity = 0;\n  let maxCognitiveComplexity = 0;\n  let ncssCount = 0;\n  let callCount = 0;\n  let internalCallCount = 0;\n  let maxCallDepth = 0;\n  let importSourceCount = 0;\n  let relativeImportCount = 0;\n  let externalImportCount = 0;\n  let exportCount = 0;\n  let cohesionTotal = 0;\n  let typeAnnotationCount = 0;\n  let typeAliasCount = 0;\n  let interfaceCount = 0;\n  let genericParameterCount = 0;\n\n  for (const file of files) {\n    functionCount += file.metrics.functionCount;\n    linesOfCode += file.metrics.lines.code;\n    maxCyclomaticComplexity = Math.max(maxCyclomaticComplexity, file.metrics.maxCyclomaticComplexity);\n    maxCognitiveComplexity = Math.max(maxCognitiveComplexity, file.metrics.maxCognitiveComplexity);\n    ncssCount += file.metrics.ncssCount;\n    callCount += file.metrics.callGraph.callCount;\n    internalCallCount += file.metrics.callGraph.internalCallCount;\n    maxCallDepth = Math.max(maxCallDepth, file.metrics.callGraph.maxCallDepth);\n    importSourceCount += file.metrics.coupling.importSourceCount;\n    relativeImportCount += file.metrics.coupling.relativeImportCount;\n    externalImportCount += file.metrics.coupling.externalImportCount;\n    exportCount += file.metrics.coupling.exportCount;\n    cohesionTotal += file.metrics.cohesion.averageFunctionIdentifierOverlap;\n    typeAnnotationCount += file.metrics.typeComplexity.typeAnnotationCount;\n    typeAliasCount += file.metrics.typeComplexity.typeAliasCount;\n    interfaceCount += file.metrics.typeComplexity.interfaceCount;\n    genericParameterCount += file.metrics.typeComplexity.genericParameterCount;\n  }\n\n  return {\n    fileCount: files.length,\n    functionCount,\n    linesOfCode,\n    maxCyclomaticComplexity,\n    maxCognitiveComplexity,\n    ncssCount,\n    callCount,\n    internalCallCount,\n    maxCallDepth,\n    importSourceCount,\n    relativeImportCount,\n    externalImportCount,\n    exportCount,\n    averageFunctionIdentifierOverlap: files.length === 0 ? 0 : cohesionTotal / files.length,\n    typeAnnotationCount,\n    typeAliasCount,\n    interfaceCount,\n    genericParameterCount,\n  };\n}\n\nfunction shouldSkipDirectory(name: string, options: ResolvedOptions): 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\nfunction getLanguage(file: string, options: ResolvedOptions, 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)) || javaTestFilePattern.test(path.basename(file)))\n  ) {\n    return undefined;\n  }\n\n  // GCC treats an uppercase `.C` as C++; lowercasing first would misparse it with the C grammar.\n  if (path.extname(file) === '.C') {\n    return 'cpp';\n  }\n\n  return languageByExtension.get(path.extname(lowerFile));\n}\n\nfunction parsePercentInteger(value: string): number {\n  const parsed = parsePositiveInteger(value);\n  if (parsed > 100) {\n    throw new InvalidArgumentError('Expected an integer between 1 and 100.');\n  }\n  return parsed;\n}\n\nfunction parseNonNegativeInteger(value: string): number {\n  if (!/^\\d+$/u.test(value)) {\n    throw new InvalidArgumentError('Expected a non-negative integer.');\n  }\n\n  const parsed = Number(value);\n  if (!Number.isSafeInteger(parsed) || parsed < 0) {\n    throw new InvalidArgumentError('Expected a non-negative integer.');\n  }\n  return parsed;\n}\n\nfunction parsePositiveInteger(value: string): number {\n  if (!/^[1-9]\\d*$/u.test(value)) {\n    throw new InvalidArgumentError('Expected a positive integer.');\n  }\n\n  const parsed = Number(value);\n  if (!Number.isSafeInteger(parsed) || parsed < 1) {\n    throw new InvalidArgumentError('Expected a positive integer.');\n  }\n  return parsed;\n}\n\nfunction formatPath(file: string, base: string): string {\n  return path.relative(base, file) || path.basename(file);\n}\n\nfunction writeStdout(message: string): void {\n  process.stdout.write(message);\n}\n\nfunction writeStderr(message: string): void {\n  process.stderr.write(message);\n}\n\nfunction formatError(error: unknown): string {\n  return error instanceof Error ? error.message : String(error);\n}\n"],"mappings":";gkBAiEA,MAAM,EAAsB,IAAI,IAA0B,CACxD,CAAC,KAAM,GAAG,EACV,CAAC,OAAQ,KAAK,EACd,CAAC,MAAO,KAAK,EACb,CAAC,OAAQ,YAAY,EACrB,CAAC,MAAO,KAAK,EACb,CAAC,OAAQ,KAAK,EACd,CAAC,OAAQ,KAAK,EACd,CAAC,OAAQ,YAAY,EACrB,CAAC,OAAQ,KAAK,EACd,CAAC,MAAO,IAAI,EAEZ,CAAC,KAAM,KAAK,EACZ,CAAC,MAAO,KAAK,EACb,CAAC,OAAQ,KAAK,EACd,CAAC,OAAQ,KAAK,EACd,CAAC,QAAS,MAAM,EAChB,CAAC,MAAO,YAAY,EACpB,CAAC,OAAQ,KAAK,EACd,CAAC,OAAQ,YAAY,EACrB,CAAC,OAAQ,YAAY,EACrB,CAAC,MAAO,QAAQ,EAChB,CAAC,MAAO,MAAM,EACd,CAAC,MAAO,MAAM,EACd,CAAC,MAAO,YAAY,EACpB,CAAC,OAAQ,KAAK,CAChB,CAAC,EAEK,EAAwB,IAAI,IAAI,CACpC,UACA,UACA,UACA,OACA,QACA,kBACA,OACA,OACA,SACA,QACA,QACA,eACA,gBACA,cACA,WACA,OACA,WACA,YACA,eACA,SACA,gBACA,SACA,MACF,CAAC,EASK,EAAqB,IAAI,IAAI,CAAC,YAAa,OAAQ,QAAS,MAAM,CAAC,EACnE,GAAkB,mEAGlB,GAAsB,eAGvB,GAAK,CAAC,CAAC,MAAO,GAAmB,CACpC,EAAY,UAAU,EAAY,CAAK,EAAE,GAAG,EAC5C,QAAQ,SAAW,CACrB,CAAC,EAED,eAAe,IAAsB,CACnC,IAAM,EAAU,IAAI,EAAQ,CAAC,CAC1B,KAAK,YAAY,CAAC,CAClB,YAAY,mDAAmD,CAAC,CAChE,SAAS,WAAY,+BAAgC,GAAG,CAAC,CACzD,OAAO,kBAAmB,mDAAmD,GAAgB,CAAC,CAC9F,OAAO,gCAAiC,kCAAmC,CAAoB,CAAC,CAChG,OAAO,oCAAqC,+CAAgD,CAAoB,CAAC,CACjH,OACC,qCACA,sDACA,CACF,CAAC,CACA,OAAO,iCAAkC,yCAA0C,CAAoB,CAAC,CACxG,OAAO,kCAAmC,0CAA2C,CAAoB,CAAC,CAC1G,OAAO,4BAA6B,wCAAyC,CAAoB,CAAC,CAClG,OAAO,8BAA+B,mDAAoD,CAAoB,CAAC,CAC/G,OAAO,+BAAgC,oDAAqD,CAAoB,CAAC,CACjH,OAAO,iCAAkC,6CAA8C,CAAoB,CAAC,CAC5G,OACC,uCACA,6DACA,CACF,CAAC,CACA,OACC,iDACA,oEACA,CACF,CAAC,CACA,OACC,kDACA,wEACA,CACF,CAAC,CACA,OACC,oCACA,qEACA,CACF,CAAC,CACA,OACC,wCACA,wFACA,EACF,CAAC,CACA,OACC,gDACA,sHACA,CACF,CAAC,CACA,OACC,6CACA,uDACA,CACF,CAAC,CACA,OACC,0CACA,6CACA,CACF,CAAC,CACA,OACC,+CACA,kDACA,CACF,CAAC,CACA,OAAO,sCAAuC,yCAA0C,CAAoB,CAAC,CAC7G,OACC,8CACA,iDACA,CACF,CAAC,CACA,OAAO,0BAA2B,2CAA4C,CAAoB,CAAC,CACnG,OAAO,2BAA4B,8CAA+C,CAAoB,CAAC,CACvG,OAAO,kBAAmB,yCAAyC,CAAC,CACpE,OAAO,oBAAqB,uEAAuE,CAAC,CACpG,OAAO,SAAU,mBAAmB,CAAC,CACrC,OAAO,kBAAmB,8DAA8D,CAAC,CACzF,OAAO,iBAAkB,oDAAoD,EAEhF,EAAQ,OAAO,MAAO,EAAgB,IAA2B,CAC/D,IAAM,EAAiB,EAAc,CAAM,EACrC,EAAS,MAAM,EAAW,EAAW,OAAQ,MAAM,GAAsB,CAAc,CAAC,EACxF,EAAU,EAAe,EAAY,CAAM,EAC3C,EAAS,MAAM,GAAW,EAAgB,CAAO,EACvD,EAAwB,CAAM,EAC9B,MAAM,EAAuB,CAAM,EACnC,MAAM,GAA4B,EAAQ,EAAS,CAAc,EACjE,IAAM,EAAQ,GACZ,EAAO,MACP,EAAO,aACP,EAAO,qBACP,EAAO,sBACP,EAAO,2BACP,EACA,EAAO,WACT,EAEI,EAAQ,KACV,EAAU,EAAQ,EAAO,CAAO,EAEhC,EAAgB,EAAgB,EAAQ,EAAO,CAAO,GAItD,EAAO,YACN,EAAQ,aAAe,EAAO,OAAO,OAAS,GAC9C,EAAQ,YAAc,EAAM,OAAS,KAEtC,QAAQ,SAAW,EAEvB,CAAC,EAED,MAAM,EAAQ,WAAW,CAC3B,CAEA,SAAS,EAAc,EAAwB,CAS7C,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,eAAe,GAAsB,EAAiC,CACpE,GAAI,CAEF,OAAO,MADkB,EAAK,CAAM,EAAA,CAClB,YAAY,EAAI,EAAS,EAAK,QAAQ,CAAM,CAChE,MAAQ,CACN,OAAO,EAAK,QAAQ,CAAM,CAC5B,CACF,CAcA,eAAe,GAAW,EAAgB,EAA+C,CACvF,IAAM,EAAuB,CAAC,EACxB,EAAmB,CAAC,EACpB,EAAqB,CAAC,EACxB,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,EAAY,CAAK,IAC5F,MAAO,CAAE,YAAa,EAAqB,QAAO,OAAQ,CAAC,CAAU,EAAG,WAAU,YAAW,CAC/F,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,QAAO,OAAQ,CAAC,CAAU,EAAG,WAAU,YAAW,CAC1E,CAEA,IAAM,EAAU,EAAgB,EAAS,EAAO,EAAQ,EAAU,CAAW,EAE7E,OADA,MAAM,EAAY,EAAiB,EAAU,cAAe,EAAS,CAAe,EAC7E,CAAE,cAAa,QAAO,SAAQ,UAAS,CAChD,CAGA,OADA,MAAM,EAAc,EAAiB,EAAgB,EAAS,EAAO,EAAQ,EAAU,CAAe,CAAC,EAChG,CAAE,YAAa,EAAiB,QAAO,SAAQ,UAAS,CACjE,CAEA,SAAS,EACP,EACA,EACA,EACA,EACA,EACa,CACb,MAAO,CAAE,UAAS,QAAO,SAAQ,WAAU,mBAAoB,IAAI,IAAO,aAAc,IAAI,IAAO,eAAc,CACnH,CAEA,eAAe,GACb,EACA,EACA,EACe,CAIf,GAHI,EAAO,YAGP,EAAO,MAAM,SAAW,EAC1B,OAGF,IAAM,EAAqB,EAAQ,SAC7B,EAAmB,IAAuB,IAAA,GAChD,GAAI,CAAC,GAAoB,CAAC,EAAO,MAAM,MAAM,CAAE,UAAW,EAAiC,CAAI,CAAC,EAC9F,OAGF,IAAM,EAAa,EAAqB,EAAc,CAAkB,EAAI,MAAM,EAAoB,CAAc,EAC/G,KAIL,GAAI,CACF,EAAO,kBAAoB,MAAM,EAC/B,EACA,EAAO,MAAM,KAAK,CAAE,UAAW,CAAI,CACrC,EACA,EAAO,sBAAwB,IAAI,IACjC,EAAO,kBAAkB,wBAAwB,IAAK,GACpD,EAAoB,EAAU,KAAM,EAAU,UAAW,EAAU,WAAW,CAChF,CACF,EACA,EAAO,2BAA6B,IAAI,IACtC,EAAO,kBAAkB,wBAAwB,QAAS,GACxD,EAAU,KAAO,CAAC,EAAwB,EAAU,KAAM,EAAU,KAAM,EAAU,SAAS,CAAC,EAAI,CAAC,CACrG,CACF,CACF,OAAS,EAAO,CACV,GACF,EAAO,OAAO,KAAK,GAAG,EAAW,EAAY,EAAO,WAAW,EAAE,IAAI,EAAY,CAAK,GAAG,CAE7F,CACF,CAEA,SAAS,EAAiC,EAAuB,CAC/D,MAAO,CAAC,OAAQ,OAAQ,MAAO,OAAQ,OAAQ,OAAQ,MAAO,MAAM,CAAC,CAAC,SAAS,EAAK,QAAQ,CAAI,CAAC,CACnG,CAEA,eAAe,EAAoB,EAA6C,CAE9E,IAAI,GAAmB,MADE,EAAK,CAAM,EAAA,CACF,YAAY,EAAI,EAAS,EAAK,QAAQ,CAAM,EAC9E,OAAa,CACX,IAAM,EAAa,EAAK,KAAK,EAAkB,eAAe,EAC9D,GAAI,MAAM,EAAW,CAAU,EAC7B,OAAO,EAGT,IAAM,EAAkB,EAAK,QAAQ,CAAgB,EACrD,GAAI,IAAoB,EACtB,OAEF,EAAmB,CACrB,CACF,CAEA,eAAe,EAAW,EAAgC,CACxD,GAAI,CAEF,OAAO,MADgB,EAAK,CAAI,EAAA,CAChB,OAAO,CACzB,MAAQ,CACN,MAAO,EACT,CACF,CAEA,eAAe,EAAuB,EAAmC,CACnE,MAAO,WAIX,GAAI,CACF,EAAO,aAAe,EACpB,EAAO,MAAM,KAAK,CAAE,OAAM,cAAe,CAAE,OAAM,SAAQ,EAAE,EAC3D,EAAO,WACT,CACF,OAAS,EAAO,CACd,EAAO,OAAO,KAAK,yBAAyB,EAAY,CAAK,GAAG,CAClE,CACF,CAEA,eAAe,EAAc,EAAmB,EAAqC,CACnF,IAAI,EACJ,GAAI,CACF,EAAoB,MAAM,EAAS,CAAS,CAC9C,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAW,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EAC5F,MACF,CAMA,GAJI,CAAC,EAAkB,EAAmB,EAAQ,aAAa,GAI3D,EAAQ,mBAAmB,IAAI,CAAiB,EAClD,OAEF,EAAQ,mBAAmB,IAAI,CAAiB,EAEhD,IAAI,EACJ,GAAI,CACF,EAAU,MAAM,EAAQ,EAAW,CAAE,cAAe,EAAK,CAAC,CAC5D,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAW,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EAC5F,MACF,CAEA,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,GACf,MAAM,EAAqB,EAAW,CAAO,CAEjD,CACF,CAEA,eAAe,EAAiB,EAAc,EAAmB,EAAqC,CACpG,IAAI,EACJ,GAAI,CACF,EAAe,MAAM,EAAS,CAAS,CACzC,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAW,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EAC5F,MACF,CAEA,GAAI,CAAC,EAAkB,EAAc,EAAQ,aAAa,EACxD,OAGF,IAAI,EACJ,GAAI,CACF,EAAY,MAAM,EAAK,CAAS,CAClC,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAW,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EAC5F,MACF,CAEA,GAAI,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,MAAM,EAAqB,EAAW,EAAS,EAAc,CAAY,CAE7E,CAEA,eAAe,EACb,EACA,EACA,EAAe,EACf,EACe,CACf,IAAM,EAAW,EAAY,EAAc,EAAQ,OAAO,EACtD,GACF,MAAM,EAAY,EAAM,EAAU,YAAa,EAAS,CAAQ,CAEpE,CAEA,eAAe,EACb,EACA,EACA,EACA,EACA,EACe,CACf,GAAI,CACF,IAAM,EAAe,GAAa,MAAM,EAAS,CAAI,EACrD,GAAI,EAAQ,aAAa,IAAI,CAAY,EACvC,OAEF,EAAQ,aAAa,IAAI,CAAY,EAErC,IAAM,EAAO,MAAM,EAAS,EAAM,MAAM,EAClC,EAAiB,CAAE,WAAU,YAAa,EAAQ,QAAQ,WAAY,EACtE,EAA2B,CAAE,OAAM,QAAS,EAAY,EAAM,CAAc,CAAE,EAIpF,GAAI,IAAS,YACX,GAAI,CACF,EAAY,sBAAwB,EAA6B,EAAM,CAAc,CACvF,OAAS,EAAO,CAGd,EAAQ,SAAS,KACf,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,mDAAmD,EAAY,CAAK,GACjH,CACF,CAEF,EAAQ,MAAM,KAAK,CAAW,CAChC,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,CACzF,CACF,CAGA,SAAS,EAAwB,EAA0B,CACzD,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,WAAY,CAAsB,CAAC,EAAI,CAAC,CACjH,EACI,EAAY,OAAS,IAGzB,EAAO,qBAAuB,EAA4B,CAAW,EACvE,CAEA,SAAS,GACP,EACA,EACA,EACA,EACA,EACA,EACA,EACe,CACf,IAAM,EAAqB,IAAI,IAAI,GAAc,MAAM,IAAK,GAAS,CAAC,EAAK,KAAM,CAAI,CAAC,CAAC,EACjF,EAAW,EAAM,SAAS,CAAE,OAAM,aAAc,CACpD,IAAM,EAAc,EAAQ,UAAU,KACnC,GAAO,EAAG,YAAc,EAAiB,EAAM,EAAI,EAAuB,CAA0B,CACvG,EACM,EAAa,EAAkB,EAAS,EAAQ,SAAU,CAAW,EAC3E,MAAO,CACL,GAAG,GACD,EACA,EACA,EAAmB,IAAI,EAAW,EAAM,CAAW,CAAC,EACpD,EACA,EACA,CACF,EACA,GAAG,EAAQ,UAAU,QAAS,GAC5B,GACE,EACA,EAAQ,SACR,EACA,EACA,EACA,EACA,CACF,CACF,CACF,CACF,CAAC,EAGD,OADA,EAAS,KAAK,CAAmB,EAC1B,CACT,CAEA,SAAS,GACP,EACA,EACA,EACA,EACA,EACA,EACe,CACf,IAAM,EAA0B,CAAC,EAC3B,EAAgB,EAAW,EAAM,CAAW,EAClD,EAAW,EAAU,WAAY,EAAQ,MAAM,KAAM,EAAW,OAAO,EACvE,EAAW,EAAU,iBAAkB,EAAQ,SAAS,kBAAmB,EAAW,MAAM,EAC5F,IAAM,EAAuB,GAA2B,EAAQ,YAAY,oBAAoB,EAwEhG,OAvEA,EACE,EACA,oBACA,EAAQ,YAAY,oBACpB,EAAW,eACX,CACF,EAMA,EACE,EACA,uBACA,KAAK,MAAM,EAAQ,YAAY,iBAAmB,GAAG,EACrD,EAAW,wBACX,CACF,EACI,GAEF,EACE,EACA,+BACA,OAAO,OAAO,EAAqB,+BAAgC,CAAa,EAC3E,EAAqB,+BAA+B,IAAkB,EACvE,EACJ,EAAW,wBACX,GAA+B,EAAsB,CAAa,CACpE,EAEE,KACuB,EAAQ,MAAM,MAAQ,KAAO,EAAa,4BAA8B,IAE/F,EACE,EACA,gCACA,EAAa,+BACb,EAAW,oBACb,GAGA,EAAS,OAAS,GAClB,EAAa,4BAA8B,GAC3C,EAAa,uBAAuB,OAAS,EAAW,yBAExD,EAAW,EAAU,qBAAsB,EAAa,uBAAwB,EAAW,iBAAiB,EAE9G,EACE,EACA,0BACA,EAAa,uBAAuB,MACpC,EAAW,sBACb,EACA,EACE,EACA,iBACA,EAAa,uBAAuB,mBACpC,EAAW,aACb,EACA,EACE,EACA,0BACA,EAAa,0BACb,EAAW,oBACb,GAEE,EAAS,SAAW,EACf,CAAC,EAGH,CACL,CACE,KAAM,EACN,SAAU,EAAQ,SAClB,KAAM,OACN,qBAAsB,EAAQ,qBAC9B,oBAAqB,EAAQ,oBAC7B,WACA,MAAO,EAAgB,CAAQ,CACjC,CACF,CACF,CAEA,SAAS,GACP,EACA,EACA,EACA,EACA,EACA,EACA,EACe,CACf,IAAM,EAAM,EAAG,QAAU,EAAG,UAAY,EAClC,EAAc,EAAiB,EAAM,EAAI,EAAuB,CAA0B,EAC1F,EAAO,EAAc,YAAc,WACnC,EAA0B,CAAC,EAWjC,OAVA,EAAW,EAAU,uBAAwB,EAAG,oBAAqB,EAAW,SAAS,EACzF,EAAW,EAAU,wBAAyB,EAAG,qBAAsB,EAAW,UAAU,EAC5F,EAAW,EAAU,EAAc,gBAAkB,eAAgB,EAAK,EAAgB,EAAa,CAAU,CAAC,EAClH,EAAW,EAAU,iBAAkB,EAAG,UAAW,EAAW,IAAI,EACpE,EAAW,EAAU,UAAW,EAAG,OAAQ,EAAW,MAAM,EAC5D,EAAW,EAAU,aAAc,EAAG,eAAgB,EAAW,SAAS,EACtE,EAAS,SAAW,EACf,CAAC,EAGH,CACL,CACE,KAAM,EAAW,EAAM,CAAW,EAClC,WACA,OACA,KAAM,EAAG,MAAQ,cACjB,UAAW,EAAG,UACd,QAAS,EAAG,QACZ,qBAAsB,EAAG,qBACzB,oBAAqB,EAAG,oBACxB,WACA,MAAO,EAAgB,CAAQ,CACjC,CACF,CACF,CAEA,SAAS,EAAW,EAAyB,EAAgB,EAAe,EAAmB,EAAuB,CAChH,EAAQ,GAIZ,EAAS,KAAK,CAAE,SAAQ,QAAO,YAAW,MAAO,EAAQ,EAAW,QAAO,CAAC,CAC9E,CAGA,SAAS,GACP,EACA,EACoB,CACpB,IAAM,EAAW,EAAqB,OAAO,OAAQ,GAAU,EAAM,MAAM,SAAS,CAAa,CAAC,EAC9F,KAAS,SAAW,EAcxB,MAAO,GAXW,EACf,MAAM,EAAG,CAAiC,CAAC,CAC3C,IAAK,GACJ,EAAM,YACH,KAAK,CAAE,OAAM,YAAW,aACvB,IAAS,EAAgB,GAAG,EAAU,GAAG,IAAY,GAAG,EAAK,GAAG,EAAU,GAAG,GAC/E,CAAC,CACA,KAAK,KAAK,CACf,CAAC,CACA,KAAK,IAEU,IADM,EAAS,OAAS,EAAoC,QAAU,IAE1F,CAGA,SAAS,GAA2B,EAAwE,CACtG,KAAO,SAAW,EAItB,OAAO,EAAO,IAAK,GAAU,EAAM,KAAK,CAAE,YAAW,aAAc,GAAG,EAAU,GAAG,GAAS,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,CACtH,CAEA,SAAS,EACP,EACA,EACA,EACA,EACS,CACT,OACE,GAAuB,IAAI,EAAoB,EAAM,EAAG,UAAW,EAAG,WAAW,CAAC,IACjF,EAAG,KAAO,GAA4B,IAAI,EAAwB,EAAM,EAAG,KAAM,EAAG,SAAS,CAAC,EAAI,KACnG,EAEJ,CAEA,SAAS,EAAgB,EAAsB,EAAgC,CAC7E,OAAO,EAAc,EAAW,aAAe,EAAW,WAC5D,CAEA,SAAS,EAAoB,EAAc,EAAmB,EAA6B,CACzF,MAAO,GAAG,EAAK,QAAQ,CAAI,EAAE,GAAG,EAAU,GAAG,GAC/C,CAEA,SAAS,EAAwB,EAAc,EAAc,EAA2B,CACtF,MAAO,GAAG,EAAK,QAAQ,CAAI,EAAE,GAAG,EAAK,GAAG,GAC1C,CAEA,SAAS,EAAgB,EAAiC,CACxD,OAAO,KAAK,IAAI,GAAG,EAAS,IAAK,GAAY,EAAQ,KAAK,CAAC,CAC7D,CAEA,SAAS,EAAoB,EAAmB,EAA4B,CAC1E,OACE,EAAM,MAAQ,EAAK,OACnB,EAAK,KAAK,cAAc,EAAM,IAAI,IACjC,EAAK,WAAa,IAAM,EAAM,WAAa,KAC3C,EAAK,SAAW,IAAM,EAAM,SAAW,IACxC,EAAK,KAAK,cAAc,EAAM,IAAI,CAEtC,CAEA,SAAS,EAAU,EAAoB,EAAsB,EAAgC,CAC3F,IAAM,EAAU,EAAU,EAAO,KAAK,EAChC,EAAgB,EAAM,MAAM,EAAG,EAAQ,WAAW,EACxD,EACE,KAAK,UACH,CACE,UACA,WAAY,EAAQ,WACpB,kBAAmB,EAAQ,kBAC3B,WAAY,EAAM,OAClB,UAAW,EAAc,OAAS,EAAM,OACxC,aACE,EAAQ,aAAe,EACnB,EAAiB,EAAO,MAAO,EAAQ,aAAc,EAAO,WAAW,EACvE,IAAA,GACN,aAAc,EAAO,aACrB,qBAAsB,EAAO,qBAC7B,kBAAmB,EAAO,kBAC1B,MAAO,EACP,OAAQ,EAAO,OACf,SAAU,EAAO,QACnB,EACA,IAAA,GACA,CACF,EAAI;CACN,CACF,CAEA,SAAS,EAAgB,EAAgB,EAAoB,EAAsB,EAAgC,CACjH,GAAI,EAAO,WAAY,CACrB,EAAY,UAAU,EAAO,WAAW,GAAG,EAC3C,MACF,CAEA,GAAM,CAAE,cAAe,EACjB,EAAU,EAAU,EAAO,KAAK,EACtC,EAAY,YAAY,EAAQ,UAAU,eAAe,EAAO,GAAG,EACnE,EACE,OAAO,EAAQ,YAAY,SAAS,EAAQ,UAAU,cAAc,EAAQ,cAAc,mBAAmB,EAAQ,wBAAwB,kBAAkB,EAAQ,uBAAuB,GAChM,EACA,EACE,SAAS,EAAQ,UAAU,mBAAmB,EAAQ,kBAAkB,mBAAmB,EAAQ,aAAa,YAAY,EAAQ,kBAAkB,YAAY,EAAQ,YAAY,GACxL,EACA,EACE,oBAAoB,EAAQ,oBAAoB,iBAAiB,EAAQ,eAAe,eAAe,EAAQ,eAAe,iBAAiB,EAAQ,iCAAiC,QAAQ,CAAC,EAAE,GACrM,EACI,EAAO,cACT,EAAY,GAAG,GAA0B,EAAO,YAAY,EAAE,GAAG,EAE/D,EAAO,mBACT,EAAY,GAAG,GAA+B,EAAO,iBAAiB,EAAE,GAAG,EAE7E,EACE,gCAAgC,EAAW,QAAQ,oBAAoB,EAAW,YAAY,qBAAqB,EAAW,aAAa,iBAAiB,EAAW,UAAU,kBAAkB,EAAW,WAAW,aAAa,EAAW,KAAK,eAAe,EAAW,OAAO,eAAe,EAAW,OAAO,kBAAkB,EAAW,UAAU,yBAAyB,EAAW,eAAe,4BAA4B,EAAW,wBAAwB,oCAAoC,EAAW,wBAAwB,GAC1hB,EACA,IAAM,EAAmB,EAAuB,EAAQ,iBAAiB,EAKzE,GAJI,GACF,EAAY,2BAA2B,EAAiB,GAAG,EAGzD,EAAM,SAAW,EACnB,EAAY;CAAgC,MACvC,CACL,IAAM,EAAgB,EAAM,MAAM,EAAG,EAAQ,WAAW,EAClD,EAAc,EAAM,OAAS,EAAc,OAAS,OAAO,EAAM,SAAW,GAClF,EAAY,6BAA6B,EAAc,SAAS,EAAY,KAAK,EACjF,IAAK,IAAM,KAAQ,EACjB,EAAY,GAAG,EAAmB,CAAI,EAAE,GAAG,GAAe,CAAI,EAAE,GAAG,GAAkB,CAAI,EAAE,GAAG,CAElG,CAEA,IAAM,EAAkB,EAAO,sBAAsB,QAAU,CAAC,EAChE,GAAI,EAAgB,OAAS,EAAG,CAC9B,IAAM,EAAiB,EAAgB,MAAM,EAAG,EAA+B,EACzE,EAAc,EAAgB,OAAS,EAAe,OAAS,OAAO,EAAgB,SAAW,GACvG,EAAY,sCAAsC,EAAe,SAAS,EAAY,KAAK,EAC3F,IAAK,IAAM,KAAS,EAClB,EACE,GAAG,EAAM,WAAW,WAAW,EAAM,YAClC,KAAK,CAAE,OAAM,YAAW,aAAc,GAAG,EAAK,GAAG,EAAU,GAAG,GAAS,CAAC,CACxE,KAAK,IAAI,EAAE,GAChB,CAEJ,CAEA,IAAM,EAAwB,EAAO,cAAc,uBAAyB,CAAC,EAC7E,GAAI,EAAsB,OAAS,EAAG,CACpC,IAAM,EAAiB,EACpB,UAAU,EAAM,IAAU,EAAM,MAAM,OAAS,EAAK,MAAM,QAAU,EAAK,KAAK,cAAc,EAAM,IAAI,CAAC,CAAC,CACxG,MAAM,EAAG,EAA4B,EAClC,EACJ,EAAsB,OAAS,EAAe,OAAS,OAAO,EAAsB,SAAW,GACjG,EAAY,4BAA4B,EAAe,SAAS,EAAY,KAAK,EACjF,IAAK,IAAM,KAAS,EAClB,EACE,GAAG,EAAM,KAAK,IAAI,EAAM,aAAa,IAAK,GAAgB,GAAG,EAAY,KAAK,GAAG,EAAY,MAAM,CAAC,CAAC,KAAK,IAAI,EAAE,GAClH,CAEJ,CAEA,GAAI,EAAQ,aAAe,EAAG,CAC5B,IAAM,EAAe,EAAiB,EAAO,MAAO,EAAQ,aAAc,EAAO,WAAW,EAC5F,EAAY,oCAAoC,EAAa,OAAO,KAAK,EACzE,IAAK,GAAM,CAAE,OAAM,aAAa,EAC9B,EAAY,GAAG,EAAK,aAAa,EAAQ,IAAI,CAEjD,CAEA,GAAI,EAAO,SAAS,OAAS,EAAG,CAC9B,EAAY,cAAc,EAAO,SAAS,OAAO,4DAA4D,EAC7G,IAAK,IAAM,KAAW,EAAO,SAAS,MAAM,EAAG,EAAE,EAC/C,EAAY,KAAK,EAAQ,GAAG,EAE1B,EAAO,SAAS,OAAS,IAC3B,EAAY,SAAS,EAAO,SAAS,OAAS,GAAG,QAAQ,CAE7D,CAEA,GAAI,EAAO,OAAO,OAAS,EAAG,CAC5B,EAAY,aAAa,EAAO,OAAO,OAAO,yBAAyB,EACvE,IAAK,IAAM,KAAS,EAAO,OAAO,MAAM,EAAG,EAAE,EAC3C,EAAY,KAAK,EAAM,GAAG,EAExB,EAAO,OAAO,OAAS,IACzB,EAAY,SAAS,EAAO,OAAO,OAAS,GAAG,QAAQ,CAE3D,CACF,CAEA,SAAS,EACP,EACA,EACA,EACqC,CACrC,OAAO,EACJ,KAAK,CAAE,OAAM,cAAe,CAAE,KAAM,EAAW,EAAM,CAAW,EAAG,QAAS,EAAQ,MAAM,IAAK,EAAE,CAAC,CAClG,UAAU,EAAM,IAAU,EAAM,QAAU,EAAK,SAAW,EAAK,KAAK,cAAc,EAAM,IAAI,CAAC,CAAC,CAC9F,MAAM,EAAG,CAAK,CACnB,CAEA,SAAS,EAAuB,EAAiE,CAC/F,OAAO,OAAO,QAAQ,CAAiB,CAAC,CACrC,KACE,CAAC,EAAS,KACT,GAAG,EAAQ,KAAK,OAAO,QAAQ,CAAS,CAAC,CACtC,KAAK,CAAC,EAAQ,KAAW,GAAG,EAAO,GAAG,GAAO,CAAC,CAC9C,KAAK,IAAI,EAAE,GAClB,CAAC,CACA,KAAK,IAAI,CACd,CAEA,SAAS,EAAmB,EAA2B,CACrD,OAAO,EAAK,YAAc,IAAA,IAAa,EAAK,UAAY,IAAA,GACpD,EAAK,KACL,GAAG,EAAK,KAAK,GAAG,EAAK,UAAU,GAAG,EAAK,SAC7C,CAEA,SAAS,GAAe,EAA2B,CACjD,OAAO,EAAK,KAAO,GAAG,EAAK,KAAK,GAAG,EAAK,OAAS,EAAK,IACxD,CAEA,SAAS,GAAkB,EAA2B,CAOpD,MAAO,IANa,EAAK,SACtB,IACE,GACC,GAAG,EAAQ,OAAO,GAAG,EAAkB,EAAQ,KAAK,EAAE,MAAM,EAAkB,EAAQ,SAAS,IAAI,EAAQ,OAAS,KAAK,EAAQ,OAAO,GAAK,IACjJ,CAAC,CACA,KAAK,IACa,EAAE,eAAe,EAAK,qBAAqB,cAAc,EAAK,oBAAoB,EACzG,CAEA,SAAS,EAAkB,EAAuB,CAChD,OAAO,OAAO,UAAU,CAAK,EAAI,OAAO,CAAK,EAAI,EAAM,QAAQ,CAAC,CAClE,CAEA,SAAS,GAA0B,EAAsC,CACvE,IAAM,EAAwB,KAAK,IACjC,EACA,GAAG,EAAQ,MAAM,IAAK,GAAS,EAAK,uBAAuB,kBAAkB,CAC/E,EACA,MAAO,oCAAoC,EAAQ,kCAAkC,2BAA2B,EAAQ,0BAA0B,gCAAgC,EAAQ,+BAA+B,uBAAuB,EAAsB,4BAA4B,EAAQ,sBAAsB,QAClU,CAEA,SAAS,GAA+B,EAA2C,CACjF,MAAO,iCAAiC,EAAQ,cAAc,mBAAmB,EAAQ,sBAAsB,yBAAyB,EAAQ,wBAAwB,mBAAmB,EAAQ,4BAA4B,GAAG,EAAQ,oBAAoB,KAAK,EAAQ,4BAA8B,IAAA,CAAK,QAAQ,CAAC,EAAE,GAC3T,CAEA,SAAS,EAAU,EAmBjB,CACA,IAAI,EAAgB,EAChB,EAAc,EACd,EAA0B,EAC1B,EAAyB,EACzB,EAAY,EACZ,EAAY,EACZ,EAAoB,EACpB,EAAe,EACf,EAAoB,EACpB,EAAsB,EACtB,EAAsB,EACtB,EAAc,EACd,EAAgB,EAChB,EAAsB,EACtB,EAAiB,EACjB,EAAiB,EACjB,EAAwB,EAE5B,IAAK,IAAM,KAAQ,EACjB,GAAiB,EAAK,QAAQ,cAC9B,GAAe,EAAK,QAAQ,MAAM,KAClC,EAA0B,KAAK,IAAI,EAAyB,EAAK,QAAQ,uBAAuB,EAChG,EAAyB,KAAK,IAAI,EAAwB,EAAK,QAAQ,sBAAsB,EAC7F,GAAa,EAAK,QAAQ,UAC1B,GAAa,EAAK,QAAQ,UAAU,UACpC,GAAqB,EAAK,QAAQ,UAAU,kBAC5C,EAAe,KAAK,IAAI,EAAc,EAAK,QAAQ,UAAU,YAAY,EACzE,GAAqB,EAAK,QAAQ,SAAS,kBAC3C,GAAuB,EAAK,QAAQ,SAAS,oBAC7C,GAAuB,EAAK,QAAQ,SAAS,oBAC7C,GAAe,EAAK,QAAQ,SAAS,YACrC,GAAiB,EAAK,QAAQ,SAAS,iCACvC,GAAuB,EAAK,QAAQ,eAAe,oBACnD,GAAkB,EAAK,QAAQ,eAAe,eAC9C,GAAkB,EAAK,QAAQ,eAAe,eAC9C,GAAyB,EAAK,QAAQ,eAAe,sBAGvD,MAAO,CACL,UAAW,EAAM,OACjB,gBACA,cACA,0BACA,yBACA,YACA,YACA,oBACA,eACA,oBACA,sBACA,sBACA,cACA,iCAAkC,EAAM,SAAW,EAAI,EAAI,EAAgB,EAAM,OACjF,sBACA,iBACA,iBACA,uBACF,CACF,CAEA,SAAS,EAAoB,EAAc,EAAmC,CAS5E,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,CAEA,SAAS,EAAY,EAAc,EAA0B,EAAiB,GAAiC,CAC7G,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,KAM/B,GAAC,GACD,CAAC,EAAQ,eACR,GAAgB,KAAK,EAAK,SAAS,CAAI,CAAC,GAAK,GAAoB,KAAK,EAAK,SAAS,CAAI,CAAC,IAU5F,OAJI,EAAK,QAAQ,CAAI,IAAM,KAClB,MAGF,EAAoB,IAAI,EAAK,QAAQ,CAAS,CAAC,CACxD,CAEA,SAAS,EAAoB,EAAuB,CAClD,IAAM,EAAS,EAAqB,CAAK,EACzC,GAAI,EAAS,IACX,MAAM,IAAI,EAAqB,wCAAwC,EAEzE,OAAO,CACT,CAEA,SAAS,GAAwB,EAAuB,CACtD,GAAI,CAAC,SAAS,KAAK,CAAK,EACtB,MAAM,IAAI,EAAqB,kCAAkC,EAGnE,IAAM,EAAS,OAAO,CAAK,EAC3B,GAAI,CAAC,OAAO,cAAc,CAAM,GAAK,EAAS,EAC5C,MAAM,IAAI,EAAqB,kCAAkC,EAEnE,OAAO,CACT,CAEA,SAAS,EAAqB,EAAuB,CACnD,GAAI,CAAC,cAAc,KAAK,CAAK,EAC3B,MAAM,IAAI,EAAqB,8BAA8B,EAG/D,IAAM,EAAS,OAAO,CAAK,EAC3B,GAAI,CAAC,OAAO,cAAc,CAAM,GAAK,EAAS,EAC5C,MAAM,IAAI,EAAqB,8BAA8B,EAE/D,OAAO,CACT,CAEA,SAAS,EAAW,EAAc,EAAsB,CACtD,OAAO,EAAK,SAAS,EAAM,CAAI,GAAK,EAAK,SAAS,CAAI,CACxD,CAEA,SAAS,EAAY,EAAuB,CAC1C,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAS,EAAY,EAAuB,CAC1C,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAS,EAAY,EAAwB,CAC3C,OAAO,aAAiB,MAAQ,EAAM,QAAU,OAAO,CAAK,CAC9D"}
+{"version":3,"file":"cli.js","names":[],"sources":["../src/cli.ts"],"sourcesContent":["#!/usr/bin/env node\n\nimport { readdir, readFile, realpath, stat } from 'node:fs/promises';\nimport os from 'node:os';\nimport path from 'node:path';\nimport { Command, InvalidArgumentError } from 'commander';\nimport { measureArchitecture, type ArchitectureFileMetrics, type ArchitectureMetrics } from './architectureMetrics.js';\nimport {\n  type CliOptions,\n  configFileName,\n  loadConfig,\n  type ResolvedOptions,\n  resolveOptions,\n  resolveThresholds,\n  type Thresholds,\n} from './cliConfig.js';\nimport { measureCrossFileDuplication, type CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport type { CrossFileDuplicationFileData } from './duplication.js';\nimport { collectCrossFileDuplicationFileData, measureCode } from './metrics.js';\nimport { measureTypeScriptProject, type TypeScriptProjectMetrics } from './typescriptProject.js';\nimport type { CodeMetrics, FunctionMetrics, LanguageName } from './types.js';\n\ninterface 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\ninterface RiskTrigger {\n  /** Optional location hint (e.g. duplicated block line ranges) appended to the printed trigger. */\n  detail?: string;\n  metric: string;\n  score: number;\n  threshold: number;\n  value: number;\n}\n\ninterface RiskFinding {\n  cognitiveComplexity: number;\n  cyclomaticComplexity: number;\n  endLine?: number;\n  file: string;\n  kind: 'component' | 'file' | 'function';\n  language: LanguageName;\n  name?: string;\n  score: number;\n  startLine?: number;\n  triggers: RiskTrigger[];\n}\n\ninterface ScanResult {\n  architecture?: ArchitectureMetrics;\n  componentFunctionKeys?: Set<string>;\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  fatalError?: string;\n  files: FileMetrics[];\n  namedComponentFunctionKeys?: Set<string>;\n  typeScriptProject?: TypeScriptProjectMetrics;\n}\n\nconst languageByExtension = new Map<string, LanguageName>([\n  ['.c', 'c'],\n  ['.c++', 'cpp'],\n  ['.cc', 'cpp'],\n  ['.cjs', 'javascript'],\n  ['.cp', 'cpp'],\n  ['.cpp', 'cpp'],\n  ['.tcc', 'cpp'],\n  ['.cts', 'typescript'],\n  ['.cxx', 'cpp'],\n  ['.go', 'go'],\n  // Headers may be C or C++; the C++ grammar parses both.\n  ['.h', 'cpp'],\n  ['.hh', 'cpp'],\n  ['.hpp', 'cpp'],\n  ['.hxx', 'cpp'],\n  ['.java', 'java'],\n  ['.js', 'javascript'],\n  ['.jsx', 'jsx'],\n  ['.mjs', 'javascript'],\n  ['.mts', 'typescript'],\n  ['.py', 'python'],\n  ['.rb', 'ruby'],\n  ['.rs', 'rust'],\n  ['.ts', 'typescript'],\n  ['.tsx', 'tsx'],\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  'target',\n  'test-fixtures',\n  'vendor',\n  'venv',\n]);\n\n/** Caps the `Duplicate symbols` section so large repositories do not flood the report. */\nconst maxDuplicateSymbolGroupLines = 10;\n/** Caps the `Cross-file duplicate blocks` section so large repositories do not flood the report. */\nconst maxCrossFileDuplicateGroupLines = 10;\n/** Caps how many cross-file group locations a single risk finding repeats as detail. */\nconst maxCrossFileDuplicateDetailGroups = 3;\n\nconst testDirectoryNames = new Set(['__tests__', 'test', 'tests', 'spec']);\nconst testFilePattern = /(?:^test(?:[_-].*)?|\\.(?:spec|test)|[_-](?:test|spec))\\.[^.]+$/iu;\n// JUnit tests use a case-sensitive `Test.java` suffix; case-insensitive matching would catch\n// production files like `contest.java`.\nconst javaTestFilePattern = /Test\\.java$/u;\n\n// oxlint-disable-next-line unicorn/prefer-top-level-await -- CommonJS build output cannot preserve top-level await.\nvoid main().catch((error: unknown) => {\n  writeStderr(`Error: ${formatError(error)}\\n`);\n  process.exitCode = 1;\n});\n\nasync function main(): Promise<void> {\n  const program = new Command()\n    .name('code-gauge')\n    .description('Measure code metrics and list high-risk findings.')\n    .argument('[target]', 'file or directory to measure', '.')\n    .option('--config <path>', `config file to use instead of the auto-detected ${configFileName}`)\n    .option('--file-loc-threshold <number>', 'minimum file code LOC to report', parsePositiveInteger)\n    .option('--function-loc-threshold <number>', 'minimum function physical LOC span to report', parsePositiveInteger)\n    .option(\n      '--component-loc-threshold <number>',\n      'minimum React component physical LOC span to report',\n      parsePositiveInteger\n    )\n    .option('--cognitive-threshold <number>', 'minimum cognitive complexity to report', parsePositiveInteger)\n    .option('--cyclomatic-threshold <number>', 'minimum cyclomatic complexity to report', parsePositiveInteger)\n    .option('--call-threshold <number>', 'minimum function call count to report', parsePositiveInteger)\n    .option('--import-threshold <number>', 'minimum unique import sources per file to report', parsePositiveInteger)\n    .option('--fan-out-threshold <number>', 'minimum intra-file fan-out per function to report', parsePositiveInteger)\n    .option('--parameter-threshold <number>', 'minimum function parameter count to report', parsePositiveInteger)\n    .option(\n      '--duplicate-block-threshold <number>',\n      'minimum count of duplicated code blocks per file to report',\n      parsePositiveInteger\n    )\n    .option(\n      '--duplication-ratio-percent-threshold <number>',\n      'minimum percentage (1-100) of duplicated lines per file to report',\n      parsePercentInteger\n    )\n    .option(\n      '--cross-file-duplicate-block-threshold <number>',\n      'minimum count of cross-file duplicate block groups per file to report',\n      parsePositiveInteger\n    )\n    .option(\n      '--duplication-min-tokens <number>',\n      'minimum normalized token count for a duplicate region (default 40)',\n      parsePositiveInteger\n    )\n    .option(\n      '--duplication-max-gap-tokens <number>',\n      'maximum token gap merged into one gapped clone group; 0 disables merging (default 30)',\n      parseNonNegativeInteger\n    )\n    .option(\n      '--duplication-min-similarity-percent <number>',\n      'minimum similarity percent (1-100) for near-miss (Type-3) clone blocks; 100 reports exact matches only (default 70)',\n      parsePercentInteger\n    )\n    .option(\n      '--transitive-dependency-threshold <number>',\n      'minimum transitively reachable local files to report',\n      parsePositiveInteger\n    )\n    .option(\n      '--structural-breadth-threshold <number>',\n      'minimum structural breadth score to report',\n      parsePositiveInteger\n    )\n    .option(\n      '--structural-coordination-threshold <number>',\n      'minimum structural coordination score to report',\n      parsePositiveInteger\n    )\n    .option('--state-mutation-threshold <number>', 'minimum state mutation score to report', parsePositiveInteger)\n    .option(\n      '--duplicate-symbol-group-threshold <number>',\n      'minimum duplicate symbol group count to report',\n      parsePositiveInteger\n    )\n    .option('--max-findings <number>', 'maximum number of risk findings to print', parsePositiveInteger)\n    .option('--largest-files <number>', 'number of largest files by code LOC to list', parsePositiveInteger)\n    .option('--include-tests', 'include test files and test directories')\n    .option('--tsconfig <path>', 'TypeScript project file to use instead of auto-detected tsconfig.json')\n    .option('--json', 'print JSON output')\n    .option('--fail-on-error', 'exit with code 1 when files or directories cannot be scanned')\n    .option('--fail-on-risk', 'exit with code 1 when high-risk findings are found');\n\n  program.action(async (target: string, cliOptions: CliOptions) => {\n    const resolvedTarget = resolveTarget(target);\n    const config = await loadConfig(cliOptions.config, await configSearchDirectory(resolvedTarget));\n    const options = resolveOptions(cliOptions, config);\n    const result = await scanTarget(resolvedTarget, options);\n    addCrossFileDuplication(result, options);\n    await addArchitectureMetrics(result);\n    await addTypeScriptProjectMetrics(result, options, resolvedTarget);\n    const risks = findRiskyFunctions(\n      result.files,\n      result.architecture,\n      result.crossFileDuplication,\n      result.componentFunctionKeys,\n      result.namedComponentFunctionKeys,\n      options,\n      result.displayRoot\n    );\n\n    if (options.json) {\n      printJson(result, risks, options);\n    } else {\n      printTextReport(resolvedTarget, result, risks, options);\n    }\n\n    if (\n      result.fatalError ||\n      (options.failOnError && result.errors.length > 0) ||\n      (options.failOnRisk && risks.length > 0)\n    ) {\n      process.exitCode = 1;\n    }\n  });\n\n  await program.parseAsync();\n}\n\nfunction 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). */\nasync 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: ResolvedOptions;\n  files: FileMetrics[];\n  errors: string[];\n  warnings: string[];\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}\n\nasync function scanTarget(target: string, options: ResolvedOptions): Promise<ScanResult> {\n  const files: FileMetrics[] = [];\n  const errors: string[] = [];\n  const warnings: string[] = [];\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)}: ${formatError(error)}`;\n    return { displayRoot: fallbackDisplayRoot, files, errors: [fatalError], warnings, fatalError };\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, fatalError };\n    }\n\n    const context = makeScanContext(options, files, errors, warnings, displayRoot);\n    await measureFile(canonicalTarget, language, 'single-file', context, canonicalTarget);\n    return { displayRoot, files, errors, warnings };\n  }\n\n  await scanDirectory(canonicalTarget, makeScanContext(options, files, errors, warnings, canonicalTarget));\n  return { displayRoot: canonicalTarget, files, errors, warnings };\n}\n\nfunction makeScanContext(\n  options: ResolvedOptions,\n  files: FileMetrics[],\n  errors: string[],\n  warnings: string[],\n  rootDirectory: string\n): ScanContext {\n  return { options, files, errors, warnings, visitedDirectories: new Set(), visitedFiles: new Set(), rootDirectory };\n}\n\nasync function addTypeScriptProjectMetrics(\n  result: ScanResult,\n  options: ResolvedOptions,\n  resolvedTarget: string\n): Promise<void> {\n  if (result.fatalError) {\n    return;\n  }\n  if (result.files.length === 0) {\n    return;\n  }\n\n  const explicitConfigFile = options.tsconfig;\n  const isExplicitConfig = explicitConfigFile !== undefined;\n  if (!isExplicitConfig && !result.files.some(({ file }) => isTypeScriptProjectCandidateFile(file))) {\n    return;\n  }\n\n  const configFile = explicitConfigFile ? resolveTarget(explicitConfigFile) : await findNearestTsconfig(resolvedTarget);\n  if (!configFile) {\n    return;\n  }\n\n  try {\n    result.typeScriptProject = await measureTypeScriptProject(\n      configFile,\n      result.files.map(({ file }) => file)\n    );\n    result.componentFunctionKeys = new Set(\n      result.typeScriptProject.reactComponentFunctions.map((component) =>\n        functionLocationKey(component.file, component.startLine, component.startColumn)\n      )\n    );\n    result.namedComponentFunctionKeys = new Set(\n      result.typeScriptProject.reactComponentFunctions.flatMap((component) =>\n        component.name ? [functionNameLocationKey(component.file, component.name, component.startLine)] : []\n      )\n    );\n  } catch (error) {\n    if (isExplicitConfig) {\n      result.errors.push(`${formatPath(configFile, result.displayRoot)}: ${formatError(error)}`);\n    }\n  }\n}\n\nfunction isTypeScriptProjectCandidateFile(file: string): boolean {\n  return ['.cjs', '.cts', '.js', '.jsx', '.mjs', '.mts', '.ts', '.tsx'].includes(path.extname(file));\n}\n\nasync function findNearestTsconfig(target: string): Promise<string | undefined> {\n  const targetStat = await stat(target);\n  let currentDirectory = targetStat.isDirectory() ? target : path.dirname(target);\n  while (true) {\n    const configFile = path.join(currentDirectory, 'tsconfig.json');\n    if (await fileExists(configFile)) {\n      return configFile;\n    }\n\n    const parentDirectory = path.dirname(currentDirectory);\n    if (parentDirectory === currentDirectory) {\n      return undefined;\n    }\n    currentDirectory = parentDirectory;\n  }\n}\n\nasync function fileExists(file: string): Promise<boolean> {\n  try {\n    const fileStat = await stat(file);\n    return fileStat.isFile();\n  } catch {\n    return false;\n  }\n}\n\nasync function addArchitectureMetrics(result: ScanResult): Promise<void> {\n  if (result.fatalError) {\n    return;\n  }\n\n  try {\n    result.architecture = measureArchitecture(\n      result.files.map(({ file, metrics }) => ({ file, metrics })),\n      result.displayRoot\n    );\n  } catch (error) {\n    result.errors.push(`architecture metrics: ${formatError(error)}`);\n  }\n}\n\nasync function scanDirectory(directory: string, context: ScanContext): Promise<void> {\n  let resolvedDirectory;\n  try {\n    resolvedDirectory = await realpath(directory);\n  } catch (error) {\n    context.errors.push(`${formatPath(directory, context.rootDirectory)}: ${formatError(error)}`);\n    return;\n  }\n\n  if (!isWithinDirectory(resolvedDirectory, context.rootDirectory)) {\n    return;\n  }\n\n  if (context.visitedDirectories.has(resolvedDirectory)) {\n    return;\n  }\n  context.visitedDirectories.add(resolvedDirectory);\n\n  let entries;\n  try {\n    entries = await readdir(directory, { withFileTypes: true });\n  } catch (error) {\n    context.errors.push(`${formatPath(directory, context.rootDirectory)}: ${formatError(error)}`);\n    return;\n  }\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      await measureScannableFile(entryPath, context);\n    }\n  }\n}\n\nasync function scanSymbolicLink(name: string, entryPath: string, context: ScanContext): Promise<void> {\n  let resolvedPath;\n  try {\n    resolvedPath = await realpath(entryPath);\n  } catch (error) {\n    context.errors.push(`${formatPath(entryPath, context.rootDirectory)}: ${formatError(error)}`);\n    return;\n  }\n\n  if (!isWithinDirectory(resolvedPath, context.rootDirectory)) {\n    return;\n  }\n\n  let entryStat;\n  try {\n    entryStat = await stat(entryPath);\n  } catch (error) {\n    context.errors.push(`${formatPath(entryPath, context.rootDirectory)}: ${formatError(error)}`);\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    await measureScannableFile(entryPath, context, resolvedPath, resolvedPath);\n  }\n}\n\nasync function measureScannableFile(\n  file: string,\n  context: ScanContext,\n  languageFile = file,\n  realFile?: string\n): Promise<void> {\n  const language = getLanguage(languageFile, context.options);\n  if (language) {\n    await measureFile(file, language, 'directory', context, realFile);\n  }\n}\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  try {\n    const resolvedFile = realFile ?? (await realpath(file));\n    if (context.visitedFiles.has(resolvedFile)) {\n      return;\n    }\n    context.visitedFiles.add(resolvedFile);\n\n    const code = await readFile(file, 'utf8');\n    const measureOptions = { language, duplication: context.options.duplication };\n    const fileMetrics: FileMetrics = { file, metrics: measureCode(code, measureOptions) };\n    // Only directory scans compare files against each other; a single-file target has no peers.\n    // Candidate collection failing (it always parses with the JavaScript binding, which can give\n    // up where the native backend measured fine) must not discard the measured metrics.\n    if (mode === 'directory') {\n      try {\n        fileMetrics.duplicationCandidates = collectCrossFileDuplicationFileData(code, measureOptions);\n      } catch (error) {\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        context.warnings.push(\n          `${formatPath(file, context.rootDirectory)}: cross-file duplication candidates unavailable: ${formatError(error)}`\n        );\n      }\n    }\n    context.files.push(fileMetrics);\n  } catch (error) {\n    context.errors.push(`${formatPath(file, context.rootDirectory)}: ${formatError(error)}`);\n  }\n}\n\n/** Runs after the scan so every measured file's candidates participate. */\nfunction addCrossFileDuplication(result: ScanResult, options: ResolvedOptions): 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\nfunction findRiskyFunctions(\n  files: FileMetrics[],\n  architecture: ArchitectureMetrics | undefined,\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  componentFunctionKeys: Set<string> | undefined,\n  namedComponentFunctionKeys: Set<string> | undefined,\n  options: ResolvedOptions,\n  displayRoot: string\n): RiskFinding[] {\n  const architectureByFile = new Map(architecture?.files.map((file) => [file.file, file]));\n  const findings = files.flatMap(({ file, metrics }) => {\n    const isReactFile = metrics.functions.some(\n      (fn) => fn.returnsJsx || isReactComponent(file, fn, componentFunctionKeys, namedComponentFunctionKeys)\n    );\n    const thresholds = resolveThresholds(options, metrics.language, isReactFile);\n    return [\n      ...findRiskyFileMetrics(\n        file,\n        metrics,\n        architectureByFile.get(formatPath(file, displayRoot)),\n        crossFileDuplication,\n        thresholds,\n        displayRoot\n      ),\n      ...metrics.functions.flatMap((fn) =>\n        findRiskyFunctionMetrics(\n          file,\n          metrics.language,\n          fn,\n          thresholds,\n          displayRoot,\n          componentFunctionKeys,\n          namedComponentFunctionKeys\n        )\n      ),\n    ];\n  });\n\n  findings.sort(compareRiskFindings);\n  return findings;\n}\n\nfunction findRiskyFileMetrics(\n  file: string,\n  metrics: CodeMetrics,\n  architecture: ArchitectureFileMetrics | undefined,\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  thresholds: Thresholds,\n  displayRoot: string\n): RiskFinding[] {\n  const triggers: RiskTrigger[] = [];\n  const formattedFile = formatPath(file, displayRoot);\n  addTrigger(triggers, 'file LOC', metrics.lines.code, thresholds.fileLoc);\n  addTrigger(triggers, 'import sources', metrics.coupling.importSourceCount, thresholds.import);\n  const duplicateBlockDetail = formatDuplicateBlockGroups(metrics.duplication.duplicateBlockGroups);\n  addTrigger(\n    triggers,\n    'duplicated blocks',\n    metrics.duplication.duplicateBlockCount,\n    thresholds.duplicateBlock,\n    duplicateBlockDetail\n  );\n  // Maximal-region selection deliberately compresses adjacent clones into few blocks, so severity\n  // must track line coverage, not the block count. Flooring compares like the unrounded ratio\n  // against the integer threshold (29.5% must not trigger a >= 30 threshold). The block ranges are\n  // repeated as detail because this trigger can fire alone, and a percentage without locations is\n  // not actionable.\n  addTrigger(\n    triggers,\n    'duplicated lines (%)',\n    Math.floor(metrics.duplication.duplicationRatio * 100),\n    thresholds.duplicationRatioPercent,\n    duplicateBlockDetail\n  );\n  if (crossFileDuplication) {\n    // Object.hasOwn: a file named like an Object.prototype member must not read an inherited value.\n    addTrigger(\n      triggers,\n      'cross-file duplicated blocks',\n      Object.hasOwn(crossFileDuplication.duplicateBlockGroupCountByFile, formattedFile)\n        ? (crossFileDuplication.duplicateBlockGroupCountByFile[formattedFile] ?? 0)\n        : 0,\n      thresholds.crossFileDuplicateBlock,\n      formatCrossFileDuplicateDetail(crossFileDuplication, formattedFile)\n    );\n  }\n  if (architecture) {\n    const hasFileScaleRisk = metrics.lines.code >= 100 || architecture.directLocalDependencyCount >= 8;\n    if (hasFileScaleRisk) {\n      addTrigger(\n        triggers,\n        'transitive local dependencies',\n        architecture.transitiveLocalDependencyCount,\n        thresholds.transitiveDependency\n      );\n    }\n    if (\n      triggers.length > 0 ||\n      architecture.directLocalDependencyCount >= 8 ||\n      architecture.structuralCoordination.score >= thresholds.structuralCoordination\n    ) {\n      addTrigger(triggers, 'structural breadth', architecture.structuralBreadthScore, thresholds.structuralBreadth);\n    }\n    addTrigger(\n      triggers,\n      'structural coordination',\n      architecture.structuralCoordination.score,\n      thresholds.structuralCoordination\n    );\n    addTrigger(\n      triggers,\n      'state mutation',\n      architecture.structuralCoordination.stateMutationScore,\n      thresholds.stateMutation\n    );\n    addTrigger(\n      triggers,\n      'duplicate symbol groups',\n      architecture.duplicateSymbolGroupCount,\n      thresholds.duplicateSymbolGroup\n    );\n  }\n  if (triggers.length === 0) {\n    return [];\n  }\n\n  return [\n    {\n      file: formattedFile,\n      language: metrics.language,\n      kind: 'file',\n      cyclomaticComplexity: metrics.cyclomaticComplexity,\n      cognitiveComplexity: metrics.cognitiveComplexity,\n      triggers,\n      score: maxTriggerScore(triggers),\n    },\n  ];\n}\n\nfunction findRiskyFunctionMetrics(\n  file: string,\n  language: LanguageName,\n  fn: FunctionMetrics,\n  thresholds: Thresholds,\n  displayRoot: string,\n  componentFunctionKeys?: Set<string>,\n  namedComponentFunctionKeys?: Set<string>\n): RiskFinding[] {\n  const loc = fn.endLine - fn.startLine + 1;\n  const isComponent = isReactComponent(file, fn, componentFunctionKeys, namedComponentFunctionKeys);\n  const kind = isComponent ? 'component' : 'function';\n  const triggers: RiskTrigger[] = [];\n  addTrigger(triggers, 'cognitive complexity', fn.cognitiveComplexity, thresholds.cognitive);\n  addTrigger(triggers, 'cyclomatic complexity', fn.cyclomaticComplexity, thresholds.cyclomatic);\n  addTrigger(triggers, isComponent ? 'component LOC' : 'function LOC', loc, getLocThreshold(isComponent, thresholds));\n  addTrigger(triggers, 'function calls', fn.callCount, thresholds.call);\n  addTrigger(triggers, 'fan-out', fn.fanOut, thresholds.fanOut);\n  addTrigger(triggers, 'parameters', fn.parameterCount, thresholds.parameter);\n  if (triggers.length === 0) {\n    return [];\n  }\n\n  return [\n    {\n      file: formatPath(file, displayRoot),\n      language,\n      kind,\n      name: fn.name ?? '<anonymous>',\n      startLine: fn.startLine,\n      endLine: fn.endLine,\n      cyclomaticComplexity: fn.cyclomaticComplexity,\n      cognitiveComplexity: fn.cognitiveComplexity,\n      triggers,\n      score: maxTriggerScore(triggers),\n    },\n  ];\n}\n\nfunction addTrigger(triggers: RiskTrigger[], metric: string, value: number, threshold: number, detail?: string): void {\n  if (value < threshold) {\n    return;\n  }\n\n  triggers.push({ metric, value, threshold, score: value / threshold, detail });\n}\n\n/** Formats the cross-file groups a file participates in as `12-34 ~ b.ts:56-78; ...` (capped). */\nfunction formatCrossFileDuplicateDetail(\n  crossFileDuplication: CrossFileDuplicationMetrics,\n  formattedFile: string\n): string | undefined {\n  const involved = crossFileDuplication.groups.filter((group) => group.files.includes(formattedFile));\n  if (involved.length === 0) {\n    return undefined;\n  }\n  const formatted = involved\n    .slice(0, maxCrossFileDuplicateDetailGroups)\n    .map((group) =>\n      group.occurrences\n        .map(({ file, startLine, endLine }) =>\n          file === formattedFile ? `${startLine}-${endLine}` : `${file}:${startLine}-${endLine}`\n        )\n        .join(' ~ ')\n    )\n    .join('; ');\n  const truncatedSuffix = involved.length > maxCrossFileDuplicateDetailGroups ? '; ...' : '';\n  return `${formatted}${truncatedSuffix}`;\n}\n\n/** Formats duplicated block groups as `12-34 ~ 56-78; 90-99 ~ 100-109` (copies joined by ` ~ `, groups by `; `). */\nfunction formatDuplicateBlockGroups(groups: { endLine: number; startLine: number }[][]): string | undefined {\n  if (groups.length === 0) {\n    return undefined;\n  }\n\n  return groups.map((group) => group.map(({ startLine, endLine }) => `${startLine}-${endLine}`).join(' ~ ')).join('; ');\n}\n\nfunction isReactComponent(\n  file: string,\n  fn: FunctionMetrics,\n  componentFunctionKeys: Set<string> | undefined,\n  namedComponentFunctionKeys: Set<string> | undefined\n): boolean {\n  return (\n    componentFunctionKeys?.has(functionLocationKey(file, fn.startLine, fn.startColumn)) ||\n    (fn.name ? namedComponentFunctionKeys?.has(functionNameLocationKey(file, fn.name, fn.startLine)) : false) ||\n    false\n  );\n}\n\nfunction getLocThreshold(isComponent: boolean, thresholds: Thresholds): number {\n  return isComponent ? thresholds.componentLoc : thresholds.functionLoc;\n}\n\nfunction functionLocationKey(file: string, startLine: number, startColumn: number): string {\n  return `${path.resolve(file)}:${startLine}:${startColumn}`;\n}\n\nfunction functionNameLocationKey(file: string, name: string, startLine: number): string {\n  return `${path.resolve(file)}:${name}:${startLine}`;\n}\n\nfunction maxTriggerScore(triggers: RiskTrigger[]): number {\n  return Math.max(...triggers.map((trigger) => trigger.score));\n}\n\nfunction compareRiskFindings(left: RiskFinding, right: RiskFinding): number {\n  return (\n    right.score - left.score ||\n    left.file.localeCompare(right.file) ||\n    (left.startLine ?? 0) - (right.startLine ?? 0) ||\n    (left.endLine ?? 0) - (right.endLine ?? 0) ||\n    left.kind.localeCompare(right.kind)\n  );\n}\n\nfunction printJson(result: ScanResult, risks: RiskFinding[], options: ResolvedOptions): void {\n  const summary = summarize(result.files);\n  const reportedRisks = risks.slice(0, options.maxFindings);\n  writeStdout(\n    JSON.stringify(\n      {\n        summary,\n        thresholds: options.thresholds,\n        profileThresholds: options.profileThresholds,\n        totalRisks: risks.length,\n        truncated: reportedRisks.length < risks.length,\n        largestFiles:\n          options.largestFiles > 0\n            ? findLargestFiles(result.files, options.largestFiles, result.displayRoot)\n            : undefined,\n        architecture: result.architecture,\n        crossFileDuplication: result.crossFileDuplication,\n        typeScriptProject: result.typeScriptProject,\n        risks: reportedRisks,\n        errors: result.errors,\n        warnings: result.warnings,\n      },\n      undefined,\n      2\n    ) + '\\n'\n  );\n}\n\nfunction printTextReport(target: string, result: ScanResult, risks: RiskFinding[], options: ResolvedOptions): void {\n  if (result.fatalError) {\n    writeStderr(`Error: ${result.fatalError}\\n`);\n    return;\n  }\n\n  const { thresholds } = options;\n  const summary = summarize(result.files);\n  writeStdout(`Measured ${summary.fileCount} files under ${target}\\n`);\n  writeStdout(\n    `LOC ${summary.linesOfCode}, NCSS ${summary.ncssCount}, functions ${summary.functionCount}, max cyclomatic ${summary.maxCyclomaticComplexity}, max cognitive ${summary.maxCognitiveComplexity}\\n`\n  );\n  writeStdout(\n    `Calls ${summary.callCount}, internal edges ${summary.internalEdgeCount}, max call depth ${summary.maxCallDepth}, imports ${summary.importSourceCount}, exports ${summary.exportCount}\\n`\n  );\n  writeStdout(\n    `Type annotations ${summary.typeAnnotationCount}, type aliases ${summary.typeAliasCount}, interfaces ${summary.interfaceCount}, avg cohesion ${summary.averageFunctionIdentifierOverlap.toFixed(2)}\\n`\n  );\n  if (result.architecture) {\n    writeStdout(`${formatArchitectureMetrics(result.architecture)}\\n`);\n  }\n  if (result.typeScriptProject) {\n    writeStdout(`${formatTypeScriptProjectMetrics(result.typeScriptProject)}\\n`);\n  }\n  writeStdout(\n    `Risk thresholds: file LOC >= ${thresholds.fileLoc}, function LOC >= ${thresholds.functionLoc}, component LOC >= ${thresholds.componentLoc}, cognitive >= ${thresholds.cognitive}, cyclomatic >= ${thresholds.cyclomatic}, calls >= ${thresholds.call}, imports >= ${thresholds.import}, fan-out >= ${thresholds.fanOut}, parameters >= ${thresholds.parameter}, duplicated blocks >= ${thresholds.duplicateBlock}, duplicated lines (%) >= ${thresholds.duplicationRatioPercent}, cross-file duplicated blocks >= ${thresholds.crossFileDuplicateBlock}\\n`\n  );\n  const profileOverrides = formatProfileOverrides(options.profileThresholds);\n  if (profileOverrides) {\n    writeStdout(`Per-language overrides: ${profileOverrides}\\n`);\n  }\n\n  if (risks.length === 0) {\n    writeStdout('No high-risk findings found.\\n');\n  } else {\n    const reportedRisks = risks.slice(0, options.maxFindings);\n    const totalSuffix = risks.length > reportedRisks.length ? ` of ${risks.length}` : '';\n    writeStdout(`\\nHigh-risk findings (top ${reportedRisks.length}${totalSuffix}):\\n`);\n    for (const risk of reportedRisks) {\n      writeStdout(`${formatRiskLocation(risk)} ${formatRiskName(risk)} ${formatRiskMetrics(risk)}\\n`);\n    }\n  }\n\n  const crossFileGroups = result.crossFileDuplication?.groups ?? [];\n  if (crossFileGroups.length > 0) {\n    const reportedGroups = crossFileGroups.slice(0, maxCrossFileDuplicateGroupLines);\n    const totalSuffix = crossFileGroups.length > reportedGroups.length ? ` of ${crossFileGroups.length}` : '';\n    writeStdout(`\\nCross-file duplicate blocks (top ${reportedGroups.length}${totalSuffix}):\\n`);\n    for (const group of reportedGroups) {\n      writeStdout(\n        `${group.tokenCount} tokens: ${group.occurrences\n          .map(({ file, startLine, endLine }) => `${file}:${startLine}-${endLine}`)\n          .join(', ')}\\n`\n      );\n    }\n  }\n\n  const duplicateSymbolGroups = result.architecture?.duplicateSymbolGroups ?? [];\n  if (duplicateSymbolGroups.length > 0) {\n    const reportedGroups = duplicateSymbolGroups\n      .toSorted((left, right) => right.files.length - left.files.length || left.name.localeCompare(right.name))\n      .slice(0, maxDuplicateSymbolGroupLines);\n    const totalSuffix =\n      duplicateSymbolGroups.length > reportedGroups.length ? ` of ${duplicateSymbolGroups.length}` : '';\n    writeStdout(`\\nDuplicate symbols (top ${reportedGroups.length}${totalSuffix}):\\n`);\n    for (const group of reportedGroups) {\n      writeStdout(\n        `${group.name}: ${group.declarations.map((declaration) => `${declaration.file}:${declaration.line}`).join(', ')}\\n`\n      );\n    }\n  }\n\n  if (options.largestFiles > 0) {\n    const largestFiles = findLargestFiles(result.files, options.largestFiles, result.displayRoot);\n    writeStdout(`\\nLargest files by code LOC (top ${largestFiles.length}):\\n`);\n    for (const { file, codeLoc } of largestFiles) {\n      writeStdout(`${file} (code LOC ${codeLoc})\\n`);\n    }\n  }\n\n  if (result.warnings.length > 0) {\n    writeStderr(`\\nDegraded ${result.warnings.length} files (measured, but excluded from cross-file matching):\\n`);\n    for (const warning of result.warnings.slice(0, 10)) {\n      writeStderr(`- ${warning}\\n`);\n    }\n    if (result.warnings.length > 10) {\n      writeStderr(`- ... ${result.warnings.length - 10} more\\n`);\n    }\n  }\n\n  if (result.errors.length > 0) {\n    writeStderr(`\\nSkipped ${result.errors.length} files or directories:\\n`);\n    for (const error of result.errors.slice(0, 10)) {\n      writeStderr(`- ${error}\\n`);\n    }\n    if (result.errors.length > 10) {\n      writeStderr(`- ... ${result.errors.length - 10} more\\n`);\n    }\n  }\n}\n\nfunction findLargestFiles(\n  files: FileMetrics[],\n  count: number,\n  displayRoot: string\n): { file: string; codeLoc: number }[] {\n  return files\n    .map(({ file, metrics }) => ({ file: formatPath(file, displayRoot), codeLoc: metrics.lines.code }))\n    .toSorted((left, right) => right.codeLoc - left.codeLoc || left.file.localeCompare(right.file))\n    .slice(0, count);\n}\n\nfunction formatProfileOverrides(profileThresholds: ResolvedOptions['profileThresholds']): string {\n  return Object.entries(profileThresholds)\n    .map(\n      ([profile, overrides]) =>\n        `${profile} { ${Object.entries(overrides)\n          .map(([metric, value]) => `${metric} ${value}`)\n          .join(', ')} }`\n    )\n    .join('; ');\n}\n\nfunction formatRiskLocation(risk: RiskFinding): string {\n  return risk.startLine === undefined || risk.endLine === undefined\n    ? risk.file\n    : `${risk.file}:${risk.startLine}-${risk.endLine}`;\n}\n\nfunction formatRiskName(risk: RiskFinding): string {\n  return risk.name ? `${risk.kind} ${risk.name}` : risk.kind;\n}\n\nfunction formatRiskMetrics(risk: RiskFinding): string {\n  const triggerText = risk.triggers\n    .map(\n      (trigger) =>\n        `${trigger.metric} ${formatMetricValue(trigger.value)} >= ${formatMetricValue(trigger.threshold)}${trigger.detail ? ` [${trigger.detail}]` : ''}`\n    )\n    .join(', ');\n  return `(${triggerText}; cyclomatic ${risk.cyclomaticComplexity}, cognitive ${risk.cognitiveComplexity})`;\n}\n\nfunction formatMetricValue(value: number): string {\n  return Number.isInteger(value) ? String(value) : value.toFixed(2);\n}\n\nfunction formatArchitectureMetrics(metrics: ArchitectureMetrics): string {\n  const maxStateMutationScore = Math.max(\n    0,\n    ...metrics.files.map((file) => file.structuralCoordination.stateMutationScore)\n  );\n  return `Architecture max reachable files ${metrics.maxTransitiveLocalDependencyCount}, max structural breadth ${metrics.maxStructuralBreadthScore}, max structural coordination ${metrics.maxStructuralCoordinationScore}, max state mutation ${maxStateMutationScore}, duplicate symbol groups ${metrics.duplicateSymbolGroups.length}`;\n}\n\nfunction formatTypeScriptProjectMetrics(metrics: TypeScriptProjectMetrics): string {\n  return `TypeScript project root files ${metrics.rootFileCount}, measured roots ${metrics.measuredRootFileCount}, semantic diagnostics ${metrics.semanticDiagnosticCount}, resolved calls ${metrics.resolvedCallExpressionCount}/${metrics.callExpressionCount} (${(metrics.resolvedCallExpressionRatio * 100).toFixed(1)}%)`;\n}\n\nfunction summarize(files: FileMetrics[]): {\n  fileCount: number;\n  functionCount: number;\n  linesOfCode: number;\n  maxCognitiveComplexity: number;\n  maxCyclomaticComplexity: number;\n  ncssCount: number;\n  callCount: number;\n  internalEdgeCount: number;\n  maxCallDepth: number;\n  importSourceCount: number;\n  relativeImportCount: number;\n  externalImportCount: number;\n  exportCount: number;\n  averageFunctionIdentifierOverlap: number;\n  typeAnnotationCount: number;\n  typeAliasCount: number;\n  interfaceCount: number;\n  genericParameterCount: number;\n} {\n  let functionCount = 0;\n  let linesOfCode = 0;\n  let maxCyclomaticComplexity = 0;\n  let maxCognitiveComplexity = 0;\n  let ncssCount = 0;\n  let callCount = 0;\n  let internalEdgeCount = 0;\n  let maxCallDepth = 0;\n  let importSourceCount = 0;\n  let relativeImportCount = 0;\n  let externalImportCount = 0;\n  let exportCount = 0;\n  let cohesionTotal = 0;\n  let typeAnnotationCount = 0;\n  let typeAliasCount = 0;\n  let interfaceCount = 0;\n  let genericParameterCount = 0;\n\n  for (const file of files) {\n    functionCount += file.metrics.functionCount;\n    linesOfCode += file.metrics.lines.code;\n    maxCyclomaticComplexity = Math.max(maxCyclomaticComplexity, file.metrics.maxCyclomaticComplexity);\n    maxCognitiveComplexity = Math.max(maxCognitiveComplexity, file.metrics.maxCognitiveComplexity);\n    ncssCount += file.metrics.ncssCount;\n    callCount += file.metrics.callGraph.callCount;\n    internalEdgeCount += file.metrics.callGraph.internalEdgeCount;\n    maxCallDepth = Math.max(maxCallDepth, file.metrics.callGraph.maxCallDepth);\n    importSourceCount += file.metrics.coupling.importSourceCount;\n    relativeImportCount += file.metrics.coupling.relativeImportCount;\n    externalImportCount += file.metrics.coupling.externalImportCount;\n    exportCount += file.metrics.coupling.exportCount;\n    cohesionTotal += file.metrics.cohesion.averageFunctionIdentifierOverlap;\n    typeAnnotationCount += file.metrics.typeComplexity.typeAnnotationCount;\n    typeAliasCount += file.metrics.typeComplexity.typeAliasCount;\n    interfaceCount += file.metrics.typeComplexity.interfaceCount;\n    genericParameterCount += file.metrics.typeComplexity.genericParameterCount;\n  }\n\n  return {\n    fileCount: files.length,\n    functionCount,\n    linesOfCode,\n    maxCyclomaticComplexity,\n    maxCognitiveComplexity,\n    ncssCount,\n    callCount,\n    internalEdgeCount,\n    maxCallDepth,\n    importSourceCount,\n    relativeImportCount,\n    externalImportCount,\n    exportCount,\n    averageFunctionIdentifierOverlap: files.length === 0 ? 0 : cohesionTotal / files.length,\n    typeAnnotationCount,\n    typeAliasCount,\n    interfaceCount,\n    genericParameterCount,\n  };\n}\n\nfunction shouldSkipDirectory(name: string, options: ResolvedOptions): 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\nfunction getLanguage(file: string, options: ResolvedOptions, 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)) || javaTestFilePattern.test(path.basename(file)))\n  ) {\n    return undefined;\n  }\n\n  // GCC treats an uppercase `.C` as C++; lowercasing first would misparse it with the C grammar.\n  if (path.extname(file) === '.C') {\n    return 'cpp';\n  }\n\n  return languageByExtension.get(path.extname(lowerFile));\n}\n\nfunction parsePercentInteger(value: string): number {\n  const parsed = parsePositiveInteger(value);\n  if (parsed > 100) {\n    throw new InvalidArgumentError('Expected an integer between 1 and 100.');\n  }\n  return parsed;\n}\n\nfunction parseNonNegativeInteger(value: string): number {\n  if (!/^\\d+$/u.test(value)) {\n    throw new InvalidArgumentError('Expected a non-negative integer.');\n  }\n\n  const parsed = Number(value);\n  if (!Number.isSafeInteger(parsed) || parsed < 0) {\n    throw new InvalidArgumentError('Expected a non-negative integer.');\n  }\n  return parsed;\n}\n\nfunction parsePositiveInteger(value: string): number {\n  if (!/^[1-9]\\d*$/u.test(value)) {\n    throw new InvalidArgumentError('Expected a positive integer.');\n  }\n\n  const parsed = Number(value);\n  if (!Number.isSafeInteger(parsed) || parsed < 1) {\n    throw new InvalidArgumentError('Expected a positive integer.');\n  }\n  return parsed;\n}\n\nfunction formatPath(file: string, base: string): string {\n  return path.relative(base, file) || path.basename(file);\n}\n\nfunction writeStdout(message: string): void {\n  process.stdout.write(message);\n}\n\nfunction writeStderr(message: string): void {\n  process.stderr.write(message);\n}\n\nfunction formatError(error: unknown): string {\n  return error instanceof Error ? error.message : String(error);\n}\n"],"mappings":";ukBAiEA,MAAM,EAAsB,IAAI,IAA0B,CACxD,CAAC,KAAM,GAAG,EACV,CAAC,OAAQ,KAAK,EACd,CAAC,MAAO,KAAK,EACb,CAAC,OAAQ,YAAY,EACrB,CAAC,MAAO,KAAK,EACb,CAAC,OAAQ,KAAK,EACd,CAAC,OAAQ,KAAK,EACd,CAAC,OAAQ,YAAY,EACrB,CAAC,OAAQ,KAAK,EACd,CAAC,MAAO,IAAI,EAEZ,CAAC,KAAM,KAAK,EACZ,CAAC,MAAO,KAAK,EACb,CAAC,OAAQ,KAAK,EACd,CAAC,OAAQ,KAAK,EACd,CAAC,QAAS,MAAM,EAChB,CAAC,MAAO,YAAY,EACpB,CAAC,OAAQ,KAAK,EACd,CAAC,OAAQ,YAAY,EACrB,CAAC,OAAQ,YAAY,EACrB,CAAC,MAAO,QAAQ,EAChB,CAAC,MAAO,MAAM,EACd,CAAC,MAAO,MAAM,EACd,CAAC,MAAO,YAAY,EACpB,CAAC,OAAQ,KAAK,CAChB,CAAC,EAEK,EAAwB,IAAI,IAAI,CACpC,UACA,UACA,UACA,OACA,QACA,kBACA,OACA,OACA,SACA,QACA,QACA,eACA,gBACA,cACA,WACA,OACA,WACA,YACA,eACA,SACA,gBACA,SACA,MACF,CAAC,EASK,EAAqB,IAAI,IAAI,CAAC,YAAa,OAAQ,QAAS,MAAM,CAAC,EACnE,GAAkB,mEAGlB,GAAsB,eAGvB,GAAK,CAAC,CAAC,MAAO,GAAmB,CACpC,EAAY,UAAU,EAAY,CAAK,EAAE,GAAG,EAC5C,QAAQ,SAAW,CACrB,CAAC,EAED,eAAe,IAAsB,CACnC,IAAM,EAAU,IAAI,EAAQ,CAAC,CAC1B,KAAK,YAAY,CAAC,CAClB,YAAY,mDAAmD,CAAC,CAChE,SAAS,WAAY,+BAAgC,GAAG,CAAC,CACzD,OAAO,kBAAmB,mDAAmD,GAAgB,CAAC,CAC9F,OAAO,gCAAiC,kCAAmC,CAAoB,CAAC,CAChG,OAAO,oCAAqC,+CAAgD,CAAoB,CAAC,CACjH,OACC,qCACA,sDACA,CACF,CAAC,CACA,OAAO,iCAAkC,yCAA0C,CAAoB,CAAC,CACxG,OAAO,kCAAmC,0CAA2C,CAAoB,CAAC,CAC1G,OAAO,4BAA6B,wCAAyC,CAAoB,CAAC,CAClG,OAAO,8BAA+B,mDAAoD,CAAoB,CAAC,CAC/G,OAAO,+BAAgC,oDAAqD,CAAoB,CAAC,CACjH,OAAO,iCAAkC,6CAA8C,CAAoB,CAAC,CAC5G,OACC,uCACA,6DACA,CACF,CAAC,CACA,OACC,iDACA,oEACA,CACF,CAAC,CACA,OACC,kDACA,wEACA,CACF,CAAC,CACA,OACC,oCACA,qEACA,CACF,CAAC,CACA,OACC,wCACA,wFACA,EACF,CAAC,CACA,OACC,gDACA,sHACA,CACF,CAAC,CACA,OACC,6CACA,uDACA,CACF,CAAC,CACA,OACC,0CACA,6CACA,CACF,CAAC,CACA,OACC,+CACA,kDACA,CACF,CAAC,CACA,OAAO,sCAAuC,yCAA0C,CAAoB,CAAC,CAC7G,OACC,8CACA,iDACA,CACF,CAAC,CACA,OAAO,0BAA2B,2CAA4C,CAAoB,CAAC,CACnG,OAAO,2BAA4B,8CAA+C,CAAoB,CAAC,CACvG,OAAO,kBAAmB,yCAAyC,CAAC,CACpE,OAAO,oBAAqB,uEAAuE,CAAC,CACpG,OAAO,SAAU,mBAAmB,CAAC,CACrC,OAAO,kBAAmB,8DAA8D,CAAC,CACzF,OAAO,iBAAkB,oDAAoD,EAEhF,EAAQ,OAAO,MAAO,EAAgB,IAA2B,CAC/D,IAAM,EAAiB,EAAc,CAAM,EACrC,EAAS,MAAM,EAAW,EAAW,OAAQ,MAAM,GAAsB,CAAc,CAAC,EACxF,EAAU,EAAe,EAAY,CAAM,EAC3C,EAAS,MAAM,GAAW,EAAgB,CAAO,EACvD,EAAwB,EAAQ,CAAO,EACvC,MAAM,EAAuB,CAAM,EACnC,MAAM,GAA4B,EAAQ,EAAS,CAAc,EACjE,IAAM,EAAQ,GACZ,EAAO,MACP,EAAO,aACP,EAAO,qBACP,EAAO,sBACP,EAAO,2BACP,EACA,EAAO,WACT,EAEI,EAAQ,KACV,EAAU,EAAQ,EAAO,CAAO,EAEhC,EAAgB,EAAgB,EAAQ,EAAO,CAAO,GAItD,EAAO,YACN,EAAQ,aAAe,EAAO,OAAO,OAAS,GAC9C,EAAQ,YAAc,EAAM,OAAS,KAEtC,QAAQ,SAAW,EAEvB,CAAC,EAED,MAAM,EAAQ,WAAW,CAC3B,CAEA,SAAS,EAAc,EAAwB,CAS7C,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,eAAe,GAAsB,EAAiC,CACpE,GAAI,CAEF,OAAO,MADkB,EAAK,CAAM,EAAA,CAClB,YAAY,EAAI,EAAS,EAAK,QAAQ,CAAM,CAChE,MAAQ,CACN,OAAO,EAAK,QAAQ,CAAM,CAC5B,CACF,CAcA,eAAe,GAAW,EAAgB,EAA+C,CACvF,IAAM,EAAuB,CAAC,EACxB,EAAmB,CAAC,EACpB,EAAqB,CAAC,EACxB,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,EAAY,CAAK,IAC5F,MAAO,CAAE,YAAa,EAAqB,QAAO,OAAQ,CAAC,CAAU,EAAG,WAAU,YAAW,CAC/F,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,QAAO,OAAQ,CAAC,CAAU,EAAG,WAAU,YAAW,CAC1E,CAEA,IAAM,EAAU,EAAgB,EAAS,EAAO,EAAQ,EAAU,CAAW,EAE7E,OADA,MAAM,EAAY,EAAiB,EAAU,cAAe,EAAS,CAAe,EAC7E,CAAE,cAAa,QAAO,SAAQ,UAAS,CAChD,CAGA,OADA,MAAM,EAAc,EAAiB,EAAgB,EAAS,EAAO,EAAQ,EAAU,CAAe,CAAC,EAChG,CAAE,YAAa,EAAiB,QAAO,SAAQ,UAAS,CACjE,CAEA,SAAS,EACP,EACA,EACA,EACA,EACA,EACa,CACb,MAAO,CAAE,UAAS,QAAO,SAAQ,WAAU,mBAAoB,IAAI,IAAO,aAAc,IAAI,IAAO,eAAc,CACnH,CAEA,eAAe,GACb,EACA,EACA,EACe,CAIf,GAHI,EAAO,YAGP,EAAO,MAAM,SAAW,EAC1B,OAGF,IAAM,EAAqB,EAAQ,SAC7B,EAAmB,IAAuB,IAAA,GAChD,GAAI,CAAC,GAAoB,CAAC,EAAO,MAAM,MAAM,CAAE,UAAW,EAAiC,CAAI,CAAC,EAC9F,OAGF,IAAM,EAAa,EAAqB,EAAc,CAAkB,EAAI,MAAM,EAAoB,CAAc,EAC/G,KAIL,GAAI,CACF,EAAO,kBAAoB,MAAM,EAC/B,EACA,EAAO,MAAM,KAAK,CAAE,UAAW,CAAI,CACrC,EACA,EAAO,sBAAwB,IAAI,IACjC,EAAO,kBAAkB,wBAAwB,IAAK,GACpD,EAAoB,EAAU,KAAM,EAAU,UAAW,EAAU,WAAW,CAChF,CACF,EACA,EAAO,2BAA6B,IAAI,IACtC,EAAO,kBAAkB,wBAAwB,QAAS,GACxD,EAAU,KAAO,CAAC,EAAwB,EAAU,KAAM,EAAU,KAAM,EAAU,SAAS,CAAC,EAAI,CAAC,CACrG,CACF,CACF,OAAS,EAAO,CACV,GACF,EAAO,OAAO,KAAK,GAAG,EAAW,EAAY,EAAO,WAAW,EAAE,IAAI,EAAY,CAAK,GAAG,CAE7F,CACF,CAEA,SAAS,EAAiC,EAAuB,CAC/D,MAAO,CAAC,OAAQ,OAAQ,MAAO,OAAQ,OAAQ,OAAQ,MAAO,MAAM,CAAC,CAAC,SAAS,EAAK,QAAQ,CAAI,CAAC,CACnG,CAEA,eAAe,EAAoB,EAA6C,CAE9E,IAAI,GAAmB,MADE,EAAK,CAAM,EAAA,CACF,YAAY,EAAI,EAAS,EAAK,QAAQ,CAAM,EAC9E,OAAa,CACX,IAAM,EAAa,EAAK,KAAK,EAAkB,eAAe,EAC9D,GAAI,MAAM,EAAW,CAAU,EAC7B,OAAO,EAGT,IAAM,EAAkB,EAAK,QAAQ,CAAgB,EACrD,GAAI,IAAoB,EACtB,OAEF,EAAmB,CACrB,CACF,CAEA,eAAe,EAAW,EAAgC,CACxD,GAAI,CAEF,OAAO,MADgB,EAAK,CAAI,EAAA,CAChB,OAAO,CACzB,MAAQ,CACN,MAAO,EACT,CACF,CAEA,eAAe,EAAuB,EAAmC,CACnE,MAAO,WAIX,GAAI,CACF,EAAO,aAAe,EACpB,EAAO,MAAM,KAAK,CAAE,OAAM,cAAe,CAAE,OAAM,SAAQ,EAAE,EAC3D,EAAO,WACT,CACF,OAAS,EAAO,CACd,EAAO,OAAO,KAAK,yBAAyB,EAAY,CAAK,GAAG,CAClE,CACF,CAEA,eAAe,EAAc,EAAmB,EAAqC,CACnF,IAAI,EACJ,GAAI,CACF,EAAoB,MAAM,EAAS,CAAS,CAC9C,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAW,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EAC5F,MACF,CAMA,GAJI,CAAC,EAAkB,EAAmB,EAAQ,aAAa,GAI3D,EAAQ,mBAAmB,IAAI,CAAiB,EAClD,OAEF,EAAQ,mBAAmB,IAAI,CAAiB,EAEhD,IAAI,EACJ,GAAI,CACF,EAAU,MAAM,EAAQ,EAAW,CAAE,cAAe,EAAK,CAAC,CAC5D,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAW,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EAC5F,MACF,CAEA,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,GACf,MAAM,EAAqB,EAAW,CAAO,CAEjD,CACF,CAEA,eAAe,EAAiB,EAAc,EAAmB,EAAqC,CACpG,IAAI,EACJ,GAAI,CACF,EAAe,MAAM,EAAS,CAAS,CACzC,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAW,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EAC5F,MACF,CAEA,GAAI,CAAC,EAAkB,EAAc,EAAQ,aAAa,EACxD,OAGF,IAAI,EACJ,GAAI,CACF,EAAY,MAAM,EAAK,CAAS,CAClC,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAW,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EAC5F,MACF,CAEA,GAAI,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,MAAM,EAAqB,EAAW,EAAS,EAAc,CAAY,CAE7E,CAEA,eAAe,EACb,EACA,EACA,EAAe,EACf,EACe,CACf,IAAM,EAAW,EAAY,EAAc,EAAQ,OAAO,EACtD,GACF,MAAM,EAAY,EAAM,EAAU,YAAa,EAAS,CAAQ,CAEpE,CAEA,eAAe,EACb,EACA,EACA,EACA,EACA,EACe,CACf,GAAI,CACF,IAAM,EAAe,GAAa,MAAM,EAAS,CAAI,EACrD,GAAI,EAAQ,aAAa,IAAI,CAAY,EACvC,OAEF,EAAQ,aAAa,IAAI,CAAY,EAErC,IAAM,EAAO,MAAM,EAAS,EAAM,MAAM,EAClC,EAAiB,CAAE,WAAU,YAAa,EAAQ,QAAQ,WAAY,EACtE,EAA2B,CAAE,OAAM,QAAS,EAAY,EAAM,CAAc,CAAE,EAIpF,GAAI,IAAS,YACX,GAAI,CACF,EAAY,sBAAwB,EAAoC,EAAM,CAAc,CAC9F,OAAS,EAAO,CAGd,EAAQ,SAAS,KACf,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,mDAAmD,EAAY,CAAK,GACjH,CACF,CAEF,EAAQ,MAAM,KAAK,CAAW,CAChC,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,CACzF,CACF,CAGA,SAAS,EAAwB,EAAoB,EAAgC,CACnF,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,CAEA,SAAS,GACP,EACA,EACA,EACA,EACA,EACA,EACA,EACe,CACf,IAAM,EAAqB,IAAI,IAAI,GAAc,MAAM,IAAK,GAAS,CAAC,EAAK,KAAM,CAAI,CAAC,CAAC,EACjF,EAAW,EAAM,SAAS,CAAE,OAAM,aAAc,CACpD,IAAM,EAAc,EAAQ,UAAU,KACnC,GAAO,EAAG,YAAc,EAAiB,EAAM,EAAI,EAAuB,CAA0B,CACvG,EACM,EAAa,EAAkB,EAAS,EAAQ,SAAU,CAAW,EAC3E,MAAO,CACL,GAAG,GACD,EACA,EACA,EAAmB,IAAI,EAAW,EAAM,CAAW,CAAC,EACpD,EACA,EACA,CACF,EACA,GAAG,EAAQ,UAAU,QAAS,GAC5B,GACE,EACA,EAAQ,SACR,EACA,EACA,EACA,EACA,CACF,CACF,CACF,CACF,CAAC,EAGD,OADA,EAAS,KAAK,CAAmB,EAC1B,CACT,CAEA,SAAS,GACP,EACA,EACA,EACA,EACA,EACA,EACe,CACf,IAAM,EAA0B,CAAC,EAC3B,EAAgB,EAAW,EAAM,CAAW,EAClD,EAAW,EAAU,WAAY,EAAQ,MAAM,KAAM,EAAW,OAAO,EACvE,EAAW,EAAU,iBAAkB,EAAQ,SAAS,kBAAmB,EAAW,MAAM,EAC5F,IAAM,EAAuB,GAA2B,EAAQ,YAAY,oBAAoB,EAwEhG,OAvEA,EACE,EACA,oBACA,EAAQ,YAAY,oBACpB,EAAW,eACX,CACF,EAMA,EACE,EACA,uBACA,KAAK,MAAM,EAAQ,YAAY,iBAAmB,GAAG,EACrD,EAAW,wBACX,CACF,EACI,GAEF,EACE,EACA,+BACA,OAAO,OAAO,EAAqB,+BAAgC,CAAa,EAC3E,EAAqB,+BAA+B,IAAkB,EACvE,EACJ,EAAW,wBACX,GAA+B,EAAsB,CAAa,CACpE,EAEE,KACuB,EAAQ,MAAM,MAAQ,KAAO,EAAa,4BAA8B,IAE/F,EACE,EACA,gCACA,EAAa,+BACb,EAAW,oBACb,GAGA,EAAS,OAAS,GAClB,EAAa,4BAA8B,GAC3C,EAAa,uBAAuB,OAAS,EAAW,yBAExD,EAAW,EAAU,qBAAsB,EAAa,uBAAwB,EAAW,iBAAiB,EAE9G,EACE,EACA,0BACA,EAAa,uBAAuB,MACpC,EAAW,sBACb,EACA,EACE,EACA,iBACA,EAAa,uBAAuB,mBACpC,EAAW,aACb,EACA,EACE,EACA,0BACA,EAAa,0BACb,EAAW,oBACb,GAEE,EAAS,SAAW,EACf,CAAC,EAGH,CACL,CACE,KAAM,EACN,SAAU,EAAQ,SAClB,KAAM,OACN,qBAAsB,EAAQ,qBAC9B,oBAAqB,EAAQ,oBAC7B,WACA,MAAO,EAAgB,CAAQ,CACjC,CACF,CACF,CAEA,SAAS,GACP,EACA,EACA,EACA,EACA,EACA,EACA,EACe,CACf,IAAM,EAAM,EAAG,QAAU,EAAG,UAAY,EAClC,EAAc,EAAiB,EAAM,EAAI,EAAuB,CAA0B,EAC1F,EAAO,EAAc,YAAc,WACnC,EAA0B,CAAC,EAWjC,OAVA,EAAW,EAAU,uBAAwB,EAAG,oBAAqB,EAAW,SAAS,EACzF,EAAW,EAAU,wBAAyB,EAAG,qBAAsB,EAAW,UAAU,EAC5F,EAAW,EAAU,EAAc,gBAAkB,eAAgB,EAAK,EAAgB,EAAa,CAAU,CAAC,EAClH,EAAW,EAAU,iBAAkB,EAAG,UAAW,EAAW,IAAI,EACpE,EAAW,EAAU,UAAW,EAAG,OAAQ,EAAW,MAAM,EAC5D,EAAW,EAAU,aAAc,EAAG,eAAgB,EAAW,SAAS,EACtE,EAAS,SAAW,EACf,CAAC,EAGH,CACL,CACE,KAAM,EAAW,EAAM,CAAW,EAClC,WACA,OACA,KAAM,EAAG,MAAQ,cACjB,UAAW,EAAG,UACd,QAAS,EAAG,QACZ,qBAAsB,EAAG,qBACzB,oBAAqB,EAAG,oBACxB,WACA,MAAO,EAAgB,CAAQ,CACjC,CACF,CACF,CAEA,SAAS,EAAW,EAAyB,EAAgB,EAAe,EAAmB,EAAuB,CAChH,EAAQ,GAIZ,EAAS,KAAK,CAAE,SAAQ,QAAO,YAAW,MAAO,EAAQ,EAAW,QAAO,CAAC,CAC9E,CAGA,SAAS,GACP,EACA,EACoB,CACpB,IAAM,EAAW,EAAqB,OAAO,OAAQ,GAAU,EAAM,MAAM,SAAS,CAAa,CAAC,EAC9F,KAAS,SAAW,EAcxB,MAAO,GAXW,EACf,MAAM,EAAG,CAAiC,CAAC,CAC3C,IAAK,GACJ,EAAM,YACH,KAAK,CAAE,OAAM,YAAW,aACvB,IAAS,EAAgB,GAAG,EAAU,GAAG,IAAY,GAAG,EAAK,GAAG,EAAU,GAAG,GAC/E,CAAC,CACA,KAAK,KAAK,CACf,CAAC,CACA,KAAK,IAEU,IADM,EAAS,OAAS,EAAoC,QAAU,IAE1F,CAGA,SAAS,GAA2B,EAAwE,CACtG,KAAO,SAAW,EAItB,OAAO,EAAO,IAAK,GAAU,EAAM,KAAK,CAAE,YAAW,aAAc,GAAG,EAAU,GAAG,GAAS,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,CACtH,CAEA,SAAS,EACP,EACA,EACA,EACA,EACS,CACT,OACE,GAAuB,IAAI,EAAoB,EAAM,EAAG,UAAW,EAAG,WAAW,CAAC,IACjF,EAAG,KAAO,GAA4B,IAAI,EAAwB,EAAM,EAAG,KAAM,EAAG,SAAS,CAAC,EAAI,KACnG,EAEJ,CAEA,SAAS,EAAgB,EAAsB,EAAgC,CAC7E,OAAO,EAAc,EAAW,aAAe,EAAW,WAC5D,CAEA,SAAS,EAAoB,EAAc,EAAmB,EAA6B,CACzF,MAAO,GAAG,EAAK,QAAQ,CAAI,EAAE,GAAG,EAAU,GAAG,GAC/C,CAEA,SAAS,EAAwB,EAAc,EAAc,EAA2B,CACtF,MAAO,GAAG,EAAK,QAAQ,CAAI,EAAE,GAAG,EAAK,GAAG,GAC1C,CAEA,SAAS,EAAgB,EAAiC,CACxD,OAAO,KAAK,IAAI,GAAG,EAAS,IAAK,GAAY,EAAQ,KAAK,CAAC,CAC7D,CAEA,SAAS,EAAoB,EAAmB,EAA4B,CAC1E,OACE,EAAM,MAAQ,EAAK,OACnB,EAAK,KAAK,cAAc,EAAM,IAAI,IACjC,EAAK,WAAa,IAAM,EAAM,WAAa,KAC3C,EAAK,SAAW,IAAM,EAAM,SAAW,IACxC,EAAK,KAAK,cAAc,EAAM,IAAI,CAEtC,CAEA,SAAS,EAAU,EAAoB,EAAsB,EAAgC,CAC3F,IAAM,EAAU,EAAU,EAAO,KAAK,EAChC,EAAgB,EAAM,MAAM,EAAG,EAAQ,WAAW,EACxD,EACE,KAAK,UACH,CACE,UACA,WAAY,EAAQ,WACpB,kBAAmB,EAAQ,kBAC3B,WAAY,EAAM,OAClB,UAAW,EAAc,OAAS,EAAM,OACxC,aACE,EAAQ,aAAe,EACnB,EAAiB,EAAO,MAAO,EAAQ,aAAc,EAAO,WAAW,EACvE,IAAA,GACN,aAAc,EAAO,aACrB,qBAAsB,EAAO,qBAC7B,kBAAmB,EAAO,kBAC1B,MAAO,EACP,OAAQ,EAAO,OACf,SAAU,EAAO,QACnB,EACA,IAAA,GACA,CACF,EAAI;CACN,CACF,CAEA,SAAS,EAAgB,EAAgB,EAAoB,EAAsB,EAAgC,CACjH,GAAI,EAAO,WAAY,CACrB,EAAY,UAAU,EAAO,WAAW,GAAG,EAC3C,MACF,CAEA,GAAM,CAAE,cAAe,EACjB,EAAU,EAAU,EAAO,KAAK,EACtC,EAAY,YAAY,EAAQ,UAAU,eAAe,EAAO,GAAG,EACnE,EACE,OAAO,EAAQ,YAAY,SAAS,EAAQ,UAAU,cAAc,EAAQ,cAAc,mBAAmB,EAAQ,wBAAwB,kBAAkB,EAAQ,uBAAuB,GAChM,EACA,EACE,SAAS,EAAQ,UAAU,mBAAmB,EAAQ,kBAAkB,mBAAmB,EAAQ,aAAa,YAAY,EAAQ,kBAAkB,YAAY,EAAQ,YAAY,GACxL,EACA,EACE,oBAAoB,EAAQ,oBAAoB,iBAAiB,EAAQ,eAAe,eAAe,EAAQ,eAAe,iBAAiB,EAAQ,iCAAiC,QAAQ,CAAC,EAAE,GACrM,EACI,EAAO,cACT,EAAY,GAAG,GAA0B,EAAO,YAAY,EAAE,GAAG,EAE/D,EAAO,mBACT,EAAY,GAAG,GAA+B,EAAO,iBAAiB,EAAE,GAAG,EAE7E,EACE,gCAAgC,EAAW,QAAQ,oBAAoB,EAAW,YAAY,qBAAqB,EAAW,aAAa,iBAAiB,EAAW,UAAU,kBAAkB,EAAW,WAAW,aAAa,EAAW,KAAK,eAAe,EAAW,OAAO,eAAe,EAAW,OAAO,kBAAkB,EAAW,UAAU,yBAAyB,EAAW,eAAe,4BAA4B,EAAW,wBAAwB,oCAAoC,EAAW,wBAAwB,GAC1hB,EACA,IAAM,EAAmB,EAAuB,EAAQ,iBAAiB,EAKzE,GAJI,GACF,EAAY,2BAA2B,EAAiB,GAAG,EAGzD,EAAM,SAAW,EACnB,EAAY;CAAgC,MACvC,CACL,IAAM,EAAgB,EAAM,MAAM,EAAG,EAAQ,WAAW,EAClD,EAAc,EAAM,OAAS,EAAc,OAAS,OAAO,EAAM,SAAW,GAClF,EAAY,6BAA6B,EAAc,SAAS,EAAY,KAAK,EACjF,IAAK,IAAM,KAAQ,EACjB,EAAY,GAAG,EAAmB,CAAI,EAAE,GAAG,GAAe,CAAI,EAAE,GAAG,GAAkB,CAAI,EAAE,GAAG,CAElG,CAEA,IAAM,EAAkB,EAAO,sBAAsB,QAAU,CAAC,EAChE,GAAI,EAAgB,OAAS,EAAG,CAC9B,IAAM,EAAiB,EAAgB,MAAM,EAAG,EAA+B,EACzE,EAAc,EAAgB,OAAS,EAAe,OAAS,OAAO,EAAgB,SAAW,GACvG,EAAY,sCAAsC,EAAe,SAAS,EAAY,KAAK,EAC3F,IAAK,IAAM,KAAS,EAClB,EACE,GAAG,EAAM,WAAW,WAAW,EAAM,YAClC,KAAK,CAAE,OAAM,YAAW,aAAc,GAAG,EAAK,GAAG,EAAU,GAAG,GAAS,CAAC,CACxE,KAAK,IAAI,EAAE,GAChB,CAEJ,CAEA,IAAM,EAAwB,EAAO,cAAc,uBAAyB,CAAC,EAC7E,GAAI,EAAsB,OAAS,EAAG,CACpC,IAAM,EAAiB,EACpB,UAAU,EAAM,IAAU,EAAM,MAAM,OAAS,EAAK,MAAM,QAAU,EAAK,KAAK,cAAc,EAAM,IAAI,CAAC,CAAC,CACxG,MAAM,EAAG,EAA4B,EAClC,EACJ,EAAsB,OAAS,EAAe,OAAS,OAAO,EAAsB,SAAW,GACjG,EAAY,4BAA4B,EAAe,SAAS,EAAY,KAAK,EACjF,IAAK,IAAM,KAAS,EAClB,EACE,GAAG,EAAM,KAAK,IAAI,EAAM,aAAa,IAAK,GAAgB,GAAG,EAAY,KAAK,GAAG,EAAY,MAAM,CAAC,CAAC,KAAK,IAAI,EAAE,GAClH,CAEJ,CAEA,GAAI,EAAQ,aAAe,EAAG,CAC5B,IAAM,EAAe,EAAiB,EAAO,MAAO,EAAQ,aAAc,EAAO,WAAW,EAC5F,EAAY,oCAAoC,EAAa,OAAO,KAAK,EACzE,IAAK,GAAM,CAAE,OAAM,aAAa,EAC9B,EAAY,GAAG,EAAK,aAAa,EAAQ,IAAI,CAEjD,CAEA,GAAI,EAAO,SAAS,OAAS,EAAG,CAC9B,EAAY,cAAc,EAAO,SAAS,OAAO,4DAA4D,EAC7G,IAAK,IAAM,KAAW,EAAO,SAAS,MAAM,EAAG,EAAE,EAC/C,EAAY,KAAK,EAAQ,GAAG,EAE1B,EAAO,SAAS,OAAS,IAC3B,EAAY,SAAS,EAAO,SAAS,OAAS,GAAG,QAAQ,CAE7D,CAEA,GAAI,EAAO,OAAO,OAAS,EAAG,CAC5B,EAAY,aAAa,EAAO,OAAO,OAAO,yBAAyB,EACvE,IAAK,IAAM,KAAS,EAAO,OAAO,MAAM,EAAG,EAAE,EAC3C,EAAY,KAAK,EAAM,GAAG,EAExB,EAAO,OAAO,OAAS,IACzB,EAAY,SAAS,EAAO,OAAO,OAAS,GAAG,QAAQ,CAE3D,CACF,CAEA,SAAS,EACP,EACA,EACA,EACqC,CACrC,OAAO,EACJ,KAAK,CAAE,OAAM,cAAe,CAAE,KAAM,EAAW,EAAM,CAAW,EAAG,QAAS,EAAQ,MAAM,IAAK,EAAE,CAAC,CAClG,UAAU,EAAM,IAAU,EAAM,QAAU,EAAK,SAAW,EAAK,KAAK,cAAc,EAAM,IAAI,CAAC,CAAC,CAC9F,MAAM,EAAG,CAAK,CACnB,CAEA,SAAS,EAAuB,EAAiE,CAC/F,OAAO,OAAO,QAAQ,CAAiB,CAAC,CACrC,KACE,CAAC,EAAS,KACT,GAAG,EAAQ,KAAK,OAAO,QAAQ,CAAS,CAAC,CACtC,KAAK,CAAC,EAAQ,KAAW,GAAG,EAAO,GAAG,GAAO,CAAC,CAC9C,KAAK,IAAI,EAAE,GAClB,CAAC,CACA,KAAK,IAAI,CACd,CAEA,SAAS,EAAmB,EAA2B,CACrD,OAAO,EAAK,YAAc,IAAA,IAAa,EAAK,UAAY,IAAA,GACpD,EAAK,KACL,GAAG,EAAK,KAAK,GAAG,EAAK,UAAU,GAAG,EAAK,SAC7C,CAEA,SAAS,GAAe,EAA2B,CACjD,OAAO,EAAK,KAAO,GAAG,EAAK,KAAK,GAAG,EAAK,OAAS,EAAK,IACxD,CAEA,SAAS,GAAkB,EAA2B,CAOpD,MAAO,IANa,EAAK,SACtB,IACE,GACC,GAAG,EAAQ,OAAO,GAAG,EAAkB,EAAQ,KAAK,EAAE,MAAM,EAAkB,EAAQ,SAAS,IAAI,EAAQ,OAAS,KAAK,EAAQ,OAAO,GAAK,IACjJ,CAAC,CACA,KAAK,IACa,EAAE,eAAe,EAAK,qBAAqB,cAAc,EAAK,oBAAoB,EACzG,CAEA,SAAS,EAAkB,EAAuB,CAChD,OAAO,OAAO,UAAU,CAAK,EAAI,OAAO,CAAK,EAAI,EAAM,QAAQ,CAAC,CAClE,CAEA,SAAS,GAA0B,EAAsC,CACvE,IAAM,EAAwB,KAAK,IACjC,EACA,GAAG,EAAQ,MAAM,IAAK,GAAS,EAAK,uBAAuB,kBAAkB,CAC/E,EACA,MAAO,oCAAoC,EAAQ,kCAAkC,2BAA2B,EAAQ,0BAA0B,gCAAgC,EAAQ,+BAA+B,uBAAuB,EAAsB,4BAA4B,EAAQ,sBAAsB,QAClU,CAEA,SAAS,GAA+B,EAA2C,CACjF,MAAO,iCAAiC,EAAQ,cAAc,mBAAmB,EAAQ,sBAAsB,yBAAyB,EAAQ,wBAAwB,mBAAmB,EAAQ,4BAA4B,GAAG,EAAQ,oBAAoB,KAAK,EAAQ,4BAA8B,IAAA,CAAK,QAAQ,CAAC,EAAE,GAC3T,CAEA,SAAS,EAAU,EAmBjB,CACA,IAAI,EAAgB,EAChB,EAAc,EACd,EAA0B,EAC1B,EAAyB,EACzB,EAAY,EACZ,EAAY,EACZ,EAAoB,EACpB,EAAe,EACf,EAAoB,EACpB,EAAsB,EACtB,EAAsB,EACtB,EAAc,EACd,EAAgB,EAChB,EAAsB,EACtB,EAAiB,EACjB,EAAiB,EACjB,EAAwB,EAE5B,IAAK,IAAM,KAAQ,EACjB,GAAiB,EAAK,QAAQ,cAC9B,GAAe,EAAK,QAAQ,MAAM,KAClC,EAA0B,KAAK,IAAI,EAAyB,EAAK,QAAQ,uBAAuB,EAChG,EAAyB,KAAK,IAAI,EAAwB,EAAK,QAAQ,sBAAsB,EAC7F,GAAa,EAAK,QAAQ,UAC1B,GAAa,EAAK,QAAQ,UAAU,UACpC,GAAqB,EAAK,QAAQ,UAAU,kBAC5C,EAAe,KAAK,IAAI,EAAc,EAAK,QAAQ,UAAU,YAAY,EACzE,GAAqB,EAAK,QAAQ,SAAS,kBAC3C,GAAuB,EAAK,QAAQ,SAAS,oBAC7C,GAAuB,EAAK,QAAQ,SAAS,oBAC7C,GAAe,EAAK,QAAQ,SAAS,YACrC,GAAiB,EAAK,QAAQ,SAAS,iCACvC,GAAuB,EAAK,QAAQ,eAAe,oBACnD,GAAkB,EAAK,QAAQ,eAAe,eAC9C,GAAkB,EAAK,QAAQ,eAAe,eAC9C,GAAyB,EAAK,QAAQ,eAAe,sBAGvD,MAAO,CACL,UAAW,EAAM,OACjB,gBACA,cACA,0BACA,yBACA,YACA,YACA,oBACA,eACA,oBACA,sBACA,sBACA,cACA,iCAAkC,EAAM,SAAW,EAAI,EAAI,EAAgB,EAAM,OACjF,sBACA,iBACA,iBACA,uBACF,CACF,CAEA,SAAS,EAAoB,EAAc,EAAmC,CAS5E,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,CAEA,SAAS,EAAY,EAAc,EAA0B,EAAiB,GAAiC,CAC7G,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,KAM/B,GAAC,GACD,CAAC,EAAQ,eACR,GAAgB,KAAK,EAAK,SAAS,CAAI,CAAC,GAAK,GAAoB,KAAK,EAAK,SAAS,CAAI,CAAC,IAU5F,OAJI,EAAK,QAAQ,CAAI,IAAM,KAClB,MAGF,EAAoB,IAAI,EAAK,QAAQ,CAAS,CAAC,CACxD,CAEA,SAAS,EAAoB,EAAuB,CAClD,IAAM,EAAS,EAAqB,CAAK,EACzC,GAAI,EAAS,IACX,MAAM,IAAI,EAAqB,wCAAwC,EAEzE,OAAO,CACT,CAEA,SAAS,GAAwB,EAAuB,CACtD,GAAI,CAAC,SAAS,KAAK,CAAK,EACtB,MAAM,IAAI,EAAqB,kCAAkC,EAGnE,IAAM,EAAS,OAAO,CAAK,EAC3B,GAAI,CAAC,OAAO,cAAc,CAAM,GAAK,EAAS,EAC5C,MAAM,IAAI,EAAqB,kCAAkC,EAEnE,OAAO,CACT,CAEA,SAAS,EAAqB,EAAuB,CACnD,GAAI,CAAC,cAAc,KAAK,CAAK,EAC3B,MAAM,IAAI,EAAqB,8BAA8B,EAG/D,IAAM,EAAS,OAAO,CAAK,EAC3B,GAAI,CAAC,OAAO,cAAc,CAAM,GAAK,EAAS,EAC5C,MAAM,IAAI,EAAqB,8BAA8B,EAE/D,OAAO,CACT,CAEA,SAAS,EAAW,EAAc,EAAsB,CACtD,OAAO,EAAK,SAAS,EAAM,CAAI,GAAK,EAAK,SAAS,CAAI,CACxD,CAEA,SAAS,EAAY,EAAuB,CAC1C,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAS,EAAY,EAAuB,CAC1C,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAS,EAAY,EAAwB,CAC3C,OAAO,aAAiB,MAAQ,EAAM,QAAU,OAAO,CAAK,CAC9D"}

package/dist/crossFileDuplication.cjs

@@ -1,2 +1,2 @@
-"use strict";const e=require("./duplicateSelection.cjs");function t(t){let i=t.flatMap(({file:e,candidates:t},n)=>t.map(t=>({...t,regionBucket:n,file:e})));return r(e.selectMaximalGroups(i,n,(e,t)=>e.regionBucket-t.regionBucket||e.startIndex-t.startIndex))}function n(e){return e.length>=2&&new Set(e.map(e=>e.regionBucket)).size>=2}function r(e){let t=[],n=new Map,r=0;for(let i of e.values()){r+=i.length-1;let e=i.map(({file:e,startLine:t,endLine:n})=>({file:e,startLine:t,endLine:n})).toSorted((e,t)=>e.file.localeCompare(t.file)||e.startLine-t.startLine),a=[...new Set(e.map(({file:e})=>e))];for(let e of a)n.set(e,(n.get(e)??0)+1);t.push({files:a,occurrences:e,tokenCount:i[0]?.tokenCount??0})}return t.sort((e,t)=>t.tokenCount-e.tokenCount||(e.occurrences[0]?.file??``).localeCompare(t.occurrences[0]?.file??``)||(e.occurrences[0]?.startLine??0)-(t.occurrences[0]?.startLine??0)),{duplicateBlockCount:r,duplicateBlockGroupCountByFile:Object.fromEntries(n),groups:t}}exports.measureCrossFileDuplication=t;
+"use strict";const e=require("./duplicateSelection.cjs"),t=require("./duplication.cjs");function n(n,s){let c=s?.minTokens??t.defaultDuplicationOptions.minTokens,l=s?.maxGapTokens??t.defaultDuplicationOptions.maxGapTokens,u=n.flatMap(({file:e,candidates:t},n)=>t.map(t=>({...t,regionBucket:n,file:e})));for(let e of r(n,c))u.push(e);return o(a([...e.selectMaximalGroups(u,i,(e,t)=>e.regionBucket-t.regionBucket||e.startIndex-t.startIndex).values()],n,l))}function r(e,n){let r=[],i=[];for(let[n,{tokens:a,containerStatements:o}]of e.entries())a&&o&&(r.push(n),i.push({tokens:a,literalCountPrefix:t.buildLiteralCountPrefix(a),containers:o}));return i.length<2?[]:t.collectSequenceWindowCandidates(i,n,!0).flatMap(({candidate:t,contextIndex:n})=>{let i=r[n],a=i===void 0?void 0:e[i];return i===void 0||a===void 0?[]:[{...t,regionBucket:i,file:a.file}]})}function i(e){return e.length>=2&&new Set(e.map(e=>e.regionBucket)).size>=2}function a(e,n,r){let i=[],a=0;for(let{tokens:e,candidates:t}of n){i.push(a);let n=e?.length??0;if(!e)for(let e of t)n=Math.max(n,e.endTokenIndex);a+=n+r+1}let o=e.map(e=>e.map(e=>{let t=e.startTokenIndex+(i[e.regionBucket]??0),n=e.endTokenIndex+(i[e.regionBucket]??0);return{file:e.file,segments:[{startTokenIndex:t,endTokenIndex:n}],tokenCount:e.tokenCount,startTokenIndex:t,endTokenIndex:n,startIndex:e.startIndex,endIndex:e.endIndex,startLine:e.startLine,endLine:e.endLine}}).toSorted((e,t)=>e.startTokenIndex-t.startTokenIndex));return t.mergeAdjacentGroups(o,r)}function o(e){let n=[],r=new Map,i=0;for(let a of e){i+=t.countRedundantFragments(a);let e=a.map(({file:e,startLine:t,endLine:n})=>({file:e,startLine:t,endLine:n})).toSorted((e,t)=>e.file.localeCompare(t.file)||e.startLine-t.startLine),o=[...new Set(e.map(({file:e})=>e))];for(let e of o)r.set(e,(r.get(e)??0)+1);n.push({files:o,occurrences:e,tokenCount:a[0]?.tokenCount??0})}return n.sort((e,t)=>t.tokenCount-e.tokenCount||(e.occurrences[0]?.file??``).localeCompare(t.occurrences[0]?.file??``)||(e.occurrences[0]?.startLine??0)-(t.occurrences[0]?.startLine??0)),{duplicateBlockCount:i,duplicateBlockGroupCountByFile:Object.fromEntries(r),groups:n}}exports.measureCrossFileDuplication=n;
 //# sourceMappingURL=crossFileDuplication.cjs.map

package/dist/crossFileDuplication.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"crossFileDuplication.cjs","names":["selectMaximalGroups"],"sources":["../src/crossFileDuplication.ts"],"sourcesContent":["import { selectMaximalGroups } from './duplicateSelection.js';\nimport type { CrossFileDuplicateCandidate } from './duplication.js';\n\nexport interface CrossFileDuplicationSourceFile {\n  file: string;\n  candidates: CrossFileDuplicateCandidate[];\n}\n\nexport interface CrossFileDuplicateOccurrence {\n  endLine: number;\n  file: string;\n  startLine: number;\n}\n\nexport interface CrossFileDuplicateBlockGroup {\n  files: string[];\n  occurrences: CrossFileDuplicateOccurrence[];\n  /** Normalized token count of one occurrence (all occurrences share it). */\n  tokenCount: number;\n}\n\nexport interface CrossFileDuplicationMetrics {\n  /** Number of redundant copies across all groups, i.e. sum of (occurrenceCount - 1). */\n  duplicateBlockCount: number;\n  /** Groups the file participates in, keyed by the file name passed in. */\n  duplicateBlockGroupCountByFile: Record<string, number>;\n  groups: CrossFileDuplicateBlockGroup[];\n}\n\ninterface SelectableCandidate extends CrossFileDuplicateCandidate {\n  regionBucket: number;\n  file: string;\n}\n\n/**\n * Detects code regions duplicated across files: per-file candidates (whole block subtrees and\n * full container runs, fingerprinted with the same normalization as within-file duplication) are\n * grouped by fingerprint, and only maximal, non-overlapping regions whose group spans at least two\n * files are counted. Groups that shrink to a single file during selection are shed — a\n * within-file repeat is already reported by that file's own duplication metrics.\n */\nexport function measureCrossFileDuplication(files: CrossFileDuplicationSourceFile[]): CrossFileDuplicationMetrics {\n  const candidates: SelectableCandidate[] = files.flatMap(({ file, candidates }, fileIndex) =>\n    candidates.map((candidate) => ({ ...candidate, regionBucket: fileIndex, file }))\n  );\n  const counted = selectMaximalGroups(\n    candidates,\n    spansMultipleFiles,\n    // File index and position break coverage ties deterministically.\n    (left, right) => left.regionBucket - right.regionBucket || left.startIndex - right.startIndex\n  );\n  return summarize(counted);\n}\n\nfunction spansMultipleFiles(group: SelectableCandidate[]): boolean {\n  return group.length >= 2 && new Set(group.map((candidate) => candidate.regionBucket)).size >= 2;\n}\n\nfunction summarize(counted: Map<string, SelectableCandidate[]>): CrossFileDuplicationMetrics {\n  const groups: CrossFileDuplicateBlockGroup[] = [];\n  // Accumulated in a Map: file names are arbitrary strings, and a plain object would read\n  // inherited properties for names like \"constructor\".\n  const groupCountByFile = new Map<string, number>();\n  let duplicateBlockCount = 0;\n  for (const group of counted.values()) {\n    duplicateBlockCount += group.length - 1;\n    const occurrences = group\n      .map(({ file, startLine, endLine }) => ({ file, startLine, endLine }))\n      .toSorted((left, right) => left.file.localeCompare(right.file) || left.startLine - right.startLine);\n    const files = [...new Set(occurrences.map(({ file }) => file))];\n    for (const file of files) {\n      groupCountByFile.set(file, (groupCountByFile.get(file) ?? 0) + 1);\n    }\n    groups.push({ files, occurrences, tokenCount: group[0]?.tokenCount ?? 0 });\n  }\n  groups.sort(\n    (left, right) =>\n      right.tokenCount - left.tokenCount ||\n      (left.occurrences[0]?.file ?? '').localeCompare(right.occurrences[0]?.file ?? '') ||\n      (left.occurrences[0]?.startLine ?? 0) - (right.occurrences[0]?.startLine ?? 0)\n  );\n  return { duplicateBlockCount, duplicateBlockGroupCountByFile: Object.fromEntries(groupCountByFile), groups };\n}\n"],"mappings":"yDAyCA,SAAgB,EAA4B,EAAsE,CAChH,IAAM,EAAoC,EAAM,SAAS,CAAE,OAAM,cAAc,IAC7E,EAAW,IAAK,IAAe,CAAE,GAAG,EAAW,aAAc,EAAW,MAAK,EAAE,CACjF,EAOA,OAAO,EANSA,EAAAA,oBACd,EACA,GAEC,EAAM,IAAU,EAAK,aAAe,EAAM,cAAgB,EAAK,WAAa,EAAM,UAE9D,CAAC,CAC1B,CAEA,SAAS,EAAmB,EAAuC,CACjE,OAAO,EAAM,QAAU,GAAK,IAAI,IAAI,EAAM,IAAK,GAAc,EAAU,YAAY,CAAC,CAAC,CAAC,MAAQ,CAChG,CAEA,SAAS,EAAU,EAA0E,CAC3F,IAAM,EAAyC,CAAC,EAG1C,EAAmB,IAAI,IACzB,EAAsB,EAC1B,IAAK,IAAM,KAAS,EAAQ,OAAO,EAAG,CACpC,GAAuB,EAAM,OAAS,EACtC,IAAM,EAAc,EACjB,KAAK,CAAE,OAAM,YAAW,cAAe,CAAE,OAAM,YAAW,SAAQ,EAAE,CAAC,CACrE,UAAU,EAAM,IAAU,EAAK,KAAK,cAAc,EAAM,IAAI,GAAK,EAAK,UAAY,EAAM,SAAS,EAC9F,EAAQ,CAAC,GAAG,IAAI,IAAI,EAAY,KAAK,CAAE,UAAW,CAAI,CAAC,CAAC,EAC9D,IAAK,IAAM,KAAQ,EACjB,EAAiB,IAAI,GAAO,EAAiB,IAAI,CAAI,GAAK,GAAK,CAAC,EAElE,EAAO,KAAK,CAAE,QAAO,cAAa,WAAY,EAAM,EAAE,EAAE,YAAc,CAAE,CAAC,CAC3E,CAOA,OANA,EAAO,MACJ,EAAM,IACL,EAAM,WAAa,EAAK,aACvB,EAAK,YAAY,EAAE,EAAE,MAAQ,GAAA,CAAI,cAAc,EAAM,YAAY,EAAE,EAAE,MAAQ,EAAE,IAC/E,EAAK,YAAY,EAAE,EAAE,WAAa,IAAM,EAAM,YAAY,EAAE,EAAE,WAAa,EAChF,EACO,CAAE,sBAAqB,+BAAgC,OAAO,YAAY,CAAgB,EAAG,QAAO,CAC7G"}
+{"version":3,"file":"crossFileDuplication.cjs","names":["defaultDuplicationOptions","selectMaximalGroups","buildLiteralCountPrefix","collectSequenceWindowCandidates","mergeAdjacentGroups","countRedundantFragments"],"sources":["../src/crossFileDuplication.ts"],"sourcesContent":["import { selectMaximalGroups } from './duplicateSelection.js';\nimport {\n  buildLiteralCountPrefix,\n  collectSequenceWindowCandidates,\n  countRedundantFragments,\n  defaultDuplicationOptions,\n  mergeAdjacentGroups,\n  type CountedOccurrence,\n  type CrossFileDuplicateCandidate,\n  type CrossFileDuplicationFileData,\n  type SequenceWindowContext,\n} from './duplication.js';\nimport type { DuplicationOptions } from './types.js';\n\nexport interface CrossFileDuplicationSourceFile extends Partial<CrossFileDuplicationFileData> {\n  file: string;\n  candidates: CrossFileDuplicateCandidate[];\n}\n\nexport interface CrossFileDuplicateOccurrence {\n  endLine: number;\n  file: string;\n  startLine: number;\n}\n\nexport interface CrossFileDuplicateBlockGroup {\n  files: string[];\n  occurrences: CrossFileDuplicateOccurrence[];\n  /** Matched token count of one occurrence (all occurrences share it; gaps are not counted). */\n  tokenCount: number;\n}\n\nexport interface CrossFileDuplicationMetrics {\n  /** Number of redundant copies across all groups, counted per matched fragment like within-file. */\n  duplicateBlockCount: number;\n  /** Groups the file participates in, keyed by the file name passed in. */\n  duplicateBlockGroupCountByFile: Record<string, number>;\n  groups: CrossFileDuplicateBlockGroup[];\n}\n\ninterface SelectableCandidate extends CrossFileDuplicateCandidate {\n  regionBucket: number;\n  file: string;\n}\n\n/** A cross-file occurrence: a within-file occurrence in the project-wide token index space. */\ninterface CrossFileOccurrence extends CountedOccurrence {\n  file: string;\n}\n\n/**\n * Detects code regions duplicated across files. Per-file candidates (whole block subtrees and full\n * container runs, fingerprinted with the same normalization as within-file duplication) are joined\n * by a project-level window index over per-statement fingerprint sequences (CPD-style), so a\n * copy-pasted partial statement run embedded in different surrounding code is matched even though\n * no single file can know it repeats elsewhere. Candidates are grouped by fingerprint, and only\n * maximal, non-overlapping regions whose group spans at least two files are counted. Groups that\n * shrink to a single file during selection are shed — a within-file repeat is already reported by\n * that file's own duplication metrics. Groups separated by a small token gap within each file then\n * merge into gapped (Type-3) clone groups under `maxGapTokens`, exactly like within-file merging.\n */\nexport function measureCrossFileDuplication(\n  files: CrossFileDuplicationSourceFile[],\n  options?: DuplicationOptions\n): CrossFileDuplicationMetrics {\n  const minTokens = options?.minTokens ?? defaultDuplicationOptions.minTokens;\n  const maxGapTokens = options?.maxGapTokens ?? defaultDuplicationOptions.maxGapTokens;\n  const candidates: SelectableCandidate[] = files.flatMap(({ file, candidates }, fileIndex) =>\n    candidates.map((candidate) => ({ ...candidate, regionBucket: fileIndex, file }))\n  );\n  // Pushed one by one: spreading the project-scale window-candidate array as call arguments\n  // overflows V8's argument limit (~124k) and crashes on Node, though Bun/JSC tolerates it.\n  for (const candidate of collectWindowCandidates(files, minTokens)) {\n    candidates.push(candidate);\n  }\n  const counted = selectMaximalGroups(\n    candidates,\n    spansMultipleFiles,\n    // File index and position break coverage ties deterministically.\n    (left, right) => left.regionBucket - right.regionBucket || left.startIndex - right.startIndex\n  );\n  return summarize(mergeGapAdjacentGroups([...counted.values()], files, maxGapTokens));\n}\n\n/** Repeated sub-windows of sibling statements matched across the whole project's files. */\nfunction collectWindowCandidates(files: CrossFileDuplicationSourceFile[], minTokens: number): SelectableCandidate[] {\n  const fileIndexByContext: number[] = [];\n  const contexts: SequenceWindowContext[] = [];\n  for (const [fileIndex, { tokens, containerStatements }] of files.entries()) {\n    if (tokens && containerStatements) {\n      fileIndexByContext.push(fileIndex);\n      contexts.push({ tokens, literalCountPrefix: buildLiteralCountPrefix(tokens), containers: containerStatements });\n    }\n  }\n  if (contexts.length < 2) {\n    return [];\n  }\n  return collectSequenceWindowCandidates(contexts, minTokens, true).flatMap(({ candidate, contextIndex }) => {\n    const fileIndex = fileIndexByContext[contextIndex];\n    const file = fileIndex === undefined ? undefined : files[fileIndex];\n    return fileIndex === undefined || file === undefined\n      ? []\n      : [{ ...candidate, regionBucket: fileIndex, file: file.file }];\n  });\n}\n\nfunction spansMultipleFiles(group: SelectableCandidate[]): boolean {\n  return group.length >= 2 && new Set(group.map((candidate) => candidate.regionBucket)).size >= 2;\n}\n\n/**\n * Reuses the within-file gapped (Type-3) merging by mapping every occurrence into one project-wide\n * token index space: each file's tokens are offset by more than `maxGapTokens` past the previous\n * file's, so occurrences in different files are never gap-adjacent and pairs always stay within\n * one file.\n */\nfunction mergeGapAdjacentGroups(\n  groups: SelectableCandidate[][],\n  files: CrossFileDuplicationSourceFile[],\n  maxGapTokens: number\n): CrossFileOccurrence[][] {\n  const tokenOffsets: number[] = [];\n  let offset = 0;\n  for (const { tokens, candidates } of files) {\n    tokenOffsets.push(offset);\n    // Accumulated in a loop: spreading a project-scale candidate array as call arguments would\n    // overflow V8's argument limit (~124k) and crash on Node.\n    let tokenCount = tokens?.length ?? 0;\n    if (!tokens) {\n      for (const candidate of candidates) {\n        tokenCount = Math.max(tokenCount, candidate.endTokenIndex);\n      }\n    }\n    offset += tokenCount + maxGapTokens + 1;\n  }\n  const occurrenceGroups = groups.map((group) =>\n    group\n      .map((candidate): CrossFileOccurrence => {\n        const start = candidate.startTokenIndex + (tokenOffsets[candidate.regionBucket] ?? 0);\n        const end = candidate.endTokenIndex + (tokenOffsets[candidate.regionBucket] ?? 0);\n        return {\n          file: candidate.file,\n          segments: [{ startTokenIndex: start, endTokenIndex: end }],\n          tokenCount: candidate.tokenCount,\n          startTokenIndex: start,\n          endTokenIndex: end,\n          startIndex: candidate.startIndex,\n          endIndex: candidate.endIndex,\n          startLine: candidate.startLine,\n          endLine: candidate.endLine,\n        };\n      })\n      .toSorted((left, right) => left.startTokenIndex - right.startTokenIndex)\n  );\n  return mergeAdjacentGroups(occurrenceGroups, maxGapTokens);\n}\n\nfunction summarize(groups: CrossFileOccurrence[][]): CrossFileDuplicationMetrics {\n  const reported: CrossFileDuplicateBlockGroup[] = [];\n  // Accumulated in a Map: file names are arbitrary strings, and a plain object would read\n  // inherited properties for names like \"constructor\".\n  const groupCountByFile = new Map<string, number>();\n  let duplicateBlockCount = 0;\n  for (const group of groups) {\n    // Mirrors within-file counting: each redundant occurrence contributes one count per matched\n    // fragment, gapped merging consolidates the grouping without halving the count, and spans a\n    // partial merge shares between a retained group and the merged group count once.\n    duplicateBlockCount += countRedundantFragments(group);\n    const occurrences = group\n      .map(({ file, startLine, endLine }) => ({ file, startLine, endLine }))\n      .toSorted((left, right) => left.file.localeCompare(right.file) || left.startLine - right.startLine);\n    const files = [...new Set(occurrences.map(({ file }) => file))];\n    for (const file of files) {\n      groupCountByFile.set(file, (groupCountByFile.get(file) ?? 0) + 1);\n    }\n    reported.push({ files, occurrences, tokenCount: group[0]?.tokenCount ?? 0 });\n  }\n  reported.sort(\n    (left, right) =>\n      right.tokenCount - left.tokenCount ||\n      (left.occurrences[0]?.file ?? '').localeCompare(right.occurrences[0]?.file ?? '') ||\n      (left.occurrences[0]?.startLine ?? 0) - (right.occurrences[0]?.startLine ?? 0)\n  );\n  return {\n    duplicateBlockCount,\n    duplicateBlockGroupCountByFile: Object.fromEntries(groupCountByFile),\n    groups: reported,\n  };\n}\n"],"mappings":"wFA6DA,SAAgB,EACd,EACA,EAC6B,CAC7B,IAAM,EAAY,GAAS,WAAaA,EAAAA,0BAA0B,UAC5D,EAAe,GAAS,cAAgBA,EAAAA,0BAA0B,aAClE,EAAoC,EAAM,SAAS,CAAE,OAAM,cAAc,IAC7E,EAAW,IAAK,IAAe,CAAE,GAAG,EAAW,aAAc,EAAW,MAAK,EAAE,CACjF,EAGA,IAAK,IAAM,KAAa,EAAwB,EAAO,CAAS,EAC9D,EAAW,KAAK,CAAS,EAQ3B,OAAO,EAAU,EAAuB,CAAC,GANzBC,EAAAA,oBACd,EACA,GAEC,EAAM,IAAU,EAAK,aAAe,EAAM,cAAgB,EAAK,WAAa,EAAM,UAEnC,CAAC,CAAC,OAAO,CAAC,EAAG,EAAO,CAAY,CAAC,CACrF,CAGA,SAAS,EAAwB,EAAyC,EAA0C,CAClH,IAAM,EAA+B,CAAC,EAChC,EAAoC,CAAC,EAC3C,IAAK,GAAM,CAAC,EAAW,CAAE,SAAQ,0BAA0B,EAAM,QAAQ,EACnE,GAAU,IACZ,EAAmB,KAAK,CAAS,EACjC,EAAS,KAAK,CAAE,SAAQ,mBAAoBC,EAAAA,wBAAwB,CAAM,EAAG,WAAY,CAAoB,CAAC,GAMlH,OAHI,EAAS,OAAS,EACb,CAAC,EAEHC,EAAAA,gCAAgC,EAAU,EAAW,EAAI,CAAC,CAAC,SAAS,CAAE,YAAW,kBAAmB,CACzG,IAAM,EAAY,EAAmB,GAC/B,EAAO,IAAc,IAAA,GAAY,IAAA,GAAY,EAAM,GACzD,OAAO,IAAc,IAAA,IAAa,IAAS,IAAA,GACvC,CAAC,EACD,CAAC,CAAE,GAAG,EAAW,aAAc,EAAW,KAAM,EAAK,IAAK,CAAC,CACjE,CAAC,CACH,CAEA,SAAS,EAAmB,EAAuC,CACjE,OAAO,EAAM,QAAU,GAAK,IAAI,IAAI,EAAM,IAAK,GAAc,EAAU,YAAY,CAAC,CAAC,CAAC,MAAQ,CAChG,CAQA,SAAS,EACP,EACA,EACA,EACyB,CACzB,IAAM,EAAyB,CAAC,EAC5B,EAAS,EACb,IAAK,GAAM,CAAE,SAAQ,gBAAgB,EAAO,CAC1C,EAAa,KAAK,CAAM,EAGxB,IAAI,EAAa,GAAQ,QAAU,EACnC,GAAI,CAAC,EACH,IAAK,IAAM,KAAa,EACtB,EAAa,KAAK,IAAI,EAAY,EAAU,aAAa,EAG7D,GAAU,EAAa,EAAe,CACxC,CACA,IAAM,EAAmB,EAAO,IAAK,GACnC,EACG,IAAK,GAAmC,CACvC,IAAM,EAAQ,EAAU,iBAAmB,EAAa,EAAU,eAAiB,GAC7E,EAAM,EAAU,eAAiB,EAAa,EAAU,eAAiB,GAC/E,MAAO,CACL,KAAM,EAAU,KAChB,SAAU,CAAC,CAAE,gBAAiB,EAAO,cAAe,CAAI,CAAC,EACzD,WAAY,EAAU,WACtB,gBAAiB,EACjB,cAAe,EACf,WAAY,EAAU,WACtB,SAAU,EAAU,SACpB,UAAW,EAAU,UACrB,QAAS,EAAU,OACrB,CACF,CAAC,CAAC,CACD,UAAU,EAAM,IAAU,EAAK,gBAAkB,EAAM,eAAe,CAC3E,EACA,OAAOC,EAAAA,oBAAoB,EAAkB,CAAY,CAC3D,CAEA,SAAS,EAAU,EAA8D,CAC/E,IAAM,EAA2C,CAAC,EAG5C,EAAmB,IAAI,IACzB,EAAsB,EAC1B,IAAK,IAAM,KAAS,EAAQ,CAI1B,GAAuBC,EAAAA,wBAAwB,CAAK,EACpD,IAAM,EAAc,EACjB,KAAK,CAAE,OAAM,YAAW,cAAe,CAAE,OAAM,YAAW,SAAQ,EAAE,CAAC,CACrE,UAAU,EAAM,IAAU,EAAK,KAAK,cAAc,EAAM,IAAI,GAAK,EAAK,UAAY,EAAM,SAAS,EAC9F,EAAQ,CAAC,GAAG,IAAI,IAAI,EAAY,KAAK,CAAE,UAAW,CAAI,CAAC,CAAC,EAC9D,IAAK,IAAM,KAAQ,EACjB,EAAiB,IAAI,GAAO,EAAiB,IAAI,CAAI,GAAK,GAAK,CAAC,EAElE,EAAS,KAAK,CAAE,QAAO,cAAa,WAAY,EAAM,EAAE,EAAE,YAAc,CAAE,CAAC,CAC7E,CAOA,OANA,EAAS,MACN,EAAM,IACL,EAAM,WAAa,EAAK,aACvB,EAAK,YAAY,EAAE,EAAE,MAAQ,GAAA,CAAI,cAAc,EAAM,YAAY,EAAE,EAAE,MAAQ,EAAE,IAC/E,EAAK,YAAY,EAAE,EAAE,WAAa,IAAM,EAAM,YAAY,EAAE,EAAE,WAAa,EAChF,EACO,CACL,sBACA,+BAAgC,OAAO,YAAY,CAAgB,EACnE,OAAQ,CACV,CACF"}

package/dist/crossFileDuplication.d.ts

@@ -1,5 +1,6 @@
-import type { CrossFileDuplicateCandidate } from './duplication.js';
-export interface CrossFileDuplicationSourceFile {
+import { type CrossFileDuplicateCandidate, type CrossFileDuplicationFileData } from './duplication.js';
+import type { DuplicationOptions } from './types.js';
+export interface CrossFileDuplicationSourceFile extends Partial<CrossFileDuplicationFileData> {
     file: string;
     candidates: CrossFileDuplicateCandidate[];
 }
@@ -11,21 +12,25 @@ export interface CrossFileDuplicateOccurrence {
 export interface CrossFileDuplicateBlockGroup {
     files: string[];
     occurrences: CrossFileDuplicateOccurrence[];
-    /** Normalized token count of one occurrence (all occurrences share it). */
+    /** Matched token count of one occurrence (all occurrences share it; gaps are not counted). */
     tokenCount: number;
 }
 export interface CrossFileDuplicationMetrics {
-    /** Number of redundant copies across all groups, i.e. sum of (occurrenceCount - 1). */
+    /** Number of redundant copies across all groups, counted per matched fragment like within-file. */
     duplicateBlockCount: number;
     /** Groups the file participates in, keyed by the file name passed in. */
     duplicateBlockGroupCountByFile: Record<string, number>;
     groups: CrossFileDuplicateBlockGroup[];
 }
 /**
- * Detects code regions duplicated across files: per-file candidates (whole block subtrees and
- * full container runs, fingerprinted with the same normalization as within-file duplication) are
- * grouped by fingerprint, and only maximal, non-overlapping regions whose group spans at least two
- * files are counted. Groups that shrink to a single file during selection are shed — a
- * within-file repeat is already reported by that file's own duplication metrics.
+ * Detects code regions duplicated across files. Per-file candidates (whole block subtrees and full
+ * container runs, fingerprinted with the same normalization as within-file duplication) are joined
+ * by a project-level window index over per-statement fingerprint sequences (CPD-style), so a
+ * copy-pasted partial statement run embedded in different surrounding code is matched even though
+ * no single file can know it repeats elsewhere. Candidates are grouped by fingerprint, and only
+ * maximal, non-overlapping regions whose group spans at least two files are counted. Groups that
+ * shrink to a single file during selection are shed — a within-file repeat is already reported by
+ * that file's own duplication metrics. Groups separated by a small token gap within each file then
+ * merge into gapped (Type-3) clone groups under `maxGapTokens`, exactly like within-file merging.
  */
-export declare function measureCrossFileDuplication(files: CrossFileDuplicationSourceFile[]): CrossFileDuplicationMetrics;
+export declare function measureCrossFileDuplication(files: CrossFileDuplicationSourceFile[], options?: DuplicationOptions): CrossFileDuplicationMetrics;

package/dist/crossFileDuplication.js

@@ -1,2 +1,2 @@
-import{selectMaximalGroups as e}from"./duplicateSelection.js";function t(t){let i=t.flatMap(({file:e,candidates:t},n)=>t.map(t=>({...t,regionBucket:n,file:e})));return r(e(i,n,(e,t)=>e.regionBucket-t.regionBucket||e.startIndex-t.startIndex))}function n(e){return e.length>=2&&new Set(e.map(e=>e.regionBucket)).size>=2}function r(e){let t=[],n=new Map,r=0;for(let i of e.values()){r+=i.length-1;let e=i.map(({file:e,startLine:t,endLine:n})=>({file:e,startLine:t,endLine:n})).toSorted((e,t)=>e.file.localeCompare(t.file)||e.startLine-t.startLine),a=[...new Set(e.map(({file:e})=>e))];for(let e of a)n.set(e,(n.get(e)??0)+1);t.push({files:a,occurrences:e,tokenCount:i[0]?.tokenCount??0})}return t.sort((e,t)=>t.tokenCount-e.tokenCount||(e.occurrences[0]?.file??``).localeCompare(t.occurrences[0]?.file??``)||(e.occurrences[0]?.startLine??0)-(t.occurrences[0]?.startLine??0)),{duplicateBlockCount:r,duplicateBlockGroupCountByFile:Object.fromEntries(n),groups:t}}export{t as measureCrossFileDuplication};
+import{selectMaximalGroups as e}from"./duplicateSelection.js";import{buildLiteralCountPrefix as t,collectSequenceWindowCandidates as n,countRedundantFragments as r,defaultDuplicationOptions as i,mergeAdjacentGroups as a}from"./duplication.js";function o(t,n){let r=n?.minTokens??i.minTokens,a=n?.maxGapTokens??i.maxGapTokens,o=t.flatMap(({file:e,candidates:t},n)=>t.map(t=>({...t,regionBucket:n,file:e})));for(let e of s(t,r))o.push(e);return u(l([...e(o,c,(e,t)=>e.regionBucket-t.regionBucket||e.startIndex-t.startIndex).values()],t,a))}function s(e,r){let i=[],a=[];for(let[n,{tokens:r,containerStatements:o}]of e.entries())r&&o&&(i.push(n),a.push({tokens:r,literalCountPrefix:t(r),containers:o}));return a.length<2?[]:n(a,r,!0).flatMap(({candidate:t,contextIndex:n})=>{let r=i[n],a=r===void 0?void 0:e[r];return r===void 0||a===void 0?[]:[{...t,regionBucket:r,file:a.file}]})}function c(e){return e.length>=2&&new Set(e.map(e=>e.regionBucket)).size>=2}function l(e,t,n){let r=[],i=0;for(let{tokens:e,candidates:a}of t){r.push(i);let t=e?.length??0;if(!e)for(let e of a)t=Math.max(t,e.endTokenIndex);i+=t+n+1}let o=e.map(e=>e.map(e=>{let t=e.startTokenIndex+(r[e.regionBucket]??0),n=e.endTokenIndex+(r[e.regionBucket]??0);return{file:e.file,segments:[{startTokenIndex:t,endTokenIndex:n}],tokenCount:e.tokenCount,startTokenIndex:t,endTokenIndex:n,startIndex:e.startIndex,endIndex:e.endIndex,startLine:e.startLine,endLine:e.endLine}}).toSorted((e,t)=>e.startTokenIndex-t.startTokenIndex));return a(o,n)}function u(e){let t=[],n=new Map,i=0;for(let a of e){i+=r(a);let e=a.map(({file:e,startLine:t,endLine:n})=>({file:e,startLine:t,endLine:n})).toSorted((e,t)=>e.file.localeCompare(t.file)||e.startLine-t.startLine),o=[...new Set(e.map(({file:e})=>e))];for(let e of o)n.set(e,(n.get(e)??0)+1);t.push({files:o,occurrences:e,tokenCount:a[0]?.tokenCount??0})}return t.sort((e,t)=>t.tokenCount-e.tokenCount||(e.occurrences[0]?.file??``).localeCompare(t.occurrences[0]?.file??``)||(e.occurrences[0]?.startLine??0)-(t.occurrences[0]?.startLine??0)),{duplicateBlockCount:i,duplicateBlockGroupCountByFile:Object.fromEntries(n),groups:t}}export{o as measureCrossFileDuplication};
 //# sourceMappingURL=crossFileDuplication.js.map

package/dist/crossFileDuplication.js.map

@@ -1 +1 @@
-{"version":3,"file":"crossFileDuplication.js","names":[],"sources":["../src/crossFileDuplication.ts"],"sourcesContent":["import { selectMaximalGroups } from './duplicateSelection.js';\nimport type { CrossFileDuplicateCandidate } from './duplication.js';\n\nexport interface CrossFileDuplicationSourceFile {\n  file: string;\n  candidates: CrossFileDuplicateCandidate[];\n}\n\nexport interface CrossFileDuplicateOccurrence {\n  endLine: number;\n  file: string;\n  startLine: number;\n}\n\nexport interface CrossFileDuplicateBlockGroup {\n  files: string[];\n  occurrences: CrossFileDuplicateOccurrence[];\n  /** Normalized token count of one occurrence (all occurrences share it). */\n  tokenCount: number;\n}\n\nexport interface CrossFileDuplicationMetrics {\n  /** Number of redundant copies across all groups, i.e. sum of (occurrenceCount - 1). */\n  duplicateBlockCount: number;\n  /** Groups the file participates in, keyed by the file name passed in. */\n  duplicateBlockGroupCountByFile: Record<string, number>;\n  groups: CrossFileDuplicateBlockGroup[];\n}\n\ninterface SelectableCandidate extends CrossFileDuplicateCandidate {\n  regionBucket: number;\n  file: string;\n}\n\n/**\n * Detects code regions duplicated across files: per-file candidates (whole block subtrees and\n * full container runs, fingerprinted with the same normalization as within-file duplication) are\n * grouped by fingerprint, and only maximal, non-overlapping regions whose group spans at least two\n * files are counted. Groups that shrink to a single file during selection are shed — a\n * within-file repeat is already reported by that file's own duplication metrics.\n */\nexport function measureCrossFileDuplication(files: CrossFileDuplicationSourceFile[]): CrossFileDuplicationMetrics {\n  const candidates: SelectableCandidate[] = files.flatMap(({ file, candidates }, fileIndex) =>\n    candidates.map((candidate) => ({ ...candidate, regionBucket: fileIndex, file }))\n  );\n  const counted = selectMaximalGroups(\n    candidates,\n    spansMultipleFiles,\n    // File index and position break coverage ties deterministically.\n    (left, right) => left.regionBucket - right.regionBucket || left.startIndex - right.startIndex\n  );\n  return summarize(counted);\n}\n\nfunction spansMultipleFiles(group: SelectableCandidate[]): boolean {\n  return group.length >= 2 && new Set(group.map((candidate) => candidate.regionBucket)).size >= 2;\n}\n\nfunction summarize(counted: Map<string, SelectableCandidate[]>): CrossFileDuplicationMetrics {\n  const groups: CrossFileDuplicateBlockGroup[] = [];\n  // Accumulated in a Map: file names are arbitrary strings, and a plain object would read\n  // inherited properties for names like \"constructor\".\n  const groupCountByFile = new Map<string, number>();\n  let duplicateBlockCount = 0;\n  for (const group of counted.values()) {\n    duplicateBlockCount += group.length - 1;\n    const occurrences = group\n      .map(({ file, startLine, endLine }) => ({ file, startLine, endLine }))\n      .toSorted((left, right) => left.file.localeCompare(right.file) || left.startLine - right.startLine);\n    const files = [...new Set(occurrences.map(({ file }) => file))];\n    for (const file of files) {\n      groupCountByFile.set(file, (groupCountByFile.get(file) ?? 0) + 1);\n    }\n    groups.push({ files, occurrences, tokenCount: group[0]?.tokenCount ?? 0 });\n  }\n  groups.sort(\n    (left, right) =>\n      right.tokenCount - left.tokenCount ||\n      (left.occurrences[0]?.file ?? '').localeCompare(right.occurrences[0]?.file ?? '') ||\n      (left.occurrences[0]?.startLine ?? 0) - (right.occurrences[0]?.startLine ?? 0)\n  );\n  return { duplicateBlockCount, duplicateBlockGroupCountByFile: Object.fromEntries(groupCountByFile), groups };\n}\n"],"mappings":"8DAyCA,SAAgB,EAA4B,EAAsE,CAChH,IAAM,EAAoC,EAAM,SAAS,CAAE,OAAM,cAAc,IAC7E,EAAW,IAAK,IAAe,CAAE,GAAG,EAAW,aAAc,EAAW,MAAK,EAAE,CACjF,EAOA,OAAO,EANS,EACd,EACA,GAEC,EAAM,IAAU,EAAK,aAAe,EAAM,cAAgB,EAAK,WAAa,EAAM,UAE9D,CAAC,CAC1B,CAEA,SAAS,EAAmB,EAAuC,CACjE,OAAO,EAAM,QAAU,GAAK,IAAI,IAAI,EAAM,IAAK,GAAc,EAAU,YAAY,CAAC,CAAC,CAAC,MAAQ,CAChG,CAEA,SAAS,EAAU,EAA0E,CAC3F,IAAM,EAAyC,CAAC,EAG1C,EAAmB,IAAI,IACzB,EAAsB,EAC1B,IAAK,IAAM,KAAS,EAAQ,OAAO,EAAG,CACpC,GAAuB,EAAM,OAAS,EACtC,IAAM,EAAc,EACjB,KAAK,CAAE,OAAM,YAAW,cAAe,CAAE,OAAM,YAAW,SAAQ,EAAE,CAAC,CACrE,UAAU,EAAM,IAAU,EAAK,KAAK,cAAc,EAAM,IAAI,GAAK,EAAK,UAAY,EAAM,SAAS,EAC9F,EAAQ,CAAC,GAAG,IAAI,IAAI,EAAY,KAAK,CAAE,UAAW,CAAI,CAAC,CAAC,EAC9D,IAAK,IAAM,KAAQ,EACjB,EAAiB,IAAI,GAAO,EAAiB,IAAI,CAAI,GAAK,GAAK,CAAC,EAElE,EAAO,KAAK,CAAE,QAAO,cAAa,WAAY,EAAM,EAAE,EAAE,YAAc,CAAE,CAAC,CAC3E,CAOA,OANA,EAAO,MACJ,EAAM,IACL,EAAM,WAAa,EAAK,aACvB,EAAK,YAAY,EAAE,EAAE,MAAQ,GAAA,CAAI,cAAc,EAAM,YAAY,EAAE,EAAE,MAAQ,EAAE,IAC/E,EAAK,YAAY,EAAE,EAAE,WAAa,IAAM,EAAM,YAAY,EAAE,EAAE,WAAa,EAChF,EACO,CAAE,sBAAqB,+BAAgC,OAAO,YAAY,CAAgB,EAAG,QAAO,CAC7G"}
+{"version":3,"file":"crossFileDuplication.js","names":[],"sources":["../src/crossFileDuplication.ts"],"sourcesContent":["import { selectMaximalGroups } from './duplicateSelection.js';\nimport {\n  buildLiteralCountPrefix,\n  collectSequenceWindowCandidates,\n  countRedundantFragments,\n  defaultDuplicationOptions,\n  mergeAdjacentGroups,\n  type CountedOccurrence,\n  type CrossFileDuplicateCandidate,\n  type CrossFileDuplicationFileData,\n  type SequenceWindowContext,\n} from './duplication.js';\nimport type { DuplicationOptions } from './types.js';\n\nexport interface CrossFileDuplicationSourceFile extends Partial<CrossFileDuplicationFileData> {\n  file: string;\n  candidates: CrossFileDuplicateCandidate[];\n}\n\nexport interface CrossFileDuplicateOccurrence {\n  endLine: number;\n  file: string;\n  startLine: number;\n}\n\nexport interface CrossFileDuplicateBlockGroup {\n  files: string[];\n  occurrences: CrossFileDuplicateOccurrence[];\n  /** Matched token count of one occurrence (all occurrences share it; gaps are not counted). */\n  tokenCount: number;\n}\n\nexport interface CrossFileDuplicationMetrics {\n  /** Number of redundant copies across all groups, counted per matched fragment like within-file. */\n  duplicateBlockCount: number;\n  /** Groups the file participates in, keyed by the file name passed in. */\n  duplicateBlockGroupCountByFile: Record<string, number>;\n  groups: CrossFileDuplicateBlockGroup[];\n}\n\ninterface SelectableCandidate extends CrossFileDuplicateCandidate {\n  regionBucket: number;\n  file: string;\n}\n\n/** A cross-file occurrence: a within-file occurrence in the project-wide token index space. */\ninterface CrossFileOccurrence extends CountedOccurrence {\n  file: string;\n}\n\n/**\n * Detects code regions duplicated across files. Per-file candidates (whole block subtrees and full\n * container runs, fingerprinted with the same normalization as within-file duplication) are joined\n * by a project-level window index over per-statement fingerprint sequences (CPD-style), so a\n * copy-pasted partial statement run embedded in different surrounding code is matched even though\n * no single file can know it repeats elsewhere. Candidates are grouped by fingerprint, and only\n * maximal, non-overlapping regions whose group spans at least two files are counted. Groups that\n * shrink to a single file during selection are shed — a within-file repeat is already reported by\n * that file's own duplication metrics. Groups separated by a small token gap within each file then\n * merge into gapped (Type-3) clone groups under `maxGapTokens`, exactly like within-file merging.\n */\nexport function measureCrossFileDuplication(\n  files: CrossFileDuplicationSourceFile[],\n  options?: DuplicationOptions\n): CrossFileDuplicationMetrics {\n  const minTokens = options?.minTokens ?? defaultDuplicationOptions.minTokens;\n  const maxGapTokens = options?.maxGapTokens ?? defaultDuplicationOptions.maxGapTokens;\n  const candidates: SelectableCandidate[] = files.flatMap(({ file, candidates }, fileIndex) =>\n    candidates.map((candidate) => ({ ...candidate, regionBucket: fileIndex, file }))\n  );\n  // Pushed one by one: spreading the project-scale window-candidate array as call arguments\n  // overflows V8's argument limit (~124k) and crashes on Node, though Bun/JSC tolerates it.\n  for (const candidate of collectWindowCandidates(files, minTokens)) {\n    candidates.push(candidate);\n  }\n  const counted = selectMaximalGroups(\n    candidates,\n    spansMultipleFiles,\n    // File index and position break coverage ties deterministically.\n    (left, right) => left.regionBucket - right.regionBucket || left.startIndex - right.startIndex\n  );\n  return summarize(mergeGapAdjacentGroups([...counted.values()], files, maxGapTokens));\n}\n\n/** Repeated sub-windows of sibling statements matched across the whole project's files. */\nfunction collectWindowCandidates(files: CrossFileDuplicationSourceFile[], minTokens: number): SelectableCandidate[] {\n  const fileIndexByContext: number[] = [];\n  const contexts: SequenceWindowContext[] = [];\n  for (const [fileIndex, { tokens, containerStatements }] of files.entries()) {\n    if (tokens && containerStatements) {\n      fileIndexByContext.push(fileIndex);\n      contexts.push({ tokens, literalCountPrefix: buildLiteralCountPrefix(tokens), containers: containerStatements });\n    }\n  }\n  if (contexts.length < 2) {\n    return [];\n  }\n  return collectSequenceWindowCandidates(contexts, minTokens, true).flatMap(({ candidate, contextIndex }) => {\n    const fileIndex = fileIndexByContext[contextIndex];\n    const file = fileIndex === undefined ? undefined : files[fileIndex];\n    return fileIndex === undefined || file === undefined\n      ? []\n      : [{ ...candidate, regionBucket: fileIndex, file: file.file }];\n  });\n}\n\nfunction spansMultipleFiles(group: SelectableCandidate[]): boolean {\n  return group.length >= 2 && new Set(group.map((candidate) => candidate.regionBucket)).size >= 2;\n}\n\n/**\n * Reuses the within-file gapped (Type-3) merging by mapping every occurrence into one project-wide\n * token index space: each file's tokens are offset by more than `maxGapTokens` past the previous\n * file's, so occurrences in different files are never gap-adjacent and pairs always stay within\n * one file.\n */\nfunction mergeGapAdjacentGroups(\n  groups: SelectableCandidate[][],\n  files: CrossFileDuplicationSourceFile[],\n  maxGapTokens: number\n): CrossFileOccurrence[][] {\n  const tokenOffsets: number[] = [];\n  let offset = 0;\n  for (const { tokens, candidates } of files) {\n    tokenOffsets.push(offset);\n    // Accumulated in a loop: spreading a project-scale candidate array as call arguments would\n    // overflow V8's argument limit (~124k) and crash on Node.\n    let tokenCount = tokens?.length ?? 0;\n    if (!tokens) {\n      for (const candidate of candidates) {\n        tokenCount = Math.max(tokenCount, candidate.endTokenIndex);\n      }\n    }\n    offset += tokenCount + maxGapTokens + 1;\n  }\n  const occurrenceGroups = groups.map((group) =>\n    group\n      .map((candidate): CrossFileOccurrence => {\n        const start = candidate.startTokenIndex + (tokenOffsets[candidate.regionBucket] ?? 0);\n        const end = candidate.endTokenIndex + (tokenOffsets[candidate.regionBucket] ?? 0);\n        return {\n          file: candidate.file,\n          segments: [{ startTokenIndex: start, endTokenIndex: end }],\n          tokenCount: candidate.tokenCount,\n          startTokenIndex: start,\n          endTokenIndex: end,\n          startIndex: candidate.startIndex,\n          endIndex: candidate.endIndex,\n          startLine: candidate.startLine,\n          endLine: candidate.endLine,\n        };\n      })\n      .toSorted((left, right) => left.startTokenIndex - right.startTokenIndex)\n  );\n  return mergeAdjacentGroups(occurrenceGroups, maxGapTokens);\n}\n\nfunction summarize(groups: CrossFileOccurrence[][]): CrossFileDuplicationMetrics {\n  const reported: CrossFileDuplicateBlockGroup[] = [];\n  // Accumulated in a Map: file names are arbitrary strings, and a plain object would read\n  // inherited properties for names like \"constructor\".\n  const groupCountByFile = new Map<string, number>();\n  let duplicateBlockCount = 0;\n  for (const group of groups) {\n    // Mirrors within-file counting: each redundant occurrence contributes one count per matched\n    // fragment, gapped merging consolidates the grouping without halving the count, and spans a\n    // partial merge shares between a retained group and the merged group count once.\n    duplicateBlockCount += countRedundantFragments(group);\n    const occurrences = group\n      .map(({ file, startLine, endLine }) => ({ file, startLine, endLine }))\n      .toSorted((left, right) => left.file.localeCompare(right.file) || left.startLine - right.startLine);\n    const files = [...new Set(occurrences.map(({ file }) => file))];\n    for (const file of files) {\n      groupCountByFile.set(file, (groupCountByFile.get(file) ?? 0) + 1);\n    }\n    reported.push({ files, occurrences, tokenCount: group[0]?.tokenCount ?? 0 });\n  }\n  reported.sort(\n    (left, right) =>\n      right.tokenCount - left.tokenCount ||\n      (left.occurrences[0]?.file ?? '').localeCompare(right.occurrences[0]?.file ?? '') ||\n      (left.occurrences[0]?.startLine ?? 0) - (right.occurrences[0]?.startLine ?? 0)\n  );\n  return {\n    duplicateBlockCount,\n    duplicateBlockGroupCountByFile: Object.fromEntries(groupCountByFile),\n    groups: reported,\n  };\n}\n"],"mappings":"mPA6DA,SAAgB,EACd,EACA,EAC6B,CAC7B,IAAM,EAAY,GAAS,WAAa,EAA0B,UAC5D,EAAe,GAAS,cAAgB,EAA0B,aAClE,EAAoC,EAAM,SAAS,CAAE,OAAM,cAAc,IAC7E,EAAW,IAAK,IAAe,CAAE,GAAG,EAAW,aAAc,EAAW,MAAK,EAAE,CACjF,EAGA,IAAK,IAAM,KAAa,EAAwB,EAAO,CAAS,EAC9D,EAAW,KAAK,CAAS,EAQ3B,OAAO,EAAU,EAAuB,CAAC,GANzB,EACd,EACA,GAEC,EAAM,IAAU,EAAK,aAAe,EAAM,cAAgB,EAAK,WAAa,EAAM,UAEnC,CAAC,CAAC,OAAO,CAAC,EAAG,EAAO,CAAY,CAAC,CACrF,CAGA,SAAS,EAAwB,EAAyC,EAA0C,CAClH,IAAM,EAA+B,CAAC,EAChC,EAAoC,CAAC,EAC3C,IAAK,GAAM,CAAC,EAAW,CAAE,SAAQ,0BAA0B,EAAM,QAAQ,EACnE,GAAU,IACZ,EAAmB,KAAK,CAAS,EACjC,EAAS,KAAK,CAAE,SAAQ,mBAAoB,EAAwB,CAAM,EAAG,WAAY,CAAoB,CAAC,GAMlH,OAHI,EAAS,OAAS,EACb,CAAC,EAEH,EAAgC,EAAU,EAAW,EAAI,CAAC,CAAC,SAAS,CAAE,YAAW,kBAAmB,CACzG,IAAM,EAAY,EAAmB,GAC/B,EAAO,IAAc,IAAA,GAAY,IAAA,GAAY,EAAM,GACzD,OAAO,IAAc,IAAA,IAAa,IAAS,IAAA,GACvC,CAAC,EACD,CAAC,CAAE,GAAG,EAAW,aAAc,EAAW,KAAM,EAAK,IAAK,CAAC,CACjE,CAAC,CACH,CAEA,SAAS,EAAmB,EAAuC,CACjE,OAAO,EAAM,QAAU,GAAK,IAAI,IAAI,EAAM,IAAK,GAAc,EAAU,YAAY,CAAC,CAAC,CAAC,MAAQ,CAChG,CAQA,SAAS,EACP,EACA,EACA,EACyB,CACzB,IAAM,EAAyB,CAAC,EAC5B,EAAS,EACb,IAAK,GAAM,CAAE,SAAQ,gBAAgB,EAAO,CAC1C,EAAa,KAAK,CAAM,EAGxB,IAAI,EAAa,GAAQ,QAAU,EACnC,GAAI,CAAC,EACH,IAAK,IAAM,KAAa,EACtB,EAAa,KAAK,IAAI,EAAY,EAAU,aAAa,EAG7D,GAAU,EAAa,EAAe,CACxC,CACA,IAAM,EAAmB,EAAO,IAAK,GACnC,EACG,IAAK,GAAmC,CACvC,IAAM,EAAQ,EAAU,iBAAmB,EAAa,EAAU,eAAiB,GAC7E,EAAM,EAAU,eAAiB,EAAa,EAAU,eAAiB,GAC/E,MAAO,CACL,KAAM,EAAU,KAChB,SAAU,CAAC,CAAE,gBAAiB,EAAO,cAAe,CAAI,CAAC,EACzD,WAAY,EAAU,WACtB,gBAAiB,EACjB,cAAe,EACf,WAAY,EAAU,WACtB,SAAU,EAAU,SACpB,UAAW,EAAU,UACrB,QAAS,EAAU,OACrB,CACF,CAAC,CAAC,CACD,UAAU,EAAM,IAAU,EAAK,gBAAkB,EAAM,eAAe,CAC3E,EACA,OAAO,EAAoB,EAAkB,CAAY,CAC3D,CAEA,SAAS,EAAU,EAA8D,CAC/E,IAAM,EAA2C,CAAC,EAG5C,EAAmB,IAAI,IACzB,EAAsB,EAC1B,IAAK,IAAM,KAAS,EAAQ,CAI1B,GAAuB,EAAwB,CAAK,EACpD,IAAM,EAAc,EACjB,KAAK,CAAE,OAAM,YAAW,cAAe,CAAE,OAAM,YAAW,SAAQ,EAAE,CAAC,CACrE,UAAU,EAAM,IAAU,EAAK,KAAK,cAAc,EAAM,IAAI,GAAK,EAAK,UAAY,EAAM,SAAS,EAC9F,EAAQ,CAAC,GAAG,IAAI,IAAI,EAAY,KAAK,CAAE,UAAW,CAAI,CAAC,CAAC,EAC9D,IAAK,IAAM,KAAQ,EACjB,EAAiB,IAAI,GAAO,EAAiB,IAAI,CAAI,GAAK,GAAK,CAAC,EAElE,EAAS,KAAK,CAAE,QAAO,cAAa,WAAY,EAAM,EAAE,EAAE,YAAc,CAAE,CAAC,CAC7E,CAOA,OANA,EAAS,MACN,EAAM,IACL,EAAM,WAAa,EAAK,aACvB,EAAK,YAAY,EAAE,EAAE,MAAQ,GAAA,CAAI,cAAc,EAAM,YAAY,EAAE,EAAE,MAAQ,EAAE,IAC/E,EAAK,YAAY,EAAE,EAAE,WAAa,IAAM,EAAM,YAAY,EAAE,EAAE,WAAa,EAChF,EACO,CACL,sBACA,+BAAgC,OAAO,YAAY,CAAgB,EACnE,OAAQ,CACV,CACF"}

package/dist/duplication.cjs

@@ -1,2 +1,2 @@
-"use strict";const e=require("./duplicateSelection.cjs"),t=new Set(`statement_block.block.compound_statement.body_statement.constructor_body.do_block.if_statement.for_statement.for_in_statement.enhanced_for_statement.for_range_loop.while_statement.do_statement.try_statement.try_with_resources_statement.with_statement.switch_statement.switch_expression.switch_case.switch_block_statement_group.switch_rule.case_clause.case_statement.match_statement.match_arm.except_clause.catch_clause.finally_clause.elif_clause.ensure.expression_statement.return_statement.return_expression.if_expression.for_expression.while_expression.loop_expression.match_expression.jsx_element.jsx_self_closing_element.if.unless.case.case_match.while.until.for.begin.when`.split(`.`)),n=new Set([`program`,`source_file`,`translation_unit`,`module`,`statement_block`,`block`,`compound_statement`,`body_statement`,`constructor_body`,`class_body`,`block_body`,`do_block`,`do`,`ensure`,`then`,`else`,`case_statement`,`switch_block_statement_group`,`switch_rule`,`expression_case`,`type_case`,`communication_case`,`default_case`]),r=new Set([`identifier`,`constant`,`instance_variable`,`class_variable`,`global_variable`]),i=new Set([`shorthand_property_identifier`,`shorthand_property_identifier_pattern`]),a=new Map([[`number`,`#num`],[`number_literal`,`#num`],[`integer`,`#num`],[`float`,`#num`],[`integer_literal`,`#num`],[`float_literal`,`#num`],[`int_literal`,`#num`],[`rune_literal`,`#char`],[`imaginary_literal`,`#num`],[`decimal_integer_literal`,`#num`],[`hex_integer_literal`,`#num`],[`octal_integer_literal`,`#num`],[`binary_integer_literal`,`#num`],[`decimal_floating_point_literal`,`#num`],[`hex_floating_point_literal`,`#num`],[`string_fragment`,`#str`],[`multiline_string_fragment`,`#str`],[`string_content`,`#str`],[`raw_string_content`,`#str`],[`heredoc_content`,`#str`],[`heredoc_beginning`,`#heredoc`],[`heredoc_end`,`#heredoc`],[`string`,`#str`],[`template_string`,`#str`],[`string_literal`,`#str`],[`interpreted_string_literal`,`#str`],[`raw_string_literal`,`#str`],[`raw_string`,`#str`],[`escape_sequence`,`#str`],[`char_literal`,`#char`],[`character_literal`,`#char`],[`character`,`#char`],[`regex_pattern`,`#regex`]]),o=new Set([`#num`,`#str`,`#char`,`#regex`]),s=new Set([`comment`,`line_comment`,`block_comment`]),c=new Set([`string_fragment`,`multiline_string_fragment`,`string_content`,`raw_string_content`,`escape_sequence`,`heredoc_content`]),l=new Set([`string_fragment`,`multiline_string_fragment`,`string_content`,`raw_string_content`,`escape_sequence`,`heredoc_content`,`string_start`,`string_end`]),u=new Map([[`call_expression`,`function`],[`method_invocation`,`name`],[`call`,`method`],[`attribute`,`attribute`],[`macro_invocation`,`macro`],[`field_access`,`field`],[`new_expression`,`constructor`],[`keyword_argument`,`name`],[`element_value_pair`,`key`],[`generic_function`,`function`],[`template_function`,`name`]]),d={minTokens:40,maxGapTokens:30,minSimilarityPercent:70};function f(e,t){return e*5>=t}function p(t,n,r){let i=r?.minTokens??d.minTokens,a=r?.maxGapTokens??d.maxGapTokens,o=r?.minSimilarityPercent??d.minSimilarityPercent,s=[],c=[],l=[];h(t,s,c,l);let u=S(s),f=[...w(s,u,c,i),...T(s,u,l,i)],p=Z(X(e.selectMaximalGroups(f,e=>e.length>=2)),a),m=O(s,u,c,i,o,p);return te([...p.filter(e=>e.length>0),...m],n,s)}function m(t,n){let r=n?.minTokens??d.minTokens,i=[],a=[],o=[];h(t,i,a,o);let s=S(i),c=w(i,s,a,r);for(let e of o){let t=e[0],n=e.at(-1);!t||!n||n.endTokenIndex-t.startTokenIndex<r||c.push(z(`s:${W(i,s,t.startTokenIndex,n.endTokenIndex)}`,t.startTokenIndex,n.endTokenIndex,t.node,n.node))}return e.dedupeByRegion(c).map(({fingerprint:e,tokenCount:t,startIndex:n,endIndex:r,startLine:i,endLine:a})=>({fingerprint:e,tokenCount:t,startIndex:n,endIndex:r,startLine:i,endLine:a}))}function h(e,r,i,a){function o(e){let c=r.length,l=e.childCount===0?void 0:g(e);if(e.childCount===0)_(e,r);else if(l!==void 0)r.push(v(l,y(e,l),e.startPosition.row,e.endPosition.row));else if(!s.has(e.type)){let t=[],r=e.isNamed&&n.has(e.type);for(let n of e.children){let e=o(n);r&&n.isNamed&&!s.has(n.type)&&t.push(e)}r&&t.length>0&&a.push(t)}let u={startTokenIndex:c,endTokenIndex:r.length,node:e};return e.isNamed&&t.has(e.type)&&i.push(u),u}o(e)}function g(e){let t=e.isNamed?a.get(e.type):void 0;if(t!==void 0)return e.namedChildren.every(e=>l.has(e.type))?t:void 0}function _(e,t){if(s.has(e.type))return;let n=e.startPosition.row,o=e.endPosition.row;if(e.isNamed&&i.has(e.type)){t.push(v(e.text,void 0,n,o,!0),v(`:`,void 0,n,o),{kind:`id`,text:e.text,textHash:0,textHash2:0,startRow:n,endRow:o});return}if(e.isNamed&&r.has(e.type)&&!C(e)){t.push({kind:`id`,text:e.text,textHash:0,textHash2:0,startRow:n,endRow:o});return}let c=e.isNamed?a.get(e.type):void 0;c===void 0?t.push(v(e.text,void 0,n,o,e.isNamed)):t.push(v(c,y(e,c),n,o))}function v(e,t,n,r,i=!1){let a={kind:`text`,text:e,textHash:q(e),textHash2:J(e),startRow:n,endRow:r};return t!==void 0&&o.has(e)&&(a.literalHash=q(t),a.literalHash2=J(t)),i&&(a.isName=!0),a}function y(e,t){if(t!==`#str`&&t!==`#char`||c.has(e.type))return e.text;let n=e.namedChildren.filter(e=>c.has(e.type));return n.length>0?n.map(e=>e.text).join(``):x(e.text)}const b=new Set([`"`,`'`,"`"]);function x(e){let t=e[0];return e.length>=2&&t!==void 0&&b.has(t)&&e.endsWith(t)?e.slice(1,-1):e}function S(e){let t=new Int32Array(e.length+1);for(let[n,r]of e.entries())t[n+1]=(t[n]??0)+(r.literalHash===void 0?0:1);return t}function C(e){let t=e.parent;if(!t)return!1;if(t.type===`method_reference`||t.type===`call`&&t.childForFieldName(`function`)?.id===e.id||e.type===`constant`&&t.type===`call`&&t.childForFieldName(`receiver`)?.id===e.id||t.type===`method_invocation`&&t.childForFieldName(`object`)?.id===e.id&&/^\p{Lu}/u.test(e.text))return!0;if((t.type===`scoped_identifier`||t.type===`qualified_identifier`)&&(t.childForFieldName(`name`)?.id===e.id||t.childForFieldName(`path`)?.id===e.id)){let e=t;for(;e.parent&&(e.parent.type===`scoped_identifier`||e.parent.type===`qualified_identifier`||e.parent.type===`generic_function`||e.parent.type===`template_function`);)e=e.parent;if(e.parent?.type===`call_expression`&&e.parent.childForFieldName(`function`)?.id===e.id)return!0}if(t.type===`literal_element`&&t.parent?.type===`keyed_element`&&t.parent.namedChild(0)?.id===t.id)return!0;let n=u.get(t.type);return n!==void 0&&t.childForFieldName(n)?.id===e.id}function w(e,t,n,r){let i=[];for(let a of n)a.endTokenIndex-a.startTokenIndex<r||i.push(z(`b:${W(e,t,a.startTokenIndex,a.endTokenIndex)}`,a.startTokenIndex,a.endTokenIndex,a.node,a.node));return i}function T(e,t,n,r){let i=[],a=new Map,o=n.map(t=>D(e,t,r));for(let[e,t]of o.entries())for(let[n,r]of t.windowKeysByStart.entries())for(let t of r){if(t===void 0)continue;let r=a.get(t);r?(r.count+=1,r.containerIndex!==e&&(r.containerIndex=-1),r.minStart=Math.min(r.minStart,n),r.maxStart=Math.max(r.maxStart,n)):a.set(t,{count:1,containerIndex:e,minStart:n,maxStart:n})}let s=(e,t)=>{if(e===void 0)return!1;let n=a.get(e);return n!==void 0&&n.count>=2&&(n.containerIndex===-1||n.maxStart-n.minStart>=t)},c=e=>{let t=o[e.containerIndex]?.statementHashes??[],n=t[e.start];for(let r=e.start+1;r<e.start+e.length;r+=1)if(t[r]!==n)return!0;return!1},l=[];for(let[e,t]of o.entries())for(let[n,r]of t.windowKeysByStart.entries())for(let[i,a]of r.entries()){if(!s(a,i)||!c({containerIndex:e,start:n,length:i}))continue;let r=t.windowKeysByStart[n]?.[i+1],o=t.windowKeysByStart[n-1]?.[i+1];s(r,i+1)||s(o,i+1)||l.push({containerIndex:e,start:n,length:i})}let u=new Set(l.map(E)),d=l;for(;d.length>0;){let r=[];for(let a of d){let o=n[a.containerIndex],s=o?.[a.start],c=o?.[a.start+a.length-1];if(!s||!c)continue;let l=`s:${W(e,t,s.startTokenIndex,c.endTokenIndex)}`;i.push(z(l,s.startTokenIndex,c.endTokenIndex,s.node,c.node)),r.push(a)}d=[];for(let e of r)for(let t of[e.start,e.start+1]){let n={containerIndex:e.containerIndex,start:t,length:e.length-1},r=o[e.containerIndex]?.windowKeysByStart[t]?.[n.length];u.has(E(n))||!s(r,n.length)||!c(n)||(u.add(E(n)),d.push(n))}}return i}function E(e){return`${e.containerIndex}:${e.start}:${e.length}`}function D(e,t,n){let r=t.map(t=>G(e,t.startTokenIndex,t.endTokenIndex)),i=[];for(let e=0;e<t.length;e+=1){let a=[],o=5381,s=0,c=Math.min(t.length,e+100);for(let i=e;i<c;i+=1){let c=t[i],l=r[i];if(!c||l===void 0)break;o=Y(o,l),s+=c.endTokenIndex-c.startTokenIndex;let u=i-e+1;a[u]=u>=2&&s>=n?Y(o,u):void 0}i.push(a)}return{windowKeysByStart:i,statementHashes:r}}function O(e,t,n,r,i,a){if(i>=100)return[];let o=k(n.filter(e=>{let n=e.endTokenIndex-e.startTokenIndex,i=(t[e.endTokenIndex]??0)-(t[e.startTokenIndex]??0);return n>=r&&!f(i,n)}).toSorted((e,t)=>e.startTokenIndex-t.startTokenIndex||t.endTokenIndex-e.endTokenIndex));if(o.length<2)return[];let s=o.map(e=>{let t=[];for(let[n,r]of a.entries())r.some(t=>t.startTokenIndex<e.endTokenIndex&&e.startTokenIndex<t.endTokenIndex)&&t.push(n);return t}),c=new Map,l=o.map(t=>P(e,t,c)),u=l.map(({sequence:e})=>F(e)),d=I(u),p=o.map((e,t)=>t),m=e=>{let t=e;for(;p[t]!==t;)t=p[t]??t;for(;p[e]!==t;){let n=p[e]??t;p[e]=t,e=n}return t};for(let[e,t]of d){let n=Math.floor(e/u.length),r=e%u.length,a=l[n],o=l[r],c=u[n],d=u[r];if(!(!a||!o||!c||!d)&&!((s[n]?.length??0)>0&&(s[r]?.length??0)>0)&&!(t*100<10*Math.min(c.size,d.size))&&!(ee(a,o)*100<=50*Math.max(a.contentTotal,o.contentTotal))&&L(a.sequence,o.sequence)*100>=i*Math.max(a.sequence.length,o.sequence.length)){let e=m(n),t=m(r);p[Math.max(e,t)]=Math.min(e,t)}}let h=new Map;for(let e of o.keys()){let t=m(e),n=h.get(t)??[];n.push(e),h.set(t,n)}let g=[];for(let e of h.values()){if(e.length<2)continue;let t=e.filter(e=>(s[e]?.length??0)===0),n=e.filter(e=>(s[e]?.length??0)>0);if(n.length===0){g.push(e.flatMap(e=>o[e]?[N(o[e])]:[]));continue}if(t.length===0)continue;let r=t=>e.some(e=>{let n=o[e];return n!==void 0&&t.startTokenIndex<n.endTokenIndex&&n.startTokenIndex<t.endTokenIndex}),i=[...new Set(n.flatMap(e=>s[e]??[]))].filter(e=>{let t=a[e];return t!==void 0&&t.length>0&&t.every(r)}).toSorted((e,t)=>e-t),[c,...l]=i;if(c!==void 0){let t=new Set,n=[];for(let r of e){let e=o[r];if(!e)continue;let c=[];for(let n of i)for(let r of a[n]??[])!t.has(r)&&r.startTokenIndex<e.endTokenIndex&&e.startTokenIndex<r.endTokenIndex&&(t.add(r),c.push({occurrence:r,groupIndex:n}));c.sort((e,t)=>e.occurrence.startTokenIndex-t.occurrence.startTokenIndex||e.occurrence.endTokenIndex-t.occurrence.endTokenIndex);let l=[],u=new Set;for(let{occurrence:e,groupIndex:t}of c)u.has(t)&&(n.push(j(l)),l=[],u.clear()),l.push(e),u.add(t);l.length>0&&n.push(j(l)),c.length===0&&(s[r]?.length??0)===0&&n.push(N(e))}n.sort((e,t)=>e.startTokenIndex-t.startTokenIndex||e.endTokenIndex-t.endTokenIndex),a[c]=n;for(let e of l)a[e]=[]}else t.length>=2&&g.push(t.flatMap(e=>o[e]?[N(o[e])]:[]))}return g.sort(Q),g}function k(e){let t=[],n=[];for(let r of e){for(;n.length>0&&n.at(-1).range.endTokenIndex<=r.startTokenIndex;)n.pop();let e=n.at(-1);if(e&&e.range.startTokenIndex===r.startTokenIndex&&e.range.endTokenIndex===r.endTokenIndex)continue;let i={range:r,children:[]};e?e.children.push(i):t.push(i),n.push(i)}let r=[],i=e=>{if(A(e))for(let t of e.children)i(t);else r.push(e.range)};for(let e of t)i(e);return r}function A(e){let[t]=e.children;return e.children.length>=2||t!==void 0&&A(t)}function j(e){let t=e[0];return!t||e.length===1?t??M():{segments:e.flatMap(e=>e.segments).toSorted((e,t)=>e.startTokenIndex-t.startTokenIndex),tokenCount:e.reduce((e,t)=>e+t.tokenCount,0),startTokenIndex:Math.min(...e.map(e=>e.startTokenIndex)),endTokenIndex:Math.max(...e.map(e=>e.endTokenIndex)),startIndex:Math.min(...e.map(e=>e.startIndex)),endIndex:Math.max(...e.map(e=>e.endIndex)),startLine:Math.min(...e.map(e=>e.startLine)),endLine:Math.max(...e.map(e=>e.endLine))}}function M(){return{segments:[],tokenCount:0,startTokenIndex:0,endTokenIndex:0,startIndex:0,endIndex:0,startLine:0,endLine:0}}function N(e){return{segments:[{startTokenIndex:e.startTokenIndex,endTokenIndex:e.endTokenIndex}],tokenCount:e.endTokenIndex-e.startTokenIndex,startTokenIndex:e.startTokenIndex,endTokenIndex:e.endTokenIndex,startIndex:e.node.startIndex,endIndex:e.node.endIndex,startLine:e.node.startPosition.row+1,endLine:e.node.endPosition.row+1}}function P(e,t,n){let r=new Int32Array(t.endTokenIndex-t.startTokenIndex),i=new Map,a=new Map,o=0;for(let s=t.startTokenIndex;s<t.endTokenIndex;s+=1){let c=e[s];if(!c)continue;let l;if(c.kind===`id`){let e=i.get(c.text);e===void 0&&(e=i.size,i.set(c.text,e)),l=-(e+1)}else{let e=`${c.textHash}:${c.textHash2}:${c.literalHash??0}:${c.literalHash2??0}`,t=n.get(e);t===void 0&&(t=n.size,n.set(e,t)),l=t,(c.isName===!0||c.literalHash!==void 0)&&(a.set(l,(a.get(l)??0)+1),o+=1)}r[s-t.startTokenIndex]=l}return{sequence:r,contentCountBySymbol:a,contentTotal:o}}function ee(e,t){let[n,r]=e.contentCountBySymbol.size<=t.contentCountBySymbol.size?[e,t]:[t,e],i=0;for(let[e,t]of n.contentCountBySymbol)i+=Math.min(t,r.contentCountBySymbol.get(e)??0);return i}function F(e){let t=new Set;for(let n=0;n+5<=e.length;n+=1){let r=5381;for(let t=0;t<5;t+=1)r=Math.imul(r,31)+(e[n+t]??0)|0;t.add(r)}return t}function I(e){let t=new Map;for(let[n,r]of e.entries())for(let e of r){let r=t.get(e);r||(r=[],t.set(e,r)),r.push(n)}let n=new Map;for(let r of t.values())for(let t=0;t<r.length;t+=1){let i=r[t]??0;for(let a=t+1;a<r.length;a+=1){let t=i*e.length+(r[a]??0);n.set(t,(n.get(t)??0)+1)}}return n}function L(e,t){let n=e.length+31>>>5,r=new Map;for(let[t,i]of e.entries()){let e=r.get(i);e||(e=new Uint32Array(n),r.set(i,e));let a=t>>>5;e[a]=(e[a]??0)|1<<(t&31)}let i=new Uint32Array(n);for(let e of t){let t=r.get(e),a=1,o=0;for(let e=0;e<n;e+=1){let n=i[e]??0,r=((t?.[e]??0)|n)>>>0,s=(n<<1|a)>>>0;a=n>>>31;let c=r-s-o;o=+(c<0),i[e]=r&~c}}let a=0;for(let e of i)a+=R(e);return a}function R(e){let t=e-(e>>>1&1431655765);return t=(t&858993459)+(t>>>2&858993459),Math.imul(t+(t>>>4)&252645135,16843009)>>>24&255}function z(e,t,n,r,i){return{fingerprint:e,tokenCount:n-t,startTokenIndex:t,endTokenIndex:n,startIndex:r.startIndex,endIndex:i.endIndex,startLine:r.startPosition.row+1,endLine:i.endPosition.row+1}}const B=[],V=[];function H(e){let t=B[e];return t===void 0&&(t=q(`$${e}`),B[e]=t),t}function U(e){let t=V[e];return t===void 0&&(t=J(`$${e}`),V[e]=t),t}function W(e,t,n,r){let[i,a]=K(e,n,r,f((t[r]??0)-(t[n]??0),r-n));return`${i}:${a}:${r-n}`}function G(e,t,n){let[r,i]=K(e,t,n,!1);return r^Math.imul(i,31)}function K(e,t,n,r){let i=new Map,a=5381,o=52711;for(let s=t;s<n;s+=1){let t=e[s];if(!t)continue;let n,c;if(t.kind===`id`){let e=i.get(t.text);e===void 0&&(e=i.size,i.set(t.text,e)),n=H(e),c=U(e)}else n=t.textHash,c=t.textHash2;a=Math.imul(a,31)+n|0,o=Math.imul(o,37)^c,r&&t.literalHash!==void 0&&t.literalHash2!==void 0&&(a=Math.imul(a,31)+t.literalHash|0,o=Math.imul(o,37)^t.literalHash2)}return[a,o]}function q(e){let t=5381;for(let n=0;n<e.length;n+=1)t=Math.imul(t,33)^e.charCodeAt(n);return t}function J(e){let t=-2128831035;for(let n=0;n<e.length;n+=1)t=Math.imul(t^e.charCodeAt(n),16777619);return t}function Y(e,t){return Math.imul(e,31)+t}function X(e){let t=[];for(let n of e.values()){let e=n.map(e=>({segments:[{startTokenIndex:e.startTokenIndex,endTokenIndex:e.endTokenIndex}],tokenCount:e.tokenCount,startTokenIndex:e.startTokenIndex,endTokenIndex:e.endTokenIndex,startIndex:e.startIndex,endIndex:e.endIndex,startLine:e.startLine,endLine:e.endLine}));e.sort((e,t)=>e.startTokenIndex-t.startTokenIndex||e.endTokenIndex-t.endTokenIndex),t.push(e)}return t}function Z(e,t){if(t<=0||e.length<2)return e;e.sort(Q);for(let n=!0;n;){n=!1;for(let r=0;r<e.length&&!n;r+=1)for(let i=r+1;i<e.length;i+=1){let a=e[r],o=e[i];if(!a||!o)continue;let s=$(a,o,t)??$(o,a,t);if(s){e[r]=s,e.splice(i,1),e.sort(Q),n=!0;break}}}return e}function Q(e,t){let n=e[0],r=t[0];return(n?.startTokenIndex??0)-(r?.startTokenIndex??0)||(n?.endTokenIndex??0)-(r?.endTokenIndex??0)}function $(e,t,n){if(e.length===t.length){for(let[r,i]of e.entries()){let a=t[r];if(!a)return;let o=a.startTokenIndex-i.endTokenIndex;if(o<0||o>n)return;let s=e[r+1];if(s&&a.endTokenIndex>s.startTokenIndex)return}return e.map((e,n)=>{let r=t[n];return r?{segments:[...e.segments,...r.segments],tokenCount:e.tokenCount+r.tokenCount,startTokenIndex:e.startTokenIndex,endTokenIndex:r.endTokenIndex,startIndex:e.startIndex,endIndex:r.endIndex,startLine:e.startLine,endLine:r.endLine}:e})}}function te(e,t,n){let r=0,i=0,a=[],o=new Set;for(let s of e){let e=s.map(e=>e.segments.length);r+=e.reduce((e,t)=>e+t,0)-Math.max(...e,0);for(let e of s){i=Math.max(i,e.tokenCount);for(let r of e.segments)for(let e=r.startTokenIndex;e<r.endTokenIndex;e+=1){let r=n[e];for(let e=r?.startRow??0;e<=(r?.endRow??-1);e+=1)t.has(e+1)&&o.add(e+1)}}a.push(s.map(({startLine:e,endLine:t})=>({startLine:e,endLine:t})).toSorted((e,t)=>e.startLine-t.startLine))}return a.sort((e,t)=>(e[0]?.startLine??0)-(t[0]?.startLine??0)),{duplicateBlockCount:r,duplicateBlockGroupCount:e.length,duplicateBlockGroups:a,duplicateLineCount:o.size,duplicationRatio:t.size===0?0:o.size/t.size,maxDuplicateBlockSize:i}}exports.collectCrossFileDuplicateCandidates=m,exports.defaultDuplicationOptions=d,exports.measureDuplication=p;
+"use strict";const e=require("./duplicateSelection.cjs"),t=new Set(`statement_block.block.compound_statement.body_statement.constructor_body.do_block.if_statement.for_statement.for_in_statement.enhanced_for_statement.for_range_loop.while_statement.do_statement.try_statement.try_with_resources_statement.with_statement.switch_statement.switch_expression.switch_case.switch_block_statement_group.switch_rule.case_clause.case_statement.match_statement.match_arm.except_clause.catch_clause.finally_clause.elif_clause.ensure.expression_statement.return_statement.return_expression.if_expression.for_expression.while_expression.loop_expression.match_expression.jsx_element.jsx_self_closing_element.if.unless.case.case_match.while.until.for.begin.when`.split(`.`)),n=new Set([`program`,`source_file`,`translation_unit`,`module`,`statement_block`,`block`,`compound_statement`,`body_statement`,`constructor_body`,`class_body`,`block_body`,`do_block`,`do`,`ensure`,`then`,`else`,`case_statement`,`switch_block_statement_group`,`switch_rule`,`expression_case`,`type_case`,`communication_case`,`default_case`]),r=new Set([`identifier`,`constant`,`instance_variable`,`class_variable`,`global_variable`]),i=new Set([`shorthand_property_identifier`,`shorthand_property_identifier_pattern`]),a=new Map([[`number`,`#num`],[`number_literal`,`#num`],[`integer`,`#num`],[`float`,`#num`],[`integer_literal`,`#num`],[`float_literal`,`#num`],[`int_literal`,`#num`],[`rune_literal`,`#char`],[`imaginary_literal`,`#num`],[`decimal_integer_literal`,`#num`],[`hex_integer_literal`,`#num`],[`octal_integer_literal`,`#num`],[`binary_integer_literal`,`#num`],[`decimal_floating_point_literal`,`#num`],[`hex_floating_point_literal`,`#num`],[`string_fragment`,`#str`],[`multiline_string_fragment`,`#str`],[`string_content`,`#str`],[`raw_string_content`,`#str`],[`heredoc_content`,`#str`],[`heredoc_beginning`,`#heredoc`],[`heredoc_end`,`#heredoc`],[`string`,`#str`],[`template_string`,`#str`],[`string_literal`,`#str`],[`interpreted_string_literal`,`#str`],[`raw_string_literal`,`#str`],[`raw_string`,`#str`],[`escape_sequence`,`#str`],[`char_literal`,`#char`],[`character_literal`,`#char`],[`character`,`#char`],[`regex_pattern`,`#regex`]]),o=new Set([`#num`,`#str`,`#char`,`#regex`]),s=new Set([`comment`,`line_comment`,`block_comment`]),c=new Set([`string_fragment`,`multiline_string_fragment`,`string_content`,`raw_string_content`,`escape_sequence`,`heredoc_content`]),l=new Set([`string_fragment`,`multiline_string_fragment`,`string_content`,`raw_string_content`,`escape_sequence`,`heredoc_content`,`string_start`,`string_end`]),u=new Map([[`call_expression`,`function`],[`method_invocation`,`name`],[`call`,`method`],[`attribute`,`attribute`],[`macro_invocation`,`macro`],[`field_access`,`field`],[`new_expression`,`constructor`],[`keyword_argument`,`name`],[`element_value_pair`,`key`],[`generic_function`,`function`],[`template_function`,`name`]]),d={minTokens:40,maxGapTokens:30,minSimilarityPercent:70};function f(e,t){return e*5>=t}function p(t,n,r){let i=r?.minTokens??d.minTokens,a=r?.maxGapTokens??d.maxGapTokens,o=r?.minSimilarityPercent??d.minSimilarityPercent,s=[],c=[],l=[];h(t,s,c,l);let u=S(s),f=[...w(s,u,c,i),...T(s,u,l,i)],p=X(Y(e.selectMaximalGroups(f,e=>e.length>=2)),a),m=k(s,u,c,i,o,p);return re([...p.filter(e=>e.length>0),...m],n,s)}function m(t,n){let r=n?.minTokens??d.minTokens,i=[],a=[],o=[];h(t,i,a,o);let s=S(i),c=w(i,s,a,r);for(let e of o){let t=e[0],n=e.at(-1);!t||!n||n.endTokenIndex-t.startTokenIndex<r||c.push(R(`s:${U(i,s,t.startTokenIndex,n.endTokenIndex)}`,t.startTokenIndex,n.endTokenIndex,t,n))}return{candidates:e.dedupeByRegion(c),tokens:i,containerStatements:o}}function h(e,r,i,a){function o(e){let c=r.length,l=e.childCount===0?void 0:g(e);if(e.childCount===0)_(e,r);else if(l!==void 0)r.push(v(l,y(e,l),e.startPosition.row,e.endPosition.row));else if(!s.has(e.type)){let t=[],r=e.isNamed&&n.has(e.type);for(let n of e.children){let e=o(n);r&&n.isNamed&&!s.has(n.type)&&t.push(e)}r&&t.length>0&&a.push(t)}let u={startTokenIndex:c,endTokenIndex:r.length,startIndex:e.startIndex,endIndex:e.endIndex,startLine:e.startPosition.row+1,endLine:e.endPosition.row+1};return e.isNamed&&t.has(e.type)&&i.push(u),u}o(e)}function g(e){let t=e.isNamed?a.get(e.type):void 0;if(t!==void 0)return e.namedChildren.every(e=>l.has(e.type))?t:void 0}function _(e,t){if(s.has(e.type))return;let n=e.startPosition.row,o=e.endPosition.row;if(e.isNamed&&i.has(e.type)){t.push(v(e.text,void 0,n,o,!0),v(`:`,void 0,n,o),{kind:`id`,text:e.text,textHash:0,textHash2:0,startRow:n,endRow:o});return}if(e.isNamed&&r.has(e.type)&&!C(e)){t.push({kind:`id`,text:e.text,textHash:0,textHash2:0,startRow:n,endRow:o});return}let c=e.isNamed?a.get(e.type):void 0;c===void 0?t.push(v(e.text,void 0,n,o,e.isNamed)):t.push(v(c,y(e,c),n,o))}function v(e,t,n,r,i=!1){let a={kind:`text`,text:e,textHash:K(e),textHash2:q(e),startRow:n,endRow:r};return t!==void 0&&o.has(e)&&(a.literalHash=K(t),a.literalHash2=q(t)),i&&(a.isName=!0),a}function y(e,t){if(t!==`#str`&&t!==`#char`||c.has(e.type))return e.text;let n=e.namedChildren.filter(e=>c.has(e.type));return n.length>0?n.map(e=>e.text).join(``):x(e.text)}const b=new Set([`"`,`'`,"`"]);function x(e){let t=e[0];return e.length>=2&&t!==void 0&&b.has(t)&&e.endsWith(t)?e.slice(1,-1):e}function S(e){let t=new Int32Array(e.length+1);for(let[n,r]of e.entries())t[n+1]=(t[n]??0)+(r.literalHash===void 0?0:1);return t}function C(e){let t=e.parent;if(!t)return!1;if(t.type===`method_reference`||t.type===`call`&&t.childForFieldName(`function`)?.id===e.id||e.type===`constant`&&t.type===`call`&&t.childForFieldName(`receiver`)?.id===e.id||t.type===`method_invocation`&&t.childForFieldName(`object`)?.id===e.id&&/^\p{Lu}/u.test(e.text))return!0;if((t.type===`scoped_identifier`||t.type===`qualified_identifier`)&&(t.childForFieldName(`name`)?.id===e.id||t.childForFieldName(`path`)?.id===e.id)){let e=t;for(;e.parent&&(e.parent.type===`scoped_identifier`||e.parent.type===`qualified_identifier`||e.parent.type===`generic_function`||e.parent.type===`template_function`);)e=e.parent;if(e.parent?.type===`call_expression`&&e.parent.childForFieldName(`function`)?.id===e.id)return!0}if(t.type===`literal_element`&&t.parent?.type===`keyed_element`&&t.parent.namedChild(0)?.id===t.id)return!0;let n=u.get(t.type);return n!==void 0&&t.childForFieldName(n)?.id===e.id}function w(e,t,n,r){let i=[];for(let a of n)a.endTokenIndex-a.startTokenIndex<r||i.push(R(`b:${U(e,t,a.startTokenIndex,a.endTokenIndex)}`,a.startTokenIndex,a.endTokenIndex,a,a));return i}function T(e,t,n,r){return E([{tokens:e,literalCountPrefix:t,containers:n}],r,!1).map(({candidate:e})=>e)}function E(e,t,n){let r=[],i=[],a=[];for(let[t,n]of e.entries())for(let e of n.containers)i.push(t),a.push(e);let o=t=>e[i[t]??0],s=new Map,c=a.map((e,n)=>O(o(n)?.tokens??[],e,t));for(let[e,t]of c.entries()){let n=i[e]??0;for(let[r,i]of t.windowKeysByStart.entries())for(let t of i){if(t===void 0)continue;let i=s.get(t);i?(i.count+=1,i.containerIndex!==e&&(i.containerIndex=-1),i.contextIndex!==n&&(i.contextIndex=-1),i.minStart=Math.min(i.minStart,r),i.maxStart=Math.max(i.maxStart,r)):s.set(t,{count:1,containerIndex:e,contextIndex:n,minStart:r,maxStart:r})}}let l=(e,t)=>{if(e===void 0)return!1;let r=s.get(e);return r===void 0||r.count<2?!1:n?r.contextIndex===-1:r.containerIndex===-1||r.maxStart-r.minStart>=t},u=e=>{let t=c[e.containerIndex]?.statementHashes??[],n=t[e.start];for(let r=e.start+1;r<e.start+e.length;r+=1)if(t[r]!==n)return!0;return!1},d=[];for(let[e,t]of c.entries())for(let[n,r]of t.windowKeysByStart.entries())for(let[i,a]of r.entries()){if(!l(a,i)||!u({containerIndex:e,start:n,length:i}))continue;let r=t.windowKeysByStart[n]?.[i+1],o=t.windowKeysByStart[n-1]?.[i+1];l(r,i+1)||l(o,i+1)||d.push({containerIndex:e,start:n,length:i})}let f=new Set(d.map(D)),p=d;for(;p.length>0;){let e=[];for(let t of p){let n=a[t.containerIndex],s=n?.[t.start],c=n?.[t.start+t.length-1],l=o(t.containerIndex);if(!s||!c||!l)continue;let u=`s:${U(l.tokens,l.literalCountPrefix,s.startTokenIndex,c.endTokenIndex)}`;r.push({candidate:R(u,s.startTokenIndex,c.endTokenIndex,s,c),contextIndex:i[t.containerIndex]??0}),e.push(t)}p=[];for(let t of e)for(let e of[t.start,t.start+1]){let n={containerIndex:t.containerIndex,start:e,length:t.length-1},r=c[t.containerIndex]?.windowKeysByStart[e]?.[n.length];f.has(D(n))||!l(r,n.length)||!u(n)||(f.add(D(n)),p.push(n))}}return r}function D(e){return`${e.containerIndex}:${e.start}:${e.length}`}function O(e,t,n){let r=t.map(t=>W(e,t.startTokenIndex,t.endTokenIndex)),i=[];for(let e=0;e<t.length;e+=1){let a=[],o=5381,s=0,c=Math.min(t.length,e+100);for(let i=e;i<c;i+=1){let c=t[i],l=r[i];if(!c||l===void 0)break;o=J(o,l),s+=c.endTokenIndex-c.startTokenIndex;let u=i-e+1;a[u]=u>=2&&s>=n?J(o,u):void 0}i.push(a)}return{windowKeysByStart:i,statementHashes:r}}function k(e,t,n,r,i,a){if(i>=100)return[];let o=A(n.filter(e=>{let n=e.endTokenIndex-e.startTokenIndex,i=(t[e.endTokenIndex]??0)-(t[e.startTokenIndex]??0);return n>=r&&!f(i,n)}).toSorted((e,t)=>e.startTokenIndex-t.startTokenIndex||t.endTokenIndex-e.endTokenIndex));if(o.length<2)return[];let s=o.map(e=>{let t=[];for(let[n,r]of a.entries())r.some(t=>t.startTokenIndex<e.endTokenIndex&&e.startTokenIndex<t.endTokenIndex)&&t.push(n);return t}),c=new Map,l=o.map(t=>F(e,t,c)),u=l.map(({sequence:e})=>ee(e)),d=te(u),p=o.map((e,t)=>t),m=e=>{let t=e;for(;p[t]!==t;)t=p[t]??t;for(;p[e]!==t;){let n=p[e]??t;p[e]=t,e=n}return t};for(let[e,t]of d){let n=Math.floor(e/u.length),r=e%u.length,a=l[n],o=l[r],c=u[n],d=u[r];if(!(!a||!o||!c||!d)&&!((s[n]?.length??0)>0&&(s[r]?.length??0)>0)&&!(t*100<10*Math.min(c.size,d.size))&&!(I(a,o)*100<=50*Math.max(a.contentTotal,o.contentTotal))&&ne(a.sequence,o.sequence)*100>=i*Math.max(a.sequence.length,o.sequence.length)){let e=m(n),t=m(r);p[Math.max(e,t)]=Math.min(e,t)}}let h=new Map;for(let e of o.keys()){let t=m(e),n=h.get(t)??[];n.push(e),h.set(t,n)}let g=[];for(let e of h.values()){if(e.length<2)continue;let t=e.filter(e=>(s[e]?.length??0)===0),n=e.filter(e=>(s[e]?.length??0)>0);if(n.length===0){g.push(e.flatMap(e=>o[e]?[P(o[e])]:[]));continue}if(t.length===0)continue;let r=t=>e.some(e=>{let n=o[e];return n!==void 0&&t.startTokenIndex<n.endTokenIndex&&n.startTokenIndex<t.endTokenIndex}),i=[...new Set(n.flatMap(e=>s[e]??[]))].filter(e=>{let t=a[e];return t!==void 0&&t.length>0&&t.every(r)}).toSorted((e,t)=>e-t),[c,...l]=i;if(c!==void 0){let t=new Set,n=[];for(let r of e){let e=o[r];if(!e)continue;let c=[];for(let n of i)for(let r of a[n]??[])!t.has(r)&&r.startTokenIndex<e.endTokenIndex&&e.startTokenIndex<r.endTokenIndex&&(t.add(r),c.push({occurrence:r,groupIndex:n}));c.sort((e,t)=>e.occurrence.startTokenIndex-t.occurrence.startTokenIndex||e.occurrence.endTokenIndex-t.occurrence.endTokenIndex);let l=[],u=new Set;for(let{occurrence:e,groupIndex:t}of c)u.has(t)&&(n.push(M(l)),l=[],u.clear()),l.push(e),u.add(t);l.length>0&&n.push(M(l)),c.length===0&&(s[r]?.length??0)===0&&n.push(P(e))}n.sort((e,t)=>e.startTokenIndex-t.startTokenIndex||e.endTokenIndex-t.endTokenIndex);for(let e of n)e.sharedWithMergedGroup=void 0;a[c]=n;for(let e of l)a[e]=[]}else t.length>=2&&g.push(t.flatMap(e=>o[e]?[P(o[e])]:[]))}return g.sort(Z),g}function A(e){let t=[],n=[];for(let r of e){for(;n.length>0&&n.at(-1).range.endTokenIndex<=r.startTokenIndex;)n.pop();let e=n.at(-1);if(e&&e.range.startTokenIndex===r.startTokenIndex&&e.range.endTokenIndex===r.endTokenIndex)continue;let i={range:r,children:[]};e?e.children.push(i):t.push(i),n.push(i)}let r=[],i=e=>{if(j(e))for(let t of e.children)i(t);else r.push(e.range)};for(let e of t)i(e);return r}function j(e){let[t]=e.children;return e.children.length>=2||t!==void 0&&j(t)}function M(e){let t=e[0];if(!t||e.length===1)return t??N();let n=[];for(let t of e.flatMap(e=>e.segments).toSorted((e,t)=>e.startTokenIndex-t.startTokenIndex||e.endTokenIndex-t.endTokenIndex)){let e=n.at(-1);e&&t.startTokenIndex<e.endTokenIndex?e.endTokenIndex=Math.max(e.endTokenIndex,t.endTokenIndex):n.push({...t})}return{segments:n,tokenCount:n.reduce((e,t)=>e+t.endTokenIndex-t.startTokenIndex,0),startTokenIndex:Math.min(...e.map(e=>e.startTokenIndex)),endTokenIndex:Math.max(...e.map(e=>e.endTokenIndex)),startIndex:Math.min(...e.map(e=>e.startIndex)),endIndex:Math.max(...e.map(e=>e.endIndex)),startLine:Math.min(...e.map(e=>e.startLine)),endLine:Math.max(...e.map(e=>e.endLine))}}function N(){return{segments:[],tokenCount:0,startTokenIndex:0,endTokenIndex:0,startIndex:0,endIndex:0,startLine:0,endLine:0}}function P(e){return{segments:[{startTokenIndex:e.startTokenIndex,endTokenIndex:e.endTokenIndex}],tokenCount:e.endTokenIndex-e.startTokenIndex,startTokenIndex:e.startTokenIndex,endTokenIndex:e.endTokenIndex,startIndex:e.startIndex,endIndex:e.endIndex,startLine:e.startLine,endLine:e.endLine}}function F(e,t,n){let r=new Int32Array(t.endTokenIndex-t.startTokenIndex),i=new Map,a=new Map,o=0;for(let s=t.startTokenIndex;s<t.endTokenIndex;s+=1){let c=e[s];if(!c)continue;let l;if(c.kind===`id`){let e=i.get(c.text);e===void 0&&(e=i.size,i.set(c.text,e)),l=-(e+1)}else{let e=`${c.textHash}:${c.textHash2}:${c.literalHash??0}:${c.literalHash2??0}`,t=n.get(e);t===void 0&&(t=n.size,n.set(e,t)),l=t,(c.isName===!0||c.literalHash!==void 0)&&(a.set(l,(a.get(l)??0)+1),o+=1)}r[s-t.startTokenIndex]=l}return{sequence:r,contentCountBySymbol:a,contentTotal:o}}function I(e,t){let[n,r]=e.contentCountBySymbol.size<=t.contentCountBySymbol.size?[e,t]:[t,e],i=0;for(let[e,t]of n.contentCountBySymbol)i+=Math.min(t,r.contentCountBySymbol.get(e)??0);return i}function ee(e){let t=new Set;for(let n=0;n+5<=e.length;n+=1){let r=5381;for(let t=0;t<5;t+=1)r=Math.imul(r,31)+(e[n+t]??0)|0;t.add(r)}return t}function te(e){let t=new Map;for(let[n,r]of e.entries())for(let e of r){let r=t.get(e);r||(r=[],t.set(e,r)),r.push(n)}let n=new Map;for(let r of t.values())for(let t=0;t<r.length;t+=1){let i=r[t]??0;for(let a=t+1;a<r.length;a+=1){let t=i*e.length+(r[a]??0);n.set(t,(n.get(t)??0)+1)}}return n}function ne(e,t){let n=e.length+31>>>5,r=new Map;for(let[t,i]of e.entries()){let e=r.get(i);e||(e=new Uint32Array(n),r.set(i,e));let a=t>>>5;e[a]=(e[a]??0)|1<<(t&31)}let i=new Uint32Array(n);for(let e of t){let t=r.get(e),a=1,o=0;for(let e=0;e<n;e+=1){let n=i[e]??0,r=((t?.[e]??0)|n)>>>0,s=(n<<1|a)>>>0;a=n>>>31;let c=r-s-o;o=+(c<0),i[e]=r&~c}}let a=0;for(let e of i)a+=L(e);return a}function L(e){let t=e-(e>>>1&1431655765);return t=(t&858993459)+(t>>>2&858993459),Math.imul(t+(t>>>4)&252645135,16843009)>>>24&255}function R(e,t,n,r,i){return{fingerprint:e,tokenCount:n-t,startTokenIndex:t,endTokenIndex:n,startIndex:r.startIndex,endIndex:i.endIndex,startLine:r.startLine,endLine:i.endLine}}const z=[],B=[];function V(e){let t=z[e];return t===void 0&&(t=K(`$${e}`),z[e]=t),t}function H(e){let t=B[e];return t===void 0&&(t=q(`$${e}`),B[e]=t),t}function U(e,t,n,r){let[i,a]=G(e,n,r,f((t[r]??0)-(t[n]??0),r-n));return`${i}:${a}:${r-n}`}function W(e,t,n){let[r,i]=G(e,t,n,!1);return r^Math.imul(i,31)}function G(e,t,n,r){let i=new Map,a=5381,o=52711;for(let s=t;s<n;s+=1){let t=e[s];if(!t)continue;let n,c;if(t.kind===`id`){let e=i.get(t.text);e===void 0&&(e=i.size,i.set(t.text,e)),n=V(e),c=H(e)}else n=t.textHash,c=t.textHash2;a=Math.imul(a,31)+n|0,o=Math.imul(o,37)^c,r&&t.literalHash!==void 0&&t.literalHash2!==void 0&&(a=Math.imul(a,31)+t.literalHash|0,o=Math.imul(o,37)^t.literalHash2)}return[a,o]}function K(e){let t=5381;for(let n=0;n<e.length;n+=1)t=Math.imul(t,33)^e.charCodeAt(n);return t}function q(e){let t=-2128831035;for(let n=0;n<e.length;n+=1)t=Math.imul(t^e.charCodeAt(n),16777619);return t}function J(e,t){return Math.imul(e,31)+t}function Y(e){let t=[];for(let n of e.values()){let e=n.map(e=>({segments:[{startTokenIndex:e.startTokenIndex,endTokenIndex:e.endTokenIndex}],tokenCount:e.tokenCount,startTokenIndex:e.startTokenIndex,endTokenIndex:e.endTokenIndex,startIndex:e.startIndex,endIndex:e.endIndex,startLine:e.startLine,endLine:e.endLine}));e.sort((e,t)=>e.startTokenIndex-t.startTokenIndex||e.endTokenIndex-t.endTokenIndex),t.push(e)}return t}function X(e,t){if(t<=0||e.length<2)return e;e.sort(Z);for(let n=!0;n;){n=!1;for(let r=0;r<e.length&&!n;r+=1)for(let i=r+1;i<e.length;i+=1){let a=e[r],o=e[i];if(!a||!o)continue;let s=Q(a,o,t),c=s??Q(o,a,t);if(!c)continue;let l=s?c.firstConsumed:c.secondConsumed,u=s?c.secondConsumed:c.firstConsumed;l&&u?(e[r]=c.merged,e.splice(i,1)):u?e[i]=c.merged:e[r]=c.merged;for(let e of c.pairedRetained)e.sharedWithMergedGroup=!0;e.sort(Z),n=!0;break}}return e}function Z(e,t){let n=e[0],r=t[0];return(n?.startTokenIndex??0)-(r?.startTokenIndex??0)||(n?.endTokenIndex??0)-(r?.endTokenIndex??0)}function Q(e,t,n){let r=e.filter(e=>!e.sharedWithMergedGroup),i=t.filter(e=>!e.sharedWithMergedGroup),a=[],o=0,s=-1;for(let e of i){for(;o<r.length;){let t=r[o];if(t&&t.endTokenIndex+n<e.startTokenIndex)o+=1;else break}let t=r[o];t&&t.endTokenIndex<=e.startTokenIndex&&t.startTokenIndex>=s&&(a.push([t,e]),s=e.endTokenIndex,o+=1)}let c=a.length===e.length,l=a.length===t.length;if(!(a.length<2||!c&&!l))return{merged:a.map(([e,t])=>({...e,sharedWithMergedGroup:void 0,segments:[...e.segments,...t.segments],tokenCount:e.tokenCount+t.tokenCount,endTokenIndex:t.endTokenIndex,endIndex:t.endIndex,endLine:t.endLine})),firstConsumed:c,secondConsumed:l,pairedRetained:c===l?[]:a.map(([e,t])=>c?t:e)}}function $(e){let t=0,n=0,r=!1;for(let i of e){if(i.sharedWithMergedGroup){r=!0;continue}t+=i.segments.length,n=Math.max(n,i.segments.length)}return r?t:t-n}function re(e,t,n){let r=0,i=0,a=[],o=new Set;for(let s of e){r+=$(s);for(let e of s){i=Math.max(i,e.tokenCount);for(let r of e.segments)for(let e=r.startTokenIndex;e<r.endTokenIndex;e+=1){let r=n[e];for(let e=r?.startRow??0;e<=(r?.endRow??-1);e+=1)t.has(e+1)&&o.add(e+1)}}a.push(s.map(({startLine:e,endLine:t})=>({startLine:e,endLine:t})).toSorted((e,t)=>e.startLine-t.startLine))}return a.sort((e,t)=>(e[0]?.startLine??0)-(t[0]?.startLine??0)),{duplicateBlockCount:r,duplicateBlockGroupCount:e.length,duplicateBlockGroups:a,duplicateLineCount:o.size,duplicationRatio:t.size===0?0:o.size/t.size,maxDuplicateBlockSize:i}}exports.buildLiteralCountPrefix=S,exports.collectCrossFileDuplicateCandidates=m,exports.collectSequenceWindowCandidates=E,exports.countRedundantFragments=$,exports.defaultDuplicationOptions=d,exports.measureDuplication=p,exports.mergeAdjacentGroups=X;
 //# sourceMappingURL=duplication.cjs.map