code-gauge 4.7.0 → 4.8.0

package/dist/regressionGate.js.map

@@ -1 +1 @@
-{"version":3,"file":"regressionGate.js","names":[],"sources":["../src/regressionGate.ts"],"sourcesContent":["import { lcsLength } from './duplication.js';\nimport type { CodeMetrics, FunctionMetrics } from './types.js';\n\n/**\n * Absolute limits applied only to functions with no base counterpart (SonarQube-style \"Clean as\n * You Code\"): new code is the one place absolute thresholds are required, since there is nothing\n * to ratchet against.\n */\nexport interface NewFunctionThresholds {\n  maxCognitiveComplexity: number;\n  maxNcss: number;\n  maxNestingDepth: number;\n}\n\n/**\n * Allowances added on top of each base value before a ratchet fires, so legitimate refactorings\n * that transiently worsen one number (e.g. an extraction adding a few NCSS lines) don't trap the\n * agent in a loop.\n */\nexport interface GateTolerances {\n  cognitiveComplexity: number;\n  ncss: number;\n  nestingDepth: number;\n  depDegree: number;\n  halsteadVolume: number;\n  /** File-total NCSS growth allowed when base functions disappeared (the anti-gaming backstop). */\n  fileNcss: number;\n  /** Duplicated-line growth allowed per changed file. */\n  duplicateLines: number;\n}\n\nexport interface GateOptions {\n  newFunction: NewFunctionThresholds;\n  tolerance: GateTolerances;\n  /**\n   * Minimum token-LCS similarity percent for re-matching a renamed/moved function to its base\n   * counterpart, so renames don't appear as delete+add and hit the new-code thresholds.\n   */\n  matchSimilarityPercent: number;\n}\n\nexport const defaultGateOptions: GateOptions = {\n  // 15 is SonarSource's conventional default; 4 is where the measured cognitive-load response to\n  // nesting saturates (Peitek et al. 2021); 60 matches PMD's NcssCount method default.\n  newFunction: { maxCognitiveComplexity: 15, maxNcss: 60, maxNestingDepth: 4 },\n  // The per-metric allowances are calibrated to admit roughly the same edit: ~5 added statements\n  // or one added branch (cognitive 2 ~ nesting 1 ~ ncss 5 ~ depDegree 10 ~ Halstead volume 150;\n  // the volume allowance additionally scales with the base value, see ratchetMetrics), so one\n  // ratchet cannot block an addition the others deliberately allow.\n  tolerance: {\n    cognitiveComplexity: 2,\n    ncss: 5,\n    nestingDepth: 1,\n    depDegree: 10,\n    halsteadVolume: 150,\n    fileNcss: 20,\n    duplicateLines: 0,\n  },\n  matchSimilarityPercent: 70,\n};\n\n/** One changed file with both revisions measured; the caller resolves git and duplication data. */\nexport interface GateFileInput {\n  /** Display path (repository-relative head path; base path for deleted files). */\n  file: string;\n  /** Absent for added files. */\n  baseMetrics?: CodeMetrics;\n  /** Absent for deleted files. */\n  headMetrics?: CodeMetrics;\n  /** Token sequences index-parallel to baseMetrics.functions, for similarity re-matching. */\n  baseFunctionTokens?: Int32Array[];\n  headFunctionTokens?: Int32Array[];\n  /** Distinct duplicated lines of this file at the base revision (within-file and cross-file). */\n  baseDuplicatedLineCount: number;\n  headDuplicatedLineCount: number;\n  /** Other files sharing cross-file duplicates with this file at head, as remediation evidence. */\n  duplicationPartners: string[];\n  /**\n   * false: the file only feeds function matching and the duplication universes (it lies outside\n   * the gated target directory); no violations are evaluated or reported for it. Default true.\n   */\n  gated?: boolean;\n}\n\nexport interface GateViolation {\n  gate: 'function-regression' | 'new-function' | 'file-regression' | 'duplication';\n  metric: string;\n  file: string;\n  functionName?: string;\n  startLine: number;\n  endLine: number;\n  /** Absent for new-function violations, which have no base value. */\n  baseValue?: number;\n  headValue: number;\n  /** The largest value that would have passed. */\n  allowedValue: number;\n  /** One-line human/agent-readable statement with the remediation direction. */\n  message: string;\n}\n\n/** The gated per-function values of one checked (matched or new) function, for `--full` output. */\nexport interface CheckedFunctionReport {\n  /** The head file (a cross-file move is reported where the function now lives). */\n  file: string;\n  name: string;\n  startLine: number;\n  endLine: number;\n  /** Absent for new functions. */\n  base?: GateFunctionValues;\n  head: GateFunctionValues;\n}\n\nexport interface GateFunctionValues {\n  cognitiveComplexity: number;\n  ncss: number;\n  nestingDepth: number;\n  depDegree: number;\n  halsteadVolume: number;\n}\n\nexport interface GateResult {\n  violations: GateViolation[];\n  checkedFileCount: number;\n  checkedFunctionCount: number;\n  newFunctionCount: number;\n  /** Every checked function with its gated values, ordered by file and line. */\n  checkedFunctions: CheckedFunctionReport[];\n}\n\ninterface RatchetMetric {\n  metric: string;\n  value: (fn: FunctionMetrics) => number;\n  /** The growth allowed on top of the base value before the ratchet fires. */\n  allowance: (tolerances: GateTolerances, baseValue: number) => number;\n  remediation: string;\n  format: (value: number) => string;\n}\n\nconst formatInteger = String;\nconst formatFloat = (value: number): string => value.toFixed(1);\n\n/**\n * Gate-eligible per-function metrics (monotone, stable, actionable): a matched function must not\n * worsen any of them beyond its tolerance. \"Your change made this function worse\" is defensible\n * regardless of metric calibration, so no absolute threshold is involved.\n */\nconst ratchetMetrics: RatchetMetric[] = [\n  {\n    metric: 'cognitive complexity',\n    value: (fn) => fn.cognitiveComplexity,\n    allowance: (tolerances) => tolerances.cognitiveComplexity,\n    remediation: 'Simplify the added branching or split the function.',\n    format: formatInteger,\n  },\n  {\n    metric: 'NCSS',\n    value: (fn) => fn.ncss,\n    allowance: (tolerances) => tolerances.ncss,\n    remediation: 'Extract the added statements into helper functions or remove them.',\n    format: formatInteger,\n  },\n  {\n    metric: 'max nesting depth',\n    value: (fn) => fn.nestingDepth,\n    allowance: (tolerances) => tolerances.nestingDepth,\n    remediation: 'Flatten the added nesting with early returns or extracted helpers.',\n    format: formatInteger,\n  },\n  {\n    metric: 'DepDegree',\n    value: (fn) => fn.depDegree,\n    allowance: (tolerances) => tolerances.depDegree,\n    remediation: 'Reduce how many earlier definitions the code reads, e.g. by splitting the data flow.',\n    format: formatInteger,\n  },\n  {\n    metric: 'Halstead volume',\n    value: (fn) => fn.halstead.volume,\n    // Volume grows as length * log2(vocabulary), so a flat allowance that admits ~5 statements in\n    // a small function admits barely one in a large-vocabulary function; the relative term keeps\n    // the ~5-statement calibration at every function size.\n    allowance: (tolerances, baseValue) => Math.max(tolerances.halsteadVolume, baseValue * 0.25),\n    remediation: 'Shrink the function: fewer distinct names and operations.',\n    format: formatFloat,\n  },\n];\n\ninterface NewFunctionMetric {\n  metric: string;\n  value: (fn: FunctionMetrics) => number;\n  limit: (thresholds: NewFunctionThresholds) => number;\n  remediation: string;\n}\n\nconst newFunctionMetrics: NewFunctionMetric[] = [\n  {\n    metric: 'cognitive complexity',\n    value: (fn) => fn.cognitiveComplexity,\n    limit: (thresholds) => thresholds.maxCognitiveComplexity,\n    remediation: 'Split the new function or simplify its branching.',\n  },\n  {\n    metric: 'NCSS',\n    value: (fn) => fn.ncss,\n    limit: (thresholds) => thresholds.maxNcss,\n    remediation: 'Split the new function into smaller ones.',\n  },\n  {\n    metric: 'max nesting depth',\n    value: (fn) => fn.nestingDepth,\n    limit: (thresholds) => thresholds.maxNestingDepth,\n    remediation: 'Flatten the new function with early returns or extracted helpers.',\n  },\n];\n\n/**\n * Evaluates the regression gate over changed files measured at both revisions. Violations are the\n * whole output contract: everything that passes stays silent, so a clean change costs the\n * consuming agent almost no tokens.\n */\nexport function evaluateRegressionGate(files: GateFileInput[], options: GateOptions): GateResult {\n  const matching = matchAllFunctions(files, options.matchSimilarityPercent);\n  const violations: GateViolation[] = [];\n  const checkedFunctions: CheckedFunctionReport[] = [];\n  let checkedPairCount = 0;\n  let newFunctionCount = 0;\n\n  for (const pair of matching.pairs) {\n    const file = files[pair.headFileIndex] as GateFileInput;\n    if (file.gated === false) {\n      continue;\n    }\n    checkedPairCount += 1;\n    violations.push(...checkRatchets(file.file, pair.base, pair.head, options.tolerance));\n    checkedFunctions.push(toFunctionReport(file.file, pair.head, pair.base));\n  }\n\n  let gatedFileCount = 0;\n  for (const [fileIndex, file] of files.entries()) {\n    if (file.gated === false) {\n      continue;\n    }\n    gatedFileCount += 1;\n    const headFunctions = file.headMetrics?.functions ?? [];\n    const headMatched = matching.headMatched[fileIndex] as boolean[];\n    for (const [functionIndex, fn] of headFunctions.entries()) {\n      if (headMatched[functionIndex]) {\n        continue;\n      }\n      newFunctionCount += 1;\n      violations.push(...checkNewFunction(file.file, fn, options.newFunction));\n      checkedFunctions.push(toFunctionReport(file.file, fn));\n    }\n    violations.push(...checkFileBackstops(file, hasSplitEvidence(file, fileIndex, matching), violations, options));\n    violations.push(...checkDuplication(file, options.tolerance));\n  }\n\n  violations.sort((left, right) => left.file.localeCompare(right.file) || left.startLine - right.startLine);\n  checkedFunctions.sort((left, right) => left.file.localeCompare(right.file) || left.startLine - right.startLine);\n  return {\n    violations,\n    checkedFileCount: gatedFileCount,\n    checkedFunctionCount: checkedPairCount + newFunctionCount,\n    newFunctionCount,\n    checkedFunctions,\n  };\n}\n\n/**\n * Similarity below the match threshold but above this marks a removed function's content as\n * reappearing inside unmatched new code — the signature of a split or evasive rewrite.\n */\nconst splitEvidenceSimilarityPercent = 30;\n\n/**\n * Whether a removed NAMED base function's content partially reappears in an unmatched head\n * function of the same file. This is what arms the file-level backstops: splitting a function to\n * hide a worsening behind the (laxer) new-code thresholds leaves its fragments partially similar\n * to the removed original, while an ordinary \"delete a helper, add an unrelated function\" change\n * shares nothing and must not have its brand-new code re-judged against the file's old aggregates.\n */\nfunction hasSplitEvidence(file: GateFileInput, fileIndex: number, matching: FunctionMatching): boolean {\n  const baseFunctions = file.baseMetrics?.functions ?? [];\n  const baseMatchedFlags = matching.baseMatched[fileIndex] as boolean[];\n  const headMatchedFlags = matching.headMatched[fileIndex] as boolean[];\n  const removedNamed = baseFunctions.flatMap((fn, index) =>\n    !baseMatchedFlags[index] && fn.name !== undefined ? [index] : []\n  );\n  if (removedNamed.length === 0) {\n    return false;\n  }\n  const unmatchedHead = (file.headMetrics?.functions ?? []).flatMap((_, index) =>\n    headMatchedFlags[index] ? [] : [index]\n  );\n  if (removedNamed.length * unmatchedHead.length > maxSimilarityComparisons) {\n    return false;\n  }\n  return removedNamed.some((baseIndex) =>\n    unmatchedHead.some(\n      (headIndex) =>\n        tokenSimilarityPercent(\n          file.baseFunctionTokens?.[baseIndex],\n          file.headFunctionTokens?.[headIndex],\n          splitEvidenceSimilarityPercent\n        ) >= splitEvidenceSimilarityPercent\n    )\n  );\n}\n\nfunction toFunctionReport(file: string, head: FunctionMetrics, base?: FunctionMetrics): CheckedFunctionReport {\n  return {\n    file,\n    name: head.name ?? '<anonymous>',\n    startLine: head.startLine,\n    endLine: head.endLine,\n    base: base ? toFunctionValues(base) : undefined,\n    head: toFunctionValues(head),\n  };\n}\n\nfunction toFunctionValues(fn: FunctionMetrics): GateFunctionValues {\n  return {\n    cognitiveComplexity: fn.cognitiveComplexity,\n    ncss: fn.ncss,\n    nestingDepth: fn.nestingDepth,\n    depDegree: fn.depDegree,\n    halsteadVolume: fn.halstead.volume,\n  };\n}\n\n/** One side of a match candidate: a function of one changed file plus its token sequence. */\ninterface IndexedFunction {\n  fileIndex: number;\n  functionIndex: number;\n  fn: FunctionMetrics;\n  tokens: Int32Array | undefined;\n}\n\ninterface MatchedPair {\n  base: FunctionMetrics;\n  head: FunctionMetrics;\n  headFileIndex: number;\n}\n\ninterface FunctionMatching {\n  pairs: MatchedPair[];\n  /** Per file, per function index: whether it found a counterpart (anywhere in the change set). */\n  baseMatched: boolean[][];\n  headMatched: boolean[][];\n}\n\ninterface SimilarityCandidate {\n  similarity: number;\n  basePosition: number;\n  headPosition: number;\n}\n\n/**\n * Matches head functions to base functions: within each file first by name + arity, then by name\n * alone (signature changes) — resolving ambiguous same-name groups by token similarity instead of\n * list position, so an inserted overload cannot shift the pairing — and finally by\n * normalized-token LCS similarity across ALL changed files (renames and moves between files,\n * reusing the near-miss clone machinery), so refactorings don't appear as delete+add and hit the\n * new-code thresholds.\n */\nfunction matchAllFunctions(files: GateFileInput[], matchSimilarityPercent: number): FunctionMatching {\n  const baseMatched = files.map((file) => (file.baseMetrics?.functions ?? []).map(() => false));\n  const headMatched = files.map((file) => (file.headMetrics?.functions ?? []).map(() => false));\n  const pairs: MatchedPair[] = [];\n\n  for (const fileIndex of files.keys()) {\n    const pairByKey = (key: (fn: FunctionMetrics) => string | undefined): void => {\n      const baseByKey = groupByKey(collectUnmatched(files, baseMatched, 'base', fileIndex), key);\n      const headByKey = groupByKey(collectUnmatched(files, headMatched, 'head', fileIndex), key);\n      for (const [groupKey, baseGroup] of baseByKey) {\n        pairGroup(baseGroup, headByKey.get(groupKey) ?? [], baseMatched, headMatched, pairs);\n      }\n    };\n    pairByKey((fn) => (fn.name === undefined ? undefined : `${fn.name}\\u0000${fn.parameterCount}`));\n    pairByKey((fn) => fn.name);\n  }\n\n  pairAcrossChangeSet(files, baseMatched, headMatched, pairs, matchSimilarityPercent);\n  return { pairs, baseMatched, headMatched };\n}\n\n/** Unmatched functions of one file (or of every file when onlyFileIndex is undefined). */\nfunction collectUnmatched(\n  files: GateFileInput[],\n  matchedByFile: boolean[][],\n  side: 'base' | 'head',\n  onlyFileIndex?: number\n): IndexedFunction[] {\n  const unmatched: IndexedFunction[] = [];\n  for (const [fileIndex, file] of files.entries()) {\n    if (onlyFileIndex !== undefined && fileIndex !== onlyFileIndex) {\n      continue;\n    }\n    const matched = matchedByFile[fileIndex] as boolean[];\n    const metrics = side === 'base' ? file.baseMetrics : file.headMetrics;\n    const tokens = side === 'base' ? file.baseFunctionTokens : file.headFunctionTokens;\n    for (const [functionIndex, fn] of (metrics?.functions ?? []).entries()) {\n      if (!matched[functionIndex]) {\n        unmatched.push({ fileIndex, functionIndex, fn, tokens: tokens?.[functionIndex] });\n      }\n    }\n  }\n  return unmatched;\n}\n\nfunction groupByKey(\n  functions: IndexedFunction[],\n  key: (fn: FunctionMetrics) => string | undefined\n): Map<string, IndexedFunction[]> {\n  const groups = new Map<string, IndexedFunction[]>();\n  for (const indexed of functions) {\n    const groupKey = key(indexed.fn);\n    if (groupKey === undefined) {\n      continue;\n    }\n    const group = groups.get(groupKey) ?? [];\n    group.push(indexed);\n    groups.set(groupKey, group);\n  }\n  return groups;\n}\n\n/** Bounds the quadratic similarity passes; beyond this, leftovers gate as new/removed functions. */\nconst maxSimilarityComparisons = 10_000;\n\n/**\n * Pairs one key group. An unambiguous 1x1 group matches directly; a larger group (same-name\n * methods of different classes, overload sets) is assigned best-similarity-first so an inserted\n * function cannot shift the pairing of the others. The names already match, so any pairing is\n * acceptable: similarity only ORDERS the assignment (no threshold), and without token sequences\n * (or in an oversized group) the stable tie-break reproduces positional order.\n */\nfunction pairGroup(\n  baseGroup: IndexedFunction[],\n  headGroup: IndexedFunction[],\n  baseMatched: boolean[][],\n  headMatched: boolean[][],\n  pairs: MatchedPair[]\n): void {\n  const ambiguous =\n    baseGroup.length + headGroup.length > 2 && baseGroup.length * headGroup.length <= maxSimilarityComparisons;\n  const candidates: SimilarityCandidate[] = [];\n  for (const [basePosition, base] of baseGroup.entries()) {\n    for (const [headPosition, head] of headGroup.entries()) {\n      candidates.push({\n        similarity: ambiguous ? tokenSimilarityPercent(base.tokens, head.tokens, 0) : 0,\n        basePosition,\n        headPosition,\n      });\n    }\n  }\n  takeMaximumMatches(candidates, baseGroup, headGroup, baseMatched, headMatched, pairs);\n}\n\n/** Cross-file (and remaining within-file) similarity matching over every unmatched function. */\nfunction pairAcrossChangeSet(\n  files: GateFileInput[],\n  baseMatched: boolean[][],\n  headMatched: boolean[][],\n  pairs: MatchedPair[],\n  matchSimilarityPercent: number\n): void {\n  const unmatchedBase = collectUnmatched(files, baseMatched, 'base');\n  const unmatchedHead = collectUnmatched(files, headMatched, 'head');\n  if (unmatchedBase.length * unmatchedHead.length > maxSimilarityComparisons) {\n    return;\n  }\n\n  const candidates: SimilarityCandidate[] = [];\n  for (const [basePosition, base] of unmatchedBase.entries()) {\n    for (const [headPosition, head] of unmatchedHead.entries()) {\n      const similarity = tokenSimilarityPercent(base.tokens, head.tokens, matchSimilarityPercent);\n      if (similarity >= matchSimilarityPercent) {\n        candidates.push({ similarity, basePosition, headPosition });\n      }\n    }\n  }\n  takeMaximumMatches(candidates, unmatchedBase, unmatchedHead, baseMatched, headMatched, pairs);\n}\n\n/**\n * Assignment over the candidate edges: a greedy best-similarity-first seed, then Kuhn's\n * augmenting paths for the bases the seed left unmatched, so a function whose only counterpart\n * was taken by a slightly better pair is re-matched by rewiring instead of being falsely gated as\n * new code. Augmentation runs only when it increases cardinality, and an exact (100%) seed pair —\n * certain identity — is locked and never rewired even then: trading it for two partial matches\n * would ratchet an untouched function against some other function's rewrite. Non-exact seed pairs\n * may be rewired, but only when that matches strictly more functions (which a maximum-weight\n * assignment would also prefer). Without token sequences every similarity ties at 0 and the seed\n * reproduces positional order.\n */\nfunction takeMaximumMatches(\n  candidates: SimilarityCandidate[],\n  baseGroup: IndexedFunction[],\n  headGroup: IndexedFunction[],\n  baseMatched: boolean[][],\n  headMatched: boolean[][],\n  pairs: MatchedPair[]\n): void {\n  candidates.sort(\n    (left, right) =>\n      right.similarity - left.similarity ||\n      left.basePosition - right.basePosition ||\n      left.headPosition - right.headPosition\n  );\n  const adjacency = new Map<number, number[]>();\n  const baseOfHead = new Map<number, number>();\n  const lockedHeads = new Set<number>();\n  const matchedBases = seedGreedyMatches(candidates, adjacency, baseOfHead, lockedHeads);\n  for (const basePosition of [...adjacency.keys()].toSorted((left, right) => left - right)) {\n    if (!matchedBases.has(basePosition)) {\n      tryAugment(basePosition, adjacency, baseOfHead, lockedHeads, new Set());\n    }\n  }\n\n  for (const [headPosition, basePosition] of [...baseOfHead.entries()].toSorted((left, right) => left[0] - right[0])) {\n    const base = baseGroup[basePosition] as IndexedFunction;\n    const head = headGroup[headPosition] as IndexedFunction;\n    (baseMatched[base.fileIndex] as boolean[])[base.functionIndex] = true;\n    (headMatched[head.fileIndex] as boolean[])[head.functionIndex] = true;\n    pairs.push({ base: base.fn, head: head.fn, headFileIndex: head.fileIndex });\n  }\n}\n\n/**\n * Fills the adjacency lists and takes each best edge whose endpoints are both still free; a taken\n * exact (100%) edge locks its head against later rewiring.\n */\nfunction seedGreedyMatches(\n  candidates: SimilarityCandidate[],\n  adjacency: Map<number, number[]>,\n  baseOfHead: Map<number, number>,\n  lockedHeads: Set<number>\n): Set<number> {\n  const matchedBases = new Set<number>();\n  for (const candidate of candidates) {\n    const edges = adjacency.get(candidate.basePosition) ?? [];\n    edges.push(candidate.headPosition);\n    adjacency.set(candidate.basePosition, edges);\n    if (!matchedBases.has(candidate.basePosition) && !baseOfHead.has(candidate.headPosition)) {\n      baseOfHead.set(candidate.headPosition, candidate.basePosition);\n      matchedBases.add(candidate.basePosition);\n      if (candidate.similarity === 100) {\n        lockedHeads.add(candidate.headPosition);\n      }\n    }\n  }\n  return matchedBases;\n}\n\n/** One Kuhn augmentation step: rewires existing (unlocked) matches only when that frees a head for `basePosition`. */\nfunction tryAugment(\n  basePosition: number,\n  adjacency: Map<number, number[]>,\n  baseOfHead: Map<number, number>,\n  lockedHeads: Set<number>,\n  visitedHeads: Set<number>\n): boolean {\n  for (const headPosition of adjacency.get(basePosition) ?? []) {\n    if (visitedHeads.has(headPosition) || lockedHeads.has(headPosition)) {\n      continue;\n    }\n    visitedHeads.add(headPosition);\n    const currentBase = baseOfHead.get(headPosition);\n    if (currentBase === undefined || tryAugment(currentBase, adjacency, baseOfHead, lockedHeads, visitedHeads)) {\n      baseOfHead.set(headPosition, basePosition);\n      return true;\n    }\n  }\n  return false;\n}\n\n/** Token-LCS similarity of two sequences relative to the longer one, in percent (0 when unusable). */\nfunction tokenSimilarityPercent(\n  base: Int32Array | undefined,\n  head: Int32Array | undefined,\n  minPercent: number\n): number {\n  if (!base || !head || base.length === 0 || head.length === 0) {\n    return 0;\n  }\n  // The LCS cannot exceed the shorter sequence, so mismatched lengths are pruned for free.\n  const maxLength = Math.max(base.length, head.length);\n  if (Math.min(base.length, head.length) * 100 < minPercent * maxLength) {\n    return 0;\n  }\n  return (lcsLength(base, head) * 100) / maxLength;\n}\n\nfunction checkRatchets(\n  file: string,\n  base: FunctionMetrics,\n  head: FunctionMetrics,\n  tolerances: GateTolerances\n): GateViolation[] {\n  const violations: GateViolation[] = [];\n  for (const ratchet of ratchetMetrics) {\n    const baseValue = ratchet.value(base);\n    const headValue = ratchet.value(head);\n    const allowedValue = baseValue + ratchet.allowance(tolerances, baseValue);\n    if (headValue > allowedValue) {\n      const name = head.name ?? '<anonymous>';\n      violations.push({\n        gate: 'function-regression',\n        metric: ratchet.metric,\n        file,\n        functionName: name,\n        startLine: head.startLine,\n        endLine: head.endLine,\n        baseValue,\n        headValue,\n        allowedValue,\n        message:\n          `${file}:${head.startLine}-${head.endLine} ${name}: ${ratchet.metric} worsened ` +\n          `${ratchet.format(baseValue)} -> ${ratchet.format(headValue)} (allowed <= ${ratchet.format(allowedValue)}). ` +\n          ratchet.remediation,\n      });\n    }\n  }\n  return violations;\n}\n\nfunction checkNewFunction(file: string, fn: FunctionMetrics, thresholds: NewFunctionThresholds): GateViolation[] {\n  const violations: GateViolation[] = [];\n  for (const check of newFunctionMetrics) {\n    const headValue = check.value(fn);\n    const allowedValue = check.limit(thresholds);\n    if (headValue > allowedValue) {\n      const name = fn.name ?? '<anonymous>';\n      violations.push({\n        gate: 'new-function',\n        metric: check.metric,\n        file,\n        functionName: name,\n        startLine: fn.startLine,\n        endLine: fn.endLine,\n        headValue,\n        allowedValue,\n        message:\n          `${file}:${fn.startLine}-${fn.endLine} new function ${name}: ${check.metric} ${headValue} ` +\n          `exceeds the new-code limit ${allowedValue}. ${check.remediation}`,\n      });\n    }\n  }\n  return violations;\n}\n\n/**\n * Anti-gaming backstops: splitting a function resets its entity identity and could hide a\n * worsening behind the (laxer) new-code thresholds, so when a removed named function's content\n * reappears in unmatched new code (see hasSplitEvidence) the file-level aggregates ratchet too —\n * the max cognitive complexity per file and the file's total NCSS. Purely additive changes and\n * unrelated remove-plus-add changes stay ungated. The max-cognitive backstop is also skipped when\n * a function-level cognitive violation already reports the file's maximum, since it would only\n * restate it.\n */\nfunction checkFileBackstops(\n  file: GateFileInput,\n  splitEvidence: boolean,\n  reportedViolations: GateViolation[],\n  options: GateOptions\n): GateViolation[] {\n  const { baseMetrics, headMetrics } = file;\n  if (!baseMetrics || !headMetrics || !splitEvidence) {\n    return [];\n  }\n  const violations: GateViolation[] = [];\n  const tolerances = options.tolerance;\n\n  const maximumAlreadyReported = reportedViolations.some(\n    (violation) =>\n      violation.file === file.file &&\n      violation.metric === 'cognitive complexity' &&\n      (violation.gate === 'function-regression' || violation.gate === 'new-function') &&\n      violation.headValue === headMetrics.maxCognitiveComplexity\n  );\n  const allowedMaxCognitive = baseMetrics.maxCognitiveComplexity + tolerances.cognitiveComplexity;\n  if (!maximumAlreadyReported && headMetrics.maxCognitiveComplexity > allowedMaxCognitive) {\n    const worst = findMostComplexFunction(headMetrics.functions);\n    const startLine = worst?.startLine ?? 1;\n    const endLine = worst?.endLine ?? headMetrics.lines.total;\n    violations.push({\n      gate: 'file-regression',\n      metric: 'file max cognitive complexity',\n      file: file.file,\n      functionName: worst?.name ?? undefined,\n      startLine,\n      endLine,\n      baseValue: baseMetrics.maxCognitiveComplexity,\n      headValue: headMetrics.maxCognitiveComplexity,\n      allowedValue: allowedMaxCognitive,\n      message:\n        `${file.file}:${startLine}-${endLine}: the file's max cognitive complexity worsened ` +\n        `${baseMetrics.maxCognitiveComplexity} -> ${headMetrics.maxCognitiveComplexity} ` +\n        `(allowed <= ${allowedMaxCognitive}). Simplify or split the most complex ` +\n        `function${worst ? ` (${worst.name ?? '<anonymous>'})` : ''}.`,\n    });\n  }\n\n  const allowedFileNcss = baseMetrics.ncssCount + tolerances.fileNcss;\n  if (headMetrics.ncssCount > allowedFileNcss) {\n    violations.push({\n      gate: 'file-regression',\n      metric: 'file NCSS',\n      file: file.file,\n      startLine: 1,\n      endLine: headMetrics.lines.total,\n      baseValue: baseMetrics.ncssCount,\n      headValue: headMetrics.ncssCount,\n      allowedValue: allowedFileNcss,\n      message:\n        `${file.file}:1-${headMetrics.lines.total}: functions were removed or split while the file grew from NCSS ` +\n        `${baseMetrics.ncssCount} to ${headMetrics.ncssCount} (allowed <= ${allowedFileNcss}). ` +\n        `Remove the added statements or move genuinely new code into its own module.`,\n    });\n  }\n\n  return violations;\n}\n\nfunction findMostComplexFunction(functions: FunctionMetrics[]): FunctionMetrics | undefined {\n  let worst: FunctionMetrics | undefined;\n  for (const fn of functions) {\n    if (!worst || fn.cognitiveComplexity > worst.cognitiveComplexity) {\n      worst = fn;\n    }\n  }\n  return worst;\n}\n\n/**\n * No new duplication: the distinct duplicated lines of a changed file (within-file plus\n * cross-file against the whole project, so copy-paste from existing code into new files is\n * caught) must not exceed the base revision's count.\n */\nfunction checkDuplication(file: GateFileInput, tolerances: GateTolerances): GateViolation[] {\n  const allowedValue = file.baseDuplicatedLineCount + tolerances.duplicateLines;\n  if (file.headDuplicatedLineCount <= allowedValue) {\n    return [];\n  }\n  const partners = file.duplicationPartners.slice(0, 3).join(', ');\n  const endLine = file.headMetrics?.lines.total ?? 1;\n  return [\n    {\n      gate: 'duplication',\n      metric: 'duplicated lines',\n      file: file.file,\n      startLine: 1,\n      endLine,\n      baseValue: file.baseDuplicatedLineCount,\n      headValue: file.headDuplicatedLineCount,\n      allowedValue,\n      message:\n        `${file.file}:1-${endLine}: duplicated lines increased ${file.baseDuplicatedLineCount} -> ` +\n        `${file.headDuplicatedLineCount} (allowed <= ${allowedValue}). Deduplicate` +\n        `${partners ? ` against ${partners}` : ' the repeated code'} by extracting a shared helper.`,\n    },\n  ];\n}\n"],"mappings":"6CAyCA,MAAa,EAAkC,CAG7C,YAAa,CAAE,uBAAwB,GAAI,QAAS,GAAI,gBAAiB,CAAE,EAK3E,UAAW,CACT,oBAAqB,EACrB,KAAM,EACN,aAAc,EACd,UAAW,GACX,eAAgB,IAChB,SAAU,GACV,eAAgB,CAClB,EACA,uBAAwB,EAC1B,EA+EM,EAAgB,OAQhB,EAAkC,CACtC,CACE,OAAQ,uBACR,MAAQ,GAAO,EAAG,oBAClB,UAAY,GAAe,EAAW,oBACtC,YAAa,sDACb,OAAQ,CACV,EACA,CACE,OAAQ,OACR,MAAQ,GAAO,EAAG,KAClB,UAAY,GAAe,EAAW,KACtC,YAAa,qEACb,OAAQ,CACV,EACA,CACE,OAAQ,oBACR,MAAQ,GAAO,EAAG,aAClB,UAAY,GAAe,EAAW,aACtC,YAAa,qEACb,OAAQ,CACV,EACA,CACE,OAAQ,YACR,MAAQ,GAAO,EAAG,UAClB,UAAY,GAAe,EAAW,UACtC,YAAa,uFACb,OAAQ,CACV,EACA,CACE,OAAQ,kBACR,MAAQ,GAAO,EAAG,SAAS,OAI3B,WAAY,EAAY,IAAc,KAAK,IAAI,EAAW,eAAgB,EAAY,GAAI,EAC1F,YAAa,4DACb,OA5CiB,GAA0B,EAAM,QAAQ,CAAC,CA6C5D,CACF,EASM,EAA0C,CAC9C,CACE,OAAQ,uBACR,MAAQ,GAAO,EAAG,oBAClB,MAAQ,GAAe,EAAW,uBAClC,YAAa,mDACf,EACA,CACE,OAAQ,OACR,MAAQ,GAAO,EAAG,KAClB,MAAQ,GAAe,EAAW,QAClC,YAAa,2CACf,EACA,CACE,OAAQ,oBACR,MAAQ,GAAO,EAAG,aAClB,MAAQ,GAAe,EAAW,gBAClC,YAAa,mEACf,CACF,EAOA,SAAgB,EAAuB,EAAwB,EAAkC,CAC/F,IAAM,EAAW,EAAkB,EAAO,EAAQ,sBAAsB,EAClE,EAA8B,CAAC,EAC/B,EAA4C,CAAC,EAC/C,EAAmB,EACnB,EAAmB,EAEvB,IAAK,IAAM,KAAQ,EAAS,MAAO,CACjC,IAAM,EAAO,EAAM,EAAK,eACpB,EAAK,QAAU,KAGnB,GAAoB,EACpB,EAAW,KAAK,GAAG,EAAc,EAAK,KAAM,EAAK,KAAM,EAAK,KAAM,EAAQ,SAAS,CAAC,EACpF,EAAiB,KAAK,EAAiB,EAAK,KAAM,EAAK,KAAM,EAAK,IAAI,CAAC,EACzE,CAEA,IAAI,EAAiB,EACrB,IAAK,GAAM,CAAC,EAAW,KAAS,EAAM,QAAQ,EAAG,CAC/C,GAAI,EAAK,QAAU,GACjB,SAEF,GAAkB,EAClB,IAAM,EAAgB,EAAK,aAAa,WAAa,CAAC,EAChD,EAAc,EAAS,YAAY,GACzC,IAAK,GAAM,CAAC,EAAe,KAAO,EAAc,QAAQ,EAClD,EAAY,KAGhB,GAAoB,EACpB,EAAW,KAAK,GAAG,EAAiB,EAAK,KAAM,EAAI,EAAQ,WAAW,CAAC,EACvE,EAAiB,KAAK,EAAiB,EAAK,KAAM,CAAE,CAAC,GAEvD,EAAW,KAAK,GAAG,EAAmB,EAAM,EAAiB,EAAM,EAAW,CAAQ,EAAG,EAAY,CAAO,CAAC,EAC7G,EAAW,KAAK,GAAG,EAAiB,EAAM,EAAQ,SAAS,CAAC,CAC9D,CAIA,OAFA,EAAW,MAAM,EAAM,IAAU,EAAK,KAAK,cAAc,EAAM,IAAI,GAAK,EAAK,UAAY,EAAM,SAAS,EACxG,EAAiB,MAAM,EAAM,IAAU,EAAK,KAAK,cAAc,EAAM,IAAI,GAAK,EAAK,UAAY,EAAM,SAAS,EACvG,CACL,aACA,iBAAkB,EAClB,qBAAsB,EAAmB,EACzC,mBACA,kBACF,CACF,CAeA,SAAS,EAAiB,EAAqB,EAAmB,EAAqC,CACrG,IAAM,EAAgB,EAAK,aAAa,WAAa,CAAC,EAChD,EAAmB,EAAS,YAAY,GACxC,EAAmB,EAAS,YAAY,GACxC,EAAe,EAAc,SAAS,EAAI,IAC9C,CAAC,EAAiB,IAAU,EAAG,OAAS,IAAA,GAAY,CAAC,CAAK,EAAI,CAAC,CACjE,EACA,GAAI,EAAa,SAAW,EAC1B,MAAO,GAET,IAAM,GAAiB,EAAK,aAAa,WAAa,CAAC,EAAA,CAAG,SAAS,EAAG,IACpE,EAAiB,GAAS,CAAC,EAAI,CAAC,CAAK,CACvC,EAIA,OAHI,EAAa,OAAS,EAAc,OAAS,EACxC,GAEF,EAAa,KAAM,GACxB,EAAc,KACX,GACC,EACE,EAAK,qBAAqB,GAC1B,EAAK,qBAAqB,GAC1B,EACF,GAAK,EACT,CACF,CACF,CAEA,SAAS,EAAiB,EAAc,EAAuB,EAA+C,CAC5G,MAAO,CACL,OACA,KAAM,EAAK,MAAQ,cACnB,UAAW,EAAK,UAChB,QAAS,EAAK,QACd,KAAM,EAAO,EAAiB,CAAI,EAAI,IAAA,GACtC,KAAM,EAAiB,CAAI,CAC7B,CACF,CAEA,SAAS,EAAiB,EAAyC,CACjE,MAAO,CACL,oBAAqB,EAAG,oBACxB,KAAM,EAAG,KACT,aAAc,EAAG,aACjB,UAAW,EAAG,UACd,eAAgB,EAAG,SAAS,MAC9B,CACF,CAqCA,SAAS,EAAkB,EAAwB,EAAkD,CACnG,IAAM,EAAc,EAAM,IAAK,IAAU,EAAK,aAAa,WAAa,CAAC,EAAA,CAAG,QAAU,EAAK,CAAC,EACtF,EAAc,EAAM,IAAK,IAAU,EAAK,aAAa,WAAa,CAAC,EAAA,CAAG,QAAU,EAAK,CAAC,EACtF,EAAuB,CAAC,EAE9B,IAAK,IAAM,KAAa,EAAM,KAAK,EAAG,CACpC,IAAM,EAAa,GAA2D,CAC5E,IAAM,EAAY,EAAW,EAAiB,EAAO,EAAa,OAAQ,CAAS,EAAG,CAAG,EACnF,EAAY,EAAW,EAAiB,EAAO,EAAa,OAAQ,CAAS,EAAG,CAAG,EACzF,IAAK,GAAM,CAAC,EAAU,KAAc,EAClC,EAAU,EAAW,EAAU,IAAI,CAAQ,GAAK,CAAC,EAAG,EAAa,EAAa,CAAK,CAEvF,EACA,EAAW,GAAQ,EAAG,OAAS,IAAA,GAAY,IAAA,GAAY,GAAG,EAAG,KAAK,QAAQ,EAAG,gBAAiB,EAC9F,EAAW,GAAO,EAAG,IAAI,CAC3B,CAGA,OADA,EAAoB,EAAO,EAAa,EAAa,EAAO,CAAsB,EAC3E,CAAE,QAAO,cAAa,aAAY,CAC3C,CAGA,SAAS,EACP,EACA,EACA,EACA,EACmB,CACnB,IAAM,EAA+B,CAAC,EACtC,IAAK,GAAM,CAAC,EAAW,KAAS,EAAM,QAAQ,EAAG,CAC/C,GAAI,IAAkB,IAAA,IAAa,IAAc,EAC/C,SAEF,IAAM,EAAU,EAAc,GACxB,EAAU,IAAS,OAAS,EAAK,YAAc,EAAK,YACpD,EAAS,IAAS,OAAS,EAAK,mBAAqB,EAAK,mBAChE,IAAK,GAAM,CAAC,EAAe,KAAQ,GAAS,WAAa,CAAC,EAAA,CAAG,QAAQ,EAC9D,EAAQ,IACX,EAAU,KAAK,CAAE,YAAW,gBAAe,KAAI,OAAQ,IAAS,EAAe,CAAC,CAGtF,CACA,OAAO,CACT,CAEA,SAAS,EACP,EACA,EACgC,CAChC,IAAM,EAAS,IAAI,IACnB,IAAK,IAAM,KAAW,EAAW,CAC/B,IAAM,EAAW,EAAI,EAAQ,EAAE,EAC/B,GAAI,IAAa,IAAA,GACf,SAEF,IAAM,EAAQ,EAAO,IAAI,CAAQ,GAAK,CAAC,EACvC,EAAM,KAAK,CAAO,EAClB,EAAO,IAAI,EAAU,CAAK,CAC5B,CACA,OAAO,CACT,CAGA,MAAM,EAA2B,IASjC,SAAS,EACP,EACA,EACA,EACA,EACA,EACM,CACN,IAAM,EACJ,EAAU,OAAS,EAAU,OAAS,GAAK,EAAU,OAAS,EAAU,QAAU,EAC9E,EAAoC,CAAC,EAC3C,IAAK,GAAM,CAAC,EAAc,KAAS,EAAU,QAAQ,EACnD,IAAK,GAAM,CAAC,EAAc,KAAS,EAAU,QAAQ,EACnD,EAAW,KAAK,CACd,WAAY,EAAY,EAAuB,EAAK,OAAQ,EAAK,OAAQ,CAAC,EAAI,EAC9E,eACA,cACF,CAAC,EAGL,EAAmB,EAAY,EAAW,EAAW,EAAa,EAAa,CAAK,CACtF,CAGA,SAAS,EACP,EACA,EACA,EACA,EACA,EACM,CACN,IAAM,EAAgB,EAAiB,EAAO,EAAa,MAAM,EAC3D,EAAgB,EAAiB,EAAO,EAAa,MAAM,EACjE,GAAI,EAAc,OAAS,EAAc,OAAS,EAChD,OAGF,IAAM,EAAoC,CAAC,EAC3C,IAAK,GAAM,CAAC,EAAc,KAAS,EAAc,QAAQ,EACvD,IAAK,GAAM,CAAC,EAAc,KAAS,EAAc,QAAQ,EAAG,CAC1D,IAAM,EAAa,EAAuB,EAAK,OAAQ,EAAK,OAAQ,CAAsB,EACtF,GAAc,GAChB,EAAW,KAAK,CAAE,aAAY,eAAc,cAAa,CAAC,CAE9D,CAEF,EAAmB,EAAY,EAAe,EAAe,EAAa,EAAa,CAAK,CAC9F,CAaA,SAAS,EACP,EACA,EACA,EACA,EACA,EACA,EACM,CACN,EAAW,MACR,EAAM,IACL,EAAM,WAAa,EAAK,YACxB,EAAK,aAAe,EAAM,cAC1B,EAAK,aAAe,EAAM,YAC9B,EACA,IAAM,EAAY,IAAI,IAChB,EAAa,IAAI,IACjB,EAAc,IAAI,IAClB,EAAe,EAAkB,EAAY,EAAW,EAAY,CAAW,EACrF,IAAK,IAAM,IAAgB,CAAC,GAAG,EAAU,KAAK,CAAC,CAAC,CAAC,UAAU,EAAM,IAAU,EAAO,CAAK,EAChF,EAAa,IAAI,CAAY,GAChC,EAAW,EAAc,EAAW,EAAY,EAAa,IAAI,GAAK,EAI1E,IAAK,GAAM,CAAC,EAAc,IAAiB,CAAC,GAAG,EAAW,QAAQ,CAAC,CAAC,CAAC,UAAU,EAAM,IAAU,EAAK,GAAK,EAAM,EAAE,EAAG,CAClH,IAAM,EAAO,EAAU,GACjB,EAAO,EAAU,GACvB,EAAa,EAAK,UAAU,CAAe,EAAK,eAAiB,GACjE,EAAa,EAAK,UAAU,CAAe,EAAK,eAAiB,GACjE,EAAM,KAAK,CAAE,KAAM,EAAK,GAAI,KAAM,EAAK,GAAI,cAAe,EAAK,SAAU,CAAC,CAC5E,CACF,CAMA,SAAS,EACP,EACA,EACA,EACA,EACa,CACb,IAAM,EAAe,IAAI,IACzB,IAAK,IAAM,KAAa,EAAY,CAClC,IAAM,EAAQ,EAAU,IAAI,EAAU,YAAY,GAAK,CAAC,EACxD,EAAM,KAAK,EAAU,YAAY,EACjC,EAAU,IAAI,EAAU,aAAc,CAAK,EACvC,CAAC,EAAa,IAAI,EAAU,YAAY,GAAK,CAAC,EAAW,IAAI,EAAU,YAAY,IACrF,EAAW,IAAI,EAAU,aAAc,EAAU,YAAY,EAC7D,EAAa,IAAI,EAAU,YAAY,EACnC,EAAU,aAAe,KAC3B,EAAY,IAAI,EAAU,YAAY,EAG5C,CACA,OAAO,CACT,CAGA,SAAS,EACP,EACA,EACA,EACA,EACA,EACS,CACT,IAAK,IAAM,KAAgB,EAAU,IAAI,CAAY,GAAK,CAAC,EAAG,CAC5D,GAAI,EAAa,IAAI,CAAY,GAAK,EAAY,IAAI,CAAY,EAChE,SAEF,EAAa,IAAI,CAAY,EAC7B,IAAM,EAAc,EAAW,IAAI,CAAY,EAC/C,GAAI,IAAgB,IAAA,IAAa,EAAW,EAAa,EAAW,EAAY,EAAa,CAAY,EAEvG,OADA,EAAW,IAAI,EAAc,CAAY,EAClC,EAEX,CACA,MAAO,EACT,CAGA,SAAS,EACP,EACA,EACA,EACQ,CACR,GAAI,CAAC,GAAQ,CAAC,GAAQ,EAAK,SAAW,GAAK,EAAK,SAAW,EACzD,MAAO,GAGT,IAAM,EAAY,KAAK,IAAI,EAAK,OAAQ,EAAK,MAAM,EAInD,OAHI,KAAK,IAAI,EAAK,OAAQ,EAAK,MAAM,EAAI,IAAM,EAAa,EACnD,EAED,EAAU,EAAM,CAAI,EAAI,IAAO,CACzC,CAEA,SAAS,EACP,EACA,EACA,EACA,EACiB,CACjB,IAAM,EAA8B,CAAC,EACrC,IAAK,IAAM,KAAW,EAAgB,CACpC,IAAM,EAAY,EAAQ,MAAM,CAAI,EAC9B,EAAY,EAAQ,MAAM,CAAI,EAC9B,EAAe,EAAY,EAAQ,UAAU,EAAY,CAAS,EACxE,GAAI,EAAY,EAAc,CAC5B,IAAM,EAAO,EAAK,MAAQ,cAC1B,EAAW,KAAK,CACd,KAAM,sBACN,OAAQ,EAAQ,OAChB,OACA,aAAc,EACd,UAAW,EAAK,UAChB,QAAS,EAAK,QACd,YACA,YACA,eACA,QACE,GAAG,EAAK,GAAG,EAAK,UAAU,GAAG,EAAK,QAAQ,GAAG,EAAK,IAAI,EAAQ,OAAO,YAClE,EAAQ,OAAO,CAAS,EAAE,MAAM,EAAQ,OAAO,CAAS,EAAE,eAAe,EAAQ,OAAO,CAAY,EAAE,KACzG,EAAQ,WACZ,CAAC,CACH,CACF,CACA,OAAO,CACT,CAEA,SAAS,EAAiB,EAAc,EAAqB,EAAoD,CAC/G,IAAM,EAA8B,CAAC,EACrC,IAAK,IAAM,KAAS,EAAoB,CACtC,IAAM,EAAY,EAAM,MAAM,CAAE,EAC1B,EAAe,EAAM,MAAM,CAAU,EAC3C,GAAI,EAAY,EAAc,CAC5B,IAAM,EAAO,EAAG,MAAQ,cACxB,EAAW,KAAK,CACd,KAAM,eACN,OAAQ,EAAM,OACd,OACA,aAAc,EACd,UAAW,EAAG,UACd,QAAS,EAAG,QACZ,YACA,eACA,QACE,GAAG,EAAK,GAAG,EAAG,UAAU,GAAG,EAAG,QAAQ,gBAAgB,EAAK,IAAI,EAAM,OAAO,GAAG,EAAU,8BAC3D,EAAa,IAAI,EAAM,aACzD,CAAC,CACH,CACF,CACA,OAAO,CACT,CAWA,SAAS,EACP,EACA,EACA,EACA,EACiB,CACjB,GAAM,CAAE,cAAa,eAAgB,EACrC,GAAI,CAAC,GAAe,CAAC,GAAe,CAAC,EACnC,MAAO,CAAC,EAEV,IAAM,EAA8B,CAAC,EAC/B,EAAa,EAAQ,UAErB,EAAyB,EAAmB,KAC/C,GACC,EAAU,OAAS,EAAK,MACxB,EAAU,SAAW,yBACpB,EAAU,OAAS,uBAAyB,EAAU,OAAS,iBAChE,EAAU,YAAc,EAAY,sBACxC,EACM,EAAsB,EAAY,uBAAyB,EAAW,oBAC5E,GAAI,CAAC,GAA0B,EAAY,uBAAyB,EAAqB,CACvF,IAAM,EAAQ,EAAwB,EAAY,SAAS,EACrD,EAAY,GAAO,WAAa,EAChC,EAAU,GAAO,SAAW,EAAY,MAAM,MACpD,EAAW,KAAK,CACd,KAAM,kBACN,OAAQ,gCACR,KAAM,EAAK,KACX,aAAc,GAAO,MAAQ,IAAA,GAC7B,YACA,UACA,UAAW,EAAY,uBACvB,UAAW,EAAY,uBACvB,aAAc,EACd,QACE,GAAG,EAAK,KAAK,GAAG,EAAU,GAAG,EAAQ,iDAClC,EAAY,uBAAuB,MAAM,EAAY,uBAAuB,eAChE,EAAoB,gDACxB,EAAQ,KAAK,EAAM,MAAQ,cAAc,GAAK,GAAG,EAChE,CAAC,CACH,CAEA,IAAM,EAAkB,EAAY,UAAY,EAAW,SAkB3D,OAjBI,EAAY,UAAY,GAC1B,EAAW,KAAK,CACd,KAAM,kBACN,OAAQ,YACR,KAAM,EAAK,KACX,UAAW,EACX,QAAS,EAAY,MAAM,MAC3B,UAAW,EAAY,UACvB,UAAW,EAAY,UACvB,aAAc,EACd,QACE,GAAG,EAAK,KAAK,KAAK,EAAY,MAAM,MAAM,kEACvC,EAAY,UAAU,MAAM,EAAY,UAAU,eAAe,EAAgB,+EAExF,CAAC,EAGI,CACT,CAEA,SAAS,EAAwB,EAA2D,CAC1F,IAAI,EACJ,IAAK,IAAM,KAAM,GACX,CAAC,GAAS,EAAG,oBAAsB,EAAM,uBAC3C,EAAQ,GAGZ,OAAO,CACT,CAOA,SAAS,EAAiB,EAAqB,EAA6C,CAC1F,IAAM,EAAe,EAAK,wBAA0B,EAAW,eAC/D,GAAI,EAAK,yBAA2B,EAClC,MAAO,CAAC,EAEV,IAAM,EAAW,EAAK,oBAAoB,MAAM,EAAG,CAAC,CAAC,CAAC,KAAK,IAAI,EACzD,EAAU,EAAK,aAAa,MAAM,OAAS,EACjD,MAAO,CACL,CACE,KAAM,cACN,OAAQ,mBACR,KAAM,EAAK,KACX,UAAW,EACX,UACA,UAAW,EAAK,wBAChB,UAAW,EAAK,wBAChB,eACA,QACE,GAAG,EAAK,KAAK,KAAK,EAAQ,+BAA+B,EAAK,wBAAwB,MACnF,EAAK,wBAAwB,eAAe,EAAa,gBACzD,EAAW,YAAY,IAAa,qBAAqB,gCAChE,CACF,CACF"}
+{"version":3,"file":"regressionGate.js","names":[],"sources":["../src/regressionGate.ts"],"sourcesContent":["import { lcsLength } from './duplication.js';\nimport type { CodeMetrics, FunctionMetrics } from './types.js';\n\n/**\n * Absolute limits applied only to functions with no base counterpart (SonarQube-style \"Clean as\n * You Code\"): new code is the one place absolute thresholds are required, since there is nothing\n * to ratchet against.\n */\nexport interface NewFunctionThresholds {\n  maxCognitiveComplexity: number;\n  maxNcss: number;\n  maxNestingDepth: number;\n}\n\n/**\n * Allowances added on top of each base value before a ratchet fires, so legitimate refactorings\n * that transiently worsen one number (e.g. an extraction adding a few NCSS lines) don't trap the\n * agent in a loop.\n */\nexport interface GateTolerances {\n  cognitiveComplexity: number;\n  ncss: number;\n  nestingDepth: number;\n  depDegree: number;\n  halsteadVolume: number;\n  /** File-total NCSS growth allowed when base functions disappeared (the anti-gaming backstop). */\n  fileNcss: number;\n  /** Duplicated-line growth allowed per changed file. */\n  duplicateLines: number;\n}\n\nexport interface GateOptions {\n  newFunction: NewFunctionThresholds;\n  tolerance: GateTolerances;\n  /**\n   * Minimum token-LCS similarity percent for re-matching a renamed/moved function to its base\n   * counterpart, so renames don't appear as delete+add and hit the new-code thresholds.\n   */\n  matchSimilarityPercent: number;\n}\n\nexport const defaultGateOptions: GateOptions = {\n  // 15 is SonarSource's conventional default; 4 is where the measured cognitive-load response to\n  // nesting saturates (Peitek et al. 2021); 60 matches PMD's NcssCount method default.\n  newFunction: { maxCognitiveComplexity: 15, maxNcss: 60, maxNestingDepth: 4 },\n  // The per-metric allowances are calibrated to admit roughly the same edit: ~5 added statements\n  // or one added branch (cognitive 2 ~ nesting 1 ~ ncss 5 ~ depDegree 10 ~ Halstead volume 150;\n  // the volume allowance additionally scales with the base value, see ratchetMetrics), so one\n  // ratchet cannot block an addition the others deliberately allow.\n  tolerance: {\n    cognitiveComplexity: 2,\n    ncss: 5,\n    nestingDepth: 1,\n    depDegree: 10,\n    halsteadVolume: 150,\n    fileNcss: 20,\n    duplicateLines: 0,\n  },\n  matchSimilarityPercent: 70,\n};\n\n/** One changed file with both revisions measured; the caller resolves git and duplication data. */\nexport interface GateFileInput {\n  /** Display path (repository-relative head path; base path for deleted files). */\n  file: string;\n  /** Absent for added files. */\n  baseMetrics?: CodeMetrics;\n  /** Absent for deleted files. */\n  headMetrics?: CodeMetrics;\n  /** Token sequences index-parallel to baseMetrics.functions, for similarity re-matching. */\n  baseFunctionTokens?: Int32Array[];\n  headFunctionTokens?: Int32Array[];\n  /** Distinct duplicated lines of this file at the base revision (within-file and cross-file). */\n  baseDuplicatedLineCount: number;\n  headDuplicatedLineCount: number;\n  /** Other files sharing cross-file duplicates with this file at head, as remediation evidence. */\n  duplicationPartners: string[];\n  /**\n   * false: the file only feeds function matching and the duplication universes (it lies outside\n   * the gated target directory); no violations are evaluated or reported for it. Default true.\n   */\n  gated?: boolean;\n}\n\nexport interface GateViolation {\n  gate: 'function-regression' | 'new-function' | 'file-regression' | 'duplication';\n  metric: string;\n  file: string;\n  functionName?: string;\n  startLine: number;\n  endLine: number;\n  /** Absent for new-function violations, which have no base value. */\n  baseValue?: number;\n  headValue: number;\n  /** The largest value that would have passed. */\n  allowedValue: number;\n  /** One-line human/agent-readable statement with the remediation direction. */\n  message: string;\n}\n\n/** The gated per-function values of one checked (matched or new) function, for `--full` output. */\nexport interface CheckedFunctionReport {\n  /** The head file (a cross-file move is reported where the function now lives). */\n  file: string;\n  name: string;\n  startLine: number;\n  endLine: number;\n  /** Absent for new functions. */\n  base?: GateFunctionValues;\n  head: GateFunctionValues;\n}\n\nexport interface GateFunctionValues {\n  cognitiveComplexity: number;\n  ncss: number;\n  nestingDepth: number;\n  depDegree: number;\n  halsteadVolume: number;\n}\n\nexport interface GateResult {\n  violations: GateViolation[];\n  checkedFileCount: number;\n  checkedFunctionCount: number;\n  newFunctionCount: number;\n  /** Every checked function with its gated values, ordered by file and line. */\n  checkedFunctions: CheckedFunctionReport[];\n}\n\ninterface RatchetMetric {\n  metric: string;\n  value: (fn: FunctionMetrics) => number;\n  /** The growth allowed on top of the base value before the ratchet fires. */\n  allowance: (tolerances: GateTolerances, baseValue: number) => number;\n  remediation: string;\n  format: (value: number) => string;\n}\n\nconst formatInteger = String;\nconst formatFloat = (value: number): string => value.toFixed(1);\n\n/**\n * Gate-eligible per-function metrics (monotone, stable, actionable): a matched function must not\n * worsen any of them beyond its tolerance. \"Your change made this function worse\" is defensible\n * regardless of metric calibration, so no absolute threshold is involved.\n */\nconst ratchetMetrics: RatchetMetric[] = [\n  {\n    metric: 'cognitive complexity',\n    value: (fn) => fn.cognitiveComplexity,\n    allowance: (tolerances) => tolerances.cognitiveComplexity,\n    remediation: 'Simplify the added branching or split the function.',\n    format: formatInteger,\n  },\n  {\n    metric: 'NCSS',\n    value: (fn) => fn.ncss,\n    allowance: (tolerances) => tolerances.ncss,\n    remediation: 'Extract the added statements into helper functions or remove them.',\n    format: formatInteger,\n  },\n  {\n    metric: 'max nesting depth',\n    value: (fn) => fn.nestingDepth,\n    allowance: (tolerances) => tolerances.nestingDepth,\n    remediation: 'Flatten the added nesting with early returns or extracted helpers.',\n    format: formatInteger,\n  },\n  {\n    metric: 'DepDegree',\n    value: (fn) => fn.depDegree,\n    allowance: (tolerances) => tolerances.depDegree,\n    remediation: 'Reduce how many earlier definitions the code reads, e.g. by splitting the data flow.',\n    format: formatInteger,\n  },\n  {\n    metric: 'Halstead volume',\n    value: (fn) => fn.halstead.volume,\n    // Volume grows as length * log2(vocabulary), so a flat allowance that admits ~5 statements in\n    // a small function admits barely one in a large-vocabulary function; the relative term keeps\n    // the ~5-statement calibration at every function size.\n    allowance: (tolerances, baseValue) => Math.max(tolerances.halsteadVolume, baseValue * 0.25),\n    remediation: 'Shrink the function: fewer distinct names and operations.',\n    format: formatFloat,\n  },\n];\n\ninterface NewFunctionMetric {\n  metric: string;\n  value: (fn: FunctionMetrics) => number;\n  limit: (thresholds: NewFunctionThresholds) => number;\n  remediation: string;\n}\n\nconst newFunctionMetrics: NewFunctionMetric[] = [\n  {\n    metric: 'cognitive complexity',\n    value: (fn) => fn.cognitiveComplexity,\n    limit: (thresholds) => thresholds.maxCognitiveComplexity,\n    remediation: 'Split the new function or simplify its branching.',\n  },\n  {\n    metric: 'NCSS',\n    value: (fn) => fn.ncss,\n    limit: (thresholds) => thresholds.maxNcss,\n    remediation: 'Split the new function into smaller ones.',\n  },\n  {\n    metric: 'max nesting depth',\n    value: (fn) => fn.nestingDepth,\n    limit: (thresholds) => thresholds.maxNestingDepth,\n    remediation: 'Flatten the new function with early returns or extracted helpers.',\n  },\n];\n\n/**\n * Evaluates the regression gate over changed files measured at both revisions. Violations are the\n * whole output contract: everything that passes stays silent, so a clean change costs the\n * consuming agent almost no tokens.\n */\nexport function evaluateRegressionGate(files: GateFileInput[], options: GateOptions): GateResult {\n  const matching = matchAllFunctions(files, options.matchSimilarityPercent);\n  const violations: GateViolation[] = [];\n  const checkedFunctions: CheckedFunctionReport[] = [];\n  let checkedPairCount = 0;\n  let newFunctionCount = 0;\n\n  for (const pair of matching.pairs) {\n    const file = files[pair.headFileIndex] as GateFileInput;\n    if (file.gated === false) {\n      continue;\n    }\n    checkedPairCount += 1;\n    violations.push(...checkRatchets(file.file, pair.base, pair.head, options.tolerance));\n    checkedFunctions.push(toFunctionReport(file.file, pair.head, pair.base));\n  }\n\n  let gatedFileCount = 0;\n  for (const [fileIndex, file] of files.entries()) {\n    if (file.gated === false) {\n      continue;\n    }\n    gatedFileCount += 1;\n    const headFunctions = file.headMetrics?.functions ?? [];\n    const headMatched = matching.headMatched[fileIndex] as boolean[];\n    for (const [functionIndex, fn] of headFunctions.entries()) {\n      if (headMatched[functionIndex]) {\n        continue;\n      }\n      newFunctionCount += 1;\n      violations.push(...checkNewFunction(file.file, fn, options.newFunction));\n      checkedFunctions.push(toFunctionReport(file.file, fn));\n    }\n    violations.push(...checkFileBackstops(file, hasSplitEvidence(file, fileIndex, matching), violations, options));\n    violations.push(...checkDuplication(file, options.tolerance));\n  }\n\n  violations.sort((left, right) => left.file.localeCompare(right.file) || left.startLine - right.startLine);\n  checkedFunctions.sort((left, right) => left.file.localeCompare(right.file) || left.startLine - right.startLine);\n  return {\n    violations,\n    checkedFileCount: gatedFileCount,\n    checkedFunctionCount: checkedPairCount + newFunctionCount,\n    newFunctionCount,\n    checkedFunctions,\n  };\n}\n\n/**\n * Similarity below the match threshold but above this marks a removed function's content as\n * reappearing inside unmatched new code — the signature of a split or evasive rewrite.\n */\nconst splitEvidenceSimilarityPercent = 30;\n\n/**\n * Whether a removed NAMED base function's content partially reappears in an unmatched head\n * function of the same file. This is what arms the file-level backstops: splitting a function to\n * hide a worsening behind the (laxer) new-code thresholds leaves its fragments partially similar\n * to the removed original, while an ordinary \"delete a helper, add an unrelated function\" change\n * shares nothing and must not have its brand-new code re-judged against the file's old aggregates.\n */\nfunction hasSplitEvidence(file: GateFileInput, fileIndex: number, matching: FunctionMatching): boolean {\n  const baseFunctions = file.baseMetrics?.functions ?? [];\n  const baseMatchedFlags = matching.baseMatched[fileIndex] as boolean[];\n  const headMatchedFlags = matching.headMatched[fileIndex] as boolean[];\n  const removedNamed = baseFunctions.flatMap((fn, index) =>\n    !baseMatchedFlags[index] && fn.name !== undefined ? [index] : []\n  );\n  if (removedNamed.length === 0) {\n    return false;\n  }\n  const unmatchedHead = (file.headMetrics?.functions ?? []).flatMap((_, index) =>\n    headMatchedFlags[index] ? [] : [index]\n  );\n  if (removedNamed.length * unmatchedHead.length > maxSimilarityComparisons) {\n    return false;\n  }\n  return removedNamed.some((baseIndex) =>\n    unmatchedHead.some(\n      (headIndex) =>\n        tokenSimilarityPercent(\n          file.baseFunctionTokens?.[baseIndex],\n          file.headFunctionTokens?.[headIndex],\n          splitEvidenceSimilarityPercent\n        ) >= splitEvidenceSimilarityPercent\n    )\n  );\n}\n\nfunction toFunctionReport(file: string, head: FunctionMetrics, base?: FunctionMetrics): CheckedFunctionReport {\n  return {\n    file,\n    name: head.name ?? '<anonymous>',\n    startLine: head.startLine,\n    endLine: head.endLine,\n    base: base ? toFunctionValues(base) : undefined,\n    head: toFunctionValues(head),\n  };\n}\n\nfunction toFunctionValues(fn: FunctionMetrics): GateFunctionValues {\n  return {\n    cognitiveComplexity: fn.cognitiveComplexity,\n    ncss: fn.ncss,\n    nestingDepth: fn.nestingDepth,\n    depDegree: fn.depDegree,\n    halsteadVolume: fn.halstead.volume,\n  };\n}\n\n/** One side of a match candidate: a function of one changed file plus its token sequence. */\ninterface IndexedFunction {\n  fileIndex: number;\n  functionIndex: number;\n  fn: FunctionMetrics;\n  tokens: Int32Array | undefined;\n}\n\ninterface MatchedPair {\n  base: FunctionMetrics;\n  head: FunctionMetrics;\n  headFileIndex: number;\n}\n\ninterface FunctionMatching {\n  pairs: MatchedPair[];\n  /** Per file, per function index: whether it found a counterpart (anywhere in the change set). */\n  baseMatched: boolean[][];\n  headMatched: boolean[][];\n}\n\ninterface SimilarityCandidate {\n  similarity: number;\n  basePosition: number;\n  headPosition: number;\n}\n\n/**\n * Matches head functions to base functions: within each file first by name + arity, then by name\n * alone (signature changes) — resolving ambiguous same-name groups by token similarity instead of\n * list position, so an inserted overload cannot shift the pairing — and finally by\n * normalized-token LCS similarity across ALL changed files (renames and moves between files,\n * reusing the near-miss clone machinery), so refactorings don't appear as delete+add and hit the\n * new-code thresholds.\n */\nfunction matchAllFunctions(files: GateFileInput[], matchSimilarityPercent: number): FunctionMatching {\n  const baseMatched = files.map((file) => (file.baseMetrics?.functions ?? []).map(() => false));\n  const headMatched = files.map((file) => (file.headMetrics?.functions ?? []).map(() => false));\n  const pairs: MatchedPair[] = [];\n\n  for (const fileIndex of files.keys()) {\n    const pairByKey = (key: (fn: FunctionMetrics) => string | undefined): void => {\n      const baseByKey = groupByKey(collectUnmatched(files, baseMatched, 'base', fileIndex), key);\n      const headByKey = groupByKey(collectUnmatched(files, headMatched, 'head', fileIndex), key);\n      for (const [groupKey, baseGroup] of baseByKey) {\n        pairGroup(baseGroup, headByKey.get(groupKey) ?? [], baseMatched, headMatched, pairs);\n      }\n    };\n    pairByKey((fn) => (fn.name === undefined ? undefined : `${fn.name}\\u0000${fn.parameterCount}`));\n    pairByKey((fn) => fn.name);\n  }\n\n  pairAcrossChangeSet(files, baseMatched, headMatched, pairs, matchSimilarityPercent);\n  return { pairs, baseMatched, headMatched };\n}\n\n/** Unmatched functions of one file (or of every file when onlyFileIndex is undefined). */\nfunction collectUnmatched(\n  files: GateFileInput[],\n  matchedByFile: boolean[][],\n  side: 'base' | 'head',\n  onlyFileIndex?: number\n): IndexedFunction[] {\n  const unmatched: IndexedFunction[] = [];\n  for (const [fileIndex, file] of files.entries()) {\n    if (onlyFileIndex !== undefined && fileIndex !== onlyFileIndex) {\n      continue;\n    }\n    const matched = matchedByFile[fileIndex] as boolean[];\n    const metrics = side === 'base' ? file.baseMetrics : file.headMetrics;\n    const tokens = side === 'base' ? file.baseFunctionTokens : file.headFunctionTokens;\n    for (const [functionIndex, fn] of (metrics?.functions ?? []).entries()) {\n      if (!matched[functionIndex]) {\n        unmatched.push({ fileIndex, functionIndex, fn, tokens: tokens?.[functionIndex] });\n      }\n    }\n  }\n  return unmatched;\n}\n\nfunction groupByKey(\n  functions: IndexedFunction[],\n  key: (fn: FunctionMetrics) => string | undefined\n): Map<string, IndexedFunction[]> {\n  const groups = new Map<string, IndexedFunction[]>();\n  for (const indexed of functions) {\n    const groupKey = key(indexed.fn);\n    if (groupKey === undefined) {\n      continue;\n    }\n    const group = groups.get(groupKey) ?? [];\n    group.push(indexed);\n    groups.set(groupKey, group);\n  }\n  return groups;\n}\n\n/** Bounds the quadratic similarity passes; beyond this, leftovers gate as new/removed functions. */\nconst maxSimilarityComparisons = 10_000;\n\n/**\n * Pairs one key group. An unambiguous 1x1 group matches directly; a larger group (same-name\n * methods of different classes, overload sets) is assigned best-similarity-first so an inserted\n * function cannot shift the pairing of the others. The names already match, so any pairing is\n * acceptable: similarity only ORDERS the assignment (no threshold), and without token sequences\n * (or in an oversized group) the stable tie-break reproduces positional order.\n */\nfunction pairGroup(\n  baseGroup: IndexedFunction[],\n  headGroup: IndexedFunction[],\n  baseMatched: boolean[][],\n  headMatched: boolean[][],\n  pairs: MatchedPair[]\n): void {\n  const ambiguous =\n    baseGroup.length + headGroup.length > 2 && baseGroup.length * headGroup.length <= maxSimilarityComparisons;\n  const candidates: SimilarityCandidate[] = [];\n  for (const [basePosition, base] of baseGroup.entries()) {\n    for (const [headPosition, head] of headGroup.entries()) {\n      candidates.push({\n        similarity: ambiguous ? tokenSimilarityPercent(base.tokens, head.tokens, 0) : 0,\n        basePosition,\n        headPosition,\n      });\n    }\n  }\n  takeMaximumMatches(candidates, baseGroup, headGroup, baseMatched, headMatched, pairs);\n}\n\n/** Cross-file (and remaining within-file) similarity matching over every unmatched function. */\nfunction pairAcrossChangeSet(\n  files: GateFileInput[],\n  baseMatched: boolean[][],\n  headMatched: boolean[][],\n  pairs: MatchedPair[],\n  matchSimilarityPercent: number\n): void {\n  const unmatchedBase = collectUnmatched(files, baseMatched, 'base');\n  const unmatchedHead = collectUnmatched(files, headMatched, 'head');\n  if (unmatchedBase.length * unmatchedHead.length > maxSimilarityComparisons) {\n    return;\n  }\n\n  const candidates: SimilarityCandidate[] = [];\n  for (const [basePosition, base] of unmatchedBase.entries()) {\n    for (const [headPosition, head] of unmatchedHead.entries()) {\n      const similarity = tokenSimilarityPercent(base.tokens, head.tokens, matchSimilarityPercent);\n      if (similarity >= matchSimilarityPercent) {\n        candidates.push({ similarity, basePosition, headPosition });\n      }\n    }\n  }\n  takeMaximumMatches(candidates, unmatchedBase, unmatchedHead, baseMatched, headMatched, pairs);\n}\n\n/**\n * Assignment over the candidate edges: a greedy best-similarity-first seed, then Kuhn's\n * augmenting paths for the bases the seed left unmatched, so a function whose only counterpart\n * was taken by a slightly better pair is re-matched by rewiring instead of being falsely gated as\n * new code. Augmentation runs only when it increases cardinality, and an exact (100%) seed pair —\n * certain identity — is locked and never rewired even then: trading it for two partial matches\n * would ratchet an untouched function against some other function's rewrite. Non-exact seed pairs\n * may be rewired, but only when that matches strictly more functions (which a maximum-weight\n * assignment would also prefer). Without token sequences every similarity ties at 0 and the seed\n * reproduces positional order.\n */\nfunction takeMaximumMatches(\n  candidates: SimilarityCandidate[],\n  baseGroup: IndexedFunction[],\n  headGroup: IndexedFunction[],\n  baseMatched: boolean[][],\n  headMatched: boolean[][],\n  pairs: MatchedPair[]\n): void {\n  candidates.sort(\n    (left, right) =>\n      right.similarity - left.similarity ||\n      left.basePosition - right.basePosition ||\n      left.headPosition - right.headPosition\n  );\n  const adjacency = new Map<number, number[]>();\n  const baseOfHead = new Map<number, number>();\n  const lockedHeads = new Set<number>();\n  const matchedBases = seedGreedyMatches(candidates, adjacency, baseOfHead, lockedHeads);\n  for (const basePosition of [...adjacency.keys()].toSorted((left, right) => left - right)) {\n    if (!matchedBases.has(basePosition)) {\n      tryAugment(basePosition, adjacency, baseOfHead, lockedHeads, new Set());\n    }\n  }\n\n  for (const [headPosition, basePosition] of [...baseOfHead.entries()].toSorted((left, right) => left[0] - right[0])) {\n    const base = baseGroup[basePosition] as IndexedFunction;\n    const head = headGroup[headPosition] as IndexedFunction;\n    (baseMatched[base.fileIndex] as boolean[])[base.functionIndex] = true;\n    (headMatched[head.fileIndex] as boolean[])[head.functionIndex] = true;\n    pairs.push({ base: base.fn, head: head.fn, headFileIndex: head.fileIndex });\n  }\n}\n\n/**\n * Fills the adjacency lists and takes each best edge whose endpoints are both still free; a taken\n * exact (100%) edge locks its head against later rewiring.\n */\nfunction seedGreedyMatches(\n  candidates: SimilarityCandidate[],\n  adjacency: Map<number, number[]>,\n  baseOfHead: Map<number, number>,\n  lockedHeads: Set<number>\n): Set<number> {\n  const matchedBases = new Set<number>();\n  for (const candidate of candidates) {\n    const edges = adjacency.get(candidate.basePosition) ?? [];\n    edges.push(candidate.headPosition);\n    adjacency.set(candidate.basePosition, edges);\n    if (!matchedBases.has(candidate.basePosition) && !baseOfHead.has(candidate.headPosition)) {\n      baseOfHead.set(candidate.headPosition, candidate.basePosition);\n      matchedBases.add(candidate.basePosition);\n      if (candidate.similarity === 100) {\n        lockedHeads.add(candidate.headPosition);\n      }\n    }\n  }\n  return matchedBases;\n}\n\n/** One Kuhn augmentation step: rewires existing (unlocked) matches only when that frees a head for `basePosition`. */\nfunction tryAugment(\n  basePosition: number,\n  adjacency: Map<number, number[]>,\n  baseOfHead: Map<number, number>,\n  lockedHeads: Set<number>,\n  visitedHeads: Set<number>\n): boolean {\n  for (const headPosition of adjacency.get(basePosition) ?? []) {\n    if (visitedHeads.has(headPosition) || lockedHeads.has(headPosition)) {\n      continue;\n    }\n    visitedHeads.add(headPosition);\n    const currentBase = baseOfHead.get(headPosition);\n    if (currentBase === undefined || tryAugment(currentBase, adjacency, baseOfHead, lockedHeads, visitedHeads)) {\n      baseOfHead.set(headPosition, basePosition);\n      return true;\n    }\n  }\n  return false;\n}\n\n/** Token-LCS similarity of two sequences relative to the longer one, in percent (0 when unusable). */\nfunction tokenSimilarityPercent(\n  base: Int32Array | undefined,\n  head: Int32Array | undefined,\n  minPercent: number\n): number {\n  if (!base || !head || base.length === 0 || head.length === 0) {\n    return 0;\n  }\n  // The LCS cannot exceed the shorter sequence, so mismatched lengths are pruned for free.\n  const maxLength = Math.max(base.length, head.length);\n  if (Math.min(base.length, head.length) * 100 < minPercent * maxLength) {\n    return 0;\n  }\n  return (lcsLength(base, head) * 100) / maxLength;\n}\n\nfunction checkRatchets(\n  file: string,\n  base: FunctionMetrics,\n  head: FunctionMetrics,\n  tolerances: GateTolerances\n): GateViolation[] {\n  const violations: GateViolation[] = [];\n  for (const ratchet of ratchetMetrics) {\n    const baseValue = ratchet.value(base);\n    const headValue = ratchet.value(head);\n    const allowedValue = baseValue + ratchet.allowance(tolerances, baseValue);\n    if (headValue > allowedValue) {\n      const name = head.name ?? '<anonymous>';\n      violations.push({\n        gate: 'function-regression',\n        metric: ratchet.metric,\n        file,\n        functionName: name,\n        startLine: head.startLine,\n        endLine: head.endLine,\n        baseValue,\n        headValue,\n        allowedValue,\n        message:\n          `${file}:${head.startLine}-${head.endLine} ${name}: ${ratchet.metric} worsened ` +\n          `${ratchet.format(baseValue)} -> ${ratchet.format(headValue)} (allowed <= ${ratchet.format(allowedValue)}). ` +\n          ratchet.remediation,\n      });\n    }\n  }\n  return violations;\n}\n\nfunction checkNewFunction(file: string, fn: FunctionMetrics, thresholds: NewFunctionThresholds): GateViolation[] {\n  const violations: GateViolation[] = [];\n  for (const check of newFunctionMetrics) {\n    const headValue = check.value(fn);\n    const allowedValue = check.limit(thresholds);\n    if (headValue > allowedValue) {\n      const name = fn.name ?? '<anonymous>';\n      violations.push({\n        gate: 'new-function',\n        metric: check.metric,\n        file,\n        functionName: name,\n        startLine: fn.startLine,\n        endLine: fn.endLine,\n        headValue,\n        allowedValue,\n        message:\n          `${file}:${fn.startLine}-${fn.endLine} new function ${name}: ${check.metric} ${headValue} ` +\n          `exceeds the new-code limit ${allowedValue}. ${check.remediation}`,\n      });\n    }\n  }\n  return violations;\n}\n\n/**\n * Anti-gaming backstops: splitting a function resets its entity identity and could hide a\n * worsening behind the (laxer) new-code thresholds, so when a removed named function's content\n * reappears in unmatched new code (see hasSplitEvidence) the file-level aggregates ratchet too —\n * the max cognitive complexity per file and the file's total NCSS. Purely additive changes and\n * unrelated remove-plus-add changes stay ungated. The max-cognitive backstop is also skipped when\n * a function-level cognitive violation already reports the file's maximum, since it would only\n * restate it.\n */\nfunction checkFileBackstops(\n  file: GateFileInput,\n  splitEvidence: boolean,\n  reportedViolations: GateViolation[],\n  options: GateOptions\n): GateViolation[] {\n  const { baseMetrics, headMetrics } = file;\n  if (!baseMetrics || !headMetrics || !splitEvidence) {\n    return [];\n  }\n  const violations: GateViolation[] = [];\n  const tolerances = options.tolerance;\n\n  const maximumAlreadyReported = reportedViolations.some(\n    (violation) =>\n      violation.file === file.file &&\n      violation.metric === 'cognitive complexity' &&\n      (violation.gate === 'function-regression' || violation.gate === 'new-function') &&\n      violation.headValue === headMetrics.maxCognitiveComplexity\n  );\n  const allowedMaxCognitive = baseMetrics.maxCognitiveComplexity + tolerances.cognitiveComplexity;\n  if (!maximumAlreadyReported && headMetrics.maxCognitiveComplexity > allowedMaxCognitive) {\n    const worst = findMostComplexFunction(headMetrics.functions);\n    const startLine = worst?.startLine ?? 1;\n    const endLine = worst?.endLine ?? headMetrics.lines.total;\n    violations.push({\n      gate: 'file-regression',\n      metric: 'file max cognitive complexity',\n      file: file.file,\n      functionName: worst?.name ?? undefined,\n      startLine,\n      endLine,\n      baseValue: baseMetrics.maxCognitiveComplexity,\n      headValue: headMetrics.maxCognitiveComplexity,\n      allowedValue: allowedMaxCognitive,\n      message:\n        `${file.file}:${startLine}-${endLine}: the file's max cognitive complexity worsened ` +\n        `${baseMetrics.maxCognitiveComplexity} -> ${headMetrics.maxCognitiveComplexity} ` +\n        `(allowed <= ${allowedMaxCognitive}). Simplify or split the most complex ` +\n        `function${worst ? ` (${worst.name ?? '<anonymous>'})` : ''}.`,\n    });\n  }\n\n  const allowedFileNcss = baseMetrics.ncssCount + tolerances.fileNcss;\n  if (headMetrics.ncssCount > allowedFileNcss) {\n    violations.push({\n      gate: 'file-regression',\n      metric: 'file NCSS',\n      file: file.file,\n      startLine: 1,\n      endLine: headMetrics.lines.total,\n      baseValue: baseMetrics.ncssCount,\n      headValue: headMetrics.ncssCount,\n      allowedValue: allowedFileNcss,\n      message:\n        `${file.file}:1-${headMetrics.lines.total}: functions were removed or split while the file grew from NCSS ` +\n        `${baseMetrics.ncssCount} to ${headMetrics.ncssCount} (allowed <= ${allowedFileNcss}). ` +\n        `Remove the added statements or move genuinely new code into its own module.`,\n    });\n  }\n\n  return violations;\n}\n\nfunction findMostComplexFunction(functions: FunctionMetrics[]): FunctionMetrics | undefined {\n  let worst: FunctionMetrics | undefined;\n  for (const fn of functions) {\n    if (!worst || fn.cognitiveComplexity > worst.cognitiveComplexity) {\n      worst = fn;\n    }\n  }\n  return worst;\n}\n\n/**\n * No new duplication: the distinct duplicated lines of a changed file (within-file plus\n * cross-file against the whole project, so copy-paste from existing code into new files is\n * caught) must not exceed the base revision's count.\n */\nfunction checkDuplication(file: GateFileInput, tolerances: GateTolerances): GateViolation[] {\n  const allowedValue = file.baseDuplicatedLineCount + tolerances.duplicateLines;\n  if (file.headDuplicatedLineCount <= allowedValue) {\n    return [];\n  }\n  const partners = file.duplicationPartners.slice(0, 3).join(', ');\n  const endLine = file.headMetrics?.lines.total ?? 1;\n  return [\n    {\n      gate: 'duplication',\n      metric: 'duplicated lines',\n      file: file.file,\n      startLine: 1,\n      endLine,\n      baseValue: file.baseDuplicatedLineCount,\n      headValue: file.headDuplicatedLineCount,\n      allowedValue,\n      message:\n        `${file.file}:1-${endLine}: duplicated lines increased ${file.baseDuplicatedLineCount} -> ` +\n        `${file.headDuplicatedLineCount} (allowed <= ${allowedValue}). Deduplicate` +\n        `${partners ? ` against ${partners}` : ' the repeated code'} by extracting a shared helper.`,\n    },\n  ];\n}\n"],"mappings":"6CAyCA,MAAa,EAAkC,CAG7C,YAAa,CAAE,uBAAwB,GAAI,QAAS,GAAI,gBAAiB,CAAE,EAK3E,UAAW,CACT,oBAAqB,EACrB,KAAM,EACN,aAAc,EACd,UAAW,GACX,eAAgB,IAChB,SAAU,GACV,eAAgB,CAClB,EACA,uBAAwB,EAC1B,EA+EM,EAAgB,OAQhB,EAAkC,CACtC,CACE,OAAQ,uBACR,MAAQ,GAAO,EAAG,oBAClB,UAAY,GAAe,EAAW,oBACtC,YAAa,sDACb,OAAQ,CACV,EACA,CACE,OAAQ,OACR,MAAQ,GAAO,EAAG,KAClB,UAAY,GAAe,EAAW,KACtC,YAAa,qEACb,OAAQ,CACV,EACA,CACE,OAAQ,oBACR,MAAQ,GAAO,EAAG,aAClB,UAAY,GAAe,EAAW,aACtC,YAAa,qEACb,OAAQ,CACV,EACA,CACE,OAAQ,YACR,MAAQ,GAAO,EAAG,UAClB,UAAY,GAAe,EAAW,UACtC,YAAa,uFACb,OAAQ,CACV,EACA,CACE,OAAQ,kBACR,MAAQ,GAAO,EAAG,SAAS,OAI3B,WAAY,EAAY,IAAc,KAAK,IAAI,EAAW,eAAgB,EAAY,GAAI,EAC1F,YAAa,4DACb,OA5CiB,GAA0B,EAAM,QAAQ,CAAC,CA6C5D,CACF,EASM,EAA0C,CAC9C,CACE,OAAQ,uBACR,MAAQ,GAAO,EAAG,oBAClB,MAAQ,GAAe,EAAW,uBAClC,YAAa,mDACf,EACA,CACE,OAAQ,OACR,MAAQ,GAAO,EAAG,KAClB,MAAQ,GAAe,EAAW,QAClC,YAAa,2CACf,EACA,CACE,OAAQ,oBACR,MAAQ,GAAO,EAAG,aAClB,MAAQ,GAAe,EAAW,gBAClC,YAAa,mEACf,CACF,EAOA,SAAgB,EAAuB,EAAwB,EAAkC,CAC/F,IAAM,EAAW,EAAkB,EAAO,EAAQ,sBAAsB,EAClE,EAA8B,CAAC,EAC/B,EAA4C,CAAC,EAC/C,EAAmB,EACnB,EAAmB,EAEvB,IAAK,IAAM,KAAQ,EAAS,MAAO,CACjC,IAAM,EAAO,EAAM,EAAK,eACpB,EAAK,QAAU,KAGnB,GAAoB,EACpB,EAAW,KAAK,GAAG,EAAc,EAAK,KAAM,EAAK,KAAM,EAAK,KAAM,EAAQ,SAAS,CAAC,EACpF,EAAiB,KAAK,EAAiB,EAAK,KAAM,EAAK,KAAM,EAAK,IAAI,CAAC,EACzE,CAEA,IAAI,EAAiB,EACrB,IAAK,GAAM,CAAC,EAAW,KAAS,EAAM,QAAQ,EAAG,CAC/C,GAAI,EAAK,QAAU,GACjB,SAEF,GAAkB,EAClB,IAAM,EAAgB,EAAK,aAAa,WAAa,CAAC,EAChD,EAAc,EAAS,YAAY,GACzC,IAAK,GAAM,CAAC,EAAe,KAAO,EAAc,QAAQ,EAClD,EAAY,KAGhB,GAAoB,EACpB,EAAW,KAAK,GAAG,EAAiB,EAAK,KAAM,EAAI,EAAQ,WAAW,CAAC,EACvE,EAAiB,KAAK,EAAiB,EAAK,KAAM,CAAE,CAAC,GAEvD,EAAW,KAAK,GAAG,EAAmB,EAAM,EAAiB,EAAM,EAAW,CAAQ,EAAG,EAAY,CAAO,CAAC,EAC7G,EAAW,KAAK,GAAG,EAAiB,EAAM,EAAQ,SAAS,CAAC,CAC9D,CAIA,OAFA,EAAW,MAAM,EAAM,IAAU,EAAK,KAAK,cAAc,EAAM,IAAI,GAAK,EAAK,UAAY,EAAM,SAAS,EACxG,EAAiB,MAAM,EAAM,IAAU,EAAK,KAAK,cAAc,EAAM,IAAI,GAAK,EAAK,UAAY,EAAM,SAAS,EACvG,CACL,aACA,iBAAkB,EAClB,qBAAsB,EAAmB,EACzC,mBACA,kBACF,CACF,CAeA,SAAS,EAAiB,EAAqB,EAAmB,EAAqC,CACrG,IAAM,EAAgB,EAAK,aAAa,WAAa,CAAC,EAChD,EAAmB,EAAS,YAAY,GACxC,EAAmB,EAAS,YAAY,GACxC,EAAe,EAAc,SAAS,EAAI,IAC9C,CAAC,EAAiB,IAAU,EAAG,OAAS,IAAA,GAAY,CAAC,CAAK,EAAI,CAAC,CACjE,EACA,GAAI,EAAa,SAAW,EAC1B,MAAO,GAET,IAAM,GAAiB,EAAK,aAAa,WAAa,CAAC,EAAA,CAAG,SAAS,EAAG,IACpE,EAAiB,GAAS,CAAC,EAAI,CAAC,CAAK,CACvC,EAIA,OAHI,EAAa,OAAS,EAAc,OAAS,EACxC,GAEF,EAAa,KAAM,GACxB,EAAc,KACX,GACC,EACE,EAAK,qBAAqB,GAC1B,EAAK,qBAAqB,GAC1B,EACF,GAAK,EACT,CACF,CACF,CAEA,SAAS,EAAiB,EAAc,EAAuB,EAA+C,CAC5G,MAAO,CACL,OACA,KAAM,EAAK,MAAQ,cACnB,UAAW,EAAK,UAChB,QAAS,EAAK,QACd,KAAM,EAAO,EAAiB,CAAI,EAAI,IAAA,GACtC,KAAM,EAAiB,CAAI,CAC7B,CACF,CAEA,SAAS,EAAiB,EAAyC,CACjE,MAAO,CACL,oBAAqB,EAAG,oBACxB,KAAM,EAAG,KACT,aAAc,EAAG,aACjB,UAAW,EAAG,UACd,eAAgB,EAAG,SAAS,MAC9B,CACF,CAqCA,SAAS,EAAkB,EAAwB,EAAkD,CACnG,IAAM,EAAc,EAAM,IAAK,IAAU,EAAK,aAAa,WAAa,CAAC,EAAA,CAAG,QAAU,EAAK,CAAC,EACtF,EAAc,EAAM,IAAK,IAAU,EAAK,aAAa,WAAa,CAAC,EAAA,CAAG,QAAU,EAAK,CAAC,EACtF,EAAuB,CAAC,EAE9B,IAAK,IAAM,KAAa,EAAM,KAAK,EAAG,CACpC,IAAM,EAAa,GAA2D,CAC5E,IAAM,EAAY,EAAW,EAAiB,EAAO,EAAa,OAAQ,CAAS,EAAG,CAAG,EACnF,EAAY,EAAW,EAAiB,EAAO,EAAa,OAAQ,CAAS,EAAG,CAAG,EACzF,IAAK,GAAM,CAAC,EAAU,KAAc,EAClC,EAAU,EAAW,EAAU,IAAI,CAAQ,GAAK,CAAC,EAAG,EAAa,EAAa,CAAK,CAEvF,EACA,EAAW,GAAQ,EAAG,OAAS,IAAA,GAAY,IAAA,GAAY,GAAG,EAAG,KAAK,QAAQ,EAAG,gBAAiB,EAC9F,EAAW,GAAO,EAAG,IAAI,CAC3B,CAGA,OADA,EAAoB,EAAO,EAAa,EAAa,EAAO,CAAsB,EAC3E,CAAE,QAAO,cAAa,aAAY,CAC3C,CAGA,SAAS,EACP,EACA,EACA,EACA,EACmB,CACnB,IAAM,EAA+B,CAAC,EACtC,IAAK,GAAM,CAAC,EAAW,KAAS,EAAM,QAAQ,EAAG,CAC/C,GAAI,IAAkB,IAAA,IAAa,IAAc,EAC/C,SAEF,IAAM,EAAU,EAAc,GACxB,EAAU,IAAS,OAAS,EAAK,YAAc,EAAK,YACpD,EAAS,IAAS,OAAS,EAAK,mBAAqB,EAAK,mBAChE,IAAK,GAAM,CAAC,EAAe,KAAQ,GAAS,WAAa,CAAC,EAAA,CAAG,QAAQ,EAC9D,EAAQ,IACX,EAAU,KAAK,CAAE,YAAW,gBAAe,KAAI,OAAQ,IAAS,EAAe,CAAC,CAGtF,CACA,OAAO,CACT,CAEA,SAAS,EACP,EACA,EACgC,CAChC,IAAM,kBAAS,IAAI,IACnB,IAAK,IAAM,KAAW,EAAW,CAC/B,IAAM,EAAW,EAAI,EAAQ,EAAE,EAC/B,GAAI,IAAa,IAAA,GACf,SAEF,IAAM,EAAQ,EAAO,IAAI,CAAQ,GAAK,CAAC,EACvC,EAAM,KAAK,CAAO,EAClB,EAAO,IAAI,EAAU,CAAK,CAC5B,CACA,OAAO,CACT,CAGA,MAAM,EAA2B,IASjC,SAAS,EACP,EACA,EACA,EACA,EACA,EACM,CACN,IAAM,EACJ,EAAU,OAAS,EAAU,OAAS,GAAK,EAAU,OAAS,EAAU,QAAU,EAC9E,EAAoC,CAAC,EAC3C,IAAK,GAAM,CAAC,EAAc,KAAS,EAAU,QAAQ,EACnD,IAAK,GAAM,CAAC,EAAc,KAAS,EAAU,QAAQ,EACnD,EAAW,KAAK,CACd,WAAY,EAAY,EAAuB,EAAK,OAAQ,EAAK,OAAQ,CAAC,EAAI,EAC9E,eACA,cACF,CAAC,EAGL,EAAmB,EAAY,EAAW,EAAW,EAAa,EAAa,CAAK,CACtF,CAGA,SAAS,EACP,EACA,EACA,EACA,EACA,EACM,CACN,IAAM,EAAgB,EAAiB,EAAO,EAAa,MAAM,EAC3D,EAAgB,EAAiB,EAAO,EAAa,MAAM,EACjE,GAAI,EAAc,OAAS,EAAc,OAAS,EAChD,OAGF,IAAM,EAAoC,CAAC,EAC3C,IAAK,GAAM,CAAC,EAAc,KAAS,EAAc,QAAQ,EACvD,IAAK,GAAM,CAAC,EAAc,KAAS,EAAc,QAAQ,EAAG,CAC1D,IAAM,EAAa,EAAuB,EAAK,OAAQ,EAAK,OAAQ,CAAsB,EACtF,GAAc,GAChB,EAAW,KAAK,CAAE,aAAY,eAAc,cAAa,CAAC,CAE9D,CAEF,EAAmB,EAAY,EAAe,EAAe,EAAa,EAAa,CAAK,CAC9F,CAaA,SAAS,EACP,EACA,EACA,EACA,EACA,EACA,EACM,CACN,EAAW,MACR,EAAM,IACL,EAAM,WAAa,EAAK,YACxB,EAAK,aAAe,EAAM,cAC1B,EAAK,aAAe,EAAM,YAC9B,EACA,IAAM,kBAAY,IAAI,IAChB,kBAAa,IAAI,IACjB,kBAAc,IAAI,IAClB,EAAe,EAAkB,EAAY,EAAW,EAAY,CAAW,EACrF,IAAK,IAAM,IAAgB,CAAC,GAAG,EAAU,KAAK,CAAC,CAAC,CAAC,UAAU,EAAM,IAAU,EAAO,CAAK,EAChF,EAAa,IAAI,CAAY,GAChC,EAAW,EAAc,EAAW,EAAY,kBAAa,IAAI,GAAK,EAI1E,IAAK,GAAM,CAAC,EAAc,IAAiB,CAAC,GAAG,EAAW,QAAQ,CAAC,CAAC,CAAC,UAAU,EAAM,IAAU,EAAK,GAAK,EAAM,EAAE,EAAG,CAClH,IAAM,EAAO,EAAU,GACjB,EAAO,EAAU,GACvB,EAAa,EAAK,UAAU,CAAe,EAAK,eAAiB,GACjE,EAAa,EAAK,UAAU,CAAe,EAAK,eAAiB,GACjE,EAAM,KAAK,CAAE,KAAM,EAAK,GAAI,KAAM,EAAK,GAAI,cAAe,EAAK,SAAU,CAAC,CAC5E,CACF,CAMA,SAAS,EACP,EACA,EACA,EACA,EACa,CACb,IAAM,kBAAe,IAAI,IACzB,IAAK,IAAM,KAAa,EAAY,CAClC,IAAM,EAAQ,EAAU,IAAI,EAAU,YAAY,GAAK,CAAC,EACxD,EAAM,KAAK,EAAU,YAAY,EACjC,EAAU,IAAI,EAAU,aAAc,CAAK,EACvC,CAAC,EAAa,IAAI,EAAU,YAAY,GAAK,CAAC,EAAW,IAAI,EAAU,YAAY,IACrF,EAAW,IAAI,EAAU,aAAc,EAAU,YAAY,EAC7D,EAAa,IAAI,EAAU,YAAY,EACnC,EAAU,aAAe,KAC3B,EAAY,IAAI,EAAU,YAAY,EAG5C,CACA,OAAO,CACT,CAGA,SAAS,EACP,EACA,EACA,EACA,EACA,EACS,CACT,IAAK,IAAM,KAAgB,EAAU,IAAI,CAAY,GAAK,CAAC,EAAG,CAC5D,GAAI,EAAa,IAAI,CAAY,GAAK,EAAY,IAAI,CAAY,EAChE,SAEF,EAAa,IAAI,CAAY,EAC7B,IAAM,EAAc,EAAW,IAAI,CAAY,EAC/C,GAAI,IAAgB,IAAA,IAAa,EAAW,EAAa,EAAW,EAAY,EAAa,CAAY,EAEvG,OADA,EAAW,IAAI,EAAc,CAAY,EAClC,EAEX,CACA,MAAO,EACT,CAGA,SAAS,EACP,EACA,EACA,EACQ,CACR,GAAI,CAAC,GAAQ,CAAC,GAAQ,EAAK,SAAW,GAAK,EAAK,SAAW,EACzD,MAAO,GAGT,IAAM,EAAY,KAAK,IAAI,EAAK,OAAQ,EAAK,MAAM,EAInD,OAHI,KAAK,IAAI,EAAK,OAAQ,EAAK,MAAM,EAAI,IAAM,EAAa,EACnD,EAED,EAAU,EAAM,CAAI,EAAI,IAAO,CACzC,CAEA,SAAS,EACP,EACA,EACA,EACA,EACiB,CACjB,IAAM,EAA8B,CAAC,EACrC,IAAK,IAAM,KAAW,EAAgB,CACpC,IAAM,EAAY,EAAQ,MAAM,CAAI,EAC9B,EAAY,EAAQ,MAAM,CAAI,EAC9B,EAAe,EAAY,EAAQ,UAAU,EAAY,CAAS,EACxE,GAAI,EAAY,EAAc,CAC5B,IAAM,EAAO,EAAK,MAAQ,cAC1B,EAAW,KAAK,CACd,KAAM,sBACN,OAAQ,EAAQ,OAChB,OACA,aAAc,EACd,UAAW,EAAK,UAChB,QAAS,EAAK,QACd,YACA,YACA,eACA,QACE,GAAG,EAAK,GAAG,EAAK,UAAU,GAAG,EAAK,QAAQ,GAAG,EAAK,IAAI,EAAQ,OAAO,YAClE,EAAQ,OAAO,CAAS,EAAE,MAAM,EAAQ,OAAO,CAAS,EAAE,eAAe,EAAQ,OAAO,CAAY,EAAE,KACzG,EAAQ,WACZ,CAAC,CACH,CACF,CACA,OAAO,CACT,CAEA,SAAS,EAAiB,EAAc,EAAqB,EAAoD,CAC/G,IAAM,EAA8B,CAAC,EACrC,IAAK,IAAM,KAAS,EAAoB,CACtC,IAAM,EAAY,EAAM,MAAM,CAAE,EAC1B,EAAe,EAAM,MAAM,CAAU,EAC3C,GAAI,EAAY,EAAc,CAC5B,IAAM,EAAO,EAAG,MAAQ,cACxB,EAAW,KAAK,CACd,KAAM,eACN,OAAQ,EAAM,OACd,OACA,aAAc,EACd,UAAW,EAAG,UACd,QAAS,EAAG,QACZ,YACA,eACA,QACE,GAAG,EAAK,GAAG,EAAG,UAAU,GAAG,EAAG,QAAQ,gBAAgB,EAAK,IAAI,EAAM,OAAO,GAAG,EAAU,8BAC3D,EAAa,IAAI,EAAM,aACzD,CAAC,CACH,CACF,CACA,OAAO,CACT,CAWA,SAAS,EACP,EACA,EACA,EACA,EACiB,CACjB,GAAM,CAAE,cAAa,eAAgB,EACrC,GAAI,CAAC,GAAe,CAAC,GAAe,CAAC,EACnC,MAAO,CAAC,EAEV,IAAM,EAA8B,CAAC,EAC/B,EAAa,EAAQ,UAErB,EAAyB,EAAmB,KAC/C,GACC,EAAU,OAAS,EAAK,MACxB,EAAU,SAAW,yBACpB,EAAU,OAAS,uBAAyB,EAAU,OAAS,iBAChE,EAAU,YAAc,EAAY,sBACxC,EACM,EAAsB,EAAY,uBAAyB,EAAW,oBAC5E,GAAI,CAAC,GAA0B,EAAY,uBAAyB,EAAqB,CACvF,IAAM,EAAQ,EAAwB,EAAY,SAAS,EACrD,EAAY,GAAO,WAAa,EAChC,EAAU,GAAO,SAAW,EAAY,MAAM,MACpD,EAAW,KAAK,CACd,KAAM,kBACN,OAAQ,gCACR,KAAM,EAAK,KACX,aAAc,GAAO,MAAQ,IAAA,GAC7B,YACA,UACA,UAAW,EAAY,uBACvB,UAAW,EAAY,uBACvB,aAAc,EACd,QACE,GAAG,EAAK,KAAK,GAAG,EAAU,GAAG,EAAQ,iDAClC,EAAY,uBAAuB,MAAM,EAAY,uBAAuB,eAChE,EAAoB,gDACxB,EAAQ,KAAK,EAAM,MAAQ,cAAc,GAAK,GAAG,EAChE,CAAC,CACH,CAEA,IAAM,EAAkB,EAAY,UAAY,EAAW,SAkB3D,OAjBI,EAAY,UAAY,GAC1B,EAAW,KAAK,CACd,KAAM,kBACN,OAAQ,YACR,KAAM,EAAK,KACX,UAAW,EACX,QAAS,EAAY,MAAM,MAC3B,UAAW,EAAY,UACvB,UAAW,EAAY,UACvB,aAAc,EACd,QACE,GAAG,EAAK,KAAK,KAAK,EAAY,MAAM,MAAM,kEACvC,EAAY,UAAU,MAAM,EAAY,UAAU,eAAe,EAAgB,+EAExF,CAAC,EAGI,CACT,CAEA,SAAS,EAAwB,EAA2D,CAC1F,IAAI,EACJ,IAAK,IAAM,KAAM,GACX,CAAC,GAAS,EAAG,oBAAsB,EAAM,uBAC3C,EAAQ,GAGZ,OAAO,CACT,CAOA,SAAS,EAAiB,EAAqB,EAA6C,CAC1F,IAAM,EAAe,EAAK,wBAA0B,EAAW,eAC/D,GAAI,EAAK,yBAA2B,EAClC,MAAO,CAAC,EAEV,IAAM,EAAW,EAAK,oBAAoB,MAAM,EAAG,CAAC,CAAC,CAAC,KAAK,IAAI,EACzD,EAAU,EAAK,aAAa,MAAM,OAAS,EACjD,MAAO,CACL,CACE,KAAM,cACN,OAAQ,mBACR,KAAM,EAAK,KACX,UAAW,EACX,UACA,UAAW,EAAK,wBAChB,UAAW,EAAK,wBAChB,eACA,QACE,GAAG,EAAK,KAAK,KAAK,EAAQ,+BAA+B,EAAK,wBAAwB,MACnF,EAAK,wBAAwB,eAAe,EAAa,gBACzD,EAAW,YAAY,IAAa,qBAAqB,gCAChE,CACF,CACF"}

