code-gauge 3.0.0 → 3.1.0

package/README.md

@@ -5,11 +5,13 @@
 [![semantic-release](https://img.shields.io/badge/%20%20%F0%9F%93%A6%F0%9F%9A%80-semantic--release-e10079.svg)](https://github.com/semantic-release/semantic-release)
 [![wbfy](https://img.shields.io/badge/wbfy-18.3.0-1e90ff.svg)](https://github.com/WillBooster/shared/tree/main/packages/wbfy)
 
-A command-line tool that ranks the files of a project by refactoring priority, built for AI-agent
-workflows: an agent asked to "refactor this repository" runs `code-gauge` and starts from the top of
-the list. Measurement uses tree-sitter, and the output is deliberately small — only the metrics that
-tell an agent _what to change_ are measured and reported, so nothing in the output anchors an agent
-toward out-of-scope "improvements". A [programmatic API](#programmatic-api) is also available.
+A command-line tool that ranks the files of a project by refactoring priority and gates changes
+against metric regressions, built for AI-agent workflows: an agent asked to "refactor this
+repository" runs `code-gauge` and starts from the top of the list, and a PR pipeline runs
+`code-gauge diff --base main` to force the agent to self-correct a change that made the code worse.
+Measurement uses tree-sitter, and the output is deliberately small — only the metrics that tell an
+agent _what to change_ are measured and reported, so nothing in the output anchors an agent toward
+out-of-scope "improvements". A [programmatic API](#programmatic-api) is also available.
 
 ## Getting started
 
@@ -64,6 +66,44 @@ an agent can act on it directly.
 | `--duplication-max-gap-tokens <n>`         | Maximum token gap merged into one gapped clone group; 0 disables (default 30).  |
 | `--duplication-min-similarity-percent <n>` | Minimum similarity percent for near-miss clones; 100 = exact only (default 70). |
 
+## Regression gate (`code-gauge diff`)
+
+```sh
+code-gauge diff --base main          # gate the working tree against the merge-base with main
+code-gauge diff --base main src/api  # gate only the changed files under src/api
+```
+
+`code-gauge diff --base <ref>` measures every changed file at both revisions (working tree vs. the
+merge-base of `<ref>` and `HEAD`, read with `git cat-file` — no checkout, no persisted baseline, so
+it works identically in CI and locally) and reports **only violations**. When every gate passes it
+prints a single line and exits 0; violations print one line each — metric, base → head values, the
+`file:line` span, and a remediation direction — and exit 1 (2 when files cannot be measured).
+
+Functions are matched across revisions by name and arity, then by name alone, and finally by
+normalized-token LCS similarity, so renames and moves don't appear as delete+add. The gates:
+
+- **Existing functions — no worsening.** A matched function must not worsen its cognitive
+  complexity, NCSS, max nesting depth, DepDegree (approximate def-use pairs, Beyer & Fararooy
+  2010), or Halstead volume beyond a small configurable tolerance. No absolute threshold is
+  involved: "your change made this function worse" is defensible regardless of metric calibration.
+- **New functions — absolute thresholds.** Functions with no base counterpart are the one place
+  absolutes are required (SonarQube-style "Clean as You Code"): cognitive complexity ≤ 15, NCSS
+  ≤ 60, nesting depth ≤ 4 by default.
+- **No new duplication.** A changed file's duplicated lines (within-file plus cross-file against
+  the whole project, so copy-paste from unchanged code into new files is caught) must not exceed
+  the base revision's count.
+- **Anti-gaming backstops.** Splitting a function resets its entity identity and could hide a
+  worsening behind the laxer new-code thresholds, so when a removed named function's content
+  partially reappears in unmatched new code the file's max cognitive complexity and total NCSS
+  ratchet too; purely additive changes and unrelated remove-plus-add changes stay ungated.
+
+`--full` additionally prints the base → head values of every checked function; `--json` prints a
+machine-readable report. The duplication flags and `--include-tests` work like the ranking command.
+The duplication universes contain only git-visible files (tracked or untracked non-ignored), so
+local ignored artifacts cannot skew the counts, and the Halstead volume allowance scales with the
+base value (25%, floored at the configured tolerance) so it admits the same ~5-statement edit at
+every function size.
+
 ## Configuration
 
 `code-gauge` looks for `code-gauge.config.json` by walking up from the target directory (override
@@ -77,6 +117,23 @@ with `--config`). The following config reproduces every built-in default:
     "minSimilarityPercent": 70
   },
   "rank": { "top": 10 },
+  "gate": {
+    "newFunction": {
+      "maxCognitiveComplexity": 15,
+      "maxNcss": 60,
+      "maxNestingDepth": 4
+    },
+    "tolerance": {
+      "cognitiveComplexity": 2,
+      "ncss": 5,
+      "nestingDepth": 1,
+      "depDegree": 10,
+      "halsteadVolume": 150,
+      "fileNcss": 20,
+      "duplicateLines": 0
+    },
+    "matchSimilarityPercent": 70
+  },
   "includeTests": false,
   "failOnError": false
 }
@@ -124,7 +181,11 @@ defaults only.
   near-miss (Type-3) clones matched by token-LCS similarity, plus duplicated line count and ratio
 - Cross-file duplication (via `measureCrossFileDuplication`): copy-pasted blocks shared between
   files, matched with the same normalization and reported as groups with their file locations
-- Halstead base counts, vocabulary, length, volume, and effort
+- Halstead base counts, vocabulary, length, volume, and effort, per function and per file — the
+  strongest correlates of measured cognitive load in the EEG/fMRI validation literature
+- Per-function DepDegree (Beyer & Fararooy 2010), approximated as the number of variable reads
+  with a preceding same-name definition (declaration, assignment, or parameter) in the function —
+  a file-local single-assignment approximation that is stable enough for regression ratcheting
 
 Metrics that the validation literature shows to be weakly grounded or that invite misdirected
 "improvements" (cyclomatic complexity, call-graph fan-in/fan-out, coupling and cohesion counts,

package/dist/cli.cjs

@@ -1,5 +1,5 @@
 #!/usr/bin/env node
-"use strict";const e=require("./_virtual/_rolldown/runtime.cjs"),t=require("./crossFileDuplication.cjs"),n=require("./metrics.cjs"),r=require("./cliConfig.cjs");let i=require("node:fs/promises"),a=require("node:os");a=e.__toESM(a,1);let o=require("node:path");o=e.__toESM(o,1);let s=require("commander");const c=new Map([[`.c`,`c`],[`.c++`,`cpp`],[`.cc`,`cpp`],[`.cjs`,`javascript`],[`.cp`,`cpp`],[`.cpp`,`cpp`],[`.tcc`,`cpp`],[`.cts`,`typescript`],[`.cxx`,`cpp`],[`.go`,`go`],[`.h`,`cpp`],[`.hh`,`cpp`],[`.hpp`,`cpp`],[`.hxx`,`cpp`],[`.java`,`java`],[`.js`,`javascript`],[`.jsx`,`jsx`],[`.mjs`,`javascript`],[`.mts`,`typescript`],[`.py`,`python`],[`.rb`,`ruby`],[`.rs`,`rust`],[`.ts`,`typescript`],[`.tsx`,`tsx`]]),l=new Set([`.agents`,`.claude`,`.cursor`,`.git`,`.next`,`.playwright-cli`,`.tox`,`.tmp`,`.turbo`,`.venv`,`.yarn`,`__fixtures__`,`__generated__`,`__pycache__`,`coverage`,`dist`,`fixtures`,`generated`,`node_modules`,`target`,`test-fixtures`,`vendor`,`venv`]),u=new Set([`__tests__`,`test`,`tests`,`spec`]),d=/(?:^test(?:[_-].*)?|\.(?:spec|test)|[_-](?:test|spec))\.[^.]+$/iu,f=/Test\.java$/u;p().catch(e=>{B(`Error: ${V(e)}\n`),process.exitCode=1});async function p(){let e=new s.Command().name(`code-gauge`).description(`Rank the files of a project by refactoring priority.`).argument(`[target]`,`file or directory to measure`,`.`).option(`--config <path>`,`config file to use instead of the auto-detected ${r.configFileName}`).option(`--top <number>`,`number of top-ranked files to report (default: 10)`,L).option(`--duplication-min-tokens <number>`,`minimum normalized token count for a duplicate region (default 40)`,L).option(`--duplication-max-gap-tokens <number>`,`maximum token gap merged into one gapped clone group; 0 disables merging (default 30)`,I).option(`--duplication-min-similarity-percent <number>`,`minimum similarity percent (1-100) for near-miss (Type-3) clone blocks; 100 reports exact matches only (default 70)`,F).option(`--include-tests`,`include test files and test directories`).option(`--json`,`print JSON output`).option(`--fail-on-error`,`exit with code 1 when files or directories cannot be scanned`);e.action(async(e,t)=>{let n=m(e),i=await r.loadConfig(t.config,await h(n)),a=r.resolveOptions(t,i),o=await g(n,a);S(o,a);let s=C(o,a.top);a.json?O(o,s,a):k(n,o,s,a),(o.fatalError||a.failOnError&&o.errors.length>0)&&(process.exitCode=1)}),await e.parseAsync()}function m(e){return e===`~`?a.default.homedir():e.startsWith(`~/`)?o.default.join(a.default.homedir(),e.slice(2)):o.default.resolve(e)}async function h(e){try{return(await(0,i.stat)(e)).isDirectory()?e:o.default.dirname(e)}catch{return o.default.dirname(e)}}async function g(e,t){let n=[],r=[],a=[],s=e;try{s=await(0,i.realpath)(e)}catch{}let c=o.default.dirname(s),l;try{l=await(0,i.stat)(s)}catch(e){let t=`${R(s,c)}: ${V(e)}`;return{displayRoot:c,files:n,errors:[t],warnings:a,fatalError:t}}if(l.isFile()){let e=o.default.dirname(s),i=P(s,t,!0);if(!i){let t=`${R(s,e)}: unsupported file type`;return{displayRoot:e,files:n,errors:[t],warnings:a,fatalError:t}}let c=_(t,n,r,a,e);return await x(s,i,`single-file`,c,s),{displayRoot:e,files:n,errors:r,warnings:a}}return await v(s,_(t,n,r,a,s)),{displayRoot:s,files:n,errors:r,warnings:a}}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){let n;try{n=await(0,i.realpath)(e)}catch(n){t.errors.push(`${R(e,t.rootDirectory)}: ${V(n)}`);return}if(!N(n,t.rootDirectory)||t.visitedDirectories.has(n))return;t.visitedDirectories.add(n);let r;try{r=await(0,i.readdir)(e,{withFileTypes:!0})}catch(n){t.errors.push(`${R(e,t.rootDirectory)}: ${V(n)}`);return}for(let n of r){let r=o.default.join(e,n.name);if(n.isSymbolicLink()){await y(n.name,r,t);continue}if(n.isDirectory()){if(M(n.name,t.options))continue;await v(r,t);continue}n.isFile()&&await b(r,t)}}async function y(e,t,n){let r;try{r=await(0,i.realpath)(t)}catch(e){n.errors.push(`${R(t,n.rootDirectory)}: ${V(e)}`);return}if(!N(r,n.rootDirectory))return;let a;try{a=await(0,i.stat)(t)}catch(e){n.errors.push(`${R(t,n.rootDirectory)}: ${V(e)}`);return}if(a.isDirectory()){if(M(e,n.options)||M(o.default.basename(r),n.options))return;await v(t,n);return}a.isFile()&&await b(t,n,r,r)}async function b(e,t,n=e,r){let i=P(n,t.options);i&&await x(e,i,`directory`,t,r)}async function x(e,t,r,a,o){try{let s=o??await(0,i.realpath)(e);if(a.visitedFiles.has(s))return;a.visitedFiles.add(s);let c=await(0,i.readFile)(e,`utf8`),l={language:t,duplication:a.options.duplication},u={file:e,metrics:n.measureCode(c,l)};if(r===`directory`)try{u.duplicationCandidates=n.collectCrossFileDuplicationFileData(c,l)}catch(t){a.warnings.push(`${R(e,a.rootDirectory)}: cross-file duplication candidates unavailable: ${V(t)}`)}a.files.push(u)}catch(t){a.errors.push(`${R(e,a.rootDirectory)}: ${V(t)}`)}}function S(e,n){if(e.fatalError||e.files.length<2)return;let r=e.files.flatMap(({file:t,duplicationCandidates:n})=>n?[{file:R(t,e.displayRoot),...n}]:[]);r.length<2||(e.crossFileDuplication=t.measureCrossFileDuplication(r,n.duplication))}function C(e,t){let n=e.files.map(({file:t,metrics:n})=>{let r=R(t,e.displayRoot),i=D(n,e.crossFileDuplication,r);return{file:r,worstFunction:E(n.functions),duplicatedLineCount:i.size,duplicatedLineRatio:n.lines.code===0?0:i.size/n.lines.code,crossFilePartners:[],ncss:n.ncssCount,codeLines:n.lines.code}}),r=T(n.map(e=>e.worstFunction?.cognitiveComplexity??0)),i=T(n.map(e=>e.duplicatedLineCount)),a=T(n.map(e=>e.ncss)),o=n.map(e=>({...e,score:r(e.worstFunction?.cognitiveComplexity??0)+i(e.duplicatedLineCount)+a(e.ncss)})).toSorted((e,t)=>t.score-e.score||t.ncss-e.ncss||e.file.localeCompare(t.file));return w(o.slice(0,t),e.crossFileDuplication),o}function w(e,t){if(!t)return;let n=new Map(e.map(e=>[e.file,new Set]));for(let e of t.groups)for(let t of e.files){let r=n.get(t);if(r)for(let n of e.files)n!==t&&r.add(n)}for(let t of e)t.crossFilePartners=[...n.get(t.file)??[]].toSorted()}function T(e){let t=e.toSorted((e,t)=>e-t);return e=>{let n=0,r=t.length;for(;n<r;){let i=n+r>>1;t[i]<e?n=i+1:r=i}return t.length===0?0:n/t.length}}function E(e){let t;for(let n of e)(!t||n.cognitiveComplexity>t.cognitiveComplexity||n.cognitiveComplexity===t.cognitiveComplexity&&n.ncss>t.ncss)&&(t=n);if(t)return{name:t.name??`<anonymous>`,startLine:t.startLine,endLine:t.endLine,cognitiveComplexity:t.cognitiveComplexity,ncss:t.ncss,nestingDepth:t.nestingDepth}}function D(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 O(e,t,n){let r=t.slice(0,n.top);z(JSON.stringify({summary:j(e.files),totalRankedFiles:t.length,truncated:r.length<t.length,files:r,errors:e.errors,warnings:e.warnings},void 0,2)+`
-`)}function k(e,t,n,r){if(t.fatalError){B(`Error: ${t.fatalError}\n`);return}let i=j(t.files);if(z(`Measured ${i.fileCount} files under ${e} (code LOC ${i.linesOfCode}, NCSS ${i.ncssCount}, functions ${i.functionCount})\n`),n.length===0)z(`No measurable files found.
-`);else{let e=n.slice(0,r.top),t=n.length>e.length?` of ${n.length}`:``;z(`\nRefactoring candidates (top ${e.length}${t}):\n`);for(let[t,n]of e.entries())z(`${t+1}. ${A(n)}\n`)}if(t.warnings.length>0){B(`\nDegraded ${t.warnings.length} files (measured, but excluded from cross-file matching):\n`);for(let e of t.warnings.slice(0,10))B(`- ${e}\n`);t.warnings.length>10&&B(`- ... ${t.warnings.length-10} more\n`)}if(t.errors.length>0){B(`\nSkipped ${t.errors.length} files or directories:\n`);for(let e of t.errors.slice(0,10))B(`- ${e}\n`);t.errors.length>10&&B(`- ... ${t.errors.length-10} more\n`)}}function A(e){let t=[];if(e.worstFunction){let n=e.worstFunction;t.push(`worst function ${n.name} (L${n.startLine}-${n.endLine}) cognitive ${n.cognitiveComplexity}, NCSS ${n.ncss}, nesting ${n.nestingDepth}`)}if(e.duplicatedLineCount>0){let n=e.crossFilePartners.length>0?`, shared with ${e.crossFilePartners.slice(0,3).join(`, `)}${e.crossFilePartners.length>3?`, ...`:``}`:``;t.push(`duplicated lines ${e.duplicatedLineCount} (${Math.round(e.duplicatedLineRatio*100)}%${n})`)}return t.push(`file NCSS ${e.ncss}`),`${e.file} (score ${e.score.toFixed(2)}): ${t.join(`; `)}`}function j(e){let t=0,n=0,r=0,i=0;for(let a of e)t+=a.metrics.functions.length,n+=a.metrics.lines.code,r=Math.max(r,a.metrics.maxCognitiveComplexity),i+=a.metrics.ncssCount;return{fileCount:e.length,functionCount:t,linesOfCode:n,maxCognitiveComplexity:r,ncssCount:i}}function M(e,t){return l.has(e)?!0:!t.includeTests&&u.has(e)}function N(e,t){let n=o.default.relative(t,e);return n===``||n!==`..`&&!n.startsWith(`..${o.default.sep}`)&&!o.default.isAbsolute(n)}function P(e,t,n=!1){let r=e.toLowerCase();if(!(!n&&(r.endsWith(`.d.ts`)||r.endsWith(`.d.mts`)||r.endsWith(`.d.cts`)||r.endsWith(`.min.js`)||r.endsWith(`.pnp.cjs`)))&&!(!n&&!t.includeTests&&(d.test(o.default.basename(e))||f.test(o.default.basename(e)))))return o.default.extname(e)===`.C`?`cpp`:c.get(o.default.extname(r))}function F(e){let t=L(e);if(t>100)throw new s.InvalidArgumentError(`Expected an integer between 1 and 100.`);return t}function I(e){if(!/^\d+$/u.test(e))throw new s.InvalidArgumentError(`Expected a non-negative integer.`);let t=Number(e);if(!Number.isSafeInteger(t)||t<0)throw new s.InvalidArgumentError(`Expected a non-negative integer.`);return t}function L(e){if(!/^[1-9]\d*$/u.test(e))throw new s.InvalidArgumentError(`Expected a positive integer.`);let t=Number(e);if(!Number.isSafeInteger(t)||t<1)throw new s.InvalidArgumentError(`Expected a positive integer.`);return t}function R(e,t){return o.default.relative(t,e)||o.default.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)}
+"use strict";const e=require("./cliConfig.cjs"),t=require("./scan.cjs"),n=require("./diffCommand.cjs");let r=require("commander");a().catch(e=>{t.writeStderr(`Error: ${t.formatError(e)}\n`),process.exitCode=1});function i(t){return t.option(`--config <path>`,`config file to use instead of the auto-detected ${e.configFileName}`).option(`--duplication-min-tokens <number>`,`minimum normalized token count for a duplicate region (default 40)`,g).option(`--duplication-max-gap-tokens <number>`,`maximum token gap merged into one gapped clone group; 0 disables merging (default 30)`,h).option(`--duplication-min-similarity-percent <number>`,`minimum similarity percent (1-100) for near-miss (Type-3) clone blocks; 100 reports exact matches only (default 70)`,m).option(`--include-tests`,`include test files and test directories`).option(`--json`,`print JSON output`)}async function a(){let a=i(new r.Command().name(`code-gauge`).description(`Rank the files of a project by refactoring priority.`).argument(`[target]`,`file or directory to measure`,`.`)).option(`--top <number>`,`number of top-ranked files to report (default: 10)`,g).option(`--fail-on-error`,`exit with code 1 when files or directories cannot be scanned`);a.action(async(n,r)=>{let i=t.resolveTarget(n),a=await e.loadConfig(r.config,await t.configSearchDirectory(i)),s=e.resolveOptions(r,a),c=await t.scanTarget(i,s);t.addCrossFileDuplication(c,s);let l=o(c,s.top);s.json?u(c,l,s):d(i,c,l,s),(c.fatalError||s.failOnError&&c.errors.length>0)&&(process.exitCode=1)}),i(a.command(`diff`).description(`Gate the working tree against a base ref: report only metric regressions in changed files (exit 1 on violations)`).argument(`[target]`,`directory whose changed files are gated`,`.`).requiredOption(`--base <ref>`,`base git ref; changes are measured against its merge-base with HEAD`)).option(`--full`,`also print the passing gate values of every checked function and file`).action(async(e,t,r)=>{await n.runDiffCommand(e,r.optsWithGlobals())}),await a.parseAsync()}function o(e,n){let r=e.files.map(({file:n,metrics:r})=>{let i=t.formatPath(n,e.displayRoot),a=t.collectDuplicatedLineNumbers(r,e.crossFileDuplication,i);return{file:i,worstFunction:l(r.functions),duplicatedLineCount:a.size,duplicatedLineRatio:r.lines.code===0?0:a.size/r.lines.code,crossFilePartners:[],ncss:r.ncssCount,codeLines:r.lines.code}}),i=c(r.map(e=>e.worstFunction?.cognitiveComplexity??0)),a=c(r.map(e=>e.duplicatedLineCount)),o=c(r.map(e=>e.ncss)),u=r.map(e=>({...e,score:i(e.worstFunction?.cognitiveComplexity??0)+a(e.duplicatedLineCount)+o(e.ncss)})).toSorted((e,t)=>t.score-e.score||t.ncss-e.ncss||e.file.localeCompare(t.file));return s(u.slice(0,n),e.crossFileDuplication),u}function s(e,t){if(!t)return;let n=new Map(e.map(e=>[e.file,new Set]));for(let e of t.groups)for(let t of e.files){let r=n.get(t);if(r)for(let n of e.files)n!==t&&r.add(n)}for(let t of e)t.crossFilePartners=[...n.get(t.file)??[]].toSorted()}function c(e){let t=e.toSorted((e,t)=>e-t);return e=>{let n=0,r=t.length;for(;n<r;){let i=n+r>>1;t[i]<e?n=i+1:r=i}return t.length===0?0:n/t.length}}function l(e){let t;for(let n of e)(!t||n.cognitiveComplexity>t.cognitiveComplexity||n.cognitiveComplexity===t.cognitiveComplexity&&n.ncss>t.ncss)&&(t=n);if(t)return{name:t.name??`<anonymous>`,startLine:t.startLine,endLine:t.endLine,cognitiveComplexity:t.cognitiveComplexity,ncss:t.ncss,nestingDepth:t.nestingDepth}}function u(e,n,r){let i=n.slice(0,r.top);t.writeStdout(JSON.stringify({summary:p(e.files),totalRankedFiles:n.length,truncated:i.length<n.length,files:i,errors:e.errors,warnings:e.warnings},void 0,2)+`
+`)}function d(e,n,r,i){if(n.fatalError){t.writeStderr(`Error: ${n.fatalError}\n`);return}let a=p(n.files);if(t.writeStdout(`Measured ${a.fileCount} files under ${e} (code LOC ${a.linesOfCode}, NCSS ${a.ncssCount}, functions ${a.functionCount})\n`),r.length===0)t.writeStdout(`No measurable files found.
+`);else{let e=r.slice(0,i.top),n=r.length>e.length?` of ${r.length}`:``;t.writeStdout(`\nRefactoring candidates (top ${e.length}${n}):\n`);for(let[n,r]of e.entries())t.writeStdout(`${n+1}. ${f(r)}\n`)}if(n.warnings.length>0){t.writeStderr(`\nDegraded ${n.warnings.length} files (measured, but excluded from cross-file matching):\n`);for(let e of n.warnings.slice(0,10))t.writeStderr(`- ${e}\n`);n.warnings.length>10&&t.writeStderr(`- ... ${n.warnings.length-10} more\n`)}if(n.errors.length>0){t.writeStderr(`\nSkipped ${n.errors.length} files or directories:\n`);for(let e of n.errors.slice(0,10))t.writeStderr(`- ${e}\n`);n.errors.length>10&&t.writeStderr(`- ... ${n.errors.length-10} more\n`)}}function f(e){let t=[];if(e.worstFunction){let n=e.worstFunction;t.push(`worst function ${n.name} (L${n.startLine}-${n.endLine}) cognitive ${n.cognitiveComplexity}, NCSS ${n.ncss}, nesting ${n.nestingDepth}`)}if(e.duplicatedLineCount>0){let n=e.crossFilePartners.length>0?`, shared with ${e.crossFilePartners.slice(0,3).join(`, `)}${e.crossFilePartners.length>3?`, ...`:``}`:``;t.push(`duplicated lines ${e.duplicatedLineCount} (${Math.round(e.duplicatedLineRatio*100)}%${n})`)}return t.push(`file NCSS ${e.ncss}`),`${e.file} (score ${e.score.toFixed(2)}): ${t.join(`; `)}`}function p(e){let t=0,n=0,r=0,i=0;for(let a of e)t+=a.metrics.functions.length,n+=a.metrics.lines.code,r=Math.max(r,a.metrics.maxCognitiveComplexity),i+=a.metrics.ncssCount;return{fileCount:e.length,functionCount:t,linesOfCode:n,maxCognitiveComplexity:r,ncssCount:i}}function m(e){let t=g(e);if(t>100)throw new r.InvalidArgumentError(`Expected an integer between 1 and 100.`);return t}function h(e){if(!/^\d+$/u.test(e))throw new r.InvalidArgumentError(`Expected a non-negative integer.`);let t=Number(e);if(!Number.isSafeInteger(t)||t<0)throw new r.InvalidArgumentError(`Expected a non-negative integer.`);return t}function g(e){if(!/^[1-9]\d*$/u.test(e))throw new r.InvalidArgumentError(`Expected a positive integer.`);let t=Number(e);if(!Number.isSafeInteger(t)||t<1)throw new r.InvalidArgumentError(`Expected a positive integer.`);return t}
 //# sourceMappingURL=cli.cjs.map

package/dist/cli.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"cli.cjs","names":["Command","configFileName","loadConfig","resolveOptions","os","path","stat","realpath","readdir","readFile","measureCode","collectCrossFileDuplicationFileData","measureCrossFileDuplication","InvalidArgumentError"],"sources":["../src/cli.ts"],"sourcesContent":["#!/usr/bin/env node\n\nimport { readdir, readFile, realpath, stat } from 'node:fs/promises';\nimport os from 'node:os';\nimport path from 'node:path';\nimport { Command, InvalidArgumentError } from 'commander';\nimport { type CliOptions, configFileName, loadConfig, type ResolvedOptions, resolveOptions } from './cliConfig.js';\nimport { measureCrossFileDuplication, type CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport type { CrossFileDuplicationFileData } from './duplication.js';\nimport { collectCrossFileDuplicationFileData, measureCode } from './metrics.js';\nimport type { CodeMetrics, FunctionMetrics, LanguageName } from './types.js';\n\ninterface FileMetrics {\n  file: string;\n  metrics: CodeMetrics;\n  /** Cross-file duplicate candidates and token/statement data, collected only for directory scans. */\n  duplicationCandidates?: CrossFileDuplicationFileData;\n}\n\ninterface 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\n/** The worst (highest-cognitive-complexity) function of a file, reported as the ranking evidence. */\ninterface WorstFunction {\n  name: string;\n  startLine: number;\n  endLine: number;\n  cognitiveComplexity: number;\n  ncss: number;\n  nestingDepth: number;\n}\n\n/**\n * One ranked refactoring candidate. The score is the sum of the file's repo-relative percentile\n * ranks (each in [0, 1)) over three dimensions: worst-function cognitive complexity, duplicated\n * lines (within-file and cross-file combined), and file NCSS. Ranking is relative to the scanned\n * project, so no absolute threshold is involved.\n */\ninterface RankedFile {\n  file: string;\n  score: number;\n  worstFunction?: WorstFunction;\n  /** Distinct lines covered by within-file duplicate blocks or cross-file duplicate occurrences. */\n  duplicatedLineCount: number;\n  /** duplicatedLineCount / code lines (0 when the file has no code). */\n  duplicatedLineRatio: number;\n  /** Other files sharing cross-file duplicate blocks; filled only for the reported top files. */\n  crossFilePartners: string[];\n  ncss: number;\n  codeLines: number;\n}\n\nconst languageByExtension = new Map<string, LanguageName>([\n  ['.c', 'c'],\n  ['.c++', 'cpp'],\n  ['.cc', 'cpp'],\n  ['.cjs', 'javascript'],\n  ['.cp', 'cpp'],\n  ['.cpp', 'cpp'],\n  ['.tcc', 'cpp'],\n  ['.cts', 'typescript'],\n  ['.cxx', 'cpp'],\n  ['.go', 'go'],\n  // Headers may be C or C++; the C++ grammar parses both.\n  ['.h', 'cpp'],\n  ['.hh', 'cpp'],\n  ['.hpp', 'cpp'],\n  ['.hxx', 'cpp'],\n  ['.java', 'java'],\n  ['.js', 'javascript'],\n  ['.jsx', 'jsx'],\n  ['.mjs', 'javascript'],\n  ['.mts', 'typescript'],\n  ['.py', 'python'],\n  ['.rb', 'ruby'],\n  ['.rs', 'rust'],\n  ['.ts', 'typescript'],\n  ['.tsx', 'tsx'],\n]);\n\nconst ignoredDirectoryNames = new Set([\n  '.agents',\n  '.claude',\n  '.cursor',\n  '.git',\n  '.next',\n  '.playwright-cli',\n  '.tox',\n  '.tmp',\n  '.turbo',\n  '.venv',\n  '.yarn',\n  '__fixtures__',\n  '__generated__',\n  '__pycache__',\n  'coverage',\n  'dist',\n  'fixtures',\n  'generated',\n  'node_modules',\n  'target',\n  'test-fixtures',\n  'vendor',\n  'venv',\n]);\n\n/** Caps how many cross-file partners a ranked file lists so the report stays scannable. */\nconst maxCrossFilePartners = 3;\n\nconst testDirectoryNames = new Set(['__tests__', 'test', 'tests', 'spec']);\nconst testFilePattern = /(?:^test(?:[_-].*)?|\\.(?:spec|test)|[_-](?:test|spec))\\.[^.]+$/iu;\n// JUnit tests use a case-sensitive `Test.java` suffix; case-insensitive matching would catch\n// production files like `contest.java`.\nconst javaTestFilePattern = /Test\\.java$/u;\n\n// oxlint-disable-next-line unicorn/prefer-top-level-await -- CommonJS build output cannot preserve top-level await.\nvoid main().catch((error: unknown) => {\n  writeStderr(`Error: ${formatError(error)}\\n`);\n  process.exitCode = 1;\n});\n\nasync function main(): Promise<void> {\n  const program = new Command()\n    .name('code-gauge')\n    .description('Rank the files of a project by refactoring priority.')\n    .argument('[target]', 'file or directory to measure', '.')\n    .option('--config <path>', `config file to use instead of the auto-detected ${configFileName}`)\n    .option('--top <number>', 'number of top-ranked files to report (default: 10)', parsePositiveInteger)\n    .option(\n      '--duplication-min-tokens <number>',\n      'minimum normalized token count for a duplicate region (default 40)',\n      parsePositiveInteger\n    )\n    .option(\n      '--duplication-max-gap-tokens <number>',\n      'maximum token gap merged into one gapped clone group; 0 disables merging (default 30)',\n      parseNonNegativeInteger\n    )\n    .option(\n      '--duplication-min-similarity-percent <number>',\n      'minimum similarity percent (1-100) for near-miss (Type-3) clone blocks; 100 reports exact matches only (default 70)',\n      parsePercentInteger\n    )\n    .option('--include-tests', 'include test files and test directories')\n    .option('--json', 'print JSON output')\n    .option('--fail-on-error', 'exit with code 1 when files or directories cannot be scanned');\n\n  program.action(async (target: string, cliOptions: CliOptions) => {\n    const resolvedTarget = resolveTarget(target);\n    const config = await loadConfig(cliOptions.config, await configSearchDirectory(resolvedTarget));\n    const options = resolveOptions(cliOptions, config);\n    const result = await scanTarget(resolvedTarget, options);\n    addCrossFileDuplication(result, options);\n    const rankedFiles = rankFiles(result, options.top);\n\n    if (options.json) {\n      printJson(result, rankedFiles, options);\n    } else {\n      printTextReport(resolvedTarget, result, rankedFiles, options);\n    }\n\n    if (result.fatalError || (options.failOnError && result.errors.length > 0)) {\n      process.exitCode = 1;\n    }\n  });\n\n  await program.parseAsync();\n}\n\nfunction resolveTarget(target: string): string {\n  if (target === '~') {\n    return os.homedir();\n  }\n\n  if (target.startsWith('~/')) {\n    return path.join(os.homedir(), target.slice(2));\n  }\n\n  return path.resolve(target);\n}\n\n/** Returns the directory from which the config file search should start (the target itself if it is a directory). */\nasync function configSearchDirectory(target: string): Promise<string> {\n  try {\n    const targetStat = await stat(target);\n    return targetStat.isDirectory() ? target : path.dirname(target);\n  } catch {\n    return path.dirname(target);\n  }\n}\n\n/** Shared state of one scan, threaded through the directory walk instead of positional plumbing. */\ninterface ScanContext {\n  options: ResolvedOptions;\n  files: FileMetrics[];\n  errors: string[];\n  warnings: string[];\n  visitedDirectories: Set<string>;\n  visitedFiles: Set<string>;\n  /** Scan root: paths are displayed relative to it, and symbolic links may not escape it. */\n  rootDirectory: string;\n}\n\nasync function scanTarget(target: string, options: ResolvedOptions): Promise<ScanResult> {\n  const files: FileMetrics[] = [];\n  const errors: string[] = [];\n  const warnings: string[] = [];\n  let canonicalTarget = target;\n  try {\n    canonicalTarget = await realpath(target);\n  } catch {\n    // stat below reports missing targets with the original path.\n  }\n\n  const fallbackDisplayRoot = path.dirname(canonicalTarget);\n  let targetStat;\n\n  try {\n    targetStat = await stat(canonicalTarget);\n  } catch (error) {\n    const fatalError = `${formatPath(canonicalTarget, fallbackDisplayRoot)}: ${formatError(error)}`;\n    return { displayRoot: fallbackDisplayRoot, files, errors: [fatalError], warnings, fatalError };\n  }\n\n  if (targetStat.isFile()) {\n    const displayRoot = path.dirname(canonicalTarget);\n    const language = getLanguage(canonicalTarget, options, true);\n    if (!language) {\n      const fatalError = `${formatPath(canonicalTarget, displayRoot)}: unsupported file type`;\n      return { displayRoot, files, errors: [fatalError], warnings, fatalError };\n    }\n\n    const context = makeScanContext(options, files, errors, warnings, displayRoot);\n    await measureFile(canonicalTarget, language, 'single-file', context, canonicalTarget);\n    return { displayRoot, files, errors, warnings };\n  }\n\n  await scanDirectory(canonicalTarget, makeScanContext(options, files, errors, warnings, canonicalTarget));\n  return { displayRoot: canonicalTarget, files, errors, warnings };\n}\n\nfunction makeScanContext(\n  options: ResolvedOptions,\n  files: FileMetrics[],\n  errors: string[],\n  warnings: string[],\n  rootDirectory: string\n): ScanContext {\n  return { options, files, errors, warnings, visitedDirectories: new Set(), visitedFiles: new Set(), rootDirectory };\n}\n\nasync function scanDirectory(directory: string, context: ScanContext): Promise<void> {\n  let resolvedDirectory;\n  try {\n    resolvedDirectory = await realpath(directory);\n  } catch (error) {\n    context.errors.push(`${formatPath(directory, context.rootDirectory)}: ${formatError(error)}`);\n    return;\n  }\n\n  if (!isWithinDirectory(resolvedDirectory, context.rootDirectory)) {\n    return;\n  }\n\n  if (context.visitedDirectories.has(resolvedDirectory)) {\n    return;\n  }\n  context.visitedDirectories.add(resolvedDirectory);\n\n  let entries;\n  try {\n    entries = await readdir(directory, { withFileTypes: true });\n  } catch (error) {\n    context.errors.push(`${formatPath(directory, context.rootDirectory)}: ${formatError(error)}`);\n    return;\n  }\n\n  for (const entry of entries) {\n    const entryPath = path.join(directory, entry.name);\n    if (entry.isSymbolicLink()) {\n      await scanSymbolicLink(entry.name, entryPath, context);\n      continue;\n    }\n\n    if (entry.isDirectory()) {\n      if (shouldSkipDirectory(entry.name, context.options)) {\n        continue;\n      }\n      await scanDirectory(entryPath, context);\n      continue;\n    }\n\n    if (entry.isFile()) {\n      await measureScannableFile(entryPath, context);\n    }\n  }\n}\n\nasync function scanSymbolicLink(name: string, entryPath: string, context: ScanContext): Promise<void> {\n  let resolvedPath;\n  try {\n    resolvedPath = await realpath(entryPath);\n  } catch (error) {\n    context.errors.push(`${formatPath(entryPath, context.rootDirectory)}: ${formatError(error)}`);\n    return;\n  }\n\n  if (!isWithinDirectory(resolvedPath, context.rootDirectory)) {\n    return;\n  }\n\n  let entryStat;\n  try {\n    entryStat = await stat(entryPath);\n  } catch (error) {\n    context.errors.push(`${formatPath(entryPath, context.rootDirectory)}: ${formatError(error)}`);\n    return;\n  }\n\n  if (entryStat.isDirectory()) {\n    if (\n      shouldSkipDirectory(name, context.options) ||\n      shouldSkipDirectory(path.basename(resolvedPath), context.options)\n    ) {\n      return;\n    }\n    await scanDirectory(entryPath, context);\n    return;\n  }\n\n  if (entryStat.isFile()) {\n    await measureScannableFile(entryPath, context, resolvedPath, resolvedPath);\n  }\n}\n\nasync function measureScannableFile(\n  file: string,\n  context: ScanContext,\n  languageFile = file,\n  realFile?: string\n): Promise<void> {\n  const language = getLanguage(languageFile, context.options);\n  if (language) {\n    await measureFile(file, language, 'directory', context, realFile);\n  }\n}\n\nasync function measureFile(\n  file: string,\n  language: LanguageName,\n  mode: 'single-file' | 'directory',\n  context: ScanContext,\n  realFile?: string\n): Promise<void> {\n  try {\n    const resolvedFile = realFile ?? (await realpath(file));\n    if (context.visitedFiles.has(resolvedFile)) {\n      return;\n    }\n    context.visitedFiles.add(resolvedFile);\n\n    const code = await readFile(file, 'utf8');\n    const measureOptions = { language, duplication: context.options.duplication };\n    const fileMetrics: FileMetrics = { file, metrics: measureCode(code, measureOptions) };\n    // Only directory scans compare files against each other; a single-file target has no peers.\n    // Candidate collection failing (it always parses with the JavaScript binding, which can give\n    // up where the native backend measured fine) must not discard the measured metrics.\n    if (mode === 'directory') {\n      try {\n        fileMetrics.duplicationCandidates = collectCrossFileDuplicationFileData(code, measureOptions);\n      } catch (error) {\n        // A warning, not an error: the file's metrics are complete, only its participation in\n        // cross-file matching is lost, so it is not \"skipped\" and must not fail --fail-on-error.\n        context.warnings.push(\n          `${formatPath(file, context.rootDirectory)}: cross-file duplication candidates unavailable: ${formatError(error)}`\n        );\n      }\n    }\n    context.files.push(fileMetrics);\n  } catch (error) {\n    context.errors.push(`${formatPath(file, context.rootDirectory)}: ${formatError(error)}`);\n  }\n}\n\n/** Runs after the scan so every measured file's candidates participate. */\nfunction addCrossFileDuplication(result: ScanResult, options: ResolvedOptions): void {\n  if (result.fatalError || result.files.length < 2) {\n    return;\n  }\n  const sourceFiles = result.files.flatMap(({ file, duplicationCandidates }) =>\n    duplicationCandidates ? [{ file: formatPath(file, result.displayRoot), ...duplicationCandidates }] : []\n  );\n  if (sourceFiles.length < 2) {\n    return;\n  }\n  result.crossFileDuplication = measureCrossFileDuplication(sourceFiles, options.duplication);\n}\n\nfunction rankFiles(result: ScanResult, top: number): RankedFile[] {\n  const candidates = result.files.map(({ file, metrics }) => {\n    const formattedFile = formatPath(file, result.displayRoot);\n    const duplicatedLines = collectDuplicatedLines(metrics, result.crossFileDuplication, formattedFile);\n    return {\n      file: formattedFile,\n      worstFunction: findWorstFunction(metrics.functions),\n      duplicatedLineCount: duplicatedLines.size,\n      duplicatedLineRatio: metrics.lines.code === 0 ? 0 : duplicatedLines.size / metrics.lines.code,\n      crossFilePartners: [] as string[],\n      ncss: metrics.ncssCount,\n      codeLines: metrics.lines.code,\n    };\n  });\n\n  const cognitivePercentile = makePercentile(candidates.map((c) => c.worstFunction?.cognitiveComplexity ?? 0));\n  const duplicationPercentile = makePercentile(candidates.map((c) => c.duplicatedLineCount));\n  const ncssPercentile = makePercentile(candidates.map((c) => c.ncss));\n\n  const ranked = candidates\n    .map((candidate) => ({\n      ...candidate,\n      score:\n        cognitivePercentile(candidate.worstFunction?.cognitiveComplexity ?? 0) +\n        duplicationPercentile(candidate.duplicatedLineCount) +\n        ncssPercentile(candidate.ncss),\n    }))\n    .toSorted(\n      (left, right) => right.score - left.score || right.ncss - left.ncss || left.file.localeCompare(right.file)\n    );\n  // Partner evidence is attached only to the files that will be reported: expanding partners for\n  // every scanned file first would retain TH(F^2) strings when one clone group spans F files, and\n  // rescanning all groups per file would be O(files x groups) on the post-scan ranking step.\n  attachCrossFilePartners(ranked.slice(0, top), result.crossFileDuplication);\n  return ranked;\n}\n\n/** One pass over the groups fills the reported files' partner lists (other files sharing a group). */\nfunction attachCrossFilePartners(\n  reportedFiles: RankedFile[],\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined\n): void {\n  if (!crossFileDuplication) {\n    return;\n  }\n  const partnersByFile = new Map(reportedFiles.map((ranked) => [ranked.file, new Set<string>()]));\n  for (const group of crossFileDuplication.groups) {\n    for (const file of group.files) {\n      const partners = partnersByFile.get(file);\n      if (!partners) {\n        continue;\n      }\n      for (const partner of group.files) {\n        if (partner !== file) {\n          partners.add(partner);\n        }\n      }\n    }\n  }\n  for (const ranked of reportedFiles) {\n    ranked.crossFilePartners = [...(partnersByFile.get(ranked.file) ?? [])].toSorted();\n  }\n}\n\n/**\n * Percentile rank within the scanned project: the fraction of files with a strictly smaller\n * value, in [0, 1). Relative ranking needs no absolute threshold, which sidesteps the metric\n * calibration problem entirely — the top of the list is worth refactoring first regardless of\n * where any cutoff would sit.\n */\nfunction makePercentile(values: number[]): (value: number) => number {\n  const sorted = values.toSorted((left, right) => left - right);\n  return (value: number) => {\n    let low = 0;\n    let high = sorted.length;\n    while (low < high) {\n      const middle = (low + high) >> 1;\n      if ((sorted[middle] as number) < value) {\n        low = middle + 1;\n      } else {\n        high = middle;\n      }\n    }\n    return sorted.length === 0 ? 0 : low / sorted.length;\n  };\n}\n\n/** The highest-cognitive-complexity function; NCSS breaks ties so the larger body is reported. */\nfunction findWorstFunction(functions: FunctionMetrics[]): WorstFunction | undefined {\n  let worst: FunctionMetrics | undefined;\n  for (const fn of functions) {\n    if (\n      !worst ||\n      fn.cognitiveComplexity > worst.cognitiveComplexity ||\n      (fn.cognitiveComplexity === worst.cognitiveComplexity && fn.ncss > worst.ncss)\n    ) {\n      worst = fn;\n    }\n  }\n  if (!worst) {\n    return undefined;\n  }\n  return {\n    name: worst.name ?? '<anonymous>',\n    startLine: worst.startLine,\n    endLine: worst.endLine,\n    cognitiveComplexity: worst.cognitiveComplexity,\n    ncss: worst.ncss,\n    nestingDepth: worst.nestingDepth,\n  };\n}\n\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 the derived ratio can never exceed 1.\n */\nfunction collectDuplicatedLines(\n  metrics: CodeMetrics,\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 printJson(result: ScanResult, rankedFiles: RankedFile[], options: ResolvedOptions): void {\n  const reportedFiles = rankedFiles.slice(0, options.top);\n  writeStdout(\n    JSON.stringify(\n      {\n        summary: summarize(result.files),\n        totalRankedFiles: rankedFiles.length,\n        truncated: reportedFiles.length < rankedFiles.length,\n        files: reportedFiles,\n        errors: result.errors,\n        warnings: result.warnings,\n      },\n      undefined,\n      2\n    ) + '\\n'\n  );\n}\n\nfunction printTextReport(\n  target: string,\n  result: ScanResult,\n  rankedFiles: RankedFile[],\n  options: ResolvedOptions\n): void {\n  if (result.fatalError) {\n    writeStderr(`Error: ${result.fatalError}\\n`);\n    return;\n  }\n\n  const summary = summarize(result.files);\n  writeStdout(\n    `Measured ${summary.fileCount} files under ${target} (code LOC ${summary.linesOfCode}, NCSS ${summary.ncssCount}, functions ${summary.functionCount})\\n`\n  );\n\n  if (rankedFiles.length === 0) {\n    writeStdout('No measurable files found.\\n');\n  } else {\n    const reportedFiles = rankedFiles.slice(0, options.top);\n    const totalSuffix = rankedFiles.length > reportedFiles.length ? ` of ${rankedFiles.length}` : '';\n    writeStdout(`\\nRefactoring candidates (top ${reportedFiles.length}${totalSuffix}):\\n`);\n    for (const [index, ranked] of reportedFiles.entries()) {\n      writeStdout(`${index + 1}. ${formatRankedFile(ranked)}\\n`);\n    }\n  }\n\n  if (result.warnings.length > 0) {\n    writeStderr(`\\nDegraded ${result.warnings.length} files (measured, but excluded from cross-file matching):\\n`);\n    for (const warning of result.warnings.slice(0, 10)) {\n      writeStderr(`- ${warning}\\n`);\n    }\n    if (result.warnings.length > 10) {\n      writeStderr(`- ... ${result.warnings.length - 10} more\\n`);\n    }\n  }\n\n  if (result.errors.length > 0) {\n    writeStderr(`\\nSkipped ${result.errors.length} files or directories:\\n`);\n    for (const error of result.errors.slice(0, 10)) {\n      writeStderr(`- ${error}\\n`);\n    }\n    if (result.errors.length > 10) {\n      writeStderr(`- ... ${result.errors.length - 10} more\\n`);\n    }\n  }\n}\n\n/** One ranked file as a single line: the location, the evidence, and where the duplication points. */\nfunction formatRankedFile(ranked: RankedFile): string {\n  const reasons: string[] = [];\n  if (ranked.worstFunction) {\n    const fn = ranked.worstFunction;\n    reasons.push(\n      `worst function ${fn.name} (L${fn.startLine}-${fn.endLine}) cognitive ${fn.cognitiveComplexity}, NCSS ${fn.ncss}, nesting ${fn.nestingDepth}`\n    );\n  }\n  if (ranked.duplicatedLineCount > 0) {\n    const partnersSuffix =\n      ranked.crossFilePartners.length > 0\n        ? `, shared with ${ranked.crossFilePartners.slice(0, maxCrossFilePartners).join(', ')}${ranked.crossFilePartners.length > maxCrossFilePartners ? ', ...' : ''}`\n        : '';\n    reasons.push(\n      `duplicated lines ${ranked.duplicatedLineCount} (${Math.round(ranked.duplicatedLineRatio * 100)}%${partnersSuffix})`\n    );\n  }\n  reasons.push(`file NCSS ${ranked.ncss}`);\n  return `${ranked.file} (score ${ranked.score.toFixed(2)}): ${reasons.join('; ')}`;\n}\n\nfunction summarize(files: FileMetrics[]): {\n  fileCount: number;\n  functionCount: number;\n  linesOfCode: number;\n  maxCognitiveComplexity: number;\n  ncssCount: number;\n} {\n  let functionCount = 0;\n  let linesOfCode = 0;\n  let maxCognitiveComplexity = 0;\n  let ncssCount = 0;\n\n  for (const file of files) {\n    functionCount += file.metrics.functions.length;\n    linesOfCode += file.metrics.lines.code;\n    maxCognitiveComplexity = Math.max(maxCognitiveComplexity, file.metrics.maxCognitiveComplexity);\n    ncssCount += file.metrics.ncssCount;\n  }\n\n  return { fileCount: files.length, functionCount, linesOfCode, maxCognitiveComplexity, ncssCount };\n}\n\nfunction shouldSkipDirectory(name: string, options: ResolvedOptions): boolean {\n  if (ignoredDirectoryNames.has(name)) {\n    return true;\n  }\n\n  if (options.includeTests) {\n    return false;\n  }\n\n  return testDirectoryNames.has(name);\n}\n\nfunction isWithinDirectory(candidate: string, directory: string): boolean {\n  const relative = path.relative(directory, candidate);\n  return relative === '' || (relative !== '..' && !relative.startsWith(`..${path.sep}`) && !path.isAbsolute(relative));\n}\n\nfunction getLanguage(file: string, options: ResolvedOptions, explicitTarget = false): LanguageName | undefined {\n  const lowerFile = file.toLowerCase();\n  if (\n    !explicitTarget &&\n    (lowerFile.endsWith('.d.ts') ||\n      lowerFile.endsWith('.d.mts') ||\n      lowerFile.endsWith('.d.cts') ||\n      lowerFile.endsWith('.min.js') ||\n      lowerFile.endsWith('.pnp.cjs'))\n  ) {\n    return undefined;\n  }\n\n  if (\n    !explicitTarget &&\n    !options.includeTests &&\n    (testFilePattern.test(path.basename(file)) || javaTestFilePattern.test(path.basename(file)))\n  ) {\n    return undefined;\n  }\n\n  // GCC treats an uppercase `.C` as C++; lowercasing first would misparse it with the C grammar.\n  if (path.extname(file) === '.C') {\n    return 'cpp';\n  }\n\n  return languageByExtension.get(path.extname(lowerFile));\n}\n\nfunction parsePercentInteger(value: string): number {\n  const parsed = parsePositiveInteger(value);\n  if (parsed > 100) {\n    throw new InvalidArgumentError('Expected an integer between 1 and 100.');\n  }\n  return parsed;\n}\n\nfunction parseNonNegativeInteger(value: string): number {\n  if (!/^\\d+$/u.test(value)) {\n    throw new InvalidArgumentError('Expected a non-negative integer.');\n  }\n\n  const parsed = Number(value);\n  if (!Number.isSafeInteger(parsed) || parsed < 0) {\n    throw new InvalidArgumentError('Expected a non-negative integer.');\n  }\n  return parsed;\n}\n\nfunction parsePositiveInteger(value: string): number {\n  if (!/^[1-9]\\d*$/u.test(value)) {\n    throw new InvalidArgumentError('Expected a positive integer.');\n  }\n\n  const parsed = Number(value);\n  if (!Number.isSafeInteger(parsed) || parsed < 1) {\n    throw new InvalidArgumentError('Expected a positive integer.');\n  }\n  return parsed;\n}\n\nfunction formatPath(file: string, base: string): string {\n  return path.relative(base, file) || path.basename(file);\n}\n\nfunction writeStdout(message: string): void {\n  process.stdout.write(message);\n}\n\nfunction writeStderr(message: string): void {\n  process.stderr.write(message);\n}\n\nfunction formatError(error: unknown): string {\n  return error instanceof Error ? error.message : String(error);\n}\n"],"mappings":";gTA2DA,MAAM,EAAsB,IAAI,IAA0B,CACxD,CAAC,KAAM,GAAG,EACV,CAAC,OAAQ,KAAK,EACd,CAAC,MAAO,KAAK,EACb,CAAC,OAAQ,YAAY,EACrB,CAAC,MAAO,KAAK,EACb,CAAC,OAAQ,KAAK,EACd,CAAC,OAAQ,KAAK,EACd,CAAC,OAAQ,YAAY,EACrB,CAAC,OAAQ,KAAK,EACd,CAAC,MAAO,IAAI,EAEZ,CAAC,KAAM,KAAK,EACZ,CAAC,MAAO,KAAK,EACb,CAAC,OAAQ,KAAK,EACd,CAAC,OAAQ,KAAK,EACd,CAAC,QAAS,MAAM,EAChB,CAAC,MAAO,YAAY,EACpB,CAAC,OAAQ,KAAK,EACd,CAAC,OAAQ,YAAY,EACrB,CAAC,OAAQ,YAAY,EACrB,CAAC,MAAO,QAAQ,EAChB,CAAC,MAAO,MAAM,EACd,CAAC,MAAO,MAAM,EACd,CAAC,MAAO,YAAY,EACpB,CAAC,OAAQ,KAAK,CAChB,CAAC,EAEK,EAAwB,IAAI,IAAI,CACpC,UACA,UACA,UACA,OACA,QACA,kBACA,OACA,OACA,SACA,QACA,QACA,eACA,gBACA,cACA,WACA,OACA,WACA,YACA,eACA,SACA,gBACA,SACA,MACF,CAAC,EAKK,EAAqB,IAAI,IAAI,CAAC,YAAa,OAAQ,QAAS,MAAM,CAAC,EACnE,EAAkB,mEAGlB,EAAsB,eAGvB,EAAK,CAAC,CAAC,MAAO,GAAmB,CACpC,EAAY,UAAU,EAAY,CAAK,EAAE,GAAG,EAC5C,QAAQ,SAAW,CACrB,CAAC,EAED,eAAe,GAAsB,CACnC,IAAM,EAAU,IAAIA,EAAAA,QAAQ,CAAC,CAC1B,KAAK,YAAY,CAAC,CAClB,YAAY,sDAAsD,CAAC,CACnE,SAAS,WAAY,+BAAgC,GAAG,CAAC,CACzD,OAAO,kBAAmB,mDAAmDC,EAAAA,gBAAgB,CAAC,CAC9F,OAAO,iBAAkB,qDAAsD,CAAoB,CAAC,CACpG,OACC,oCACA,qEACA,CACF,CAAC,CACA,OACC,wCACA,wFACA,CACF,CAAC,CACA,OACC,gDACA,sHACA,CACF,CAAC,CACA,OAAO,kBAAmB,yCAAyC,CAAC,CACpE,OAAO,SAAU,mBAAmB,CAAC,CACrC,OAAO,kBAAmB,8DAA8D,EAE3F,EAAQ,OAAO,MAAO,EAAgB,IAA2B,CAC/D,IAAM,EAAiB,EAAc,CAAM,EACrC,EAAS,MAAMC,EAAAA,WAAW,EAAW,OAAQ,MAAM,EAAsB,CAAc,CAAC,EACxF,EAAUC,EAAAA,eAAe,EAAY,CAAM,EAC3C,EAAS,MAAM,EAAW,EAAgB,CAAO,EACvD,EAAwB,EAAQ,CAAO,EACvC,IAAM,EAAc,EAAU,EAAQ,EAAQ,GAAG,EAE7C,EAAQ,KACV,EAAU,EAAQ,EAAa,CAAO,EAEtC,EAAgB,EAAgB,EAAQ,EAAa,CAAO,GAG1D,EAAO,YAAe,EAAQ,aAAe,EAAO,OAAO,OAAS,KACtE,QAAQ,SAAW,EAEvB,CAAC,EAED,MAAM,EAAQ,WAAW,CAC3B,CAEA,SAAS,EAAc,EAAwB,CAS7C,OARI,IAAW,IACNC,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,eAAe,EAAsB,EAAiC,CACpE,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,eAAe,EAAW,EAAgB,EAA+C,CACvF,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,EAE7E,OADA,MAAM,EAAY,EAAiB,EAAU,cAAe,EAAS,CAAe,EAC7E,CAAE,cAAa,QAAO,SAAQ,UAAS,CAChD,CAGA,OADA,MAAM,EAAc,EAAiB,EAAgB,EAAS,EAAO,EAAQ,EAAU,CAAe,CAAC,EAChG,CAAE,YAAa,EAAiB,QAAO,SAAQ,UAAS,CACjE,CAEA,SAAS,EACP,EACA,EACA,EACA,EACA,EACa,CACb,MAAO,CAAE,UAAS,QAAO,SAAQ,WAAU,mBAAoB,IAAI,IAAO,aAAc,IAAI,IAAO,eAAc,CACnH,CAEA,eAAe,EAAc,EAAmB,EAAqC,CACnF,IAAI,EACJ,GAAI,CACF,EAAoB,MAAA,EAAME,EAAAA,SAAAA,CAAS,CAAS,CAC9C,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAW,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EAC5F,MACF,CAMA,GAJI,CAAC,EAAkB,EAAmB,EAAQ,aAAa,GAI3D,EAAQ,mBAAmB,IAAI,CAAiB,EAClD,OAEF,EAAQ,mBAAmB,IAAI,CAAiB,EAEhD,IAAI,EACJ,GAAI,CACF,EAAU,MAAA,EAAMC,EAAAA,QAAAA,CAAQ,EAAW,CAAE,cAAe,EAAK,CAAC,CAC5D,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAW,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EAC5F,MACF,CAEA,IAAK,IAAM,KAAS,EAAS,CAC3B,IAAM,EAAYH,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,IAAI,EACJ,GAAI,CACF,EAAe,MAAA,EAAME,EAAAA,SAAAA,CAAS,CAAS,CACzC,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAW,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EAC5F,MACF,CAEA,GAAI,CAAC,EAAkB,EAAc,EAAQ,aAAa,EACxD,OAGF,IAAI,EACJ,GAAI,CACF,EAAY,MAAA,EAAMD,EAAAA,KAAAA,CAAK,CAAS,CAClC,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAW,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EAC5F,MACF,CAEA,GAAI,EAAU,YAAY,EAAG,CAC3B,GACE,EAAoB,EAAM,EAAQ,OAAO,GACzC,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,CAE7E,CAEA,eAAe,EACb,EACA,EACA,EAAe,EACf,EACe,CACf,IAAM,EAAW,EAAY,EAAc,EAAQ,OAAO,EACtD,GACF,MAAM,EAAY,EAAM,EAAU,YAAa,EAAS,CAAQ,CAEpE,CAEA,eAAe,EACb,EACA,EACA,EACA,EACA,EACe,CACf,GAAI,CACF,IAAM,EAAe,GAAa,MAAA,EAAME,EAAAA,SAAAA,CAAS,CAAI,EACrD,GAAI,EAAQ,aAAa,IAAI,CAAY,EACvC,OAEF,EAAQ,aAAa,IAAI,CAAY,EAErC,IAAM,EAAO,MAAA,EAAME,EAAAA,SAAAA,CAAS,EAAM,MAAM,EAClC,EAAiB,CAAE,WAAU,YAAa,EAAQ,QAAQ,WAAY,EACtE,EAA2B,CAAE,OAAM,QAASC,EAAAA,YAAY,EAAM,CAAc,CAAE,EAIpF,GAAI,IAAS,YACX,GAAI,CACF,EAAY,sBAAwBC,EAAAA,oCAAoC,EAAM,CAAc,CAC9F,OAAS,EAAO,CAGd,EAAQ,SAAS,KACf,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,mDAAmD,EAAY,CAAK,GACjH,CACF,CAEF,EAAQ,MAAM,KAAK,CAAW,CAChC,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,CACzF,CACF,CAGA,SAAS,EAAwB,EAAoB,EAAgC,CACnF,GAAI,EAAO,YAAc,EAAO,MAAM,OAAS,EAC7C,OAEF,IAAM,EAAc,EAAO,MAAM,SAAS,CAAE,OAAM,2BAChD,EAAwB,CAAC,CAAE,KAAM,EAAW,EAAM,EAAO,WAAW,EAAG,GAAG,CAAsB,CAAC,EAAI,CAAC,CACxG,EACI,EAAY,OAAS,IAGzB,EAAO,qBAAuBC,EAAAA,4BAA4B,EAAa,EAAQ,WAAW,EAC5F,CAEA,SAAS,EAAU,EAAoB,EAA2B,CAChE,IAAM,EAAa,EAAO,MAAM,KAAK,CAAE,OAAM,aAAc,CACzD,IAAM,EAAgB,EAAW,EAAM,EAAO,WAAW,EACnD,EAAkB,EAAuB,EAAS,EAAO,qBAAsB,CAAa,EAClG,MAAO,CACL,KAAM,EACN,cAAe,EAAkB,EAAQ,SAAS,EAClD,oBAAqB,EAAgB,KACrC,oBAAqB,EAAQ,MAAM,OAAS,EAAI,EAAI,EAAgB,KAAO,EAAQ,MAAM,KACzF,kBAAmB,CAAC,EACpB,KAAM,EAAQ,UACd,UAAW,EAAQ,MAAM,IAC3B,CACF,CAAC,EAEK,EAAsB,EAAe,EAAW,IAAK,GAAM,EAAE,eAAe,qBAAuB,CAAC,CAAC,EACrG,EAAwB,EAAe,EAAW,IAAK,GAAM,EAAE,mBAAmB,CAAC,EACnF,EAAiB,EAAe,EAAW,IAAK,GAAM,EAAE,IAAI,CAAC,EAE7D,EAAS,EACZ,IAAK,IAAe,CACnB,GAAG,EACH,MACE,EAAoB,EAAU,eAAe,qBAAuB,CAAC,EACrE,EAAsB,EAAU,mBAAmB,EACnD,EAAe,EAAU,IAAI,CACjC,EAAE,CAAC,CACF,UACE,EAAM,IAAU,EAAM,MAAQ,EAAK,OAAS,EAAM,KAAO,EAAK,MAAQ,EAAK,KAAK,cAAc,EAAM,IAAI,CAC3G,EAKF,OADA,EAAwB,EAAO,MAAM,EAAG,CAAG,EAAG,EAAO,oBAAoB,EAClE,CACT,CAGA,SAAS,EACP,EACA,EACM,CACN,GAAI,CAAC,EACH,OAEF,IAAM,EAAiB,IAAI,IAAI,EAAc,IAAK,GAAW,CAAC,EAAO,KAAM,IAAI,GAAa,CAAC,CAAC,EAC9F,IAAK,IAAM,KAAS,EAAqB,OACvC,IAAK,IAAM,KAAQ,EAAM,MAAO,CAC9B,IAAM,EAAW,EAAe,IAAI,CAAI,EACnC,KAGL,IAAK,IAAM,KAAW,EAAM,MACtB,IAAY,GACd,EAAS,IAAI,CAAO,CAG1B,CAEF,IAAK,IAAM,KAAU,EACnB,EAAO,kBAAoB,CAAC,GAAI,EAAe,IAAI,EAAO,IAAI,GAAK,CAAC,CAAE,CAAC,CAAC,SAAS,CAErF,CAQA,SAAS,EAAe,EAA6C,CACnE,IAAM,EAAS,EAAO,UAAU,EAAM,IAAU,EAAO,CAAK,EAC5D,MAAQ,IAAkB,CACxB,IAAI,EAAM,EACN,EAAO,EAAO,OAClB,KAAO,EAAM,GAAM,CACjB,IAAM,EAAU,EAAM,GAAS,EAC1B,EAAO,GAAqB,EAC/B,EAAM,EAAS,EAEf,EAAO,CAEX,CACA,OAAO,EAAO,SAAW,EAAI,EAAI,EAAM,EAAO,MAChD,CACF,CAGA,SAAS,EAAkB,EAAyD,CAClF,IAAI,EACJ,IAAK,IAAM,KAAM,GAEb,CAAC,GACD,EAAG,oBAAsB,EAAM,qBAC9B,EAAG,sBAAwB,EAAM,qBAAuB,EAAG,KAAO,EAAM,QAEzE,EAAQ,GAGP,KAGL,MAAO,CACL,KAAM,EAAM,MAAQ,cACpB,UAAW,EAAM,UACjB,QAAS,EAAM,QACf,oBAAqB,EAAM,oBAC3B,KAAM,EAAM,KACZ,aAAc,EAAM,YACtB,CACF,CAQA,SAAS,EACP,EACA,EACA,EACa,CACb,IAAM,EAAQ,IAAI,IAAI,EAAQ,YAAY,oBAAoB,EAExD,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,EAAU,EAAoB,EAA2B,EAAgC,CAChG,IAAM,EAAgB,EAAY,MAAM,EAAG,EAAQ,GAAG,EACtD,EACE,KAAK,UACH,CACE,QAAS,EAAU,EAAO,KAAK,EAC/B,iBAAkB,EAAY,OAC9B,UAAW,EAAc,OAAS,EAAY,OAC9C,MAAO,EACP,OAAQ,EAAO,OACf,SAAU,EAAO,QACnB,EACA,IAAA,GACA,CACF,EAAI;CACN,CACF,CAEA,SAAS,EACP,EACA,EACA,EACA,EACM,CACN,GAAI,EAAO,WAAY,CACrB,EAAY,UAAU,EAAO,WAAW,GAAG,EAC3C,MACF,CAEA,IAAM,EAAU,EAAU,EAAO,KAAK,EAKtC,GAJA,EACE,YAAY,EAAQ,UAAU,eAAe,EAAO,aAAa,EAAQ,YAAY,SAAS,EAAQ,UAAU,cAAc,EAAQ,cAAc,IACtJ,EAEI,EAAY,SAAW,EACzB,EAAY;CAA8B,MACrC,CACL,IAAM,EAAgB,EAAY,MAAM,EAAG,EAAQ,GAAG,EAChD,EAAc,EAAY,OAAS,EAAc,OAAS,OAAO,EAAY,SAAW,GAC9F,EAAY,iCAAiC,EAAc,SAAS,EAAY,KAAK,EACrF,IAAK,GAAM,CAAC,EAAO,KAAW,EAAc,QAAQ,EAClD,EAAY,GAAG,EAAQ,EAAE,IAAI,EAAiB,CAAM,EAAE,GAAG,CAE7D,CAEA,GAAI,EAAO,SAAS,OAAS,EAAG,CAC9B,EAAY,cAAc,EAAO,SAAS,OAAO,4DAA4D,EAC7G,IAAK,IAAM,KAAW,EAAO,SAAS,MAAM,EAAG,EAAE,EAC/C,EAAY,KAAK,EAAQ,GAAG,EAE1B,EAAO,SAAS,OAAS,IAC3B,EAAY,SAAS,EAAO,SAAS,OAAS,GAAG,QAAQ,CAE7D,CAEA,GAAI,EAAO,OAAO,OAAS,EAAG,CAC5B,EAAY,aAAa,EAAO,OAAO,OAAO,yBAAyB,EACvE,IAAK,IAAM,KAAS,EAAO,OAAO,MAAM,EAAG,EAAE,EAC3C,EAAY,KAAK,EAAM,GAAG,EAExB,EAAO,OAAO,OAAS,IACzB,EAAY,SAAS,EAAO,OAAO,OAAS,GAAG,QAAQ,CAE3D,CACF,CAGA,SAAS,EAAiB,EAA4B,CACpD,IAAM,EAAoB,CAAC,EAC3B,GAAI,EAAO,cAAe,CACxB,IAAM,EAAK,EAAO,cAClB,EAAQ,KACN,kBAAkB,EAAG,KAAK,KAAK,EAAG,UAAU,GAAG,EAAG,QAAQ,cAAc,EAAG,oBAAoB,SAAS,EAAG,KAAK,YAAY,EAAG,cACjI,CACF,CACA,GAAI,EAAO,oBAAsB,EAAG,CAClC,IAAM,EACJ,EAAO,kBAAkB,OAAS,EAC9B,iBAAiB,EAAO,kBAAkB,MAAM,EAAG,CAAoB,CAAC,CAAC,KAAK,IAAI,IAAI,EAAO,kBAAkB,OAAS,EAAuB,QAAU,KACzJ,GACN,EAAQ,KACN,oBAAoB,EAAO,oBAAoB,IAAI,KAAK,MAAM,EAAO,oBAAsB,GAAG,EAAE,GAAG,EAAe,EACpH,CACF,CAEA,OADA,EAAQ,KAAK,aAAa,EAAO,MAAM,EAChC,GAAG,EAAO,KAAK,UAAU,EAAO,MAAM,QAAQ,CAAC,EAAE,KAAK,EAAQ,KAAK,IAAI,GAChF,CAEA,SAAS,EAAU,EAMjB,CACA,IAAI,EAAgB,EAChB,EAAc,EACd,EAAyB,EACzB,EAAY,EAEhB,IAAK,IAAM,KAAQ,EACjB,GAAiB,EAAK,QAAQ,UAAU,OACxC,GAAe,EAAK,QAAQ,MAAM,KAClC,EAAyB,KAAK,IAAI,EAAwB,EAAK,QAAQ,sBAAsB,EAC7F,GAAa,EAAK,QAAQ,UAG5B,MAAO,CAAE,UAAW,EAAM,OAAQ,gBAAe,cAAa,yBAAwB,WAAU,CAClG,CAEA,SAAS,EAAoB,EAAc,EAAmC,CAS5E,OARI,EAAsB,IAAI,CAAI,EACzB,GAGT,CAAI,EAAQ,cAIL,EAAmB,IAAI,CAAI,CACpC,CAEA,SAAS,EAAkB,EAAmB,EAA4B,CACxE,IAAM,EAAWP,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,CAEA,SAAS,EAAY,EAAc,EAA0B,EAAiB,GAAiC,CAC7G,IAAM,EAAY,EAAK,YAAY,EAEjC,MAAC,IACA,EAAU,SAAS,OAAO,GACzB,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,SAAS,GAC5B,EAAU,SAAS,UAAU,KAM/B,GAAC,GACD,CAAC,EAAQ,eACR,EAAgB,KAAKA,EAAAA,QAAK,SAAS,CAAI,CAAC,GAAK,EAAoB,KAAKA,EAAAA,QAAK,SAAS,CAAI,CAAC,IAU5F,OAJIA,EAAAA,QAAK,QAAQ,CAAI,IAAM,KAClB,MAGF,EAAoB,IAAIA,EAAAA,QAAK,QAAQ,CAAS,CAAC,CACxD,CAEA,SAAS,EAAoB,EAAuB,CAClD,IAAM,EAAS,EAAqB,CAAK,EACzC,GAAI,EAAS,IACX,MAAM,IAAIQ,EAAAA,qBAAqB,wCAAwC,EAEzE,OAAO,CACT,CAEA,SAAS,EAAwB,EAAuB,CACtD,GAAI,CAAC,SAAS,KAAK,CAAK,EACtB,MAAM,IAAIA,EAAAA,qBAAqB,kCAAkC,EAGnE,IAAM,EAAS,OAAO,CAAK,EAC3B,GAAI,CAAC,OAAO,cAAc,CAAM,GAAK,EAAS,EAC5C,MAAM,IAAIA,EAAAA,qBAAqB,kCAAkC,EAEnE,OAAO,CACT,CAEA,SAAS,EAAqB,EAAuB,CACnD,GAAI,CAAC,cAAc,KAAK,CAAK,EAC3B,MAAM,IAAIA,EAAAA,qBAAqB,8BAA8B,EAG/D,IAAM,EAAS,OAAO,CAAK,EAC3B,GAAI,CAAC,OAAO,cAAc,CAAM,GAAK,EAAS,EAC5C,MAAM,IAAIA,EAAAA,qBAAqB,8BAA8B,EAE/D,OAAO,CACT,CAEA,SAAS,EAAW,EAAc,EAAsB,CACtD,OAAOR,EAAAA,QAAK,SAAS,EAAM,CAAI,GAAKA,EAAAA,QAAK,SAAS,CAAI,CACxD,CAEA,SAAS,EAAY,EAAuB,CAC1C,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAS,EAAY,EAAuB,CAC1C,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAS,EAAY,EAAwB,CAC3C,OAAO,aAAiB,MAAQ,EAAM,QAAU,OAAO,CAAK,CAC9D"}
+{"version":3,"file":"cli.cjs","names":["formatError","configFileName","Command","resolveTarget","loadConfig","configSearchDirectory","resolveOptions","scanTarget","runDiffCommand","formatPath","collectDuplicatedLineNumbers","InvalidArgumentError"],"sources":["../src/cli.ts"],"sourcesContent":["#!/usr/bin/env node\n\nimport { Command, InvalidArgumentError } from 'commander';\nimport { type CliOptions, configFileName, loadConfig, type ResolvedOptions, resolveOptions } from './cliConfig.js';\nimport type { CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport { runDiffCommand, type DiffCliOptions } from './diffCommand.js';\nimport {\n  addCrossFileDuplication,\n  collectDuplicatedLineNumbers,\n  configSearchDirectory,\n  formatError,\n  formatPath,\n  resolveTarget,\n  scanTarget,\n  writeStderr,\n  writeStdout,\n  type FileMetrics,\n  type ScanResult,\n} from './scan.js';\nimport type { FunctionMetrics } from './types.js';\n\n/** The worst (highest-cognitive-complexity) function of a file, reported as the ranking evidence. */\ninterface WorstFunction {\n  name: string;\n  startLine: number;\n  endLine: number;\n  cognitiveComplexity: number;\n  ncss: number;\n  nestingDepth: number;\n}\n\n/**\n * One ranked refactoring candidate. The score is the sum of the file's repo-relative percentile\n * ranks (each in [0, 1)) over three dimensions: worst-function cognitive complexity, duplicated\n * lines (within-file and cross-file combined), and file NCSS. Ranking is relative to the scanned\n * project, so no absolute threshold is involved.\n */\ninterface RankedFile {\n  file: string;\n  score: number;\n  worstFunction?: WorstFunction;\n  /** Distinct lines covered by within-file duplicate blocks or cross-file duplicate occurrences. */\n  duplicatedLineCount: number;\n  /** duplicatedLineCount / code lines (0 when the file has no code). */\n  duplicatedLineRatio: number;\n  /** Other files sharing cross-file duplicate blocks; filled only for the reported top files. */\n  crossFilePartners: string[];\n  ncss: number;\n  codeLines: number;\n}\n\n/** Caps how many cross-file partners a ranked file lists so the report stays scannable. */\nconst maxCrossFilePartners = 3;\n\n// oxlint-disable-next-line unicorn/prefer-top-level-await -- CommonJS build output cannot preserve top-level await.\nvoid main().catch((error: unknown) => {\n  writeStderr(`Error: ${formatError(error)}\\n`);\n  process.exitCode = 1;\n});\n\n/** Registers the options shared by the ranking command and the diff gate. */\nfunction addSharedOptions(command: Command): Command {\n  return command\n    .option('--config <path>', `config file to use instead of the auto-detected ${configFileName}`)\n    .option(\n      '--duplication-min-tokens <number>',\n      'minimum normalized token count for a duplicate region (default 40)',\n      parsePositiveInteger\n    )\n    .option(\n      '--duplication-max-gap-tokens <number>',\n      'maximum token gap merged into one gapped clone group; 0 disables merging (default 30)',\n      parseNonNegativeInteger\n    )\n    .option(\n      '--duplication-min-similarity-percent <number>',\n      'minimum similarity percent (1-100) for near-miss (Type-3) clone blocks; 100 reports exact matches only (default 70)',\n      parsePercentInteger\n    )\n    .option('--include-tests', 'include test files and test directories')\n    .option('--json', 'print JSON output');\n}\n\nasync function main(): Promise<void> {\n  const program = addSharedOptions(\n    new Command()\n      .name('code-gauge')\n      .description('Rank the files of a project by refactoring priority.')\n      .argument('[target]', 'file or directory to measure', '.')\n  )\n    .option('--top <number>', 'number of top-ranked files to report (default: 10)', parsePositiveInteger)\n    .option('--fail-on-error', 'exit with code 1 when files or directories cannot be scanned');\n\n  program.action(async (target: string, cliOptions: CliOptions) => {\n    const resolvedTarget = resolveTarget(target);\n    const config = await loadConfig(cliOptions.config, await configSearchDirectory(resolvedTarget));\n    const options = resolveOptions(cliOptions, config);\n    const result = await scanTarget(resolvedTarget, options);\n    addCrossFileDuplication(result, options);\n    const rankedFiles = rankFiles(result, options.top);\n\n    if (options.json) {\n      printJson(result, rankedFiles, options);\n    } else {\n      printTextReport(resolvedTarget, result, rankedFiles, options);\n    }\n\n    if (result.fatalError || (options.failOnError && result.errors.length > 0)) {\n      process.exitCode = 1;\n    }\n  });\n\n  addSharedOptions(\n    program\n      .command('diff')\n      .description(\n        'Gate the working tree against a base ref: report only metric regressions in changed files (exit 1 on violations)'\n      )\n      .argument('[target]', 'directory whose changed files are gated', '.')\n      .requiredOption('--base <ref>', 'base git ref; changes are measured against its merge-base with HEAD')\n  )\n    .option('--full', 'also print the passing gate values of every checked function and file')\n    .action(async (target: string, _cliOptions: DiffCliOptions, command: Command) => {\n      // Options sharing a name with a root option (--json, --config, ...) land in the root's\n      // option store, so the merged view is required to see them.\n      await runDiffCommand(target, command.optsWithGlobals() as DiffCliOptions);\n    });\n\n  await program.parseAsync();\n}\n\nfunction rankFiles(result: ScanResult, top: number): RankedFile[] {\n  const candidates = result.files.map(({ file, metrics }) => {\n    const formattedFile = formatPath(file, result.displayRoot);\n    const duplicatedLines = collectDuplicatedLineNumbers(metrics, result.crossFileDuplication, formattedFile);\n    return {\n      file: formattedFile,\n      worstFunction: findWorstFunction(metrics.functions),\n      duplicatedLineCount: duplicatedLines.size,\n      duplicatedLineRatio: metrics.lines.code === 0 ? 0 : duplicatedLines.size / metrics.lines.code,\n      crossFilePartners: [] as string[],\n      ncss: metrics.ncssCount,\n      codeLines: metrics.lines.code,\n    };\n  });\n\n  const cognitivePercentile = makePercentile(candidates.map((c) => c.worstFunction?.cognitiveComplexity ?? 0));\n  const duplicationPercentile = makePercentile(candidates.map((c) => c.duplicatedLineCount));\n  const ncssPercentile = makePercentile(candidates.map((c) => c.ncss));\n\n  const ranked = candidates\n    .map((candidate) => ({\n      ...candidate,\n      score:\n        cognitivePercentile(candidate.worstFunction?.cognitiveComplexity ?? 0) +\n        duplicationPercentile(candidate.duplicatedLineCount) +\n        ncssPercentile(candidate.ncss),\n    }))\n    .toSorted(\n      (left, right) => right.score - left.score || right.ncss - left.ncss || left.file.localeCompare(right.file)\n    );\n  // Partner evidence is attached only to the files that will be reported: expanding partners for\n  // every scanned file first would retain TH(F^2) strings when one clone group spans F files, and\n  // rescanning all groups per file would be O(files x groups) on the post-scan ranking step.\n  attachCrossFilePartners(ranked.slice(0, top), result.crossFileDuplication);\n  return ranked;\n}\n\n/** One pass over the groups fills the reported files' partner lists (other files sharing a group). */\nfunction attachCrossFilePartners(\n  reportedFiles: RankedFile[],\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined\n): void {\n  if (!crossFileDuplication) {\n    return;\n  }\n  const partnersByFile = new Map(reportedFiles.map((ranked) => [ranked.file, new Set<string>()]));\n  for (const group of crossFileDuplication.groups) {\n    for (const file of group.files) {\n      const partners = partnersByFile.get(file);\n      if (!partners) {\n        continue;\n      }\n      for (const partner of group.files) {\n        if (partner !== file) {\n          partners.add(partner);\n        }\n      }\n    }\n  }\n  for (const ranked of reportedFiles) {\n    ranked.crossFilePartners = [...(partnersByFile.get(ranked.file) ?? [])].toSorted();\n  }\n}\n\n/**\n * Percentile rank within the scanned project: the fraction of files with a strictly smaller\n * value, in [0, 1). Relative ranking needs no absolute threshold, which sidesteps the metric\n * calibration problem entirely — the top of the list is worth refactoring first regardless of\n * where any cutoff would sit.\n */\nfunction makePercentile(values: number[]): (value: number) => number {\n  const sorted = values.toSorted((left, right) => left - right);\n  return (value: number) => {\n    let low = 0;\n    let high = sorted.length;\n    while (low < high) {\n      const middle = (low + high) >> 1;\n      if ((sorted[middle] as number) < value) {\n        low = middle + 1;\n      } else {\n        high = middle;\n      }\n    }\n    return sorted.length === 0 ? 0 : low / sorted.length;\n  };\n}\n\n/** The highest-cognitive-complexity function; NCSS breaks ties so the larger body is reported. */\nfunction findWorstFunction(functions: FunctionMetrics[]): WorstFunction | undefined {\n  let worst: FunctionMetrics | undefined;\n  for (const fn of functions) {\n    if (\n      !worst ||\n      fn.cognitiveComplexity > worst.cognitiveComplexity ||\n      (fn.cognitiveComplexity === worst.cognitiveComplexity && fn.ncss > worst.ncss)\n    ) {\n      worst = fn;\n    }\n  }\n  if (!worst) {\n    return undefined;\n  }\n  return {\n    name: worst.name ?? '<anonymous>',\n    startLine: worst.startLine,\n    endLine: worst.endLine,\n    cognitiveComplexity: worst.cognitiveComplexity,\n    ncss: worst.ncss,\n    nestingDepth: worst.nestingDepth,\n  };\n}\n\nfunction printJson(result: ScanResult, rankedFiles: RankedFile[], options: ResolvedOptions): void {\n  const reportedFiles = rankedFiles.slice(0, options.top);\n  writeStdout(\n    JSON.stringify(\n      {\n        summary: summarize(result.files),\n        totalRankedFiles: rankedFiles.length,\n        truncated: reportedFiles.length < rankedFiles.length,\n        files: reportedFiles,\n        errors: result.errors,\n        warnings: result.warnings,\n      },\n      undefined,\n      2\n    ) + '\\n'\n  );\n}\n\nfunction printTextReport(\n  target: string,\n  result: ScanResult,\n  rankedFiles: RankedFile[],\n  options: ResolvedOptions\n): void {\n  if (result.fatalError) {\n    writeStderr(`Error: ${result.fatalError}\\n`);\n    return;\n  }\n\n  const summary = summarize(result.files);\n  writeStdout(\n    `Measured ${summary.fileCount} files under ${target} (code LOC ${summary.linesOfCode}, NCSS ${summary.ncssCount}, functions ${summary.functionCount})\\n`\n  );\n\n  if (rankedFiles.length === 0) {\n    writeStdout('No measurable files found.\\n');\n  } else {\n    const reportedFiles = rankedFiles.slice(0, options.top);\n    const totalSuffix = rankedFiles.length > reportedFiles.length ? ` of ${rankedFiles.length}` : '';\n    writeStdout(`\\nRefactoring candidates (top ${reportedFiles.length}${totalSuffix}):\\n`);\n    for (const [index, ranked] of reportedFiles.entries()) {\n      writeStdout(`${index + 1}. ${formatRankedFile(ranked)}\\n`);\n    }\n  }\n\n  if (result.warnings.length > 0) {\n    writeStderr(`\\nDegraded ${result.warnings.length} files (measured, but excluded from cross-file matching):\\n`);\n    for (const warning of result.warnings.slice(0, 10)) {\n      writeStderr(`- ${warning}\\n`);\n    }\n    if (result.warnings.length > 10) {\n      writeStderr(`- ... ${result.warnings.length - 10} more\\n`);\n    }\n  }\n\n  if (result.errors.length > 0) {\n    writeStderr(`\\nSkipped ${result.errors.length} files or directories:\\n`);\n    for (const error of result.errors.slice(0, 10)) {\n      writeStderr(`- ${error}\\n`);\n    }\n    if (result.errors.length > 10) {\n      writeStderr(`- ... ${result.errors.length - 10} more\\n`);\n    }\n  }\n}\n\n/** One ranked file as a single line: the location, the evidence, and where the duplication points. */\nfunction formatRankedFile(ranked: RankedFile): string {\n  const reasons: string[] = [];\n  if (ranked.worstFunction) {\n    const fn = ranked.worstFunction;\n    reasons.push(\n      `worst function ${fn.name} (L${fn.startLine}-${fn.endLine}) cognitive ${fn.cognitiveComplexity}, NCSS ${fn.ncss}, nesting ${fn.nestingDepth}`\n    );\n  }\n  if (ranked.duplicatedLineCount > 0) {\n    const partnersSuffix =\n      ranked.crossFilePartners.length > 0\n        ? `, shared with ${ranked.crossFilePartners.slice(0, maxCrossFilePartners).join(', ')}${ranked.crossFilePartners.length > maxCrossFilePartners ? ', ...' : ''}`\n        : '';\n    reasons.push(\n      `duplicated lines ${ranked.duplicatedLineCount} (${Math.round(ranked.duplicatedLineRatio * 100)}%${partnersSuffix})`\n    );\n  }\n  reasons.push(`file NCSS ${ranked.ncss}`);\n  return `${ranked.file} (score ${ranked.score.toFixed(2)}): ${reasons.join('; ')}`;\n}\n\nfunction summarize(files: FileMetrics[]): {\n  fileCount: number;\n  functionCount: number;\n  linesOfCode: number;\n  maxCognitiveComplexity: number;\n  ncssCount: number;\n} {\n  let functionCount = 0;\n  let linesOfCode = 0;\n  let maxCognitiveComplexity = 0;\n  let ncssCount = 0;\n\n  for (const file of files) {\n    functionCount += file.metrics.functions.length;\n    linesOfCode += file.metrics.lines.code;\n    maxCognitiveComplexity = Math.max(maxCognitiveComplexity, file.metrics.maxCognitiveComplexity);\n    ncssCount += file.metrics.ncssCount;\n  }\n\n  return { fileCount: files.length, functionCount, linesOfCode, maxCognitiveComplexity, ncssCount };\n}\n\nfunction parsePercentInteger(value: string): number {\n  const parsed = parsePositiveInteger(value);\n  if (parsed > 100) {\n    throw new InvalidArgumentError('Expected an integer between 1 and 100.');\n  }\n  return parsed;\n}\n\nfunction parseNonNegativeInteger(value: string): number {\n  if (!/^\\d+$/u.test(value)) {\n    throw new InvalidArgumentError('Expected a non-negative integer.');\n  }\n\n  const parsed = Number(value);\n  if (!Number.isSafeInteger(parsed) || parsed < 0) {\n    throw new InvalidArgumentError('Expected a non-negative integer.');\n  }\n  return parsed;\n}\n\nfunction parsePositiveInteger(value: string): number {\n  if (!/^[1-9]\\d*$/u.test(value)) {\n    throw new InvalidArgumentError('Expected a positive integer.');\n  }\n\n  const parsed = Number(value);\n  if (!Number.isSafeInteger(parsed) || parsed < 1) {\n    throw new InvalidArgumentError('Expected a positive integer.');\n  }\n  return parsed;\n}\n"],"mappings":";kIAuDK,EAAK,CAAC,CAAC,MAAO,GAAmB,CACpC,EAAA,YAAY,UAAUA,EAAAA,YAAY,CAAK,EAAE,GAAG,EAC5C,QAAQ,SAAW,CACrB,CAAC,EAGD,SAAS,EAAiB,EAA2B,CACnD,OAAO,EACJ,OAAO,kBAAmB,mDAAmDC,EAAAA,gBAAgB,CAAC,CAC9F,OACC,oCACA,qEACA,CACF,CAAC,CACA,OACC,wCACA,wFACA,CACF,CAAC,CACA,OACC,gDACA,sHACA,CACF,CAAC,CACA,OAAO,kBAAmB,yCAAyC,CAAC,CACpE,OAAO,SAAU,mBAAmB,CACzC,CAEA,eAAe,GAAsB,CACnC,IAAM,EAAU,EACd,IAAIC,EAAAA,QAAQ,CAAC,CACV,KAAK,YAAY,CAAC,CAClB,YAAY,sDAAsD,CAAC,CACnE,SAAS,WAAY,+BAAgC,GAAG,CAC7D,CAAC,CACE,OAAO,iBAAkB,qDAAsD,CAAoB,CAAC,CACpG,OAAO,kBAAmB,8DAA8D,EAE3F,EAAQ,OAAO,MAAO,EAAgB,IAA2B,CAC/D,IAAM,EAAiBC,EAAAA,cAAc,CAAM,EACrC,EAAS,MAAMC,EAAAA,WAAW,EAAW,OAAQ,MAAMC,EAAAA,sBAAsB,CAAc,CAAC,EACxF,EAAUC,EAAAA,eAAe,EAAY,CAAM,EAC3C,EAAS,MAAMC,EAAAA,WAAW,EAAgB,CAAO,EACvD,EAAA,wBAAwB,EAAQ,CAAO,EACvC,IAAM,EAAc,EAAU,EAAQ,EAAQ,GAAG,EAE7C,EAAQ,KACV,EAAU,EAAQ,EAAa,CAAO,EAEtC,EAAgB,EAAgB,EAAQ,EAAa,CAAO,GAG1D,EAAO,YAAe,EAAQ,aAAe,EAAO,OAAO,OAAS,KACtE,QAAQ,SAAW,EAEvB,CAAC,EAED,EACE,EACG,QAAQ,MAAM,CAAC,CACf,YACC,kHACF,CAAC,CACA,SAAS,WAAY,0CAA2C,GAAG,CAAC,CACpE,eAAe,eAAgB,qEAAqE,CACzG,CAAC,CACE,OAAO,SAAU,uEAAuE,CAAC,CACzF,OAAO,MAAO,EAAgB,EAA6B,IAAqB,CAG/E,MAAMC,EAAAA,eAAe,EAAQ,EAAQ,gBAAgB,CAAmB,CAC1E,CAAC,EAEH,MAAM,EAAQ,WAAW,CAC3B,CAEA,SAAS,EAAU,EAAoB,EAA2B,CAChE,IAAM,EAAa,EAAO,MAAM,KAAK,CAAE,OAAM,aAAc,CACzD,IAAM,EAAgBC,EAAAA,WAAW,EAAM,EAAO,WAAW,EACnD,EAAkBC,EAAAA,6BAA6B,EAAS,EAAO,qBAAsB,CAAa,EACxG,MAAO,CACL,KAAM,EACN,cAAe,EAAkB,EAAQ,SAAS,EAClD,oBAAqB,EAAgB,KACrC,oBAAqB,EAAQ,MAAM,OAAS,EAAI,EAAI,EAAgB,KAAO,EAAQ,MAAM,KACzF,kBAAmB,CAAC,EACpB,KAAM,EAAQ,UACd,UAAW,EAAQ,MAAM,IAC3B,CACF,CAAC,EAEK,EAAsB,EAAe,EAAW,IAAK,GAAM,EAAE,eAAe,qBAAuB,CAAC,CAAC,EACrG,EAAwB,EAAe,EAAW,IAAK,GAAM,EAAE,mBAAmB,CAAC,EACnF,EAAiB,EAAe,EAAW,IAAK,GAAM,EAAE,IAAI,CAAC,EAE7D,EAAS,EACZ,IAAK,IAAe,CACnB,GAAG,EACH,MACE,EAAoB,EAAU,eAAe,qBAAuB,CAAC,EACrE,EAAsB,EAAU,mBAAmB,EACnD,EAAe,EAAU,IAAI,CACjC,EAAE,CAAC,CACF,UACE,EAAM,IAAU,EAAM,MAAQ,EAAK,OAAS,EAAM,KAAO,EAAK,MAAQ,EAAK,KAAK,cAAc,EAAM,IAAI,CAC3G,EAKF,OADA,EAAwB,EAAO,MAAM,EAAG,CAAG,EAAG,EAAO,oBAAoB,EAClE,CACT,CAGA,SAAS,EACP,EACA,EACM,CACN,GAAI,CAAC,EACH,OAEF,IAAM,EAAiB,IAAI,IAAI,EAAc,IAAK,GAAW,CAAC,EAAO,KAAM,IAAI,GAAa,CAAC,CAAC,EAC9F,IAAK,IAAM,KAAS,EAAqB,OACvC,IAAK,IAAM,KAAQ,EAAM,MAAO,CAC9B,IAAM,EAAW,EAAe,IAAI,CAAI,EACnC,KAGL,IAAK,IAAM,KAAW,EAAM,MACtB,IAAY,GACd,EAAS,IAAI,CAAO,CAG1B,CAEF,IAAK,IAAM,KAAU,EACnB,EAAO,kBAAoB,CAAC,GAAI,EAAe,IAAI,EAAO,IAAI,GAAK,CAAC,CAAE,CAAC,CAAC,SAAS,CAErF,CAQA,SAAS,EAAe,EAA6C,CACnE,IAAM,EAAS,EAAO,UAAU,EAAM,IAAU,EAAO,CAAK,EAC5D,MAAQ,IAAkB,CACxB,IAAI,EAAM,EACN,EAAO,EAAO,OAClB,KAAO,EAAM,GAAM,CACjB,IAAM,EAAU,EAAM,GAAS,EAC1B,EAAO,GAAqB,EAC/B,EAAM,EAAS,EAEf,EAAO,CAEX,CACA,OAAO,EAAO,SAAW,EAAI,EAAI,EAAM,EAAO,MAChD,CACF,CAGA,SAAS,EAAkB,EAAyD,CAClF,IAAI,EACJ,IAAK,IAAM,KAAM,GAEb,CAAC,GACD,EAAG,oBAAsB,EAAM,qBAC9B,EAAG,sBAAwB,EAAM,qBAAuB,EAAG,KAAO,EAAM,QAEzE,EAAQ,GAGP,KAGL,MAAO,CACL,KAAM,EAAM,MAAQ,cACpB,UAAW,EAAM,UACjB,QAAS,EAAM,QACf,oBAAqB,EAAM,oBAC3B,KAAM,EAAM,KACZ,aAAc,EAAM,YACtB,CACF,CAEA,SAAS,EAAU,EAAoB,EAA2B,EAAgC,CAChG,IAAM,EAAgB,EAAY,MAAM,EAAG,EAAQ,GAAG,EACtD,EAAA,YACE,KAAK,UACH,CACE,QAAS,EAAU,EAAO,KAAK,EAC/B,iBAAkB,EAAY,OAC9B,UAAW,EAAc,OAAS,EAAY,OAC9C,MAAO,EACP,OAAQ,EAAO,OACf,SAAU,EAAO,QACnB,EACA,IAAA,GACA,CACF,EAAI;CACN,CACF,CAEA,SAAS,EACP,EACA,EACA,EACA,EACM,CACN,GAAI,EAAO,WAAY,CACrB,EAAA,YAAY,UAAU,EAAO,WAAW,GAAG,EAC3C,MACF,CAEA,IAAM,EAAU,EAAU,EAAO,KAAK,EAKtC,GAJA,EAAA,YACE,YAAY,EAAQ,UAAU,eAAe,EAAO,aAAa,EAAQ,YAAY,SAAS,EAAQ,UAAU,cAAc,EAAQ,cAAc,IACtJ,EAEI,EAAY,SAAW,EACzB,EAAA,YAAY;CAA8B,MACrC,CACL,IAAM,EAAgB,EAAY,MAAM,EAAG,EAAQ,GAAG,EAChD,EAAc,EAAY,OAAS,EAAc,OAAS,OAAO,EAAY,SAAW,GAC9F,EAAA,YAAY,iCAAiC,EAAc,SAAS,EAAY,KAAK,EACrF,IAAK,GAAM,CAAC,EAAO,KAAW,EAAc,QAAQ,EAClD,EAAA,YAAY,GAAG,EAAQ,EAAE,IAAI,EAAiB,CAAM,EAAE,GAAG,CAE7D,CAEA,GAAI,EAAO,SAAS,OAAS,EAAG,CAC9B,EAAA,YAAY,cAAc,EAAO,SAAS,OAAO,4DAA4D,EAC7G,IAAK,IAAM,KAAW,EAAO,SAAS,MAAM,EAAG,EAAE,EAC/C,EAAA,YAAY,KAAK,EAAQ,GAAG,EAE1B,EAAO,SAAS,OAAS,IAC3B,EAAA,YAAY,SAAS,EAAO,SAAS,OAAS,GAAG,QAAQ,CAE7D,CAEA,GAAI,EAAO,OAAO,OAAS,EAAG,CAC5B,EAAA,YAAY,aAAa,EAAO,OAAO,OAAO,yBAAyB,EACvE,IAAK,IAAM,KAAS,EAAO,OAAO,MAAM,EAAG,EAAE,EAC3C,EAAA,YAAY,KAAK,EAAM,GAAG,EAExB,EAAO,OAAO,OAAS,IACzB,EAAA,YAAY,SAAS,EAAO,OAAO,OAAS,GAAG,QAAQ,CAE3D,CACF,CAGA,SAAS,EAAiB,EAA4B,CACpD,IAAM,EAAoB,CAAC,EAC3B,GAAI,EAAO,cAAe,CACxB,IAAM,EAAK,EAAO,cAClB,EAAQ,KACN,kBAAkB,EAAG,KAAK,KAAK,EAAG,UAAU,GAAG,EAAG,QAAQ,cAAc,EAAG,oBAAoB,SAAS,EAAG,KAAK,YAAY,EAAG,cACjI,CACF,CACA,GAAI,EAAO,oBAAsB,EAAG,CAClC,IAAM,EACJ,EAAO,kBAAkB,OAAS,EAC9B,iBAAiB,EAAO,kBAAkB,MAAM,EAAG,CAAoB,CAAC,CAAC,KAAK,IAAI,IAAI,EAAO,kBAAkB,OAAS,EAAuB,QAAU,KACzJ,GACN,EAAQ,KACN,oBAAoB,EAAO,oBAAoB,IAAI,KAAK,MAAM,EAAO,oBAAsB,GAAG,EAAE,GAAG,EAAe,EACpH,CACF,CAEA,OADA,EAAQ,KAAK,aAAa,EAAO,MAAM,EAChC,GAAG,EAAO,KAAK,UAAU,EAAO,MAAM,QAAQ,CAAC,EAAE,KAAK,EAAQ,KAAK,IAAI,GAChF,CAEA,SAAS,EAAU,EAMjB,CACA,IAAI,EAAgB,EAChB,EAAc,EACd,EAAyB,EACzB,EAAY,EAEhB,IAAK,IAAM,KAAQ,EACjB,GAAiB,EAAK,QAAQ,UAAU,OACxC,GAAe,EAAK,QAAQ,MAAM,KAClC,EAAyB,KAAK,IAAI,EAAwB,EAAK,QAAQ,sBAAsB,EAC7F,GAAa,EAAK,QAAQ,UAG5B,MAAO,CAAE,UAAW,EAAM,OAAQ,gBAAe,cAAa,yBAAwB,WAAU,CAClG,CAEA,SAAS,EAAoB,EAAuB,CAClD,IAAM,EAAS,EAAqB,CAAK,EACzC,GAAI,EAAS,IACX,MAAM,IAAIC,EAAAA,qBAAqB,wCAAwC,EAEzE,OAAO,CACT,CAEA,SAAS,EAAwB,EAAuB,CACtD,GAAI,CAAC,SAAS,KAAK,CAAK,EACtB,MAAM,IAAIA,EAAAA,qBAAqB,kCAAkC,EAGnE,IAAM,EAAS,OAAO,CAAK,EAC3B,GAAI,CAAC,OAAO,cAAc,CAAM,GAAK,EAAS,EAC5C,MAAM,IAAIA,EAAAA,qBAAqB,kCAAkC,EAEnE,OAAO,CACT,CAEA,SAAS,EAAqB,EAAuB,CACnD,GAAI,CAAC,cAAc,KAAK,CAAK,EAC3B,MAAM,IAAIA,EAAAA,qBAAqB,8BAA8B,EAG/D,IAAM,EAAS,OAAO,CAAK,EAC3B,GAAI,CAAC,OAAO,cAAc,CAAM,GAAK,EAAS,EAC5C,MAAM,IAAIA,EAAAA,qBAAqB,8BAA8B,EAE/D,OAAO,CACT"}

package/dist/cli.js

@@ -1,5 +1,5 @@
 #!/usr/bin/env node
-import{measureCrossFileDuplication as e}from"./crossFileDuplication.js";import{collectCrossFileDuplicationFileData as t,measureCode as n}from"./metrics.js";import{configFileName as r,loadConfig as i,resolveOptions as a}from"./cliConfig.js";import{readFile as o,readdir as s,realpath as c,stat as l}from"node:fs/promises";import u from"node:os";import d from"node:path";import{Command as f,InvalidArgumentError as p}from"commander";const m=new Map([[`.c`,`c`],[`.c++`,`cpp`],[`.cc`,`cpp`],[`.cjs`,`javascript`],[`.cp`,`cpp`],[`.cpp`,`cpp`],[`.tcc`,`cpp`],[`.cts`,`typescript`],[`.cxx`,`cpp`],[`.go`,`go`],[`.h`,`cpp`],[`.hh`,`cpp`],[`.hpp`,`cpp`],[`.hxx`,`cpp`],[`.java`,`java`],[`.js`,`javascript`],[`.jsx`,`jsx`],[`.mjs`,`javascript`],[`.mts`,`typescript`],[`.py`,`python`],[`.rb`,`ruby`],[`.rs`,`rust`],[`.ts`,`typescript`],[`.tsx`,`tsx`]]),h=new Set([`.agents`,`.claude`,`.cursor`,`.git`,`.next`,`.playwright-cli`,`.tox`,`.tmp`,`.turbo`,`.venv`,`.yarn`,`__fixtures__`,`__generated__`,`__pycache__`,`coverage`,`dist`,`fixtures`,`generated`,`node_modules`,`target`,`test-fixtures`,`vendor`,`venv`]),g=new Set([`__tests__`,`test`,`tests`,`spec`]),_=/(?:^test(?:[_-].*)?|\.(?:spec|test)|[_-](?:test|spec))\.[^.]+$/iu,v=/Test\.java$/u;y().catch(e=>{K(`Error: ${q(e)}\n`),process.exitCode=1});async function y(){let e=new f().name(`code-gauge`).description(`Rank the files of a project by refactoring priority.`).argument(`[target]`,`file or directory to measure`,`.`).option(`--config <path>`,`config file to use instead of the auto-detected ${r}`).option(`--top <number>`,`number of top-ranked files to report (default: 10)`,U).option(`--duplication-min-tokens <number>`,`minimum normalized token count for a duplicate region (default 40)`,U).option(`--duplication-max-gap-tokens <number>`,`maximum token gap merged into one gapped clone group; 0 disables merging (default 30)`,H).option(`--duplication-min-similarity-percent <number>`,`minimum similarity percent (1-100) for near-miss (Type-3) clone blocks; 100 reports exact matches only (default 70)`,V).option(`--include-tests`,`include test files and test directories`).option(`--json`,`print JSON output`).option(`--fail-on-error`,`exit with code 1 when files or directories cannot be scanned`);e.action(async(e,t)=>{let n=b(e),r=await i(t.config,await x(n)),o=a(t,r),s=await S(n,o);O(s,o);let c=k(s,o.top);o.json?P(s,c,o):F(n,s,c,o),(s.fatalError||o.failOnError&&s.errors.length>0)&&(process.exitCode=1)}),await e.parseAsync()}function b(e){return e===`~`?u.homedir():e.startsWith(`~/`)?d.join(u.homedir(),e.slice(2)):d.resolve(e)}async function x(e){try{return(await l(e)).isDirectory()?e:d.dirname(e)}catch{return d.dirname(e)}}async function S(e,t){let n=[],r=[],i=[],a=e;try{a=await c(e)}catch{}let o=d.dirname(a),s;try{s=await l(a)}catch(e){let t=`${W(a,o)}: ${q(e)}`;return{displayRoot:o,files:n,errors:[t],warnings:i,fatalError:t}}if(s.isFile()){let e=d.dirname(a),o=B(a,t,!0);if(!o){let t=`${W(a,e)}: unsupported file type`;return{displayRoot:e,files:n,errors:[t],warnings:i,fatalError:t}}let s=C(t,n,r,i,e);return await D(a,o,`single-file`,s,a),{displayRoot:e,files:n,errors:r,warnings:i}}return await w(a,C(t,n,r,i,a)),{displayRoot:a,files:n,errors:r,warnings:i}}function C(e,t,n,r,i){return{options:e,files:t,errors:n,warnings:r,visitedDirectories:new Set,visitedFiles:new Set,rootDirectory:i}}async function w(e,t){let n;try{n=await c(e)}catch(n){t.errors.push(`${W(e,t.rootDirectory)}: ${q(n)}`);return}if(!z(n,t.rootDirectory)||t.visitedDirectories.has(n))return;t.visitedDirectories.add(n);let r;try{r=await s(e,{withFileTypes:!0})}catch(n){t.errors.push(`${W(e,t.rootDirectory)}: ${q(n)}`);return}for(let n of r){let r=d.join(e,n.name);if(n.isSymbolicLink()){await T(n.name,r,t);continue}if(n.isDirectory()){if(R(n.name,t.options))continue;await w(r,t);continue}n.isFile()&&await E(r,t)}}async function T(e,t,n){let r;try{r=await c(t)}catch(e){n.errors.push(`${W(t,n.rootDirectory)}: ${q(e)}`);return}if(!z(r,n.rootDirectory))return;let i;try{i=await l(t)}catch(e){n.errors.push(`${W(t,n.rootDirectory)}: ${q(e)}`);return}if(i.isDirectory()){if(R(e,n.options)||R(d.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=B(n,t.options);i&&await D(e,i,`directory`,t,r)}async function D(e,r,i,a,s){try{let l=s??await c(e);if(a.visitedFiles.has(l))return;a.visitedFiles.add(l);let u=await o(e,`utf8`),d={language:r,duplication:a.options.duplication},f={file:e,metrics:n(u,d)};if(i===`directory`)try{f.duplicationCandidates=t(u,d)}catch(t){a.warnings.push(`${W(e,a.rootDirectory)}: cross-file duplication candidates unavailable: ${q(t)}`)}a.files.push(f)}catch(t){a.errors.push(`${W(e,a.rootDirectory)}: ${q(t)}`)}}function O(t,n){if(t.fatalError||t.files.length<2)return;let r=t.files.flatMap(({file:e,duplicationCandidates:n})=>n?[{file:W(e,t.displayRoot),...n}]:[]);r.length<2||(t.crossFileDuplication=e(r,n.duplication))}function k(e,t){let n=e.files.map(({file:t,metrics:n})=>{let r=W(t,e.displayRoot),i=N(n,e.crossFileDuplication,r);return{file:r,worstFunction:M(n.functions),duplicatedLineCount:i.size,duplicatedLineRatio:n.lines.code===0?0:i.size/n.lines.code,crossFilePartners:[],ncss:n.ncssCount,codeLines:n.lines.code}}),r=j(n.map(e=>e.worstFunction?.cognitiveComplexity??0)),i=j(n.map(e=>e.duplicatedLineCount)),a=j(n.map(e=>e.ncss)),o=n.map(e=>({...e,score:r(e.worstFunction?.cognitiveComplexity??0)+i(e.duplicatedLineCount)+a(e.ncss)})).toSorted((e,t)=>t.score-e.score||t.ncss-e.ncss||e.file.localeCompare(t.file));return A(o.slice(0,t),e.crossFileDuplication),o}function A(e,t){if(!t)return;let n=new Map(e.map(e=>[e.file,new Set]));for(let e of t.groups)for(let t of e.files){let r=n.get(t);if(r)for(let n of e.files)n!==t&&r.add(n)}for(let t of e)t.crossFilePartners=[...n.get(t.file)??[]].toSorted()}function j(e){let t=e.toSorted((e,t)=>e-t);return e=>{let n=0,r=t.length;for(;n<r;){let i=n+r>>1;t[i]<e?n=i+1:r=i}return t.length===0?0:n/t.length}}function M(e){let t;for(let n of e)(!t||n.cognitiveComplexity>t.cognitiveComplexity||n.cognitiveComplexity===t.cognitiveComplexity&&n.ncss>t.ncss)&&(t=n);if(t)return{name:t.name??`<anonymous>`,startLine:t.startLine,endLine:t.endLine,cognitiveComplexity:t.cognitiveComplexity,ncss:t.ncss,nestingDepth:t.nestingDepth}}function 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,n){let r=t.slice(0,n.top);G(JSON.stringify({summary:L(e.files),totalRankedFiles:t.length,truncated:r.length<t.length,files:r,errors:e.errors,warnings:e.warnings},void 0,2)+`
-`)}function F(e,t,n,r){if(t.fatalError){K(`Error: ${t.fatalError}\n`);return}let i=L(t.files);if(G(`Measured ${i.fileCount} files under ${e} (code LOC ${i.linesOfCode}, NCSS ${i.ncssCount}, functions ${i.functionCount})\n`),n.length===0)G(`No measurable files found.
-`);else{let e=n.slice(0,r.top),t=n.length>e.length?` of ${n.length}`:``;G(`\nRefactoring candidates (top ${e.length}${t}):\n`);for(let[t,n]of e.entries())G(`${t+1}. ${I(n)}\n`)}if(t.warnings.length>0){K(`\nDegraded ${t.warnings.length} files (measured, but excluded from cross-file matching):\n`);for(let e of t.warnings.slice(0,10))K(`- ${e}\n`);t.warnings.length>10&&K(`- ... ${t.warnings.length-10} more\n`)}if(t.errors.length>0){K(`\nSkipped ${t.errors.length} files or directories:\n`);for(let e of t.errors.slice(0,10))K(`- ${e}\n`);t.errors.length>10&&K(`- ... ${t.errors.length-10} more\n`)}}function I(e){let t=[];if(e.worstFunction){let n=e.worstFunction;t.push(`worst function ${n.name} (L${n.startLine}-${n.endLine}) cognitive ${n.cognitiveComplexity}, NCSS ${n.ncss}, nesting ${n.nestingDepth}`)}if(e.duplicatedLineCount>0){let n=e.crossFilePartners.length>0?`, shared with ${e.crossFilePartners.slice(0,3).join(`, `)}${e.crossFilePartners.length>3?`, ...`:``}`:``;t.push(`duplicated lines ${e.duplicatedLineCount} (${Math.round(e.duplicatedLineRatio*100)}%${n})`)}return t.push(`file NCSS ${e.ncss}`),`${e.file} (score ${e.score.toFixed(2)}): ${t.join(`; `)}`}function L(e){let t=0,n=0,r=0,i=0;for(let a of e)t+=a.metrics.functions.length,n+=a.metrics.lines.code,r=Math.max(r,a.metrics.maxCognitiveComplexity),i+=a.metrics.ncssCount;return{fileCount:e.length,functionCount:t,linesOfCode:n,maxCognitiveComplexity:r,ncssCount:i}}function R(e,t){return h.has(e)?!0:!t.includeTests&&g.has(e)}function z(e,t){let n=d.relative(t,e);return n===``||n!==`..`&&!n.startsWith(`..${d.sep}`)&&!d.isAbsolute(n)}function B(e,t,n=!1){let r=e.toLowerCase();if(!(!n&&(r.endsWith(`.d.ts`)||r.endsWith(`.d.mts`)||r.endsWith(`.d.cts`)||r.endsWith(`.min.js`)||r.endsWith(`.pnp.cjs`)))&&!(!n&&!t.includeTests&&(_.test(d.basename(e))||v.test(d.basename(e)))))return d.extname(e)===`.C`?`cpp`:m.get(d.extname(r))}function V(e){let t=U(e);if(t>100)throw new p(`Expected an integer between 1 and 100.`);return t}function H(e){if(!/^\d+$/u.test(e))throw new p(`Expected a non-negative integer.`);let t=Number(e);if(!Number.isSafeInteger(t)||t<0)throw new p(`Expected a non-negative integer.`);return t}function U(e){if(!/^[1-9]\d*$/u.test(e))throw new p(`Expected a positive integer.`);let t=Number(e);if(!Number.isSafeInteger(t)||t<1)throw new p(`Expected a positive integer.`);return t}function W(e,t){return d.relative(t,e)||d.basename(e)}function G(e){process.stdout.write(e)}function K(e){process.stderr.write(e)}function q(e){return e instanceof Error?e.message:String(e)}
+import{configFileName as e,loadConfig as t,resolveOptions as n}from"./cliConfig.js";import{addCrossFileDuplication as r,collectDuplicatedLineNumbers as i,configSearchDirectory as a,formatError as o,formatPath as s,resolveTarget as c,scanTarget as l,writeStderr as u,writeStdout as d}from"./scan.js";import{runDiffCommand as f}from"./diffCommand.js";import{Command as p,InvalidArgumentError as m}from"commander";g().catch(e=>{u(`Error: ${o(e)}\n`),process.exitCode=1});function h(t){return t.option(`--config <path>`,`config file to use instead of the auto-detected ${e}`).option(`--duplication-min-tokens <number>`,`minimum normalized token count for a duplicate region (default 40)`,D).option(`--duplication-max-gap-tokens <number>`,`maximum token gap merged into one gapped clone group; 0 disables merging (default 30)`,E).option(`--duplication-min-similarity-percent <number>`,`minimum similarity percent (1-100) for near-miss (Type-3) clone blocks; 100 reports exact matches only (default 70)`,T).option(`--include-tests`,`include test files and test directories`).option(`--json`,`print JSON output`)}async function g(){let e=h(new p().name(`code-gauge`).description(`Rank the files of a project by refactoring priority.`).argument(`[target]`,`file or directory to measure`,`.`)).option(`--top <number>`,`number of top-ranked files to report (default: 10)`,D).option(`--fail-on-error`,`exit with code 1 when files or directories cannot be scanned`);e.action(async(e,i)=>{let o=c(e),s=await t(i.config,await a(o)),u=n(i,s),d=await l(o,u);r(d,u);let f=_(d,u.top);u.json?x(d,f,u):S(o,d,f,u),(d.fatalError||u.failOnError&&d.errors.length>0)&&(process.exitCode=1)}),h(e.command(`diff`).description(`Gate the working tree against a base ref: report only metric regressions in changed files (exit 1 on violations)`).argument(`[target]`,`directory whose changed files are gated`,`.`).requiredOption(`--base <ref>`,`base git ref; changes are measured against its merge-base with HEAD`)).option(`--full`,`also print the passing gate values of every checked function and file`).action(async(e,t,n)=>{await f(e,n.optsWithGlobals())}),await e.parseAsync()}function _(e,t){let n=e.files.map(({file:t,metrics:n})=>{let r=s(t,e.displayRoot),a=i(n,e.crossFileDuplication,r);return{file:r,worstFunction:b(n.functions),duplicatedLineCount:a.size,duplicatedLineRatio:n.lines.code===0?0:a.size/n.lines.code,crossFilePartners:[],ncss:n.ncssCount,codeLines:n.lines.code}}),r=y(n.map(e=>e.worstFunction?.cognitiveComplexity??0)),a=y(n.map(e=>e.duplicatedLineCount)),o=y(n.map(e=>e.ncss)),c=n.map(e=>({...e,score:r(e.worstFunction?.cognitiveComplexity??0)+a(e.duplicatedLineCount)+o(e.ncss)})).toSorted((e,t)=>t.score-e.score||t.ncss-e.ncss||e.file.localeCompare(t.file));return v(c.slice(0,t),e.crossFileDuplication),c}function v(e,t){if(!t)return;let n=new Map(e.map(e=>[e.file,new Set]));for(let e of t.groups)for(let t of e.files){let r=n.get(t);if(r)for(let n of e.files)n!==t&&r.add(n)}for(let t of e)t.crossFilePartners=[...n.get(t.file)??[]].toSorted()}function y(e){let t=e.toSorted((e,t)=>e-t);return e=>{let n=0,r=t.length;for(;n<r;){let i=n+r>>1;t[i]<e?n=i+1:r=i}return t.length===0?0:n/t.length}}function b(e){let t;for(let n of e)(!t||n.cognitiveComplexity>t.cognitiveComplexity||n.cognitiveComplexity===t.cognitiveComplexity&&n.ncss>t.ncss)&&(t=n);if(t)return{name:t.name??`<anonymous>`,startLine:t.startLine,endLine:t.endLine,cognitiveComplexity:t.cognitiveComplexity,ncss:t.ncss,nestingDepth:t.nestingDepth}}function x(e,t,n){let r=t.slice(0,n.top);d(JSON.stringify({summary:w(e.files),totalRankedFiles:t.length,truncated:r.length<t.length,files:r,errors:e.errors,warnings:e.warnings},void 0,2)+`
+`)}function S(e,t,n,r){if(t.fatalError){u(`Error: ${t.fatalError}\n`);return}let i=w(t.files);if(d(`Measured ${i.fileCount} files under ${e} (code LOC ${i.linesOfCode}, NCSS ${i.ncssCount}, functions ${i.functionCount})\n`),n.length===0)d(`No measurable files found.
+`);else{let e=n.slice(0,r.top),t=n.length>e.length?` of ${n.length}`:``;d(`\nRefactoring candidates (top ${e.length}${t}):\n`);for(let[t,n]of e.entries())d(`${t+1}. ${C(n)}\n`)}if(t.warnings.length>0){u(`\nDegraded ${t.warnings.length} files (measured, but excluded from cross-file matching):\n`);for(let e of t.warnings.slice(0,10))u(`- ${e}\n`);t.warnings.length>10&&u(`- ... ${t.warnings.length-10} more\n`)}if(t.errors.length>0){u(`\nSkipped ${t.errors.length} files or directories:\n`);for(let e of t.errors.slice(0,10))u(`- ${e}\n`);t.errors.length>10&&u(`- ... ${t.errors.length-10} more\n`)}}function C(e){let t=[];if(e.worstFunction){let n=e.worstFunction;t.push(`worst function ${n.name} (L${n.startLine}-${n.endLine}) cognitive ${n.cognitiveComplexity}, NCSS ${n.ncss}, nesting ${n.nestingDepth}`)}if(e.duplicatedLineCount>0){let n=e.crossFilePartners.length>0?`, shared with ${e.crossFilePartners.slice(0,3).join(`, `)}${e.crossFilePartners.length>3?`, ...`:``}`:``;t.push(`duplicated lines ${e.duplicatedLineCount} (${Math.round(e.duplicatedLineRatio*100)}%${n})`)}return t.push(`file NCSS ${e.ncss}`),`${e.file} (score ${e.score.toFixed(2)}): ${t.join(`; `)}`}function w(e){let t=0,n=0,r=0,i=0;for(let a of e)t+=a.metrics.functions.length,n+=a.metrics.lines.code,r=Math.max(r,a.metrics.maxCognitiveComplexity),i+=a.metrics.ncssCount;return{fileCount:e.length,functionCount:t,linesOfCode:n,maxCognitiveComplexity:r,ncssCount:i}}function T(e){let t=D(e);if(t>100)throw new m(`Expected an integer between 1 and 100.`);return t}function E(e){if(!/^\d+$/u.test(e))throw new m(`Expected a non-negative integer.`);let t=Number(e);if(!Number.isSafeInteger(t)||t<0)throw new m(`Expected a non-negative integer.`);return t}function D(e){if(!/^[1-9]\d*$/u.test(e))throw new m(`Expected a positive integer.`);let t=Number(e);if(!Number.isSafeInteger(t)||t<1)throw new m(`Expected a positive integer.`);return t}
 //# sourceMappingURL=cli.js.map

package/dist/cli.js.map

@@ -1 +1 @@
-{"version":3,"file":"cli.js","names":[],"sources":["../src/cli.ts"],"sourcesContent":["#!/usr/bin/env node\n\nimport { readdir, readFile, realpath, stat } from 'node:fs/promises';\nimport os from 'node:os';\nimport path from 'node:path';\nimport { Command, InvalidArgumentError } from 'commander';\nimport { type CliOptions, configFileName, loadConfig, type ResolvedOptions, resolveOptions } from './cliConfig.js';\nimport { measureCrossFileDuplication, type CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport type { CrossFileDuplicationFileData } from './duplication.js';\nimport { collectCrossFileDuplicationFileData, measureCode } from './metrics.js';\nimport type { CodeMetrics, FunctionMetrics, LanguageName } from './types.js';\n\ninterface FileMetrics {\n  file: string;\n  metrics: CodeMetrics;\n  /** Cross-file duplicate candidates and token/statement data, collected only for directory scans. */\n  duplicationCandidates?: CrossFileDuplicationFileData;\n}\n\ninterface 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\n/** The worst (highest-cognitive-complexity) function of a file, reported as the ranking evidence. */\ninterface WorstFunction {\n  name: string;\n  startLine: number;\n  endLine: number;\n  cognitiveComplexity: number;\n  ncss: number;\n  nestingDepth: number;\n}\n\n/**\n * One ranked refactoring candidate. The score is the sum of the file's repo-relative percentile\n * ranks (each in [0, 1)) over three dimensions: worst-function cognitive complexity, duplicated\n * lines (within-file and cross-file combined), and file NCSS. Ranking is relative to the scanned\n * project, so no absolute threshold is involved.\n */\ninterface RankedFile {\n  file: string;\n  score: number;\n  worstFunction?: WorstFunction;\n  /** Distinct lines covered by within-file duplicate blocks or cross-file duplicate occurrences. */\n  duplicatedLineCount: number;\n  /** duplicatedLineCount / code lines (0 when the file has no code). */\n  duplicatedLineRatio: number;\n  /** Other files sharing cross-file duplicate blocks; filled only for the reported top files. */\n  crossFilePartners: string[];\n  ncss: number;\n  codeLines: number;\n}\n\nconst languageByExtension = new Map<string, LanguageName>([\n  ['.c', 'c'],\n  ['.c++', 'cpp'],\n  ['.cc', 'cpp'],\n  ['.cjs', 'javascript'],\n  ['.cp', 'cpp'],\n  ['.cpp', 'cpp'],\n  ['.tcc', 'cpp'],\n  ['.cts', 'typescript'],\n  ['.cxx', 'cpp'],\n  ['.go', 'go'],\n  // Headers may be C or C++; the C++ grammar parses both.\n  ['.h', 'cpp'],\n  ['.hh', 'cpp'],\n  ['.hpp', 'cpp'],\n  ['.hxx', 'cpp'],\n  ['.java', 'java'],\n  ['.js', 'javascript'],\n  ['.jsx', 'jsx'],\n  ['.mjs', 'javascript'],\n  ['.mts', 'typescript'],\n  ['.py', 'python'],\n  ['.rb', 'ruby'],\n  ['.rs', 'rust'],\n  ['.ts', 'typescript'],\n  ['.tsx', 'tsx'],\n]);\n\nconst ignoredDirectoryNames = new Set([\n  '.agents',\n  '.claude',\n  '.cursor',\n  '.git',\n  '.next',\n  '.playwright-cli',\n  '.tox',\n  '.tmp',\n  '.turbo',\n  '.venv',\n  '.yarn',\n  '__fixtures__',\n  '__generated__',\n  '__pycache__',\n  'coverage',\n  'dist',\n  'fixtures',\n  'generated',\n  'node_modules',\n  'target',\n  'test-fixtures',\n  'vendor',\n  'venv',\n]);\n\n/** Caps how many cross-file partners a ranked file lists so the report stays scannable. */\nconst maxCrossFilePartners = 3;\n\nconst testDirectoryNames = new Set(['__tests__', 'test', 'tests', 'spec']);\nconst testFilePattern = /(?:^test(?:[_-].*)?|\\.(?:spec|test)|[_-](?:test|spec))\\.[^.]+$/iu;\n// JUnit tests use a case-sensitive `Test.java` suffix; case-insensitive matching would catch\n// production files like `contest.java`.\nconst javaTestFilePattern = /Test\\.java$/u;\n\n// oxlint-disable-next-line unicorn/prefer-top-level-await -- CommonJS build output cannot preserve top-level await.\nvoid main().catch((error: unknown) => {\n  writeStderr(`Error: ${formatError(error)}\\n`);\n  process.exitCode = 1;\n});\n\nasync function main(): Promise<void> {\n  const program = new Command()\n    .name('code-gauge')\n    .description('Rank the files of a project by refactoring priority.')\n    .argument('[target]', 'file or directory to measure', '.')\n    .option('--config <path>', `config file to use instead of the auto-detected ${configFileName}`)\n    .option('--top <number>', 'number of top-ranked files to report (default: 10)', parsePositiveInteger)\n    .option(\n      '--duplication-min-tokens <number>',\n      'minimum normalized token count for a duplicate region (default 40)',\n      parsePositiveInteger\n    )\n    .option(\n      '--duplication-max-gap-tokens <number>',\n      'maximum token gap merged into one gapped clone group; 0 disables merging (default 30)',\n      parseNonNegativeInteger\n    )\n    .option(\n      '--duplication-min-similarity-percent <number>',\n      'minimum similarity percent (1-100) for near-miss (Type-3) clone blocks; 100 reports exact matches only (default 70)',\n      parsePercentInteger\n    )\n    .option('--include-tests', 'include test files and test directories')\n    .option('--json', 'print JSON output')\n    .option('--fail-on-error', 'exit with code 1 when files or directories cannot be scanned');\n\n  program.action(async (target: string, cliOptions: CliOptions) => {\n    const resolvedTarget = resolveTarget(target);\n    const config = await loadConfig(cliOptions.config, await configSearchDirectory(resolvedTarget));\n    const options = resolveOptions(cliOptions, config);\n    const result = await scanTarget(resolvedTarget, options);\n    addCrossFileDuplication(result, options);\n    const rankedFiles = rankFiles(result, options.top);\n\n    if (options.json) {\n      printJson(result, rankedFiles, options);\n    } else {\n      printTextReport(resolvedTarget, result, rankedFiles, options);\n    }\n\n    if (result.fatalError || (options.failOnError && result.errors.length > 0)) {\n      process.exitCode = 1;\n    }\n  });\n\n  await program.parseAsync();\n}\n\nfunction resolveTarget(target: string): string {\n  if (target === '~') {\n    return os.homedir();\n  }\n\n  if (target.startsWith('~/')) {\n    return path.join(os.homedir(), target.slice(2));\n  }\n\n  return path.resolve(target);\n}\n\n/** Returns the directory from which the config file search should start (the target itself if it is a directory). */\nasync function configSearchDirectory(target: string): Promise<string> {\n  try {\n    const targetStat = await stat(target);\n    return targetStat.isDirectory() ? target : path.dirname(target);\n  } catch {\n    return path.dirname(target);\n  }\n}\n\n/** Shared state of one scan, threaded through the directory walk instead of positional plumbing. */\ninterface ScanContext {\n  options: ResolvedOptions;\n  files: FileMetrics[];\n  errors: string[];\n  warnings: string[];\n  visitedDirectories: Set<string>;\n  visitedFiles: Set<string>;\n  /** Scan root: paths are displayed relative to it, and symbolic links may not escape it. */\n  rootDirectory: string;\n}\n\nasync function scanTarget(target: string, options: ResolvedOptions): Promise<ScanResult> {\n  const files: FileMetrics[] = [];\n  const errors: string[] = [];\n  const warnings: string[] = [];\n  let canonicalTarget = target;\n  try {\n    canonicalTarget = await realpath(target);\n  } catch {\n    // stat below reports missing targets with the original path.\n  }\n\n  const fallbackDisplayRoot = path.dirname(canonicalTarget);\n  let targetStat;\n\n  try {\n    targetStat = await stat(canonicalTarget);\n  } catch (error) {\n    const fatalError = `${formatPath(canonicalTarget, fallbackDisplayRoot)}: ${formatError(error)}`;\n    return { displayRoot: fallbackDisplayRoot, files, errors: [fatalError], warnings, fatalError };\n  }\n\n  if (targetStat.isFile()) {\n    const displayRoot = path.dirname(canonicalTarget);\n    const language = getLanguage(canonicalTarget, options, true);\n    if (!language) {\n      const fatalError = `${formatPath(canonicalTarget, displayRoot)}: unsupported file type`;\n      return { displayRoot, files, errors: [fatalError], warnings, fatalError };\n    }\n\n    const context = makeScanContext(options, files, errors, warnings, displayRoot);\n    await measureFile(canonicalTarget, language, 'single-file', context, canonicalTarget);\n    return { displayRoot, files, errors, warnings };\n  }\n\n  await scanDirectory(canonicalTarget, makeScanContext(options, files, errors, warnings, canonicalTarget));\n  return { displayRoot: canonicalTarget, files, errors, warnings };\n}\n\nfunction makeScanContext(\n  options: ResolvedOptions,\n  files: FileMetrics[],\n  errors: string[],\n  warnings: string[],\n  rootDirectory: string\n): ScanContext {\n  return { options, files, errors, warnings, visitedDirectories: new Set(), visitedFiles: new Set(), rootDirectory };\n}\n\nasync function scanDirectory(directory: string, context: ScanContext): Promise<void> {\n  let resolvedDirectory;\n  try {\n    resolvedDirectory = await realpath(directory);\n  } catch (error) {\n    context.errors.push(`${formatPath(directory, context.rootDirectory)}: ${formatError(error)}`);\n    return;\n  }\n\n  if (!isWithinDirectory(resolvedDirectory, context.rootDirectory)) {\n    return;\n  }\n\n  if (context.visitedDirectories.has(resolvedDirectory)) {\n    return;\n  }\n  context.visitedDirectories.add(resolvedDirectory);\n\n  let entries;\n  try {\n    entries = await readdir(directory, { withFileTypes: true });\n  } catch (error) {\n    context.errors.push(`${formatPath(directory, context.rootDirectory)}: ${formatError(error)}`);\n    return;\n  }\n\n  for (const entry of entries) {\n    const entryPath = path.join(directory, entry.name);\n    if (entry.isSymbolicLink()) {\n      await scanSymbolicLink(entry.name, entryPath, context);\n      continue;\n    }\n\n    if (entry.isDirectory()) {\n      if (shouldSkipDirectory(entry.name, context.options)) {\n        continue;\n      }\n      await scanDirectory(entryPath, context);\n      continue;\n    }\n\n    if (entry.isFile()) {\n      await measureScannableFile(entryPath, context);\n    }\n  }\n}\n\nasync function scanSymbolicLink(name: string, entryPath: string, context: ScanContext): Promise<void> {\n  let resolvedPath;\n  try {\n    resolvedPath = await realpath(entryPath);\n  } catch (error) {\n    context.errors.push(`${formatPath(entryPath, context.rootDirectory)}: ${formatError(error)}`);\n    return;\n  }\n\n  if (!isWithinDirectory(resolvedPath, context.rootDirectory)) {\n    return;\n  }\n\n  let entryStat;\n  try {\n    entryStat = await stat(entryPath);\n  } catch (error) {\n    context.errors.push(`${formatPath(entryPath, context.rootDirectory)}: ${formatError(error)}`);\n    return;\n  }\n\n  if (entryStat.isDirectory()) {\n    if (\n      shouldSkipDirectory(name, context.options) ||\n      shouldSkipDirectory(path.basename(resolvedPath), context.options)\n    ) {\n      return;\n    }\n    await scanDirectory(entryPath, context);\n    return;\n  }\n\n  if (entryStat.isFile()) {\n    await measureScannableFile(entryPath, context, resolvedPath, resolvedPath);\n  }\n}\n\nasync function measureScannableFile(\n  file: string,\n  context: ScanContext,\n  languageFile = file,\n  realFile?: string\n): Promise<void> {\n  const language = getLanguage(languageFile, context.options);\n  if (language) {\n    await measureFile(file, language, 'directory', context, realFile);\n  }\n}\n\nasync function measureFile(\n  file: string,\n  language: LanguageName,\n  mode: 'single-file' | 'directory',\n  context: ScanContext,\n  realFile?: string\n): Promise<void> {\n  try {\n    const resolvedFile = realFile ?? (await realpath(file));\n    if (context.visitedFiles.has(resolvedFile)) {\n      return;\n    }\n    context.visitedFiles.add(resolvedFile);\n\n    const code = await readFile(file, 'utf8');\n    const measureOptions = { language, duplication: context.options.duplication };\n    const fileMetrics: FileMetrics = { file, metrics: measureCode(code, measureOptions) };\n    // Only directory scans compare files against each other; a single-file target has no peers.\n    // Candidate collection failing (it always parses with the JavaScript binding, which can give\n    // up where the native backend measured fine) must not discard the measured metrics.\n    if (mode === 'directory') {\n      try {\n        fileMetrics.duplicationCandidates = collectCrossFileDuplicationFileData(code, measureOptions);\n      } catch (error) {\n        // A warning, not an error: the file's metrics are complete, only its participation in\n        // cross-file matching is lost, so it is not \"skipped\" and must not fail --fail-on-error.\n        context.warnings.push(\n          `${formatPath(file, context.rootDirectory)}: cross-file duplication candidates unavailable: ${formatError(error)}`\n        );\n      }\n    }\n    context.files.push(fileMetrics);\n  } catch (error) {\n    context.errors.push(`${formatPath(file, context.rootDirectory)}: ${formatError(error)}`);\n  }\n}\n\n/** Runs after the scan so every measured file's candidates participate. */\nfunction addCrossFileDuplication(result: ScanResult, options: ResolvedOptions): void {\n  if (result.fatalError || result.files.length < 2) {\n    return;\n  }\n  const sourceFiles = result.files.flatMap(({ file, duplicationCandidates }) =>\n    duplicationCandidates ? [{ file: formatPath(file, result.displayRoot), ...duplicationCandidates }] : []\n  );\n  if (sourceFiles.length < 2) {\n    return;\n  }\n  result.crossFileDuplication = measureCrossFileDuplication(sourceFiles, options.duplication);\n}\n\nfunction rankFiles(result: ScanResult, top: number): RankedFile[] {\n  const candidates = result.files.map(({ file, metrics }) => {\n    const formattedFile = formatPath(file, result.displayRoot);\n    const duplicatedLines = collectDuplicatedLines(metrics, result.crossFileDuplication, formattedFile);\n    return {\n      file: formattedFile,\n      worstFunction: findWorstFunction(metrics.functions),\n      duplicatedLineCount: duplicatedLines.size,\n      duplicatedLineRatio: metrics.lines.code === 0 ? 0 : duplicatedLines.size / metrics.lines.code,\n      crossFilePartners: [] as string[],\n      ncss: metrics.ncssCount,\n      codeLines: metrics.lines.code,\n    };\n  });\n\n  const cognitivePercentile = makePercentile(candidates.map((c) => c.worstFunction?.cognitiveComplexity ?? 0));\n  const duplicationPercentile = makePercentile(candidates.map((c) => c.duplicatedLineCount));\n  const ncssPercentile = makePercentile(candidates.map((c) => c.ncss));\n\n  const ranked = candidates\n    .map((candidate) => ({\n      ...candidate,\n      score:\n        cognitivePercentile(candidate.worstFunction?.cognitiveComplexity ?? 0) +\n        duplicationPercentile(candidate.duplicatedLineCount) +\n        ncssPercentile(candidate.ncss),\n    }))\n    .toSorted(\n      (left, right) => right.score - left.score || right.ncss - left.ncss || left.file.localeCompare(right.file)\n    );\n  // Partner evidence is attached only to the files that will be reported: expanding partners for\n  // every scanned file first would retain TH(F^2) strings when one clone group spans F files, and\n  // rescanning all groups per file would be O(files x groups) on the post-scan ranking step.\n  attachCrossFilePartners(ranked.slice(0, top), result.crossFileDuplication);\n  return ranked;\n}\n\n/** One pass over the groups fills the reported files' partner lists (other files sharing a group). */\nfunction attachCrossFilePartners(\n  reportedFiles: RankedFile[],\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined\n): void {\n  if (!crossFileDuplication) {\n    return;\n  }\n  const partnersByFile = new Map(reportedFiles.map((ranked) => [ranked.file, new Set<string>()]));\n  for (const group of crossFileDuplication.groups) {\n    for (const file of group.files) {\n      const partners = partnersByFile.get(file);\n      if (!partners) {\n        continue;\n      }\n      for (const partner of group.files) {\n        if (partner !== file) {\n          partners.add(partner);\n        }\n      }\n    }\n  }\n  for (const ranked of reportedFiles) {\n    ranked.crossFilePartners = [...(partnersByFile.get(ranked.file) ?? [])].toSorted();\n  }\n}\n\n/**\n * Percentile rank within the scanned project: the fraction of files with a strictly smaller\n * value, in [0, 1). Relative ranking needs no absolute threshold, which sidesteps the metric\n * calibration problem entirely — the top of the list is worth refactoring first regardless of\n * where any cutoff would sit.\n */\nfunction makePercentile(values: number[]): (value: number) => number {\n  const sorted = values.toSorted((left, right) => left - right);\n  return (value: number) => {\n    let low = 0;\n    let high = sorted.length;\n    while (low < high) {\n      const middle = (low + high) >> 1;\n      if ((sorted[middle] as number) < value) {\n        low = middle + 1;\n      } else {\n        high = middle;\n      }\n    }\n    return sorted.length === 0 ? 0 : low / sorted.length;\n  };\n}\n\n/** The highest-cognitive-complexity function; NCSS breaks ties so the larger body is reported. */\nfunction findWorstFunction(functions: FunctionMetrics[]): WorstFunction | undefined {\n  let worst: FunctionMetrics | undefined;\n  for (const fn of functions) {\n    if (\n      !worst ||\n      fn.cognitiveComplexity > worst.cognitiveComplexity ||\n      (fn.cognitiveComplexity === worst.cognitiveComplexity && fn.ncss > worst.ncss)\n    ) {\n      worst = fn;\n    }\n  }\n  if (!worst) {\n    return undefined;\n  }\n  return {\n    name: worst.name ?? '<anonymous>',\n    startLine: worst.startLine,\n    endLine: worst.endLine,\n    cognitiveComplexity: worst.cognitiveComplexity,\n    ncss: worst.ncss,\n    nestingDepth: worst.nestingDepth,\n  };\n}\n\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 the derived ratio can never exceed 1.\n */\nfunction collectDuplicatedLines(\n  metrics: CodeMetrics,\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 printJson(result: ScanResult, rankedFiles: RankedFile[], options: ResolvedOptions): void {\n  const reportedFiles = rankedFiles.slice(0, options.top);\n  writeStdout(\n    JSON.stringify(\n      {\n        summary: summarize(result.files),\n        totalRankedFiles: rankedFiles.length,\n        truncated: reportedFiles.length < rankedFiles.length,\n        files: reportedFiles,\n        errors: result.errors,\n        warnings: result.warnings,\n      },\n      undefined,\n      2\n    ) + '\\n'\n  );\n}\n\nfunction printTextReport(\n  target: string,\n  result: ScanResult,\n  rankedFiles: RankedFile[],\n  options: ResolvedOptions\n): void {\n  if (result.fatalError) {\n    writeStderr(`Error: ${result.fatalError}\\n`);\n    return;\n  }\n\n  const summary = summarize(result.files);\n  writeStdout(\n    `Measured ${summary.fileCount} files under ${target} (code LOC ${summary.linesOfCode}, NCSS ${summary.ncssCount}, functions ${summary.functionCount})\\n`\n  );\n\n  if (rankedFiles.length === 0) {\n    writeStdout('No measurable files found.\\n');\n  } else {\n    const reportedFiles = rankedFiles.slice(0, options.top);\n    const totalSuffix = rankedFiles.length > reportedFiles.length ? ` of ${rankedFiles.length}` : '';\n    writeStdout(`\\nRefactoring candidates (top ${reportedFiles.length}${totalSuffix}):\\n`);\n    for (const [index, ranked] of reportedFiles.entries()) {\n      writeStdout(`${index + 1}. ${formatRankedFile(ranked)}\\n`);\n    }\n  }\n\n  if (result.warnings.length > 0) {\n    writeStderr(`\\nDegraded ${result.warnings.length} files (measured, but excluded from cross-file matching):\\n`);\n    for (const warning of result.warnings.slice(0, 10)) {\n      writeStderr(`- ${warning}\\n`);\n    }\n    if (result.warnings.length > 10) {\n      writeStderr(`- ... ${result.warnings.length - 10} more\\n`);\n    }\n  }\n\n  if (result.errors.length > 0) {\n    writeStderr(`\\nSkipped ${result.errors.length} files or directories:\\n`);\n    for (const error of result.errors.slice(0, 10)) {\n      writeStderr(`- ${error}\\n`);\n    }\n    if (result.errors.length > 10) {\n      writeStderr(`- ... ${result.errors.length - 10} more\\n`);\n    }\n  }\n}\n\n/** One ranked file as a single line: the location, the evidence, and where the duplication points. */\nfunction formatRankedFile(ranked: RankedFile): string {\n  const reasons: string[] = [];\n  if (ranked.worstFunction) {\n    const fn = ranked.worstFunction;\n    reasons.push(\n      `worst function ${fn.name} (L${fn.startLine}-${fn.endLine}) cognitive ${fn.cognitiveComplexity}, NCSS ${fn.ncss}, nesting ${fn.nestingDepth}`\n    );\n  }\n  if (ranked.duplicatedLineCount > 0) {\n    const partnersSuffix =\n      ranked.crossFilePartners.length > 0\n        ? `, shared with ${ranked.crossFilePartners.slice(0, maxCrossFilePartners).join(', ')}${ranked.crossFilePartners.length > maxCrossFilePartners ? ', ...' : ''}`\n        : '';\n    reasons.push(\n      `duplicated lines ${ranked.duplicatedLineCount} (${Math.round(ranked.duplicatedLineRatio * 100)}%${partnersSuffix})`\n    );\n  }\n  reasons.push(`file NCSS ${ranked.ncss}`);\n  return `${ranked.file} (score ${ranked.score.toFixed(2)}): ${reasons.join('; ')}`;\n}\n\nfunction summarize(files: FileMetrics[]): {\n  fileCount: number;\n  functionCount: number;\n  linesOfCode: number;\n  maxCognitiveComplexity: number;\n  ncssCount: number;\n} {\n  let functionCount = 0;\n  let linesOfCode = 0;\n  let maxCognitiveComplexity = 0;\n  let ncssCount = 0;\n\n  for (const file of files) {\n    functionCount += file.metrics.functions.length;\n    linesOfCode += file.metrics.lines.code;\n    maxCognitiveComplexity = Math.max(maxCognitiveComplexity, file.metrics.maxCognitiveComplexity);\n    ncssCount += file.metrics.ncssCount;\n  }\n\n  return { fileCount: files.length, functionCount, linesOfCode, maxCognitiveComplexity, ncssCount };\n}\n\nfunction shouldSkipDirectory(name: string, options: ResolvedOptions): boolean {\n  if (ignoredDirectoryNames.has(name)) {\n    return true;\n  }\n\n  if (options.includeTests) {\n    return false;\n  }\n\n  return testDirectoryNames.has(name);\n}\n\nfunction isWithinDirectory(candidate: string, directory: string): boolean {\n  const relative = path.relative(directory, candidate);\n  return relative === '' || (relative !== '..' && !relative.startsWith(`..${path.sep}`) && !path.isAbsolute(relative));\n}\n\nfunction getLanguage(file: string, options: ResolvedOptions, explicitTarget = false): LanguageName | undefined {\n  const lowerFile = file.toLowerCase();\n  if (\n    !explicitTarget &&\n    (lowerFile.endsWith('.d.ts') ||\n      lowerFile.endsWith('.d.mts') ||\n      lowerFile.endsWith('.d.cts') ||\n      lowerFile.endsWith('.min.js') ||\n      lowerFile.endsWith('.pnp.cjs'))\n  ) {\n    return undefined;\n  }\n\n  if (\n    !explicitTarget &&\n    !options.includeTests &&\n    (testFilePattern.test(path.basename(file)) || javaTestFilePattern.test(path.basename(file)))\n  ) {\n    return undefined;\n  }\n\n  // GCC treats an uppercase `.C` as C++; lowercasing first would misparse it with the C grammar.\n  if (path.extname(file) === '.C') {\n    return 'cpp';\n  }\n\n  return languageByExtension.get(path.extname(lowerFile));\n}\n\nfunction parsePercentInteger(value: string): number {\n  const parsed = parsePositiveInteger(value);\n  if (parsed > 100) {\n    throw new InvalidArgumentError('Expected an integer between 1 and 100.');\n  }\n  return parsed;\n}\n\nfunction parseNonNegativeInteger(value: string): number {\n  if (!/^\\d+$/u.test(value)) {\n    throw new InvalidArgumentError('Expected a non-negative integer.');\n  }\n\n  const parsed = Number(value);\n  if (!Number.isSafeInteger(parsed) || parsed < 0) {\n    throw new InvalidArgumentError('Expected a non-negative integer.');\n  }\n  return parsed;\n}\n\nfunction parsePositiveInteger(value: string): number {\n  if (!/^[1-9]\\d*$/u.test(value)) {\n    throw new InvalidArgumentError('Expected a positive integer.');\n  }\n\n  const parsed = Number(value);\n  if (!Number.isSafeInteger(parsed) || parsed < 1) {\n    throw new InvalidArgumentError('Expected a positive integer.');\n  }\n  return parsed;\n}\n\nfunction formatPath(file: string, base: string): string {\n  return path.relative(base, file) || path.basename(file);\n}\n\nfunction writeStdout(message: string): void {\n  process.stdout.write(message);\n}\n\nfunction writeStderr(message: string): void {\n  process.stderr.write(message);\n}\n\nfunction formatError(error: unknown): string {\n  return error instanceof Error ? error.message : String(error);\n}\n"],"mappings":";+aA2DA,MAAM,EAAsB,IAAI,IAA0B,CACxD,CAAC,KAAM,GAAG,EACV,CAAC,OAAQ,KAAK,EACd,CAAC,MAAO,KAAK,EACb,CAAC,OAAQ,YAAY,EACrB,CAAC,MAAO,KAAK,EACb,CAAC,OAAQ,KAAK,EACd,CAAC,OAAQ,KAAK,EACd,CAAC,OAAQ,YAAY,EACrB,CAAC,OAAQ,KAAK,EACd,CAAC,MAAO,IAAI,EAEZ,CAAC,KAAM,KAAK,EACZ,CAAC,MAAO,KAAK,EACb,CAAC,OAAQ,KAAK,EACd,CAAC,OAAQ,KAAK,EACd,CAAC,QAAS,MAAM,EAChB,CAAC,MAAO,YAAY,EACpB,CAAC,OAAQ,KAAK,EACd,CAAC,OAAQ,YAAY,EACrB,CAAC,OAAQ,YAAY,EACrB,CAAC,MAAO,QAAQ,EAChB,CAAC,MAAO,MAAM,EACd,CAAC,MAAO,MAAM,EACd,CAAC,MAAO,YAAY,EACpB,CAAC,OAAQ,KAAK,CAChB,CAAC,EAEK,EAAwB,IAAI,IAAI,CACpC,UACA,UACA,UACA,OACA,QACA,kBACA,OACA,OACA,SACA,QACA,QACA,eACA,gBACA,cACA,WACA,OACA,WACA,YACA,eACA,SACA,gBACA,SACA,MACF,CAAC,EAKK,EAAqB,IAAI,IAAI,CAAC,YAAa,OAAQ,QAAS,MAAM,CAAC,EACnE,EAAkB,mEAGlB,EAAsB,eAGvB,EAAK,CAAC,CAAC,MAAO,GAAmB,CACpC,EAAY,UAAU,EAAY,CAAK,EAAE,GAAG,EAC5C,QAAQ,SAAW,CACrB,CAAC,EAED,eAAe,GAAsB,CACnC,IAAM,EAAU,IAAI,EAAQ,CAAC,CAC1B,KAAK,YAAY,CAAC,CAClB,YAAY,sDAAsD,CAAC,CACnE,SAAS,WAAY,+BAAgC,GAAG,CAAC,CACzD,OAAO,kBAAmB,mDAAmD,GAAgB,CAAC,CAC9F,OAAO,iBAAkB,qDAAsD,CAAoB,CAAC,CACpG,OACC,oCACA,qEACA,CACF,CAAC,CACA,OACC,wCACA,wFACA,CACF,CAAC,CACA,OACC,gDACA,sHACA,CACF,CAAC,CACA,OAAO,kBAAmB,yCAAyC,CAAC,CACpE,OAAO,SAAU,mBAAmB,CAAC,CACrC,OAAO,kBAAmB,8DAA8D,EAE3F,EAAQ,OAAO,MAAO,EAAgB,IAA2B,CAC/D,IAAM,EAAiB,EAAc,CAAM,EACrC,EAAS,MAAM,EAAW,EAAW,OAAQ,MAAM,EAAsB,CAAc,CAAC,EACxF,EAAU,EAAe,EAAY,CAAM,EAC3C,EAAS,MAAM,EAAW,EAAgB,CAAO,EACvD,EAAwB,EAAQ,CAAO,EACvC,IAAM,EAAc,EAAU,EAAQ,EAAQ,GAAG,EAE7C,EAAQ,KACV,EAAU,EAAQ,EAAa,CAAO,EAEtC,EAAgB,EAAgB,EAAQ,EAAa,CAAO,GAG1D,EAAO,YAAe,EAAQ,aAAe,EAAO,OAAO,OAAS,KACtE,QAAQ,SAAW,EAEvB,CAAC,EAED,MAAM,EAAQ,WAAW,CAC3B,CAEA,SAAS,EAAc,EAAwB,CAS7C,OARI,IAAW,IACN,EAAG,QAAQ,EAGhB,EAAO,WAAW,IAAI,EACjB,EAAK,KAAK,EAAG,QAAQ,EAAG,EAAO,MAAM,CAAC,CAAC,EAGzC,EAAK,QAAQ,CAAM,CAC5B,CAGA,eAAe,EAAsB,EAAiC,CACpE,GAAI,CAEF,OAAO,MADkB,EAAK,CAAM,EAAA,CAClB,YAAY,EAAI,EAAS,EAAK,QAAQ,CAAM,CAChE,MAAQ,CACN,OAAO,EAAK,QAAQ,CAAM,CAC5B,CACF,CAcA,eAAe,EAAW,EAAgB,EAA+C,CACvF,IAAM,EAAuB,CAAC,EACxB,EAAmB,CAAC,EACpB,EAAqB,CAAC,EACxB,EAAkB,EACtB,GAAI,CACF,EAAkB,MAAM,EAAS,CAAM,CACzC,MAAQ,CAER,CAEA,IAAM,EAAsB,EAAK,QAAQ,CAAe,EACpD,EAEJ,GAAI,CACF,EAAa,MAAM,EAAK,CAAe,CACzC,OAAS,EAAO,CACd,IAAM,EAAa,GAAG,EAAW,EAAiB,CAAmB,EAAE,IAAI,EAAY,CAAK,IAC5F,MAAO,CAAE,YAAa,EAAqB,QAAO,OAAQ,CAAC,CAAU,EAAG,WAAU,YAAW,CAC/F,CAEA,GAAI,EAAW,OAAO,EAAG,CACvB,IAAM,EAAc,EAAK,QAAQ,CAAe,EAC1C,EAAW,EAAY,EAAiB,EAAS,EAAI,EAC3D,GAAI,CAAC,EAAU,CACb,IAAM,EAAa,GAAG,EAAW,EAAiB,CAAW,EAAE,yBAC/D,MAAO,CAAE,cAAa,QAAO,OAAQ,CAAC,CAAU,EAAG,WAAU,YAAW,CAC1E,CAEA,IAAM,EAAU,EAAgB,EAAS,EAAO,EAAQ,EAAU,CAAW,EAE7E,OADA,MAAM,EAAY,EAAiB,EAAU,cAAe,EAAS,CAAe,EAC7E,CAAE,cAAa,QAAO,SAAQ,UAAS,CAChD,CAGA,OADA,MAAM,EAAc,EAAiB,EAAgB,EAAS,EAAO,EAAQ,EAAU,CAAe,CAAC,EAChG,CAAE,YAAa,EAAiB,QAAO,SAAQ,UAAS,CACjE,CAEA,SAAS,EACP,EACA,EACA,EACA,EACA,EACa,CACb,MAAO,CAAE,UAAS,QAAO,SAAQ,WAAU,mBAAoB,IAAI,IAAO,aAAc,IAAI,IAAO,eAAc,CACnH,CAEA,eAAe,EAAc,EAAmB,EAAqC,CACnF,IAAI,EACJ,GAAI,CACF,EAAoB,MAAM,EAAS,CAAS,CAC9C,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAW,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EAC5F,MACF,CAMA,GAJI,CAAC,EAAkB,EAAmB,EAAQ,aAAa,GAI3D,EAAQ,mBAAmB,IAAI,CAAiB,EAClD,OAEF,EAAQ,mBAAmB,IAAI,CAAiB,EAEhD,IAAI,EACJ,GAAI,CACF,EAAU,MAAM,EAAQ,EAAW,CAAE,cAAe,EAAK,CAAC,CAC5D,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAW,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EAC5F,MACF,CAEA,IAAK,IAAM,KAAS,EAAS,CAC3B,IAAM,EAAY,EAAK,KAAK,EAAW,EAAM,IAAI,EACjD,GAAI,EAAM,eAAe,EAAG,CAC1B,MAAM,EAAiB,EAAM,KAAM,EAAW,CAAO,EACrD,QACF,CAEA,GAAI,EAAM,YAAY,EAAG,CACvB,GAAI,EAAoB,EAAM,KAAM,EAAQ,OAAO,EACjD,SAEF,MAAM,EAAc,EAAW,CAAO,EACtC,QACF,CAEI,EAAM,OAAO,GACf,MAAM,EAAqB,EAAW,CAAO,CAEjD,CACF,CAEA,eAAe,EAAiB,EAAc,EAAmB,EAAqC,CACpG,IAAI,EACJ,GAAI,CACF,EAAe,MAAM,EAAS,CAAS,CACzC,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAW,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EAC5F,MACF,CAEA,GAAI,CAAC,EAAkB,EAAc,EAAQ,aAAa,EACxD,OAGF,IAAI,EACJ,GAAI,CACF,EAAY,MAAM,EAAK,CAAS,CAClC,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAW,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,EAC5F,MACF,CAEA,GAAI,EAAU,YAAY,EAAG,CAC3B,GACE,EAAoB,EAAM,EAAQ,OAAO,GACzC,EAAoB,EAAK,SAAS,CAAY,EAAG,EAAQ,OAAO,EAEhE,OAEF,MAAM,EAAc,EAAW,CAAO,EACtC,MACF,CAEI,EAAU,OAAO,GACnB,MAAM,EAAqB,EAAW,EAAS,EAAc,CAAY,CAE7E,CAEA,eAAe,EACb,EACA,EACA,EAAe,EACf,EACe,CACf,IAAM,EAAW,EAAY,EAAc,EAAQ,OAAO,EACtD,GACF,MAAM,EAAY,EAAM,EAAU,YAAa,EAAS,CAAQ,CAEpE,CAEA,eAAe,EACb,EACA,EACA,EACA,EACA,EACe,CACf,GAAI,CACF,IAAM,EAAe,GAAa,MAAM,EAAS,CAAI,EACrD,GAAI,EAAQ,aAAa,IAAI,CAAY,EACvC,OAEF,EAAQ,aAAa,IAAI,CAAY,EAErC,IAAM,EAAO,MAAM,EAAS,EAAM,MAAM,EAClC,EAAiB,CAAE,WAAU,YAAa,EAAQ,QAAQ,WAAY,EACtE,EAA2B,CAAE,OAAM,QAAS,EAAY,EAAM,CAAc,CAAE,EAIpF,GAAI,IAAS,YACX,GAAI,CACF,EAAY,sBAAwB,EAAoC,EAAM,CAAc,CAC9F,OAAS,EAAO,CAGd,EAAQ,SAAS,KACf,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,mDAAmD,EAAY,CAAK,GACjH,CACF,CAEF,EAAQ,MAAM,KAAK,CAAW,CAChC,OAAS,EAAO,CACd,EAAQ,OAAO,KAAK,GAAG,EAAW,EAAM,EAAQ,aAAa,EAAE,IAAI,EAAY,CAAK,GAAG,CACzF,CACF,CAGA,SAAS,EAAwB,EAAoB,EAAgC,CACnF,GAAI,EAAO,YAAc,EAAO,MAAM,OAAS,EAC7C,OAEF,IAAM,EAAc,EAAO,MAAM,SAAS,CAAE,OAAM,2BAChD,EAAwB,CAAC,CAAE,KAAM,EAAW,EAAM,EAAO,WAAW,EAAG,GAAG,CAAsB,CAAC,EAAI,CAAC,CACxG,EACI,EAAY,OAAS,IAGzB,EAAO,qBAAuB,EAA4B,EAAa,EAAQ,WAAW,EAC5F,CAEA,SAAS,EAAU,EAAoB,EAA2B,CAChE,IAAM,EAAa,EAAO,MAAM,KAAK,CAAE,OAAM,aAAc,CACzD,IAAM,EAAgB,EAAW,EAAM,EAAO,WAAW,EACnD,EAAkB,EAAuB,EAAS,EAAO,qBAAsB,CAAa,EAClG,MAAO,CACL,KAAM,EACN,cAAe,EAAkB,EAAQ,SAAS,EAClD,oBAAqB,EAAgB,KACrC,oBAAqB,EAAQ,MAAM,OAAS,EAAI,EAAI,EAAgB,KAAO,EAAQ,MAAM,KACzF,kBAAmB,CAAC,EACpB,KAAM,EAAQ,UACd,UAAW,EAAQ,MAAM,IAC3B,CACF,CAAC,EAEK,EAAsB,EAAe,EAAW,IAAK,GAAM,EAAE,eAAe,qBAAuB,CAAC,CAAC,EACrG,EAAwB,EAAe,EAAW,IAAK,GAAM,EAAE,mBAAmB,CAAC,EACnF,EAAiB,EAAe,EAAW,IAAK,GAAM,EAAE,IAAI,CAAC,EAE7D,EAAS,EACZ,IAAK,IAAe,CACnB,GAAG,EACH,MACE,EAAoB,EAAU,eAAe,qBAAuB,CAAC,EACrE,EAAsB,EAAU,mBAAmB,EACnD,EAAe,EAAU,IAAI,CACjC,EAAE,CAAC,CACF,UACE,EAAM,IAAU,EAAM,MAAQ,EAAK,OAAS,EAAM,KAAO,EAAK,MAAQ,EAAK,KAAK,cAAc,EAAM,IAAI,CAC3G,EAKF,OADA,EAAwB,EAAO,MAAM,EAAG,CAAG,EAAG,EAAO,oBAAoB,EAClE,CACT,CAGA,SAAS,EACP,EACA,EACM,CACN,GAAI,CAAC,EACH,OAEF,IAAM,EAAiB,IAAI,IAAI,EAAc,IAAK,GAAW,CAAC,EAAO,KAAM,IAAI,GAAa,CAAC,CAAC,EAC9F,IAAK,IAAM,KAAS,EAAqB,OACvC,IAAK,IAAM,KAAQ,EAAM,MAAO,CAC9B,IAAM,EAAW,EAAe,IAAI,CAAI,EACnC,KAGL,IAAK,IAAM,KAAW,EAAM,MACtB,IAAY,GACd,EAAS,IAAI,CAAO,CAG1B,CAEF,IAAK,IAAM,KAAU,EACnB,EAAO,kBAAoB,CAAC,GAAI,EAAe,IAAI,EAAO,IAAI,GAAK,CAAC,CAAE,CAAC,CAAC,SAAS,CAErF,CAQA,SAAS,EAAe,EAA6C,CACnE,IAAM,EAAS,EAAO,UAAU,EAAM,IAAU,EAAO,CAAK,EAC5D,MAAQ,IAAkB,CACxB,IAAI,EAAM,EACN,EAAO,EAAO,OAClB,KAAO,EAAM,GAAM,CACjB,IAAM,EAAU,EAAM,GAAS,EAC1B,EAAO,GAAqB,EAC/B,EAAM,EAAS,EAEf,EAAO,CAEX,CACA,OAAO,EAAO,SAAW,EAAI,EAAI,EAAM,EAAO,MAChD,CACF,CAGA,SAAS,EAAkB,EAAyD,CAClF,IAAI,EACJ,IAAK,IAAM,KAAM,GAEb,CAAC,GACD,EAAG,oBAAsB,EAAM,qBAC9B,EAAG,sBAAwB,EAAM,qBAAuB,EAAG,KAAO,EAAM,QAEzE,EAAQ,GAGP,KAGL,MAAO,CACL,KAAM,EAAM,MAAQ,cACpB,UAAW,EAAM,UACjB,QAAS,EAAM,QACf,oBAAqB,EAAM,oBAC3B,KAAM,EAAM,KACZ,aAAc,EAAM,YACtB,CACF,CAQA,SAAS,EACP,EACA,EACA,EACa,CACb,IAAM,EAAQ,IAAI,IAAI,EAAQ,YAAY,oBAAoB,EAExD,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,EAAU,EAAoB,EAA2B,EAAgC,CAChG,IAAM,EAAgB,EAAY,MAAM,EAAG,EAAQ,GAAG,EACtD,EACE,KAAK,UACH,CACE,QAAS,EAAU,EAAO,KAAK,EAC/B,iBAAkB,EAAY,OAC9B,UAAW,EAAc,OAAS,EAAY,OAC9C,MAAO,EACP,OAAQ,EAAO,OACf,SAAU,EAAO,QACnB,EACA,IAAA,GACA,CACF,EAAI;CACN,CACF,CAEA,SAAS,EACP,EACA,EACA,EACA,EACM,CACN,GAAI,EAAO,WAAY,CACrB,EAAY,UAAU,EAAO,WAAW,GAAG,EAC3C,MACF,CAEA,IAAM,EAAU,EAAU,EAAO,KAAK,EAKtC,GAJA,EACE,YAAY,EAAQ,UAAU,eAAe,EAAO,aAAa,EAAQ,YAAY,SAAS,EAAQ,UAAU,cAAc,EAAQ,cAAc,IACtJ,EAEI,EAAY,SAAW,EACzB,EAAY;CAA8B,MACrC,CACL,IAAM,EAAgB,EAAY,MAAM,EAAG,EAAQ,GAAG,EAChD,EAAc,EAAY,OAAS,EAAc,OAAS,OAAO,EAAY,SAAW,GAC9F,EAAY,iCAAiC,EAAc,SAAS,EAAY,KAAK,EACrF,IAAK,GAAM,CAAC,EAAO,KAAW,EAAc,QAAQ,EAClD,EAAY,GAAG,EAAQ,EAAE,IAAI,EAAiB,CAAM,EAAE,GAAG,CAE7D,CAEA,GAAI,EAAO,SAAS,OAAS,EAAG,CAC9B,EAAY,cAAc,EAAO,SAAS,OAAO,4DAA4D,EAC7G,IAAK,IAAM,KAAW,EAAO,SAAS,MAAM,EAAG,EAAE,EAC/C,EAAY,KAAK,EAAQ,GAAG,EAE1B,EAAO,SAAS,OAAS,IAC3B,EAAY,SAAS,EAAO,SAAS,OAAS,GAAG,QAAQ,CAE7D,CAEA,GAAI,EAAO,OAAO,OAAS,EAAG,CAC5B,EAAY,aAAa,EAAO,OAAO,OAAO,yBAAyB,EACvE,IAAK,IAAM,KAAS,EAAO,OAAO,MAAM,EAAG,EAAE,EAC3C,EAAY,KAAK,EAAM,GAAG,EAExB,EAAO,OAAO,OAAS,IACzB,EAAY,SAAS,EAAO,OAAO,OAAS,GAAG,QAAQ,CAE3D,CACF,CAGA,SAAS,EAAiB,EAA4B,CACpD,IAAM,EAAoB,CAAC,EAC3B,GAAI,EAAO,cAAe,CACxB,IAAM,EAAK,EAAO,cAClB,EAAQ,KACN,kBAAkB,EAAG,KAAK,KAAK,EAAG,UAAU,GAAG,EAAG,QAAQ,cAAc,EAAG,oBAAoB,SAAS,EAAG,KAAK,YAAY,EAAG,cACjI,CACF,CACA,GAAI,EAAO,oBAAsB,EAAG,CAClC,IAAM,EACJ,EAAO,kBAAkB,OAAS,EAC9B,iBAAiB,EAAO,kBAAkB,MAAM,EAAG,CAAoB,CAAC,CAAC,KAAK,IAAI,IAAI,EAAO,kBAAkB,OAAS,EAAuB,QAAU,KACzJ,GACN,EAAQ,KACN,oBAAoB,EAAO,oBAAoB,IAAI,KAAK,MAAM,EAAO,oBAAsB,GAAG,EAAE,GAAG,EAAe,EACpH,CACF,CAEA,OADA,EAAQ,KAAK,aAAa,EAAO,MAAM,EAChC,GAAG,EAAO,KAAK,UAAU,EAAO,MAAM,QAAQ,CAAC,EAAE,KAAK,EAAQ,KAAK,IAAI,GAChF,CAEA,SAAS,EAAU,EAMjB,CACA,IAAI,EAAgB,EAChB,EAAc,EACd,EAAyB,EACzB,EAAY,EAEhB,IAAK,IAAM,KAAQ,EACjB,GAAiB,EAAK,QAAQ,UAAU,OACxC,GAAe,EAAK,QAAQ,MAAM,KAClC,EAAyB,KAAK,IAAI,EAAwB,EAAK,QAAQ,sBAAsB,EAC7F,GAAa,EAAK,QAAQ,UAG5B,MAAO,CAAE,UAAW,EAAM,OAAQ,gBAAe,cAAa,yBAAwB,WAAU,CAClG,CAEA,SAAS,EAAoB,EAAc,EAAmC,CAS5E,OARI,EAAsB,IAAI,CAAI,EACzB,GAGT,CAAI,EAAQ,cAIL,EAAmB,IAAI,CAAI,CACpC,CAEA,SAAS,EAAkB,EAAmB,EAA4B,CACxE,IAAM,EAAW,EAAK,SAAS,EAAW,CAAS,EACnD,OAAO,IAAa,IAAO,IAAa,MAAQ,CAAC,EAAS,WAAW,KAAK,EAAK,KAAK,GAAK,CAAC,EAAK,WAAW,CAAQ,CACpH,CAEA,SAAS,EAAY,EAAc,EAA0B,EAAiB,GAAiC,CAC7G,IAAM,EAAY,EAAK,YAAY,EAEjC,MAAC,IACA,EAAU,SAAS,OAAO,GACzB,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,QAAQ,GAC3B,EAAU,SAAS,SAAS,GAC5B,EAAU,SAAS,UAAU,KAM/B,GAAC,GACD,CAAC,EAAQ,eACR,EAAgB,KAAK,EAAK,SAAS,CAAI,CAAC,GAAK,EAAoB,KAAK,EAAK,SAAS,CAAI,CAAC,IAU5F,OAJI,EAAK,QAAQ,CAAI,IAAM,KAClB,MAGF,EAAoB,IAAI,EAAK,QAAQ,CAAS,CAAC,CACxD,CAEA,SAAS,EAAoB,EAAuB,CAClD,IAAM,EAAS,EAAqB,CAAK,EACzC,GAAI,EAAS,IACX,MAAM,IAAI,EAAqB,wCAAwC,EAEzE,OAAO,CACT,CAEA,SAAS,EAAwB,EAAuB,CACtD,GAAI,CAAC,SAAS,KAAK,CAAK,EACtB,MAAM,IAAI,EAAqB,kCAAkC,EAGnE,IAAM,EAAS,OAAO,CAAK,EAC3B,GAAI,CAAC,OAAO,cAAc,CAAM,GAAK,EAAS,EAC5C,MAAM,IAAI,EAAqB,kCAAkC,EAEnE,OAAO,CACT,CAEA,SAAS,EAAqB,EAAuB,CACnD,GAAI,CAAC,cAAc,KAAK,CAAK,EAC3B,MAAM,IAAI,EAAqB,8BAA8B,EAG/D,IAAM,EAAS,OAAO,CAAK,EAC3B,GAAI,CAAC,OAAO,cAAc,CAAM,GAAK,EAAS,EAC5C,MAAM,IAAI,EAAqB,8BAA8B,EAE/D,OAAO,CACT,CAEA,SAAS,EAAW,EAAc,EAAsB,CACtD,OAAO,EAAK,SAAS,EAAM,CAAI,GAAK,EAAK,SAAS,CAAI,CACxD,CAEA,SAAS,EAAY,EAAuB,CAC1C,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAS,EAAY,EAAuB,CAC1C,QAAQ,OAAO,MAAM,CAAO,CAC9B,CAEA,SAAS,EAAY,EAAwB,CAC3C,OAAO,aAAiB,MAAQ,EAAM,QAAU,OAAO,CAAK,CAC9D"}
+{"version":3,"file":"cli.js","names":[],"sources":["../src/cli.ts"],"sourcesContent":["#!/usr/bin/env node\n\nimport { Command, InvalidArgumentError } from 'commander';\nimport { type CliOptions, configFileName, loadConfig, type ResolvedOptions, resolveOptions } from './cliConfig.js';\nimport type { CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport { runDiffCommand, type DiffCliOptions } from './diffCommand.js';\nimport {\n  addCrossFileDuplication,\n  collectDuplicatedLineNumbers,\n  configSearchDirectory,\n  formatError,\n  formatPath,\n  resolveTarget,\n  scanTarget,\n  writeStderr,\n  writeStdout,\n  type FileMetrics,\n  type ScanResult,\n} from './scan.js';\nimport type { FunctionMetrics } from './types.js';\n\n/** The worst (highest-cognitive-complexity) function of a file, reported as the ranking evidence. */\ninterface WorstFunction {\n  name: string;\n  startLine: number;\n  endLine: number;\n  cognitiveComplexity: number;\n  ncss: number;\n  nestingDepth: number;\n}\n\n/**\n * One ranked refactoring candidate. The score is the sum of the file's repo-relative percentile\n * ranks (each in [0, 1)) over three dimensions: worst-function cognitive complexity, duplicated\n * lines (within-file and cross-file combined), and file NCSS. Ranking is relative to the scanned\n * project, so no absolute threshold is involved.\n */\ninterface RankedFile {\n  file: string;\n  score: number;\n  worstFunction?: WorstFunction;\n  /** Distinct lines covered by within-file duplicate blocks or cross-file duplicate occurrences. */\n  duplicatedLineCount: number;\n  /** duplicatedLineCount / code lines (0 when the file has no code). */\n  duplicatedLineRatio: number;\n  /** Other files sharing cross-file duplicate blocks; filled only for the reported top files. */\n  crossFilePartners: string[];\n  ncss: number;\n  codeLines: number;\n}\n\n/** Caps how many cross-file partners a ranked file lists so the report stays scannable. */\nconst maxCrossFilePartners = 3;\n\n// oxlint-disable-next-line unicorn/prefer-top-level-await -- CommonJS build output cannot preserve top-level await.\nvoid main().catch((error: unknown) => {\n  writeStderr(`Error: ${formatError(error)}\\n`);\n  process.exitCode = 1;\n});\n\n/** Registers the options shared by the ranking command and the diff gate. */\nfunction addSharedOptions(command: Command): Command {\n  return command\n    .option('--config <path>', `config file to use instead of the auto-detected ${configFileName}`)\n    .option(\n      '--duplication-min-tokens <number>',\n      'minimum normalized token count for a duplicate region (default 40)',\n      parsePositiveInteger\n    )\n    .option(\n      '--duplication-max-gap-tokens <number>',\n      'maximum token gap merged into one gapped clone group; 0 disables merging (default 30)',\n      parseNonNegativeInteger\n    )\n    .option(\n      '--duplication-min-similarity-percent <number>',\n      'minimum similarity percent (1-100) for near-miss (Type-3) clone blocks; 100 reports exact matches only (default 70)',\n      parsePercentInteger\n    )\n    .option('--include-tests', 'include test files and test directories')\n    .option('--json', 'print JSON output');\n}\n\nasync function main(): Promise<void> {\n  const program = addSharedOptions(\n    new Command()\n      .name('code-gauge')\n      .description('Rank the files of a project by refactoring priority.')\n      .argument('[target]', 'file or directory to measure', '.')\n  )\n    .option('--top <number>', 'number of top-ranked files to report (default: 10)', parsePositiveInteger)\n    .option('--fail-on-error', 'exit with code 1 when files or directories cannot be scanned');\n\n  program.action(async (target: string, cliOptions: CliOptions) => {\n    const resolvedTarget = resolveTarget(target);\n    const config = await loadConfig(cliOptions.config, await configSearchDirectory(resolvedTarget));\n    const options = resolveOptions(cliOptions, config);\n    const result = await scanTarget(resolvedTarget, options);\n    addCrossFileDuplication(result, options);\n    const rankedFiles = rankFiles(result, options.top);\n\n    if (options.json) {\n      printJson(result, rankedFiles, options);\n    } else {\n      printTextReport(resolvedTarget, result, rankedFiles, options);\n    }\n\n    if (result.fatalError || (options.failOnError && result.errors.length > 0)) {\n      process.exitCode = 1;\n    }\n  });\n\n  addSharedOptions(\n    program\n      .command('diff')\n      .description(\n        'Gate the working tree against a base ref: report only metric regressions in changed files (exit 1 on violations)'\n      )\n      .argument('[target]', 'directory whose changed files are gated', '.')\n      .requiredOption('--base <ref>', 'base git ref; changes are measured against its merge-base with HEAD')\n  )\n    .option('--full', 'also print the passing gate values of every checked function and file')\n    .action(async (target: string, _cliOptions: DiffCliOptions, command: Command) => {\n      // Options sharing a name with a root option (--json, --config, ...) land in the root's\n      // option store, so the merged view is required to see them.\n      await runDiffCommand(target, command.optsWithGlobals() as DiffCliOptions);\n    });\n\n  await program.parseAsync();\n}\n\nfunction rankFiles(result: ScanResult, top: number): RankedFile[] {\n  const candidates = result.files.map(({ file, metrics }) => {\n    const formattedFile = formatPath(file, result.displayRoot);\n    const duplicatedLines = collectDuplicatedLineNumbers(metrics, result.crossFileDuplication, formattedFile);\n    return {\n      file: formattedFile,\n      worstFunction: findWorstFunction(metrics.functions),\n      duplicatedLineCount: duplicatedLines.size,\n      duplicatedLineRatio: metrics.lines.code === 0 ? 0 : duplicatedLines.size / metrics.lines.code,\n      crossFilePartners: [] as string[],\n      ncss: metrics.ncssCount,\n      codeLines: metrics.lines.code,\n    };\n  });\n\n  const cognitivePercentile = makePercentile(candidates.map((c) => c.worstFunction?.cognitiveComplexity ?? 0));\n  const duplicationPercentile = makePercentile(candidates.map((c) => c.duplicatedLineCount));\n  const ncssPercentile = makePercentile(candidates.map((c) => c.ncss));\n\n  const ranked = candidates\n    .map((candidate) => ({\n      ...candidate,\n      score:\n        cognitivePercentile(candidate.worstFunction?.cognitiveComplexity ?? 0) +\n        duplicationPercentile(candidate.duplicatedLineCount) +\n        ncssPercentile(candidate.ncss),\n    }))\n    .toSorted(\n      (left, right) => right.score - left.score || right.ncss - left.ncss || left.file.localeCompare(right.file)\n    );\n  // Partner evidence is attached only to the files that will be reported: expanding partners for\n  // every scanned file first would retain TH(F^2) strings when one clone group spans F files, and\n  // rescanning all groups per file would be O(files x groups) on the post-scan ranking step.\n  attachCrossFilePartners(ranked.slice(0, top), result.crossFileDuplication);\n  return ranked;\n}\n\n/** One pass over the groups fills the reported files' partner lists (other files sharing a group). */\nfunction attachCrossFilePartners(\n  reportedFiles: RankedFile[],\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined\n): void {\n  if (!crossFileDuplication) {\n    return;\n  }\n  const partnersByFile = new Map(reportedFiles.map((ranked) => [ranked.file, new Set<string>()]));\n  for (const group of crossFileDuplication.groups) {\n    for (const file of group.files) {\n      const partners = partnersByFile.get(file);\n      if (!partners) {\n        continue;\n      }\n      for (const partner of group.files) {\n        if (partner !== file) {\n          partners.add(partner);\n        }\n      }\n    }\n  }\n  for (const ranked of reportedFiles) {\n    ranked.crossFilePartners = [...(partnersByFile.get(ranked.file) ?? [])].toSorted();\n  }\n}\n\n/**\n * Percentile rank within the scanned project: the fraction of files with a strictly smaller\n * value, in [0, 1). Relative ranking needs no absolute threshold, which sidesteps the metric\n * calibration problem entirely — the top of the list is worth refactoring first regardless of\n * where any cutoff would sit.\n */\nfunction makePercentile(values: number[]): (value: number) => number {\n  const sorted = values.toSorted((left, right) => left - right);\n  return (value: number) => {\n    let low = 0;\n    let high = sorted.length;\n    while (low < high) {\n      const middle = (low + high) >> 1;\n      if ((sorted[middle] as number) < value) {\n        low = middle + 1;\n      } else {\n        high = middle;\n      }\n    }\n    return sorted.length === 0 ? 0 : low / sorted.length;\n  };\n}\n\n/** The highest-cognitive-complexity function; NCSS breaks ties so the larger body is reported. */\nfunction findWorstFunction(functions: FunctionMetrics[]): WorstFunction | undefined {\n  let worst: FunctionMetrics | undefined;\n  for (const fn of functions) {\n    if (\n      !worst ||\n      fn.cognitiveComplexity > worst.cognitiveComplexity ||\n      (fn.cognitiveComplexity === worst.cognitiveComplexity && fn.ncss > worst.ncss)\n    ) {\n      worst = fn;\n    }\n  }\n  if (!worst) {\n    return undefined;\n  }\n  return {\n    name: worst.name ?? '<anonymous>',\n    startLine: worst.startLine,\n    endLine: worst.endLine,\n    cognitiveComplexity: worst.cognitiveComplexity,\n    ncss: worst.ncss,\n    nestingDepth: worst.nestingDepth,\n  };\n}\n\nfunction printJson(result: ScanResult, rankedFiles: RankedFile[], options: ResolvedOptions): void {\n  const reportedFiles = rankedFiles.slice(0, options.top);\n  writeStdout(\n    JSON.stringify(\n      {\n        summary: summarize(result.files),\n        totalRankedFiles: rankedFiles.length,\n        truncated: reportedFiles.length < rankedFiles.length,\n        files: reportedFiles,\n        errors: result.errors,\n        warnings: result.warnings,\n      },\n      undefined,\n      2\n    ) + '\\n'\n  );\n}\n\nfunction printTextReport(\n  target: string,\n  result: ScanResult,\n  rankedFiles: RankedFile[],\n  options: ResolvedOptions\n): void {\n  if (result.fatalError) {\n    writeStderr(`Error: ${result.fatalError}\\n`);\n    return;\n  }\n\n  const summary = summarize(result.files);\n  writeStdout(\n    `Measured ${summary.fileCount} files under ${target} (code LOC ${summary.linesOfCode}, NCSS ${summary.ncssCount}, functions ${summary.functionCount})\\n`\n  );\n\n  if (rankedFiles.length === 0) {\n    writeStdout('No measurable files found.\\n');\n  } else {\n    const reportedFiles = rankedFiles.slice(0, options.top);\n    const totalSuffix = rankedFiles.length > reportedFiles.length ? ` of ${rankedFiles.length}` : '';\n    writeStdout(`\\nRefactoring candidates (top ${reportedFiles.length}${totalSuffix}):\\n`);\n    for (const [index, ranked] of reportedFiles.entries()) {\n      writeStdout(`${index + 1}. ${formatRankedFile(ranked)}\\n`);\n    }\n  }\n\n  if (result.warnings.length > 0) {\n    writeStderr(`\\nDegraded ${result.warnings.length} files (measured, but excluded from cross-file matching):\\n`);\n    for (const warning of result.warnings.slice(0, 10)) {\n      writeStderr(`- ${warning}\\n`);\n    }\n    if (result.warnings.length > 10) {\n      writeStderr(`- ... ${result.warnings.length - 10} more\\n`);\n    }\n  }\n\n  if (result.errors.length > 0) {\n    writeStderr(`\\nSkipped ${result.errors.length} files or directories:\\n`);\n    for (const error of result.errors.slice(0, 10)) {\n      writeStderr(`- ${error}\\n`);\n    }\n    if (result.errors.length > 10) {\n      writeStderr(`- ... ${result.errors.length - 10} more\\n`);\n    }\n  }\n}\n\n/** One ranked file as a single line: the location, the evidence, and where the duplication points. */\nfunction formatRankedFile(ranked: RankedFile): string {\n  const reasons: string[] = [];\n  if (ranked.worstFunction) {\n    const fn = ranked.worstFunction;\n    reasons.push(\n      `worst function ${fn.name} (L${fn.startLine}-${fn.endLine}) cognitive ${fn.cognitiveComplexity}, NCSS ${fn.ncss}, nesting ${fn.nestingDepth}`\n    );\n  }\n  if (ranked.duplicatedLineCount > 0) {\n    const partnersSuffix =\n      ranked.crossFilePartners.length > 0\n        ? `, shared with ${ranked.crossFilePartners.slice(0, maxCrossFilePartners).join(', ')}${ranked.crossFilePartners.length > maxCrossFilePartners ? ', ...' : ''}`\n        : '';\n    reasons.push(\n      `duplicated lines ${ranked.duplicatedLineCount} (${Math.round(ranked.duplicatedLineRatio * 100)}%${partnersSuffix})`\n    );\n  }\n  reasons.push(`file NCSS ${ranked.ncss}`);\n  return `${ranked.file} (score ${ranked.score.toFixed(2)}): ${reasons.join('; ')}`;\n}\n\nfunction summarize(files: FileMetrics[]): {\n  fileCount: number;\n  functionCount: number;\n  linesOfCode: number;\n  maxCognitiveComplexity: number;\n  ncssCount: number;\n} {\n  let functionCount = 0;\n  let linesOfCode = 0;\n  let maxCognitiveComplexity = 0;\n  let ncssCount = 0;\n\n  for (const file of files) {\n    functionCount += file.metrics.functions.length;\n    linesOfCode += file.metrics.lines.code;\n    maxCognitiveComplexity = Math.max(maxCognitiveComplexity, file.metrics.maxCognitiveComplexity);\n    ncssCount += file.metrics.ncssCount;\n  }\n\n  return { fileCount: files.length, functionCount, linesOfCode, maxCognitiveComplexity, ncssCount };\n}\n\nfunction parsePercentInteger(value: string): number {\n  const parsed = parsePositiveInteger(value);\n  if (parsed > 100) {\n    throw new InvalidArgumentError('Expected an integer between 1 and 100.');\n  }\n  return parsed;\n}\n\nfunction parseNonNegativeInteger(value: string): number {\n  if (!/^\\d+$/u.test(value)) {\n    throw new InvalidArgumentError('Expected a non-negative integer.');\n  }\n\n  const parsed = Number(value);\n  if (!Number.isSafeInteger(parsed) || parsed < 0) {\n    throw new InvalidArgumentError('Expected a non-negative integer.');\n  }\n  return parsed;\n}\n\nfunction parsePositiveInteger(value: string): number {\n  if (!/^[1-9]\\d*$/u.test(value)) {\n    throw new InvalidArgumentError('Expected a positive integer.');\n  }\n\n  const parsed = Number(value);\n  if (!Number.isSafeInteger(parsed) || parsed < 1) {\n    throw new InvalidArgumentError('Expected a positive integer.');\n  }\n  return parsed;\n}\n"],"mappings":";2ZAuDK,EAAK,CAAC,CAAC,MAAO,GAAmB,CACpC,EAAY,UAAU,EAAY,CAAK,EAAE,GAAG,EAC5C,QAAQ,SAAW,CACrB,CAAC,EAGD,SAAS,EAAiB,EAA2B,CACnD,OAAO,EACJ,OAAO,kBAAmB,mDAAmD,GAAgB,CAAC,CAC9F,OACC,oCACA,qEACA,CACF,CAAC,CACA,OACC,wCACA,wFACA,CACF,CAAC,CACA,OACC,gDACA,sHACA,CACF,CAAC,CACA,OAAO,kBAAmB,yCAAyC,CAAC,CACpE,OAAO,SAAU,mBAAmB,CACzC,CAEA,eAAe,GAAsB,CACnC,IAAM,EAAU,EACd,IAAI,EAAQ,CAAC,CACV,KAAK,YAAY,CAAC,CAClB,YAAY,sDAAsD,CAAC,CACnE,SAAS,WAAY,+BAAgC,GAAG,CAC7D,CAAC,CACE,OAAO,iBAAkB,qDAAsD,CAAoB,CAAC,CACpG,OAAO,kBAAmB,8DAA8D,EAE3F,EAAQ,OAAO,MAAO,EAAgB,IAA2B,CAC/D,IAAM,EAAiB,EAAc,CAAM,EACrC,EAAS,MAAM,EAAW,EAAW,OAAQ,MAAM,EAAsB,CAAc,CAAC,EACxF,EAAU,EAAe,EAAY,CAAM,EAC3C,EAAS,MAAM,EAAW,EAAgB,CAAO,EACvD,EAAwB,EAAQ,CAAO,EACvC,IAAM,EAAc,EAAU,EAAQ,EAAQ,GAAG,EAE7C,EAAQ,KACV,EAAU,EAAQ,EAAa,CAAO,EAEtC,EAAgB,EAAgB,EAAQ,EAAa,CAAO,GAG1D,EAAO,YAAe,EAAQ,aAAe,EAAO,OAAO,OAAS,KACtE,QAAQ,SAAW,EAEvB,CAAC,EAED,EACE,EACG,QAAQ,MAAM,CAAC,CACf,YACC,kHACF,CAAC,CACA,SAAS,WAAY,0CAA2C,GAAG,CAAC,CACpE,eAAe,eAAgB,qEAAqE,CACzG,CAAC,CACE,OAAO,SAAU,uEAAuE,CAAC,CACzF,OAAO,MAAO,EAAgB,EAA6B,IAAqB,CAG/E,MAAM,EAAe,EAAQ,EAAQ,gBAAgB,CAAmB,CAC1E,CAAC,EAEH,MAAM,EAAQ,WAAW,CAC3B,CAEA,SAAS,EAAU,EAAoB,EAA2B,CAChE,IAAM,EAAa,EAAO,MAAM,KAAK,CAAE,OAAM,aAAc,CACzD,IAAM,EAAgB,EAAW,EAAM,EAAO,WAAW,EACnD,EAAkB,EAA6B,EAAS,EAAO,qBAAsB,CAAa,EACxG,MAAO,CACL,KAAM,EACN,cAAe,EAAkB,EAAQ,SAAS,EAClD,oBAAqB,EAAgB,KACrC,oBAAqB,EAAQ,MAAM,OAAS,EAAI,EAAI,EAAgB,KAAO,EAAQ,MAAM,KACzF,kBAAmB,CAAC,EACpB,KAAM,EAAQ,UACd,UAAW,EAAQ,MAAM,IAC3B,CACF,CAAC,EAEK,EAAsB,EAAe,EAAW,IAAK,GAAM,EAAE,eAAe,qBAAuB,CAAC,CAAC,EACrG,EAAwB,EAAe,EAAW,IAAK,GAAM,EAAE,mBAAmB,CAAC,EACnF,EAAiB,EAAe,EAAW,IAAK,GAAM,EAAE,IAAI,CAAC,EAE7D,EAAS,EACZ,IAAK,IAAe,CACnB,GAAG,EACH,MACE,EAAoB,EAAU,eAAe,qBAAuB,CAAC,EACrE,EAAsB,EAAU,mBAAmB,EACnD,EAAe,EAAU,IAAI,CACjC,EAAE,CAAC,CACF,UACE,EAAM,IAAU,EAAM,MAAQ,EAAK,OAAS,EAAM,KAAO,EAAK,MAAQ,EAAK,KAAK,cAAc,EAAM,IAAI,CAC3G,EAKF,OADA,EAAwB,EAAO,MAAM,EAAG,CAAG,EAAG,EAAO,oBAAoB,EAClE,CACT,CAGA,SAAS,EACP,EACA,EACM,CACN,GAAI,CAAC,EACH,OAEF,IAAM,EAAiB,IAAI,IAAI,EAAc,IAAK,GAAW,CAAC,EAAO,KAAM,IAAI,GAAa,CAAC,CAAC,EAC9F,IAAK,IAAM,KAAS,EAAqB,OACvC,IAAK,IAAM,KAAQ,EAAM,MAAO,CAC9B,IAAM,EAAW,EAAe,IAAI,CAAI,EACnC,KAGL,IAAK,IAAM,KAAW,EAAM,MACtB,IAAY,GACd,EAAS,IAAI,CAAO,CAG1B,CAEF,IAAK,IAAM,KAAU,EACnB,EAAO,kBAAoB,CAAC,GAAI,EAAe,IAAI,EAAO,IAAI,GAAK,CAAC,CAAE,CAAC,CAAC,SAAS,CAErF,CAQA,SAAS,EAAe,EAA6C,CACnE,IAAM,EAAS,EAAO,UAAU,EAAM,IAAU,EAAO,CAAK,EAC5D,MAAQ,IAAkB,CACxB,IAAI,EAAM,EACN,EAAO,EAAO,OAClB,KAAO,EAAM,GAAM,CACjB,IAAM,EAAU,EAAM,GAAS,EAC1B,EAAO,GAAqB,EAC/B,EAAM,EAAS,EAEf,EAAO,CAEX,CACA,OAAO,EAAO,SAAW,EAAI,EAAI,EAAM,EAAO,MAChD,CACF,CAGA,SAAS,EAAkB,EAAyD,CAClF,IAAI,EACJ,IAAK,IAAM,KAAM,GAEb,CAAC,GACD,EAAG,oBAAsB,EAAM,qBAC9B,EAAG,sBAAwB,EAAM,qBAAuB,EAAG,KAAO,EAAM,QAEzE,EAAQ,GAGP,KAGL,MAAO,CACL,KAAM,EAAM,MAAQ,cACpB,UAAW,EAAM,UACjB,QAAS,EAAM,QACf,oBAAqB,EAAM,oBAC3B,KAAM,EAAM,KACZ,aAAc,EAAM,YACtB,CACF,CAEA,SAAS,EAAU,EAAoB,EAA2B,EAAgC,CAChG,IAAM,EAAgB,EAAY,MAAM,EAAG,EAAQ,GAAG,EACtD,EACE,KAAK,UACH,CACE,QAAS,EAAU,EAAO,KAAK,EAC/B,iBAAkB,EAAY,OAC9B,UAAW,EAAc,OAAS,EAAY,OAC9C,MAAO,EACP,OAAQ,EAAO,OACf,SAAU,EAAO,QACnB,EACA,IAAA,GACA,CACF,EAAI;CACN,CACF,CAEA,SAAS,EACP,EACA,EACA,EACA,EACM,CACN,GAAI,EAAO,WAAY,CACrB,EAAY,UAAU,EAAO,WAAW,GAAG,EAC3C,MACF,CAEA,IAAM,EAAU,EAAU,EAAO,KAAK,EAKtC,GAJA,EACE,YAAY,EAAQ,UAAU,eAAe,EAAO,aAAa,EAAQ,YAAY,SAAS,EAAQ,UAAU,cAAc,EAAQ,cAAc,IACtJ,EAEI,EAAY,SAAW,EACzB,EAAY;CAA8B,MACrC,CACL,IAAM,EAAgB,EAAY,MAAM,EAAG,EAAQ,GAAG,EAChD,EAAc,EAAY,OAAS,EAAc,OAAS,OAAO,EAAY,SAAW,GAC9F,EAAY,iCAAiC,EAAc,SAAS,EAAY,KAAK,EACrF,IAAK,GAAM,CAAC,EAAO,KAAW,EAAc,QAAQ,EAClD,EAAY,GAAG,EAAQ,EAAE,IAAI,EAAiB,CAAM,EAAE,GAAG,CAE7D,CAEA,GAAI,EAAO,SAAS,OAAS,EAAG,CAC9B,EAAY,cAAc,EAAO,SAAS,OAAO,4DAA4D,EAC7G,IAAK,IAAM,KAAW,EAAO,SAAS,MAAM,EAAG,EAAE,EAC/C,EAAY,KAAK,EAAQ,GAAG,EAE1B,EAAO,SAAS,OAAS,IAC3B,EAAY,SAAS,EAAO,SAAS,OAAS,GAAG,QAAQ,CAE7D,CAEA,GAAI,EAAO,OAAO,OAAS,EAAG,CAC5B,EAAY,aAAa,EAAO,OAAO,OAAO,yBAAyB,EACvE,IAAK,IAAM,KAAS,EAAO,OAAO,MAAM,EAAG,EAAE,EAC3C,EAAY,KAAK,EAAM,GAAG,EAExB,EAAO,OAAO,OAAS,IACzB,EAAY,SAAS,EAAO,OAAO,OAAS,GAAG,QAAQ,CAE3D,CACF,CAGA,SAAS,EAAiB,EAA4B,CACpD,IAAM,EAAoB,CAAC,EAC3B,GAAI,EAAO,cAAe,CACxB,IAAM,EAAK,EAAO,cAClB,EAAQ,KACN,kBAAkB,EAAG,KAAK,KAAK,EAAG,UAAU,GAAG,EAAG,QAAQ,cAAc,EAAG,oBAAoB,SAAS,EAAG,KAAK,YAAY,EAAG,cACjI,CACF,CACA,GAAI,EAAO,oBAAsB,EAAG,CAClC,IAAM,EACJ,EAAO,kBAAkB,OAAS,EAC9B,iBAAiB,EAAO,kBAAkB,MAAM,EAAG,CAAoB,CAAC,CAAC,KAAK,IAAI,IAAI,EAAO,kBAAkB,OAAS,EAAuB,QAAU,KACzJ,GACN,EAAQ,KACN,oBAAoB,EAAO,oBAAoB,IAAI,KAAK,MAAM,EAAO,oBAAsB,GAAG,EAAE,GAAG,EAAe,EACpH,CACF,CAEA,OADA,EAAQ,KAAK,aAAa,EAAO,MAAM,EAChC,GAAG,EAAO,KAAK,UAAU,EAAO,MAAM,QAAQ,CAAC,EAAE,KAAK,EAAQ,KAAK,IAAI,GAChF,CAEA,SAAS,EAAU,EAMjB,CACA,IAAI,EAAgB,EAChB,EAAc,EACd,EAAyB,EACzB,EAAY,EAEhB,IAAK,IAAM,KAAQ,EACjB,GAAiB,EAAK,QAAQ,UAAU,OACxC,GAAe,EAAK,QAAQ,MAAM,KAClC,EAAyB,KAAK,IAAI,EAAwB,EAAK,QAAQ,sBAAsB,EAC7F,GAAa,EAAK,QAAQ,UAG5B,MAAO,CAAE,UAAW,EAAM,OAAQ,gBAAe,cAAa,yBAAwB,WAAU,CAClG,CAEA,SAAS,EAAoB,EAAuB,CAClD,IAAM,EAAS,EAAqB,CAAK,EACzC,GAAI,EAAS,IACX,MAAM,IAAI,EAAqB,wCAAwC,EAEzE,OAAO,CACT,CAEA,SAAS,EAAwB,EAAuB,CACtD,GAAI,CAAC,SAAS,KAAK,CAAK,EACtB,MAAM,IAAI,EAAqB,kCAAkC,EAGnE,IAAM,EAAS,OAAO,CAAK,EAC3B,GAAI,CAAC,OAAO,cAAc,CAAM,GAAK,EAAS,EAC5C,MAAM,IAAI,EAAqB,kCAAkC,EAEnE,OAAO,CACT,CAEA,SAAS,EAAqB,EAAuB,CACnD,GAAI,CAAC,cAAc,KAAK,CAAK,EAC3B,MAAM,IAAI,EAAqB,8BAA8B,EAG/D,IAAM,EAAS,OAAO,CAAK,EAC3B,GAAI,CAAC,OAAO,cAAc,CAAM,GAAK,EAAS,EAC5C,MAAM,IAAI,EAAqB,8BAA8B,EAE/D,OAAO,CACT"}

package/dist/cliConfig.cjs

@@ -1,2 +1,2 @@
-"use strict";const e=require("./_virtual/_rolldown/runtime.cjs"),t=require("./duplication.cjs");let n=require("node:fs/promises"),r=require("node:path");r=e.__toESM(r,1);const i=`code-gauge.config.json`;function a(e,n){return{duplication:{minTokens:e.duplicationMinTokens??n.duplication?.minTokens??t.defaultDuplicationOptions.minTokens,maxGapTokens:e.duplicationMaxGapTokens??n.duplication?.maxGapTokens??t.defaultDuplicationOptions.maxGapTokens,minSimilarityPercent:e.duplicationMinSimilarityPercent??n.duplication?.minSimilarityPercent??t.defaultDuplicationOptions.minSimilarityPercent},top:e.top??n.rank?.top??10,includeTests:e.includeTests??n.includeTests??!1,failOnError:e.failOnError??n.failOnError??!1,json:e.json??!1}}async function o(e,t){let r=e??await s(t);if(!r)return{};let i;try{i=await(0,n.readFile)(r,`utf8`)}catch(t){if(e)throw Error(`Cannot read config file "${r}": ${h(t)}`);return{}}let a;try{a=JSON.parse(i)}catch(e){throw Error(`Invalid JSON in config file "${r}": ${h(e)}`)}return l(a,r)}async function s(e){let t=e;for(;;){let e=r.default.join(t,i);if(await c(e))return e;let n=r.default.dirname(t);if(n===t)return;t=n}}async function c(e){try{return(await(0,n.stat)(e)).isFile()}catch{return!1}}function l(e,t){if(typeof e!=`object`||!e||Array.isArray(e))throw Error(`Config file "${t}" must contain a JSON object.`);let n=e,r=new Set([`duplication`,`rank`,`includeTests`,`failOnError`]);for(let e of Object.keys(n))if(!r.has(e))throw Error(`Config file "${t}": unknown setting "${e}" (expected ${[...r].join(`, `)}).`);let i={};n.duplication!==void 0&&(i.duplication=d(n.duplication,t)),n.rank!==void 0&&(i.rank=u(n.rank,t));for(let e of[`includeTests`,`failOnError`])n[e]!==void 0&&(i[e]=m(n[e],e,t));return i}function u(e,t){if(typeof e!=`object`||!e||Array.isArray(e))throw Error(`Config file "${t}": "rank" must be an object.`);let n={};for(let[r,i]of Object.entries(e)){if(r!==`top`)throw Error(`Config file "${t}": unknown setting "${r}" in "rank" (expected top).`);n.top=p(i,`rank.top`,t)}return n}function d(e,t){if(typeof e!=`object`||!e||Array.isArray(e))throw Error(`Config file "${t}": "duplication" must be an object.`);let n={};for(let[r,i]of Object.entries(e))if(r===`minTokens`)n.minTokens=p(i,`duplication.minTokens`,t);else if(r===`maxGapTokens`)n.maxGapTokens=f(i,`duplication.maxGapTokens`,t);else if(r===`minSimilarityPercent`){let e=p(i,`duplication.minSimilarityPercent`,t);if(e>100)throw Error(`Config file "${t}": "duplication.minSimilarityPercent" must be between 1 and 100.`);n.minSimilarityPercent=e}else throw Error(`Config file "${t}": unknown setting "${r}" in "duplication" (expected minTokens, maxGapTokens, or minSimilarityPercent).`);return n}function f(e,t,n){if(typeof e!=`number`||!Number.isSafeInteger(e)||e<0)throw Error(`Config file "${n}": "${t}" must be a non-negative integer.`);return e}function p(e,t,n){if(typeof e!=`number`||!Number.isSafeInteger(e)||e<1)throw Error(`Config file "${n}": "${t}" must be a positive integer.`);return e}function m(e,t,n){if(typeof e!=`boolean`)throw TypeError(`Config file "${n}": "${t}" must be a boolean.`);return e}function h(e){return e instanceof Error?e.message:String(e)}exports.configFileName=i,exports.loadConfig=o,exports.resolveOptions=a;
+"use strict";const e=require("./_virtual/_rolldown/runtime.cjs"),t=require("./duplication.cjs"),n=require("./regressionGate.cjs");let r=require("node:fs/promises"),i=require("node:path");i=e.__toESM(i,1);const a=`code-gauge.config.json`;function o(e,n){return{duplication:{minTokens:e.duplicationMinTokens??n.duplication?.minTokens??t.defaultDuplicationOptions.minTokens,maxGapTokens:e.duplicationMaxGapTokens??n.duplication?.maxGapTokens??t.defaultDuplicationOptions.maxGapTokens,minSimilarityPercent:e.duplicationMinSimilarityPercent??n.duplication?.minSimilarityPercent??t.defaultDuplicationOptions.minSimilarityPercent},top:e.top??n.rank?.top??10,includeTests:e.includeTests??n.includeTests??!1,failOnError:e.failOnError??n.failOnError??!1,json:e.json??!1}}function s(e){return{newFunction:{...n.defaultGateOptions.newFunction,...e.gate?.newFunction},tolerance:{...n.defaultGateOptions.tolerance,...e.gate?.tolerance},matchSimilarityPercent:e.gate?.matchSimilarityPercent??n.defaultGateOptions.matchSimilarityPercent}}async function c(e,t){let n=e??await l(t);if(!n)return{};let i;try{i=await(0,r.readFile)(n,`utf8`)}catch(t){if(e)throw Error(`Cannot read config file "${n}": ${x(t)}`);return{}}let a;try{a=JSON.parse(i)}catch(e){throw Error(`Invalid JSON in config file "${n}": ${x(e)}`)}return d(a,n)}async function l(e){let t=e;for(;;){let e=i.default.join(t,a);if(await u(e))return e;let n=i.default.dirname(t);if(n===t)return;t=n}}async function u(e){try{return(await(0,r.stat)(e)).isFile()}catch{return!1}}function d(e,t){if(typeof e!=`object`||!e||Array.isArray(e))throw Error(`Config file "${t}" must contain a JSON object.`);let n=e,r=new Set([`duplication`,`rank`,`gate`,`includeTests`,`failOnError`]);for(let e of Object.keys(n))if(!r.has(e))throw Error(`Config file "${t}": unknown setting "${e}" (expected ${[...r].join(`, `)}).`);let i={};n.duplication!==void 0&&(i.duplication=h(n.duplication,t)),n.rank!==void 0&&(i.rank=f(n.rank,t)),n.gate!==void 0&&(i.gate=p(n.gate,t));for(let e of[`includeTests`,`failOnError`])n[e]!==void 0&&(i[e]=b(n[e],e,t));return i}function f(e,t){if(typeof e!=`object`||!e||Array.isArray(e))throw Error(`Config file "${t}": "rank" must be an object.`);let n={};for(let[r,i]of Object.entries(e)){if(r!==`top`)throw Error(`Config file "${t}": unknown setting "${r}" in "rank" (expected top).`);n.top=v(i,`rank.top`,t)}return n}function p(e,t){if(typeof e!=`object`||!e||Array.isArray(e))throw Error(`Config file "${t}": "gate" must be an object.`);let r={};for(let[i,a]of Object.entries(e))if(i===`newFunction`)r.newFunction=m(a,`gate.newFunction`,Object.keys(n.defaultGateOptions.newFunction),t,_);else if(i===`tolerance`)r.tolerance=m(a,`gate.tolerance`,Object.keys(n.defaultGateOptions.tolerance),t,g);else if(i===`matchSimilarityPercent`){let e=v(a,`gate.matchSimilarityPercent`,t);if(e>100)throw Error(`Config file "${t}": "gate.matchSimilarityPercent" must be between 1 and 100.`);r.matchSimilarityPercent=e}else throw Error(`Config file "${t}": unknown setting "${i}" in "gate" (expected newFunction, tolerance, or matchSimilarityPercent).`);return r}function m(e,t,n,r,i){if(typeof e!=`object`||!e||Array.isArray(e))throw Error(`Config file "${r}": "${t}" must be an object.`);let a={};for(let[o,s]of Object.entries(e)){if(!n.includes(o))throw Error(`Config file "${r}": unknown setting "${o}" in "${t}" (expected ${n.join(`, `)}).`);a[o]=i(s,`${t}.${o}`,r)}return a}function h(e,t){if(typeof e!=`object`||!e||Array.isArray(e))throw Error(`Config file "${t}": "duplication" must be an object.`);let n={};for(let[r,i]of Object.entries(e))if(r===`minTokens`)n.minTokens=v(i,`duplication.minTokens`,t);else if(r===`maxGapTokens`)n.maxGapTokens=_(i,`duplication.maxGapTokens`,t);else if(r===`minSimilarityPercent`){let e=v(i,`duplication.minSimilarityPercent`,t);if(e>100)throw Error(`Config file "${t}": "duplication.minSimilarityPercent" must be between 1 and 100.`);n.minSimilarityPercent=e}else throw Error(`Config file "${t}": unknown setting "${r}" in "duplication" (expected minTokens, maxGapTokens, or minSimilarityPercent).`);return n}function g(e,t,n){return y(e,t,n,Number.isFinite,`a non-negative number`)}function _(e,t,n){return y(e,t,n,Number.isSafeInteger,`a non-negative integer`)}function v(e,t,n){let r=y(e,t,n,Number.isSafeInteger,`a positive integer`);if(r<1)throw Error(`Config file "${n}": "${t}" must be a positive integer.`);return r}function y(e,t,n,r,i){if(typeof e!=`number`||!r(e)||e<0)throw Error(`Config file "${n}": "${t}" must be ${i}.`);return e}function b(e,t,n){if(typeof e!=`boolean`)throw TypeError(`Config file "${n}": "${t}" must be a boolean.`);return e}function x(e){return e instanceof Error?e.message:String(e)}exports.configFileName=a,exports.loadConfig=c,exports.resolveGateOptions=s,exports.resolveOptions=o;
 //# sourceMappingURL=cliConfig.cjs.map

package/dist/cliConfig.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"cliConfig.cjs","names":["defaultDuplicationOptions","readFile","path","stat"],"sources":["../src/cliConfig.ts"],"sourcesContent":["import { readFile, stat } from 'node:fs/promises';\nimport path from 'node:path';\nimport { defaultDuplicationOptions } from './duplication.js';\nimport type { DuplicationOptions } from './types.js';\n\nexport const configFileName = 'code-gauge.config.json';\nexport const defaultTopFileCount = 10;\n\n/** Shape of the JSON configuration file. All fields are optional and fall back to the built-in defaults. */\nexport interface CodeGaugeConfig {\n  /** Duplication detection settings applied to every measured file. */\n  duplication?: DuplicationOptions;\n  /** Refactoring-candidate ranking settings. */\n  rank?: { top?: number };\n  includeTests?: boolean;\n  failOnError?: boolean;\n}\n\n/** Raw command-line options; every field is undefined unless the user passed the flag. */\nexport interface CliOptions {\n  config?: string;\n  top?: number;\n  duplicationMinTokens?: number;\n  duplicationMaxGapTokens?: number;\n  duplicationMinSimilarityPercent?: number;\n  includeTests?: boolean;\n  failOnError?: boolean;\n  json?: boolean;\n}\n\n/** Options after merging command-line flags, the configuration file, and the built-in defaults. */\nexport interface ResolvedOptions {\n  duplication: Required<DuplicationOptions>;\n  /** Number of top-ranked files to report. */\n  top: number;\n  includeTests: boolean;\n  failOnError: boolean;\n  json: boolean;\n}\n\n/** Resolves options with precedence command-line flags > configuration file > built-in defaults. */\nexport function resolveOptions(cli: CliOptions, config: CodeGaugeConfig): ResolvedOptions {\n  return {\n    duplication: {\n      minTokens: cli.duplicationMinTokens ?? config.duplication?.minTokens ?? defaultDuplicationOptions.minTokens,\n      maxGapTokens:\n        cli.duplicationMaxGapTokens ?? config.duplication?.maxGapTokens ?? defaultDuplicationOptions.maxGapTokens,\n      minSimilarityPercent:\n        cli.duplicationMinSimilarityPercent ??\n        config.duplication?.minSimilarityPercent ??\n        defaultDuplicationOptions.minSimilarityPercent,\n    },\n    top: cli.top ?? config.rank?.top ?? defaultTopFileCount,\n    includeTests: cli.includeTests ?? config.includeTests ?? false,\n    failOnError: cli.failOnError ?? config.failOnError ?? false,\n    json: cli.json ?? false,\n  };\n}\n\n/**\n * Loads the configuration file. An explicit path must exist; otherwise the nearest\n * `code-gauge.config.json` is searched by walking up from the target directory.\n */\nexport async function loadConfig(explicitPath: string | undefined, targetDirectory: string): Promise<CodeGaugeConfig> {\n  const configFile = explicitPath ?? (await findNearestConfig(targetDirectory));\n  if (!configFile) {\n    return {};\n  }\n\n  let content;\n  try {\n    content = await readFile(configFile, 'utf8');\n  } catch (error) {\n    if (explicitPath) {\n      throw new Error(`Cannot read config file \"${configFile}\": ${formatError(error)}`);\n    }\n    return {};\n  }\n\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(content);\n  } catch (error) {\n    throw new Error(`Invalid JSON in config file \"${configFile}\": ${formatError(error)}`);\n  }\n\n  return validateConfig(parsed, configFile);\n}\n\nasync function findNearestConfig(targetDirectory: string): Promise<string | undefined> {\n  let currentDirectory = targetDirectory;\n  while (true) {\n    const configFile = path.join(currentDirectory, configFileName);\n    if (await fileExists(configFile)) {\n      return configFile;\n    }\n\n    const parentDirectory = path.dirname(currentDirectory);\n    if (parentDirectory === currentDirectory) {\n      return undefined;\n    }\n    currentDirectory = parentDirectory;\n  }\n}\n\nasync function fileExists(file: string): Promise<boolean> {\n  try {\n    const fileStat = await stat(file);\n    return fileStat.isFile();\n  } catch {\n    return false;\n  }\n}\n\nfunction validateConfig(value: unknown, configFile: string): CodeGaugeConfig {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) {\n    throw new Error(`Config file \"${configFile}\" must contain a JSON object.`);\n  }\n\n  const raw = value as Record<string, unknown>;\n  const knownKeys = new Set(['duplication', 'rank', 'includeTests', 'failOnError']);\n  for (const key of Object.keys(raw)) {\n    if (!knownKeys.has(key)) {\n      throw new Error(`Config file \"${configFile}\": unknown setting \"${key}\" (expected ${[...knownKeys].join(', ')}).`);\n    }\n  }\n  const config: CodeGaugeConfig = {};\n\n  if (raw.duplication !== undefined) {\n    config.duplication = validateDuplicationObject(raw.duplication, configFile);\n  }\n\n  if (raw.rank !== undefined) {\n    config.rank = validateRankObject(raw.rank, configFile);\n  }\n\n  for (const key of ['includeTests', 'failOnError'] as const) {\n    if (raw[key] !== undefined) {\n      config[key] = requireBoolean(raw[key], key, configFile);\n    }\n  }\n\n  return config;\n}\n\nfunction validateRankObject(value: unknown, configFile: string): { top?: number } {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) {\n    throw new Error(`Config file \"${configFile}\": \"rank\" must be an object.`);\n  }\n  const rank: { top?: number } = {};\n  for (const [key, setting] of Object.entries(value as Record<string, unknown>)) {\n    if (key !== 'top') {\n      throw new Error(`Config file \"${configFile}\": unknown setting \"${key}\" in \"rank\" (expected top).`);\n    }\n    rank.top = requirePositiveInteger(setting, 'rank.top', configFile);\n  }\n  return rank;\n}\n\nfunction validateDuplicationObject(value: unknown, configFile: string): DuplicationOptions {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) {\n    throw new Error(`Config file \"${configFile}\": \"duplication\" must be an object.`);\n  }\n  const duplication: DuplicationOptions = {};\n  for (const [key, setting] of Object.entries(value as Record<string, unknown>)) {\n    if (key === 'minTokens') {\n      duplication.minTokens = requirePositiveInteger(setting, 'duplication.minTokens', configFile);\n    } else if (key === 'maxGapTokens') {\n      // 0 is meaningful: it disables gapped-clone merging.\n      duplication.maxGapTokens = requireNonNegativeInteger(setting, 'duplication.maxGapTokens', configFile);\n    } else if (key === 'minSimilarityPercent') {\n      const parsed = requirePositiveInteger(setting, 'duplication.minSimilarityPercent', configFile);\n      if (parsed > 100) {\n        throw new Error(`Config file \"${configFile}\": \"duplication.minSimilarityPercent\" must be between 1 and 100.`);\n      }\n      duplication.minSimilarityPercent = parsed;\n    } else {\n      throw new Error(\n        `Config file \"${configFile}\": unknown setting \"${key}\" in \"duplication\" (expected minTokens, maxGapTokens, or minSimilarityPercent).`\n      );\n    }\n  }\n  return duplication;\n}\n\nfunction requireNonNegativeInteger(value: unknown, key: string, configFile: string): number {\n  if (typeof value !== 'number' || !Number.isSafeInteger(value) || value < 0) {\n    throw new Error(`Config file \"${configFile}\": \"${key}\" must be a non-negative integer.`);\n  }\n  return value;\n}\n\nfunction requirePositiveInteger(value: unknown, key: string, configFile: string): number {\n  if (typeof value !== 'number' || !Number.isSafeInteger(value) || value < 1) {\n    throw new Error(`Config file \"${configFile}\": \"${key}\" must be a positive integer.`);\n  }\n  return value;\n}\n\nfunction requireBoolean(value: unknown, key: string, configFile: string): boolean {\n  if (typeof value !== 'boolean') {\n    throw new TypeError(`Config file \"${configFile}\": \"${key}\" must be a boolean.`);\n  }\n  return value;\n}\n\nfunction formatError(error: unknown): string {\n  return error instanceof Error ? error.message : String(error);\n}\n"],"mappings":"0KAKA,MAAa,EAAiB,yBAoC9B,SAAgB,EAAe,EAAiB,EAA0C,CACxF,MAAO,CACL,YAAa,CACX,UAAW,EAAI,sBAAwB,EAAO,aAAa,WAAaA,EAAAA,0BAA0B,UAClG,aACE,EAAI,yBAA2B,EAAO,aAAa,cAAgBA,EAAAA,0BAA0B,aAC/F,qBACE,EAAI,iCACJ,EAAO,aAAa,sBACpBA,EAAAA,0BAA0B,oBAC9B,EACA,IAAK,EAAI,KAAO,EAAO,MAAM,KAAA,GAC7B,aAAc,EAAI,cAAgB,EAAO,cAAgB,GACzD,YAAa,EAAI,aAAe,EAAO,aAAe,GACtD,KAAM,EAAI,MAAQ,EACpB,CACF,CAMA,eAAsB,EAAW,EAAkC,EAAmD,CACpH,IAAM,EAAa,GAAiB,MAAM,EAAkB,CAAe,EAC3E,GAAI,CAAC,EACH,MAAO,CAAC,EAGV,IAAI,EACJ,GAAI,CACF,EAAU,MAAA,EAAMC,EAAAA,SAAAA,CAAS,EAAY,MAAM,CAC7C,OAAS,EAAO,CACd,GAAI,EACF,MAAU,MAAM,4BAA4B,EAAW,KAAK,EAAY,CAAK,GAAG,EAElF,MAAO,CAAC,CACV,CAEA,IAAI,EACJ,GAAI,CACF,EAAS,KAAK,MAAM,CAAO,CAC7B,OAAS,EAAO,CACd,MAAU,MAAM,gCAAgC,EAAW,KAAK,EAAY,CAAK,GAAG,CACtF,CAEA,OAAO,EAAe,EAAQ,CAAU,CAC1C,CAEA,eAAe,EAAkB,EAAsD,CACrF,IAAI,EAAmB,EACvB,OAAa,CACX,IAAM,EAAaC,EAAAA,QAAK,KAAK,EAAkB,CAAc,EAC7D,GAAI,MAAM,EAAW,CAAU,EAC7B,OAAO,EAGT,IAAM,EAAkBA,EAAAA,QAAK,QAAQ,CAAgB,EACrD,GAAI,IAAoB,EACtB,OAEF,EAAmB,CACrB,CACF,CAEA,eAAe,EAAW,EAAgC,CACxD,GAAI,CAEF,OAAO,MAAA,EADgBC,EAAAA,KAAAA,CAAK,CAAI,EAAA,CAChB,OAAO,CACzB,MAAQ,CACN,MAAO,EACT,CACF,CAEA,SAAS,EAAe,EAAgB,EAAqC,CAC3E,GAAI,OAAO,GAAU,WAAY,GAAkB,MAAM,QAAQ,CAAK,EACpE,MAAU,MAAM,gBAAgB,EAAW,8BAA8B,EAG3E,IAAM,EAAM,EACN,EAAY,IAAI,IAAI,CAAC,cAAe,OAAQ,eAAgB,aAAa,CAAC,EAChF,IAAK,IAAM,KAAO,OAAO,KAAK,CAAG,EAC/B,GAAI,CAAC,EAAU,IAAI,CAAG,EACpB,MAAU,MAAM,gBAAgB,EAAW,sBAAsB,EAAI,cAAc,CAAC,GAAG,CAAS,CAAC,CAAC,KAAK,IAAI,EAAE,GAAG,EAGpH,IAAM,EAA0B,CAAC,EAE7B,EAAI,cAAgB,IAAA,KACtB,EAAO,YAAc,EAA0B,EAAI,YAAa,CAAU,GAGxE,EAAI,OAAS,IAAA,KACf,EAAO,KAAO,EAAmB,EAAI,KAAM,CAAU,GAGvD,IAAK,IAAM,IAAO,CAAC,eAAgB,aAAa,EAC1C,EAAI,KAAS,IAAA,KACf,EAAO,GAAO,EAAe,EAAI,GAAM,EAAK,CAAU,GAI1D,OAAO,CACT,CAEA,SAAS,EAAmB,EAAgB,EAAsC,CAChF,GAAI,OAAO,GAAU,WAAY,GAAkB,MAAM,QAAQ,CAAK,EACpE,MAAU,MAAM,gBAAgB,EAAW,6BAA6B,EAE1E,IAAM,EAAyB,CAAC,EAChC,IAAK,GAAM,CAAC,EAAK,KAAY,OAAO,QAAQ,CAAgC,EAAG,CAC7E,GAAI,IAAQ,MACV,MAAU,MAAM,gBAAgB,EAAW,sBAAsB,EAAI,4BAA4B,EAEnG,EAAK,IAAM,EAAuB,EAAS,WAAY,CAAU,CACnE,CACA,OAAO,CACT,CAEA,SAAS,EAA0B,EAAgB,EAAwC,CACzF,GAAI,OAAO,GAAU,WAAY,GAAkB,MAAM,QAAQ,CAAK,EACpE,MAAU,MAAM,gBAAgB,EAAW,oCAAoC,EAEjF,IAAM,EAAkC,CAAC,EACzC,IAAK,GAAM,CAAC,EAAK,KAAY,OAAO,QAAQ,CAAgC,EAC1E,GAAI,IAAQ,YACV,EAAY,UAAY,EAAuB,EAAS,wBAAyB,CAAU,OACtF,GAAI,IAAQ,eAEjB,EAAY,aAAe,EAA0B,EAAS,2BAA4B,CAAU,OAC/F,GAAI,IAAQ,uBAAwB,CACzC,IAAM,EAAS,EAAuB,EAAS,mCAAoC,CAAU,EAC7F,GAAI,EAAS,IACX,MAAU,MAAM,gBAAgB,EAAW,iEAAiE,EAE9G,EAAY,qBAAuB,CACrC,MACE,MAAU,MACR,gBAAgB,EAAW,sBAAsB,EAAI,gFACvD,EAGJ,OAAO,CACT,CAEA,SAAS,EAA0B,EAAgB,EAAa,EAA4B,CAC1F,GAAI,OAAO,GAAU,UAAY,CAAC,OAAO,cAAc,CAAK,GAAK,EAAQ,EACvE,MAAU,MAAM,gBAAgB,EAAW,MAAM,EAAI,kCAAkC,EAEzF,OAAO,CACT,CAEA,SAAS,EAAuB,EAAgB,EAAa,EAA4B,CACvF,GAAI,OAAO,GAAU,UAAY,CAAC,OAAO,cAAc,CAAK,GAAK,EAAQ,EACvE,MAAU,MAAM,gBAAgB,EAAW,MAAM,EAAI,8BAA8B,EAErF,OAAO,CACT,CAEA,SAAS,EAAe,EAAgB,EAAa,EAA6B,CAChF,GAAI,OAAO,GAAU,UACnB,MAAU,UAAU,gBAAgB,EAAW,MAAM,EAAI,qBAAqB,EAEhF,OAAO,CACT,CAEA,SAAS,EAAY,EAAwB,CAC3C,OAAO,aAAiB,MAAQ,EAAM,QAAU,OAAO,CAAK,CAC9D"}
+{"version":3,"file":"cliConfig.cjs","names":["defaultDuplicationOptions","defaultGateOptions","readFile","path","stat"],"sources":["../src/cliConfig.ts"],"sourcesContent":["import { readFile, stat } from 'node:fs/promises';\nimport path from 'node:path';\nimport { defaultDuplicationOptions } from './duplication.js';\nimport {\n  defaultGateOptions,\n  type GateOptions,\n  type GateTolerances,\n  type NewFunctionThresholds,\n} from './regressionGate.js';\nimport type { DuplicationOptions } from './types.js';\n\nexport const configFileName = 'code-gauge.config.json';\nexport const defaultTopFileCount = 10;\n\n/** Regression-gate settings for `code-gauge diff`; unset fields use the built-in defaults. */\nexport interface GateConfig {\n  newFunction?: Partial<NewFunctionThresholds>;\n  tolerance?: Partial<GateTolerances>;\n  matchSimilarityPercent?: number;\n}\n\n/** Shape of the JSON configuration file. All fields are optional and fall back to the built-in defaults. */\nexport interface CodeGaugeConfig {\n  /** Duplication detection settings applied to every measured file. */\n  duplication?: DuplicationOptions;\n  /** Refactoring-candidate ranking settings. */\n  rank?: { top?: number };\n  /** Regression-gate settings for `code-gauge diff`. */\n  gate?: GateConfig;\n  includeTests?: boolean;\n  failOnError?: boolean;\n}\n\n/** Raw command-line options; every field is undefined unless the user passed the flag. */\nexport interface CliOptions {\n  config?: string;\n  top?: number;\n  duplicationMinTokens?: number;\n  duplicationMaxGapTokens?: number;\n  duplicationMinSimilarityPercent?: number;\n  includeTests?: boolean;\n  failOnError?: boolean;\n  json?: boolean;\n}\n\n/** Options after merging command-line flags, the configuration file, and the built-in defaults. */\nexport interface ResolvedOptions {\n  duplication: Required<DuplicationOptions>;\n  /** Number of top-ranked files to report. */\n  top: number;\n  includeTests: boolean;\n  failOnError: boolean;\n  json: boolean;\n}\n\n/** Resolves options with precedence command-line flags > configuration file > built-in defaults. */\nexport function resolveOptions(cli: CliOptions, config: CodeGaugeConfig): ResolvedOptions {\n  return {\n    duplication: {\n      minTokens: cli.duplicationMinTokens ?? config.duplication?.minTokens ?? defaultDuplicationOptions.minTokens,\n      maxGapTokens:\n        cli.duplicationMaxGapTokens ?? config.duplication?.maxGapTokens ?? defaultDuplicationOptions.maxGapTokens,\n      minSimilarityPercent:\n        cli.duplicationMinSimilarityPercent ??\n        config.duplication?.minSimilarityPercent ??\n        defaultDuplicationOptions.minSimilarityPercent,\n    },\n    top: cli.top ?? config.rank?.top ?? defaultTopFileCount,\n    includeTests: cli.includeTests ?? config.includeTests ?? false,\n    failOnError: cli.failOnError ?? config.failOnError ?? false,\n    json: cli.json ?? false,\n  };\n}\n\n/** Resolves the regression-gate settings with precedence configuration file > built-in defaults. */\nexport function resolveGateOptions(config: CodeGaugeConfig): GateOptions {\n  return {\n    newFunction: { ...defaultGateOptions.newFunction, ...config.gate?.newFunction },\n    tolerance: { ...defaultGateOptions.tolerance, ...config.gate?.tolerance },\n    matchSimilarityPercent: config.gate?.matchSimilarityPercent ?? defaultGateOptions.matchSimilarityPercent,\n  };\n}\n\n/**\n * Loads the configuration file. An explicit path must exist; otherwise the nearest\n * `code-gauge.config.json` is searched by walking up from the target directory.\n */\nexport async function loadConfig(explicitPath: string | undefined, targetDirectory: string): Promise<CodeGaugeConfig> {\n  const configFile = explicitPath ?? (await findNearestConfig(targetDirectory));\n  if (!configFile) {\n    return {};\n  }\n\n  let content;\n  try {\n    content = await readFile(configFile, 'utf8');\n  } catch (error) {\n    if (explicitPath) {\n      throw new Error(`Cannot read config file \"${configFile}\": ${formatError(error)}`);\n    }\n    return {};\n  }\n\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(content);\n  } catch (error) {\n    throw new Error(`Invalid JSON in config file \"${configFile}\": ${formatError(error)}`);\n  }\n\n  return validateConfig(parsed, configFile);\n}\n\nasync function findNearestConfig(targetDirectory: string): Promise<string | undefined> {\n  let currentDirectory = targetDirectory;\n  while (true) {\n    const configFile = path.join(currentDirectory, configFileName);\n    if (await fileExists(configFile)) {\n      return configFile;\n    }\n\n    const parentDirectory = path.dirname(currentDirectory);\n    if (parentDirectory === currentDirectory) {\n      return undefined;\n    }\n    currentDirectory = parentDirectory;\n  }\n}\n\nasync function fileExists(file: string): Promise<boolean> {\n  try {\n    const fileStat = await stat(file);\n    return fileStat.isFile();\n  } catch {\n    return false;\n  }\n}\n\nfunction validateConfig(value: unknown, configFile: string): CodeGaugeConfig {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) {\n    throw new Error(`Config file \"${configFile}\" must contain a JSON object.`);\n  }\n\n  const raw = value as Record<string, unknown>;\n  const knownKeys = new Set(['duplication', 'rank', 'gate', 'includeTests', 'failOnError']);\n  for (const key of Object.keys(raw)) {\n    if (!knownKeys.has(key)) {\n      throw new Error(`Config file \"${configFile}\": unknown setting \"${key}\" (expected ${[...knownKeys].join(', ')}).`);\n    }\n  }\n  const config: CodeGaugeConfig = {};\n\n  if (raw.duplication !== undefined) {\n    config.duplication = validateDuplicationObject(raw.duplication, configFile);\n  }\n\n  if (raw.rank !== undefined) {\n    config.rank = validateRankObject(raw.rank, configFile);\n  }\n\n  if (raw.gate !== undefined) {\n    config.gate = validateGateObject(raw.gate, configFile);\n  }\n\n  for (const key of ['includeTests', 'failOnError'] as const) {\n    if (raw[key] !== undefined) {\n      config[key] = requireBoolean(raw[key], key, configFile);\n    }\n  }\n\n  return config;\n}\n\nfunction validateRankObject(value: unknown, configFile: string): { top?: number } {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) {\n    throw new Error(`Config file \"${configFile}\": \"rank\" must be an object.`);\n  }\n  const rank: { top?: number } = {};\n  for (const [key, setting] of Object.entries(value as Record<string, unknown>)) {\n    if (key !== 'top') {\n      throw new Error(`Config file \"${configFile}\": unknown setting \"${key}\" in \"rank\" (expected top).`);\n    }\n    rank.top = requirePositiveInteger(setting, 'rank.top', configFile);\n  }\n  return rank;\n}\n\nfunction validateGateObject(value: unknown, configFile: string): GateConfig {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) {\n    throw new Error(`Config file \"${configFile}\": \"gate\" must be an object.`);\n  }\n  const gate: GateConfig = {};\n  for (const [key, setting] of Object.entries(value as Record<string, unknown>)) {\n    if (key === 'newFunction') {\n      // Zero is a meaningful upper bound (branch-free or unnested new functions), so the limits\n      // are validated as non-negative rather than positive.\n      gate.newFunction = validateGateNumberObject(\n        setting,\n        'gate.newFunction',\n        Object.keys(defaultGateOptions.newFunction),\n        configFile,\n        requireNonNegativeInteger\n      ) as Partial<NewFunctionThresholds>;\n    } else if (key === 'tolerance') {\n      gate.tolerance = validateGateNumberObject(\n        setting,\n        'gate.tolerance',\n        Object.keys(defaultGateOptions.tolerance),\n        configFile,\n        requireNonNegativeNumber\n      ) as Partial<GateTolerances>;\n    } else if (key === 'matchSimilarityPercent') {\n      const parsed = requirePositiveInteger(setting, 'gate.matchSimilarityPercent', configFile);\n      if (parsed > 100) {\n        throw new Error(`Config file \"${configFile}\": \"gate.matchSimilarityPercent\" must be between 1 and 100.`);\n      }\n      gate.matchSimilarityPercent = parsed;\n    } else {\n      throw new Error(\n        `Config file \"${configFile}\": unknown setting \"${key}\" in \"gate\" (expected newFunction, tolerance, or matchSimilarityPercent).`\n      );\n    }\n  }\n  return gate;\n}\n\nfunction validateGateNumberObject(\n  value: unknown,\n  settingName: string,\n  knownKeys: string[],\n  configFile: string,\n  requireNumber: (value: unknown, key: string, configFile: string) => number\n): Record<string, number> {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) {\n    throw new Error(`Config file \"${configFile}\": \"${settingName}\" must be an object.`);\n  }\n  const validated: Record<string, number> = {};\n  for (const [key, setting] of Object.entries(value as Record<string, unknown>)) {\n    if (!knownKeys.includes(key)) {\n      throw new Error(\n        `Config file \"${configFile}\": unknown setting \"${key}\" in \"${settingName}\" (expected ${knownKeys.join(', ')}).`\n      );\n    }\n    validated[key] = requireNumber(setting, `${settingName}.${key}`, configFile);\n  }\n  return validated;\n}\n\nfunction validateDuplicationObject(value: unknown, configFile: string): DuplicationOptions {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) {\n    throw new Error(`Config file \"${configFile}\": \"duplication\" must be an object.`);\n  }\n  const duplication: DuplicationOptions = {};\n  for (const [key, setting] of Object.entries(value as Record<string, unknown>)) {\n    if (key === 'minTokens') {\n      duplication.minTokens = requirePositiveInteger(setting, 'duplication.minTokens', configFile);\n    } else if (key === 'maxGapTokens') {\n      // 0 is meaningful: it disables gapped-clone merging.\n      duplication.maxGapTokens = requireNonNegativeInteger(setting, 'duplication.maxGapTokens', configFile);\n    } else if (key === 'minSimilarityPercent') {\n      const parsed = requirePositiveInteger(setting, 'duplication.minSimilarityPercent', configFile);\n      if (parsed > 100) {\n        throw new Error(`Config file \"${configFile}\": \"duplication.minSimilarityPercent\" must be between 1 and 100.`);\n      }\n      duplication.minSimilarityPercent = parsed;\n    } else {\n      throw new Error(\n        `Config file \"${configFile}\": unknown setting \"${key}\" in \"duplication\" (expected minTokens, maxGapTokens, or minSimilarityPercent).`\n      );\n    }\n  }\n  return duplication;\n}\n\n/** Tolerances may be fractional (e.g. Halstead volume), so only finiteness and sign are checked. */\nfunction requireNonNegativeNumber(value: unknown, key: string, configFile: string): number {\n  return requireNumber(value, key, configFile, Number.isFinite, 'a non-negative number');\n}\n\nfunction requireNonNegativeInteger(value: unknown, key: string, configFile: string): number {\n  return requireNumber(value, key, configFile, Number.isSafeInteger, 'a non-negative integer');\n}\n\nfunction requirePositiveInteger(value: unknown, key: string, configFile: string): number {\n  const parsed = requireNumber(value, key, configFile, Number.isSafeInteger, 'a positive integer');\n  if (parsed < 1) {\n    throw new Error(`Config file \"${configFile}\": \"${key}\" must be a positive integer.`);\n  }\n  return parsed;\n}\n\n/** Shared core of the numeric validators: the right kind of number, and never negative. */\nfunction requireNumber(\n  value: unknown,\n  key: string,\n  configFile: string,\n  isValidKind: (value: unknown) => boolean,\n  description: string\n): number {\n  if (typeof value !== 'number' || !isValidKind(value) || value < 0) {\n    throw new Error(`Config file \"${configFile}\": \"${key}\" must be ${description}.`);\n  }\n  return value;\n}\n\nfunction requireBoolean(value: unknown, key: string, configFile: string): boolean {\n  if (typeof value !== 'boolean') {\n    throw new TypeError(`Config file \"${configFile}\": \"${key}\" must be a boolean.`);\n  }\n  return value;\n}\n\nfunction formatError(error: unknown): string {\n  return error instanceof Error ? error.message : String(error);\n}\n"],"mappings":"4MAWA,MAAa,EAAiB,yBA6C9B,SAAgB,EAAe,EAAiB,EAA0C,CACxF,MAAO,CACL,YAAa,CACX,UAAW,EAAI,sBAAwB,EAAO,aAAa,WAAaA,EAAAA,0BAA0B,UAClG,aACE,EAAI,yBAA2B,EAAO,aAAa,cAAgBA,EAAAA,0BAA0B,aAC/F,qBACE,EAAI,iCACJ,EAAO,aAAa,sBACpBA,EAAAA,0BAA0B,oBAC9B,EACA,IAAK,EAAI,KAAO,EAAO,MAAM,KAAA,GAC7B,aAAc,EAAI,cAAgB,EAAO,cAAgB,GACzD,YAAa,EAAI,aAAe,EAAO,aAAe,GACtD,KAAM,EAAI,MAAQ,EACpB,CACF,CAGA,SAAgB,EAAmB,EAAsC,CACvE,MAAO,CACL,YAAa,CAAE,GAAGC,EAAAA,mBAAmB,YAAa,GAAG,EAAO,MAAM,WAAY,EAC9E,UAAW,CAAE,GAAGA,EAAAA,mBAAmB,UAAW,GAAG,EAAO,MAAM,SAAU,EACxE,uBAAwB,EAAO,MAAM,wBAA0BA,EAAAA,mBAAmB,sBACpF,CACF,CAMA,eAAsB,EAAW,EAAkC,EAAmD,CACpH,IAAM,EAAa,GAAiB,MAAM,EAAkB,CAAe,EAC3E,GAAI,CAAC,EACH,MAAO,CAAC,EAGV,IAAI,EACJ,GAAI,CACF,EAAU,MAAA,EAAMC,EAAAA,SAAAA,CAAS,EAAY,MAAM,CAC7C,OAAS,EAAO,CACd,GAAI,EACF,MAAU,MAAM,4BAA4B,EAAW,KAAK,EAAY,CAAK,GAAG,EAElF,MAAO,CAAC,CACV,CAEA,IAAI,EACJ,GAAI,CACF,EAAS,KAAK,MAAM,CAAO,CAC7B,OAAS,EAAO,CACd,MAAU,MAAM,gCAAgC,EAAW,KAAK,EAAY,CAAK,GAAG,CACtF,CAEA,OAAO,EAAe,EAAQ,CAAU,CAC1C,CAEA,eAAe,EAAkB,EAAsD,CACrF,IAAI,EAAmB,EACvB,OAAa,CACX,IAAM,EAAaC,EAAAA,QAAK,KAAK,EAAkB,CAAc,EAC7D,GAAI,MAAM,EAAW,CAAU,EAC7B,OAAO,EAGT,IAAM,EAAkBA,EAAAA,QAAK,QAAQ,CAAgB,EACrD,GAAI,IAAoB,EACtB,OAEF,EAAmB,CACrB,CACF,CAEA,eAAe,EAAW,EAAgC,CACxD,GAAI,CAEF,OAAO,MAAA,EADgBC,EAAAA,KAAAA,CAAK,CAAI,EAAA,CAChB,OAAO,CACzB,MAAQ,CACN,MAAO,EACT,CACF,CAEA,SAAS,EAAe,EAAgB,EAAqC,CAC3E,GAAI,OAAO,GAAU,WAAY,GAAkB,MAAM,QAAQ,CAAK,EACpE,MAAU,MAAM,gBAAgB,EAAW,8BAA8B,EAG3E,IAAM,EAAM,EACN,EAAY,IAAI,IAAI,CAAC,cAAe,OAAQ,OAAQ,eAAgB,aAAa,CAAC,EACxF,IAAK,IAAM,KAAO,OAAO,KAAK,CAAG,EAC/B,GAAI,CAAC,EAAU,IAAI,CAAG,EACpB,MAAU,MAAM,gBAAgB,EAAW,sBAAsB,EAAI,cAAc,CAAC,GAAG,CAAS,CAAC,CAAC,KAAK,IAAI,EAAE,GAAG,EAGpH,IAAM,EAA0B,CAAC,EAE7B,EAAI,cAAgB,IAAA,KACtB,EAAO,YAAc,EAA0B,EAAI,YAAa,CAAU,GAGxE,EAAI,OAAS,IAAA,KACf,EAAO,KAAO,EAAmB,EAAI,KAAM,CAAU,GAGnD,EAAI,OAAS,IAAA,KACf,EAAO,KAAO,EAAmB,EAAI,KAAM,CAAU,GAGvD,IAAK,IAAM,IAAO,CAAC,eAAgB,aAAa,EAC1C,EAAI,KAAS,IAAA,KACf,EAAO,GAAO,EAAe,EAAI,GAAM,EAAK,CAAU,GAI1D,OAAO,CACT,CAEA,SAAS,EAAmB,EAAgB,EAAsC,CAChF,GAAI,OAAO,GAAU,WAAY,GAAkB,MAAM,QAAQ,CAAK,EACpE,MAAU,MAAM,gBAAgB,EAAW,6BAA6B,EAE1E,IAAM,EAAyB,CAAC,EAChC,IAAK,GAAM,CAAC,EAAK,KAAY,OAAO,QAAQ,CAAgC,EAAG,CAC7E,GAAI,IAAQ,MACV,MAAU,MAAM,gBAAgB,EAAW,sBAAsB,EAAI,4BAA4B,EAEnG,EAAK,IAAM,EAAuB,EAAS,WAAY,CAAU,CACnE,CACA,OAAO,CACT,CAEA,SAAS,EAAmB,EAAgB,EAAgC,CAC1E,GAAI,OAAO,GAAU,WAAY,GAAkB,MAAM,QAAQ,CAAK,EACpE,MAAU,MAAM,gBAAgB,EAAW,6BAA6B,EAE1E,IAAM,EAAmB,CAAC,EAC1B,IAAK,GAAM,CAAC,EAAK,KAAY,OAAO,QAAQ,CAAgC,EAC1E,GAAI,IAAQ,cAGV,EAAK,YAAc,EACjB,EACA,mBACA,OAAO,KAAKH,EAAAA,mBAAmB,WAAW,EAC1C,EACA,CACF,OACK,GAAI,IAAQ,YACjB,EAAK,UAAY,EACf,EACA,iBACA,OAAO,KAAKA,EAAAA,mBAAmB,SAAS,EACxC,EACA,CACF,OACK,GAAI,IAAQ,yBAA0B,CAC3C,IAAM,EAAS,EAAuB,EAAS,8BAA+B,CAAU,EACxF,GAAI,EAAS,IACX,MAAU,MAAM,gBAAgB,EAAW,4DAA4D,EAEzG,EAAK,uBAAyB,CAChC,MACE,MAAU,MACR,gBAAgB,EAAW,sBAAsB,EAAI,0EACvD,EAGJ,OAAO,CACT,CAEA,SAAS,EACP,EACA,EACA,EACA,EACA,EACwB,CACxB,GAAI,OAAO,GAAU,WAAY,GAAkB,MAAM,QAAQ,CAAK,EACpE,MAAU,MAAM,gBAAgB,EAAW,MAAM,EAAY,qBAAqB,EAEpF,IAAM,EAAoC,CAAC,EAC3C,IAAK,GAAM,CAAC,EAAK,KAAY,OAAO,QAAQ,CAAgC,EAAG,CAC7E,GAAI,CAAC,EAAU,SAAS,CAAG,EACzB,MAAU,MACR,gBAAgB,EAAW,sBAAsB,EAAI,QAAQ,EAAY,cAAc,EAAU,KAAK,IAAI,EAAE,GAC9G,EAEF,EAAU,GAAO,EAAc,EAAS,GAAG,EAAY,GAAG,IAAO,CAAU,CAC7E,CACA,OAAO,CACT,CAEA,SAAS,EAA0B,EAAgB,EAAwC,CACzF,GAAI,OAAO,GAAU,WAAY,GAAkB,MAAM,QAAQ,CAAK,EACpE,MAAU,MAAM,gBAAgB,EAAW,oCAAoC,EAEjF,IAAM,EAAkC,CAAC,EACzC,IAAK,GAAM,CAAC,EAAK,KAAY,OAAO,QAAQ,CAAgC,EAC1E,GAAI,IAAQ,YACV,EAAY,UAAY,EAAuB,EAAS,wBAAyB,CAAU,OACtF,GAAI,IAAQ,eAEjB,EAAY,aAAe,EAA0B,EAAS,2BAA4B,CAAU,OAC/F,GAAI,IAAQ,uBAAwB,CACzC,IAAM,EAAS,EAAuB,EAAS,mCAAoC,CAAU,EAC7F,GAAI,EAAS,IACX,MAAU,MAAM,gBAAgB,EAAW,iEAAiE,EAE9G,EAAY,qBAAuB,CACrC,MACE,MAAU,MACR,gBAAgB,EAAW,sBAAsB,EAAI,gFACvD,EAGJ,OAAO,CACT,CAGA,SAAS,EAAyB,EAAgB,EAAa,EAA4B,CACzF,OAAO,EAAc,EAAO,EAAK,EAAY,OAAO,SAAU,uBAAuB,CACvF,CAEA,SAAS,EAA0B,EAAgB,EAAa,EAA4B,CAC1F,OAAO,EAAc,EAAO,EAAK,EAAY,OAAO,cAAe,wBAAwB,CAC7F,CAEA,SAAS,EAAuB,EAAgB,EAAa,EAA4B,CACvF,IAAM,EAAS,EAAc,EAAO,EAAK,EAAY,OAAO,cAAe,oBAAoB,EAC/F,GAAI,EAAS,EACX,MAAU,MAAM,gBAAgB,EAAW,MAAM,EAAI,8BAA8B,EAErF,OAAO,CACT,CAGA,SAAS,EACP,EACA,EACA,EACA,EACA,EACQ,CACR,GAAI,OAAO,GAAU,UAAY,CAAC,EAAY,CAAK,GAAK,EAAQ,EAC9D,MAAU,MAAM,gBAAgB,EAAW,MAAM,EAAI,YAAY,EAAY,EAAE,EAEjF,OAAO,CACT,CAEA,SAAS,EAAe,EAAgB,EAAa,EAA6B,CAChF,GAAI,OAAO,GAAU,UACnB,MAAU,UAAU,gBAAgB,EAAW,MAAM,EAAI,qBAAqB,EAEhF,OAAO,CACT,CAEA,SAAS,EAAY,EAAwB,CAC3C,OAAO,aAAiB,MAAQ,EAAM,QAAU,OAAO,CAAK,CAC9D"}