Public report of DualBrain/Samples, published 15 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 report Measured 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, 15 November 2026, 02:57 UTC · Survey ID cd_4f69a2dff04445fab6104558064c719e

DualBrain/Samples

Measured 15 November 2026, 02:56 UTC, at code version 37edcf3

Code coverage is not measured: Tests deferred to the consumer.

Test reliability is not measured: No test run produced results.

Boundary Type-Coupling is not measured: Bounded contexts not declared.

CAI score 57out of 100 Adequate
CriticalWeakAdequateStrongExemplary
Up 2 since the last survey

The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.

A medium codebase: 28,651 lines of product code in 75 projects, tests not counted · Estimated rebuild effort: about 0.2 person-years · Weakest lens: Code Health, 41

Findings by how serious they are

9 critical 382 serious 152 minor

5 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

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
15 November 2026, 02:56 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 ▸

35of 35 dimensions measured by tools.
536of 543 findings point to an exact file and line, so you can open each one in the code. The other 7 concern the repository as a whole, such as missing documentation.
35dimensions across 5 lenses, read from 28,651 lines of product code in 75 projects.
Chapters

Executive summary

DualBrain/Samples falls short of our standard for a template or a sample, held back most by its Code Health lens, the quality of the code itself. It scores 57 out of 100 and is rated Adequate, and none of its nine critical findings concern security.

Code Health, at 41, is the weakest lens and counts most in the score. The best first steps are fixing the four errors swallowed by On Error Resume Next and handling the discarded errors, each worth about 9 points. Raising Code Health to 63 would lift the score to about 67.

Nine errors are caught and ignored, so failures can go unnoticed. Handling or logging the ignored errors would close this risk.

The product code is 28,651 lines, about €31,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 for The 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.
Code Health 41 · counts for 47%Maturity 64 · counts for 26%Production Readiness 65 · counts for 14%Security and Compliance 88 · counts for 8%Architecture 99 · counts for 4%

If Code Health rose from 41 to 63, the lowest score rated Strong, the score would rise from 57 to about 67.

Code composition: what the lines of code are
Supporting code 1%Generated by tools 99%
New since the last survey: 25 findings

These 25 critical or serious findings weren't in the previous survey, on 29 October 2026.

  • Code Duplication · Edited copy of a member (174 corresponding lines) GUI/SDL2_Gameloop/Program.vb
  • Code Duplication · Edited copy of a member (97 corresponding lines) GUI/SDL2_Gameloop/Program.vb
  • Code Duplication · Edited copy of a member (106 corresponding lines) WinFormsApp1/Form1.vb
  • Code Duplication · Edited copies of one member (3 members, 52+ corresponding lines) PLAYground/ParsePlayMacro.vb
  • Code Duplication · Edited copy of a member (76 corresponding lines) OLC/Other/Synth1/Program.vb
  • Code Duplication · Edited copy of a member (57 corresponding lines) Transpiler/RemLine.vb
  • Code Duplication · Edited copy of a member (25 corresponding lines) Sound/ThreadPlayer/Program.vb
  • Code Duplication · Edited copy of a member (35 corresponding lines) QBasic/RemLine/Program.vb
  • Code Duplication · Edited copy of a member (38 corresponding lines) QBasic/RemLine/Program.vb
  • Code Duplication · Edited copy of a member (29 corresponding lines) QBasic/Gorilla/Form1.vb
  • Code Duplication · Edited copy of a member (17 corresponding lines) WinFormsApp1/Community.Windows.FormsEx/PanelEx.vb
  • Code Duplication · Edited copies of one member (3 members, 28+ corresponding lines) OLC/Other/Synth2/Program.vb
  • Code Duplication · Edited copies of one member (3 members, 29+ corresponding lines) QBasic/RemLine/Program.vb
  • Code Duplication · Edited copies of one member (3 members, 36+ corresponding lines) QBasic/RemLine/Program.vb
  • Code Duplication · Edited copies of one member (6 members, 9+ corresponding lines) OLC/Other/Synth3/Program.vb
  • Code Duplication · Edited copy of a member (11 corresponding lines) SoundBeepPlay/SoundGenerator.vb
  • Code Duplication · Edited copies of one member (4 members, 9+ corresponding lines) OLC/Other/Synth1/olcNoiseMaker.vb
  • Code Duplication · Edited copy of a member (14 corresponding lines) QBasic/Gorilla/Form1.vb
  • Code Duplication · Edited copy of a member (2 corresponding lines) WinFormsApp1/Community.Windows.FormsEx/HScrollBarEx.vb
  • Code Duplication · Edited copy of a member (10 corresponding lines) Serial/Term/SerialTerminal2.vb
  • Code Duplication · Edited copy of a member (2 corresponding lines) WinFormsApp1/Community.Windows.FormsEx/VScrollBarEx.vb
  • Code Duplication · Edited copy of a member (6 corresponding lines) Transpiler/RemLine.vb
  • Code Duplication · Edited copy of a member (4 corresponding lines) GUI/SDL2_Gameloop/Program.vb
  • Code Duplication · Edited copy of a member (5 corresponding lines) WinFormsApp1/Form1.vb
  • Code Duplication · Edited copy of a member (4 corresponding lines) Serial/Term/SerialTerminal2.vb

We compare every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.

Fixed since the last survey: 2 findings

These 2 critical or serious findings were in the previous survey, on 29 October 2026, and are gone from this one.

  • Code Duplication · Edited copy of a member (39 corresponding lines) WinFormsApp1/Community.Windows.FormsEx/PanelEx.vb
  • Code Duplication · Duplicated block (6 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/PanelEx.vb
Rebuild cost: about €31,000 · Estimate
Cost to rebuild€10,000 to €51,000, for 171 to 541 hours of work, about 0.2 person-years for one engineer
Difficulty of the problemStandard, 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 57. 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.
SizeMedium: 28,651 lines of product code
Comment linesThe estimate prices 28,649 lines. Comment lines count towards the size of 28,651 lines but aren't priced as work.
What it is notNot 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
Resolve the 4 OnErrorResumeSwallow finding(s) in Explicit Debt — start with Form1.vb (4).
Raises the score by about 9 points · Low effort · Explicit Debt
2
Resolve the 5 EmptyCatchBlock finding(s) in Explicit Debt — start with Program.vb (4), Player3.vb.
Raises the score by about 9 points · Low effort · Explicit Debt
3
Enable <Nullable>enable</Nullable> across all projects and resolve warnings rather than suppressing with `!`.
Raises the score by about 12 points · Medium effort · Nullable reference types

Diagnosis: what the measurements show together

Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.

Where the investment is most exposed · Value at risk
This code would cost about €31,000 to build again, about 0.2 person-years of work. Its weakest lens is Code Health, at 41 (Weak). Code Health is about how easy the code is to read and change safely, and code that is hard to read is slow and risky to change, so every future change costs more than it should. Because the weakest lens counts most in the score, work on Code Health also moves the score most.
Based on: the rebuild estimate · the Code Health grade · how much each lens counts
What to do: Start with the Code Health actions in Top priorities.
If you do one thing first · First action
Resolve the 4 OnErrorResumeSwallow finding(s) in Explicit Debt. Of all the actions in this report, it raises the score most for the work it takes: about 9 points for low effort, because it clears the 4 Explicit Debt findings. 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 4.7 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 8% to 18% on every change. The history of the code shows how much it changes: about 3,486 lines over the last 90 days, which is about 14,138 lines a year. At that pace, the extra work comes to an estimated 2.9 to 17.4 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 — module dependency graph

Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.

arch 01_AceyDucey 01_AceyDucey 02_Amazing 02_Amazing 2secTone 2secTone 30_Cube 30_Cube Audio Audio Browser Browser BrowserFx BrowserFx CaveDiver CaveDiver CenturionSide CenturionSide ClassLibrary1 ClassLibrary1 CompareFolders CompareFolders CompileHelloWorld CompileHelloWorld ConsoleApp1 ConsoleApp1 ConsoleApp1->ClassLibrary1 ContTone ContTone EmbeddingLua_Part1 EmbeddingLua_Part1 FFMpeg FFMpeg FNA_Gameloop FNA_Gameloop FileSystemWatcherSample FileSystemWatcherSample GameLoop1 GameLoop1 GameLoop2 GameLoop2 __more__ +51 more projects

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.

145 modules, with 2 dependencies between them. Every module uses only modules listed above it, so there are no loops.

The table shows the 40 modules with the most connections; 105 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.
uses →1 AceyDucey2 AceyDucey.My3 Amazing4 Amazing.My5 Audio6 Audio.My7 Browser8 Browser.My9 BrowserFx10 BrowserFx.My11 CaveDiver12 CaveDiver.My13 CenturionSide14 CenturionSide.My15 ClassLibrary116 ClearScriptExample17 ClearScriptExample.My18 Community.VisualBasic.Inline19 Community.Windows.FormsEx20 CompareFolders21 CompareFolders.My22 CompileHelloWorld23 CompileHelloWorld.My24 ConsoleApp1.My25 ContTone26 ContTone.My27 DualBrain28 DualBrain.My29 EmbeddingLua_Part130 EmbeddingLua_Part1.My31 FFMpeg32 FFMpeg.My33 FNA_Gameloop34 FNA_Gameloop.My35 GameLoop136 GameLoop1.My37 GameLoop238 GameLoop2.My39 ConsoleApp140 WinFormsApp1
1 AceyDucey
2 AceyDucey.My
3 Amazing
4 Amazing.My
5 Audio
6 Audio.My
7 Browser
8 Browser.My
9 BrowserFx
10 BrowserFx.My
11 CaveDiver
12 CaveDiver.My
13 CenturionSide
14 CenturionSide.My
15 ClassLibrary1
16 ClearScriptExample
17 ClearScriptExample.My
18 Community.VisualBasic.Inline
19 Community.Windows.FormsEx
20 CompareFolders
21 CompareFolders.My
22 CompileHelloWorld
23 CompileHelloWorld.My
24 ConsoleApp1.My
25 ContTone
26 ContTone.My
27 DualBrain
28 DualBrain.My
29 EmbeddingLua_Part1
30 EmbeddingLua_Part1.My
31 FFMpeg
32 FFMpeg.My
33 FNA_Gameloop
34 FNA_Gameloop.My
35 GameLoop1
36 GameLoop1.My
37 GameLoop2
38 GameLoop2.My
39 ConsoleApp11
40 WinFormsApp13
Uses a module listed above itPart of a loopThe module itself
1 AceyDucey2 AceyDucey.My3 Amazing4 Amazing.My5 Audio6 Audio.My7 Browser8 Browser.My9 BrowserFx10 BrowserFx.My11 CaveDiver12 CaveDiver.My13 CenturionSide14 CenturionSide.My15 ClassLibrary116 ClearScriptExample17 ClearScriptExample.My18 Community.VisualBasic.Inline19 Community.Windows.FormsEx20 CompareFolders21 CompareFolders.My22 CompileHelloWorld23 CompileHelloWorld.My24 ConsoleApp1.My25 ContTone26 ContTone.My27 DualBrain28 DualBrain.My29 EmbeddingLua_Part130 EmbeddingLua_Part1.My31 FFMpeg32 FFMpeg.My33 FNA_Gameloop34 FNA_Gameloop.My35 GameLoop136 GameLoop1.My37 GameLoop238 GameLoop2.My39 ConsoleApp140 WinFormsApp1AceyDucey1AceyDucey.My2Amazing3Amazing.My4Audio5Audio.My6Browser7Browser.My8BrowserFx9BrowserFx.My10CaveDiver11CaveDiver.My12CenturionSide13CenturionSide.My14ClassLibrary115ClearScriptExample16ClearScriptExample.My17Community.VisualBasic.Inline18Community.Windows.FormsEx19CompareFolders20CompareFolders.My21CompileHelloWorld22CompileHelloWorld.My23ConsoleApp1.My24ContTone25ContTone.My26DualBrain27DualBrain.My28EmbeddingLua_Part129EmbeddingLua_Part1.My30FFMpeg31FFMpeg.My32FNA_Gameloop33FNA_Gameloop.My34GameLoop135GameLoop1.My36GameLoop237GameLoop2.My38ConsoleApp139WinFormsApp14013+105 more modules (most-connected shown)

At a glance — Code Health · 41% · Weak · gated by D1, D2, D18, X5 ·

At a glance — Architecture · 99% · Exemplary ·

At a glance — Maturity · 64% · Adequate · gated by D34 ·

At a glance — Readiness · 65% · Strong ·

At a glance — Security · 88% · Exemplary ·

Security & Compliance — OWASP Top-10 mapping

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 categoryFindingsSeverity
A01:2025 — Broken Access Control1Medium

Roadmap

Top priorities: Enable <Nullable>enable</Nullable> across all projects and resolve warnings rather than suppressing with `!`; Resolve the 4 OnErrorResumeSwallow finding(s) in Explicit Debt — start with Form1.vb (4); Resolve the 5 EmptyCatchBlock finding(s) in Explicit Debt — start with Program.vb (4), Player3.vb.

Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.

Do thisHelpsEffortDimension
Resolve the 4 OnErrorResumeSwallow finding(s) in Explicit Debt — start with Form1.vb (4).+9.5 ptsLowExplicit Debt
Resolve the 5 EmptyCatchBlock finding(s) in Explicit Debt — start with Program.vb (4), Player3.vb.+9.5 ptsLowExplicit Debt
Enable <Nullable>enable</Nullable> across all projects and resolve warnings rather than suppressing with `!`.+11.5 ptsMediumNullable reference types
Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md.+4.5 ptsLowDocumentation Quality
Resolve the 8 Thin analysable surface across projects finding(s) in Solution Shape — start with InsaneSourceGeneration.vbproj, QSortModern.vbproj, TestNuGetPackages.vbproj.+4.0 ptsLowSolution Shape
Resolve the 6 Shell project finding(s) in Solution Shape — start with WinFormsApp_dotNet6.vbproj, Silk_Gameloop.vbproj, ParseWiki.vbproj.+3.0 ptsLowSolution Shape
Resolve the 72 TodoComment finding(s) in Explicit Debt — start with Program.vb (22), Music.vb (16), ParsePlayMacro.vb (8).+4.5 ptsMediumExplicit Debt
Resolve the 92 Orphaned file finding(s) in Knowledge Freshness — start with Program.vb (39), Form1.vb (6), olcNoiseMaker.vb (4).+4.5 ptsMediumKnowledge Freshness

File quality

Per-file score 0–10 — a quality signature. Of 107 files carrying findings, judged against the Template bar: 1% slop · 3% mixed · 96% near-clean.

FileScoreBandWorst signal
QB64/MarkdownHelp/Program.vb1.1SlopExplicit Debt: EmptyCatchBlock
SoundBeepPlay/Player3.vb4.7MixedExplicit Debt: EmptyCatchBlock
Sound/ContTone/Program.vb5.4MixedExplicit Debt: EmptyCatchBlock
UacPrompt/Form1.vb5.5MixedExplicit Debt: OnErrorResumeSwallow
QB64/TxtToWiki/Program.vb6.0Near-cleanExplicit Debt: TodoComment
SourceGenerators/ImplicitInterfaceGenerator/ImplicitInterfaceGenerator.vb6.0Near-cleanExplicit Debt: TodoComment
FormExGenerator/FormExGenerator.vb6.0Near-cleanExplicit Debt: TodoComment
PLAYground/ParsePlayMacro.vb6.0Near-cleanExplicit Debt: TodoComment
QBasic/Gorilla/Music.vb6.0Near-cleanExplicit Debt: TodoComment
QBasic/Nibbles/Music.vb6.0Near-cleanExplicit Debt: TodoComment
SourceGenerators/SourceGeneratorSamples/ImplicitInterfaceGenerator.vb6.0Near-cleanExplicit Debt: TodoComment
CompilerApiBook/CompileHelloWorld/Tokens.vb6.0Near-cleanExplicit Debt: TodoComment
QBasic/Nibbles/Program.vb6.0Near-cleanExplicit Debt: TodoComment
QB64/MarkdownHelp/Lexer.vb6.0Near-cleanExplicit Debt: TodoComment
OLC/Other/Tetris/Program.vb6.0Near-cleanExplicit Debt: TodoComment
QBasic/Gorilla/Form1.vb6.0Near-cleanExplicit Debt: HackComment
OLC/Other/Synth4/Program.vb6.0Near-cleanExplicit Debt: HackComment
CompilerApiBook/CompileHelloWorld/Program.vb6.0Near-cleanExplicit Debt: TodoComment
SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb6.0Near-cleanExplicit Debt: TodoComment
GUI/X11/X11Backend.vb6.0Near-cleanExplicit Debt: TodoComment

How the grades work

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 — 9

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 — 382

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 — 152

Recorded, with no effect on how the codebase functions. Present so the survey is complete, not because it needs doing.

Could not be resolved — 5

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 35 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 — 35 dimensions across the health lenses
D1D2D3D4D5D6D13D14D15D17D18D19D24D26D27D28D29D30D32D34D35D43D44AX10AX3AX4AX5GD1M1M3M4P10P6X28X5

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
  1. 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, 536 of 543 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.)
  2. Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
  3. 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.

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Canine Code Analyzer duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivySecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3✓ deterministic

Every finding is locatable in findings.md. Run 01a1dd22-f1e6-7308-8007-e1692ffeca1b.

The exact command behind every deep-scan dimension — tool, version, invocation and retained raw output — is in Appendix B — Reproduction & audit trail.