package/dist/scan.cjs

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

package/dist/scan.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"scan.cjs","names":["os","path","stat","realpath","lstat","NativeAddonError","readdir","readFile","measureCode","measureCodeWithCrossFileData","measureCrossFileDuplication","detectLanguage"],"sources":["../src/scan.ts"],"sourcesContent":["import { lstat, readdir, readFile, realpath, stat } from 'node:fs/promises';\nimport os from 'node:os';\nimport path from 'node:path';\nimport { measureCrossFileDuplication, type CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport type { CrossFileDuplicationFileData } from './duplication.js';\nimport { detectLanguage } from './languages.js';\nimport { measureCode, measureCodeWithCrossFileData } from './metrics.js';\nimport { NativeAddonError } from './nativeMetrics.js';\nimport type { CodeMetrics, DuplicationOptions, LanguageName, MeasureOptions } from './types.js';\n\n/** The scan settings shared by every command (a structural subset of each command's options). */\nexport interface ScanOptions {\n  duplication: Required<DuplicationOptions>;\n  includeTests: boolean;\n}\n\nexport interface FileMetrics {\n  file: string;\n  metrics: CodeMetrics;\n  /** Cross-file duplicate candidates and token/statement data, collected only for directory scans. */\n  duplicationCandidates?: CrossFileDuplicationFileData;\n}\n\nexport interface ScanResult {\n  crossFileDuplication?: CrossFileDuplicationMetrics;\n  displayRoot: string;\n  errors: string[];\n  /** Non-fatal degradations (e.g. cross-file candidates unavailable); the file is still measured. */\n  warnings: string[];\n  fatalError?: string;\n  files: FileMetrics[];\n}\n\nconst ignoredDirectoryNames = new Set([\n  '.agents',\n  '.claude',\n  '.cursor',\n  '.git',\n  '.next',\n  '.playwright-cli',\n  '.tox',\n  '.tmp',\n  '.turbo',\n  '.venv',\n  '.yarn',\n  '__fixtures__',\n  '__generated__',\n  '__pycache__',\n  'coverage',\n  'dist',\n  'fixtures',\n  'generated',\n  'node_modules',\n  // .NET SDK intermediate output (generated sources such as `*.GlobalUsings.g.cs`).\n  'obj',\n  'target',\n  'test-fixtures',\n  'vendor',\n  'venv',\n]);\n\nconst testDirectoryNames = new Set(['__tests__', 'test', 'tests', 'spec']);\nconst testFilePattern = /(?:^test(?:[_-].*)?|\\.(?:spec|test)|[_-](?:test|spec))\\.[^.]+$/iu;\n// JUnit (Java/Kotlin) and xUnit/NUnit (C#) tests use case-sensitive `Test`/`Tests` class-name\n// suffixes; case-insensitive matching would catch production files like `contest.java`.\nconst suffixTestFilePattern = /Tests?\\.(?:java|kt|cs)$/u;\n\nexport function resolveTarget(target: string): string {\n  if (target === '~') {\n    return os.homedir();\n  }\n\n  if (target.startsWith('~/')) {\n    return path.join(os.homedir(), target.slice(2));\n  }\n\n  return path.resolve(target);\n}\n\n/** Returns the directory from which the config file search should start (the target itself if it is a directory). */\nexport async function configSearchDirectory(target: string): Promise<string> {\n  try {\n    const targetStat = await stat(target);\n    return targetStat.isDirectory() ? target : path.dirname(target);\n  } catch {\n    return path.dirname(target);\n  }\n}\n\n/** Shared state of one scan, threaded through the directory walk instead of positional plumbing. */\ninterface ScanContext {\n  options: ScanOptions;\n  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\nexport async function scanTarget(target: string, options: ScanOptions): 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    try {\n      await measureFile(canonicalTarget, language, 'single-file', context, canonicalTarget);\n    } catch (error) {\n      return toFatalResult(error, displayRoot, files, errors, warnings);\n    }\n    return { displayRoot, files, errors, warnings };\n  }\n\n  try {\n    await scanDirectory(canonicalTarget, makeScanContext(options, files, errors, warnings, canonicalTarget));\n  } catch (error) {\n    return toFatalResult(error, canonicalTarget, files, errors, warnings);\n  }\n  return { displayRoot: canonicalTarget, files, errors, warnings };\n}\n\n/**\n * Measures an explicit list of repository-relative files (the diff gate's git-visible allowlist)\n * instead of walking the directory tree, so ignored artifact directories are never parsed. Paths\n * outside the scan scope (ignored/test directories, unsupported or test file names) are skipped\n * with the same rules as the walk.\n */\nexport async function scanListedFiles(\n  rootDirectory: string,\n  relativePaths: Iterable<string>,\n  options: ScanOptions\n): Promise<ScanResult> {\n  const files: FileMetrics[] = [];\n  const errors: string[] = [];\n  const warnings: string[] = [];\n  const context = makeScanContext(options, files, errors, warnings, rootDirectory);\n  for (const relativePath of relativePaths) {\n    const language = isScannedPath(relativePath, options) ? getLanguage(relativePath, options) : undefined;\n    if (!language) {\n      continue;\n    }\n    const absolutePath = path.join(rootDirectory, relativePath);\n    // Symbolic links are not source files: git stores only their target string, so measuring\n    // through them would diverge from what any revision of the repository actually contains.\n    const stats = await lstat(absolutePath).catch(() => {});\n    if (stats?.isSymbolicLink()) {\n      continue;\n    }\n    try {\n      await measureFile(absolutePath, language, 'directory', context);\n    } catch (error) {\n      return toFatalResult(error, rootDirectory, files, errors, warnings);\n    }\n  }\n  return { displayRoot: rootDirectory, files, errors, warnings };\n}\n\n/** A run-wide failure (a missing native addon) as a fatal result; anything else keeps throwing. */\nfunction toFatalResult(\n  error: unknown,\n  displayRoot: string,\n  files: FileMetrics[],\n  errors: string[],\n  warnings: string[]\n): ScanResult {\n  if (!(error instanceof NativeAddonError)) {\n    throw error;\n  }\n  const fatalError = formatError(error);\n  // Errors the walk accumulated before the fatal failure stay reported alongside it.\n  return { displayRoot, files, errors: [...errors, fatalError], warnings, fatalError };\n}\n\nfunction makeScanContext(\n  options: ScanOptions,\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\n/** Runs a filesystem operation, recording a scan error and returning undefined when it fails. */\nasync function tryFileSystem<T>(\n  operation: () => Promise<T>,\n  target: string,\n  context: ScanContext\n): Promise<T | undefined> {\n  try {\n    return await operation();\n  } catch (error) {\n    context.errors.push(`${formatPath(target, context.rootDirectory)}: ${formatError(error)}`);\n    return undefined;\n  }\n}\n\n/** Resolves the path (recording errors); undefined when that fails or the result escapes the root. */\nasync function resolveWithinRoot(target: string, context: ScanContext): Promise<string | undefined> {\n  const resolved = await tryFileSystem(() => realpath(target), target, context);\n  return resolved !== undefined && isWithinDirectory(resolved, context.rootDirectory) ? resolved : undefined;\n}\n\nasync function scanDirectory(directory: string, context: ScanContext): Promise<void> {\n  const resolvedDirectory = await resolveWithinRoot(directory, context);\n  if (resolvedDirectory === undefined || context.visitedDirectories.has(resolvedDirectory)) {\n    return;\n  }\n  context.visitedDirectories.add(resolvedDirectory);\n\n  const entries = await tryFileSystem(() => readdir(directory, { withFileTypes: true }), directory, context);\n  if (entries === undefined) {\n    return;\n  }\n\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  const resolvedPath = await resolveWithinRoot(entryPath, context);\n  if (resolvedPath === undefined) {\n    return;\n  }\n\n  const entryStat = await tryFileSystem(() => stat(entryPath), entryPath, context);\n  if (entryStat === undefined) {\n    return;\n  }\n\n  if (entryStat.isDirectory()) {\n    if (\n      shouldSkipDirectory(name, context.options) ||\n      shouldSkipDirectory(path.basename(resolvedPath), context.options)\n    ) {\n      return;\n    }\n    await scanDirectory(entryPath, context);\n    return;\n  }\n\n  if (entryStat.isFile()) {\n    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    // Only directory scans compare files against each other; a single-file target has no peers.\n    if (mode === 'single-file') {\n      context.files.push({ file, metrics: measureCode(code, measureOptions) });\n      return;\n    }\n    const { metrics, crossFileData, crossFileError } = measureWithCrossFileData(code, measureOptions);\n    if (crossFileError !== undefined) {\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: ${crossFileError}`\n      );\n    }\n    context.files.push({ file, metrics, duplicationCandidates: crossFileData });\n  } catch (error) {\n    // A missing native addon fails every file identically: propagate it once as a fatal scan\n    // error instead of recording one \"skipped\" entry per file behind a successful exit code.\n    if (error instanceof NativeAddonError) {\n      throw error;\n    }\n    context.errors.push(`${formatPath(file, context.rootDirectory)}: ${formatError(error)}`);\n  }\n}\n\n/**\n * Measures a file together with its cross-file contribution from one parse. The contribution is\n * auxiliary: if collecting it fails where plain measurement succeeds (e.g. a payload too large to\n * cross the addon boundary), the metrics are still returned with the failure message, which\n * callers report as a warning rather than an error.\n */\nexport function measureWithCrossFileData(\n  code: string,\n  measureOptions: MeasureOptions\n): { metrics: CodeMetrics; crossFileData?: CrossFileDuplicationFileData; crossFileError?: string } {\n  try {\n    return measureCodeWithCrossFileData(code, measureOptions);\n  } catch (error) {\n    if (error instanceof NativeAddonError) {\n      throw error;\n    }\n    return { metrics: measureCode(code, measureOptions), crossFileError: formatError(error) };\n  }\n}\n\n/** Runs after the scan so every measured file's candidates participate. */\nexport function addCrossFileDuplication(result: ScanResult, options: ScanOptions): void {\n  if (result.fatalError || result.files.length < 2) {\n    return;\n  }\n  const sourceFiles = result.files.flatMap(({ file, duplicationCandidates }) =>\n    duplicationCandidates ? [{ file: formatPath(file, result.displayRoot), ...duplicationCandidates }] : []\n  );\n  if (sourceFiles.length < 2) {\n    return;\n  }\n  result.crossFileDuplication = measureCrossFileDuplication(sourceFiles, options.duplication);\n}\n\n/**\n * Distinct 1-based code lines covered by within-file or cross-file duplicated content. Both\n * sources expose the exact lines carrying matched tokens (never block bounding ranges, which\n * would over-count comment/blank lines and the unmatched gap of a merged clone), so the union is\n * a subset of the file's code lines and a ratio derived over code lines can never exceed 1.\n */\nexport function collectDuplicatedLineNumbers(\n  metrics: CodeMetrics | undefined,\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  formattedFile: string\n): Set<number> {\n  const lines = new Set(metrics?.duplication.duplicateLineNumbers);\n  // Object.hasOwn: a file named like an Object.prototype member must not read an inherited value.\n  const crossFileLines =\n    crossFileDuplication && Object.hasOwn(crossFileDuplication.duplicateLineNumbersByFile, formattedFile)\n      ? (crossFileDuplication.duplicateLineNumbersByFile[formattedFile] ?? [])\n      : [];\n  for (const line of crossFileLines) {\n    lines.add(line);\n  }\n  return lines;\n}\n\nfunction shouldSkipDirectory(name: string, options: ScanOptions): boolean {\n  if (ignoredDirectoryNames.has(name)) {\n    return true;\n  }\n\n  if (options.includeTests) {\n    return false;\n  }\n\n  return testDirectoryNames.has(name);\n}\n\nfunction isWithinDirectory(candidate: string, directory: string): boolean {\n  const relative = path.relative(directory, candidate);\n  return relative === '' || (relative !== '..' && !relative.startsWith(`..${path.sep}`) && !path.isAbsolute(relative));\n}\n\n/**\n * Whether a repository-relative path would be scanned: no ignored or excluded-test directory\n * segment and a supported, non-test file name. The diff gate uses this for base-revision\n * eligibility, so code renamed into scan scope gates as new code instead of ratcheting against\n * a blob the scanner would never have measured.\n */\nexport function isScannedPath(relativePath: string, options: ScanOptions): boolean {\n  const segments = relativePath.split('/');\n  for (const segment of segments.slice(0, -1)) {\n    if (ignoredDirectoryNames.has(segment) || (!options.includeTests && testDirectoryNames.has(segment))) {\n      return false;\n    }\n  }\n  return getLanguage(relativePath, options) !== undefined;\n}\n\nexport function getLanguage(file: string, options: ScanOptions, explicitTarget = false): LanguageName | undefined {\n  const lowerFile = file.toLowerCase();\n  if (\n    !explicitTarget &&\n    (lowerFile.endsWith('.d.ts') ||\n      lowerFile.endsWith('.d.mts') ||\n      lowerFile.endsWith('.d.cts') ||\n      lowerFile.endsWith('.min.js') ||\n      lowerFile.endsWith('.pnp.cjs'))\n  ) {\n    return undefined;\n  }\n\n  if (\n    !explicitTarget &&\n    !options.includeTests &&\n    (testFilePattern.test(path.basename(file)) || suffixTestFilePattern.test(path.basename(file)))\n  ) {\n    return undefined;\n  }\n\n  return detectLanguage(file);\n}\n\nexport function formatPath(file: string, base: string): string {\n  return path.relative(base, file) || path.basename(file);\n}\n\nexport function writeStdout(message: string): void {\n  process.stdout.write(message);\n}\n\nexport function writeStderr(message: string): void {\n  process.stderr.write(message);\n}\n\nexport function formatError(error: unknown): string {\n  return error instanceof Error ? error.message : String(error);\n}\n"],"mappings":"sTAiCA,MAAM,EAAwB,IAAI,IAAI,CACpC,UACA,UACA,UACA,OACA,QACA,kBACA,OACA,OACA,SACA,QACA,QACA,eACA,gBACA,cACA,WACA,OACA,WACA,YACA,eAEA,MACA,SACA,gBACA,SACA,MACF,CAAC,EAEK,EAAqB,IAAI,IAAI,CAAC,YAAa,OAAQ,QAAS,MAAM,CAAC,EACnE,EAAkB,mEAGlB,EAAwB,2BAE9B,SAAgB,EAAc,EAAwB,CASpD,OARI,IAAW,IACNA,EAAAA,QAAG,QAAQ,EAGhB,EAAO,WAAW,IAAI,EACjBC,EAAAA,QAAK,KAAKD,EAAAA,QAAG,QAAQ,EAAG,EAAO,MAAM,CAAC,CAAC,EAGzCC,EAAAA,QAAK,QAAQ,CAAM,CAC5B,CAGA,eAAsB,EAAsB,EAAiC,CAC3E,GAAI,CAEF,OAAO,MAAA,EADkBC,EAAAA,KAAAA,CAAK,CAAM,EAAA,CAClB,YAAY,EAAI,EAASD,EAAAA,QAAK,QAAQ,CAAM,CAChE,MAAQ,CACN,OAAOA,EAAAA,QAAK,QAAQ,CAAM,CAC5B,CACF,CAcA,eAAsB,EAAW,EAAgB,EAA2C,CAC1F,IAAM,EAAuB,CAAC,EACxB,EAAmB,CAAC,EACpB,EAAqB,CAAC,EACxB,EAAkB,EACtB,GAAI,CACF,EAAkB,MAAA,EAAME,EAAAA,SAAAA,CAAS,CAAM,CACzC,MAAQ,CAER,CAEA,IAAM,EAAsBF,EAAAA,QAAK,QAAQ,CAAe,EACpD,EAEJ,GAAI,CACF,EAAa,MAAA,EAAMC,EAAAA,KAAAA,CAAK,CAAe,CACzC,OAAS,EAAO,CACd,IAAM,EAAa,GAAG,EAAW,EAAiB,CAAmB,EAAE,IAAI,EAAY,CAAK,IAC5F,MAAO,CAAE,YAAa,EAAqB,QAAO,OAAQ,CAAC,CAAU,EAAG,WAAU,YAAW,CAC/F,CAEA,GAAI,EAAW,OAAO,EAAG,CACvB,IAAM,EAAcD,EAAAA,QAAK,QAAQ,CAAe,EAC1C,EAAW,EAAY,EAAiB,EAAS,EAAI,EAC3D,GAAI,CAAC,EAAU,CACb,IAAM,EAAa,GAAG,EAAW,EAAiB,CAAW,EAAE,yBAC/D,MAAO,CAAE,cAAa,QAAO,OAAQ,CAAC,CAAU,EAAG,WAAU,YAAW,CAC1E,CAEA,IAAM,EAAU,EAAgB,EAAS,EAAO,EAAQ,EAAU,CAAW,EAC7E,GAAI,CACF,MAAM,EAAY,EAAiB,EAAU,cAAe,EAAS,CAAe,CACtF,OAAS,EAAO,CACd,OAAO,EAAc,EAAO,EAAa,EAAO,EAAQ,CAAQ,CAClE,CACA,MAAO,CAAE,cAAa,QAAO,SAAQ,UAAS,CAChD,CAEA,GAAI,CACF,MAAM,EAAc,EAAiB,EAAgB,EAAS,EAAO,EAAQ,EAAU,CAAe,CAAC,CACzG,OAAS,EAAO,CACd,OAAO,EAAc,EAAO,EAAiB,EAAO,EAAQ,CAAQ,CACtE,CACA,MAAO,CAAE,YAAa,EAAiB,QAAO,SAAQ,UAAS,CACjE,CAQA,eAAsB,EACpB,EACA,EACA,EACqB,CACrB,IAAM,EAAuB,CAAC,EACxB,EAAmB,CAAC,EACpB,EAAqB,CAAC,EACtB,EAAU,EAAgB,EAAS,EAAO,EAAQ,EAAU,CAAa,EAC/E,IAAK,IAAM,KAAgB,EAAe,CACxC,IAAM,EAAW,EAAc,EAAc,CAAO,EAAI,EAAY,EAAc,CAAO,EAAI,IAAA,GAC7F,GAAI,CAAC,EACH,SAEF,IAAM,EAAeA,EAAAA,QAAK,KAAK,EAAe,CAAY,EAI1D,KAAI,MAAA,EADgBG,EAAAA,MAAAA,CAAM,CAAY,CAAC,CAAC,UAAY,CAAC,CAAC,EAAA,EAC3C,eAAe,EAG1B,GAAI,CACF,MAAM,EAAY,EAAc,EAAU,YAAa,CAAO,CAChE,OAAS,EAAO,CACd,OAAO,EAAc,EAAO,EAAe,EAAO,EAAQ,CAAQ,CACpE,CACF,CACA,MAAO,CAAE,YAAa,EAAe,QAAO,SAAQ,UAAS,CAC/D,CAGA,SAAS,EACP,EACA,EACA,EACA,EACA,EACY,CACZ,GAAI,EAAE,aAAiBC,EAAAA,kBACrB,MAAM,EAER,IAAM,EAAa,EAAY,CAAK,EAEpC,MAAO,CAAE,cAAa,QAAO,OAAQ,CAAC,GAAG,EAAQ,CAAU,EAAG,WAAU,YAAW,CACrF,CAEA,SAAS,EACP,EACA,EACA,EACA,EACA,EACa,CACb,MAAO,CAAE,UAAS,QAAO,SAAQ,WAAU,mBAAoB,IAAI,IAAO,aAAc,IAAI,IAAO,eAAc,CACnH,CAGA,eAAe,EACb,EACA,EACA,EACwB,CACxB,GAAI,CACF,OAAO,MAAM,EAAU,CACzB,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAQ,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EACzF,MACF,CACF,CAGA,eAAe,EAAkB,EAAgB,EAAmD,CAClG,IAAM,EAAW,MAAM,OAAA,EAAoBF,EAAAA,SAAAA,CAAS,CAAM,EAAG,EAAQ,CAAO,EAC5E,OAAO,IAAa,IAAA,IAAa,EAAkB,EAAU,EAAQ,aAAa,EAAI,EAAW,IAAA,EACnG,CAEA,eAAe,EAAc,EAAmB,EAAqC,CACnF,IAAM,EAAoB,MAAM,EAAkB,EAAW,CAAO,EACpE,GAAI,IAAsB,IAAA,IAAa,EAAQ,mBAAmB,IAAI,CAAiB,EACrF,OAEF,EAAQ,mBAAmB,IAAI,CAAiB,EAEhD,IAAM,EAAU,MAAM,OAAA,EAAoBG,EAAAA,QAAAA,CAAQ,EAAW,CAAE,cAAe,EAAK,CAAC,EAAG,EAAW,CAAO,EACrG,OAAY,IAAA,GAIhB,IAAK,IAAM,KAAS,EAAS,CAC3B,IAAM,EAAYL,EAAAA,QAAK,KAAK,EAAW,EAAM,IAAI,EACjD,GAAI,EAAM,eAAe,EAAG,CAC1B,MAAM,EAAiB,EAAM,KAAM,EAAW,CAAO,EACrD,QACF,CAEA,GAAI,EAAM,YAAY,EAAG,CACvB,GAAI,EAAoB,EAAM,KAAM,EAAQ,OAAO,EACjD,SAEF,MAAM,EAAc,EAAW,CAAO,EACtC,QACF,CAEI,EAAM,OAAO,GACf,MAAM,EAAqB,EAAW,CAAO,CAEjD,CACF,CAEA,eAAe,EAAiB,EAAc,EAAmB,EAAqC,CACpG,IAAM,EAAe,MAAM,EAAkB,EAAW,CAAO,EAC/D,GAAI,IAAiB,IAAA,GACnB,OAGF,IAAM,EAAY,MAAM,OAAA,EAAoBC,EAAAA,KAAAA,CAAK,CAAS,EAAG,EAAW,CAAO,EAC3E,OAAc,IAAA,GAIlB,IAAI,EAAU,YAAY,EAAG,CAC3B,GACE,EAAoB,EAAM,EAAQ,OAAO,GACzC,EAAoBD,EAAAA,QAAK,SAAS,CAAY,EAAG,EAAQ,OAAO,EAEhE,OAEF,MAAM,EAAc,EAAW,CAAO,EACtC,MACF,CAEI,EAAU,OAAO,GACnB,MAAM,EAAqB,EAAW,EAAS,EAAc,CAAY,CAH3E,CAKF,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,MAAA,EAAME,EAAAA,SAAAA,CAAS,CAAI,EACrD,GAAI,EAAQ,aAAa,IAAI,CAAY,EACvC,OAEF,EAAQ,aAAa,IAAI,CAAY,EAErC,IAAM,EAAO,MAAA,EAAMI,EAAAA,SAAAA,CAAS,EAAM,MAAM,EAClC,EAAiB,CAAE,WAAU,YAAa,EAAQ,QAAQ,WAAY,EAE5E,GAAI,IAAS,cAAe,CAC1B,EAAQ,MAAM,KAAK,CAAE,OAAM,QAASC,EAAAA,YAAY,EAAM,CAAc,CAAE,CAAC,EACvE,MACF,CACA,GAAM,CAAE,UAAS,gBAAe,kBAAmB,EAAyB,EAAM,CAAc,EAC5F,IAAmB,IAAA,IAGrB,EAAQ,SAAS,KACf,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,mDAAmD,GAChG,EAEF,EAAQ,MAAM,KAAK,CAAE,OAAM,UAAS,sBAAuB,CAAc,CAAC,CAC5E,OAAS,EAAO,CAGd,GAAI,aAAiBH,EAAAA,iBACnB,MAAM,EAER,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,CACzF,CACF,CAQA,SAAgB,EACd,EACA,EACiG,CACjG,GAAI,CACF,OAAOI,EAAAA,6BAA6B,EAAM,CAAc,CAC1D,OAAS,EAAO,CACd,GAAI,aAAiBJ,EAAAA,iBACnB,MAAM,EAER,MAAO,CAAE,QAASG,EAAAA,YAAY,EAAM,CAAc,EAAG,eAAgB,EAAY,CAAK,CAAE,CAC1F,CACF,CAGA,SAAgB,EAAwB,EAAoB,EAA4B,CACtF,GAAI,EAAO,YAAc,EAAO,MAAM,OAAS,EAC7C,OAEF,IAAM,EAAc,EAAO,MAAM,SAAS,CAAE,OAAM,2BAChD,EAAwB,CAAC,CAAE,KAAM,EAAW,EAAM,EAAO,WAAW,EAAG,GAAG,CAAsB,CAAC,EAAI,CAAC,CACxG,EACI,EAAY,OAAS,IAGzB,EAAO,qBAAuBE,EAAAA,4BAA4B,EAAa,EAAQ,WAAW,EAC5F,CAQA,SAAgB,EACd,EACA,EACA,EACa,CACb,IAAM,EAAQ,IAAI,IAAI,GAAS,YAAY,oBAAoB,EAEzD,EACJ,GAAwB,OAAO,OAAO,EAAqB,2BAA4B,CAAa,EAC/F,EAAqB,2BAA2B,IAAkB,CAAC,EACpE,CAAC,EACP,IAAK,IAAM,KAAQ,EACjB,EAAM,IAAI,CAAI,EAEhB,OAAO,CACT,CAEA,SAAS,EAAoB,EAAc,EAA+B,CASxE,OARI,EAAsB,IAAI,CAAI,EACzB,GAGT,CAAI,EAAQ,cAIL,EAAmB,IAAI,CAAI,CACpC,CAEA,SAAS,EAAkB,EAAmB,EAA4B,CACxE,IAAM,EAAWT,EAAAA,QAAK,SAAS,EAAW,CAAS,EACnD,OAAO,IAAa,IAAO,IAAa,MAAQ,CAAC,EAAS,WAAW,KAAKA,EAAAA,QAAK,KAAK,GAAK,CAACA,EAAAA,QAAK,WAAW,CAAQ,CACpH,CAQA,SAAgB,EAAc,EAAsB,EAA+B,CACjF,IAAM,EAAW,EAAa,MAAM,GAAG,EACvC,IAAK,IAAM,KAAW,EAAS,MAAM,EAAG,EAAE,EACxC,GAAI,EAAsB,IAAI,CAAO,GAAM,CAAC,EAAQ,cAAgB,EAAmB,IAAI,CAAO,EAChG,MAAO,GAGX,OAAO,EAAY,EAAc,CAAO,IAAM,IAAA,EAChD,CAEA,SAAgB,EAAY,EAAc,EAAsB,EAAiB,GAAiC,CAChH,IAAM,EAAY,EAAK,YAAY,EAEjC,MAAC,IACA,EAAU,SAAS,OAAO,GACzB,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,SAAS,GAC5B,EAAU,SAAS,UAAU,MAM9B,GACA,EAAQ,cACR,GAAgB,KAAKA,EAAAA,QAAK,SAAS,CAAI,CAAC,GAAK,GAAsB,KAAKA,EAAAA,QAAK,SAAS,CAAI,CAAC,GAK9F,OAAOU,EAAAA,eAAe,CAAI,CAC5B,CAEA,SAAgB,EAAW,EAAc,EAAsB,CAC7D,OAAOV,EAAAA,QAAK,SAAS,EAAM,CAAI,GAAKA,EAAAA,QAAK,SAAS,CAAI,CACxD,CAEA,SAAgB,EAAY,EAAuB,CACjD,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAgB,EAAY,EAAuB,CACjD,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAgB,EAAY,EAAwB,CAClD,OAAO,aAAiB,MAAQ,EAAM,QAAU,OAAO,CAAK,CAC9D"}
+{"version":3,"file":"scan.cjs","names":["os","path","stat","realpath","lstat","readdir","readFile","measureCode","NativeAddonError","measureCodeWithCrossFileDataAsync","measureCrossFileDuplication","detectLanguage"],"sources":["../src/scan.ts"],"sourcesContent":["import { lstat, readdir, readFile, realpath, stat } from 'node:fs/promises';\nimport os from 'node:os';\nimport path from 'node:path';\nimport { measureCrossFileDuplication, type CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport type { CrossFileDuplicationFileData } from './duplication.js';\nimport { detectLanguage } from './languages.js';\nimport { measureCode, measureCodeWithCrossFileDataAsync } from './metrics.js';\nimport { NativeAddonError } from './nativeMetrics.js';\nimport type { CodeMetrics, DuplicationOptions, LanguageName, MeasureOptions } from './types.js';\n\n/** The scan settings shared by every command (a structural subset of each command's options). */\nexport interface ScanOptions {\n  duplication: Required<DuplicationOptions>;\n  includeTests: boolean;\n}\n\nexport interface FileMetrics {\n  file: string;\n  metrics: CodeMetrics;\n  /** Cross-file duplicate candidates and token/statement data, collected only for directory scans. */\n  duplicationCandidates?: CrossFileDuplicationFileData;\n}\n\nexport interface ScanResult {\n  crossFileDuplication?: CrossFileDuplicationMetrics;\n  displayRoot: string;\n  errors: string[];\n  /** Non-fatal degradations (e.g. cross-file candidates unavailable); the file is still measured. */\n  warnings: string[];\n  fatalError?: string;\n  files: FileMetrics[];\n}\n\nconst ignoredDirectoryNames = new Set([\n  '.agents',\n  '.claude',\n  '.cursor',\n  '.git',\n  '.next',\n  '.playwright-cli',\n  '.tox',\n  '.tmp',\n  '.turbo',\n  '.venv',\n  '.yarn',\n  '__fixtures__',\n  '__generated__',\n  '__pycache__',\n  'coverage',\n  'dist',\n  'fixtures',\n  'generated',\n  'node_modules',\n  // .NET SDK intermediate output (generated sources such as `*.GlobalUsings.g.cs`).\n  'obj',\n  'target',\n  'test-fixtures',\n  'vendor',\n  'venv',\n]);\n\nconst testDirectoryNames = new Set(['__tests__', 'test', 'tests', 'spec']);\nconst testFilePattern = /(?:^test(?:[_-].*)?|\\.(?:spec|test)|[_-](?:test|spec))\\.[^.]+$/iu;\n// JUnit (Java/Kotlin) and xUnit/NUnit (C#) tests use case-sensitive `Test`/`Tests` class-name\n// suffixes; case-insensitive matching would catch production files like `contest.java`.\nconst suffixTestFilePattern = /Tests?\\.(?:java|kt|cs)$/u;\n\nexport function resolveTarget(target: string): string {\n  if (target === '~') {\n    return os.homedir();\n  }\n\n  if (target.startsWith('~/')) {\n    return path.join(os.homedir(), target.slice(2));\n  }\n\n  return path.resolve(target);\n}\n\n/** Returns the directory from which the config file search should start (the target itself if it is a directory). */\nexport async function configSearchDirectory(target: string): Promise<string> {\n  try {\n    const targetStat = await stat(target);\n    return targetStat.isDirectory() ? target : path.dirname(target);\n  } catch {\n    return path.dirname(target);\n  }\n}\n\n/** Shared state of one scan, threaded through the directory walk instead of positional plumbing. */\ninterface ScanContext {\n  options: ScanOptions;\n  /**\n   * Outcomes in walk order. Files are measured concurrently, so a measurement is recorded as a\n   * promise here and applied in this order once the walk ends, keeping results deterministic.\n   */\n  outcomes: (ScanOutcome | Promise<ScanOutcome>)[];\n  /** Measurements in flight, bounded so file contents and payloads do not pile up during the walk. */\n  inFlight: Set<Promise<ScanOutcome>>;\n  /** Set once a measurement fails fatally; the walk then starts no further work. */\n  fatalSeen: boolean;\n  visitedDirectories: Set<string>;\n  visitedFiles: Set<string>;\n  /** Scan root: paths are displayed relative to it, and symbolic links may not escape it. */\n  rootDirectory: string;\n}\n\n/**\n * A missing native addon fails every file identically, so it ends the scan as one fatal error\n * instead of one \"skipped\" entry per file behind a successful exit code.\n */\ntype ScanOutcome = { file: FileMetrics; warning?: string } | { error: string } | { fatal: NativeAddonError };\n\n// Twice the addon's worker count keeps its pool busy while finished payloads are parsed.\nconst maxMeasurementsInFlight = os.availableParallelism() * 2;\n\nexport async function scanTarget(target: string, options: ScanOptions): Promise<ScanResult> {\n  let canonicalTarget = target;\n  try {\n    canonicalTarget = await realpath(target);\n  } catch {\n    // stat below reports missing targets with the original path.\n  }\n\n  const fallbackDisplayRoot = path.dirname(canonicalTarget);\n  let targetStat;\n\n  try {\n    targetStat = await stat(canonicalTarget);\n  } catch (error) {\n    const fatalError = `${formatPath(canonicalTarget, fallbackDisplayRoot)}: ${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, displayRoot);\n    await measureFile(canonicalTarget, language, 'single-file', context, canonicalTarget);\n    return settleScan(context, displayRoot);\n  }\n\n  const context = makeScanContext(options, canonicalTarget);\n  await scanDirectory(canonicalTarget, context);\n  return settleScan(context, canonicalTarget);\n}\n\n/**\n * Measures an explicit list of repository-relative files (the diff gate's git-visible allowlist)\n * instead of walking the directory tree, so ignored artifact directories are never parsed. Paths\n * outside the scan scope (ignored/test directories, unsupported or test file names) are skipped\n * with the same rules as the walk.\n */\nexport async function scanListedFiles(\n  rootDirectory: string,\n  relativePaths: Iterable<string>,\n  options: ScanOptions\n): Promise<ScanResult> {\n  const context = makeScanContext(options, rootDirectory);\n  for (const relativePath of relativePaths) {\n    if (context.fatalSeen) {\n      break;\n    }\n    const language = isScannedPath(relativePath, options) ? getLanguage(relativePath, options) : undefined;\n    if (!language) {\n      continue;\n    }\n    const absolutePath = path.join(rootDirectory, relativePath);\n    // Symbolic links are not source files: git stores only their target string, so measuring\n    // through them would diverge from what any revision of the repository actually contains.\n    const stats = await lstat(absolutePath).catch(() => {});\n    if (stats?.isSymbolicLink()) {\n      continue;\n    }\n    await measureFile(absolutePath, language, 'directory', context);\n  }\n  return settleScan(context, rootDirectory);\n}\n\n/** Applies the scan's outcomes in walk order once every measurement has settled. */\nasync function settleScan(context: ScanContext, displayRoot: string): Promise<ScanResult> {\n  const files: FileMetrics[] = [];\n  const errors: string[] = [];\n  const warnings: string[] = [];\n  for (const pending of context.outcomes) {\n    const outcome = await pending;\n    if ('fatal' in outcome) {\n      const fatalError = formatError(outcome.fatal);\n      // Errors the walk recorded before the fatal failure stay reported alongside it.\n      return { displayRoot, files, errors: [...errors, fatalError], warnings, fatalError };\n    }\n    if ('error' in outcome) {\n      errors.push(outcome.error);\n      continue;\n    }\n    files.push(outcome.file);\n    if (outcome.warning !== undefined) {\n      warnings.push(outcome.warning);\n    }\n  }\n  return { displayRoot, files, errors, warnings };\n}\n\nfunction makeScanContext(options: ScanOptions, rootDirectory: string): ScanContext {\n  return {\n    options,\n    outcomes: [],\n    inFlight: new Set(),\n    fatalSeen: false,\n    visitedDirectories: new Set(),\n    visitedFiles: new Set(),\n    rootDirectory,\n  };\n}\n\nfunction recordError(context: ScanContext, target: string, error: unknown): void {\n  context.outcomes.push({ error: `${formatPath(target, context.rootDirectory)}: ${formatError(error)}` });\n}\n\n/** Runs a filesystem operation, recording a scan error and returning undefined when it fails. */\nasync function tryFileSystem<T>(\n  operation: () => Promise<T>,\n  target: string,\n  context: ScanContext\n): Promise<T | undefined> {\n  try {\n    return await operation();\n  } catch (error) {\n    recordError(context, target, error);\n    return undefined;\n  }\n}\n\n/** Resolves the path (recording errors); undefined when that fails or the result escapes the root. */\nasync function resolveWithinRoot(target: string, context: ScanContext): Promise<string | undefined> {\n  const resolved = await tryFileSystem(() => realpath(target), target, context);\n  return resolved !== undefined && isWithinDirectory(resolved, context.rootDirectory) ? resolved : undefined;\n}\n\nasync function scanDirectory(directory: string, context: ScanContext): Promise<void> {\n  const resolvedDirectory = await resolveWithinRoot(directory, context);\n  if (resolvedDirectory === undefined || context.visitedDirectories.has(resolvedDirectory)) {\n    return;\n  }\n  context.visitedDirectories.add(resolvedDirectory);\n\n  const entries = await tryFileSystem(() => readdir(directory, { withFileTypes: true }), directory, context);\n  if (entries === undefined) {\n    return;\n  }\n\n  for (const entry of entries) {\n    if (context.fatalSeen) {\n      return;\n    }\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  const resolvedPath = await resolveWithinRoot(entryPath, context);\n  if (resolvedPath === undefined) {\n    return;\n  }\n\n  const entryStat = await tryFileSystem(() => stat(entryPath), entryPath, context);\n  if (entryStat === undefined) {\n    return;\n  }\n\n  if (entryStat.isDirectory()) {\n    if (\n      shouldSkipDirectory(name, context.options) ||\n      shouldSkipDirectory(path.basename(resolvedPath), context.options)\n    ) {\n      return;\n    }\n    await scanDirectory(entryPath, context);\n    return;\n  }\n\n  if (entryStat.isFile()) {\n    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\n/**\n * Resolves and deduplicates the file in walk order, then starts measuring it concurrently; its\n * outcome is recorded in walk order (see ScanContext.outcomes).\n */\nasync function measureFile(\n  file: string,\n  language: LanguageName,\n  mode: 'single-file' | 'directory',\n  context: ScanContext,\n  realFile?: string\n): Promise<void> {\n  if (context.fatalSeen) {\n    return;\n  }\n  let resolvedFile;\n  try {\n    resolvedFile = realFile ?? (await realpath(file));\n  } catch (error) {\n    recordError(context, file, error);\n    return;\n  }\n  if (context.visitedFiles.has(resolvedFile)) {\n    return;\n  }\n  context.visitedFiles.add(resolvedFile);\n\n  // Any settled measurement frees its slot (removed by the callback below, which runs before the\n  // race resumes), so one slow file never idles the pool.\n  while (context.inFlight.size >= maxMeasurementsInFlight) {\n    await Promise.race(context.inFlight);\n  }\n  const outcome = readAndMeasureFile(file, language, mode, context);\n  context.inFlight.add(outcome);\n  void outcome.then(() => context.inFlight.delete(outcome));\n  context.outcomes.push(outcome);\n}\n\nasync function readAndMeasureFile(\n  file: string,\n  language: LanguageName,\n  mode: 'single-file' | 'directory',\n  context: ScanContext\n): Promise<ScanOutcome> {\n  try {\n    const code = await readFile(file, 'utf8');\n    const measureOptions = { language, duplication: context.options.duplication };\n    // Only directory scans compare files against each other; a single-file target has no peers.\n    if (mode === 'single-file') {\n      return { file: { file, metrics: measureCode(code, measureOptions) } };\n    }\n    const { metrics, crossFileData, crossFileError } = await measureWithCrossFileData(code, measureOptions);\n    return {\n      file: { file, metrics, duplicationCandidates: crossFileData },\n      // A warning, not an error: the file's metrics are complete, only its participation in\n      // cross-file matching is lost, so it is not \"skipped\" and must not fail --fail-on-error.\n      warning:\n        crossFileError === undefined\n          ? undefined\n          : `${formatPath(file, context.rootDirectory)}: cross-file duplication candidates unavailable: ${crossFileError}`,\n    };\n  } catch (error) {\n    if (error instanceof NativeAddonError) {\n      context.fatalSeen = true;\n      return { fatal: error };\n    }\n    return { error: `${formatPath(file, context.rootDirectory)}: ${formatError(error)}` };\n  }\n}\n\n/**\n * Measures a file together with its cross-file contribution from one parse. The contribution is\n * auxiliary: if collecting it fails where plain measurement succeeds (e.g. a payload too large to\n * cross the addon boundary), the metrics are still returned with the failure message, which\n * callers report as a warning rather than an error.\n */\nexport async function measureWithCrossFileData(\n  code: string,\n  measureOptions: MeasureOptions\n): Promise<{ metrics: CodeMetrics; crossFileData?: CrossFileDuplicationFileData; crossFileError?: string }> {\n  try {\n    return await measureCodeWithCrossFileDataAsync(code, measureOptions);\n  } catch (error) {\n    if (error instanceof NativeAddonError) {\n      throw error;\n    }\n    return { metrics: measureCode(code, measureOptions), crossFileError: formatError(error) };\n  }\n}\n\n/** Runs after the scan so every measured file's candidates participate. */\nexport function addCrossFileDuplication(result: ScanResult, options: ScanOptions): void {\n  if (result.fatalError || result.files.length < 2) {\n    return;\n  }\n  const sourceFiles = result.files.flatMap(({ file, duplicationCandidates }) =>\n    duplicationCandidates ? [{ file: formatPath(file, result.displayRoot), ...duplicationCandidates }] : []\n  );\n  if (sourceFiles.length < 2) {\n    return;\n  }\n  result.crossFileDuplication = measureCrossFileDuplication(sourceFiles, options.duplication);\n}\n\n/**\n * Distinct 1-based code lines covered by within-file or cross-file duplicated content. Both\n * sources expose the exact lines carrying matched tokens (never block bounding ranges, which\n * would over-count comment/blank lines and the unmatched gap of a merged clone), so the union is\n * a subset of the file's code lines and a ratio derived over code lines can never exceed 1.\n */\nexport function collectDuplicatedLineNumbers(\n  metrics: CodeMetrics | undefined,\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  formattedFile: string\n): Set<number> {\n  const lines = new Set(metrics?.duplication.duplicateLineNumbers);\n  // Object.hasOwn: a file named like an Object.prototype member must not read an inherited value.\n  const crossFileLines =\n    crossFileDuplication && Object.hasOwn(crossFileDuplication.duplicateLineNumbersByFile, formattedFile)\n      ? (crossFileDuplication.duplicateLineNumbersByFile[formattedFile] ?? [])\n      : [];\n  for (const line of crossFileLines) {\n    lines.add(line);\n  }\n  return lines;\n}\n\nfunction shouldSkipDirectory(name: string, options: ScanOptions): boolean {\n  if (ignoredDirectoryNames.has(name)) {\n    return true;\n  }\n\n  if (options.includeTests) {\n    return false;\n  }\n\n  return testDirectoryNames.has(name);\n}\n\nfunction isWithinDirectory(candidate: string, directory: string): boolean {\n  const relative = path.relative(directory, candidate);\n  return relative === '' || (relative !== '..' && !relative.startsWith(`..${path.sep}`) && !path.isAbsolute(relative));\n}\n\n/**\n * Whether a repository-relative path would be scanned: no ignored or excluded-test directory\n * segment and a supported, non-test file name. The diff gate uses this for base-revision\n * eligibility, so code renamed into scan scope gates as new code instead of ratcheting against\n * a blob the scanner would never have measured.\n */\nexport function isScannedPath(relativePath: string, options: ScanOptions): boolean {\n  const segments = relativePath.split('/');\n  for (const segment of segments.slice(0, -1)) {\n    if (ignoredDirectoryNames.has(segment) || (!options.includeTests && testDirectoryNames.has(segment))) {\n      return false;\n    }\n  }\n  return getLanguage(relativePath, options) !== undefined;\n}\n\nexport function getLanguage(file: string, options: ScanOptions, explicitTarget = false): LanguageName | undefined {\n  const lowerFile = file.toLowerCase();\n  if (\n    !explicitTarget &&\n    (lowerFile.endsWith('.d.ts') ||\n      lowerFile.endsWith('.d.mts') ||\n      lowerFile.endsWith('.d.cts') ||\n      lowerFile.endsWith('.min.js') ||\n      lowerFile.endsWith('.pnp.cjs'))\n  ) {\n    return undefined;\n  }\n\n  if (\n    !explicitTarget &&\n    !options.includeTests &&\n    (testFilePattern.test(path.basename(file)) || suffixTestFilePattern.test(path.basename(file)))\n  ) {\n    return undefined;\n  }\n\n  return detectLanguage(file);\n}\n\nexport function formatPath(file: string, base: string): string {\n  return path.relative(base, file) || path.basename(file);\n}\n\nexport function writeStdout(message: string): void {\n  process.stdout.write(message);\n}\n\nexport function writeStderr(message: string): void {\n  process.stderr.write(message);\n}\n\nexport function formatError(error: unknown): string {\n  return error instanceof Error ? error.message : String(error);\n}\n"],"mappings":"sTAiCA,MAAM,kBAAwB,IAAI,IAAI,CACpC,UACA,UACA,UACA,OACA,QACA,kBACA,OACA,OACA,SACA,QACA,QACA,eACA,gBACA,cACA,WACA,OACA,WACA,YACA,eAEA,MACA,SACA,gBACA,SACA,MACF,CAAC,EAEK,kBAAqB,IAAI,IAAI,CAAC,YAAa,OAAQ,QAAS,MAAM,CAAC,EACnE,EAAkB,mEAGlB,EAAwB,2BAE9B,SAAgB,EAAc,EAAwB,CASpD,OARI,IAAW,IACNA,EAAAA,QAAG,QAAQ,EAGhB,EAAO,WAAW,IAAI,EACjBC,EAAAA,QAAK,KAAKD,EAAAA,QAAG,QAAQ,EAAG,EAAO,MAAM,CAAC,CAAC,EAGzCC,EAAAA,QAAK,QAAQ,CAAM,CAC5B,CAGA,eAAsB,EAAsB,EAAiC,CAC3E,GAAI,CAEF,OAAO,MAAA,EADkBC,EAAAA,KAAAA,CAAK,CAAM,EAAA,CAClB,YAAY,EAAI,EAASD,EAAAA,QAAK,QAAQ,CAAM,CAChE,MAAQ,CACN,OAAOA,EAAAA,QAAK,QAAQ,CAAM,CAC5B,CACF,CA2BA,MAAM,EAA0BD,EAAAA,QAAG,qBAAqB,EAAI,EAE5D,eAAsB,EAAW,EAAgB,EAA2C,CAC1F,IAAI,EAAkB,EACtB,GAAI,CACF,EAAkB,MAAA,EAAMG,EAAAA,SAAAA,CAAS,CAAM,CACzC,MAAQ,CAER,CAEA,IAAM,EAAsBF,EAAAA,QAAK,QAAQ,CAAe,EACpD,EAEJ,GAAI,CACF,EAAa,MAAA,EAAMC,EAAAA,KAAAA,CAAK,CAAe,CACzC,OAAS,EAAO,CACd,IAAM,EAAa,GAAG,EAAW,EAAiB,CAAmB,EAAE,IAAI,EAAY,CAAK,IAC5F,MAAO,CAAE,YAAa,EAAqB,MAAO,CAAC,EAAG,OAAQ,CAAC,CAAU,EAAG,SAAU,CAAC,EAAG,YAAW,CACvG,CAEA,GAAI,EAAW,OAAO,EAAG,CACvB,IAAM,EAAcD,EAAAA,QAAK,QAAQ,CAAe,EAC1C,EAAW,EAAY,EAAiB,EAAS,EAAI,EAC3D,GAAI,CAAC,EAAU,CACb,IAAM,EAAa,GAAG,EAAW,EAAiB,CAAW,EAAE,yBAC/D,MAAO,CAAE,cAAa,MAAO,CAAC,EAAG,OAAQ,CAAC,CAAU,EAAG,SAAU,CAAC,EAAG,YAAW,CAClF,CAEA,IAAM,EAAU,EAAgB,EAAS,CAAW,EAEpD,OADA,MAAM,EAAY,EAAiB,EAAU,cAAe,EAAS,CAAe,EAC7E,EAAW,EAAS,CAAW,CACxC,CAEA,IAAM,EAAU,EAAgB,EAAS,CAAe,EAExD,OADA,MAAM,EAAc,EAAiB,CAAO,EACrC,EAAW,EAAS,CAAe,CAC5C,CAQA,eAAsB,EACpB,EACA,EACA,EACqB,CACrB,IAAM,EAAU,EAAgB,EAAS,CAAa,EACtD,IAAK,IAAM,KAAgB,EAAe,CACxC,GAAI,EAAQ,UACV,MAEF,IAAM,EAAW,EAAc,EAAc,CAAO,EAAI,EAAY,EAAc,CAAO,EAAI,IAAA,GAC7F,GAAI,CAAC,EACH,SAEF,IAAM,EAAeA,EAAAA,QAAK,KAAK,EAAe,CAAY,GAItD,MAAA,EADgBG,EAAAA,MAAAA,CAAM,CAAY,CAAC,CAAC,UAAY,CAAC,CAAC,EAAA,EAC3C,eAAe,GAG1B,MAAM,EAAY,EAAc,EAAU,YAAa,CAAO,CAChE,CACA,OAAO,EAAW,EAAS,CAAa,CAC1C,CAGA,eAAe,EAAW,EAAsB,EAA0C,CACxF,IAAM,EAAuB,CAAC,EACxB,EAAmB,CAAC,EACpB,EAAqB,CAAC,EAC5B,IAAK,IAAM,KAAW,EAAQ,SAAU,CACtC,IAAM,EAAU,MAAM,EACtB,GAAI,UAAW,EAAS,CACtB,IAAM,EAAa,EAAY,EAAQ,KAAK,EAE5C,MAAO,CAAE,cAAa,QAAO,OAAQ,CAAC,GAAG,EAAQ,CAAU,EAAG,WAAU,YAAW,CACrF,CACA,GAAI,UAAW,EAAS,CACtB,EAAO,KAAK,EAAQ,KAAK,EACzB,QACF,CACA,EAAM,KAAK,EAAQ,IAAI,EACnB,EAAQ,UAAY,IAAA,IACtB,EAAS,KAAK,EAAQ,OAAO,CAEjC,CACA,MAAO,CAAE,cAAa,QAAO,SAAQ,UAAS,CAChD,CAEA,SAAS,EAAgB,EAAsB,EAAoC,CACjF,MAAO,CACL,UACA,SAAU,CAAC,EACX,yBAAU,IAAI,IACd,UAAW,GACX,mCAAoB,IAAI,IACxB,6BAAc,IAAI,IAClB,eACF,CACF,CAEA,SAAS,EAAY,EAAsB,EAAgB,EAAsB,CAC/E,EAAQ,SAAS,KAAK,CAAE,MAAO,GAAG,EAAW,EAAQ,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAI,CAAC,CACxG,CAGA,eAAe,EACb,EACA,EACA,EACwB,CACxB,GAAI,CACF,OAAO,MAAM,EAAU,CACzB,OAAS,EAAO,CACd,EAAY,EAAS,EAAQ,CAAK,EAClC,MACF,CACF,CAGA,eAAe,EAAkB,EAAgB,EAAmD,CAClG,IAAM,EAAW,MAAM,OAAA,EAAoBD,EAAAA,SAAAA,CAAS,CAAM,EAAG,EAAQ,CAAO,EAC5E,OAAO,IAAa,IAAA,IAAa,EAAkB,EAAU,EAAQ,aAAa,EAAI,EAAW,IAAA,EACnG,CAEA,eAAe,EAAc,EAAmB,EAAqC,CACnF,IAAM,EAAoB,MAAM,EAAkB,EAAW,CAAO,EACpE,GAAI,IAAsB,IAAA,IAAa,EAAQ,mBAAmB,IAAI,CAAiB,EACrF,OAEF,EAAQ,mBAAmB,IAAI,CAAiB,EAEhD,IAAM,EAAU,MAAM,OAAA,EAAoBE,EAAAA,QAAAA,CAAQ,EAAW,CAAE,cAAe,EAAK,CAAC,EAAG,EAAW,CAAO,EACrG,OAAY,IAAA,GAIhB,IAAK,IAAM,KAAS,EAAS,CAC3B,GAAI,EAAQ,UACV,OAEF,IAAM,EAAYJ,EAAAA,QAAK,KAAK,EAAW,EAAM,IAAI,EACjD,GAAI,EAAM,eAAe,EAAG,CAC1B,MAAM,EAAiB,EAAM,KAAM,EAAW,CAAO,EACrD,QACF,CAEA,GAAI,EAAM,YAAY,EAAG,CACvB,GAAI,EAAoB,EAAM,KAAM,EAAQ,OAAO,EACjD,SAEF,MAAM,EAAc,EAAW,CAAO,EACtC,QACF,CAEI,EAAM,OAAO,GACf,MAAM,EAAqB,EAAW,CAAO,CAEjD,CACF,CAEA,eAAe,EAAiB,EAAc,EAAmB,EAAqC,CACpG,IAAM,EAAe,MAAM,EAAkB,EAAW,CAAO,EAC/D,GAAI,IAAiB,IAAA,GACnB,OAGF,IAAM,EAAY,MAAM,OAAA,EAAoBC,EAAAA,KAAAA,CAAK,CAAS,EAAG,EAAW,CAAO,EAC3E,OAAc,IAAA,GAIlB,IAAI,EAAU,YAAY,EAAG,CAC3B,GACE,EAAoB,EAAM,EAAQ,OAAO,GACzC,EAAoBD,EAAAA,QAAK,SAAS,CAAY,EAAG,EAAQ,OAAO,EAEhE,OAEF,MAAM,EAAc,EAAW,CAAO,EACtC,MACF,CAEI,EAAU,OAAO,GACnB,MAAM,EAAqB,EAAW,EAAS,EAAc,CAAY,CAH3E,CAKF,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,CAMA,eAAe,EACb,EACA,EACA,EACA,EACA,EACe,CACf,GAAI,EAAQ,UACV,OAEF,IAAI,EACJ,GAAI,CACF,EAAe,GAAa,MAAA,EAAME,EAAAA,SAAAA,CAAS,CAAI,CACjD,OAAS,EAAO,CACd,EAAY,EAAS,EAAM,CAAK,EAChC,MACF,CACA,GAAI,EAAQ,aAAa,IAAI,CAAY,EACvC,OAMF,IAJA,EAAQ,aAAa,IAAI,CAAY,EAI9B,EAAQ,SAAS,MAAQ,GAC9B,MAAM,QAAQ,KAAK,EAAQ,QAAQ,EAErC,IAAM,EAAU,EAAmB,EAAM,EAAU,EAAM,CAAO,EAChE,EAAQ,SAAS,IAAI,CAAO,EAC5B,EAAa,SAAW,EAAQ,SAAS,OAAO,CAAO,CAAC,EACxD,EAAQ,SAAS,KAAK,CAAO,CAC/B,CAEA,eAAe,EACb,EACA,EACA,EACA,EACsB,CACtB,GAAI,CACF,IAAM,EAAO,MAAA,EAAMG,EAAAA,SAAAA,CAAS,EAAM,MAAM,EAClC,EAAiB,CAAE,WAAU,YAAa,EAAQ,QAAQ,WAAY,EAE5E,GAAI,IAAS,cACX,MAAO,CAAE,KAAM,CAAE,OAAM,QAASC,EAAAA,YAAY,EAAM,CAAc,CAAE,CAAE,EAEtE,GAAM,CAAE,UAAS,gBAAe,kBAAmB,MAAM,EAAyB,EAAM,CAAc,EACtG,MAAO,CACL,KAAM,CAAE,OAAM,UAAS,sBAAuB,CAAc,EAG5D,QACE,IAAmB,IAAA,GACf,IAAA,GACA,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,mDAAmD,GACtG,CACF,OAAS,EAAO,CAKd,OAJI,aAAiBC,EAAAA,kBACnB,EAAQ,UAAY,GACb,CAAE,MAAO,CAAM,GAEjB,CAAE,MAAO,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAI,CACtF,CACF,CAQA,eAAsB,EACpB,EACA,EAC0G,CAC1G,GAAI,CACF,OAAO,MAAMC,EAAAA,kCAAkC,EAAM,CAAc,CACrE,OAAS,EAAO,CACd,GAAI,aAAiBD,EAAAA,iBACnB,MAAM,EAER,MAAO,CAAE,QAASD,EAAAA,YAAY,EAAM,CAAc,EAAG,eAAgB,EAAY,CAAK,CAAE,CAC1F,CACF,CAGA,SAAgB,EAAwB,EAAoB,EAA4B,CACtF,GAAI,EAAO,YAAc,EAAO,MAAM,OAAS,EAC7C,OAEF,IAAM,EAAc,EAAO,MAAM,SAAS,CAAE,OAAM,2BAChD,EAAwB,CAAC,CAAE,KAAM,EAAW,EAAM,EAAO,WAAW,EAAG,GAAG,CAAsB,CAAC,EAAI,CAAC,CACxG,EACI,EAAY,OAAS,IAGzB,EAAO,qBAAuBG,EAAAA,4BAA4B,EAAa,EAAQ,WAAW,EAC5F,CAQA,SAAgB,EACd,EACA,EACA,EACa,CACb,IAAM,EAAQ,IAAI,IAAI,GAAS,YAAY,oBAAoB,EAEzD,EACJ,GAAwB,OAAO,OAAO,EAAqB,2BAA4B,CAAa,EAC/F,EAAqB,2BAA2B,IAAkB,CAAC,EACpE,CAAC,EACP,IAAK,IAAM,KAAQ,EACjB,EAAM,IAAI,CAAI,EAEhB,OAAO,CACT,CAEA,SAAS,EAAoB,EAAc,EAA+B,CASxE,OARI,EAAsB,IAAI,CAAI,EACzB,GAGT,CAAI,EAAQ,cAIL,EAAmB,IAAI,CAAI,CACpC,CAEA,SAAS,EAAkB,EAAmB,EAA4B,CACxE,IAAM,EAAWT,EAAAA,QAAK,SAAS,EAAW,CAAS,EACnD,OAAO,IAAa,IAAO,IAAa,MAAQ,CAAC,EAAS,WAAW,KAAKA,EAAAA,QAAK,KAAK,GAAK,CAACA,EAAAA,QAAK,WAAW,CAAQ,CACpH,CAQA,SAAgB,EAAc,EAAsB,EAA+B,CACjF,IAAM,EAAW,EAAa,MAAM,GAAG,EACvC,IAAK,IAAM,KAAW,EAAS,MAAM,EAAG,EAAE,EACxC,GAAI,EAAsB,IAAI,CAAO,GAAM,CAAC,EAAQ,cAAgB,EAAmB,IAAI,CAAO,EAChG,MAAO,GAGX,OAAO,EAAY,EAAc,CAAO,IAAM,IAAA,EAChD,CAEA,SAAgB,EAAY,EAAc,EAAsB,EAAiB,GAAiC,CAChH,IAAM,EAAY,EAAK,YAAY,EAEjC,MAAC,IACA,EAAU,SAAS,OAAO,GACzB,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,SAAS,GAC5B,EAAU,SAAS,UAAU,MAM9B,GACA,EAAQ,cACR,GAAgB,KAAKA,EAAAA,QAAK,SAAS,CAAI,CAAC,GAAK,GAAsB,KAAKA,EAAAA,QAAK,SAAS,CAAI,CAAC,GAK9F,OAAOU,EAAAA,eAAe,CAAI,CAC5B,CAEA,SAAgB,EAAW,EAAc,EAAsB,CAC7D,OAAOV,EAAAA,QAAK,SAAS,EAAM,CAAI,GAAKA,EAAAA,QAAK,SAAS,CAAI,CACxD,CAEA,SAAgB,EAAY,EAAuB,CACjD,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAgB,EAAY,EAAuB,CACjD,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAgB,EAAY,EAAwB,CAClD,OAAO,aAAiB,MAAQ,EAAM,QAAU,OAAO,CAAK,CAC9D"}

