Public report of sanogueralorenzo/sanogueralorenzo.github.io, published 16 November 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.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 16 November 2026, 17:39 UTC · Survey ID cd_eccb32921dc64219b5dafc0b2ae684fd
sanogueralorenzo/sanogueralorenzo.github.io
Measured 16 November 2026, 17:37 UTC, at code version 1de477c
Code coverage is not measured: .NET and JavaScript/TypeScript suite (Unclassified, CouldNotMeasureTestRunFailed).
Boundary Type-Coupling is not measured: Bounded contexts not declared.
Knowledge freshness is not measured: Freshness signal contradicted by repo activity.
Supply-chain provenance & signing is not measured: Supply-chain provenance is not scored (this pipeline releases no artifact), but its build steps or GitHub Actions workflows have integrity defects, or nothing watches its dependency set for published advisories.
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A medium codebase: 48,111 lines of product code in 2 projects, tests not counted · Estimated rebuild effort: about 0.8 person-years · Weakest lens: Production Readiness, 51.8
Findings by how serious they are
20 critical323 serious17 minor
17 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look 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
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
16 November 2026, 17:37 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 the Canine Code Analyzer. It is open to any tool that
implements it, and today the Canine Code Analyzer is the only one that does.
The score is deterministic, which means the same code always gets the same score. We work 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 ▸
51of 51 dimensions measured by tools.
352of 360 findings point to an exact file and line, so you can open each one in the code. The other 8 concern the repository as a whole, such as missing documentation.
51dimensions across 6 lenses, read from 48,111 lines of product code in 2 projects.
sanogueralorenzo/sanogueralorenzo.github.io falls short of our standard for production because we found no automated security scanning of the code, its secrets or its dependencies. It scores 59.0 out of 100 and is rated Adequate, and 19 of its 20 critical findings are security problems.
Production Readiness, at 51.8, is the weakest lens and counts most in the score. The best first step is adding automated security scanning, worth about 6.0 points. Removing the blocking calls comes next, worth about 3.2 points. Raising Production Readiness to 70 would lift the score to about 64.9.
Nine known security holes in the packages the code depends on can be used by attackers. Five pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with, and five weaknesses in the code could be used by an attacker. Updating the vulnerable packages, pinning each tool to an exact version and fixing the weaknesses the scanner points to would close these risks. The data field that is written but never read needs removing.
The product code is 48,111 lines, about €110,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
If Production Readiness rose from 51.8 to 70, the lowest score rated Strong, the score would rise from 59.0 to about 64.9.
Code composition: what the lines of code are
Business logic 57%Supporting code 15%Tests 28%
Rebuild cost: about €110,000 · Estimate
Cost to rebuild
€36,000 to €190,000, for 599 to 1,953 hours of work, about 0.8 person-years for 1 to 2 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.8 at a score of 59. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Medium: 48,111 lines of product code
Comment lines
The estimate prices 38,530 lines. Comment lines count towards the size of 48,111 lines but aren't priced as work.
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: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Add a SAST step to CI running what this repository's stack ships: CodeQL's Swift pack (Swift/Xcode) — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
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.
The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €110,000 to build again, about 0.8 person-years of work. Its weakest lens is Production Readiness, at 51.8 (Adequate). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Add a SAST step to CI running what this repository's stack ships: CodeQL's Swift pack (Swift/Xcode) — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing. Of all the actions in this report, it raises the score most for the work it takes: about 6.0 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
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.1 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 5% to 10% on every change. The history of the code shows how much it changes: about 125,193 lines over the last 90 days, which is about 507,727 lines a year. At that pace, the extra work comes to an estimated 59.2 to 355.3 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
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.
131 modules, with 106 dependencies between them. 3 loops run through 10 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 91 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.
browser_hooks_bridge.slack.runtime uses browser_hooks_bridge.slack.config, so a change to browser_hooks_bridge.slack.config can break browser_hooks_bridge.slack.runtime, while a change to browser_hooks_bridge.slack.runtime can't break browser_hooks_bridge.slack.config.
Position
Below the diagonal: browser_hooks_bridge.slack.runtime uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.androidsteam.display uses com.sanogueralorenzo.androidsteam.input, so a change to com.sanogueralorenzo.androidsteam.input can break com.sanogueralorenzo.androidsteam.display, while a change to com.sanogueralorenzo.androidsteam.display can't break com.sanogueralorenzo.androidsteam.input.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam.display uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.androidsteam.display uses com.sanogueralorenzo.androidsteam.runtime, so a change to com.sanogueralorenzo.androidsteam.runtime can break com.sanogueralorenzo.androidsteam.display, while a change to com.sanogueralorenzo.androidsteam.display can't break com.sanogueralorenzo.androidsteam.runtime.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam.display uses a module listed above it, which is the healthy direction.
15→22 com.sanogueralorenzo.androidsteam.library.LibraryController uses com.sanogueralorenzo.androidsteam.librarypart of a loop✕
Connections
1 pair of types, where a type in com.sanogueralorenzo.androidsteam.library.LibraryController uses a type in com.sanogueralorenzo.androidsteam.library.
com.sanogueralorenzo.androidsteam.library.LibraryController uses com.sanogueralorenzo.androidsteam.library, so a change to com.sanogueralorenzo.androidsteam.library can break com.sanogueralorenzo.androidsteam.library.LibraryController, while a change to com.sanogueralorenzo.androidsteam.library.LibraryController can't break com.sanogueralorenzo.androidsteam.library.
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.
com.sanogueralorenzo.overlay.permissions uses com.sanogueralorenzo.overlay.settings, so a change to com.sanogueralorenzo.overlay.settings can break com.sanogueralorenzo.overlay.permissions, while a change to com.sanogueralorenzo.overlay.permissions can't break com.sanogueralorenzo.overlay.settings.
Position
Below the diagonal: com.sanogueralorenzo.overlay.permissions uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.overlay.permissions uses com.sanogueralorenzo.overlay.ui.components, so a change to com.sanogueralorenzo.overlay.ui.components can break com.sanogueralorenzo.overlay.permissions, while a change to com.sanogueralorenzo.overlay.permissions can't break com.sanogueralorenzo.overlay.ui.components.
Position
Below the diagonal: com.sanogueralorenzo.overlay.permissions uses a module listed above it, which is the healthy direction.
17→26 com.sanogueralorenzo.voice.dictation.DictationSession uses com.sanogueralorenzo.voice.dictationpart of a loop✕
Connections
2 pairs of types, where a type in com.sanogueralorenzo.voice.dictation.DictationSession uses a type in com.sanogueralorenzo.voice.dictation.
com.sanogueralorenzo.voice.dictation.DictationSession uses com.sanogueralorenzo.voice.dictation, so a change to com.sanogueralorenzo.voice.dictation can break com.sanogueralorenzo.voice.dictation.DictationSession, while a change to com.sanogueralorenzo.voice.dictation.DictationSession can't break com.sanogueralorenzo.voice.dictation.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
18→33 com.sanogueralorenzo.voice.overlay.OverlayAccessibilityService uses com.sanogueralorenzo.voice.overlaypart of a loop✕
Connections
1 pair of types, where a type in com.sanogueralorenzo.voice.overlay.OverlayAccessibilityService uses a type in com.sanogueralorenzo.voice.overlay.
com.sanogueralorenzo.voice.overlay.OverlayAccessibilityService uses com.sanogueralorenzo.voice.overlay, so a change to com.sanogueralorenzo.voice.overlay can break com.sanogueralorenzo.voice.overlay.OverlayAccessibilityService, while a change to com.sanogueralorenzo.voice.overlay.OverlayAccessibilityService can't break com.sanogueralorenzo.voice.overlay.
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.
tools.agent.src.pi uses tools.agent.src.agent-resources, so a change to tools.agent.src.agent-resources can break tools.agent.src.pi, while a change to tools.agent.src.pi can't break tools.agent.src.agent-resources.
Position
Below the diagonal: tools.agent.src.pi uses a module listed above it, which is the healthy direction.
tools.slack.src.agent_slack.routing uses tools.slack.src.agent_slack.commands, so a change to tools.slack.src.agent_slack.commands can break tools.slack.src.agent_slack.routing, while a change to tools.slack.src.agent_slack.routing can't break tools.slack.src.agent_slack.commands.
Position
Below the diagonal: tools.slack.src.agent_slack.routing uses a module listed above it, which is the healthy direction.
browser_hooks_bridge.slack uses browser_hooks_bridge.slack.runtime, so a change to browser_hooks_bridge.slack.runtime can break browser_hooks_bridge.slack, while a change to browser_hooks_bridge.slack can't break browser_hooks_bridge.slack.runtime.
Position
Below the diagonal: browser_hooks_bridge.slack uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.androidsteam.library uses com.sanogueralorenzo.androidsteam.games, so a change to com.sanogueralorenzo.androidsteam.games can break com.sanogueralorenzo.androidsteam.library, while a change to com.sanogueralorenzo.androidsteam.library can't break com.sanogueralorenzo.androidsteam.games.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam.library uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in com.sanogueralorenzo.androidsteam.library uses a type in com.sanogueralorenzo.androidsteam.library.LibraryController.
com.sanogueralorenzo.androidsteam.library uses com.sanogueralorenzo.androidsteam.library.LibraryController, so a change to com.sanogueralorenzo.androidsteam.library.LibraryController can break com.sanogueralorenzo.androidsteam.library, while a change to com.sanogueralorenzo.androidsteam.library can't break com.sanogueralorenzo.androidsteam.library.LibraryController.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam.library uses a module listed above it, which is the healthy direction.
22→35 com.sanogueralorenzo.androidsteam.library uses com.sanogueralorenzo.androidsteampart of a loop✕
Connections
1 pair of types, where a type in com.sanogueralorenzo.androidsteam.library uses a type in com.sanogueralorenzo.androidsteam.
com.sanogueralorenzo.androidsteam.library uses com.sanogueralorenzo.androidsteam, so a change to com.sanogueralorenzo.androidsteam can break com.sanogueralorenzo.androidsteam.library, while a change to com.sanogueralorenzo.androidsteam.library can't break com.sanogueralorenzo.androidsteam.
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.
com.sanogueralorenzo.androidsteam.session uses com.sanogueralorenzo.androidsteam.input, so a change to com.sanogueralorenzo.androidsteam.input can break com.sanogueralorenzo.androidsteam.session, while a change to com.sanogueralorenzo.androidsteam.session can't break com.sanogueralorenzo.androidsteam.input.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam.session uses a module listed above it, which is the healthy direction.
4 pairs of types, where a type in com.sanogueralorenzo.androidsteam.session uses a type in com.sanogueralorenzo.androidsteam.session.SessionController.
com.sanogueralorenzo.androidsteam.session uses com.sanogueralorenzo.androidsteam.session.SessionController, so a change to com.sanogueralorenzo.androidsteam.session.SessionController can break com.sanogueralorenzo.androidsteam.session, while a change to com.sanogueralorenzo.androidsteam.session can't break com.sanogueralorenzo.androidsteam.session.SessionController.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam.session uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.androidsteam.session uses com.sanogueralorenzo.androidsteam.display, so a change to com.sanogueralorenzo.androidsteam.display can break com.sanogueralorenzo.androidsteam.session, while a change to com.sanogueralorenzo.androidsteam.session can't break com.sanogueralorenzo.androidsteam.display.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam.session uses a module listed above it, which is the healthy direction.
23→35 com.sanogueralorenzo.androidsteam.session uses com.sanogueralorenzo.androidsteampart of a loop✕
Connections
1 pair of types, where a type in com.sanogueralorenzo.androidsteam.session uses a type in com.sanogueralorenzo.androidsteam.
com.sanogueralorenzo.androidsteam.session uses com.sanogueralorenzo.androidsteam, so a change to com.sanogueralorenzo.androidsteam can break com.sanogueralorenzo.androidsteam.session, while a change to com.sanogueralorenzo.androidsteam.session can't break com.sanogueralorenzo.androidsteam.
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.
com.sanogueralorenzo.overlay.di uses com.sanogueralorenzo.overlay.settings, so a change to com.sanogueralorenzo.overlay.settings can break com.sanogueralorenzo.overlay.di, while a change to com.sanogueralorenzo.overlay.di can't break com.sanogueralorenzo.overlay.settings.
Position
Below the diagonal: com.sanogueralorenzo.overlay.di uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.overlay.di uses com.sanogueralorenzo.overlay.permissions, so a change to com.sanogueralorenzo.overlay.permissions can break com.sanogueralorenzo.overlay.di, while a change to com.sanogueralorenzo.overlay.di can't break com.sanogueralorenzo.overlay.permissions.
Position
Below the diagonal: com.sanogueralorenzo.overlay.di uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.overlay.home uses com.sanogueralorenzo.overlay.permissions, so a change to com.sanogueralorenzo.overlay.permissions can break com.sanogueralorenzo.overlay.home, while a change to com.sanogueralorenzo.overlay.home can't break com.sanogueralorenzo.overlay.permissions.
Position
Below the diagonal: com.sanogueralorenzo.overlay.home uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.dictation uses com.sanogueralorenzo.voice.dictation.DictationTranscriber, so a change to com.sanogueralorenzo.voice.dictation.DictationTranscriber can break com.sanogueralorenzo.voice.dictation, while a change to com.sanogueralorenzo.voice.dictation can't break com.sanogueralorenzo.voice.dictation.DictationTranscriber.
Position
Below the diagonal: com.sanogueralorenzo.voice.dictation uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.dictation uses com.sanogueralorenzo.voice.dictation.DictationSession, so a change to com.sanogueralorenzo.voice.dictation.DictationSession can break com.sanogueralorenzo.voice.dictation, while a change to com.sanogueralorenzo.voice.dictation can't break com.sanogueralorenzo.voice.dictation.DictationSession.
Position
Below the diagonal: com.sanogueralorenzo.voice.dictation uses a module listed above it, which is the healthy direction.
tools.agent.src.home-routing uses tools.agent.src.state, so a change to tools.agent.src.state can break tools.agent.src.home-routing, while a change to tools.agent.src.home-routing can't break tools.agent.src.state.
Position
Below the diagonal: tools.agent.src.home-routing uses a module listed above it, which is the healthy direction.
tools.agent.src.home-routing uses tools.agent.src.pi, so a change to tools.agent.src.pi can break tools.agent.src.home-routing, while a change to tools.agent.src.home-routing can't break tools.agent.src.pi.
Position
Below the diagonal: tools.agent.src.home-routing uses a module listed above it, which is the healthy direction.
tools.slack.src.agent_slack.conversation uses tools.slack.src.agent_slack.commands, so a change to tools.slack.src.agent_slack.commands can break tools.slack.src.agent_slack.conversation, while a change to tools.slack.src.agent_slack.conversation can't break tools.slack.src.agent_slack.commands.
Position
Below the diagonal: tools.slack.src.agent_slack.conversation uses a module listed above it, which is the healthy direction.
tools.slack.src.agent_slack.conversation uses tools.slack.src.agent_slack.routing, so a change to tools.slack.src.agent_slack.routing can break tools.slack.src.agent_slack.conversation, while a change to tools.slack.src.agent_slack.conversation can't break tools.slack.src.agent_slack.routing.
Position
Below the diagonal: tools.slack.src.agent_slack.conversation uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.androidsteam.MainActivity uses com.sanogueralorenzo.androidsteam.library, so a change to com.sanogueralorenzo.androidsteam.library can break com.sanogueralorenzo.androidsteam.MainActivity, while a change to com.sanogueralorenzo.androidsteam.MainActivity can't break com.sanogueralorenzo.androidsteam.library.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam.MainActivity uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.androidsteam.setup uses com.sanogueralorenzo.androidsteam.runtime, so a change to com.sanogueralorenzo.androidsteam.runtime can break com.sanogueralorenzo.androidsteam.setup, while a change to com.sanogueralorenzo.androidsteam.setup can't break com.sanogueralorenzo.androidsteam.runtime.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam.setup uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.androidsteam.setup uses com.sanogueralorenzo.androidsteam.setup.SetupController, so a change to com.sanogueralorenzo.androidsteam.setup.SetupController can break com.sanogueralorenzo.androidsteam.setup, while a change to com.sanogueralorenzo.androidsteam.setup can't break com.sanogueralorenzo.androidsteam.setup.SetupController.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam.setup uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.androidsteam.setup uses com.sanogueralorenzo.androidsteam.display, so a change to com.sanogueralorenzo.androidsteam.display can break com.sanogueralorenzo.androidsteam.setup, while a change to com.sanogueralorenzo.androidsteam.setup can't break com.sanogueralorenzo.androidsteam.display.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam.setup uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.androidsteam.setup uses com.sanogueralorenzo.androidsteam.session, so a change to com.sanogueralorenzo.androidsteam.session can break com.sanogueralorenzo.androidsteam.setup, while a change to com.sanogueralorenzo.androidsteam.setup can't break com.sanogueralorenzo.androidsteam.session.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam.setup uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.keyboard uses com.sanogueralorenzo.voice.dictation.DictationSession, so a change to com.sanogueralorenzo.voice.dictation.DictationSession can break com.sanogueralorenzo.voice.keyboard, while a change to com.sanogueralorenzo.voice.keyboard can't break com.sanogueralorenzo.voice.dictation.DictationSession.
Position
Below the diagonal: com.sanogueralorenzo.voice.keyboard uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.keyboard uses com.sanogueralorenzo.voice.dictation, so a change to com.sanogueralorenzo.voice.dictation can break com.sanogueralorenzo.voice.keyboard, while a change to com.sanogueralorenzo.voice.keyboard can't break com.sanogueralorenzo.voice.dictation.
Position
Below the diagonal: com.sanogueralorenzo.voice.keyboard uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.models uses com.sanogueralorenzo.voice.dictation, so a change to com.sanogueralorenzo.voice.dictation can break com.sanogueralorenzo.voice.models, while a change to com.sanogueralorenzo.voice.models can't break com.sanogueralorenzo.voice.dictation.
Position
Below the diagonal: com.sanogueralorenzo.voice.models uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.overlay uses com.sanogueralorenzo.voice.overlay.OverlayAccessibilityService, so a change to com.sanogueralorenzo.voice.overlay.OverlayAccessibilityService can break com.sanogueralorenzo.voice.overlay, while a change to com.sanogueralorenzo.voice.overlay can't break com.sanogueralorenzo.voice.overlay.OverlayAccessibilityService.
Position
Below the diagonal: com.sanogueralorenzo.voice.overlay uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.overlay uses com.sanogueralorenzo.voice.dictation, so a change to com.sanogueralorenzo.voice.dictation can break com.sanogueralorenzo.voice.overlay, while a change to com.sanogueralorenzo.voice.overlay can't break com.sanogueralorenzo.voice.dictation.
Position
Below the diagonal: com.sanogueralorenzo.voice.overlay uses a module listed above it, which is the healthy direction.
tools.agent.src.agent uses tools.agent.src.state, so a change to tools.agent.src.state can break tools.agent.src.agent, while a change to tools.agent.src.agent can't break tools.agent.src.state.
Position
Below the diagonal: tools.agent.src.agent uses a module listed above it, which is the healthy direction.
tools.agent.src.agent uses tools.agent.src.pi, so a change to tools.agent.src.pi can break tools.agent.src.agent, while a change to tools.agent.src.agent can't break tools.agent.src.pi.
Position
Below the diagonal: tools.agent.src.agent uses a module listed above it, which is the healthy direction.
tools.agent.src.agent uses tools.agent.src.home-routing, so a change to tools.agent.src.home-routing can break tools.agent.src.agent, while a change to tools.agent.src.agent can't break tools.agent.src.home-routing.
Position
Below the diagonal: tools.agent.src.agent uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.androidsteam uses com.sanogueralorenzo.androidsteam.setup.SetupController, so a change to com.sanogueralorenzo.androidsteam.setup.SetupController can break com.sanogueralorenzo.androidsteam, while a change to com.sanogueralorenzo.androidsteam can't break com.sanogueralorenzo.androidsteam.setup.SetupController.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.androidsteam uses com.sanogueralorenzo.androidsteam.library.LibraryController, so a change to com.sanogueralorenzo.androidsteam.library.LibraryController can break com.sanogueralorenzo.androidsteam, while a change to com.sanogueralorenzo.androidsteam can't break com.sanogueralorenzo.androidsteam.library.LibraryController.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.androidsteam uses com.sanogueralorenzo.androidsteam.library, so a change to com.sanogueralorenzo.androidsteam.library can break com.sanogueralorenzo.androidsteam, while a change to com.sanogueralorenzo.androidsteam can't break com.sanogueralorenzo.androidsteam.library.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.androidsteam uses com.sanogueralorenzo.androidsteam.session, so a change to com.sanogueralorenzo.androidsteam.session can break com.sanogueralorenzo.androidsteam, while a change to com.sanogueralorenzo.androidsteam can't break com.sanogueralorenzo.androidsteam.session.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.androidsteam uses com.sanogueralorenzo.androidsteam.MainActivity, so a change to com.sanogueralorenzo.androidsteam.MainActivity can break com.sanogueralorenzo.androidsteam, while a change to com.sanogueralorenzo.androidsteam can't break com.sanogueralorenzo.androidsteam.MainActivity.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.androidsteam uses com.sanogueralorenzo.androidsteam.setup, so a change to com.sanogueralorenzo.androidsteam.setup can break com.sanogueralorenzo.androidsteam, while a change to com.sanogueralorenzo.androidsteam can't break com.sanogueralorenzo.androidsteam.setup.
Position
Below the diagonal: com.sanogueralorenzo.androidsteam uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.moonshine uses com.sanogueralorenzo.voice.dictation.DictationTranscriber, so a change to com.sanogueralorenzo.voice.dictation.DictationTranscriber can break com.sanogueralorenzo.voice.moonshine, while a change to com.sanogueralorenzo.voice.moonshine can't break com.sanogueralorenzo.voice.dictation.DictationTranscriber.
Position
Below the diagonal: com.sanogueralorenzo.voice.moonshine uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.moonshine uses com.sanogueralorenzo.voice.dictation, so a change to com.sanogueralorenzo.voice.dictation can break com.sanogueralorenzo.voice.moonshine, while a change to com.sanogueralorenzo.voice.moonshine can't break com.sanogueralorenzo.voice.dictation.
Position
Below the diagonal: com.sanogueralorenzo.voice.moonshine uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.moonshine uses com.sanogueralorenzo.voice.models, so a change to com.sanogueralorenzo.voice.models can break com.sanogueralorenzo.voice.moonshine, while a change to com.sanogueralorenzo.voice.moonshine can't break com.sanogueralorenzo.voice.models.
Position
Below the diagonal: com.sanogueralorenzo.voice.moonshine uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.setup uses com.sanogueralorenzo.voice.dictation, so a change to com.sanogueralorenzo.voice.dictation can break com.sanogueralorenzo.voice.setup, while a change to com.sanogueralorenzo.voice.setup can't break com.sanogueralorenzo.voice.dictation.
Position
Below the diagonal: com.sanogueralorenzo.voice.setup uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.setup uses com.sanogueralorenzo.voice.models, so a change to com.sanogueralorenzo.voice.models can break com.sanogueralorenzo.voice.setup, while a change to com.sanogueralorenzo.voice.setup can't break com.sanogueralorenzo.voice.models.
Position
Below the diagonal: com.sanogueralorenzo.voice.setup uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.setup uses com.sanogueralorenzo.voice.overlay, so a change to com.sanogueralorenzo.voice.overlay can break com.sanogueralorenzo.voice.setup, while a change to com.sanogueralorenzo.voice.setup can't break com.sanogueralorenzo.voice.overlay.
Position
Below the diagonal: com.sanogueralorenzo.voice.setup uses a module listed above it, which is the healthy direction.
tools.agent.src uses tools.agent.src.agent-resources, so a change to tools.agent.src.agent-resources can break tools.agent.src, while a change to tools.agent.src can't break tools.agent.src.agent-resources.
Position
Below the diagonal: tools.agent.src uses a module listed above it, which is the healthy direction.
tools.agent.src uses tools.agent.src.state, so a change to tools.agent.src.state can break tools.agent.src, while a change to tools.agent.src can't break tools.agent.src.state.
Position
Below the diagonal: tools.agent.src uses a module listed above it, which is the healthy direction.
tools.agent.src uses tools.agent.src.home-routing, so a change to tools.agent.src.home-routing can break tools.agent.src, while a change to tools.agent.src can't break tools.agent.src.home-routing.
Position
Below the diagonal: tools.agent.src uses a module listed above it, which is the healthy direction.
tools.agent.src uses tools.agent.src.agent, so a change to tools.agent.src.agent can break tools.agent.src, while a change to tools.agent.src can't break tools.agent.src.agent.
Position
Below the diagonal: tools.agent.src uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.di uses com.sanogueralorenzo.voice.dictation, so a change to com.sanogueralorenzo.voice.dictation can break com.sanogueralorenzo.voice.di, while a change to com.sanogueralorenzo.voice.di can't break com.sanogueralorenzo.voice.dictation.
Position
Below the diagonal: com.sanogueralorenzo.voice.di uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.di uses com.sanogueralorenzo.voice.models, so a change to com.sanogueralorenzo.voice.models can break com.sanogueralorenzo.voice.di, while a change to com.sanogueralorenzo.voice.di can't break com.sanogueralorenzo.voice.models.
Position
Below the diagonal: com.sanogueralorenzo.voice.di uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.di uses com.sanogueralorenzo.voice.overlay, so a change to com.sanogueralorenzo.voice.overlay can break com.sanogueralorenzo.voice.di, while a change to com.sanogueralorenzo.voice.di can't break com.sanogueralorenzo.voice.overlay.
Position
Below the diagonal: com.sanogueralorenzo.voice.di uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.di uses com.sanogueralorenzo.voice.setup, so a change to com.sanogueralorenzo.voice.setup can break com.sanogueralorenzo.voice.di, while a change to com.sanogueralorenzo.voice.di can't break com.sanogueralorenzo.voice.setup.
Position
Below the diagonal: com.sanogueralorenzo.voice.di uses a module listed above it, which is the healthy direction.
com.sanogueralorenzo.voice.home uses com.sanogueralorenzo.voice.setup, so a change to com.sanogueralorenzo.voice.setup can break com.sanogueralorenzo.voice.home, while a change to com.sanogueralorenzo.voice.home can't break com.sanogueralorenzo.voice.setup.
Position
Below the diagonal: com.sanogueralorenzo.voice.home uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 70.4 · Adequate · gated by D1, D2 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
12
High / Critical
A03:2025 — Software Supply Chain Failures
10
High / Critical
Roadmap
Top priorities: Add a SAST step to CI running what this repository's stack ships: CodeQL's Swift pack (Swift/Xcode) — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing; 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; Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Add a SAST step to CI running what this repository's stack ships: CodeQL's Swift pack (Swift/Xcode) — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
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.
Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.
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 — 20
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 — 323
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 — 17
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 17
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
This survey 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. All 51 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.8, the weighted average across measured dimensions.
Every figure here is one of two 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. 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.
What we checked — 51 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, 352 of 360 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D10 Test Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we 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 69 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 53 test source file(s) (.kt, .py) 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.
D12 Dependency Hygiene — not measured this run — We 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. `dotnet list package` did not return usable output (restore or query failed); no outdated/vulnerable/deprecated data to assess. The tool said: `dotnet list package` exited 1 with no output.
D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its crate dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
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-contributor repository — bus factor is not applicable (1 contributor(s) across 3042 commit(s) sampled, automation and bot accounts excluded). Concentration needs a team to concentrate: with one contributor there is nobody to spread the knowledge to, so there is nothing here for the owner to act on.
D17 Explicit Debt — measured, with a gap in what it reached — We measured this, but not all of it. What we 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 1 deducted marker(s) and the 0.1/KLoC density on this row were taken over this repository's .NET projects ALONE: .swift (15,318 lines, 42% of production source) went unread, because every marker collector on this path is reached through a C# workspace. D17's marker collectors need a compiler we do not have for that language, so none of its nine marker kinds were read there. The debt in that source is UNMEASURED — its absence from the score above is a gap in this analyzer's language coverage, not a finding that the code carries none.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we 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.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we 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 kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
D21 Naming Consistency — not measured this run — We 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. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
D22 Internal API Consistency — not measured this run — We 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 per language (docs/plans/deterministic-engine.md, P5; C# and each NeutralApiArms arm pass): 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.
D23 Boundary Type-Coupling — not measured this run — We 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. Large codebase (46,596 production LoC in the .NET projects) with no declared bounded contexts — cross-boundary type coupling is unassessed Bounded contexts cannot be inferred from a codebase that is not physically organised by them (D-321), so with none declared there are no boundaries for the coupling pass to measure across. You can widen what we reach: name this codebase's bounded contexts (≥2 module groups, e.g. per subsystem) so cross-boundary type coupling can 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 — measured, with a gap in what it reached — We measured this, but not all of it. What we 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 source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
D32 Data Compliance (PII/GDPR) — not measured this run — We 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. `games/boats-n-beasts/source/core/OceanWorld.cs`, `games/cozysora/scripts/CozyPlayer.Audio.cs`, `tools/androidsteam/app/src/debug/java/com/sanogueralorenzo/androidsteam/session/LoginProofActivity.kt`, `tools/androidsteam/app/src/main/java/com/sanogueralorenzo/androidsteam/MainActivity.kt`, `tools/androidsteam/app/src/main/java/com/sanogueralorenzo/androidsteam/input/SteamKeys.kt`, … (+21 more) 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.
D34 Knowledge Freshness — not measured this run — We 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. File-level freshness contradicts repo activity: 1287 commits in the last 90 days, yet 33 of 53 significant files carry no living knowledge. Those two readings cannot both be true, so the per-file recency signal is treated as unreliable here and freshness is not scored for this run.
AXB2 Runtime readiness — not measured this run — We 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. `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. (rule: no-root-manifest). The renderer reported: the dev server (`npm run dev`) exited before it served a page. Likely cause (our sandbox): `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read package.json: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered.
AXR1 Runtime accessibility — not measured this run — We 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. Boot via AndroidApp (tools/androidsteam/app). the Android app did not build — `./gradlew :app:assembleDebug` exited 1: curl: (22) The requested URL returned error: 403
FAILURE: Build failed with an exception.
* What went wrong:
Execution failed for task ':app:buildProot'.
> Process 'command 'bash'' finished with non…; runtime evidence skipped (launch chosen because tools/androidsteam/app/build.gradle.kts applies the Android application plugin and tools/androidsteam/gradlew builds it).
IC1 Incompleteness & stubs — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we 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 reads a prose claim (a path, a setting, a variable, a route, a version, a project, an install, a bare project name in a command) only in text identified as English: the cues that tell a claim from an absence, the past, a plan or an example are an English lexicon, and on other text they would let a false claim through. Links, image targets, fenced commands with an explicit path or a package-manager script, and env-fence variables are checked in every language. 'und' is text the identifier could not name (too short, mixed script, no function words).
M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we 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.
P1 CI/CD gates — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. A CI pipeline exists and the word "test" appears, but no explicit test-runner invocation (your stack's test command, or a test job) was matched — so either the gate runs tests through a step this pass could not recognise, or "test" is incidental here (a path, "latest", a reporter). Which of the two it is cannot be settled from this dimension's evidence; the coverage dimensions report whether a suite exists at all. You can widen what we reach: name the test runner explicitly in the pipeline step (your stack's test command, or a job named for the suite) so the gate is unambiguous to a reader and to this pass.
X1 Async correctness — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X12 Unreachable branch — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X16 Unfloored truncation loop — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X18 Disposal-pattern correctness — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X2 Cancellation propagation — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X21 Side-effecting pattern guard — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X27 Collection changed while being enumerated — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X28 Index access outside its own emptiness guard — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X29 Per-element action decided by a fixed element — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X3 Exception handling — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X30 Support guard that admits what it rejects — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
Repo exclusion declarations: 2 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.
Limitations & what we did not check
We assess the repository exactly as committed, and only the repository. By design we do 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.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
D11 Test Reliability: Flakiness is inferred from history/markers — we run the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
D13 Secret Scanning: Secret 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.
D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
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.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
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 REDACTED, 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.
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 Dockerfile (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.
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: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
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.
67 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was SeabreezeVegetation.ForestDistribution at 56. A further 3 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 Voyage.UpgradeBenefit at 18 — they are counted neither in the figure above nor in this dimension's score.
+ 59 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 16 bodies over 30 down to 30 or less in Cyclomatic Complexity — start with SeabreezeVegetation.ForestDistribution (cyclomatic 56), HarborNature.Build (cyclomatic 47), CozyLanding.Layout (cyclomatic 47). — 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 16 together lifts Cyclomatic Complexity from 3.4 to about 5.6/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.
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.
+ 100 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 10 bodies over 60 down to 60 or less in Cognitive Complexity — start with Voyage.UpdateWeapons (cognitive 95), EnvironmentArt3D.Shipwreck (cognitive 82), CozyLanding.Layout (cognitive 82). — 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 10 together lifts Cognitive Complexity from 2.0 to about 3.2/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes9.2 / 10Stronggated by 13 serious findings✓ 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.
Resolve the 4 MethodTooLong finding(s) in God Classes — start with SeabreezeSettlements.cs, EnvironmentSettlements3D.cs, EnvironmentLandmarks3D.cs. — One of this dimension's main actionable groups (4 warning-level).
Resolve the 3 FileTooLong finding(s) in God Classes — start with SeabreezeSettlements.cs, SeabreezeVegetation.cs, HarborNeighborhood.cs. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 3 ClassTooLong finding(s) in God Classes — start with SeabreezeVegetation.cs, HarborNeighborhood.cs, ActorArt3D.cs. — One of this dimension's main actionable groups (3 warning-level).
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.
11 duplicated block group(s) detected. 1.4 % of the production lines (632 of 46,596) are in a reported copy. A further 24 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 16 of the 35 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.
Edited copy of a member (1 corresponding lines) · ×4games/boats-n-beasts/source/presentation/ActorGeometry.cs:46
Edited copy of a member (9 corresponding lines) · ×3games/cozysora/maps/daan_gardens/DaanGeometry.cs:27
Edited copy of a member (12 corresponding lines) · ×2games/cozysora/maps/seabreeze_village/SeabreezeTextures.cs:123
Edited copy of a member (5 corresponding lines) · ×2games/cozysora/maps/daan_gardens/DaanWorld.cs:90
+ 18 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 4 Edited copy of a member (1 corresponding lines) finding(s) in Code Duplication — start with ActorGeometry.cs, service.py, MenuButton.cs. — One of this dimension's main actionable groups (4 warning-level).
Resolve the 4 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with DaanPlanting.cs, SeabreezeTextures.cs, SeabreezeVegetation.cs. — One of this dimension's main actionable groups (4 warning-level).
Resolve the 3 Edited copy of a member (9 corresponding lines) finding(s) in Code Duplication — start with DaanGeometry.cs, BrowserPalette.swift, BrowserPage.swift. — One of this dimension's main actionable groups (3 warning-level).
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling10.0 / 10Exemplary✓ 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.
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 LeanAppDelegate.swift, BrowserNativeSplit.swift. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D10 · Test Quality10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests truly assert behaviour rather than just running the code.
Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.
0 skipped, 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 69 tests. Measured on the JavaScript/TypeScript suite only — at least 53 test source file(s) (.kt, .py) went unread, so its test quality is unmeasured and is not in these counts.
✓ On the Gold path — maintain.
Detailed fixes: d10_recommendation.md.
Do you agree with this assessment?
D11 · Test Reliability10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests pass reliably, with no flakiness.
Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.
0 flaky across 1 measured tier(s). JavaScript/TypeScript (its own test command under node's V8 coverage via `npm ci --ignore-scripts` in tools/agent/ (8 tests)): measured (0 flaky).
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 105 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's Cargo.lock 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. ★ COVERAGE OF THIS VERDICT: it grades this repository's crate dependencies and nothing else. The repository also declares package.json, 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.
Resolve the 41 Hotspot finding(s) in Churn × Complexity Hotspots — start with Game.cs, agent.ts, Voyage.cs. — One of this dimension's main actionable groups (41 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.
1 deducted debt markers + 0 dead symbols across 14465 LoC in the .NET projects (0.1/KLoC) → score 9.9. Measured on the .NET source only: .swift (42% of production source) was not read, and carries at least 0 uncounted task marker(s) in 0 file(s).
Resolve the 1 WriteOnlyPrivateField finding(s) in Explicit Debt — start with DaanNeighborhood.cs. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).
Method: Every inline C# comment compared word by word with the identifiers, literals and constructs of the code it annotates (taken from the syntax); a comment whose words that code already contains is redundant, as are closing-brace labels and generator template text. Comments giving a reason or a reference are kept; other scripts and languages are not judged. Deterministic, exhaustive, advisory.
What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.
Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.
Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.
0 % of calls cross a namespace and 0 % go through an interface, but 100 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: medium — clean/modular boundaries expected.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret 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.
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).
12 finding(s): 0 critical, 10 high, 2 medium, 0 low. 5 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 9 file(s) — `games/boats-n-beasts/source/core/OceanWorld.cs` (line 28), `games/cozysora/scripts/CozyPlayer.Audio.cs` (lines 3–27, line 92), `tools/androidsteam/app/src/debug/native/build_xinput.sh` (line 5), `tools/androidsteam/gradlew` (line 74, line 178), `tools/androidsteam/native/display/src/gpu.h` (line 52), … (+4 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. In 2 of those file(s) — `games/boats-n-beasts/source/core/OceanWorld.cs`, `games/cozysora/scripts/CozyPlayer.Audio.cs` — the break is a C# primary constructor, which semgrep's grammar cannot parse and which hides the type from every rule scoped to it; those files were re-scanned from a shadow copy with the constructor's parameter list blanked (line and column preserving), which restores the type to the rules, and 0 additional row(s) came from that pass. Only the header's own parameter list is unread in them.
REDACTED
REDACTED
REDACTED
REDACTED
What to do
Resolve the 5 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (5). — One of this dimension's main actionable groups (5 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
No action in Static Analysis (SAST) — all 5 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (5 issue-level, 0 of them charged here).
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. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
Resolve the 8 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (7), REDACTED. — One of this dimension's main actionable groups (8 issue-level).
Resolve the 1 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-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.
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 4 Change coupling finding(s) in Change Coupling — start with state.ts, VoiceInputMethodService.kt, Effects3D.cs. — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
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. Reported 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. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
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 6 platform declaration(s) and 38 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 · 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.
Other · Architecture — Whether singleton services avoid mutable shared instance state that concurrent callers would race on.
Method: Roslyn scan: singleton field mutations unguarded by lock or Interlocked, per type; syntax-based guard detection. Deterministic, traceable per field.
`ActorArt3D` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (Cache; e.g. `Cache` at line 12). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — games/boats-n-beasts/source/presentation/ActorArt3D.cs:9
`DioramaSurface` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (material; e.g. `material` at line 7). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — games/boats-n-beasts/source/presentation/DioramaSurface.cs:4
`EnvironmentArt3D` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (Materials; e.g. `Materials` at line 667). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — games/boats-n-beasts/source/presentation/EnvironmentArt3D.cs:7
`Whirlpool3D` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (material, mesh; e.g. `material` at line 15). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — games/boats-n-beasts/source/presentation/Whirlpool3D.cs:6
What to do
A `static` field is one slot for the whole process, however its type is created: back it with a thread-safe type (ConcurrentDictionary, Interlocked), take a lock around every write, or move it into a registered singleton that does.
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.
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.
Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
The root README is 116 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, in the README and in the repository documents it links, it found no a testing section. Sections are matched on HEADING text only, so material written under a heading this check does not recognise — or with no heading at all — is not seen and this row may understate what the document covers. — README.md:1
What to do
Expand the README with getting-started, architecture overview and a project map.
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.
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 repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.
Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.
Do you agree with this assessment?
P1 · CI/CD gates8.5 / 10Strong✓ Tool-verified
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.
What to do
Run the test suite in CI via an explicit runner step (`npm test` for the toolchain this pipeline already uses) and gate merges on it.
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's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Readiness · Readiness — Whether 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.
No static application security testing detected. For this repository's stack, add CodeQL's Swift pack (Swift/Xcode) (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 1 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
`site/package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — site/package.json:9
What to do
Add a SAST step to CI running what this repository's stack ships: CodeQL's Swift pack (Swift/Xcode) — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
Enable Dependabot/Renovate or a dependency-review gate.
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.
What to do
Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
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 each language's code 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.
`mkdirSync` in `open` 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) — tools/agent/src/agent.ts:49, tools/agent/src/pi.ts:131
`readFileSync` in `callback to createServer` 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. — REDACTED:126
`mkdirSync` in `agentModels` 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. — tools/agent/src/providers.ts:35
`writeFileSync` in `setFastMode` 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. — tools/agent/src/providers.ts:78
`renameSync` in `setFastMode` 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. — tools/agent/src/providers.ts:79
`writeFileSync` in `select` 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. — tools/agent/src/providers.ts:126
`renameSync` in `select` 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. — tools/agent/src/providers.ts:127
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.9 / 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.
19 typed · 20 plain JS — the untyped files are tools/agent/evals/composer.test.mjs, tools/agent/evals/delegation.test.mjs, tools/agent/evals/providers.test.mjs, tools/agent/evals/request-tasks.test.mjs, tools/agent/web/app.js, tools/agent/web/composer.js (+14 more).
React / JS · Code Health — The share of the scored frontend lines inside a near-exact copy-pasted block of substantial extent (the D4 clone algorithm over JS/TS tokens, D-386; each line once, 10 at none and 0 at a quarter of the lines, as D4): 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. Scored on the share of the scored frontend lines inside a reported copy, on the same curve as D4. Deterministic.
tools/agent/src/request-scheduling.ts:63 · tools/agent/src/request-scheduling.ts:133 — 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/agent/src/request-scheduling.ts:63
tools/agent/src/request-scheduling.ts:20 · tools/agent/src/request-scheduling.ts:83 — 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/agent/src/request-scheduling.ts:20
tools/agent/src/providers.ts:76 · tools/agent/src/providers.ts:124 — 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. — tools/agent/src/providers.ts:76
tools/agent/src/request-tasks.ts:68 · tools/agent/src/request-tasks.ts:101 — 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/agent/src/request-tasks.ts:68
What to do
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
(anonymous) has cyclomatic complexity 42 and cognitive complexity 76; 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:38
(anonymous) has cyclomatic complexity 32 and cognitive complexity 51; 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. — tools/agent/src/state.ts:149
(anonymous) has cyclomatic complexity 28 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. — tools/agent/web/composer.js:189
onmessage has cyclomatic complexity 21 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. — tools/agent/web/app.js:180
dispatch has cyclomatic complexity 21 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 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. — tools/hooks/slack/extension/background.mjs:68
submitSession has cyclomatic complexity 21 and cognitive complexity 19; 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. — tools/agent/src/agent.ts:108
(anonymous) has cyclomatic complexity 20 and cognitive complexity 24; 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. — tools/agent/src/request-tasks.ts:70
loginHTML has cyclomatic complexity 20 and cognitive complexity 20; 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. — tools/agent/web/providers.js:43
renderMarkdown has cyclomatic complexity 17 and cognitive complexity 28; 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. — tools/agent/web/view.js:63
sync has cyclomatic complexity 17 and cognitive complexity 20; 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. — tools/agent/web/composer.js:128
history has cyclomatic complexity 17 and cognitive complexity 20; 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. — tools/hooks/slack/hook.js:74
nativeSearchPayload has cyclomatic complexity 17 and cognitive complexity 16; 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. — tools/agent/src/native-search.ts:43
(anonymous) has cyclomatic complexity 16 and cognitive complexity 31; 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. — tools/agent/src/request-scheduling.ts:105
activityPill has cyclomatic complexity 16 and cognitive complexity 15; 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. — tools/agent/web/app.js:39
message has cyclomatic complexity 16 and cognitive complexity 14; 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. — tools/hooks/slack/extension/relay.js:33
render has cyclomatic complexity 15 and cognitive complexity 16; 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. — tools/agent/web/app.js:103
(anonymous) has cyclomatic complexity 15 and cognitive complexity 13; 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. — tools/agent/src/state.ts:197
suggestionTarget has cyclomatic complexity 14 and cognitive complexity 16; 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. — tools/agent/web/composer.js:6
update has cyclomatic complexity 14 and cognitive complexity 16; 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. — tools/agent/web/providers.js:126
(anonymous) has cyclomatic complexity 13 and cognitive complexity 28; 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. — tools/agent/src/state.ts:52
(anonymous) has cyclomatic complexity 13 and cognitive complexity 18; 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. — tools/agent/evals/delegation.test.mjs:57
fastModePayload has cyclomatic complexity 13 and cognitive complexity 13; 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. — tools/agent/src/fast-mode.ts:30
(anonymous) has cyclomatic complexity 13 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. — tools/agent/web/app.js:161
escape has cyclomatic complexity 13 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. — tools/agent/web/composer.js:170
(anonymous) has cyclomatic complexity 12 and cognitive complexity 19; 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. — tools/agent/src/state.ts:83
open has cyclomatic complexity 12 and cognitive complexity 18; 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. — tools/agent/src/agent.ts:43
parseRoute has cyclomatic complexity 12 and cognitive complexity 15; 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. — tools/agent/src/home-routing.ts:11
handleClick has cyclomatic complexity 12 and cognitive complexity 13; 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. — tools/agent/web/providers.js:156
html has cyclomatic complexity 12 and cognitive complexity 10; 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. — tools/agent/web/providers.js:84
(anonymous) has cyclomatic complexity 11 and cognitive complexity 39; 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. — tools/agent/evals/providers.test.mjs:276
observe has cyclomatic complexity 11 and cognitive complexity 13; 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. — tools/agent/src/native-search.ts:14
call has cyclomatic complexity 11 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 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. — tools/agent/src/computer-use.ts:36
login has cyclomatic complexity 11 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 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. — tools/agent/src/providers-cli.ts:8
update has cyclomatic complexity 11 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 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. — tools/hooks/slack/extension/background.mjs:30
messageStatus has cyclomatic complexity 11 and cognitive complexity 11; 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. — tools/agent/web/app.js:28
thumbsUpButton has cyclomatic complexity 11 and cognitive complexity 10; 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. — tools/agent/web/message-actions.js:25
renderMessage has cyclomatic complexity 11 and cognitive complexity 10; 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. — tools/agent/web/view.js:127
Do you agree with this assessment?
R3 · Large Files10.0 / 10Exemplary✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
Do you agree with this assessment?
R4 · Test Coverage10.0 / 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.
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.
Do you agree with this assessment?
R6 · Tooling6.7 / 10Adequate✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.
Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.
test ✓ · lint ✗ · typecheck ✓ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.
What to do
Add eslint as package.json scripts and run them in CI.
Do you agree with this assessment?
R7 · Dead Code10.0 / 10Exemplary✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
Nothing imports this binding — it is safe to review for removal. — tools/agent/src/delegation.ts:94
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.
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 nullable reference types are enabled and not undermined by heavy `!` suppression.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
~0.7 `!` suppressions per 1k syntax nodes — 125 suppression(s) across the 187223 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a `!` can suppress anything in (a `!` under `#nullable disable` is inert and is not counted, and its file's nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.
What to do
Enable <Nullable>enable</Nullable> across all projects and resolve warnings rather than suppressing with `!`.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 2 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 8 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 1 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 — 76 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 — The only markup in this repository is in its own developer tools (a root `tools/` or `scripts/` tree), which is not the product's UI — accessibility is not applicable to this repository.
AC2 Forms & labels — The only markup in this repository is in its own developer tools (a root `tools/` or `scripts/` tree), which is not the product's UI — accessibility is not applicable to this repository.
AC3 Page structure — The only markup in this repository is in its own developer tools (a root `tools/` or `scripts/` tree), which is not the product's UI — accessibility is not applicable to this repository.
AC4 Keyboard semantics — The only markup in this repository is in its own developer tools (a root `tools/` or `scripts/` tree), which is not the product's UI — accessibility is not applicable to this repository.
AC5 ARIA correctness — The only markup in this repository is in its own developer tools (a root `tools/` or `scripts/` tree), which is not the product's UI — accessibility is not applicable to this repository.
AC6 Visual & motion safety — The only markup in this repository is in its own developer tools (a root `tools/` or `scripts/` tree), which is not the product's UI — accessibility is not applicable to this repository.
AX1 Captive dependencies — no DI registrations detected
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — the Android app did not build — `./gradlew :app:assembleDebug` exited 1: curl: (22) The requested URL returned error: 403
FAILURE: Build failed with an exception.
* What went wrong:
Execution failed for task ':app:buildProot'.
> Process 'command 'bash'' finished with non…; runtime evidence skipped (launch chosen because tools/androidsteam/app/build.gradle.kts applies the Android application plugin and tools/androidsteam/gradlew builds it) This is a statement about this run, not a statement about your application: nothing here says the app is inaccessible, only that it was never run.
C1 Data Protection — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C2 Access Controls — No access-control surface detected in the analyzed source — no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here — this is a library/CLI, which is authorized by its CALLER, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
D12 Dependency Hygiene — Dependency hygiene not measured
D16 Bus Factor — single-contributor repository — bus factor is not applicable
D18 Solution Shape — D18 scores the shape of a C#/VB .NET solution, but this repository's production source is mostly .c, .cpp, .kt, .py, .rs, .swift, .ts, which the C#/VB workspace does not load — the projects that loaded are an immaterial minority, so solution shape was not assessed for this repository. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
D21 Naming Consistency — D21 withholds its case and prefix conventions rows: 2 candidate(s) found and not reported.
D22 Internal API Consistency — API consistency is measured on C#, TypeScript, Go only; the exposed Python surface was not measured.
D23 Boundary Type-Coupling — Cross-context type coupling could not be assessed — this codebase's bounded contexts are neither declared nor inferable.
D25 ADR Conformance — no ADRs to check
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — 26 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D34 Knowledge Freshness — knowledge concentrated in recent work — freshness signal contradicted by repo activity
D36 Supply-chain Provenance & Signing — The CI pipeline publishes no artifact — no package publish, container push or release with files to download. Supply-chain provenance, signing and an SBOM describe a PUBLISHED artifact for the people who obtain it, so there is nothing to attest here; a deployment of the service itself publishes nothing for anyone else to verify. Add them to the release pipeline when this repo starts publishing artifacts (a package, a container image, or a release with downloadable files). Build integrity and workflow-token hygiene are reported below: they describe what the CI runs and the token it runs with, neither of which is affected by whether the pipeline ships an artifact.
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
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 dependency cycles — architectural integrity not assessed
D8 Code Coverage — Coverage NOT MEASURED: the .NET half could not be measured — no coverage produced (collector absent, or test run exceeded the inline budget); the JavaScript/TypeScript half could not be measured — the its own test command under node's V8 coverage suite in tools/agent/ ran and not one test passed (code: 'ERR_TEST_FAILURE'), so the coverage report describes the failed run, not the code. This repository's production source spans both ecosystems, and no partial figure is published as if it were the whole: coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan.
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (68 value object(s))
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and this analysis resolves a call's owner only where the receiver's type is written down in the source. Reported as guidance rather than measured
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, 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
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
IC1 Incompleteness & stubs — IC1 reached only 37% of this repository's production lines — swift (16,360 lines), typescript (1,928 lines), python (1,523 lines), rust (1,520 lines), javascript (1,515 lines), kotlin (1,491 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P2 Observability — This repository's JavaScript/TypeScript source (1 module(s), 2 file(s) read) declares no entry point and bootstraps no server, and nothing here deploys a service — it is a library, run inside whatever hosts it, so production observability (structured logging, tracing/metrics, health checks) is N/A. If it grows a binary or a service, the dimension reactivates.
P7 Outbound HTTP resilience — not applicable — this isn't a service/API/worker
P8 Schema migrations — no EF Core usage detected
P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
PF1 Benchmark discipline — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
S1 Web-Security Posture — No web surface detected in the analyzed source — no HTTP API or web-UI project (no controllers/minimal-API endpoints, no Razor/Blazor views) and no web middleware (HTTPS redirection, HSTS, security headers, cookies). Transport security, security headers, secure cookies, CSRF/input-validation and middleware-order controls are therefore N/A here — this is a library/CLI/worker, not a web app. Crypto hygiene was still checked and found nothing to flag. If this codebase becomes web-facing, the dimension reactivates automatically.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X1 Async correctness — X1 reached only 37% of this repository's production lines — swift (16,360 lines), typescript (1,928 lines), python (1,523 lines), rust (1,520 lines), javascript (1,515 lines), kotlin (1,491 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X12 Unreachable branch — X12 reached only 37% of this repository's production lines — swift (16,360 lines), typescript (1,928 lines), python (1,523 lines), rust (1,520 lines), javascript (1,515 lines), kotlin (1,491 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X16 Unfloored truncation loop — X16 reached only 37% of this repository's production lines — swift (16,360 lines), typescript (1,928 lines), python (1,523 lines), rust (1,520 lines), javascript (1,515 lines), kotlin (1,491 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X18 Disposal-pattern correctness — X18 reached only 37% of this repository's production lines — swift (16,360 lines), typescript (1,928 lines), python (1,523 lines), rust (1,520 lines), javascript (1,515 lines), kotlin (1,491 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X2 Cancellation propagation — X2 reached only 37% of this repository's production lines — swift (16,360 lines), typescript (1,928 lines), python (1,523 lines), rust (1,520 lines), javascript (1,515 lines), kotlin (1,491 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X21 Side-effecting pattern guard — X21 reached only 37% of this repository's production lines — swift (16,360 lines), typescript (1,928 lines), python (1,523 lines), rust (1,520 lines), javascript (1,515 lines), kotlin (1,491 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X25 Inert configuration knob — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X27 Collection changed while being enumerated — X27 reached only 37% of this repository's production lines — swift (16,360 lines), typescript (1,928 lines), python (1,523 lines), rust (1,520 lines), javascript (1,515 lines), kotlin (1,491 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X28 Index access outside its own emptiness guard — X28 reached only 37% of this repository's production lines — swift (16,360 lines), typescript (1,928 lines), python (1,523 lines), rust (1,520 lines), javascript (1,515 lines), kotlin (1,491 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X29 Per-element action decided by a fixed element — X29 reached only 37% of this repository's production lines — swift (16,360 lines), typescript (1,928 lines), python (1,523 lines), rust (1,520 lines), javascript (1,515 lines), kotlin (1,491 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X3 Exception handling — X3 reached only 37% of this repository's production lines — swift (16,360 lines), typescript (1,928 lines), python (1,523 lines), rust (1,520 lines), javascript (1,515 lines), kotlin (1,491 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X30 Support guard that admits what it rejects — X30 reached only 37% of this repository's production lines — swift (16,360 lines), typescript (1,928 lines), python (1,523 lines), rust (1,520 lines), javascript (1,515 lines), kotlin (1,491 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X32 Type resolved by simple name across every loaded assembly — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X4 Structured logging — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
WriteOnlyPrivateField games/cozysora/maps/daan_gardens/DaanNeighborhood.cs:7— private DaanWorld _map — assigned 2 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
Hotspot: games/boats-n-beasts/source/presentation/Game.cs games/boats-n-beasts/source/presentation/Game.cs:43— games/boats-n-beasts/source/presentation/Game.cs changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Game._Process at line 43. 2 of those changes were fix/bug commits, and the other 53 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- games/boats-n-beasts/source/presentation/Game.cs`: 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: tools/agent/src/agent.ts tools/agent/src/agent.ts:108— tools/agent/src/agent.ts changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Agent.submitSession at line 108. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- tools/agent/src/agent.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: games/boats-n-beasts/source/core/Voyage.cs games/boats-n-beasts/source/core/Voyage.cs:127— games/boats-n-beasts/source/core/Voyage.cs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Voyage.UpdateEnemies at line 127. 2 of those changes were fix/bug commits, and the other 29 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- games/boats-n-beasts/source/core/Voyage.cs`: 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: tools/agent/web/app.js tools/agent/web/app.js:39— tools/agent/web/app.js changed 63 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in app.activityPill at line 39. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- tools/agent/web/app.js`: 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: tools/agent/src/state.ts tools/agent/src/state.ts:143— tools/agent/src/state.ts changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in State.data at line 143. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- tools/agent/src/state.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: games/boats-n-beasts/source/presentation/EnvironmentSettlements3D.cs games/boats-n-beasts/source/presentation/EnvironmentSettlements3D.cs:27— games/boats-n-beasts/source/presentation/EnvironmentSettlements3D.cs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in EnvironmentArt3D.SettlementInterior at line 27. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- games/boats-n-beasts/source/presentation/EnvironmentSettlements3D.cs`: 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: games/boats-n-beasts/source/presentation/EnvironmentArt3D.cs games/boats-n-beasts/source/presentation/EnvironmentArt3D.cs:138— games/boats-n-beasts/source/presentation/EnvironmentArt3D.cs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in EnvironmentArt3D.Land at line 138. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- games/boats-n-beasts/source/presentation/EnvironmentArt3D.cs`: 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: games/boats-n-beasts/source/presentation/ArtSample.cs games/boats-n-beasts/source/presentation/ArtSample.cs:99— games/boats-n-beasts/source/presentation/ArtSample.cs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in ArtSample._UnhandledKeyInput at line 99. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- games/boats-n-beasts/source/presentation/ArtSample.cs`: 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: games/boats-n-beasts/source/core/VoyageWeapons.cs games/boats-n-beasts/source/core/VoyageWeapons.cs:12— games/boats-n-beasts/source/core/VoyageWeapons.cs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in Voyage.UpdateWeapons at line 12. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- games/boats-n-beasts/source/core/VoyageWeapons.cs`: 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: games/boats-n-beasts/source/presentation/EnvironmentLandmarks3D.cs games/boats-n-beasts/source/presentation/EnvironmentLandmarks3D.cs:164— games/boats-n-beasts/source/presentation/EnvironmentLandmarks3D.cs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in EnvironmentArt3D.Shipwreck at line 164. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- games/boats-n-beasts/source/presentation/EnvironmentLandmarks3D.cs`: 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: tools/agent/src/home-routing.ts tools/agent/src/home-routing.ts:38— tools/agent/src/home-routing.ts changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in HomeRouter.discover at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- tools/agent/src/home-routing.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: tools/browser/Lean/Features/Sidebar/BrowserSidebarReorderState.swift tools/browser/Lean/Features/Sidebar/BrowserSidebarReorderState.swift:276— tools/browser/Lean/Features/Sidebar/BrowserSidebarReorderState.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in BrowserSidebarReorderState.move at line 276. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- tools/browser/Lean/Features/Sidebar/BrowserSidebarReorderState.swift`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:38— REDACTED changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in http-server.createAgentServer.server at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: tools/agent/web/providers.js tools/agent/web/providers.js:43— tools/agent/web/providers.js changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in providers.createProviders.loginHTML at line 43. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- tools/agent/web/providers.js`: 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: games/boats-n-beasts/source/presentation/Effects3D.cs games/boats-n-beasts/source/presentation/Effects3D.cs:239— games/boats-n-beasts/source/presentation/Effects3D.cs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Effects3D.Effect at line 239. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- games/boats-n-beasts/source/presentation/Effects3D.cs`: 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: tools/browser/Lean/Features/Sidebar/BrowserSidebarDrag.swift tools/browser/Lean/Features/Sidebar/BrowserSidebarDrag.swift:225— tools/browser/Lean/Features/Sidebar/BrowserSidebarDrag.swift changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in BrowserDropArea.body at line 225. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- tools/browser/Lean/Features/Sidebar/BrowserSidebarDrag.swift`: 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: tools/browser/Lean/Features/Sidebar/BrowserTabRow.swift tools/browser/Lean/Features/Sidebar/BrowserTabRow.swift:15— tools/browser/Lean/Features/Sidebar/BrowserTabRow.swift changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in BrowserTabRow.body at line 15. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- tools/browser/Lean/Features/Sidebar/BrowserTabRow.swift`: 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: tools/browser/Lean/Features/Spaces/BrowserStore+Spaces.swift tools/browser/Lean/Features/Spaces/BrowserStore+Spaces.swift:45— tools/browser/Lean/Features/Spaces/BrowserStore+Spaces.swift changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in BrowserStore.deleteSpace at line 45. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- tools/browser/Lean/Features/Spaces/BrowserStore+Spaces.swift`: 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: tools/androidsteam/app/src/main/java/com/sanogueralorenzo/androidsteam/session/SessionController.kt tools/androidsteam/app/src/main/java/com/sanogueralorenzo/androidsteam/session/SessionController.kt:97— tools/androidsteam/app/src/main/java/com/sanogueralorenzo/androidsteam/session/SessionController.kt changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in SessionController.begin at line 97. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- tools/androidsteam/app/src/main/java/com/sanogueralorenzo/androidsteam/session/SessionController.kt`: 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: games/boats-n-beasts/source/core/OceanWorld.cs games/boats-n-beasts/source/core/OceanWorld.cs:73— games/boats-n-beasts/source/core/OceanWorld.cs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in OceanWorld.Landmarks at line 73. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- games/boats-n-beasts/source/core/OceanWorld.cs`: 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: tools/browser/Lean/Features/Sidebar/BrowserStore+SidebarMoves.swift tools/browser/Lean/Features/Sidebar/BrowserStore+SidebarMoves.swift:6— tools/browser/Lean/Features/Sidebar/BrowserStore+SidebarMoves.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in BrowserStore.moveSidebarItems at line 6. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- tools/browser/Lean/Features/Sidebar/BrowserStore+SidebarMoves.swift`: 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: tools/browser/Lean/Features/Browser/BrowserSessionOwner.swift tools/browser/Lean/Features/Browser/BrowserSessionOwner.swift:119— tools/browser/Lean/Features/Browser/BrowserSessionOwner.swift changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in BrowserSessionOwner.canCloseAll at line 119. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- tools/browser/Lean/Features/Browser/BrowserSessionOwner.swift`: 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: tools/agent/src/delegation.ts tools/agent/src/delegation.ts:12— tools/agent/src/delegation.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in delegation.createDelegation at line 12. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- tools/agent/src/delegation.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: tools/browser/Lean/Features/Sidebar/BrowserFolderRow.swift tools/browser/Lean/Features/Sidebar/BrowserFolderRow.swift:16— tools/browser/Lean/Features/Sidebar/BrowserFolderRow.swift changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in BrowserFolderRow.body at line 16. 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- tools/browser/Lean/Features/Sidebar/BrowserFolderRow.swift`: 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: tools/clipboard/Sources/ClipboardFormats.swift tools/clipboard/Sources/ClipboardFormats.swift:51— tools/clipboard/Sources/ClipboardFormats.swift changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ClipboardSupport.prepare at line 51. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 03:15:41 -08:00' --until='2026-11-16 03:15:41 -08:00' --full-history --no-merges -- tools/clipboard/Sources/ClipboardFormats.swift`: 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.
Sync-over-async blocking tools/agent/src/agent.ts:49— `mkdirSync` in `open` 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 REDACTED:126— `readFileSync` in `callback to createServer` 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 tools/agent/src/pi.ts:131— `mkdirSync` in `open` 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 tools/agent/src/providers.ts:35— `mkdirSync` in `agentModels` 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 tools/agent/src/providers.ts:78— `writeFileSync` in `setFastMode` 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 tools/agent/src/providers.ts:79— `renameSync` in `setFastMode` 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 tools/agent/src/providers.ts:126— `writeFileSync` in `select` 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 tools/agent/src/providers.ts:127— `renameSync` in `select` 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.
AX2 · Stateful singletons· Process-global static state · ×4
Process-global static state: ActorArt3D games/boats-n-beasts/source/presentation/ActorArt3D.cs:9— `ActorArt3D` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (Cache; e.g. `Cache` at line 12). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: DioramaSurface games/boats-n-beasts/source/presentation/DioramaSurface.cs:4— `DioramaSurface` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (material; e.g. `material` at line 7). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: EnvironmentArt3D games/boats-n-beasts/source/presentation/EnvironmentArt3D.cs:7— `EnvironmentArt3D` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (Materials; e.g. `Materials` at line 667). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Whirlpool3D games/boats-n-beasts/source/presentation/Whirlpool3D.cs:6— `Whirlpool3D` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (material, mesh; e.g. `material` at line 15). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
MethodTooLong: SeabreezeSettlements.Railway games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:823— MethodTooLong — Railway runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21× 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: EnvironmentArt3D.Prison games/boats-n-beasts/source/presentation/EnvironmentSettlements3D.cs:95— MethodTooLong — Prison runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: EnvironmentArt3D.PirateTavern games/boats-n-beasts/source/presentation/EnvironmentLandmarks3D.cs:17— MethodTooLong — PirateTavern 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.
MethodTooLong: HarborNeighborhood.House games/cozysora/maps/harbor_hills/HarborNeighborhood.cs:59— MethodTooLong — House runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05× 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.
Change coupling: state.ts ↔ app.js tools/agent/src/state.ts:1— `tools/agent/src/state.ts` and `tools/agent/web/app.js` change together 78% of the time (14 of the 18 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 `4ef6ada6` Use Pi conversation views and watchers for Assistant streaming (at that commit the files were still `tools/assistant/src/state.ts` and `tools/assistant/web/app.js`); `fd14ceb7` Show Assistant approvals as attached reactions (at that commit the files were still `tools/assistant/src/state.ts` and `tools/assistant/web/app.js`); `c8561a94` Add thumbs-up follow-ups to Assistant replies (at that commit the files were still `tools/assistant/src/state.ts` and `tools/assistant/web/app.js`) — run `git show` on any of them.
Change coupling: VoiceInputMethodService.kt ↔ OverlayAccessibilityService.kt tools/voice/android/app/src/main/java/com/sanogueralorenzo/voice/keyboard/VoiceInputMethodService.kt:1— `tools/voice/android/app/src/main/java/com/sanogueralorenzo/voice/keyboard/VoiceInputMethodService.kt` and `tools/voice/android/app/src/main/java/com/sanogueralorenzo/voice/overlay/OverlayAccessibilityService.kt` change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `b55e797e` Unify Voice dictation sessions; `1a5d68c2` Require complete Voice command sessions; `0558f134` Apply finalized Voice commands immediately — run `git show` on any of them.
Change coupling: Effects3D.cs ↔ Game.cs games/boats-n-beasts/source/presentation/Effects3D.cs:1— `games/boats-n-beasts/source/presentation/Effects3D.cs` and `games/boats-n-beasts/source/presentation/Game.cs` change together 64% of the time (7 of the 11 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). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `bbf45fd1` Clarify Boats n Beasts guidance and implementation comments; `5c21d2b0` Remove repetitive wreck salvage encounters; `91dcc5a8` Limit ranged enemy attacks to Crownclaw lobbed explosions — run `git show` on any of them.
Change coupling: HomeScreen.kt ↔ PermissionsScreen.kt tools/overlay/app/src/main/java/com/sanogueralorenzo/overlay/home/HomeScreen.kt:1— `tools/overlay/app/src/main/java/com/sanogueralorenzo/overlay/home/HomeScreen.kt` and `tools/overlay/app/src/main/java/com/sanogueralorenzo/overlay/permissions/PermissionsScreen.kt` change together 55% of the time (6 of the 11 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 `f0f62344` Collect Overlay state with lifecycle; `4d52be2a` Normalize route ViewModel locals to viewModel (at that commit the files were still `overlay/app/src/main/java/com/sanogueralorenzo/overlay/home/HomeScreen.kt` and `overlay/app/src/main/java/com/sanogueralorenzo/overlay/permissions/PermissionsScreen.kt`); `cf392bbe` Revert "overlay: use horizontal-only insets for top app bars" (at that commit the files were still `overlay/app/src/main/java/com/sanogueralorenzo/overlay/home/HomeScreen.kt` and `overlay/app/src/main/java/com/sanogueralorenzo/overlay/permissions/PermissionsScreen.kt`) — run `git show` on any of them.
D4 · Code Duplication· Edited copy of a member (1 corresponding lines) · ×4
Edited copy of a member (1 corresponding lines) games/boats-n-beasts/source/presentation/ActorGeometry.cs:46— games/boats-n-beasts/source/presentation/ActorGeometry.cs:46-50 | games/boats-n-beasts/source/presentation/EnvironmentArt3D.cs:577-577 — These two members are one piece of code written twice and then edited apart: 1 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.
Edited copy of a member (1 corresponding lines) tools/hooks/service.py:112— tools/hooks/service.py:112-121 | tools/slack/src/agent_slack/installation.py:135-135 — These two members are one piece of code written twice and then edited apart: 1 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.
Edited copy of a member (1 corresponding lines) games/boats-n-beasts/source/presentation/MenuButton.cs:68— games/boats-n-beasts/source/presentation/MenuButton.cs:68-68 | games/boats-n-beasts/source/presentation/UpgradeSymbol.cs:10-10 — These two members are one piece of code written twice and then edited apart: 1 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.
Edited copy of a member (1 corresponding lines) tools/clipboard/Sources/ClipboardFormats.swift:148— tools/clipboard/Sources/ClipboardFormats.swift:148-148 | tools/clipboard/Sources/ClipboardHistory.swift:183-183 — These two members are one piece of code written twice and then edited apart: 1 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.
Duplicated block (6 lines × 2) games/cozysora/maps/daan_gardens/DaanPlanting.cs:71— games/cozysora/maps/daan_gardens/DaanPlanting.cs:71-76 | games/cozysora/maps/harbor_hills/HarborTextures.cs:9-14 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `games/cozysora/maps/daan_gardens/DaanPlanting.cs:71` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) games/cozysora/maps/seabreeze_village/SeabreezeTextures.cs:9— games/cozysora/maps/seabreeze_village/SeabreezeTextures.cs:9-14 | games/cozysora/maps/seabreeze_village/SeabreezeTextures.cs:52-57 — 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 `games/cozysora/maps/seabreeze_village/SeabreezeTextures.cs:9` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:295— games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:295-300 | games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:305-310 — 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 `games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:295` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (6 lines × 2) tools/browser/Lean/Features/Browser/BrowserSearchSuggestionClient.swift:63— tools/browser/Lean/Features/Browser/BrowserSearchSuggestionClient.swift:63-68 | tools/browser/Lean/Features/Integrations/WebKitIntegrationSession.swift:240-245 — 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.
FileTooLong: seabreeze_village/SeabreezeSettlements.cs games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs— FileTooLong — 907 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 407 over it, 1.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: seabreeze_village/SeabreezeVegetation.cs games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs— FileTooLong — 638 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 138 over it, 1.28× 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: harbor_hills/HarborNeighborhood.cs games/cozysora/maps/harbor_hills/HarborNeighborhood.cs— FileTooLong — 510 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 10 over it, 1.02× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
ClassTooLong: SeabreezeVegetation games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs— ClassTooLong — 614 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 214 over it, 1.54× 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: HarborNeighborhood games/cozysora/maps/harbor_hills/HarborNeighborhood.cs— ClassTooLong — 507 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 107 over it, 1.27× 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: ActorArt3D games/boats-n-beasts/source/presentation/ActorArt3D.cs— ClassTooLong — 429 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods, declared across 3 files: presentation/ActorArt3D.cs (18), presentation/ActorEquipment3D.cs (5), presentation/ActorCrew3D.cs (2). The bar is 400 significant lines; this is 29 over it, 1.07× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: EnvironmentArt3D games/boats-n-beasts/source/presentation/EnvironmentArt3D.cs— TooManyMethods — 1025 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods, declared across 4 files: presentation/EnvironmentArt3D.cs (21), presentation/EnvironmentSettlements3D.cs (12), presentation/EnvironmentLandmarks3D.cs (5), presentation/EnvironmentVillage3D.cs (4). The bar is 30 methods; this is 12 over it, 1.40× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
TooManyMethods: SeabreezeSettlements games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs— TooManyMethods — 903 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 30 methods; this is 11 over it, 1.37× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: CozyPlayer games/cozysora/scripts/CozyPlayer.cs— TooManyMethods — 564 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods, declared across 3 files: scripts/CozyPlayer.cs (23), scripts/CozyPlayer.Characters.cs (8), scripts/CozyPlayer.Audio.cs (4). The bar is 30 methods; this is 5 over it, 1.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.
D4 · Code Duplication· Edited copy of a member (9 corresponding lines) · ×3
Edited copy of a member (9 corresponding lines) games/cozysora/maps/daan_gardens/DaanGeometry.cs:27— games/cozysora/maps/daan_gardens/DaanGeometry.cs:27-35 | games/cozysora/maps/harbor_hills/HarborGeometry.cs:32-61 — These two members are one piece of code written twice and then edited apart: 9 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.
Edited copy of a member (9 corresponding lines) tools/browser/Lean/Features/Browser/BrowserPalette.swift:187— tools/browser/Lean/Features/Browser/BrowserPalette.swift:187-195 | tools/browser/Lean/Features/Browser/BrowserPalette.swift:196-204 — These two members are one piece of code written twice and then edited apart: 9 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.
Edited copy of a member (9 corresponding lines) tools/browser/Lean/Features/Browser/BrowserPage.swift:252— tools/browser/Lean/Features/Browser/BrowserPage.swift:252-260 | tools/browser/Lean/Features/Browser/BrowserPage.swift:262-270 — These two members are one piece of code written twice and then edited apart: 9 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 (12 corresponding lines) · ×2
Edited copy of a member (12 corresponding lines) games/cozysora/maps/seabreeze_village/SeabreezeTextures.cs:123— games/cozysora/maps/seabreeze_village/SeabreezeTextures.cs:123-134 | games/cozysora/maps/seabreeze_village/SeabreezeTextures.cs:144-155 — These two members are one piece of code written twice and then edited apart: 12 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.
Edited copy of a member (12 corresponding lines) tools/browser/Lean/Features/Permissions/BrowserSiteController.swift:54— tools/browser/Lean/Features/Permissions/BrowserSiteController.swift:54-65 | tools/browser/Lean/Features/Permissions/BrowserSiteController.swift:390-401 — These two members are one piece of code written twice and then edited apart: 12 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 (5 corresponding lines) · ×2
Edited copy of a member (5 corresponding lines) games/cozysora/maps/daan_gardens/DaanWorld.cs:90— games/cozysora/maps/daan_gardens/DaanWorld.cs:90-94 | games/cozysora/maps/daan_gardens/DaanWorld.cs:97-101 — These two members are one piece of code written twice and then edited apart: 5 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.
Edited copy of a member (5 corresponding lines) games/cozysora/maps/harbor_hills/HarborGeometry.cs:122— games/cozysora/maps/harbor_hills/HarborGeometry.cs:122-126 | games/cozysora/maps/harbor_hills/HarborGeometry.cs:129-134 — These two members are one piece of code written twice and then edited apart: 5 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 (10 corresponding lines) · ×2
Edited copy of a member (10 corresponding lines) games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:648— games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:648-657 | games/cozysora/maps/seabreeze_village/SeabreezeWorld.Props.cs:8-17 — These two members are one piece of code written twice and then edited apart: 10 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.
Edited copy of a member (10 corresponding lines) tools/browser/Lean/Features/Browser/BrowserPage.swift:378— tools/browser/Lean/Features/Browser/BrowserPage.swift:378-387 | tools/browser/Lean/Features/Browser/BrowserPage.swift:389-399 — These two members are one piece of code written twice and then edited apart: 10 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.
Duplicated block (5 lines × 2) games/boats-n-beasts/source/core/OceanWorld.cs:52— games/boats-n-beasts/source/core/OceanWorld.cs:52-57 | games/boats-n-beasts/source/core/OceanWorld.cs:141-145 — 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 `games/boats-n-beasts/source/core/OceanWorld.cs:52` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 2) tools/browser/Lean/Features/Tabs/BrowserStore+TabCopies.swift:10— tools/browser/Lean/Features/Tabs/BrowserStore+TabCopies.swift:10-14 | tools/browser/Lean/Features/Tabs/BrowserStore+TabCopies.swift:26-30 — 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.
Low cohesion: LeanAppDelegate (LCOM4 6) tools/browser/Lean/App/LeanAppDelegate.swift:5— LeanAppDelegate's methods fall into 6 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 6 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: BrowserSplitHost (LCOM4 4) tools/browser/Lean/Features/SplitView/BrowserNativeSplit.swift:16— BrowserSplitHost'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.
SeabreezeVegetation.ForestDistribution (cyclomatic 56) games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:279— SeabreezeVegetation.ForestDistribution has cyclomatic complexity 56 (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.
HarborNature.Build (cyclomatic 47) games/cozysora/maps/harbor_hills/HarborNature.cs:11— HarborNature.Build has cyclomatic complexity 47 (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.
CozyLanding.Layout (cyclomatic 47) games/cozysora/scripts/CozyLanding.cs:140— CozyLanding.Layout has cyclomatic complexity 47 (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.
ActorArt3D.Crewmate (cyclomatic 44) games/boats-n-beasts/source/presentation/ActorCrew3D.cs:32— ActorArt3D.Crewmate has cyclomatic complexity 44 (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.
EnvironmentArt3D.Shipwreck (cyclomatic 44) games/boats-n-beasts/source/presentation/EnvironmentLandmarks3D.cs:164— EnvironmentArt3D.Shipwreck has cyclomatic complexity 44 (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.
Voyage.UpdateWeapons (cyclomatic 42) games/boats-n-beasts/source/core/VoyageWeapons.cs:12— Voyage.UpdateWeapons has cyclomatic complexity 42 (threshold 15). Of this number, 37 points are the body's own statements and 5 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
EnvironmentArt3D.SettlementInterior (cyclomatic 40) games/boats-n-beasts/source/presentation/EnvironmentSettlements3D.cs:27— EnvironmentArt3D.SettlementInterior has cyclomatic complexity 40 (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.
HarborNature.Grass (cyclomatic 40) games/cozysora/maps/harbor_hills/HarborNature.cs:405— HarborNature.Grass has cyclomatic complexity 40 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
HarborNeighborhood.House (cyclomatic 40) games/cozysora/maps/harbor_hills/HarborNeighborhood.cs:59— HarborNeighborhood.House has cyclomatic complexity 40 (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.
CozyPlayer.UpdateGull (cyclomatic 40) games/cozysora/scripts/CozyPlayer.cs:392— CozyPlayer.UpdateGull has cyclomatic complexity 40 (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.
Voyage.UpdateShots (cyclomatic 36) games/boats-n-beasts/source/core/VoyageWeapons.cs:84— Voyage.UpdateShots has cyclomatic complexity 36 (threshold 15). Of this number, 31 points are the body's own statements and 5 belong to 4 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.
SeabreezeVegetation.GrassFields (cyclomatic 36) games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:361— SeabreezeVegetation.GrassFields has cyclomatic complexity 36 (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.
SeabreezeSettlements.Railway (cyclomatic 35) games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:823— SeabreezeSettlements.Railway has cyclomatic complexity 35 (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.
Voyage.UpdateEnemies (cyclomatic 33) games/boats-n-beasts/source/core/Voyage.cs:127— Voyage.UpdateEnemies has cyclomatic complexity 33 (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.
DaanNeighborhood.Building (cyclomatic 33) games/cozysora/maps/daan_gardens/DaanNeighborhood.cs:67— DaanNeighborhood.Building has cyclomatic complexity 33 (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.
ArtSample._UnhandledKeyInput (cyclomatic 32) games/boats-n-beasts/source/presentation/ArtSample.cs:99— ArtSample._UnhandledKeyInput has cyclomatic complexity 32 (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.
Game._Process (cyclomatic 29) games/boats-n-beasts/source/presentation/Game.cs:43— Game._Process 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.
IslandShape.IslandShape.ctor (cyclomatic 27) games/boats-n-beasts/source/core/IslandShape.cs:16— IslandShape.IslandShape.ctor has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
HarborWorld.HeightAt (cyclomatic 26) games/cozysora/maps/harbor_hills/HarborWorld.cs:125— HarborWorld.HeightAt has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
EnvironmentArt3D.Land (cyclomatic 25) games/boats-n-beasts/source/presentation/EnvironmentArt3D.cs:138— EnvironmentArt3D.Land has cyclomatic complexity 25 (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.
EnvironmentArt3D.Prison (cyclomatic 25) games/boats-n-beasts/source/presentation/EnvironmentSettlements3D.cs:95— EnvironmentArt3D.Prison has cyclomatic complexity 25 (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.
HarborDetails.ShopsAndHomes (cyclomatic 25) games/cozysora/maps/harbor_hills/HarborDetails.cs:104— HarborDetails.ShopsAndHomes has cyclomatic complexity 25 (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.
Voyage.UpdateMovement (cyclomatic 24) games/boats-n-beasts/source/core/VoyageMovement.cs:13— Voyage.UpdateMovement has cyclomatic complexity 24 (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.
Effects3D.Effect (cyclomatic 24) games/boats-n-beasts/source/presentation/Effects3D.cs:239— Effects3D.Effect 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.
Effects3D.DrawBurst (cyclomatic 24) games/boats-n-beasts/source/presentation/Effects3D.cs:254— Effects3D.DrawBurst 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.
Effects3D.SampleTrails (cyclomatic 23) games/boats-n-beasts/source/presentation/Effects3D.cs:95— Effects3D.SampleTrails 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.
HarborTransit.Build (cyclomatic 23) games/cozysora/maps/harbor_hills/HarborTransit.cs:13— HarborTransit.Build has cyclomatic complexity 23 (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.
SeabreezeVegetation.PlantBush (cyclomatic 23) games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:165— SeabreezeVegetation.PlantBush 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.
SeabreezeWorld.BuildTerrain (cyclomatic 23) games/cozysora/maps/seabreeze_village/SeabreezeWorld.cs:217— SeabreezeWorld.BuildTerrain has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
CozyPlayer.UpdateCat (cyclomatic 23) games/cozysora/scripts/CozyPlayer.cs:337— CozyPlayer.UpdateCat has cyclomatic complexity 23 (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.
DaanPlanting.PondPlants (cyclomatic 21) games/cozysora/maps/daan_gardens/DaanPlanting.cs:230— DaanPlanting.PondPlants 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.
HarborNeighborhood.CourtyardInfill (cyclomatic 21) games/cozysora/maps/harbor_hills/HarborNeighborhood.cs:294— HarborNeighborhood.CourtyardInfill has cyclomatic complexity 21 (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.
HarborWorld.Streets (cyclomatic 21) games/cozysora/maps/harbor_hills/HarborWorld.cs:240— HarborWorld.Streets has cyclomatic complexity 21 (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.
SeabreezeSettlements.House (cyclomatic 21) games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:183— SeabreezeSettlements.House has cyclomatic complexity 21 (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.
CozyPlayer._Process (cyclomatic 21) games/cozysora/scripts/CozyPlayer.Audio.cs:35— CozyPlayer._Process 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.
background.dispatch (cyclomatic 21) tools/hooks/slack/extension/background.mjs:68— background.dispatch has cyclomatic complexity 21 (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.
ArtSample.ShowIsland (cyclomatic 20) games/boats-n-beasts/source/presentation/ArtSample.cs:77— ArtSample.ShowIsland 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.
EnvironmentArt3D.PirateTavern (cyclomatic 20) games/boats-n-beasts/source/presentation/EnvironmentLandmarks3D.cs:17— EnvironmentArt3D.PirateTavern has cyclomatic complexity 20 (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.
SeabreezeFinishes.Surface (cyclomatic 20) games/cozysora/maps/seabreeze_village/SeabreezeFinishes.cs:10— SeabreezeFinishes.Surface 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.
CozyPlayer.PlaceCamera (cyclomatic 20) games/cozysora/scripts/CozyPlayer.cs:477— CozyPlayer.PlaceCamera 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.
EnvironmentArt3D.MarketStall (cyclomatic 19) games/boats-n-beasts/source/presentation/EnvironmentVillage3D.cs:50— EnvironmentArt3D.MarketStall 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.
HarborNature.SkylineAndBridge (cyclomatic 19) games/cozysora/maps/harbor_hills/HarborNature.cs:222— HarborNature.SkylineAndBridge 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.
HarborNeighborhood.Waterfront (cyclomatic 19) games/cozysora/maps/harbor_hills/HarborNeighborhood.cs:722— HarborNeighborhood.Waterfront 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.
SeabreezeVegetation.Rosettes (cyclomatic 19) games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:436— SeabreezeVegetation.Rosettes 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.
installation.configure (cyclomatic 19) tools/slack/src/agent_slack/installation.py:81— installation.configure 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.
Game.BuildMenu (cyclomatic 18) games/boats-n-beasts/source/presentation/Game.cs:209— Game.BuildMenu has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body's own statements and 5 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.
Hud._Draw (cyclomatic 18) games/boats-n-beasts/source/presentation/Game.cs:369— Hud._Draw has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
HarborDetails.HillsideBorders (cyclomatic 18) games/cozysora/maps/harbor_hills/HarborDetails.cs:229— HarborDetails.HillsideBorders has cyclomatic complexity 18 (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.
Conversation.handle (cyclomatic 18) tools/slack/src/agent_slack/conversation.py:34— Conversation.handle 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.
DaanPlanting.Build (cyclomatic 17) games/cozysora/maps/daan_gardens/DaanPlanting.cs:17— DaanPlanting.Build has cyclomatic complexity 17 (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.
HarborNeighborhood.GardensAndRoutes (cyclomatic 17) games/cozysora/maps/harbor_hills/HarborNeighborhood.cs:539— HarborNeighborhood.GardensAndRoutes has cyclomatic complexity 17 (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.
SeabreezeVegetation.Meadow (cyclomatic 17) games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:637— SeabreezeVegetation.Meadow 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.
D1 · Cyclomatic Complexity· history (cyclomatic 17) · ×1
history (cyclomatic 17) tools/hooks/slack/hook.js:74— history has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file's highest cyclomatic complexity: accepts (cyclomatic 18) 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 method is counted neither in this dimension's figures nor in its score.
OceanWorld.Landmarks (cyclomatic 16) games/boats-n-beasts/source/core/OceanWorld.cs:73— OceanWorld.Landmarks 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.
EnvironmentArt3D.IslandInterior (cyclomatic 16) games/boats-n-beasts/source/presentation/EnvironmentArt3D.cs:256— EnvironmentArt3D.IslandInterior 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.
Hud.DrawCompass (cyclomatic 16) games/boats-n-beasts/source/presentation/Game.cs:471— Hud.DrawCompass has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SeabreezeVegetation.PlantTree (cyclomatic 16) games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:127— SeabreezeVegetation.PlantTree 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.
SeabreezeVegetation.LandmarkFoliage (cyclomatic 16) games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:215— SeabreezeVegetation.LandmarkFoliage 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.
SeabreezeWorld.SurfaceAt (cyclomatic 16) games/cozysora/maps/seabreeze_village/SeabreezeWorld.cs:284— SeabreezeWorld.SurfaceAt 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.
CozyApplication._Ready (cyclomatic 16) games/cozysora/scripts/CozyApplication.cs:25— CozyApplication._Ready 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.
CozyPlayer.AnimateCat (cyclomatic 16) games/cozysora/scripts/CozyPlayer.Characters.cs:85— CozyPlayer.AnimateCat 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.
CozyPlayer._UnhandledInput (cyclomatic 16) games/cozysora/scripts/CozyPlayer.cs:270— CozyPlayer._UnhandledInput 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.
commands.load_commands (cyclomatic 16) tools/slack/src/agent_slack/commands.py:21— commands.load_commands 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.
relay.message (cyclomatic 16) tools/hooks/slack/extension/relay.js:33— relay.message 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.
Voyage.UpdateWeapons (cognitive 95) games/boats-n-beasts/source/core/VoyageWeapons.cs:12— Voyage.UpdateWeapons has cognitive complexity 95 (threshold 15). Of this number, 92 points are the body's own statements and 3 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
EnvironmentArt3D.Shipwreck (cognitive 82) games/boats-n-beasts/source/presentation/EnvironmentLandmarks3D.cs:164— EnvironmentArt3D.Shipwreck has cognitive complexity 82 (threshold 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.
CozyLanding.Layout (cognitive 82) games/cozysora/scripts/CozyLanding.cs:140— CozyLanding.Layout has cognitive complexity 82 (threshold 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.
Voyage.UpdateEnemies (cognitive 80) games/boats-n-beasts/source/core/Voyage.cs:127— Voyage.UpdateEnemies has cognitive complexity 80 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
HarborNeighborhood.House (cognitive 78) games/cozysora/maps/harbor_hills/HarborNeighborhood.cs:59— HarborNeighborhood.House has cognitive complexity 78 (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.
Voyage.UpdateShots (cognitive 73) games/boats-n-beasts/source/core/VoyageWeapons.cs:84— Voyage.UpdateShots has cognitive complexity 73 (threshold 15). Of this number, 69 points are the body's own statements and 4 belong to 4 function literals inside it that branch. To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
SeabreezeSettlements.Railway (cognitive 73) games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:823— SeabreezeSettlements.Railway has cognitive complexity 73 (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.
HarborNature.Build (cognitive 70) games/cozysora/maps/harbor_hills/HarborNature.cs:11— HarborNature.Build has cognitive complexity 70 (threshold 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.
DaanNeighborhood.Building (cognitive 67) games/cozysora/maps/daan_gardens/DaanNeighborhood.cs:67— DaanNeighborhood.Building has cognitive complexity 67 (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.
ActorArt3D.Crewmate (cognitive 66) games/boats-n-beasts/source/presentation/ActorCrew3D.cs:32— ActorArt3D.Crewmate has cognitive complexity 66 (threshold 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.
HarborDetails.ShopsAndHomes (cognitive 59) games/cozysora/maps/harbor_hills/HarborDetails.cs:104— HarborDetails.ShopsAndHomes has cognitive complexity 59 (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.
HarborNeighborhood.CourtyardInfill (cognitive 52) games/cozysora/maps/harbor_hills/HarborNeighborhood.cs:294— HarborNeighborhood.CourtyardInfill has cognitive complexity 52 (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.
SeabreezeVegetation.ForestDistribution (cognitive 49) games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:279— SeabreezeVegetation.ForestDistribution has cognitive complexity 49 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
HarborWorld.Streets (cognitive 47) games/cozysora/maps/harbor_hills/HarborWorld.cs:240— HarborWorld.Streets has cognitive complexity 47 (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.
EnvironmentArt3D.Land (cognitive 46) games/boats-n-beasts/source/presentation/EnvironmentArt3D.cs:138— EnvironmentArt3D.Land has cognitive complexity 46 (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.
HarborNature.SkylineAndBridge (cognitive 46) games/cozysora/maps/harbor_hills/HarborNature.cs:222— HarborNature.SkylineAndBridge has cognitive complexity 46 (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.
SeabreezeVegetation.GrassFields (cognitive 45) games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:361— SeabreezeVegetation.GrassFields has cognitive complexity 45 (threshold 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.
Game._Process (cognitive 43) games/boats-n-beasts/source/presentation/Game.cs:43— Game._Process has cognitive complexity 43 (threshold 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.
HarborNature.Grass (cognitive 43) games/cozysora/maps/harbor_hills/HarborNature.cs:405— HarborNature.Grass has cognitive complexity 43 (threshold 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.
CozyPlayer.UpdateGull (cognitive 43) games/cozysora/scripts/CozyPlayer.cs:392— CozyPlayer.UpdateGull has cognitive complexity 43 (threshold 15). 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.
HarborTransit.Build (cognitive 41) games/cozysora/maps/harbor_hills/HarborTransit.cs:13— HarborTransit.Build has cognitive complexity 41 (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.
HarborWorld.HeightAt (cognitive 40) games/cozysora/maps/harbor_hills/HarborWorld.cs:125— HarborWorld.HeightAt has cognitive complexity 40 (threshold 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.
SeabreezeVegetation.Rosettes (cognitive 39) games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:436— SeabreezeVegetation.Rosettes has cognitive complexity 39 (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.
SeabreezeSettlements.House (cognitive 38) games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:183— SeabreezeSettlements.House has cognitive complexity 38 (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.
SeabreezeFinishes.Surface (cognitive 37) games/cozysora/maps/seabreeze_village/SeabreezeFinishes.cs:10— SeabreezeFinishes.Surface has cognitive complexity 37 (threshold 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.
Effects3D.SampleTrails (cognitive 36) games/boats-n-beasts/source/presentation/Effects3D.cs:95— Effects3D.SampleTrails has cognitive complexity 36 (threshold 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.
HarborDetails.HillsideBorders (cognitive 36) games/cozysora/maps/harbor_hills/HarborDetails.cs:229— HarborDetails.HillsideBorders has cognitive complexity 36 (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.
EnvironmentArt3D.MarketStall (cognitive 35) games/boats-n-beasts/source/presentation/EnvironmentVillage3D.cs:50— EnvironmentArt3D.MarketStall has cognitive complexity 35 (threshold 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.
Effects3D.DrawBurst (cognitive 34) games/boats-n-beasts/source/presentation/Effects3D.cs:254— Effects3D.DrawBurst has cognitive complexity 34 (threshold 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.
HarborNeighborhood.GardensAndRoutes (cognitive 33) games/cozysora/maps/harbor_hills/HarborNeighborhood.cs:539— HarborNeighborhood.GardensAndRoutes has cognitive complexity 33 (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.
CozyPlayer._Process (cognitive 32) games/cozysora/scripts/CozyPlayer.Audio.cs:35— CozyPlayer._Process has cognitive complexity 32 (threshold 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.
CozyLeafPainter.Paint (cognitive 32) games/cozysora/shared/CozyLeafPainter.cs:10— CozyLeafPainter.Paint has cognitive complexity 32 (threshold 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.
HarborNature.Boats (cognitive 31) games/cozysora/maps/harbor_hills/HarborNature.cs:319— HarborNature.Boats has cognitive complexity 31 (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.
EnvironmentArt3D.Prison (cognitive 30) games/boats-n-beasts/source/presentation/EnvironmentSettlements3D.cs:95— EnvironmentArt3D.Prison has cognitive complexity 30 (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.
DaanPlanting.PondPlants (cognitive 30) games/cozysora/maps/daan_gardens/DaanPlanting.cs:230— DaanPlanting.PondPlants has cognitive complexity 30 (threshold 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.
Effects3D.Effect (cognitive 29) games/boats-n-beasts/source/presentation/Effects3D.cs:239— Effects3D.Effect has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
SeabreezeSettlements.Paddies (cognitive 29) games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:449— SeabreezeSettlements.Paddies has cognitive complexity 29 (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.
SeabreezeTextures.FlowerTexture (cognitive 29) games/cozysora/maps/seabreeze_village/SeabreezeTextures.cs:50— SeabreezeTextures.FlowerTexture has cognitive complexity 29 (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.
EnvironmentArt3D.PirateTavern (cognitive 28) games/boats-n-beasts/source/presentation/EnvironmentLandmarks3D.cs:17— EnvironmentArt3D.PirateTavern has cognitive complexity 28 (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.
HarborNeighborhood.Shop (cognitive 28) games/cozysora/maps/harbor_hills/HarborNeighborhood.cs:390— HarborNeighborhood.Shop has cognitive complexity 28 (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.
OceanWorld.Landmarks (cognitive 27) games/boats-n-beasts/source/core/OceanWorld.cs:73— OceanWorld.Landmarks has cognitive complexity 27 (threshold 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.
HarborDetails.HarborPlaces (cognitive 27) games/cozysora/maps/harbor_hills/HarborDetails.cs:303— HarborDetails.HarborPlaces has cognitive complexity 27 (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.
HarborNeighborhood.Waterfront (cognitive 27) games/cozysora/maps/harbor_hills/HarborNeighborhood.cs:722— HarborNeighborhood.Waterfront has cognitive complexity 27 (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.
commands.load_commands (cognitive 27) tools/slack/src/agent_slack/commands.py:21— commands.load_commands has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 5, loops 2 (3 pts), ternaries 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.
Effects3D.SyncEncounters (cognitive 26) games/boats-n-beasts/source/presentation/Effects3D.cs:316— Effects3D.SyncEncounters has cognitive complexity 26 (threshold 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.
HarborNeighborhood.StreetFurniture (cognitive 26) games/cozysora/maps/harbor_hills/HarborNeighborhood.cs:643— HarborNeighborhood.StreetFurniture has cognitive complexity 26 (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.
SeabreezeWorld.BuildTerrain (cognitive 26) games/cozysora/maps/seabreeze_village/SeabreezeWorld.cs:217— SeabreezeWorld.BuildTerrain has cognitive complexity 26 (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.
installation.configure (cognitive 26) tools/slack/src/agent_slack/installation.py:81— installation.configure has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 4, error handling 1, ternaries 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.
preview.main (cognitive 26) games/boats-n-beasts/tools/preview.py:37— preview.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 1, error handling 1, 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.
EnvironmentArt3D.SettlementInterior (cognitive 25) games/boats-n-beasts/source/presentation/EnvironmentSettlements3D.cs:27— EnvironmentArt3D.SettlementInterior has cognitive complexity 25 (threshold 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.
EffectsGeometry.BeveledBox (cognitive 24) games/boats-n-beasts/source/presentation/EffectsGeometry.cs:58— EffectsGeometry.BeveledBox has cognitive complexity 24 (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.
DaanPlanting.Build (cognitive 24) games/cozysora/maps/daan_gardens/DaanPlanting.cs:17— DaanPlanting.Build has cognitive complexity 24 (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.
CozyPlayer.UpdateCat (cognitive 24) games/cozysora/scripts/CozyPlayer.cs:337— CozyPlayer.UpdateCat has cognitive complexity 24 (threshold 15). 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.
Voyage.CollectEncounters (cognitive 23) games/boats-n-beasts/source/core/VoyageMovement.cs:49— Voyage.CollectEncounters has cognitive complexity 23 (threshold 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.
DaanPlanting.Understory (cognitive 23) games/cozysora/maps/daan_gardens/DaanPlanting.cs:176— DaanPlanting.Understory has cognitive complexity 23 (threshold 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.
CozyPlayer.Setup (cognitive 23) games/cozysora/scripts/CozyPlayer.cs:81— CozyPlayer.Setup has cognitive complexity 23 (threshold 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.
dispatch (cognitive 23) tools/hooks/slack/extension/background.mjs:68— dispatch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, loops 1 (2 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
Effects3D.DrawShot (cognitive 22) games/boats-n-beasts/source/presentation/Effects3D.cs:160— Effects3D.DrawShot has cognitive complexity 22 (threshold 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.
HarborNeighborhood.Approach (cognitive 22) games/cozysora/maps/harbor_hills/HarborNeighborhood.cs:240— HarborNeighborhood.Approach has cognitive complexity 22 (threshold 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.
CozyPlayer.PlaceCamera (cognitive 22) games/cozysora/scripts/CozyPlayer.cs:477— CozyPlayer.PlaceCamera has cognitive complexity 22 (threshold 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.
HarborNeighborhood.Plots (cognitive 21) games/cozysora/maps/harbor_hills/HarborNeighborhood.cs:33— HarborNeighborhood.Plots has cognitive complexity 21 (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.
SeabreezeSettlements.Village (cognitive 21) games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:311— SeabreezeSettlements.Village has cognitive complexity 21 (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.
SeabreezeSettlements.Fence (cognitive 21) games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:568— SeabreezeSettlements.Fence has cognitive complexity 21 (threshold 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.
SeabreezeTextures.GiantBarkMaterial (cognitive 21) games/cozysora/maps/seabreeze_village/SeabreezeTextures.cs:208— SeabreezeTextures.GiantBarkMaterial has cognitive complexity 21 (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.
CozyApplication._Ready (cognitive 21) games/cozysora/scripts/CozyApplication.cs:25— CozyApplication._Ready has cognitive complexity 21 (threshold 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.
IslandShape.IslandShape.ctor (cognitive 20) games/boats-n-beasts/source/core/IslandShape.cs:16— IslandShape.IslandShape.ctor has cognitive complexity 20 (threshold 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.
Voyage.Tick (cognitive 20) games/boats-n-beasts/source/core/Voyage.cs:78— Voyage.Tick has cognitive complexity 20 (threshold 15). Of this number, 17 points are the body's own statements and 3 belong to 2 function literals 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, 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.
EnvironmentArt3D.Build (cognitive 20) games/boats-n-beasts/source/presentation/EnvironmentArt3D.cs:12— EnvironmentArt3D.Build has cognitive complexity 20 (threshold 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.
Hud._Draw (cognitive 20) games/boats-n-beasts/source/presentation/Game.cs:369— Hud._Draw has cognitive complexity 20 (threshold 15). Of this number, 18 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Hud.DrawCompass (cognitive 20) games/boats-n-beasts/source/presentation/Game.cs:471— Hud.DrawCompass has cognitive complexity 20 (threshold 15). Of this number, 19 points are the body's own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HarborWorld.BackdropLand (cognitive 20) games/cozysora/maps/harbor_hills/HarborWorld.cs:205— HarborWorld.BackdropLand has cognitive complexity 20 (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.
SeabreezeSettlements.Roof (cognitive 20) games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:90— SeabreezeSettlements.Roof has cognitive complexity 20 (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.
SeabreezeSettlements.Poles (cognitive 20) games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:597— SeabreezeSettlements.Poles has cognitive complexity 20 (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.
D2 · Cognitive Complexity· history (cognitive 20) · ×1
history (cognitive 20) tools/hooks/slack/hook.js:74— history has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 3 (6 pts), loops 3 (4 pts), ternaries 1 (2 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.
ActorArt3D.BuildBoat (cognitive 19) games/boats-n-beasts/source/presentation/ActorArt3D.cs:108— ActorArt3D.BuildBoat has cognitive complexity 19 (threshold 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.
DaanPlanting.Grass (cognitive 19) games/cozysora/maps/daan_gardens/DaanPlanting.cs:280— DaanPlanting.Grass has cognitive complexity 19 (threshold 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.
HarborDetails.StreetGardens (cognitive 19) games/cozysora/maps/harbor_hills/HarborDetails.cs:20— HarborDetails.StreetGardens has cognitive 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.
HarborGeometry.Ribbon (cognitive 19) games/cozysora/maps/harbor_hills/HarborGeometry.cs:136— HarborGeometry.Ribbon has cognitive 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.
DaanWorld.Curve (cognitive 18) games/cozysora/maps/daan_gardens/DaanWorld.cs:128— DaanWorld.Curve has cognitive complexity 18 (threshold 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.
HarborWorld.Build (cognitive 18) games/cozysora/maps/harbor_hills/HarborWorld.cs:19— HarborWorld.Build has cognitive complexity 18 (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.
SeabreezeTextures.ShrineFlowerTexture (cognitive 18) games/cozysora/maps/seabreeze_village/SeabreezeTextures.cs:156— SeabreezeTextures.ShrineFlowerTexture has cognitive complexity 18 (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.
CozyPlayer._UnhandledInput (cognitive 18) games/cozysora/scripts/CozyPlayer.cs:270— CozyPlayer._UnhandledInput has cognitive complexity 18 (threshold 15). 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.
Conversation.handle (cognitive 18) tools/slack/src/agent_slack/conversation.py:34— Conversation.handle has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7, if/else 5 (6 pts), boolean chains 5 (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.
OceanWorld.AddBarrel (cognitive 17) games/boats-n-beasts/source/core/OceanWorld.cs:150— OceanWorld.AddBarrel has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
ActorGeometry.Tube (cognitive 17) games/boats-n-beasts/source/presentation/ActorGeometry.cs:101— ActorGeometry.Tube has cognitive complexity 17 (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.
Effects3D.Sync (cognitive 17) games/boats-n-beasts/source/presentation/Effects3D.cs:58— Effects3D.Sync has cognitive complexity 17 (threshold 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.
SeabreezePlantMeshes.Canopy (cognitive 17) games/cozysora/maps/seabreeze_village/SeabreezePlantMeshes.cs:66— SeabreezePlantMeshes.Canopy has cognitive complexity 17 (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.
SeabreezeSettlements.VendingMachine (cognitive 17) games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:658— SeabreezeSettlements.VendingMachine has cognitive complexity 17 (threshold 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.
SeabreezeSettlements.Car (cognitive 17) games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:758— SeabreezeSettlements.Car has cognitive complexity 17 (threshold 15). 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.
SeabreezeSettlements.VillageUtilityYard (cognitive 17) games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:1076— SeabreezeSettlements.VillageUtilityYard has cognitive complexity 17 (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.
SeabreezeTextures.LeafTexture (cognitive 17) games/cozysora/maps/seabreeze_village/SeabreezeTextures.cs:7— SeabreezeTextures.LeafTexture has cognitive complexity 17 (threshold 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.
SeabreezeVegetation.PlantBush (cognitive 17) games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:165— SeabreezeVegetation.PlantBush has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
SeabreezeVegetation.LandmarkFoliage (cognitive 17) games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:215— SeabreezeVegetation.LandmarkFoliage has cognitive complexity 17 (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.
SeabreezeWorld.BuildRoads (cognitive 17) games/cozysora/maps/seabreeze_village/SeabreezeWorld.cs:115— SeabreezeWorld.BuildRoads has cognitive complexity 17 (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.
CozyApplication._Process (cognitive 17) games/cozysora/scripts/CozyApplication.Captures.cs:15— CozyApplication._Process has cognitive complexity 17 (threshold 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.
CozyMeshBatches.CollectStatic (cognitive 17) games/cozysora/shared/CozyMeshBatches.cs:80— CozyMeshBatches.CollectStatic has cognitive complexity 17 (threshold 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.
Voyage.Spawn (cognitive 16) games/boats-n-beasts/source/core/Voyage.cs:111— Voyage.Spawn has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
ArtSample._UnhandledKeyInput (cognitive 16) games/boats-n-beasts/source/presentation/ArtSample.cs:99— ArtSample._UnhandledKeyInput has cognitive complexity 16 (threshold 15). 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.
Effects3D.DrawEncounters (cognitive 16) games/boats-n-beasts/source/presentation/Effects3D.cs:423— Effects3D.DrawEncounters has cognitive 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.
DaanFurnishings.Pavilion (cognitive 16) games/cozysora/maps/daan_gardens/DaanFurnishings.cs:94— DaanFurnishings.Pavilion has cognitive 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.
SeabreezeSettlements.Line (cognitive 16) games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:52— SeabreezeSettlements.Line has cognitive complexity 16 (threshold 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.
SeabreezeSettlements.PaddyGuardrail (cognitive 16) games/cozysora/maps/seabreeze_village/SeabreezeSettlements.cs:1169— SeabreezeSettlements.PaddyGuardrail has cognitive complexity 16 (threshold 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.
SeabreezeVegetation.PlantTree (cognitive 16) games/cozysora/maps/seabreeze_village/SeabreezeVegetation.cs:127— SeabreezeVegetation.PlantTree has cognitive complexity 16 (threshold 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.
SeabreezeWorld.BuildCoastProps (cognitive 16) games/cozysora/maps/seabreeze_village/SeabreezeWorld.Props.cs:67— SeabreezeWorld.BuildCoastProps has cognitive 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.
connect (cognitive 16) tools/hooks/slack/hook.js:148— connect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 2, error handling 2 (nesting depth added 1). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 7 function items inside it that branch (onmessage, onerror, onclose, …). 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 (16 corresponding lines) · ×1
Edited copy of a member (16 corresponding lines) games/cozysora/maps/daan_gardens/DaanNeighborhood.cs:260— games/cozysora/maps/daan_gardens/DaanNeighborhood.cs:260-278 | games/cozysora/maps/harbor_hills/HarborNeighborhood.cs:706-721 — These two members are one piece of code written twice and then edited apart: 16 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) games/cozysora/maps/daan_gardens/DaanPlanting.cs:70— games/cozysora/maps/daan_gardens/DaanPlanting.cs:70-86 | games/cozysora/maps/harbor_hills/HarborTextures.cs:8-26 — 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· Edited copy of a member (20 corresponding lines) · ×1
Edited copy of a member (20 corresponding lines) tools/hooks/slack/agents/codex.py:14— tools/hooks/slack/agents/codex.py:14-43 | tools/slack/src/agent_slack/wrappers/codex.py:12-31 — These two members are one piece of code written twice and then edited apart: 20 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 (7 corresponding lines) · ×1
Edited copy of a member (7 corresponding lines) tools/slack/src/agent_slack/cli.py:25— tools/slack/src/agent_slack/cli.py:25-31 | tools/slack/src/agent_slack/installation.py:192-199 — These two members are one piece of code written twice and then edited apart: 7 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.
Duplicated block (11–12 lines × 2) games/cozysora/maps/harbor_hills/HarborNature.cs:29— games/cozysora/maps/harbor_hills/HarborNature.cs:29-40 | games/cozysora/maps/harbor_hills/HarborNature.cs:86-96 — 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 `games/cozysora/maps/harbor_hills/HarborNature.cs:29` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 2) games/cozysora/maps/daan_gardens/DaanPlanting.cs:281— games/cozysora/maps/daan_gardens/DaanPlanting.cs:281-287 | games/cozysora/maps/daan_gardens/DaanPlanting.cs:349-355 — 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 `games/cozysora/maps/daan_gardens/DaanPlanting.cs:281` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (3–5 lines × 4) games/boats-n-beasts/source/presentation/EnvironmentLandmarks3D.cs:125— games/boats-n-beasts/source/presentation/EnvironmentLandmarks3D.cs:125-130 | games/boats-n-beasts/source/presentation/EnvironmentLandmarks3D.cs:146-148 | games/boats-n-beasts/source/presentation/EnvironmentVillage3D.cs:9-11 | games/boats-n-beasts/source/presentation/EnvironmentVillage3D.cs:21-25 — there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication· Edited copy of a member (29 corresponding lines) · ×1
Edited copy of a member (29 corresponding lines) tools/overlay/app/src/main/java/com/sanogueralorenzo/overlay/home/HomeScreen.kt:94— tools/overlay/app/src/main/java/com/sanogueralorenzo/overlay/home/HomeScreen.kt:94-122 | tools/voice/android/app/src/main/java/com/sanogueralorenzo/voice/home/VoiceHomeScreen.kt:123-158 — These two members are one piece of code written twice and then edited apart: 29 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 (14 corresponding lines) · ×1
Edited copy of a member (14 corresponding lines) tools/browser/Lean/Features/Downloads/BrowserStore+Downloads.swift:52— tools/browser/Lean/Features/Downloads/BrowserStore+Downloads.swift:52-67 | tools/browser/Lean/Features/Downloads/BrowserStore+Downloads.swift:69-82 — These two members are one piece of code written twice and then edited apart: 14 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 (11 corresponding lines) · ×1
Edited copy of a member (11 corresponding lines) tools/browser/Lean/Features/Browser/AddressPalette.swift:114— tools/browser/Lean/Features/Browser/AddressPalette.swift:114-129 | tools/browser/Lean/Features/Sidebar/BrowserUtilityList.swift:105-115 — These two members are one piece of code written twice and then edited apart: 11 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 (13 corresponding lines) · ×1
Edited copy of a member (13 corresponding lines) tools/browser/Lean/Features/Browser/BrowserPage.swift:339— tools/browser/Lean/Features/Browser/BrowserPage.swift:339-352 | tools/browser/Lean/Features/Downloads/BrowserDownload.swift:193-205 — These two members are one piece of code written twice and then edited apart: 13 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 (18 corresponding lines) · ×1
Edited copy of a member (18 corresponding lines) tools/overlay/app/src/main/java/com/sanogueralorenzo/overlay/ui/components/ScreenSections.kt:27— tools/overlay/app/src/main/java/com/sanogueralorenzo/overlay/ui/components/ScreenSections.kt:27-47 | tools/voice/android/app/src/main/java/com/sanogueralorenzo/voice/ui/components/ScreenSections.kt:30-47 — These two members are one piece of code written twice and then edited apart: 18 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 (6 corresponding lines) · ×1
Edited copy of a member (6 corresponding lines) tools/browser/Lean/Features/Sidebar/BrowserCollapsedSidebarHoverTrackingView.swift:46— tools/browser/Lean/Features/Sidebar/BrowserCollapsedSidebarHoverTrackingView.swift:46-63 | tools/clipboard/Sources/ClipboardMenu.swift:74-79 — These two members are one piece of code written twice and then edited apart: 6 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 (8 corresponding lines) · ×1
Edited copy of a member (8 corresponding lines) tools/browser/Lean/Features/Sidebar/BrowserSidebarHoverTrackingView.swift:108— tools/browser/Lean/Features/Sidebar/BrowserSidebarHoverTrackingView.swift:108-120 | tools/browser/Lean/Features/Sidebar/BrowserCollapsedSidebarHoverTrackingView.swift:23-30 — These two members are one piece of code written twice and then edited apart: 8 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.
Duplicated block (7–8 lines × 2) tools/browser/Lean/Features/Browser/AddressPalette.swift:123— tools/browser/Lean/Features/Browser/AddressPalette.swift:123-129 | tools/browser/Lean/Features/Sidebar/BrowserUtilityList.swift:108-115 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `tools/browser/Lean/Features/Browser/AddressPalette.swift:123` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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.
Duplicated block (18 lines × 2) tools/overlay/app/src/main/java/com/sanogueralorenzo/overlay/ui/components/ScreenSections.kt:91— tools/overlay/app/src/main/java/com/sanogueralorenzo/overlay/ui/components/ScreenSections.kt:91-108 | tools/voice/android/app/src/main/java/com/sanogueralorenzo/voice/ui/components/ScreenSections.kt:57-74 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `tools/overlay/app/src/main/java/com/sanogueralorenzo/overlay/ui/components/ScreenSections.kt:91` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Coverage not measured — .NET and JavaScript/TypeScript suite — Coverage NOT MEASURED: the .NET half could not be measured — no coverage produced (collector absent, or test run exceeded the inline budget); the JavaScript/TypeScript half could not be measured — the its own test command under node's V8 coverage suite in tools/agent/ ran and not one test passed (code: 'ERR_TEST_FAILURE'), so the coverage report describes the failed run, not the code. This repository's production source spans both ecosystems, and no partial figure is published as if it were the whole: coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan.
Duplicated block (10 lines × 2 locations) tools/agent/src/request-scheduling.ts:63— tools/agent/src/request-scheduling.ts:63 · tools/agent/src/request-scheduling.ts:133 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (9 lines × 2 locations) tools/agent/src/request-scheduling.ts:20— tools/agent/src/request-scheduling.ts:20 · tools/agent/src/request-scheduling.ts:83 — 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 (8 lines × 2 locations) tools/agent/src/providers.ts:76— tools/agent/src/providers.ts:76 · tools/agent/src/providers.ts:124 — 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 locations) tools/agent/src/request-tasks.ts:68— tools/agent/src/request-tasks.ts:68 · tools/agent/src/request-tasks.ts:101 — 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.
Complex function (anonymous) (cyclomatic 42, cognitive 76) REDACTED:38— (anonymous) has cyclomatic complexity 42 and cognitive complexity 76; 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 51) tools/agent/src/state.ts:149— (anonymous) has cyclomatic complexity 32 and cognitive complexity 51; 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 28, cognitive 30) tools/agent/web/composer.js:189— (anonymous) has cyclomatic complexity 28 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 onmessage (cyclomatic 21, cognitive 36) tools/agent/web/app.js:180— onmessage has cyclomatic complexity 21 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 dispatch (cyclomatic 21, cognitive 23) tools/hooks/slack/extension/background.mjs:68— dispatch has cyclomatic complexity 21 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 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 submitSession (cyclomatic 21, cognitive 19) tools/agent/src/agent.ts:108— submitSession has cyclomatic complexity 21 and cognitive complexity 19; 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 20, cognitive 24) tools/agent/src/request-tasks.ts:70— (anonymous) has cyclomatic complexity 20 and cognitive complexity 24; 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 loginHTML (cyclomatic 20, cognitive 20) tools/agent/web/providers.js:43— loginHTML has cyclomatic complexity 20 and cognitive complexity 20; 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 renderMarkdown (cyclomatic 17, cognitive 28) tools/agent/web/view.js:63— renderMarkdown has cyclomatic complexity 17 and cognitive complexity 28; 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 sync (cyclomatic 17, cognitive 20) tools/agent/web/composer.js:128— sync has cyclomatic complexity 17 and cognitive complexity 20; 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 history (cyclomatic 17, cognitive 20) · ×1
Complex function history (cyclomatic 17, cognitive 20) tools/hooks/slack/hook.js:74— history has cyclomatic complexity 17 and cognitive complexity 20; 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 nativeSearchPayload (cyclomatic 17, cognitive 16) tools/agent/src/native-search.ts:43— nativeSearchPayload has cyclomatic complexity 17 and cognitive complexity 16; 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 16, cognitive 31) tools/agent/src/request-scheduling.ts:105— (anonymous) has cyclomatic complexity 16 and cognitive complexity 31; 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 activityPill (cyclomatic 16, cognitive 15) tools/agent/web/app.js:39— activityPill has cyclomatic complexity 16 and cognitive complexity 15; 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 message (cyclomatic 16, cognitive 14) tools/hooks/slack/extension/relay.js:33— message has cyclomatic complexity 16 and cognitive complexity 14; 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 render (cyclomatic 15, cognitive 16) tools/agent/web/app.js:103— render has cyclomatic complexity 15 and cognitive complexity 16; 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 15, cognitive 13) tools/agent/src/state.ts:197— (anonymous) has cyclomatic complexity 15 and cognitive complexity 13; 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 suggestionTarget (cyclomatic 14, cognitive 16) tools/agent/web/composer.js:6— suggestionTarget has cyclomatic complexity 14 and cognitive complexity 16; 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 update (cyclomatic 14, cognitive 16) tools/agent/web/providers.js:126— update has cyclomatic complexity 14 and cognitive complexity 16; 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 13, cognitive 28) tools/agent/src/state.ts:52— (anonymous) has cyclomatic complexity 13 and cognitive complexity 28; 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 13, cognitive 18) tools/agent/evals/delegation.test.mjs:57— (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; 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 fastModePayload (cyclomatic 13, cognitive 13) tools/agent/src/fast-mode.ts:30— fastModePayload has cyclomatic complexity 13 and cognitive complexity 13; 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 13, cognitive 12) tools/agent/web/app.js:161— (anonymous) has cyclomatic complexity 13 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.
Complex function escape (cyclomatic 13, cognitive 12) tools/agent/web/composer.js:170— escape has cyclomatic complexity 13 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.
Complex function (anonymous) (cyclomatic 12, cognitive 19) tools/agent/src/state.ts:83— (anonymous) has cyclomatic complexity 12 and cognitive complexity 19; 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 open (cyclomatic 12, cognitive 18) · ×1
Complex function open (cyclomatic 12, cognitive 18) tools/agent/src/agent.ts:43— open has cyclomatic complexity 12 and cognitive complexity 18; 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 parseRoute (cyclomatic 12, cognitive 15) tools/agent/src/home-routing.ts:11— parseRoute has cyclomatic complexity 12 and cognitive complexity 15; 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 handleClick (cyclomatic 12, cognitive 13) tools/agent/web/providers.js:156— handleClick has cyclomatic complexity 12 and cognitive complexity 13; 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 html (cyclomatic 12, cognitive 10) · ×1
Complex function html (cyclomatic 12, cognitive 10) tools/agent/web/providers.js:84— html has cyclomatic complexity 12 and cognitive complexity 10; 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 11, cognitive 39) tools/agent/evals/providers.test.mjs:276— (anonymous) has cyclomatic complexity 11 and cognitive complexity 39; 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 observe (cyclomatic 11, cognitive 13) tools/agent/src/native-search.ts:14— observe has cyclomatic complexity 11 and cognitive complexity 13; 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 call (cyclomatic 11, cognitive 12) tools/agent/src/computer-use.ts:36— call has cyclomatic complexity 11 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 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 login (cyclomatic 11, cognitive 12) tools/agent/src/providers-cli.ts:8— login has cyclomatic complexity 11 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 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 update (cyclomatic 11, cognitive 12) tools/hooks/slack/extension/background.mjs:30— update has cyclomatic complexity 11 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 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 messageStatus (cyclomatic 11, cognitive 11) tools/agent/web/app.js:28— messageStatus has cyclomatic complexity 11 and cognitive complexity 11; 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 thumbsUpButton (cyclomatic 11, cognitive 10) tools/agent/web/message-actions.js:25— thumbsUpButton has cyclomatic complexity 11 and cognitive complexity 10; 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 renderMessage (cyclomatic 11, cognitive 10) tools/agent/web/view.js:127— renderMessage has cyclomatic complexity 11 and cognitive complexity 10; 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.
No lint script — test ✓ · lint ✗ · typecheck ✓ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.
Duplicated predicate tools/agent/src/fast-mode.ts:32— `!payload || typeof payload !== "object" || Array.isArray(payload)` appears character-identically in 2 files — tools/agent/src/fast-mode.ts, tools/agent/src/native-search.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/agent/src/pi.ts:43— `(await api.agent(context)).cwd || process.cwd()` appears character-identically in 2 files — tools/agent/src/pi.ts, tools/agent/src/working-directory.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/agent/src/delegation.ts:21— `result.status !== "done" || result.type !== "input"` appears character-identically in 2 files — tools/agent/src/delegation.ts, tools/agent/src/request-tasks.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/hooks/slack/agents/claude.py:30— `result.returncode or response.get("is_error")` appears character-identically in 2 files — tools/hooks/slack/agents/claude.py, tools/slack/src/agent_slack/wrappers/claude.py. 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/browser/Lean/Features/Sidebar/BrowserTabRow.swift:28— `$0.id == tab.folderID && $0.kind == .github` appears character-identically in 2 files — tools/browser/Lean/Features/Sidebar/BrowserTabRow.swift, tools/browser/Lean/Features/Tabs/BrowserStore+Tabs.swift. 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/browser/Lean/Features/Sidebar/BrowserSidebarReorderState.swift:592— `$0.kind == .github && !folders.contains($0.id)` appears character-identically in 2 files — tools/browser/Lean/Features/Sidebar/BrowserSidebarReorderState.swift, tools/browser/Lean/Features/Sidebar/BrowserStore+SidebarMoves.swift. 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/browser/Lean/Features/Sidebar/BrowserSidebarOutline.swift:35— `available.contains($0) && seen.insert($0).inserted` appears character-identically in 2 files — tools/browser/Lean/Features/Sidebar/BrowserSidebarOutline.swift, tools/browser/Lean/Features/SplitView/BrowserStore+Splits.swift. 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/browser/Lean/Features/Sidebar/BrowserSidebarReorderState.swift:586— `folders.contains($0.id) && $0.kind == .github` appears character-identically in 2 files — tools/browser/Lean/Features/Sidebar/BrowserSidebarReorderState.swift, tools/browser/Lean/Features/Sidebar/BrowserStore+SidebarMoves.swift. 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.
Thin README README.md:1— The root README is 116 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, in the README and in the repository documents it links, it found no a testing section. Sections are matched on HEADING text only, so material written under a heading this check does not recognise — or with no heading at all — is not seen and this row may understate what the document covers.
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.
No SAST — No static application security testing detected. For this repository's stack, add CodeQL's Swift pack (Swift/Xcode) (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 1 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
No dependency-update automation site/package.json:9— `site/package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
R7 · Dead Code· Unused export 'cancelDelegations' · ×1
Unused export 'cancelDelegations' tools/agent/src/delegation.ts:94— Nothing imports this binding — it is safe to review for removal.
Null-forgiving operator (`!`) suppressions override nullable warnings — ~0.7 `!` suppressions per 1k syntax nodes — 125 suppression(s) across the 187223 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a `!` can suppress anything in (a `!` under `#nullable disable` is inert and is not counted, and its file's nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.
Silent fallback default in catch tools/agent/web/providers.js:27— `createProviders.safeURL` swallows every exception into `return ""` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. 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.
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.
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
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 26 file(s) — `games/boats-n-beasts/source/core/OceanWorld.cs`, `games/cozysora/scripts/CozyPlayer.Audio.cs`, `tools/androidsteam/app/src/debug/java/com/sanogueralorenzo/androidsteam/session/LoginProofActivity.kt`, `tools/androidsteam/app/src/main/java/com/sanogueralorenzo/androidsteam/MainActivity.kt`, `tools/androidsteam/app/src/main/java/com/sanogueralorenzo/androidsteam/input/SteamKeys.kt`, … (+21 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
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 01a1e56f-e24e-772e-ba6d-4b1e16a6f787 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 20 · Warnings: 323 · Recommendations: 17 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 16-11-2026 @ 17:37 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.