Public report of kucherenko/jscpd, published 27 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 27 October 2026, 19:08 UTC · Survey ID cd_56bbea092c8e4d52a795dcd27e80c333
kucherenko/jscpd
Measured 27 October 2026, 19:06 UTC, at code version 3b636df
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
Code coverage is not measured: JavaScript/TypeScript suite (CouldNotMeasureNoCollector).
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
Down 2 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A medium codebase: 89,912 lines of product code in 12 projects, tests not counted · Estimated rebuild effort: about 0.7 person-years · Weakest lens: Code Health, 51
Findings by how serious they are
29 critical301 serious30 minor
7 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
27 October 2026, 19:06 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
88of 88 dimensions measured by tools.
344of 360 findings point to an exact file and line, so you can open each one in the code. The other 16 concern the repository as a whole, such as missing documentation.
88dimensions across 8 lenses, read from 89,912 lines of product code in 12 projects.
kucherenko/jscpd falls short of our standard for production, held back most by its Code Health lens, the quality of the code itself. It scores 56 out of 100 and is rated Adequate, and 28 of its 29 critical findings are security problems.
Code Health, at 51, is the weakest lens by a small margin, and the weakest lens counts most in the score. The best first step is adding type checking, worth about 3 points. Recording design decisions comes next, worth about 1 point.
Eleven weaknesses in the code could be used by an attacker. Five pipeline steps put outside input straight into a shell command, so an attacker can run commands in the build pipeline. Fixing the weaknesses the scanner points to and passing outside input through environment variables would close both risks. The three passwords or keys in the code's history need replacing, with the old ones switched off. The two pipeline steps that install packages without pinning their versions need the packages they install pinned to exact versions. The image with no text description needs a text description.
The product code is 89,912 lines, about €110,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Test Coverage · This test file cannot be loaded fixtures/dead-code-demo/bundler/vite.config.js
Test Coverage · This test file cannot be loaded fixtures/dead-code-demo/frameworks/custom/kit/boot.js
Test Coverage · This test file cannot be loaded fixtures/jsx/file1.jsx
Test Coverage · This test file cannot be loaded fixtures/jsx/file1.tsx
Test Coverage · This test file cannot be loaded fixtures/jsx/file2.jsx
Test Coverage · This test file cannot be loaded fixtures/jsx/file2.tsx
Test Coverage · This test file cannot be loaded fixtures/sfc-demo/template-range/TicketCard.vue
Test Coverage · This test file cannot be loaded fixtures/vue/file1.vue
Test Coverage · This test file cannot be loaded fixtures/vue/file2.vue
Test Coverage · No test reaches this file rust/scripts/sync-version.mjs
Test Coverage · No test reaches this file rust/scripts/npm-prebuilt-package.mjs
Test Coverage · No test reaches this file rust/scripts/gen-formats-md.mjs
Test Coverage · No test reaches this file rust/basta/platform-map.js
Test Coverage · No test reaches this file rust/platform-map.js
Test Coverage · No test reaches this file rust/basta/run-basta.js
Test Coverage · No test reaches this file rust/run-cpd.js
Visual & motion safety · Focus outline removed in CSS without a :focus replacement rust/crates/cpd-reporter/templates/report.html
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 11 findings
These 11 critical or serious findings were in the previous survey, on 13 October 2026, and are gone from this one.
€35,000 to €180,000, for 591 to 1,876 hours of work, about 0.7 person-years for 1 to 2 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.8 at a score of 56. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Medium: 89,912 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
Raises the score by about 3 points · Medium effort · Type Safety
2
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 1 point · Low effort · ADR Quality
3
Codify backups + geo-recovery in IaC and document RTO/RPO and the restore procedure — a persistence guard alone is not disaster recovery.
Raises the score by about 3 points · Medium effort · DR & Backup
Diagnosis: what the measurements show together
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €110,000 to build again, about 0.7 person-years of work. Its weakest lens is Code Health, at 51 (Adequate). Code Health is about how easy the code is to read and change safely, and code that is hard to read is slow and risky to change, so every future change costs more than it should. Because the weakest lens counts most in the score, work on Code Health also moves the score most.
Based on: the rebuild estimate · the Code Health grade · how much each lens counts
What to do: Start with the Code Health actions in Top priorities.
If you do one thing first · First action
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up. Of all the actions in this report, it raises the score most for the work it takes: about 3 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
134 modules, with 381 dependencies between them. One loop runs through 30 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 94 more are left out to keep it readable.
Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
1 pair of types, where a type in basta.section uses a type in basta.framework.
The types involved
basta.section.Section → basta.framework.Framework
Direction
basta.section uses basta.framework, so a change to basta.framework can break basta.section, while a change to basta.section can't break basta.framework.
Position
Below the diagonal: basta.section uses a module listed above it, which is the healthy direction.
3→22 basta.section uses cpd_similarity.printspart of a loop✕
Connections
1 pair of types, where a type in basta.section uses a type in cpd_similarity.prints.
basta.section uses cpd_similarity.prints, so a change to cpd_similarity.prints can break basta.section, while a change to basta.section can't break cpd_similarity.prints.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
4→24 cpd_core.models uses jscpd.boundaries.rulespart of a loop✕
Connections
3 pairs of types, where a type in cpd_core.models uses a type in jscpd.boundaries.rules.
cpd_core.models uses jscpd.boundaries.rules, so a change to jscpd.boundaries.rules can break cpd_core.models, while a change to cpd_core.models can't break jscpd.boundaries.rules.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
cpd_core.detect uses cpd_core.models, so a change to cpd_core.models can break cpd_core.detect, while a change to cpd_core.detect can't break cpd_core.models.
Position
Below the diagonal: cpd_core.detect uses a module listed above it, which is the healthy direction.
cpd_core.summary uses cpd_core.models, so a change to cpd_core.models can break cpd_core.summary, while a change to cpd_core.summary can't break cpd_core.models.
Position
Below the diagonal: cpd_core.summary uses a module listed above it, which is the healthy direction.
cpd_core.health uses cpd_core.summary, so a change to cpd_core.summary can break cpd_core.health, while a change to cpd_core.health can't break cpd_core.summary.
Position
Below the diagonal: cpd_core.health uses a module listed above it, which is the healthy direction.
cpd_semantic.search uses cpd_core.models, so a change to cpd_core.models can break cpd_semantic.search, while a change to cpd_semantic.search can't break cpd_core.models.
Position
Below the diagonal: cpd_semantic.search uses a module listed above it, which is the healthy direction.
cpd_semantic.search uses cpd_core.detect, so a change to cpd_core.detect can break cpd_semantic.search, while a change to cpd_semantic.search can't break cpd_core.detect.
Position
Below the diagonal: cpd_semantic.search uses a module listed above it, which is the healthy direction.
9→24 cpd_semantic.search uses jscpd.boundaries.rulespart of a loop✕
Connections
3 pairs of types, where a type in cpd_semantic.search uses a type in jscpd.boundaries.rules.
cpd_semantic.search uses jscpd.boundaries.rules, so a change to jscpd.boundaries.rules can break cpd_semantic.search, while a change to cpd_semantic.search can't break jscpd.boundaries.rules.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
cpd_similarity uses jscpd.lsp.position, so a change to jscpd.lsp.position can break cpd_similarity, while a change to cpd_similarity can't break jscpd.lsp.position.
Position
Below the diagonal: cpd_similarity uses a module listed above it, which is the healthy direction.
cpd_similarity uses cpd_core.models, so a change to cpd_core.models can break cpd_similarity, while a change to cpd_similarity can't break cpd_core.models.
Position
Below the diagonal: cpd_similarity uses a module listed above it, which is the healthy direction.
cpd_similarity uses cpd_core.detect, so a change to cpd_core.detect can break cpd_similarity, while a change to cpd_similarity can't break cpd_core.detect.
Position
Below the diagonal: cpd_similarity uses a module listed above it, which is the healthy direction.
10→20 cpd_similarity uses jscpd.boundaries.checkpart of a loop✕
Connections
1 pair of types, where a type in cpd_similarity uses a type in jscpd.boundaries.check.
cpd_similarity uses jscpd.boundaries.check, so a change to jscpd.boundaries.check can break cpd_similarity, while a change to cpd_similarity can't break jscpd.boundaries.check.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
10→24 cpd_similarity uses jscpd.boundaries.rulespart of a loop✕
Connections
2 pairs of types, where a type in cpd_similarity uses a type in jscpd.boundaries.rules.
cpd_similarity uses jscpd.boundaries.rules, so a change to jscpd.boundaries.rules can break cpd_similarity, while a change to cpd_similarity can't break jscpd.boundaries.rules.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
cpd_core.history uses cpd_core.health, so a change to cpd_core.health can break cpd_core.history, while a change to cpd_core.history can't break cpd_core.health.
Position
Below the diagonal: cpd_core.history uses a module listed above it, which is the healthy direction.
cpd_semantic.embed uses cpd_semantic.search, so a change to cpd_semantic.search can break cpd_semantic.embed, while a change to cpd_semantic.embed can't break cpd_semantic.search.
Position
Below the diagonal: cpd_semantic.embed uses a module listed above it, which is the healthy direction.
12→22 cpd_semantic.embed uses cpd_similarity.printspart of a loop✕
Connections
2 pairs of types, where a type in cpd_semantic.embed uses a type in cpd_similarity.prints.
cpd_semantic.embed uses cpd_similarity.prints, so a change to cpd_similarity.prints can break cpd_semantic.embed, while a change to cpd_semantic.embed can't break cpd_similarity.prints.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
12→24 cpd_semantic.embed uses jscpd.boundaries.rulespart of a loop✕
Connections
1 pair of types, where a type in cpd_semantic.embed uses a type in jscpd.boundaries.rules.
cpd_semantic.embed uses jscpd.boundaries.rules, so a change to jscpd.boundaries.rules can break cpd_semantic.embed, while a change to cpd_semantic.embed can't break jscpd.boundaries.rules.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
cpd_reporter.context uses cpd_core.models, so a change to cpd_core.models can break cpd_reporter.context, while a change to cpd_reporter.context can't break cpd_core.models.
Position
Below the diagonal: cpd_reporter.context uses a module listed above it, which is the healthy direction.
cpd_reporter.context uses cpd_core.summary, so a change to cpd_core.summary can break cpd_reporter.context, while a change to cpd_reporter.context can't break cpd_core.summary.
Position
Below the diagonal: cpd_reporter.context uses a module listed above it, which is the healthy direction.
cpd_reporter.context uses cpd_core.history, so a change to cpd_core.history can break cpd_reporter.context, while a change to cpd_reporter.context can't break cpd_core.history.
Position
Below the diagonal: cpd_reporter.context uses a module listed above it, which is the healthy direction.
jscpd.cli uses cpd_semantic.search, so a change to cpd_semantic.search can break jscpd.cli, while a change to jscpd.cli can't break cpd_semantic.search.
Position
Below the diagonal: jscpd.cli uses a module listed above it, which is the healthy direction.
jscpd.cli uses cpd_similarity.prints, so a change to cpd_similarity.prints can break jscpd.cli, while a change to jscpd.cli can't break cpd_similarity.prints.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
cpd_reporter.reporter uses cpd_reporter.context, so a change to cpd_reporter.context can break cpd_reporter.reporter, while a change to cpd_reporter.reporter can't break cpd_reporter.context.
Position
Below the diagonal: cpd_reporter.reporter uses a module listed above it, which is the healthy direction.
cpd_reporter.shared uses cpd_core.models, so a change to cpd_core.models can break cpd_reporter.shared, while a change to cpd_reporter.shared can't break cpd_core.models.
Position
Below the diagonal: cpd_reporter.shared uses a module listed above it, which is the healthy direction.
cpd_reporter.shared uses cpd_reporter.context, so a change to cpd_reporter.context can break cpd_reporter.shared, while a change to cpd_reporter.shared can't break cpd_reporter.context.
Position
Below the diagonal: cpd_reporter.shared uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in jscpd.options uses a type in basta.framework.
The types involved
jscpd.options.Options → basta.framework.Setting
Direction
jscpd.options uses basta.framework, so a change to basta.framework can break jscpd.options, while a change to jscpd.options can't break basta.framework.
Position
Below the diagonal: jscpd.options uses a module listed above it, which is the healthy direction.
jscpd.options uses cpd_core.summary, so a change to cpd_core.summary can break jscpd.options, while a change to jscpd.options can't break cpd_core.summary.
Position
Below the diagonal: jscpd.options uses a module listed above it, which is the healthy direction.
jscpd.options uses cpd_core.health, so a change to cpd_core.health can break jscpd.options, while a change to jscpd.options can't break cpd_core.health.
Position
Below the diagonal: jscpd.options uses a module listed above it, which is the healthy direction.
jscpd.options uses cpd_semantic.embed, so a change to cpd_semantic.embed can break jscpd.options, while a change to jscpd.options can't break cpd_semantic.embed.
Position
Below the diagonal: jscpd.options uses a module listed above it, which is the healthy direction.
jscpd.options uses jscpd.cli, so a change to jscpd.cli can break jscpd.options, while a change to jscpd.options can't break jscpd.cli.
Position
Below the diagonal: jscpd.options uses a module listed above it, which is the healthy direction.
17→18 jscpd.options uses jscpd.dashboardpart of a loop✕
Connections
1 pair of types, where a type in jscpd.options uses a type in jscpd.dashboard.
The types involved
jscpd.options.Options → jscpd.dashboard.Mode
Direction
jscpd.options uses jscpd.dashboard, so a change to jscpd.dashboard can break jscpd.options, while a change to jscpd.options can't break jscpd.dashboard.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
jscpd.dashboard uses cpd_core.summary, so a change to cpd_core.summary can break jscpd.dashboard, while a change to jscpd.dashboard can't break cpd_core.summary.
Position
Below the diagonal: jscpd.dashboard uses a module listed above it, which is the healthy direction.
jscpd.dashboard uses jscpd.options, so a change to jscpd.options can break jscpd.dashboard, while a change to jscpd.dashboard can't break jscpd.options.
Position
Below the diagonal: jscpd.dashboard uses a module listed above it, which is the healthy direction.
18→19 jscpd.dashboard uses cpd_finder.orchestratepart of a loop✕
Connections
1 pair of types, where a type in jscpd.dashboard uses a type in cpd_finder.orchestrate.
jscpd.dashboard uses cpd_finder.orchestrate, so a change to cpd_finder.orchestrate can break jscpd.dashboard, while a change to jscpd.dashboard can't break cpd_finder.orchestrate.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
18→29 jscpd.dashboard uses basta.configpart of a loop✕
Connections
1 pair of types, where a type in jscpd.dashboard uses a type in basta.config.
cpd_finder.orchestrate uses cpd_core.models, so a change to cpd_core.models can break cpd_finder.orchestrate, while a change to cpd_finder.orchestrate can't break cpd_core.models.
Position
Below the diagonal: cpd_finder.orchestrate uses a module listed above it, which is the healthy direction.
cpd_finder.orchestrate uses cpd_core.detect, so a change to cpd_core.detect can break cpd_finder.orchestrate, while a change to cpd_finder.orchestrate can't break cpd_core.detect.
Position
Below the diagonal: cpd_finder.orchestrate uses a module listed above it, which is the healthy direction.
cpd_finder.orchestrate uses cpd_similarity, so a change to cpd_similarity can break cpd_finder.orchestrate, while a change to cpd_finder.orchestrate can't break cpd_similarity.
Position
Below the diagonal: cpd_finder.orchestrate uses a module listed above it, which is the healthy direction.
cpd_finder.orchestrate uses jscpd.dashboard, so a change to jscpd.dashboard can break cpd_finder.orchestrate, while a change to cpd_finder.orchestrate can't break jscpd.dashboard.
Position
Below the diagonal: cpd_finder.orchestrate uses a module listed above it, which is the healthy direction.
19→20 cpd_finder.orchestrate uses jscpd.boundaries.checkpart of a loop✕
Connections
1 pair of types, where a type in cpd_finder.orchestrate uses a type in jscpd.boundaries.check.
cpd_finder.orchestrate uses jscpd.boundaries.check, so a change to jscpd.boundaries.check can break cpd_finder.orchestrate, while a change to cpd_finder.orchestrate can't break jscpd.boundaries.check.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
jscpd.boundaries.check uses basta.framework, so a change to basta.framework can break jscpd.boundaries.check, while a change to jscpd.boundaries.check can't break basta.framework.
Position
Below the diagonal: jscpd.boundaries.check uses a module listed above it, which is the healthy direction.
jscpd.boundaries.check uses cpd_core.models, so a change to cpd_core.models can break jscpd.boundaries.check, while a change to jscpd.boundaries.check can't break cpd_core.models.
Position
Below the diagonal: jscpd.boundaries.check uses a module listed above it, which is the healthy direction.
jscpd.boundaries.check uses cpd_core.detect, so a change to cpd_core.detect can break jscpd.boundaries.check, while a change to jscpd.boundaries.check can't break cpd_core.detect.
Position
Below the diagonal: jscpd.boundaries.check uses a module listed above it, which is the healthy direction.
jscpd.boundaries.check uses cpd_semantic.search, so a change to cpd_semantic.search can break jscpd.boundaries.check, while a change to jscpd.boundaries.check can't break cpd_semantic.search.
Position
Below the diagonal: jscpd.boundaries.check uses a module listed above it, which is the healthy direction.
jscpd.boundaries.check uses cpd_similarity, so a change to cpd_similarity can break jscpd.boundaries.check, while a change to jscpd.boundaries.check can't break cpd_similarity.
Position
Below the diagonal: jscpd.boundaries.check uses a module listed above it, which is the healthy direction.
jscpd.boundaries.check uses cpd_semantic.embed, so a change to cpd_semantic.embed can break jscpd.boundaries.check, while a change to jscpd.boundaries.check can't break cpd_semantic.embed.
Position
Below the diagonal: jscpd.boundaries.check uses a module listed above it, which is the healthy direction.
jscpd.boundaries.check uses jscpd.options, so a change to jscpd.options can break jscpd.boundaries.check, while a change to jscpd.boundaries.check can't break jscpd.options.
Position
Below the diagonal: jscpd.boundaries.check uses a module listed above it, which is the healthy direction.
jscpd.boundaries.check uses cpd_finder.orchestrate, so a change to cpd_finder.orchestrate can break jscpd.boundaries.check, while a change to jscpd.boundaries.check can't break cpd_finder.orchestrate.
Position
Below the diagonal: jscpd.boundaries.check uses a module listed above it, which is the healthy direction.
20→24 jscpd.boundaries.check uses jscpd.boundaries.rulespart of a loop✕
Connections
5 pairs of types, where a type in jscpd.boundaries.check uses a type in jscpd.boundaries.rules.
jscpd.boundaries.check uses jscpd.boundaries.rules, so a change to jscpd.boundaries.rules can break jscpd.boundaries.check, while a change to jscpd.boundaries.check can't break jscpd.boundaries.rules.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
jscpd.compare uses cpd_semantic.search, so a change to cpd_semantic.search can break jscpd.compare, while a change to jscpd.compare can't break cpd_semantic.search.
Position
Below the diagonal: jscpd.compare uses a module listed above it, which is the healthy direction.
jscpd.compare uses cpd_semantic.embed, so a change to cpd_semantic.embed can break jscpd.compare, while a change to jscpd.compare can't break cpd_semantic.embed.
Position
Below the diagonal: jscpd.compare uses a module listed above it, which is the healthy direction.
jscpd.compare uses cpd_reporter.shared, so a change to cpd_reporter.shared can break jscpd.compare, while a change to jscpd.compare can't break cpd_reporter.shared.
Position
Below the diagonal: jscpd.compare uses a module listed above it, which is the healthy direction.
jscpd.compare uses cpd_finder.orchestrate, so a change to cpd_finder.orchestrate can break jscpd.compare, while a change to jscpd.compare can't break cpd_finder.orchestrate.
Position
Below the diagonal: jscpd.compare uses a module listed above it, which is the healthy direction.
cpd_similarity.prints uses jscpd.boundaries.check, so a change to jscpd.boundaries.check can break cpd_similarity.prints, while a change to cpd_similarity.prints can't break jscpd.boundaries.check.
Position
Below the diagonal: cpd_similarity.prints uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in basta.rustc uses a type in cpd_similarity.prints.
The types involved
basta.rustc.Span → cpd_similarity.prints.Value
Direction
basta.rustc uses cpd_similarity.prints, so a change to cpd_similarity.prints can break basta.rustc, while a change to basta.rustc can't break cpd_similarity.prints.
Position
Below the diagonal: basta.rustc uses a module listed above it, which is the healthy direction.
23→26 basta.rustc uses jscpd.lsp.findingspart of a loop✕
Connections
1 pair of types, where a type in basta.rustc uses a type in jscpd.lsp.findings.
basta.rustc uses jscpd.lsp.findings, so a change to jscpd.lsp.findings can break basta.rustc, while a change to basta.rustc can't break jscpd.lsp.findings.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
23→28 basta.rustc uses cpd_core.deadcodepart of a loop✕
Connections
2 pairs of types, where a type in basta.rustc uses a type in cpd_core.deadcode.
basta.rustc uses cpd_core.deadcode, so a change to cpd_core.deadcode can break basta.rustc, while a change to basta.rustc can't break cpd_core.deadcode.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
jscpd.boundaries.rules uses cpd_core.models, so a change to cpd_core.models can break jscpd.boundaries.rules, while a change to jscpd.boundaries.rules can't break cpd_core.models.
Position
Below the diagonal: jscpd.boundaries.rules uses a module listed above it, which is the healthy direction.
jscpd.boundaries.rules uses cpd_similarity.prints, so a change to cpd_similarity.prints can break jscpd.boundaries.rules, while a change to jscpd.boundaries.rules can't break cpd_similarity.prints.
Position
Below the diagonal: jscpd.boundaries.rules uses a module listed above it, which is the healthy direction.
cpd_tokenizer.tokenizer uses cpd_core.models, so a change to cpd_core.models can break cpd_tokenizer.tokenizer, while a change to cpd_tokenizer.tokenizer can't break cpd_core.models.
Position
Below the diagonal: cpd_tokenizer.tokenizer uses a module listed above it, which is the healthy direction.
cpd_tokenizer.tokenizer uses jscpd.dashboard, so a change to jscpd.dashboard can break cpd_tokenizer.tokenizer, while a change to cpd_tokenizer.tokenizer can't break jscpd.dashboard.
Position
Below the diagonal: cpd_tokenizer.tokenizer uses a module listed above it, which is the healthy direction.
cpd_tokenizer.tokenizer uses jscpd.boundaries.rules, so a change to jscpd.boundaries.rules can break cpd_tokenizer.tokenizer, while a change to cpd_tokenizer.tokenizer can't break jscpd.boundaries.rules.
Position
Below the diagonal: cpd_tokenizer.tokenizer uses a module listed above it, which is the healthy direction.
jscpd.lsp.findings uses jscpd.lsp.position, so a change to jscpd.lsp.position can break jscpd.lsp.findings, while a change to jscpd.lsp.findings can't break jscpd.lsp.position.
Position
Below the diagonal: jscpd.lsp.findings uses a module listed above it, which is the healthy direction.
jscpd.lsp.findings uses cpd_core.models, so a change to cpd_core.models can break jscpd.lsp.findings, while a change to jscpd.lsp.findings can't break cpd_core.models.
Position
Below the diagonal: jscpd.lsp.findings uses a module listed above it, which is the healthy direction.
jscpd.lsp.findings uses basta.rustc, so a change to basta.rustc can break jscpd.lsp.findings, while a change to jscpd.lsp.findings can't break basta.rustc.
Position
Below the diagonal: jscpd.lsp.findings uses a module listed above it, which is the healthy direction.
jscpd.mcp.project uses cpd_core.models, so a change to cpd_core.models can break jscpd.mcp.project, while a change to jscpd.mcp.project can't break cpd_core.models.
Position
Below the diagonal: jscpd.mcp.project uses a module listed above it, which is the healthy direction.
jscpd.mcp.project uses cpd_core.detect, so a change to cpd_core.detect can break jscpd.mcp.project, while a change to jscpd.mcp.project can't break cpd_core.detect.
Position
Below the diagonal: jscpd.mcp.project uses a module listed above it, which is the healthy direction.
jscpd.mcp.project uses cpd_semantic.search, so a change to cpd_semantic.search can break jscpd.mcp.project, while a change to jscpd.mcp.project can't break cpd_semantic.search.
Position
Below the diagonal: jscpd.mcp.project uses a module listed above it, which is the healthy direction.
jscpd.mcp.project uses cpd_similarity, so a change to cpd_similarity can break jscpd.mcp.project, while a change to jscpd.mcp.project can't break cpd_similarity.
Position
Below the diagonal: jscpd.mcp.project uses a module listed above it, which is the healthy direction.
jscpd.mcp.project uses cpd_semantic.embed, so a change to cpd_semantic.embed can break jscpd.mcp.project, while a change to jscpd.mcp.project can't break cpd_semantic.embed.
Position
Below the diagonal: jscpd.mcp.project uses a module listed above it, which is the healthy direction.
jscpd.mcp.project uses jscpd.options, so a change to jscpd.options can break jscpd.mcp.project, while a change to jscpd.mcp.project can't break jscpd.options.
Position
Below the diagonal: jscpd.mcp.project uses a module listed above it, which is the healthy direction.
jscpd.mcp.project uses cpd_finder.orchestrate, so a change to cpd_finder.orchestrate can break jscpd.mcp.project, while a change to jscpd.mcp.project can't break cpd_finder.orchestrate.
Position
Below the diagonal: jscpd.mcp.project uses a module listed above it, which is the healthy direction.
jscpd.mcp.project uses jscpd.boundaries.check, so a change to jscpd.boundaries.check can break jscpd.mcp.project, while a change to jscpd.mcp.project can't break jscpd.boundaries.check.
Position
Below the diagonal: jscpd.mcp.project uses a module listed above it, which is the healthy direction.
jscpd.mcp.project uses jscpd.compare, so a change to jscpd.compare can break jscpd.mcp.project, while a change to jscpd.mcp.project can't break jscpd.compare.
Position
Below the diagonal: jscpd.mcp.project uses a module listed above it, which is the healthy direction.
jscpd.mcp.project uses jscpd.boundaries.rules, so a change to jscpd.boundaries.rules can break jscpd.mcp.project, while a change to jscpd.mcp.project can't break jscpd.boundaries.rules.
Position
Below the diagonal: jscpd.mcp.project uses a module listed above it, which is the healthy direction.
cpd_core.deadcode uses jscpd.boundaries.rules, so a change to jscpd.boundaries.rules can break cpd_core.deadcode, while a change to cpd_core.deadcode can't break jscpd.boundaries.rules.
Position
Below the diagonal: cpd_core.deadcode uses a module listed above it, which is the healthy direction.
cpd_core.deadcode uses jscpd.lsp.findings, so a change to jscpd.lsp.findings can break cpd_core.deadcode, while a change to cpd_core.deadcode can't break jscpd.lsp.findings.
Position
Below the diagonal: cpd_core.deadcode uses a module listed above it, which is the healthy direction.
basta.config uses cpd_core.deadcode, so a change to cpd_core.deadcode can break basta.config, while a change to basta.config can't break cpd_core.deadcode.
Position
Below the diagonal: basta.config uses a module listed above it, which is the healthy direction.
basta.model uses jscpd.boundaries.rules, so a change to jscpd.boundaries.rules can break basta.model, while a change to basta.model can't break jscpd.boundaries.rules.
Position
Below the diagonal: basta.model uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in basta.model uses a type in cpd_core.deadcode.
The types involved
basta.model.Symbol → cpd_core.deadcode.SymbolKind
Direction
basta.model uses cpd_core.deadcode, so a change to cpd_core.deadcode can break basta.model, while a change to basta.model can't break cpd_core.deadcode.
Position
Below the diagonal: basta.model uses a module listed above it, which is the healthy direction.
cpd_reporter.deadcode uses cpd_reporter.reporter, so a change to cpd_reporter.reporter can break cpd_reporter.deadcode, while a change to cpd_reporter.deadcode can't break cpd_reporter.reporter.
Position
Below the diagonal: cpd_reporter.deadcode uses a module listed above it, which is the healthy direction.
cpd_reporter.deadcode uses jscpd.lsp.findings, so a change to jscpd.lsp.findings can break cpd_reporter.deadcode, while a change to cpd_reporter.deadcode can't break jscpd.lsp.findings.
Position
Below the diagonal: cpd_reporter.deadcode uses a module listed above it, which is the healthy direction.
cpd_reporter.deadcode uses cpd_core.deadcode, so a change to cpd_core.deadcode can break cpd_reporter.deadcode, while a change to cpd_reporter.deadcode can't break cpd_core.deadcode.
Position
Below the diagonal: cpd_reporter.deadcode uses a module listed above it, which is the healthy direction.
basta.analyze uses basta.framework, so a change to basta.framework can break basta.analyze, while a change to basta.analyze can't break basta.framework.
Position
Below the diagonal: basta.analyze uses a module listed above it, which is the healthy direction.
basta.analyze uses cpd_core.deadcode, so a change to cpd_core.deadcode can break basta.analyze, while a change to basta.analyze can't break cpd_core.deadcode.
Position
Below the diagonal: basta.analyze uses a module listed above it, which is the healthy direction.
basta.classify uses jscpd.lsp.findings, so a change to jscpd.lsp.findings can break basta.classify, while a change to basta.classify can't break jscpd.lsp.findings.
Position
Below the diagonal: basta.classify uses a module listed above it, which is the healthy direction.
basta.classify uses cpd_core.deadcode, so a change to cpd_core.deadcode can break basta.classify, while a change to basta.classify can't break cpd_core.deadcode.
Position
Below the diagonal: basta.classify uses a module listed above it, which is the healthy direction.
jscpd.history uses cpd_core.models, so a change to cpd_core.models can break jscpd.history, while a change to jscpd.history can't break cpd_core.models.
Position
Below the diagonal: jscpd.history uses a module listed above it, which is the healthy direction.
jscpd.history uses cpd_core.summary, so a change to cpd_core.summary can break jscpd.history, while a change to jscpd.history can't break cpd_core.summary.
Position
Below the diagonal: jscpd.history uses a module listed above it, which is the healthy direction.
jscpd.history uses cpd_core.health, so a change to cpd_core.health can break jscpd.history, while a change to jscpd.history can't break cpd_core.health.
Position
Below the diagonal: jscpd.history uses a module listed above it, which is the healthy direction.
jscpd.history uses cpd_core.history, so a change to cpd_core.history can break jscpd.history, while a change to jscpd.history can't break cpd_core.history.
Position
Below the diagonal: jscpd.history uses a module listed above it, which is the healthy direction.
jscpd.history uses cpd_finder.orchestrate, so a change to cpd_finder.orchestrate can break jscpd.history, while a change to jscpd.history can't break cpd_finder.orchestrate.
Position
Below the diagonal: jscpd.history uses a module listed above it, which is the healthy direction.
jscpd.lsp.project uses cpd_core.models, so a change to cpd_core.models can break jscpd.lsp.project, while a change to jscpd.lsp.project can't break cpd_core.models.
Position
Below the diagonal: jscpd.lsp.project uses a module listed above it, which is the healthy direction.
jscpd.lsp.project uses cpd_semantic.embed, so a change to cpd_semantic.embed can break jscpd.lsp.project, while a change to jscpd.lsp.project can't break cpd_semantic.embed.
Position
Below the diagonal: jscpd.lsp.project uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in jscpd.lsp.project uses a type in jscpd.options.
The types involved
jscpd.lsp.project.Project → jscpd.options.Options
Direction
jscpd.lsp.project uses jscpd.options, so a change to jscpd.options can break jscpd.lsp.project, while a change to jscpd.lsp.project can't break jscpd.options.
Position
Below the diagonal: jscpd.lsp.project uses a module listed above it, which is the healthy direction.
jscpd.lsp.project uses cpd_finder.orchestrate, so a change to cpd_finder.orchestrate can break jscpd.lsp.project, while a change to jscpd.lsp.project can't break cpd_finder.orchestrate.
Position
Below the diagonal: jscpd.lsp.project uses a module listed above it, which is the healthy direction.
jscpd.lsp.project uses cpd_similarity.prints, so a change to cpd_similarity.prints can break jscpd.lsp.project, while a change to jscpd.lsp.project can't break cpd_similarity.prints.
Position
Below the diagonal: jscpd.lsp.project uses a module listed above it, which is the healthy direction.
jscpd.lsp.project uses basta.config, so a change to basta.config can break jscpd.lsp.project, while a change to jscpd.lsp.project can't break basta.config.
Position
Below the diagonal: jscpd.lsp.project uses a module listed above it, which is the healthy direction.
basta.lang.javascript uses basta.framework, so a change to basta.framework can break basta.lang.javascript, while a change to basta.lang.javascript can't break basta.framework.
Position
Below the diagonal: basta.lang.javascript uses a module listed above it, which is the healthy direction.
basta.lang.javascript uses jscpd.lsp.position, so a change to jscpd.lsp.position can break basta.lang.javascript, while a change to basta.lang.javascript can't break jscpd.lsp.position.
Position
Below the diagonal: basta.lang.javascript uses a module listed above it, which is the healthy direction.
basta.lang.javascript uses cpd_similarity.prints, so a change to cpd_similarity.prints can break basta.lang.javascript, while a change to basta.lang.javascript can't break cpd_similarity.prints.
Position
Below the diagonal: basta.lang.javascript uses a module listed above it, which is the healthy direction.
basta.lang.javascript uses basta.rustc, so a change to basta.rustc can break basta.lang.javascript, while a change to basta.lang.javascript can't break basta.rustc.
Position
Below the diagonal: basta.lang.javascript uses a module listed above it, which is the healthy direction.
basta.lang.javascript uses jscpd.boundaries.rules, so a change to jscpd.boundaries.rules can break basta.lang.javascript, while a change to basta.lang.javascript can't break jscpd.boundaries.rules.
Position
Below the diagonal: basta.lang.javascript uses a module listed above it, which is the healthy direction.
basta.lang.javascript uses cpd_core.deadcode, so a change to cpd_core.deadcode can break basta.lang.javascript, while a change to basta.lang.javascript can't break cpd_core.deadcode.
Position
Below the diagonal: basta.lang.javascript uses a module listed above it, which is the healthy direction.
basta.lang.javascript uses basta.model, so a change to basta.model can break basta.lang.javascript, while a change to basta.lang.javascript can't break basta.model.
Position
Below the diagonal: basta.lang.javascript uses a module listed above it, which is the healthy direction.
basta.lang.javascript uses basta.resolve, so a change to basta.resolve can break basta.lang.javascript, while a change to basta.lang.javascript can't break basta.resolve.
Position
Below the diagonal: basta.lang.javascript uses a module listed above it, which is the healthy direction.
basta.lang.python uses jscpd.lsp.position, so a change to jscpd.lsp.position can break basta.lang.python, while a change to basta.lang.python can't break jscpd.lsp.position.
Position
Below the diagonal: basta.lang.python uses a module listed above it, which is the healthy direction.
basta.lang.python uses jscpd.boundaries.rules, so a change to jscpd.boundaries.rules can break basta.lang.python, while a change to basta.lang.python can't break jscpd.boundaries.rules.
Position
Below the diagonal: basta.lang.python uses a module listed above it, which is the healthy direction.
basta.lang.python uses cpd_core.deadcode, so a change to cpd_core.deadcode can break basta.lang.python, while a change to basta.lang.python can't break cpd_core.deadcode.
Position
Below the diagonal: basta.lang.python uses a module listed above it, which is the healthy direction.
basta.lang.python uses basta.model, so a change to basta.model can break basta.lang.python, while a change to basta.lang.python can't break basta.model.
Position
Below the diagonal: basta.lang.python uses a module listed above it, which is the healthy direction.
basta.lang.python uses basta.resolve, so a change to basta.resolve can break basta.lang.python, while a change to basta.lang.python can't break basta.resolve.
Position
Below the diagonal: basta.lang.python uses a module listed above it, which is the healthy direction.
jscpd.lsp.server uses jscpd.lsp.position, so a change to jscpd.lsp.position can break jscpd.lsp.server, while a change to jscpd.lsp.server can't break jscpd.lsp.position.
Position
Below the diagonal: jscpd.lsp.server uses a module listed above it, which is the healthy direction.
jscpd.lsp.server uses cpd_core.models, so a change to cpd_core.models can break jscpd.lsp.server, while a change to jscpd.lsp.server can't break cpd_core.models.
Position
Below the diagonal: jscpd.lsp.server uses a module listed above it, which is the healthy direction.
jscpd.lsp.server uses cpd_semantic.embed, so a change to cpd_semantic.embed can break jscpd.lsp.server, while a change to jscpd.lsp.server can't break cpd_semantic.embed.
Position
Below the diagonal: jscpd.lsp.server uses a module listed above it, which is the healthy direction.
jscpd.lsp.server uses cpd_finder.orchestrate, so a change to cpd_finder.orchestrate can break jscpd.lsp.server, while a change to jscpd.lsp.server can't break cpd_finder.orchestrate.
Position
Below the diagonal: jscpd.lsp.server uses a module listed above it, which is the healthy direction.
jscpd.lsp.server uses cpd_similarity.prints, so a change to cpd_similarity.prints can break jscpd.lsp.server, while a change to jscpd.lsp.server can't break cpd_similarity.prints.
Position
Below the diagonal: jscpd.lsp.server uses a module listed above it, which is the healthy direction.
jscpd.lsp.server uses jscpd.lsp.findings, so a change to jscpd.lsp.findings can break jscpd.lsp.server, while a change to jscpd.lsp.server can't break jscpd.lsp.findings.
Position
Below the diagonal: jscpd.lsp.server uses a module listed above it, which is the healthy direction.
jscpd.lsp.server uses jscpd.lsp.project, so a change to jscpd.lsp.project can break jscpd.lsp.server, while a change to jscpd.lsp.server can't break jscpd.lsp.project.
Position
Below the diagonal: jscpd.lsp.server uses a module listed above it, which is the healthy direction.
jscpd.main uses cpd_semantic.embed, so a change to cpd_semantic.embed can break jscpd.main, while a change to jscpd.main can't break cpd_semantic.embed.
Position
Below the diagonal: jscpd.main uses a module listed above it, which is the healthy direction.
jscpd.main uses cpd_reporter.context, so a change to cpd_reporter.context can break jscpd.main, while a change to jscpd.main can't break cpd_reporter.context.
Position
Below the diagonal: jscpd.main uses a module listed above it, which is the healthy direction.
jscpd.main uses cpd_reporter.reporter, so a change to cpd_reporter.reporter can break jscpd.main, while a change to jscpd.main can't break cpd_reporter.reporter.
Position
Below the diagonal: jscpd.main uses a module listed above it, which is the healthy direction.
jscpd.main uses cpd_finder.orchestrate, so a change to cpd_finder.orchestrate can break jscpd.main, while a change to jscpd.main can't break cpd_finder.orchestrate.
Position
Below the diagonal: jscpd.main uses a module listed above it, which is the healthy direction.
jscpd.main uses cpd_similarity.prints, so a change to cpd_similarity.prints can break jscpd.main, while a change to jscpd.main can't break cpd_similarity.prints.
Position
Below the diagonal: jscpd.main uses a module listed above it, which is the healthy direction.
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
28
High / Critical
A07:2025 — Authentication Failures
4
High / Critical
A03:2025 — Software Supply Chain Failures
2
Medium
A02:2025 — Security Misconfiguration
1
High / Critical
Roadmap
Begin by establishing type safety in the frontend through a build-time typecheck and incremental adoption in high-traffic modules, while simultaneously enabling nullable reference contexts across all files to resolve warnings. Strengthen operational resilience by codifying disaster recovery and backup procedures in infrastructure as code, and ensure accessibility by adding appropriate text alternatives to all media elements. Finally, improve reliability by adding tests for currently unreached production modules to close coverage gaps.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
Put every file in a nullable-enabled context — `#nullable enable` at its top, or commit a project file with <Nullable>enable</Nullable> — and resolve warnings rather than suppressing with `!`.
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Enforce accessibility in the toolchain: add an accessibility check that can read your UI — no component framework was detected and your pages are rendered by server-side templates, which neither the JSX/Vue ESLint plugins nor the HTML-template linters can parse; run axe/pa11y over the rendered pages, or assert the accessibility invariants over that rendered HTML in the test suite you already have, then assert with your test runner's axe binding (jest-axe, vitest-axe, cypress-axe or @axe-core/playwright) in tests, then gate axe/pa11y/Lighthouse in CI.
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 29
A definite problem that already costs you something and drags the score down: a
missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here
tends to cause failures elsewhere.
Serious — 301
Likely wrong, but not failing yet. It degrades
the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to
carry for two years either.
Minor — 30
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 7
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 88 of 88 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 88 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 344 of 360 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D10 Test Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 9 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 32 test source file(s) (.rs) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability NOT MEASURED: the JavaScript/TypeScript suite could not be re-run in the analyzer sandbox — the dependency install for fixtures/dead-code-demo/frameworks/detected/ failed in the analyzer sandbox (npm error Cannot read properties of null (reading 'edgesOut')), so the suite never ran. This is OUR limitation, not a defect in the repo — it is excluded from the score.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability for the vitest suite in fixtures/dead-code-demo/frameworks/detected/ was NOT MEASURED: the dependency install for fixtures/dead-code-demo/frameworks/detected/ failed in the analyzer sandbox (npm error Cannot read properties of null (reading 'edgesOut')), so the suite never ran. This is OUR limitation, not a defect in the repository, and the suite is excluded from the measurement rather than counted against it.
D14 License Compliance — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares a Python pyproject.toml/requirements.txt (pip/uv/Poetry), but the licence verdict published here was taken over its crate dependencies. Nothing was read about its Python dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D14 License Compliance — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its crate dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D19 Documentation Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D21 Naming Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via REDACTED (fixtures/file-names-demo/services/api/REDACTED). docker build failed (exit 1) — ------ REDACTED:1 -------------------- 1 | >>> # syntax=docker/dockerfile:1.7 2 | FROM node:22-alpine AS deps 3 | WORKDIR /srv/app -------------------- ERROR: failed to solve: failed to resolve source metadata for docker.io/docker/dockerfile:1.7: failed to do request: Head "https://registry-1.docker.io/v2/docker/dockerfile/manifests/1.7": Forbidden; runtime evidence skipped.
M4 Documentation accuracy — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9). Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
X27 Collection changed while being enumerated — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This repository's C# was parsed (it ships no .sln or .csproj, so it was read as syntax-only projects), but this check proves its findings from resolved symbols and a reference-free parse resolves none. It abstained rather than report a clean bill it could not earn. That is a gap in this analyzer's reach into build-less repositories — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
DM4 Rich vs anemic domain model: Behaviour is detected as state mutation inside a method body — a method that enforces an invariant by validating-and-throwing without mutating reads as a query, and mutation delegated through an interface the scan can't resolve isn't credited; entities with zero public properties still drop out of the population. It detects that state changes, not whether the rule is correct.
DM6 Domain ↔ infrastructure boundary: Infrastructure reached through a hand-rolled wrapper, a domain-named facade, reflection, or a string-keyed service locator resolves to a non-infra type and isn't seen; the body scan is symbol resolution over syntax, not full dataflow. A clean result means "no resolved infra reference in a domain body", not a proof of purity.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P5 DR & Backup: Backup/restore and disaster-recovery readiness is judged from in-repo evidence — a config that exists is not a tested restore, so the absence of positive evidence is reported as "not evidenced", never scored as present.
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
43 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was jscpd::lsp::project::cli_as_defaults at 46. A further 6 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being jscpd::lsp::findings::comment_syntax at 24 — they are counted neither in the figure above nor in this dimension's score. 4 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold functions was excluded, so the exclusion is disclosed nowhere in the file itself: rust/crates/cpd/src/lsp/findings.rs (jscpd::lsp::findings::comment_syntax at 24), rust/crates/cpd-reporter/src/reporter.rs (cpd_reporter::reporter::create_reporter at 17), rust/crates/cpd-reporter/src/deadcode/mod.rs (cpd_reporter::deadcode::create_dead_code_reporter at 16), rust/crates/cpd-similarity/src/lib.rs (cpd_similarity::language at 16). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 19 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 5 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with jscpd::lsp::project::cli_as_defaults (cyclomatic 46), Walk::enter_node (cyclomatic 41), Project::check (cyclomatic 40). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 5 together lifts Cyclomatic Complexity from 6.8 to about 7.3/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 26 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 20 bodies over 30 down to 30 or less in Cognitive Complexity — start with Project::check (cognitive 53), Walk::enter_node (cognitive 50), FilePreparer::prepare (cognitive 49). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 20 together lifts Cognitive Complexity from 5.6 to about 6.7/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.7 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
ClassTooLong: Server · ×2rust/crates/cpd/src/lsp/server.rs:130
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 17 FileTooLong finding(s) in God Classes — start with javascript.rs, REDACTED, server.rs. — One of this dimension's main actionable groups (17 warning-level).
Resolve the 8 FunctionTooLong finding(s) in God Classes — start with main.rs (2), dashboard.rs (2), compare.rs. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 7 MethodTooLong finding(s) in God Classes — start with mod.rs (2), options.rs, project.rs. — One of this dimension's main actionable groups (7 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
36 duplicated block group(s) detected. One further row reports members as variants of one another; it aggregates block groups already counted above and is not itself counted. 27 of the 37 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.
+ 19 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 4 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with file1.rs (2), dashboard.rs, file1.dart. — One of this dimension's main actionable groups (4 warning-level).
Resolve the 3 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with xml_reporter.rs, file1.rs, shelf.rs. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 3 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with cli.rs, dashboard.rs, invoice_totals.ex. — One of this dimension's main actionable groups (3 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling8.7 / 10Strong✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
12 production modules (Cargo+npm), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 2 module(s) off the main sequence, with abstractness counted on 9 of the 12 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).
Off the main sequence: cpd-core · ×2
What to do
Resolve the 2 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (2 warning-level).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
1884 test methods: 1442 unit, 441 integration, 0 BDD, 1 e2e. The JavaScript/TypeScript suite contributes 9 `it`/`test` case(s) across 3 test file(s) declaring at least one; its tier split is read from package names and paths only. The Rust suite contributes 1871 `#[test]` function(s) across 141 file(s) declaring at least one; its unit/integration split is Cargo's own — 29 of those file(s) are integration-test targets under a crate's tests/ directory, and the rest are #[test] functions compiled into the crate they test. The Python suite contributes 4 test function(s) across 1 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests truly assert behaviour rather than just running the code.
Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.
1 skipped (1 with a documented reason), 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 9 tests. Measured on the JavaScript/TypeScript suite only — at least 32 test source file(s) (.rs) went unread, so its test quality is unmeasured and is not in these counts.
Skipped (documented): a platform package without its binary: ENOENT in result.error, the command exits 1rust/jscpd/test/run-jscpd.test.js:79
✓ On the Gold path — maintain.
Detailed fixes: d10_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether dependencies are current, secure, and not bloated.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.
4 outdated, 0 yanked direct Cargo dependencies. 53 of 55 direct crates were graded against crates.io (0 not published there, 2 not resolved by a committed REDACTED). Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from REDACTED there.
Outdated: globset · ×4
✓ On the Gold path — maintain.
Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 396 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's REDACTED closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. This repository publishes itself under MIT, which is its own choice and is not judged here. ★ COVERAGE OF THIS VERDICT: it grades this repository's crate dependencies and nothing else. The repository also declares a Python pyproject.toml/requirements.txt (pip/uv/Poetry) and package.json, and the licences of those dependency graphs were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Top hotspots: rust/crates/cpd/src/main.rs (68×32=2176); rust/crates/cpd/src/options.rs (47×40=1880); rust/crates/cpd-finder/src/orchestrate.rs (42×26=1092) Repeated repair below the complexity floor: rust/crates/cpd-tokenizer/src/sfc.rs (7 of 13 changes were fixes); rust/crates/cpd-tokenizer/src/markdown.rs (6 of 11 changes were fixes); rust/crates/cpd/src/baseline_ref.rs (5 of 9 changes were fixes)
Resolve the 29 Hotspot finding(s) in Churn × Complexity Hotspots — start with project.rs (2), mod.rs (2), dashboard.rs (2). — One of this dimension's main actionable groups (29 warning-level).
Resolve the 10 Repeated repair finding(s) in Churn × Complexity Hotspots — start with sfc.rs, markdown.rs, baseline_ref.rs. — One of this dimension's main actionable groups (10 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor4.7 / 10Weak✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
65 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is rust/crates/basta/src/lang/javascript.rs. Counted over 122 of the 141 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1
What to do
Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
15 deducted task-comment markers across 81519 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
TodoComment · ×15fixtures/javascript/file1.ts:69
What to do
Resolve the 15 TodoComment finding(s) in Explicit Debt — start with file2.ts (3), file2.mts (3), file2.cts (3). — One of this dimension's main actionable groups (15 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
1 of 1 documentation facets pass in full. 21 document(s) read across 1 unit(s).
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: REDACTED scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
3 finding(s): 0 critical, 3 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
REDACTED
What to do
Resolve the 2 REDACTED finding(s) in Secrets (history) — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 High secret finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
28 finding(s): 0 critical, 24 high, 4 medium, 0 low. semgrep hit a parse error in 6 file(s) — `benchmark/benchmark.sh`, `fixtures/clike/file1.cs` (lines 28–32), `fixtures/clike/file2.cs` (lines 28–32), `fixtures/dead-code-demo/rust/cargo-check.json`, `rust/crates/cpd-reporter/src/dashboard.rs` (line 151, line 152), … (+1 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 6 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 5 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 10 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (9), REDACTED. — One of this dimension's main actionable groups (10 issue-level).
Resolve the 5 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED, REDACTED. — One of this dimension's main actionable groups (5 issue-level).
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
Resolve the 1 Medium vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 122 of the 141 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 2 Change coupling finding(s) in Change Coupling — start with grammars.rs (2). — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 Change-coupling hub finding(s) in Change Coupling — start with cli.rs. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
Build pipeline generates provenance, signs artifacts and produces an SBOM.
REDACTED
What to do
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 1 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
✓ On the Gold path — maintain.
Detailed fixes: d44_recommendation.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC1 · Text alternatives3.5 / 10Weak✓ Tool-verified
Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.
An svg presented as an image needs a name — add a <title> child or an aria-label/aria-labelledby. — REDACTED:0
What to do
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Do you agree with this assessment?
AC2 · Forms & labels10.0 / 10Exemplary○ Nothing flagged
Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.
Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.
Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. — rust/crates/cpd-reporter/templates/report.html:2
An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it's decorative. (×2) — REDACTED:387, REDACTED:397
What to do
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.
Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
`.toggle-btn:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — rust/crates/cpd-reporter/templates/report.html:36
What to do
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Do you agree with this assessment?
AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified
Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.
Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.
Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.
No accessibility enforcement found — no a11y linter (an accessibility check that can read your UI — no component framework was detected and your pages are rendered by server-side templates, which neither the JSX/Vue ESLint plugins nor the HTML-template linters can parse; run axe/pa11y over the rendered pages, or assert the accessibility invariants over that rendered HTML in the test suite you already have) and no axe/pa11y/Lighthouse in tests or CI. Start by running that check over your rendered pages in CI. What was searched, so you can tell an absence from a miss: the 2 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
What to do
Enforce accessibility in the toolchain: add an accessibility check that can read your UI — no component framework was detected and your pages are rendered by server-side templates, which neither the JSX/Vue ESLint plugins nor the HTML-template linters can parse; run axe/pa11y over the rendered pages, or assert the accessibility invariants over that rendered HTML in the test suite you already have, then assert with your test runner's axe binding (jest-axe, vitest-axe, cypress-axe or @axe-core/playwright) in tests, then gate axe/pa11y/Lighthouse in CI.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').
Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
Do you agree with this assessment?
DM4 · Rich vs anemic domain model10.0 / 10Exemplary✓ Tool-verified
Other · Domain Modelling — Whether domain entities own their behaviour (invariant-enforcing commands) rather than being data-only structs driven by a foreign service.
Method: Roslyn (DDD-gated): entity method BODIES classified mutator-vs-query — only methods that mutate the entity's own declared state count as invariant-protecting behaviour, so a getter/passthrough doesn't rescue an anemic class. Deterministic, exhaustive over domain-layer entities.
Coverage: Population: entities by name/base convention; rich-vs-anemic judged by classifying each method body mutator-vs-query — logic-bearing domain types outside the convention are invisible.
Other · Domain Modelling — Whether the domain layer stays free of infrastructure dependencies — a domain aggregate fused to a persistence ORM (diesel/sea-orm/sqlx) on its own declaration (active-record) couples the domain to infrastructure. The clean-architecture dependency rule.
Method: Roslyn (DDD-gated): domain-layer types scanned for infrastructure usage in member SIGNATURES and inside method/accessor BODIES — resolved calls and object-creations into EF/Marten/HTTP/Mongo/Redis/message-bus types (not just a namespace allowlist). Deterministic, symbol-resolved, exhaustive over domain-layer bodies, DDD-native.
Coverage: Domain layer identified by NAMESPACE heuristic; infrastructure then resolved by symbol in member SIGNATURES and method/accessor BODIES — rename the layer and the check evaporates.
Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
Other · Code Health — Unfinished work detected by code SHAPE, not keywords: members that only throw a "not implemented" exception, methods that take inputs and return a constant, async methods that never await, dead `if (false)` / `#if false` branches, and skeleton types most of whose members are holes. A real, objective slice of technical debt.
Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 24 of 35 project(s) that lack one — worth up to 1.4 pts.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Readiness · Readiness — Whether behaviour is captured as executable Gherkin specifications (a plus for shared understanding) — only assessed when a BDD framework is present.
Method: Filesystem scan: BDD framework presence (SpecFlow, Gherkin files) when a project references a BDD tool. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability6.4 / 10Adequate✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Only 6/13 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `fixtures/dead-code-demo/frameworks/detected`, `fixtures/dead-code-demo/python`, `rust`, `rust/basta` and 2 more.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Add OpenTelemetry tracing/metrics (opentelemetry with tracing-opentelemetry) so requests are traceable across the system, not just health-probable.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
What to do
Dependabot is configured but does not watch `npm`, `pip` — add those `package-ecosystem` entries to REDACTED so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
Do you agree with this assessment?
P5 · DR & Backup0.0 / 10Critical✓ Tool-verified
Readiness · Readiness — Whether disaster recovery is planned and codified — backups, geo-recovery, RTO/RPO, persistence guarantees — from IaC + container manifests + docs, never the live cloud.
Method: Filesystem scan: disaster recovery, backup, geo-recovery, RTO/RPO, persistence guarantees from IaC, manifests, and docs. Exhaustive, deterministic, never a live environment.
A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced — a volume that survives a container recreate is not a tested restore from catastrophic loss.
What to do
Codify backups + geo-recovery in IaC and document RTO/RPO and the restore procedure — a persistence guard alone is not disaster recovery.
Readiness · Readiness — Whether database schema changes go through versioned migrations rather than being auto-created from the model at startup.
Method: Roslyn scan: EF Core DbContext for a versioned migrations directory versus bare EnsureCreated usage; off .NET, a file scan of dependency manifests, migration histories (Flyway, Liquibase, Alembic, Django, Rails, Prisma, TypeORM, Knex/Sequelize, golang-migrate, goose, Laravel, Doctrine, Diesel/sqlx) and schema auto-create in production source or config. Exhaustive, deterministic.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
Do you agree with this assessment?
R1 · Type Safety0.0 / 10Critical✓ Tool-verified
React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.
Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.
0 typed · 11 plain JS — the untyped files are rust/basta/platform-map.js, rust/basta/run-basta.js, rust/jscpd/index.js, rust/jscpd/platform-map.js, rust/jscpd/run-jscpd.js, rust/jscpd/test/run-jscpd.test.js (+5 more).
What to do
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
React / JS · Code Health — Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm over JS/TS tokens, D-386): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.
Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Deterministic.
rust/basta/platform-map.js:3 · rust/jscpd/platform-map.js:3 · rust/platform-map.js:3 — these 3 files are line-for-line copies of one another — 69 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — rust/basta/platform-map.js:3
rust/basta/run-basta.js:25 · rust/run-cpd.js:25 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — rust/basta/run-basta.js:25
rust/basta/run-basta.js:25 · rust/jscpd/index.js:36 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — rust/basta/run-basta.js:25
rust/scripts/sync-version.mjs:105 · rust/scripts/sync-version.mjs:137 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — rust/scripts/sync-version.mjs:105
rust/basta/run-basta.js:66 · rust/jscpd/run-jscpd.js:21 · rust/run-cpd.js:65 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — rust/basta/run-basta.js:66
rust/scripts/sync-version.mjs:232 · rust/scripts/sync-version.mjs:239 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — rust/scripts/sync-version.mjs:232
What to do
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
What to do
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
Do you agree with this assessment?
R3 · Large Files10.0 / 10Exemplary✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
Do you agree with this assessment?
R4 · Test Coverage3.0 / 10Weak✓ Tool-verified
React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.
Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.
fixtures/dead-code-demo/bundler/vite.config.js:7 imports './src', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — fixtures/dead-code-demo/bundler/vite.config.js:7
fixtures/dead-code-demo/frameworks/custom/kit/boot.js:3 imports '../screens/', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — fixtures/dead-code-demo/frameworks/custom/kit/boot.js:3
fixtures/jsx/file1.jsx:5 imports './Media', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — fixtures/jsx/file1.jsx:5
fixtures/jsx/file1.tsx:5 imports './Media', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — fixtures/jsx/file1.tsx:5
fixtures/jsx/file2.jsx:5 imports './Media', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — fixtures/jsx/file2.jsx:5
fixtures/jsx/file2.tsx:5 imports './Media', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — fixtures/jsx/file2.tsx:5
fixtures/sfc-demo/template-range/TicketCard.vue:18 imports '../lib/dates', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — fixtures/sfc-demo/template-range/TicketCard.vue:18
fixtures/vue/file1.vue:120 imports './channel', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — fixtures/vue/file1.vue:120
fixtures/vue/file2.vue:99 imports './channel', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — fixtures/vue/file2.vue:99
No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×7) — rust/scripts/sync-version.mjs:1, rust/scripts/npm-prebuilt-package.mjs:1, rust/scripts/gen-formats-md.mjs:1, …
What to do
Add tests that import the unreached modules (directly or through their public entry).
React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).
Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.
What to do
Bump outdated dependencies to current versions to limit upgrade debt.
Do you agree with this assessment?
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.
Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.
This repository declares test tooling, and the ✓ above records that declaration — but fixtures/dead-code-demo/bundler/vite.config.js and 8 other test file(s) in this workspace cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) — each one is reported with its failing import under Test Coverage — then the declared script exercises what it claims to. — fixtures/dead-code-demo/bundler/vite.config.js:7
Do you agree with this assessment?
R7 · Dead Code9.6 / 10Exemplary✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it. (×8) — fixtures/dead-code-demo/components/src/App.vue:10, fixtures/folder1/file_1.js:4, fixtures/ignore/file_1.js:5, …
What to do
Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.
Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether an argument guard throws the exception its own condition describes — a guard that rejects a value for being EMPTY and reports it as `ArgumentNullException` tells the caller a parameter was null when it provably was not.
Method: Roslyn syntax: `throw new ArgumentNullException(nameof(p))` statements controlled by an `if`, whose condition is read for a test that is true of a NON-null `p` — an emptiness test that dereferences it (`p.Count == 0`, `!p.Any()`) or a BCL predicate documented true of the empty value (`string.IsNullOrEmpty(p)`). Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X32 · Type resolved by simple name across every loaded assembly10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a plugin lookup names the type it means — searching every assembly loaded into the process for a candidate whose SIMPLE name equals a string supplied at runtime, and taking the first one found, is decided by assembly LOAD ORDER rather than by this source, so the same name can resolve to a different type on the next run.
Method: Roslyn syntax only, no semantic model: every invocation of `First`/`FirstOrDefault`/`Single`/`SingleOrDefault` whose OWN expression subtree contains both a `GetAssemblies()` call and a `GetTypes()`/`GetExportedTypes()` call — a single-element pick out of every type loaded into the process. A nested selector in the same chain sees no `GetAssemblies()` in its own subtree and is outside the population, so one lookup counts once however many links its chain has. A finding additionally needs both remaining halves: the selector must be `First`/`FirstOrDefault` (`Single`/`SingleOrDefault` reports the ambiguity rather than resolving it, and is counted and never reported), and the chain must carry an `==` comparison of `<lambda parameter>.Name` against something that is not a literal. The receiver must be a plain identifier bound by one of the chain’s own lambdas, which places `assembly.GetName().Name == "X"` outside the rule by construction. One exemption: a `.Name` test joined by `&&` to a `FullName`/`AssemblyQualifiedName` test on the same identifier is spared; joined by `||` it is not. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
Other · Code Health — Whether nullable reference types are enabled and not undermined by heavy `!` suppression.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
0/9 C# file(s) are in a nullable-enabled context. This repository commits no project file, so nothing sets <Nullable>enable</Nullable> for it: a file is enabled only by its own `#nullable enable`, by a Unity `csc.rsp` with `-nullable:enable` for its assembly, or as a file-based app (`#:` directives) whose `#:property Nullable` does not turn it off. NRTs catch a whole class of null-deref bugs at compile time.
What to do
Put every file in a nullable-enabled context — `#nullable enable` at its top, or commit a project file with <Nullable>enable</Nullable> — and resolve warnings rather than suppressing with `!`.
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 13 of 55 WCAG 2.2 Level A/AA success criteria (24%; ≈26% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 42 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 2 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 6 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 5 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not included — 52 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AX1 Captive dependencies — no DI registrations detected
AX2 Stateful singletons — no singleton implementations detected
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — docker build failed (exit 1) — ------ REDACTED:1 -------------------- 1 | >>> # syntax=docker/dockerfile:1.7 2 | FROM node:22-alpine AS deps 3 | WORKDIR /srv/app -------------------- ERROR: failed to solve: failed to resolve source metadata for docker.io/docker/dockerfile:1.7: failed to do request: Head "https://registry-1.docker.io/v2/docker/dockerfile/manifests/1.7": Forbidden; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C2 Access Controls — No access-control surface detected in the analyzed source — no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here — this is a library/CLI, which is authorized by its CALLER, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
D11 Test Reliability — Test reliability not measured — JavaScript/TypeScript suite did not run
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D21 Naming Consistency — Naming consistency is measured on C# only; Dart, Elixir, Erlang, Java, JavaScript, Kotlin, PHP, Python, Rust, Scala, Swift, TypeScript, html not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed JavaScript, Rust surface was not measured.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — D24 reads C# and Visual Basic comments only — this repository's production source is .cts, .dart, .erl, .ex, .fs, .go, .java, .kt, .mts, .php, .py, .rb, .rs, .scala, .swift, .ts, .tsx, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D25 ADR Conformance — no ADRs to check
D26 Project Cohesion — Project cohesion is assessed over the .NET project set; this target exposed no projects, so project size and spread could not be assessed. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.rs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — fixtures/dead-code-demo/frameworks/detected/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.
DM1 Aggregate boundaries — this Rust crate declares no domain aggregate (a struct with private state and its own command methods), so DM1's aggregate-boundary read has no population to be taken over
DM2 Strongly-typed ids — the crate defines newtype typed-ids but declares no domain aggregate that could carry an id — so DM2's adoption ratio has no population to be taken over
DM3 Integration-event coupling — not applicable: no DDD domain layer was detected (no aggregate, entity or value-object structure), so there is no domain model for this card to grade
DM5 Encapsulated state — this Rust crate declares no type implementing a hand-rolled Hash/PartialEq, so DM5's value-identity encapsulation read has no population to be taken over
DM7 Repository granularity — not applicable: no DDD domain layer was detected (no aggregate, entity or value-object structure), so there is no domain model for this card to grade
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and this analysis resolves a call's owner only where the receiver's type is written down in the source. Reported as guidance rather than measured
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, which this analysis does not build from source alone for this language. Reported as guidance rather than measured
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable (this repository commits no MSBuild project, so its C# was read as syntax-only projects — a handler marked ONLY by an interface from a package is not visible without a build)
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
P12 CI test-gate honesty — Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JavaScript/TypeScript, Python, Rust source, so there is no service whose uptime a failing dependency could take down
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
PF2 Allocation hygiene — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
R8 Dependency Hygiene — Not measured — no package.json declares any dependency, so there is nothing to check imports against (imports may resolve through a host runtime rather than node).
S1 Web-Security Posture — No web surface detected in the analyzed source — no HTTP API or web-UI project (no controllers/minimal-API endpoints, no Razor/Blazor views) and no web middleware (HTTPS redirection, HSTS, security headers, cookies). Transport security, security headers, secure cookies, CSRF/input-validation and middleware-order controls are therefore N/A here — this is a library/CLI/worker, not a web app. Crypto hygiene was still checked and found nothing to flag. If this codebase becomes web-facing, the dimension reactivates automatically.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X2 Cancellation propagation — no async method does work a token could cancel
X27 Collection changed while being enumerated — This check needs a compiled C# program and this repository commits no project file to compile, so only its syntax could be read. That is a limit of the analyzer, not a finding about your code.
X31 Test-only surface in a production module — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
AC1 · Text alternatives· <svg role="img"> without an accessible name · ×1
<svg role="img"> without an accessible name REDACTED— An svg presented as an image needs a name — add a <title> child or an aria-label/aria-labelledby.
Hotspot: rust/crates/cpd/src/main.rs rust/crates/cpd/src/main.rs:305— rust/crates/cpd/src/main.rs changed 68 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in jscpd::load_options at line 305. 22 of those changes were fix/bug commits, and the other 46 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd/src/main.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd/src/options.rs rust/crates/cpd/src/options.rs:124— rust/crates/cpd/src/options.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Options::from_cli_and_config at line 124. 8 of those changes were fix/bug commits, and the other 39 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd/src/options.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd-finder/src/orchestrate.rs rust/crates/cpd-finder/src/orchestrate.rs:543— rust/crates/cpd-finder/src/orchestrate.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in FilePreparer::prepare at line 543. 15 of those changes were fix/bug commits, and the other 27 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-finder/src/orchestrate.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd/src/mcp/project.rs rust/crates/cpd/src/mcp/project.rs:693— rust/crates/cpd/src/mcp/project.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Project::check at line 693. 10 of those changes were fix/bug commits, and the other 12 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd/src/mcp/project.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd-reporter/src/sarif.rs rust/crates/cpd-reporter/src/sarif.rs:113— rust/crates/cpd-reporter/src/sarif.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in SarifReporter::report at line 113. 12 of those changes were fix/bug commits, and the other 26 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-reporter/src/sarif.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/basta/src/lang/javascript.rs rust/crates/basta/src/lang/javascript.rs:1980— rust/crates/basta/src/lang/javascript.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Walk::enter_node at line 1980. 10 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/basta/src/lang/javascript.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd/src/lsp/project.rs rust/crates/cpd/src/lsp/project.rs:251— rust/crates/cpd/src/lsp/project.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in jscpd::lsp::project::cli_as_defaults at line 251. 3 of those changes were fix/bug commits, and the other 7 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd/src/lsp/project.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd-core/src/detect.rs rust/crates/cpd-core/src/detect.rs:493— rust/crates/cpd-core/src/detect.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in cpd_core::detect::detect_in_group at line 493. 12 of those changes were fix/bug commits, and the other 16 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-core/src/detect.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd-semantic/src/search.rs rust/crates/cpd-semantic/src/search.rs:637— rust/crates/cpd-semantic/src/search.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in cpd_semantic::search::call_pairs at line 637. 12 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-semantic/src/search.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd/src/lsp/server.rs rust/crates/cpd/src/lsp/server.rs:945— rust/crates/cpd/src/lsp/server.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Server::notification at line 945. 4 of those changes were fix/bug commits, and the other 8 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd/src/lsp/server.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd-semantic/src/compare.rs rust/crates/cpd-semantic/src/compare.rs:204— rust/crates/cpd-semantic/src/compare.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in cpd_semantic::compare::compare at line 204. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-semantic/src/compare.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd-finder/src/walker.rs rust/crates/cpd-finder/src/walker.rs:161— rust/crates/cpd-finder/src/walker.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in cpd_finder::walker::walk_one at line 161. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-finder/src/walker.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd-semantic/src/embed/mod.rs rust/crates/cpd-semantic/src/embed/mod.rs:397— rust/crates/cpd-semantic/src/embed/mod.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Cached::embed at line 397. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-semantic/src/embed/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd-tokenizer/src/tokenizer.rs rust/crates/cpd-tokenizer/src/tokenizer.rs:723— rust/crates/cpd-tokenizer/src/tokenizer.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in cpd_tokenizer::tokenizer::mark_annotations at line 723. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-tokenizer/src/tokenizer.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd/src/compare/mod.rs rust/crates/cpd/src/compare/mod.rs:596— rust/crates/cpd/src/compare/mod.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Section::console at line 596. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd/src/compare/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:654— REDACTED changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in REDACTED.buildView at line 654. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd-tokenizer/src/razor.rs rust/crates/cpd-tokenizer/src/razor.rs:18— rust/crates/cpd-tokenizer/src/razor.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in cpd_tokenizer::razor::extract_razor_blocks at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-tokenizer/src/razor.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd-reporter/src/reporter.rs rust/crates/cpd-reporter/src/reporter.rs:170— rust/crates/cpd-reporter/src/reporter.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in cpd_reporter::reporter::create_reporter at line 170. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-reporter/src/reporter.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd/src/dashboard.rs rust/crates/cpd/src/dashboard.rs:202— rust/crates/cpd/src/dashboard.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in jscpd::dashboard::run_reporters at line 202. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd/src/dashboard.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/basta/src/analyze.rs rust/crates/basta/src/analyze.rs:51— rust/crates/basta/src/analyze.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in basta::analyze::run_keeping at line 51. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/basta/src/analyze.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd-reporter/src/dashboard.rs rust/crates/cpd-reporter/src/dashboard.rs:538— rust/crates/cpd-reporter/src/dashboard.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in cpd_reporter::dashboard::render_markdown at line 538. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-reporter/src/dashboard.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/basta/src/cli.rs rust/crates/basta/src/cli.rs:171— rust/crates/basta/src/cli.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in basta::cli::resolve at line 171. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/basta/src/cli.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd-similarity/src/clojure.rs rust/crates/cpd-similarity/src/clojure.rs:140— rust/crates/cpd-similarity/src/clojure.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in cpd_similarity::clojure::normalize at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-similarity/src/clojure.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/cpd/src/complexity.rs rust/crates/cpd/src/complexity.rs:38— rust/crates/cpd/src/complexity.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in jscpd::complexity::run at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd/src/complexity.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: rust/crates/basta/src/classify.rs rust/crates/basta/src/classify.rs:127— rust/crates/basta/src/classify.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in basta::classify::category_for at line 127. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/basta/src/classify.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
FileTooLong: lang/javascript.rs rust/crates/basta/src/lang/javascript.rs— FileTooLong — 1618 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 66 free functions. The bar is 500 significant lines; this is 1118 over it, 3.24× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED REDACTED— FileTooLong — 1247 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 747 over it, 2.49× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: lsp/server.rs rust/crates/cpd/src/lsp/server.rs— FileTooLong — 1170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 81% of them inside a single declaration: Server (2 blocks, 130-1641). The bar is 500 significant lines; this is 670 over it, 2.34× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/syntax.rs rust/crates/cpd-similarity/src/syntax.rs— FileTooLong — 1091 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 591 over it, 2.18× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/detect.rs rust/crates/cpd-core/src/detect.rs— FileTooLong — 1012 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 35 free functions. The bar is 500 significant lines; this is 512 over it, 2.02× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/cli.rs rust/crates/cpd/src/cli.rs— FileTooLong — 1007 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 507 over it, 2.01× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/main.rs rust/crates/cpd/src/main.rs— FileTooLong — 1007 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 41 free functions. The bar is 500 significant lines; this is 507 over it, 2.01× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: mcp/project.rs rust/crates/cpd/src/mcp/project.rs— FileTooLong — 754 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 67% of them inside a single declaration: Project (2 blocks, 392-1150). The bar is 500 significant lines; this is 254 over it, 1.51× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/search.rs rust/crates/cpd-semantic/src/search.rs— FileTooLong — 700 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 200 over it, 1.40× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: lang/python.rs rust/crates/basta/src/lang/python.rs— FileTooLong — 680 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 180 over it, 1.36× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: compare/mod.rs rust/crates/cpd/src/compare/mod.rs— FileTooLong — 676 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 176 over it, 1.35× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/dashboard.rs rust/crates/cpd-reporter/src/dashboard.rs— FileTooLong — 588 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 88 over it, 1.18× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/orchestrate.rs rust/crates/cpd-finder/src/orchestrate.rs— FileTooLong — 553 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 53 over it, 1.11× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: lang/sfc.rs rust/crates/basta/src/lang/sfc.rs— FileTooLong — 529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 29 over it, 1.06× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/lib.rs rust/crates/cpd-similarity/src/lib.rs— FileTooLong — 528 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 28 over it, 1.06× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/history_render.rs rust/crates/cpd-reporter/src/history_render.rs— FileTooLong — 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 22 over it, 1.04× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: boundaries/check.rs rust/crates/cpd/src/boundaries/check.rs— FileTooLong — 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 14 over it, 1.03× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
TodoComment fixtures/javascript/file1.ts:69— // Todo Model — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment fixtures/javascript/file2.ts:116— // Todo Model — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment fixtures/javascript/file1.mts:69— // Todo Model — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment fixtures/javascript/file2.mts:116— // Todo Model — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment fixtures/javascript/file1.cts:69— // Todo Model — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment fixtures/javascript/file2.cts:116— // Todo Model — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment fixtures/javascript/file1.ts:76— // Todo Item View — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment fixtures/javascript/file2.ts:189— // Todo Item View — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment fixtures/javascript/file1.mts:76— // Todo Item View — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment fixtures/javascript/file2.mts:189— // Todo Item View — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment fixtures/javascript/file1.cts:76— // Todo Item View — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment fixtures/javascript/file2.cts:189— // Todo Item View — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment fixtures/javascript/file2.ts:149— // Todo Collection — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment fixtures/javascript/file2.mts:149— // Todo Collection — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment fixtures/javascript/file2.cts:149— // Todo Collection — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
Repeated repair: rust/crates/cpd-tokenizer/src/sfc.rs rust/crates/cpd-tokenizer/src/sfc.rs:216— rust/crates/cpd-tokenizer/src/sfc.rs changed 13 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is cpd_tokenizer::sfc::detect_block_format at line 216), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(markdown): front matter holds no code fence”; “fix(detect): cut a consistent clone once, take names as written”; “fix(similarity): review findings for ignored code”; “fix(similarity): leave out ignored code”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-tokenizer/src/sfc.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: rust/crates/cpd-tokenizer/src/markdown.rs rust/crates/cpd-tokenizer/src/markdown.rs:395— rust/crates/cpd-tokenizer/src/markdown.rs changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is cpd_tokenizer::markdown::tokenize_markdown at line 395), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(markdown): fences that never close are read in one pass”; “fix(markdown): front matter holds no code fence”; “fix(detect): a member first in a clone counts as a local”; “fix(detect): cut a consistent clone once, take names as written”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-tokenizer/src/markdown.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: rust/crates/cpd/src/baseline_ref.rs rust/crates/cpd/src/baseline_ref.rs:246— rust/crates/cpd/src/baseline_ref.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 5 (its worst body is jscpd::baseline_ref::worktree_config at line 246), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(history): walk first parents, scan commits as the working tree”; “fix(changed): review fixes for --changed and --changed-only”; “fix: mask the API key before the error body is cut”; “fix: harden git subprocesses and redact the API key in errors”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd/src/baseline_ref.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: rust/crates/cpd/src/compare/html.rs rust/crates/cpd/src/compare/html.rs:55— rust/crates/cpd/src/compare/html.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 3 (its worst body is jscpd::compare::html::page at line 55), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(compare): folder labels keep the folders that tell them apart”; “fix(compare): folder labels keep the folder that tells them apart”; “fix(compare): one share in both reports, no empty Tests block, no bodiless functions”; “fix(compare): review fixes for the html page”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd/src/compare/html.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: rust/crates/cpd-tokenizer/src/embedded.rs rust/crates/cpd-tokenizer/src/embedded.rs:47— rust/crates/cpd-tokenizer/src/embedded.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is cpd_tokenizer::embedded::blank_ranges_preserve_newlines at line 47), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(markdown): front matter holds no code fence”; “fix(detect): cut a consistent clone once, take names as written”; “fix(similarity): review findings for ignored code”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-tokenizer/src/embedded.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: rust/crates/cpd-reporter/src/health_render.rs rust/crates/cpd-reporter/src/health_render.rs:109— rust/crates/cpd-reporter/src/health_render.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is cpd_reporter::health_render::print_badge at line 109), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(history): walk first parents, scan commits as the working tree”; “fix: address Copilot review of #1076”; “fix(health,cli): pre-release review findings for --dashboard/--health”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-reporter/src/health_render.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: rust/crates/cpd-semantic/src/test_code.rs rust/crates/cpd-semantic/src/test_code.rs:88— rust/crates/cpd-semantic/src/test_code.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is cpd_semantic::test_code::cfg_is_test at line 88), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(compare): only a plural Tests part marks a dotted project as tests”; “fix(similarity): review findings for the candidates”; “fix(compare): review fixes for test detection and test-case names”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-semantic/src/test_code.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: rust/crates/cpd-core/src/hash.rs rust/crates/cpd-core/src/hash.rs:18— rust/crates/cpd-core/src/hash.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is cpd_core::hash::hash_token at line 18), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(detect): cut a consistent clone once, take names as written”; “fix(baseline): make clone fingerprints line-ending agnostic”; “fix(sarif): make clone_hash order-insensitive, move test fixtures to temp dirs”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-core/src/hash.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: rust/crates/cpd-semantic/src/embed/http.rs rust/crates/cpd-semantic/src/embed/http.rs:147— rust/crates/cpd-semantic/src/embed/http.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 11 (its worst body is HttpBackend::request at line 147), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: mask the API key before the error body is cut”; “fix: harden git subprocesses and redact the API key in errors”; “fix(semantic): a config file cannot send code or the API key to another host”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/cpd-semantic/src/embed/http.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: rust/crates/basta/src/resolve.rs rust/crates/basta/src/resolve.rs:279— rust/crates/basta/src/resolve.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 5 (its worst body is basta::resolve::normalize at line 279), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(basta): what a run beside knip and fallow on 55 repositories found”; “fix(dead-code): address review on globs, aliases and component markup”; “fix(basta): read Python names hidden in quoted annotations and src layouts”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-29 17:32:46 +01:00' --until='2026-10-27 17:32:46 +01:00' --full-history --no-merges -- rust/crates/basta/src/resolve.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
basta::entry::script_mentions (cognitive 40) rust/crates/basta/src/entry.rs:417— basta::entry::script_mentions has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 6 (12 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
basta::lang::sfc::scan_expression (cognitive 32) rust/crates/basta/src/lang/sfc.rs:650— basta::lang::sfc::scan_expression has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
basta::rustc::item_end (cognitive 29) rust/crates/basta/src/rustc.rs:407— basta::rustc::item_end has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (5 pts), boolean chains 2, loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
basta::cli::resolve (cognitive 26) rust/crates/basta/src/cli.rs:171— basta::cli::resolve has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 6 (9 pts), boolean chains 5, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
basta::analyze::run_keeping (cognitive 22) rust/crates/basta/src/analyze.rs:51— basta::analyze::run_keeping has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), boolean chains 3, match/switch 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
basta::classify::findings (cognitive 21) rust/crates/basta/src/classify.rs:23— basta::classify::findings has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
basta::lang::sfc::split (cognitive 21) rust/crates/basta/src/lang/sfc.rs:147— basta::lang::sfc::split has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, match/switch 1 (3 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
basta::lang::javascript::strip_comments (cognitive 20) rust/crates/basta/src/lang/javascript.rs:885— basta::lang::javascript::strip_comments has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
basta::lang::javascript::collect_imports (cognitive 20) rust/crates/basta/src/lang/javascript.rs:2528— basta::lang::javascript::collect_imports has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (10 pts), loops 5, if/else 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
basta::classify::category_for (cognitive 17) rust/crates/basta/src/classify.rs:127— basta::classify::category_for has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
cpd_semantic::compare::compare (cognitive 40) rust/crates/cpd-semantic/src/compare.rs:204— cpd_semantic::compare::compare has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 9 (14 pts), boolean chains 7 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_semantic::extract::scan_rust_functions (cognitive 37) rust/crates/cpd-semantic/src/extract/mod.rs:123— cpd_semantic::extract::scan_rust_functions has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_semantic::search::call_pairs (cognitive 26) rust/crates/cpd-semantic/src/search.rs:637— cpd_semantic::search::call_pairs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (8 pts), boolean chains 5 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_semantic::compare::call_graph (cognitive 25) rust/crates/cpd-semantic/src/compare.rs:554— cpd_semantic::compare::call_graph has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_semantic::extract::skip_rust_literal (cognitive 25) rust/crates/cpd-semantic/src/extract/mod.rs:247— cpd_semantic::extract::skip_rust_literal has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 7, loops 3 (5 pts), match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_semantic::search::matched_pairs (cognitive 24) rust/crates/cpd-semantic/src/search.rs:506— cpd_semantic::search::matched_pairs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_semantic::embed::cache::save (cognitive 20) rust/crates/cpd-semantic/src/embed/cache.rs:175— cpd_semantic::embed::cache::save has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_semantic::search::called_names (cognitive 19) rust/crates/cpd-semantic/src/search.rs:740— cpd_semantic::search::called_names has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_semantic::search::covered_pairs (cognitive 19) rust/crates/cpd-semantic/src/search.rs:1038— cpd_semantic::search::covered_pairs has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 3 (7 pts), boolean chains 3 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
cpd_semantic::extract::grammars::code_start (cognitive 16) rust/crates/cpd-semantic/src/extract/grammars.rs:220— cpd_semantic::extract::grammars::code_start has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
jscpd::lsp::project::cli_as_defaults (cognitive 47) rust/crates/cpd/src/lsp/project.rs:251— jscpd::lsp::project::cli_as_defaults has cognitive complexity 47 (threshold 15). Drivers by points: if/else 45 (47 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
jscpd::load_options (cognitive 34) rust/crates/cpd/src/main.rs:305— jscpd::load_options has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 14, match/switch 2 (4 pts), loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
jscpd::cli::parse_cross_formats (cognitive 33) rust/crates/cpd/src/cli.rs:69— jscpd::cli::parse_cross_formats has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 6 (13 pts), match/switch 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
jscpd::run_cli (cognitive 22) rust/crates/cpd/src/main.rs:215— jscpd::run_cli has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), loops 1 (2 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
jscpd::lsp::complexity::complexity_findings (cognitive 20) rust/crates/cpd/src/lsp/complexity.rs:23— jscpd::lsp::complexity::complexity_findings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), match/switch 1 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
jscpd::cli::normalize_v4_config (cognitive 19) rust/crates/cpd/src/cli.rs:1323— jscpd::cli::normalize_v4_config has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 4 (6 pts), loops 4, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
jscpd::complexity::run (cognitive 18) rust/crates/cpd/src/complexity.rs:38— jscpd::complexity::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
jscpd::lsp::findings::clone_findings (cognitive 18) rust/crates/cpd/src/lsp/findings.rs:157— jscpd::lsp::findings::clone_findings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (6 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
jscpd::dead_code::config_noting (cognitive 16) rust/crates/cpd/src/dead_code.rs:93— jscpd::dead_code::config_noting has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 3 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
R4 · Test Coverage· This test file cannot be loaded · ×9
This test file cannot be loaded fixtures/dead-code-demo/bundler/vite.config.js:7— fixtures/dead-code-demo/bundler/vite.config.js:7 imports './src', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded fixtures/dead-code-demo/frameworks/custom/kit/boot.js:3— fixtures/dead-code-demo/frameworks/custom/kit/boot.js:3 imports '../screens/', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded fixtures/jsx/file1.jsx:5— fixtures/jsx/file1.jsx:5 imports './Media', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded fixtures/jsx/file1.tsx:5— fixtures/jsx/file1.tsx:5 imports './Media', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded fixtures/jsx/file2.jsx:5— fixtures/jsx/file2.jsx:5 imports './Media', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded fixtures/jsx/file2.tsx:5— fixtures/jsx/file2.tsx:5 imports './Media', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded fixtures/sfc-demo/template-range/TicketCard.vue:18— fixtures/sfc-demo/template-range/TicketCard.vue:18 imports '../lib/dates', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded fixtures/vue/file1.vue:120— fixtures/vue/file1.vue:120 imports './channel', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
This test file cannot be loaded fixtures/vue/file2.vue:99— fixtures/vue/file2.vue:99 imports './channel', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
FunctionTooLong: cpd_semantic::compare::compare rust/crates/cpd-semantic/src/compare.rs:204— FunctionTooLong — cpd_semantic::compare::compare runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: jscpd::detect_and_report rust/crates/cpd/src/main.rs:740— FunctionTooLong — jscpd::detect_and_report runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: cpd_reporter::dashboard::print_dashboard rust/crates/cpd-reporter/src/dashboard.rs:378— FunctionTooLong — cpd_reporter::dashboard::print_dashboard runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: basta::analyze::run_keeping rust/crates/basta/src/analyze.rs:51— FunctionTooLong — basta::analyze::run_keeping runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: cpd_core::detect::detect_in_group rust/crates/cpd-core/src/detect.rs:493— FunctionTooLong — cpd_core::detect::detect_in_group runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: basta::cli::resolve rust/crates/basta/src/cli.rs:171— FunctionTooLong — basta::cli::resolve runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: cpd_reporter::dashboard::render_html rust/crates/cpd-reporter/src/dashboard.rs:667— FunctionTooLong — cpd_reporter::dashboard::render_html runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: jscpd::load_options rust/crates/cpd/src/main.rs:305— FunctionTooLong — jscpd::load_options runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
cpd_tokenizer::razor::extract_razor_blocks (cognitive 48) rust/crates/cpd-tokenizer/src/razor.rs:18— cpd_tokenizer::razor::extract_razor_blocks has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (35 pts), boolean chains 6, loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_tokenizer::tokenizer::mark_annotations (cognitive 30) rust/crates/cpd-tokenizer/src/tokenizer.rs:723— cpd_tokenizer::tokenizer::mark_annotations has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 5 (10 pts), boolean chains 5, match/switch 1 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_tokenizer::javascript::fallback::tokenize (cognitive 26) rust/crates/cpd-tokenizer/src/javascript.rs:22— cpd_tokenizer::javascript::fallback::tokenize has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_tokenizer::generic::tokenize_line_content (cognitive 19) rust/crates/cpd-tokenizer/src/generic.rs:277— cpd_tokenizer::generic::tokenize_line_content has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
cpd_tokenizer::markdown::tokenize_markdown (cognitive 17) rust/crates/cpd-tokenizer/src/markdown.rs:395— cpd_tokenizer::markdown::tokenize_markdown has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_tokenizer::markdown::extract_fences (cognitive 17) rust/crates/cpd-tokenizer/src/markdown.rs:470— cpd_tokenizer::markdown::extract_fences has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_tokenizer::tokenizer::push_token (cognitive 17) rust/crates/cpd-tokenizer/src/tokenizer.rs:192— cpd_tokenizer::tokenizer::push_token has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 4 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
MethodTooLong: Options.from_cli_and_config rust/crates/cpd/src/options.rs:124— MethodTooLong — from_cli_and_config runs 249 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 149 over it, 2.49× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Project.check rust/crates/cpd/src/mcp/project.rs:693— MethodTooLong — check runs 237 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 137 over it, 2.37× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: FilePreparer.prepare rust/crates/cpd-finder/src/orchestrate.rs:543— MethodTooLong — prepare runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SarifReporter.report rust/crates/cpd-reporter/src/sarif.rs:113— MethodTooLong — report runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Dashboard.view rust/crates/cpd-reporter/src/dashboard.rs:230— MethodTooLong — view runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Section.new rust/crates/cpd/src/compare/mod.rs:443— MethodTooLong — new runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Section.console rust/crates/cpd/src/compare/mod.rs:596— MethodTooLong — console runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
R4 · Test Coverage· No test reaches this file · ×7
No test reaches this file rust/scripts/sync-version.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file rust/scripts/npm-prebuilt-package.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file rust/scripts/gen-formats-md.mjs:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file rust/basta/platform-map.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file rust/platform-map.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file rust/basta/run-basta.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file rust/run-cpd.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
jscpd::lsp::project::cli_as_defaults (cyclomatic 46) rust/crates/cpd/src/lsp/project.rs:251— jscpd::lsp::project::cli_as_defaults has cyclomatic complexity 46 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
jscpd::load_options (cyclomatic 32) rust/crates/cpd/src/main.rs:305— jscpd::load_options has cyclomatic complexity 32 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
jscpd::complexity::run (cyclomatic 19) rust/crates/cpd/src/complexity.rs:38— jscpd::complexity::run has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
jscpd::dashboard::run_reporters (cyclomatic 19) rust/crates/cpd/src/dashboard.rs:202— jscpd::dashboard::run_reporters has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
jscpd::run_cli (cyclomatic 19) rust/crates/cpd/src/main.rs:215— jscpd::run_cli has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
cpd_semantic::compare::compare (cyclomatic 24) rust/crates/cpd-semantic/src/compare.rs:204— cpd_semantic::compare::compare has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cpd_semantic::extract::scan_rust_functions (cyclomatic 24) rust/crates/cpd-semantic/src/extract/mod.rs:123— cpd_semantic::extract::scan_rust_functions has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cpd_semantic::extract::skip_rust_literal (cyclomatic 18) rust/crates/cpd-semantic/src/extract/mod.rs:247— cpd_semantic::extract::skip_rust_literal has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
cpd_semantic::extract::script::test_call (cyclomatic 16) rust/crates/cpd-semantic/src/extract/script.rs:317— cpd_semantic::extract::script::test_call has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
cpd_semantic::search::call_pairs (cyclomatic 16) rust/crates/cpd-semantic/src/search.rs:637— cpd_semantic::search::call_pairs has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cpd_similarity::clojure::normalize (cognitive 34) rust/crates/cpd-similarity/src/clojure.rs:140— cpd_similarity::clojure::normalize has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 6 (20 pts), loops 3 (9 pts), if/else 1 (3 pts), boolean chains 2 (nesting depth added 22). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
cpd_similarity::join::pairs (cognitive 26) rust/crates/cpd-similarity/src/join.rs:61— cpd_similarity::join::pairs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 6 (11 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_similarity::clojure::forms (cognitive 22) rust/crates/cpd-similarity/src/clojure.rs:74— cpd_similarity::clojure::forms has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_similarity::syntax::script_wrapper (cognitive 17) rust/crates/cpd-similarity/src/syntax.rs:728— cpd_similarity::syntax::script_wrapper has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 6, loops 2, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_similarity::syntax::name_spaces (cognitive 17) rust/crates/cpd-similarity/src/syntax.rs:971— cpd_similarity::syntax::name_spaces has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
basta::cli::resolve (cyclomatic 22) rust/crates/basta/src/cli.rs:171— basta::cli::resolve has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
basta::rustc::item_end (cyclomatic 21) rust/crates/basta/src/rustc.rs:407— basta::rustc::item_end has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
basta::entry::script_mentions (cyclomatic 18) rust/crates/basta/src/entry.rs:417— basta::entry::script_mentions has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
basta::lang::sfc::scan_expression (cyclomatic 18) rust/crates/basta/src/lang/sfc.rs:650— basta::lang::sfc::scan_expression has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Server::notification (cognitive 46) rust/crates/cpd/src/lsp/server.rs:945— Server::notification has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (38 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 24). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Server::load (cognitive 29) rust/crates/cpd/src/lsp/server.rs:392— Server::load has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 4 (12 pts), loops 6 (9 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Server::job_done (cognitive 27) rust/crates/cpd/src/lsp/server.rs:627— Server::job_done has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 3 (5 pts), loops 1 (3 pts) (nesting depth added 14). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Server::files_changed (cognitive 20) rust/crates/cpd/src/lsp/server.rs:1081— Server::files_changed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_core::detect::detect_in_group (cognitive 35) rust/crates/cpd-core/src/detect.rs:493— cpd_core::detect::detect_in_group has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 4 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_core::detect::add_secondary_clones (cognitive 28) rust/crates/cpd-core/src/detect.rs:1374— cpd_core::detect::add_secondary_clones has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (7 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_core::summary::scan_complexity (cognitive 28) rust/crates/cpd-core/src/summary.rs:591— cpd_core::summary::scan_complexity has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_core::health::validate (cognitive 17) rust/crates/cpd-core/src/health.rs:276— cpd_core::health::validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_finder::walker::ignored_by_files (cognitive 34) rust/crates/cpd-finder/src/walker.rs:394— cpd_finder::walker::ignored_by_files has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_finder::walker::walk_one (cognitive 21) rust/crates/cpd-finder/src/walker.rs:161— cpd_finder::walker::walk_one has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, match/switch 4 (5 pts) (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_finder::blame::blame_file (cognitive 20) rust/crates/cpd-finder/src/blame.rs:8— cpd_finder::blame::blame_file has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_finder::blame::enrich (cognitive 17) rust/crates/cpd-finder/src/blame.rs:65— cpd_finder::blame::enrich has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cpd_reporter::dashboard::render_markdown (cognitive 25) rust/crates/cpd-reporter/src/dashboard.rs:538— cpd_reporter::dashboard::render_markdown has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 7 (9 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (cpd_reporter::dashboard::render_html) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
cpd_reporter::dashboard::render_html (cognitive 25) rust/crates/cpd-reporter/src/dashboard.rs:667— cpd_reporter::dashboard::render_html has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 7 (9 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (cpd_reporter::dashboard::render_markdown) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
cpd_reporter::history_render::render_chart_on (cognitive 16) rust/crates/cpd-reporter/src/history_render.rs:66— cpd_reporter::history_render::render_chart_on has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 3 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
cpd_reporter::history_render::print_table (cognitive 16) rust/crates/cpd-reporter/src/history_render.rs:455— cpd_reporter::history_render::print_table has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (6 pts), if/else 3 (4 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TooManyFields: Cli rust/crates/cpd/src/cli.rs:232— TooManyFields — 83 stored fields beside 1 method. The bar is 30 stored fields; this is 53 over it, 2.77× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: Options rust/crates/cpd/src/options.rs:13— TooManyFields — 68 stored fields beside 1 method. The bar is 30 stored fields; this is 38 over it, 2.27× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: ConfigFile rust/crates/cpd/src/cli.rs:696— TooManyFields — 59 stored fields. The bar is 30 stored fields; this is 29 over it, 1.97× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: MergedConfig rust/crates/cpd/src/main.rs:66— TooManyFields — 53 stored fields beside 1 method. The bar is 30 stored fields; this is 23 over it, 1.77× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
Duplicated block (10 lines × 2) rust/crates/cpd-reporter/src/dashboard.rs:579— rust/crates/cpd-reporter/src/dashboard.rs:579-588 | rust/crates/cpd-reporter/src/dashboard.rs:709-719 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) fixtures/rust/file1.rs:96— fixtures/rust/file1.rs:96-105 | fixtures/rust/file2.rs:96-105 — before extracting anything, compare `fixtures/rust/file1.rs` and `fixtures/rust/file2.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) fixtures/rust/file1.rs:119— fixtures/rust/file1.rs:119-128 | fixtures/rust/file2.rs:119-128 — before extracting anything, compare `fixtures/rust/file1.rs` and `fixtures/rust/file2.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) fixtures/dart/file1.dart:36— fixtures/dart/file1.dart:36-45 | fixtures/dart/file2.dart:36-45 — before extracting anything, compare `fixtures/dart/file1.dart` and `fixtures/dart/file2.dart` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
cpd_core::summary::scan_complexity (cyclomatic 20) rust/crates/cpd-core/src/summary.rs:591— cpd_core::summary::scan_complexity has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cpd_core::health::validate (cyclomatic 17) rust/crates/cpd-core/src/health.rs:276— cpd_core::health::validate has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cpd_core::detect::detect_in_group (cyclomatic 16) rust/crates/cpd-core/src/detect.rs:493— cpd_core::detect::detect_in_group has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Walk::enter_node (cognitive 50) rust/crates/basta/src/lang/javascript.rs:1980— Walk::enter_node has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (33 pts), match/switch 5 (12 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 25). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Walk::visit_expr (cognitive 26) rust/crates/basta/src/lang/python.rs:911— Walk::visit_expr has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (7 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Walk::commonjs_declarator (cognitive 17) rust/crates/basta/src/lang/javascript.rs:2242— Walk::commonjs_declarator has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 4 (7 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Section::console (cognitive 22) rust/crates/cpd/src/compare/mod.rs:596— Section::console has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 5 (7 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Section::new (cognitive 21) rust/crates/cpd/src/compare/mod.rs:443— Section::new has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Section::markdown (cognitive 16) rust/crates/cpd/src/compare/mod.rs:769— Section::markdown has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 3 (6 pts) (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
Duplicated block (9 lines × 2) rust/crates/cpd-reporter/src/xml_reporter.rs:118— rust/crates/cpd-reporter/src/xml_reporter.rs:118-126 | rust/crates/cpd-reporter/src/xml_reporter.rs:133-141 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) fixtures/rust/file1.rs:387— fixtures/rust/file1.rs:387-395 | fixtures/rust/file2.rs:272-280 — before extracting anything, compare `fixtures/rust/file1.rs` and `fixtures/rust/file2.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) fixtures/similarity-demo/languages/shelf.rs:1— fixtures/similarity-demo/languages/shelf.rs:1-9 | fixtures/similarity-demo/languages/stock.rs:1-9 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) rust/crates/cpd/src/cli.rs:1797— rust/crates/cpd/src/cli.rs:1797-1805 | rust/crates/cpd/src/cli.rs:1808-1815 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) rust/crates/cpd-reporter/src/dashboard.rs:544— rust/crates/cpd-reporter/src/dashboard.rs:544-551 | rust/crates/cpd-reporter/src/dashboard.rs:673-680 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) fixtures/file-names-demo/lib/shop/invoice_totals.ex:5— fixtures/file-names-demo/lib/shop/invoice_totals.ex:5-12 | fixtures/file-names-demo/lib/shop/refund_totals.ex:5-12 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) rust/crates/basta/src/lang/javascript.rs:1939— rust/crates/basta/src/lang/javascript.rs:1939-1944 | rust/crates/basta/src/lang/python.rs:493-498 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) fixtures/similarity-demo/test-files/src/coupon.py:2— fixtures/similarity-demo/test-files/src/coupon.py:2-7 | fixtures/similarity-demo/test-files/src/discount.py:2-7 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 2) fixtures/dart/file1.dart:64— fixtures/dart/file1.dart:64-69 | fixtures/dart/file2.dart:64-69 — before extracting anything, compare `fixtures/dart/file1.dart` and `fixtures/dart/file2.dart` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Empty <h1> heading REDACTED:387— An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it's decorative.
Empty <h1> heading REDACTED:397— An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it's decorative.
Walk::enter_node (cyclomatic 41) rust/crates/basta/src/lang/javascript.rs:1980— Walk::enter_node has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Walk::visit_expr (cyclomatic 17) rust/crates/basta/src/lang/python.rs:911— Walk::visit_expr has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Server::notification (cyclomatic 29) rust/crates/cpd/src/lsp/server.rs:945— Server::notification has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Server::load (cyclomatic 17) rust/crates/cpd/src/lsp/server.rs:392— Server::load has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
Reader::next (cyclomatic 23) rust/crates/cpd-similarity/src/clojure.rs:393— Reader::next has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Reader::read (cyclomatic 16) rust/crates/cpd-similarity/src/clojure.rs:320— Reader::read has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
cpd_tokenizer::razor::extract_razor_blocks (cyclomatic 22) rust/crates/cpd-tokenizer/src/razor.rs:18— cpd_tokenizer::razor::extract_razor_blocks has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cpd_tokenizer::tokenizer::mark_annotations (cyclomatic 17) rust/crates/cpd-tokenizer/src/tokenizer.rs:723— cpd_tokenizer::tokenizer::mark_annotations has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
cpd_finder::walker::walk_one (cyclomatic 19) rust/crates/cpd-finder/src/walker.rs:161— cpd_finder::walker::walk_one has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
cpd_finder::walker::ignored_by_files (cyclomatic 17) rust/crates/cpd-finder/src/walker.rs:394— cpd_finder::walker::ignored_by_files has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cpd_similarity::clojure::normalize (cyclomatic 19) rust/crates/cpd-similarity/src/clojure.rs:140— cpd_similarity::clojure::normalize has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
cpd_similarity::syntax::script_wrapper (cyclomatic 17) rust/crates/cpd-similarity/src/syntax.rs:728— cpd_similarity::syntax::script_wrapper has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file's highest cyclomatic complexity: cpd_similarity::syntax::space_of (cyclomatic 22) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
Reader::next (cognitive 28) rust/crates/cpd-similarity/src/clojure.rs:393— Reader::next has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 4 (11 pts), loops 1 (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Reader::read (cognitive 25) rust/crates/cpd-similarity/src/clojure.rs:320— Reader::read has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 3 (11 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Normalizer::assemble (cognitive 18) rust/crates/cpd-similarity/src/syntax.rs:1366— Normalizer::assemble has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (6 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Normalizer::leaf (cognitive 17) rust/crates/cpd-similarity/src/syntax.rs:1276— Normalizer::leaf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
SimilarityIndex::group_edges (cognitive 17) rust/crates/cpd-similarity/src/lib.rs:444— SimilarityIndex::group_edges has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (13 pts), match/switch 2 (3 pts), if/else 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
SimilarityIndex::query_clones (cognitive 16) rust/crates/cpd-similarity/src/lib.rs:579— SimilarityIndex::query_clones has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ClassTooLong: Server rust/crates/cpd/src/lsp/server.rs:130— ClassTooLong — 946 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 43 methods, 2 blocks, lines 130-1641. The bar is 400 significant lines; this is 546 over it, 2.37× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Project rust/crates/cpd/src/mcp/project.rs:392— ClassTooLong — 503 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 23 methods, 2 blocks, lines 392-1150. The bar is 400 significant lines; this is 103 over it, 1.26× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Change coupling: grammars.rs ↔ main.rs rust/crates/cpd-semantic/src/extract/grammars.rs:1— `rust/crates/cpd-semantic/src/extract/grammars.rs` and `rust/crates/cpd/src/main.rs` change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `b2c94496` fix(similarity): review findings; `369a539b` feat(similarity): --similarity-candidates and --similarity-skip-tests; `72c35716` fix(similarity): review findings for the decorators — run `git show` on any of them.
Change coupling: grammars.rs ↔ project.rs rust/crates/cpd-semantic/src/extract/grammars.rs:1— `rust/crates/cpd-semantic/src/extract/grammars.rs` and `rust/crates/cpd/src/mcp/project.rs` change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `b2c94496` fix(similarity): review findings; `369a539b` feat(similarity): --similarity-candidates and --similarity-skip-tests; `0d1d5313` feat(similarity): --similarity-decorators omit|names|full — run `git show` on any of them.
Duplicated block (9 lines × 3) fixtures/type2-demo/consistent/csharp/One.cs:4— fixtures/type2-demo/consistent/csharp/One.cs:4-12 | fixtures/type2-demo/consistent/csharp/Three.cs:4-12 | fixtures/type2-demo/consistent/csharp/Two.cs:4-12 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 3) fixtures/type2-demo/consistent/rust/one.rs:1— fixtures/type2-demo/consistent/rust/one.rs:1-9 | fixtures/type2-demo/consistent/rust/three.rs:1-9 | fixtures/type2-demo/consistent/rust/two.rs:1-9 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Duplicated block (5 lines × 2) fixtures/rust/file1.rs:62— fixtures/rust/file1.rs:62-66 | fixtures/rust/file2.rs:62-66 — before extracting anything, compare `fixtures/rust/file1.rs` and `fixtures/rust/file2.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) fixtures/clike/file1.kt:7— fixtures/clike/file1.kt:7-11 | fixtures/clike/file2.kt:7-11 — before extracting anything, compare `fixtures/clike/file1.kt` and `fixtures/clike/file2.kt` as WHOLE FILES: 90% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) fixtures/rust/file1.rs:78— fixtures/rust/file1.rs:78-84 | fixtures/rust/file2.rs:78-84 — before extracting anything, compare `fixtures/rust/file1.rs` and `fixtures/rust/file2.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) fixtures/similarity-demo/languages/shelf.php:7— fixtures/similarity-demo/languages/shelf.php:7-13 | fixtures/similarity-demo/languages/stock.php:7-13 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (16 lines × 2) fixtures/swift/file1.swift:14— fixtures/swift/file1.swift:14-29 | fixtures/swift/file2.swift:7-27 — before extracting anything, compare `fixtures/swift/file1.swift` and `fixtures/swift/file2.swift` as WHOLE FILES: 83% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) fixtures/dart/file1.dart:47— fixtures/dart/file1.dart:47-62 | fixtures/dart/file2.dart:47-62 — before extracting anything, compare `fixtures/dart/file1.dart` and `fixtures/dart/file2.dart` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Off the main sequence: cpd-core — cpd-core: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 7 project(s), so it's rigid to change.
Off the main sequence: cpd-tokenizer — cpd-tokenizer: abstractness 0.00, instability 0.17, distance 0.83 — zone of pain — concrete and depended on by 5 project(s), so it's rigid to change.
AC3 · Page structure· Page without a main landmark · ×1
Page without a main landmark rust/crates/cpd-reporter/templates/report.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
AC6 · Visual & motion safety· Focus outline removed in CSS without a · ×1
Focus outline removed in CSS without a :focus replacement rust/crates/cpd-reporter/templates/report.html:36— `.toggle-btn:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
AC7 · A11y enforcement· Accessibility enforcement below the top rung · ×1
Accessibility enforcement below the top rung — No accessibility enforcement found — no a11y linter (an accessibility check that can read your UI — no component framework was detected and your pages are rendered by server-side templates, which neither the JSX/Vue ESLint plugins nor the HTML-template linters can parse; run axe/pa11y over the rendered pages, or assert the accessibility invariants over that rendered HTML in the test suite you already have) and no axe/pa11y/Lighthouse in tests or CI. Start by running that check over your rendered pages in CI. What was searched, so you can tell an absence from a miss: the 2 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
Project::check (cyclomatic 40) rust/crates/cpd/src/mcp/project.rs:693— Project::check has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Options::from_cli_and_config (cyclomatic 40) rust/crates/cpd/src/options.rs:124— Options::from_cli_and_config has cyclomatic complexity 40 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
Grammar::units (cyclomatic 27) rust/crates/cpd-similarity/src/syntax.rs:104— Grammar::units has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
FilePreparer::prepare (cyclomatic 26) rust/crates/cpd-finder/src/orchestrate.rs:543— FilePreparer::prepare has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
REDACTED.buildView (cyclomatic 26) REDACTED:654— REDACTED.buildView has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
REDACTED.renderTable (cyclomatic 26) REDACTED:1716— REDACTED.renderTable has cyclomatic complexity 26 (threshold 15). Of this number, 22 points are the body's own statements and 4 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
REDACTED.layout (cyclomatic 24) REDACTED:737— REDACTED.layout has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Graph::symbol_reachability (cyclomatic 23) rust/crates/basta/src/graph.rs:338— Graph::symbol_reachability has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
REDACTED.drawLabels (cyclomatic 21) REDACTED:1019— REDACTED.drawLabels has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SarifReporter::report (cyclomatic 19) rust/crates/cpd-reporter/src/sarif.rs:113— SarifReporter::report has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
REDACTED.renderFolders (cyclomatic 17) REDACTED:1596— REDACTED.renderFolders has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Section::console (cyclomatic 16) rust/crates/cpd/src/compare/mod.rs:596— Section::console has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
cpd_reporter::history_render::print_table (cyclomatic 16) rust/crates/cpd-reporter/src/history_render.rs:455— cpd_reporter::history_render::print_table has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Cached::embed (cyclomatic 16) rust/crates/cpd-semantic/src/embed/mod.rs:397— Cached::embed has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Project::check (cognitive 53) rust/crates/cpd/src/mcp/project.rs:693— Project::check has cognitive complexity 53 (threshold 15). Drivers by points: match/switch 14 (23 pts), loops 5 (13 pts), if/else 8 (9 pts), boolean chains 8 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FilePreparer::prepare (cognitive 49) rust/crates/cpd-finder/src/orchestrate.rs:543— FilePreparer::prepare has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 3 (7 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.buildView (cognitive 47) REDACTED:654— REDACTED.buildView has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 7 (10 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.layout (cognitive 47) REDACTED:737— REDACTED.layout has cognitive complexity 47 (threshold 15). Drivers by points: loops 11 (21 pts), if/else 3 (15 pts), ternaries 4 (7 pts), boolean chains 4 (nesting depth added 25). Of this number, 44 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Options::from_cli_and_config (cognitive 45) rust/crates/cpd/src/options.rs:124— Options::from_cli_and_config has cognitive complexity 45 (threshold 15). Drivers by points: boolean chains 23, if/else 18, match/switch 4. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Graph::symbol_reachability (cognitive 33) rust/crates/basta/src/graph.rs:338— Graph::symbol_reachability has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 8 (12 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.renderTable (cognitive 32) REDACTED:1716— REDACTED.renderTable has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 6 (10 pts), boolean chains 3, loops 3 (nesting depth added 12). Of this number, 27 points are the body's own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.drawLabels (cognitive 28) REDACTED:1019— REDACTED.drawLabels has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 3 (7 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 12). Of this number, 26 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.tipLines (cognitive 26) REDACTED:1106— REDACTED.tipLines has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 4 (8 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). Of this number, 25 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.renderFolders (cognitive 26) REDACTED:1596— REDACTED.renderFolders has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 13). Of this number, 25 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SarifReporter::report (cognitive 24) rust/crates/cpd-reporter/src/sarif.rs:113— SarifReporter::report has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Cached::embed (cognitive 22) rust/crates/cpd-semantic/src/embed/mod.rs:397— Cached::embed has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Grammar::units (cognitive 20) rust/crates/cpd-similarity/src/syntax.rs:104— Grammar::units has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (8 pts), match/switch 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Checker::find_rewrites (cognitive 19) rust/crates/cpd/src/boundaries/check.rs:234— Checker::find_rewrites has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (9 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Framework::root (cognitive 18) rust/crates/basta/src/framework.rs:389— Framework::root has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 5 (6 pts), match/switch 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TreeSitterExtractor::extract (cognitive 16) rust/crates/cpd-semantic/src/extract/grammars.rs:162— TreeSitterExtractor::extract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.table (cognitive 16) REDACTED:1458— REDACTED.table has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 5 function items inside it that branch (fill, a function literal at line 1499, a function literal at line 1474, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
TooManyMethods: Server rust/crates/cpd/src/lsp/server.rs:130— TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D30 · Dependency Vulnerabilities· Medium vulnerability · ×1
Change-coupling hub: cli.rs → orchestrate.rs, reporter.rs, shared.rs, grammars.rs, project.rs, tests.rs, tools.rs rust/crates/cpd/src/cli.rs— `rust/crates/cpd/src/cli.rs` changes together with 7 other files — `rust/crates/cpd-finder/src/orchestrate.rs`, `rust/crates/cpd-reporter/src/reporter.rs`, `rust/crates/cpd-reporter/src/shared.rs`, `rust/crates/cpd-semantic/src/extract/grammars.rs`, `rust/crates/cpd/src/mcp/project.rs`, `rust/crates/cpd/src/mcp/tests.rs`, `rust/crates/cpd/src/mcp/tools.rs` — none of which declares a dependency on it: one file is the hub of 7 separate couplings, not 7 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 7.
Near-duplicate member pair (35 shared lines) rust/crates/cpd-reporter/src/dashboard.rs:538— rust/crates/cpd-reporter/src/dashboard.rs:538-663 | rust/crates/cpd-reporter/src/dashboard.rs:667-803 — These two members are variants of one another: 35 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Duplicated block (23–27 lines × 2) rust/crates/basta/src/analyze.rs:307— rust/crates/basta/src/analyze.rs:307-333 | rust/crates/basta/src/rustc.rs:149-171 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 2) rust/crates/cpd-reporter/src/dashboard.rs:628— rust/crates/cpd-reporter/src/dashboard.rs:628-638 | rust/crates/cpd-reporter/src/dashboard.rs:762-772 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7–8 lines × 2) rust/crates/cpd-reporter/src/health_render.rs:241— rust/crates/cpd-reporter/src/health_render.rs:241-247 | rust/crates/cpd-reporter/src/health_render.rs:301-308 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6–7 lines × 2) rust/crates/cpd-reporter/src/dashboard.rs:643— rust/crates/cpd-reporter/src/dashboard.rs:643-648 | rust/crates/cpd-reporter/src/dashboard.rs:778-784 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (117 lines × 2) fixtures/clike/file1.cs:55— fixtures/clike/file1.cs:55-181 | fixtures/clike/file2.cs:55-171 — before extracting anything, compare `fixtures/clike/file1.cs` and `fixtures/clike/file2.cs` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (28 lines × 2) fixtures/razor/component1.razor:67— fixtures/razor/component1.razor:67-94 | fixtures/razor/component2.razor:67-94 — before extracting anything, compare `fixtures/razor/component1.razor` and `fixtures/razor/component2.razor` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) fixtures/clike/file1.kt:41— fixtures/clike/file1.kt:41-53 | fixtures/clike/file2.kt:41-53 — before extracting anything, compare `fixtures/clike/file1.kt` and `fixtures/clike/file2.kt` as WHOLE FILES: 90% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (220 lines × 2) fixtures/clike/file1.java:1— fixtures/clike/file1.java:1-220 | fixtures/clike/file2.java:1-232 — before extracting anything, compare `fixtures/clike/file1.java` and `fixtures/clike/file2.java` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `fixtures/clike/file1.java:1` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 2) fixtures/type2-demo/annotations/AlphaService.java:1— fixtures/type2-demo/annotations/AlphaService.java:1-14 | fixtures/type2-demo/annotations/BetaService.java:1-14 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `fixtures/type2-demo/annotations/AlphaService.java:1` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 3) fixtures/type2-demo/consistent/java/One.java:1— fixtures/type2-demo/consistent/java/One.java:1-10 | fixtures/type2-demo/consistent/java/Three.java:1-10 | fixtures/type2-demo/consistent/java/Two.java:1-10 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `fixtures/type2-demo/consistent/java/One.java:1` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (26 lines × 2) fixtures/crlf-demo/checkout_eu.py:5— fixtures/crlf-demo/checkout_eu.py:5-30 | fixtures/crlf-demo/checkout_us.py:5-30 — before extracting anything, compare `fixtures/crlf-demo/checkout_eu.py` and `fixtures/crlf-demo/checkout_us.py` as WHOLE FILES: 95% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (20 lines × 2) fixtures/python/file1.py:5— fixtures/python/file1.py:5-24 | fixtures/python/file2.py:5-27 — before extracting anything, compare `fixtures/python/file1.py` and `fixtures/python/file2.py` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 3) fixtures/type2-demo/consistent/python/one.py:2— fixtures/type2-demo/consistent/python/one.py:2-8 | fixtures/type2-demo/consistent/python/three.py:2-8 | fixtures/type2-demo/consistent/python/two.py:2-8 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (27 lines × 2) fixtures/dart/file1.dart:121— fixtures/dart/file1.dart:121-147 | fixtures/dart/file2.dart:91-117 — before extracting anything, compare `fixtures/dart/file1.dart` and `fixtures/dart/file2.dart` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (19 lines × 2) fixtures/dart/file1.dart:71— fixtures/dart/file1.dart:71-89 | fixtures/dart/file2.dart:71-89 — before extracting anything, compare `fixtures/dart/file1.dart` and `fixtures/dart/file2.dart` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Coverage not measured — JavaScript/TypeScript suite — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — fixtures/dead-code-demo/frameworks/detected/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.
No DR/backup evidence — A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced — a volume that survives a container recreate is not a tested restore from catastrophic loss.
Wholesale file copy (69 identical lines × 3 files) rust/basta/platform-map.js:3— rust/basta/platform-map.js:3 · rust/jscpd/platform-map.js:3 · rust/platform-map.js:3 — these 3 files are line-for-line copies of one another — 69 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
Duplicated block (45 lines × 2 locations) rust/basta/run-basta.js:25— rust/basta/run-basta.js:25 · rust/run-cpd.js:25 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (20 lines × 2 locations) rust/basta/run-basta.js:25— rust/basta/run-basta.js:25 · rust/jscpd/index.js:36 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (19 lines × 2 locations) rust/scripts/sync-version.mjs:105— rust/scripts/sync-version.mjs:105 · rust/scripts/sync-version.mjs:137 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (9 lines × 3 locations) rust/basta/run-basta.js:66— rust/basta/run-basta.js:66 · rust/jscpd/run-jscpd.js:21 · rust/run-cpd.js:65 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (7 lines × 2 locations) rust/scripts/sync-version.mjs:232— rust/scripts/sync-version.mjs:232 · rust/scripts/sync-version.mjs:239 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R6 · Tooling· The declared test suite includes a file that cannot be loaded · ×1
The declared test suite includes a file that cannot be loaded fixtures/dead-code-demo/bundler/vite.config.js:7— This repository declares test tooling, and the ✓ above records that declaration — but fixtures/dead-code-demo/bundler/vite.config.js and 8 other test file(s) in this workspace cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) — each one is reported with its failing import under Test Coverage — then the declared script exercises what it claims to.
Minor — 25 finding(s)
R7 · Dead Code· Unused module-local declaration 'utf8_encode' · ×6
Unused module-local declaration 'utf8_encode' fixtures/folder1/file_1.js:4— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Unused module-local declaration 'utf8_encode' fixtures/ignore/file_1.js:5— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Unused module-local declaration 'utf8_encode' fixtures/javascript/file_1.cjs:4— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Unused module-local declaration 'utf8_encode' fixtures/javascript/file_1.js:4— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Unused module-local declaration 'utf8_encode' fixtures/javascript/file_1.mjs:4— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Unused module-local declaration 'utf8_encode' fixtures/javascript/file_3.js:1— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Duplicated predicate rust/basta/platform-map.js:74— `process.report && typeof process.report.getReport === "function"` appears character-identically in 3 files — rust/basta/platform-map.js, rust/jscpd/platform-map.js, rust/platform-map.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate rust/basta/platform-map.js:77— `report && report.header && report.header.glibcVersionRuntime` appears character-identically in 3 files — rust/basta/platform-map.js, rust/jscpd/platform-map.js, rust/platform-map.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate rust/basta/platform-map.js:87— `target.os !== platform || target.cpu !== arch` appears character-identically in 3 files — rust/basta/platform-map.js, rust/jscpd/platform-map.js, rust/platform-map.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate rust/basta/platform-map.js:90— `target.os === "linux" && target.libc !== libc` appears character-identically in 3 files — rust/basta/platform-map.js, rust/jscpd/platform-map.js, rust/platform-map.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate rust/crates/basta/src/lang/javascript.rs:1634— `c.is_alphanumeric() || c == '_' || c == '$'` appears character-identically in 2 files — rust/crates/basta/src/lang/javascript.rs, rust/crates/cpd-tokenizer/src/javascript.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate rust/crates/cpd/src/boundaries/check.rs:164— `opts.ignore_identifiers || opts.ignore_literals || opts.ignore_annotations` appears character-identically in 2 files — rust/crates/cpd/src/boundaries/check.rs, rust/crates/cpd/src/main.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Silent fallback default on Err rust/crates/basta/src/lang/javascript.rs:181— `manifest_entries` turns every `Err` into `Vec::new()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err rust/crates/basta/src/lang/javascript.rs:490— `workspace_aliases` turns every `Err` into `Vec::new()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err rust/crates/basta/src/lang/javascript.rs:935— `tsconfig_aliases` turns every `Err` into `Vec::new()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err rust/crates/cpd-semantic/src/extract/python.rs:39— `extract` turns every `Err` into `Vec::new()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err rust/crates/cpd-semantic/src/embed/cache.rs:142— `load` turns every `Err` into `Cache::default()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 65 significant file(s) lose their only recent owner: rust/crates/basta/src/lang/javascript.rs, rust/crates/cpd/src/cli.rs, rust/crates/cpd-core/src/detect.rs, rust/crates/cpd-semantic/src/search.rs, rust/crates/basta/src/lang/python.rs, rust/crates/cpd/src/main.rs, rust/crates/cpd-core/src/summary.rs, rust/crates/basta/src/framework.rs (+57 more). Pair on, review, or document these before any departure.
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
Logging is not universal — Only 6/13 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `fixtures/dead-code-demo/frameworks/detected`, `fixtures/dead-code-demo/python`, `rust`, `rust/basta` and 2 more.
R7 · Dead Code· Unused module-local declaration 'pendingLabel' · ×1
Unused module-local declaration 'pendingLabel' fixtures/dead-code-demo/components/src/App.vue:10— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code· Unused module-local declaration 'propTypes' · ×1
Unused module-local declaration 'propTypes' fixtures/jsx/file2.tsx:9— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Nullable reference types not enabled everywhere — 0/9 C# file(s) are in a nullable-enabled context. This repository commits no project file, so nothing sets <Nullable>enable</Nullable> for it: a file is enabled only by its own `#nullable enable`, by a Unity `csc.rsp` with `-nullable:enable` for its assembly, or as a file-based app (`#:` directives) whose `#:property Nullable` does not turn it off. NRTs catch a whole class of null-deref bugs at compile time.
Outdated: globset — `globset` is locked at 0.4.20 but 0.4.21 is the current stable release on crates.io, and it already satisfies the `"0.4"` requirement declared in rust/crates/basta/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p globset` and commit the updated REDACTED.
Outdated: ignore — `ignore` is locked at 0.4.33 but 0.4.34 is the current stable release on crates.io, and it already satisfies the `"0.4"` requirement declared in rust/crates/basta/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p ignore` and commit the updated REDACTED.
Outdated: memmap2 — `memmap2` is locked at 0.9.11 but 0.9.12 is the current stable release on crates.io, and it already satisfies the `"0.9"` requirement declared in rust/crates/cpd-finder/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p memmap2` and commit the updated REDACTED.
Outdated: ureq — `ureq` is locked at 3.4.2 but 3.5.0 is the current stable release on crates.io, and it already satisfies the `"3"` requirement declared in rust/crates/cpd-semantic/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p ureq` and commit the updated REDACTED.
Skipped (documented): a platform package without its binary: ENOENT in result.error, the command exits 1 rust/jscpd/test/run-jscpd.test.js:79— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
Run 01a17ec1-d2ad-7f68-a2b4-bd49c10c3560 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 29 · Warnings: 301 · Recommendations: 25 · Info: 5 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 27-10-2026 @ 19:06 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.