Public report of fallow-rs/fallow, published 28 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). Watchdog 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, 28 October 2026, 13:05 UTC · Survey ID cd_232b662554ce40ad908ca2cc13c90d0b
fallow-rs/fallow
Measured 28 October 2026, 12:51 UTC, at code version 1f4050a
No regression since the last survey
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.
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
Up 1 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 very large codebase: 815,410 lines of product code in 28 projects, tests not counted · Estimated rebuild effort: about 8.9 person-years · Weakest lens: Accessibility, 42
Findings by how serious they are
78 critical2002 serious177 minor
10 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
28 October 2026, 12:51 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 ▸
84of 84 dimensions measured by tools.
2225of 2257 findings point to an exact file and line, so you can open each one in the code. The other 32 concern the repository as a whole, such as missing documentation.
84dimensions across 8 lenses, read from 815,410 lines of product code in 28 projects.
fallow-rs/fallow falls short of our standard for production, held back most by its Accessibility lens, the interface's usability with a keyboard or assistive technology. It scores 54 out of 100 and is rated Adequate, and 72 of its 78 critical findings are security problems.
Accessibility, at 42, is the weakest lens and counts most in the score. The best first step is fixing focus, motion and contrast, worth about 10 points. Automating accessibility checks comes next, worth about 8 points. Raising Accessibility to 70 would lift the score to about 63.
Sixty passwords or keys in the code's history and seven in the code are open to anyone who can read the repository. Three settings leave the servers or containers unsafe, and two parts of the code are no longer understood by anyone working on it. Replacing each exposed password or key, correcting the unsafe settings and having someone learn the forgotten files would close these risks. Setting a waiting period for automatic updates would fix the automatic dependency update that takes a new release at once, and updating the vulnerable packages would deal with the package with a known security hole. The loop of files that import each other needs breaking.
The product code is 815,410 lines, about €1,300,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.
If Accessibility rose from 42 to 70, the lowest score rated Strong, the score would rise from 54 to about 63.
Code composition: what the lines of code are
Product code 74%Tests 26%
New since the last survey: 367 findings
These 367 critical or serious findings weren't in the previous survey, on 14 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.
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: 242 findings
These 242 critical or serious findings were in the previous survey, on 14 October 2026, and are gone from this one. The first 100 are listed here.
€430,000 to €2,200,000, for 7,183 to 22,789 hours of work, about 8.9 person-years for 5 to 17 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 54. 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
Very large: 815,410 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. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
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.
Enforce accessibility in the toolchain you already use: add `jsx-a11y` to the `plugins` array in your oxlint config (its a11y rules are off until the plugin is listed), then assert with vitest-axe in tests, then gate axe/pa11y/Lighthouse in CI.
Raises the score by about 8 points · Medium effort · A11y enforcement
3
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 2 points · Low effort · ADR Quality
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 €1,300,000 to build again, about 8.9 person-years of work. Its weakest lens is Accessibility, at 42 (Weak). Accessibility is about whether the interface is built so that everyone can use it, including people who can't see the screen or can't use a mouse. Because the weakest lens counts most in the score, work on Accessibility also moves the score most.
Based on: the rebuild estimate · the Accessibility grade · how much each lens counts
What to do: Start with the Accessibility actions in Top priorities.
If you do one thing first · First action
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. Of all the actions in this report, it raises the score most for the work it takes: about 10 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.
1213 modules, with 3190 dependencies between them. 5 loops run through 175 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 1173 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.
fallow_config.config.parsing uses fallow_config.config.rules, so a change to fallow_config.config.rules can break fallow_config.config.parsing, while a change to fallow_config.config.parsing can't break fallow_config.config.rules.
Position
Below the diagonal: fallow_config.config.parsing uses a module listed above it, which is the healthy direction.
fallow_types.extract uses fallow_types.discover, so a change to fallow_types.discover can break fallow_types.extract, while a change to fallow_types.extract can't break fallow_types.discover.
Position
Below the diagonal: fallow_types.extract uses a module listed above it, which is the healthy direction.
15→16 fallow_types.semantic uses fallow_config.configpart of a loop✕
Connections
1 pair of types, where a type in fallow_types.semantic uses a type in fallow_config.config.
fallow_types.semantic uses fallow_config.config, so a change to fallow_config.config can break fallow_types.semantic, while a change to fallow_types.semantic can't break fallow_config.config.
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.
fallow_config.config uses fallow_cli.cli_args, so a change to fallow_cli.cli_args can break fallow_config.config, while a change to fallow_config.config can't break fallow_cli.cli_args.
Position
Below the diagonal: fallow_config.config uses a module listed above it, which is the healthy direction.
fallow_config.config uses fallow_cli.migrate, so a change to fallow_cli.migrate can break fallow_config.config, while a change to fallow_config.config can't break fallow_cli.migrate.
Position
Below the diagonal: fallow_config.config uses a module listed above it, which is the healthy direction.
fallow_config.config uses fallow_config.config.rules, so a change to fallow_config.config.rules can break fallow_config.config, while a change to fallow_config.config can't break fallow_config.config.rules.
Position
Below the diagonal: fallow_config.config uses a module listed above it, which is the healthy direction.
fallow_config.config uses fallow_config.external_plugin, so a change to fallow_config.external_plugin can break fallow_config.config, while a change to fallow_config.config can't break fallow_config.external_plugin.
Position
Below the diagonal: fallow_config.config uses a module listed above it, which is the healthy direction.
fallow_config.config uses fallow_config.config.parsing, so a change to fallow_config.config.parsing can break fallow_config.config, while a change to fallow_config.config can't break fallow_config.config.parsing.
Position
Below the diagonal: fallow_config.config uses a module listed above it, which is the healthy direction.
fallow_config.config uses fallow_types.semantic, so a change to fallow_types.semantic can break fallow_config.config, while a change to fallow_config.config can't break fallow_types.semantic.
Position
Below the diagonal: fallow_config.config uses a module listed above it, which is the healthy direction.
fallow_core.plugins.registry uses fallow_config.external_plugin, so a change to fallow_config.external_plugin can break fallow_core.plugins.registry, while a change to fallow_core.plugins.registry can't break fallow_config.external_plugin.
Position
Below the diagonal: fallow_core.plugins.registry uses a module listed above it, which is the healthy direction.
fallow_core.plugins.registry uses fallow_config.workspace.package_json, so a change to fallow_config.workspace.package_json can break fallow_core.plugins.registry, while a change to fallow_core.plugins.registry can't break fallow_config.workspace.package_json.
Position
Below the diagonal: fallow_core.plugins.registry uses a module listed above it, which is the healthy direction.
fallow_core.plugins.registry uses fallow_types.semantic, so a change to fallow_types.semantic can break fallow_core.plugins.registry, while a change to fallow_core.plugins.registry can't break fallow_types.semantic.
Position
Below the diagonal: fallow_core.plugins.registry uses a module listed above it, which is the healthy direction.
17→26 fallow_core.plugins.registry uses fallow_core.pluginspart of a loop✕
Connections
4 pairs of types, where a type in fallow_core.plugins.registry uses a type in fallow_core.plugins.
fallow_core.plugins.registry uses fallow_core.plugins, so a change to fallow_core.plugins can break fallow_core.plugins.registry, while a change to fallow_core.plugins.registry can't break fallow_core.plugins.
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.
fallow_extract.visitor uses fallow_types.discover, so a change to fallow_types.discover can break fallow_extract.visitor, while a change to fallow_extract.visitor can't break fallow_types.discover.
Position
Below the diagonal: fallow_extract.visitor uses a module listed above it, which is the healthy direction.
49 pairs of types, where a type in fallow_extract.visitor uses a type in fallow_types.extract. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
fallow_extract.visitor uses fallow_types.extract, so a change to fallow_types.extract can break fallow_extract.visitor, while a change to fallow_extract.visitor can't break fallow_types.extract.
Position
Below the diagonal: fallow_extract.visitor uses a module listed above it, which is the healthy direction.
fallow_graph.graph.types uses fallow_types.discover, so a change to fallow_types.discover can break fallow_graph.graph.types, while a change to fallow_graph.graph.types can't break fallow_types.discover.
Position
Below the diagonal: fallow_graph.graph.types uses a module listed above it, which is the healthy direction.
fallow_graph.graph.types uses fallow_types.extract, so a change to fallow_types.extract can break fallow_graph.graph.types, while a change to fallow_graph.graph.types can't break fallow_types.extract.
Position
Below the diagonal: fallow_graph.graph.types uses a module listed above it, which is the healthy direction.
fallow_graph.resolve.types uses fallow_config.workspace.package_json, so a change to fallow_config.workspace.package_json can break fallow_graph.resolve.types, while a change to fallow_graph.resolve.types can't break fallow_config.workspace.package_json.
Position
Below the diagonal: fallow_graph.resolve.types uses a module listed above it, which is the healthy direction.
fallow_graph.resolve.types uses fallow_types.discover, so a change to fallow_types.discover can break fallow_graph.resolve.types, while a change to fallow_graph.resolve.types can't break fallow_types.discover.
Position
Below the diagonal: fallow_graph.resolve.types uses a module listed above it, which is the healthy direction.
fallow_graph.resolve.types uses fallow_types.extract, so a change to fallow_types.extract can break fallow_graph.resolve.types, while a change to fallow_graph.resolve.types can't break fallow_types.extract.
Position
Below the diagonal: fallow_graph.resolve.types uses a module listed above it, which is the healthy direction.
fallow_types.envelope uses fallow_types.semantic, so a change to fallow_types.semantic can break fallow_types.envelope, while a change to fallow_types.envelope can't break fallow_types.semantic.
Position
Below the diagonal: fallow_types.envelope uses a module listed above it, which is the healthy direction.
fallow_types.results uses fallow_config.config.rules, so a change to fallow_config.config.rules can break fallow_types.results, while a change to fallow_types.results can't break fallow_config.config.rules.
Position
Below the diagonal: fallow_types.results uses a module listed above it, which is the healthy direction.
fallow_types.results uses fallow_types.extract, so a change to fallow_types.extract can break fallow_types.results, while a change to fallow_types.results can't break fallow_types.extract.
Position
Below the diagonal: fallow_types.results uses a module listed above it, which is the healthy direction.
fallow_types.results uses fallow_types.semantic, so a change to fallow_types.semantic can break fallow_types.results, while a change to fallow_types.results can't break fallow_types.semantic.
Position
Below the diagonal: fallow_types.results uses a module listed above it, which is the healthy direction.
22→24 fallow_types.results uses fallow_types.output_dead_codepart of a loop✕
Connections
105 pairs of types, where a type in fallow_types.results uses a type in fallow_types.output_dead_code. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
fallow_types.results uses fallow_types.output_dead_code, so a change to fallow_types.output_dead_code can break fallow_types.results, while a change to fallow_types.results can't break fallow_types.output_dead_code.
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.
fallow_graph.graph uses fallow_types.discover, so a change to fallow_types.discover can break fallow_graph.graph, while a change to fallow_graph.graph can't break fallow_types.discover.
Position
Below the diagonal: fallow_graph.graph uses a module listed above it, which is the healthy direction.
fallow_graph.graph uses fallow_types.extract, so a change to fallow_types.extract can break fallow_graph.graph, while a change to fallow_graph.graph can't break fallow_types.extract.
Position
Below the diagonal: fallow_graph.graph uses a module listed above it, which is the healthy direction.
fallow_graph.graph uses fallow_graph.graph.types, so a change to fallow_graph.graph.types can break fallow_graph.graph, while a change to fallow_graph.graph can't break fallow_graph.graph.types.
Position
Below the diagonal: fallow_graph.graph uses a module listed above it, which is the healthy direction.
23→28 fallow_graph.graph uses fallow_engine.module_graphpart of a loop✕
Connections
6 pairs of types, where a type in fallow_graph.graph uses a type in fallow_engine.module_graph.
fallow_graph.graph uses fallow_engine.module_graph, so a change to fallow_engine.module_graph can break fallow_graph.graph, while a change to fallow_graph.graph can't break fallow_engine.module_graph.
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.
50 pairs of types, where a type in fallow_types.output_dead_code uses a type in fallow_config.config.rules. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
fallow_types.output_dead_code uses fallow_config.config.rules, so a change to fallow_config.config.rules can break fallow_types.output_dead_code, while a change to fallow_types.output_dead_code can't break fallow_config.config.rules.
Position
Below the diagonal: fallow_types.output_dead_code uses a module listed above it, which is the healthy direction.
fallow_types.output_dead_code uses fallow_types.semantic, so a change to fallow_types.semantic can break fallow_types.output_dead_code, while a change to fallow_types.output_dead_code can't break fallow_types.semantic.
Position
Below the diagonal: fallow_types.output_dead_code uses a module listed above it, which is the healthy direction.
50 pairs of types, where a type in fallow_types.output_dead_code uses a type in fallow_types.envelope. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
fallow_types.output_dead_code uses fallow_types.envelope, so a change to fallow_types.envelope can break fallow_types.output_dead_code, while a change to fallow_types.output_dead_code can't break fallow_types.envelope.
Position
Below the diagonal: fallow_types.output_dead_code uses a module listed above it, which is the healthy direction.
84 pairs of types, where a type in fallow_types.output_dead_code uses a type in fallow_types.results. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
fallow_types.output_dead_code uses fallow_types.results, so a change to fallow_types.results can break fallow_types.output_dead_code, while a change to fallow_types.output_dead_code can't break fallow_types.results.
Position
Below the diagonal: fallow_types.output_dead_code uses a module listed above it, which is the healthy direction.
fallow_types.trace uses fallow_types.duplicates, so a change to fallow_types.duplicates can break fallow_types.trace, while a change to fallow_types.trace can't break fallow_types.duplicates.
Position
Below the diagonal: fallow_types.trace uses a module listed above it, which is the healthy direction.
fallow_types.trace uses fallow_types.semantic, so a change to fallow_types.semantic can break fallow_types.trace, while a change to fallow_types.trace can't break fallow_types.semantic.
Position
Below the diagonal: fallow_types.trace uses a module listed above it, which is the healthy direction.
fallow_types.trace uses fallow_types.results, so a change to fallow_types.results can break fallow_types.trace, while a change to fallow_types.trace can't break fallow_types.results.
Position
Below the diagonal: fallow_types.trace uses a module listed above it, which is the healthy direction.
fallow_core.plugins uses fallow_config.external_plugin, so a change to fallow_config.external_plugin can break fallow_core.plugins, while a change to fallow_core.plugins can't break fallow_config.external_plugin.
Position
Below the diagonal: fallow_core.plugins uses a module listed above it, which is the healthy direction.
fallow_core.plugins uses fallow_config.workspace.package_json, so a change to fallow_config.workspace.package_json can break fallow_core.plugins, while a change to fallow_core.plugins can't break fallow_config.workspace.package_json.
Position
Below the diagonal: fallow_core.plugins uses a module listed above it, which is the healthy direction.
fallow_core.plugins uses fallow_types.workspace, so a change to fallow_types.workspace can break fallow_core.plugins, while a change to fallow_core.plugins can't break fallow_types.workspace.
Position
Below the diagonal: fallow_core.plugins uses a module listed above it, which is the healthy direction.
fallow_core.plugins uses fallow_types.semantic, so a change to fallow_types.semantic can break fallow_core.plugins, while a change to fallow_core.plugins can't break fallow_types.semantic.
Position
Below the diagonal: fallow_core.plugins uses a module listed above it, which is the healthy direction.
fallow_core.plugins uses fallow_core.plugins.registry, so a change to fallow_core.plugins.registry can break fallow_core.plugins, while a change to fallow_core.plugins can't break fallow_core.plugins.registry.
Position
Below the diagonal: fallow_core.plugins uses a module listed above it, which is the healthy direction.
fallow_core.plugins uses fallow_types.trace, so a change to fallow_types.trace can break fallow_core.plugins, while a change to fallow_core.plugins can't break fallow_types.trace.
Position
Below the diagonal: fallow_core.plugins uses a module listed above it, which is the healthy direction.
fallow_core.suppress uses fallow_config.config.rules, so a change to fallow_config.config.rules can break fallow_core.suppress, while a change to fallow_core.suppress can't break fallow_config.config.rules.
Position
Below the diagonal: fallow_core.suppress uses a module listed above it, which is the healthy direction.
fallow_core.suppress uses fallow_types.discover, so a change to fallow_types.discover can break fallow_core.suppress, while a change to fallow_core.suppress can't break fallow_types.discover.
Position
Below the diagonal: fallow_core.suppress uses a module listed above it, which is the healthy direction.
fallow_core.suppress uses fallow_config.config.parsing, so a change to fallow_config.config.parsing can break fallow_core.suppress, while a change to fallow_core.suppress can't break fallow_config.config.parsing.
Position
Below the diagonal: fallow_core.suppress uses a module listed above it, which is the healthy direction.
fallow_core.suppress uses fallow_types.results, so a change to fallow_types.results can break fallow_core.suppress, while a change to fallow_core.suppress can't break fallow_types.results.
Position
Below the diagonal: fallow_core.suppress uses a module listed above it, which is the healthy direction.
fallow_core.suppress uses fallow_graph.graph, so a change to fallow_graph.graph can break fallow_core.suppress, while a change to fallow_core.suppress can't break fallow_graph.graph.
Position
Below the diagonal: fallow_core.suppress uses a module listed above it, which is the healthy direction.
fallow_engine.module_graph uses fallow_types.discover, so a change to fallow_types.discover can break fallow_engine.module_graph, while a change to fallow_engine.module_graph can't break fallow_types.discover.
Position
Below the diagonal: fallow_engine.module_graph uses a module listed above it, which is the healthy direction.
fallow_engine.module_graph uses fallow_graph.graph.types, so a change to fallow_graph.graph.types can break fallow_engine.module_graph, while a change to fallow_engine.module_graph can't break fallow_graph.graph.types.
Position
Below the diagonal: fallow_engine.module_graph uses a module listed above it, which is the healthy direction.
fallow_engine.module_graph uses fallow_graph.graph, so a change to fallow_graph.graph can break fallow_engine.module_graph, while a change to fallow_engine.module_graph can't break fallow_graph.graph.
Position
Below the diagonal: fallow_engine.module_graph uses a module listed above it, which is the healthy direction.
fallow_output.health_scores uses fallow_types.output_dead_code, so a change to fallow_types.output_dead_code can break fallow_output.health_scores, while a change to fallow_output.health_scores can't break fallow_types.output_dead_code.
Position
Below the diagonal: fallow_output.health_scores uses a module listed above it, which is the healthy direction.
29→31 fallow_output.health_scores uses fallow_engine.baselinepart of a loop✕
Connections
1 pair of types, where a type in fallow_output.health_scores uses a type in fallow_engine.baseline.
fallow_output.health_scores uses fallow_engine.baseline, so a change to fallow_engine.baseline can break fallow_output.health_scores, while a change to fallow_output.health_scores can't break fallow_engine.baseline.
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.
fallow_core uses fallow_config.external_plugin, so a change to fallow_config.external_plugin can break fallow_core, while a change to fallow_core can't break fallow_config.external_plugin.
Position
Below the diagonal: fallow_core uses a module listed above it, which is the healthy direction.
fallow_core uses fallow_config.workspace.package_json, so a change to fallow_config.workspace.package_json can break fallow_core, while a change to fallow_core can't break fallow_config.workspace.package_json.
Position
Below the diagonal: fallow_core uses a module listed above it, which is the healthy direction.
fallow_core uses fallow_types.discover, so a change to fallow_types.discover can break fallow_core, while a change to fallow_core can't break fallow_types.discover.
Position
Below the diagonal: fallow_core uses a module listed above it, which is the healthy direction.
fallow_core uses fallow_config.config.parsing, so a change to fallow_config.config.parsing can break fallow_core, while a change to fallow_core can't break fallow_config.config.parsing.
Position
Below the diagonal: fallow_core uses a module listed above it, which is the healthy direction.
fallow_core uses fallow_types.extract, so a change to fallow_types.extract can break fallow_core, while a change to fallow_core can't break fallow_types.extract.
Position
Below the diagonal: fallow_core uses a module listed above it, which is the healthy direction.
fallow_core uses fallow_config.config, so a change to fallow_config.config can break fallow_core, while a change to fallow_core can't break fallow_config.config.
Position
Below the diagonal: fallow_core uses a module listed above it, which is the healthy direction.
fallow_core uses fallow_core.plugins.registry, so a change to fallow_core.plugins.registry can break fallow_core, while a change to fallow_core can't break fallow_core.plugins.registry.
Position
Below the diagonal: fallow_core uses a module listed above it, which is the healthy direction.
fallow_core uses fallow_graph.resolve.types, so a change to fallow_graph.resolve.types can break fallow_core, while a change to fallow_core can't break fallow_graph.resolve.types.
Position
Below the diagonal: fallow_core uses a module listed above it, which is the healthy direction.
fallow_core uses fallow_types.results, so a change to fallow_types.results can break fallow_core, while a change to fallow_core can't break fallow_types.results.
Position
Below the diagonal: fallow_core uses a module listed above it, which is the healthy direction.
fallow_core uses fallow_graph.graph, so a change to fallow_graph.graph can break fallow_core, while a change to fallow_core can't break fallow_graph.graph.
Position
Below the diagonal: fallow_core uses a module listed above it, which is the healthy direction.
fallow_core uses fallow_types.trace, so a change to fallow_types.trace can break fallow_core, while a change to fallow_core can't break fallow_types.trace.
Position
Below the diagonal: fallow_core uses a module listed above it, which is the healthy direction.
fallow_core uses fallow_core.plugins, so a change to fallow_core.plugins can break fallow_core, while a change to fallow_core can't break fallow_core.plugins.
Position
Below the diagonal: fallow_core uses a module listed above it, which is the healthy direction.
fallow_engine.baseline uses fallow_cli.cli_args, so a change to fallow_cli.cli_args can break fallow_engine.baseline, while a change to fallow_engine.baseline can't break fallow_cli.cli_args.
Position
Below the diagonal: fallow_engine.baseline uses a module listed above it, which is the healthy direction.
fallow_engine.baseline uses fallow_types.duplicates, so a change to fallow_types.duplicates can break fallow_engine.baseline, while a change to fallow_engine.baseline can't break fallow_types.duplicates.
Position
Below the diagonal: fallow_engine.baseline uses a module listed above it, which is the healthy direction.
fallow_engine.baseline uses fallow_types.workspace, so a change to fallow_types.workspace can break fallow_engine.baseline, while a change to fallow_engine.baseline can't break fallow_types.workspace.
Position
Below the diagonal: fallow_engine.baseline uses a module listed above it, which is the healthy direction.
fallow_engine.baseline uses fallow_types.semantic, so a change to fallow_types.semantic can break fallow_engine.baseline, while a change to fallow_engine.baseline can't break fallow_types.semantic.
Position
Below the diagonal: fallow_engine.baseline uses a module listed above it, which is the healthy direction.
fallow_engine.baseline uses fallow_types.results, so a change to fallow_types.results can break fallow_engine.baseline, while a change to fallow_engine.baseline can't break fallow_types.results.
Position
Below the diagonal: fallow_engine.baseline uses a module listed above it, which is the healthy direction.
fallow_engine.baseline uses fallow_types.output_dead_code, so a change to fallow_types.output_dead_code can break fallow_engine.baseline, while a change to fallow_engine.baseline can't break fallow_types.output_dead_code.
Position
Below the diagonal: fallow_engine.baseline uses a module listed above it, which is the healthy direction.
fallow_engine.baseline uses fallow_output.health_scores, so a change to fallow_output.health_scores can break fallow_engine.baseline, while a change to fallow_engine.baseline can't break fallow_output.health_scores.
Position
Below the diagonal: fallow_engine.baseline uses a module listed above it, which is the healthy direction.
fallow_output.health_report uses fallow_types.output_dead_code, so a change to fallow_types.output_dead_code can break fallow_output.health_report, while a change to fallow_output.health_report can't break fallow_types.output_dead_code.
Position
Below the diagonal: fallow_output.health_report uses a module listed above it, which is the healthy direction.
fallow_output.health_report uses fallow_output.health_scores, so a change to fallow_output.health_scores can break fallow_output.health_report, while a change to fallow_output.health_report can't break fallow_output.health_scores.
Position
Below the diagonal: fallow_output.health_report uses a module listed above it, which is the healthy direction.
fallow_cli.report uses fallow_cli.agent_install.mcp, so a change to fallow_cli.agent_install.mcp can break fallow_cli.report, while a change to fallow_cli.report can't break fallow_cli.agent_install.mcp.
Position
Below the diagonal: fallow_cli.report uses a module listed above it, which is the healthy direction.
fallow_cli.report uses fallow_cli.migrate, so a change to fallow_cli.migrate can break fallow_cli.report, while a change to fallow_cli.report can't break fallow_cli.migrate.
Position
Below the diagonal: fallow_cli.report uses a module listed above it, which is the healthy direction.
fallow_cli.report uses fallow_config.config.rules, so a change to fallow_config.config.rules can break fallow_cli.report, while a change to fallow_cli.report can't break fallow_config.config.rules.
Position
Below the diagonal: fallow_cli.report uses a module listed above it, which is the healthy direction.
fallow_cli.report uses fallow_types.duplicates, so a change to fallow_types.duplicates can break fallow_cli.report, while a change to fallow_cli.report can't break fallow_types.duplicates.
Position
Below the diagonal: fallow_cli.report uses a module listed above it, which is the healthy direction.
fallow_cli.report uses fallow_types.semantic, so a change to fallow_types.semantic can break fallow_cli.report, while a change to fallow_cli.report can't break fallow_types.semantic.
Position
Below the diagonal: fallow_cli.report uses a module listed above it, which is the healthy direction.
fallow_cli.report uses fallow_types.envelope, so a change to fallow_types.envelope can break fallow_cli.report, while a change to fallow_cli.report can't break fallow_types.envelope.
Position
Below the diagonal: fallow_cli.report uses a module listed above it, which is the healthy direction.
fallow_cli.report uses fallow_types.results, so a change to fallow_types.results can break fallow_cli.report, while a change to fallow_cli.report can't break fallow_types.results.
Position
Below the diagonal: fallow_cli.report uses a module listed above it, which is the healthy direction.
fallow_cli.report uses fallow_types.trace, so a change to fallow_types.trace can break fallow_cli.report, while a change to fallow_cli.report can't break fallow_types.trace.
Position
Below the diagonal: fallow_cli.report uses a module listed above it, which is the healthy direction.
fallow_cli.report uses fallow_engine.baseline, so a change to fallow_engine.baseline can break fallow_cli.report, while a change to fallow_cli.report can't break fallow_engine.baseline.
Position
Below the diagonal: fallow_cli.report uses a module listed above it, which is the healthy direction.
fallow_cli.report uses fallow_output.health_report, so a change to fallow_output.health_report can break fallow_cli.report, while a change to fallow_cli.report can't break fallow_output.health_report.
Position
Below the diagonal: fallow_cli.report uses a module listed above it, which is the healthy direction.
fallow_engine.results uses fallow_types.discover, so a change to fallow_types.discover can break fallow_engine.results, while a change to fallow_engine.results can't break fallow_types.discover.
Position
Below the diagonal: fallow_engine.results uses a module listed above it, which is the healthy direction.
fallow_engine.results uses fallow_types.duplicates, so a change to fallow_types.duplicates can break fallow_engine.results, while a change to fallow_engine.results can't break fallow_types.duplicates.
Position
Below the diagonal: fallow_engine.results uses a module listed above it, which is the healthy direction.
fallow_engine.results uses fallow_types.workspace, so a change to fallow_types.workspace can break fallow_engine.results, while a change to fallow_engine.results can't break fallow_types.workspace.
Position
Below the diagonal: fallow_engine.results uses a module listed above it, which is the healthy direction.
fallow_engine.results uses fallow_config.config.parsing, so a change to fallow_config.config.parsing can break fallow_engine.results, while a change to fallow_engine.results can't break fallow_config.config.parsing.
Position
Below the diagonal: fallow_engine.results uses a module listed above it, which is the healthy direction.
fallow_engine.results uses fallow_types.extract, so a change to fallow_types.extract can break fallow_engine.results, while a change to fallow_engine.results can't break fallow_types.extract.
Position
Below the diagonal: fallow_engine.results uses a module listed above it, which is the healthy direction.
fallow_engine.results uses fallow_types.envelope, so a change to fallow_types.envelope can break fallow_engine.results, while a change to fallow_engine.results can't break fallow_types.envelope.
Position
Below the diagonal: fallow_engine.results uses a module listed above it, which is the healthy direction.
fallow_engine.results uses fallow_types.results, so a change to fallow_types.results can break fallow_engine.results, while a change to fallow_engine.results can't break fallow_types.results.
Position
Below the diagonal: fallow_engine.results uses a module listed above it, which is the healthy direction.
fallow_engine.results uses fallow_types.trace, so a change to fallow_types.trace can break fallow_engine.results, while a change to fallow_engine.results can't break fallow_types.trace.
Position
Below the diagonal: fallow_engine.results uses a module listed above it, which is the healthy direction.
fallow_engine.results uses fallow_engine.module_graph, so a change to fallow_engine.module_graph can break fallow_engine.results, while a change to fallow_engine.results can't break fallow_engine.module_graph.
Position
Below the diagonal: fallow_engine.results uses a module listed above it, which is the healthy direction.
fallow_engine.results uses fallow_output.health_report, so a change to fallow_output.health_report can break fallow_engine.results, while a change to fallow_engine.results can't break fallow_output.health_report.
Position
Below the diagonal: fallow_engine.results uses a module listed above it, which is the healthy direction.
fallow_engine.health.scoring uses fallow_types.discover, so a change to fallow_types.discover can break fallow_engine.health.scoring, while a change to fallow_engine.health.scoring can't break fallow_types.discover.
Position
Below the diagonal: fallow_engine.health.scoring uses a module listed above it, which is the healthy direction.
fallow_engine.health.scoring uses fallow_types.extract, so a change to fallow_types.extract can break fallow_engine.health.scoring, while a change to fallow_engine.health.scoring can't break fallow_types.extract.
Position
Below the diagonal: fallow_engine.health.scoring uses a module listed above it, which is the healthy direction.
fallow_engine.health.scoring uses fallow_graph.graph.types, so a change to fallow_graph.graph.types can break fallow_engine.health.scoring, while a change to fallow_engine.health.scoring can't break fallow_graph.graph.types.
Position
Below the diagonal: fallow_engine.health.scoring uses a module listed above it, which is the healthy direction.
fallow_engine.health.scoring uses fallow_types.results, so a change to fallow_types.results can break fallow_engine.health.scoring, while a change to fallow_engine.health.scoring can't break fallow_types.results.
Position
Below the diagonal: fallow_engine.health.scoring uses a module listed above it, which is the healthy direction.
fallow_engine.health.scoring uses fallow_graph.graph, so a change to fallow_graph.graph can break fallow_engine.health.scoring, while a change to fallow_engine.health.scoring can't break fallow_graph.graph.
Position
Below the diagonal: fallow_engine.health.scoring uses a module listed above it, which is the healthy direction.
fallow_engine.health.scoring uses fallow_types.output_dead_code, so a change to fallow_types.output_dead_code can break fallow_engine.health.scoring, while a change to fallow_engine.health.scoring can't break fallow_types.output_dead_code.
Position
Below the diagonal: fallow_engine.health.scoring uses a module listed above it, which is the healthy direction.
fallow_engine.health.scoring uses fallow_engine.module_graph, so a change to fallow_engine.module_graph can break fallow_engine.health.scoring, while a change to fallow_engine.health.scoring can't break fallow_engine.module_graph.
Position
Below the diagonal: fallow_engine.health.scoring uses a module listed above it, which is the healthy direction.
fallow_engine.health.scoring uses fallow_output.health_scores, so a change to fallow_output.health_scores can break fallow_engine.health.scoring, while a change to fallow_engine.health.scoring can't break fallow_output.health_scores.
Position
Below the diagonal: fallow_engine.health.scoring uses a module listed above it, which is the healthy direction.
fallow_engine.health.scoring uses fallow_engine.results, so a change to fallow_engine.results can break fallow_engine.health.scoring, while a change to fallow_engine.health.scoring can't break fallow_engine.results.
Position
Below the diagonal: fallow_engine.health.scoring uses a module listed above it, which is the healthy direction.
fallow_engine.health uses fallow_cli.migrate, so a change to fallow_cli.migrate can break fallow_engine.health, while a change to fallow_engine.health can't break fallow_cli.migrate.
Position
Below the diagonal: fallow_engine.health uses a module listed above it, which is the healthy direction.
fallow_engine.health uses fallow_output.diff, so a change to fallow_output.diff can break fallow_engine.health, while a change to fallow_engine.health can't break fallow_output.diff.
Position
Below the diagonal: fallow_engine.health uses a module listed above it, which is the healthy direction.
fallow_engine.health uses fallow_types.discover, so a change to fallow_types.discover can break fallow_engine.health, while a change to fallow_engine.health can't break fallow_types.discover.
Position
Below the diagonal: fallow_engine.health uses a module listed above it, which is the healthy direction.
fallow_engine.health uses fallow_config.config.parsing, so a change to fallow_config.config.parsing can break fallow_engine.health, while a change to fallow_engine.health can't break fallow_config.config.parsing.
Position
Below the diagonal: fallow_engine.health uses a module listed above it, which is the healthy direction.
fallow_engine.health uses fallow_types.extract, so a change to fallow_types.extract can break fallow_engine.health, while a change to fallow_engine.health can't break fallow_types.extract.
Position
Below the diagonal: fallow_engine.health uses a module listed above it, which is the healthy direction.
fallow_engine.health uses fallow_types.semantic, so a change to fallow_types.semantic can break fallow_engine.health, while a change to fallow_engine.health can't break fallow_types.semantic.
Position
Below the diagonal: fallow_engine.health uses a module listed above it, which is the healthy direction.
fallow_engine.health uses fallow_types.results, so a change to fallow_types.results can break fallow_engine.health, while a change to fallow_engine.health can't break fallow_types.results.
Position
Below the diagonal: fallow_engine.health uses a module listed above it, which is the healthy direction.
fallow_engine.health uses fallow_engine.module_graph, so a change to fallow_engine.module_graph can break fallow_engine.health, while a change to fallow_engine.health can't break fallow_engine.module_graph.
Position
Below the diagonal: fallow_engine.health uses a module listed above it, which is the healthy direction.
fallow_engine.health uses fallow_output.health_scores, so a change to fallow_output.health_scores can break fallow_engine.health, while a change to fallow_engine.health can't break fallow_output.health_scores.
Position
Below the diagonal: fallow_engine.health uses a module listed above it, which is the healthy direction.
fallow_engine.health uses fallow_engine.baseline, so a change to fallow_engine.baseline can break fallow_engine.health, while a change to fallow_engine.health can't break fallow_engine.baseline.
Position
Below the diagonal: fallow_engine.health uses a module listed above it, which is the healthy direction.
fallow_engine.health uses fallow_engine.results, so a change to fallow_engine.results can break fallow_engine.health, while a change to fallow_engine.health can't break fallow_engine.results.
Position
Below the diagonal: fallow_engine.health uses a module listed above it, which is the healthy direction.
fallow_engine.health uses fallow_engine.health.scoring, so a change to fallow_engine.health.scoring can break fallow_engine.health, while a change to fallow_engine.health can't break fallow_engine.health.scoring.
Position
Below the diagonal: fallow_engine.health uses a module listed above it, which is the healthy direction.
36→37 fallow_engine.health uses fallow_apipart of a loop✕
Connections
6 pairs of types, where a type in fallow_engine.health uses a type in fallow_api.
fallow_engine.health uses fallow_api, so a change to fallow_api can break fallow_engine.health, while a change to fallow_engine.health can't break fallow_api.
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.
fallow_api uses fallow_cli.migrate, so a change to fallow_cli.migrate can break fallow_api, while a change to fallow_api can't break fallow_cli.migrate.
Position
Below the diagonal: fallow_api uses a module listed above it, which is the healthy direction.
fallow_api uses fallow_config.config, so a change to fallow_config.config can break fallow_api, while a change to fallow_api can't break fallow_config.config.
Position
Below the diagonal: fallow_api uses a module listed above it, which is the healthy direction.
fallow_api uses fallow_engine.health, so a change to fallow_engine.health can break fallow_api, while a change to fallow_api can't break fallow_engine.health.
Position
Below the diagonal: fallow_api uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_cli.agent_install.mcp, so a change to fallow_cli.agent_install.mcp can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_cli.agent_install.mcp.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_cli.migrate, so a change to fallow_cli.migrate can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_cli.migrate.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_config.config.rules, so a change to fallow_config.config.rules can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_config.config.rules.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_output.diff, so a change to fallow_output.diff can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_output.diff.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_types.discover, so a change to fallow_types.discover can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_types.discover.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_types.workspace, so a change to fallow_types.workspace can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_types.workspace.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_config.config.parsing, so a change to fallow_config.config.parsing can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_config.config.parsing.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_types.extract, so a change to fallow_types.extract can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_types.extract.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_types.semantic, so a change to fallow_types.semantic can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_types.semantic.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_config.config, so a change to fallow_config.config can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_config.config.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_types.envelope, so a change to fallow_types.envelope can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_types.envelope.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_types.results, so a change to fallow_types.results can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_types.results.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_types.trace, so a change to fallow_types.trace can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_types.trace.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_engine.module_graph, so a change to fallow_engine.module_graph can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_engine.module_graph.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_engine.baseline, so a change to fallow_engine.baseline can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_engine.baseline.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_cli.report, so a change to fallow_cli.report can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_cli.report.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_engine.results, so a change to fallow_engine.results can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_engine.results.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.check uses fallow_engine.health, so a change to fallow_engine.health can break fallow_cli.check, while a change to fallow_cli.check can't break fallow_engine.health.
Position
Below the diagonal: fallow_cli.check uses a module listed above it, which is the healthy direction.
fallow_cli.audit uses fallow_cli.agent_install.mcp, so a change to fallow_cli.agent_install.mcp can break fallow_cli.audit, while a change to fallow_cli.audit can't break fallow_cli.agent_install.mcp.
Position
Below the diagonal: fallow_cli.audit uses a module listed above it, which is the healthy direction.
fallow_cli.audit uses fallow_cli.migrate, so a change to fallow_cli.migrate can break fallow_cli.audit, while a change to fallow_cli.audit can't break fallow_cli.migrate.
Position
Below the diagonal: fallow_cli.audit uses a module listed above it, which is the healthy direction.
fallow_cli.audit uses fallow_output.diff, so a change to fallow_output.diff can break fallow_cli.audit, while a change to fallow_cli.audit can't break fallow_output.diff.
Position
Below the diagonal: fallow_cli.audit uses a module listed above it, which is the healthy direction.
fallow_cli.audit uses fallow_types.discover, so a change to fallow_types.discover can break fallow_cli.audit, while a change to fallow_cli.audit can't break fallow_types.discover.
Position
Below the diagonal: fallow_cli.audit uses a module listed above it, which is the healthy direction.
fallow_cli.audit uses fallow_config.config, so a change to fallow_config.config can break fallow_cli.audit, while a change to fallow_cli.audit can't break fallow_config.config.
Position
Below the diagonal: fallow_cli.audit uses a module listed above it, which is the healthy direction.
fallow_cli.audit uses fallow_types.envelope, so a change to fallow_types.envelope can break fallow_cli.audit, while a change to fallow_cli.audit can't break fallow_types.envelope.
Position
Below the diagonal: fallow_cli.audit uses a module listed above it, which is the healthy direction.
fallow_cli.audit uses fallow_types.results, so a change to fallow_types.results can break fallow_cli.audit, while a change to fallow_cli.audit can't break fallow_types.results.
Position
Below the diagonal: fallow_cli.audit uses a module listed above it, which is the healthy direction.
fallow_cli.audit uses fallow_engine.module_graph, so a change to fallow_engine.module_graph can break fallow_cli.audit, while a change to fallow_cli.audit can't break fallow_engine.module_graph.
Position
Below the diagonal: fallow_cli.audit uses a module listed above it, which is the healthy direction.
fallow_cli.audit uses fallow_engine.baseline, so a change to fallow_engine.baseline can break fallow_cli.audit, while a change to fallow_cli.audit can't break fallow_engine.baseline.
Position
Below the diagonal: fallow_cli.audit uses a module listed above it, which is the healthy direction.
fallow_cli.audit uses fallow_output.health_report, so a change to fallow_output.health_report can break fallow_cli.audit, while a change to fallow_cli.audit can't break fallow_output.health_report.
Position
Below the diagonal: fallow_cli.audit uses a module listed above it, which is the healthy direction.
fallow_cli.audit uses fallow_engine.health, so a change to fallow_engine.health can break fallow_cli.audit, while a change to fallow_cli.audit can't break fallow_engine.health.
Position
Below the diagonal: fallow_cli.audit uses a module listed above it, which is the healthy direction.
fallow_cli.audit uses fallow_cli.check, so a change to fallow_cli.check can break fallow_cli.audit, while a change to fallow_cli.audit can't break fallow_cli.check.
Position
Below the diagonal: fallow_cli.audit uses a module listed above it, which is the healthy direction.
fallow_cli.dispatch uses fallow_cli.agent_install.mcp, so a change to fallow_cli.agent_install.mcp can break fallow_cli.dispatch, while a change to fallow_cli.dispatch can't break fallow_cli.agent_install.mcp.
Position
Below the diagonal: fallow_cli.dispatch uses a module listed above it, which is the healthy direction.
fallow_cli.dispatch uses fallow_cli.cli_args, so a change to fallow_cli.cli_args can break fallow_cli.dispatch, while a change to fallow_cli.dispatch can't break fallow_cli.cli_args.
Position
Below the diagonal: fallow_cli.dispatch uses a module listed above it, which is the healthy direction.
fallow_cli.dispatch uses fallow_cli.migrate, so a change to fallow_cli.migrate can break fallow_cli.dispatch, while a change to fallow_cli.dispatch can't break fallow_cli.migrate.
Position
Below the diagonal: fallow_cli.dispatch uses a module listed above it, which is the healthy direction.
fallow_cli.dispatch uses fallow_config.config, so a change to fallow_config.config can break fallow_cli.dispatch, while a change to fallow_cli.dispatch can't break fallow_config.config.
Position
Below the diagonal: fallow_cli.dispatch uses a module listed above it, which is the healthy direction.
fallow_cli.dispatch uses fallow_output.health_scores, so a change to fallow_output.health_scores can break fallow_cli.dispatch, while a change to fallow_cli.dispatch can't break fallow_output.health_scores.
Position
Below the diagonal: fallow_cli.dispatch uses a module listed above it, which is the healthy direction.
fallow_cli.dispatch uses fallow_engine.health, so a change to fallow_engine.health can break fallow_cli.dispatch, while a change to fallow_cli.dispatch can't break fallow_engine.health.
Position
Below the diagonal: fallow_cli.dispatch uses a module listed above it, which is the healthy direction.
fallow_cli.dispatch uses fallow_cli.check, so a change to fallow_cli.check can break fallow_cli.dispatch, while a change to fallow_cli.dispatch can't break fallow_cli.check.
Position
Below the diagonal: fallow_cli.dispatch uses a module listed above it, which is the healthy direction.
fallow_cli.dispatch uses fallow_cli.audit, so a change to fallow_cli.audit can break fallow_cli.dispatch, while a change to fallow_cli.dispatch can't break fallow_cli.audit.
Position
Below the diagonal: fallow_cli.dispatch uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 57% · Adequate · gated by X4 ·
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
A07:2025 — Authentication Failures
68
High / Critical
A05:2025 — Injection
16
High / Critical
A03:2025 — Software Supply Chain Failures
4
High / Critical
A02:2025 — Security Misconfiguration
3
High / Critical
Roadmap
First, address visual and motion safety by ensuring visible focus styles, respecting reduced motion preferences, and correcting low-contrast colors. Next, enforce accessibility standards by integrating jsx-a11y into your linting configuration, adding axe assertions to your tests, and gating these checks in CI. Finally, resolve the missing architecture decision records by documenting key design choices and fix the 89 instances of unstructured logging to ensure proper data parsing.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
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.
Enforce accessibility in the toolchain you already use: add `jsx-a11y` to the `plugins` array in your oxlint config (its a11y rules are off until the plugin is listed), then assert with vitest-axe in tests, then gate axe/pa11y/Lighthouse in CI.
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.
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 — 78
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 — 2002
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 — 177
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 10
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. 84 of 84 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 — 84 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, 2225 of 2257 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.
D8 Code Coverage — 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. Coverage NOT MEASURED: this repository's production source spans .ts, .tsx, .rs, and our analyzer cannot run the .rs test suite(s) — so no coverage was collected for the repository as a whole. The JavaScript/TypeScript half did build and run, and its own line coverage came back at 94.4% — but that is a figure for one half of the product, and we do not publish a partial one as if it were complete. This is OUR limitation, not a defect in the repo — coverage is excluded from the score rather than counted as a near-zero. In the meantime, produce a coverage report in a standard format (lcov — `vitest --coverage`, `jest --coverage`, `bun test --coverage --coverage-reporter=lcov`, or `nyc`, or 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 and real coverage will be read. You can widen what we reach: optional: 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 — then both halves are read on the next scan.
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 2,209 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 641 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 SCORED: this repository's production source includes .rs, and the rust executor ran against the .rs half and did not finish re-running within its tier budget — so reliability was not measured for the repository as a whole. The JavaScript/TypeScript (vitest via `pnpm install --frozen-lockfile --ignore-scripts` in editors/vscode/ (776 tests); node:test via `npm ci --ignore-scripts` in npm/fallow/ (99 tests); node:test via `npm ci --ignore-scripts` in npm/fallow-similar-code/ (23 tests); node:test via `npm ci --ignore-scripts` in tools/mutation-runner/ (184 tests); node:test via `npm ci --ignore-scripts` in tools/type-aware-sidecar/ (128 tests); vitest via `npm ci --ignore-scripts` in viz-frontend/ (100 tests)): measured (0 flaky) suite(s) did re-run, and came back with 0 flaky across 1 measured tier(s) — but that is a figure for one half of the product, and we do not publish a partial one as if it were complete. This is OUR limitation, not a defect in the repo — test reliability is excluded from the score rather than counted. The half was driven by a runner we ship, so this is not a missing-runner gap.
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 REDACTED, 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.
D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (43 contributor(s) across 4958 commit(s) sampled, automation and bot accounts excluded). One of them holds 97% of the history; the other 42 hold 0.1% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
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.
D31 IaC & Container Security — 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. REDACTED.dockerignore carries no `FROM` instruction, so it declares no build stage and every REDACTED rule this engine owns — the runtime-hardening, key-material, mutable-clone, no-op-shim, build-context, trust-anchor, install-guard, setuid and world-writable-path rules — is outside its own premise there and returned nothing. That silence is deliberate and correct: with no base image there is no image to reason about. It is reported here because it is NOT the same fact as a clean file, and coverage is stated as 7 of 8 Infrastructure-as-Code manifest(s) fully judged rather than as 100%. The vendor scanners (trivy, checkov) do read these files and their findings above stand; only this engine's own stage-keyed rules are absent. No owner action: a build file with no FROM is a legitimate include fragment.
D32 Data Compliance (PII/GDPR) — 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. `.github/scripts/check-pr-deferrals.mjs`, `crates/cli/viz-assets/viz.js`, `editors/vscode/src/analysis-utils.ts`, `REDACTED`, `viz-frontend/src/panel.ts` produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
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 DockerCompose (examples/docker/compose.yaml). compose up failed (exit 18 — an image could not be pulled) — fallow Pulling fallow Error pull access denied for fallow, repository does not exist or may require 'docker login': denied: requested access to the resource is denied Error response from daemon: pull access denied for fallow, repository does not exist or may require 'docker login': denied: requested access to the resource is denied; the earlier `compose pull` step reported: fallow Pulling fallow Error pull access denied for fallow, repository does not exist or may require 'docker login': denied: requested access to the resource is denied Error response from daemon: pull access denied for fallow, repository does not exist or may require 'docker login': denied: requested access to the resource is denied; the runtime sandbox reaches registries only through the in-fence pull-through mirror, so an image the mirror does not carry cannot be fetched — this is a limit of our sandbox, not of your stack; runtime evidence skipped.
GD1 Unfinished & placeholder code — 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 reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and this repository's Python, Rust is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — 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 reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and this repository's Python, Rust is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
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), and artefact counts an order of magnitude off. 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.
R10 Code Duplication — 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. 51 further occurrence(s) are not listed individually; the score already reflects all 91.
X4 Structured logging — 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. 49 further occurrence(s) are not listed individually; the score already reflects all 89.
X7 Silent fallback defaults — 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. 23 further occurrence(s) are not listed individually; the score already reflects all 63.
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.
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.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
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.
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.
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".
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.
178 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was extension.activate at 85. A further 35 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 fallow_cli::report::badge::char_width at 78 — they are counted neither in the figure above nor in this dimension's score. 21 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: crates/cli/src/report/badge.rs (fallow_cli::report::badge::char_width at 78), crates/types/src/suppress.rs (IssueKind::from_discriminant at 65), crates/config/src/config/rules.rs (RulesConfig::severity_for_kind at 63), crates/api/src/audit_keys_collection.rs (AuditCollection::json_key at 51), crates/output/src/dead_code_sarif.rs (fallow_output::dead_code_sarif::dead_code_rule_severity at 50), and 16 more not listed here. 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.
+ 82 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 3 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with extension.activate (cyclomatic 85), fallow_types::workspace::render_message (cyclomatic 65), annotations.drawClusterLabels (cyclomatic 61). — 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 3 together lifts Cyclomatic Complexity from 6.2 to about 6.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; 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.
+ 140 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 4 bodies over 60 down to 60 or less in Cognitive Complexity — start with extension.activate (cognitive 105), annotations.drawClusterLabels (cognitive 83), download.downloadBinary (cognitive 65). — 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 4 together lifts Cognitive Complexity from 5.9 to about 6.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; 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.
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 197 FileTooLong finding(s) in God Classes — start with mod.rs (26), lib.rs (6), similar_code.rs (3). — One of this dimension's main actionable groups (197 warning-level).
Resolve the 29 TooManyFields finding(s) in God Classes — start with mod.rs (9), lib.rs (4), rules.rs (2). — One of this dimension's main actionable groups (29 warning-level).
Resolve the 25 FunctionTooLong finding(s) in God Classes — start with github_summary.rs (3), type-aware-corpus.mjs (2), effective_severity.rs (2). — One of this dimension's main actionable groups (25 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.
506 duplicated block group(s) detected. A further 15 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 4 of the 521 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.
+ 108 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 49 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with mod.rs (3), ci_pr_comment_post.rs (3), visit_impl.rs (3). — One of this dimension's main actionable groups (49 warning-level).
Resolve the 43 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with mod.rs (3), dead_code_codeclimate.rs (2), unused_exports.rs (2). — One of this dimension's main actionable groups (43 warning-level).
Resolve the 35 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with mod.rs (4), markdown_output.rs (3), dead_code_codeclimate.rs (2). — One of this dimension's main actionable groups (35 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 · Coupling7.6 / 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.
28 production modules (Cargo+npm), 0 dependency cycle(s), 2 unstable depended-on module(s). Read from the build's own module declarations; 6 module(s) off the main sequence, with abstractness counted on 21 of the 28 (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: fallow-license · ×6
Unstable project fallow-core
Unstable project fallow-engine
What to do
Resolve the 6 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 1 Unstable project fallow-core finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Unstable project fallow-engine finding(s) in Coupling. — One of this dimension's main actionable groups (1 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.
Resolve the 2 Low cohesion finding(s) in Cohesion (LCOM4) — start with trace.rs, collect.rs. — One of this dimension's main actionable groups (2 warning-level).
Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
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.
23931 test methods: 19594 unit, 4272 integration, 0 BDD, 65 e2e. The JavaScript/TypeScript suite contributes 2209 `it`/`test` case(s) across 286 test file(s) declaring at least one; its tier split is read from package names and paths only. The Rust suite contributes 21718 `#[test]` function(s) across 1368 file(s) declaring at least one; its unit/integration split is Cargo's own — 502 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 Quality9.8 / 10Adequategated by 1 critical finding✓ 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.
9 skipped (6 with a documented reason), 28 zero-assertion, 1 synchronised by a fixed sleep, no mocking-framework packages referenced (hand-written doubles or no mocking) across 2209 tests (1 harness-style project(s) excluded from the assertion penalty). Measured on the JavaScript/TypeScript suite only — at least 641 test source file(s) (.rs) went unread, so its test quality is unmeasured and is not in these counts.
No assertions (empty test): placeholdertests/fixtures/vitest-include-entry-exports-workspace/packages/web/charts/src/placeholder.test.ts:3
No assertions: preflight accepts the sidecar's own install of each backend · ×19tools/type-aware-sidecar/test/backend-preflight.test.mjs:33
Test project verifies nothing: tests/fixtures/issue-1785-playwright-fixture-interface · ×8tests/fixtures/issue-1785-playwright-fixture-interface/tests/login.spec.ts:3
Fixed-sleep synchronisation: serializes two concurrent holderseditors/vscode/test/download-lock.test.ts:197
+ 4 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 No assertions (empty test) finding(s) in Test Quality — start with placeholder.test.ts. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 19 No assertions finding(s) in Test Quality — start with math.test.ts (4), example.test.ts (3), faults.test.ts (2). — One of this dimension's main actionable groups (19 warning-level).
Resolve the 8 Test project verifies nothing finding(s) in Test Quality — start with example.test.ts (3), login.spec.ts, example.spec.ts. — One of this dimension's main actionable groups (8 warning-level).
Enforce Test Quality in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
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.
15 outdated, 0 yanked direct Cargo dependencies. 71 of 78 direct crates were graded against crates.io (0 not published there, 7 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: deser-value · ×15
What to do
Maintain Dependency Hygiene — already on the Gold path. — No findings, and enforcement is at this dimension's ceiling.
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.
Resolve the 7 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED (3), REDACTED (2), REDACTED. — One of this dimension's main actionable groups (7 issue-level).
Enforce REDACTED Scanning in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d13_recommendation.md · top locations in Appendix A, every location in findings.md.
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 488 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 REDACTED, and the licences of those dependencies 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: crates/types/src/workspace.rs (37×65=2405); crates/cli/src/check/mod.rs (59×37=2183); crates/api/src/lib.rs (53×37=1961) Repeated repair below the complexity floor: crates/extract/src/cache/types.rs (97 of 128 changes were fixes); crates/graph/src/cache/mod.rs (55 of 73 changes were fixes); crates/types/src/extract.rs (33 of 59 changes were fixes)
Resolve the 143 Repeated repair finding(s) in Churn × Complexity Hotspots — start with mod.rs (16), lib.rs (3), health.rs (3). — One of this dimension's main actionable groups (143 warning-level).
Resolve the 79 Hotspot finding(s) in Churn × Complexity Hotspots — start with mod.rs (8), lib.rs (2), check.rs (2). — One of this dimension's main actionable groups (79 warning-level).
Detailed fixes: d15_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.
0 deducted task-comment markers across 815410 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.
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. 71 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.
8 of 27 build units (Cargo, npm) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
60 finding(s): 0 critical, 60 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 50 REDACTED finding(s) in Secrets (history) — start with REDACTED (49), REDACTED. — One of this dimension's main actionable groups (50 issue-level).
Resolve the 10 High secret finding(s) in Secrets (history) — start with REDACTED (9), REDACTED. — One of this dimension's main actionable groups (10 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).
16 finding(s): 0 critical, 1 high, 15 medium, 0 low. semgrep hit a parse error in 16 file(s) — `.github/scripts/check-pr-deferrals.mjs` (line 44), `action/scripts/analyze.sh` (line 1327), `action/scripts/comment.sh` (line 56), `action/scripts/review.sh` (line 72), `action/scripts/summary.sh` (line 219), … (+11 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 4 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
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 5 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED (2), REDACTED. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 4 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED (2). — One of this dimension's main actionable groups (4 warning-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 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 2 Medium vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 Medium CVE 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.
Resolve the 3 High IaC finding(s) in IaC & Container Security — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 issue-level).
Detailed fixes: d31_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.
2 of 1092 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is crates/core/src/plugins/adonis.rs. Counted over 1092 of the 1277 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Resolve the 2 Orphaned knowledge finding(s) in Knowledge Freshness — start with adonis.rs, glimmer.rs. — One of this dimension's main actionable groups (2 issue-level).
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
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 18 Change coupling finding(s) in Change Coupling — start with mod.rs (3), audit.rs, results.rs. — One of this dimension's main actionable groups (18 warning-level).
Resolve the 5 Change-coupling hub finding(s) in Change Coupling — start with types.rs, health.rs, commands.ts. — One of this dimension's main actionable groups (5 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.
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 2 platform declaration(s) and 0 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.
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.
`#canvas:focus-visible` 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. (×2) — viz-frontend/src/styles.css:965, crates/cli/viz-assets/viz.css:1008
`#panel .rank-table td.col-file button:focus-visible` 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. (×2) — viz-frontend/src/styles.css:1927, crates/cli/viz-assets/viz.css:1970
`.lens-menu` moves (`animation: pop-in var(--dur-base) var(--ease-out)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. (×2) — viz-frontend/src/styles.css:434, crates/cli/viz-assets/viz.css:477
`#panel.open > *` moves (`animation: settle-in var(--dur-slow) var(--ease-out) backwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. (×2) — viz-frontend/src/styles.css:1122, crates/cli/viz-assets/viz.css:1165
`#panel .rank-table tbody tr` moves (`animation: settle-in var(--dur-slow) var(--ease-out) backwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. (×2) — viz-frontend/src/styles.css:1140, crates/cli/viz-assets/viz.css:1183
`.hint-tip` moves (`animation: pop-in var(--dur-fast) var(--ease-out)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. (×2) — viz-frontend/src/styles.css:2046, crates/cli/viz-assets/viz.css:2089
`#panel .bar-fill` moves (`animation: bar-grow 640ms var(--ease-out) backwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. (×2) — viz-frontend/src/styles.css:2092, crates/cli/viz-assets/viz.css:2135
`.sev-seg` moves (`animation: strip-grow var(--dur-slow) var(--ease-out) backwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. (×2) — viz-frontend/src/styles.css:2329, crates/cli/viz-assets/viz.css:2372
`#tooltip` moves (`animation: pop-in var(--dur-fast) var(--ease-out)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. (×2) — viz-frontend/src/styles.css:2758, crates/cli/viz-assets/viz.css:2801
`#help-overlay.open .help-box` moves (`animation: help-in var(--dur-slow) var(--ease-out)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. (×2) — viz-frontend/src/styles.css:2887, crates/cli/viz-assets/viz.css:2930
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 — your oxlint config does not list the `jsx-a11y` plugin (its a11y rules are off until it does) and there's no axe/pa11y/Lighthouse in tests or CI. Start by enabling that plugin to catch issues at author time. What was searched, so you can tell an absence from a miss: the 4 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 you already use: add `jsx-a11y` to the `plugins` array in your oxlint config (its a11y rules are off until the plugin is listed), then assert with vitest-axe 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 the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.
Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. 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.
`unused_deps$module.find_unresolved_imports` is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command. — crates/core/src/analyze/unused_deps.rs:2773
What to do
Keep query handlers read-only — move the writes/event-publishes into a command handler so reads stay safe to retry, cache, and route to a read replica.
Other · Event Sourcing — Whether the recovery-replay fold is deterministic — state derived purely from each event's own fields, no clock/random/IO on the replay path.
Method: Roslyn syntax scan (event-sourcing gated): Apply/When folds checked for forbidden tokens (DateTime.Now, Guid.NewGuid, Random, IO), stripped of comments/strings. Deterministic, hard fact per fold.
Other · Event Sourcing — Whether domain events stay immutable (private fields, set once) rather than carrying mutable state.
Method: Roslyn scan (event-sourcing gated): persisted events checked for public setters; immutability verified per property/field. Deterministic, hard fact.
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
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
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 26 of 49 project(s) that lack one — worth up to 1.1 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.
docs/environment-variables.md names TypeScript 7, but the manifest declares `typescript` ^5.4.0. Checked without a model against the repository: its files and folders, the scripts and dependencies of every REDACTED, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/environment-variables.md:92
docs/development/quality-gates.md names Vitest 4, but the manifest declares `vitest` 5.0.5. Checked without a model against the repository: its files and folders, the scripts and dependencies of every REDACTED, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/development/quality-gates.md:89
What to do
Reconcile the README with reality: docs/environment-variables.md names TypeScript 7, but the manifest declares `typescript` ^5.4.0; docs/development/quality-gates.md names Vitest 4, but the manifest declares `vitest` 5.0.5.
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.
Only 9/10 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `crates/multicall`.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
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
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.
Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.
Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.
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.
`accessSync` in `packageVsixVariants` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — editors/vscode/scripts/package-vsix-variants.mjs:71, editors/vscode/scripts/package-vsix-variants.mjs:72
`readFileSync` in `packageVsixVariants` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — editors/vscode/scripts/package-vsix-variants.mjs:75
`mkdirSync` in `packageVsixVariants` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — editors/vscode/scripts/package-vsix-variants.mjs:89
`readFileSync` in `verifyPackagedTypeAware` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — editors/vscode/scripts/verify-packaged-type-aware.mjs:78
`readdirSync` in `verifyPackagedTypeAware` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — editors/vscode/scripts/verify-packaged-type-aware.mjs:82
`statSync` in `verifyPackagedTypeAware` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — editors/vscode/scripts/verify-packaged-type-aware.mjs:108, editors/vscode/scripts/verify-packaged-type-aware.mjs:109
`statSync` in `callback to backends.map` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — editors/vscode/scripts/verify-packaged-type-aware.mjs:131
`statSync` in `inspectVsixArchive` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — editors/vscode/scripts/vsix-archive.mjs:123
`fs.chmodSync` in `downloadAsset` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — editors/vscode/src/download.ts:921
`fs.existsSync` in `downloadAsset` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×3) — editors/vscode/src/download.ts:929, editors/vscode/src/download.ts:934, editors/vscode/src/download.ts:953
`fs.unlinkSync` in `downloadAsset` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×3) — editors/vscode/src/download.ts:930, editors/vscode/src/download.ts:935, editors/vscode/src/download.ts:954
`fs.writeFileSync` in `downloadAsset` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — editors/vscode/src/download.ts:938
`readFileSync` in `recordRow` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — scripts/coverage-producer-refresh.mjs:111
`readFileSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×4) — scripts/coverage-producer-refresh.mjs:180, scripts/coverage-producer-refresh.mjs:237, scripts/coverage-producer-refresh.mjs:294, …
`existsSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×3) — scripts/coverage-producer-refresh.mjs:183, scripts/coverage-producer-refresh.mjs:237, scripts/coverage-producer-refresh.mjs:332
`mkdirSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — scripts/coverage-producer-refresh.mjs:281
`writeFileSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — scripts/coverage-producer-refresh.mjs:282, scripts/coverage-producer-refresh.mjs:374
`readFileSync` in `callback to map` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — scripts/coverage-producer-refresh.mjs:309
`readdirSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — scripts/coverage-producer-refresh.mjs:316, scripts/coverage-producer-refresh.mjs:320
`rmSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — scripts/coverage-producer-refresh.mjs:323
`readFileSync` in `callback to files.map` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — scripts/semantic-clone-model-evidence.mjs:141
What to do
TypeScript/JavaScript: use the promise APIs (fs/promises, a promisified child_process.execFile, the async zlib/crypto functions) and await them instead of the *Sync variants.
Do you agree with this assessment?
R1 · Type Safety4.2 / 10Weak✓ 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.
177 typed · 240 plain JS — the untyped files are REDACTED, action/tests/install-verification-timeout.test.mjs, crates/napi/loader.js, crates/napi/scripts/write-dts-entry.mjs, crates/napi/test.mjs, crates/napi/type-aware-command.js (+234 more).
What to do
Migrate the remaining .js/.jsx files to TypeScript.
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.
REDACTED:58 · npm/fallow-similar-code/scripts/run-binary.js:99 — the two spans are one implementation copied and then locally edited — 360 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:58
scripts/generate-agent-adapters.mjs:106 · scripts/generate-agent-adapters.mjs:310 — the two spans are one implementation copied and then locally edited — 420 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — scripts/generate-agent-adapters.mjs:106
editors/vscode/src/diagnosticMute.ts:206 · editors/vscode/src/findingId.ts:27 — the two spans are one implementation copied and then locally edited — 253 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — editors/vscode/src/diagnosticMute.ts:206
scripts/styling-corpus-smoke.mjs:204 · scripts/styling-pr-smoke.mjs:130 — 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. — scripts/styling-corpus-smoke.mjs:204
editors/vscode/src/treeView.ts:685 · editors/vscode/src/treeView.ts:713 — 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. — editors/vscode/src/treeView.ts:685
REDACTED:656 · REDACTED:691 — 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. — REDACTED:656
scripts/generate-agent-docs.mjs:999 · scripts/generate-agent-docs.mjs:1031 — 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. — scripts/generate-agent-docs.mjs:999
tools/type-aware-sidecar/src/project-state.mjs:129 · tools/type-aware-sidecar/src/project-state.mjs:176 — 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. — tools/type-aware-sidecar/src/project-state.mjs:129
scripts/signing-migration-receipt.mjs:12 · scripts/signing-migration-receipt.mjs:70 — 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. — scripts/signing-migration-receipt.mjs:12
REDACTED:46 · REDACTED:123 — the two spans are one implementation copied and then locally edited — 95 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:46
viz-frontend/src/graph/interact.ts:257 · viz-frontend/src/graph/interact.ts:331 — the two spans are one implementation copied and then locally edited — 168 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — viz-frontend/src/graph/interact.ts:257
npm/fallow/scripts/verify-binary.js:479 · npm/fallow/scripts/verify-binary.js:622 — 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. — npm/fallow/scripts/verify-binary.js:479
scripts/coverage-producer-conformance.mjs:112 · scripts/semantic-clone-candle-conformance.mjs:47 — 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. — scripts/coverage-producer-conformance.mjs:112
scripts/generate-agent-adapters.mjs:204 · scripts/generate-agent-adapters.mjs:361 — 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. — scripts/generate-agent-adapters.mjs:204
scripts/type-aware-corpus.mjs:970 · scripts/type-aware-corpus.mjs:1094 — 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. — scripts/type-aware-corpus.mjs:970
editors/vscode/src/commands.ts:168 · editors/vscode/src/license.ts:47 — 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. — editors/vscode/src/commands.ts:168
editors/vscode/src/audit-utils.ts:320 · editors/vscode/src/workspacePicker-utils.ts:53 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — editors/vscode/src/audit-utils.ts:320
scripts/check-osv-ignores.mjs:75 · scripts/generate-vex.mjs:12 — the two spans are one implementation copied and then locally edited — 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — scripts/check-osv-ignores.mjs:75
editors/vscode/src/commands.ts:204 · editors/vscode/src/commands.ts:217 — 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. — editors/vscode/src/commands.ts:204
editors/vscode/src/extension.ts:387 · editors/vscode/src/extension.ts:399 — 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. — editors/vscode/src/extension.ts:387
editors/vscode/src/health-utils.ts:138 · editors/vscode/src/health-utils.ts:158 — 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. — editors/vscode/src/health-utils.ts:138
scripts/check-crate-boundaries.mjs:188 · scripts/check-miri-cfg.mjs:286 — the two spans are one implementation copied and then locally edited — 77 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — scripts/check-crate-boundaries.mjs:188
scripts/check-miri-cfg.mjs:286 · scripts/check-parse-sites.mjs:130 — the two spans are one implementation copied and then locally edited — 74 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — scripts/check-miri-cfg.mjs:286
scripts/generate-agent-adapters.mjs:182 · scripts/generate-agent-adapters.mjs:259 — 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. — scripts/generate-agent-adapters.mjs:182
scripts/ship-git.mjs:850 · scripts/ship-wait-checks.mjs:1350 — 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. — scripts/ship-git.mjs:850
viz-frontend/src/graph/build.ts:892 · viz-frontend/src/graph/interact.ts:209 — the two spans are one implementation copied and then locally edited — 83 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — viz-frontend/src/graph/build.ts:892
editors/vscode/src/commands.ts:1195 · editors/vscode/src/commands.ts:1275 — 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. — editors/vscode/src/commands.ts:1195
editors/vscode/src/download.ts:1000 · editors/vscode/src/download.ts:1108 — 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. — editors/vscode/src/download.ts:1000
npm/fallow-similar-code/scripts/run-binary.js:23 · npm/fallow/scripts/run-binary.js:20 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — npm/fallow-similar-code/scripts/run-binary.js:23
npm/fallow/scripts/verify-binary.js:69 · npm/fallow/scripts/verify-binary.js:84 · npm/fallow/scripts/verify-binary.js:153 — all 3 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. — npm/fallow/scripts/verify-binary.js:69
scripts/check-crate-boundaries.mjs:118 · scripts/check-crate-boundaries.mjs:130 — 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. — scripts/check-crate-boundaries.mjs:118
scripts/ci-metrics.mjs:225 · scripts/scaffold-analyzer-plan.mjs:137 — 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. — scripts/ci-metrics.mjs:225
scripts/coverage-producer-conformance.mjs:523 · scripts/coverage-producer-conformance.mjs:584 — 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. — scripts/coverage-producer-conformance.mjs:523
scripts/styling-corpus-smoke.mjs:190 · scripts/styling-pr-smoke.mjs:105 — 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. — scripts/styling-corpus-smoke.mjs:190
viz-frontend/src/panel.ts:2528 · viz-frontend/src/panel.ts:2544 — 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. — viz-frontend/src/panel.ts:2528
crates/napi/test.mjs:261 · crates/napi/test.mjs:302 — 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. — crates/napi/test.mjs:261
editors/vscode/src/commands.ts:881 · editors/vscode/src/coverageCommand.ts:47 — 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. — editors/vscode/src/commands.ts:881
editors/vscode/src/license.ts:378 · editors/vscode/src/license.ts:393 — 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. — editors/vscode/src/license.ts:378
editors/vscode/src/workspacePicker-utils.ts:154 · editors/vscode/src/workspacePicker-utils.ts:166 — the two spans are one implementation copied and then locally edited — 66 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — editors/vscode/src/workspacePicker-utils.ts:154
npm/fallow/scripts/verify-binary.js:462 · npm/fallow/scripts/verify-binary.js:613 — 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. — npm/fallow/scripts/verify-binary.js:462
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 · Architecture — Conformance to the detected frontend architecture layout (feature-sliced / layered src) plus cross-package deep-import rules (D-386).
Method: Conformance to the detected frontend layout (feature-sliced / layered src) plus cross-package deep-import rules, over the module graph. Deterministic.
scripts/vscode-public-verify.mjs:21 reaches into another package with a relative path (../editors/vscode/scripts/vsix-targets.mjs) — import the package by name instead. — scripts/vscode-public-verify.mjs:21
viz-frontend/build-css.mjs:33 reaches into another package with a relative path (../crates/cli/viz-assets/viz.css) — import the package by name instead. — viz-frontend/build-css.mjs:33
What to do
Fix the listed violations: import through public entries (package exports / slice index), never reach into another layer or package's internals.
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.
(anonymous) has cyclomatic complexity 58 and cognitive complexity 96; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — viz-frontend/src/graph/annotations.ts:606
main has cyclomatic complexity 36 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — scripts/coverage-producer-refresh.mjs:175
(anonymous) has cyclomatic complexity 35 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — viz-frontend/src/graph/render.ts:462
(anonymous) has cyclomatic complexity 34 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — viz-frontend/src/panel.ts:352
(anonymous) has cyclomatic complexity 32 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — viz-frontend/src/panel.ts:2356
(anonymous) has cyclomatic complexity 31 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:540
supersededCancellations has cyclomatic complexity 31 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — scripts/ship-wait-checks.mjs:524
(anonymous) has cyclomatic complexity 31 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — scripts/check-miri-cfg.mjs:124
(anonymous) has cyclomatic complexity 29 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — editors/vscode/src/statusBar-utils.ts:72
validateEntry has cyclomatic complexity 29 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — editors/vscode/scripts/vsix-inventory.mjs:24
currentRollupChecks has cyclomatic complexity 25 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — scripts/ship-wait-checks.mjs:603
(anonymous) has cyclomatic complexity 25 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — viz-frontend/src/graph/render.ts:226
(anonymous) has cyclomatic complexity 25 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — viz-frontend/src/treemap.ts:428
validateFallowReport has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — scripts/semantic-clone-conformance.mjs:226
(anonymous) has cyclomatic complexity 23 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — viz-frontend/src/panel.ts:488
(anonymous) has cyclomatic complexity 23 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — viz-frontend/src/data.ts:233
(anonymous) has cyclomatic complexity 22 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. (×2) — editors/vscode/src/extension.ts:1101, viz-frontend/src/graph/interact.ts:328
(anonymous) has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — viz-frontend/src/treemap.ts:755
parseAllocation has cyclomatic complexity 22 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:15
What to do
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
Do you agree with this assessment?
R3 · Large Files5.5 / 10Adequate✓ 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.
viz-frontend/src/panel.ts has 2636 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — viz-frontend/src/panel.ts:1
tools/type-aware-sidecar/src/semantic.mjs has 2018 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — tools/type-aware-sidecar/src/semantic.mjs:1
editors/vscode/src/extension.ts has 1184 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — editors/vscode/src/extension.ts:1
editors/vscode/src/commands.ts has 1180 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — editors/vscode/src/commands.ts:1
editors/vscode/src/download.ts has 1144 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — editors/vscode/src/download.ts:1
viz-frontend/src/treemap.ts has 1074 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — viz-frontend/src/treemap.ts:1
viz-frontend/src/graph/annotations.ts has 1050 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — viz-frontend/src/graph/annotations.ts:1
viz-frontend/src/graph/build.ts has 953 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — viz-frontend/src/graph/build.ts:1
viz-frontend/src/data.ts has 876 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — viz-frontend/src/data.ts:1
crates/napi/test.mjs has 874 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — crates/napi/test.mjs:1
viz-frontend/src/graph/render.ts has 829 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — viz-frontend/src/graph/render.ts:1
editors/vscode/src/treeView.ts has 826 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — editors/vscode/src/treeView.ts:1
REDACTED has 751 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
viz-frontend/src/graph/shared.ts has 693 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — viz-frontend/src/graph/shared.ts:1
viz-frontend/src/main.ts has 663 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — viz-frontend/src/main.ts:1
viz-frontend/src/graph/ego.ts has 622 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — viz-frontend/src/graph/ego.ts:1
tools/mutation-runner/src/adapters/vitest.mjs has 611 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — tools/mutation-runner/src/adapters/vitest.mjs:1
editors/vscode/src/complexityDecorations.ts has 481 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — editors/vscode/src/complexityDecorations.ts:1
tools/type-aware-sidecar/src/protocol.mjs has 466 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — tools/type-aware-sidecar/src/protocol.mjs:1
editors/vscode/src/analysis-utils.ts has 465 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — editors/vscode/src/analysis-utils.ts:1
editors/vscode/src/client.ts has 445 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — editors/vscode/src/client.ts:1
tools/type-aware-sidecar/src/namespace-uses.mjs has 439 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — tools/type-aware-sidecar/src/namespace-uses.mjs:1
editors/vscode/src/diagnosticFilter.ts has 432 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — editors/vscode/src/diagnosticFilter.ts:1
editors/vscode/src/license.ts has 407 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — editors/vscode/src/license.ts:1
What to do
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
Do you agree with this assessment?
R4 · Test Coverage9.6 / 10Exemplary✓ 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.
scripts/verify-release-ci.test.mjs:385 imports '../.github/workflows/', 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. — scripts/verify-release-ci.test.mjs:385
tests/conformance/fixtures/basic/src/unresolved.ts:2 imports './does-not-exist', 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. — tests/conformance/fixtures/basic/src/unresolved.ts:2
tests/fixtures/dynamic-import-literals/src/index.ts:3 imports './missing', 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. — tests/fixtures/dynamic-import-literals/src/index.ts:3
tests/fixtures/external-override-class-members/src/unresolved.ts:1 imports './generated/base', 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. — tests/fixtures/external-override-class-members/src/unresolved.ts:1
tests/fixtures/issue-2395-css-module-credit/src/index.tsx:7 imports './extensionless.module', 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. — tests/fixtures/issue-2395-css-module-credit/src/index.tsx:7
tests/fixtures/issue-3208-lib-output-source/packages/consumer/src/relative.ts:1 imports '../lib/helper.js', 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. — tests/fixtures/issue-3208-lib-output-source/packages/consumer/src/relative.ts:1
tests/fixtures/issue-399-new-url/vite.config.ts:6 imports './', 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. — tests/fixtures/issue-399-new-url/vite.config.ts:6
tests/fixtures/issue-840-new-url-directory/entry.js:7 imports './services', 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. — tests/fixtures/issue-840-new-url-directory/entry.js:7
tests/fixtures/new-url-filesystem-path/src/index.ts:12 imports './missing-worker.js', 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. — tests/fixtures/new-url-filesystem-path/src/index.ts:12
tests/fixtures/react-router-conventions/app/root.tsx:2 imports './+types/runtime', 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. — tests/fixtures/react-router-conventions/app/root.tsx:2
tests/fixtures/require-resolve-relative/src/index.js:6 imports '../dist/built-worker.js', 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. — tests/fixtures/require-resolve-relative/src/index.js:6
tests/fixtures/tanstack-router-generated-route-tree-import/src/router.tsx:2 imports './routeTree.gen', 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. — tests/fixtures/tanstack-router-generated-route-tree-import/src/router.tsx:2
tests/fixtures/unresolved-gitignored-target/src/index.ts:3 imports './missing', 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. — tests/fixtures/unresolved-gitignored-target/src/index.ts:3
tests/fixtures/unresolved-imports/src/index.ts:1 imports './nonexistent', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (2 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. — tests/fixtures/unresolved-imports/src/index.ts:1
tests/fixtures/vite-alias-project/vite.config.ts: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. — tests/fixtures/vite-alias-project/vite.config.ts:7
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) — crates/napi/test.mjs:1, REDACTED:1, scripts/generate-vex.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 REDACTED 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: REDACTED scanned for test/lint/typecheck script wiring. Deterministic presence check.
This repository declares test tooling, and the ✓ above records that declaration — but scripts/verify-release-ci.test.mjs and 14 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. — scripts/verify-release-ci.test.mjs:385
Do you agree with this assessment?
R7 · Dead Code8.9 / 10Strong✓ 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.
4208 file(s) (~71753 LoC) were excluded from dead-code analysis. This package's entry point(s) resolved, but the walk stopped one hop in: tests/fixtures/unresolved-gitignored-target/src/index.ts imports '../dist/out.js', which is not in the scanned tree. That is usually a generated or build-output module, so reachability cannot see past it and no dead-code claim is made about this package. Nothing is necessarily wrong here.
7 file(s) (~100 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — tests/coverage-producer-corpus
14 file(s) (~435 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — tests/semantic-clone-corpus
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. (×22) — assets/demo-project/src/components/Button.tsx:8, assets/demo-project/src/components/Button.tsx:10, tests/fixtures/class-value-review-builtin-array-control-capture-on/src/index.ts:2, …
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 · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.
Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.
Imported but not declared in any reachable REDACTED — installs work only by hoisting accident. — crates/napi/test.mjs:29
Declared in assets/demo-project/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
What to do
Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
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 document3.5 / 10Weak✓ Tool-verified
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.
`decodeTables` is exported and takes `value: unknown` from its caller, and it calls itself at line 50 (`decodeTables`) with a piece of `value` (and at line 57) — and nowhere in `decodeTables` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `decodeTables` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — viz-frontend/src/payload.ts:50
What to do
Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
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 async functions that make a cancellable request accept or pass on an AbortSignal (adoption curve).
Method: Roslyn scan: every async method (excluding framework-fixed overrides/Blazor handlers) checked for CancellationToken parameter presence. Deterministic, adoption percentage. 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 question: every named async function that itself makes a request an AbortSignal can cancel (global `fetch`, axios and its file-local instances, ky, ofetch) counts, and it is compliant when its parameters or body name a signal or it hands one of its own parameters to the request as options; signatures a framework fixes (JSX event handlers, route and lifecycle exports, request-first handlers, `override`, `'use server'` modules, TanStack `mutationFn`) are exempt unless they take a signal. Deterministic, adoption percentage.
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?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `RefCell` it is walking alone — safe Rust rejects a body that changes the collection its loop borrows at compile time, except through interior mutability: a `RefCell` borrowed in the loop's header stays borrowed until the loop ends, so a `borrow_mut()` of it inside the body panics with `already borrowed: BorrowMutError` and the remaining elements are never seen. Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. 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.
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×26) — viz-frontend/src/state.ts:127, viz-frontend/src/graph/shared.ts:301, tools/mutation-runner/src/companion.mjs:175, …
`.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it. — tools/mutation-runner/src/companion.mjs:100
`catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — editors/vscode/src/download.ts:257
What to do
Swallowed exception (empty catch)
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.
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 `REDACTED` 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.
`warn!` at line 234 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/graph/src/resolve/dynamic_imports.rs:234
`warn!` at line 316 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/graph/src/resolve/specifier.rs:316
`debug!` at line 560 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/graph/src/resolve/types.rs:560
`debug!` at line 106 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/graph/src/cache/store.rs:106
`debug!` at line 110 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/graph/src/cache/store.rs:110
`debug!` at line 117 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/graph/src/cache/store.rs:117
`debug!` at line 124 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/graph/src/cache/store.rs:124
`warn!` at line 1016 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/engine/src/churn.rs:1016
`warn!` at line 1023 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/engine/src/churn.rs:1023
`warn!` at line 188 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/engine/src/clock.rs:188
`warn!` at line 403 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/engine/src/discover.rs:403
`warn!` at line 1550 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/engine/src/session.rs:1550
`warn!` at line 177 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/engine/src/health/hotspots.rs:177
`warn!` at line 224 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/engine/src/health/hotspots.rs:224
`warn!` at line 231 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/engine/src/health/hotspots.rs:231
`warn!` at line 524 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/engine/src/duplication_detector/mod.rs:524
`warn!` at line 382 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/lib.rs:382
`warn!` at line 1270 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/lib.rs:1270
`debug!` at line 1276 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/lib.rs:1276
`warn!` at line 1723 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/lib.rs:1723
`debug!` at line 2209 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/lib.rs:2209
`warn!` at line 405 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/suppress.rs:405
`warn!` at line 469 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/manifest_entries.rs:469
`warn!` at line 474 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/manifest_entries.rs:474
`warn!` at line 479 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/manifest_entries.rs:479
`warn!` at line 485 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/manifest_entries.rs:485
`warn!` at line 496 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/manifest_entries.rs:496
`warn!` at line 506 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/manifest_entries.rs:506
`warn!` at line 511 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/manifest_entries.rs:511
`warn!` at line 516 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/manifest_entries.rs:516
`warn!` at line 1106 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/mod.rs:1106
`warn!` at line 1202 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/mod.rs:1202
`warn!` at line 1225 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/mod.rs:1225
`warn!` at line 1247 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/mod.rs:1247
`warn!` at line 49 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/project_glob.rs:49
`warn!` at line 992 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/registry/mod.rs:992
`warn!` at line 1573 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/registry/mod.rs:1573
`warn!` at line 1592 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/registry/mod.rs:1592
`warn!` at line 1702 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/plugins/registry/mod.rs:1702
`warn!` at line 64 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/core/src/discover/entry_points.rs:64
Other · Code Health — Whether strict null checking is enabled and not undermined by heavy `!` assertion — TypeScript's `strictNullChecks` (which `strict` turns on) is what makes `string` exclude `null` and `undefined`, and the postfix `!` is the operator that silences it.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
173/200 of this repository's type-checking configuration(s) turn on strict null checking (`"strict": true`, or `"strictNullChecks": true`). A configuration that states neither is counted as OFF, because off is tsc's own default; a solution-style one whose `"files"` is empty and whose `"references"` point at other projects is in neither number, because it checks no source itself. Where it is off, `string` admits `null` and `undefined`: passing a value that is null compiles silently and throws on the first property access.
What to do
The findings name the configuration each number was taken from and, for the assertions, the files that hold them. Turn null checking on where it is off — `"strict": true` in the base tsconfig that the others extend switches `strictNullChecks` on with the rest of the family — and then resolve the assertions rather than adding to them. A `!` on a value the checker could show to be null is a promise the author cannot check from where they are standing, and each one is a `TypeError: Cannot read properties of null` waiting for the path that makes it true; where the value genuinely cannot be null, say something the checker can see instead (narrow it with a test, make the property required, drop the `?`).
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 3 of 55 WCAG 2.2 Level A/AA success criteria (5%; ≈6% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 52 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 — 4 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 — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X6 Hand-rolled structured-format parsing — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X9 Subsumed condition operand — 7 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 44 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.
AC1 Text alternatives — No image/media element found in the parsed markup — AC1 not applicable here.
AC2 Forms & labels — No form control/button found in the parsed markup — AC2 not applicable here.
AC3 Page structure — No structural check found in the parsed markup — AC3 not applicable here.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AX1 Captive dependencies — Not applicable: this repository's JavaScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one; this repository's TypeScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
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 — compose up failed (exit 18 — an image could not be pulled) — fallow Pulling fallow Error pull access denied for fallow, repository does not exist or may require 'docker login': denied: requested access to the resource is denied Error response from daemon: pull access denied for fallow, repository does not exist or may require 'docker login': denied: requested access to the resource is denied; the earlier `compose pull` step reported: fallow Pulling fallow Error pull access denied for fallow, repository does not exist or may require 'docker login': denied: requested access to the resource is denied Error response from daemon: pull access denied for fallow, repository does not exist or may require 'docker login': denied: requested access to the resource is denied; the runtime sandbox reaches registries only through the in-fence pull-through mirror, so an image the mirror does not carry cannot be fetched — this is a limit of our sandbox, not of your stack; 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 a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no data at rest for these controls to protect.
C2 Access Controls — No access-control surface detected in the analyzed source — this repository starts no server another machine can reach (no actix-web HttpServer, axum::serve, Rocket launch, warp::serve, poem or salvo Server, tonic Server::builder, hyper or tiny_http server outside examples and tests, none bound beyond loopback). Access control is therefore N/A here — a crate is authorized by the application that serves it, 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 a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over.
D11 Test Reliability — Test reliability not scored — polyglot repository, one half's runner produced no measurement
D16 Bus Factor — single-maintainer repository — bus factor is not applicable
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; JavaScript, Python, Rust, TypeScript, html not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed Rust, TypeScript 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. Aggregate roots were found in only one source directory (cli), which is a layered codebase, not two contexts. 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 .py, .rs, .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
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) — 5 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
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 — polyglot repository, one half has no runner
DM1 Domain Modelling — applicable but not scored (4 signals for this style, 3 needed — the count is met but a required primary signal is absent): 1 aggregate root(s) (types guarding their own state behind command methods — this language has no AggregateRoot base to inherit); 184 value object(s); 1 domain event(s); its domain events are published by services or handlers — no domain entity raises one; a Domain/Aggregates/ValueObjects layer; a top-level examples/ tree: a library or framework whose examples are its consumers — these types are building blocks, not a domain
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
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model 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
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
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — coverage data present for 84 file(s), but no domain-layer files were identified: no covered file's path contains any of the markers this check keys on (/domain/, /aggregates/, /valueobjects/, /domainmodel/, .domain/, /entities/), which are matched case-insensitively anywhere in the path. With no domain partition there is nothing to compare the web/controller layer against — if this repository keeps its business rules under a folder named none of those, that naming is what the check cannot see, not the domain logic.
PF2 Allocation hygiene — Not applicable: Rust spells out every heap allocation and makes borrowed slices (&[T], &str) its ordinary parameter types, so the allocation-aware style this card rewards elsewhere is the language's baseline rather than a rung to climb. TypeScript/JavaScript runs on a garbage-collected runtime that gives a program no allocation-control idiom to choose on a hot path — no pools, stack allocation or value types — so allocation awareness is not something this code can be rated on.
S1 Web-Security Posture — No web surface: 1143 Rust file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled TLS certificate validation and obsolete TLS versions, and none was found. This repository serves no HTTP of its own — no HTTP-server crate (actix-web, axum, Rocket, warp, poem, tide, salvo, tonic, a hyper server, …) among its Cargo manifests' run-time dependencies, and no server started in its production source — so HTTPS enforcement, HSTS, cookie flags and input validation are N/A here, as they are for a C# library or worker. If this codebase starts serving HTTP, the dimension reactivates automatically.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
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.
Orphaned knowledge crates/core/src/plugins/adonis.rs:1— No living knowledge remains for this large file — its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here.
Orphaned knowledge crates/extract/src/sfc_template/glimmer.rs:1— No living knowledge remains for this large file — its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here.
AX9 · CQS / query purity· Query writes persistent state on the read path · ×1
Query writes persistent state on the read path: unused_deps$module.find_unresolved_imports crates/core/src/analyze/unused_deps.rs:2773— `unused_deps$module.find_unresolved_imports` is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command.
D10 · Test Quality· No assertions (empty test) · ×1
No assertions (empty test): placeholder tests/fixtures/vitest-include-entry-exports-workspace/packages/web/charts/src/placeholder.test.ts:3— Test method has an empty body — it asserts nothing and exercises no code.
FileTooLong: visitor/visit_impl.rs crates/extract/src/visitor/visit_impl.rs— FileTooLong — 3949 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 86% of them inside a single declaration: ModuleInfoExtractor (5 blocks, 184-6324), declaring 46 free functions. The bar is 500 significant lines; this is 3449 over it, 7.90× 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: human/check.rs crates/cli/src/report/human/check.rs— FileTooLong — 3252 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 150 free functions. The bar is 500 significant lines; this is 2752 over it, 6.50× 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: visitor/mod.rs crates/extract/src/visitor/mod.rs— FileTooLong — 2711 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 73% of them inside a single declaration: ModuleInfoExtractor (2 blocks, 620-4053). The bar is 500 significant lines; this is 2211 over it, 5.42× 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/dispatch.rs crates/cli/src/dispatch.rs— FileTooLong — 2685 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 87 free functions. The bar is 500 significant lines; this is 2185 over it, 5.37× 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: report/github_summary.rs crates/cli/src/report/github_summary.rs— FileTooLong — 2525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 107 free functions. The bar is 500 significant lines; this is 2025 over it, 5.05× 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: css_in_js/tokens.rs crates/extract/src/css_in_js/tokens.rs— FileTooLong — 2516 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 2016 over it, 5.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.
FileTooLong: src/lib.rs crates/core/src/lib.rs— FileTooLong — 2338 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 89 free functions. The bar is 500 significant lines; this is 1838 over it, 4.68× 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/output_dead_code.rs crates/types/src/output_dead_code.rs— FileTooLong — 2327 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 1827 over it, 4.65× 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/results.rs crates/types/src/results.rs— FileTooLong — 2312 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 1812 over it, 4.62× 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/security.rs crates/cli/src/security.rs— FileTooLong — 2269 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 132 free functions. The bar is 500 significant lines; this is 1769 over it, 4.54× 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/markdown_output.rs crates/api/src/markdown_output.rs— FileTooLong — 2226 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 113 free functions. The bar is 500 significant lines; this is 1726 over it, 4.45× 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: scripts/type-aware-corpus.mjs scripts/type-aware-corpus.mjs— FileTooLong — 2182 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1682 over it, 4.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: human/health.rs crates/cli/src/report/human/health.rs— FileTooLong — 2108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 113 free functions. The bar is 500 significant lines; this is 1608 over it, 4.22× 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/audit.rs crates/cli/src/audit.rs— FileTooLong — 2050 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 63 free functions. The bar is 500 significant lines; this is 1550 over it, 4.10× 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: health/scoring.rs crates/engine/src/health/scoring.rs— FileTooLong — 2040 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 71 free functions. The bar is 500 significant lines; this is 1540 over it, 4.08× 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/panel.ts viz-frontend/src/panel.ts— FileTooLong — 2006 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1506 over it, 4.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: client/mod.rs crates/api/src/type_aware/client/mod.rs— FileTooLong — 1933 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 57 free functions. The bar is 500 significant lines; this is 1433 over it, 3.87× 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/extract.rs crates/types/src/extract.rs— FileTooLong — 1923 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 37 free functions. The bar is 500 significant lines; this is 1423 over it, 3.85× 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: analyze/mod.rs crates/core/src/analyze/mod.rs— FileTooLong — 1919 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 103 free functions. The bar is 500 significant lines; this is 1419 over it, 3.84× 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/viz.rs crates/engine/src/viz.rs— FileTooLong — 1905 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 61 free functions. The bar is 500 significant lines; this is 1405 over it, 3.81× 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: plugins/config_parser.rs crates/core/src/plugins/config_parser.rs— FileTooLong — 1847 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 148 free functions. The bar is 500 significant lines; this is 1347 over it, 3.69× 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/impact.rs crates/cli/src/impact.rs— FileTooLong — 1846 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 109 free functions. The bar is 500 significant lines; this is 1346 over it, 3.69× 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: analyze/unused_deps.rs crates/core/src/analyze/unused_deps.rs— FileTooLong — 1846 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 83 free functions. The bar is 500 significant lines; this is 1346 over it, 3.69× 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/ci.rs crates/cli/src/ci.rs— FileTooLong — 1808 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 82 free functions. The bar is 500 significant lines; this is 1308 over it, 3.62× 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: baseline/mod.rs crates/engine/src/baseline/mod.rs— FileTooLong — 1790 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 1290 over it, 3.58× 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.
Repeated repair: crates/extract/src/cache/types.rs crates/extract/src/cache/types.rs:366— crates/extract/src/cache/types.rs changed 128 times in last 90 days and 97 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 1 (its worst body is CachedModule::source_fingerprint at line 366), 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(extract): credit members on the return type of a method called through this (#3971)”; “fix(extract): credit members on the declared return type of a method (#3927)”; “fix(security): trust module-relative path bases and check every path segment (#3926)”; “fix(extract): resolve store aliases declared inside a function body (#3938)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/extract/src/cache/types.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: crates/graph/src/cache/mod.rs crates/graph/src/cache/mod.rs:85— crates/graph/src/cache/mod.rs changed 73 times in last 90 days and 55 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 CachedResolveResult::from_resolve_result at line 85), 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(resolve): map dist/src workspace exports to source when the build output exists (#3832)”; “fix(vite): credit Sass files loaded by additionalData, aliases and Vuetify (#3833)”; “fix(resolve): credit workspace REDACTED imports and function-scoped createRequire (#3700)”; “fix(extract): keep component invocations after a < in template text (#3581)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/graph/src/cache/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.
Repeated repair: crates/types/src/extract.rs crates/types/src/extract.rs:1195— crates/types/src/extract.rs changed 59 times in last 90 days and 33 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 FileBranching::from_units at line 1195), 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(audit): match styling findings without the line number (#3972)”; “fix(health): retain top-level runtime statements in coverage gaps (#3578)”; “fix(graph): apply negative import.meta.glob entries and escape literal pattern text (#3537)”; “fix: credit fixtures of an extend on an imported Playwright test (#3529)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/types/src/extract.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: crates/core/src/lib.rs crates/core/src/lib.rs:230— crates/core/src/lib.rs changed 49 times in last 90 days and 33 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is fallow_core::update_cache at line 230), 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(scripts): credit the npm alias that installs a script binary (#3846)”; “fix(trace): name the plugin that marks an export as used (#3757)”; “fix(scripts): resolve workspace binaries and CI working directories (#3718)”; “fix: hide covered parse degradations and quiet warnings, record baseline install state (#3716)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/core/src/lib.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: crates/core/src/plugins/mod.rs crates/core/src/plugins/mod.rs:346— crates/core/src/plugins/mod.rs changed 56 times in last 90 days and 30 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is fallow_core::plugins::federation_trace_provenance at line 346), 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(exports): credit CommonJS config keys through the default export (#3931)”; “fix(trace): name the plugin that marks an export as used (#3757)”; “fix(plugins): credit the export that a Serverless handler names (#3741)”; “fix(plugins): credit the exports that tools read from their config files (#3730)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/core/src/plugins/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.
Repeated repair: crates/core/src/analyze/mod.rs crates/core/src/analyze/mod.rs:2141— crates/core/src/analyze/mod.rs changed 53 times in last 90 days and 29 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 fallow_core::analyze::populate_pnpm_catalog_findings at line 2141), 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(core): keep production-only class and store member suppressions out of the stale list (#3975)”; “fix(security): apply per-path overrides to the dead-code note (#3925)”; “fix: keep semantic evidence within analysis scope (#3907)”; “fix: enforce explicit error policies for advisory rules (#3906)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/core/src/analyze/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.
Repeated repair: crates/core/src/analyze/unused_exports.rs crates/core/src/analyze/unused_exports.rs:1032— crates/core/src/analyze/unused_exports.rs changed 35 times in last 90 days and 25 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 14 (its worst body is fallow_core::analyze::unused_exports::partition_by_common_importer at line 1032), 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(exports): credit CommonJS config keys through the default export (#3931)”; “fix(extract): size the parse stack from the source (#3809)”; “fix: credit peers of script-used hosts and skip adapter duplicate exports (#3735)”; “fix(plugins): credit the exports that tools read from their config files (#3730)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/core/src/analyze/unused_exports.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: crates/core/src/scripts/mod.rs crates/core/src/scripts/mod.rs:1555— crates/core/src/scripts/mod.rs changed 29 times in last 90 days and 23 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 14 (its worst body is fallow_core::scripts::referenced_package_scripts at line 1555), 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(scripts): read local shell helpers that package scripts and CI run (#3935)”; “fix(scripts): credit the npm alias that installs a script binary (#3846)”; “fix(scripts): resolve workspace binaries and CI working directories (#3718)”; “fix: credit test runner directory and default patterns (#3380)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/core/src/scripts/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.
Repeated repair: crates/core/src/plugins/registry/mod.rs crates/core/src/plugins/registry/mod.rs:941— crates/core/src/plugins/registry/mod.rs changed 28 times in last 90 days and 21 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is PluginRegistry::resolve_script_config_files at line 941), 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(plugins): credit the export that a Serverless handler names (#3741)”; “fix(plugins): credit the exports that tools read from their config files (#3730)”; “fix(plugins): credit the default export of plugin config files (#3715)”; “fix(vitest): keep includes of script configs and named vite configs (#3713)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/core/src/plugins/registry/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.
Repeated repair: crates/graph/src/resolve/specifier.rs crates/graph/src/resolve/specifier.rs:996— crates/graph/src/resolve/specifier.rs changed 28 times in last 90 days and 20 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is fallow_graph::resolve::specifier::try_tsconfig_alias_target at line 996), 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(resolve): escape the tsconfig directory in include globs (#3951)”; “fix(resolve): match tsconfig include patterns that start with ./ (#3947)”; “fix(resolve): map dist/src workspace exports to source when the build output exists (#3832)”; “fix(resolve): credit the target package of tsconfig paths into node_modules (#3789)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/graph/src/resolve/specifier.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: crates/api/src/markdown_output.rs crates/api/src/markdown_output.rs:2912— crates/api/src/markdown_output.rs changed 37 times in last 90 days and 19 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is fallow_api::markdown_output::walkthrough_markdown_badges at line 2912), 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(audit): match styling findings without the line number (#3972)”; “fix(health): honor complexity suppressions in CRAP scoring (#3334)”; “fix: use workspaces.patterns in audit base and credit config-string packages (#3312)”; “fix(output): show the workspaces that declare and import a root dependency (#3224)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/api/src/markdown_output.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: crates/graph/src/resolve/mod.rs crates/graph/src/resolve/mod.rs:197— crates/graph/src/resolve/mod.rs changed 29 times in last 90 days and 19 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 fallow_graph::resolve::resolve_all_imports_with_session at line 197), 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(resolve): escape the tsconfig directory in include globs (#3951)”; “fix(resolve): credit the target package of tsconfig paths into node_modules (#3789)”; “fix(workspace): skip gitignored members in dependency findings and resolve workspace aliases (#3788)”; “fix(graph): resolve dynamic import patterns that start with ../ (#3558)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/graph/src/resolve/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.
Repeated repair: crates/graph/src/resolve/fallbacks.rs crates/graph/src/resolve/fallbacks.rs:56— crates/graph/src/resolve/fallbacks.rs changed 23 times in last 90 days and 18 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is fallow_graph::resolve::fallbacks::try_path_alias_fallback at line 56), 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(resolve): map dist/src workspace exports to source when the build output exists (#3832)”; “fix(vite): credit Sass files loaded by additionalData, aliases and Vuetify (#3833)”; “fix(resolve): credit the target package of tsconfig paths into node_modules (#3789)”; “fix(resolve): credit workspace REDACTED imports and function-scoped createRequire (#3700)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/graph/src/resolve/fallbacks.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: crates/engine/src/session.rs crates/engine/src/session.rs:1558— crates/engine/src/session.rs changed 31 times in last 90 days and 17 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is fallow_engine::session::update_parse_cache at line 1558), 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(trace): name the plugin that marks an export as used (#3757)”; “fix: hide covered parse degradations and quiet warnings, record baseline install state (#3716)”; “fix(cache): write cache files through unique temp files and evict by last-seen scope (#3484)”; “fix(analysis): preserve callback-produced class members (#3345)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/engine/src/session.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: crates/cli/src/report/human/health.rs crates/cli/src/report/human/health.rs:45— crates/cli/src/report/human/health.rs changed 27 times in last 90 days and 17 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 fallow_cli::report::human::health::print_health_human at line 45), 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(health): honor complexity suppressions in CRAP scoring (#3334)”; “fix(health): count thresholded hotspots and guard score trends”; “fix: link to the docs on fallow.tools/docs (#3090)”; “fix(cli): pluralize count labels in human output (#3040)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/cli/src/report/human/health.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: crates/engine/src/core_backend.rs crates/engine/src/core_backend.rs:174— crates/engine/src/core_backend.rs changed 28 times in last 90 days and 16 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 fallow_engine::core_backend::discover_files_config_candidates_and_diagnostics at line 174), 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: credit peers of script-used hosts and skip adapter duplicate exports (#3735)”; “fix(trace): name the plugin that marks an export as used (#3757)”; “fix(mutation): prune the config object of always-used plugin config files (#3511)”; “fix(mutation): prune the config object of tool config files (#3500)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/engine/src/core_backend.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: crates/core/src/plugins/registry/helpers.rs crates/core/src/plugins/registry/helpers.rs:428— crates/core/src/plugins/registry/helpers.rs changed 20 times in last 90 days and 16 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is fallow_core::plugins::registry::helpers::discover_config_files at line 428), 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(plugins): credit the export that a Serverless handler names (#3741)”; “fix(plugins): credit the exports that tools read from their config files (#3730)”; “fix(plugins): credit the default export of plugin config files (#3715)”; “fix(vitest): keep bench entries, scope nested includes, credit reporter files (#3695)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/core/src/plugins/registry/helpers.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: crates/types/src/trace.rs crates/types/src/trace.rs:547— crates/types/src/trace.rs changed 25 times in last 90 days and 15 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 6 (its worst body is ExportTrace::apply_plugin_credits at line 547), 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: credit peers of script-used hosts and skip adapter duplicate exports (#3735)”; “fix(trace): name the plugin that marks an export as used (#3757)”; “fix(trace): count forwarding re-exports as found in search visibility (#3385)”; “fix(trace): list each dependency importer once (#3283)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/types/src/trace.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: crates/output/src/health_scores.rs crates/output/src/health_scores.rs:822— crates/output/src/health_scores.rs changed 27 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is ExceededThreshold::from_bools at line 822), 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(audit): report growth of an exceeded metric as worsened (#3750)”; “fix(audit): do not gate new-only on estimated CRAP alone (#3747)”; “fix(health): honor complexity suppressions in CRAP scoring (#3334)”; “fix(health): count thresholded hotspots and guard score trends”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/output/src/health_scores.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: crates/cli/src/combined/output.rs crates/cli/src/combined/output.rs:158— crates/cli/src/combined/output.rs changed 27 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is fallow_cli::combined::output::print_machine_combined_report at line 158), 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(cli): name the unenforced failing gates of a bare machine run (#3875)”; “fix(cli): apply the coverage-gaps rule on bare fallow (#3830)”; “fix(cli): name the failed gate on stderr when a run exits 1 (#3115)”; “fix(dupes): fail on clone groups with --fail-on-issues and --ci (#3057)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/cli/src/combined/output.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: crates/extract/src/cache/conversion.rs crates/extract/src/cache/conversion.rs:48— crates/extract/src/cache/conversion.rs changed 25 times in last 90 days and 14 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 fallow_extract::cache::conversion::cached_exports_to_module at line 48), 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(graph): apply negative import.meta.glob entries and escape literal pattern text (#3537)”; “fix(cache): write cache files through unique temp files and evict by last-seen scope (#3484)”; “fix(extract): credit the whole module when a dynamic import value escapes (#3412)”; “fix(analysis): credit class members that override a package or global base (#3373)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/extract/src/cache/conversion.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: crates/config/src/workspace/mod.rs crates/config/src/workspace/mod.rs:412— crates/config/src/workspace/mod.rs changed 23 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is fallow_config::workspace::collect_declared_patterns at line 412), 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(workspace): skip gitignored members in dependency findings and resolve workspace aliases (#3788)”; “fix(workspace): report missing pattern dirs and nested pnpm projects (#3710)”; “fix: hide covered parse degradations and quiet warnings, record baseline install state (#3716)”; “fix(workspace): skip workspace globs that can leave the project root (#3574)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/config/src/workspace/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.
Repeated repair: crates/mcp/src/tools/mod.rs crates/mcp/src/tools/mod.rs:895— crates/mcp/src/tools/mod.rs changed 21 times in last 90 days and 12 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 fallow_mcp::tools::collect_semantic_completeness at line 895), 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(mcp): stop Code Mode runs when the client cancels the request (#3501)”; “fix(mcp): stop direct tool calls on cancel and share typed options (#3492)”; “fix(mcp): apply the same exit, size and stdin rules on every route (#3476)”; “fix(mcp): run the CLI for trace_export when type-aware analysis is on (#3403)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/mcp/src/tools/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.
Repeated repair: crates/cli/src/audit_cache.rs crates/cli/src/audit_cache.rs:265— crates/cli/src/audit_cache.rs changed 19 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is fallow_cli::audit_cache::complexity_from_cached at line 265), 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(audit): match styling findings without the line number (#3972)”; “fix: enforce explicit error policies for advisory rules (#3906)”; “fix(workspace): report missing pattern dirs and nested pnpm projects (#3710)”; “fix(audit): report growth of an exceeded metric as worsened (#3750)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/cli/src/audit_cache.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: crates/mcp/src/tools/audit.rs crates/mcp/src/tools/audit.rs:104— crates/mcp/src/tools/audit.rs changed 18 times in last 90 days and 11 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 fallow_mcp::tools::audit::build_audit_args at line 104), 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(api): deregister the programmatic base snapshot before analysis (#3941)”; “fix(audit): do not gate new-only on estimated CRAP alone (#3747)”; “fix(mcp): stop direct tool calls on cancel and share typed options (#3492)”; “fix(api): let an explicit type_aware choice win over the config (#3401)”. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/mcp/src/tools/audit.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.
fallow_core::plugins::typescript::parse_tsconfig_references (cognitive 62) crates/core/src/plugins/typescript.rs:422— fallow_core::plugins::typescript::parse_tsconfig_references has cognitive complexity 62 (threshold 15). Drivers by points: if/else 9 (39 pts), loops 3 (11 pts), match/switch 2 (11 pts), boolean chains 1 (nesting depth added 47). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
fallow_core::analyze::members::propagate_computed_enum_key_accesses (cognitive 47) crates/core/src/analyze/members/mod.rs:1336— fallow_core::analyze::members::propagate_computed_enum_key_accesses has cognitive complexity 47 (threshold 15). Drivers by points: loops 10 (25 pts), if/else 6 (20 pts), boolean chains 2 (nesting depth added 29). 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.
fallow_core::analyze::absent_component_prop::find_absent_component_props (cognitive 43) crates/core/src/analyze/absent_component_prop.rs:483— fallow_core::analyze::absent_component_prop::find_absent_component_props has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 9 (17 pts), boolean chains 4 (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.
fallow_core::analyze::members::factory::propagate_exported_object_instance_accesses (cognitive 42) crates/core/src/analyze/members/factory.rs:197— fallow_core::analyze::members::factory::propagate_exported_object_instance_accesses has cognitive complexity 42 (threshold 15). Drivers by points: if/else 6 (26 pts), loops 5 (15 pts), boolean chains 1 (nesting depth added 30). 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.
fallow_core::analyze::members::heritage::build_interface_implementation_contracts (cognitive 42) crates/core/src/analyze/members/heritage.rs:566— fallow_core::analyze::members::heritage::build_interface_implementation_contracts has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (27 pts), loops 5 (15 pts) (nesting depth added 30). 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.
fallow_core::analyze::members::collect_direct_member_accesses (cognitive 41) crates/core/src/analyze/members/mod.rs:1726— fallow_core::analyze::members::collect_direct_member_accesses has cognitive complexity 41 (threshold 15). Drivers by points: loops 9 (24 pts), if/else 5 (16 pts), boolean chains 1 (nesting depth added 26). 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.
fallow_core::plugins::webpack::walk_rule (cognitive 39) crates/core/src/plugins/webpack.rs:207— fallow_core::plugins::webpack::walk_rule has cognitive complexity 39 (threshold 15). Drivers by points: if/else 5 (20 pts), match/switch 4 (13 pts), loops 2 (5 pts), boolean chains 1 (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.
fallow_core::analyze::package_json_utils::find_dep_line_in_json (cognitive 37) crates/core/src/analyze/package_json_utils.rs:11— fallow_core::analyze::package_json_utils::find_dep_line_in_json has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (36 pts), loops 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
fallow_core::analyze::unused_deps::add_source_package_manifests (cognitive 37) crates/core/src/analyze/unused_deps.rs:2252— fallow_core::analyze::unused_deps::add_source_package_manifests has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 4, loops 2 (3 pts) (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.
fallow_core::scripts::ci_references::github_script_bodies (cognitive 37) crates/core/src/scripts/ci_references.rs:234— fallow_core::scripts::ci_references::github_script_bodies has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (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.
fallow_core::analyze::effect::find_unused_layers (cognitive 36) crates/core/src/analyze/effect.rs:434— fallow_core::analyze::effect::find_unused_layers has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 9 (15 pts), boolean chains 3 (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.
fallow_core::analyze::members::factory::factory_return_object_property_classes (cognitive 36) crates/core/src/analyze/members/factory.rs:308— fallow_core::analyze::members::factory::factory_return_object_property_classes has cognitive complexity 36 (threshold 15). Drivers by points: loops 5 (17 pts), if/else 5 (15 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 24). 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.
fallow_core::analyze::absent_component_prop::emit_findings (cognitive 35) crates/core/src/analyze/absent_component_prop.rs:614— fallow_core::analyze::absent_component_prop::emit_findings has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 5, loops 2 (3 pts) (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.
fallow_core::analyze::members::instance::collect_inherited_bindings (cognitive 35) crates/core/src/analyze/members/instance.rs:173— fallow_core::analyze::members::instance::collect_inherited_bindings has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 5 (8 pts), boolean chains 2 (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.
fallow_core::analyze::package_cycles::strongly_connected_packages (cognitive 35) crates/core/src/analyze/package_cycles.rs:509— fallow_core::analyze::package_cycles::strongly_connected_packages has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 6 (12 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.
fallow_core::discover::infrastructure::collect_flag_value_file_refs (cognitive 34) crates/core/src/discover/infrastructure.rs:181— fallow_core::discover::infrastructure::collect_flag_value_file_refs has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (6 pts), match/switch 2 (6 pts), boolean chains 5 (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.
fallow_core::scripts::shell::advance_past_package_manager (cognitive 34) crates/core/src/scripts/shell.rs:422— fallow_core::scripts::shell::advance_past_package_manager has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 7, loops 2 (4 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.
fallow_core::plugins::config_parser::find_config_object (cognitive 33) crates/core/src/plugins/config_parser.rs:1342— fallow_core::plugins::config_parser::find_config_object has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (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.
fallow_core::plugins::prisma::strip_schema_comments (cognitive 33) crates/core/src/plugins/prisma.rs:159— fallow_core::plugins::prisma::strip_schema_comments has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 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.
fallow_core::scripts::ci_references::matrix_values (cognitive 33) crates/core/src/scripts/ci_references.rs:121— fallow_core::scripts::ci_references::matrix_values has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (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.
fallow_core::plugins::oxlint::extract_ultracite_selected_js_plugin_dependencies (cognitive 32) crates/core/src/plugins/oxlint.rs:113— fallow_core::plugins::oxlint::extract_ultracite_selected_js_plugin_dependencies has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 2 (3 pts), boolean chains 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.
fallow_core::scripts::referenced_package_scripts (cognitive 32) crates/core/src/scripts/mod.rs:1555— fallow_core::scripts::referenced_package_scripts has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (8 pts), boolean chains 3 (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.
fallow_core::discover::parse_scripts::collect_script_file_refs (cognitive 31) crates/core/src/discover/parse_scripts.rs:70— fallow_core::discover::parse_scripts::collect_script_file_refs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (6 pts), boolean chains 3, match/switch 1 (2 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.
fallow_core::scripts::hooks::js_string_literals (cognitive 31) crates/core/src/scripts/hooks.rs:241— fallow_core::scripts::hooks::js_string_literals has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (10 pts), boolean chains 6, match/switch 1 (2 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.
fallow_core::analyze::members::factory_callback::propagate_callback_factory_accesses (cognitive 28) crates/core/src/analyze/members/factory_callback.rs:16— fallow_core::analyze::members::factory_callback::propagate_callback_factory_accesses has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 3 (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.
Hotspot: crates/types/src/workspace.rs crates/types/src/workspace.rs:1542— crates/types/src/workspace.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in fallow_types::workspace::render_message at line 1542. 23 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/types/src/workspace.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: crates/cli/src/check/mod.rs crates/cli/src/check/mod.rs:124— crates/cli/src/check/mod.rs changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in IssueFilters::enable_cli_filter_flag at line 124. 29 of those changes were fix/bug commits, and the other 30 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/cli/src/check/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: crates/api/src/lib.rs crates/api/src/lib.rs:587— crates/api/src/lib.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in DeadCodeFilters::enable_cli_filter_flag at line 587. 18 of those changes were fix/bug commits, and the other 35 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/api/src/lib.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: crates/extract/src/visitor/visit_impl.rs crates/extract/src/visitor/visit_impl.rs:188— crates/extract/src/visitor/visit_impl.rs changed 70 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ModuleInfoExtractor::record_factory_return_function at line 188. 53 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/extract/src/visitor/visit_impl.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: crates/api/src/audit_keys.rs crates/api/src/audit_keys.rs:146— crates/api/src/audit_keys.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in DeadCodeAuditLedger::annotate_results at line 146. 15 of those changes were fix/bug commits, and the other 17 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/api/src/audit_keys.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: crates/cli/src/lib.rs crates/cli/src/lib.rs:453— crates/cli/src/lib.rs changed 98 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in fallow_cli::run_command at line 453. 35 of those changes were fix/bug commits, and the other 63 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/cli/src/lib.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: crates/config/src/config/rules.rs crates/config/src/config/rules.rs:593— crates/config/src/config/rules.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in RulesConfig::severity_for_kind at line 593. 4 of those changes were fix/bug commits, and the other 14 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/config/src/config/rules.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: crates/extract/src/visitor/mod.rs crates/extract/src/visitor/mod.rs:1339— crates/extract/src/visitor/mod.rs changed 67 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in ModuleInfoExtractor::subclass_reference_candidates at line 1339. 46 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/extract/src/visitor/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: crates/cli/src/cli_startup.rs crates/cli/src/cli_startup.rs:685— crates/cli/src/cli_startup.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in fallow_cli::cli_startup::command_without_global_baseline at line 685. 11 of those changes were fix/bug commits, and the other 13 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/cli/src/cli_startup.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: crates/output/src/dead_code_sarif.rs crates/output/src/dead_code_sarif.rs:1214— crates/output/src/dead_code_sarif.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in fallow_output::dead_code_sarif::dead_code_rule_severity at line 1214. 9 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/output/src/dead_code_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: crates/output/src/check.rs crates/output/src/check.rs:1194— crates/output/src/check.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in fallow_output::check::suppression_kind_rank at line 1194. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/output/src/check.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: crates/core/src/analyze/unused_deps.rs crates/core/src/analyze/unused_deps.rs:2252— crates/core/src/analyze/unused_deps.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in fallow_core::analyze::unused_deps::add_source_package_manifests at line 2252. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/core/src/analyze/unused_deps.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: crates/api/src/explain.rs crates/api/src/explain.rs:770— crates/api/src/explain.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in fallow_api::explain::member_import_rule_guide at line 770. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/api/src/explain.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: crates/types/src/suppress.rs crates/types/src/suppress.rs:388— crates/types/src/suppress.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in IssueKind::from_discriminant at line 388. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/types/src/suppress.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: crates/cli/src/health/mod.rs crates/cli/src/health/mod.rs:399— crates/cli/src/health/mod.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in fallow_cli::health::run_health at line 399. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/cli/src/health/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: crates/cli/src/report/github_summary.rs crates/cli/src/report/github_summary.rs:3011— crates/cli/src/report/github_summary.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in fallow_cli::report::github_summary::render_fix_summary at line 3011. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/cli/src/report/github_summary.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: crates/engine/src/health/scoring.rs crates/engine/src/health/scoring.rs:1370— crates/engine/src/health/scoring.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in IstanbulFileCoverage::lookup at line 1370. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/engine/src/health/scoring.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: editors/vscode/src/extension.ts editors/vscode/src/extension.ts:169— editors/vscode/src/extension.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in extension.activate at line 169. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- editors/vscode/src/extension.ts`: 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: crates/mcp/src/tools/code_mode_tools.rs crates/mcp/src/tools/code_mode_tools.rs:151— crates/mcp/src/tools/code_mode_tools.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in CodeModeTool::from_name at line 151. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/mcp/src/tools/code_mode_tools.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: crates/cli/src/report/human/mod.rs crates/cli/src/report/human/mod.rs:294— crates/cli/src/report/human/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in fallow_cli::report::human::section_issue_kind at line 294. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/cli/src/report/human/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: crates/extract/src/parse.rs crates/extract/src/parse.rs:1669— crates/extract/src/parse.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in fallow_extract::parse::subclass_reference_spans at line 1669. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/extract/src/parse.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: crates/cli/src/report/human/check.rs crates/cli/src/report/human/check.rs:3544— crates/cli/src/report/human/check.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in fallow_cli::report::human::check::collect_framework_rules at line 3544. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/cli/src/report/human/check.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: crates/cli/src/audit_brief.rs crates/cli/src/audit_brief.rs:1802— crates/cli/src/audit_brief.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in fallow_cli::audit_brief::decision_surface_lines at line 1802. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/cli/src/audit_brief.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: crates/engine/src/dead_code.rs crates/engine/src/dead_code.rs:850— crates/engine/src/dead_code.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in fallow_engine::dead_code::apply_base_collection_rules at line 850. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/engine/src/dead_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.
Hotspot: crates/cli/src/check/output.rs crates/cli/src/check/output.rs:57— crates/cli/src/check/output.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in fallow_cli::check::output::handle_type_aware_trace_output at line 57. 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-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-30 12:15:57 +00:00' --until='2026-10-28 12:15:57 +00:00' --full-history --no-merges -- crates/cli/src/check/output.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.
fallow_extract::visitor::helpers::extract_class_generic_instance_bindings (cognitive 53) crates/extract/src/visitor/helpers.rs:1509— fallow_extract::visitor::helpers::extract_class_generic_instance_bindings has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (46 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 37). 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.
fallow_extract::sfc_props::collect_define_props_names (cognitive 45) crates/extract/src/sfc_props.rs:377— fallow_extract::sfc_props::collect_define_props_names has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 3 (10 pts), match/switch 3 (9 pts), boolean chains 1 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
fallow_extract::sfc_template::component_contracts::collect (cognitive 42) REDACTED:11— fallow_extract::sfc_template::component_contracts::collect has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 10, 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.
fallow_extract::parse::subclass_reference_spans (cognitive 40) crates/extract/src/parse.rs:1669— fallow_extract::parse::subclass_reference_spans has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 4 (8 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 24). 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.
fallow_extract::sfc_props::collect_define_emits_names (cognitive 39) crates/extract/src/sfc_props.rs:1038— fallow_extract::sfc_props::collect_define_emits_names has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 3 (10 pts), loops 2 (7 pts) (nesting depth added 26). 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.
fallow_extract::css_in_js::tokens::is_stylex_conditional_object (cognitive 31) crates/extract/src/css_in_js/tokens.rs:3229— fallow_extract::css_in_js::tokens::is_stylex_conditional_object has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (27 pts), match/switch 1 (3 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.
fallow_extract::parse::parse_source_to_module_unbounded (cognitive 28) crates/extract/src/parse.rs:49— fallow_extract::parse::parse_source_to_module_unbounded has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (7 pts), boolean chains 2 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
fallow_extract::sfc_template::recovery::section_ends (cognitive 28) crates/extract/src/sfc_template/recovery.rs:79— fallow_extract::sfc_template::recovery::section_ends has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 3 (7 pts), loops 2 (3 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.
fallow_extract::parse::compute_semantic_usage_with_candidates (cognitive 27) crates/extract/src/parse.rs:1755— fallow_extract::parse::compute_semantic_usage_with_candidates has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (3 pts) (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.
fallow_extract::visitor::helpers::extract_identifiers_from_host_expr (cognitive 27) crates/extract/src/visitor/helpers.rs:248— fallow_extract::visitor::helpers::extract_identifiers_from_host_expr has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 4, loops 2 (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.
fallow_extract::sfc_template::shared::collect_pattern_usage (cognitive 25) crates/extract/src/sfc_template/shared.rs:241— fallow_extract::sfc_template::shared::collect_pattern_usage has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (7 pts), boolean chains 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.
fallow_extract::visitor::visit_impl_factory_returns::flatten_object_shape (cognitive 25) crates/extract/src/visitor/visit_impl_factory_returns.rs:467— fallow_extract::visitor::visit_impl_factory_returns::flatten_object_shape has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (11 pts), loops 1 (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.
fallow_extract::css_classes::is_typo_edit (cognitive 24) crates/extract/src/css_classes.rs:196— fallow_extract::css_classes::is_typo_edit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, 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.
fallow_extract::visitor::helpers::extract_class_instance_bindings_with_origins (cognitive 24) crates/extract/src/visitor/helpers.rs:1378— fallow_extract::visitor::helpers::extract_class_instance_bindings_with_origins has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 5 (9 pts), loops 2 (5 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.
fallow_extract::component_contracts::runtime_vue_shapes (cognitive 23) crates/extract/src/component_contracts/mod.rs:1266— fallow_extract::component_contracts::runtime_vue_shapes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (9 pts), loops 2 (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.
fallow_extract::sfc_props::scan_define_emits_statement (cognitive 23) crates/extract/src/sfc_props.rs:945— fallow_extract::sfc_props::scan_define_emits_statement has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 12). 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.
fallow_extract::sfc_props::scan_define_props_statement (cognitive 22) crates/extract/src/sfc_props.rs:93— fallow_extract::sfc_props::scan_define_props_statement has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 12). 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.
fallow_extract::sfc_template::component_contracts::named_attribute_supply (cognitive 22) REDACTED:349— fallow_extract::sfc_template::component_contracts::named_attribute_supply has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, match/switch 1 (nesting depth added 5). 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.
fallow_extract::binding_references::collect_through_wrappers (cognitive 21) crates/extract/src/binding_references.rs:110— fallow_extract::binding_references::collect_through_wrappers has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts), boolean chains 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.
fallow_extract::css::mask_css_module_global_scopes (cognitive 21) crates/extract/src/css.rs:894— fallow_extract::css::mask_css_module_global_scopes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 2, match/switch 1 (2 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.
fallow_extract::css_classes::is_edit_distance_one (cognitive 21) crates/extract/src/css_classes.rs:142— fallow_extract::css_classes::is_edit_distance_one has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (3 pts), boolean chains 1 (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.
fallow_extract::html::collect_asset_refs (cognitive 21) crates/extract/src/html.rs:100— fallow_extract::html::collect_asset_refs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, loops 3 (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.
fallow_extract::sfc_template::angular::split_pipes (cognitive 21) crates/extract/src/sfc_template/angular.rs:927— fallow_extract::sfc_template::angular::split_pipes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 2, match/switch 1 (2 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.
fallow_extract::sfc_template::vue::find_template_body_end (cognitive 21) crates/extract/src/sfc_template/vue.rs:309— fallow_extract::sfc_template::vue::find_template_body_end has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 3, loops 1 (nesting depth added 10). 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.
fallow_extract::visitor::visit_impl_server_actions::record_declaration (cognitive 21) crates/extract/src/visitor/visit_impl_server_actions.rs:168— fallow_extract::visitor::visit_impl_server_actions::record_declaration has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 10). 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.
ModuleInfoExtractor::record_program_namespace_import_locals (cognitive 40) crates/extract/src/visitor/visit_impl.rs:1184— ModuleInfoExtractor::record_program_namespace_import_locals has cognitive complexity 40 (threshold 15). Drivers by points: if/else 6 (25 pts), match/switch 3 (11 pts), loops 2 (4 pts) (nesting depth added 29). 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.
ModuleInfoExtractor::record_direct_object_binding_fallback (cognitive 37) crates/extract/src/visitor/visit_impl_object_binding_patterns.rs:137— ModuleInfoExtractor::record_direct_object_binding_fallback has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 2 (6 pts), match/switch 3 (5 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.
ModuleInfoExtractor::join_constructor_outcomes (cognitive 35) crates/extract/src/visitor/visit_impl_constructor_alternatives.rs:355— ModuleInfoExtractor::join_constructor_outcomes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (29 pts), boolean chains 3, loops 2 (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.
ModuleInfoExtractor::callback_result_proof (cognitive 34) crates/extract/src/visitor/visit_impl_callback_properties.rs:68— ModuleInfoExtractor::callback_result_proof has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 18). 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.
ModuleInfoExtractor::preseed_class_array_fields (cognitive 32) crates/extract/src/visitor/visit_impl.rs:735— ModuleInfoExtractor::preseed_class_array_fields has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (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.
ModuleInfoExtractor::complete_binding_producer_calls (cognitive 31) crates/extract/src/visitor/visit_impl_object_bindings.rs:968— ModuleInfoExtractor::complete_binding_producer_calls has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 5, loops 2 (4 pts) (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.
ModuleInfoExtractor::resolve_factory_return_candidates (cognitive 30) crates/extract/src/visitor/mod.rs:2876— ModuleInfoExtractor::resolve_factory_return_candidates has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 5 (8 pts) (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.
ModuleInfoExtractor::record_factory_return_function (cognitive 30) crates/extract/src/visitor/visit_impl.rs:188— ModuleInfoExtractor::record_factory_return_function has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 11 (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.
ModuleInfoExtractor::resolve_playwright_factory_call_definitions (cognitive 29) crates/extract/src/visitor/mod.rs:2600— ModuleInfoExtractor::resolve_playwright_factory_call_definitions has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 9 (12 pts), boolean chains 2, match/switch 1 (2 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.
ModuleInfoExtractor::record_declarator_instance_bindings (cognitive 29) crates/extract/src/visitor/visit_impl.rs:2674— ModuleInfoExtractor::record_declarator_instance_bindings has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (9 pts), boolean chains 7 (nesting depth added 10). 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.
ModuleInfoExtractor::record_exported_direct_object_binding_facts (cognitive 29) crates/extract/src/visitor/visit_impl_object_bindings.rs:1029— ModuleInfoExtractor::record_exported_direct_object_binding_facts has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 4 (8 pts), match/switch 1 (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.
ModuleInfoExtractor::record_walk_order_member_access (cognitive 27) crates/extract/src/visitor/mod.rs:1803— ModuleInfoExtractor::record_walk_order_member_access has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (3 pts), boolean chains 2 (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.
ModuleInfoExtractor::record_factory_return_candidate (cognitive 27) crates/extract/src/visitor/visit_impl.rs:399— ModuleInfoExtractor::record_factory_return_candidate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 4 (6 pts), boolean chains 2, loops 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.
ModuleInfoExtractor::handle_cjs_member_export (cognitive 26) crates/extract/src/visitor/visit_impl.rs:3348— ModuleInfoExtractor::handle_cjs_member_export has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, loops 1 (4 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ModuleInfoExtractor::visit_assignment_expression (cognitive 26) crates/extract/src/visitor/visit_impl.rs:4840— ModuleInfoExtractor::visit_assignment_expression has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 5, match/switch 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.
ModuleInfoExtractor::record_program_spy_api_locals (cognitive 25) crates/extract/src/visitor/visit_impl_spy_calls.rs:74— ModuleInfoExtractor::record_program_spy_api_locals has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 3 (9 pts), loops 2 (4 pts), boolean chains 1 (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.
ModuleInfoExtractor::subclass_reference_candidates (cognitive 24) crates/extract/src/visitor/mod.rs:1339— ModuleInfoExtractor::subclass_reference_candidates has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5 (7 pts), match/switch 1 (2 pts) (nesting depth added 10). 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.
ModuleInfoExtractor::expand_typed_property_compound (cognitive 24) crates/extract/src/visitor/mod.rs:3476— ModuleInfoExtractor::expand_typed_property_compound has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 1, 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.
ModuleInfoExtractor::resolve_factory_property_observations (cognitive 24) crates/extract/src/visitor/visit_impl_factory_properties.rs:744— ModuleInfoExtractor::resolve_factory_property_observations has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). 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.
ModuleInfoExtractor::record_typed_member_destructuring (cognitive 24) crates/extract/src/visitor/visit_impl_member_destructuring.rs:427— ModuleInfoExtractor::record_typed_member_destructuring has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (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.
ModuleInfoExtractor::visit_property_definition (cognitive 23) crates/extract/src/visitor/visit_impl.rs:3766— ModuleInfoExtractor::visit_property_definition has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, 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.
ModuleInfoExtractor::record_projection_source (cognitive 23) crates/extract/src/visitor/visit_impl_projections.rs:287— ModuleInfoExtractor::record_projection_source has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 11). 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.
ModuleInfoExtractor::resolve_structural_class_calls (cognitive 22) crates/extract/src/visitor/mod.rs:3541— ModuleInfoExtractor::resolve_structural_class_calls has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 pts), boolean chains 1 (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.
ModuleInfoExtractor::invalidate_assignment_target_proof (cognitive 22) crates/extract/src/visitor/visit_impl.rs:3423— ModuleInfoExtractor::invalidate_assignment_target_proof has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 11). 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.
ModuleInfoExtractor::resolve_factory_property_accesses (cognitive 22) crates/extract/src/visitor/visit_impl_factory_properties.rs:810— ModuleInfoExtractor::resolve_factory_property_accesses has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (3 pts), boolean chains 2, 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.
fallow_cli::audit_brief::decision_surface_lines (cognitive 46) crates/cli/src/audit_brief.rs:1802— fallow_cli::audit_brief::decision_surface_lines has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 5 (11 pts), boolean chains 1 (nesting depth added 23). 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.
fallow_cli::similar_code_help::unsupported_similar_code_option_with_explicit_tolerance (cognitive 34) crates/cli/src/similar_code_help.rs:67— fallow_cli::similar_code_help::unsupported_similar_code_option_with_explicit_tolerance has cognitive complexity 34 (threshold 15). Drivers by points: if/else 20 (21 pts), boolean chains 13 (nesting depth added 1). 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.
fallow_cli::cli_startup::validate_input_flags (cognitive 33) crates/cli/src/cli_startup.rs:123— fallow_cli::cli_startup::validate_input_flags has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 8, loops 2 (4 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.
fallow_cli::base_worktree::legacy_registered_pass (cognitive 32) crates/cli/src/base_worktree.rs:1036— fallow_cli::base_worktree::legacy_registered_pass has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (29 pts), match/switch 1 (2 pts), loops 1 (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.
fallow_cli::agent_install::mcp::merge_codex (cognitive 28) crates/cli/src/agent_install/mcp.rs:833— fallow_cli::agent_install::mcp::merge_codex has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 3 (4 pts), boolean chains 3, loops 1 (2 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.
fallow_cli::check::output::handle_type_aware_trace_output (cognitive 25) crates/cli/src/check/output.rs:57— fallow_cli::check::output::handle_type_aware_trace_output has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 4 (7 pts) (nesting depth added 10). 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.
fallow_cli::fix::deps::process_package_dependency_removals (cognitive 25) crates/cli/src/fix/deps.rs:103— fallow_cli::fix::deps::process_package_dependency_removals has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (4 pts), boolean chains 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.
fallow_cli::ci::collect_gitlab_discussion_fingerprints (cognitive 24) crates/cli/src/ci.rs:1569— fallow_cli::ci::collect_gitlab_discussion_fingerprints has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 2, loops 1 (2 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.
fallow_cli::fix::emit_residual_skip_warnings (cognitive 24) crates/cli/src/fix/mod.rs:940— fallow_cli::fix::emit_residual_skip_warnings has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (24 pts) (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.
fallow_cli::mutation_cli::run_inner (cognitive 24) crates/cli/src/mutation_cli.rs:526— fallow_cli::mutation_cli::run_inner has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 6). 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.
fallow_cli::agent_install::render_human (cognitive 23) crates/cli/src/agent_install/mod.rs:685— fallow_cli::agent_install::render_human has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 5). 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.
fallow_cli::cli_report::normalize_saved_envelope (cognitive 23) crates/cli/src/cli_report.rs:686— fallow_cli::cli_report::normalize_saved_envelope has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), 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.
fallow_cli::dispatch::dispatch_audit_cache_command (cognitive 22) crates/cli/src/dispatch.rs:1485— fallow_cli::dispatch::dispatch_audit_cache_command has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 11). 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.
fallow_cli::scope_path::resolve_scope_path (cognitive 22) crates/cli/src/scope_path.rs:58— fallow_cli::scope_path::resolve_scope_path has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 5). 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.
fallow_cli::agent_install::mcp::merge_json_server (cognitive 21) crates/cli/src/agent_install/mcp.rs:618— fallow_cli::agent_install::mcp::merge_json_server has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, match/switch 2 (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.
fallow_cli::coverage::setup_cloud::wait_for_activation (cognitive 21) crates/cli/src/coverage/setup_cloud.rs:675— fallow_cli::coverage::setup_cloud::wait_for_activation has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (3 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.
fallow_cli::plugin_check::print_human (cognitive 21) crates/cli/src/plugin_check.rs:278— fallow_cli::plugin_check::print_human has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (7 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.
fallow_cli::agent_install::mcp::merge_enabled_server (cognitive 20) crates/cli/src/agent_install/mcp.rs:692— fallow_cli::agent_install::mcp::merge_enabled_server has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, match/switch 2 (3 pts) (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.
fallow_cli::onboarding::build_recommendation_from (cognitive 20) crates/cli/src/onboarding.rs:485— fallow_cli::onboarding::build_recommendation_from has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (5 pts), boolean chains 2, loops 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.
fallow_cli::unsupported_security_global (cognitive 19) crates/cli/src/lib.rs:200— fallow_cli::unsupported_security_global has cognitive complexity 19 (threshold 15). Drivers by points: if/else 19. 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.
fallow_cli::audit::compute_dependency_anchors (cognitive 19) crates/cli/src/audit.rs:2279— fallow_cli::audit::compute_dependency_anchors has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (5 pts), loops 2, 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.
fallow_cli::audit_brief::build_test_reach_facts (cognitive 19) crates/cli/src/audit_brief.rs:240— fallow_cli::audit_brief::build_test_reach_facts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (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.
fallow_cli::bin::schema_emit::normalize_schema (cognitive 19) crates/cli/src/bin/schema_emit.rs:1631— fallow_cli::bin::schema_emit::normalize_schema has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 3 (7 pts), boolean chains 3, match/switch 1 (nesting depth added 9). 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.
fallow_cli::config::run_config_with_options (cognitive 19) crates/cli/src/config.rs:61— fallow_cli::config::run_config_with_options has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (7 pts) (nesting depth added 9). 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.
fallow_cli::flags::run_flags (cognitive 19) crates/cli/src/flags.rs:158— fallow_cli::flags::run_flags has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, match/switch 7 (8 pts) (nesting depth added 1). 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.
Duplicated block (8 lines × 2) crates/api/src/combined_output.rs:163— crates/api/src/combined_output.rs:163-170 | crates/api/src/combined_output.rs:181-188 — 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) crates/api/src/runtime/decision_surface.rs:427— crates/api/src/runtime/decision_surface.rs:427-434 | crates/cli/src/audit.rs:2158-2165 — before extracting anything, compare `crates/api/src/runtime/decision_surface.rs` and `crates/cli/src/audit.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) crates/api/src/similar_code/transport.rs:127— crates/api/src/similar_code/transport.rs:127-134 | crates/api/src/similar_code/transport.rs:177-184 — 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) crates/cli/src/agent_install/skill.rs:138— crates/cli/src/agent_install/skill.rs:138-145 | crates/cli/src/agent_install/skill.rs:161-168 — 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) crates/cli/src/check/mod.rs:1738— crates/cli/src/check/mod.rs:1738-1745 | crates/cli/src/health/mod.rs:670-677 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) crates/cli/src/ci.rs:2370— crates/cli/src/ci.rs:2370-2377 | crates/cli/src/ci.rs:2394-2402 — 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) crates/cli/src/ci_pr_comment_post.rs:48— crates/cli/src/ci_pr_comment_post.rs:48-55 | crates/cli/src/ci_pr_comment_post.rs:111-118 — 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) crates/cli/src/fix/exports.rs:217— crates/cli/src/fix/exports.rs:217-224 | crates/graph/src/graph/namespace_aliases.rs:224-231 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) crates/cli/src/report/github_summary.rs:2506— crates/cli/src/report/github_summary.rs:2506-2513 | crates/cli/src/report/github_summary.rs:2699-2706 — 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) crates/core/src/analyze/effect.rs:479— crates/core/src/analyze/effect.rs:479-486 | crates/core/src/analyze/effect.rs:670-677 — 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) crates/core/src/analyze/feature_flags.rs:99— crates/core/src/analyze/feature_flags.rs:99-106 | crates/engine/src/flags.rs:470-477 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) crates/core/src/plugins/bun.rs:58— crates/core/src/plugins/bun.rs:58-65 | crates/core/src/plugins/bun.rs:70-77 — 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) crates/engine/src/health/runtime_filter.rs:127— crates/engine/src/health/runtime_filter.rs:127-134 | crates/output/src/diff.rs:313-320 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) crates/extract/src/cache/conversion.rs:559— crates/extract/src/cache/conversion.rs:559-566 | crates/extract/src/cache/conversion.rs:697-704 — 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) crates/extract/src/component_contracts/mod.rs:455— crates/extract/src/component_contracts/mod.rs:455-462 | crates/extract/src/component_contracts/mod.rs:464-471 — 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) crates/extract/src/css_in_js/tokens.rs:1985— crates/extract/src/css_in_js/tokens.rs:1985-1992 | crates/extract/src/css_in_js/tokens.rs:2435-2442 — 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) crates/extract/src/visitor/visit_impl.rs:1217— crates/extract/src/visitor/visit_impl.rs:1217-1224 | crates/extract/src/visitor/visit_impl.rs:1228-1235 — 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) crates/extract/src/visitor/visit_impl.rs:3985— crates/extract/src/visitor/visit_impl.rs:3985-3992 | crates/extract/src/visitor/visit_impl.rs:4038-4045 — 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) crates/extract/src/visitor/visit_impl.rs:5854— crates/extract/src/visitor/visit_impl.rs:5854-5861 | crates/extract/src/visitor/visit_impl_factory_returns.rs:520-527 — 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) crates/graph/src/graph/effective_exports.rs:1105— crates/graph/src/graph/effective_exports.rs:1105-1112 | crates/graph/src/graph/effective_exports.rs:1166-1173 — 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) crates/graph/src/graph/public_exports.rs:219— crates/graph/src/graph/public_exports.rs:219-226 | crates/graph/src/graph/re_exports/mod.rs:863-870 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) crates/mcp/src/tools/security.rs:72— crates/mcp/src/tools/security.rs:72-79 | crates/mcp/src/tools/suppressions.rs:46-53 — 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) crates/mcp/src/tools/trace.rs:360— crates/mcp/src/tools/trace.rs:360-367 | crates/mcp/src/tools/trace.rs:651-658 — 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) crates/api/src/json_output.rs:459— crates/api/src/json_output.rs:459-466 | crates/cli/src/report/json.rs:990-997 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) crates/api/src/lib.rs:1454— crates/api/src/lib.rs:1454-1461 | crates/cli/src/dispatch.rs:3242-3249 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) crates/api/src/dead_code_codeclimate.rs:292— crates/api/src/dead_code_codeclimate.rs:292-300 | crates/api/src/dead_code_codeclimate.rs:523-531 — 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) crates/api/src/runtime/decision_surface.rs:456— crates/api/src/runtime/decision_surface.rs:456-464 | crates/cli/src/audit.rs:2138-2146 — before extracting anything, compare `crates/api/src/runtime/decision_surface.rs` and `crates/cli/src/audit.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) crates/cli/src/agent_install/mod.rs:417— crates/cli/src/agent_install/mod.rs:417-425 | crates/cli/src/agent_install/mod.rs:476-484 — 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) crates/cli/src/ci_review_post.rs:128— crates/cli/src/ci_review_post.rs:128-136 | crates/cli/src/ci_review_post.rs:181-189 — 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) crates/cli/src/migrate/toml_gen.rs:38— crates/cli/src/migrate/toml_gen.rs:38-46 | crates/cli/src/migrate/toml_gen.rs:118-126 — 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) crates/cli/src/report/sarif.rs:142— crates/cli/src/report/sarif.rs:142-150 | crates/cli/src/report/sarif.rs:194-202 — 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) crates/core/src/analyze/unused_exports.rs:1043— crates/core/src/analyze/unused_exports.rs:1043-1051 | crates/core/src/analyze/unused_exports.rs:1074-1082 — 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) crates/core/src/external_style_usage.rs:149— crates/core/src/external_style_usage.rs:149-157 | crates/graph/src/resolve/specifier.rs:589-597 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) crates/core/src/plugins/config_parser.rs:549— crates/core/src/plugins/config_parser.rs:549-557 | crates/core/src/plugins/config_parser.rs:571-579 — 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) crates/core/src/plugins/config_parser.rs:1629— crates/core/src/plugins/config_parser.rs:1629-1637 | crates/core/src/plugins/config_parser.rs:2496-2504 — 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) crates/core/src/plugins/gatsby.rs:94— crates/core/src/plugins/gatsby.rs:94-102 | crates/core/src/plugins/typescript.rs:423-431 — 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 (9 lines × 2) crates/core/src/plugins/typescript.rs:288— crates/core/src/plugins/typescript.rs:288-296 | crates/core/src/plugins/webpack.rs:151-159 — 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 (9 lines × 2) crates/engine/src/duplication_detector/token_visitor.rs:575— crates/engine/src/duplication_detector/token_visitor.rs:575-583 | crates/engine/src/duplication_detector/token_visitor.rs:622-630 — 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) crates/engine/src/health/scoring.rs:886— crates/engine/src/health/scoring.rs:886-894 | crates/engine/src/health/scoring.rs:903-911 — 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) crates/engine/src/trace_impl.rs:573— crates/engine/src/trace_impl.rs:573-581 | crates/engine/src/trace_impl.rs:696-708 — 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) crates/extract/src/binding_references.rs:198— crates/extract/src/binding_references.rs:198-207 | crates/extract/src/binding_references.rs:280-288 — 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) crates/extract/src/cache/conversion.rs:596— crates/extract/src/cache/conversion.rs:596-604 | crates/extract/src/cache/conversion.rs:727-735 — 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) crates/extract/src/css_in_js/tokens.rs:834— crates/extract/src/css_in_js/tokens.rs:834-842 | crates/extract/src/css_in_js/tokens.rs:867-875 — 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) crates/extract/src/css_in_js/tokens.rs:2078— crates/extract/src/css_in_js/tokens.rs:2078-2086 | crates/extract/src/css_in_js/tokens.rs:2381-2389 — 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) crates/extract/src/federation_runtime.rs:382— crates/extract/src/federation_runtime.rs:382-390 | crates/extract/src/flags.rs:1278-1286 — 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 (9 lines × 2) crates/extract/src/sfc_template/angular.rs:46— crates/extract/src/sfc_template/angular.rs:46-54 | crates/extract/src/template_usage.rs:31-39 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) crates/extract/src/template_complexity/engine.rs:625— crates/extract/src/template_complexity/engine.rs:625-633 | crates/extract/src/template_complexity/engine.rs:727-735 — 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) crates/extract/src/template_usage.rs:336— crates/extract/src/template_usage.rs:336-344 | crates/extract/src/visitor/visit_impl_security_classifiers.rs:361-369 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) crates/extract/src/visitor/helpers.rs:564— crates/extract/src/visitor/helpers.rs:564-572 | crates/extract/src/visitor/helpers.rs:666-674 — 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) crates/extract/src/visitor/helpers.rs:1839— crates/extract/src/visitor/helpers.rs:1839-1847 | crates/graph/src/resolve/dynamic_imports.rs:378-386 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
fallow_engine::health::css_analytics::classes::css_class_inventory (cognitive 39) crates/engine/src/health/css_analytics/classes.rs:534— fallow_engine::health::css_analytics::classes::css_class_inventory has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 4 (10 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.
fallow_engine::health::css_analytics::cva::collect_animate_keyframe_names (cognitive 33) crates/engine/src/health/css_analytics/cva.rs:381— fallow_engine::health::css_analytics::cva::collect_animate_keyframe_names has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 3 (7 pts), boolean chains 3 (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.
fallow_engine::health::coverage_v8::convert_file (cognitive 30) crates/engine/src/health/coverage_v8/mod.rs:242— fallow_engine::health::coverage_v8::convert_file has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 3, match/switch 2 (3 pts), boolean chains 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.
fallow_engine::discover::advance_past_package_manager (cognitive 29) crates/engine/src/discover.rs:679— fallow_engine::discover::advance_past_package_manager has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 6, loops 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.
fallow_engine::duplication_detector::detect::extraction::extract_clone_groups (cognitive 29) crates/engine/src/duplication_detector/detect/extraction.rs:31— fallow_engine::duplication_detector::detect::extraction::extract_clone_groups has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (3 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.
fallow_engine::duplication_detector::near::candidate_components (cognitive 29) crates/engine/src/duplication_detector/near.rs:354— fallow_engine::duplication_detector::near::candidate_components has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 5 (11 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.
fallow_engine::health::css_analytics::classes::collect_quoted_class_tokens (cognitive 29) crates/engine/src/health/css_analytics/classes.rs:316— fallow_engine::health::css_analytics::classes::collect_quoted_class_tokens has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (8 pts), boolean chains 4 (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.
fallow_engine::baseline::identity_counts_with_placeholder_allowance (cognitive 24) crates/engine/src/baseline/mod.rs:2990— fallow_engine::baseline::identity_counts_with_placeholder_allowance has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (10 pts), boolean chains 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.
fallow_engine::change_coupling::analyze_change_history (cognitive 24) crates/engine/src/change_coupling.rs:271— fallow_engine::change_coupling::analyze_change_history has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 6 (10 pts), boolean chains 1 (nesting depth added 10). 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.
fallow_engine::health::coverage_v8::load_v8_coverage_map (cognitive 23) crates/engine/src/health/coverage_v8/mod.rs:101— fallow_engine::health::coverage_v8::load_v8_coverage_map has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 pts), match/switch 1 (2 pts), boolean chains 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.
fallow_engine::health::css_analytics::cva::collect_quoted_cva_class_blocks (cognitive 23) crates/engine/src/health/css_analytics/cva.rs:302— fallow_engine::health::css_analytics::cva::collect_quoted_cva_class_blocks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (3 pts) (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.
fallow_engine::baseline_growth::baseline_growth (cognitive 22) crates/engine/src/baseline_growth.rs:74— fallow_engine::baseline_growth::baseline_growth has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 8). 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.
fallow_engine::discover::build_script_scope (cognitive 22) crates/engine/src/discover.rs:482— fallow_engine::discover::build_script_scope has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (10 pts) (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.
fallow_engine::health::css_analytics::theme_tokens::collect_class_shaped_tokens_located (cognitive 21) crates/engine/src/health/css_analytics/theme_tokens.rs:52— fallow_engine::health::css_analytics::theme_tokens::collect_class_shaped_tokens_located has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 10). 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.
fallow_engine::session::update_parse_cache (cognitive 21) crates/engine/src/session.rs:1558— fallow_engine::session::update_parse_cache has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
fallow_engine::trace_error::collect_candidates (cognitive 21) crates/engine/src/trace_error.rs:847— fallow_engine::trace_error::collect_candidates has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (7 pts), boolean chains 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.
fallow_engine::trace_usage_impl::wrapper_consumers (cognitive 21) crates/engine/src/trace_usage_impl.rs:1124— fallow_engine::trace_usage_impl::wrapper_consumers has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 pts), match/switch 1 (4 pts) (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.
fallow_engine::duplication_detector::detect::rolling::build_seed_buckets (cognitive 19) crates/engine/src/duplication_detector/detect/rolling.rs:205— fallow_engine::duplication_detector::detect::rolling::build_seed_buckets has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 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.
fallow_engine::health::result::classify_dead_style_export (cognitive 19) crates/engine/src/health/result.rs:1016— fallow_engine::health::result::classify_dead_style_export has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (9 pts) (nesting depth added 1). 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.
fallow_engine::search_visibility::may_export_binding (cognitive 19) crates/engine/src/search_visibility.rs:362— fallow_engine::search_visibility::may_export_binding has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 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.
fallow_engine::dead_code::apply_base_collection_rules (cognitive 18) crates/engine/src/dead_code.rs:850— fallow_engine::dead_code::apply_base_collection_rules has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18. 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.
fallow_engine::duplication_detector::near::complete_link_clusters (cognitive 18) crates/engine/src/duplication_detector/near.rs:490— fallow_engine::duplication_detector::near::complete_link_clusters has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 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.
fallow_engine::health::derive_health_sections (cognitive 18) crates/engine/src/health/mod.rs:607— fallow_engine::health::derive_health_sections has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 6. 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.
fallow_engine::health::css_analytics::classes::extract_dotted_class_names (cognitive 18) crates/engine/src/health/css_analytics/classes.rs:488— fallow_engine::health::css_analytics::classes::extract_dotted_class_names has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (5 pts), boolean chains 4 (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.
fallow_engine::health::css_analytics::theme_tokens::collect_class_shaped_tokens (cognitive 18) crates/engine/src/health/css_analytics/theme_tokens.rs:21— fallow_engine::health::css_analytics::theme_tokens::collect_class_shaped_tokens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 3 (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.
Duplicated block (10 lines × 2) crates/api/src/dead_code_codeclimate.rs:1679— crates/api/src/dead_code_codeclimate.rs:1679-1688 | crates/api/src/dead_code_codeclimate.rs:1789-1798 — 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) crates/api/src/dead_code_codeclimate.rs:1826— crates/api/src/dead_code_codeclimate.rs:1826-1835 | crates/api/src/dead_code_codeclimate.rs:1872-1881 — 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) crates/api/src/markdown_output.rs:60— crates/api/src/markdown_output.rs:60-69 | crates/cli/src/report/human/health.rs:1928-1937 — before extracting anything, compare `crates/api/src/markdown_output.rs` and `crates/cli/src/report/human/health.rs` as WHOLE FILES: this scan already matched 4 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) crates/api/src/runtime/decision_surface.rs:436— crates/api/src/runtime/decision_surface.rs:436-445 | crates/cli/src/audit.rs:2167-2176 — before extracting anything, compare `crates/api/src/runtime/decision_surface.rs` and `crates/cli/src/audit.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) crates/api/src/type_aware/client/mod.rs:1041— crates/api/src/type_aware/client/mod.rs:1041-1050 | crates/api/src/type_aware/client/mod.rs:1255-1264 — 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) crates/cli/src/agent_install/mod.rs:770— crates/cli/src/agent_install/mod.rs:770-779 | crates/cli/src/agent_install/status.rs:508-517 — 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 (10 lines × 2) crates/cli/src/audit.rs:2239— crates/cli/src/audit.rs:2239-2248 | crates/cli/src/audit.rs:2308-2317 — 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) crates/cli/src/base_worktree.rs:1343— crates/cli/src/base_worktree.rs:1343-1352 | crates/cli/src/base_worktree.rs:1420-1429 — 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) crates/cli/src/combined/mod.rs:723— crates/cli/src/combined/mod.rs:723-732 | crates/cli/src/security.rs:1571-1580 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) crates/config/src/rule_pack.rs:670— crates/config/src/rule_pack.rs:670-679 | crates/config/src/rule_pack.rs:701-710 — 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) crates/core/src/analyze/duplicate_prop_shape.rs:184— crates/core/src/analyze/duplicate_prop_shape.rs:184-193 | crates/core/src/analyze/prop_drilling.rs:140-149 — 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 (10 lines × 2) crates/core/src/analyze/prop_drilling.rs:139— crates/core/src/analyze/prop_drilling.rs:139-148 | crates/core/src/analyze/react_intel.rs:92-101 — 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 (10 lines × 2) crates/core/src/plugins/eslint.rs:131— crates/core/src/plugins/eslint.rs:131-140 | crates/core/src/plugins/typescript.rs:77-86 — 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 (10 lines × 2) crates/engine/src/duplicates.rs:148— crates/engine/src/duplicates.rs:148-157 | crates/engine/src/health/derived_sections.rs:502-511 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) crates/engine/src/health/css_analytics/theme_tokens.rs:176— crates/engine/src/health/css_analytics/theme_tokens.rs:176-185 | crates/engine/src/health/css_analytics/token_consumers.rs:18-27 — 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 (10 lines × 2) crates/engine/src/health/grouping.rs:165— crates/engine/src/health/grouping.rs:165-174 | crates/engine/src/workspace_scope.rs:229-238 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) crates/engine/src/vital_signs.rs:1202— crates/engine/src/vital_signs.rs:1202-1211 | crates/engine/src/vital_signs.rs:1218-1227 — 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) crates/extract/src/cache/conversion.rs:80— crates/extract/src/cache/conversion.rs:80-89 | crates/extract/src/cache/conversion.rs:285-294 — 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) crates/extract/src/parse.rs:839— crates/extract/src/parse.rs:839-848 | crates/extract/src/parse.rs:939-948 — 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) crates/extract/src/template_usage.rs:323— crates/extract/src/template_usage.rs:323-332 | crates/extract/src/visitor/visit_impl_security_classifiers.rs:302-311 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) crates/extract/src/visitor/visit_impl.rs:3581— crates/extract/src/visitor/visit_impl.rs:3581-3590 | crates/extract/src/visitor/visit_impl.rs:6314-6323 — 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) crates/extract/src/visitor/visit_impl_object_bindings.rs:1906— crates/extract/src/visitor/visit_impl_object_bindings.rs:1906-1915 | crates/extract/src/visitor/visit_impl_object_bindings.rs:1934-1943 — 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) crates/extract/src/visitor/visit_impl_structural.rs:301— crates/extract/src/visitor/visit_impl_structural.rs:301-310 | crates/extract/src/visitor/visit_impl_structural.rs:334-343 — 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) crates/graph/src/graph/mod.rs:1355— crates/graph/src/graph/mod.rs:1355-1364 | crates/graph/src/graph/mod.rs:1496-1505 — 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) crates/graph/src/resolve/fallbacks.rs:84— crates/graph/src/resolve/fallbacks.rs:84-93 | crates/graph/src/resolve/specifier.rs:1204-1213 — 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.
Sync-over-async blocking editors/vscode/scripts/package-vsix-variants.mjs:71— `accessSync` in `packageVsixVariants` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/scripts/package-vsix-variants.mjs:72— `accessSync` in `packageVsixVariants` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/scripts/package-vsix-variants.mjs:75— `readFileSync` in `packageVsixVariants` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/scripts/package-vsix-variants.mjs:89— `mkdirSync` in `packageVsixVariants` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/scripts/verify-packaged-type-aware.mjs:78— `readFileSync` in `verifyPackagedTypeAware` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/scripts/verify-packaged-type-aware.mjs:82— `readdirSync` in `verifyPackagedTypeAware` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/scripts/verify-packaged-type-aware.mjs:108— `statSync` in `verifyPackagedTypeAware` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/scripts/verify-packaged-type-aware.mjs:109— `statSync` in `verifyPackagedTypeAware` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/scripts/verify-packaged-type-aware.mjs:131— `statSync` in `callback to backends.map` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/scripts/vsix-archive.mjs:123— `statSync` in `inspectVsixArchive` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/src/download.ts:921— `fs.chmodSync` in `downloadAsset` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/src/download.ts:929— `fs.existsSync` in `downloadAsset` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/src/download.ts:930— `fs.unlinkSync` in `downloadAsset` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/src/download.ts:934— `fs.existsSync` in `downloadAsset` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/src/download.ts:935— `fs.unlinkSync` in `downloadAsset` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/src/download.ts:938— `fs.writeFileSync` in `downloadAsset` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/src/download.ts:953— `fs.existsSync` in `downloadAsset` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking editors/vscode/src/download.ts:954— `fs.unlinkSync` in `downloadAsset` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking scripts/coverage-producer-refresh.mjs:111— `readFileSync` in `recordRow` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking scripts/coverage-producer-refresh.mjs:180— `readFileSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking scripts/coverage-producer-refresh.mjs:183— `existsSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking scripts/coverage-producer-refresh.mjs:237— `existsSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking scripts/coverage-producer-refresh.mjs:237— `readFileSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking scripts/coverage-producer-refresh.mjs:281— `mkdirSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking scripts/coverage-producer-refresh.mjs:282— `writeFileSync` in `main` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Duplicated block (6 lines × 2) crates/api/src/similar_code/transport.rs:122— crates/api/src/similar_code/transport.rs:122-127 | crates/api/src/similar_code/transport.rs:169-174 — 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 lines × 2) crates/cli/src/ci.rs:1476— crates/cli/src/ci.rs:1476-1481 | crates/cli/src/ci.rs:1669-1674 — 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 lines × 2) crates/config/src/external_plugin/mod.rs:965— crates/config/src/external_plugin/mod.rs:965-970 | crates/config/src/external_plugin/mod.rs:984-989 — 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 lines × 2) crates/core/src/analyze/effect.rs:492— crates/core/src/analyze/effect.rs:492-499 | crates/core/src/analyze/effect.rs:684-689 — 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 lines × 2) crates/core/src/analyze/unrendered_component.rs:124— crates/core/src/analyze/unrendered_component.rs:124-129 | crates/core/src/analyze/unused_component_prop.rs:53-58 — 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) crates/core/src/discover/parse_scripts.rs:208— crates/core/src/discover/parse_scripts.rs:208-213 | crates/engine/src/discover.rs:807-812 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) crates/engine/src/baseline/mod.rs:1960— crates/engine/src/baseline/mod.rs:1960-1965 | crates/engine/src/baseline/mod.rs:1971-1976 — 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 lines × 2) crates/engine/src/trace_chain_impl.rs:183— crates/engine/src/trace_chain_impl.rs:183-188 | crates/engine/src/trace_chain_impl.rs:262-267 — 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 lines × 2) crates/extract/src/sfc_template/angular.rs:429— crates/extract/src/sfc_template/angular.rs:429-434 | crates/extract/src/sfc_template/angular.rs:544-549 — 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 lines × 2) crates/extract/src/sfc_template/angular.rs:606— crates/extract/src/sfc_template/angular.rs:606-611 | crates/extract/src/sfc_template/angular.rs:853-859 — 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 lines × 2) crates/lsp/src/code_actions/quick_fix.rs:884— crates/lsp/src/code_actions/quick_fix.rs:884-889 | crates/lsp/src/code_actions/quick_fix.rs:917-922 — 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 lines × 2) crates/lsp/src/protocol.rs:176— crates/lsp/src/protocol.rs:176-181 | crates/output/src/check.rs:1252-1257 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) crates/output/src/dead_code_sarif.rs:725— crates/output/src/dead_code_sarif.rs:725-730 | crates/output/src/dead_code_sarif.rs:756-761 — 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 lines × 2) crates/types/src/results.rs:1763— crates/types/src/results.rs:1763-1768 | crates/types/src/results.rs:1770-1775 — 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 lines × 2) crates/types/src/results.rs:2067— crates/types/src/results.rs:2067-2072 | crates/types/src/results.rs:2081-2086 — 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 lines × 2) crates/cli/src/report/github_annotations.rs:275— crates/cli/src/report/github_annotations.rs:275-280 | crates/cli/src/report/github_summary.rs:818-823 — 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) crates/core/src/analyze/dynamic_segment_name_conflict.rs:147— crates/core/src/analyze/dynamic_segment_name_conflict.rs:147-152 | crates/core/src/analyze/route_collision.rs:128-133 — 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) crates/core/src/discover/mod.rs:123— crates/core/src/discover/mod.rs:123-128 | crates/engine/src/discover.rs:443-448 — before extracting anything, compare `crates/core/src/discover/mod.rs` and `crates/engine/src/discover.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) crates/core/src/discover/mod.rs:292— crates/core/src/discover/mod.rs:292-297 | crates/engine/src/discover.rs:520-525 — before extracting anything, compare `crates/core/src/discover/mod.rs` and `crates/engine/src/discover.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) crates/core/src/scripts/mod.rs:2852— crates/core/src/scripts/mod.rs:2852-2857 | crates/engine/src/discover.rs:790-795 — before extracting anything, compare `crates/core/src/scripts/mod.rs` and `crates/engine/src/discover.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) crates/engine/src/duplication_detector/token_visitor.rs:817— crates/engine/src/duplication_detector/token_visitor.rs:817-822 | crates/extract/src/visitor/visit_impl.rs:5170-5175 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) crates/engine/src/flag_vendor.rs:332— crates/engine/src/flag_vendor.rs:332-338 | crates/engine/src/health/package_json.rs:133-138 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) crates/config/src/workspace/pnpm_catalog.rs:331— crates/config/src/workspace/pnpm_catalog.rs:331-336 | crates/config/src/workspace/pnpm_overrides.rs:300-305 — 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) crates/api/src/dead_code_codeclimate.rs:676— crates/api/src/dead_code_codeclimate.rs:676-685 | crates/api/src/dead_code_codeclimate.rs:836-841 — 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 lines × 2) crates/api/src/compact_output.rs:805— crates/api/src/compact_output.rs:805-810 | crates/cli/src/report/human/health.rs:2334-2340 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12 lines × 2) crates/api/src/dead_code_codeclimate.rs:664— crates/api/src/dead_code_codeclimate.rs:664-675 | crates/api/src/dead_code_codeclimate.rs:712-723 — 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 (12 lines × 2) crates/cli/src/audit_output.rs:240— crates/cli/src/audit_output.rs:240-251 | crates/cli/src/audit_output.rs:282-293 — 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 (12 lines × 2) crates/cli/src/ci.rs:1193— crates/cli/src/ci.rs:1193-1204 | crates/cli/src/ci.rs:1739-1750 — 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 (12 lines × 2) crates/cli/src/report/mod.rs:818— crates/cli/src/report/mod.rs:818-829 | crates/cli/src/report/mod.rs:943-954 — 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 (12 lines × 2) crates/cli/src/report/sarif.rs:61— crates/cli/src/report/sarif.rs:61-72 | crates/output/src/dead_code_sarif.rs:1325-1336 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12 lines × 2) crates/cli/src/rule_pack/list.rs:138— crates/cli/src/rule_pack/list.rs:138-149 | crates/engine/src/guard.rs:306-317 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12 lines × 2) crates/cli/src/telemetry.rs:1922— crates/cli/src/telemetry.rs:1922-1933 | crates/cli/src/telemetry.rs:2018-2029 — 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 (12 lines × 2) crates/cli/src/trace_chain.rs:162— crates/cli/src/trace_chain.rs:162-173 | crates/cli/src/trace_chain.rs:176-187 — 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 (12 lines × 2) crates/core/src/analyze/unused_deps.rs:1717— crates/core/src/analyze/unused_deps.rs:1717-1728 | crates/core/src/analyze/unused_deps.rs:1858-1869 — 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 (12 lines × 2) crates/core/src/plugins/config_parser.rs:2769— crates/core/src/plugins/config_parser.rs:2769-2780 | crates/core/src/plugins/config_parser.rs:2804-2815 — 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 (12 lines × 2) crates/core/src/plugins/vitest/mod.rs:838— crates/core/src/plugins/vitest/mod.rs:838-849 | crates/graph/src/resolve/jsx_runtime.rs:212-223 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12 lines × 2) crates/core/src/suppress.rs:283— crates/core/src/suppress.rs:283-294 | crates/core/src/suppress.rs:308-319 — 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 (12 lines × 2) crates/engine/src/duplication_detector/token_visitor.rs:408— crates/engine/src/duplication_detector/token_visitor.rs:408-419 | crates/engine/src/duplication_detector/token_visitor.rs:424-435 — 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 (12 lines × 2) crates/engine/src/health/runner.rs:113— crates/engine/src/health/runner.rs:113-124 | crates/engine/src/health/runner.rs:191-202 — 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 (12 lines × 2) crates/extract/src/visitor/mod.rs:3066— crates/extract/src/visitor/mod.rs:3066-3077 | crates/extract/src/visitor/mod.rs:3178-3189 — 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 (12 lines × 2) crates/extract/src/visitor/visit_impl_signature.rs:280— crates/extract/src/visitor/visit_impl_signature.rs:280-291 | crates/extract/src/visitor/visit_impl_signature.rs:304-315 — 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 (12 lines × 2) crates/graph/src/resolve/fallbacks.rs:975— crates/graph/src/resolve/fallbacks.rs:975-986 | crates/graph/src/resolve/fallbacks_scss_paths.rs:15-26 — 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 (12 lines × 2) crates/lsp/src/diagnostics/structural.rs:736— crates/lsp/src/diagnostics/structural.rs:736-747 | crates/lsp/src/diagnostics/structural.rs:776-787 — 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 (12 lines × 2) crates/lsp/src/hover.rs:328— crates/lsp/src/hover.rs:328-339 | crates/lsp/src/hover.rs:367-378 — 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 (12 lines × 2) crates/mcp/src/tools/analyze.rs:92— crates/mcp/src/tools/analyze.rs:92-103 | crates/mcp/src/tools/check_changed.rs:78-89 — 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 (12 lines × 2) crates/mcp/src/tools/architecture.rs:58— crates/mcp/src/tools/architecture.rs:58-69 | crates/mcp/src/tools/suppressions.rs:39-50 — 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 (12 lines × 2) crates/mcp/src/tools/mod.rs:955— crates/mcp/src/tools/mod.rs:955-966 | crates/mcp/src/tools/mod.rs:975-986 — 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 (12 lines × 2) crates/output/src/baseline_staleness.rs:86— crates/output/src/baseline_staleness.rs:86-97 | crates/output/src/finding_id_query.rs:65-76 — 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 (12 lines × 2) crates/cli/src/impact.rs:2492— crates/cli/src/impact.rs:2492-2504 | crates/cli/src/impact.rs:2648-2659 — 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 (12 lines × 2) crates/cli/src/report/human/dupes.rs:304— crates/cli/src/report/human/dupes.rs:304-315 | crates/cli/src/report/human/dupes.rs:374-385 — 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.
TooManyFields: ModuleInfoExtractor crates/extract/src/visitor/mod.rs:620— TooManyFields — 244 stored fields beside 718 methods. The bar is 30 stored fields; this is 214 over it, 8.13× 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: ModuleInfo crates/types/src/extract.rs:20— TooManyFields — 91 stored fields beside 6 methods. The bar is 30 stored fields; this is 61 over it, 3.03× 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: Cli crates/cli/src/cli_args.rs:148— TooManyFields — 75 stored fields beside 2 methods. The bar is 30 stored fields; this is 45 over it, 2.50× 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: RulesConfig crates/config/src/config/rules.rs:69— TooManyFields — 69 stored fields beside 3 methods. The bar is 30 stored fields; this is 39 over it, 2.30× 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: AnalysisResults crates/types/src/results.rs:246— TooManyFields — 68 stored fields beside 38 methods. 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: PartialRulesConfig crates/config/src/config/rules.rs:813— TooManyFields — 68 stored fields. 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: ResolvedConfig crates/config/src/config/resolution.rs:214— TooManyFields — 57 stored fields beside 4 methods. The bar is 30 stored fields; this is 27 over it, 1.90× 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: BaselineData crates/engine/src/baseline/mod.rs:550— TooManyFields — 55 stored fields beside 6 methods. The bar is 30 stored fields; this is 25 over it, 1.83× 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: HealthExecutionOptions crates/engine/src/health/mod.rs:475— TooManyFields — 53 stored fields. 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.
TooManyFields: DeadCodeOptions crates/napi/src/lib.rs:25— TooManyFields — 53 stored fields. 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.
TooManyFields: CombinedOptions crates/cli/src/combined/mod.rs:23— TooManyFields — 50 stored fields. The bar is 30 stored fields; this is 20 over it, 1.67× 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: CheckSummary crates/types/src/envelope.rs:112— TooManyFields — 50 stored fields. The bar is 30 stored fields; this is 20 over it, 1.67× 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: HealthParams crates/mcp/src/params_health.rs:6— TooManyFields — 49 stored fields. The bar is 30 stored fields; this is 19 over it, 1.63× 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: AuditOptions crates/cli/src/audit.rs:92— TooManyFields — 48 stored fields. The bar is 30 stored fields; this is 18 over it, 1.60× 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: CheckOptions crates/cli/src/check/mod.rs:449— TooManyFields — 47 stored fields. The bar is 30 stored fields; this is 17 over it, 1.57× 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: FallowConfig crates/config/src/config/mod.rs:324— TooManyFields — 46 stored fields beside 17 methods. The bar is 30 stored fields; this is 16 over it, 1.53× 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: AnalysisCompleteParams crates/lsp/src/protocol.rs:46— TooManyFields — 44 stored fields. The bar is 30 stored fields; this is 14 over it, 1.47× 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: IssueFilters crates/cli/src/check/mod.rs:32— TooManyFields — 42 stored fields beside 10 methods. The bar is 30 stored fields; this is 12 over it, 1.40× 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: CheckResult crates/cli/src/check/mod.rs:545— TooManyFields — 37 stored fields. The bar is 30 stored fields; this is 7 over it, 1.23× 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: DeadCodeFilters crates/api/src/lib.rs:449— TooManyFields — 36 stored fields beside 4 methods. The bar is 30 stored fields; this is 6 over it, 1.20× 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: CheckCounts crates/cli/src/regression/counts.rs:50— TooManyFields — 36 stored fields beside 4 methods. The bar is 30 stored fields; this is 6 over it, 1.20× 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: AggregatedPluginResult crates/core/src/plugins/registry/mod.rs:367— TooManyFields — 36 stored fields beside 4 methods. The bar is 30 stored fields; this is 6 over it, 1.20× 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: HealthDispatchArgs crates/cli/src/dispatch.rs:2993— TooManyFields — 36 stored fields. The bar is 30 stored fields; this is 6 over it, 1.20× 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: CssAnalyticsSummary crates/output/src/health_css.rs:1059— TooManyFields — 36 stored fields. The bar is 30 stored fields; this is 6 over it, 1.20× 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: DupesOptions crates/cli/src/dupes.rs:105— TooManyFields — 34 stored fields. The bar is 30 stored fields; this is 4 over it, 1.13× 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 (11 lines × 2) crates/api/src/json_output.rs:342— crates/api/src/json_output.rs:342-352 | crates/api/src/json_output.rs:381-391 — 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 (11 lines × 2) crates/api/src/mutation/last_report.rs:36— crates/api/src/mutation/last_report.rs:36-46 | crates/api/src/runtime/similar_code.rs:1563-1573 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) crates/api/src/runtime/feature_flags.rs:238— crates/api/src/runtime/feature_flags.rs:238-248 | crates/cli/src/flags.rs:589-599 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) crates/api/src/similar_code/mod.rs:191— crates/api/src/similar_code/mod.rs:191-201 | crates/api/src/similar_code/mod.rs:219-229 — 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 (11 lines × 2) crates/cli/src/base_worktree.rs:1170— crates/cli/src/base_worktree.rs:1170-1180 | crates/cli/src/base_worktree.rs:1208-1218 — 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 (11 lines × 2) crates/cli/src/ci_pr_comment_post.rs:209— crates/cli/src/ci_pr_comment_post.rs:209-219 | crates/cli/src/ci_pr_comment_post.rs:244-254 — 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 (11 lines × 2) crates/cli/src/cli_impact.rs:240— crates/cli/src/cli_impact.rs:240-250 | crates/cli/src/cli_impact.rs:287-297 — 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 (11 lines × 2) crates/cli/src/report/human/check.rs:2571— crates/cli/src/report/human/check.rs:2571-2581 | crates/cli/src/report/human/check.rs:3384-3397 — 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 (11 lines × 2) crates/cli/src/report/human/check.rs:3055— crates/cli/src/report/human/check.rs:3055-3065 | crates/cli/src/report/human/check.rs:3201-3211 — 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 (11 lines × 2) crates/cli/src/report/json.rs:1071— crates/cli/src/report/json.rs:1071-1081 | crates/cli/src/report/json.rs:1101-1111 — 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 (11 lines × 2) crates/cli/src/report/mod.rs:907— crates/cli/src/report/mod.rs:907-917 | crates/cli/src/report/mod.rs:1291-1301 — 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 (11 lines × 2) crates/cli/src/security.rs:1988— crates/cli/src/security.rs:1988-1998 | crates/cli/src/suppressions.rs:173-183 — 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) crates/core/src/analyze/members/mod.rs:350— crates/core/src/analyze/members/mod.rs:350-360 | crates/core/src/analyze/members/mod.rs:373-383 — 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 (11 lines × 2) crates/core/src/discover/walk.rs:371— crates/core/src/discover/walk.rs:371-381 | crates/core/src/discover/walk.rs:442-452 — 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 (11 lines × 2) crates/core/src/scripts/mod.rs:2865— crates/core/src/scripts/mod.rs:2865-2875 | crates/engine/src/discover.rs:815-825 — before extracting anything, compare `crates/core/src/scripts/mod.rs` and `crates/engine/src/discover.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) crates/engine/src/health/css_analytics/preprocessor.rs:150— crates/engine/src/health/css_analytics/preprocessor.rs:150-160 | crates/lsp/src/position.rs:89-99 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) crates/engine/src/health/filters.rs:31— crates/engine/src/health/filters.rs:31-41 | crates/engine/src/health/filters.rs:74-84 — 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 (11 lines × 2) crates/engine/src/health/threshold_overrides.rs:213— crates/engine/src/health/threshold_overrides.rs:213-223 | crates/engine/src/health/threshold_overrides.rs:234-244 — 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 (11 lines × 2) crates/extract/src/css_in_js/tokens.rs:367— crates/extract/src/css_in_js/tokens.rs:367-377 | crates/extract/src/css_in_js/tokens.rs:379-389 — 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 (11 lines × 2) crates/extract/src/template_expression_scan.rs:214— crates/extract/src/template_expression_scan.rs:214-224 | crates/extract/src/template_expression_scan.rs:266-276 — 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 (11 lines × 2) crates/extract/src/visitor/visit_impl.rs:3870— crates/extract/src/visitor/visit_impl.rs:3870-3880 | crates/extract/src/visitor/visit_impl_scope_bindings.rs:684-694 — 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) crates/extract/src/visitor/visit_impl.rs:4961— crates/extract/src/visitor/visit_impl.rs:4961-4971 | crates/extract/src/visitor/visit_impl.rs:5008-5018 — 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 (11 lines × 2) crates/extract/src/visitor/visit_impl_member_destructuring.rs:207— crates/extract/src/visitor/visit_impl_member_destructuring.rs:207-217 | crates/extract/src/visitor/visit_impl_member_destructuring.rs:243-253 — 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 (11 lines × 2) crates/extract/src/visitor/visit_impl_object_bindings.rs:418— crates/extract/src/visitor/visit_impl_object_bindings.rs:418-428 | crates/extract/src/visitor/visit_impl_object_bindings.rs:477-487 — 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 (11 lines × 2) crates/graph/src/graph/effective_exports.rs:1106— crates/graph/src/graph/effective_exports.rs:1106-1116 | crates/graph/src/graph/effective_exports.rs:1143-1153 — 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 lines × 2) crates/api/src/audit_keys.rs:1861— crates/api/src/audit_keys.rs:1861-1867 | crates/engine/src/diff_scope.rs:67-73 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) crates/api/src/markdown_output.rs:2044— crates/api/src/markdown_output.rs:2044-2050 | crates/cli/src/report/human/health.rs:1396-1402 — before extracting anything, compare `crates/api/src/markdown_output.rs` and `crates/cli/src/report/human/health.rs` as WHOLE FILES: this scan already matched 4 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) crates/cli/src/dispatch.rs:1694— crates/cli/src/dispatch.rs:1694-1700 | crates/cli/src/dispatch.rs:1741-1747 — 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 lines × 2) crates/cli/src/fix/catalog.rs:873— crates/cli/src/fix/catalog.rs:873-879 | crates/lsp/src/code_actions/quick_fix.rs:882-888 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) crates/config/src/workspace/diagnostics.rs:754— crates/config/src/workspace/diagnostics.rs:754-760 | crates/config/src/workspace/diagnostics.rs:776-782 — 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 lines × 2) crates/core/src/analyze/security/tainted_sink.rs:117— crates/core/src/analyze/security/tainted_sink.rs:117-123 | crates/core/src/analyze/unused_deps.rs:1756-1762 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) crates/core/src/discover/infrastructure.rs:189— crates/core/src/discover/infrastructure.rs:189-195 | crates/core/src/discover/parse_scripts.rs:96-102 — 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 (7 lines × 2) crates/core/src/plugins/registry/helpers.rs:559— crates/core/src/plugins/registry/helpers.rs:559-565 | crates/core/src/plugins/registry/helpers.rs:587-593 — 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 lines × 2) crates/core/src/scripts/mod.rs:1856— crates/core/src/scripts/mod.rs:1856-1862 | crates/engine/src/discover.rs:647-653 — before extracting anything, compare `crates/core/src/scripts/mod.rs` and `crates/engine/src/discover.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) crates/engine/src/health/scoring.rs:463— crates/engine/src/health/scoring.rs:463-469 | crates/engine/src/health/scoring.rs:598-604 — 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 lines × 2) crates/extract/src/css_mask.rs:53— crates/extract/src/css_mask.rs:53-59 | crates/extract/src/css_mask.rs:71-77 — 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 lines × 2) crates/graph/src/graph/fan_io.rs:98— crates/graph/src/graph/fan_io.rs:98-104 | crates/graph/src/graph/partition_order.rs:103-109 — 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 (7 lines × 2) crates/graph/src/resolve/fallbacks.rs:994— crates/graph/src/resolve/fallbacks.rs:994-1000 | crates/graph/src/resolve/fallbacks.rs:1033-1039 — 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 lines × 2) crates/cli/src/cli_production.rs:18— crates/cli/src/cli_production.rs:18-24 | crates/engine/src/project_config.rs:64-70 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) crates/cli/src/report/gate_outcome_text.rs:220— crates/cli/src/report/gate_outcome_text.rs:220-226 | crates/cli/src/report/request_outcome_text.rs:169-175 — 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 (7 lines × 2) crates/core/src/analyze/invalid_client_exports.rs:116— crates/core/src/analyze/invalid_client_exports.rs:116-122 | crates/core/src/analyze/misplaced_directive.rs:95-101 — 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 (7 lines × 2) crates/core/src/analyze/policy/mod.rs:72— crates/core/src/analyze/policy/mod.rs:72-80 | crates/engine/src/guard.rs:252-258 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) crates/core/src/analyze/unused_component_input.rs:173— crates/core/src/analyze/unused_component_input.rs:173-179 | crates/core/src/analyze/unused_component_output.rs:202-208 — before extracting anything, compare `crates/core/src/analyze/unused_component_input.rs` and `crates/core/src/analyze/unused_component_output.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 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) crates/core/src/plugins/config_parser.rs:2902— crates/core/src/plugins/config_parser.rs:2902-2908 | crates/core/src/plugins/module_federation.rs:1300-1306 — 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 (7 lines × 2) crates/api/src/type_aware/transport/mod.rs:74— crates/api/src/type_aware/transport/mod.rs:74-80 | crates/config/src/config/parsing.rs:421-427 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) crates/core/src/analyze/mod.rs:1511— crates/core/src/analyze/mod.rs:1511-1517 | crates/engine/src/public_api.rs:92-98 — before extracting anything, compare `crates/core/src/analyze/mod.rs` and `crates/engine/src/public_api.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) crates/core/src/analyze/policy/mod.rs:683— crates/core/src/analyze/policy/mod.rs:683-689 | crates/engine/src/effective_severity.rs:57-63 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) crates/extract/src/cache/store.rs:482— crates/extract/src/cache/store.rs:482-488 | crates/graph/src/cache/store.rs:145-151 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) crates/extract/src/visitor/helpers.rs:1702— crates/extract/src/visitor/helpers.rs:1702-1708 | crates/extract/src/visitor/visit_impl.rs:5759-5765 — 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 (7 lines × 2) crates/lsp/src/diagnostics/structural.rs:78— crates/lsp/src/diagnostics/structural.rs:78-85 | crates/lsp/src/diagnostics/structural.rs:285-291 — 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.
Swallowed exception (empty catch) viz-frontend/src/state.ts:127— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) viz-frontend/src/graph/shared.ts:301— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) tools/mutation-runner/src/companion.mjs:100— `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
Swallowed exception (empty catch) tools/mutation-runner/src/companion.mjs:175— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) tools/mutation-runner/src/runtime/global.mjs:22— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) tools/mutation-runner/src/runtime/vitest-setup.mjs:38— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) scripts/assert-local-resolution.mjs:71— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) scripts/check-parse-sites.mjs:85— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) scripts/generate-vex.mjs:63— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) scripts/type-aware-corpus.mjs:809— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) scripts/vendor-skills.mjs:135— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) npm/fallow/scripts/lazy-verify.js:52— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) npm/fallow/scripts/lazy-verify.js:106— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) npm/fallow/scripts/lazy-verify.js:227— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) npm/fallow/scripts/sentinel-path.js:51— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) editors/vscode/src/analysis-utils.ts:503— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) editors/vscode/src/client.ts:277— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) editors/vscode/src/download.ts:268— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) editors/vscode/src/download.ts:325— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) editors/vscode/src/download.ts:392— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) editors/vscode/src/download.ts:411— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) editors/vscode/src/download.ts:437— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) editors/vscode/src/download.ts:446— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) editors/vscode/src/download.ts:522— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) editors/vscode/src/download.ts:537— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Duplicated block (5 lines × 2) crates/api/src/mutation/scheduler/mod.rs:669— crates/api/src/mutation/scheduler/mod.rs:669-673 | crates/api/src/mutation/scheduler/mod.rs:945-950 — 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 (5 lines × 2) crates/config/src/config_writer.rs:177— crates/config/src/config_writer.rs:177-182 | crates/config/src/config_writer.rs:226-230 — 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 (5 lines × 2) crates/config/src/workspace/diagnostics.rs:218— crates/config/src/workspace/diagnostics.rs:218-222 | crates/core/src/scripts/ci.rs:137-141 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) crates/config/src/workspace/package_json.rs:297— crates/config/src/workspace/package_json.rs:297-301 | crates/config/src/workspace/package_json.rs:313-317 — 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 (5 lines × 2) crates/core/src/plugins/nuxt.rs:928— crates/core/src/plugins/nuxt.rs:928-932 | crates/core/src/plugins/nuxt.rs:1622-1626 — 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 (5 lines × 2) crates/core/src/plugins/trace_provenance.rs:107— crates/core/src/plugins/trace_provenance.rs:107-111 | crates/core/src/plugins/trace_provenance.rs:200-204 — 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 (5 lines × 2) crates/core/src/scripts/vite_plus.rs:173— crates/core/src/scripts/vite_plus.rs:173-177 | crates/core/src/scripts/vite_plus.rs:198-202 — 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 (5 lines × 2) crates/engine/src/dead_code.rs:717— crates/engine/src/dead_code.rs:717-722 | crates/engine/src/diff_scope.rs:206-210 — 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 (5 lines × 2) crates/engine/src/vital_signs.rs:381— crates/engine/src/vital_signs.rs:381-385 | crates/engine/src/vital_signs.rs:412-416 — 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 (5 lines × 2) crates/extract/src/css_in_js/tokens.rs:1059— crates/extract/src/css_in_js/tokens.rs:1059-1063 | crates/extract/src/visitor/visit_impl_object_bindings.rs:2051-2055 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) crates/extract/src/sfc_props.rs:309— crates/extract/src/sfc_props.rs:309-313 | crates/extract/src/sfc_props.rs:485-494 — 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 (5 lines × 2) crates/graph/src/resolve/fallbacks.rs:80— crates/graph/src/resolve/fallbacks.rs:80-84 | crates/graph/src/resolve/specifier.rs:1195-1199 — 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 (5 lines × 2) crates/lsp/src/diagnostics/structural.rs:81— crates/lsp/src/diagnostics/structural.rs:81-85 | crates/lsp/src/diagnostics/structural.rs:172-176 — 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 (5 lines × 2) crates/lsp/src/diagnostics/unused.rs:111— crates/lsp/src/diagnostics/unused.rs:111-115 | crates/lsp/src/diagnostics/unused.rs:758-762 — 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 (5 lines × 2) crates/mcp/src/tools/code_mode_tools.rs:628— crates/mcp/src/tools/code_mode_tools.rs:628-632 | crates/mcp/src/tools/mod.rs:231-235 — 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 (5 lines × 2) crates/cli/src/dispatch.rs:3092— crates/cli/src/dispatch.rs:3092-3096 | crates/mcp/src/tools/api_runtime.rs:140-144 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) crates/extract/src/complexity.rs:1023— crates/extract/src/complexity.rs:1023-1027 | crates/extract/src/visitor/react.rs:1335-1339 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) crates/config/src/external_plugin/mod.rs:706— crates/config/src/external_plugin/mod.rs:706-710 | crates/extract/src/iconify.rs:61-65 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) crates/cli/src/ci_review_post.rs:123— crates/cli/src/ci_review_post.rs:123-127 | crates/cli/src/ci_review_post.rs:176-180 — 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 (5 lines × 2) crates/output/src/dead_code_sarif.rs:702— crates/output/src/dead_code_sarif.rs:702-706 | crates/output/src/dead_code_sarif.rs:756-760 — 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 (5 lines × 2) crates/config/src/workspace/tsconfig.rs:474— crates/config/src/workspace/tsconfig.rs:474-478 | crates/config/src/workspace/tsconfig.rs:506-510 — 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 (5 lines × 2) crates/core/src/analyze/members/instance.rs:39— crates/core/src/analyze/members/instance.rs:39-43 | crates/core/src/analyze/members/mod.rs:496-500 — 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 (5 lines × 2) crates/core/src/analyze/render_fan_in.rs:278— crates/core/src/analyze/render_fan_in.rs:278-282 | crates/engine/src/vital_signs.rs:449-453 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) crates/extract/src/complexity.rs:730— crates/extract/src/complexity.rs:730-734 | crates/extract/src/complexity.rs:748-752 — 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 (5 lines × 2) crates/extract/src/sfc_props.rs:438— crates/extract/src/sfc_props.rs:438-442 | crates/extract/src/sfc_props.rs:1081-1085 — 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.
FunctionTooLong: fallow_types::workspace::render_message crates/types/src/workspace.rs:1542— FunctionTooLong — fallow_types::workspace::render_message runs 357 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 257 over it, 3.57× 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: chrome.buildChrome REDACTED:139— FunctionTooLong — buildChrome runs 317 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 217 over it, 3.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.
FunctionTooLong: panel.rankRowsForLens viz-frontend/src/panel.ts:1652— FunctionTooLong — rankRowsForLens runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88× 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: fallow_cli::dispatch::dispatch_subcommand crates/cli/src/dispatch.rs:105— FunctionTooLong — fallow_cli::dispatch::dispatch_subcommand runs 181 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 81 over it, 1.81× 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: fallow_cli::report::github_summary::check_sections_core crates/cli/src/report/github_summary.rs:591— FunctionTooLong — fallow_cli::report::github_summary::check_sections_core runs 167 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 67 over it, 1.67× 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: type-aware-corpus.summarize scripts/type-aware-corpus.mjs:2570— FunctionTooLong — summarize runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61× 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: coverage-producer-refresh.main scripts/coverage-producer-refresh.mjs:175— FunctionTooLong — main runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56× 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: fallow_cli::check::execute_check crates/cli/src/check/mod.rs:1266— FunctionTooLong — fallow_cli::check::execute_check runs 155 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 55 over it, 1.55× 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: fallow_types::results::split_merge_parts crates/types/src/results.rs:821— FunctionTooLong — fallow_types::results::split_merge_parts 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: annotations.drawClusterLabels viz-frontend/src/graph/annotations.ts:606— FunctionTooLong — drawClusterLabels runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45× 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: fallow_similar_code_sidecar::protocol::process_request tools/similar-code-sidecar/src/protocol.rs:210— FunctionTooLong — fallow_similar_code_sidecar::protocol::process_request 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.
FunctionTooLong: fallow_cli::report::github_summary::check_sections_architecture crates/cli/src/report/github_summary.rs:833— FunctionTooLong — fallow_cli::report::github_summary::check_sections_architecture runs 134 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 34 over it, 1.34× 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: fallow_cli::check::output::handle_type_aware_trace_output crates/cli/src/check/output.rs:57— FunctionTooLong — fallow_cli::check::output::handle_type_aware_trace_output runs 128 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 28 over it, 1.28× 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: fallow_cli::inspect::collect_semantic_evidence crates/cli/src/inspect.rs:261— FunctionTooLong — fallow_cli::inspect::collect_semantic_evidence runs 124 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 24 over it, 1.24× 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: fallow_types::identity::visit_families crates/types/src/identity.rs:440— FunctionTooLong — fallow_types::identity::visit_families runs 122 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 22 over it, 1.22× 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: fallow_cli::report::github_summary::check_sections_frameworks_and_hygiene crates/cli/src/report/github_summary.rs:1010— FunctionTooLong — fallow_cli::report::github_summary::check_sections_frameworks_and_hygiene runs 120 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 20 over it, 1.20× 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: fallow_engine::effective_severity::for_each_gated_finding crates/engine/src/effective_severity.rs:480— FunctionTooLong — fallow_engine::effective_severity::for_each_gated_finding runs 120 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 20 over it, 1.20× 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: fallow_engine::effective_severity::tally_gated_findings crates/engine/src/effective_severity.rs:616— FunctionTooLong — fallow_engine::effective_severity::tally_gated_findings runs 118 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 18 over it, 1.18× 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: type-aware-corpus.capabilities scripts/type-aware-corpus.mjs:1863— FunctionTooLong — capabilities runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15× 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: render.drawNodes viz-frontend/src/graph/render.ts:462— FunctionTooLong — drawNodes runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12× 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: vitest.createAdapter tools/mutation-runner/src/adapters/vitest.mjs:527— FunctionTooLong — createAdapter runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) 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.
FunctionTooLong: download.downloadBinary editors/vscode/src/download.ts:1107— FunctionTooLong — downloadBinary runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06× 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: fallow_extract::cache::conversion::cached_to_module_opts crates/extract/src/cache/conversion.rs:490— FunctionTooLong — fallow_extract::cache::conversion::cached_to_module_opts 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.
FunctionTooLong: fallow_extract::cache::conversion::module_to_cached_payload crates/extract/src/cache/conversion.rs:629— FunctionTooLong — fallow_extract::cache::conversion::module_to_cached_payload 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: fallow_cli::onboarding::build_recommendation_from crates/cli/src/onboarding.rs:485— FunctionTooLong — fallow_cli::onboarding::build_recommendation_from runs 101 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 1 over it, 1.01× 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.
fallow_extract::template_complexity::engine::find_top_level_ternary (cyclomatic 26) crates/extract/src/template_complexity/engine.rs:557— fallow_extract::template_complexity::engine::find_top_level_ternary has cyclomatic complexity 26 (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.
fallow_extract::sfc_template::component_contracts::collect (cyclomatic 25) REDACTED:11— fallow_extract::sfc_template::component_contracts::collect has cyclomatic complexity 25 (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.
fallow_extract::sfc_template::component_contracts::named_attribute_supply (cyclomatic 23) REDACTED:349— fallow_extract::sfc_template::component_contracts::named_attribute_supply has cyclomatic complexity 23 (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.
fallow_extract::template_complexity::svelte::split_await_shorthand (cyclomatic 23) crates/extract/src/template_complexity/svelte.rs:605— fallow_extract::template_complexity::svelte::split_await_shorthand 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.
fallow_extract::template_complexity::svelte::find_matching_curly (cyclomatic 22) crates/extract/src/template_complexity/svelte.rs:451— fallow_extract::template_complexity::svelte::find_matching_curly 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.
fallow_extract::visitor::visit_impl_chain_names::static_member_object_name (cyclomatic 22) crates/extract/src/visitor/visit_impl_chain_names.rs:38— fallow_extract::visitor::visit_impl_chain_names::static_member_object_name 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.
fallow_extract::css::mask_css_module_global_scopes (cyclomatic 20) crates/extract/src/css.rs:894— fallow_extract::css::mask_css_module_global_scopes 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.
fallow_extract::css_metrics::walk_rules (cyclomatic 20) crates/extract/src/css_metrics.rs:282— fallow_extract::css_metrics::walk_rules has cyclomatic complexity 20 (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.
fallow_extract::sfc_template::recovery::section_ends (cyclomatic 20) crates/extract/src/sfc_template/recovery.rs:79— fallow_extract::sfc_template::recovery::section_ends 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.
fallow_extract::visitor::visit_impl_security_sinks::should_capture_literal_sink_value (cyclomatic 19) crates/extract/src/visitor/visit_impl_security_sinks.rs:78— fallow_extract::visitor::visit_impl_security_sinks::should_capture_literal_sink_value has cyclomatic complexity 19 (threshold 15). 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.
fallow_extract::visitor::helpers::extract_class_generic_instance_bindings (cyclomatic 18) crates/extract/src/visitor/helpers.rs:1509— fallow_extract::visitor::helpers::extract_class_generic_instance_bindings 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.
fallow_extract::visitor::visit_impl_signature::collect_returned_expression_refs (cyclomatic 18) crates/extract/src/visitor/visit_impl_signature.rs:772— fallow_extract::visitor::visit_impl_signature::collect_returned_expression_refs has cyclomatic complexity 18 (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.
fallow_extract::parse::subclass_reference_spans (cyclomatic 17) crates/extract/src/parse.rs:1669— fallow_extract::parse::subclass_reference_spans 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.
fallow_extract::sfc_props::collect_define_props_names (cyclomatic 17) crates/extract/src/sfc_props.rs:377— fallow_extract::sfc_props::collect_define_props_names 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.
fallow_extract::sfc_template::shared::split_top_level (cyclomatic 17) crates/extract/src/sfc_template/shared.rs:358— fallow_extract::sfc_template::shared::split_top_level has cyclomatic complexity 17 (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. This shape REPEATS in the file: one other method here (fallow_extract::sfc_template::shared::split_top_level_once) 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.
fallow_extract::sfc_template::shared::split_top_level_once (cyclomatic 17) crates/extract/src/sfc_template/shared.rs:394— fallow_extract::sfc_template::shared::split_top_level_once has cyclomatic complexity 17 (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. This shape REPEATS in the file: one other method here (fallow_extract::sfc_template::shared::split_top_level) 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.
fallow_extract::css_in_js::tokens::is_static_stylex_composite_expression (cyclomatic 16) crates/extract/src/css_in_js/tokens.rs:1207— fallow_extract::css_in_js::tokens::is_static_stylex_composite_expression has cyclomatic complexity 16 (threshold 15). 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.
fallow_extract::parse::compute_mock_api_reference_spans (cyclomatic 16) crates/extract/src/parse.rs:2091— fallow_extract::parse::compute_mock_api_reference_spans 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.
fallow_extract::sfc_template::angular::split_pipes (cyclomatic 16) crates/extract/src/sfc_template/angular.rs:927— fallow_extract::sfc_template::angular::split_pipes 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.
fallow_extract::visitor::collect_returned_imports_from (cyclomatic 16) crates/extract/src/visitor/mod.rs:4411— fallow_extract::visitor::collect_returned_imports_from 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.
fallow_extract::visitor::helpers::apply_decorator_property (cyclomatic 16) crates/extract/src/visitor/helpers.rs:128— fallow_extract::visitor::helpers::apply_decorator_property 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.
fallow_extract::visitor::visit_impl_factory_returns::for_each_return_in_statement (cyclomatic 16) crates/extract/src/visitor/visit_impl_factory_returns.rs:43— fallow_extract::visitor::visit_impl_factory_returns::for_each_return_in_statement 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. This is NOT this file's highest cyclomatic complexity: fallow_extract::visitor::visit_impl_factory_returns::statement_declares_identifier (cyclomatic 20) 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.
fallow_core::analyze::absent_component_prop::find_absent_component_props (cyclomatic 23) crates/core/src/analyze/absent_component_prop.rs:483— fallow_core::analyze::absent_component_prop::find_absent_component_props has cyclomatic complexity 23 (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.
fallow_core::analyze::unused_overrides::collect_lockfile_packages (cyclomatic 21) crates/core/src/analyze/unused_overrides.rs:334— fallow_core::analyze::unused_overrides::collect_lockfile_packages 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.
fallow_core::plugins::config_parser::find_config_object (cyclomatic 21) crates/core/src/plugins/config_parser.rs:1342— fallow_core::plugins::config_parser::find_config_object 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.
fallow_core::scripts::shell::advance_past_package_manager (cyclomatic 21) crates/core/src/scripts/shell.rs:422— fallow_core::scripts::shell::advance_past_package_manager 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.
fallow_core::analyze::effect::find_unused_layers (cyclomatic 20) crates/core/src/analyze/effect.rs:434— fallow_core::analyze::effect::find_unused_layers 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.
fallow_core::scripts::ci_references::matrix_values (cyclomatic 20) crates/core/src/scripts/ci_references.rs:121— fallow_core::scripts::ci_references::matrix_values 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.
fallow_core::scripts::ci_references::github_script_bodies (cyclomatic 20) crates/core/src/scripts/ci_references.rs:234— fallow_core::scripts::ci_references::github_script_bodies 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.
fallow_core::analyze::members::propagate_computed_enum_key_accesses (cyclomatic 19) crates/core/src/analyze/members/mod.rs:1336— fallow_core::analyze::members::propagate_computed_enum_key_accesses has cyclomatic complexity 19 (threshold 15). 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.
fallow_core::analyze::unused_deps::add_source_package_manifests (cyclomatic 19) crates/core/src/analyze/unused_deps.rs:2252— fallow_core::analyze::unused_deps::add_source_package_manifests has cyclomatic complexity 19 (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.
fallow_core::discover::infrastructure::collect_flag_value_file_refs (cyclomatic 19) crates/core/src/discover/infrastructure.rs:181— fallow_core::discover::infrastructure::collect_flag_value_file_refs has cyclomatic complexity 19 (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.
fallow_core::discover::parse_scripts::collect_script_file_refs (cyclomatic 19) crates/core/src/discover/parse_scripts.rs:70— fallow_core::discover::parse_scripts::collect_script_file_refs has cyclomatic complexity 19 (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.
fallow_core::scripts::hooks::js_string_literals (cyclomatic 19) crates/core/src/scripts/hooks.rs:241— fallow_core::scripts::hooks::js_string_literals 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.
fallow_core::analyze::absent_component_prop::emit_findings (cyclomatic 18) crates/core/src/analyze/absent_component_prop.rs:614— fallow_core::analyze::absent_component_prop::emit_findings 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.
fallow_core::plugins::project_glob::expand_with_limit (cyclomatic 18) crates/core/src/plugins/project_glob.rs:68— fallow_core::plugins::project_glob::expand_with_limit 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.
fallow_core::plugins::react_router::collect_route_call (cyclomatic 18) crates/core/src/plugins/react_router.rs:340— fallow_core::plugins::react_router::collect_route_call 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.
fallow_core::plugins::webpack::walk_rule (cyclomatic 18) crates/core/src/plugins/webpack.rs:207— fallow_core::plugins::webpack::walk_rule 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.
fallow_core::analyze::members::instance::collect_inherited_bindings (cyclomatic 17) crates/core/src/analyze/members/instance.rs:173— fallow_core::analyze::members::instance::collect_inherited_bindings 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.
fallow_core::plugins::typescript::parse_tsconfig_references (cyclomatic 17) crates/core/src/plugins/typescript.rs:422— fallow_core::plugins::typescript::parse_tsconfig_references 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.
fallow_core::analyze::members::collect_direct_member_accesses (cyclomatic 16) crates/core/src/analyze/members/mod.rs:1726— fallow_core::analyze::members::collect_direct_member_accesses has cyclomatic complexity 16 (threshold 15). 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.
fallow_core::analyze::members::factory::factory_return_object_property_classes (cyclomatic 16) crates/core/src/analyze/members/factory.rs:308— fallow_core::analyze::members::factory::factory_return_object_property_classes 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.
fallow_core::plugins::gatsby::extract_gatsby_plugin_resolves (cyclomatic 16) crates/core/src/plugins/gatsby.rs:93— fallow_core::plugins::gatsby::extract_gatsby_plugin_resolves 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.
fallow_core::plugins::prisma::strip_schema_comments (cyclomatic 16) crates/core/src/plugins/prisma.rs:159— fallow_core::plugins::prisma::strip_schema_comments 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.
fallow_graph::graph::narrowing::attach_symbol_reference (cognitive 34) crates/graph/src/graph/narrowing.rs:754— fallow_graph::graph::narrowing::attach_symbol_reference has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 4, loops 1 (3 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.
fallow_graph::resolve::specifier::try_tsconfig_root_dirs (cognitive 25) crates/graph/src/resolve/specifier.rs:2106— fallow_graph::resolve::specifier::try_tsconfig_root_dirs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), 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.
fallow_graph::resolve::upgrades::apply_specifier_upgrades (cognitive 24) crates/graph/src/resolve/upgrades.rs:56— fallow_graph::resolve::upgrades::apply_specifier_upgrades has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 4 (9 pts), boolean chains 3 (nesting depth added 9). 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.
fallow_graph::resolve::fallbacks::find_scss_in_dir (cognitive 22) crates/graph/src/resolve/fallbacks.rs:262— fallow_graph::resolve::fallbacks::find_scss_in_dir has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (21 pts), 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.
fallow_graph::resolve::react_native::synthesize_platform_family_edges (cognitive 21) crates/graph/src/resolve/react_native.rs:203— fallow_graph::resolve::react_native::synthesize_platform_family_edges has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 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.
fallow_graph::graph::cycles::dfs_find_cycles_from (cognitive 20) crates/graph/src/graph/cycles.rs:338— fallow_graph::graph::cycles::dfs_find_cycles_from has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 2, loops 1 (nesting depth added 10). 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.
fallow_graph::graph::namespace_re_exports::propagate_namespace_re_exports (cognitive 20) crates/graph/src/graph/namespace_re_exports.rs:82— fallow_graph::graph::namespace_re_exports::propagate_namespace_re_exports has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (6 pts), boolean chains 3 (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.
fallow_graph::resolve::auto_imports::synthesize_auto_import_edges (cognitive 20) crates/graph/src/resolve/auto_imports.rs:77— fallow_graph::resolve::auto_imports::synthesize_auto_import_edges has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 4 (6 pts), boolean chains 1 (nesting depth added 8). 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.
fallow_graph::resolve::fallbacks::try_path_alias_fallback (cognitive 20) crates/graph/src/resolve/fallbacks.rs:56— fallow_graph::resolve::fallbacks::try_path_alias_fallback has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). 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.
fallow_graph::graph::effective_exports::seed_direct_bindings (cognitive 19) crates/graph/src/graph/effective_exports.rs:940— fallow_graph::graph::effective_exports::seed_direct_bindings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). 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.
fallow_graph::graph::namespace_re_exports::collect_consumer_credits (cognitive 19) crates/graph/src/graph/namespace_re_exports.rs:218— fallow_graph::graph::namespace_re_exports::collect_consumer_credits has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 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.
fallow_graph::graph::narrowing::narrow_namespace_references (cognitive 18) crates/graph/src/graph/narrowing.rs:410— fallow_graph::graph::narrowing::narrow_namespace_references has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8, loops 1 (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, 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.
fallow_graph::resolve::fallbacks::try_source_subpath (cognitive 18) crates/graph/src/resolve/fallbacks.rs:900— fallow_graph::resolve::fallbacks::try_source_subpath has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 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.
fallow_graph::resolve::specifier::try_tsconfig_alias_sass_target (cognitive 18) crates/graph/src/resolve/specifier.rs:1045— fallow_graph::resolve::specifier::try_tsconfig_alias_sass_target has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 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.
fallow_graph::graph::effective_re_exports::effective_declaration_route (cognitive 17) crates/graph/src/graph/effective_re_exports.rs:152— fallow_graph::graph::effective_re_exports::effective_declaration_route has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts) (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.
fallow_graph::graph::narrowing::attach_direct_export_references (cognitive 17) crates/graph/src/graph/narrowing.rs:574— fallow_graph::graph::narrowing::attach_direct_export_references has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (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.
fallow_graph::resolve::auto_imports::forwarded_reads (cognitive 17) crates/graph/src/resolve/auto_imports.rs:300— fallow_graph::resolve::auto_imports::forwarded_reads has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), match/switch 1 (3 pts) (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.
fallow_graph::resolve::specifier::try_tsconfig_alias_target (cognitive 17) crates/graph/src/resolve/specifier.rs:996— fallow_graph::resolve::specifier::try_tsconfig_alias_target has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts), 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.
fallow_graph::graph::effective_exports::register_named_observer (cognitive 16) crates/graph/src/graph/effective_exports.rs:1119— fallow_graph::graph::effective_exports::register_named_observer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), match/switch 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.
fallow_graph::resolve::specifier::try_nearest_tsconfig_path_alias (cognitive 16) crates/graph/src/resolve/specifier.rs:858— fallow_graph::resolve::specifier::try_nearest_tsconfig_path_alias has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, loops 2 (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.
fallow_graph::resolve::specifier::try_tsconfig_paths_from_config (cognitive 16) crates/graph/src/resolve/specifier.rs:906— fallow_graph::resolve::specifier::try_tsconfig_paths_from_config has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (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.
Duplicated block (13 lines × 2) crates/api/src/type_aware/mod.rs:101— crates/api/src/type_aware/mod.rs:101-113 | crates/api/src/type_aware/mod.rs:165-177 — 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 (13 lines × 2) crates/cli/src/audit_brief.rs:1014— crates/cli/src/audit_brief.rs:1014-1026 | crates/cli/src/report/human/check.rs:772-784 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (13 lines × 2) crates/cli/src/flags.rs:527— crates/cli/src/flags.rs:527-539 | crates/cli/src/suppressions.rs:107-119 — before extracting anything, compare `crates/cli/src/flags.rs` and `crates/cli/src/suppressions.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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 (13 lines × 2) crates/core/src/analyze/unused_component_input.rs:72— crates/core/src/analyze/unused_component_input.rs:72-84 | crates/core/src/analyze/unused_component_output.rs:69-81 — before extracting anything, compare `crates/core/src/analyze/unused_component_input.rs` and `crates/core/src/analyze/unused_component_output.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 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 (13 lines × 2) crates/engine/src/health/result.rs:497— crates/engine/src/health/result.rs:497-509 | crates/engine/src/health/result.rs:536-548 — 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 (13 lines × 2) crates/extract/src/css_in_js/tokens.rs:1450— crates/extract/src/css_in_js/tokens.rs:1450-1462 | crates/extract/src/css_in_js/tokens.rs:1533-1545 — 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 (13 lines × 2) crates/extract/src/parse.rs:880— crates/extract/src/parse.rs:880-892 | crates/extract/src/suppress.rs:67-79 — 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 (13 lines × 2) crates/extract/src/visitor/helpers.rs:1519— crates/extract/src/visitor/helpers.rs:1519-1531 | crates/extract/src/visitor/helpers.rs:1611-1623 — 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 (13 lines × 2) crates/extract/src/visitor/visit_impl.rs:4712— crates/extract/src/visitor/visit_impl.rs:4712-4724 | crates/extract/src/visitor/visit_impl.rs:5226-5238 — 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 (13 lines × 2) crates/extract/src/visitor/visit_impl.rs:6201— crates/extract/src/visitor/visit_impl.rs:6201-6213 | crates/extract/src/visitor/visit_impl.rs:6216-6228 — 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 (13 lines × 2) crates/graph/src/resolve/react_native.rs:170— crates/graph/src/resolve/react_native.rs:170-182 | crates/graph/src/resolve/react_native.rs:222-234 — 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 (13 lines × 2) crates/mcp/src/tools/security.rs:64— crates/mcp/src/tools/security.rs:64-76 | crates/mcp/src/tools/similar_code.rs:180-192 — 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 (13 lines × 2) crates/mcp/src/tools/trace.rs:336— crates/mcp/src/tools/trace.rs:336-348 | crates/mcp/src/tools/trace.rs:625-637 — 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 (13 lines × 2) crates/core/src/analyze/mod.rs:380— crates/core/src/analyze/mod.rs:380-392 | crates/engine/src/public_api.rs:107-119 — before extracting anything, compare `crates/core/src/analyze/mod.rs` and `crates/engine/src/public_api.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) crates/lsp/src/code_actions/quick_fix.rs:574— crates/lsp/src/code_actions/quick_fix.rs:574-586 | crates/lsp/src/diagnostics/unused.rs:428-440 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (13 lines × 2) crates/cli/src/report/mod.rs:894— crates/cli/src/report/mod.rs:894-906 | crates/cli/src/report/mod.rs:1277-1290 — 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 (13 lines × 2) crates/core/src/plugins/postcss.rs:72— crates/core/src/plugins/postcss.rs:72-84 | crates/core/src/plugins/sveltekit.rs:209-221 — 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 (13 lines × 2) crates/cli/src/report/github_summary.rs:2527— crates/cli/src/report/github_summary.rs:2527-2539 | crates/cli/src/report/github_summary.rs:2678-2690 — 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 (13 lines × 2) crates/cli/src/report/json.rs:1033— crates/cli/src/report/json.rs:1033-1045 | crates/cli/src/report/json.rs:1065-1077 — 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 (13 lines × 2) crates/cli/src/base_worktree.rs:55— crates/cli/src/base_worktree.rs:55-67 | crates/cli/src/base_worktree.rs:129-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 (13 lines × 2) scripts/public-config-corpus.py:835— scripts/public-config-corpus.py:835-847 | scripts/public-config-corpus.py:852-878 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `scripts/public-config-corpus.py:835` it begins part-way through the construct above it, 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.
No assertions: preflight accepts the sidecar's own install of each backend tools/type-aware-sidecar/test/backend-preflight.test.mjs:33— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: pauses tools/mutation-runner/test/fixtures/node-basic/test/faults.test.ts:10— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: positive without an assertion tools/mutation-runner/test/fixtures/node-basic/test/math.test.ts:20— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: noise tools/mutation-runner/test/fixtures/node-basic/test/math.test.ts:24— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: pauses tools/mutation-runner/test/fixtures/bun-basic/test/faults.test.ts:9— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: positive without an assertion tools/mutation-runner/test/fixtures/bun-basic/test/math.test.ts:20— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: noise tools/mutation-runner/test/fixtures/bun-basic/test/math.test.ts:24— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: renders the page many times tests/fixtures/render-fan-in/src/__tests__/Button.test.tsx:20— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: opens a report tests/fixtures/playwright-test-subpath-import/tests/example.test.ts:4— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: chained access reaches admin page tests/fixtures/playwright-pom-fixtures-nested/tests/chained.spec.ts:3— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: nested destructure reaches user page tests/fixtures/playwright-pom-fixtures-nested/tests/destructured.spec.ts:3— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: admin and user tests/fixtures/playwright-pom-fixtures/tests/example.spec.ts:3— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: helper tests/fixtures/issue-951-bun-test-discovery/test/unit/example.test.ts:4— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: smoke tests/fixtures/issue-951-bun-test-discovery/test/unit/smoke_spec.ts:3— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: outside tests/fixtures/issue-951-bun-test-discovery/test/outside/outside.test.ts:3— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: opens a report tests/fixtures/issue-3462-playwright-mergetests-chained-extend/tests/example.test.ts:3— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: login tests/fixtures/issue-1785-playwright-fixture-interface/tests/login.spec.ts:3— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: the lint and format scripts use the same scope list scripts/js-lint-scopes.test.mjs:29— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: keeps each envelope independently and narrowly versioned editors/vscode/test/generated-types.test.ts:59— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
fallow_api::runtime::similar_code::review_similar_code (cognitive 35) crates/api/src/runtime/similar_code.rs:256— fallow_api::runtime::similar_code::review_similar_code has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 3 (5 pts), boolean chains 2 (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.
fallow_api::diff_risk::detect_file (cognitive 28) crates/api/src/diff_risk/mod.rs:334— fallow_api::diff_risk::detect_file has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (12 pts), boolean chains 4 (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.
fallow_api::diff_risk::clones::diverged_clone_siblings (cognitive 26) crates/api/src/diff_risk/clones.rs:56— fallow_api::diff_risk::clones::diverged_clone_siblings has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (7 pts), loops 2 (3 pts), boolean chains 1 (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.
fallow_api::audit_run::base_files::can_reuse_current_as_base (cognitive 25) crates/api/src/audit_run/base_files.rs:26— fallow_api::audit_run::base_files::can_reuse_current_as_base has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 2 (4 pts), boolean chains 1, 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.
fallow_api::mutation::scheduler::read_dry_run (cognitive 25) crates/api/src/mutation/scheduler/mod.rs:1094— fallow_api::mutation::scheduler::read_dry_run has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 5 (8 pts), match/switch 2 (4 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.
fallow_api::health_codeclimate::build_health_codeclimate (cognitive 24) crates/api/src/health_codeclimate.rs:213— fallow_api::health_codeclimate::build_health_codeclimate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 6 (10 pts) (nesting depth added 10). 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.
fallow_api::audit_complexity::classify_complexity_attribution (cognitive 22) crates/api/src/audit_complexity.rs:457— fallow_api::audit_complexity::classify_complexity_attribution has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 5 (9 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.
fallow_api::mutation::scheduler::build_jobs (cognitive 22) crates/api/src/mutation/scheduler/mod.rs:1263— fallow_api::mutation::scheduler::build_jobs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, match/switch 1 (2 pts), 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.
fallow_api::similar_code::embed_selected_with_factory (cognitive 20) crates/api/src/similar_code/mod.rs:252— fallow_api::similar_code::embed_selected_with_factory has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (6 pts), match/switch 2 (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.
fallow_api::similar_code::transport::validate_embed_response (cognitive 20) crates/api/src/similar_code/transport.rs:294— fallow_api::similar_code::transport::validate_embed_response has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 13, if/else 6, match/switch 1. 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.
fallow_api::derive_health_sections (cognitive 18) crates/api/src/lib.rs:1268— fallow_api::derive_health_sections has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 6. 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.
fallow_api::diff_risk::text::call_chains (cognitive 18) crates/api/src/diff_risk/text.rs:415— fallow_api::diff_risk::text::call_chains has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), boolean chains 5 (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.
fallow_api::mutation::report::completion (cognitive 17) crates/api/src/mutation/report.rs:271— fallow_api::mutation::report::completion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 1, loops 1 (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.
fallow_api::type_aware::client::validate_response (cognitive 17) crates/api/src/type_aware/client/mod.rs:1418— fallow_api::type_aware::client::validate_response has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, loops 1 (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.
fallow_api::audit_run::attribute (cognitive 16) crates/api/src/audit_run/mod.rs:486— fallow_api::audit_run::attribute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 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.
fallow_api::diff_risk::read_files (cognitive 16) crates/api/src/diff_risk/mod.rs:203— fallow_api::diff_risk::read_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), boolean chains 1, loops 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.
fallow_api::doctor::canonicalize_with_missing_suffix (cognitive 16) crates/api/src/doctor.rs:666— fallow_api::doctor::canonicalize_with_missing_suffix has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 1 (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.
fallow_api::mutation::transport::read_lines (cognitive 16) crates/api/src/mutation/transport.rs:372— fallow_api::mutation::transport::read_lines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), match/switch 2 (5 pts), loops 2 (4 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.
fallow_api::similar_code::cache::decode_cache (cognitive 16) crates/api/src/similar_code/cache.rs:634— fallow_api::similar_code::cache::decode_cache has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), boolean chains 2 (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.
Change coupling: audit.rs ↔ mod.rs crates/cli/src/audit.rs:1— `crates/cli/src/audit.rs` and `crates/cli/src/combined/mod.rs` change together 73% of the time (16 of the 22 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 16 shared commits counted here, the most recent 3 are `f4121c21` fix(action): baseline health and duplication on the default run (#3316); `2186bd6b` fix(cli): reject --dupes-* overrides where dupes does not run (#3084); `773d4393` fix(dupes): fail on clone groups with --fail-on-issues and --ci (#3057) — run `git show` on any of them.
Change coupling: results.rs ↔ main.rs crates/core/src/results.rs:1— `crates/core/src/results.rs` and `crates/lsp/src/main.rs` change together 71% of the time (10 of the 14 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 10 shared commits counted here, the most recent 3 are `32499248` feat(security): surface severity tiers; `5dc83a4c` feat(security): structure findings as agent-actionable candidate records; `2e1d6f5b` feat(lsp): surface security candidates as opt-in diagnostics (#891) — run `git show` on any of them.
Change coupling: analysis-utils.ts ↔ config.ts editors/vscode/src/analysis-utils.ts:1— `editors/vscode/src/analysis-utils.ts` and `editors/vscode/src/config.ts` change together 65% of the time (13 of the 20 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 between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are `a6324bd1` feat(vscode): add the fallow.audit.worsened setting (#3714); `24dd2b0d` feat(lsp): add ignoreSymlinks to the duplication init options (#3083); `6c5bf5db` fix(cli): keep syntactic findings when type-aware analysis cannot run… — run `git show` on any of them.
Change coupling: markdown.rs ↔ sarif.rs crates/cli/src/report/markdown.rs:1— `crates/cli/src/report/markdown.rs` and `crates/cli/src/report/sarif.rs` change together 64% of the time (27 of the 42 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 between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 27 shared commits counted here, the most recent 3 are `5a664dea` feat(coverage): mirror cloud trust-output contract on local analyze r…; `312ce906` test: cover health and dead-code rendering branches in report formatters; `c187b94f` feat: add health threshold overrides — run `git show` on any of them.
Change coupling: mdx.rs ↔ sfc.rs crates/extract/src/mdx.rs:1— `crates/extract/src/mdx.rs` and `crates/extract/src/sfc.rs` change together 64% of the time (9 of the 14 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 between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `bd359f71` fix(extract): preserve container source positions; `0bf57c0b` fix: gate entire sfc/astro/mdx test modules under Miri; `9a10769a` fix: gate parser-invoking extract tests with #[cfg(not(miri))] — run `git show` on any of them.
Change coupling: mod.rs ↔ mdx.rs crates/extract/src/astro/mod.rs:1— `crates/extract/src/astro/mod.rs` and `crates/extract/src/mdx.rs` change together 64% of the time (9 of the 14 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 9 shared commits counted here, the most recent 3 are `bd359f71` fix(extract): preserve container source positions (at that commit the file was still `crates/extract/src/astro.rs`); `0bf57c0b` fix: gate entire sfc/astro/mdx test modules under Miri (at that commit the file was still `crates/extract/src/astro.rs`); `9a10769a` fix: gate parser-invoking extract tests with #[cfg(not(miri))] (at that commit the file was still `crates/extract/src/astro.rs`) — run `git show` on any of them.
Change coupling: security.rs ↔ rank.rs crates/cli/src/security.rs:1— `crates/cli/src/security.rs` and `crates/core/src/analyze/security/rank.rs` change together 60% of the time (9 of the 15 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 9 shared commits counted here, the most recent 3 are `18c70b76` fix(security): classify fixed-origin URL sinks; `32499248` feat(security): surface severity tiers; `1d26ae1c` feat(security): secret-to-network exfil category with destination signal — run `git show` on any of them.
Change coupling: health_css.rs ↔ health_grouped.rs crates/output/src/health_css.rs:1— `crates/output/src/health_css.rs` and `crates/output/src/health_grouped.rs` change together 60% of the time (6 of the 10 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 between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise 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 `7cd0a865` chore(types): align schemars optional fields with serde(default) + ad… (at that commit the files were still `crates/cli/src/health_types/mod.rs` and `crates/cli/src/health_types/grouped.rs`); `c7df139a` feat(schema): typed dupes wrappers + derived CoverageAnalyzeOutput (#… (at that commit the files were still `crates/cli/src/health_types/mod.rs` and `crates/cli/src/health_types/grouped.rs`); `6b6a89bb` refactor(health): typed HealthFinding wrapper retires findings post-p… (at that commit the files were still `crates/cli/src/health_types/mod.rs` and `crates/cli/src/health_types/grouped.rs`) — run `git show` on any of them.
Change coupling: vite.rs ↔ webpack.rs crates/core/src/plugins/vite.rs:1— `crates/core/src/plugins/vite.rs` and `crates/core/src/plugins/webpack.rs` change together 60% of the time (6 of the 10 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 between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise 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 `bb13ec8b` fix: read an absolute config path under the project root as absolute …; `5a64644d` fix: read bundler and Module Federation config options through indire…; `3f82ed02` feat(plugins): read Module Federation exposes and remotes from config… — run `git show` on any of them.
Change coupling: mod.rs ↔ dynamic_imports.rs crates/graph/src/cache/mod.rs:1— `crates/graph/src/cache/mod.rs` and `crates/graph/src/resolve/dynamic_imports.rs` change together 60% of the time (6 of the 10 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 `647aac26` fix(graph): resolve dynamic import patterns that start with ../ (#3558); `bc7978c9` refactor: share one extglob rewrite between the graph and the plugins…; `8c3ce1eb` fix(graph): apply negative import.meta.glob entries and escape litera… — run `git show` on any of them.
Change coupling: conversion.rs ↔ mod.rs crates/extract/src/cache/conversion.rs:1— `crates/extract/src/cache/conversion.rs` and `crates/extract/src/visitor/mod.rs` change together 54% of the time (14 of the 26 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 14 shared commits counted here, the most recent 3 are `c9b8dc6b` refactor: group semantic reference candidates; `832651ce` fix(dead-code): report an unlisted package that only a resolve call r…; `8b023e80` fix(dead-code): credit the package behind a node_modules/.bin path in… — run `git show` on any of them.
Change coupling: rank.rs ↔ tainted_sink.rs crates/core/src/analyze/security/rank.rs:1— `crates/core/src/analyze/security/rank.rs` and `crates/core/src/analyze/security/tainted_sink.rs` change together 53% of the time (8 of the 15 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 between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `18c70b76` fix(security): classify fixed-origin URL sinks; `bac297f6` feat(security): configure request receivers; `32499248` feat(security): surface severity tiers — run `git show` on any of them.
Change coupling: tainted_sink.rs ↔ visit_impl.rs crates/core/src/analyze/security/tainted_sink.rs:1— `crates/core/src/analyze/security/tainted_sink.rs` and `crates/extract/src/visitor/visit_impl.rs` change together 50% of the time (14 of the 28 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 14 shared commits counted here, the most recent 3 are `18c70b76` fix(security): classify fixed-origin URL sinks; `6a1dd0a7` fix: trust local sanitizer flows; `1d26ae1c` feat(security): secret-to-network exfil category with destination signal — run `git show` on any of them.
Change coupling: config.ts ↔ treeView.ts editors/vscode/src/config.ts:1— `editors/vscode/src/config.ts` and `editors/vscode/src/treeView.ts` change together 50% of the time (7 of the 14 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 between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise 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 `16aa6a90` fix(vscode): gate DIAGNOSTIC_CATEGORIES drift and wire policy-violati…; `543a32ab` fix: extend IssueKind drift gates and close the surface gaps they fou…; `2f636206` fix: wire post-2.96.0 IssueKinds through LSP severity, VS Code, and C… — run `git show` on any of them.
Change coupling: visit_impl.rs ↔ lib.rs crates/extract/src/visitor/visit_impl.rs:1— `crates/extract/src/visitor/visit_impl.rs` and `crates/security/src/lib.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 `1d26ae1c` feat(security): secret-to-network exfil category with destination signal (at that commit the file was still `crates/core/src/analyze/security/catalogue.rs`); `171d49a4` feat(security): expand source-backed entry inputs (at that commit the file was still `crates/core/src/analyze/security/catalogue.rs`); `71394a24` fix(security): add issue 901 literal rows (at that commit the file was still `crates/core/src/analyze/security/catalogue.rs`) — run `git show` on any of them.
Change coupling: unused_deps.rs ↔ unused_files.rs crates/core/src/analyze/unused_deps.rs:1— `crates/core/src/analyze/unused_deps.rs` and `crates/core/src/analyze/unused_files.rs` change together 50% of the time (5 of the 10 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 between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `5b4201a7` docs: keep core migration warnings self-contained; `836920e6` feat(core): deprecate fallow_core public surface per ADR-008 phase 1; `c24638fe` refactor: replace wildcard imports with explicit names — run `git show` on any of them.
Change coupling: knip_tables.rs ↔ builtin.rs crates/cli/src/migrate/knip_tables.rs:1— `crates/cli/src/migrate/knip_tables.rs` and `crates/core/src/plugins/registry/builtin.rs` change together 50% of the time (5 of the 10 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 5 shared commits counted here, the most recent 3 are `e692f852` feat(plugins): add dotenv plugin including dotenvx support (#3771); `ec4a6982` feat(plugins): read GitHub Action manifest entries and the VitePress …; `47c82b2c` feat(plugins): add a release-it plugin that credits its config file a… — run `git show` on any of them.
Change coupling: mod.rs ↔ reachability.rs crates/graph/src/cache/mod.rs:1— `crates/graph/src/cache/mod.rs` and `crates/graph/src/graph/reachability.rs` change together 50% of the time (5 of the 10 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 5 shared commits counted here, the most recent 3 are `8c3ce1eb` fix(graph): apply negative import.meta.glob entries and escape litera…; `170c3769` fix(health): skip type-only edges in test reachability (#3521); `1b138850` fix(graph): treat path and asset references as edges that do not run … — run `git show` on any of them.
ModuleInfoExtractor::record_factory_return_function (cyclomatic 27) crates/extract/src/visitor/visit_impl.rs:188— ModuleInfoExtractor::record_factory_return_function has cyclomatic complexity 27 (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.
ModuleInfoExtractor::visit_assignment_expression (cyclomatic 23) crates/extract/src/visitor/visit_impl.rs:4840— ModuleInfoExtractor::visit_assignment_expression has cyclomatic complexity 23 (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.
ModuleInfoExtractor::record_declarator_instance_bindings (cyclomatic 20) crates/extract/src/visitor/visit_impl.rs:2674— ModuleInfoExtractor::record_declarator_instance_bindings 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.
ModuleInfoExtractor::extract_declaration_exports (cyclomatic 19) crates/extract/src/visitor/declarations.rs:75— ModuleInfoExtractor::extract_declaration_exports 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.
ModuleInfoExtractor::resolve_playwright_factory_call_definitions (cyclomatic 19) crates/extract/src/visitor/mod.rs:2600— ModuleInfoExtractor::resolve_playwright_factory_call_definitions 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.
ModuleInfoExtractor::callback_result_proof (cyclomatic 19) crates/extract/src/visitor/visit_impl_callback_properties.rs:68— ModuleInfoExtractor::callback_result_proof has cyclomatic complexity 19 (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.
ModuleInfoExtractor::record_direct_object_binding_fallback (cyclomatic 19) crates/extract/src/visitor/visit_impl_object_binding_patterns.rs:137— ModuleInfoExtractor::record_direct_object_binding_fallback has cyclomatic complexity 19 (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.
ModuleInfoExtractor::record_program_namespace_import_locals (cyclomatic 18) crates/extract/src/visitor/visit_impl.rs:1184— ModuleInfoExtractor::record_program_namespace_import_locals 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.
ModuleInfoExtractor::record_projection_source (cyclomatic 18) crates/extract/src/visitor/visit_impl_projections.rs:287— ModuleInfoExtractor::record_projection_source 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.
ModuleInfoExtractor::record_subclass_member_access (cyclomatic 17) crates/extract/src/visitor/visit_impl.rs:1859— ModuleInfoExtractor::record_subclass_member_access has cyclomatic complexity 17 (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.
ModuleInfoExtractor::record_variable_declarator (cyclomatic 17) crates/extract/src/visitor/visit_impl.rs:2930— ModuleInfoExtractor::record_variable_declarator has cyclomatic complexity 17 (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.
ModuleInfoExtractor::classify_di_call_site (cyclomatic 17) crates/extract/src/visitor/visit_impl_di.rs:19— ModuleInfoExtractor::classify_di_call_site 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.
ModuleInfoExtractor::static_sink_literal_value (cyclomatic 17) crates/extract/src/visitor/visit_impl_scope_bindings.rs:419— ModuleInfoExtractor::static_sink_literal_value 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.
ModuleInfoExtractor::record_factory_return_candidate (cyclomatic 16) crates/extract/src/visitor/visit_impl.rs:399— ModuleInfoExtractor::record_factory_return_candidate 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.
ModuleInfoExtractor::retain_new_constructor (cyclomatic 16) crates/extract/src/visitor/visit_impl_constructor_alternatives.rs:140— ModuleInfoExtractor::retain_new_constructor has cyclomatic complexity 16 (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.
ModuleInfoExtractor::complete_binding_producer_calls (cyclomatic 16) crates/extract/src/visitor/visit_impl_object_bindings.rs:968— ModuleInfoExtractor::complete_binding_producer_calls 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.
ModuleInfoExtractor::defer_vue_local_array (cyclomatic 16) crates/extract/src/visitor/visit_impl_projections.rs:430— ModuleInfoExtractor::defer_vue_local_array has cyclomatic complexity 16 (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.
AC6 · Visual & motion safety· Animation without a prefers-reduced-motion guard · ×16
Animation without a prefers-reduced-motion guard viz-frontend/src/styles.css:434— `.lens-menu` moves (`animation: pop-in var(--dur-base) var(--ease-out)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard viz-frontend/src/styles.css:1122— `#panel.open > *` moves (`animation: settle-in var(--dur-slow) var(--ease-out) backwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard viz-frontend/src/styles.css:1140— `#panel .rank-table tbody tr` moves (`animation: settle-in var(--dur-slow) var(--ease-out) backwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard viz-frontend/src/styles.css:2046— `.hint-tip` moves (`animation: pop-in var(--dur-fast) var(--ease-out)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard viz-frontend/src/styles.css:2092— `#panel .bar-fill` moves (`animation: bar-grow 640ms var(--ease-out) backwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard viz-frontend/src/styles.css:2329— `.sev-seg` moves (`animation: strip-grow var(--dur-slow) var(--ease-out) backwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard viz-frontend/src/styles.css:2758— `#tooltip` moves (`animation: pop-in var(--dur-fast) var(--ease-out)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard viz-frontend/src/styles.css:2887— `#help-overlay.open .help-box` moves (`animation: help-in var(--dur-slow) var(--ease-out)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard crates/cli/viz-assets/viz.css:477— `.lens-menu` moves (`animation: pop-in var(--dur-base) var(--ease-out)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard crates/cli/viz-assets/viz.css:1165— `#panel.open > *` moves (`animation: settle-in var(--dur-slow) var(--ease-out) backwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard crates/cli/viz-assets/viz.css:1183— `#panel .rank-table tbody tr` moves (`animation: settle-in var(--dur-slow) var(--ease-out) backwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard crates/cli/viz-assets/viz.css:2089— `.hint-tip` moves (`animation: pop-in var(--dur-fast) var(--ease-out)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard crates/cli/viz-assets/viz.css:2135— `#panel .bar-fill` moves (`animation: bar-grow 640ms var(--ease-out) backwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard crates/cli/viz-assets/viz.css:2372— `.sev-seg` moves (`animation: strip-grow var(--dur-slow) var(--ease-out) backwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard crates/cli/viz-assets/viz.css:2801— `#tooltip` moves (`animation: pop-in var(--dur-fast) var(--ease-out)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard crates/cli/viz-assets/viz.css:2930— `#help-overlay.open .help-box` moves (`animation: help-in var(--dur-slow) var(--ease-out)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
R4 · Test Coverage· This test file cannot be loaded · ×15
This test file cannot be loaded scripts/verify-release-ci.test.mjs:385— scripts/verify-release-ci.test.mjs:385 imports '../.github/workflows/', 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 tests/conformance/fixtures/basic/src/unresolved.ts:2— tests/conformance/fixtures/basic/src/unresolved.ts:2 imports './does-not-exist', 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 tests/fixtures/dynamic-import-literals/src/index.ts:3— tests/fixtures/dynamic-import-literals/src/index.ts:3 imports './missing', 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 tests/fixtures/external-override-class-members/src/unresolved.ts:1— tests/fixtures/external-override-class-members/src/unresolved.ts:1 imports './generated/base', 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 tests/fixtures/issue-2395-css-module-credit/src/index.tsx:7— tests/fixtures/issue-2395-css-module-credit/src/index.tsx:7 imports './extensionless.module', 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 tests/fixtures/issue-3208-lib-output-source/packages/consumer/src/relative.ts:1— tests/fixtures/issue-3208-lib-output-source/packages/consumer/src/relative.ts:1 imports '../lib/helper.js', 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 tests/fixtures/issue-399-new-url/vite.config.ts:6— tests/fixtures/issue-399-new-url/vite.config.ts:6 imports './', 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 tests/fixtures/issue-840-new-url-directory/entry.js:7— tests/fixtures/issue-840-new-url-directory/entry.js:7 imports './services', 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 tests/fixtures/new-url-filesystem-path/src/index.ts:12— tests/fixtures/new-url-filesystem-path/src/index.ts:12 imports './missing-worker.js', 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 tests/fixtures/react-router-conventions/app/root.tsx:2— tests/fixtures/react-router-conventions/app/root.tsx:2 imports './+types/runtime', 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 tests/fixtures/require-resolve-relative/src/index.js:6— tests/fixtures/require-resolve-relative/src/index.js:6 imports '../dist/built-worker.js', 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 tests/fixtures/tanstack-router-generated-route-tree-import/src/router.tsx:2— tests/fixtures/tanstack-router-generated-route-tree-import/src/router.tsx:2 imports './routeTree.gen', 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 tests/fixtures/unresolved-gitignored-target/src/index.ts:3— tests/fixtures/unresolved-gitignored-target/src/index.ts:3 imports './missing', 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 tests/fixtures/unresolved-imports/src/index.ts:1— tests/fixtures/unresolved-imports/src/index.ts:1 imports './nonexistent', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (2 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 tests/fixtures/vite-alias-project/vite.config.ts:7— tests/fixtures/vite-alias-project/vite.config.ts: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.
fallow_cli::similar_code_help::unsupported_similar_code_option_with_explicit_tolerance (cyclomatic 34) crates/cli/src/similar_code_help.rs:67— fallow_cli::similar_code_help::unsupported_similar_code_option_with_explicit_tolerance has cyclomatic complexity 34 (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.
fallow_cli::audit_cache_prune::entry_row (cyclomatic 27) crates/cli/src/audit_cache_prune.rs:306— fallow_cli::audit_cache_prune::entry_row has cyclomatic complexity 27 (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.
fallow_cli::cli_startup::validate_input_flags (cyclomatic 27) crates/cli/src/cli_startup.rs:123— fallow_cli::cli_startup::validate_input_flags has cyclomatic complexity 27 (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. This is NOT this file's highest cyclomatic complexity: fallow_cli::cli_startup::command_without_global_baseline (cyclomatic 37) 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.
fallow_cli::report::sarif::native_rule_id (cyclomatic 26) crates/cli/src/report/sarif.rs:764— fallow_cli::report::sarif::native_rule_id has cyclomatic complexity 26 (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.
fallow_cli::agent_install::mcp::merge_codex (cyclomatic 21) crates/cli/src/agent_install/mcp.rs:833— fallow_cli::agent_install::mcp::merge_codex 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.
fallow_cli::unsupported_security_global (cyclomatic 19) crates/cli/src/lib.rs:200— fallow_cli::unsupported_security_global 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.
fallow_cli::audit_brief::decision_surface_lines (cyclomatic 19) crates/cli/src/audit_brief.rs:1802— fallow_cli::audit_brief::decision_surface_lines has cyclomatic complexity 19 (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.
fallow_cli::report::human::check::collect_framework_rules (cyclomatic 19) crates/cli/src/report/human/check.rs:3544— fallow_cli::report::human::check::collect_framework_rules has cyclomatic complexity 19 (threshold 15). 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.
fallow_cli::agent_install::mcp::merge_enabled_server (cyclomatic 18) crates/cli/src/agent_install/mcp.rs:692— fallow_cli::agent_install::mcp::merge_enabled_server has cyclomatic complexity 18 (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.
fallow_cli::audit_brief::build_test_reach_facts (cyclomatic 17) crates/cli/src/audit_brief.rs:240— fallow_cli::audit_brief::build_test_reach_facts 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.
fallow_cli::cli_report::run_report (cyclomatic 17) crates/cli/src/cli_report.rs:28— fallow_cli::cli_report::run_report has cyclomatic complexity 17 (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.
fallow_cli::mutation_cli::run_inner (cyclomatic 17) crates/cli/src/mutation_cli.rs:526— fallow_cli::mutation_cli::run_inner has cyclomatic complexity 17 (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.
fallow_cli::agent_install::mcp::merge_json_server (cyclomatic 16) crates/cli/src/agent_install/mcp.rs:618— fallow_cli::agent_install::mcp::merge_json_server 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.
fallow_cli::flags::run_flags (cyclomatic 16) crates/cli/src/flags.rs:158— fallow_cli::flags::run_flags 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.
ClassTooLong: ModuleInfoExtractor crates/extract/src/visitor/mod.rs:620— ClassTooLong — 1978 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 718 methods, 2 blocks, lines 620-4053. The bar is 400 significant lines; this is 1578 over it, 4.95× 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: ContractCollector crates/extract/src/component_contracts/mod.rs:71— ClassTooLong — 778 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 40 methods, 2 blocks, lines 71-1141. The bar is 400 significant lines; this is 378 over it, 1.95× 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: AnalysisSession crates/engine/src/session.rs:41— ClassTooLong — 727 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 57 methods, 2 blocks, lines 41-1349. The bar is 400 significant lines; this is 327 over it, 1.82× 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: AnalysisResults crates/types/src/results.rs:246— ClassTooLong — 694 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 38 methods, 2 blocks, lines 246-2121. The bar is 400 significant lines; this is 294 over it, 1.74× 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: FallowLspServer crates/lsp/src/lib.rs:302— ClassTooLong — 672 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 25 methods, 3 blocks, lines 302-1449. The bar is 400 significant lines; this is 272 over it, 1.68× 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: FlagVisitor crates/extract/src/flags.rs:185— ClassTooLong — 545 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 30 methods, 3 blocks, lines 185-1022. The bar is 400 significant lines; this is 145 over it, 1.36× 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: ComplexityVisitor crates/extract/src/complexity.rs:117— ClassTooLong — 531 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 26 methods, 3 blocks, lines 117-1004. The bar is 400 significant lines; this is 131 over it, 1.33× 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: TokenExtractor crates/engine/src/duplication_detector/token_visitor.rs:19— ClassTooLong — 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 11 methods, 3 blocks, lines 19-906. The bar is 400 significant lines; this is 130 over it, 1.33× 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: Command crates/cli/src/cli_args.rs:708— ClassTooLong — 529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 0 methods. The bar is 400 significant lines; this is 129 over it, 1.32× 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: ModuleGraph crates/graph/src/graph/mod.rs:162— ClassTooLong — 528 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 95 methods, 3 blocks, lines 162-1576. The bar is 400 significant lines; this is 128 over it, 1.32× 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: Scan crates/engine/src/trace_usage_impl.rs:279— ClassTooLong — 457 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 19 methods, 2 blocks, lines 279-940. The bar is 400 significant lines; this is 57 over it, 1.14× 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: DeadCodeTreeProvider editors/vscode/src/treeView.ts:160— ClassTooLong — 435 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 35 over it, 1.09× 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: BaselineFilterContext crates/engine/src/baseline/mod.rs:1692— ClassTooLong — 415 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 19 methods, 2 blocks, lines 1692-2220. The bar is 400 significant lines; this is 15 over it, 1.04× 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.
Duplicated block (15 lines × 2) crates/cli/src/report/badge.rs:38— crates/cli/src/report/badge.rs:38-52 | crates/cli/src/report/badge.rs:94-108 — 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 (15 lines × 2) crates/core/src/analyze/mod.rs:298— crates/core/src/analyze/mod.rs:298-312 | crates/engine/src/public_api.rs:352-366 — before extracting anything, compare `crates/core/src/analyze/mod.rs` and `crates/engine/src/public_api.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 2) crates/core/src/analyze/unused_component_input.rs:56— crates/core/src/analyze/unused_component_input.rs:56-70 | crates/core/src/analyze/unused_component_output.rs:53-67 — before extracting anything, compare `crates/core/src/analyze/unused_component_input.rs` and `crates/core/src/analyze/unused_component_output.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 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 (15 lines × 2) crates/core/src/discover/entry_points.rs:447— crates/core/src/discover/entry_points.rs:447-461 | crates/engine/src/public_api.rs:289-303 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (15 lines × 2) crates/core/src/lib.rs:1619— crates/core/src/lib.rs:1619-1633 | crates/engine/src/session.rs:1399-1413 — before extracting anything, compare `crates/core/src/lib.rs` and `crates/engine/src/session.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 2) crates/core/src/plugins/module_federation.rs:676— crates/core/src/plugins/module_federation.rs:676-690 | crates/core/src/plugins/module_federation.rs:751-765 — 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 (15 lines × 2) crates/core/src/scripts/mod.rs:1804— crates/core/src/scripts/mod.rs:1804-1818 | crates/engine/src/discover.rs:730-744 — before extracting anything, compare `crates/core/src/scripts/mod.rs` and `crates/engine/src/discover.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 2) crates/engine/src/health/css_analytics/theme_tokens.rs:23— crates/engine/src/health/css_analytics/theme_tokens.rs:23-37 | crates/engine/src/health/css_analytics/theme_tokens.rs:60-74 — 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 (15 lines × 2) crates/extract/src/css_in_js/tokens.rs:1129— crates/extract/src/css_in_js/tokens.rs:1129-1143 | crates/extract/src/css_in_js/tokens.rs:1561-1575 — 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 (15 lines × 2) crates/api/src/dead_code_codeclimate.rs:1765— crates/api/src/dead_code_codeclimate.rs:1765-1781 | crates/api/src/dead_code_codeclimate.rs:1850-1864 — 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 (15 lines × 2) crates/types/src/output_dead_code.rs:3836— crates/types/src/output_dead_code.rs:3836-3850 | crates/types/src/output_dead_code.rs:3913-3927 — 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 (15 lines × 2) crates/types/src/output_dead_code.rs:1333— crates/types/src/output_dead_code.rs:1333-1347 | crates/types/src/output_dead_code.rs:1430-1444 — 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 (15 lines × 2) scripts/public-config-corpus.py:546— scripts/public-config-corpus.py:546-560 | scripts/public-config-corpus.py:662-676 — 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. 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.
ContractCollector::angular_class_props (cognitive 44) crates/extract/src/component_contracts/classes.rs:126— ContractCollector::angular_class_props has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (35 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 24). 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.
ContractCollector::collect_callers (cognitive 43) crates/extract/src/component_contracts/mod.rs:768— ContractCollector::collect_callers has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 5 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 24). 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.
ContractCollector::collect_declarations (cognitive 34) crates/extract/src/component_contracts/mod.rs:251— ContractCollector::collect_declarations has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 2 (6 pts), boolean chains 3, loops 1 (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.
ContractCollector::vue_options_props (cognitive 29) crates/extract/src/component_contracts/classes.rs:6— ContractCollector::vue_options_props has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2 (4 pts), match/switch 1 (4 pts), boolean chains 1 (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.
ContractCollector::lit_attribute_names (cognitive 26) crates/extract/src/component_contracts/classes.rs:324— ContractCollector::lit_attribute_names has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (4 pts), loops 2 (3 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.
ContractCollector::add_macro_shapes (cognitive 24) crates/extract/src/component_contracts/mod.rs:680— ContractCollector::add_macro_shapes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 7, loops 2 (3 pts), match/switch 2 (3 pts) (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.
ContractCollector::collect_exports (cognitive 23) crates/extract/src/component_contracts/mod.rs:1012— ContractCollector::collect_exports has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 2, loops 1 (nesting depth added 10). 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.
ContractCollector::function_props (cognitive 22) crates/extract/src/component_contracts/mod.rs:477— ContractCollector::function_props has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 3 (5 pts), match/switch 2 (3 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.
ContractCollector::macro_props (cognitive 21) crates/extract/src/component_contracts/mod.rs:626— ContractCollector::macro_props has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 13). 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.
ContractCollector::collect_escapes (cognitive 21) crates/extract/src/component_contracts/mod.rs:955— ContractCollector::collect_escapes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 1 (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.
ContractCollector::astro_props (cognitive 19) crates/extract/src/component_contracts/mod.rs:366— ContractCollector::astro_props has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 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.
ContractCollector::collect_shapes (cognitive 17) crates/extract/src/component_contracts/mod.rs:148— ContractCollector::collect_shapes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (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.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×11
Members sharing a duplicated core (4 members, 50+ identical tokens) crates/cli/src/bin/stub_sidecar.rs:131— crates/cli/src/bin/stub_sidecar.rs:131-177 | crates/cli/src/bin/stub_sidecar.rs:181-238 | crates/cli/src/bin/stub_sidecar.rs:240-313 | crates/cli/src/bin/stub_sidecar.rs:318-348 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) crates/cli/src/report/human/check.rs:3221— crates/cli/src/report/human/check.rs:3221-3273 | crates/cli/src/report/human/check.rs:3282-3320 | crates/cli/src/report/human/check.rs:3329-3356 | crates/cli/src/report/human/check.rs:3411-3439 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) crates/core/src/analyze/members/factory.rs:18— crates/core/src/analyze/members/factory.rs:18-51 | crates/core/src/analyze/members/fluent_chain.rs:47-85 | crates/core/src/analyze/members/fluent_chain.rs:108-146 | crates/core/src/analyze/members/typed_property.rs:14-48 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) crates/core/src/analyze/unused_component_emit.rs:43— crates/core/src/analyze/unused_component_emit.rs:43-75 | crates/core/src/analyze/unused_component_input.rs:55-88 | crates/core/src/analyze/unused_component_output.rs:52-85 | crates/core/src/analyze/unused_svelte_event.rs:42-82 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) crates/engine/src/changed_files.rs:157— crates/engine/src/changed_files.rs:157-180 | crates/engine/src/changed_files.rs:183-209 | crates/engine/src/changed_files.rs:226-264 | crates/engine/src/changed_files.rs:603-625 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) crates/engine/src/effective_severity.rs:483— crates/engine/src/effective_severity.rs:483-605 | crates/engine/src/effective_severity.rs:616-734 | crates/types/src/identity.rs:440-569 | crates/types/src/results.rs:829-981 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) crates/engine/src/health/result.rs:291— crates/engine/src/health/result.rs:291-319 | crates/engine/src/health/result.rs:324-355 | crates/engine/src/health/result.rs:360-394 | crates/engine/src/health/result.rs:447-478 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) crates/extract/src/css_in_js/tokens.rs:1110— crates/extract/src/css_in_js/tokens.rs:1110-1205 | crates/extract/src/css_in_js/tokens.rs:1327-1396 | crates/extract/src/css_in_js/tokens.rs:1558-1612 | crates/extract/src/css_in_js/tokens.rs:1729-1813 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) crates/extract/src/visitor/visit_impl.rs:1474— crates/extract/src/visitor/visit_impl.rs:1474-1552 | crates/extract/src/visitor/visit_impl.rs:1575-1614 | crates/extract/src/visitor/visit_impl.rs:1810-1817 | crates/extract/src/visitor/visit_impl.rs:1966-1974 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) crates/napi/src/lib.rs:474— crates/napi/src/lib.rs:474-501 | crates/napi/src/lib.rs:507-551 | crates/napi/src/lib.rs:612-632 | crates/napi/src/lib.rs:638-685 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) crates/core/src/analyze/unused_deps_tests/dev_dep_in_prod.rs:9— crates/core/src/analyze/unused_deps_tests/dev_dep_in_prod.rs:9-55 | crates/core/src/analyze/unused_deps_tests/helpers.rs:118-173 | crates/core/src/analyze/unused_deps_tests/unlisted_deps.rs:1187-1269 | crates/core/src/analyze/unused_deps_tests/unresolved_imports.rs:1370-1396 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (16 lines × 2) crates/api/src/dead_code_codeclimate.rs:1751— crates/api/src/dead_code_codeclimate.rs:1751-1766 | crates/output/src/dead_code_sarif.rs:1083-1098 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (16 lines × 2) crates/cli/src/check/output.rs:86— crates/cli/src/check/output.rs:86-101 | crates/cli/src/check/output.rs:124-139 — 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 (16 lines × 2) crates/cli/src/dispatch.rs:451— crates/cli/src/dispatch.rs:451-466 | crates/cli/src/dispatch.rs:503-518 — 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 (16 lines × 2) crates/cli/src/fix/catalog.rs:109— crates/cli/src/fix/catalog.rs:109-124 | crates/cli/src/fix/catalog.rs:508-523 — 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 (16 lines × 2) crates/cli/src/flags.rs:725— crates/cli/src/flags.rs:725-740 | crates/cli/src/suppressions.rs:200-215 — before extracting anything, compare `crates/cli/src/flags.rs` and `crates/cli/src/suppressions.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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 (16 lines × 2) crates/config/src/config/mutation.rs:62— crates/config/src/config/mutation.rs:62-77 | crates/mutation/src/operator.rs:63-78 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (16 lines × 2) crates/engine/src/duplication_detector/tokenize/mod.rs:164— crates/engine/src/duplication_detector/tokenize/mod.rs:164-179 | crates/engine/src/duplication_detector/tokenize/mod.rs:190-205 — 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 (16 lines × 2) crates/engine/src/health/component_rollup.rs:105— crates/engine/src/health/component_rollup.rs:105-120 | crates/engine/src/health/findings.rs:560-575 — 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 (16 lines × 2) crates/engine/src/health/css_analytics/cva.rs:220— crates/engine/src/health/css_analytics/cva.rs:220-235 | crates/engine/src/health/css_analytics/mod.rs:691-706 — 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 (16 lines × 2) crates/api/src/health_codeclimate.rs:286— crates/api/src/health_codeclimate.rs:286-301 | crates/output/src/analysis_sarif.rs:658-673 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (16 lines × 2) crates/types/src/output_dead_code.rs:1315— crates/types/src/output_dead_code.rs:1315-1330 | crates/types/src/output_dead_code.rs:1410-1427 — 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 lines × 3) crates/core/src/suppress.rs:139— crates/core/src/suppress.rs:139-145 | crates/core/src/suppress.rs:158-164 | crates/core/src/suppress.rs:182-188 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 3) crates/extract/src/html.rs:108— crates/extract/src/html.rs:108-114 | crates/extract/src/html.rs:117-123 | crates/extract/src/html.rs:125-131 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 3) crates/extract/src/sfc_template/angular.rs:328— crates/extract/src/sfc_template/angular.rs:328-334 | crates/extract/src/sfc_template/svelte.rs:625-631 | crates/extract/src/sfc_template/vue.rs:223-229 — 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 (7 lines × 3) crates/extract/src/template_complexity/engine.rs:576— crates/extract/src/template_complexity/engine.rs:576-582 | crates/extract/src/template_complexity/engine.rs:696-702 | crates/extract/src/template_complexity/svelte.rs:622-628 — before extracting anything, compare `crates/extract/src/template_complexity/engine.rs` and `crates/extract/src/template_complexity/svelte.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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 × 3) crates/api/src/analysis_context.rs:753— crates/api/src/analysis_context.rs:753-759 | crates/cli/src/check/filtering.rs:168-174 | crates/engine/src/workspace_scope.rs:275-281 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (7 lines × 3) crates/core/src/plugins/contentlayer.rs:241— crates/core/src/plugins/contentlayer.rs:241-247 | crates/core/src/plugins/fumadocs.rs:193-199 | crates/core/src/plugins/velite.rs:202-208 — 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 (7 lines × 3) crates/core/src/plugins/nestjs.rs:82— crates/core/src/plugins/nestjs.rs:82-88 | crates/core/src/plugins/nestjs_trpc.rs:24-30 | crates/core/src/plugins/vscode.rs:57-63 — 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 (7 lines × 3) crates/core/src/plugins/nuxt.rs:1870— crates/core/src/plugins/nuxt.rs:1870-1876 | crates/extract/src/effect_facts.rs:725-731 | crates/extract/src/federation_runtime.rs:372-378 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (7 lines × 3) crates/extract/src/sfc_props.rs:462— crates/extract/src/sfc_props.rs:462-468 | crates/extract/src/visitor/react.rs:1311-1318 | crates/extract/src/visitor/visit_impl_helpers.rs:1162-1168 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (7 lines × 3) crates/extract/src/template_usage.rs:434— crates/extract/src/template_usage.rs:434-440 | crates/extract/src/visitor/visit_impl_security_sinks.rs:435-441 | crates/extract/src/visitor/visit_impl_security_sinks.rs:520-526 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (18 lines × 2) crates/cli/src/report/human/health.rs:817— crates/cli/src/report/human/health.rs:817-834 | crates/cli/src/report/human/health.rs:851-868 — 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 (18 lines × 2) crates/cli/src/trace_error.rs:49— crates/cli/src/trace_error.rs:49-66 | crates/cli/src/trace_path.rs:41-58 — before extracting anything, compare `crates/cli/src/trace_error.rs` and `crates/cli/src/trace_path.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 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 (18 lines × 2) crates/core/src/analyze/mod.rs:320— crates/core/src/analyze/mod.rs:320-337 | crates/engine/src/public_api.rs:332-349 — before extracting anything, compare `crates/core/src/analyze/mod.rs` and `crates/engine/src/public_api.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (18 lines × 2) crates/core/src/analyze/predicates/import.rs:156— crates/core/src/analyze/predicates/import.rs:156-173 | crates/graph/src/resolve/path_info.rs:11-28 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (18 lines × 2) crates/core/src/scripts/mod.rs:2832— crates/core/src/scripts/mod.rs:2832-2849 | crates/engine/src/discover.rs:771-788 — before extracting anything, compare `crates/core/src/scripts/mod.rs` and `crates/engine/src/discover.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (18 lines × 2) crates/engine/src/vital_signs.rs:360— crates/engine/src/vital_signs.rs:360-377 | crates/engine/src/vital_signs.rs:391-408 — 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 (18 lines × 2) crates/mcp/src/tools/dupes.rs:148— crates/mcp/src/tools/dupes.rs:148-165 | crates/mcp/src/tools/trace.rs:419-436 — 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 (18 lines × 2) crates/types/src/workspace.rs:898— crates/types/src/workspace.rs:898-915 | crates/types/src/workspace.rs:1100-1117 — 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 (18 lines × 2) crates/types/src/workspace.rs:910— crates/types/src/workspace.rs:910-927 | crates/types/src/workspace.rs:975-992 — 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.
D10 · Test Quality· Test project verifies nothing · ×8
Test project verifies nothing: tests/fixtures/issue-1785-playwright-fixture-interface tests/fixtures/issue-1785-playwright-fixture-interface/tests/login.spec.ts:3— No conventional assertion call was detected in 1 of 1 tests in `tests/fixtures/issue-1785-playwright-fixture-interface` — the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail.
Test project verifies nothing: tests/fixtures/issue-3462-playwright-mergetests-chained-extend tests/fixtures/issue-3462-playwright-mergetests-chained-extend/tests/example.test.ts:3— No conventional assertion call was detected in 1 of 1 tests in `tests/fixtures/issue-3462-playwright-mergetests-chained-extend` — the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail.
Test project verifies nothing: tests/fixtures/issue-951-bun-test-discovery tests/fixtures/issue-951-bun-test-discovery/test/unit/example.test.ts:4— No conventional assertion call was detected in 3 of 3 tests in `tests/fixtures/issue-951-bun-test-discovery` — the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail.
Test project verifies nothing: tests/fixtures/playwright-pom-fixtures tests/fixtures/playwright-pom-fixtures/tests/example.spec.ts:3— No conventional assertion call was detected in 1 of 1 tests in `tests/fixtures/playwright-pom-fixtures` — the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail.
Test project verifies nothing: tests/fixtures/playwright-pom-fixtures-nested tests/fixtures/playwright-pom-fixtures-nested/tests/chained.spec.ts:3— No conventional assertion call was detected in 2 of 2 tests in `tests/fixtures/playwright-pom-fixtures-nested` — the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail.
Test project verifies nothing: tests/fixtures/playwright-test-subpath-import tests/fixtures/playwright-test-subpath-import/tests/example.test.ts:4— No conventional assertion call was detected in 1 of 1 tests in `tests/fixtures/playwright-test-subpath-import` — the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail.
Test project verifies nothing: tests/fixtures/render-fan-in tests/fixtures/render-fan-in/src/__tests__/Button.test.tsx:20— No conventional assertion call was detected in 1 of 1 tests in `tests/fixtures/render-fan-in` — the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail.
Test project verifies nothing: tests/fixtures/vitest-include-entry-exports-workspace/packages/web/charts tests/fixtures/vitest-include-entry-exports-workspace/packages/web/charts/src/placeholder.test.ts:3— No conventional assertion call was detected in 1 of 1 tests in `tests/fixtures/vitest-include-entry-exports-workspace/packages/web/charts` — the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail.
TooManyMethods: ModuleInfoExtractor crates/extract/src/visitor/mod.rs:620— TooManyMethods — 718 methods, declared across 33 files: visitor/visit_impl.rs (123), visitor/mod.rs (94), visitor/visit_impl_object_bindings.rs (65), visitor/visit_impl_scope_bindings.rs (38), +29 more file(s). The bar is 30 methods; this is 688 over it, 23.93× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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.
TooManyMethods: ModuleGraph crates/graph/src/graph/mod.rs:162— TooManyMethods — 95 methods, declared across 14 files: graph/mod.rs (31), re_exports/mod.rs (13), graph/public_exports.rs (9), graph/ambiguity.rs (7), +10 more file(s). The bar is 30 methods; this is 65 over it, 3.17× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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.
TooManyMethods: DeadCodeKeyCollector crates/api/src/audit_keys.rs:782— TooManyMethods — 65 methods. The bar is 30 methods; this is 35 over it, 2.17× 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.
TooManyMethods: AnalysisSession crates/engine/src/session.rs:41— TooManyMethods — 57 methods. The bar is 30 methods; this is 27 over it, 1.90× 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.
TooManyMethods: FallowMcp crates/mcp/src/server/mod.rs:40— TooManyMethods — 44 methods. The bar is 30 methods; this is 14 over it, 1.47× 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.
TooManyMethods: ContractCollector crates/extract/src/component_contracts/mod.rs:71— TooManyMethods — 40 methods, declared across 2 files: component_contracts/mod.rs (29), component_contracts/classes.rs (11). The bar is 30 methods; this is 10 over it, 1.33× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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.
TooManyMethods: AnalysisResults crates/types/src/results.rs:246— TooManyMethods — 38 methods, declared across 2 files: src/results.rs (35), src/results_component_health.rs (3). The bar is 30 methods; this is 8 over it, 1.27× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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.
TooManyMethods: SemanticFactView crates/types/src/extract.rs:2529— TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.07× 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.
Duplicated block (17 lines × 2) crates/config/src/workspace/npm_overrides.rs:354— crates/config/src/workspace/npm_overrides.rs:354-370 | crates/config/src/workspace/pnpm_overrides.rs:359-375 — 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 (17 lines × 2) crates/core/src/analyze/members/fluent_chain.rs:69— crates/core/src/analyze/members/fluent_chain.rs:69-85 | crates/core/src/analyze/members/fluent_chain.rs:130-146 — 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 (17 lines × 2) crates/core/src/analyze/members/mod.rs:704— crates/core/src/analyze/members/mod.rs:704-720 | crates/core/src/analyze/members/mod.rs:1155-1171 — 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 (17 lines × 2) crates/engine/src/health/css_analytics/near_duplicates.rs:121— crates/engine/src/health/css_analytics/near_duplicates.rs:121-137 | crates/engine/src/health/css_analytics/near_duplicates.rs:188-204 — 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 (17 lines × 2) crates/extract/src/template_complexity/engine.rs:569— crates/extract/src/template_complexity/engine.rs:569-585 | crates/extract/src/template_complexity/engine.rs:689-705 — 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 (17 lines × 2) crates/graph/src/graph/re_exports/propagate.rs:775— crates/graph/src/graph/re_exports/propagate.rs:775-791 | crates/graph/src/graph/re_exports/propagate.rs:848-864 — 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 (17 lines × 2) crates/mcp/src/tools/mod.rs:564— crates/mcp/src/tools/mod.rs:564-580 | crates/mcp/src/tools/mod.rs:586-602 — 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 (17 lines × 2) crates/types/src/output_dead_code.rs:1083— crates/types/src/output_dead_code.rs:1083-1099 | crates/types/src/output_dead_code.rs:1161-1177 — 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 (14 lines × 2) crates/api/src/markdown_output.rs:24— crates/api/src/markdown_output.rs:24-37 | crates/cli/src/report/human/health.rs:1175-1188 — before extracting anything, compare `crates/api/src/markdown_output.rs` and `crates/cli/src/report/human/health.rs` as WHOLE FILES: this scan already matched 4 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (14 lines × 2) crates/cli/src/check/mod.rs:1641— crates/cli/src/check/mod.rs:1641-1654 | crates/cli/src/dispatch.rs:2475-2488 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (14 lines × 2) crates/cli/src/dispatch.rs:1024— crates/cli/src/dispatch.rs:1024-1037 | crates/cli/src/dispatch.rs:1055-1068 — 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 (14 lines × 2) crates/core/src/discover/mod.rs:50— crates/core/src/discover/mod.rs:50-63 | crates/engine/src/discover.rs:423-436 — before extracting anything, compare `crates/core/src/discover/mod.rs` and `crates/engine/src/discover.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (14 lines × 2) crates/extract/src/cache/conversion.rs:543— crates/extract/src/cache/conversion.rs:543-556 | crates/extract/src/cache/conversion.rs:681-694 — 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 (14 lines × 2) crates/cli/src/report/human/check.rs:1524— crates/cli/src/report/human/check.rs:1524-1537 | crates/cli/src/report/human/check.rs:1572-1585 — 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 (14 lines × 2) crates/core/src/plugins/registry/helpers.rs:650— crates/core/src/plugins/registry/helpers.rs:650-663 | crates/core/src/plugins/registry/helpers.rs:665-678 — 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 (14 lines × 2) crates/cli/src/report/github_summary.rs:3271— crates/cli/src/report/github_summary.rs:3271-3284 | crates/cli/src/report/github_summary.rs:3348-3361 — 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 (11 lines × 2 locations) editors/vscode/src/commands.ts:1195— editors/vscode/src/commands.ts:1195 · editors/vscode/src/commands.ts:1275 — 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 (11 lines × 2 locations) editors/vscode/src/download.ts:1000— editors/vscode/src/download.ts:1000 · editors/vscode/src/download.ts:1108 — 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 (11 lines × 2 locations) npm/fallow-similar-code/scripts/run-binary.js:23— npm/fallow-similar-code/scripts/run-binary.js:23 · npm/fallow/scripts/run-binary.js:20 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
Duplicated block (11 lines × 2 locations) scripts/check-crate-boundaries.mjs:118— scripts/check-crate-boundaries.mjs:118 · scripts/check-crate-boundaries.mjs:130 — 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 (11 lines × 2 locations) scripts/ci-metrics.mjs:225— scripts/ci-metrics.mjs:225 · scripts/scaffold-analyzer-plan.mjs:137 — 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 (11 lines × 2 locations) scripts/coverage-producer-conformance.mjs:523— scripts/coverage-producer-conformance.mjs:523 · scripts/coverage-producer-conformance.mjs:584 — 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 (11 lines × 2 locations) scripts/styling-corpus-smoke.mjs:190— scripts/styling-corpus-smoke.mjs:190 · scripts/styling-pr-smoke.mjs:105 — 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 (11 lines × 2 locations) viz-frontend/src/panel.ts:2528— viz-frontend/src/panel.ts:2528 · viz-frontend/src/panel.ts:2544 — 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.
fallow_api::similar_code::transport::validate_embed_response (cyclomatic 23) crates/api/src/similar_code/transport.rs:294— fallow_api::similar_code::transport::validate_embed_response has cyclomatic complexity 23 (threshold 15). 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.
fallow_api::diff_risk::detect_file (cyclomatic 18) crates/api/src/diff_risk/mod.rs:334— fallow_api::diff_risk::detect_file 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.
fallow_api::runtime::similar_code::review_similar_code (cyclomatic 18) crates/api/src/runtime/similar_code.rs:256— fallow_api::runtime::similar_code::review_similar_code 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.
fallow_api::mutation::report::completion (cyclomatic 16) crates/api/src/mutation/report.rs:271— fallow_api::mutation::report::completion has cyclomatic complexity 16 (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.
fallow_api::mutation::scheduler::read_dry_run (cyclomatic 16) crates/api/src/mutation/scheduler/mod.rs:1094— fallow_api::mutation::scheduler::read_dry_run has cyclomatic complexity 16 (threshold 15). 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.
fallow_api::type_aware::client::validate_response (cyclomatic 16) crates/api/src/type_aware/client/mod.rs:1418— fallow_api::type_aware::client::validate_response has cyclomatic complexity 16 (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. This is NOT this file's highest cyclomatic complexity: fallow_api::type_aware::client::gap_reason_phrase (cyclomatic 21) 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.
fallow_api::type_aware::client::validate_symbol_use_data (cyclomatic 16) crates/api/src/type_aware/client/mod.rs:1639— fallow_api::type_aware::client::validate_symbol_use_data has cyclomatic complexity 16 (threshold 15). 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. This is NOT this file's highest cyclomatic complexity: fallow_api::type_aware::client::gap_reason_phrase (cyclomatic 21) 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.
Duplicated block (8 lines × 3) crates/api/src/dead_code_codeclimate.rs:365— crates/api/src/dead_code_codeclimate.rs:365-372 | crates/api/src/dead_code_codeclimate.rs:399-406 | crates/api/src/dead_code_codeclimate.rs:433-440 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8 lines × 3) crates/core/src/plugins/nuxt.rs:1133— crates/core/src/plugins/nuxt.rs:1133-1140 | crates/core/src/plugins/nuxt.rs:1221-1228 | crates/core/src/plugins/pinia.rs:39-46 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (8 lines × 3) crates/engine/src/health/css_analytics/near_duplicates.rs:132— crates/engine/src/health/css_analytics/near_duplicates.rs:132-139 | crates/engine/src/health/css_analytics/near_duplicates.rs:199-206 | crates/engine/src/health/css_analytics/theme_tokens.rs:252-259 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (8 lines × 3) crates/engine/src/health/threshold_overrides.rs:166— crates/engine/src/health/threshold_overrides.rs:166-173 | crates/engine/src/health/threshold_overrides.rs:211-218 | crates/engine/src/health/threshold_overrides.rs:232-239 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8 lines × 3) crates/graph/src/resolve/specifier.rs:409— crates/graph/src/resolve/specifier.rs:409-416 | crates/graph/src/resolve/specifier.rs:662-669 | crates/graph/src/resolve/specifier.rs:1198-1205 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8 lines × 3) crates/core/src/discover/walk.rs:281— crates/core/src/discover/walk.rs:281-288 | crates/types/src/cache_rejection.rs:133-140 | crates/types/src/workspace.rs:1136-1143 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (8 lines × 3) crates/extract/src/template_usage.rs:425— crates/extract/src/template_usage.rs:425-432 | crates/extract/src/visitor/visit_impl_security_sinks.rs:426-433 | crates/extract/src/visitor/visit_impl_security_sinks.rs:511-518 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
R4 · Test Coverage· No test reaches this file · ×7
No test reaches this file crates/napi/test.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 REDACTED: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 scripts/generate-vex.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 viz-frontend/build-css.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 assets/demo-project/src/components/Modal.tsx: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 assets/demo-project/src/utils/validate.ts: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 editors/vscode/scripts/copy-license.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.
ContractCollector::collect_declarations (cyclomatic 22) crates/extract/src/component_contracts/mod.rs:251— ContractCollector::collect_declarations 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.
ContractCollector::collect_callers (cyclomatic 21) crates/extract/src/component_contracts/mod.rs:768— ContractCollector::collect_callers 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.
ContractCollector::angular_class_props (cyclomatic 19) crates/extract/src/component_contracts/classes.rs:126— ContractCollector::angular_class_props has cyclomatic complexity 19 (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.
ContractCollector::add_macro_shapes (cyclomatic 19) crates/extract/src/component_contracts/mod.rs:680— ContractCollector::add_macro_shapes 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.
ContractCollector::function_props (cyclomatic 17) crates/extract/src/component_contracts/mod.rs:477— ContractCollector::function_props 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.
ContractCollector::vue_options_props (cyclomatic 16) crates/extract/src/component_contracts/classes.rs:6— ContractCollector::vue_options_props 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.
fallow_config::workspace::pnpm_catalog::parse_key (cognitive 20) crates/config/src/workspace/pnpm_catalog.rs:621— fallow_config::workspace::pnpm_catalog::parse_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 1 (2 pts) (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.
fallow_config::rule_pack::zone_reference_errors (cognitive 18) crates/config/src/rule_pack.rs:328— fallow_config::rule_pack::zone_reference_errors has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts) (nesting depth added 10). 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.
fallow_config::workspace::parsers::walk_workspace_dirs (cognitive 18) crates/config/src/workspace/parsers.rs:455— fallow_config::workspace::parsers::walk_workspace_dirs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 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.
fallow_config::config::boundaries::expand_rules_for_groups (cognitive 17) crates/config/src/config/boundaries.rs:855— fallow_config::config::boundaries::expand_rules_for_groups has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 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.
fallow_config::extglob::rewrite (cognitive 17) crates/config/src/extglob.rs:149— fallow_config::extglob::rewrite has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (6 pts), loops 1 (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.
fallow_config::workspace::npm_overrides::parse_resolution_key (cognitive 16) crates/config/src/workspace/npm_overrides.rs:121— fallow_config::workspace::npm_overrides::parse_resolution_key has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2, loops 1 (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.
Duplicated block (5 lines × 3) crates/cli/src/report/human/check.rs:2555— crates/cli/src/report/human/check.rs:2555-2559 | crates/cli/src/report/human/check.rs:3334-3338 | crates/cli/src/report/human/check.rs:3372-3376 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) crates/lsp/src/diagnostics/structural.rs:463— crates/lsp/src/diagnostics/structural.rs:463-467 | crates/lsp/src/diagnostics/structural.rs:489-493 | crates/lsp/src/diagnostics/structural.rs:515-519 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) crates/lsp/src/diagnostics/structural.rs:484— crates/lsp/src/diagnostics/structural.rs:484-488 | crates/lsp/src/diagnostics/structural.rs:510-514 | crates/lsp/src/diagnostics/structural.rs:545-549 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) crates/lsp/src/diagnostics/unused.rs:337— crates/lsp/src/diagnostics/unused.rs:337-341 | crates/lsp/src/diagnostics/unused.rs:361-365 | crates/lsp/src/diagnostics/unused.rs:385-389 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) crates/cli/src/regression/baseline.rs:780— crates/cli/src/regression/baseline.rs:780-784 | crates/engine/src/clock.rs:235-239 | crates/engine/src/vital_signs.rs:707-711 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (5 lines × 3) crates/extract/src/template_usage.rs:352— crates/extract/src/template_usage.rs:352-356 | crates/extract/src/visitor/visit_impl.rs:6044-6048 | crates/extract/src/visitor/visit_impl_security_sinks.rs:317-321 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Off the main sequence: fallow-license — fallow-license: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: fallow-mutation — fallow-mutation: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: fallow-process — fallow-process: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
Off the main sequence: fallow-v8-coverage — fallow-v8-coverage: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: fallow-types — fallow-types: abstractness 0.01, instability 0.00, distance 0.99 — zone of pain — concrete and depended on by 11 project(s), so it's rigid to change.
Off the main sequence: fallow-config — fallow-config: abstractness 0.01, instability 0.11, distance 0.88 — zone of pain — concrete and depended on by 8 project(s), so it's rigid to change.
fallow_engine::dead_code::apply_base_collection_rules (cyclomatic 19) crates/engine/src/dead_code.rs:850— fallow_engine::dead_code::apply_base_collection_rules 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.
fallow_engine::discover::advance_past_package_manager (cyclomatic 19) crates/engine/src/discover.rs:679— fallow_engine::discover::advance_past_package_manager has cyclomatic complexity 19 (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.
fallow_engine::health::coverage_v8::convert_file (cyclomatic 19) crates/engine/src/health/coverage_v8/mod.rs:242— fallow_engine::health::coverage_v8::convert_file has cyclomatic complexity 19 (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.
fallow_engine::health::css_analytics::classes::css_class_inventory (cyclomatic 18) crates/engine/src/health/css_analytics/classes.rs:534— fallow_engine::health::css_analytics::classes::css_class_inventory 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.
fallow_engine::health::result::classify_dead_style_export (cyclomatic 18) crates/engine/src/health/result.rs:1016— fallow_engine::health::result::classify_dead_style_export has cyclomatic complexity 18 (threshold 15). 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.
Change-coupling hub: types.rs → html.rs, parse.rs, sfc.rs, angular.rs, vue.rs, template_usage.rs, declarations.rs, helpers.rs, mod.rs, visit_impl.rs, visit_impl_helpers.rs crates/extract/src/cache/types.rs— `crates/extract/src/cache/types.rs` changes together with 11 other files — `crates/extract/src/html.rs`, `crates/extract/src/parse.rs`, `crates/extract/src/sfc.rs`, `crates/extract/src/sfc_template/angular.rs`, `crates/extract/src/sfc_template/vue.rs`, `crates/extract/src/template_usage.rs`, `crates/extract/src/visitor/declarations.rs`, `crates/extract/src/visitor/helpers.rs`, `crates/extract/src/visitor/mod.rs`, `crates/extract/src/visitor/visit_impl.rs`, `crates/extract/src/visitor/visit_impl_helpers.rs` — none of which declares a dependency on it: one file is the hub of 11 separate couplings, not 11 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 11.
Change-coupling hub: health.rs → compact.rs, markdown.rs, sarif.rs, assembly.rs, grouping.rs, targets.rs crates/cli/src/report/human/health.rs— `crates/cli/src/report/human/health.rs` changes together with 6 other files — `crates/cli/src/report/compact.rs`, `crates/cli/src/report/markdown.rs`, `crates/cli/src/report/sarif.rs`, `crates/engine/src/health/assembly.rs`, `crates/engine/src/health/grouping.rs`, `crates/engine/src/health/targets.rs` — none of which declares a dependency on it: one file is the hub of 6 separate couplings, not 6 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 6.
Change-coupling hub: commands.ts → client.ts, statusBar.ts, treeView.ts editors/vscode/src/commands.ts— `editors/vscode/src/commands.ts` changes together with 3 other files — `editors/vscode/src/client.ts`, `editors/vscode/src/statusBar.ts`, `editors/vscode/src/treeView.ts` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 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 3.
Change-coupling hub: mod.rs → compact.rs, markdown.rs, sarif.rs, grouping.rs, health_css.rs crates/cli/src/health/mod.rs— `crates/cli/src/health/mod.rs` changes together with 5 other files — `crates/cli/src/report/compact.rs`, `crates/cli/src/report/markdown.rs`, `crates/cli/src/report/sarif.rs`, `crates/engine/src/health/grouping.rs`, `crates/output/src/health_css.rs` — none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 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 5.
Change-coupling hub: compact.rs → markdown.rs, sarif.rs, health_runtime_coverage.rs crates/cli/src/report/compact.rs— `crates/cli/src/report/compact.rs` changes together with 3 other files — `crates/cli/src/report/markdown.rs`, `crates/cli/src/report/sarif.rs`, `crates/output/src/health_runtime_coverage.rs` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 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 3.
Duplicated block (22 lines × 2) crates/cli/src/fix/catalog.rs:215— crates/cli/src/fix/catalog.rs:215-236 | crates/cli/src/fix/catalog.rs:645-666 — 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 (22 lines × 2) crates/core/src/analyze/mod.rs:350— crates/core/src/analyze/mod.rs:350-371 | crates/engine/src/public_api.rs:29-50 — before extracting anything, compare `crates/core/src/analyze/mod.rs` and `crates/engine/src/public_api.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (22 lines × 2) crates/extract/src/cache/conversion.rs:570— crates/extract/src/cache/conversion.rs:570-591 | crates/extract/src/cache/conversion.rs:705-726 — 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 (22 lines × 2) crates/extract/src/sfc_template/shared.rs:361— crates/extract/src/sfc_template/shared.rs:361-382 | crates/extract/src/sfc_template/shared.rs:395-416 — 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 (22 lines × 2) crates/mcp/src/tools/semantic.rs:18— crates/mcp/src/tools/semantic.rs:18-39 | crates/mcp/src/tools/semantic.rs:93-114 — 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 (20 lines × 2) crates/api/src/type_aware/client/mod.rs:2121— crates/api/src/type_aware/client/mod.rs:2121-2140 | crates/api/src/type_aware/client/mod.rs:2143-2162 — 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 (20 lines × 2) crates/core/src/scripts/shell.rs:170— crates/core/src/scripts/shell.rs:170-189 | crates/engine/src/discover.rs:590-609 — before extracting anything, compare `crates/core/src/scripts/shell.rs` and `crates/engine/src/discover.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (20 lines × 2) crates/extract/src/template_complexity/engine.rs:634— crates/extract/src/template_complexity/engine.rs:634-653 | crates/extract/src/template_complexity/engine.rs:740-759 — 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 (20 lines × 2) crates/graph/src/graph/re_exports/propagate.rs:794— crates/graph/src/graph/re_exports/propagate.rs:794-813 | crates/graph/src/graph/re_exports/propagate.rs:867-886 — 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 (20 lines × 2) crates/cli/src/dispatch.rs:1085— crates/cli/src/dispatch.rs:1085-1104 | crates/cli/src/dispatch.rs:1307-1326 — 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 (13 lines × 3) crates/cli/src/health/coverage.rs:919— crates/cli/src/health/coverage.rs:919-931 | crates/engine/src/health/component_rollup.rs:106-118 | crates/engine/src/health/findings.rs:561-573 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (13 lines × 3) crates/cli/src/regression/counts.rs:139— crates/cli/src/regression/counts.rs:139-151 | crates/lsp/src/protocol.rs:153-165 | crates/output/src/check.rs:1261-1273 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (13 lines × 3) crates/cli/src/trace_chain.rs:76— crates/cli/src/trace_chain.rs:76-88 | crates/cli/src/trace_error.rs:57-69 | crates/cli/src/trace_path.rs:49-61 — before extracting anything, compare `crates/cli/src/trace_chain.rs` and `crates/cli/src/trace_path.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 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 (13 lines × 3) crates/core/src/plugins/contentlayer.rs:70— crates/core/src/plugins/contentlayer.rs:70-82 | crates/core/src/plugins/fumadocs.rs:63-75 | crates/core/src/plugins/velite.rs:66-78 — 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 (13 lines × 3) crates/engine/src/health/css_analytics/cva.rs:219— crates/engine/src/health/css_analytics/cva.rs:219-231 | crates/engine/src/health/css_analytics/markup_scan.rs:204-216 | crates/engine/src/health/css_analytics/mod.rs:690-702 — 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 (11 lines × 3) crates/core/src/analyze/unused_component_emit.rs:48— crates/core/src/analyze/unused_component_emit.rs:48-58 | crates/core/src/analyze/unused_component_input.rs:57-67 | crates/core/src/analyze/unused_component_output.rs:54-64 — before extracting anything, compare `crates/core/src/analyze/unused_component_input.rs` and `crates/core/src/analyze/unused_component_output.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 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 (11 lines × 3) crates/core/src/plugins/docusaurus.rs:304— crates/core/src/plugins/docusaurus.rs:304-314 | crates/core/src/plugins/docusaurus.rs:345-355 | crates/core/src/plugins/docusaurus.rs:375-385 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 3) crates/extract/src/css_in_js/tokens.rs:3349— crates/extract/src/css_in_js/tokens.rs:3349-3359 | crates/extract/src/visitor/visit_impl_factory_returns.rs:473-483 | crates/extract/src/visitor/visit_impl_security_classifiers.rs:549-559 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (11 lines × 3) crates/types/src/workspace.rs:920— crates/types/src/workspace.rs:920-930 | crates/types/src/workspace.rs:985-995 | crates/types/src/workspace.rs:1120-1130 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 3) crates/engine/src/health/result.rs:652— crates/engine/src/health/result.rs:652-662 | crates/engine/src/health/result.rs:775-785 | crates/engine/src/health/result.rs:808-818 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6 lines × 3) crates/core/src/plugins/config_parser.rs:1930— crates/core/src/plugins/config_parser.rs:1930-1935 | crates/core/src/plugins/react_router.rs:419-424 | crates/extract/src/visitor/visit_impl_security_sinks.rs:310-315 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (6 lines × 3) crates/extract/src/template_complexity/engine.rs:573— crates/extract/src/template_complexity/engine.rs:573-578 | crates/extract/src/template_complexity/engine.rs:693-698 | crates/extract/src/template_complexity/svelte.rs:477-482 — before extracting anything, compare `crates/extract/src/template_complexity/engine.rs` and `crates/extract/src/template_complexity/svelte.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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 (6 lines × 3) crates/types/src/results.rs:1630— crates/types/src/results.rs:1630-1635 | crates/types/src/results.rs:1638-1643 | crates/types/src/results.rs:1646-1651 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6 lines × 3) crates/types/src/results.rs:1919— crates/types/src/results.rs:1919-1924 | crates/types/src/results.rs:1927-1932 | crates/types/src/results.rs:1935-1940 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6 lines × 3) crates/config/src/workspace/deno_json.rs:258— crates/config/src/workspace/deno_json.rs:258-263 | crates/engine/src/health/targets.rs:370-375 | crates/engine/src/viz.rs:2098-2103 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (12 lines × 2 locations) editors/vscode/src/commands.ts:204— editors/vscode/src/commands.ts:204 · editors/vscode/src/commands.ts:217 — 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 (12 lines × 2 locations) editors/vscode/src/extension.ts:387— editors/vscode/src/extension.ts:387 · editors/vscode/src/extension.ts:399 — 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 (12 lines × 2 locations) editors/vscode/src/health-utils.ts:138— editors/vscode/src/health-utils.ts:138 · editors/vscode/src/health-utils.ts:158 — 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 (12 lines × 2 locations) scripts/generate-agent-adapters.mjs:182— scripts/generate-agent-adapters.mjs:182 · scripts/generate-agent-adapters.mjs:259 — 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 (12 lines × 2 locations) scripts/ship-git.mjs:850— scripts/ship-git.mjs:850 · scripts/ship-wait-checks.mjs:1350 — 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.
AC6 · Visual & motion safety· Focus outline removed in CSS without a · ×4
Focus outline removed in CSS without a :focus replacement viz-frontend/src/styles.css:965— `#canvas:focus-visible` 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.
Focus outline removed in CSS without a :focus replacement viz-frontend/src/styles.css:1927— `#panel .rank-table td.col-file button:focus-visible` 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.
Focus outline removed in CSS without a :focus replacement crates/cli/viz-assets/viz.css:1008— `#canvas:focus-visible` 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.
Focus outline removed in CSS without a :focus replacement crates/cli/viz-assets/viz.css:1970— `#panel .rank-table td.col-file button:focus-visible` 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.
ModuleGraph::collect_coordination_gaps (cognitive 21) crates/graph/src/graph/impact_closure.rs:136— ModuleGraph::collect_coordination_gaps has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (8 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.
ModuleGraph::effective_re_export_routes (cognitive 18) crates/graph/src/graph/effective_re_exports.rs:44— ModuleGraph::effective_re_export_routes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 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.
ModuleGraph::collect_exposed_namespace_targets (cognitive 17) crates/graph/src/graph/re_exports/mod.rs:730— ModuleGraph::collect_exposed_namespace_targets has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts) (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.
ModuleGraph::star_contributor_bindings (cognitive 16) crates/graph/src/graph/ambiguity.rs:180— ModuleGraph::star_contributor_bindings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (3 pts), match/switch 1 (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.
Duplicated block (19 lines × 2) crates/core/src/analyze/policy/mod.rs:553— crates/core/src/analyze/policy/mod.rs:553-571 | crates/core/src/analyze/policy/mod.rs:596-614 — 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 (19 lines × 2) crates/core/src/scripts/shell.rs:322— crates/core/src/scripts/shell.rs:322-340 | crates/engine/src/discover.rs:624-642 — before extracting anything, compare `crates/core/src/scripts/shell.rs` and `crates/engine/src/discover.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (19 lines × 2) crates/extract/src/css_in_js/tokens.rs:393— crates/extract/src/css_in_js/tokens.rs:393-411 | crates/extract/src/css_in_js/tokens.rs:2942-2960 — 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 (19 lines × 2) crates/mcp/src/tools/dupes.rs:174— crates/mcp/src/tools/dupes.rs:174-192 | crates/mcp/src/tools/trace.rs:378-396 — 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–10 lines × 2) crates/extract/src/astro/mod.rs:608— crates/extract/src/astro/mod.rs:608-615 | crates/extract/src/sfc.rs:2192-2201 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8–10 lines × 2) crates/extract/src/complexity.rs:680— crates/extract/src/complexity.rs:680-687 | crates/extract/src/complexity.rs:705-714 — 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–10 lines × 2) crates/extract/src/template_complexity/engine.rs:819— crates/extract/src/template_complexity/engine.rs:819-828 | crates/extract/src/template_complexity/engine.rs:888-895 — 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–10 lines × 2) crates/mcp/src/tools/check_runtime_coverage.rs:94— crates/mcp/src/tools/check_runtime_coverage.rs:94-103 | crates/mcp/src/tools/flags.rs:66-73 — 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 (10 lines × 2 locations) crates/napi/test.mjs:261— crates/napi/test.mjs:261 · crates/napi/test.mjs:302 — 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 (10 lines × 2 locations) editors/vscode/src/commands.ts:881— editors/vscode/src/commands.ts:881 · editors/vscode/src/coverageCommand.ts:47 — 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 (10 lines × 2 locations) editors/vscode/src/license.ts:378— editors/vscode/src/license.ts:378 · editors/vscode/src/license.ts:393 — 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 (10 lines × 2 locations) npm/fallow/scripts/verify-binary.js:462— npm/fallow/scripts/verify-binary.js:462 · npm/fallow/scripts/verify-binary.js:613 — 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.
BatchedBindingCollector::build_root_reference_spans (cognitive 29) crates/extract/src/css_in_js/tokens.rs:345— BatchedBindingCollector::build_root_reference_spans has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 5 (11 pts) (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.
BatchedBindingCollector::build_static_value_map (cognitive 22) crates/extract/src/css_in_js/tokens.rs:392— BatchedBindingCollector::build_static_value_map has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (5 pts), loops 2 (3 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.
BatchedBindingCollector::build_import_map (cognitive 17) crates/extract/src/css_in_js/tokens.rs:281— BatchedBindingCollector::build_import_map has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (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.
Duplicated block (25 lines × 2) crates/api/src/lib.rs:1319— crates/api/src/lib.rs:1319-1343 | crates/engine/src/health/mod.rs:727-751 — before extracting anything, compare `crates/api/src/lib.rs` and `crates/engine/src/health/mod.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (25 lines × 2) crates/core/src/discover/mod.rs:259— crates/core/src/discover/mod.rs:259-283 | crates/engine/src/discover.rs:489-513 — before extracting anything, compare `crates/core/src/discover/mod.rs` and `crates/engine/src/discover.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (25 lines × 2) crates/extract/src/template_complexity/mod.rs:254— crates/extract/src/template_complexity/mod.rs:254-278 | crates/extract/src/template_complexity/vue.rs:154-178 — 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 (15–16 lines × 2) crates/api/src/type_aware/client/mod.rs:940— crates/api/src/type_aware/client/mod.rs:940-955 | crates/api/src/type_aware/client/mod.rs:1309-1323 — 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 (15–16 lines × 2) crates/cli/src/ci_pr_comment_post.rs:83— crates/cli/src/ci_pr_comment_post.rs:83-97 | crates/cli/src/ci_pr_comment_post.rs:145-160 — 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 (15–16 lines × 2) crates/extract/src/template_complexity/engine.rs:627— crates/extract/src/template_complexity/engine.rs:627-642 | crates/extract/src/template_complexity/svelte.rs:668-682 — before extracting anything, compare `crates/extract/src/template_complexity/engine.rs` and `crates/extract/src/template_complexity/svelte.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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 (11–12 lines × 2) crates/api/src/runtime/decision_surface.rs:375— crates/api/src/runtime/decision_surface.rs:375-385 | crates/cli/src/audit.rs:2085-2096 — before extracting anything, compare `crates/api/src/runtime/decision_surface.rs` and `crates/cli/src/audit.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11–12 lines × 2) crates/api/src/similar_code/mod.rs:347— crates/api/src/similar_code/mod.rs:347-357 | crates/api/src/similar_code/transport.rs:311-322 — 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–12 lines × 2) crates/core/src/lib.rs:241— crates/core/src/lib.rs:241-252 | crates/engine/src/session.rs:1572-1582 — before extracting anything, compare `crates/core/src/lib.rs` and `crates/engine/src/session.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 4) crates/cli/src/report/human/check.rs:3264— crates/cli/src/report/human/check.rs:3264-3273 | crates/cli/src/report/human/check.rs:3311-3320 | crates/cli/src/report/human/check.rs:3347-3356 | crates/cli/src/report/human/check.rs:3430-3439 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 4) crates/napi/src/lib.rs:475— crates/napi/src/lib.rs:475-484 | crates/napi/src/lib.rs:508-517 | crates/napi/src/lib.rs:613-622 | crates/napi/src/lib.rs:639-648 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 4) crates/engine/src/health/result.rs:293— crates/engine/src/health/result.rs:293-302 | crates/engine/src/health/result.rs:326-335 | crates/engine/src/health/result.rs:365-374 | crates/engine/src/health/result.rs:452-461 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 3) crates/cli/src/check/mod.rs:1273— crates/cli/src/check/mod.rs:1273-1281 | crates/cli/src/dupes.rs:373-381 | crates/cli/src/health/mod.rs:180-188 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (9 lines × 3) crates/extract/src/visitor/visit_impl.rs:3568— crates/extract/src/visitor/visit_impl.rs:3568-3576 | crates/extract/src/visitor/visit_impl.rs:3581-3589 | crates/extract/src/visitor/visit_impl.rs:6314-6322 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 3) crates/cli/src/rule_pack/list.rs:127— crates/cli/src/rule_pack/list.rs:127-135 | crates/cli/src/rule_pack/test.rs:266-274 | crates/engine/src/guard.rs:295-303 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (7–8 lines × 2) crates/extract/src/component_contracts/mod.rs:983— crates/extract/src/component_contracts/mod.rs:983-990 | crates/extract/src/component_contracts/mod.rs:994-1000 — 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) crates/extract/src/flags.rs:394— crates/extract/src/flags.rs:394-400 | crates/extract/src/flags.rs:812-819 — 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) crates/extract/src/visitor/visit_impl.rs:741— crates/extract/src/visitor/visit_impl.rs:741-748 | crates/extract/src/visitor/visit_impl.rs:3772-3778 — 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) crates/cli/src/report/compact.rs:44— crates/cli/src/report/compact.rs:44-50 | crates/cli/src/report/markdown.rs:56-61 — 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–7 lines × 2) crates/cli/src/report/human/check.rs:3083— crates/cli/src/report/human/check.rs:3083-3088 | crates/cli/src/report/human/mod.rs:606-612 — 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–7 lines × 2) crates/engine/src/health/scoring.rs:1294— crates/engine/src/health/scoring.rs:1294-1299 | crates/engine/src/health/scoring.rs:1375-1381 — 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 (5 lines × 4) crates/core/src/analyze/unused_component_emit.rs:51— crates/core/src/analyze/unused_component_emit.rs:51-55 | crates/core/src/analyze/unused_component_input.rs:60-64 | crates/core/src/analyze/unused_component_output.rs:57-61 | crates/core/src/analyze/unused_svelte_event.rs:53-59 — before extracting anything, compare `crates/core/src/analyze/unused_component_input.rs` and `crates/core/src/analyze/unused_component_output.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 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 × 4) crates/extract/src/template_complexity/engine.rs:381— crates/extract/src/template_complexity/engine.rs:381-385 | crates/extract/src/template_complexity/engine.rs:573-577 | crates/extract/src/template_complexity/engine.rs:693-697 | crates/extract/src/template_complexity/svelte.rs:477-481 — before extracting anything, compare `crates/extract/src/template_complexity/engine.rs` and `crates/extract/src/template_complexity/svelte.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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 × 4) crates/extract/src/visitor/visit_impl.rs:1497— crates/extract/src/visitor/visit_impl.rs:1497-1501 | crates/extract/src/visitor/visit_impl.rs:1578-1582 | crates/extract/src/visitor/visit_impl.rs:1812-1816 | crates/extract/src/visitor/visit_impl.rs:1968-1972 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (16 lines × 2 locations) npm/fallow/scripts/verify-binary.js:479— npm/fallow/scripts/verify-binary.js:479 · npm/fallow/scripts/verify-binary.js:622 — 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 (16 lines × 2 locations) scripts/coverage-producer-conformance.mjs:112— scripts/coverage-producer-conformance.mjs:112 · scripts/semantic-clone-candle-conformance.mjs:47 — 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 (16 lines × 2 locations) scripts/generate-agent-adapters.mjs:204— scripts/generate-agent-adapters.mjs:204 · scripts/generate-agent-adapters.mjs:361 — 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.
R10 · Code Duplication· Duplicated block with local edits (12 matched lines × 2 locations) · ×3
Duplicated block with local edits (12 matched lines × 2 locations) scripts/check-crate-boundaries.mjs:188— scripts/check-crate-boundaries.mjs:188 · scripts/check-miri-cfg.mjs:286 — the two spans are one implementation copied and then locally edited — 77 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (12 matched lines × 2 locations) scripts/check-miri-cfg.mjs:286— scripts/check-miri-cfg.mjs:286 · scripts/check-parse-sites.mjs:130 — the two spans are one implementation copied and then locally edited — 74 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (12 matched lines × 2 locations) viz-frontend/src/graph/build.ts:892— viz-frontend/src/graph/build.ts:892 · viz-frontend/src/graph/interact.ts:209 — the two spans are one implementation copied and then locally edited — 83 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Collector::collect_layer_references (cyclomatic 17) crates/extract/src/effect_facts.rs:452— Collector::collect_layer_references 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.
Collector::visit_binary_expression (cyclomatic 16) crates/mutation/src/collect.rs:1549— Collector::visit_binary_expression 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.
fallow_graph::graph::narrowing::attach_symbol_reference (cyclomatic 16) crates/graph/src/graph/narrowing.rs:754— fallow_graph::graph::narrowing::attach_symbol_reference 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.
fallow_graph::resolve::upgrades::apply_specifier_upgrades (cyclomatic 16) crates/graph/src/resolve/upgrades.rs:56— fallow_graph::resolve::upgrades::apply_specifier_upgrades has cyclomatic complexity 16 (threshold 15). 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.
Collector::collect_layer_references (cognitive 33) crates/extract/src/effect_facts.rs:452— Collector::collect_layer_references has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 4 (5 pts), boolean chains 3 (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.
Collector::visit_binary_expression (cognitive 33) crates/mutation/src/collect.rs:1549— Collector::visit_binary_expression has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (5 pts), boolean chains 4 (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.
ProfileWorklist::run (cognitive 31) crates/graph/src/graph/reachability.rs:246— ProfileWorklist::run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 2 (3 pts), boolean chains 1 (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.
ProfileWorklist::new (cognitive 21) crates/graph/src/graph/reachability.rs:182— ProfileWorklist::new has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (6 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.
IstanbulFileCoverage::new (cognitive 28) crates/engine/src/health/scoring.rs:1144— IstanbulFileCoverage::new has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (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.
IstanbulFileCoverage::lookup (cognitive 18) crates/engine/src/health/scoring.rs:1370— IstanbulFileCoverage::lookup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (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.
TestReachabilityIndex::active_route_profiles (cognitive 28) crates/graph/src/graph/mod.rs:538— TestReachabilityIndex::active_route_profiles has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 2 (3 pts), boolean chains 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.
TestReachabilityIndex::covers_reference_path (cognitive 17) crates/graph/src/graph/mod.rs:450— TestReachabilityIndex::covers_reference_path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 1 (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.
ExposedNameSearch::reaches_exposure (cognitive 27) crates/graph/src/graph/re_exports/mod.rs:433— ExposedNameSearch::reaches_exposure has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (7 pts), boolean chains 3 (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.
ExposedNameSearch::build (cognitive 18) crates/graph/src/graph/re_exports/mod.rs:351— ExposedNameSearch::build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). 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.
fallow_lsp::hover::check_react_prop_intel (cognitive 27) crates/lsp/src/hover.rs:804— fallow_lsp::hover::check_react_prop_intel has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (3 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.
fallow_lsp::diagnostics::structural::push_package_cycle_diagnostics (cognitive 19) crates/lsp/src/diagnostics/structural.rs:226— fallow_lsp::diagnostics::structural::push_package_cycle_diagnostics has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 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.
ObjectStyleCollector::collect_call (cognitive 26) crates/extract/src/css_in_js/object.rs:436— ObjectStyleCollector::collect_call has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (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.
ObjectStyleCollector::build_import_map (cognitive 22) crates/extract/src/css_in_js/object.rs:304— ObjectStyleCollector::build_import_map has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), match/switch 1 (3 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.
NamespacePropagationIndexes::new (cognitive 26) crates/graph/src/graph/namespace_indexes.rs:254— NamespacePropagationIndexes::new has cognitive complexity 26 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 4 (10 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 12). 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.
NamespacePropagationIndexes::enumerate_reachable_barrels_with (cognitive 21) crates/graph/src/graph/namespace_indexes.rs:369— NamespacePropagationIndexes::enumerate_reachable_barrels_with has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 10). 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.
fallow_similar_code_sidecar::protocol::process_request (cognitive 25) tools/similar-code-sidecar/src/protocol.rs:210— fallow_similar_code_sidecar::protocol::process_request has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 3 (5 pts), loops 1 (nesting depth added 6). 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.
fallow_similar_code_sidecar::protocol::read_bounded_line (cognitive 17) tools/similar-code-sidecar/src/protocol.rs:477— fallow_similar_code_sidecar::protocol::read_bounded_line has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 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.
main.init::handleGraphHover (cognitive 23) viz-frontend/src/main.ts:384— main.init::handleGraphHover has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 7 (15 pts), boolean chains 4, if/else 4 (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. This shape REPEATS in the file: one other method here (main.init::selectFile) 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.
main.init::selectFile (cognitive 18) viz-frontend/src/main.ts:272— main.init::selectFile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 1 (4 pts), boolean chains 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. This shape REPEATS in the file: one other method here (main.init::handleGraphHover) 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.
ResolveContext::add_project (cognitive 21) crates/core/src/plugins/rstest.rs:264— ResolveContext::add_project has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (6 pts), boolean chains 2, match/switch 1 (2 pts) (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.
ResolveContext::add_projects (cognitive 20) crates/core/src/plugins/rstest.rs:342— ResolveContext::add_projects has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 3 (7 pts), loops 3 (4 pts) (nesting depth added 11). 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.
Context::credit_imports (cognitive 20) crates/core/src/analyze/effect.rs:209— Context::credit_imports has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2, match/switch 1 (2 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.
Context::collect_aliases (cognitive 16) crates/core/src/analyze/effect.rs:272— Context::collect_aliases has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (6 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.
fallow_mcp::tools::collect_semantic_completeness (cognitive 19) crates/mcp/src/tools/mod.rs:895— fallow_mcp::tools::collect_semantic_completeness has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), boolean chains 2, 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.
fallow_mcp::tools::code_mode_subprocess::run_fallow_sync (cognitive 18) crates/mcp/src/tools/code_mode_subprocess.rs:20— fallow_mcp::tools::code_mode_subprocess::run_fallow_sync has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (6 pts), loops 1 (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.
MethodTooLong: DeadCodeTreeProvider.getChildren editors/vscode/src/treeView.ts:197— MethodTooLong — getChildren runs 372 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 272 over it, 3.72× 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: ModuleInfoExtractor.into_module_info crates/extract/src/visitor/mod.rs:3774— MethodTooLong — into_module_info runs 110 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 10 over it, 1.10× 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.
TooManyFunctions: fallow_extract::visitor::visit_impl_security_classifiers crates/extract/src/visitor/visit_impl_security_classifiers.rs:11— TooManyFunctions — 33 free functions. The bar is 30 free functions; this is 3 over it, 1.10× 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.
TooManyFunctions: fallow_mcp::tools::trace crates/mcp/src/tools/trace.rs:35— TooManyFunctions — 32 free functions. The bar is 30 free functions; this is 2 over it, 1.07× 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 · ×2
Duplicated block (23 lines × 2) crates/core/src/analyze/mod.rs:402— crates/core/src/analyze/mod.rs:402-424 | crates/engine/src/public_api.rs:129-151 — before extracting anything, compare `crates/core/src/analyze/mod.rs` and `crates/engine/src/public_api.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (23 lines × 2) crates/core/src/analyze/unused_load_data_key.rs:485— crates/core/src/analyze/unused_load_data_key.rs:485-507 | crates/extract/src/parse.rs:222-244 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (21 lines × 2) crates/mcp/src/tools/fix.rs:26— crates/mcp/src/tools/fix.rs:26-46 | crates/mcp/src/tools/fix.rs:53-73 — 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 (21 lines × 2) crates/core/src/analyze/security/hardcoded_secret.rs:372— crates/core/src/analyze/security/hardcoded_secret.rs:372-392 | crates/extract/src/visitor/visit_impl_security_classifiers.rs:235-255 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (19–20 lines × 2) crates/api/src/type_aware/mod.rs:81— crates/api/src/type_aware/mod.rs:81-100 | crates/api/src/type_aware/mod.rs:144-162 — 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 (19–20 lines × 2) crates/config/src/workspace/pnpm_catalog.rs:562— crates/config/src/workspace/pnpm_catalog.rs:562-580 | crates/core/src/analyze/unused_catalog/mod.rs:765-784 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (15 lines × 3) crates/core/src/analyze/policy/gdp.rs:304— crates/core/src/analyze/policy/gdp.rs:304-318 | crates/core/src/analyze/policy/mod.rs:553-567 | crates/core/src/analyze/policy/mod.rs:596-610 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (15 lines × 3) crates/core/src/analyze/policy/mod.rs:518— crates/core/src/analyze/policy/mod.rs:518-532 | crates/core/src/analyze/policy/mod.rs:559-573 | crates/core/src/analyze/policy/mod.rs:602-616 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (12 lines × 3) crates/output/src/dead_code_sarif.rs:292— crates/output/src/dead_code_sarif.rs:292-303 | crates/output/src/dead_code_sarif.rs:316-327 | crates/output/src/dead_code_sarif.rs:340-351 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (12 lines × 3) crates/types/src/workspace.rs:897— crates/types/src/workspace.rs:897-908 | crates/types/src/workspace.rs:1038-1049 | crates/types/src/workspace.rs:1099-1110 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 3) crates/cli/src/report/ci/pr_comment.rs:436— crates/cli/src/report/ci/pr_comment.rs:436-445 | crates/cli/src/report/ci/pr_comment.rs:452-461 | crates/cli/src/report/ci/pr_comment.rs:468-477 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 3) crates/types/src/workspace.rs:908— crates/types/src/workspace.rs:908-917 | crates/types/src/workspace.rs:973-982 | crates/types/src/workspace.rs:1110-1119 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8–9 lines × 2) crates/cli/src/health/coverage.rs:861— crates/cli/src/health/coverage.rs:861-869 | crates/cli/src/health/coverage.rs:2316-2323 — 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–9 lines × 2) crates/engine/src/viz.rs:1313— crates/engine/src/viz.rs:1313-1320 | crates/engine/src/viz.rs:1445-1453 — 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 lines × 4) crates/core/src/analyze/members/factory.rs:25— crates/core/src/analyze/members/factory.rs:25-31 | crates/core/src/analyze/members/fluent_chain.rs:54-63 | crates/core/src/analyze/members/fluent_chain.rs:115-124 | crates/core/src/analyze/members/typed_property.rs:22-34 — there are 4 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (7 lines × 4) crates/core/src/plugins/ember.rs:276— crates/core/src/plugins/ember.rs:276-282 | crates/core/src/plugins/lexical.rs:50-56 | crates/core/src/plugins/lit.rs:67-73 | crates/core/src/plugins/obsidian.rs:85-91 — 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 4 call sites, so a change lands once.
Low cohesion: TraceProvenance (LCOM4 5) crates/types/src/trace.rs:273— TraceProvenance's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: Collector (LCOM4 4) crates/mutation/src/collect.rs:135— Collector's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
R10 · Code Duplication· Duplicated block with local edits (17 matched lines × 2 locations) · ×2
Duplicated block with local edits (17 matched lines × 2 locations) REDACTED:46— REDACTED:46 · REDACTED:123 — the two spans are one implementation copied and then locally edited — 95 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (17 matched lines × 2 locations) viz-frontend/src/graph/interact.ts:257— viz-frontend/src/graph/interact.ts:257 · viz-frontend/src/graph/interact.ts:331 — the two spans are one implementation copied and then locally edited — 168 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Boundary violation [package:relative-cross-package] scripts/vscode-public-verify.mjs:21— scripts/vscode-public-verify.mjs:21 reaches into another package with a relative path (../editors/vscode/scripts/vsix-targets.mjs) — import the package by name instead.
Boundary violation [package:relative-cross-package] viz-frontend/build-css.mjs:33— viz-frontend/build-css.mjs:33 reaches into another package with a relative path (../crates/cli/viz-assets/viz.css) — import the package by name instead.
Complex function (anonymous) (cyclomatic 22, cognitive 26) editors/vscode/src/extension.ts:1101— (anonymous) has cyclomatic complexity 22 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 22, cognitive 26) viz-frontend/src/graph/interact.ts:328— (anonymous) has cyclomatic complexity 22 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
AC7 · A11y enforcement· Accessibility enforcement below the top rung · ×1
Accessibility enforcement below the top rung — No accessibility enforcement found — your oxlint config does not list the `jsx-a11y` plugin (its a11y rules are off until it does) and there's no axe/pa11y/Lighthouse in tests or CI. Start by enabling that plugin to catch issues at author time. What was searched, so you can tell an absence from a miss: the 4 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.
extension.activate (cyclomatic 85) editors/vscode/src/extension.ts:169— extension.activate has cyclomatic complexity 85 (threshold 15). Most of this is not in the body itself: 8 of the 85 points are its own statements and the rest belongs to 36 function items inside it that branch (a function literal at line 1101, a function literal at line 372, a function literal at line 939, …). 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.
fallow_types::workspace::render_message (cyclomatic 65) crates/types/src/workspace.rs:1542— fallow_types::workspace::render_message has cyclomatic complexity 65 (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.
annotations.drawClusterLabels (cyclomatic 61) viz-frontend/src/graph/annotations.ts:606— annotations.drawClusterLabels has cyclomatic complexity 61 (threshold 15). Of this number, 54 points are the body's own statements and 7 belong to 3 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.
DeadCodeAuditLedger::annotate_results (cyclomatic 51) crates/api/src/audit_keys.rs:146— DeadCodeAuditLedger::annotate_results has cyclomatic complexity 51 (threshold 15). 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.
DeadCodeTreeProvider.getChildren (cyclomatic 43) editors/vscode/src/treeView.ts:197— DeadCodeTreeProvider.getChildren has cyclomatic complexity 43 (threshold 15). Of this number, 38 points are the body's own statements and 5 belong to 5 function items inside it that branch. 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.
chrome.buildChrome (cyclomatic 36) REDACTED:139— chrome.buildChrome has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 8 of the 36 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 275, a function literal at line 307, refreshLensOverflow, …). 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.
panel.rankRowsForLens (cyclomatic 36) viz-frontend/src/panel.ts:1652— panel.rankRowsForLens has cyclomatic complexity 36 (threshold 15). Of this number, 20 points are the body's own statements and 16 belong to 6 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.
coverage-producer-refresh.main (cyclomatic 35) scripts/coverage-producer-refresh.mjs:175— coverage-producer-refresh.main has cyclomatic complexity 35 (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.
panel.renderLensPanel (cyclomatic 35) viz-frontend/src/panel.ts:2351— panel.renderLensPanel has cyclomatic complexity 35 (threshold 15). Of this number, 28 points are the body's own statements and 7 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.
render.drawNodes (cyclomatic 34) viz-frontend/src/graph/render.ts:462— render.drawNodes has cyclomatic complexity 34 (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.
check-miri-cfg.scanFile (cyclomatic 32) scripts/check-miri-cfg.mjs:104— check-miri-cfg.scanFile has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 1 of the 32 points is its own statement and the rest belongs to 3 function items inside it that branch (a function literal at line 124, insideGated, a function literal at line 108). 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.
panel.securityCandidateEl (cyclomatic 32) viz-frontend/src/panel.ts:349— panel.securityCandidateEl has cyclomatic complexity 32 (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.
StatementBoundary::push (cyclomatic 31) crates/extract/src/mdx.rs:253— StatementBoundary::push has cyclomatic complexity 31 (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.
vsix-inventory.validateEntry (cyclomatic 29) editors/vscode/scripts/vsix-inventory.mjs:24— vsix-inventory.validateEntry has cyclomatic complexity 29 (threshold 15). 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.
ship-wait-checks.supersededCancellations (cyclomatic 29) scripts/ship-wait-checks.mjs:524— ship-wait-checks.supersededCancellations 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.
chrome.updateChrome (cyclomatic 29) REDACTED:540— chrome.updateChrome 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.
TsconfigOutputMap::resolve_source_for_entry (cyclomatic 27) crates/config/src/workspace/tsconfig.rs:92— TsconfigOutputMap::resolve_source_for_entry has cyclomatic complexity 27 (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.
download.downloadBinary (cyclomatic 27) editors/vscode/src/download.ts:1107— download.downloadBinary has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 2 of the 27 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1122, 1136). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
fallow_mutation::logging_only::is_pure (cyclomatic 26) crates/mutation/src/logging_only.rs:137— fallow_mutation::logging_only::is_pure has cyclomatic complexity 26 (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.
ego.buildColumn (cyclomatic 25) viz-frontend/src/graph/ego.ts:93— ego.buildColumn has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 12 of the 25 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 142, a function literal at line 128, isViolation, …). 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.
TemplateComplexity::scan_expression_without_ternary (cyclomatic 24) crates/extract/src/template_complexity/engine.rs:366— TemplateComplexity::scan_expression_without_ternary has cyclomatic complexity 24 (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.
semantic-clone-conformance.validateFallowReport (cyclomatic 24) scripts/semantic-clone-conformance.mjs:226— semantic-clone-conformance.validateFallowReport 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.
render.drawRoads (cyclomatic 24) viz-frontend/src/graph/render.ts:226— render.drawRoads 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.
build.directoryCluster (cyclomatic 23) viz-frontend/src/graph/build.ts:79— build.directoryCluster has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 5 function items inside it that branch (split, emit, a function literal at line 122, …). 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.
treemap.renderTreemap (cyclomatic 23) viz-frontend/src/treemap.ts:428— treemap.renderTreemap has cyclomatic complexity 23 (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.
select-miri-runner.parseAllocation (cyclomatic 22) REDACTED:15— select-miri-runner.parseAllocation has cyclomatic complexity 22 (threshold 15). 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.
semantic-clone-conformance.loadCandidateEvidence (cyclomatic 22) scripts/semantic-clone-conformance.mjs:55— semantic-clone-conformance.loadCandidateEvidence has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 56, 105). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
ship-wait-checks.currentRollupChecks (cyclomatic 22) scripts/ship-wait-checks.mjs:603— ship-wait-checks.currentRollupChecks 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.
sync-emitted-versions.scanJsonExample (cyclomatic 22) scripts/sync-emitted-versions.mjs:84— sync-emitted-versions.scanJsonExample has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body's own statements and 1 belongs to one function item 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.
build.louvainCluster (cyclomatic 22) viz-frontend/src/graph/build.ts:141— build.louvainCluster has cyclomatic complexity 22 (threshold 15). Of this number, 11 points are the body's own statements and 11 belong to 6 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.
interact.graphHoverTarget (cyclomatic 22) viz-frontend/src/graph/interact.ts:252— interact.graphHoverTarget has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body's own statements and 3 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.
interact.graphHandleClick (cyclomatic 22) viz-frontend/src/graph/interact.ts:328— interact.graphHandleClick 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.
treemap.renderFileCell (cyclomatic 22) viz-frontend/src/treemap.ts:750— treemap.renderFileCell has cyclomatic complexity 22 (threshold 15). 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.
panel.complexitySection (cyclomatic 22) viz-frontend/src/panel.ts:488— panel.complexitySection 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.
public-config-corpus.strip_jsonc_comments (cyclomatic 21) scripts/public-config-corpus.py:567— public-config-corpus.strip_jsonc_comments 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.
semantic-clone-candle-conformance.validateBaselineShape (cyclomatic 21) scripts/semantic-clone-candle-conformance.mjs:226— semantic-clone-candle-conformance.validateBaselineShape has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
backend.withLinearSnapshots (cyclomatic 21) tools/type-aware-sidecar/src/backend.mjs:71— backend.withLinearSnapshots has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 6 function items inside it that branch (handle, updateSnapshot, disposeWhenUnused, …). 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.
Worker::attempt (cyclomatic 20) crates/api/src/mutation/scheduler/mod.rs:666— Worker::attempt has cyclomatic complexity 20 (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.
IssueFilters::apply_component_filters (cyclomatic 20) crates/cli/src/check/mod.rs:288— IssueFilters::apply_component_filters has cyclomatic complexity 20 (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. This is NOT this file's highest cyclomatic complexity: IssueFilters::enable_cli_filter_flag (cyclomatic 37) 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.
CommandCollector::collect_segment (cyclomatic 20) crates/core/src/plugins/mise.rs:325— CommandCollector::collect_segment has cyclomatic complexity 20 (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.
check-miri-cfg.stripLiterals (cyclomatic 20) scripts/check-miri-cfg.mjs:46— check-miri-cfg.stripLiterals 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.
generate-agent-docs.parseArgs (cyclomatic 20) scripts/generate-agent-docs.mjs:873— generate-agent-docs.parseArgs has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body's own statements and 1 belongs to one function item inside it that branches. 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.
PackageJson::entry_points (cyclomatic 19) crates/config/src/workspace/package_json.rs:278— PackageJson::entry_points has cyclomatic complexity 19 (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.
fallow_similar_code_sidecar::protocol::process_request (cyclomatic 19) tools/similar-code-sidecar/src/protocol.rs:210— fallow_similar_code_sidecar::protocol::process_request 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.
select-heavy-runner.parseAllocation (cyclomatic 19) REDACTED:56— select-heavy-runner.parseAllocation has cyclomatic complexity 19 (threshold 15). 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.
select-heavy-runner.trustedWorkflow (cyclomatic 19) REDACTED:100— select-heavy-runner.trustedWorkflow has cyclomatic complexity 19 (threshold 15). 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.
project-state.stripJsonComments (cyclomatic 19) tools/type-aware-sidecar/src/project-state.mjs:132— project-state.stripJsonComments has cyclomatic complexity 19 (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.
tooltip.lensLine (cyclomatic 19) viz-frontend/src/tooltip.ts:119— tooltip.lensLine has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body's own statements and 1 belongs 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.
FederationCallCollector::merge (cyclomatic 18) crates/core/src/plugins/module_federation.rs:669— FederationCallCollector::merge 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.
IstanbulFileCoverage::lookup (cyclomatic 18) crates/engine/src/health/scoring.rs:1370— IstanbulFileCoverage::lookup 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.
Scan::specifier_usages (cyclomatic 18) crates/engine/src/trace_usage_impl.rs:876— Scan::specifier_usages 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.
public-config-corpus.render_markdown (cyclomatic 18) scripts/public-config-corpus.py:742— public-config-corpus.render_markdown has cyclomatic complexity 18 (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.
verify-installed.superviseVerification (cyclomatic 18) REDACTED:53— verify-installed.superviseVerification has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body's own statements and 9 belong to 4 function items inside it that branch. 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.
client.startClient (cyclomatic 18) editors/vscode/src/client.ts:283— client.startClient 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.
coverage-producer-conformance.runSelfTest (cyclomatic 18) scripts/coverage-producer-conformance.mjs:772— coverage-producer-conformance.runSelfTest has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body's own statements and 2 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.
semantic-clone-conformance.loadManifest (cyclomatic 18) scripts/semantic-clone-conformance.mjs:117— semantic-clone-conformance.loadManifest 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.
cli.sessionFileChanges (cyclomatic 18) tools/type-aware-sidecar/src/cli.mjs:44— cli.sessionFileChanges has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body's own statements and 7 belong to 2 function items inside it that branch. 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.
ego.drawStageColumn (cyclomatic 18) viz-frontend/src/graph/ego.ts:542— ego.drawStageColumn 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.
render.drawHoverNeighborhood (cyclomatic 18) viz-frontend/src/graph/render.ts:327— render.drawHoverNeighborhood 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.
ProofOrigins::resolve_export (cyclomatic 17) crates/core/src/analyze/policy/gdp.rs:169— ProofOrigins::resolve_export 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.
CacheStore::evict_lru_to_target (cyclomatic 17) crates/extract/src/cache/store.rs:228— CacheStore::evict_lru_to_target 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.
ObjectStyleCollector::collect_call (cyclomatic 17) crates/extract/src/css_in_js/object.rs:436— ObjectStyleCollector::collect_call 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.
public-config-corpus.main (cyclomatic 17) scripts/public-config-corpus.py:73— public-config-corpus.main 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.
analysis-utils.buildAnalysisArgs (cyclomatic 17) editors/vscode/src/analysis-utils.ts:122— analysis-utils.buildAnalysisArgs has cyclomatic complexity 17 (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.
coverage-producer-conformance.loadManifest (cyclomatic 17) scripts/coverage-producer-conformance.mjs:313— coverage-producer-conformance.loadManifest 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.
ship-wait-checks.ghRunMetadataReader (cyclomatic 17) scripts/ship-wait-checks.mjs:718— ship-wait-checks.ghRunMetadataReader has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 720). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
main.init::handleGraphHover (cyclomatic 17) viz-frontend/src/main.ts:384— main.init::handleGraphHover 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.
frameworkContractRelationsFor (cyclomatic 17) tools/type-aware-sidecar/src/semantic.mjs:931— frameworkContractRelationsFor 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.
NamespacePropagationIndexes::new (cyclomatic 16) crates/graph/src/graph/namespace_indexes.rs:254— NamespacePropagationIndexes::new has cyclomatic complexity 16 (threshold 15). 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.
run-binary.superviseSetup (cyclomatic 16) npm/fallow-similar-code/scripts/run-binary.js:87— run-binary.superviseSetup has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 4 function items inside it that branch (terminate, handler, a function literal at line 135, …). 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.
generate-agent-adapters.generateSkillAdapters (cyclomatic 16) scripts/generate-agent-adapters.mjs:164— generate-agent-adapters.generateSkillAdapters 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.
semantic-clone-candle-conformance.validateResponse (cyclomatic 16) scripts/semantic-clone-candle-conformance.mjs:149— semantic-clone-candle-conformance.validateResponse has cyclomatic complexity 16 (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.
data.lensFindingLevel (cyclomatic 16) viz-frontend/src/data.ts:794— data.lensFindingLevel 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.
annotations.drawHoverLabels (cyclomatic 16) viz-frontend/src/graph/annotations.ts:261— annotations.drawHoverLabels 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.
annotations.drawPathTrace (cyclomatic 16) viz-frontend/src/graph/annotations.ts:330— annotations.drawPathTrace has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body's own statements and 5 belong to 2 function literals inside it that branch. 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.
render.nodeAppearance (cyclomatic 16) viz-frontend/src/graph/render.ts:401— render.nodeAppearance has cyclomatic complexity 16 (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.
panel.analysisContent (cyclomatic 16) viz-frontend/src/panel.ts:1222— panel.analysisContent has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs 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.
main.countLensFindings (cyclomatic 16) viz-frontend/src/main.ts:658— main.countLensFindings has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (walk). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D10 · Test Quality· Fixed-sleep synchronisation · ×1
Fixed-sleep synchronisation: serializes two concurrent holders editors/vscode/test/download-lock.test.ts:197— This test starts work it did not wait for (`a`, still running when the sleep starts) and then orders itself against it with `sleep(50)` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
extension.activate (cognitive 105) editors/vscode/src/extension.ts:169— extension.activate has cognitive complexity 105 (threshold 15). Drivers by points: if/else 72 (84 pts), ternaries 6 (10 pts), boolean chains 8, error handling 3 (nesting depth added 16). Most of this is not in the body itself: 7 of the 105 points are its own statements and the rest belongs to 36 function items inside it that branch (a function literal at line 1101, a function literal at line 372, syncAuditStatusBar, …). 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.
annotations.drawClusterLabels (cognitive 83) viz-frontend/src/graph/annotations.ts:606— annotations.drawClusterLabels has cognitive complexity 83 (threshold 15). Drivers by points: if/else 17 (41 pts), ternaries 9 (20 pts), boolean chains 15, loops 4 (7 pts) (nesting depth added 38). Of this number, 80 points are the body's own statements and 3 belong to 3 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.
download.downloadBinary (cognitive 65) editors/vscode/src/download.ts:1107— download.downloadBinary has cognitive complexity 65 (threshold 15). Drivers by points: if/else 17 (46 pts), ternaries 4 (12 pts), error handling 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 40). Most of this is not in the body itself: 1 of the 65 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 1122, 1136). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
coverage-producer-refresh.main (cognitive 55) scripts/coverage-producer-refresh.mjs:175— coverage-producer-refresh.main has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 14 (19 pts), ternaries 2 (4 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.
render.drawNodes (cognitive 52) viz-frontend/src/graph/render.ts:462— render.drawNodes has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (40 pts), boolean chains 11, loops 1 (nesting depth added 23). 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.
panel.complexitySection (cognitive 51) viz-frontend/src/panel.ts:488— panel.complexitySection has cognitive complexity 51 (threshold 15). Drivers by points: if/else 8 (21 pts), ternaries 6 (19 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 31). 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.
DeadCodeAuditLedger::annotate_results (cognitive 50) crates/api/src/audit_keys.rs:146— DeadCodeAuditLedger::annotate_results has cognitive complexity 50 (threshold 15). Drivers by points: loops 50. 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.
fallow_types::workspace::render_message (cognitive 49) crates/types/src/workspace.rs:1542— fallow_types::workspace::render_message has cognitive complexity 49 (threshold 15). Drivers by points: if/else 28 (41 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 16). 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.
panel.rankRowsForLens (cognitive 48) viz-frontend/src/panel.ts:1652— panel.rankRowsForLens has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 18 (39 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (nesting depth added 23). Of this number, 17 points are the body's own statements and 31 belong to 6 function literals inside it that branch. 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.
TsconfigOutputMap::resolve_source_for_entry (cognitive 45) crates/config/src/workspace/tsconfig.rs:92— TsconfigOutputMap::resolve_source_for_entry has cognitive complexity 45 (threshold 15). Drivers by points: if/else 22 (38 pts), boolean chains 4, 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.
DeadCodeTreeProvider.getChildren (cognitive 44) editors/vscode/src/treeView.ts:197— DeadCodeTreeProvider.getChildren has cognitive complexity 44 (threshold 15). Drivers by points: if/else 38, ternaries 3 (6 pts) (nesting depth added 3). Of this number, 37 points are the body's own statements and 7 belong to 5 function items inside it that branch. 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.
build.tarjanSCC (cognitive 42) viz-frontend/src/graph/build.ts:256— build.tarjanSCC has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 4 (10 pts) (nesting depth added 29). 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.
panel.renderLensPanel (cognitive 42) viz-frontend/src/panel.ts:2351— panel.renderLensPanel has cognitive complexity 42 (threshold 15). Drivers by points: if/else 25 (36 pts), boolean chains 5, match/switch 1 (nesting depth added 11). Of this number, 39 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.
StatementBoundary::push (cognitive 40) crates/extract/src/mdx.rs:253— StatementBoundary::push has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 4 (13 pts), boolean chains 2, loops 1 (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.
ship-wait-checks.currentRollupChecks (cognitive 40) scripts/ship-wait-checks.mjs:603— ship-wait-checks.currentRollupChecks has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 6 (12 pts), ternaries 2 (6 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.
ship-wait-checks.supersededCancellations (cognitive 39) scripts/ship-wait-checks.mjs:524— ship-wait-checks.supersededCancellations has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 5 (9 pts), boolean chains 6 (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.
chrome.buildChrome (cognitive 39) REDACTED:139— chrome.buildChrome has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 7, ternaries 4 (5 pts), boolean chains 4 (nesting depth added 8). Most of this is not in the body itself: 8 of the 39 points are its own statements and the rest belongs to 10 function items inside it that branch (refreshLensOverflow, a function literal at line 275, a function literal at line 307, …). 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.
public-config-corpus.strip_jsonc_comments (cognitive 37) scripts/public-config-corpus.py:567— public-config-corpus.strip_jsonc_comments has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (7 pts), boolean chains 5, ternaries 2 (5 pts) (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.
panel.securityCandidateEl (cognitive 37) viz-frontend/src/panel.ts:349— panel.securityCandidateEl has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22, ternaries 6 (10 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 6). 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.
coverage-producer-conformance.runSelfTest (cognitive 36) scripts/coverage-producer-conformance.mjs:772— coverage-producer-conformance.runSelfTest has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 16). Of this number, 34 points are the body's own statements and 2 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.
ContractIndex::block_reference (cognitive 35) crates/core/src/analyze/absent_component_prop.rs:382— ContractIndex::block_reference has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 3 (10 pts), loops 1 (4 pts) (nesting depth added 23). 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.
generate-agent-adapters.generateSkillAdapters (cognitive 35) scripts/generate-agent-adapters.mjs:164— generate-agent-adapters.generateSkillAdapters has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 4 (6 pts), ternaries 2 (5 pts) (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.
frameworkContractRelationsFor (cognitive 34) tools/type-aware-sidecar/src/semantic.mjs:931— frameworkContractRelationsFor has cognitive complexity 34 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 4 (10 pts), boolean chains 3, other 3, ternaries 1 (2 pts) (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.
stripJsonComments (cognitive 34) tools/type-aware-sidecar/src/project-state.mjs:132— stripJsonComments has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (7 pts), boolean chains 4, ternaries 1 (4 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.
download.downloadManagedBinary (cognitive 33) editors/vscode/src/download.ts:997— download.downloadManagedBinary has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (27 pts), ternaries 1 (3 pts), error handling 1 (2 pts), loops 1 (nesting depth added 19). Most of this is not in the body itself: 1 of the 33 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 1014, 1028). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
chrome.updateChrome (cognitive 32) REDACTED:540— chrome.updateChrome has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 6 (7 pts), ternaries 3 (6 pts), boolean chains 2 (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.
check-miri-cfg.scanFile (cognitive 31) scripts/check-miri-cfg.mjs:104— check-miri-cfg.scanFile has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 11, loops 2, ternaries 1 (nesting depth added 6). None of this is in the body itself: all 31 points belong to 3 function items inside it that branch (a function literal at line 124, a function literal at line 108, insideGated). 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.
render.drawRoads (cognitive 30) viz-frontend/src/graph/render.ts:226— render.drawRoads has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 9, ternaries 4 (6 pts), 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.
sync-emitted-versions.scanJsonExample (cognitive 29) scripts/sync-emitted-versions.mjs:84— sync-emitted-versions.scanJsonExample has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5, loops 2 (nesting depth added 11). Of this number, 28 points are the body's own statements and 1 belongs to one function item 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.
data.legendText (cognitive 29) viz-frontend/src/data.ts:832— data.legendText has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 6 (17 pts), if/else 7 (12 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
PackageJson::entry_points (cognitive 28) crates/config/src/workspace/package_json.rs:278— PackageJson::entry_points has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (6 pts), match/switch 2 (4 pts), boolean chains 2 (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.
check-miri-cfg.stripLiterals (cognitive 28) scripts/check-miri-cfg.mjs:46— check-miri-cfg.stripLiterals has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 6, ternaries 1 (3 pts), loops 1 (nesting depth added 10). 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.
tooltip.lensLine (cognitive 28) viz-frontend/src/tooltip.ts:119— tooltip.lensLine has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 8 (11 pts), boolean chains 4 (nesting depth added 10). Of this number, 27 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.
render.drawHoverNeighborhood (cognitive 27) viz-frontend/src/graph/render.ts:327— render.drawHoverNeighborhood has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 4, loops 2 (4 pts) (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.
treemap.renderTreemap (cognitive 27) viz-frontend/src/treemap.ts:428— treemap.renderTreemap has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 7 (11 pts), boolean chains 5 (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.
CommandCollector::collect_segment (cognitive 26) crates/core/src/plugins/mise.rs:325— CommandCollector::collect_segment has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 4, loops 1 (nesting depth added 5). 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.
PluginRegistry::resolve_script_config_files (cognitive 26) crates/core/src/plugins/registry/mod.rs:941— PluginRegistry::resolve_script_config_files has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (7 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.
Scan::specifier_usages (cognitive 26) crates/engine/src/trace_usage_impl.rs:876— Scan::specifier_usages has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 5 (6 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.
download.downloadAsset (cognitive 26) editors/vscode/src/download.ts:862— download.downloadAsset has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (20 pts), error handling 2 (4 pts), loops 1 (2 pts) (nesting depth added 10). 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.
semantic-clone-conformance.loadManifest (cognitive 26) scripts/semantic-clone-conformance.mjs:117— semantic-clone-conformance.loadManifest has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (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.
interact.graphHandleClick (cognitive 26) viz-frontend/src/graph/interact.ts:328— interact.graphHandleClick has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4 (nesting depth added 10). 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.
check-benchmark-harness.extract_matrix_targets (cognitive 24) scripts/check-benchmark-harness.py:94— check-benchmark-harness.extract_matrix_targets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 2, 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.
check-benchmark-harness.validate_targets (cognitive 24) scripts/check-benchmark-harness.py:252— check-benchmark-harness.validate_targets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 1, loops 1 (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.
public-config-corpus.render_markdown (cognitive 24) scripts/public-config-corpus.py:742— public-config-corpus.render_markdown has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14, loops 5 (9 pts), boolean chains 1 (nesting depth added 4). 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.
semantic-clone-conformance.validateFallowReport (cognitive 24) scripts/semantic-clone-conformance.mjs:226— semantic-clone-conformance.validateFallowReport has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, loops 2 (3 pts) (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.
ship-wait-checks.waitForChecks (cognitive 24) scripts/ship-wait-checks.mjs:250— ship-wait-checks.waitForChecks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 1, loops 1 (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.
ego.drawStageColumn (cognitive 24) viz-frontend/src/graph/ego.ts:542— ego.drawStageColumn has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 5 (9 pts), boolean chains 3, 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.
build.louvainCluster (cognitive 24) viz-frontend/src/graph/build.ts:141— build.louvainCluster has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 6 (8 pts), if/else 4 (7 pts), loops 6, boolean chains 3 (nesting depth added 5). Of this number, 13 points are the body's own statements and 11 belong to 6 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.
ProofOrigins::resolve_export (cognitive 23) crates/core/src/analyze/policy/gdp.rs:169— ProofOrigins::resolve_export has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, loops 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.
ServiceCollector::read_top_level (cognitive 23) crates/core/src/plugins/railway.rs:125— ServiceCollector::read_top_level has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (7 pts), match/switch 1 (2 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.
public-config-corpus.main (cognitive 23) scripts/public-config-corpus.py:73— public-config-corpus.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, error handling 2 (3 pts), loops 2 (3 pts) (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.
scan-hidden-unicode.scan_agent (cognitive 23) scripts/scan-hidden-unicode.py:212— scan-hidden-unicode.scan_agent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (10 pts), boolean chains 1, ternaries 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.
vsix-inventory.validateEntry (cognitive 23) editors/vscode/scripts/vsix-inventory.mjs:24— vsix-inventory.validateEntry has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7, loops 2, ternaries 1 (2 pts) (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.
coverage-producer-conformance.loadManifest (cognitive 23) scripts/coverage-producer-conformance.mjs:313— coverage-producer-conformance.loadManifest has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 3 (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.
semantic-clone-conformance.loadCandidateEvidence (cognitive 23) scripts/semantic-clone-conformance.mjs:55— semantic-clone-conformance.loadCandidateEvidence has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5, loops 1 (nesting depth added 4). None of this is in the body itself: all 23 points belong to 2 function literals inside it that branch (lines 56, 105). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
ego.buildColumn (cognitive 23) viz-frontend/src/graph/ego.ts:93— ego.buildColumn has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, loops 3 (4 pts), ternaries 4 (nesting depth added 5). Of this number, 15 points are the body's own statements and 8 belong to 7 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.
scan-hidden-unicode.agent_surface (cognitive 22) scripts/scan-hidden-unicode.py:172— scan-hidden-unicode.agent_surface has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 pts), ternaries 1 (3 pts), boolean chains 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.
commands.runAnalysis (cognitive 22) editors/vscode/src/commands.ts:692— commands.runAnalysis has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 3 (7 pts), boolean chains 1, error handling 1 (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.
generate-agent-docs.parseArgs (cognitive 22) scripts/generate-agent-docs.mjs:873— generate-agent-docs.parseArgs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 4, loops 1 (nesting depth added 2). Of this number, 20 points are the body's own statements and 2 belong to one function item inside it that branches. 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.
build.relaxRows (cognitive 22) viz-frontend/src/graph/build.ts:424— build.relaxRows has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 2 (8 pts) (nesting depth added 14). 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.
panel.analysisContent (cognitive 22) viz-frontend/src/panel.ts:1222— panel.analysisContent has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 7). Of this number, 21 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.
VirtualRouteCallCollector::visit_variable_declaration (cognitive 21) crates/core/src/plugins/tanstack_router.rs:870— VirtualRouteCallCollector::visit_variable_declaration has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (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.
WuchaleVitePluginCollector::visit_variable_declaration (cognitive 21) crates/core/src/plugins/wuchale.rs:195— WuchaleVitePluginCollector::visit_variable_declaration has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (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.
CacheStore::evict_lru_to_target (cognitive 21) crates/extract/src/cache/store.rs:228— CacheStore::evict_lru_to_target has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (7 pts), loops 4 (7 pts) (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.
TokenDefCollector::build_const_object_map (cognitive 21) crates/extract/src/css_in_js/tokens.rs:2941— TokenDefCollector::build_const_object_map has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (8 pts), loops 2 (3 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.
client.startClient (cognitive 21) editors/vscode/src/client.ts:283— client.startClient has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 6 (9 pts), boolean chains 2, error handling 1 (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.
styling-pr-smoke.selectPrs (cognitive 21) scripts/styling-pr-smoke.mjs:225— styling-pr-smoke.selectPrs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 5, 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.
treemap.renderFileCell (cognitive 21) viz-frontend/src/treemap.ts:750— treemap.renderFileCell has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 10, if/else 9 (10 pts), ternaries 1 (nesting depth added 1). 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.
withLinearSnapshots (cognitive 21) tools/type-aware-sidecar/src/backend.mjs:71— withLinearSnapshots has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 5, boolean chains 3, loops 1 (nesting depth added 1). None of this is in the body itself: all 21 points belong to 9 function items inside it that branch (handle::get, updateSnapshot, disposeWhenUnused, …). 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.
FallowConfig::find_and_load_with_options (cognitive 20) crates/config/src/config/parsing.rs:1605— FallowConfig::find_and_load_with_options has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (6 pts), loops 2 (3 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.
UntrustedSourceIndex::build (cognitive 20) crates/core/src/analyze/security/rank.rs:591— UntrustedSourceIndex::build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (4 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.
FederationCallCollector::merge (cognitive 20) crates/core/src/plugins/module_federation.rs:669— FederationCallCollector::merge has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (8 pts), boolean chains 7, if/else 3 (5 pts) (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.
TypeScriptPlugin::resolve_config (cognitive 20) crates/core/src/plugins/typescript.rs:74— TypeScriptPlugin::resolve_config has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 3, 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.
DominatorTree::new (cognitive 20) crates/graph/src/graph/entry_load.rs:265— DominatorTree::new has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (7 pts), boolean chains 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.
public-config-corpus.parse_toml_fallback (cognitive 20) scripts/public-config-corpus.py:443— public-config-corpus.parse_toml_fallback has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 pts), boolean chains 2 (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.
scan-hidden-unicode.codepoint_hits (cognitive 20) scripts/scan-hidden-unicode.py:102— scan-hidden-unicode.codepoint_hits has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 3 (7 pts), boolean chains 3, loops 1 (nesting depth added 10). 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.
data.buildIndex (cognitive 20) viz-frontend/src/data.ts:564— data.buildIndex has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (5 pts), boolean chains 3 (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.
main.countLensFindings::walk (cognitive 20) viz-frontend/src/main.ts:664— main.countLensFindings::walk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 1 (2 pts), boolean chains 1, 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.
stripTrailingCommas (cognitive 20) tools/type-aware-sidecar/src/project-state.mjs:179— stripTrailingCommas has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 1, other 1 (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.
IssueFilters::apply_component_filters (cognitive 19) crates/cli/src/check/mod.rs:288— IssueFilters::apply_component_filters has cognitive complexity 19 (threshold 15). Drivers by points: if/else 19. 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.
RuntimeBindings::collect (cognitive 19) crates/extract/src/federation_runtime.rs:131— RuntimeBindings::collect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 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.
check-comment-quality.lineCommentBodies (cognitive 19) scripts/check-comment-quality.mjs:186— check-comment-quality.lineCommentBodies has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, loops 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.
coverage-producer-conformance.loadFixtures (cognitive 19) scripts/coverage-producer-conformance.mjs:203— coverage-producer-conformance.loadFixtures has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 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.
generate-agent-docs.main (cognitive 19) scripts/generate-agent-docs.mjs:973— generate-agent-docs.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1, ternaries 1 (nesting depth added 10). 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.
data.lensFindingLevel (cognitive 19) viz-frontend/src/data.ts:794— data.lensFindingLevel has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 4 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 9). 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.
Worker::attempt (cognitive 18) crates/api/src/mutation/scheduler/mod.rs:666— Worker::attempt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, match/switch 3 (4 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.
AliasChain::build (cognitive 18) crates/graph/src/graph/namespace_aliases.rs:312— AliasChain::build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (7 pts), boolean chains 1 (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.
fallow_mutation::regex::edits (cognitive 18) crates/mutation/src/regex.rs:54— fallow_mutation::regex::edits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, match/switch 1 (2 pts), 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.
public-config-corpus.strip_jsonc_trailing_commas (cognitive 18) scripts/public-config-corpus.py:624— public-config-corpus.strip_jsonc_trailing_commas has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 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.
statusBar-utils.buildStatusBarTooltipMarkdown (cognitive 18) editors/vscode/src/statusBar-utils.ts:272— statusBar-utils.buildStatusBarTooltipMarkdown has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (4 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.
commands.runWorkspaces (cognitive 18) editors/vscode/src/commands.ts:817— commands.runWorkspaces has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 1 (2 pts), error handling 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.
coverage-producer-conformance.loadCensusUnits (cognitive 18) scripts/coverage-producer-conformance.mjs:242— coverage-producer-conformance.loadCensusUnits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 246). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
verify-release-ci.verifyReleaseCi (cognitive 18) scripts/verify-release-ci.mjs:398— verify-release-ci.verifyReleaseCi has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). Of this number, 15 points are the body's own statements and 3 belong to one function item 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.
interact.graphHoverTarget (cognitive 18) viz-frontend/src/graph/interact.ts:252— interact.graphHoverTarget has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, ternaries 2 (3 pts) (nesting depth added 5). Of this number, 17 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.
contractRelationsFor (cognitive 18) tools/type-aware-sidecar/src/semantic.mjs:890— contractRelationsFor has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 2 (4 pts), ternaries 1 (4 pts), boolean chains 2, other 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.
AngularTemplateRefContext::propagate (cognitive 17) crates/core/src/analyze/members/heritage.rs:115— AngularTemplateRefContext::propagate has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (6 pts), boolean chains 1 (nesting depth added 9). 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.
ChildResolver::new (cognitive 17) crates/core/src/analyze/react_resolve.rs:69— ChildResolver::new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), 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.
RouterPluginCallCollector::visit_variable_declaration (cognitive 17) crates/core/src/plugins/tanstack_router.rs:685— RouterPluginCallCollector::visit_variable_declaration has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (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.
ThresholdOverrideStateTracker::record_complexity (cognitive 17) crates/engine/src/health/threshold_overrides.rs:314— ThresholdOverrideStateTracker::record_complexity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7, 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.
TemplateScanner::scan_attributes (cognitive 17) crates/extract/src/template_complexity/mod.rs:252— TemplateScanner::scan_attributes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 3 (4 pts) (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.
VueScanner::scan_attributes (cognitive 17) crates/extract/src/template_complexity/vue.rs:150— VueScanner::scan_attributes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 3 (4 pts) (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.
verify-installed.superviseVerification (cognitive 17) REDACTED:53— verify-installed.superviseVerification has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, loops 2, error handling 1 (nesting depth added 1). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 4 function items inside it that branch (terminate, handler, a function literal at line 94, …). 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.
binary-utils.platformPackageNames (cognitive 17) editors/vscode/src/binary-utils.ts:20— binary-utils.platformPackageNames has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (4 pts), boolean chains 2 (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.
binary-utils.findBinaryInPath (cognitive 17) editors/vscode/src/binary-utils.ts:249— binary-utils.findBinaryInPath has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 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.
interact.shortestPath::bfs (cognitive 17) viz-frontend/src/graph/interact.ts:129— interact.shortestPath::bfs has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (7 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.
treemap.layoutStrip (cognitive 17) viz-frontend/src/treemap.ts:42— treemap.layoutStrip has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 3 (4 pts), boolean chains 2, loops 2 (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.
panel.renderFindingList (cognitive 17) viz-frontend/src/panel.ts:2167— panel.renderFindingList has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). Of this number, 10 points are the body's own statements and 7 belong to one function item 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.
BoundaryConfig::validate_zone_references (cognitive 16) crates/config/src/config/boundaries.rs:939— BoundaryConfig::validate_zone_references has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (6 pts) (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.
AngularTemplateChainContext::propagate (cognitive 16) crates/core/src/analyze/members/heritage.rs:367— AngularTemplateChainContext::propagate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (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.
EagerSubgraph::new (cognitive 16) crates/graph/src/graph/entry_load.rs:208— EagerSubgraph::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (5 pts) (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.
check_telemetry_doc_sync.main (cognitive 16) scripts/check_telemetry_doc_sync.py:130— check_telemetry_doc_sync.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), 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.
public-config-corpus.extract_toml_comments (cognitive 16) scripts/public-config-corpus.py:659— public-config-corpus.extract_toml_comments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (3 pts) (nesting depth added 10). 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.
analysis-utils.buildAnalysisArgs (cognitive 16) editors/vscode/src/analysis-utils.ts:122— analysis-utils.buildAnalysisArgs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. 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.
download.retryReleaseDownload (cognitive 16) editors/vscode/src/download.ts:761— download.retryReleaseDownload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (4 pts), error handling 2 (nesting depth added 5). Of this number, 11 points are the body's own statements and 5 belong 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.
check-comment-quality.multilineOpener (cognitive 16) scripts/check-comment-quality.mjs:66— check-comment-quality.multilineOpener has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 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.
check-comment-quality.maskMultilineStrings (cognitive 16) scripts/check-comment-quality.mjs:125— check-comment-quality.maskMultilineStrings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 2 (5 pts), loops 1 (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.
ci-metrics.parseArguments (cognitive 16) scripts/ci-metrics.mjs:34— ci-metrics.parseArguments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 1 (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.
select-heavy-runner.trustedWorkflow (cognitive 16) REDACTED:100— select-heavy-runner.trustedWorkflow has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (6 pts) (nesting depth added 1). 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.
styling-corpus-smoke.collectObjectArrayEntries::visit (cognitive 16) scripts/styling-corpus-smoke.mjs:352— styling-corpus-smoke.collectObjectArrayEntries::visit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 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.
build.directoryCluster::split (cognitive 16) viz-frontend/src/graph/build.ts:89— build.directoryCluster::split has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3, boolean chains 2, ternaries 1 (2 pts) (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.
build.orderWithinLayers (cognitive 16) viz-frontend/src/graph/build.ts:351— build.orderWithinLayers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), loops 4 (5 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 6). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 4 function items inside it that branch (sweep, a function literal at line 375, a function literal at line 354, …). 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.
D4 · Code Duplication· Edited copy of a member (22 corresponding lines) · ×1
Edited copy of a member (22 corresponding lines) crates/extract/src/sfc_template/shared.rs:358— crates/extract/src/sfc_template/shared.rs:358-392 | crates/extract/src/sfc_template/shared.rs:394-424 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (17 corresponding lines) · ×1
Edited copy of a member (17 corresponding lines) crates/engine/src/health/css_analytics/theme_tokens.rs:21— crates/engine/src/health/css_analytics/theme_tokens.rs:21-44 | crates/engine/src/health/css_analytics/theme_tokens.rs:56-86 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Members sharing a duplicated core (6 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (6 members, 50+ identical tokens) crates/core/src/plugins/config_parser.rs:352— crates/core/src/plugins/config_parser.rs:352-375 | crates/core/src/plugins/config_parser.rs:539-557 | crates/core/src/plugins/config_parser.rs:603-635 | crates/core/src/plugins/config_parser.rs:646-677 | crates/core/src/plugins/config_parser.rs:687-713 | crates/core/src/plugins/config_parser.rs:765-784 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (5 members, 50+ identical tokens) crates/cli/src/flags.rs:158— crates/cli/src/flags.rs:158-271 | crates/cli/src/suppressions.rs:41-92 | crates/cli/src/trace_chain.rs:45-110 | crates/cli/src/trace_error.rs:41-78 | crates/cli/src/trace_path.rs:40-96 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Duplicated block (44–54 lines × 2) crates/api/src/audit_keys.rs:173— crates/api/src/audit_keys.rs:173-216 | crates/api/src/audit_keys.rs:653-706 — 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 (50–54 lines × 2) crates/engine/src/effective_severity.rs:504— crates/engine/src/effective_severity.rs:504-557 | crates/engine/src/effective_severity.rs:637-686 — 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 (49–50 lines × 2) crates/core/src/lib.rs:302— crates/core/src/lib.rs:302-350 | crates/engine/src/discover.rs:319-368 — before extracting anything, compare `crates/core/src/lib.rs` and `crates/engine/src/discover.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (36–37 lines × 2) crates/api/src/lib.rs:1275— crates/api/src/lib.rs:1275-1311 | crates/engine/src/health/mod.rs:612-647 — before extracting anything, compare `crates/api/src/lib.rs` and `crates/engine/src/health/mod.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (36 lines × 2) crates/api/src/lib.rs:533— crates/api/src/lib.rs:533-568 | crates/cli/src/check/mod.rs:170-205 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (35 lines × 2) crates/api/src/audit_keys.rs:1478— crates/api/src/audit_keys.rs:1478-1512 | crates/engine/src/changed_files.rs:710-744 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (32 lines × 2) crates/api/src/lib.rs:595— crates/api/src/lib.rs:595-626 | crates/cli/src/check/mod.rs:132-163 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (30 lines × 2) crates/cli/src/dispatch.rs:1295— crates/cli/src/dispatch.rs:1295-1324 | crates/cli/src/dispatch.rs:1407-1436 — 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 (29 lines × 4) crates/engine/src/effective_severity.rs:484— crates/engine/src/effective_severity.rs:484-512 | crates/engine/src/effective_severity.rs:617-645 | crates/types/src/identity.rs:443-471 | crates/types/src/results.rs:830-858 — there are 4 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (27–29 lines × 2) crates/core/src/scripts/mod.rs:1821— crates/core/src/scripts/mod.rs:1821-1847 | crates/engine/src/discover.rs:740-768 — before extracting anything, compare `crates/core/src/scripts/mod.rs` and `crates/engine/src/discover.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (29 lines × 2) crates/core/src/scripts/shell.rs:423— crates/core/src/scripts/shell.rs:423-451 | crates/engine/src/discover.rs:680-708 — before extracting anything, compare `crates/core/src/scripts/shell.rs` and `crates/engine/src/discover.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (27 lines × 2) crates/cli/src/security.rs:258— crates/cli/src/security.rs:258-284 | crates/cli/src/security.rs:306-332 — 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 (24–25 lines × 2) crates/core/src/analyze/unused_load_data_key.rs:145— crates/core/src/analyze/unused_load_data_key.rs:145-168 | crates/core/src/analyze/unused_load_data_key.rs:231-255 — 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 (22–24 lines × 2) crates/core/src/analyze/unused_component_input.rs:197— crates/core/src/analyze/unused_component_input.rs:197-220 | crates/core/src/analyze/unused_component_output.rs:176-197 — before extracting anything, compare `crates/core/src/analyze/unused_component_input.rs` and `crates/core/src/analyze/unused_component_output.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 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 (24 lines × 2) crates/types/src/workspace.rs:1025— crates/types/src/workspace.rs:1025-1048 | crates/types/src/workspace.rs:1086-1109 — 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 (20–22 lines × 2) crates/graph/src/graph/mod.rs:554— crates/graph/src/graph/mod.rs:554-573 | crates/graph/src/graph/test_reach.rs:288-309 — 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 (21–22 lines × 2) crates/graph/src/graph/mod.rs:596— crates/graph/src/graph/mod.rs:596-617 | crates/graph/src/graph/test_reach.rs:337-357 — 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 (18–20 lines × 2) crates/cli/src/agent_install/guide.rs:170— crates/cli/src/agent_install/guide.rs:170-187 | crates/cli/src/agent_install/guide.rs:206-225 — 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 (15–20 lines × 2) crates/extract/src/sfc_props.rs:160— crates/extract/src/sfc_props.rs:160-179 | crates/extract/src/sfc_props.rs:651-665 — 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 (19 lines × 3) crates/extract/src/css_in_js/tokens.rs:1148— crates/extract/src/css_in_js/tokens.rs:1148-1166 | crates/extract/src/css_in_js/tokens.rs:1364-1382 | crates/extract/src/css_in_js/tokens.rs:1580-1598 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (14–19 lines × 2) crates/core/src/discover/infrastructure.rs:218— crates/core/src/discover/infrastructure.rs:218-231 | crates/core/src/discover/parse_scripts.rs:128-146 — 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 (18–19 lines × 2) crates/core/src/lib.rs:367— crates/core/src/lib.rs:367-384 | crates/engine/src/discover.rs:387-405 — before extracting anything, compare `crates/core/src/lib.rs` and `crates/engine/src/discover.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (17–19 lines × 2) crates/extract/src/sfc_template/angular.rs:677— crates/extract/src/sfc_template/angular.rs:677-693 | crates/extract/src/sfc_template/angular.rs:934-952 — 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 (18 lines × 3) crates/cli/src/trace_chain.rs:120— crates/cli/src/trace_chain.rs:120-137 | crates/cli/src/trace_dependency.rs:158-175 | crates/cli/src/trace_path.rs:99-116 — before extracting anything, compare `crates/cli/src/trace_chain.rs` and `crates/cli/src/trace_path.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 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 (17–18 lines × 3) crates/mcp/src/tools/analyze.rs:68— crates/mcp/src/tools/analyze.rs:68-85 | crates/mcp/src/tools/audit.rs:125-142 | crates/mcp/src/tools/inspect_target.rs:31-47 — 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 (15–18 lines × 2) crates/core/src/analyze/react_intel.rs:145— crates/core/src/analyze/react_intel.rs:145-159 | crates/core/src/analyze/render_fan_in.rs:135-152 — 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 (16–18 lines × 2) crates/extract/src/css_in_js/object.rs:305— crates/extract/src/css_in_js/object.rs:305-322 | crates/extract/src/css_in_js/tokens.rs:2910-2925 — 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 (17–18 lines × 2) crates/lsp/src/code_actions/quick_fix.rs:456— crates/lsp/src/code_actions/quick_fix.rs:456-473 | crates/lsp/src/code_actions/quick_fix.rs:689-705 — 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 (16–17 lines × 3) crates/mcp/src/tools/impact.rs:93— crates/mcp/src/tools/impact.rs:93-108 | crates/mcp/src/tools/trace.rs:195-211 | crates/mcp/src/tools/trace.rs:222-237 — before extracting anything, compare `crates/mcp/src/tools/impact.rs` and `crates/mcp/src/tools/trace.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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 (16–17 lines × 2) crates/api/src/type_aware/mod.rs:47— crates/api/src/type_aware/mod.rs:47-63 | crates/api/src/type_aware/mod.rs:124-139 — 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 (16 lines × 3) crates/types/src/workspace.rs:762— crates/types/src/workspace.rs:762-777 | crates/types/src/workspace.rs:1031-1046 | crates/types/src/workspace.rs:1092-1107 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (14–16 lines × 2) crates/cli/src/impact.rs:1023— crates/cli/src/impact.rs:1023-1038 | crates/cli/src/impact.rs:1096-1109 — 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 (13–16 lines × 2) crates/graph/src/resolve/specifier.rs:506— crates/graph/src/resolve/specifier.rs:506-521 | crates/graph/src/resolve/specifier.rs:771-783 — 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 (12–15 lines × 2) crates/lsp/src/code_lens.rs:149— crates/lsp/src/code_lens.rs:149-163 | crates/lsp/src/hover.rs:919-930 — 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 (13–14 lines × 9) crates/mcp/src/tools/analyze.rs:66— crates/mcp/src/tools/analyze.rs:66-79 | crates/mcp/src/tools/architecture.rs:51-63 | crates/mcp/src/tools/audit.rs:123-136 | crates/mcp/src/tools/code_mode_tools.rs:643-655 | crates/mcp/src/tools/dupes.rs:59-72 | crates/mcp/src/tools/flags.rs:58-71 | crates/mcp/src/tools/inspect_target.rs:29-41 | crates/mcp/src/tools/semantic.rs:20-32 | crates/mcp/src/tools/semantic.rs:95-107 — there are 9 copies across 8 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 9 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (14 lines × 4) crates/cli/src/bin/stub_sidecar.rs:164— crates/cli/src/bin/stub_sidecar.rs:164-177 | crates/cli/src/bin/stub_sidecar.rs:225-238 | crates/cli/src/bin/stub_sidecar.rs:300-313 | crates/cli/src/bin/stub_sidecar.rs:335-348 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (12–14 lines × 3) crates/core/src/analyze/react_intel.rs:143— crates/core/src/analyze/react_intel.rs:143-154 | crates/core/src/analyze/render_fan_in.rs:95-108 | crates/core/src/analyze/render_fan_in.rs:133-146 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (13–14 lines × 2) crates/core/src/analyze/unused_component_prop.rs:123— crates/core/src/analyze/unused_component_prop.rs:123-136 | crates/core/src/analyze/unused_component_prop.rs:271-283 — 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 (12–14 lines × 2) crates/mcp/src/tools/mutation.rs:163— crates/mcp/src/tools/mutation.rs:163-174 | crates/mcp/src/tools/similar_code.rs:132-145 — 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 (13 lines × 9) crates/mcp/src/tools/impact.rs:95— crates/mcp/src/tools/impact.rs:95-107 | crates/mcp/src/tools/list_boundaries.rs:55-67 | crates/mcp/src/tools/project_info.rs:55-67 | crates/mcp/src/tools/security.rs:58-70 | crates/mcp/src/tools/suppressions.rs:32-44 | crates/mcp/src/tools/trace.rs:197-209 | crates/mcp/src/tools/trace.rs:224-236 | crates/mcp/src/tools/trace.rs:254-266 | crates/mcp/src/tools/trace.rs:313-325 — before extracting anything, compare `crates/mcp/src/tools/impact.rs` and `crates/mcp/src/tools/trace.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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 (11–13 lines × 2) crates/cli/src/report/human/dupes.rs:506— crates/cli/src/report/human/dupes.rs:506-516 | crates/engine/src/duplication_detector/families.rs:199-211 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8–13 lines × 2) crates/core/src/scripts/ci.rs:441— crates/core/src/scripts/ci.rs:441-448 | crates/core/src/scripts/mod.rs:1197-1209 — 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 (9–13 lines × 2) crates/extract/src/cache/store.rs:271— crates/extract/src/cache/store.rs:271-279 | crates/extract/src/cache/store.rs:282-294 — 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–12 lines × 3) crates/core/src/analyze/members/factory.rs:23— crates/core/src/analyze/members/factory.rs:23-31 | crates/core/src/analyze/members/fluent_chain.rs:52-63 | crates/core/src/analyze/members/fluent_chain.rs:113-124 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (10–12 lines × 2) crates/api/src/runtime/trace.rs:454— crates/api/src/runtime/trace.rs:454-465 | crates/api/src/runtime/trace.rs:475-484 — 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–11 lines × 4) crates/engine/src/changed_files.rs:159— crates/engine/src/changed_files.rs:159-168 | crates/engine/src/changed_files.rs:187-197 | crates/engine/src/changed_files.rs:235-245 | crates/engine/src/changed_files.rs:605-614 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 4) crates/extract/src/css_in_js/tokens.rs:1136— crates/extract/src/css_in_js/tokens.rs:1136-1146 | crates/extract/src/css_in_js/tokens.rs:1352-1362 | crates/extract/src/css_in_js/tokens.rs:1568-1578 | crates/extract/src/css_in_js/tokens.rs:1790-1800 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10–11 lines × 3) crates/mcp/src/tools/dupes.rs:63— crates/mcp/src/tools/dupes.rs:63-73 | crates/mcp/src/tools/security.rs:61-71 | crates/mcp/src/tools/similar_code.rs:178-187 — 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 (10–11 lines × 2) crates/core/src/lib.rs:476— crates/core/src/lib.rs:476-486 | crates/engine/src/discover.rs:262-271 — before extracting anything, compare `crates/core/src/lib.rs` and `crates/engine/src/discover.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9–11 lines × 3) crates/engine/src/baseline/mod.rs:1749— crates/engine/src/baseline/mod.rs:1749-1759 | crates/engine/src/baseline/mod.rs:1765-1775 | crates/engine/src/baseline/mod.rs:1780-1788 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9–11 lines × 2) crates/engine/src/health/css_analytics/near_duplicates.rs:85— crates/engine/src/health/css_analytics/near_duplicates.rs:85-93 | crates/engine/src/health/css_analytics/theme_tokens.rs:209-219 — 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 (7–10 lines × 3) crates/extract/src/sfc_props.rs:420— crates/extract/src/sfc_props.rs:420-427 | crates/extract/src/sfc_props.rs:1349-1358 | crates/extract/src/sfc_props.rs:1451-1457 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 11) crates/mcp/src/tools/architecture.rs:56— crates/mcp/src/tools/architecture.rs:56-64 | crates/mcp/src/tools/check_changed.rs:69-77 | crates/mcp/src/tools/check_runtime_coverage.rs:92-100 | crates/mcp/src/tools/fix.rs:36-44 | crates/mcp/src/tools/fix.rs:63-71 | crates/mcp/src/tools/flags.rs:64-72 | crates/mcp/src/tools/impact.rs:100-108 | crates/mcp/src/tools/suppressions.rs:37-45 | crates/mcp/src/tools/trace.rs:202-210 | crates/mcp/src/tools/trace.rs:229-237 | crates/mcp/src/tools/trace.rs:259-267 — before extracting anything, compare `crates/mcp/src/tools/impact.rs` and `crates/mcp/src/tools/trace.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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–9 lines × 2) crates/cli/src/fix/io.rs:102— crates/cli/src/fix/io.rs:102-110 | crates/cli/src/fix/plan.rs:495-501 — 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–9 lines × 2) crates/engine/src/health/css_analytics/classes.rs:172— crates/engine/src/health/css_analytics/classes.rs:172-177 | crates/engine/src/health/css_analytics/classes.rs:687-695 — 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 × 4) crates/cli/src/flags.rs:169— crates/cli/src/flags.rs:169-175 | crates/cli/src/trace_chain.rs:81-88 | crates/cli/src/trace_error.rs:62-69 | crates/cli/src/trace_path.rs:54-61 — before extracting anything, compare `crates/cli/src/trace_chain.rs` and `crates/cli/src/trace_path.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 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 (6–8 lines × 2) crates/api/src/runtime/duplication.rs:217— crates/api/src/runtime/duplication.rs:217-222 | crates/cli/src/dupes.rs:248-255 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 6) crates/core/src/plugins/config_parser.rs:353— crates/core/src/plugins/config_parser.rs:353-359 | crates/core/src/plugins/config_parser.rs:540-546 | crates/core/src/plugins/config_parser.rs:604-611 | crates/core/src/plugins/config_parser.rs:647-654 | crates/core/src/plugins/config_parser.rs:688-695 | crates/core/src/plugins/config_parser.rs:766-772 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6 lines × 4) crates/types/src/results.rs:1597— crates/types/src/results.rs:1597-1602 | crates/types/src/results.rs:1605-1610 | crates/types/src/results.rs:1622-1627 | crates/types/src/results.rs:1694-1699 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 5) crates/cli/src/flags.rs:169— crates/cli/src/flags.rs:169-173 | crates/cli/src/suppressions.rs:48-52 | crates/cli/src/trace_chain.rs:80-86 | crates/cli/src/trace_error.rs:61-67 | crates/cli/src/trace_path.rs:53-59 — before extracting anything, compare `crates/cli/src/flags.rs` and `crates/cli/src/suppressions.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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 (52 lines × 2) crates/cli/src/lib.rs:971— crates/cli/src/lib.rs:971-1035 | crates/cli/src/similar_code_help.rs:150-201 — 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 (16 lines × 17) crates/api/src/dead_code_codeclimate.rs:952— crates/api/src/dead_code_codeclimate.rs:952-967 | crates/api/src/dead_code_codeclimate.rs:992-1007 | crates/api/src/dead_code_codeclimate.rs:1032-1047 | crates/api/src/dead_code_codeclimate.rs:1072-1087 | crates/api/src/dead_code_codeclimate.rs:1112-1127 | crates/api/src/dead_code_codeclimate.rs:1187-1202 | crates/api/src/dead_code_codeclimate.rs:1227-1242 | crates/api/src/dead_code_codeclimate.rs:1265-1280 | crates/api/src/dead_code_codeclimate.rs:1302-1317 | crates/api/src/dead_code_codeclimate.rs:1340-1355 | crates/api/src/dead_code_codeclimate.rs:1380-1395 | crates/api/src/dead_code_codeclimate.rs:1420-1435 | crates/api/src/dead_code_codeclimate.rs:1460-1475 | crates/api/src/dead_code_codeclimate.rs:1500-1515 | crates/api/src/dead_code_codeclimate.rs:1540-1555 | crates/api/src/dead_code_codeclimate.rs:1576-1591 | crates/api/src/dead_code_codeclimate.rs:1616-1631 — all 17 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (15 lines × 7) crates/types/src/output_dead_code.rs:530— crates/types/src/output_dead_code.rs:530-544 | crates/types/src/output_dead_code.rs:686-700 | crates/types/src/output_dead_code.rs:757-771 | crates/types/src/output_dead_code.rs:1001-1015 | crates/types/src/output_dead_code.rs:1539-1553 | crates/types/src/output_dead_code.rs:1614-1628 | crates/types/src/output_dead_code.rs:1689-1703 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (14 lines × 3) crates/types/src/output_dead_code.rs:1329— crates/types/src/output_dead_code.rs:1329-1342 | crates/types/src/output_dead_code.rs:1426-1439 | crates/types/src/output_dead_code.rs:2976-2989 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (14 lines × 7) crates/types/src/output_dead_code.rs:528— crates/types/src/output_dead_code.rs:528-541 | crates/types/src/output_dead_code.rs:755-768 | crates/types/src/output_dead_code.rs:999-1012 | crates/types/src/output_dead_code.rs:1537-1550 | crates/types/src/output_dead_code.rs:1612-1625 | crates/types/src/output_dead_code.rs:1687-1700 | crates/types/src/output_dead_code.rs:2885-2898 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (12 lines × 5) crates/engine/src/health/result.rs:676— crates/engine/src/health/result.rs:676-687 | crates/engine/src/health/result.rs:757-768 | crates/engine/src/health/result.rs:790-801 | crates/engine/src/health/result.rs:823-834 | crates/engine/src/health/result.rs:862-873 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8 lines × 5) crates/cli/src/report/human/check.rs:3162— crates/cli/src/report/human/check.rs:3162-3169 | crates/cli/src/report/human/check.rs:3283-3290 | crates/cli/src/report/human/check.rs:3330-3337 | crates/cli/src/report/human/check.rs:3368-3375 | crates/cli/src/report/human/check.rs:3412-3419 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (15–16 lines × 4) crates/core/src/analyze/unused_deps_tests/dev_dep_in_prod.rs:37— crates/core/src/analyze/unused_deps_tests/dev_dep_in_prod.rs:37-51 | crates/core/src/analyze/unused_deps_tests/helpers.rs:154-168 | crates/core/src/analyze/unused_deps_tests/unlisted_deps.rs:1244-1258 | crates/core/src/analyze/unused_deps_tests/unresolved_imports.rs:1380-1395 — 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 4 call sites, so a change lands once.
Type Safety — 177 typed · 240 plain JS — the untyped files are REDACTED, action/tests/install-verification-timeout.test.mjs, crates/napi/loader.js, crates/napi/scripts/write-dts-entry.mjs, crates/napi/test.mjs, crates/napi/type-aware-command.js (+234 more).
R10 · Code Duplication· Duplicated block with local edits (51 matched lines × 2 locations) · ×1
Duplicated block with local edits (51 matched lines × 2 locations) REDACTED:58— REDACTED:58 · npm/fallow-similar-code/scripts/run-binary.js:99 — the two spans are one implementation copied and then locally edited — 360 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (48 matched lines × 2 locations) · ×1
Duplicated block with local edits (48 matched lines × 2 locations) scripts/generate-agent-adapters.mjs:106— scripts/generate-agent-adapters.mjs:106 · scripts/generate-agent-adapters.mjs:310 — the two spans are one implementation copied and then locally edited — 420 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (44 matched lines × 2 locations) · ×1
Duplicated block with local edits (44 matched lines × 2 locations) editors/vscode/src/diagnosticMute.ts:206— editors/vscode/src/diagnosticMute.ts:206 · editors/vscode/src/findingId.ts:27 — the two spans are one implementation copied and then locally edited — 253 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (40 lines × 2 locations) scripts/styling-corpus-smoke.mjs:204— scripts/styling-corpus-smoke.mjs:204 · scripts/styling-pr-smoke.mjs:130 — 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 (25 lines × 2 locations) editors/vscode/src/treeView.ts:685— editors/vscode/src/treeView.ts:685 · editors/vscode/src/treeView.ts:713 — 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 (23 lines × 2 locations) REDACTED:656— REDACTED:656 · REDACTED:691 — 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 (22 lines × 2 locations) scripts/generate-agent-docs.mjs:999— scripts/generate-agent-docs.mjs:999 · scripts/generate-agent-docs.mjs:1031 — 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 (21 lines × 2 locations) tools/type-aware-sidecar/src/project-state.mjs:129— tools/type-aware-sidecar/src/project-state.mjs:129 · tools/type-aware-sidecar/src/project-state.mjs:176 — 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 (20 lines × 2 locations) scripts/signing-migration-receipt.mjs:12— scripts/signing-migration-receipt.mjs:12 · scripts/signing-migration-receipt.mjs:70 — 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 (15 lines × 2 locations) scripts/type-aware-corpus.mjs:970— scripts/type-aware-corpus.mjs:970 · scripts/type-aware-corpus.mjs:1094 — 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 (14 lines × 2 locations) editors/vscode/src/commands.ts:168— editors/vscode/src/commands.ts:168 · editors/vscode/src/license.ts:47 — 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 (13 lines × 2 locations) editors/vscode/src/audit-utils.ts:320— editors/vscode/src/audit-utils.ts:320 · editors/vscode/src/workspacePicker-utils.ts:53 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication· Duplicated block with local edits (13 matched lines × 2 locations) · ×1
Duplicated block with local edits (13 matched lines × 2 locations) scripts/check-osv-ignores.mjs:75— scripts/check-osv-ignores.mjs:75 · scripts/generate-vex.mjs:12 — the two spans are one implementation copied and then locally edited — 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (11 lines × 3 locations) npm/fallow/scripts/verify-binary.js:69— npm/fallow/scripts/verify-binary.js:69 · npm/fallow/scripts/verify-binary.js:84 · npm/fallow/scripts/verify-binary.js:153 — all 3 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.
R10 · Code Duplication· Duplicated block with local edits (10 matched lines × 2 locations) · ×1
Duplicated block with local edits (10 matched lines × 2 locations) editors/vscode/src/workspacePicker-utils.ts:154— editors/vscode/src/workspacePicker-utils.ts:154 · editors/vscode/src/workspacePicker-utils.ts:166 — the two spans are one implementation copied and then locally edited — 66 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Complex function (anonymous) (cyclomatic 58, cognitive 96) viz-frontend/src/graph/annotations.ts:606— (anonymous) has cyclomatic complexity 58 and cognitive complexity 96; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 36, cognitive 56) · ×1
Complex function main (cyclomatic 36, cognitive 56) scripts/coverage-producer-refresh.mjs:175— main has cyclomatic complexity 36 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 35, cognitive 59) viz-frontend/src/graph/render.ts:462— (anonymous) has cyclomatic complexity 35 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 34, cognitive 37) viz-frontend/src/panel.ts:352— (anonymous) has cyclomatic complexity 34 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 32, cognitive 43) viz-frontend/src/panel.ts:2356— (anonymous) has cyclomatic complexity 32 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 31, cognitive 68) REDACTED:540— (anonymous) has cyclomatic complexity 31 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function supersededCancellations (cyclomatic 31, cognitive 43) scripts/ship-wait-checks.mjs:524— supersededCancellations has cyclomatic complexity 31 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 31, cognitive 32) scripts/check-miri-cfg.mjs:124— (anonymous) has cyclomatic complexity 31 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 29, cognitive 26) editors/vscode/src/statusBar-utils.ts:72— (anonymous) has cyclomatic complexity 29 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function validateEntry (cyclomatic 29, cognitive 23) editors/vscode/scripts/vsix-inventory.mjs:24— validateEntry has cyclomatic complexity 29 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function currentRollupChecks (cyclomatic 25, cognitive 44) scripts/ship-wait-checks.mjs:603— currentRollupChecks has cyclomatic complexity 25 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 25, cognitive 36) viz-frontend/src/graph/render.ts:226— (anonymous) has cyclomatic complexity 25 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 25, cognitive 30) viz-frontend/src/treemap.ts:428— (anonymous) has cyclomatic complexity 25 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function validateFallowReport (cyclomatic 25, cognitive 27) scripts/semantic-clone-conformance.mjs:226— validateFallowReport has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 23, cognitive 50) viz-frontend/src/panel.ts:488— (anonymous) has cyclomatic complexity 23 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 23, cognitive 22) viz-frontend/src/data.ts:233— (anonymous) has cyclomatic complexity 23 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 22, cognitive 21) viz-frontend/src/treemap.ts:755— (anonymous) has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function parseAllocation (cyclomatic 22, cognitive 12) REDACTED:15— parseAllocation has cyclomatic complexity 22 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
viz-frontend/src/panel.ts: 2636 lines of code viz-frontend/src/panel.ts:1— viz-frontend/src/panel.ts has 2636 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· tools/type-aware-sidecar/src/semantic.mjs · ×1
tools/type-aware-sidecar/src/semantic.mjs: 2018 lines of code tools/type-aware-sidecar/src/semantic.mjs:1— tools/type-aware-sidecar/src/semantic.mjs has 2018 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· editors/vscode/src/extension.ts · ×1
editors/vscode/src/extension.ts: 1184 lines of code editors/vscode/src/extension.ts:1— editors/vscode/src/extension.ts has 1184 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· editors/vscode/src/commands.ts · ×1
editors/vscode/src/commands.ts: 1180 lines of code editors/vscode/src/commands.ts:1— editors/vscode/src/commands.ts has 1180 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· editors/vscode/src/download.ts · ×1
editors/vscode/src/download.ts: 1144 lines of code editors/vscode/src/download.ts:1— editors/vscode/src/download.ts has 1144 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· viz-frontend/src/treemap.ts · ×1
viz-frontend/src/treemap.ts: 1074 lines of code viz-frontend/src/treemap.ts:1— viz-frontend/src/treemap.ts has 1074 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· viz-frontend/src/graph/annotations.ts · ×1
viz-frontend/src/graph/annotations.ts: 1050 lines of code viz-frontend/src/graph/annotations.ts:1— viz-frontend/src/graph/annotations.ts has 1050 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· viz-frontend/src/graph/build.ts · ×1
viz-frontend/src/graph/build.ts: 953 lines of code viz-frontend/src/graph/build.ts:1— viz-frontend/src/graph/build.ts has 953 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
viz-frontend/src/data.ts: 876 lines of code viz-frontend/src/data.ts:1— viz-frontend/src/data.ts has 876 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
crates/napi/test.mjs: 874 lines of code crates/napi/test.mjs:1— crates/napi/test.mjs has 874 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· viz-frontend/src/graph/render.ts · ×1
viz-frontend/src/graph/render.ts: 829 lines of code viz-frontend/src/graph/render.ts:1— viz-frontend/src/graph/render.ts has 829 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· editors/vscode/src/treeView.ts · ×1
editors/vscode/src/treeView.ts: 826 lines of code editors/vscode/src/treeView.ts:1— editors/vscode/src/treeView.ts has 826 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
REDACTED: 751 lines of code REDACTED:1— REDACTED has 751 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· viz-frontend/src/graph/shared.ts · ×1
viz-frontend/src/graph/shared.ts: 693 lines of code viz-frontend/src/graph/shared.ts:1— viz-frontend/src/graph/shared.ts has 693 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
viz-frontend/src/main.ts: 663 lines of code viz-frontend/src/main.ts:1— viz-frontend/src/main.ts has 663 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· viz-frontend/src/graph/ego.ts · ×1
viz-frontend/src/graph/ego.ts: 622 lines of code viz-frontend/src/graph/ego.ts:1— viz-frontend/src/graph/ego.ts has 622 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· tools/mutation-runner/src/adapters/vitest.mjs · ×1
tools/mutation-runner/src/adapters/vitest.mjs: 611 lines of code tools/mutation-runner/src/adapters/vitest.mjs:1— tools/mutation-runner/src/adapters/vitest.mjs has 611 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· editors/vscode/src/complexityDecorations.ts · ×1
editors/vscode/src/complexityDecorations.ts: 481 lines of code editors/vscode/src/complexityDecorations.ts:1— editors/vscode/src/complexityDecorations.ts has 481 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· tools/type-aware-sidecar/src/protocol.mjs · ×1
tools/type-aware-sidecar/src/protocol.mjs: 466 lines of code tools/type-aware-sidecar/src/protocol.mjs:1— tools/type-aware-sidecar/src/protocol.mjs has 466 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· editors/vscode/src/analysis-utils.ts · ×1
editors/vscode/src/analysis-utils.ts: 465 lines of code editors/vscode/src/analysis-utils.ts:1— editors/vscode/src/analysis-utils.ts has 465 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· editors/vscode/src/client.ts · ×1
editors/vscode/src/client.ts: 445 lines of code editors/vscode/src/client.ts:1— editors/vscode/src/client.ts has 445 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· tools/type-aware-sidecar/src/namespace-uses.mjs · ×1
tools/type-aware-sidecar/src/namespace-uses.mjs: 439 lines of code tools/type-aware-sidecar/src/namespace-uses.mjs:1— tools/type-aware-sidecar/src/namespace-uses.mjs has 439 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· editors/vscode/src/diagnosticFilter.ts · ×1
editors/vscode/src/diagnosticFilter.ts: 432 lines of code editors/vscode/src/diagnosticFilter.ts:1— editors/vscode/src/diagnosticFilter.ts has 432 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· editors/vscode/src/license.ts · ×1
editors/vscode/src/license.ts: 407 lines of code editors/vscode/src/license.ts:1— editors/vscode/src/license.ts has 407 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
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 scripts/verify-release-ci.test.mjs:385— This repository declares test tooling, and the ✓ above records that declaration — but scripts/verify-release-ci.test.mjs and 14 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.
Unused dependency '@faker-js/faker' — Declared in assets/demo-project/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
X17 · Uncapped recursion over a caller-supplied document· Recursive walk over a caller-supplied document has no depth cap · ×1
Recursive walk over a caller-supplied document has no depth cap viz-frontend/src/payload.ts:50— `decodeTables` is exported and takes `value: unknown` from its caller, and it calls itself at line 50 (`decodeTables`) with a piece of `value` (and at line 57) — and nowhere in `decodeTables` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `decodeTables` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Swallowed exception (caught, then discarded) editors/vscode/src/download.ts:257— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Interpolated log message defeats structured logging crates/graph/src/resolve/dynamic_imports.rs:234— `warn!` at line 234 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/graph/src/resolve/specifier.rs:316— `warn!` at line 316 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/graph/src/resolve/types.rs:560— `debug!` at line 560 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/graph/src/cache/store.rs:106— `debug!` at line 106 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/graph/src/cache/store.rs:110— `debug!` at line 110 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/graph/src/cache/store.rs:117— `debug!` at line 117 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/graph/src/cache/store.rs:124— `debug!` at line 124 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/engine/src/churn.rs:1016— `warn!` at line 1016 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/engine/src/churn.rs:1023— `warn!` at line 1023 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/engine/src/clock.rs:188— `warn!` at line 188 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/engine/src/discover.rs:403— `warn!` at line 403 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/engine/src/session.rs:1550— `warn!` at line 1550 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/engine/src/health/hotspots.rs:177— `warn!` at line 177 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/engine/src/health/hotspots.rs:224— `warn!` at line 224 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/engine/src/health/hotspots.rs:231— `warn!` at line 231 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/engine/src/duplication_detector/mod.rs:524— `warn!` at line 524 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/core/src/lib.rs:382— `warn!` at line 382 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/core/src/lib.rs:1270— `warn!` at line 1270 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/core/src/lib.rs:1276— `debug!` at line 1276 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/core/src/lib.rs:1723— `warn!` at line 1723 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/core/src/lib.rs:2209— `debug!` at line 2209 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/core/src/suppress.rs:405— `warn!` at line 405 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/core/src/plugins/manifest_entries.rs:469— `warn!` at line 469 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/core/src/plugins/manifest_entries.rs:474— `warn!` at line 474 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/core/src/plugins/manifest_entries.rs:479— `warn!` at line 479 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Silent fallback default on Err crates/api/src/mutation/transport.rs:251— `stderr_tail` turns every `Err` into `String::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 crates/api/src/diff_risk/mod.rs:128— `detect` turns every `Err` into `DiffRiskReport::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.
Silent fallback default on Err crates/api/src/mutation/node_args.rs:40— `node_test_args` 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 crates/api/src/mutation/result_cache/mod.rs:170— `extends_of` 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 crates/api/src/routing.rs:72— `compute_routing_from_churn` turns every `Err` into `RoutingFacts::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.
Silent fallback default on Err crates/cli/src/audit.rs:1998— `compute_brief_diff_evidence` turns every `Err` into `BriefDiffEvidence::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.
Silent fallback default on Err crates/cli/src/audit_cache.rs:423— `list_snapshot_files` 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 crates/cli/src/base_worktree.rs:1170— `scan_all_reusable_cache_paths` 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 crates/cli/src/base_worktree.rs:1208— `scan_cache_paths_with_hex_suffix` 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 crates/cli/src/coverage/analyze.rs:668— `instrumenter_functions_for_file` 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 crates/cli/src/coverage/setup_cloud.rs:396— `detect_deploy_workflows` 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 crates/cli/src/coverage/upload_inventory.rs:380— `collect_churn` turns every `Err` into `BTreeMap::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 crates/cli/src/health/coverage.rs:554— `sidecar_package_version_key` 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 crates/cli/src/health/coverage.rs:571— `parse_sidecar_version_key` turns every `Err` into `0` — 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 crates/cli/src/impact.rs:774— `migrate_legacy_store` turns every `Err` into `ImpactStore::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.
Silent fallback default on Err crates/cli/src/impact.rs:2538— `render_json_with_style` turns every `Err` into `"{\"error\":\"failed to serialize impact report\"}".to_owned()` — 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 crates/cli/src/impact.rs:2684— `render_cross_repo_json_with_style` turns every `Err` into `"{\"error\":\"failed to serialize cross-repo impact report\"}".to_owned()` — 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 crates/cli/src/init.rs:275— `read_pnpm_workspace_patterns` 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 crates/cli/src/inspect.rs:763— `json_display` turns every `Err` into `"<unprintable>".to_string()` — 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 crates/cli/src/security.rs:924— `render_security_github` turns every `Err` into `String::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 crates/cli/src/security.rs:3214— `render_sarif` turns every `Err` into `"{\"error\":\"failed to serialize sarif\"}".to_owned()` — 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 crates/cli/src/walkthrough_state.rs:89— `load_viewed_state` turns every `Err` into `ViewedState::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.
Silent fallback default on Err crates/config/src/config/entry_effect.rs:32— `ineffective` 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 crates/config/src/external_plugin/mod.rs:965— `root_plugin_files` 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 crates/config/src/external_plugin/mod.rs:984— `plugin_files_in_dir` 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.
Duplicated predicate scripts/compare-binaries.mjs:92— `!Number.isFinite(opts.timeoutMs) || opts.timeoutMs <= 0` appears character-identically in 2 files — scripts/compare-binaries.mjs, scripts/styling-corpus-smoke.mjs. 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 npm/fallow-similar-code/scripts/verify-binary.js:63— `!manifest || typeof manifest !== "object"` appears character-identically in 2 files — npm/fallow-similar-code/scripts/verify-binary.js, npm/fallow/scripts/verify-binary.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 viz-frontend/src/graph/annotations.ts:49— `!node || node.x == null || node.y == null` appears character-identically in 5 files — viz-frontend/src/graph/annotations.ts, viz-frontend/src/graph/ego.ts, viz-frontend/src/graph/interact.ts, viz-frontend/src/graph/render.ts. 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 REDACTED:21— `Number.isSafeInteger(value) && value > 0` appears character-identically in 3 files — REDACTED, REDACTED, tools/mutation-runner/src/adapters/common.mjs. 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 scripts/generate-all.mjs:435— `argv.includes("--help") || argv.includes("-h")` appears character-identically in 2 files — scripts/generate-all.mjs, scripts/vendor-skills.mjs. 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 REDACTED:70— `child.exitCode !== null || child.signalCode !== null` appears character-identically in 2 files — REDACTED, npm/fallow-similar-code/scripts/run-binary.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 viz-frontend/src/graph/build.ts:900— `cluster.isolated && anyConnected && !gvs.standaloneOpen` appears character-identically in 2 files — viz-frontend/src/graph/build.ts, viz-frontend/src/graph/interact.ts. 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 viz-frontend/src/graph/render.ts:472— `clusters[node.cluster].isolated && !gvs.standaloneOpen` appears character-identically in 2 files — viz-frontend/src/graph/render.ts, viz-frontend/src/graph/shared.ts. 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 scripts/check-crate-boundaries.mjs:115— `entry.isFile() && entry.name.endsWith(".rs")` appears character-identically in 2 files — scripts/check-crate-boundaries.mjs, scripts/check-miri-cfg.mjs. 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 viz-frontend/src/data.ts:147— `file.status === "unused" || file.unused_export_count > 0` appears character-identically in 2 files — viz-frontend/src/data.ts, viz-frontend/src/lenses.ts. 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 viz-frontend/src/graph/annotations.ts:340— `node && node.x != null && node.y != null` appears character-identically in 2 files — viz-frontend/src/graph/annotations.ts, viz-frontend/src/graph/build.ts. 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 scripts/styling-corpus-smoke.mjs:540— `proc.error && proc.error.code === "ETIMEDOUT"` appears character-identically in 2 files — scripts/styling-corpus-smoke.mjs, scripts/styling-pr-smoke.mjs. 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 editors/vscode/scripts/package-type-aware.mjs:95— `process.argv[1] && resolve(process.argv[1]) === resolve(scriptPath)` appears character-identically in 3 files — editors/vscode/scripts/package-type-aware.mjs, editors/vscode/scripts/package-vsix-variants.mjs, editors/vscode/scripts/verify-packaged-type-aware.mjs. 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 tools/type-aware-sidecar/src/protocol.mjs:367— `query.operation === "api-surface" || query.operation === "type-coupling"` appears character-identically in 2 files — tools/type-aware-sidecar/src/protocol.mjs, tools/type-aware-sidecar/src/semantic.mjs. 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 editors/vscode/src/commands.ts:963— `relative.startsWith("..") || path.isAbsolute(relative)` appears character-identically in 2 files — editors/vscode/src/commands.ts, scripts/scaffold-analyzer-plan.mjs. 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 scripts/coverage-producer-conformance.mjs:652— `result.status !== 0 && result.status !== 1` appears character-identically in 2 files — scripts/coverage-producer-conformance.mjs, scripts/coverage-producer-refresh.mjs. 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 editors/vscode/src/audit-utils.ts:331— `typeof parsed !== "object" || parsed === null` appears character-identically in 3 files — editors/vscode/src/audit-utils.ts, editors/vscode/src/license-utils.ts, editors/vscode/src/workspacePicker-utils.ts. 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 npm/fallow/scripts/lazy-verify.js:329— `typeof platformPkgDir !== "string" || platformPkgDir.length === 0` appears character-identically in 2 files — npm/fallow/scripts/lazy-verify.js, npm/fallow/scripts/sentinel-path.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 editors/vscode/src/diagnosticFilter.ts:30— `typeof value !== "object" || value === null` appears character-identically in 2 files — editors/vscode/src/diagnosticFilter.ts, viz-frontend/src/lenses.ts. 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 tools/type-aware-sidecar/src/protocol.mjs:83— `typeof value === "object" && value !== null && !Array.isArray(value)` appears character-identically in 3 files — tools/type-aware-sidecar/src/protocol.mjs, viz-frontend/src/data.ts, viz-frontend/src/payload.ts. 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 editors/vscode/src/openFileCommand.ts:31— `typeof value === "string" && value.length > 0` appears character-identically in 3 files — editors/vscode/src/openFileCommand.ts, scripts/generate-all.mjs, tools/mutation-runner/src/runtime/child.mjs. 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 REDACTED:23— `value !== null && typeof value === "object" && !Array.isArray(value)` appears character-identically in 3 files — REDACTED, scripts/type-aware-corpus.mjs, tools/mutation-runner/src/protocol.mjs. 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 scripts/compare-binaries.mjs:156— `value === null || typeof value !== "object"` appears character-identically in 3 files — scripts/compare-binaries.mjs, scripts/generate-all.mjs, tools/type-aware-sidecar/src/semantic.mjs. 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 crates/extract/src/visitor/helpers.rs:1935— `!function.r#async && !function.generator` appears character-identically in 4 files — crates/extract/src/visitor/helpers.rs, crates/extract/src/visitor/visit_impl_callback_properties.rs, crates/extract/src/visitor/visit_impl_factory_properties.rs, crates/extract/src/visitor/visit_impl_projections.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 crates/core/src/analyze/members/mod.rs:295— `!member.contains('*') && !member.contains('?')` appears character-identically in 2 files — crates/core/src/analyze/members/mod.rs, crates/core/src/plugins/ionic.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.
R7 · Dead Code· Unused module-local declaration 'CaptureMarker' · ×11
Unused module-local declaration 'CaptureMarker' tests/fixtures/class-value-review-builtin-array-control-capture-on/src/index.ts:2— 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 'CaptureMarker' tests/fixtures/class-value-review-builtin-readonly-array-control-capture-on/src/index.ts:2— 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 'CaptureMarker' tests/fixtures/class-value-review-conditional-alternate-read-capture-on/src/index.ts:2— 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 'CaptureMarker' tests/fixtures/class-value-review-conditional-postjoin-capture-on/src/index.ts:2— 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 'CaptureMarker' tests/fixtures/class-value-review-conditional-untouched-control-capture-on/src/index.ts:2— 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 'CaptureMarker' tests/fixtures/class-value-review-ordinary-alias-untouched-control-capture-on/src/index.ts:2— 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 'CaptureMarker' tests/fixtures/class-value-review-ordinary-alias-write-control-capture-on/src/index.ts:2— 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 'CaptureMarker' tests/fixtures/class-value-review-shadow-array-capture-on/src/index.ts:2— 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 'CaptureMarker' tests/fixtures/class-value-review-shadow-readonly-array-capture-on/src/index.ts:2— 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 'CaptureMarker' tests/fixtures/class-value-review-typed-alias-untouched-control-capture-on/src/index.ts:2— 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 'CaptureMarker' tests/fixtures/class-value-review-typed-alias-write-capture-on/src/index.ts:2— 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.
No direct assertions: spies on one member tests/fixtures/namespace-spy-call-member/src/bun-target.test.ts:4— No conventional assertion call was detected, and 8 of 8 tests in `tests/fixtures/namespace-spy-call-member` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
No direct assertions: spies on one member tests/fixtures/namespace-spy-call-member/src/context-target.test.ts:4— No conventional assertion call was detected, and 8 of 8 tests in `tests/fixtures/namespace-spy-call-member` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
No direct assertions: spies on a computed member tests/fixtures/namespace-spy-call-member/src/dynamic-target.test.ts:6— No conventional assertion call was detected, and 8 of 8 tests in `tests/fixtures/namespace-spy-call-member` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
No direct assertions: spies on one member tests/fixtures/namespace-spy-call-member/src/global-target.test.ts:3— No conventional assertion call was detected, and 8 of 8 tests in `tests/fixtures/namespace-spy-call-member` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
No direct assertions: spies on one member tests/fixtures/namespace-spy-call-member/src/jest-target.test.ts:3— No conventional assertion call was detected, and 8 of 8 tests in `tests/fixtures/namespace-spy-call-member` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
No direct assertions: passes the namespace to a local helper tests/fixtures/namespace-spy-call-member/src/local-target.test.ts:6— No conventional assertion call was detected, and 8 of 8 tests in `tests/fixtures/namespace-spy-call-member` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
No direct assertions: spies on one member tests/fixtures/namespace-spy-call-member/src/node-target.test.ts:4— No conventional assertion call was detected, and 8 of 8 tests in `tests/fixtures/namespace-spy-call-member` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
No direct assertions: spies on one member tests/fixtures/namespace-spy-call-member/src/vitest-target.test.ts:4— No conventional assertion call was detected, and 8 of 8 tests in `tests/fixtures/namespace-spy-call-member` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
Subsumed condition operand crates/engine/src/mutation/tests.rs:454— `math.instrumented_code.contains("return a + b")` can never decide this `||` — every value satisfying `math.instrumented_code.contains("return a + b")` also satisfies `math.instrumented_code.contains("a + b")`, so the `||` chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.
Subsumed condition operand crates/engine/src/health/framework_health.rs:49— `deps.contains("preact")` can never decide this `||` — every value satisfying `deps.contains("preact")` also satisfies `deps.contains("react")`, so the `||` chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.
Subsumed condition operand crates/engine/src/health/framework_health.rs:55— `deps.contains("@vue/runtime-core")` can never decide this `||` — every value satisfying `deps.contains("@vue/runtime-core")` also satisfies `deps.contains("vue")`, so the `||` chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.
Subsumed condition operand crates/engine/src/health/framework_health.rs:61— `deps.contains("@sveltejs/kit")` can never decide this `||` — every value satisfying `deps.contains("@sveltejs/kit")` also satisfies `deps.contains("svelte")`, so the `||` chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.
Subsumed condition operand crates/core/tests/integration_test/issue_463_glob_validation.rs:27— `msg.contains("'..'")` can never decide this `||` — every value satisfying `msg.contains("'..'")` also satisfies `msg.contains("..")`, so the `||` chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.
Subsumed condition operand crates/core/src/analyze/unprovided_inject.rs:113— `input.declared_deps.contains("@vue/runtime-core")` can never decide this `||` — every value satisfying `input.declared_deps.contains("@vue/runtime-core")` also satisfies `input.declared_deps.contains("vue")`, so the `||` chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.
Subsumed condition operand crates/core/src/analyze/unrendered_component.rs:127— `declared_deps.contains("@sveltejs/kit")` can never decide this `||` — every value satisfying `declared_deps.contains("@sveltejs/kit")` also satisfies `declared_deps.contains("svelte")`, so the `||` chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.
Mock-dominated test: response shaping tests/fixtures/mutation-plan-response/src/response.test.ts:5— This test sets up 3 test doubles (for example `vi.fn`) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Mock-dominated test: fires each unique provider once to re-pull open documents editors/vscode/test/client.test.ts:495— This test sets up 3 test doubles (for example `vi.fn`) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
Mock-dominated test: skips non-file documents (output channels, git, etc.) editors/vscode/test/client.test.ts:515— This test sets up 3 test doubles (for example `vi.fn`) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
README/code drift docs/environment-variables.md:92— docs/environment-variables.md names TypeScript 7, but the manifest declares `typescript` ^5.4.0. Checked without a model against the repository: its files and folders, the scripts and dependencies of every REDACTED, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/development/quality-gates.md:89— docs/development/quality-gates.md names Vitest 4, but the manifest declares `vitest` 5.0.5. Checked without a model against the repository: its files and folders, the scripts and dependencies of every REDACTED, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
Hand-rolled JSON/XML parsing via regex REDACTED:86— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex REDACTED:105— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too.
D10 · Test Quality· Test project verifies nothing · ×1
Test project verifies nothing: tests/fixtures/namespace-spy-call-member tests/fixtures/namespace-spy-call-member/src/bun-target.test.ts:4— No conventional assertion call was detected in 8 of 8 tests in `tests/fixtures/namespace-spy-call-member` — the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail.
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/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 8 of 27 project(s) overshoot their size bounds, lowering Project Cohesion to 4.1/10. The most over is `crates/cli` (176550 LoC, 485 module-visible types across 18 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
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 9/10 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `crates/multicall`.
R7 · Dead Code· Unused module-local declaration 'deprecated' · ×1
Unused module-local declaration 'deprecated' assets/demo-project/src/components/Button.tsx:8— 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 'check' · ×1
Unused module-local declaration 'check' assets/demo-project/src/components/Button.tsx: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 'loadDrawer' · ×1
Unused module-local declaration 'loadDrawer' tests/fixtures/dynamic-import-local-loader/src/index.ts:24— 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 'ActiveOnly' · ×1
Unused module-local declaration 'ActiveOnly' tests/fixtures/enum-type-level/src/index.ts:7— 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 'links' · ×1
Unused module-local declaration 'links' tests/fixtures/issue-955-nuxt-ui-iconify-script/app/layouts/default.vue:6— 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 'DeadEl' · ×1
Unused module-local declaration 'DeadEl' tests/fixtures/lit-unrendered-element/src/dead-el.ts:6— 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 'HtmlEl' · ×1
Unused module-local declaration 'HtmlEl' tests/fixtures/lit-unrendered-element/src/html-el.ts:7— 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 'MyApp' · ×1
Unused module-local declaration 'MyApp' tests/fixtures/lit-unrendered-element/src/my-app.ts:6— 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 'OptEl' · ×1
Unused module-local declaration 'OptEl' tests/fixtures/lit-unrendered-element/src/opt-el.ts:7— 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 'UsedEl' · ×1
Unused module-local declaration 'UsedEl' tests/fixtures/lit-unrendered-element/src/used-el.ts:6— 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 'Local' · ×1
Unused module-local declaration 'Local' tests/fixtures/nuxt-script-auto-imports/pages/index.vue:16— 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.
X5 · Nullable reference types· Strict null checking is not enabled everywhere the repository type-checks · ×1
Strict null checking is not enabled everywhere the repository type-checks — 173/200 of this repository's type-checking configuration(s) turn on strict null checking (`"strict": true`, or `"strictNullChecks": true`). A configuration that states neither is counted as OFF, because off is tsc's own default; a solution-style one whose `"files"` is empty and whose `"references"` point at other projects is in neither number, because it checks no source itself. Where it is off, `string` admits `null` and `undefined`: passing a value that is null compiles silently and throws on the first property access.
Silent fallback default on parse failure .claude/hooks/pre-bash-guard.py:31— `main` returns `0` when `json.JSONDecodeError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. 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 handler or in the docstring, and the row stops firing.
Outdated: deser-value — `deser-value` is locked at 0.10.1 but 0.10.2 is the current stable release on crates.io, and it already satisfies the `"0.10"` requirement declared in crates/config/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p deser-value` and commit the updated REDACTED.
Outdated: deser-yaml — `deser-yaml` is locked at 0.10.1 but 0.10.2 is the current stable release on crates.io, and it already satisfies the `"0.10"` requirement declared in crates/config/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p deser-yaml` and commit the updated REDACTED.
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 crates/api/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 crates/cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p ignore` and commit the updated REDACTED.
Outdated: napi — `napi` is locked at 3.14.2 but 3.15.0 is the current stable release on crates.io, and it already satisfies the `"3"` requirement declared in crates/napi/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p napi` and commit the updated REDACTED.
Outdated: napi-derive — `napi-derive` is locked at 3.6.12 but 3.6.13 is the current stable release on crates.io, and it already satisfies the `"3"` requirement declared in crates/napi/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p napi-derive` and commit the updated REDACTED.
Outdated: notify — `notify` is locked at 8.2.0 but 8.2.1 is the current stable release on crates.io, and it already satisfies the `"8"` requirement declared in crates/cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p notify` and commit the updated REDACTED.
Outdated: open — `open` is locked at 5.4.4 but 5.4.5 is the current stable release on crates.io, and it already satisfies the `"5"` requirement declared in crates/cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p open` and commit the updated REDACTED.
Outdated: rmcp — `rmcp` is locked at 3.6.0 but 3.8.0 is the current stable release on crates.io, and it already satisfies the `"3.1"` requirement declared in crates/mcp/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p rmcp` and commit the updated REDACTED.
Outdated: rustix — `rustix` is locked at 1.1.5 but 1.1.6 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p rustix` and commit the updated REDACTED.
Outdated: similar — `similar` is locked at 3.2.0 but 3.2.1 is the current stable release on crates.io, and it already satisfies the `"3"` requirement declared in crates/cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p similar` and commit the updated REDACTED.
Outdated: tokio — `tokio` is locked at 1.53.3 but 1.54.1 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/lsp/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p tokio` and commit the updated REDACTED.
Outdated: toml — `toml` is locked at 1.1.6+spec-1.1.0 but 1.1.8+spec-1.1.0 is the current stable release on crates.io, and it already satisfies the `"1.1"` requirement declared in fuzz/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p toml` and commit the updated REDACTED.
Outdated: toml_edit — `toml_edit` is locked at 0.25.15+spec-1.1.0 but 0.25.17+spec-1.1.0 is the current stable release on crates.io, and it already satisfies the `"0.25"` requirement declared in crates/cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p toml_edit` 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 crates/cli/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): keeps case-different physical files distinct when the filesystem supports them tools/type-aware-sidecar/test/sidecar.test.mjs:243— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): todo later tools/mutation-runner/test/fixtures/node-basic/test/math.test.ts:33— Skipped with a documented reason — a deferral, not lazy debt: declared with test.todo — a placeholder that registers a name and runs nothing
Skipped (documented): todo later tools/mutation-runner/test/fixtures/bun-basic/test/math.test.ts:33— Skipped with a documented reason — a deferral, not lazy debt: declared with test.todo — a placeholder that registers a name and runs nothing
Skipped (documented): (unnamed test) tests/fixtures/injected-dependency-class-members/src/index.ts:6— Skipped with a documented reason — a deferral, not lazy debt: declared with no body — a pending test the runner lists but never runs
Skipped (documented): a required output field cannot be dropped at a frozen schema_version REDACTED:758— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): verifyInstalled resolves a global npm install from the fallow package directory npm/fallow/scripts/verify-binary.test.js:377— 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. semgrep could not parse 5 file(s) — `.github/scripts/check-pr-deferrals.mjs`, `crates/cli/viz-assets/viz.js`, `editors/vscode/src/analysis-utils.ts`, `REDACTED`, `viz-frontend/src/panel.ts` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
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 01a18290-674b-7127-9849-5304dccd4443 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 78 · Warnings: 2002 · Recommendations: 156 · Info: 21 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 28-10-2026 @ 12:51 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.