Run transparency — what happened this run

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.

  • D11 Test Reliability — 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. Test reliability NOT MEASURED: the test run produced no results for any test tier, so no test ever ran and flakiness could not be exercised. The cause could not be attributed, so it is excluded from the score rather than read as an absence of tests.
  • 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.
  • 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 169 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 C# workspace loaded this repository's projects but reported a load failure, and the dead-code reference search is unreliable over a graph that did not load cleanly, so it was skipped. The other debt markers on this row were read; dead symbols were not, and their absence from the score is not a finding that the code has none. First load diagnostic: Failure: solution references project 'GUI\WinForms_GameLoop\WinForms_Gameloop.vbproj' but the on-disk path is 'GUI\WinForms_GameLoop\WinForms_GameLoop.vbproj' (separator/casing mismatch); on a case-sensitive file system MSBuildWorkspace would load 0 of these projects. Loading a corrected copy of the solution.
  • D18 Solution Shape — 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 build did not finish within its budget on this run; structural metrics are reported, build/warning status is unknown.
  • 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.
  • 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. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
  • D22 Internal API Consistency — 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. The loaded project set declares no packable project and no `.Contracts` project, so there is no intentionally-exposed surface for API consistency to be judged over.
  • 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 (28,617 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"]`.
  • D30 Dependency Vulnerabilities — measured, with a gap in what it reached — 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. The solution did not restore on the analyzer's .NET SDK (an SDK/target-framework/restore mismatch, common for an older codebase), so there was no restored dependency graph to scan. 1 of 2 declared ecosystem(s) (nuget packages.config) WERE scanned and every vulnerability they reported is included in this result; nuget was not, so this dimension's score covers less than the dependency surface this repository declares, and nothing here is evidence that nuget is free of known-vulnerable dependencies.
  • AX6 Interface segregation — 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.
  • 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 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.
  • P5 DR & Backup — 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. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.

Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.

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.
  • 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.
  • D18 Solution Shape: Build integrity reflects whether the solution compiled in this environment — a build that needs a private feed, a specific SDK, or a generated file absent from the repo can read as broken when it is merely unreproducible here.
  • 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 requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D32 Data Compliance (PII/GDPR): PII/GDPR signals are heuristic pattern matches in code — they flag likely handling concerns, not legal compliance, and cannot trace where data actually flows at runtime.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a 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.
  • 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.
  • 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.

Dimensions

D1 · Cyclomatic Complexity2.4 / 10Critical✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 2.4 / 10 · rule-coverage 100% · ceiling Prevented

53 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was Program.Main at 195. 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 SyntaxFacts.GetText at 26 — they are counted neither in the figure above nor in this dimension's score. 1 file carries no cyclomatic complexity row at all for this reason — every one of its over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: QB64/MarkdownHelp/SyntaxFacts.vb (SyntaxFacts.GetText at 26). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

ParsePlayMacro.New.ctor (cyclomatic 74) · ×3PLAYground/ParsePlayMacro.vb:46
ParsePlayMacro.Generate (cyclomatic 18) · ×3PLAYground/ParsePlayMacro.vb:264
Program.Main (cyclomatic 22) · ×2OLC/Other/Synth4/Program.vb:525
Program.Main (cyclomatic 195)QB64/MarkdownHelp/Program.vb:25
Program.ConvertTxtToWiki (cyclomatic 126)QB64/TxtToWiki/Program.vb:413

+ 43 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 2 bodies over 120 down to 120 or less in Cyclomatic Complexity — start with Program.Main (cyclomatic 195), Program.ConvertTxtToWiki (cyclomatic 126). — 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 2 together lifts Cyclomatic Complexity from 2.4 to about 3.5/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.

Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.

D2 · Cognitive Complexity2.0 / 10Critical✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 2.0 / 10 · rule-coverage 100% · ceiling Prevented

94 method(s) exceeded the cognitive complexity threshold of 15; the worst was ImplicitInterfaceGenerator.Execute at 626.

ParsePlayMacro.New.ctor (cognitive 121) · ×3PLAYground/ParsePlayMacro.vb:46
ParsePlayMacro.Generate (cognitive 27) · ×3PLAYground/ParsePlayMacro.vb:264
SyntaxReceiver.OnVisitSyntaxNode (cognitive 18) · ×3SourceGenerators/SourceGeneratorSamples/ImplicitInterfaceGenerator.vb:312
ScrollBar.OnMouseDown (cognitive 52) · ×2WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb:275
Program.Main (cognitive 44) · ×2OLC/Other/Synth3/Program.vb:328

+ 78 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 94 bodies over 15 down to 15 or less in Cognitive Complexity — start with ImplicitInterfaceGenerator.Execute (cognitive 626), Program.ConvertTxtToWiki (cognitive 303), Program.Main (cognitive 295). — 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 94 together lifts Cognitive Complexity from 2.0 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.

Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.

D3 · God Classes6.1 / 10Adequate✓ 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.

Maturity: Documented → Verified → Prevented · effective 6.1 / 10 · rule-coverage 100% · ceiling Prevented

38 god class(es) detected.

MethodTooLong: Program.Main · ×25SourceGenerators/TestConsoleApp/Program.vb:32
ClassTooLong: Program · ×7SourceGenerators/TestConsoleApp/Program.vb
FileTooLong: TestConsoleApp/Program.vb · ×5SourceGenerators/TestConsoleApp/Program.vb
TooManyMethods: InlineConsoleApp1/Inline.vb

What to do

  1. Resolve the 25 MethodTooLong finding(s) in God Classes — start with Program.vb (18), ImplicitInterfaceGenerator.vb (2), Music.vb (2). — One of this dimension's main actionable groups (25 warning-level).
  2. Resolve the 7 ClassTooLong finding(s) in God Classes — start with Program.vb (4), Music.vb (2), Form1.vb. — One of this dimension's main actionable groups (7 warning-level).
  3. Resolve the 5 FileTooLong finding(s) in God Classes — start with Program.vb (4), Form1.vb. — One of this dimension's main actionable groups (5 warning-level).

Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.

D4 · Code Duplication4.5 / 10Weak✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 4.5 / 10 · rule-coverage 100% · ceiling Verified

87 duplicated block group(s) detected. 13.8 % of the production lines (3,962 of 28,617) are in a reported copy. A further 30 rows report members as variants of one another; the share counts each copied line once, however many rows cite it.

Duplicated block (10 lines × 2) · ×6WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb:67
Duplicated block (6 lines × 2) · ×5TinyBASIC/Program.vb:474
Duplicated block (5 lines × 2) · ×5QBasic/Gorilla/Form1.vb:478
Duplicated block (15 lines × 2) · ×4WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb:33
Duplicated block (12 lines × 2) · ×4WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb:16

+ 72 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 6 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with Program.vb (3), HScrollBarEx.vb, PanelEx.vb. — One of this dimension's main actionable groups (6 warning-level).
  2. Resolve the 5 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with Program.vb (2), Screen.vb, ScrollBar.vb. — One of this dimension's main actionable groups (5 warning-level).
  3. Resolve the 5 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with Form1.vb (3), Program.vb, SerialTerminal2.vb. — One of this dimension's main actionable groups (5 warning-level).

Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

75 projects, 0 dependency cycle(s), 0 unstable depended-on project(s).

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)10.0 / 10Exemplary✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 of 35 classes have LCOM4 above 3.

✓ On the Gold path — maintain.

Detailed fixes: d6_recommendation.md.

D13 · Secret Scanning10.0 / 10Exemplary○ Nothing flagged

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

D14 · License Compliance10.0 / 10Exemplary○ Nothing flagged

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 of 179 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 19 direct `PackageReference`(s), and 142 further package(s) were reached beyond them by closing the graph over nuget.org's own nuspec dependency graph — so a banned licence pulled in only by a dependency's OWN dependencies is inside this verdict. A package whose licence nuget.org could not be asked for is not graded, and version ranges are taken at their lower bound, so this is the closure as that graph states it rather than a restored consumer's exact resolution.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots10.0 / 10Exemplary✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No churn × complexity hotspots in the window.

✓ On the Gold path — maintain.

Detailed fixes: d15_recommendation.md.

D17 · Explicit Debt8.9 / 10Adequategated by 9 critical findings✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 8.9 / 10 · rule-coverage 100% · ceiling Prevented

85 deducted debt markers + unmeasured dead symbols across 28617 LoC in the .NET projects (0.6/KLoC) → score 8.9. Dead code not measured: the solution did not load cleanly, so the reference search was skipped.

EmptyCatchBlock · ×5QB64/MarkdownHelp/Program.vb:591
OnErrorResumeSwallow · ×4UacPrompt/Form1.vb:49
TodoComment · ×72Audio/Rtttl2Play/Program.vb:171
HackComment · ×3GameLoop1/Form1.vb:34
ObsoleteWithCallersTui/Program.vb:92

What to do

  1. Resolve the 5 EmptyCatchBlock finding(s) in Explicit Debt — start with Program.vb (4), Player3.vb. — One of this dimension's main actionable groups (5 issue-level).
  2. Resolve the 4 OnErrorResumeSwallow finding(s) in Explicit Debt — start with Form1.vb (4). — One of this dimension's main actionable groups (4 issue-level).
  3. Resolve the 72 TodoComment finding(s) in Explicit Debt — start with Program.vb (22), Music.vb (16), ParsePlayMacro.vb (8). — One of this dimension's main actionable groups (72 warning-level).

Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.

D18 · Solution Shape2.0 / 10Critical✓ Tool-verified

What it measures: Whether the solution is laid out in a sensible, conventional structure.

Method: Solution structure: project count, decomposition, shell-project detection, build success (confirmed failures cap the score); traced to actual .sln files and binaries. Deterministic.

Maturity: Documented → Verified → Prevented · effective 2.0 / 10 · rule-coverage 100% · ceiling Documented

73 projects, 176 source files, 27622 hand-written lines of code (27622 production / 0 test — the split is derived per file: test is what its project, its own path, or a compile-guarded region marks as test, and a file carrying no test signal counts as production), plus 2421 generated (machine-written code — designer, scaffolded and tool-emitted files — excluded from quality), 5 inter-project edges (build status unknown — did not finish).

Solution references 4 projects that do not existSamples.sln
Thin analysable surface across projects: InsaneSourceGeneration · ×8InsaneSourceGeneration/InsaneSourceGeneration.vbproj
Shell project: WinFormsApp_dotNet6 · ×6WinFormsApp_dotNet6/WinFormsApp_dotNet6.vbproj

What to do

  1. Resolve the 8 Thin analysable surface across projects finding(s) in Solution Shape — start with InsaneSourceGeneration.vbproj, QSortModern.vbproj, TestNuGetPackages.vbproj. — One of this dimension's main actionable groups (8 recommendation-level).
  2. Resolve the 6 Shell project finding(s) in Solution Shape — start with WinFormsApp_dotNet6.vbproj, Silk_Gameloop.vbproj, ParseWiki.vbproj. — One of this dimension's main actionable groups (6 recommendation-level).
  3. Resolve the 1 Solution references 4 projects that do not exist finding(s) in Solution Shape — start with Samples.sln. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d18_recommendation.md · top locations in Appendix A, every location in findings.md.

D19 · Documentation Quality0.0 / 10Critical✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

0 of 1 documentation facets pass in full; short on: F2 example. 16 document(s) read across 2 unit(s).

Documentation: no build, run or usage exampleREADME.md:1

What to do

  1. Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.

D24 · Comment Value6.7 5.9 / 10Adequate✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 5.9 / 10 · rule-coverage 89% · ceiling Documented

34 of 1032 judged comments only repeat the code they sit on (3.3 %). 230 comment(s) in another language or script were not judged.

redundant comment · ×34FileSystemWatcherSample/Program.vb:20
doc comments repeat the names · ×2SoundBeepPlay/SoundGenerator.vb:491

What to do

  1. Resolve the 34 redundant comment finding(s) in Comment Value — start with Form1.vb (11), AssemblyInfo.vb (8), Program.vb (5). — One of this dimension's main actionable groups (34 recommendation-level).

Detailed fixes: d24_recommendation.md · top locations in Appendix A, every location in findings.md.

D26 · Project Cohesion10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether each project is a focused, coherent unit rather than an oversized grab-bag.

Method: Project size overshoot penalties (LoC / public-type count / namespace count, 2-of-3 flag) weighted by log magnitude. Exhaustive across projects, deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

0 of 75 projects flagged as possibly oversized/incoherent.

✓ On the Gold path — maintain.

Detailed fixes: d26_recommendation.md.

D27 · Navigability9.1 / 10Exemplary✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 9.1 / 10 · rule-coverage 100% · ceiling Documented

83 % of calls cross a namespace and 3 % go through an interface, but 93 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: medium — clean/modular boundaries expected.

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

D28 · Secrets (history)10.0 / 10Exemplary○ Nothing flagged

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

gitleaks scanned the full history AND the current working tree and found no secrets.

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)10.0 / 10Exemplary○ Nothing flagged

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).

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

semgrep found no security issues.

✓ On the Gold path — maintain.

Detailed fixes: d29_recommendation.md.