package/dist/scan.d.ts

@@ -38,11 +38,11 @@ export declare function scanListedFiles(rootDirectory: string, relativePaths: It
  * cross the addon boundary), the metrics are still returned with the failure message, which
  * callers report as a warning rather than an error.
  */
-export declare function measureWithCrossFileData(code: string, measureOptions: MeasureOptions): {
+export declare function measureWithCrossFileData(code: string, measureOptions: MeasureOptions): Promise<{
     metrics: CodeMetrics;
     crossFileData?: CrossFileDuplicationFileData;
     crossFileError?: string;
-};
+}>;
 /** Runs after the scan so every measured file's candidates participate. */
 export declare function addCrossFileDuplication(result: ScanResult, options: ScanOptions): void;
 /**

package/dist/scan.js

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

package/dist/scan.js.map

@@ -1 +1 @@
-{"version":3,"file":"scan.js","names":[],"sources":["../src/scan.ts"],"sourcesContent":["import { lstat, readdir, readFile, realpath, stat } from 'node:fs/promises';\nimport os from 'node:os';\nimport path from 'node:path';\nimport { measureCrossFileDuplication, type CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport type { CrossFileDuplicationFileData } from './duplication.js';\nimport { detectLanguage } from './languages.js';\nimport { measureCode, measureCodeWithCrossFileData } from './metrics.js';\nimport { NativeAddonError } from './nativeMetrics.js';\nimport type { CodeMetrics, DuplicationOptions, LanguageName, MeasureOptions } from './types.js';\n\n/** The scan settings shared by every command (a structural subset of each command's options). */\nexport interface ScanOptions {\n  duplication: Required<DuplicationOptions>;\n  includeTests: boolean;\n}\n\nexport interface FileMetrics {\n  file: string;\n  metrics: CodeMetrics;\n  /** Cross-file duplicate candidates and token/statement data, collected only for directory scans. */\n  duplicationCandidates?: CrossFileDuplicationFileData;\n}\n\nexport interface ScanResult {\n  crossFileDuplication?: CrossFileDuplicationMetrics;\n  displayRoot: string;\n  errors: string[];\n  /** Non-fatal degradations (e.g. cross-file candidates unavailable); the file is still measured. */\n  warnings: string[];\n  fatalError?: string;\n  files: FileMetrics[];\n}\n\nconst ignoredDirectoryNames = new Set([\n  '.agents',\n  '.claude',\n  '.cursor',\n  '.git',\n  '.next',\n  '.playwright-cli',\n  '.tox',\n  '.tmp',\n  '.turbo',\n  '.venv',\n  '.yarn',\n  '__fixtures__',\n  '__generated__',\n  '__pycache__',\n  'coverage',\n  'dist',\n  'fixtures',\n  'generated',\n  'node_modules',\n  // .NET SDK intermediate output (generated sources such as `*.GlobalUsings.g.cs`).\n  'obj',\n  'target',\n  'test-fixtures',\n  'vendor',\n  'venv',\n]);\n\nconst testDirectoryNames = new Set(['__tests__', 'test', 'tests', 'spec']);\nconst testFilePattern = /(?:^test(?:[_-].*)?|\\.(?:spec|test)|[_-](?:test|spec))\\.[^.]+$/iu;\n// JUnit (Java/Kotlin) and xUnit/NUnit (C#) tests use case-sensitive `Test`/`Tests` class-name\n// suffixes; case-insensitive matching would catch production files like `contest.java`.\nconst suffixTestFilePattern = /Tests?\\.(?:java|kt|cs)$/u;\n\nexport function resolveTarget(target: string): string {\n  if (target === '~') {\n    return os.homedir();\n  }\n\n  if (target.startsWith('~/')) {\n    return path.join(os.homedir(), target.slice(2));\n  }\n\n  return path.resolve(target);\n}\n\n/** Returns the directory from which the config file search should start (the target itself if it is a directory). */\nexport async function configSearchDirectory(target: string): Promise<string> {\n  try {\n    const targetStat = await stat(target);\n    return targetStat.isDirectory() ? target : path.dirname(target);\n  } catch {\n    return path.dirname(target);\n  }\n}\n\n/** Shared state of one scan, threaded through the directory walk instead of positional plumbing. */\ninterface ScanContext {\n  options: ScanOptions;\n  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\nexport async function scanTarget(target: string, options: ScanOptions): 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    try {\n      await measureFile(canonicalTarget, language, 'single-file', context, canonicalTarget);\n    } catch (error) {\n      return toFatalResult(error, displayRoot, files, errors, warnings);\n    }\n    return { displayRoot, files, errors, warnings };\n  }\n\n  try {\n    await scanDirectory(canonicalTarget, makeScanContext(options, files, errors, warnings, canonicalTarget));\n  } catch (error) {\n    return toFatalResult(error, canonicalTarget, files, errors, warnings);\n  }\n  return { displayRoot: canonicalTarget, files, errors, warnings };\n}\n\n/**\n * Measures an explicit list of repository-relative files (the diff gate's git-visible allowlist)\n * instead of walking the directory tree, so ignored artifact directories are never parsed. Paths\n * outside the scan scope (ignored/test directories, unsupported or test file names) are skipped\n * with the same rules as the walk.\n */\nexport async function scanListedFiles(\n  rootDirectory: string,\n  relativePaths: Iterable<string>,\n  options: ScanOptions\n): Promise<ScanResult> {\n  const files: FileMetrics[] = [];\n  const errors: string[] = [];\n  const warnings: string[] = [];\n  const context = makeScanContext(options, files, errors, warnings, rootDirectory);\n  for (const relativePath of relativePaths) {\n    const language = isScannedPath(relativePath, options) ? getLanguage(relativePath, options) : undefined;\n    if (!language) {\n      continue;\n    }\n    const absolutePath = path.join(rootDirectory, relativePath);\n    // Symbolic links are not source files: git stores only their target string, so measuring\n    // through them would diverge from what any revision of the repository actually contains.\n    const stats = await lstat(absolutePath).catch(() => {});\n    if (stats?.isSymbolicLink()) {\n      continue;\n    }\n    try {\n      await measureFile(absolutePath, language, 'directory', context);\n    } catch (error) {\n      return toFatalResult(error, rootDirectory, files, errors, warnings);\n    }\n  }\n  return { displayRoot: rootDirectory, files, errors, warnings };\n}\n\n/** A run-wide failure (a missing native addon) as a fatal result; anything else keeps throwing. */\nfunction toFatalResult(\n  error: unknown,\n  displayRoot: string,\n  files: FileMetrics[],\n  errors: string[],\n  warnings: string[]\n): ScanResult {\n  if (!(error instanceof NativeAddonError)) {\n    throw error;\n  }\n  const fatalError = formatError(error);\n  // Errors the walk accumulated before the fatal failure stay reported alongside it.\n  return { displayRoot, files, errors: [...errors, fatalError], warnings, fatalError };\n}\n\nfunction makeScanContext(\n  options: ScanOptions,\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\n/** Runs a filesystem operation, recording a scan error and returning undefined when it fails. */\nasync function tryFileSystem<T>(\n  operation: () => Promise<T>,\n  target: string,\n  context: ScanContext\n): Promise<T | undefined> {\n  try {\n    return await operation();\n  } catch (error) {\n    context.errors.push(`${formatPath(target, context.rootDirectory)}: ${formatError(error)}`);\n    return undefined;\n  }\n}\n\n/** Resolves the path (recording errors); undefined when that fails or the result escapes the root. */\nasync function resolveWithinRoot(target: string, context: ScanContext): Promise<string | undefined> {\n  const resolved = await tryFileSystem(() => realpath(target), target, context);\n  return resolved !== undefined && isWithinDirectory(resolved, context.rootDirectory) ? resolved : undefined;\n}\n\nasync function scanDirectory(directory: string, context: ScanContext): Promise<void> {\n  const resolvedDirectory = await resolveWithinRoot(directory, context);\n  if (resolvedDirectory === undefined || context.visitedDirectories.has(resolvedDirectory)) {\n    return;\n  }\n  context.visitedDirectories.add(resolvedDirectory);\n\n  const entries = await tryFileSystem(() => readdir(directory, { withFileTypes: true }), directory, context);\n  if (entries === undefined) {\n    return;\n  }\n\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  const resolvedPath = await resolveWithinRoot(entryPath, context);\n  if (resolvedPath === undefined) {\n    return;\n  }\n\n  const entryStat = await tryFileSystem(() => stat(entryPath), entryPath, context);\n  if (entryStat === undefined) {\n    return;\n  }\n\n  if (entryStat.isDirectory()) {\n    if (\n      shouldSkipDirectory(name, context.options) ||\n      shouldSkipDirectory(path.basename(resolvedPath), context.options)\n    ) {\n      return;\n    }\n    await scanDirectory(entryPath, context);\n    return;\n  }\n\n  if (entryStat.isFile()) {\n    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    // Only directory scans compare files against each other; a single-file target has no peers.\n    if (mode === 'single-file') {\n      context.files.push({ file, metrics: measureCode(code, measureOptions) });\n      return;\n    }\n    const { metrics, crossFileData, crossFileError } = measureWithCrossFileData(code, measureOptions);\n    if (crossFileError !== undefined) {\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: ${crossFileError}`\n      );\n    }\n    context.files.push({ file, metrics, duplicationCandidates: crossFileData });\n  } catch (error) {\n    // A missing native addon fails every file identically: propagate it once as a fatal scan\n    // error instead of recording one \"skipped\" entry per file behind a successful exit code.\n    if (error instanceof NativeAddonError) {\n      throw error;\n    }\n    context.errors.push(`${formatPath(file, context.rootDirectory)}: ${formatError(error)}`);\n  }\n}\n\n/**\n * Measures a file together with its cross-file contribution from one parse. The contribution is\n * auxiliary: if collecting it fails where plain measurement succeeds (e.g. a payload too large to\n * cross the addon boundary), the metrics are still returned with the failure message, which\n * callers report as a warning rather than an error.\n */\nexport function measureWithCrossFileData(\n  code: string,\n  measureOptions: MeasureOptions\n): { metrics: CodeMetrics; crossFileData?: CrossFileDuplicationFileData; crossFileError?: string } {\n  try {\n    return measureCodeWithCrossFileData(code, measureOptions);\n  } catch (error) {\n    if (error instanceof NativeAddonError) {\n      throw error;\n    }\n    return { metrics: measureCode(code, measureOptions), crossFileError: formatError(error) };\n  }\n}\n\n/** Runs after the scan so every measured file's candidates participate. */\nexport function addCrossFileDuplication(result: ScanResult, options: ScanOptions): void {\n  if (result.fatalError || result.files.length < 2) {\n    return;\n  }\n  const sourceFiles = result.files.flatMap(({ file, duplicationCandidates }) =>\n    duplicationCandidates ? [{ file: formatPath(file, result.displayRoot), ...duplicationCandidates }] : []\n  );\n  if (sourceFiles.length < 2) {\n    return;\n  }\n  result.crossFileDuplication = measureCrossFileDuplication(sourceFiles, options.duplication);\n}\n\n/**\n * Distinct 1-based code lines covered by within-file or cross-file duplicated content. Both\n * sources expose the exact lines carrying matched tokens (never block bounding ranges, which\n * would over-count comment/blank lines and the unmatched gap of a merged clone), so the union is\n * a subset of the file's code lines and a ratio derived over code lines can never exceed 1.\n */\nexport function collectDuplicatedLineNumbers(\n  metrics: CodeMetrics | undefined,\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  formattedFile: string\n): Set<number> {\n  const lines = new Set(metrics?.duplication.duplicateLineNumbers);\n  // Object.hasOwn: a file named like an Object.prototype member must not read an inherited value.\n  const crossFileLines =\n    crossFileDuplication && Object.hasOwn(crossFileDuplication.duplicateLineNumbersByFile, formattedFile)\n      ? (crossFileDuplication.duplicateLineNumbersByFile[formattedFile] ?? [])\n      : [];\n  for (const line of crossFileLines) {\n    lines.add(line);\n  }\n  return lines;\n}\n\nfunction shouldSkipDirectory(name: string, options: ScanOptions): boolean {\n  if (ignoredDirectoryNames.has(name)) {\n    return true;\n  }\n\n  if (options.includeTests) {\n    return false;\n  }\n\n  return testDirectoryNames.has(name);\n}\n\nfunction isWithinDirectory(candidate: string, directory: string): boolean {\n  const relative = path.relative(directory, candidate);\n  return relative === '' || (relative !== '..' && !relative.startsWith(`..${path.sep}`) && !path.isAbsolute(relative));\n}\n\n/**\n * Whether a repository-relative path would be scanned: no ignored or excluded-test directory\n * segment and a supported, non-test file name. The diff gate uses this for base-revision\n * eligibility, so code renamed into scan scope gates as new code instead of ratcheting against\n * a blob the scanner would never have measured.\n */\nexport function isScannedPath(relativePath: string, options: ScanOptions): boolean {\n  const segments = relativePath.split('/');\n  for (const segment of segments.slice(0, -1)) {\n    if (ignoredDirectoryNames.has(segment) || (!options.includeTests && testDirectoryNames.has(segment))) {\n      return false;\n    }\n  }\n  return getLanguage(relativePath, options) !== undefined;\n}\n\nexport function getLanguage(file: string, options: ScanOptions, explicitTarget = false): LanguageName | undefined {\n  const lowerFile = file.toLowerCase();\n  if (\n    !explicitTarget &&\n    (lowerFile.endsWith('.d.ts') ||\n      lowerFile.endsWith('.d.mts') ||\n      lowerFile.endsWith('.d.cts') ||\n      lowerFile.endsWith('.min.js') ||\n      lowerFile.endsWith('.pnp.cjs'))\n  ) {\n    return undefined;\n  }\n\n  if (\n    !explicitTarget &&\n    !options.includeTests &&\n    (testFilePattern.test(path.basename(file)) || suffixTestFilePattern.test(path.basename(file)))\n  ) {\n    return undefined;\n  }\n\n  return detectLanguage(file);\n}\n\nexport function formatPath(file: string, base: string): string {\n  return path.relative(base, file) || path.basename(file);\n}\n\nexport function writeStdout(message: string): void {\n  process.stdout.write(message);\n}\n\nexport function writeStderr(message: string): void {\n  process.stderr.write(message);\n}\n\nexport function formatError(error: unknown): string {\n  return error instanceof Error ? error.message : String(error);\n}\n"],"mappings":"uYAiCA,MAAM,EAAwB,IAAI,IAAI,CACpC,UACA,UACA,UACA,OACA,QACA,kBACA,OACA,OACA,SACA,QACA,QACA,eACA,gBACA,cACA,WACA,OACA,WACA,YACA,eAEA,MACA,SACA,gBACA,SACA,MACF,CAAC,EAEK,EAAqB,IAAI,IAAI,CAAC,YAAa,OAAQ,QAAS,MAAM,CAAC,EACnE,EAAkB,mEAGlB,EAAwB,2BAE9B,SAAgB,EAAc,EAAwB,CASpD,OARI,IAAW,IACN,EAAG,QAAQ,EAGhB,EAAO,WAAW,IAAI,EACjB,EAAK,KAAK,EAAG,QAAQ,EAAG,EAAO,MAAM,CAAC,CAAC,EAGzC,EAAK,QAAQ,CAAM,CAC5B,CAGA,eAAsB,EAAsB,EAAiC,CAC3E,GAAI,CAEF,OAAO,MADkB,EAAK,CAAM,EAAA,CAClB,YAAY,EAAI,EAAS,EAAK,QAAQ,CAAM,CAChE,MAAQ,CACN,OAAO,EAAK,QAAQ,CAAM,CAC5B,CACF,CAcA,eAAsB,EAAW,EAAgB,EAA2C,CAC1F,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,EAC7E,GAAI,CACF,MAAM,EAAY,EAAiB,EAAU,cAAe,EAAS,CAAe,CACtF,OAAS,EAAO,CACd,OAAO,EAAc,EAAO,EAAa,EAAO,EAAQ,CAAQ,CAClE,CACA,MAAO,CAAE,cAAa,QAAO,SAAQ,UAAS,CAChD,CAEA,GAAI,CACF,MAAM,EAAc,EAAiB,EAAgB,EAAS,EAAO,EAAQ,EAAU,CAAe,CAAC,CACzG,OAAS,EAAO,CACd,OAAO,EAAc,EAAO,EAAiB,EAAO,EAAQ,CAAQ,CACtE,CACA,MAAO,CAAE,YAAa,EAAiB,QAAO,SAAQ,UAAS,CACjE,CAQA,eAAsB,EACpB,EACA,EACA,EACqB,CACrB,IAAM,EAAuB,CAAC,EACxB,EAAmB,CAAC,EACpB,EAAqB,CAAC,EACtB,EAAU,EAAgB,EAAS,EAAO,EAAQ,EAAU,CAAa,EAC/E,IAAK,IAAM,KAAgB,EAAe,CACxC,IAAM,EAAW,EAAc,EAAc,CAAO,EAAI,EAAY,EAAc,CAAO,EAAI,IAAA,GAC7F,GAAI,CAAC,EACH,SAEF,IAAM,EAAe,EAAK,KAAK,EAAe,CAAY,EAI1D,KAAI,MADgB,EAAM,CAAY,CAAC,CAAC,UAAY,CAAC,CAAC,EAAA,EAC3C,eAAe,EAG1B,GAAI,CACF,MAAM,EAAY,EAAc,EAAU,YAAa,CAAO,CAChE,OAAS,EAAO,CACd,OAAO,EAAc,EAAO,EAAe,EAAO,EAAQ,CAAQ,CACpE,CACF,CACA,MAAO,CAAE,YAAa,EAAe,QAAO,SAAQ,UAAS,CAC/D,CAGA,SAAS,EACP,EACA,EACA,EACA,EACA,EACY,CACZ,GAAI,EAAE,aAAiB,GACrB,MAAM,EAER,IAAM,EAAa,EAAY,CAAK,EAEpC,MAAO,CAAE,cAAa,QAAO,OAAQ,CAAC,GAAG,EAAQ,CAAU,EAAG,WAAU,YAAW,CACrF,CAEA,SAAS,EACP,EACA,EACA,EACA,EACA,EACa,CACb,MAAO,CAAE,UAAS,QAAO,SAAQ,WAAU,mBAAoB,IAAI,IAAO,aAAc,IAAI,IAAO,eAAc,CACnH,CAGA,eAAe,EACb,EACA,EACA,EACwB,CACxB,GAAI,CACF,OAAO,MAAM,EAAU,CACzB,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAQ,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EACzF,MACF,CACF,CAGA,eAAe,EAAkB,EAAgB,EAAmD,CAClG,IAAM,EAAW,MAAM,MAAoB,EAAS,CAAM,EAAG,EAAQ,CAAO,EAC5E,OAAO,IAAa,IAAA,IAAa,EAAkB,EAAU,EAAQ,aAAa,EAAI,EAAW,IAAA,EACnG,CAEA,eAAe,EAAc,EAAmB,EAAqC,CACnF,IAAM,EAAoB,MAAM,EAAkB,EAAW,CAAO,EACpE,GAAI,IAAsB,IAAA,IAAa,EAAQ,mBAAmB,IAAI,CAAiB,EACrF,OAEF,EAAQ,mBAAmB,IAAI,CAAiB,EAEhD,IAAM,EAAU,MAAM,MAAoB,EAAQ,EAAW,CAAE,cAAe,EAAK,CAAC,EAAG,EAAW,CAAO,EACrG,OAAY,IAAA,GAIhB,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,IAAM,EAAe,MAAM,EAAkB,EAAW,CAAO,EAC/D,GAAI,IAAiB,IAAA,GACnB,OAGF,IAAM,EAAY,MAAM,MAAoB,EAAK,CAAS,EAAG,EAAW,CAAO,EAC3E,OAAc,IAAA,GAIlB,IAAI,EAAU,YAAY,EAAG,CAC3B,GACE,EAAoB,EAAM,EAAQ,OAAO,GACzC,EAAoB,EAAK,SAAS,CAAY,EAAG,EAAQ,OAAO,EAEhE,OAEF,MAAM,EAAc,EAAW,CAAO,EACtC,MACF,CAEI,EAAU,OAAO,GACnB,MAAM,EAAqB,EAAW,EAAS,EAAc,CAAY,CAH3E,CAKF,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,EAE5E,GAAI,IAAS,cAAe,CAC1B,EAAQ,MAAM,KAAK,CAAE,OAAM,QAAS,EAAY,EAAM,CAAc,CAAE,CAAC,EACvE,MACF,CACA,GAAM,CAAE,UAAS,gBAAe,kBAAmB,EAAyB,EAAM,CAAc,EAC5F,IAAmB,IAAA,IAGrB,EAAQ,SAAS,KACf,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,mDAAmD,GAChG,EAEF,EAAQ,MAAM,KAAK,CAAE,OAAM,UAAS,sBAAuB,CAAc,CAAC,CAC5E,OAAS,EAAO,CAGd,GAAI,aAAiB,EACnB,MAAM,EAER,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,CACzF,CACF,CAQA,SAAgB,EACd,EACA,EACiG,CACjG,GAAI,CACF,OAAO,EAA6B,EAAM,CAAc,CAC1D,OAAS,EAAO,CACd,GAAI,aAAiB,EACnB,MAAM,EAER,MAAO,CAAE,QAAS,EAAY,EAAM,CAAc,EAAG,eAAgB,EAAY,CAAK,CAAE,CAC1F,CACF,CAGA,SAAgB,EAAwB,EAAoB,EAA4B,CACtF,GAAI,EAAO,YAAc,EAAO,MAAM,OAAS,EAC7C,OAEF,IAAM,EAAc,EAAO,MAAM,SAAS,CAAE,OAAM,2BAChD,EAAwB,CAAC,CAAE,KAAM,EAAW,EAAM,EAAO,WAAW,EAAG,GAAG,CAAsB,CAAC,EAAI,CAAC,CACxG,EACI,EAAY,OAAS,IAGzB,EAAO,qBAAuB,EAA4B,EAAa,EAAQ,WAAW,EAC5F,CAQA,SAAgB,EACd,EACA,EACA,EACa,CACb,IAAM,EAAQ,IAAI,IAAI,GAAS,YAAY,oBAAoB,EAEzD,EACJ,GAAwB,OAAO,OAAO,EAAqB,2BAA4B,CAAa,EAC/F,EAAqB,2BAA2B,IAAkB,CAAC,EACpE,CAAC,EACP,IAAK,IAAM,KAAQ,EACjB,EAAM,IAAI,CAAI,EAEhB,OAAO,CACT,CAEA,SAAS,EAAoB,EAAc,EAA+B,CASxE,OARI,EAAsB,IAAI,CAAI,EACzB,GAGT,CAAI,EAAQ,cAIL,EAAmB,IAAI,CAAI,CACpC,CAEA,SAAS,EAAkB,EAAmB,EAA4B,CACxE,IAAM,EAAW,EAAK,SAAS,EAAW,CAAS,EACnD,OAAO,IAAa,IAAO,IAAa,MAAQ,CAAC,EAAS,WAAW,KAAK,EAAK,KAAK,GAAK,CAAC,EAAK,WAAW,CAAQ,CACpH,CAQA,SAAgB,EAAc,EAAsB,EAA+B,CACjF,IAAM,EAAW,EAAa,MAAM,GAAG,EACvC,IAAK,IAAM,KAAW,EAAS,MAAM,EAAG,EAAE,EACxC,GAAI,EAAsB,IAAI,CAAO,GAAM,CAAC,EAAQ,cAAgB,EAAmB,IAAI,CAAO,EAChG,MAAO,GAGX,OAAO,EAAY,EAAc,CAAO,IAAM,IAAA,EAChD,CAEA,SAAgB,EAAY,EAAc,EAAsB,EAAiB,GAAiC,CAChH,IAAM,EAAY,EAAK,YAAY,EAEjC,MAAC,IACA,EAAU,SAAS,OAAO,GACzB,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,SAAS,GAC5B,EAAU,SAAS,UAAU,MAM9B,GACA,EAAQ,cACR,GAAgB,KAAK,EAAK,SAAS,CAAI,CAAC,GAAK,GAAsB,KAAK,EAAK,SAAS,CAAI,CAAC,GAK9F,OAAO,EAAe,CAAI,CAC5B,CAEA,SAAgB,EAAW,EAAc,EAAsB,CAC7D,OAAO,EAAK,SAAS,EAAM,CAAI,GAAK,EAAK,SAAS,CAAI,CACxD,CAEA,SAAgB,EAAY,EAAuB,CACjD,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAgB,EAAY,EAAuB,CACjD,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAgB,EAAY,EAAwB,CAClD,OAAO,aAAiB,MAAQ,EAAM,QAAU,OAAO,CAAK,CAC9D"}
+{"version":3,"file":"scan.js","names":[],"sources":["../src/scan.ts"],"sourcesContent":["import { lstat, readdir, readFile, realpath, stat } from 'node:fs/promises';\nimport os from 'node:os';\nimport path from 'node:path';\nimport { measureCrossFileDuplication, type CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport type { CrossFileDuplicationFileData } from './duplication.js';\nimport { detectLanguage } from './languages.js';\nimport { measureCode, measureCodeWithCrossFileDataAsync } from './metrics.js';\nimport { NativeAddonError } from './nativeMetrics.js';\nimport type { CodeMetrics, DuplicationOptions, LanguageName, MeasureOptions } from './types.js';\n\n/** The scan settings shared by every command (a structural subset of each command's options). */\nexport interface ScanOptions {\n  duplication: Required<DuplicationOptions>;\n  includeTests: boolean;\n}\n\nexport interface FileMetrics {\n  file: string;\n  metrics: CodeMetrics;\n  /** Cross-file duplicate candidates and token/statement data, collected only for directory scans. */\n  duplicationCandidates?: CrossFileDuplicationFileData;\n}\n\nexport interface ScanResult {\n  crossFileDuplication?: CrossFileDuplicationMetrics;\n  displayRoot: string;\n  errors: string[];\n  /** Non-fatal degradations (e.g. cross-file candidates unavailable); the file is still measured. */\n  warnings: string[];\n  fatalError?: string;\n  files: FileMetrics[];\n}\n\nconst ignoredDirectoryNames = new Set([\n  '.agents',\n  '.claude',\n  '.cursor',\n  '.git',\n  '.next',\n  '.playwright-cli',\n  '.tox',\n  '.tmp',\n  '.turbo',\n  '.venv',\n  '.yarn',\n  '__fixtures__',\n  '__generated__',\n  '__pycache__',\n  'coverage',\n  'dist',\n  'fixtures',\n  'generated',\n  'node_modules',\n  // .NET SDK intermediate output (generated sources such as `*.GlobalUsings.g.cs`).\n  'obj',\n  'target',\n  'test-fixtures',\n  'vendor',\n  'venv',\n]);\n\nconst testDirectoryNames = new Set(['__tests__', 'test', 'tests', 'spec']);\nconst testFilePattern = /(?:^test(?:[_-].*)?|\\.(?:spec|test)|[_-](?:test|spec))\\.[^.]+$/iu;\n// JUnit (Java/Kotlin) and xUnit/NUnit (C#) tests use case-sensitive `Test`/`Tests` class-name\n// suffixes; case-insensitive matching would catch production files like `contest.java`.\nconst suffixTestFilePattern = /Tests?\\.(?:java|kt|cs)$/u;\n\nexport function resolveTarget(target: string): string {\n  if (target === '~') {\n    return os.homedir();\n  }\n\n  if (target.startsWith('~/')) {\n    return path.join(os.homedir(), target.slice(2));\n  }\n\n  return path.resolve(target);\n}\n\n/** Returns the directory from which the config file search should start (the target itself if it is a directory). */\nexport async function configSearchDirectory(target: string): Promise<string> {\n  try {\n    const targetStat = await stat(target);\n    return targetStat.isDirectory() ? target : path.dirname(target);\n  } catch {\n    return path.dirname(target);\n  }\n}\n\n/** Shared state of one scan, threaded through the directory walk instead of positional plumbing. */\ninterface ScanContext {\n  options: ScanOptions;\n  /**\n   * Outcomes in walk order. Files are measured concurrently, so a measurement is recorded as a\n   * promise here and applied in this order once the walk ends, keeping results deterministic.\n   */\n  outcomes: (ScanOutcome | Promise<ScanOutcome>)[];\n  /** Measurements in flight, bounded so file contents and payloads do not pile up during the walk. */\n  inFlight: Set<Promise<ScanOutcome>>;\n  /** Set once a measurement fails fatally; the walk then starts no further work. */\n  fatalSeen: boolean;\n  visitedDirectories: Set<string>;\n  visitedFiles: Set<string>;\n  /** Scan root: paths are displayed relative to it, and symbolic links may not escape it. */\n  rootDirectory: string;\n}\n\n/**\n * A missing native addon fails every file identically, so it ends the scan as one fatal error\n * instead of one \"skipped\" entry per file behind a successful exit code.\n */\ntype ScanOutcome = { file: FileMetrics; warning?: string } | { error: string } | { fatal: NativeAddonError };\n\n// Twice the addon's worker count keeps its pool busy while finished payloads are parsed.\nconst maxMeasurementsInFlight = os.availableParallelism() * 2;\n\nexport async function scanTarget(target: string, options: ScanOptions): Promise<ScanResult> {\n  let canonicalTarget = target;\n  try {\n    canonicalTarget = await realpath(target);\n  } catch {\n    // stat below reports missing targets with the original path.\n  }\n\n  const fallbackDisplayRoot = path.dirname(canonicalTarget);\n  let targetStat;\n\n  try {\n    targetStat = await stat(canonicalTarget);\n  } catch (error) {\n    const fatalError = `${formatPath(canonicalTarget, fallbackDisplayRoot)}: ${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, displayRoot);\n    await measureFile(canonicalTarget, language, 'single-file', context, canonicalTarget);\n    return settleScan(context, displayRoot);\n  }\n\n  const context = makeScanContext(options, canonicalTarget);\n  await scanDirectory(canonicalTarget, context);\n  return settleScan(context, canonicalTarget);\n}\n\n/**\n * Measures an explicit list of repository-relative files (the diff gate's git-visible allowlist)\n * instead of walking the directory tree, so ignored artifact directories are never parsed. Paths\n * outside the scan scope (ignored/test directories, unsupported or test file names) are skipped\n * with the same rules as the walk.\n */\nexport async function scanListedFiles(\n  rootDirectory: string,\n  relativePaths: Iterable<string>,\n  options: ScanOptions\n): Promise<ScanResult> {\n  const context = makeScanContext(options, rootDirectory);\n  for (const relativePath of relativePaths) {\n    if (context.fatalSeen) {\n      break;\n    }\n    const language = isScannedPath(relativePath, options) ? getLanguage(relativePath, options) : undefined;\n    if (!language) {\n      continue;\n    }\n    const absolutePath = path.join(rootDirectory, relativePath);\n    // Symbolic links are not source files: git stores only their target string, so measuring\n    // through them would diverge from what any revision of the repository actually contains.\n    const stats = await lstat(absolutePath).catch(() => {});\n    if (stats?.isSymbolicLink()) {\n      continue;\n    }\n    await measureFile(absolutePath, language, 'directory', context);\n  }\n  return settleScan(context, rootDirectory);\n}\n\n/** Applies the scan's outcomes in walk order once every measurement has settled. */\nasync function settleScan(context: ScanContext, displayRoot: string): Promise<ScanResult> {\n  const files: FileMetrics[] = [];\n  const errors: string[] = [];\n  const warnings: string[] = [];\n  for (const pending of context.outcomes) {\n    const outcome = await pending;\n    if ('fatal' in outcome) {\n      const fatalError = formatError(outcome.fatal);\n      // Errors the walk recorded before the fatal failure stay reported alongside it.\n      return { displayRoot, files, errors: [...errors, fatalError], warnings, fatalError };\n    }\n    if ('error' in outcome) {\n      errors.push(outcome.error);\n      continue;\n    }\n    files.push(outcome.file);\n    if (outcome.warning !== undefined) {\n      warnings.push(outcome.warning);\n    }\n  }\n  return { displayRoot, files, errors, warnings };\n}\n\nfunction makeScanContext(options: ScanOptions, rootDirectory: string): ScanContext {\n  return {\n    options,\n    outcomes: [],\n    inFlight: new Set(),\n    fatalSeen: false,\n    visitedDirectories: new Set(),\n    visitedFiles: new Set(),\n    rootDirectory,\n  };\n}\n\nfunction recordError(context: ScanContext, target: string, error: unknown): void {\n  context.outcomes.push({ error: `${formatPath(target, context.rootDirectory)}: ${formatError(error)}` });\n}\n\n/** Runs a filesystem operation, recording a scan error and returning undefined when it fails. */\nasync function tryFileSystem<T>(\n  operation: () => Promise<T>,\n  target: string,\n  context: ScanContext\n): Promise<T | undefined> {\n  try {\n    return await operation();\n  } catch (error) {\n    recordError(context, target, error);\n    return undefined;\n  }\n}\n\n/** Resolves the path (recording errors); undefined when that fails or the result escapes the root. */\nasync function resolveWithinRoot(target: string, context: ScanContext): Promise<string | undefined> {\n  const resolved = await tryFileSystem(() => realpath(target), target, context);\n  return resolved !== undefined && isWithinDirectory(resolved, context.rootDirectory) ? resolved : undefined;\n}\n\nasync function scanDirectory(directory: string, context: ScanContext): Promise<void> {\n  const resolvedDirectory = await resolveWithinRoot(directory, context);\n  if (resolvedDirectory === undefined || context.visitedDirectories.has(resolvedDirectory)) {\n    return;\n  }\n  context.visitedDirectories.add(resolvedDirectory);\n\n  const entries = await tryFileSystem(() => readdir(directory, { withFileTypes: true }), directory, context);\n  if (entries === undefined) {\n    return;\n  }\n\n  for (const entry of entries) {\n    if (context.fatalSeen) {\n      return;\n    }\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  const resolvedPath = await resolveWithinRoot(entryPath, context);\n  if (resolvedPath === undefined) {\n    return;\n  }\n\n  const entryStat = await tryFileSystem(() => stat(entryPath), entryPath, context);\n  if (entryStat === undefined) {\n    return;\n  }\n\n  if (entryStat.isDirectory()) {\n    if (\n      shouldSkipDirectory(name, context.options) ||\n      shouldSkipDirectory(path.basename(resolvedPath), context.options)\n    ) {\n      return;\n    }\n    await scanDirectory(entryPath, context);\n    return;\n  }\n\n  if (entryStat.isFile()) {\n    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\n/**\n * Resolves and deduplicates the file in walk order, then starts measuring it concurrently; its\n * outcome is recorded in walk order (see ScanContext.outcomes).\n */\nasync function measureFile(\n  file: string,\n  language: LanguageName,\n  mode: 'single-file' | 'directory',\n  context: ScanContext,\n  realFile?: string\n): Promise<void> {\n  if (context.fatalSeen) {\n    return;\n  }\n  let resolvedFile;\n  try {\n    resolvedFile = realFile ?? (await realpath(file));\n  } catch (error) {\n    recordError(context, file, error);\n    return;\n  }\n  if (context.visitedFiles.has(resolvedFile)) {\n    return;\n  }\n  context.visitedFiles.add(resolvedFile);\n\n  // Any settled measurement frees its slot (removed by the callback below, which runs before the\n  // race resumes), so one slow file never idles the pool.\n  while (context.inFlight.size >= maxMeasurementsInFlight) {\n    await Promise.race(context.inFlight);\n  }\n  const outcome = readAndMeasureFile(file, language, mode, context);\n  context.inFlight.add(outcome);\n  void outcome.then(() => context.inFlight.delete(outcome));\n  context.outcomes.push(outcome);\n}\n\nasync function readAndMeasureFile(\n  file: string,\n  language: LanguageName,\n  mode: 'single-file' | 'directory',\n  context: ScanContext\n): Promise<ScanOutcome> {\n  try {\n    const code = await readFile(file, 'utf8');\n    const measureOptions = { language, duplication: context.options.duplication };\n    // Only directory scans compare files against each other; a single-file target has no peers.\n    if (mode === 'single-file') {\n      return { file: { file, metrics: measureCode(code, measureOptions) } };\n    }\n    const { metrics, crossFileData, crossFileError } = await measureWithCrossFileData(code, measureOptions);\n    return {\n      file: { file, metrics, duplicationCandidates: crossFileData },\n      // A warning, not an error: the file's metrics are complete, only its participation in\n      // cross-file matching is lost, so it is not \"skipped\" and must not fail --fail-on-error.\n      warning:\n        crossFileError === undefined\n          ? undefined\n          : `${formatPath(file, context.rootDirectory)}: cross-file duplication candidates unavailable: ${crossFileError}`,\n    };\n  } catch (error) {\n    if (error instanceof NativeAddonError) {\n      context.fatalSeen = true;\n      return { fatal: error };\n    }\n    return { error: `${formatPath(file, context.rootDirectory)}: ${formatError(error)}` };\n  }\n}\n\n/**\n * Measures a file together with its cross-file contribution from one parse. The contribution is\n * auxiliary: if collecting it fails where plain measurement succeeds (e.g. a payload too large to\n * cross the addon boundary), the metrics are still returned with the failure message, which\n * callers report as a warning rather than an error.\n */\nexport async function measureWithCrossFileData(\n  code: string,\n  measureOptions: MeasureOptions\n): Promise<{ metrics: CodeMetrics; crossFileData?: CrossFileDuplicationFileData; crossFileError?: string }> {\n  try {\n    return await measureCodeWithCrossFileDataAsync(code, measureOptions);\n  } catch (error) {\n    if (error instanceof NativeAddonError) {\n      throw error;\n    }\n    return { metrics: measureCode(code, measureOptions), crossFileError: formatError(error) };\n  }\n}\n\n/** Runs after the scan so every measured file's candidates participate. */\nexport function addCrossFileDuplication(result: ScanResult, options: ScanOptions): void {\n  if (result.fatalError || result.files.length < 2) {\n    return;\n  }\n  const sourceFiles = result.files.flatMap(({ file, duplicationCandidates }) =>\n    duplicationCandidates ? [{ file: formatPath(file, result.displayRoot), ...duplicationCandidates }] : []\n  );\n  if (sourceFiles.length < 2) {\n    return;\n  }\n  result.crossFileDuplication = measureCrossFileDuplication(sourceFiles, options.duplication);\n}\n\n/**\n * Distinct 1-based code lines covered by within-file or cross-file duplicated content. Both\n * sources expose the exact lines carrying matched tokens (never block bounding ranges, which\n * would over-count comment/blank lines and the unmatched gap of a merged clone), so the union is\n * a subset of the file's code lines and a ratio derived over code lines can never exceed 1.\n */\nexport function collectDuplicatedLineNumbers(\n  metrics: CodeMetrics | undefined,\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  formattedFile: string\n): Set<number> {\n  const lines = new Set(metrics?.duplication.duplicateLineNumbers);\n  // Object.hasOwn: a file named like an Object.prototype member must not read an inherited value.\n  const crossFileLines =\n    crossFileDuplication && Object.hasOwn(crossFileDuplication.duplicateLineNumbersByFile, formattedFile)\n      ? (crossFileDuplication.duplicateLineNumbersByFile[formattedFile] ?? [])\n      : [];\n  for (const line of crossFileLines) {\n    lines.add(line);\n  }\n  return lines;\n}\n\nfunction shouldSkipDirectory(name: string, options: ScanOptions): boolean {\n  if (ignoredDirectoryNames.has(name)) {\n    return true;\n  }\n\n  if (options.includeTests) {\n    return false;\n  }\n\n  return testDirectoryNames.has(name);\n}\n\nfunction isWithinDirectory(candidate: string, directory: string): boolean {\n  const relative = path.relative(directory, candidate);\n  return relative === '' || (relative !== '..' && !relative.startsWith(`..${path.sep}`) && !path.isAbsolute(relative));\n}\n\n/**\n * Whether a repository-relative path would be scanned: no ignored or excluded-test directory\n * segment and a supported, non-test file name. The diff gate uses this for base-revision\n * eligibility, so code renamed into scan scope gates as new code instead of ratcheting against\n * a blob the scanner would never have measured.\n */\nexport function isScannedPath(relativePath: string, options: ScanOptions): boolean {\n  const segments = relativePath.split('/');\n  for (const segment of segments.slice(0, -1)) {\n    if (ignoredDirectoryNames.has(segment) || (!options.includeTests && testDirectoryNames.has(segment))) {\n      return false;\n    }\n  }\n  return getLanguage(relativePath, options) !== undefined;\n}\n\nexport function getLanguage(file: string, options: ScanOptions, explicitTarget = false): LanguageName | undefined {\n  const lowerFile = file.toLowerCase();\n  if (\n    !explicitTarget &&\n    (lowerFile.endsWith('.d.ts') ||\n      lowerFile.endsWith('.d.mts') ||\n      lowerFile.endsWith('.d.cts') ||\n      lowerFile.endsWith('.min.js') ||\n      lowerFile.endsWith('.pnp.cjs'))\n  ) {\n    return undefined;\n  }\n\n  if (\n    !explicitTarget &&\n    !options.includeTests &&\n    (testFilePattern.test(path.basename(file)) || suffixTestFilePattern.test(path.basename(file)))\n  ) {\n    return undefined;\n  }\n\n  return detectLanguage(file);\n}\n\nexport function formatPath(file: string, base: string): string {\n  return path.relative(base, file) || path.basename(file);\n}\n\nexport function writeStdout(message: string): void {\n  process.stdout.write(message);\n}\n\nexport function writeStderr(message: string): void {\n  process.stderr.write(message);\n}\n\nexport function formatError(error: unknown): string {\n  return error instanceof Error ? error.message : String(error);\n}\n"],"mappings":"4YAiCA,MAAM,kBAAwB,IAAI,IAAI,CACpC,UACA,UACA,UACA,OACA,QACA,kBACA,OACA,OACA,SACA,QACA,QACA,eACA,gBACA,cACA,WACA,OACA,WACA,YACA,eAEA,MACA,SACA,gBACA,SACA,MACF,CAAC,EAEK,kBAAqB,IAAI,IAAI,CAAC,YAAa,OAAQ,QAAS,MAAM,CAAC,EACnE,EAAkB,mEAGlB,EAAwB,2BAE9B,SAAgB,EAAc,EAAwB,CASpD,OARI,IAAW,IACN,EAAG,QAAQ,EAGhB,EAAO,WAAW,IAAI,EACjB,EAAK,KAAK,EAAG,QAAQ,EAAG,EAAO,MAAM,CAAC,CAAC,EAGzC,EAAK,QAAQ,CAAM,CAC5B,CAGA,eAAsB,EAAsB,EAAiC,CAC3E,GAAI,CAEF,OAAO,MADkB,EAAK,CAAM,EAAA,CAClB,YAAY,EAAI,EAAS,EAAK,QAAQ,CAAM,CAChE,MAAQ,CACN,OAAO,EAAK,QAAQ,CAAM,CAC5B,CACF,CA2BA,MAAM,EAA0B,EAAG,qBAAqB,EAAI,EAE5D,eAAsB,EAAW,EAAgB,EAA2C,CAC1F,IAAI,EAAkB,EACtB,GAAI,CACF,EAAkB,MAAM,EAAS,CAAM,CACzC,MAAQ,CAER,CAEA,IAAM,EAAsB,EAAK,QAAQ,CAAe,EACpD,EAEJ,GAAI,CACF,EAAa,MAAM,EAAK,CAAe,CACzC,OAAS,EAAO,CACd,IAAM,EAAa,GAAG,EAAW,EAAiB,CAAmB,EAAE,IAAI,EAAY,CAAK,IAC5F,MAAO,CAAE,YAAa,EAAqB,MAAO,CAAC,EAAG,OAAQ,CAAC,CAAU,EAAG,SAAU,CAAC,EAAG,YAAW,CACvG,CAEA,GAAI,EAAW,OAAO,EAAG,CACvB,IAAM,EAAc,EAAK,QAAQ,CAAe,EAC1C,EAAW,EAAY,EAAiB,EAAS,EAAI,EAC3D,GAAI,CAAC,EAAU,CACb,IAAM,EAAa,GAAG,EAAW,EAAiB,CAAW,EAAE,yBAC/D,MAAO,CAAE,cAAa,MAAO,CAAC,EAAG,OAAQ,CAAC,CAAU,EAAG,SAAU,CAAC,EAAG,YAAW,CAClF,CAEA,IAAM,EAAU,EAAgB,EAAS,CAAW,EAEpD,OADA,MAAM,EAAY,EAAiB,EAAU,cAAe,EAAS,CAAe,EAC7E,EAAW,EAAS,CAAW,CACxC,CAEA,IAAM,EAAU,EAAgB,EAAS,CAAe,EAExD,OADA,MAAM,EAAc,EAAiB,CAAO,EACrC,EAAW,EAAS,CAAe,CAC5C,CAQA,eAAsB,EACpB,EACA,EACA,EACqB,CACrB,IAAM,EAAU,EAAgB,EAAS,CAAa,EACtD,IAAK,IAAM,KAAgB,EAAe,CACxC,GAAI,EAAQ,UACV,MAEF,IAAM,EAAW,EAAc,EAAc,CAAO,EAAI,EAAY,EAAc,CAAO,EAAI,IAAA,GAC7F,GAAI,CAAC,EACH,SAEF,IAAM,EAAe,EAAK,KAAK,EAAe,CAAY,GAItD,MADgB,EAAM,CAAY,CAAC,CAAC,UAAY,CAAC,CAAC,EAAA,EAC3C,eAAe,GAG1B,MAAM,EAAY,EAAc,EAAU,YAAa,CAAO,CAChE,CACA,OAAO,EAAW,EAAS,CAAa,CAC1C,CAGA,eAAe,EAAW,EAAsB,EAA0C,CACxF,IAAM,EAAuB,CAAC,EACxB,EAAmB,CAAC,EACpB,EAAqB,CAAC,EAC5B,IAAK,IAAM,KAAW,EAAQ,SAAU,CACtC,IAAM,EAAU,MAAM,EACtB,GAAI,UAAW,EAAS,CACtB,IAAM,EAAa,EAAY,EAAQ,KAAK,EAE5C,MAAO,CAAE,cAAa,QAAO,OAAQ,CAAC,GAAG,EAAQ,CAAU,EAAG,WAAU,YAAW,CACrF,CACA,GAAI,UAAW,EAAS,CACtB,EAAO,KAAK,EAAQ,KAAK,EACzB,QACF,CACA,EAAM,KAAK,EAAQ,IAAI,EACnB,EAAQ,UAAY,IAAA,IACtB,EAAS,KAAK,EAAQ,OAAO,CAEjC,CACA,MAAO,CAAE,cAAa,QAAO,SAAQ,UAAS,CAChD,CAEA,SAAS,EAAgB,EAAsB,EAAoC,CACjF,MAAO,CACL,UACA,SAAU,CAAC,EACX,yBAAU,IAAI,IACd,UAAW,GACX,mCAAoB,IAAI,IACxB,6BAAc,IAAI,IAClB,eACF,CACF,CAEA,SAAS,EAAY,EAAsB,EAAgB,EAAsB,CAC/E,EAAQ,SAAS,KAAK,CAAE,MAAO,GAAG,EAAW,EAAQ,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAI,CAAC,CACxG,CAGA,eAAe,EACb,EACA,EACA,EACwB,CACxB,GAAI,CACF,OAAO,MAAM,EAAU,CACzB,OAAS,EAAO,CACd,EAAY,EAAS,EAAQ,CAAK,EAClC,MACF,CACF,CAGA,eAAe,EAAkB,EAAgB,EAAmD,CAClG,IAAM,EAAW,MAAM,MAAoB,EAAS,CAAM,EAAG,EAAQ,CAAO,EAC5E,OAAO,IAAa,IAAA,IAAa,EAAkB,EAAU,EAAQ,aAAa,EAAI,EAAW,IAAA,EACnG,CAEA,eAAe,EAAc,EAAmB,EAAqC,CACnF,IAAM,EAAoB,MAAM,EAAkB,EAAW,CAAO,EACpE,GAAI,IAAsB,IAAA,IAAa,EAAQ,mBAAmB,IAAI,CAAiB,EACrF,OAEF,EAAQ,mBAAmB,IAAI,CAAiB,EAEhD,IAAM,EAAU,MAAM,MAAoB,EAAQ,EAAW,CAAE,cAAe,EAAK,CAAC,EAAG,EAAW,CAAO,EACrG,OAAY,IAAA,GAIhB,IAAK,IAAM,KAAS,EAAS,CAC3B,GAAI,EAAQ,UACV,OAEF,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,IAAM,EAAe,MAAM,EAAkB,EAAW,CAAO,EAC/D,GAAI,IAAiB,IAAA,GACnB,OAGF,IAAM,EAAY,MAAM,MAAoB,EAAK,CAAS,EAAG,EAAW,CAAO,EAC3E,OAAc,IAAA,GAIlB,IAAI,EAAU,YAAY,EAAG,CAC3B,GACE,EAAoB,EAAM,EAAQ,OAAO,GACzC,EAAoB,EAAK,SAAS,CAAY,EAAG,EAAQ,OAAO,EAEhE,OAEF,MAAM,EAAc,EAAW,CAAO,EACtC,MACF,CAEI,EAAU,OAAO,GACnB,MAAM,EAAqB,EAAW,EAAS,EAAc,CAAY,CAH3E,CAKF,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,CAMA,eAAe,EACb,EACA,EACA,EACA,EACA,EACe,CACf,GAAI,EAAQ,UACV,OAEF,IAAI,EACJ,GAAI,CACF,EAAe,GAAa,MAAM,EAAS,CAAI,CACjD,OAAS,EAAO,CACd,EAAY,EAAS,EAAM,CAAK,EAChC,MACF,CACA,GAAI,EAAQ,aAAa,IAAI,CAAY,EACvC,OAMF,IAJA,EAAQ,aAAa,IAAI,CAAY,EAI9B,EAAQ,SAAS,MAAQ,GAC9B,MAAM,QAAQ,KAAK,EAAQ,QAAQ,EAErC,IAAM,EAAU,EAAmB,EAAM,EAAU,EAAM,CAAO,EAChE,EAAQ,SAAS,IAAI,CAAO,EAC5B,EAAa,SAAW,EAAQ,SAAS,OAAO,CAAO,CAAC,EACxD,EAAQ,SAAS,KAAK,CAAO,CAC/B,CAEA,eAAe,EACb,EACA,EACA,EACA,EACsB,CACtB,GAAI,CACF,IAAM,EAAO,MAAM,EAAS,EAAM,MAAM,EAClC,EAAiB,CAAE,WAAU,YAAa,EAAQ,QAAQ,WAAY,EAE5E,GAAI,IAAS,cACX,MAAO,CAAE,KAAM,CAAE,OAAM,QAAS,EAAY,EAAM,CAAc,CAAE,CAAE,EAEtE,GAAM,CAAE,UAAS,gBAAe,kBAAmB,MAAM,EAAyB,EAAM,CAAc,EACtG,MAAO,CACL,KAAM,CAAE,OAAM,UAAS,sBAAuB,CAAc,EAG5D,QACE,IAAmB,IAAA,GACf,IAAA,GACA,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,mDAAmD,GACtG,CACF,OAAS,EAAO,CAKd,OAJI,aAAiB,GACnB,EAAQ,UAAY,GACb,CAAE,MAAO,CAAM,GAEjB,CAAE,MAAO,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAI,CACtF,CACF,CAQA,eAAsB,EACpB,EACA,EAC0G,CAC1G,GAAI,CACF,OAAO,MAAM,EAAkC,EAAM,CAAc,CACrE,OAAS,EAAO,CACd,GAAI,aAAiB,EACnB,MAAM,EAER,MAAO,CAAE,QAAS,EAAY,EAAM,CAAc,EAAG,eAAgB,EAAY,CAAK,CAAE,CAC1F,CACF,CAGA,SAAgB,EAAwB,EAAoB,EAA4B,CACtF,GAAI,EAAO,YAAc,EAAO,MAAM,OAAS,EAC7C,OAEF,IAAM,EAAc,EAAO,MAAM,SAAS,CAAE,OAAM,2BAChD,EAAwB,CAAC,CAAE,KAAM,EAAW,EAAM,EAAO,WAAW,EAAG,GAAG,CAAsB,CAAC,EAAI,CAAC,CACxG,EACI,EAAY,OAAS,IAGzB,EAAO,qBAAuB,EAA4B,EAAa,EAAQ,WAAW,EAC5F,CAQA,SAAgB,EACd,EACA,EACA,EACa,CACb,IAAM,EAAQ,IAAI,IAAI,GAAS,YAAY,oBAAoB,EAEzD,EACJ,GAAwB,OAAO,OAAO,EAAqB,2BAA4B,CAAa,EAC/F,EAAqB,2BAA2B,IAAkB,CAAC,EACpE,CAAC,EACP,IAAK,IAAM,KAAQ,EACjB,EAAM,IAAI,CAAI,EAEhB,OAAO,CACT,CAEA,SAAS,EAAoB,EAAc,EAA+B,CASxE,OARI,EAAsB,IAAI,CAAI,EACzB,GAGT,CAAI,EAAQ,cAIL,EAAmB,IAAI,CAAI,CACpC,CAEA,SAAS,EAAkB,EAAmB,EAA4B,CACxE,IAAM,EAAW,EAAK,SAAS,EAAW,CAAS,EACnD,OAAO,IAAa,IAAO,IAAa,MAAQ,CAAC,EAAS,WAAW,KAAK,EAAK,KAAK,GAAK,CAAC,EAAK,WAAW,CAAQ,CACpH,CAQA,SAAgB,EAAc,EAAsB,EAA+B,CACjF,IAAM,EAAW,EAAa,MAAM,GAAG,EACvC,IAAK,IAAM,KAAW,EAAS,MAAM,EAAG,EAAE,EACxC,GAAI,EAAsB,IAAI,CAAO,GAAM,CAAC,EAAQ,cAAgB,EAAmB,IAAI,CAAO,EAChG,MAAO,GAGX,OAAO,EAAY,EAAc,CAAO,IAAM,IAAA,EAChD,CAEA,SAAgB,EAAY,EAAc,EAAsB,EAAiB,GAAiC,CAChH,IAAM,EAAY,EAAK,YAAY,EAEjC,MAAC,IACA,EAAU,SAAS,OAAO,GACzB,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,SAAS,GAC5B,EAAU,SAAS,UAAU,MAM9B,GACA,EAAQ,cACR,GAAgB,KAAK,EAAK,SAAS,CAAI,CAAC,GAAK,GAAsB,KAAK,EAAK,SAAS,CAAI,CAAC,GAK9F,OAAO,EAAe,CAAI,CAC5B,CAEA,SAAgB,EAAW,EAAc,EAAsB,CAC7D,OAAO,EAAK,SAAS,EAAM,CAAI,GAAK,EAAK,SAAS,CAAI,CACxD,CAEA,SAAgB,EAAY,EAAuB,CACjD,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAgB,EAAY,EAAuB,CACjD,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAgB,EAAY,EAAwB,CAClD,OAAO,aAAiB,MAAQ,EAAM,QAAU,OAAO,CAAK,CAC9D"}

package/dist/wasmBinding.cjs

@@ -1,2 +1,2 @@
-"use strict";const e=require("./nativeMetrics.cjs"),t=new TextEncoder,n=new TextDecoder;function r(e){let t,r,s=a=>{if(!t){if(r)throw r;try{t=i(e)}catch(e){throw r=e,e}}let{exports:o,stderr:s}=t;s.length=0;let c;try{c=a(o)}catch(e){throw t=void 0,Error(`The code-gauge WebAssembly module crashed: ${s.join(``).trim()||String(e)}`,{cause:e})}let l=n.decode(new Uint8Array(o.memory.buffer,o.result_ptr(),o.result_len()));if(c!==0)throw Error(l);return l};return{measureCodeNative:(e,t,n,r,i,c,l)=>s(s=>s.measure_code(...a(s,e),...a(s,t),Number(n),o(r),o(i),o(c),Number(l??!1))),collectCrossFileDataNative:(e,t,n)=>s(r=>r.collect_cross_file_data(...a(r,e),...a(r,t),o(n))),collectFunctionTokenSequencesNative:(e,t)=>s(n=>n.collect_function_token_sequences(...a(n,e),...a(n,t)))}}function i(t){let n=[],r,i=new WebAssembly.Instance(t,{wasi_snapshot_preview1:c(()=>r,n)}).exports;r=i.memory;let a=i.payload_version();if(a!==7)throw new e.NativeAddonError(`The code-gauge WebAssembly module has payload version ${a}, but 7 is expected; reinstall code-gauge, or in a code-gauge repository checkout, rebuild it with \`bun run build-wasm\``);return{exports:i,stderr:n}}function a(e,n){let r=t.encode(n),i=e.alloc(r.length);return new Uint8Array(e.memory.buffer,i,r.length).set(r),[i,r.length]}function o(e){return e??-1}const s=65536;function c(e,t){let r=()=>new DataView(e().buffer),i=()=>8;return{environ_get:()=>0,environ_sizes_get:(e,t)=>(r().setUint32(e,0,!0),r().setUint32(t,0,!0),0),clock_time_get:(e,t,n)=>(r().setBigUint64(n,BigInt(Date.now())*1000000n,!0),0),random_get:(t,n)=>{for(let r=0;r<n;r+=s)crypto.getRandomValues(new Uint8Array(e().buffer,t+r,Math.min(s,n-r)));return 0},fd_write:(i,a,o,s)=>{let c=r(),l=0;for(let r=0;r<o;r++){let o=c.getUint32(a+r*8,!0),s=c.getUint32(a+r*8+4,!0);i===2&&t.push(n.decode(new Uint8Array(e().buffer,o,s))),l+=s}return c.setUint32(s,l,!0),0},fd_close:i,fd_fdstat_get:i,fd_fdstat_set_flags:i,fd_read:i,fd_seek:i,proc_exit:e=>{throw Error(`The code-gauge WebAssembly module exited with code ${e}`)}}}exports.createWasmBinding=r;
+"use strict";const e=require("./nativeMetrics.cjs"),t=new TextEncoder,n=new TextDecoder;function r(e){let t,r,s=a=>{if(!t){if(r)throw r;try{t=i(e)}catch(e){throw r=e,e}}let{exports:o,stderr:s}=t;s.length=0;let c;try{c=a(o)}catch(e){throw t=void 0,Error(`The code-gauge WebAssembly module crashed: ${s.join(``).trim()||String(e)}`,{cause:e})}let l=n.decode(new Uint8Array(o.memory.buffer,o.result_ptr(),o.result_len()));if(c!==0)throw Error(l);return l},c=(e,t,n,r,i,c,l)=>s(s=>s.measure_code(...a(s,e),...a(s,t),Number(n),o(r),o(i),o(c),Number(l)));return{measureCodeNative:c,measureCodeNativeAsync:async(...e)=>c(...e),collectCrossFileDataNative:(e,t,n)=>s(r=>r.collect_cross_file_data(...a(r,e),...a(r,t),o(n))),collectFunctionTokenSequencesNative:(e,t)=>s(n=>n.collect_function_token_sequences(...a(n,e),...a(n,t)))}}function i(t){let n=[],r,i=new WebAssembly.Instance(t,{wasi_snapshot_preview1:c(()=>r,n)}).exports;r=i.memory;let a=i.payload_version();if(a!==8)throw new e.NativeAddonError(`The code-gauge WebAssembly module has payload version ${a}, but 8 is expected; reinstall code-gauge, or in a code-gauge repository checkout, rebuild it with \`bun run build-wasm\``);return{exports:i,stderr:n}}function a(e,n){let r=t.encode(n),i=e.alloc(r.length);return new Uint8Array(e.memory.buffer,i,r.length).set(r),[i,r.length]}function o(e){return e??-1}const s=65536;function c(e,t){let r=()=>new DataView(e().buffer),i=()=>8;return{environ_get:()=>0,environ_sizes_get:(e,t)=>(r().setUint32(e,0,!0),r().setUint32(t,0,!0),0),clock_time_get:(e,t,n)=>(r().setBigUint64(n,BigInt(Date.now())*1000000n,!0),0),random_get:(t,n)=>{for(let r=0;r<n;r+=s)crypto.getRandomValues(new Uint8Array(e().buffer,t+r,Math.min(s,n-r)));return 0},fd_write:(i,a,o,s)=>{let c=r(),l=0;for(let r=0;r<o;r++){let o=c.getUint32(a+r*8,!0),s=c.getUint32(a+r*8+4,!0);i===2&&t.push(n.decode(new Uint8Array(e().buffer,o,s))),l+=s}return c.setUint32(s,l,!0),0},fd_close:i,fd_fdstat_get:i,fd_fdstat_set_flags:i,fd_read:i,fd_seek:i,proc_exit:e=>{throw Error(`The code-gauge WebAssembly module exited with code ${e}`)}}}exports.createWasmBinding=r;
 //# sourceMappingURL=wasmBinding.cjs.map

package/dist/wasmBinding.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"wasmBinding.cjs","names":["NativeAddonError"],"sources":["../src/wasmBinding.ts"],"sourcesContent":["import { expectedPayloadVersion, NativeAddonError, type NativeBinding } from './nativeMetrics.js';\n\n/** The C ABI exported by native/src/wasm.rs. */\ninterface WasmExports {\n  memory: WebAssembly.Memory;\n  payload_version(): number;\n  alloc(length: number): number;\n  result_ptr(): number;\n  result_len(): number;\n  measure_code(\n    codePtr: number,\n    codeLength: number,\n    languagePtr: number,\n    languageLength: number,\n    includeSyntaxTree: number,\n    minTokens: number,\n    maxGapTokens: number,\n    minSimilarityPercent: number,\n    includeCrossFileData: number\n  ): number;\n  collect_cross_file_data(\n    codePtr: number,\n    codeLength: number,\n    languagePtr: number,\n    languageLength: number,\n    minTokens: number\n  ): number;\n  collect_function_token_sequences(\n    codePtr: number,\n    codeLength: number,\n    languagePtr: number,\n    languageLength: number\n  ): number;\n}\n\nconst encoder = new TextEncoder();\nconst decoder = new TextDecoder();\n\n/**\n * Wraps the WebAssembly build of the native addon (native/src/wasm.rs) as a NativeBinding. The\n * module is instantiated synchronously on first use and again after a trap (a panic or stack\n * overflow), because a trap leaves the instance's memory and stack pointer in an undefined state.\n * An instantiation failure (e.g., a payload version mismatch) is memoized like the N-API loader's,\n * since instantiating the same module again would fail again.\n */\nexport function createWasmBinding(module: WebAssembly.Module): NativeBinding {\n  let instance: { exports: WasmExports; stderr: string[] } | undefined;\n  let instantiationFailure: unknown;\n\n  const call = (invoke: (exports: WasmExports) => number): string => {\n    if (!instance) {\n      if (instantiationFailure) {\n        throw instantiationFailure;\n      }\n      try {\n        instance = instantiate(module);\n      } catch (error) {\n        instantiationFailure = error;\n        throw error;\n      }\n    }\n    const { exports, stderr } = instance;\n    stderr.length = 0;\n    let status: number;\n    try {\n      status = invoke(exports);\n    } catch (error) {\n      instance = undefined;\n      throw new Error(`The code-gauge WebAssembly module crashed: ${stderr.join('').trim() || String(error)}`, {\n        cause: error,\n      });\n    }\n    const result = decoder.decode(new Uint8Array(exports.memory.buffer, exports.result_ptr(), exports.result_len()));\n    if (status !== 0) {\n      throw new Error(result);\n    }\n    return result;\n  };\n\n  return {\n    measureCodeNative: (\n      code,\n      language,\n      includeSyntaxTree,\n      minTokens,\n      maxGapTokens,\n      minSimilarityPercent,\n      includeCrossFileData\n    ) =>\n      call((exports) =>\n        exports.measure_code(\n          ...passString(exports, code),\n          ...passString(exports, language),\n          Number(includeSyntaxTree),\n          toOptionalU32(minTokens),\n          toOptionalU32(maxGapTokens),\n          toOptionalU32(minSimilarityPercent),\n          Number(includeCrossFileData ?? false)\n        )\n      ),\n    collectCrossFileDataNative: (code, language, minTokens) =>\n      call((exports) =>\n        exports.collect_cross_file_data(\n          ...passString(exports, code),\n          ...passString(exports, language),\n          toOptionalU32(minTokens)\n        )\n      ),\n    collectFunctionTokenSequencesNative: (code, language) =>\n      call((exports) =>\n        exports.collect_function_token_sequences(...passString(exports, code), ...passString(exports, language))\n      ),\n  };\n}\n\nfunction instantiate(module: WebAssembly.Module): { exports: WasmExports; stderr: string[] } {\n  const stderr: string[] = [];\n  let memory: WebAssembly.Memory | undefined;\n  const instance = new WebAssembly.Instance(module, {\n    wasi_snapshot_preview1: createWasiImports(() => memory as WebAssembly.Memory, stderr),\n  });\n  const exports = instance.exports as unknown as WasmExports;\n  memory = exports.memory;\n  const version = exports.payload_version();\n  if (version !== expectedPayloadVersion) {\n    throw new NativeAddonError(\n      `The code-gauge WebAssembly module has payload version ${version}, but ${expectedPayloadVersion} is ` +\n        'expected; reinstall code-gauge, or in a code-gauge repository checkout, rebuild it with `bun run build-wasm`'\n    );\n  }\n  return { exports, stderr };\n}\n\n/** Copies a string into a buffer whose ownership passes to the called export. */\nfunction passString(exports: WasmExports, text: string): [number, number] {\n  // TextEncoder replaces lone surrogates with U+FFFD, like toWellFormed() does for the N-API addon.\n  const bytes = encoder.encode(text);\n  const pointer = exports.alloc(bytes.length);\n  new Uint8Array(exports.memory.buffer, pointer, bytes.length).set(bytes);\n  return [pointer, bytes.length];\n}\n\n/** native/src/wasm.rs reads a negative value as an absent setting. */\nfunction toOptionalU32(value: number | undefined): number {\n  return value ?? -1;\n}\n\nconst WASI_ERRNO_SUCCESS = 0;\nconst WASI_ERRNO_BADF = 8;\n// crypto.getRandomValues() rejects requests larger than this.\nconst MAX_RANDOM_BYTES = 65_536;\n\n/**\n * The WASI preview 1 functions the module imports. The metrics code performs no I/O, so file\n * descriptors are unavailable except for writes, whose stderr output (e.g., a panic message) is\n * kept for the error raised when the module traps.\n */\nfunction createWasiImports(\n  getMemory: () => WebAssembly.Memory,\n  stderr: string[]\n): Record<string, (...args: never[]) => number> {\n  const view = (): DataView => new DataView(getMemory().buffer);\n  const unavailable = (): number => WASI_ERRNO_BADF;\n  return {\n    environ_get: () => WASI_ERRNO_SUCCESS,\n    environ_sizes_get: (countPointer: number, sizePointer: number) => {\n      view().setUint32(countPointer, 0, true);\n      view().setUint32(sizePointer, 0, true);\n      return WASI_ERRNO_SUCCESS;\n    },\n    clock_time_get: (_clockId: number, _precision: bigint, timePointer: number) => {\n      view().setBigUint64(timePointer, BigInt(Date.now()) * 1_000_000n, true);\n      return WASI_ERRNO_SUCCESS;\n    },\n    random_get: (pointer: number, length: number) => {\n      for (let offset = 0; offset < length; offset += MAX_RANDOM_BYTES) {\n        crypto.getRandomValues(\n          new Uint8Array(getMemory().buffer, pointer + offset, Math.min(MAX_RANDOM_BYTES, length - offset))\n        );\n      }\n      return WASI_ERRNO_SUCCESS;\n    },\n    fd_write: (fd: number, iovsPointer: number, iovsLength: number, writtenPointer: number) => {\n      const memoryView = view();\n      let written = 0;\n      for (let index = 0; index < iovsLength; index++) {\n        const pointer = memoryView.getUint32(iovsPointer + index * 8, true);\n        const length = memoryView.getUint32(iovsPointer + index * 8 + 4, true);\n        if (fd === 2) {\n          stderr.push(decoder.decode(new Uint8Array(getMemory().buffer, pointer, length)));\n        }\n        written += length;\n      }\n      memoryView.setUint32(writtenPointer, written, true);\n      return WASI_ERRNO_SUCCESS;\n    },\n    fd_close: unavailable,\n    fd_fdstat_get: unavailable,\n    fd_fdstat_set_flags: unavailable,\n    fd_read: unavailable,\n    fd_seek: unavailable,\n    proc_exit: (code: number) => {\n      throw new Error(`The code-gauge WebAssembly module exited with code ${code}`);\n    },\n  };\n}\n"],"mappings":"oDAmCM,EAAU,IAAI,YACd,EAAU,IAAI,YASpB,SAAgB,EAAkB,EAA2C,CAC3E,IAAI,EACA,EAEE,EAAQ,GAAqD,CACjE,GAAI,CAAC,EAAU,CACb,GAAI,EACF,MAAM,EAER,GAAI,CACF,EAAW,EAAY,CAAM,CAC/B,OAAS,EAAO,CAEd,KADA,GAAuB,EACjB,CACR,CACF,CACA,GAAM,CAAE,UAAS,UAAW,EAC5B,EAAO,OAAS,EAChB,IAAI,EACJ,GAAI,CACF,EAAS,EAAO,CAAO,CACzB,OAAS,EAAO,CAEd,KADA,GAAW,IAAA,GACD,MAAM,8CAA8C,EAAO,KAAK,EAAE,CAAC,CAAC,KAAK,GAAK,OAAO,CAAK,IAAK,CACvG,MAAO,CACT,CAAC,CACH,CACA,IAAM,EAAS,EAAQ,OAAO,IAAI,WAAW,EAAQ,OAAO,OAAQ,EAAQ,WAAW,EAAG,EAAQ,WAAW,CAAC,CAAC,EAC/G,GAAI,IAAW,EACb,MAAU,MAAM,CAAM,EAExB,OAAO,CACT,EAEA,MAAO,CACL,mBACE,EACA,EACA,EACA,EACA,EACA,EACA,IAEA,EAAM,GACJ,EAAQ,aACN,GAAG,EAAW,EAAS,CAAI,EAC3B,GAAG,EAAW,EAAS,CAAQ,EAC/B,OAAO,CAAiB,EACxB,EAAc,CAAS,EACvB,EAAc,CAAY,EAC1B,EAAc,CAAoB,EAClC,OAAO,GAAwB,EAAK,CACtC,CACF,EACF,4BAA6B,EAAM,EAAU,IAC3C,EAAM,GACJ,EAAQ,wBACN,GAAG,EAAW,EAAS,CAAI,EAC3B,GAAG,EAAW,EAAS,CAAQ,EAC/B,EAAc,CAAS,CACzB,CACF,EACF,qCAAsC,EAAM,IAC1C,EAAM,GACJ,EAAQ,iCAAiC,GAAG,EAAW,EAAS,CAAI,EAAG,GAAG,EAAW,EAAS,CAAQ,CAAC,CACzG,CACJ,CACF,CAEA,SAAS,EAAY,EAAwE,CAC3F,IAAM,EAAmB,CAAC,EACtB,EAIE,EAAU,IAHK,YAAY,SAAS,EAAQ,CAChD,uBAAwB,MAAwB,EAA8B,CAAM,CACtF,CACuB,CAAC,CAAC,QACzB,EAAS,EAAQ,OACjB,IAAM,EAAU,EAAQ,gBAAgB,EACxC,GAAI,IAAA,EACF,MAAM,IAAIA,EAAAA,iBACR,yDAAyD,EAAQ,0HAEnE,EAEF,MAAO,CAAE,UAAS,QAAO,CAC3B,CAGA,SAAS,EAAW,EAAsB,EAAgC,CAExE,IAAM,EAAQ,EAAQ,OAAO,CAAI,EAC3B,EAAU,EAAQ,MAAM,EAAM,MAAM,EAE1C,OADA,IAAI,WAAW,EAAQ,OAAO,OAAQ,EAAS,EAAM,MAAM,CAAC,CAAC,IAAI,CAAK,EAC/D,CAAC,EAAS,EAAM,MAAM,CAC/B,CAGA,SAAS,EAAc,EAAmC,CACxD,OAAO,GAAS,EAClB,CAEA,MAGM,EAAmB,MAOzB,SAAS,EACP,EACA,EAC8C,CAC9C,IAAM,MAAuB,IAAI,SAAS,EAAU,CAAC,CAAC,MAAM,EACtD,MAA4B,EAClC,MAAO,CACL,gBAAmB,EACnB,mBAAoB,EAAsB,KACxC,EAAK,CAAC,CAAC,UAAU,EAAc,EAAG,EAAI,EACtC,EAAK,CAAC,CAAC,UAAU,EAAa,EAAG,EAAI,EAC9B,GAET,gBAAiB,EAAkB,EAAoB,KACrD,EAAK,CAAC,CAAC,aAAa,EAAa,OAAO,KAAK,IAAI,CAAC,EAAI,SAAY,EAAI,EAC/D,GAET,YAAa,EAAiB,IAAmB,CAC/C,IAAK,IAAI,EAAS,EAAG,EAAS,EAAQ,GAAU,EAC9C,OAAO,gBACL,IAAI,WAAW,EAAU,CAAC,CAAC,OAAQ,EAAU,EAAQ,KAAK,IAAI,EAAkB,EAAS,CAAM,CAAC,CAClG,EAEF,MAAO,EACT,EACA,UAAW,EAAY,EAAqB,EAAoB,IAA2B,CACzF,IAAM,EAAa,EAAK,EACpB,EAAU,EACd,IAAK,IAAI,EAAQ,EAAG,EAAQ,EAAY,IAAS,CAC/C,IAAM,EAAU,EAAW,UAAU,EAAc,EAAQ,EAAG,EAAI,EAC5D,EAAS,EAAW,UAAU,EAAc,EAAQ,EAAI,EAAG,EAAI,EACjE,IAAO,GACT,EAAO,KAAK,EAAQ,OAAO,IAAI,WAAW,EAAU,CAAC,CAAC,OAAQ,EAAS,CAAM,CAAC,CAAC,EAEjF,GAAW,CACb,CAEA,OADA,EAAW,UAAU,EAAgB,EAAS,EAAI,EAC3C,CACT,EACA,SAAU,EACV,cAAe,EACf,oBAAqB,EACrB,QAAS,EACT,QAAS,EACT,UAAY,GAAiB,CAC3B,MAAU,MAAM,sDAAsD,GAAM,CAC9E,CACF,CACF"}
+{"version":3,"file":"wasmBinding.cjs","names":["NativeAddonError"],"sources":["../src/wasmBinding.ts"],"sourcesContent":["import { expectedPayloadVersion, NativeAddonError, type NativeBinding } from './nativeMetrics.js';\n\n/** The C ABI exported by native/src/wasm.rs. */\ninterface WasmExports {\n  memory: WebAssembly.Memory;\n  payload_version(): number;\n  alloc(length: number): number;\n  result_ptr(): number;\n  result_len(): number;\n  measure_code(\n    codePtr: number,\n    codeLength: number,\n    languagePtr: number,\n    languageLength: number,\n    includeSyntaxTree: number,\n    minTokens: number,\n    maxGapTokens: number,\n    minSimilarityPercent: number,\n    includeCrossFileData: number\n  ): number;\n  collect_cross_file_data(\n    codePtr: number,\n    codeLength: number,\n    languagePtr: number,\n    languageLength: number,\n    minTokens: number\n  ): number;\n  collect_function_token_sequences(\n    codePtr: number,\n    codeLength: number,\n    languagePtr: number,\n    languageLength: number\n  ): number;\n}\n\nconst encoder = new TextEncoder();\nconst decoder = new TextDecoder();\n\n/**\n * Wraps the WebAssembly build of the native addon (native/src/wasm.rs) as a NativeBinding. The\n * module is instantiated synchronously on first use and again after a trap (a panic or stack\n * overflow), because a trap leaves the instance's memory and stack pointer in an undefined state.\n * An instantiation failure (e.g., a payload version mismatch) is memoized like the N-API loader's,\n * since instantiating the same module again would fail again.\n */\nexport function createWasmBinding(module: WebAssembly.Module): NativeBinding {\n  let instance: { exports: WasmExports; stderr: string[] } | undefined;\n  let instantiationFailure: unknown;\n\n  const call = (invoke: (exports: WasmExports) => number): string => {\n    if (!instance) {\n      if (instantiationFailure) {\n        throw instantiationFailure;\n      }\n      try {\n        instance = instantiate(module);\n      } catch (error) {\n        instantiationFailure = error;\n        throw error;\n      }\n    }\n    const { exports, stderr } = instance;\n    stderr.length = 0;\n    let status: number;\n    try {\n      status = invoke(exports);\n    } catch (error) {\n      instance = undefined;\n      throw new Error(`The code-gauge WebAssembly module crashed: ${stderr.join('').trim() || String(error)}`, {\n        cause: error,\n      });\n    }\n    const result = decoder.decode(new Uint8Array(exports.memory.buffer, exports.result_ptr(), exports.result_len()));\n    if (status !== 0) {\n      throw new Error(result);\n    }\n    return result;\n  };\n\n  const measureCodeNative: NativeBinding['measureCodeNative'] = (\n    code,\n    language,\n    includeSyntaxTree,\n    minTokens,\n    maxGapTokens,\n    minSimilarityPercent,\n    includeCrossFileData\n  ) =>\n    call((exports) =>\n      exports.measure_code(\n        ...passString(exports, code),\n        ...passString(exports, language),\n        Number(includeSyntaxTree),\n        toOptionalU32(minTokens),\n        toOptionalU32(maxGapTokens),\n        toOptionalU32(minSimilarityPercent),\n        Number(includeCrossFileData)\n      )\n    );\n\n  return {\n    measureCodeNative,\n    // The WebAssembly build has no threads, so the asynchronous form measures in place.\n    measureCodeNativeAsync: async (...args) => measureCodeNative(...args),\n    collectCrossFileDataNative: (code, language, minTokens) =>\n      call((exports) =>\n        exports.collect_cross_file_data(\n          ...passString(exports, code),\n          ...passString(exports, language),\n          toOptionalU32(minTokens)\n        )\n      ),\n    collectFunctionTokenSequencesNative: (code, language) =>\n      call((exports) =>\n        exports.collect_function_token_sequences(...passString(exports, code), ...passString(exports, language))\n      ),\n  };\n}\n\nfunction instantiate(module: WebAssembly.Module): { exports: WasmExports; stderr: string[] } {\n  const stderr: string[] = [];\n  let memory: WebAssembly.Memory | undefined;\n  const instance = new WebAssembly.Instance(module, {\n    wasi_snapshot_preview1: createWasiImports(() => memory as WebAssembly.Memory, stderr),\n  });\n  const exports = instance.exports as unknown as WasmExports;\n  memory = exports.memory;\n  const version = exports.payload_version();\n  if (version !== expectedPayloadVersion) {\n    throw new NativeAddonError(\n      `The code-gauge WebAssembly module has payload version ${version}, but ${expectedPayloadVersion} is ` +\n        'expected; reinstall code-gauge, or in a code-gauge repository checkout, rebuild it with `bun run build-wasm`'\n    );\n  }\n  return { exports, stderr };\n}\n\n/** Copies a string into a buffer whose ownership passes to the called export. */\nfunction passString(exports: WasmExports, text: string): [number, number] {\n  // TextEncoder replaces lone surrogates with U+FFFD, like toWellFormed() does for the N-API addon.\n  const bytes = encoder.encode(text);\n  const pointer = exports.alloc(bytes.length);\n  new Uint8Array(exports.memory.buffer, pointer, bytes.length).set(bytes);\n  return [pointer, bytes.length];\n}\n\n/** native/src/wasm.rs reads a negative value as an absent setting. */\nfunction toOptionalU32(value: number | undefined): number {\n  return value ?? -1;\n}\n\nconst WASI_ERRNO_SUCCESS = 0;\nconst WASI_ERRNO_BADF = 8;\n// crypto.getRandomValues() rejects requests larger than this.\nconst MAX_RANDOM_BYTES = 65_536;\n\n/**\n * The WASI preview 1 functions the module imports. The metrics code performs no I/O, so file\n * descriptors are unavailable except for writes, whose stderr output (e.g., a panic message) is\n * kept for the error raised when the module traps.\n */\nfunction createWasiImports(\n  getMemory: () => WebAssembly.Memory,\n  stderr: string[]\n): Record<string, (...args: never[]) => number> {\n  const view = (): DataView => new DataView(getMemory().buffer);\n  const unavailable = (): number => WASI_ERRNO_BADF;\n  return {\n    environ_get: () => WASI_ERRNO_SUCCESS,\n    environ_sizes_get: (countPointer: number, sizePointer: number) => {\n      view().setUint32(countPointer, 0, true);\n      view().setUint32(sizePointer, 0, true);\n      return WASI_ERRNO_SUCCESS;\n    },\n    clock_time_get: (_clockId: number, _precision: bigint, timePointer: number) => {\n      view().setBigUint64(timePointer, BigInt(Date.now()) * 1_000_000n, true);\n      return WASI_ERRNO_SUCCESS;\n    },\n    random_get: (pointer: number, length: number) => {\n      for (let offset = 0; offset < length; offset += MAX_RANDOM_BYTES) {\n        crypto.getRandomValues(\n          new Uint8Array(getMemory().buffer, pointer + offset, Math.min(MAX_RANDOM_BYTES, length - offset))\n        );\n      }\n      return WASI_ERRNO_SUCCESS;\n    },\n    fd_write: (fd: number, iovsPointer: number, iovsLength: number, writtenPointer: number) => {\n      const memoryView = view();\n      let written = 0;\n      for (let index = 0; index < iovsLength; index++) {\n        const pointer = memoryView.getUint32(iovsPointer + index * 8, true);\n        const length = memoryView.getUint32(iovsPointer + index * 8 + 4, true);\n        if (fd === 2) {\n          stderr.push(decoder.decode(new Uint8Array(getMemory().buffer, pointer, length)));\n        }\n        written += length;\n      }\n      memoryView.setUint32(writtenPointer, written, true);\n      return WASI_ERRNO_SUCCESS;\n    },\n    fd_close: unavailable,\n    fd_fdstat_get: unavailable,\n    fd_fdstat_set_flags: unavailable,\n    fd_read: unavailable,\n    fd_seek: unavailable,\n    proc_exit: (code: number) => {\n      throw new Error(`The code-gauge WebAssembly module exited with code ${code}`);\n    },\n  };\n}\n"],"mappings":"oDAmCM,EAAU,IAAI,YACd,EAAU,IAAI,YASpB,SAAgB,EAAkB,EAA2C,CAC3E,IAAI,EACA,EAEE,EAAQ,GAAqD,CACjE,GAAI,CAAC,EAAU,CACb,GAAI,EACF,MAAM,EAER,GAAI,CACF,EAAW,EAAY,CAAM,CAC/B,OAAS,EAAO,CAEd,KADA,GAAuB,EACjB,CACR,CACF,CACA,GAAM,CAAE,UAAS,UAAW,EAC5B,EAAO,OAAS,EAChB,IAAI,EACJ,GAAI,CACF,EAAS,EAAO,CAAO,CACzB,OAAS,EAAO,CAEd,KADA,GAAW,IAAA,GACD,MAAM,8CAA8C,EAAO,KAAK,EAAE,CAAC,CAAC,KAAK,GAAK,OAAO,CAAK,IAAK,CACvG,MAAO,CACT,CAAC,CACH,CACA,IAAM,EAAS,EAAQ,OAAO,IAAI,WAAW,EAAQ,OAAO,OAAQ,EAAQ,WAAW,EAAG,EAAQ,WAAW,CAAC,CAAC,EAC/G,GAAI,IAAW,EACb,MAAU,MAAM,CAAM,EAExB,OAAO,CACT,EAEM,GACJ,EACA,EACA,EACA,EACA,EACA,EACA,IAEA,EAAM,GACJ,EAAQ,aACN,GAAG,EAAW,EAAS,CAAI,EAC3B,GAAG,EAAW,EAAS,CAAQ,EAC/B,OAAO,CAAiB,EACxB,EAAc,CAAS,EACvB,EAAc,CAAY,EAC1B,EAAc,CAAoB,EAClC,OAAO,CAAoB,CAC7B,CACF,EAEF,MAAO,CACL,oBAEA,uBAAwB,MAAO,GAAG,IAAS,EAAkB,GAAG,CAAI,EACpE,4BAA6B,EAAM,EAAU,IAC3C,EAAM,GACJ,EAAQ,wBACN,GAAG,EAAW,EAAS,CAAI,EAC3B,GAAG,EAAW,EAAS,CAAQ,EAC/B,EAAc,CAAS,CACzB,CACF,EACF,qCAAsC,EAAM,IAC1C,EAAM,GACJ,EAAQ,iCAAiC,GAAG,EAAW,EAAS,CAAI,EAAG,GAAG,EAAW,EAAS,CAAQ,CAAC,CACzG,CACJ,CACF,CAEA,SAAS,EAAY,EAAwE,CAC3F,IAAM,EAAmB,CAAC,EACtB,EAIE,EAAU,IAHK,YAAY,SAAS,EAAQ,CAChD,uBAAwB,MAAwB,EAA8B,CAAM,CACtF,CACuB,CAAC,CAAC,QACzB,EAAS,EAAQ,OACjB,IAAM,EAAU,EAAQ,gBAAgB,EACxC,GAAI,IAAA,EACF,MAAM,IAAIA,EAAAA,iBACR,yDAAyD,EAAQ,0HAEnE,EAEF,MAAO,CAAE,UAAS,QAAO,CAC3B,CAGA,SAAS,EAAW,EAAsB,EAAgC,CAExE,IAAM,EAAQ,EAAQ,OAAO,CAAI,EAC3B,EAAU,EAAQ,MAAM,EAAM,MAAM,EAE1C,OADA,IAAI,WAAW,EAAQ,OAAO,OAAQ,EAAS,EAAM,MAAM,CAAC,CAAC,IAAI,CAAK,EAC/D,CAAC,EAAS,EAAM,MAAM,CAC/B,CAGA,SAAS,EAAc,EAAmC,CACxD,OAAO,GAAS,EAClB,CAEA,MAGM,EAAmB,MAOzB,SAAS,EACP,EACA,EAC8C,CAC9C,IAAM,MAAuB,IAAI,SAAS,EAAU,CAAC,CAAC,MAAM,EACtD,MAA4B,EAClC,MAAO,CACL,gBAAmB,EACnB,mBAAoB,EAAsB,KACxC,EAAK,CAAC,CAAC,UAAU,EAAc,EAAG,EAAI,EACtC,EAAK,CAAC,CAAC,UAAU,EAAa,EAAG,EAAI,EAC9B,GAET,gBAAiB,EAAkB,EAAoB,KACrD,EAAK,CAAC,CAAC,aAAa,EAAa,OAAO,KAAK,IAAI,CAAC,EAAI,SAAY,EAAI,EAC/D,GAET,YAAa,EAAiB,IAAmB,CAC/C,IAAK,IAAI,EAAS,EAAG,EAAS,EAAQ,GAAU,EAC9C,OAAO,gBACL,IAAI,WAAW,EAAU,CAAC,CAAC,OAAQ,EAAU,EAAQ,KAAK,IAAI,EAAkB,EAAS,CAAM,CAAC,CAClG,EAEF,MAAO,EACT,EACA,UAAW,EAAY,EAAqB,EAAoB,IAA2B,CACzF,IAAM,EAAa,EAAK,EACpB,EAAU,EACd,IAAK,IAAI,EAAQ,EAAG,EAAQ,EAAY,IAAS,CAC/C,IAAM,EAAU,EAAW,UAAU,EAAc,EAAQ,EAAG,EAAI,EAC5D,EAAS,EAAW,UAAU,EAAc,EAAQ,EAAI,EAAG,EAAI,EACjE,IAAO,GACT,EAAO,KAAK,EAAQ,OAAO,IAAI,WAAW,EAAU,CAAC,CAAC,OAAQ,EAAS,CAAM,CAAC,CAAC,EAEjF,GAAW,CACb,CAEA,OADA,EAAW,UAAU,EAAgB,EAAS,EAAI,EAC3C,CACT,EACA,SAAU,EACV,cAAe,EACf,oBAAqB,EACrB,QAAS,EACT,QAAS,EACT,UAAY,GAAiB,CAC3B,MAAU,MAAM,sDAAsD,GAAM,CAC9E,CACF,CACF"}