D30 · Dependency Vulnerabilities10.0 / 10Exemplary○ Nothing flagged

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No known-vulnerable dependencies in the 1 ecosystem(s) that were scanned (nuget packages.config). Partial dependency scan: 1 of 2 declared ecosystem(s) were scanned (nuget packages.config), and the findings above are real and complete for them. nuget was not scanned (nuget: the solution did not restore on the analyzer's .NET SDK (an SDK/target-framework/restore mismatch, common for an older codebase), so there was no restored dependency graph to scan), so this is not the whole dependency surface and the result is reported at reduced confidence.

✓ On the Gold path — maintain.

Detailed fixes: d30_recommendation.md.

D32 · Data Compliance (PII/GDPR)9.0 / 10Stronggated by 1 serious finding✓ Tool-verified

What it measures: Likely personal-data (PII / GDPR) handling concerns — logging or storing data without safeguards.

Method: Heuristic PII/GDPR LEAK scan via semgrep across the repo, using our own ruleset: personal data crossing a boundary it should not — reaching a log/console sink, a URL or query string, or unprotected browser storage. Matches map to severity and a 0-10 wide normalizer. A clean sweep is unscored rather than an unearned 10, and is a statement about the leak paths checked only — this dimension does not inventory the personal data a repository holds (the personal-data map and the C1-C5 compliance cards do that), so it never reports that a repository has no personal-data surface. Reported LOUDLY as a measurement gap if the ruleset is missing from the analyzer image. Exhaustive over the leak paths, advisory-leaning; degrades on parse failure.

Maturity: Documented → Verified → Prevented · effective 9.0 / 10 · rule-coverage 100% · ceiling Documented

1 finding(s): 0 critical, 0 high, 1 medium, 0 low.

REDACTED

What to do

  1. Resolve the 1 REDACTED finding(s) in Data Compliance (PII/GDPR) — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d32_recommendation.md · top locations in Appendix A, every location in findings.md.

D34 · Knowledge Freshness0.0 / 10Critical✓ Tool-verified

What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.

Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

95 of 95 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is QB64/TxtToWiki/Program.vb. Counted over 95 of the 177 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned file · ×92SoundBeepPlay/Player3.vb:1
Most significant orphaned file · ×3QB64/TxtToWiki/Program.vb:1
Dormant codebase

What to do

  1. Resolve the 92 Orphaned file finding(s) in Knowledge Freshness — start with Program.vb (39), Form1.vb (6), olcNoiseMaker.vb (4). — One of this dimension's main actionable groups (92 recommendation-level).
  2. Resolve the 3 Most significant orphaned file finding(s) in Knowledge Freshness — start with Program.vb (2), Form1.vb. — One of this dimension's main actionable groups (3 recommendation-level).
  3. Resolve the 1 Dormant codebase finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.

D35 · Change Coupling10.0 / 10Exemplary✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No strong hidden change-coupling between production files.

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md.

D43 · Malicious Dependencies10.0 / 10Exemplary✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No dependency in any ecosystem this repository declares is published as malicious.

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

D44 · Platform End-of-Life6.0 / 10Adequate✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 6.0 / 10 · rule-coverage 100% · ceiling Documented

1 end-of-life runtime(s) and 0 end-of-life framework(s), read from 73 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.

End-of-life runtime: .NET net7.0UacPrompt/UacPrompt.vbproj:5

What to do

  1. Resolve the 1 End-of-life runtime finding(s) in Platform End-of-Life — start with UacPrompt.vbproj. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d44_recommendation.md · top locations in Appendix A, every location in findings.md.

Frontend & cross-cutting dimensions

R = React/JS · M = Maturity · P = Readiness.

AX10 · Code composition10.0 / 10Exemplary✓ Tool-verified

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.

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.

AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

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.

AX4 · Dependency direction10.0 / 10Exemplary✓ Tool-verified

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.

AX5 · Architecture & structure10.0 / 10Exemplary✓ Tool-verified

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.

GD1 · Unfinished & placeholder code10.0 / 10Exemplary○ Nothing flagged

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.

M1 · Documentation (README)6.8 / 10Strong✓ Tool-verified

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.

What to do

  • Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
M3 · Folder & project structure6.0 / 10Strong✓ Tool-verified

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.

  • Most of the production code is in directories of its own, but 1 application file(s) sit at the repository root beside the build and tooling files (`SyntaxTree.vb`).
M4 · Documentation accuracy10.0 / 10Exemplary○ Nothing flagged

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.

P10 · Library API & versioning6.0 / 10Strong✓ Tool-verified

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.

  • No explicit version was found by any of the six routes this check reads: a `<Version>` or `<VersionPrefix>` property; a `GitVersion` or `MinVer` reference; the split Arcade spelling (`<MajorVersion>` AND `<MinorVersion>` together); a hand-written `[assembly: AssemblyVersion]` in source, with `bin/` and `obj/` excluded so the SDK's generated AssemblyInfo cannot satisfy it; or a version handed to MSBuild by the pipeline, as `-p:Version=` / `-p:PackageVersion=` on a `dotnet build` or `dotnet pack` line. Only project files, first-party source and CI files are read, so a version computed somewhere none of those can see is invisible here. A published library needs explicit semantic versioning so consumers can reason about breaking changes.

What to do

  • Stamp a semantic version (csproj <Version> or GitVersion/MinVer) and follow semver for breaking changes.
P6 · Release Hygiene5.0 / 10Adequate✓ Tool-verified

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.
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.

Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.

X5 · Nullable reference types2.0 / 10Weak✓ Tool-verified

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/1 NRT-eligible project(s) enable <Nullable>enable</Nullable> (projects targeting a pre-C#-8 framework are excluded — NRTs aren't available there). NRTs catch a whole class of null-deref bugs at compile time.

What to do

  • Enable <Nullable>enable</Nullable> across all projects and resolve warnings rather than suppressing with `!`.

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.

LensScoreRatingImpact
Code Health41%Weak — gated by D1, D2, D18, X5Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture99%ExemplaryStrongest area.
Maturity64%Adequate — gated by D34Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness65%StrongSolid.
Security88%ExemplarySolid.
Unscored — 1 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.

  • SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Not evidenced — 2 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.

  • P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 79 check(s) not relevant to this codebase

These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.

  • AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
  • AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
  • AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
  • AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
  • AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
  • AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
  • AX1 Captive dependencies — no DI registrations detected
  • AX2 Stateful singletons — no singleton implementations detected
  • AX6 Interface segregation — AX6 reached only 0% of this repository's production lines — vbnet (28,588 lines), lua (24 lines), vba (10 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
  • 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 — This is a dotnet-new template — authorization is deferred to the application you build from it. Add [Authorize]/policies (or imperative guards) when you wire up real users; until then there are no real endpoints to protect.
  • 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.
  • D10 Test Quality — No tests were found in the analyzed repository to assess for quality.
  • D11 Test Reliability — Test reliability not measured — no test run produced results
  • D12 Dependency Hygiene — Dependency hygiene not measured
  • D16 Bus Factor — single-contributor repository — bus factor is not applicable
  • D20 ADR Quality — N/A — this repo declares itself a template / kata / sample / demo; a formal ADR log is deferred to a real application built from it.
  • D21 Naming Consistency — Naming consistency does not read Visual Basic yet; not measured.
  • D22 Internal API Consistency — No intentionally-exposed public API to evaluate for consistency.
  • 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.
  • D36 Supply-chain Provenance & Signing — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.
  • 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 — This repo declares itself a template / kata / sample; tests are deferred to the application built from it, so coverage is not scored here.
  • DM1 Domain Modelling — not scored — this repository shows none of the 3 signals this lens looks for
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • 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 0% of this repository's production lines — vbnet (28,588 lines), lua (24 lines), vba (10 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • M2 Architecture documentation — This repo declares itself a template / kata / sample / demo — formal architecture documentation (ADRs, C4 diagrams) is deferred to a real application built from it, so its absence is not a defect here.
  • P1 CI/CD gates — This repo declares itself a template / kata / sample / demo — code meant to be read or copied, not operated. Automated CI/CD gates are deferred to the application you build from it, so their absence is not a defect here. The dimension reactivates once the repo becomes a real app.
  • P12 CI test-gate honesty — no CI workflow found
  • P2 Observability — This repo is a library, not a deployed service — it has no process to operate, so production observability (structured logging, tracing/metrics, health checks) is N/A. A library may log via an injected ILogger, but the absence of operational telemetry is not a defect here. If it grows a host (web API, worker), the dimension reactivates.
  • P3 Security & performance tooling — This repo declares itself a template / kata / sample / demo — code meant to be read or copied, not operated. SAST, secret/dependency scanning and performance benchmarks are deferred to the application you build from it, so their absence is not a defect here. The dimension reactivates once the repo becomes a real app.
  • 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.
  • PF3 Async & latency hygiene — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
  • 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.
  • X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X10 Duplicated predicate — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X12 Unreachable branch — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • 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 — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • 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 — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • 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 — no async method does work a token could cancel
  • 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 — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • 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 — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X3 Exception handling — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • 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.
  • X7 Silent fallback defaults — 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.

Critical — 9 finding(s)
D17 · Explicit Debt · EmptyCatchBlock · ×5
  • EmptyCatchBlock QB64/MarkdownHelp/Program.vb:591 — empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock Sound/ContTone/Program.vb:221 — empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock Sound/ThreadPlayerRing/Program.vb:286 — empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock Sound/ThreadPlayerRing/Program.vb:295 — empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock SoundBeepPlay/Player3.vb:672 — empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
D17 · Explicit Debt · OnErrorResumeSwallow · ×4
  • OnErrorResumeSwallow UacPrompt/Form1.vb:49 — On Error Resume Next silently swallows every runtime error until the enclosing method returns — scope it with a paired `On Error GoTo 0` and check `Err.Number`, or convert to a `Try…Catch`.
  • OnErrorResumeSwallow UacPrompt/Form1.vb:60 — On Error Resume Next silently swallows every runtime error until the enclosing method returns — scope it with a paired `On Error GoTo 0` and check `Err.Number`, or convert to a `Try…Catch`.
  • OnErrorResumeSwallow UacPrompt/Form1.vb:69 — On Error Resume Next silently swallows every runtime error until the enclosing method returns — scope it with a paired `On Error GoTo 0` and check `Err.Number`, or convert to a `Try…Catch`.
  • OnErrorResumeSwallow UacPrompt/Form1.vb:74 — On Error Resume Next silently swallows every runtime error until the enclosing method returns — scope it with a paired `On Error GoTo 0` and check `Err.Number`, or convert to a `Try…Catch`.
Serious — 382 finding(s)
D17 · Explicit Debt · TodoComment · ×72
  • TodoComment Audio/Rtttl2Play/Program.vb:171 — 'TODO: Parse the text to determine the hex bytes. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment CompilerApiBook/CompileHelloWorld/Program.vb:49 — 'TODO: Need to peek forward enough (eol) to determine if a semicolon exists... — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment CompilerApiBook/CompileHelloWorld/Program.vb:72 — 'TODO: Subs/Functions can have precursor keywords... — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment CompilerApiBook/CompileHelloWorld/Tokens.vb:157 — 'TODO: need to handle 'escaped' quote — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment FormExGenerator/FormExGenerator.vb:46 — ' TODO: we should allow source generators to provide source during initialize, so that this step isn't required. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment SourceGenerators/SourceGeneratorSamples/AutoNotifyGenerator.vb:55 — ' TODO: we should allow source generators to provide source during initialize, so that this step isn't required. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:46 — ' TODO: we should allow source generators to provide source during initialize, so that this step isn't required. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment GUI/X11/X11Backend.vb:107 — ' ' TODO: handle close, keys, resize — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment GUI/X11/X11Backend.vb:141 — ' Dim kc = Marshal.ReadByte(IntPtr.Zero) ' TODO: proper keycode handling — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment GUI/X11/X11Backend.vb:146 — ' Dim kc = Marshal.ReadByte(IntPtr.Zero) ' TODO: proper keycode — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment OLC/Other/Tetris/Program.vb:182 — 'TODO: Need to "print" to the array. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment PLAYground/ParsePlayMacro.vb:66 — 'TODO: error — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment PLAYground/ParsePlayMacro.vb:72 — 'TODO: error — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment PLAYground/ParsePlayMacro.vb:84 — 'TODO: error — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment PLAYground/ParsePlayMacro.vb:196 — 'TODO: error — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment PLAYground/ParsePlayMacro.vb:211 — 'TODO: error — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment PLAYground/ParsePlayMacro.vb:230 — 'TODO: error — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment QBasic/Gorilla/Music.vb:66 — 'TODO: error — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment QBasic/Gorilla/Music.vb:72 — 'TODO: error — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment QBasic/Gorilla/Music.vb:84 — 'TODO: error — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment QBasic/Gorilla/Music.vb:196 — 'TODO: error — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment QBasic/Gorilla/Music.vb:211 — 'TODO: error — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment QBasic/Gorilla/Music.vb:230 — 'TODO: error — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment QBasic/Nibbles/Music.vb:66 — 'TODO: error — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment QBasic/Nibbles/Music.vb:72 — 'TODO: error — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • + 47 more in this group — see findings.md.
D3 · God Classes · MethodTooLong · ×25
  • MethodTooLong: Program.Main SourceGenerators/TestConsoleApp/Program.vb:32 — MethodTooLong — Main runs 830 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 730 over it, 8.30× 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: Program.Main QB64/MarkdownHelp/Program.vb:25 — MethodTooLong — Main runs 424 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 324 over it, 4.24× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: Program.ConvertTxtToWiki QB64/TxtToWiki/Program.vb:413 — MethodTooLong — ConvertTxtToWiki runs 304 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 204 over it, 3.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: ImplicitInterfaceGenerator.Execute SourceGenerators/ImplicitInterfaceGenerator/ImplicitInterfaceGenerator.vb:42 — MethodTooLong — Execute runs 273 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 173 over it, 2.73× 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: Program.Main BasicComputerGames/02_Amazing/Program.vb:8 — MethodTooLong — Main runs 255 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 155 over it, 2.55× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: FormExGenerator.Execute FormExGenerator/FormExGenerator.vb:36 — MethodTooLong — Execute runs 248 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 148 over it, 2.48× 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: ImplicitInterfaceGenerator.Execute SourceGenerators/SourceGeneratorSamples/ImplicitInterfaceGenerator.vb:41 — MethodTooLong — Execute runs 187 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 87 over it, 1.87× 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: Program.Main BasicComputerGames/30_Cube/Program.vb:8 — MethodTooLong — Main runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84× 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: ParsePlayMacro.New(…) QBasic/Gorilla/Music.vb:46 — MethodTooLong — New(…) runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77× 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: ParsePlayMacro.New(…) QBasic/Nibbles/Music.vb:46 — MethodTooLong — New(…) runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77× 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: Program.Main OLC/Other/Synth4/Program.vb:525 — MethodTooLong — Main runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35× 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: Program.Main QB64/Qb64SamplesToMarkdown/Program.vb:302 — MethodTooLong — Main runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35× 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: Program.Page.AddContent QB64/Qb64SamplesToMarkdown/Program.vb:53 — MethodTooLong — AddContent runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: Program.Main SerialTesting/Program.vb:16 — MethodTooLong — Main 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: Program.PrepareBuffers Serial/PC-To-Centurion/Program.vb:262 — MethodTooLong — PrepareBuffers runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: Program.Main Serial/PC-To-Centurion/Program.vb:30 — MethodTooLong — Main runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: Program.Main OLC/Other/Tetris/Program.vb:47 — MethodTooLong — Main runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16× 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: Nibbles.Level QBasic/Nibbles/Program.vb:368 — MethodTooLong — Level runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16× 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: Nibbles.PlayNibbles QBasic/Nibbles/Program.vb:503 — MethodTooLong — PlayNibbles runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: QbScreen.Circle GUI/WinForms_GameLoop/Screen.vb:236 — MethodTooLong — Circle 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: Program.Main Sound/ModExtract/Program.vb:87 — MethodTooLong — Main runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: RecordGenerator.ProcessClass SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:97 — MethodTooLong — ProcessClass runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09× 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: Screen.Circle GUI/SDL2_Gameloop/Program.vb:330 — MethodTooLong — Circle 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.
  • MethodTooLong: Program.Main OLC/Other/Snake/Program.vb:55 — MethodTooLong — Main runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: Program.Main CompilerApiBook/CompileHelloWorld/Program.vb:151 — MethodTooLong — Main runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03× 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.
D3 · God Classes · ClassTooLong · ×7
  • ClassTooLong: Program SourceGenerators/TestConsoleApp/Program.vb — ClassTooLong — 853 significant lines (blank, comment-only and punctuation-only lines excluded), 2 methods. The bar is 400 significant lines; this is 453 over it, 2.13× 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: Form1 QBasic/Gorilla/Form1.vb — ClassTooLong — 842 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 442 over it, 2.11× 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: Program QB64/TxtToWiki/Program.vb — ClassTooLong — 612 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 212 over it, 1.53× 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: Nibbles QBasic/Nibbles/Program.vb — ClassTooLong — 559 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 159 over it, 1.40× 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: Program QB64/MarkdownHelp/Program.vb — ClassTooLong — 461 significant lines (blank, comment-only and punctuation-only lines excluded), 3 methods. The bar is 400 significant lines; this is 61 over it, 1.15× 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: ParsePlayMacro QBasic/Gorilla/Music.vb — ClassTooLong — 459 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 59 over it, 1.15× 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: ParsePlayMacro QBasic/Nibbles/Music.vb — ClassTooLong — 459 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 59 over it, 1.15× 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 · Duplicated block (10 lines × 2) · ×6
  • Duplicated block (10 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb:67 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb:67-76 | WinFormsApp1/Community.Windows.FormsEx/HScrollBarEx.vb:67-76 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb` and `WinFormsApp1/Community.Windows.FormsEx/HScrollBarEx.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (10 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/PanelEx.vb:80 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/PanelEx.vb:80-89 | WinFormsApp1/Community.Windows.FormsEx/PanelEx.vb:82-91 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (10 lines × 2) OLC/Other/Synth4/Program.vb:309 — OLC/Other/Synth4/Program.vb:309-318 | OLC/Other/Synth4/Program.vb:339-348 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (10 lines × 2) QBasic/RemLine/Program.vb:381 — QBasic/RemLine/Program.vb:381-390 | Transpiler/RemLine.vb:309-318 — before extracting anything, compare `QBasic/RemLine/Program.vb` and `Transpiler/RemLine.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (10 lines × 2) QBasic/RemLine/Program.vb:405 — QBasic/RemLine/Program.vb:405-414 | Transpiler/RemLine.vb:333-342 — before extracting anything, compare `QBasic/RemLine/Program.vb` and `Transpiler/RemLine.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (10 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:206 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:206-215 | WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb:206-215 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb` and `WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D3 · God Classes · FileTooLong · ×5
  • FileTooLong: TestConsoleApp/Program.vb SourceGenerators/TestConsoleApp/Program.vb — FileTooLong — 862 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 362 over it, 1.72× 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: Gorilla/Form1.vb QBasic/Gorilla/Form1.vb — FileTooLong — 857 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 357 over it, 1.71× 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: TxtToWiki/Program.vb QB64/TxtToWiki/Program.vb — FileTooLong — 613 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 113 over it, 1.23× 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: Nibbles/Program.vb QBasic/Nibbles/Program.vb — FileTooLong — 566 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 66 over it, 1.13× 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: MarkdownHelp/Program.vb QB64/MarkdownHelp/Program.vb — FileTooLong — 534 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 34 over it, 1.07× 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.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×5
  • Duplicated block (6 lines × 2) TinyBASIC/Program.vb:474 — TinyBASIC/Program.vb:474-479 | TinyBASIC/Program.vb:483-488 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) GUI/SDL2_Gameloop/Program.vb:477 — GUI/SDL2_Gameloop/Program.vb:477-482 | GUI/SDL2_Gameloop/Program.vb:523-528 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) GUI/WinForms_GameLoop/Screen.vb:392 — GUI/WinForms_GameLoop/Screen.vb:392-397 | GUI/WinForms_GameLoop/Screen.vb:438-443 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:267 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:267-272 | WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb:267-272 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb` and `WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (6 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/VScrollBarEx.vb:47 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/VScrollBarEx.vb:47-52 | WinFormsApp1/Community.Windows.FormsEx/VScrollBarEx.vb:47-52 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/VScrollBarEx.vb` and `WinFormsApp1/Community.Windows.FormsEx/VScrollBarEx.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×5
  • Duplicated block (5 lines × 2) QBasic/Gorilla/Form1.vb:478 — QBasic/Gorilla/Form1.vb:478-482 | QBasic/Gorilla/Form1.vb:493-497 — 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. 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) QBasic/Gorilla/Form1.vb:1242 — QBasic/Gorilla/Form1.vb:1242-1246 | QBasic/Gorilla/Form1.vb:1257-1261 — 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. 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) QBasic/Gorilla/Form1.vb:1278 — QBasic/Gorilla/Form1.vb:1278-1282 | QBasic/Gorilla/Form1.vb:1283-1287 — 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 `QBasic/Gorilla/Form1.vb:1278` 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 (5 lines × 2) QBasic/RemLine/Program.vb:362 — QBasic/RemLine/Program.vb:362-366 | Transpiler/RemLine.vb:290-294 — before extracting anything, compare `QBasic/RemLine/Program.vb` and `Transpiler/RemLine.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (5 lines × 2) Serial/Term/SerialTerminal2.vb:19 — Serial/Term/SerialTerminal2.vb:19-23 | Serial/Term/SerialTerminal3.vb:22-26 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (15 lines × 2) · ×4
  • Duplicated block (15 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb:33 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb:33-47 | WinFormsApp1/Community.Windows.FormsEx/HScrollBarEx.vb:33-47 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb` and `WinFormsApp1/Community.Windows.FormsEx/HScrollBarEx.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (15 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:125 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:125-139 | WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb:125-139 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb` and `WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (15 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/VScrollBarEx.vb:70 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/VScrollBarEx.vb:70-84 | WinFormsApp1/Community.Windows.FormsEx/VScrollBarEx.vb:70-84 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/VScrollBarEx.vb` and `WinFormsApp1/Community.Windows.FormsEx/VScrollBarEx.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (15 lines × 2) QBasic/RemLine/Program.vb:76 — QBasic/RemLine/Program.vb:76-90 | QBasic/RemLine/RawConversion.vb:97-111 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×4
  • Duplicated block (12 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb:16 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb:16-27 | WinFormsApp1/Community.Windows.FormsEx/HScrollBarEx.vb:16-27 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb` and `WinFormsApp1/Community.Windows.FormsEx/HScrollBarEx.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (12 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/VScrollBarEx.vb:30 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/VScrollBarEx.vb:30-41 | WinFormsApp1/Community.Windows.FormsEx/VScrollBarEx.vb:30-41 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/VScrollBarEx.vb` and `WinFormsApp1/Community.Windows.FormsEx/VScrollBarEx.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (12 lines × 2) Sound/ThreadPlayer/Program.vb:238 — Sound/ThreadPlayer/Program.vb:238-249 | Sound/ThreadPlayerRing/Program.vb:259-270 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (12 lines × 2) GUI/SDL2_Gameloop/Program.vb:197 — GUI/SDL2_Gameloop/Program.vb:197-208 | GUI/WinForms_GameLoop/Screen.vb:101-112 — before extracting anything, compare `GUI/SDL2_Gameloop/Program.vb` and `GUI/WinForms_GameLoop/Screen.vb` as WHOLE FILES: 90% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×4
  • Duplicated block (7 lines × 2) Serial/PC-To-Centurion/Program.vb:459 — Serial/PC-To-Centurion/Program.vb:459-465 | SerialTesting/Program.vb:207-213 — before extracting anything, compare `Serial/PC-To-Centurion/Program.vb` and `SerialTesting/Program.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:230 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:230-236 | WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb:230-236 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb` and `WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/VScrollBarEx.vb:58 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/VScrollBarEx.vb:58-64 | WinFormsApp1/Community.Windows.FormsEx/VScrollBarEx.vb:58-64 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/VScrollBarEx.vb` and `WinFormsApp1/Community.Windows.FormsEx/VScrollBarEx.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) Serial/PC-To-Centurion/Program.vb:473 — Serial/PC-To-Centurion/Program.vb:473-479 | SerialTesting/Program.vb:221-227 — before extracting anything, compare `Serial/PC-To-Centurion/Program.vb` and `SerialTesting/Program.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D1 · Cyclomatic Complexity · ParsePlayMacro.New.ctor (cyclomatic 74) · ×3
  • ParsePlayMacro.New.ctor (cyclomatic 74) PLAYground/ParsePlayMacro.vb:46 — ParsePlayMacro.New.ctor has cyclomatic complexity 74 (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.
  • ParsePlayMacro.New.ctor (cyclomatic 74) QBasic/Gorilla/Music.vb:46 — ParsePlayMacro.New.ctor has cyclomatic complexity 74 (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.
  • ParsePlayMacro.New.ctor (cyclomatic 74) QBasic/Nibbles/Music.vb:46 — ParsePlayMacro.New.ctor has cyclomatic complexity 74 (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.
D1 · Cyclomatic Complexity · ParsePlayMacro.Generate (cyclomatic 18) · ×3
  • ParsePlayMacro.Generate (cyclomatic 18) PLAYground/ParsePlayMacro.vb:264 — ParsePlayMacro.Generate has cyclomatic complexity 18 (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.
  • ParsePlayMacro.Generate (cyclomatic 18) QBasic/Gorilla/Music.vb:261 — ParsePlayMacro.Generate has cyclomatic complexity 18 (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.
  • ParsePlayMacro.Generate (cyclomatic 18) QBasic/Nibbles/Music.vb:261 — ParsePlayMacro.Generate has cyclomatic complexity 18 (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.
D17 · Explicit Debt · HackComment · ×3
  • HackComment GameLoop1/Form1.vb:34 — ' HACK: Let WinForms "do it's thing..." for 100ms — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
  • HackComment OLC/Other/Synth4/Program.vb:517 — ' Hack to handle removal of entry... — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
  • HackComment QBasic/Gorilla/Form1.vb:710 — 'HACK: Placed a CLS here since supporting palette change (animating) is "difficult". — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
D2 · Cognitive Complexity · ParsePlayMacro.New.ctor (cognitive 121) · ×3
  • ParsePlayMacro.New.ctor (cognitive 121) PLAYground/ParsePlayMacro.vb:46 — ParsePlayMacro.New.ctor has cognitive complexity 121 (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.
  • ParsePlayMacro.New.ctor (cognitive 121) QBasic/Gorilla/Music.vb:46 — ParsePlayMacro.New.ctor has cognitive complexity 121 (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.
  • ParsePlayMacro.New.ctor (cognitive 121) QBasic/Nibbles/Music.vb:46 — ParsePlayMacro.New.ctor has cognitive complexity 121 (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.
D2 · Cognitive Complexity · ParsePlayMacro.Generate (cognitive 27) · ×3
  • ParsePlayMacro.Generate (cognitive 27) PLAYground/ParsePlayMacro.vb:264 — ParsePlayMacro.Generate has cognitive complexity 27 (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.
  • ParsePlayMacro.Generate (cognitive 27) QBasic/Gorilla/Music.vb:261 — ParsePlayMacro.Generate has cognitive complexity 27 (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.
  • ParsePlayMacro.Generate (cognitive 27) QBasic/Nibbles/Music.vb:261 — ParsePlayMacro.Generate has cognitive complexity 27 (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.
D2 · Cognitive Complexity · SyntaxReceiver.OnVisitSyntaxNode (cognitive 18) · ×3
  • SyntaxReceiver.OnVisitSyntaxNode (cognitive 18) SourceGenerators/SourceGeneratorSamples/ImplicitInterfaceGenerator.vb:312 — SyntaxReceiver.OnVisitSyntaxNode has cognitive complexity 18 (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.
  • SyntaxReceiver.OnVisitSyntaxNode (cognitive 18) SourceGenerators/ImplicitInterfaceGenerator/ImplicitInterfaceGenerator.vb:427 — SyntaxReceiver.OnVisitSyntaxNode has cognitive complexity 18 (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.
  • SyntaxReceiver.OnVisitSyntaxNode (cognitive 18) FormExGenerator/FormExGenerator.vb:755 — SyntaxReceiver.OnVisitSyntaxNode has cognitive complexity 18 (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.
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×3
  • Members sharing a duplicated core (4 members, 50+ identical tokens) SourceGenerators/SourceGeneratorSamples/AutoNotifyGenerator.vb:128 — SourceGenerators/SourceGeneratorSamples/AutoNotifyGenerator.vb:128-172 | SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:300-324 | SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:330-354 | SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:360-389 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) OLC/Other/Synth1/olcNoiseMaker.vb:93 — OLC/Other/Synth1/olcNoiseMaker.vb:93-150 | OLC/Other/Synth2/olcNoiseMaker.vb:93-149 | OLC/Other/Synth3/olcNoiseMaker.vb:95-152 | OLC/Other/Synth4/olcNoiseMaker.vb:99-161 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) OLC/Other/Synth1/olcNoiseMaker.vb:165 — OLC/Other/Synth1/olcNoiseMaker.vb:165-175 | OLC/Other/Synth2/olcNoiseMaker.vb:163-173 | OLC/Other/Synth3/olcNoiseMaker.vb:166-176 | OLC/Other/Synth4/olcNoiseMaker.vb:174-186 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Duplicated block (37 lines × 2) · ×3
  • Duplicated block (37 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:166 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:166-202 | WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb:166-202 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb` and `WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (37 lines × 2) QBasic/Gorilla/Music.vb:345 — QBasic/Gorilla/Music.vb:345-381 | QBasic/Nibbles/Music.vb:351-387 — `QBasic/Gorilla/Music.vb` and `QBasic/Nibbles/Music.vb` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 7 separate duplicated blocks between them, totalling at least 167 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (37 lines × 2) OLC/Other/Synth1/olcNoiseMaker.vb:93 — OLC/Other/Synth1/olcNoiseMaker.vb:93-129 | OLC/Other/Synth2/olcNoiseMaker.vb:93-129 — `OLC/Other/Synth1/olcNoiseMaker.vb` and `OLC/Other/Synth2/olcNoiseMaker.vb` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (13 lines × 3) · ×3
  • Duplicated block (13 lines × 3) PLAYground/ParsePlayMacro.vb:356 — PLAYground/ParsePlayMacro.vb:356-368 | QBasic/Gorilla/Music.vb:393-405 | QBasic/Nibbles/Music.vb:393-405 — before extracting anything, compare `PLAYground/ParsePlayMacro.vb` and `QBasic/Gorilla/Music.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 117 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (13 lines × 3) PLAYground/ParsePlayMacro.vb:495 — PLAYground/ParsePlayMacro.vb:495-507 | QBasic/Gorilla/Music.vb:532-544 | QBasic/Nibbles/Music.vb:532-544 — before extracting anything, compare `PLAYground/ParsePlayMacro.vb` and `QBasic/Gorilla/Music.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 117 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (13 lines × 3) BasicComputerGames/02_Amazing/Program.vb:92 — BasicComputerGames/02_Amazing/Program.vb:92-104 | BasicComputerGames/02_Amazing/Program.vb:138-150 | BasicComputerGames/02_Amazing/Program.vb:182-194 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×3
  • Duplicated block (11 lines × 2) WinForms/Browser/DarkColorTable.vb:26 — WinForms/Browser/DarkColorTable.vb:26-36 | WinFormsApp1/Community.Windows.FormsEx/DarkMode.vb:28-38 — before extracting anything, compare `WinForms/Browser/DarkColorTable.vb` and `WinFormsApp1/Community.Windows.FormsEx/DarkMode.vb` as WHOLE FILES: 87% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (11 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:402 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:402-412 | WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb:402-412 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb` and `WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (11 lines × 2) QBasic/Gorilla/Form1.vb:1477 — QBasic/Gorilla/Form1.vb:1477-1487 | QBasic/Nibbles/Program.vb:852-862 — 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.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×3
  • Duplicated block (9 lines × 2) Serial/PC-To-Centurion/Program.vb:104 — Serial/PC-To-Centurion/Program.vb:104-112 | Serial/PC-To-Centurion/Program.vb:155-163 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/VScrollBarEx.vb:16 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/VScrollBarEx.vb:16-24 | WinFormsApp1/Community.Windows.FormsEx/VScrollBarEx.vb:16-24 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/VScrollBarEx.vb` and `WinFormsApp1/Community.Windows.FormsEx/VScrollBarEx.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (9 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb:53 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb:53-61 | WinFormsApp1/Community.Windows.FormsEx/HScrollBarEx.vb:53-61 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb` and `WinFormsApp1/Community.Windows.FormsEx/HScrollBarEx.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×3
  • Duplicated block (8 lines × 2) GUI/WinForms_GameLoop/Form1.vb:70 — GUI/WinForms_GameLoop/Form1.vb:70-77 | GUI/WinForms_GameLoop/Form1.vb:97-104 — 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 `GUI/WinForms_GameLoop/Form1.vb:70` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) BasicComputerGames/02_Amazing/Program.vb:221 — BasicComputerGames/02_Amazing/Program.vb:221-230 | BasicComputerGames/02_Amazing/Program.vb:232-239 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:219 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:219-226 | WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb:219-226 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb` and `WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D1 · Cyclomatic Complexity · Program.Main (cyclomatic 22) · ×2
  • Program.Main (cyclomatic 22) OLC/Other/Synth4/Program.vb:525 — Program.Main has cyclomatic complexity 22 (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.
  • Program.Main (cyclomatic 22) Sound/ModExtract/Program.vb:87 — Program.Main has cyclomatic complexity 22 (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.
D2 · Cognitive Complexity · ScrollBar.OnMouseDown (cognitive 52) · ×2
  • ScrollBar.OnMouseDown (cognitive 52) WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb:275 — ScrollBar.OnMouseDown has cognitive complexity 52 (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.
  • ScrollBar.OnMouseDown (cognitive 52) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:275 — ScrollBar.OnMouseDown has cognitive complexity 52 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 44) · ×2
  • Program.Main (cognitive 44) OLC/Other/Synth3/Program.vb:328 — Program.Main has cognitive complexity 44 (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.
  • Program.Main (cognitive 44) Sound/FFMpeg/Program.vb:5 — Program.Main has cognitive complexity 44 (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.
D2 · Cognitive Complexity · ScrollBar.OnMouseMove (cognitive 23) · ×2
  • ScrollBar.OnMouseMove (cognitive 23) WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb:356 — ScrollBar.OnMouseMove has cognitive complexity 23 (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.
  • ScrollBar.OnMouseMove (cognitive 23) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:356 — ScrollBar.OnMouseMove has cognitive complexity 23 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 21) · ×2
  • Program.Main (cognitive 21) OLC/Other/Synth1/Program.vb:55 — Program.Main has cognitive complexity 21 (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.
  • Program.Main (cognitive 21) OLC/Other/Synth2/Program.vb:210 — Program.Main has cognitive complexity 21 (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.
D2 · Cognitive Complexity · ScrollBar.OnTimerTick (cognitive 16) · ×2
  • ScrollBar.OnTimerTick (cognitive 16) WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb:415 — ScrollBar.OnTimerTick 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.
  • ScrollBar.OnTimerTick (cognitive 16) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:415 — ScrollBar.OnTimerTick 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.
D4 · Code Duplication · Edited copy of a member (2 corresponding lines) · ×2
  • Edited copy of a member (2 corresponding lines) WinFormsApp1/Community.Windows.FormsEx/HScrollBarEx.vb:112 — WinFormsApp1/Community.Windows.FormsEx/HScrollBarEx.vb:112-113 | WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb:112-113 — These two members are one piece of code written twice and then edited apart: 2 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 (2 corresponding lines) WinFormsApp1/Community.Windows.FormsEx/VScrollBarEx.vb:90 — WinFormsApp1/Community.Windows.FormsEx/VScrollBarEx.vb:90-91 | WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/VScrollBarEx.vb:90-91 — These two members are one piece of code written twice and then edited apart: 2 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 (4 corresponding lines) · ×2
  • Edited copy of a member (4 corresponding lines) GUI/SDL2_Gameloop/Program.vb:153 — GUI/SDL2_Gameloop/Program.vb:153-156 | GUI/WinForms_GameLoop/Screen.vb:57-60 — These two members are one piece of code written twice and then edited apart: 4 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 (4 corresponding lines) Serial/Term/SerialTerminal2.vb:12 — Serial/Term/SerialTerminal2.vb:12-15 | Serial/Term/SerialTerminal3.vb:15-18 — These two members are one piece of code written twice and then edited apart: 4 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 · Duplicated block (30 lines × 2) · ×2
  • Duplicated block (30 lines × 2) QBasic/RemLine/Program.vb:298 — QBasic/RemLine/Program.vb:298-327 | Transpiler/RemLine.vb:226-255 — before extracting anything, compare `QBasic/RemLine/Program.vb` and `Transpiler/RemLine.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (30 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:416 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:416-445 | WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb:416-445 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb` and `WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (21 lines × 2) · ×2
  • Duplicated block (21 lines × 2) QBasic/RemLine/Program.vb:132 — QBasic/RemLine/Program.vb:132-152 | Transpiler/RemLine.vb:52-72 — before extracting anything, compare `QBasic/RemLine/Program.vb` and `Transpiler/RemLine.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (21 lines × 2) GUI/SDL2_Gameloop/Program.vb:160 — GUI/SDL2_Gameloop/Program.vb:160-180 | GUI/WinForms_GameLoop/Screen.vb:64-84 — before extracting anything, compare `GUI/SDL2_Gameloop/Program.vb` and `GUI/WinForms_GameLoop/Screen.vb` as WHOLE FILES: 90% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (11 lines × 3) · ×2
  • Duplicated block (11 lines × 3) GUI/SDL2_Gameloop/Program.vb:268 — GUI/SDL2_Gameloop/Program.vb:268-278 | GUI/SDL2_Gameloop/Program.vb:287-297 | GUI/SDL2_Gameloop/Program.vb:311-321 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (11 lines × 3) GUI/WinForms_GameLoop/Screen.vb:174 — GUI/WinForms_GameLoop/Screen.vb:174-184 | GUI/WinForms_GameLoop/Screen.vb:193-203 | GUI/WinForms_GameLoop/Screen.vb:217-227 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×2
  • Duplicated block (6 lines × 3) TinyBASIC/Program.vb:402 — TinyBASIC/Program.vb:402-407 | TinyBASIC/Program.vb:443-448 | TinyBASIC/Program.vb:465-470 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (6 lines × 3) QBasic/Nibbles/Program.vb:404 — QBasic/Nibbles/Program.vb:404-409 | QBasic/Nibbles/Program.vb:468-473 | QBasic/Nibbles/Program.vb:491-496 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D1 · Cyclomatic Complexity · Program.Main (cyclomatic 195) · ×1
  • Program.Main (cyclomatic 195) QB64/MarkdownHelp/Program.vb:25 — Program.Main has cyclomatic complexity 195 (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.
D1 · Cyclomatic Complexity · Program.ConvertTxtToWiki (cyclomatic 126) · ×1
  • Program.ConvertTxtToWiki (cyclomatic 126) QB64/TxtToWiki/Program.vb:413 — Program.ConvertTxtToWiki has cyclomatic complexity 126 (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.
D1 · Cyclomatic Complexity · ImplicitInterfaceGenerator.Execute (cyclomatic 99) · ×1
  • ImplicitInterfaceGenerator.Execute (cyclomatic 99) SourceGenerators/ImplicitInterfaceGenerator/ImplicitInterfaceGenerator.vb:42 — ImplicitInterfaceGenerator.Execute has cyclomatic complexity 99 (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.
D1 · Cyclomatic Complexity · Program.Main (cyclomatic 89) · ×1
  • Program.Main (cyclomatic 89) TinyBASIC/Program.vb:14 — Program.Main has cyclomatic complexity 89 (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.
D1 · Cyclomatic Complexity · Program.Main (cyclomatic 84) · ×1
  • Program.Main (cyclomatic 84) BasicComputerGames/02_Amazing/Program.vb:8 — Program.Main has cyclomatic complexity 84 (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.
D1 · Cyclomatic Complexity · FormExGenerator.Execute (cyclomatic 77) · ×1
  • FormExGenerator.Execute (cyclomatic 77) FormExGenerator/FormExGenerator.vb:36 — FormExGenerator.Execute has cyclomatic complexity 77 (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.
D1 · Cyclomatic Complexity · ImplicitInterfaceGenerator.Execute (cyclomatic 63) · ×1
  • ImplicitInterfaceGenerator.Execute (cyclomatic 63) SourceGenerators/SourceGeneratorSamples/ImplicitInterfaceGenerator.vb:41 — ImplicitInterfaceGenerator.Execute has cyclomatic complexity 63 (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.
D1 · Cyclomatic Complexity · Tokenizer.PopRawText (cyclomatic 50) · ×1
  • Tokenizer.PopRawText (cyclomatic 50) CompilerApiBook/CompileHelloWorld/Tokens.vb:86 — Tokenizer.PopRawText has cyclomatic complexity 50 (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.
D1 · Cyclomatic Complexity · Program.Main (cyclomatic 48) · ×1
  • Program.Main (cyclomatic 48) BasicComputerGames/30_Cube/Program.vb:8 — Program.Main has cyclomatic complexity 48 (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.
D1 · Cyclomatic Complexity · Nibbles.PlayNibbles (cyclomatic 45) · ×1
  • Nibbles.PlayNibbles (cyclomatic 45) QBasic/Nibbles/Program.vb:503 — Nibbles.PlayNibbles has cyclomatic complexity 45 (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.
D1 · Cyclomatic Complexity · Lexer.ReadToken (cyclomatic 43) · ×1
  • Lexer.ReadToken (cyclomatic 43) QB64/MarkdownHelp/Lexer.vb:150 — Lexer.ReadToken has cyclomatic complexity 43 (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.
D1 · Cyclomatic Complexity · QbScreen.Circle (cyclomatic 42) · ×1
  • QbScreen.Circle (cyclomatic 42) GUI/WinForms_GameLoop/Screen.vb:236 — QbScreen.Circle has cyclomatic complexity 42 (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.
D1 · Cyclomatic Complexity · Program.Main (cyclomatic 41) · ×1
  • Program.Main (cyclomatic 41) OLC/Other/Tetris/Program.vb:47 — Program.Main has cyclomatic complexity 41 (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.
D1 · Cyclomatic Complexity · Program.Main (cyclomatic 39) · ×1
  • Program.Main (cyclomatic 39) OLC/Other/Snake/Program.vb:55 — Program.Main has cyclomatic complexity 39 (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.
D1 · Cyclomatic Complexity · Screen.Circle (cyclomatic 38) · ×1
  • Screen.Circle (cyclomatic 38) GUI/SDL2_Gameloop/Program.vb:330 — Screen.Circle has cyclomatic complexity 38 (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.
D1 · Cyclomatic Complexity · Program.PrepareBuffers (cyclomatic 38) · ×1
  • Program.PrepareBuffers (cyclomatic 38) Serial/PC-To-Centurion/Program.vb:262 — Program.PrepareBuffers has cyclomatic complexity 38 (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.
D1 · Cyclomatic Complexity · Page.AddContent (cyclomatic 33) · ×1
  • Page.AddContent (cyclomatic 33) QB64/Qb64SamplesToMarkdown/Program.vb:53 — Page.AddContent has cyclomatic complexity 33 (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.
D1 · Cyclomatic Complexity · Program.Main (cyclomatic 32) · ×1
  • Program.Main (cyclomatic 32) QB64/Qb64SamplesToMarkdown/Program.vb:302 — Program.Main has cyclomatic complexity 32 (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.
D1 · Cyclomatic Complexity · Program.Main (cyclomatic 29) · ×1
  • Program.Main (cyclomatic 29) BasicComputerGames/01_AceyDucey/Program.vb:8 — Program.Main has cyclomatic complexity 29 (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.
D1 · Cyclomatic Complexity · Program.Main (cyclomatic 28) · ×1
  • Program.Main (cyclomatic 28) Serial/PC-To-Centurion/Program.vb:30 — Program.Main has cyclomatic complexity 28 (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.
D1 · Cyclomatic Complexity · Form1.SetLightMode (cyclomatic 26) · ×1
  • Form1.SetLightMode (cyclomatic 26) WinFormsApp1/Form1.vb:58 — Form1.SetLightMode has cyclomatic complexity 26 (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.
D1 · Cyclomatic Complexity · Form1.MakeCityScape (cyclomatic 25) · ×1
  • Form1.MakeCityScape (cyclomatic 25) QBasic/Gorilla/Form1.vb:802 — Form1.MakeCityScape has cyclomatic complexity 25 (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.
D1 · Cyclomatic Complexity · Form1.SetDarkMode (cyclomatic 24) · ×1
  • Form1.SetDarkMode (cyclomatic 24) WinFormsApp1/Form1.vb:168 — Form1.SetDarkMode has cyclomatic complexity 24 (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.
D1 · Cyclomatic Complexity · VbRewriter.VisitExpressionStatement (cyclomatic 24) · ×1
  • VbRewriter.VisitExpressionStatement (cyclomatic 24) Transpiler/VbRewriter.vb:62 — VbRewriter.VisitExpressionStatement has cyclomatic complexity 24 (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.
D1 · Cyclomatic Complexity · Nibbles.Level (cyclomatic 24) · ×1
  • Nibbles.Level (cyclomatic 24) QBasic/Nibbles/Program.vb:368 — Nibbles.Level has cyclomatic complexity 24 (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.
D1 · Cyclomatic Complexity · Program.Main (cyclomatic 24) · ×1
  • Program.Main (cyclomatic 24) SerialTesting/Program.vb:16 — Program.Main has cyclomatic complexity 24 (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.
D1 · Cyclomatic Complexity · SerialTerminal3.ApplyAnsiCode (cyclomatic 24) · ×1
  • SerialTerminal3.ApplyAnsiCode (cyclomatic 24) Serial/Term/SerialTerminal3.vb:88 — SerialTerminal3.ApplyAnsiCode has cyclomatic complexity 24 (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.
D1 · Cyclomatic Complexity · Player3.HandleTimer (cyclomatic 22) · ×1
  • Player3.HandleTimer (cyclomatic 22) SoundBeepPlay/Player3.vb:382 — Player3.HandleTimer has cyclomatic complexity 22 (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.
D1 · Cyclomatic Complexity · Program.ReplaceCurly (cyclomatic 22) · ×1
  • Program.ReplaceCurly (cyclomatic 22) QB64/TxtToWiki/Program.vb:1157 — Program.ReplaceCurly has cyclomatic complexity 22 (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.
D1 · Cyclomatic Complexity · Program.Main1 (cyclomatic 21) · ×1
  • Program.Main1 (cyclomatic 21) CompilerApiBook/CompileHelloWorld/Program.vb:6 — Program.Main1 has cyclomatic complexity 21 (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.
D1 · Cyclomatic Complexity · Program.Main (cyclomatic 21) · ×1
  • Program.Main (cyclomatic 21) CompilerApiBook/CompileHelloWorld/Program.vb:151 — Program.Main has cyclomatic complexity 21 (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.
D1 · Cyclomatic Complexity · QbScreen.Line (cyclomatic 20) · ×1
  • QbScreen.Line (cyclomatic 20) GUI/WinForms_GameLoop/Screen.vb:128 — QbScreen.Line has cyclomatic complexity 20 (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.
D1 · Cyclomatic Complexity · Program.ExtractLinks (cyclomatic 20) · ×1
  • Program.ExtractLinks (cyclomatic 20) QB64/TxtToWiki/Program.vb:242 — Program.ExtractLinks has cyclomatic complexity 20 (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.
D1 · Cyclomatic Complexity · Program.ReviewRenameFiles (cyclomatic 20) · ×1
  • Program.ReviewRenameFiles (cyclomatic 20) QB64/TxtToWiki/Program.vb:310 — Program.ReviewRenameFiles has cyclomatic complexity 20 (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.
D1 · Cyclomatic Complexity · Screen.Line (cyclomatic 19) · ×1
  • Screen.Line (cyclomatic 19) GUI/SDL2_Gameloop/Program.vb:224 — Screen.Line has cyclomatic complexity 19 (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.
D1 · Cyclomatic Complexity · Program.PageLinkVerifier (cyclomatic 19) · ×1
  • Program.PageLinkVerifier (cyclomatic 19) QB64/TxtToWiki/Program.vb:176 — Program.PageLinkVerifier has cyclomatic complexity 19 (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.
D1 · Cyclomatic Complexity · PlayEmulator.PlayVoice (cyclomatic 19) · ×1
  • PlayEmulator.PlayVoice (cyclomatic 19) Sound/Play2Wav/Program.vb:100 — PlayEmulator.PlayVoice has cyclomatic complexity 19 (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.
D1 · Cyclomatic Complexity · Program.BoolExpression (cyclomatic 18) · ×1
  • Program.BoolExpression (cyclomatic 18) TinyBASIC/Program.vb:401 — Program.BoolExpression has cyclomatic complexity 18 (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.
D1 · Cyclomatic Complexity · Tokenizer.Parse (cyclomatic 18) · ×1
  • Tokenizer.Parse (cyclomatic 18) CompilerApiBook/CompileHelloWorld/Tokens.vb:6 — Tokenizer.Parse has cyclomatic complexity 18 (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.
D1 · Cyclomatic Complexity · Parser.Parse (cyclomatic 18) · ×1
  • Parser.Parse (cyclomatic 18) QB64/MarkdownHelp/Program.vb:743 — Parser.Parse has cyclomatic complexity 18 (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.
D1 · Cyclomatic Complexity · RecordGenerator.ProcessClass (cyclomatic 17) · ×1
  • RecordGenerator.ProcessClass (cyclomatic 17) SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:97 — RecordGenerator.ProcessClass has cyclomatic complexity 17 (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.
D1 · Cyclomatic Complexity · Form1.PlotShotAwait (cyclomatic 17) · ×1
  • Form1.PlotShotAwait (cyclomatic 17) QBasic/Gorilla/Form1.vb:1029 — Form1.PlotShotAwait has cyclomatic complexity 17 (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.
D1 · Cyclomatic Complexity · RemLineNew.GetFileNames (cyclomatic 16) · ×1
  • RemLineNew.GetFileNames (cyclomatic 16) QBasic/RemLine/Program.vb:235 — RemLineNew.GetFileNames has cyclomatic complexity 16 (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.
D1 · Cyclomatic Complexity · RemLine_RawConversion.GetFileNames (cyclomatic 16) · ×1
  • RemLine_RawConversion.GetFileNames (cyclomatic 16) QBasic/RemLine/RawConversion.vb:240 — RemLine_RawConversion.GetFileNames has cyclomatic complexity 16 (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.
D1 · Cyclomatic Complexity · WaveOutEnumAndPlay.Main (cyclomatic 16) · ×1
  • WaveOutEnumAndPlay.Main (cyclomatic 16) Sound/ContTone/Program.vb:89 — WaveOutEnumAndPlay.Main has cyclomatic complexity 16 (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.
D17 · Explicit Debt · ObsoleteWithCallers · ×1
  • ObsoleteWithCallers Tui/Program.vb:92 — <Obsolete> __InlineAssignHelper
D18 · Solution Shape · Solution references 4 projects that do not exist · ×1
  • Solution references 4 projects that do not exist Samples.sln — `Samples.sln` declares 4 project file(s) that are missing from the tree (`FNA.Core.csproj`, `QB.Compatibility.vbproj`, `SDL2-CS.Core.csproj`, `GUI/WinForms_GameLoop/WinForms_Gameloop.vbproj`). A solution-level restore or build fails on a dangling reference, so anyone building the solution rather than an individual project is blocked. Delete the stale entry from the solution, or restore the missing project file.
D2 · Cognitive Complexity · ImplicitInterfaceGenerator.Execute (cognitive 626) · ×1
  • ImplicitInterfaceGenerator.Execute (cognitive 626) SourceGenerators/ImplicitInterfaceGenerator/ImplicitInterfaceGenerator.vb:42 — ImplicitInterfaceGenerator.Execute has cognitive complexity 626 (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.
D2 · Cognitive Complexity · Program.ConvertTxtToWiki (cognitive 303) · ×1
  • Program.ConvertTxtToWiki (cognitive 303) QB64/TxtToWiki/Program.vb:413 — Program.ConvertTxtToWiki has cognitive complexity 303 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 295) · ×1
  • Program.Main (cognitive 295) QB64/MarkdownHelp/Program.vb:25 — Program.Main has cognitive complexity 295 (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.
D2 · Cognitive Complexity · ImplicitInterfaceGenerator.Execute (cognitive 286) · ×1
  • ImplicitInterfaceGenerator.Execute (cognitive 286) SourceGenerators/SourceGeneratorSamples/ImplicitInterfaceGenerator.vb:41 — ImplicitInterfaceGenerator.Execute has cognitive complexity 286 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 262) · ×1
  • Program.Main (cognitive 262) TinyBASIC/Program.vb:14 — Program.Main has cognitive complexity 262 (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.
D2 · Cognitive Complexity · FormExGenerator.Execute (cognitive 152) · ×1
  • FormExGenerator.Execute (cognitive 152) FormExGenerator/FormExGenerator.vb:36 — FormExGenerator.Execute has cognitive complexity 152 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 119) · ×1
  • Program.Main (cognitive 119) OLC/Other/Tetris/Program.vb:47 — Program.Main has cognitive complexity 119 (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.
D2 · Cognitive Complexity · Nibbles.PlayNibbles (cognitive 104) · ×1
  • Nibbles.PlayNibbles (cognitive 104) QBasic/Nibbles/Program.vb:503 — Nibbles.PlayNibbles has cognitive complexity 104 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 95) · ×1
  • Program.Main (cognitive 95) OLC/Other/Snake/Program.vb:55 — Program.Main has cognitive complexity 95 (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.
D2 · Cognitive Complexity · VbRewriter.VisitExpressionStatement (cognitive 93) · ×1
  • VbRewriter.VisitExpressionStatement (cognitive 93) Transpiler/VbRewriter.vb:62 — VbRewriter.VisitExpressionStatement has cognitive complexity 93 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 91) · ×1
  • Program.Main (cognitive 91) Serial/PC-To-Centurion/Program.vb:30 — Program.Main has cognitive complexity 91 (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.
D2 · Cognitive Complexity · Program.ExtractLinks (cognitive 82) · ×1
  • Program.ExtractLinks (cognitive 82) QB64/TxtToWiki/Program.vb:242 — Program.ExtractLinks has cognitive complexity 82 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 78) · ×1
  • Program.Main (cognitive 78) BasicComputerGames/02_Amazing/Program.vb:8 — Program.Main has cognitive complexity 78 (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.
D2 · Cognitive Complexity · QbScreen.Line (cognitive 77) · ×1
  • QbScreen.Line (cognitive 77) GUI/WinForms_GameLoop/Screen.vb:128 — QbScreen.Line has cognitive complexity 77 (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.
D2 · Cognitive Complexity · Screen.Line (cognitive 76) · ×1
  • Screen.Line (cognitive 76) GUI/SDL2_Gameloop/Program.vb:224 — Screen.Line has cognitive complexity 76 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 74) · ×1
  • Program.Main (cognitive 74) SerialTesting/Program.vb:16 — Program.Main has cognitive complexity 74 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 69) · ×1
  • Program.Main (cognitive 69) QB64/Qb64SamplesToMarkdown/Program.vb:302 — Program.Main has cognitive complexity 69 (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.
D2 · Cognitive Complexity · QbScreen.Circle (cognitive 68) · ×1
  • QbScreen.Circle (cognitive 68) GUI/WinForms_GameLoop/Screen.vb:236 — QbScreen.Circle has cognitive complexity 68 (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.
D2 · Cognitive Complexity · Screen.Circle (cognitive 64) · ×1
  • Screen.Circle (cognitive 64) GUI/SDL2_Gameloop/Program.vb:330 — Screen.Circle has cognitive complexity 64 (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.
D2 · Cognitive Complexity · Program.PrepareBuffers (cognitive 64) · ×1
  • Program.PrepareBuffers (cognitive 64) Serial/PC-To-Centurion/Program.vb:262 — Program.PrepareBuffers has cognitive complexity 64 (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.
D2 · Cognitive Complexity · Player3.HandleTimer (cognitive 63) · ×1
  • Player3.HandleTimer (cognitive 63) SoundBeepPlay/Player3.vb:382 — Player3.HandleTimer has cognitive complexity 63 (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.
D2 · Cognitive Complexity · Parser.Parse (cognitive 62) · ×1
  • Parser.Parse (cognitive 62) QB64/MarkdownHelp/Program.vb:743 — Parser.Parse has cognitive complexity 62 (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.
D2 · Cognitive Complexity · Tokenizer.PopRawText (cognitive 60) · ×1
  • Tokenizer.PopRawText (cognitive 60) CompilerApiBook/CompileHelloWorld/Tokens.vb:86 — Tokenizer.PopRawText has cognitive complexity 60 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 58) · ×1
  • Program.Main (cognitive 58) OLC/Other/Synth4/Program.vb:525 — Program.Main has cognitive complexity 58 (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.
D2 · Cognitive Complexity · Page.AddContent (cognitive 57) · ×1
  • Page.AddContent (cognitive 57) QB64/Qb64SamplesToMarkdown/Program.vb:53 — Page.AddContent has cognitive complexity 57 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 55) · ×1
  • Program.Main (cognitive 55) Sound/ModExtract/Program.vb:87 — Program.Main has cognitive complexity 55 (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.
D2 · Cognitive Complexity · Program.PageLinkVerifier (cognitive 52) · ×1
  • Program.PageLinkVerifier (cognitive 52) QB64/TxtToWiki/Program.vb:176 — Program.PageLinkVerifier has cognitive complexity 52 (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.
D2 · Cognitive Complexity · Form1.SetLightMode (cognitive 50) · ×1
  • Form1.SetLightMode (cognitive 50) WinFormsApp1/Form1.vb:58 — Form1.SetLightMode has cognitive complexity 50 (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.
D2 · Cognitive Complexity · Program.Main1 (cognitive 49) · ×1
  • Program.Main1 (cognitive 49) CompilerApiBook/CompileHelloWorld/Program.vb:6 — Program.Main1 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.
D2 · Cognitive Complexity · Program.ReviewRenameFiles (cognitive 47) · ×1
  • Program.ReviewRenameFiles (cognitive 47) QB64/TxtToWiki/Program.vb:310 — Program.ReviewRenameFiles has cognitive complexity 47 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 47) · ×1
  • Program.Main (cognitive 47) BasicComputerGames/30_Cube/Program.vb:8 — Program.Main has cognitive complexity 47 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 43) · ×1
  • Program.Main (cognitive 43) CompilerApiBook/CompileHelloWorld/Program.vb:151 — Program.Main has cognitive complexity 43 (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.
D2 · Cognitive Complexity · Form1.SetDarkMode (cognitive 42) · ×1
  • Form1.SetDarkMode (cognitive 42) WinFormsApp1/Form1.vb:168 — Form1.SetDarkMode has cognitive complexity 42 (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.
D2 · Cognitive Complexity · Form1.MakeCityScape (cognitive 42) · ×1
  • Form1.MakeCityScape (cognitive 42) QBasic/Gorilla/Form1.vb:802 — Form1.MakeCityScape has cognitive complexity 42 (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.
D2 · Cognitive Complexity · Form1.PlotShotAwait (cognitive 42) · ×1
  • Form1.PlotShotAwait (cognitive 42) QBasic/Gorilla/Form1.vb:1029 — Form1.PlotShotAwait has cognitive complexity 42 (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.
D2 · Cognitive Complexity · Program.BoolExpression (cognitive 40) · ×1
  • Program.BoolExpression (cognitive 40) TinyBASIC/Program.vb:401 — Program.BoolExpression has cognitive complexity 40 (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.
D2 · Cognitive Complexity · FormExGenerator.MethodExists (cognitive 36) · ×1
  • FormExGenerator.MethodExists (cognitive 36) FormExGenerator/FormExGenerator.vb:694 — FormExGenerator.MethodExists has cognitive complexity 36 (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.
D2 · Cognitive Complexity · RemLineNew.GenOutFile (cognitive 34) · ×1
  • RemLineNew.GenOutFile (cognitive 34) QBasic/RemLine/Program.vb:164 — RemLineNew.GenOutFile has cognitive complexity 34 (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.
D2 · Cognitive Complexity · Player3.WaveOut_PlaybackStopped (cognitive 32) · ×1
  • Player3.WaveOut_PlaybackStopped (cognitive 32) SoundBeepPlay/Player3.vb:687 — Player3.WaveOut_PlaybackStopped has cognitive complexity 32 (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.
D2 · Cognitive Complexity · RecordGenerator.ProcessClass (cognitive 32) · ×1
  • RecordGenerator.ProcessClass (cognitive 32) SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:97 — RecordGenerator.ProcessClass has cognitive complexity 32 (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.
D2 · Cognitive Complexity · Tokenizer.Parse (cognitive 32) · ×1
  • Tokenizer.Parse (cognitive 32) CompilerApiBook/CompileHelloWorld/Tokens.vb:6 — Tokenizer.Parse has cognitive complexity 32 (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.
D2 · Cognitive Complexity · Program.ReplaceCurly (cognitive 32) · ×1
  • Program.ReplaceCurly (cognitive 32) QB64/TxtToWiki/Program.vb:1157 — Program.ReplaceCurly has cognitive complexity 32 (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.
D2 · Cognitive Complexity · RemLine.GenOutFile (cognitive 31) · ×1
  • RemLine.GenOutFile (cognitive 31) Transpiler/RemLine.vb:84 — RemLine.GenOutFile has cognitive complexity 31 (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.
D2 · Cognitive Complexity · Program.GroupExpression (cognitive 30) · ×1
  • Program.GroupExpression (cognitive 30) TinyBASIC/Program.vb:502 — Program.GroupExpression has cognitive complexity 30 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 28) · ×1
  • Program.Main (cognitive 28) BasicComputerGames/01_AceyDucey/Program.vb:8 — Program.Main has cognitive complexity 28 (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.
D2 · Cognitive Complexity · X11Backend.PollEvents (cognitive 28) · ×1
  • X11Backend.PollEvents (cognitive 28) GUI/X11/X11Backend.vb:218 — X11Backend.PollEvents has cognitive complexity 28 (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.
D2 · Cognitive Complexity · Nibbles.Level (cognitive 27) · ×1
  • Nibbles.Level (cognitive 27) QBasic/Nibbles/Program.vb:368 — Nibbles.Level has cognitive complexity 27 (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.
D2 · Cognitive Complexity · Program.MulExpression (cognitive 26) · ×1
  • Program.MulExpression (cognitive 26) TinyBASIC/Program.vb:464 — Program.MulExpression has cognitive complexity 26 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 25) · ×1
  • Program.Main (cognitive 25) OLC/Other/CaveDiver/Program.vb:28 — Program.Main has cognitive complexity 25 (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.
D2 · Cognitive Complexity · WaveOutEnumAndPlay.Main (cognitive 24) · ×1
  • WaveOutEnumAndPlay.Main (cognitive 24) Sound/ContTone/Program.vb:89 — WaveOutEnumAndPlay.Main has cognitive complexity 24 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 23) · ×1
  • Program.Main (cognitive 23) Sound/WaveOutBuffered/Program.vb:71 — Program.Main has cognitive complexity 23 (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.
D2 · Cognitive Complexity · RecordGenerator.Execute (cognitive 22) · ×1
  • RecordGenerator.Execute (cognitive 22) SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:36 — RecordGenerator.Execute has cognitive complexity 22 (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.
D2 · Cognitive Complexity · RemLine_RawConversion.GenOutFile (cognitive 22) · ×1
  • RemLine_RawConversion.GenOutFile (cognitive 22) QBasic/RemLine/RawConversion.vb:183 — RemLine_RawConversion.GenOutFile has cognitive complexity 22 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 22) · ×1
  • Program.Main (cognitive 22) Json101/Program.vb:6 — Program.Main has cognitive complexity 22 (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.
D2 · Cognitive Complexity · Module1.GeneratePlay (cognitive 21) · ×1
  • Module1.GeneratePlay (cognitive 21) Audio/Rtttl2Play/Program.vb:220 — Module1.GeneratePlay has cognitive complexity 21 (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.
D2 · Cognitive Complexity · RemLine.BuildTable (cognitive 21) · ×1
  • RemLine.BuildTable (cognitive 21) Transpiler/RemLine.vb:38 — RemLine.BuildTable has cognitive complexity 21 (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.
D2 · Cognitive Complexity · RemLineNew.BuildTable (cognitive 21) · ×1
  • RemLineNew.BuildTable (cognitive 21) QBasic/RemLine/Program.vb:119 — RemLineNew.BuildTable has cognitive complexity 21 (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.
D2 · Cognitive Complexity · RemLine_RawConversion.BuildTable (cognitive 21) · ×1
  • RemLine_RawConversion.BuildTable (cognitive 21) QBasic/RemLine/RawConversion.vb:140 — RemLine_RawConversion.BuildTable has cognitive complexity 21 (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.
D2 · Cognitive Complexity · olcNoiseMaker.MainThread (cognitive 20) · ×1
  • olcNoiseMaker.MainThread (cognitive 20) OLC/Other/Synth4/olcNoiseMaker.vb:252 — olcNoiseMaker.MainThread has cognitive complexity 20 (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.
D2 · Cognitive Complexity · SerialTerminal3.ApplyAnsiCode (cognitive 20) · ×1
  • SerialTerminal3.ApplyAnsiCode (cognitive 20) Serial/Term/SerialTerminal3.vb:88 — SerialTerminal3.ApplyAnsiCode has cognitive complexity 20 (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.
D2 · Cognitive Complexity · SoundGenerator.InternalNew (cognitive 19) · ×1
  • SoundGenerator.InternalNew (cognitive 19) SoundBeepPlay/SoundGenerator.vb:37 — SoundGenerator.InternalNew has cognitive complexity 19 (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.
D2 · Cognitive Complexity · ComboBoxEx.WndProc (cognitive 19) · ×1
  • ComboBoxEx.WndProc (cognitive 19) WinFormsApp1/Community.Windows.FormsEx/ComboBoxEx.vb:44 — ComboBoxEx.WndProc has cognitive complexity 19 (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.
D2 · Cognitive Complexity · Program.CompareFiles (cognitive 19) · ×1
  • Program.CompareFiles (cognitive 19) CompareFolders/Program.vb:12 — Program.CompareFiles has cognitive complexity 19 (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.
D2 · Cognitive Complexity · Program.ConvertFiles (cognitive 18) · ×1
  • Program.ConvertFiles (cognitive 18) ConsoleApp1/Program.vb:33 — Program.ConvertFiles has cognitive complexity 18 (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.
D2 · Cognitive Complexity · FormExGenerator.FieldExists (cognitive 18) · ×1
  • FormExGenerator.FieldExists (cognitive 18) FormExGenerator/FormExGenerator.vb:662 — FormExGenerator.FieldExists has cognitive complexity 18 (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.
D2 · Cognitive Complexity · Nibbles.Set (cognitive 18) · ×1
  • Nibbles.Set (cognitive 18) QBasic/Nibbles/Program.vb:699 — Nibbles.Set has cognitive complexity 18 (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.
D2 · Cognitive Complexity · EnvelopeADSR.Amplitude (cognitive 18) · ×1
  • EnvelopeADSR.Amplitude (cognitive 18) OLC/Other/Synth4/Program.vb:145 — EnvelopeADSR.Amplitude has cognitive complexity 18 (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.
D2 · Cognitive Complexity · Program.DoesPieceFit (cognitive 18) · ×1
  • Program.DoesPieceFit (cognitive 18) OLC/Other/Tetris/Program.vb:227 — Program.DoesPieceFit has cognitive complexity 18 (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.
D2 · Cognitive Complexity · Program.Process (cognitive 18) · ×1
  • Program.Process (cognitive 18) ScanMkDn/Program.vb:117 — Program.Process has cognitive complexity 18 (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.
D2 · Cognitive Complexity · Program.Main (cognitive 17) · ×1
  • Program.Main (cognitive 17) PLAYground/Program.vb:9 — Program.Main 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.
D2 · Cognitive Complexity · Module1.ParseNotes (cognitive 17) · ×1
  • Module1.ParseNotes (cognitive 17) Audio/Rtttl2Play/Program.vb:92 — Module1.ParseNotes 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.
D2 · Cognitive Complexity · Form1.GetNumAwait (cognitive 17) · ×1
  • Form1.GetNumAwait (cognitive 17) QBasic/Gorilla/Form1.vb:623 — Form1.GetNumAwait 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.
D2 · Cognitive Complexity · EnvelopeADSR.Amplitude (cognitive 17) · ×1
  • EnvelopeADSR.Amplitude (cognitive 17) OLC/Other/Synth3/Program.vb:144 — EnvelopeADSR.Amplitude 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.
D2 · Cognitive Complexity · BitmapFont.DrawDigit (cognitive 17) · ×1
  • BitmapFont.DrawDigit (cognitive 17) GUI/X11/BitmapFont.vb:124 — BitmapFont.DrawDigit 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.
D2 · Cognitive Complexity · MustacheGenerator.GetMustacheOptions (cognitive 16) · ×1
  • MustacheGenerator.GetMustacheOptions (cognitive 16) SourceGenerators/SourceGeneratorSamples/MustacheGenerator.vb:64 — MustacheGenerator.GetMustacheOptions 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.
D3 · God Classes · TooManyMethods · ×1
  • TooManyMethods: Inline ConsoleApp1/Inline.vb — TooManyMethods — 211 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 30 methods; this is 15 over it, 1.50× 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.
D32 · Data Compliance (PII/GDPR) · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Edited copy of a member (42 corresponding lines) · ×1
  • Edited copy of a member (42 corresponding lines) SoundBeepPlay/Player3.vb:75 — SoundBeepPlay/Player3.vb:75-124 | SoundBeepPlay/Player3.vb:138-231 — These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (5 members, 50+ identical tokens) PLAYground/ParsePlayMacro.vb:356 — PLAYground/ParsePlayMacro.vb:356-419 | QBasic/Gorilla/Music.vb:345-381 | QBasic/Gorilla/Music.vb:393-456 | QBasic/Nibbles/Music.vb:351-387 | QBasic/Nibbles/Music.vb:393-456 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication · Edited copy of a member (174 corresponding lines) · ×1
  • Edited copy of a member (174 corresponding lines) GUI/SDL2_Gameloop/Program.vb:355 — GUI/SDL2_Gameloop/Program.vb:355-528 | GUI/WinForms_GameLoop/Screen.vb:261-443 — These two members are one piece of code written twice and then edited apart: 174 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 (97 corresponding lines) · ×1
  • Edited copy of a member (97 corresponding lines) GUI/SDL2_Gameloop/Program.vb:230 — GUI/SDL2_Gameloop/Program.vb:230-326 | GUI/WinForms_GameLoop/Screen.vb:130-232 — These two members are one piece of code written twice and then edited apart: 97 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 (106 corresponding lines) · ×1
  • Edited copy of a member (106 corresponding lines) WinFormsApp1/Form1.vb:60 — WinFormsApp1/Form1.vb:60-165 | WinFormsApp1/Form1.vb:170-275 — These two members are one piece of code written twice and then edited apart: 106 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 copies of one member (3 members, 52+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 52+ corresponding lines) PLAYground/ParsePlayMacro.vb:265 — PLAYground/ParsePlayMacro.vb:265-316 | QBasic/Gorilla/Music.vb:262-313 | QBasic/Nibbles/Music.vb:262-313 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 52 lines, 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 out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (76 corresponding lines) · ×1
  • Edited copy of a member (76 corresponding lines) OLC/Other/Synth1/Program.vb:58 — OLC/Other/Synth1/Program.vb:58-134 | OLC/Other/Synth2/Program.vb:213-288 — These two members are one piece of code written twice and then edited apart: 76 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 (57 corresponding lines) · ×1
  • Edited copy of a member (57 corresponding lines) Transpiler/RemLine.vb:86 — Transpiler/RemLine.vb:86-151 | QBasic/RemLine/Program.vb:167-223 — These two members are one piece of code written twice and then edited apart: 57 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 (25 corresponding lines) · ×1
  • Edited copy of a member (25 corresponding lines) Sound/ThreadPlayer/Program.vb:235 — Sound/ThreadPlayer/Program.vb:235-259 | Sound/ThreadPlayerRing/Program.vb:255-280 — These two members are one piece of code written twice and then edited apart: 25 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 (35 corresponding lines) · ×1
  • Edited copy of a member (35 corresponding lines) QBasic/RemLine/Program.vb:69 — QBasic/RemLine/Program.vb:69-103 | QBasic/RemLine/RawConversion.vb:87-124 — These two members are one piece of code written twice and then edited apart: 35 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 (38 corresponding lines) · ×1
  • Edited copy of a member (38 corresponding lines) QBasic/RemLine/Program.vb:237 — QBasic/RemLine/Program.vb:237-274 | QBasic/RemLine/RawConversion.vb:242-279 — These two members are one piece of code written twice and then edited apart: 38 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 (29 corresponding lines) · ×1
  • Edited copy of a member (29 corresponding lines) QBasic/Gorilla/Form1.vb:1405 — QBasic/Gorilla/Form1.vb:1405-1436 | QBasic/Nibbles/Program.vb:764-792 — 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 (17 corresponding lines) · ×1
  • Edited copy of a member (17 corresponding lines) WinFormsApp1/Community.Windows.FormsEx/PanelEx.vb:259 — WinFormsApp1/Community.Windows.FormsEx/PanelEx.vb:259-275 | WinFormsApp1/Community.Windows.FormsEx/ScrollBarExPanel.vb:91-107 — 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 copies of one member (3 members, 28+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 28+ corresponding lines) OLC/Other/Synth2/Program.vb:55 — OLC/Other/Synth2/Program.vb:55-82 | OLC/Other/Synth3/Program.vb:70-100 | OLC/Other/Synth4/Program.vb:75-103 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 lines, 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 out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 29+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 29+ corresponding lines) QBasic/RemLine/Program.vb:124 — QBasic/RemLine/Program.vb:124-152 | QBasic/RemLine/RawConversion.vb:142-171 | Transpiler/RemLine.vb:41-72 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 lines, 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 out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 36+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 36+ corresponding lines) QBasic/RemLine/Program.vb:291 — QBasic/RemLine/Program.vb:291-327 | QBasic/RemLine/RawConversion.vb:299-334 | Transpiler/RemLine.vb:219-255 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 36 lines, 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 out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (6 members, 9+ corresponding lines) · ×1
  • Edited copies of one member (6 members, 9+ corresponding lines) OLC/Other/Synth3/Program.vb:217 — OLC/Other/Synth3/Program.vb:217-225 | OLC/Other/Synth3/Program.vb:243-251 | OLC/Other/Synth3/Program.vb:269-277 | OLC/Other/Synth4/Program.vb:222-230 | OLC/Other/Synth4/Program.vb:250-258 | OLC/Other/Synth4/Program.vb:279-288 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 9 lines, 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 out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (11 corresponding lines) · ×1
  • Edited copy of a member (11 corresponding lines) SoundBeepPlay/SoundGenerator.vb:571 — SoundBeepPlay/SoundGenerator.vb:571-581 | SoundBeepPlay/SoundGenerator.vb:587-611 — 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 copies of one member (4 members, 9+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 9+ corresponding lines) OLC/Other/Synth1/olcNoiseMaker.vb:293 — OLC/Other/Synth1/olcNoiseMaker.vb:293-301 | OLC/Other/Synth2/olcNoiseMaker.vb:290-298 | OLC/Other/Synth3/olcNoiseMaker.vb:314-324 | OLC/Other/Synth4/olcNoiseMaker.vb:320-328 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, 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 out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (14 corresponding lines) · ×1
  • Edited copy of a member (14 corresponding lines) QBasic/Gorilla/Form1.vb:1496 — QBasic/Gorilla/Form1.vb:1496-1510 | QBasic/Nibbles/Program.vb:871-884 — 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 (10 corresponding lines) · ×1
  • Edited copy of a member (10 corresponding lines) Serial/Term/SerialTerminal2.vb:34 — Serial/Term/SerialTerminal2.vb:34-46 | Serial/Term/SerialTerminal3.vb:37-46 — 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.
D4 · Code Duplication · Edited copy of a member (6 corresponding lines) · ×1
  • Edited copy of a member (6 corresponding lines) Transpiler/RemLine.vb:289 — Transpiler/RemLine.vb:289-294 | QBasic/RemLine/Program.vb:361-366 — 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 (5 corresponding lines) · ×1
  • Edited copy of a member (5 corresponding lines) WinFormsApp1/Form1.vb:301 — WinFormsApp1/Form1.vb:301-305 | WinForms/Browser/Form1.vb:65-69 — 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 · Duplicated block (78 lines × 2) · ×1
  • Duplicated block (78 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:276 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:276-353 | WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb:276-353 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb` and `WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (41–44 lines × 2) · ×1
  • Duplicated block (41–44 lines × 2) Serial/PC-To-Centurion/Program.vb:58 — Serial/PC-To-Centurion/Program.vb:58-98 | SerialTesting/Program.vb:34-77 — before extracting anything, compare `Serial/PC-To-Centurion/Program.vb` and `SerialTesting/Program.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (42–43 lines × 2) · ×1
  • Duplicated block (42–43 lines × 2) SoundBeepPlay/Player3.vb:83 — SoundBeepPlay/Player3.vb:83-124 | SoundBeepPlay/Player3.vb:189-231 — 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.
D4 · Code Duplication · Duplicated block (42 lines × 2) · ×1
  • Duplicated block (42 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:357 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:357-398 | WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb:357-398 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb` and `WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (40 lines × 2) · ×1
  • Duplicated block (40 lines × 2) OLC/Other/Synth3/Program.vb:146 — OLC/Other/Synth3/Program.vb:146-185 | OLC/Other/Synth4/Program.vb:147-186 — 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.
D4 · Code Duplication · Duplicated block (38 lines × 3) · ×1
  • Duplicated block (38 lines × 3) PLAYground/ParsePlayMacro.vb:265 — PLAYground/ParsePlayMacro.vb:265-302 | QBasic/Gorilla/Music.vb:262-299 | QBasic/Nibbles/Music.vb:262-299 — before extracting anything, compare `PLAYground/ParsePlayMacro.vb` and `QBasic/Gorilla/Music.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 117 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `PLAYground/ParsePlayMacro.vb:260` calls `Generate` and `QBasic/Gorilla/Music.vb:258` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (37 lines × 3) · ×1
  • Duplicated block (37 lines × 3) PLAYground/ParsePlayMacro.vb:383 — PLAYground/ParsePlayMacro.vb:383-419 | QBasic/Gorilla/Music.vb:420-456 | QBasic/Nibbles/Music.vb:420-456 — before extracting anything, compare `PLAYground/ParsePlayMacro.vb` and `QBasic/Gorilla/Music.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 117 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (32–33 lines × 2) · ×1
  • Duplicated block (32–33 lines × 2) OLC/Other/Synth1/olcNoiseMaker.vb:243 — OLC/Other/Synth1/olcNoiseMaker.vb:243-275 | OLC/Other/Synth2/olcNoiseMaker.vb:241-272 — `OLC/Other/Synth1/olcNoiseMaker.vb` and `OLC/Other/Synth2/olcNoiseMaker.vb` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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 · Duplicated block (32 lines × 3) · ×1
  • Duplicated block (32 lines × 3) BasicComputerGames/02_Amazing/Program.vb:61 — BasicComputerGames/02_Amazing/Program.vb:61-92 | BasicComputerGames/02_Amazing/Program.vb:98-129 | BasicComputerGames/02_Amazing/Program.vb:144-175 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. 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 · Duplicated block (32 lines × 2) · ×1
  • Duplicated block (32 lines × 2) OLC/Other/Synth3/olcNoiseMaker.vb:97 — OLC/Other/Synth3/olcNoiseMaker.vb:97-128 | OLC/Other/Synth4/olcNoiseMaker.vb:99-130 — 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.
D4 · Code Duplication · Duplicated block (24–29 lines × 3) · ×1
  • Duplicated block (24–29 lines × 3) SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:300 — SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:300-323 | SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:330-353 | SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:360-388 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:300` 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.
D4 · Code Duplication · Duplicated block (39 lines × 2) · ×1
  • Duplicated block (39 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/PanelEx.vb:136 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/PanelEx.vb:136-174 | WinFormsApp1/Community.Windows.FormsEx/PanelEx.vb:160-198 — 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.
D4 · Code Duplication · Duplicated block (28 lines × 3) · ×1
  • Duplicated block (28 lines × 3) OLC/Other/Synth1/olcNoiseMaker.vb:114 — OLC/Other/Synth1/olcNoiseMaker.vb:114-141 | OLC/Other/Synth2/olcNoiseMaker.vb:114-141 | OLC/Other/Synth3/olcNoiseMaker.vb:116-143 — `OLC/Other/Synth1/olcNoiseMaker.vb` and `OLC/Other/Synth2/olcNoiseMaker.vb` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (25 lines × 2) · ×1
  • Duplicated block (25 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb:82 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb:82-106 | WinFormsApp1/Community.Windows.FormsEx/HScrollBarEx.vb:82-106 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/HScrollBarEx.vb` and `WinFormsApp1/Community.Windows.FormsEx/HScrollBarEx.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (8–22 lines × 2) · ×1
  • Duplicated block (8–22 lines × 2) SoundBeepPlay/SoundGenerator.vb:571 — SoundBeepPlay/SoundGenerator.vb:571-578 | SoundBeepPlay/SoundGenerator.vb:587-608 — 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.
D4 · Code Duplication · Duplicated block (20 lines × 3) · ×1
  • Duplicated block (20 lines × 3) OLC/Other/Synth1/Program.vb:60 — OLC/Other/Synth1/Program.vb:60-79 | OLC/Other/Synth2/Program.vb:215-234 | OLC/Other/Synth3/Program.vb:333-352 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
D4 · Code Duplication · Duplicated block (18 lines × 3) · ×1
  • Duplicated block (18 lines × 3) OLC/Other/Synth1/olcNoiseMaker.vb:93 — OLC/Other/Synth1/olcNoiseMaker.vb:93-110 | OLC/Other/Synth2/olcNoiseMaker.vb:93-110 | OLC/Other/Synth3/olcNoiseMaker.vb:95-112 — `OLC/Other/Synth1/olcNoiseMaker.vb` and `OLC/Other/Synth2/olcNoiseMaker.vb` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×1
  • Duplicated block (19 lines × 2) WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:144 — WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:144-162 | WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb:144-162 — before extracting anything, compare `WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb` and `WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (16–19 lines × 2) · ×1
  • Duplicated block (16–19 lines × 2) Serial/Term/Program.vb:30 — Serial/Term/Program.vb:30-48 | Serial/Term/Program.vb:55-70 — 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.
D4 · Code Duplication · Duplicated block (8 lines × 3) · ×1
  • Duplicated block (8 lines × 3) BasicComputerGames/02_Amazing/Program.vb:125 — BasicComputerGames/02_Amazing/Program.vb:125-132 | BasicComputerGames/02_Amazing/Program.vb:171-178 | BasicComputerGames/02_Amazing/Program.vb:190-197 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (17 lines × 4) · ×1
  • Duplicated block (17 lines × 4) SourceGenerators/SourceGeneratorSamples/AutoNotifyGenerator.vb:128 — SourceGenerators/SourceGeneratorSamples/AutoNotifyGenerator.vb:128-144 | SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:300-316 | SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:330-346 | SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:360-376 — 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.
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×1
  • Duplicated block (17 lines × 2) QBasic/RemLine/Program.vb:178 — QBasic/RemLine/Program.vb:178-194 | Transpiler/RemLine.vb:103-119 — before extracting anything, compare `QBasic/RemLine/Program.vb` and `Transpiler/RemLine.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (16 lines × 3) · ×1
  • Duplicated block (16 lines × 3) PLAYground/ParsePlayMacro.vb:320 — PLAYground/ParsePlayMacro.vb:320-335 | QBasic/Gorilla/Music.vb:317-332 | QBasic/Nibbles/Music.vb:317-332 — before extracting anything, compare `PLAYground/ParsePlayMacro.vb` and `QBasic/Gorilla/Music.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 117 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×1
  • Duplicated block (14 lines × 2) OLC/Other/Synth3/Program.vb:70 — OLC/Other/Synth3/Program.vb:70-83 | OLC/Other/Synth4/Program.vb:75-88 — 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.
D4 · Code Duplication · Duplicated block (13–14 lines × 2) · ×1
  • Duplicated block (13–14 lines × 2) Sound/2secTone/Program.vb:141 — Sound/2secTone/Program.vb:141-154 | Sound/ContTone/Program.vb:230-242 — 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.
D4 · Code Duplication · Duplicated block (13 lines × 4) · ×1
  • Duplicated block (13 lines × 4) QBasic/Gorilla/Music.vb:364 — QBasic/Gorilla/Music.vb:364-376 | QBasic/Gorilla/Music.vb:414-426 | QBasic/Nibbles/Music.vb:370-382 | QBasic/Nibbles/Music.vb:414-426 — `QBasic/Gorilla/Music.vb` and `QBasic/Nibbles/Music.vb` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 7 separate duplicated blocks between them, totalling at least 167 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×1
  • Duplicated block (13 lines × 2) GUI/X11/BasicGraphics.vb:22 — GUI/X11/BasicGraphics.vb:22-34 | GUI/X11/QB.vb:22-34 — before extracting anything, compare `GUI/X11/BasicGraphics.vb` and `GUI/X11/QB.vb` as WHOLE FILES: 86% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (12 lines × 6) · ×1
  • Duplicated block (12 lines × 6) BasicComputerGames/02_Amazing/Program.vb:67 — BasicComputerGames/02_Amazing/Program.vb:67-78 | BasicComputerGames/02_Amazing/Program.vb:94-105 | BasicComputerGames/02_Amazing/Program.vb:119-130 | BasicComputerGames/02_Amazing/Program.vb:140-151 | BasicComputerGames/02_Amazing/Program.vb:165-176 | BasicComputerGames/02_Amazing/Program.vb:184-195 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `BasicComputerGames/02_Amazing/Program.vb:93` calls `W` and `BasicComputerGames/02_Amazing/Program.vb:66` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (10 lines × 3) · ×1
  • Duplicated block (10 lines × 3) OLC/Other/Synth1/olcNoiseMaker.vb:166 — OLC/Other/Synth1/olcNoiseMaker.vb:166-175 | OLC/Other/Synth2/olcNoiseMaker.vb:164-173 | OLC/Other/Synth3/olcNoiseMaker.vb:167-176 — `OLC/Other/Synth1/olcNoiseMaker.vb` and `OLC/Other/Synth2/olcNoiseMaker.vb` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (9 lines × 5) · ×1
  • Duplicated block (9 lines × 5) QBasic/Nibbles/Program.vb:396 — QBasic/Nibbles/Program.vb:396-404 | QBasic/Nibbles/Program.vb:405-413 | QBasic/Nibbles/Program.vb:418-426 | QBasic/Nibbles/Program.vb:455-463 | QBasic/Nibbles/Program.vb:469-477 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `QBasic/Nibbles/Program.vb:418` calls `colorTable` and `QBasic/Nibbles/Program.vb:396` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (8 lines × 6) · ×1
  • Duplicated block (8 lines × 6) QBasic/Nibbles/Program.vb:396 — QBasic/Nibbles/Program.vb:396-403 | QBasic/Nibbles/Program.vb:405-412 | QBasic/Nibbles/Program.vb:418-425 | QBasic/Nibbles/Program.vb:431-438 | QBasic/Nibbles/Program.vb:455-462 | QBasic/Nibbles/Program.vb:469-476 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `QBasic/Nibbles/Program.vb:418` calls `colorTable` and `QBasic/Nibbles/Program.vb:396` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (8 lines × 4) · ×1
  • Duplicated block (8 lines × 4) OLC/Other/Synth1/olcNoiseMaker.vb:165 — OLC/Other/Synth1/olcNoiseMaker.vb:165-172 | OLC/Other/Synth2/olcNoiseMaker.vb:163-170 | OLC/Other/Synth3/olcNoiseMaker.vb:166-173 | OLC/Other/Synth4/olcNoiseMaker.vb:174-181 — `OLC/Other/Synth1/olcNoiseMaker.vb` and `OLC/Other/Synth2/olcNoiseMaker.vb` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 6 separate duplicated blocks between them, totalling at least 134 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `OLC/Other/Synth4/olcNoiseMaker.vb:183` calls `WriteLine` and `OLC/Other/Synth1/olcNoiseMaker.vb:173` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (7 lines × 3) · ×1
  • Duplicated block (7 lines × 3) Sound/FFMpeg/Program.vb:25 — Sound/FFMpeg/Program.vb:25-43 | Sound/FFMpeg/Program.vb:45-51 | Sound/FFMpeg/Program.vb:53-59 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (4–6 lines × 3) · ×1
  • Duplicated block (4–6 lines × 3) QB64/Qb64SamplesToMarkdown/Program.vb:154 — QB64/Qb64SamplesToMarkdown/Program.vb:154-159 | QB64/Qb64SamplesToMarkdown/Program.vb:160-165 | QB64/Qb64SamplesToMarkdown/Program.vb:166-169 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. 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 · Duplicated block (5 lines × 4) · ×1
  • Duplicated block (5 lines × 4) QBasic/Nibbles/Program.vb:405 — QBasic/Nibbles/Program.vb:405-409 | QBasic/Nibbles/Program.vb:455-459 | QBasic/Nibbles/Program.vb:469-473 | QBasic/Nibbles/Program.vb:492-496 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (4–5 lines × 3) · ×1
  • Duplicated block (4–5 lines × 3) QBasic/Gorilla/Form1.vb:511 — QBasic/Gorilla/Form1.vb:511-514 | QBasic/Gorilla/Form1.vb:515-519 | QBasic/Gorilla/Form1.vb:520-524 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `QBasic/Gorilla/Form1.vb:511` 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.
D44 · Platform End-of-Life · End-of-life runtime · ×1
  • End-of-life runtime: .NET net7.0 UacPrompt/UacPrompt.vbproj:5 — UacPrompt/UacPrompt.vbproj declares .NET net7.0 as this project's target framework, and .NET 7, support ended 2024-05-14. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2024-05-14 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
SC1 · Supply-chain hygiene · NuGet dependencies are not locked · ×1
  • NuGet dependencies are not locked — No packages.lock.json and no central package management — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.
Minor — 150 finding(s)
D34 · Knowledge Freshness · Orphaned file · ×92
  • Orphaned file SoundBeepPlay/Player3.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file QB64/MarkdownHelp/Program.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file FormExGenerator/FormExGenerator.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file QBasic/Nibbles/Program.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file TinyBASIC/Program.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file SourceGenerators/ImplicitInterfaceGenerator/ImplicitInterfaceGenerator.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file OLC/Other/Synth4/Program.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file QB64/ParseWiki/Program.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file QB64/Qb64SamplesToMarkdown/Program.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file SoundBeepPlay/SoundGenerator.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file Sound/WaveOut/Program.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file GUI/SDL2_Gameloop/Program.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file QBasic/Nibbles/Music.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file QBasic/Gorilla/Music.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file SourceGenerators/SourceGeneratorSamples/ImplicitInterfaceGenerator.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file GUI/WinForms_GameLoop/Screen.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file WinFormsApp1/Community.Windows.FormsEx/ScrollBar.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/ScrollBar.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file Serial/PC-To-Centurion/Program.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file GUI/X11/X11Backend.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file OLC/Other/Synth3/Program.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file QBasic/RemLine/RawConversion.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file OLC/Other/Synth4/olcNoiseMaker.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file QBasic/RemLine/Program.vb:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • + 67 more in this group — see findings.md.
D24 · Comment Value · redundant comment · ×34
  • redundant comment FileSystemWatcherSample/Program.vb:20 — "Create a new FileSystemWatcher and set its properties." repeats the code it sits on: 6 of its 7 words (create, new, file, system, watcher, set) are already in `Using watcher As New FileSystemWatcher()`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment FormExGenerator/FormExGenerator.vb:38 — "add the attribute text" repeats the code it sits on: 3 of its 3 words (add, attribute, text) are already in `context.AddSource("RecordAttribute", SourceText.From(ATTRIBUTE_TEXT, Encoding.UTF8))`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment FormExGenerator/FormExGenerator.vb:646 — "UpdateEnabledState" repeats the code it sits on: 3 of its 3 words (update, enabled, state) are already in `If Not MethodExists(receiver, className, "UpdateEnabledState", New List(Of String), "Void") Then`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment GUI/FNA_Gameloop/Program.vb:58 — "... then load a texture from ./Content/FNATexture.png" repeats the code it sits on: 4 of its 5 words (load, texture, content, fna) are already in `m_texture = Content.Load(Of Texture2D)("FNATexture")`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment GUI/WinForms_GameLoop/Form1.vb:66 — "Create drawing rectangle... m_rectangle.Width = PictureBox1.Width m_rectangle.Height = PictureBox1.Height" repeats the code it sits on: 6 of its 7 words (create, rectangle, width, picture, box, height) are already in `mybuff = m_context.Allocate(PictureBox1.CreateGraphics, New Rectangle(0, 0, PictureBox1.Width, PictureBox1.Height)) 'm_r …`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment GUI/X11/X11Backend.vb:338 — "Copy DestPixmap to window" repeats the code it sits on: 4 of its 4 words (copy, dest, pixmap, window) are already in `XCopyArea(Display, DestPixmap, Window, GC, 0, 0, DisplayWidth, DisplayHeight, 0, 0)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment GameLoop2/Form1.vb:18 — "This call is required by the designer." is Visual Studio form constructor template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment GameLoop2/Form1.vb:21 — "Add any initialization after the InitializeComponent() call." is Visual Studio form constructor template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment Json101/Program.vb:45 — "Read the response content as JSON string" repeats the code it sits on: 5 of its 5 words (read, response, content, json, string) are already in `Dim json = response.Content.ReadAsStringAsync().Result`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment QBasic/Nibbles/Program.vb:214 — "Center: Centers text on given row" repeats the code it sits on: 4 of its 5 words (center, centers, text, row) are already in `Sub Center(ByRef row%, ByRef text$)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment QBasic/Nibbles/Program.vb:257 — "GetInputs: Gets player inputs" repeats the code it sits on: 4 of its 4 words (get, inputs, gets, player) are already in `Sub GetInputs(ByRef NumPlayers%, ByRef speed%, ByRef diff$, ByRef monitor$)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment SourceGenerators/SourceGeneratorSamples/AutoNotifyGenerator.vb:44 — "add the attribute text" repeats the code it sits on: 3 of its 3 words (add, attribute, text) are already in `context.AddSource("AutoNotifyAttribute", SourceText.From(ATTRIBUTE_TEXT, Encoding.UTF8))`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment SourceGenerators/SourceGeneratorSamples/RecordGenerator.vb:38 — "add the attribute text" repeats the code it sits on: 3 of its 3 words (add, attribute, text) are already in `context.AddSource("RecordAttribute", SourceText.From(ATTRIBUTE_TEXT, Encoding.UTF8))`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/PanelEx.vb:25 — "Required by the Windows Form Designer" is Visual Studio form constructor template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment WinFormBugs/ReparentWinForms/Community.Windows.FormsEx/PanelEx.vb:44 — "This call is required by the Windows Form Designer." is Visual Studio form constructor template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment WinFormBugs/ReparentWinForms/Form1.vb:5 — "This call is required by the designer." is Visual Studio form constructor template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment WinFormBugs/ReparentWinForms/Form1.vb:8 — "Add any initialization after the InitializeComponent() call." is Visual Studio form constructor template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment WinFormBugs/ReparentWinformsFx/Form1.vb:5 — "This call is required by the designer." is Visual Studio form constructor template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment WinFormBugs/ReparentWinformsFx/Form1.vb:8 — "Add any initialization after the InitializeComponent() call." is Visual Studio form constructor template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment WinFormBugs/ReparentWinformsFx/My Project/AssemblyInfo.vb:5 — "General Information about an assembly is controlled through the following set of attributes. Change these attribute values to modify the information associated …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment WinFormBugs/ReparentWinformsFx/My Project/AssemblyInfo.vb:9 — "Review the values of the assembly attributes" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment WinFormBugs/ReparentWinformsFx/My Project/AssemblyInfo.vb:20 — "The following GUID is for the ID of the typelib if this project is exposed to COM" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment WinFormBugs/ReparentWinformsFx/My Project/AssemblyInfo.vb:23 — "Version information for an assembly consists of the following four values: Major Version Minor Version Build Number Revision You can specify all the values or y …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment WinForms/BrowserFx/My Project/AssemblyInfo.vb:5 — "General Information about an assembly is controlled through the following set of attributes. Change these attribute values to modify the information associated …" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment WinForms/BrowserFx/My Project/AssemblyInfo.vb:9 — "Review the values of the assembly attributes" is Visual Studio AssemblyInfo template text, left in place. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • + 9 more in this group — see findings.md.
D18 · Solution Shape · Thin analysable surface across projects · ×8
  • Thin analysable surface across projects: InsaneSourceGeneration InsaneSourceGeneration/InsaneSourceGeneration.vbproj — 8 project(s) carry only a thin slice of real code; `InsaneSourceGeneration` has 11 significant line(s). The mean analysable-surface weight is 86 %; this project lowers Solution Shape by about 0.11 point(s). Consolidate it or grow it into a substantial, well-scoped assembly.
  • Thin analysable surface across projects: QSortModern QSortModern/QSortModern.vbproj — 8 project(s) carry only a thin slice of real code; `QSortModern` has 16 significant line(s). The mean analysable-surface weight is 86 %; this project lowers Solution Shape by about 0.1 point(s). Consolidate it or grow it into a substantial, well-scoped assembly.
  • Thin analysable surface across projects: TestNuGetPackages TestNuGetPackages/TestNuGetPackages.vbproj — 8 project(s) carry only a thin slice of real code; `TestNuGetPackages` has 20 significant line(s). The mean analysable-surface weight is 86 %; this project lowers Solution Shape by about 0.08 point(s). Consolidate it or grow it into a substantial, well-scoped assembly.
  • Thin analysable surface across projects: ReparentWinformsFx WinFormBugs/ReparentWinformsFx/ReparentWinformsFx.vbproj — 8 project(s) carry only a thin slice of real code; `ReparentWinformsFx` has 25 significant line(s). The mean analysable-surface weight is 86 %; this project lowers Solution Shape by about 0.07 point(s). Consolidate it or grow it into a substantial, well-scoped assembly.
  • Thin analysable surface across projects: Webcam WinForms/Webcam/Webcam.vbproj — 8 project(s) carry only a thin slice of real code; `Webcam` has 32 significant line(s). The mean analysable-surface weight is 86 %; this project lowers Solution Shape by about 0.05 point(s). Consolidate it or grow it into a substantial, well-scoped assembly.
  • Thin analysable surface across projects: EmbeddingLua_Part1 OLC/Other/EmbeddingLua_Part1/EmbeddingLua_Part1.vbproj — 8 project(s) carry only a thin slice of real code; `EmbeddingLua_Part1` has 35 significant line(s). The mean analysable-surface weight is 86 %; this project lowers Solution Shape by about 0.04 point(s). Consolidate it or grow it into a substantial, well-scoped assembly.
  • Thin analysable surface across projects: FFMpeg Sound/FFMpeg/FFMpeg.vbproj — 8 project(s) carry only a thin slice of real code; `FFMpeg` has 45 significant line(s). The mean analysable-surface weight is 86 %; this project lowers Solution Shape by about 0.01 point(s). Consolidate it or grow it into a substantial, well-scoped assembly.
  • Thin analysable surface across projects: FileSystemWatcherSample FileSystemWatcherSample/FileSystemWatcherSample.vbproj — 8 project(s) carry only a thin slice of real code; `FileSystemWatcherSample` has 47 significant line(s). The mean analysable-surface weight is 86 %; this project lowers Solution Shape by about 0.01 point(s). Consolidate it or grow it into a substantial, well-scoped assembly.
D18 · Solution Shape · Shell project · ×6
  • Shell project: WinFormsApp_dotNet6 WinFormsApp_dotNet6/WinFormsApp_dotNet6.vbproj — `WinFormsApp_dotNet6` contributes only 7 significant line(s) — an empty/placeholder project is structural noise. Remove it or fold its contents into a real project.
  • Shell project: Silk_Gameloop GUI/Silk_Gameloop/Silk_Gameloop.vbproj — `Silk_Gameloop` contributes only 6 significant line(s) — an empty/placeholder project is structural noise. Remove it or fold its contents into a real project.
  • Shell project: ParseWiki QB64/ParseWiki/ParseWiki.vbproj — `ParseWiki` contributes only 7 significant line(s) — an empty/placeholder project is structural noise. Remove it or fold its contents into a real project.
  • Shell project: Raylib_Gameloop GUI/Raylib_Gameloop/Raylib_Gameloop.vbproj — `Raylib_Gameloop` contributes only 6 significant line(s) — an empty/placeholder project is structural noise. Remove it or fold its contents into a real project.
  • Shell project: Libsoundio_Sample Sound/Libsoundio_Sample/Libsoundio_Sample.vbproj — `Libsoundio_Sample` contributes only 6 significant line(s) — an empty/placeholder project is structural noise. Remove it or fold its contents into a real project.
  • Shell project: OpenTk_Gameloop GUI/OpenTk_Gameloop/OpenTk_Gameloop.vbproj — `OpenTk_Gameloop` contributes only 6 significant line(s) — an empty/placeholder project is structural noise. Remove it or fold its contents into a real project.
D34 · Knowledge Freshness · Most significant orphaned file · ×3
  • Most significant orphaned file QB64/TxtToWiki/Program.vb:1 — One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
  • Most significant orphaned file SourceGenerators/TestConsoleApp/Program.vb:1 — One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
  • Most significant orphaned file QBasic/Gorilla/Form1.vb:1 — One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
D19 · Documentation Quality · Documentation · ×1
  • Documentation: no build, run or usage example README.md:1 — the repository holds project manifests and neither `README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
D34 · Knowledge Freshness · Dormant codebase · ×1
  • Dormant codebase — 95 of 95 significant files have no living knowledge — the codebase as a whole is dormant, not 95 separate risks. Counted over 95 of the 177 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. Re-engage owners or document before change.
D8 · Code Coverage · No tests · ×1
  • No tests — template/sample — This repo declares itself a template / kata / sample; tests are deferred to the application built from it, so coverage is not scored here.
M3 · Folder & project structure · No src/ separation · ×1
  • No src/ separation — Most of the production code is in directories of its own, but 1 application file(s) sit at the repository root beside the build and tooling files (`SyntaxTree.vb`).
P10 · Library API & versioning · No explicit versioning · ×1
  • No explicit versioning — No explicit version was found by any of the six routes this check reads: a `<Version>` or `<VersionPrefix>` property; a `GitVersion` or `MinVer` reference; the split Arcade spelling (`<MajorVersion>` AND `<MinorVersion>` together); a hand-written `[assembly: AssemblyVersion]` in source, with `bin/` and `obj/` excluded so the SDK's generated AssemblyInfo cannot satisfy it; or a version handed to MSBuild by the pipeline, as `-p:Version=` / `-p:PackageVersion=` on a `dotnet build` or `dotnet pack` line. Only project files, first-party source and CI files are read, so a version computed somewhere none of those can see is invisible here. A published library needs explicit semantic versioning so consumers can reason about breaking changes.
P6 · Release Hygiene · No changelog · ×1
  • 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.)
X5 · Nullable reference types · Nullable reference types not enabled everywhere · ×1
  • Nullable reference types not enabled everywhere — 0/1 NRT-eligible project(s) enable <Nullable>enable</Nullable> (projects targeting a pre-C#-8 framework are excluded — NRTs aren't available there). NRTs catch a whole class of null-deref bugs at compile time.
Minor — 2 finding(s)
D24 · Comment Value · doc comments repeat the names · ×2
  • doc comments repeat the names SoundBeepPlay/SoundGenerator.vb:491 — 0 of 4 documented parameters and 0 of 7 summaries in `SoundBeepPlay` only repeat the member or parameter name (e.g. "" for `byteArray`). 4 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names WinFormsApp1/Community.Windows.FormsEx/ScrollBarExPanel.vb:68 — 0 of 8 documented parameters and 0 of 7 summaries in `WinFormsApp1` only repeat the member or parameter name (e.g. "" for `ctl`). 8 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.

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.

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-f88e12c380a24562823780154d0dbfd7/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-f88e12c380a24562823780154d0dbfd7/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .gitignore Audio BasicComputerGames ClassLibrary1 ClearScript CompareFolders CompilerApiBook ConsoleApp1 FileSystemWatcherSample FormExGenerator GUI GameLoop1 GameLoop2 InsaneSourceGeneration Json101 LICENSE OLC PLAYground QB64 QBasic QSortModern README.md Samples.sln ScanMkDn Serial SerialTesting SortTest Sound SoundBeepPlay SourceGenerators SyntaxTree.vb TestFormsApp TestNuGetPackages TinyBASIC Transpiler Tui Twitter UacPrompt WinFormBugs WinForms WinFormsApp1 WinFormsApp_dotNet60artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesnuget—nuget: not applicable — nuget: the solution did not restore on the analyzer's .NET SDK (an SDK/target-framework/restore mismatch, common for an older codebase), so there was no restored dependency graph to scan0—
D30 · Dependency Vulnerabilitiesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm . /tmp/codehealth-osv-sbom-ceeef56480464e9cb832d4ffd947dbaf0artifacts/raw/osv-scanner.json
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep --config /opt/semgrep-rules/gdpr.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .gitignore Audio BasicComputerGames ClassLibrary1 ClearScript CompareFolders CompilerApiBook ConsoleApp1 FileSystemWatcherSample FormExGenerator GUI GameLoop1 GameLoop2 InsaneSourceGeneration Json101 LICENSE OLC PLAYground QB64 QBasic QSortModern README.md Samples.sln ScanMkDn Serial SerialTesting SortTest Sound SoundBeepPlay SourceGenerators SyntaxTree.vb TestFormsApp TestNuGetPackages TinyBASIC Transpiler Tui Twitter UacPrompt WinFormBugs WinForms WinFormsApp1 WinFormsApp_dotNet61artifacts/raw/semgrep-gdpr.json
D36 · Supply-chain Provenance & Signingprovenance—provenance: not applicable — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.0—
D37 · Vulnerability-disclosure Policydisclosure—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.0—
D40 · Network Egress Confinementruntime-hardening—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.0—
D41 · Kernel & Syscall Confinementruntime-hardening—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.0—
D42 · Runtime Threat Enforcementruntime-hardening—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.0—
D43 · Malicious Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm . /tmp/codehealth-osv-sbom-ceeef56480464e9cb832d4ffd947dbaf0artifacts/raw/osv-scanner.json

Run 01a1dd22-f1e6-7308-8007-e1692ffeca1b · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

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.

⬇ Findings, MITRE CWE-tagged .sarif⬇ Health changelog .md