Public report — qbasic, published 1 Oct 2026.
Concrete security findings (which rule fired, in which file, on which line; CVE IDs, secret matches,
dependency versions) are REDACTED in this version; ask the repo owner for the full report.
Public
Codebase surveyMeasured under the Code Assurance Index · rubric rubric-2026.09.18 (frozen) · verify this surveyFiledcd_2c5a4be2d5b543cc8845f435e4a638ac
Filed 1 October 2026, 15:07 UTC
Public
Medium · 84,754 LoC · 5 projects · rebuild ~0.6 person-years · weakest lens: Readiness (33%)
Findings by grade
11 critical893 serious11 minor41 could not be resolved — could be critical — see Limitations
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
1 October 2026, 15:06 UTC
A measurement, not a certificate. The Code Assurance Index does not certify,
approve or guarantee this codebase; it records a reproducible number and the evidence it was computed from. The
standard is authored by Canine Development, who also build Watchdog — its only implementation today. That is said
here so the number is checked rather than believed.
Grounded in facts. Every number here is computed, not narrated — reproducible, tool-backed, and traceable to a line of code. How to trust this ▸
903findings with an exact file:lineof 915 — the remainder are repo-wide signals (a dimension-level measurement, not a single line); open any file:line and verify
36/119dimensions across the health lenses84754 LoC · 5 projects — wide & deep
This system is a medium-sized asset with a fragile operational foundation, scoring 49% overall. While the underlying architecture is robust and secure, the low readiness score signals significant risk to delivery speed and reliability. The business value tied up here is substantial, requiring roughly 0.6 person-years to rebuild, yet the current state imposes a hidden tax on every change, slowing the team by an estimated 6–13% due to code complexity and lack of automation.
The primary risk lies in operational readiness. With a score of 33%, the system lacks the safety nets needed for confident deployment. This gap means changes are slower, defects are more likely to slip through, and outages are harder to prevent. The cost of inaction is high: the annual drag on productivity from this technical debt could consume dozens of engineer-days each year, effectively paying a premium for every feature shipped. Addressing this is not just a technical fix but a direct investment in velocity and stability.
A secondary concern is the lack of institutional memory and maturity. At 41%, the system is difficult for new team members to navigate, and decisions are not formally recorded. This creates a knowledge silo where critical context is lost, increasing the risk of repeated mistakes and slowing onboarding. Without clear documentation of significant design choices, the team relies on tribal knowledge, which is fragile and unscalable.
However, the system is not without strengths. The architecture is sound, scoring 94%, meaning the core structure is resilient and changes do not ripple uncontrollably. Security is also strong at 100%, indicating no immediate exposure to common vulnerabilities. These foundations provide a stable base upon which to build improvements.
The highest-leverage action is to implement a continuous integration workflow that builds and runs tests on every change. This single step breaks even in roughly one to two months by reducing the annual productivity drag. It is the critical first step to stabilizing the system, enabling faster feedback, and reducing the cost of future changes. Until this is in place, other improvements will yield diminishing returns.
How the score is built — each lens's share of the headlineWidth is the lens's weight in the worst-heaviest fold (the weakest area pulls hardest); colour is that lens's own band. A lens fixes the score in proportion to its width.
0.7× (at 49% quality) — the last 20% of quality is most of the work
Size & shape
Medium · effort split not classified (source measured from disk; the effort-tier breakdown is a C#-only syntax walk)
This codebase represents roughly ~0.6 person-years of build effort (about ~€93,000 to rebuild). Its weakest lens is Readiness at 33% — the part of that asset most exposed by the findings below.
How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.1) — desktop/game × a 0.7× quality factor, at €60–95/h; indicative, ±~30% · effort from total production LoC as straight-line logic (the tier split is a C#-only syntax walk), a conservative lower bound. Indicative only — most sensitive to the hourly rate and the domain tier (both tunable in config).
Top priorities
The highest-leverage moves; the full ranked list is in the Roadmap below.
1
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Value concentrated against a weak lens · High · Value at risk
This is a Medium asset (~0.6 person-years to rebuild), and its weakest lens is Readiness at 33%. The operational and business risk on an asset this size concentrates there — that's where remediation buys the most protection.
→ Direct remediation budget at Readiness first — highest risk-reduction per euro on an asset this size.
The top fix pays for itself · High · Economics
The top-ranked fix costs roughly 1–3 engineer-days once. Not doing it costs about 33.2–199 engineer-days every year, paid as drag on the ~235,522 lines this team changes annually — a bill that arrives whether or not anyone books it. On those figures the fix breaks even in roughly 1–2 months and is free after that. Method, stated so this is not read as a quotation: debt from the ranked task's effort band; interest = annual changed lines (measured, annualised from the 90-day window) ÷ an ASSUMED 150–400 lines per engineer-day × the 6–13% drag implied by the code-quality signals; breaking point = debt ÷ annual interest. A modelled planning range built from measured inputs and one named assumption — not a quotation, a valuation, or a certified figure.
Evidence: D15 churn: 58,074 line(s) changed over a 90-day window ⇒ ~235,522/year · D1/D2/D4/D6 code quality: averaging 5.7/10 ⇒ a 6–13% drag on each change · top-ranked remediation: Low effort ⇒ about 1–3 engineer-day(s)
→ Do the top-ranked fix now if this code will still be yours in 2 months.
Highest-leverage move · Medium · Leverage
Of everything flagged, the best return on effort is: Add a CI workflow that builds and runs the test suite on every push/PR. The rest can wait behind it.
Evidence: priority ranking: top of 5 ranked by impact/effort
→ Add a CI workflow that builds and runs the test suite on every push/PR.
A velocity tax on every change · Medium · Economics
The code-quality signals (complexity, duplication, cohesion) average 5.7/10, which acts as a tax on every change in the weaker areas: modifications there plausibly cost on the order of 6–13% more than in clean code, and the tax compounds as the codebase grows. (A modelled estimate, not a measured fact.)
Evidence: D1/D2/D4/D6 code quality: averaging 5.7/10 across the code-quality signals actually measured
→ Pay it down where churn is highest — the hotspots — not everywhere; that's where the tax is actually paid.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.
Architecture — module dependency matrix
Rows and columns are the same modules, ordered so that a module only depends on ones above it. A cell means the row depends on the column, and its number is how many type pairs create that dependency. Read one thing: is anything above the diagonal? A mark there is a dependency cycle. (A cycle is all this shows — an unusual but cycle-free dependency sits below the diagonal like any other.)
35 modules, 37 dependencies. 1 dependency cycle across 5 modules, marked above the diagonal.
Module dependency matrix. The row depends on the column; the number is how many type pairs create the dependency. A cell above the diagonal is part of a dependency cycle.
QB.CodeAnalysis.Binding uses QB.CodeAnalysis.Text. Changing QB.CodeAnalysis.Text can break QB.CodeAnalysis.Binding, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
30→25 QB.CodeAnalysis.Binding depends on QB.CodeAnalysis.Syntax✕
Type pairs
338 distinct (type in QB.CodeAnalysis.Binding → type in QB.CodeAnalysis.Syntax) references. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
QB.CodeAnalysis.Binding uses QB.CodeAnalysis.Syntax. Changing QB.CodeAnalysis.Syntax can break QB.CodeAnalysis.Binding, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
30→27 QB.CodeAnalysis.Binding depends on QB.CodeAnalysis.Symbols✕
Type pairs
42 distinct (type in QB.CodeAnalysis.Binding → type in QB.CodeAnalysis.Symbols) references. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
QB.CodeAnalysis.Emit uses QB.CodeAnalysis.Symbols. Changing QB.CodeAnalysis.Symbols can break QB.CodeAnalysis.Emit, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
31→30 QB.CodeAnalysis.Emit depends on QB.CodeAnalysis.Binding✕
Type pairs
59 distinct (type in QB.CodeAnalysis.Emit → type in QB.CodeAnalysis.Binding) references. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
QB.CodeAnalysis uses QB.CodeAnalysis.Symbols. Changing QB.CodeAnalysis.Symbols can break QB.CodeAnalysis, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
33→30 QB.CodeAnalysis depends on QB.CodeAnalysis.Binding✕
Type pairs
79 distinct (type in QB.CodeAnalysis → type in QB.CodeAnalysis.Binding) references. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
Establish a CI workflow to automatically build and test every change, while maintaining a changelog to track release history. Address the most complex and frequently changed code areas, starting with Evaluator.vb, Program.vb, and Binder.vb, to reduce technical debt. Document key architectural decisions in a dedicated folder and update the README with a quick-start guide to help new contributors get started.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree, with each file named `NNNN-title` in whatever markup those docs already use, is the most discoverable form).
Reconcile the README with reality: README claims QBASIC is native to Windows/Linux and possibly other platforms but there are NO projects targeting Linux or cross-platform.
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 — 11
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 — 893
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 — 11
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 41
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 33 of 36 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 3 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.8 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 36 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 903 of 915 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability NOT MEASURED: the 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.
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 328 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.
D18 Solution Shape — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The build did not finish within its budget on this run; structural metrics are reported, build/warning status is unknown.
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 — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. At 84754 LoC spread over 5 projects this is a large multi-module system that clearly needs explicit bounded contexts. 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"]`.
D39 IL Efficiency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. IL NOT MEASURED: the analyzer's own build of this repository failed for an ENVIRONMENT reason (exit 1) — MSBuild's engine or the CLR gave up, or our image does not carry the SDK band/targeting pack this repository needs. This is OUR limitation, not a defect in the repo, and it is not a statement that this repository fails to build. D18 owns the question of whether this repository builds; it was not answered here.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
P2 Observability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Observability was not assessed: this check recognises the logging, tracing/metrics and health-check idioms of .NET, the JVM, Go, Python, JavaScript/TypeScript, Rust, Ruby, PHP, Swift, Dart, Elixir and Erlang, and most of this repository's production source is in none of them. Absence of an idiom this check recognises is NOT evidence that this repo lacks structured logging. This is a gap in the analyzer, not a finding about this repository.
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.
PF2 Allocation hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Those languages have allocation-aware idioms of their own, but this check does not read them yet. That is a gap in this analyzer's language reach — not a finding that the code is careless with allocations.
PF3 Async & latency hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. No function of a language this check models was read, so there was no async code to examine. That is a limit of the analyzer on this repository, not a finding about it.
S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X1 Async correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X10 Duplicated predicate — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X12 Unreachable branch — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X13 Undrained process stream — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X14 Bypassable address classification — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X15 Unvalidated length from an untrusted reader — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X16 Unfloored truncation loop — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X17 Uncapped recursion over a caller-supplied document — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X19 Unrestored process-global state — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X2 Cancellation propagation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X20 Mistyped argument guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X21 Side-effecting pattern guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X22 Contradicted release guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X23 Unguarded diagnostic materialisation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X24 Document value interpolated into markup unescaped — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X25 Inert configuration knob — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X26 Unsynchronised callback handoff — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X27 Collection changed while being enumerated — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X28 Index access outside its own emptiness guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X29 Per-element action decided by a fixed element — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X3 Exception handling — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X30 Support guard that admits what it rejects — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X32 Type resolved by simple name across every loaded assembly — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X4 Structured logging — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X6 Hand-rolled structured-format parsing — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and Python, JavaScript/TypeScript, Go, Java/Kotlin/Scala, Ruby, PHP and Rust source only, and no C# was loaded and none of those languages was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X7 Silent fallback defaults — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C#, Python, TypeScript/JavaScript, Rust, Go, Java and Kotlin syntax only, and no C#, Python, TypeScript/JavaScript, Rust, Go, Java or Kotlin was loaded for this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 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 is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
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").
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.
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: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
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.
The LLM boundary
LLM-set scores this run (3): D19, D21, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
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.
166 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was QBasic.OnUserUpdate at 379. A further 23 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 195 — they are counted neither in the figure above nor in this dimension's score. 9 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: src/qbasic/QB/CodeAnalysis/Syntax/SyntaxFacts.vb (SyntaxFacts.GetText at 195), src/qbasic.compatibility/Core.vb (Core.QBAsc at 164), src/qbasic/QBLib/Core.vb (Core.QBChr at 163), src/qbasic/Basic/Input/KeyEventArgs.vb (KeyEventArgs.ToKeyScanCode at 105), src/qbasic/QB/CodeAnalysis/Common.vb (Common.GetErrorMessage at 53), and 4 more not listed here. They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 159 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 Video.InputAsync (cyclomatic 24) finding(s) in Cyclomatic Complexity — start with Video.vb (2). — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 Evaluator.Assign (cyclomatic 20) finding(s) in Cyclomatic Complexity — start with Evaluator.vb (2). — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 QBasic.OnUserUpdate (cyclomatic 379) finding(s) in Cyclomatic Complexity — start with Program.vb. — One of this dimension's main actionable groups (1 warning-level).
Stand up a CI pipeline, then gate Cyclomatic Complexity in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 267 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 QBasic.OnUserUpdate (cognitive 931) finding(s) in Cognitive Complexity — start with Program.vb. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Interactive.ExecutePrimary (cognitive 662) finding(s) in Cognitive Complexity — start with Interactive.vb. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Interactive.ProcessKeyInternal (cognitive 524) finding(s) in Cognitive Complexity — start with Interactive.vb. — One of this dimension's main actionable groups (1 warning-level).
Stand up a CI pipeline, then gate Cognitive Complexity in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.2 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 62 MethodTooLong finding(s) in God Classes — start with Interactive.vb (21), Display.vb (6), Evaluator.vb (5). — One of this dimension's main actionable groups (62 warning-level).
Resolve the 18 TooManyMethods finding(s) in God Classes — start with Video.vb (2), Interactive.vb, Parser.vb. — One of this dimension's main actionable groups (18 warning-level).
Resolve the 17 FileTooLong finding(s) in God Classes — start with Parser.vb (2), Video.vb (2), Interactive.vb. — One of this dimension's main actionable groups (17 warning-level).
Stand up a CI pipeline, then gate God Classes in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
176 duplicated block group(s) detected. A further 10 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.
+ 95 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 8 Duplicated block (12 lines × 2) finding(s) in Code Duplication — start with Interactive.vb (3), Form.vb, DocumentPanel.vb. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 8 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with Video.vb (2), Display.vb, Interactive.vb. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 7 Duplicated block (16 lines × 2) finding(s) in Code Duplication — start with Interactive.vb (3), AboutDialog.vb, Devices.vb. — One of this dimension's main actionable groups (7 warning-level).
Stand up a CI pipeline, then gate Code Duplication in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling8.4 / 10Strong✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
Resolve the 1 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Stand up a CI pipeline, then gate Coupling in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
What it measures: Whether dependencies are current, secure, and not bloated.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 108 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 5 direct `PackageReference`(s), and 103 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.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Resolve the 16 Hotspot finding(s) in Churn × Complexity Hotspots — start with Evaluator.vb, Program.vb, Binder.vb. — One of this dimension's main actionable groups (16 warning-level).
Resolve the 1 Repeated repair finding(s) in Churn × Complexity Hotspots — start with Lowerer.vb. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
Resolve the 11 EmptyCatchBlock finding(s) in Explicit Debt — start with LinuxAudio.vb (4), Evaluator.vb (3), Program.vb. — One of this dimension's main actionable groups (11 issue-level).
Resolve the 139 TodoComment finding(s) in Explicit Debt — start with Parser.vb (37), Interactive.vb (21), Evaluator.vb (11). — One of this dimension's main actionable groups (139 warning-level).
Resolve the 1 HackComment finding(s) in Explicit Debt — start with Extensions.vb. — One of this dimension's main actionable groups (1 warning-level).
Stand up a CI pipeline, then gate Explicit Debt in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the 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.
5 projects, 493 source files, 95490 hand-written lines of code (84754 production / 10736 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 185 generated (machine-written code — designer, scaffolded and tool-emitted files — excluded from quality), 2 inter-project edges (build status unknown — did not finish).
Solution references a project that does not existsrc/QBasic.sln
What to do
Resolve the 1 Solution references a project that does not exist finding(s) in Solution Shape — start with QBasic.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.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
The repository's root README describes QBASIC as a project aiming to create a native QBasic replacement for Windows/Linux with an outlined roadmap, Discord/community contact, and a link to the vbPixelGameEngine. The documentation/README.md is a focused README documenting the documentation directory itself (a clone of QBasic), covering the language reference, character set, and line format in detail; it also lists the full outline of architecture/design docs that exist but are clipped mid-sentence. Both documents serve their purposes well.
Documentation: no architecture or design documentationdocumentation/README.md
What to do
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.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
1 of 5 projects flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: 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.
Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.
52 % of calls cross a namespace and 0 % go through an interface, but 99 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: large — vertical-slice locality expected.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 130 of the 472 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 5 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.
Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.
Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').
Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. Deterministic, type-level.
`IDirect` declares 30 members: `Screen`, `VisualPage`, `ScreenWidth`, `ScreenHeight`, `Pcopy`, `Point`, `ActivePage`, `Circle`, `Line`, `Pset`, `Pset`, `Preset`, `Preset`, `ScreenMode`, `IsKeyOn`, `Screen`, `ViewPrint`, `ViewPrint`, `KeyOn`, `Cls`, `CsrLin`, `Pos`, `Locate`, `Color`, `Color`, `Color`, `SetPalette`, `SetPalette`, `WriteCharacter`, `View`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. Those 30 declarations carry 23 distinct name(s), so part of the width is overloading rather than separate responsibilities — but 23 operations clears the >15 bar on its own, so the row is about responsibilities, not signatures. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/qbasic/Basic/Display/IDirect.vb:16
`IVirtualFileSystem` declares 17 members: `ChDir`, `Files`, `Kill`, `Load`, `MkDir`, `Name`, `RmDir`, `Save`, `Open`, `Read`, `Input`, `Write`, `Lock`, `Unlock`, `Close`, `InitialPath`, `IsEightDotThree`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/qbasic/Basic/IO/IVirtualFileSystem.vb:3
What to do
Split fat interfaces into focused role-interfaces so clients depend only on what they use.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
Add a 'Testing' section to the root README — how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 5 of 5 project(s) that lack one — worth up to 2 pts.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
What to do
Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree, with each file named `NNNN-title` in whatever markup those docs already use, is the most discoverable form).
Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Only 2/5 projects share a common root namespace — the code's module identity is inconsistent.
What to do
Adopt a consistent root-namespace convention (a shared prefix, e.g. Acme.*); short project-file/directory names are fine as long as the RootNamespace is uniform.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
README claims QBASIC is native to Windows/Linux and possibly other platforms but there are NO projects targeting Linux or cross-platform — reported by the model that read the README against this repository; no term search was run for this one, so nothing here has been checked against the tree. Treat it as a reading to confirm, not as a measured contradiction: verify it against the code before acting on it, and if the footprint it describes does exist, this row is wrong.
What to do
Reconcile the README with reality: README claims QBASIC is native to Windows/Linux and possibly other platforms but there are NO projects targeting Linux or cross-platform.
Do you agree with this assessment?
P1 · CI/CD gates0.0 / 10Critical✓ Tool-verified
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, …) — changes aren't gated by an automated build/test.
What to do
Add a CI workflow that builds and runs the test suite on every push/PR.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
No static application security testing detected. For this repository's stack, add a Roslyn security analyzer package referenced from the project (the analyzer packages do analyse VB.NET), plus gitleaks for committed secrets — CodeQL has no VB.NET extractor, so its csharp pack would extract nothing from this tree and then report it clean — this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
What to do
Run what this repository's stack ships: a Roslyn security analyzer package referenced from the project (the analyzer packages do analyse VB.NET), plus gitleaks for committed secrets — CodeQL has no VB.NET extractor, so its csharp pack would extract nothing from this tree and then report it clean — locally for now, since there is no CI pipeline here yet, and as a step of the first workflow you add so a security regression fails the build instead of landing.
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are 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.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 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 — 5 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.
C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
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 — 77 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.
AC7 A11y enforcement — 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
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
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.
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D10 Test Quality — ~10727 lines of test source are present (.vb) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — Test reliability not measured — no test run produced results
D16 Bus Factor — single-contributor repository — bus factor is not applicable
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.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D30 Dependency Vulnerabilities — 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
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
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.
D39 IL Efficiency — IL not measured — the analyzer's build of the target did not succeed
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.
D43 Malicious Dependencies — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
D7 Architectural Integrity — no checkable ADRs and no dependency cycles — architectural integrity not assessed
D8 Code Coverage — Coverage NOT MEASURED: `--collect:"XPlat Code Coverage"` names a data collector that ships in the `coverlet.collector` package, and this repository wires up none — no test project references it and no runsettings declares one. The absence of coverage here is therefore not evidence about the suite or about our analyzer environment: without a collector, `--collect` produces nothing even from a suite that builds and passes. Add a `coverlet.collector` PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect.
D9 Test Distribution — Test source is present (.vb) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so its unit/integration/BDD/E2E split couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
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 — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — no CI workflow found
P2 Observability — Observability was not assessed: this check recognises the logging, tracing/metrics and health-check idioms of .NET, the JVM, Go, Python, JavaScript/TypeScript, Rust, Ruby, PHP, Swift, Dart, Elixir and Erlang, and most of this repository's production source is in none of them. Absence of an idiom this check recognises is NOT evidence that this repo lacks structured logging. This is a gap in the analyzer, not a finding about this repository.
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 — no coverage report found on disk — produce a coverage report in a standard format (Cobertura — `dotnet test --collect:"XPlat Code Coverage"` with a `coverlet.collector` PackageReference) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for a BenchmarkDotNet reference in an .fsproj or .vbproj, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Allocation awareness was not assessed: this repository holds Visual Basic, whose allocation-aware idioms this check does not model yet. That is a gap in the analyzer's language reach, not a finding about your code.
PF3 Async & latency hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
X1 Async correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X10 Duplicated predicate — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X12 Unreachable branch — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X13 Undrained process stream — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X14 Bypassable address classification — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X15 Unvalidated length from an untrusted reader — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X16 Unfloored truncation loop — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X17 Uncapped recursion over a caller-supplied document — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X18 Disposal-pattern correctness — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X19 Unrestored process-global state — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X20 Mistyped argument guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X21 Side-effecting pattern guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X22 Contradicted release guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X23 Unguarded diagnostic materialisation — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X24 Document value interpolated into markup unescaped — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X25 Inert configuration knob — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X26 Unsynchronised callback handoff — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X27 Collection changed while being enumerated — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X28 Index access outside its own emptiness guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X29 Per-element action decided by a fixed element — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X30 Support guard that admits what it rejects — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X32 Type resolved by simple name across every loaded assembly — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X6 Hand-rolled structured-format parsing — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X7 Silent fallback defaults — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
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.
EmptyCatchBlock src/qbasic/Program.vb:959— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock src/qbasic/QB/CodeAnalysis/Evaluator.vb:1311— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock src/qbasic/QB/CodeAnalysis/Evaluator.vb:1315— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock src/qbasic/QB/CodeAnalysis/Evaluator.vb:5137— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock src/qbasic/QB/CodeAnalysis/Syntax/GwBasicToQBasicRewriter.vb:84— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock src/qbasic/QBLib/Audio/LinuxAudio.vb:63— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock src/qbasic/QBLib/Audio/LinuxAudio.vb:84— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock src/qbasic/QBLib/Audio/LinuxAudio.vb:101— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock src/qbasic/QBLib/Audio/LinuxAudio.vb:191— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock src/qbasic/QBLib/Audio/WindowsAudio.vb:501— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
EmptyCatchBlock src/qbasic/QBLib/Video.vb:939— empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row.
TodoComment src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:933— ' 'TODO - davidsch - In C++ code there is a call to GreedilyParseColonSeparatedStatements. Why? — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:1076— ' 'TODO Move all of this code to ParseIdentifier — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:1188— ' 'TODO - Move the check below ExecutableStatementContext.ProcessStatement — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:1232— ' 'TODO - Remove when select is fully implemented — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:1715— ' 'TODO - Consider moving the error to the Declaration context — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:1833— ' 'TODO - Compare this method with IsDeclarationStatement. — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:1916— ' 'TODO - davidsch - The error checking here looks like parser doing semantics. The grammar allows — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:2137— ' 'TODO - For better error recovery consider adding a resync here for — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:2276— ' ' TODO - Consider improving the handling of implicit line continuations. — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:2463— ' 'TODO - davidsch - This used to call ParseInitializer which checked for DotToken before calling ParseAssignmentInitializer — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:2560— ' 'TODO - davidsch - Dev10 error is on .Name? — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:2611— ' ' TODO - In Dev 10 error is on the xmlName — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:3031— ' 'TODO - — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:3455— ' 'TODO - davidsch — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:3813— ' 'TODO - davidsch Can ParseFunctionOrDelegateDeclaration and — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:3827— ' ' TODO - davidsch - Why do ParseFunctionDeclaration and ParseSubDeclaration have — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:3907— ' 'TODO - davidsch — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:3943— ' 'TODO - davidsch - What should be created here? For now use + as a canonical operator — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:3970— ' 'TODO - davidsch - Why does operator resync here with different condition than Sub and Function? Seems like these should be consistent. — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:4226— ' ' TODO - Which keyword SUB or FUNCTION? — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:4228— ' ' TODO - Consider adding this as another case of VerifyExpectedToken — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:4486— ' ' TODO - Bug 889301 - Dev10 does a resync here when there is an error. That prevents ERRID_InvalidParameterSyntax below from — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:4555— ' 'TODO - Move these checks to Binder_Utils.DecodeParameterModifiers — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:4653— ' ' TODO - Move these errors (ERRID.ERR_DefaultValueForNonOptionalParamout, ERRID.ERR_ObsoleteOptionalWithoutValue) of the parser. — 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 src/Compilers/Qbx/CodeAnalysis/QBasic/Parser/Parser.vb:5117— ' 'todo - davidsch - if sub/function keyword is missing. Use the existence of AS to infer Function — 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.
MethodTooLong: QBasic.OnUserUpdate src/qbasic/Program.vb:1176— MethodTooLong — OnUserUpdate runs 771 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 671 over it, 7.71× 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: Evaluator.EvaluateStatement src/qbasic/QB/CodeAnalysis/Evaluator.vb:510— MethodTooLong — EvaluateStatement runs 703 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 603 over it, 7.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.
MethodTooLong: Evaluator.EvaluateCallExpression src/qbasic/QB/CodeAnalysis/Evaluator.vb:4192— MethodTooLong — EvaluateCallExpression runs 587 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 487 over it, 5.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: Interactive.ExecutePrimary src/qbasic/Basic/Interactive/Interactive.vb:3199— MethodTooLong — ExecutePrimary runs 549 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 449 over it, 5.49× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Interactive.ExecutePut src/qbasic/Basic/Interactive/Interactive.vb:13632— MethodTooLong — ExecutePut runs 360 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 260 over it, 3.60× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Parser.PeekToken src/qbasic/Basic/Parser/Parser.vb:398— MethodTooLong — PeekToken runs 342 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 242 over it, 3.42× 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: Interactive.ExecuteGet src/qbasic/Basic/Interactive/Interactive.vb:8515— MethodTooLong — ExecuteGet runs 335 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 235 over it, 3.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: Interactive.ExecuteStringPrimary src/qbasic/Basic/Interactive/Interactive.vb:2308— MethodTooLong — ExecuteStringPrimary runs 322 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 222 over it, 3.22× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Interactive.ExecutePrintUsing src/qbasic/Basic/Interactive/Interactive.vb:12698— MethodTooLong — ExecutePrintUsing runs 290 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 190 over it, 2.90× 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: Interactive.ExecutePrint src/qbasic/Basic/Interactive/Interactive.vb:12312— MethodTooLong — ExecutePrint runs 268 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 168 over it, 2.68× 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: Evaluator.EvaluateBinaryExpression src/qbasic/QB/CodeAnalysis/Evaluator.vb:3872— MethodTooLong — EvaluateBinaryExpression runs 268 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 168 over it, 2.68× 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: Display.InternalPage.InitializeVgaPalette src/qbasic/Basic/Display/Display.vb:830— MethodTooLong — InitializeVgaPalette runs 258 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 158 over it, 2.58× 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: ConstantFolding.Fold src/qbasic/QB/CodeAnalysis/Binding/ConstantFolding.vb:44— MethodTooLong — Fold runs 256 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 156 over it, 2.56× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Interactive.InteractiveProcessKey src/qbasic/Basic/Interactive/Interactive.vb:1119— MethodTooLong — InteractiveProcessKey runs 249 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 149 over it, 2.49× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Display.InternalPage.SetPalette src/qbasic/Basic/Display/Display.vb:543— MethodTooLong — SetPalette runs 243 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 143 over it, 2.43× 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: JsEmitter.Emit src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:31— MethodTooLong — Emit runs 238 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 138 over it, 2.38× 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: Interactive.ProcessKeyInternal src/qbasic/Basic/Interactive/Interactive.vb:863— MethodTooLong — ProcessKeyInternal runs 207 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 107 over it, 2.07× 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: Interactive.ExecuteDraw src/qbasic/Basic/Interactive/Interactive.vb:18064— MethodTooLong — ExecuteDraw runs 202 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 102 over it, 2.02× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SyntaxFacts.GetText src/qbasic/QB/CodeAnalysis/Syntax/SyntaxFacts.vb:287— MethodTooLong — GetText runs 200 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 100 over it, 2.00× 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: Interactive.InternalProcessText src/qbasic/Basic/Interactive/Interactive.vb:18676— MethodTooLong — InternalProcessText runs 197 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 97 over it, 1.97× 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: Evaluator.PlayCommand src/qbasic/QB/CodeAnalysis/Evaluator.vb:5804— MethodTooLong — PlayCommand runs 197 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 97 over it, 1.97× 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: Display.Screen src/qbasic/Basic/Display/Display.vb:2752— MethodTooLong — Screen runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.95× 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: Display.InternalPage.SetPalette src/qbasic/Basic/Display/Display.vb:275— MethodTooLong — SetPalette runs 193 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 93 over it, 1.93× 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: BoundBinaryOperator.Initialize src/qbasic/QB/CodeAnalysis/Binding/BoundBinaryOperator.vb:226— MethodTooLong — Initialize 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: SyntaxFacts.GetKeywordKind src/qbasic/QB/CodeAnalysis/Syntax/SyntaxFacts.vb:81— MethodTooLong — GetKeywordKind runs 180 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 80 over it, 1.80× 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.
TooManyMethods: Interactive src/qbasic/Basic/Interactive/Interactive.vb— TooManyMethods — 10675 significant lines (blank, comment-only and punctuation-only lines excluded), 212 methods. The bar is 30 methods; this is 182 over it, 7.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Parser src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb— TooManyMethods — 3172 significant lines (blank, comment-only and punctuation-only lines excluded), 178 methods. The bar is 30 methods; this is 148 over it, 5.93× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Binder src/qbasic/QB/CodeAnalysis/Binding/Binder.vb— TooManyMethods — 2637 significant lines (blank, comment-only and punctuation-only lines excluded), 154 methods. The bar is 30 methods; this is 124 over it, 5.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.
TooManyMethods: Evaluator src/qbasic/QB/CodeAnalysis/Evaluator.vb— TooManyMethods — 4820 significant lines (blank, comment-only and punctuation-only lines excluded), 136 methods. The bar is 30 methods; this is 106 over it, 4.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.
TooManyMethods: QBasic src/qbasic/Program.vb— TooManyMethods — 1868 significant lines (blank, comment-only and punctuation-only lines excluded), 79 methods. The bar is 30 methods; this is 49 over it, 2.63× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Display src/qbasic/Basic/Display/Display.vb— TooManyMethods — 3073 significant lines (blank, comment-only and punctuation-only lines excluded), 75 methods. The bar is 30 methods; this is 45 over it, 2.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.
TooManyMethods: DiagnosticBag src/qbasic/QB/CodeAnalysis/DiagnosticBag.vb— TooManyMethods — 223 significant lines (blank, comment-only and punctuation-only lines excluded), 58 methods. The bar is 30 methods; this is 28 over it, 1.93× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Common src/qbasic/Common.vb— TooManyMethods — 535 significant lines (blank, comment-only and punctuation-only lines excluded), 51 methods. The bar is 30 methods; this is 21 over it, 1.70× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Video src/qbasic.compatibility/Video.vb— TooManyMethods — 1456 significant lines (blank, comment-only and punctuation-only lines excluded), 48 methods. The bar is 30 methods; this is 18 over it, 1.60× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: DocumentPanel src/qbasic/DocumentPanel.vb— TooManyMethods — 988 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 30 methods; this is 14 over it, 1.47× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Video src/qbasic/QBLib/Video.vb— TooManyMethods — 1866 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: QBasicToVbNetRewriter src/qbasic/QB/CodeAnalysis/Syntax/QBasicToVbNetRewriter.vb— TooManyMethods — 413 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 30 methods; this is 7 over it, 1.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: WindowsAudio src/qbasic/QBLib/Audio/WindowsAudio.vb— TooManyMethods — 472 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 30 methods; this is 6 over it, 1.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: BoundNodePrinter src/qbasic/QB/CodeAnalysis/Binding/BoundNodePrinter.vb— TooManyMethods — 372 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 30 methods; this is 6 over it, 1.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: AudioDevice src/qbasic/QBLib/Audio/AudioDevice.vb— TooManyMethods — 351 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 30 methods; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: MsilEmitter src/qbasic/QB/CodeAnalysis/Emit/MsilEmitter.vb— TooManyMethods — 535 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Core src/qbasic/QBLib/Core.vb— TooManyMethods — 537 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Console src/qbasic.compatibility/Console.vb— TooManyMethods — 258 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 30 methods; this is 1 over it, 1.03× 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.
FileTooLong: Interactive/Interactive.vb src/qbasic/Basic/Interactive/Interactive.vb— FileTooLong — 10678 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 10178 over it, 21.36× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: CodeAnalysis/Evaluator.vb src/qbasic/QB/CodeAnalysis/Evaluator.vb— FileTooLong — 4845 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4345 over it, 9.69× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Syntax/Parser.vb src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb— FileTooLong — 3177 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2677 over it, 6.35× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Display/Display.vb src/qbasic/Basic/Display/Display.vb— FileTooLong — 3075 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2575 over it, 6.15× 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: Binding/Binder.vb src/qbasic/QB/CodeAnalysis/Binding/Binder.vb— FileTooLong — 2646 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2146 over it, 5.29× 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: qbasic/Program.vb src/qbasic/Program.vb— FileTooLong — 2381 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1881 over it, 4.76× 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: QBLib/Video.vb src/qbasic/QBLib/Video.vb— FileTooLong — 1880 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1380 over it, 3.76× 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: qbasic.compatibility/Video.vb src/qbasic.compatibility/Video.vb— FileTooLong — 1470 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 970 over it, 2.94× 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: qbasic/DocumentPanel.vb src/qbasic/DocumentPanel.vb— FileTooLong — 991 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 491 over it, 1.98× 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: Display/CharMap.vb src/qbasic/Basic/Display/CharMap.vb— FileTooLong — 784 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 284 over it, 1.57× 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: Syntax/SyntaxKind.vb src/Compilers/Qbx/CodeAnalysis/QBasic/Syntax/SyntaxKind.vb— FileTooLong — 651 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 151 over it, 1.30× 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: Parser/Parser.vb src/qbasic/Basic/Parser/Parser.vb— FileTooLong — 597 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 97 over it, 1.19× 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: Syntax/Lexer.vb src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb— FileTooLong — 574 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 74 over it, 1.15× 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: qbasic/Common.vb src/qbasic/Common.vb— FileTooLong — 547 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 47 over it, 1.09× 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: Emit/MsilEmitter.vb src/qbasic/QB/CodeAnalysis/Emit/MsilEmitter.vb— FileTooLong — 546 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 46 over it, 1.09× 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: QBLib/Core.vb src/qbasic/QBLib/Core.vb— FileTooLong — 539 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 39 over it, 1.08× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Emit/JsEmitter.vb src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb— FileTooLong — 525 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 25 over it, 1.05× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
Hotspot: src/qbasic/QB/CodeAnalysis/Evaluator.vb src/qbasic/QB/CodeAnalysis/Evaluator.vb:3872— src/qbasic/QB/CodeAnalysis/Evaluator.vb changed 122 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 276 in Evaluator.EvaluateBinaryExpression at line 3872. 24 of those changes were fix/bug commits, and the other 98 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/QB/CodeAnalysis/Evaluator.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/qbasic/Program.vb src/qbasic/Program.vb:1176— src/qbasic/Program.vb changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 379 in QBasic.OnUserUpdate at line 1176. 5 of those changes were fix/bug commits, and the other 37 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/Program.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/qbasic/QB/CodeAnalysis/Binding/Binder.vb src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:653— src/qbasic/QB/CodeAnalysis/Binding/Binder.vb changed 78 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 115 in Binder.BindStatementInternal at line 653. 19 of those changes were fix/bug commits, and the other 59 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/QB/CodeAnalysis/Binding/Binder.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:127— src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 126 in Parser.ParseStatement at line 127. 8 of those changes were fix/bug commits, and the other 30 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/qbasic/QB/CodeAnalysis/Binding/ConstantFolding.vb src/qbasic/QB/CodeAnalysis/Binding/ConstantFolding.vb:44— src/qbasic/QB/CodeAnalysis/Binding/ConstantFolding.vb changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 257 in ConstantFolding.Fold at line 44. 4 of those changes were fix/bug commits, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/QB/CodeAnalysis/Binding/ConstantFolding.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/qbasic/QBLib/Video.vb src/qbasic/QBLib/Video.vb:2095— src/qbasic/QBLib/Video.vb changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in Video.INKEY at line 2095. 4 of those changes were fix/bug commits, and the other 11 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/QBLib/Video.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/qbasic/QB/CodeAnalysis/Syntax/SyntaxFacts.vb src/qbasic/QB/CodeAnalysis/Syntax/SyntaxFacts.vb:287— src/qbasic/QB/CodeAnalysis/Syntax/SyntaxFacts.vb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 195 in SyntaxFacts.GetText at line 287. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/QB/CodeAnalysis/Syntax/SyntaxFacts.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:551— src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in Lexer.ReadIdentifierOrKeyword at line 551. 2 of those changes were fix/bug commits, and the other 6 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/qbasic/Common.vb src/qbasic/Common.vb:66— src/qbasic/Common.vb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in Common.GetChar at line 66. 2 of those changes were fix/bug commits, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/Common.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/qbasic/QBLib/Audio/WindowsAudio.vb src/qbasic/QBLib/Audio/WindowsAudio.vb:294— src/qbasic/QBLib/Audio/WindowsAudio.vb changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in WindowsAudio.StreamingLoop at line 294. 1 of those changes was a fix/bug commit, and the other 19 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/QBLib/Audio/WindowsAudio.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/qbasic/QBLib/Audio/AudioDevice.vb src/qbasic/QBLib/Audio/AudioDevice.vb:460— src/qbasic/QBLib/Audio/AudioDevice.vb changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in AudioDevice.EmitTone at line 460. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/QBLib/Audio/AudioDevice.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/qbasic/QB/CodeAnalysis/Binding/BoundBinaryOperator.vb src/qbasic/QB/CodeAnalysis/Binding/BoundBinaryOperator.vb:226— src/qbasic/QB/CodeAnalysis/Binding/BoundBinaryOperator.vb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in BoundBinaryOperator.Initialize at line 226. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/QB/CodeAnalysis/Binding/BoundBinaryOperator.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/qbasic/QB/CodeAnalysis/Syntax/QBasicToVbNetRewriter.vb src/qbasic/QB/CodeAnalysis/Syntax/QBasicToVbNetRewriter.vb:588— src/qbasic/QB/CodeAnalysis/Syntax/QBasicToVbNetRewriter.vb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in QBasicToVbNetRewriter.ConvertPrintStatementUsingSyntax at line 588. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/QB/CodeAnalysis/Syntax/QBasicToVbNetRewriter.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/qbasic/QB/CodeAnalysis/Binding/ControlFlowGraph.vb src/qbasic/QB/CodeAnalysis/Binding/ControlFlowGraph.vb:163— src/qbasic/QB/CodeAnalysis/Binding/ControlFlowGraph.vb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in GraphBuilder.Build at line 163. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/QB/CodeAnalysis/Binding/ControlFlowGraph.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/qbasic/QB/CodeAnalysis/Binding/BoundTreeRewriter.vb src/qbasic/QB/CodeAnalysis/Binding/BoundTreeRewriter.vb:177— src/qbasic/QB/CodeAnalysis/Binding/BoundTreeRewriter.vb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in BoundTreeRewriter.RewritePrintStatement at line 177. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/QB/CodeAnalysis/Binding/BoundTreeRewriter.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/qbasic/QB/CodeAnalysis/Syntax/SyntaxNode.vb src/qbasic/QB/CodeAnalysis/Syntax/SyntaxNode.vb:419— src/qbasic/QB/CodeAnalysis/Syntax/SyntaxNode.vb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in SyntaxNode.WriteNodeWithTrivia at line 419. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/QB/CodeAnalysis/Syntax/SyntaxNode.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
ClassTooLong: Display.InternalPage src/qbasic/Basic/Display/Display.vb— ClassTooLong — 954 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 554 over it, 2.39× 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: CharMap src/qbasic/Basic/Display/CharMap.vb— ClassTooLong — 782 significant lines (blank, comment-only and punctuation-only lines excluded), 1 methods. The bar is 400 significant lines; this is 382 over it, 1.96× 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: Parser src/qbasic/Basic/Parser/Parser.vb— ClassTooLong — 595 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 195 over it, 1.49× 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: Lexer src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb— ClassTooLong — 568 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 168 over it, 1.42× 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: JsEmitter src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb— ClassTooLong — 518 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 118 over it, 1.30× 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 src/qbasic/Program.vb— ClassTooLong — 499 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 99 over it, 1.25× 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: SyntaxFacts src/qbasic/QB/CodeAnalysis/Syntax/SyntaxFacts.vb— ClassTooLong — 456 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 56 over it, 1.14× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: KeyEventArgs src/qbasic/Basic/Input/KeyEventArgs.vb— ClassTooLong — 450 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 50 over it, 1.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: Core src/qbasic.compatibility/Core.vb— ClassTooLong — 423 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 23 over it, 1.06× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (12 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:4269— src/qbasic/Basic/Interactive/Interactive.vb:4269-4280 | src/qbasic/Basic/Interactive/Interactive.vb:4459-4470 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:6699— src/qbasic/Basic/Interactive/Interactive.vb:6699-6710 | src/qbasic/Basic/Interactive/Interactive.vb:10311-10322 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:11365— src/qbasic/Basic/Interactive/Interactive.vb:11365-11376 | src/qbasic/Basic/Interactive/Interactive.vb:11393-11404 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/qbasic/Basic/Interactive/Interactive.vb:11363` calls `ExecuteExpression` and `src/qbasic/Basic/Interactive/Interactive.vb:11391` 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.
Duplicated block (12 lines × 2) src/qbasic/Components/Form.vb:72— src/qbasic/Components/Form.vb:72-83 | src/qbasic/Components/Form.vb:87-98 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) src/qbasic/DocumentPanel.vb:164— src/qbasic/DocumentPanel.vb:164-176 | src/qbasic/HelpPanel.vb:67-78 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12 lines × 2) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2040— src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2040-2051 | src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2061-2072 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3538— src/qbasic/QB/CodeAnalysis/Evaluator.vb:3538-3549 | src/qbasic/QB/CodeAnalysis/Evaluator.vb:3562-3576 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:1838— src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:1838-1849 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:3128-3139 — 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) src/qbasic/Basic/Display/Display.vb:2066— src/qbasic/Basic/Display/Display.vb:2066-2071 | src/qbasic/Basic/Display/Display.vb:2112-2117 — 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) src/qbasic/Basic/Interactive/Interactive.vb:6280— src/qbasic/Basic/Interactive/Interactive.vb:6280-6285 | src/qbasic/Basic/Interactive/Interactive.vb:6286-6291 — 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) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:780— src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:780-785 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:786-791 — 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) src/qbasic/QBLib/Audio/WindowsAudio.vb:614— src/qbasic/QBLib/Audio/WindowsAudio.vb:614-619 | src/qbasic/QBLib/Audio/WindowsAudio.vb:643-648 — 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) src/qbasic/QBLib/Video.vb:1498— src/qbasic/QBLib/Video.vb:1498-1503 | src/qbasic/QBLib/Video.vb:1544-1549 — 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) src/qbasic.compatibility/Video.vb:1226— src/qbasic.compatibility/Video.vb:1226-1231 | src/qbasic.compatibility/Video.vb:1272-1277 — 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) src/qbasic/Components/CheckboxControl.vb:9— src/qbasic/Components/CheckboxControl.vb:9-14 | src/qbasic/Components/RadioButtonControl.vb:9-14 — before extracting anything, compare `src/qbasic/Components/CheckboxControl.vb` and `src/qbasic/Components/RadioButtonControl.vb` as WHOLE FILES: 91% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:755— src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:755-763 | src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb:676-681 — before extracting anything, compare `src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb` and `src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) src/qbasic/AboutDialog.vb:67— src/qbasic/AboutDialog.vb:67-82 | src/qbasic/MessageDialog.vb:63-78 — before extracting anything, compare `src/qbasic/AboutDialog.vb` and `src/qbasic/MessageDialog.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:7955— src/qbasic/Basic/Interactive/Interactive.vb:7955-7970 | src/qbasic/Basic/Interactive/Interactive.vb:8055-8070 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/qbasic/Basic/Interactive/Interactive.vb:8054` calls `m_interpreter`, `Statements` and `src/qbasic/Basic/Interactive/Interactive.vb:7954` does not — after which the two agree again for 4 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.
Duplicated block (16 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:12936— src/qbasic/Basic/Interactive/Interactive.vb:12936-12951 | src/qbasic/Basic/Interactive/Interactive.vb:12952-12967 — 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 (16 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:15893— src/qbasic/Basic/Interactive/Interactive.vb:15893-15908 | src/qbasic/Basic/Interactive/Interactive.vb:16452-16467 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) src/qbasic.compatibility/Devices.vb:322— src/qbasic.compatibility/Devices.vb:322-337 | src/qbasic/Basic/VisualBasic/MKI.vb:315-330 — before extracting anything, compare `src/qbasic.compatibility/Devices.vb` and `src/qbasic/Basic/VisualBasic/MKI.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 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. 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 (16 lines × 2) src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:463— src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:463-478 | src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb:360-375 — before extracting anything, compare `src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb` and `src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. 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 (16 lines × 2) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:2973— src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:2973-2988 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:3095-3110 — 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 `src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:2973` 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 (24 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:11002— src/qbasic/Basic/Interactive/Interactive.vb:11002-11025 | src/qbasic/Basic/Interactive/Interactive.vb:14743-14766 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (24 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:15066— src/qbasic/Basic/Interactive/Interactive.vb:15066-15089 | src/qbasic/Basic/Interactive/Interactive.vb:15090-15113 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (24 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:16127— src/qbasic/Basic/Interactive/Interactive.vb:16127-16150 | src/qbasic/Basic/Interactive/Interactive.vb:16190-16213 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (24 lines × 2) src/qbasic/Basic/Tokenizer/Decode.vb:390— src/qbasic/Basic/Tokenizer/Decode.vb:390-413 | src/qbasic/Basic/Tokenizer/Decode.vb:441-464 — 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 `src/qbasic/Basic/Tokenizer/Decode.vb:441` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (24 lines × 2) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:1863— src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:1863-1886 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:3153-3176 — 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 `src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:1863` 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 (24 lines × 2) src/qbasic/QBLib/Video.vb:1673— src/qbasic/QBLib/Video.vb:1673-1696 | src/qbasic/QBLib/Video.vb:1700-1723 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) src/qbasic/Basic/Display/Display.vb:744— src/qbasic/Basic/Display/Display.vb:744-762 | src/qbasic/Basic/Display/Display.vb:767-785 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:6812— src/qbasic/Basic/Interactive/Interactive.vb:6812-6830 | src/qbasic/Basic/Interactive/Interactive.vb:15714-15732 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:7783— src/qbasic/Basic/Interactive/Interactive.vb:7783-7801 | src/qbasic/Basic/Interactive/Interactive.vb:7807-7825 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) src/qbasic.compatibility/Devices.vb:130— src/qbasic.compatibility/Devices.vb:130-148 | src/qbasic/Basic/VisualBasic/MKI.vb:124-142 — before extracting anything, compare `src/qbasic.compatibility/Devices.vb` and `src/qbasic/Basic/VisualBasic/MKI.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 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. 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 (19 lines × 2) src/qbasic/Implementation/WindowsFileSystem.vb:143— src/qbasic/Implementation/WindowsFileSystem.vb:143-161 | src/qbasic/Implementation/WindowsFileSystem.vb:165-183 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3635— src/qbasic/QB/CodeAnalysis/Evaluator.vb:3635-3653 | src/qbasic/QB/CodeAnalysis/Evaluator.vb:3745-3763 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) src/qbasic/Basic/Display/Display.vb:5163— src/qbasic/Basic/Display/Display.vb:5163-5176 | src/qbasic/Basic/Display/Display.vb:5201-5214 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) src/qbasic/Basic/Input/KeyEventArgs.vb:186— src/qbasic/Basic/Input/KeyEventArgs.vb:186-200 | src/qbasic/Basic/Input/KeyEventArgs.vb:274-287 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:4052— src/qbasic/Basic/Interactive/Interactive.vb:4052-4065 | src/qbasic/Basic/Interactive/Interactive.vb:4070-4083 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:17614— src/qbasic/Basic/Interactive/Interactive.vb:17614-17627 | src/qbasic/Basic/Interactive/Interactive.vb:17633-17646 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1516— src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1516-1529 | src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1533-1546 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:468— src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:468-481 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:521-534 — 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 `src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:468` 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 (9 lines × 2) src/qbasic.compatibility/Devices.vb:229— src/qbasic.compatibility/Devices.vb:229-237 | src/qbasic/Basic/VisualBasic/MKI.vb:222-230 — before extracting anything, compare `src/qbasic.compatibility/Devices.vb` and `src/qbasic/Basic/VisualBasic/MKI.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 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. 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 (9 lines × 2) src/qbasic/Common.vb:716— src/qbasic/Common.vb:716-724 | src/qbasic/Common.vb:728-736 — 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 (9 lines × 2) src/qbasic/DocumentPanel.vb:927— src/qbasic/DocumentPanel.vb:927-935 | src/qbasic/DocumentPanel.vb:1035-1043 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/qbasic/DocumentPanel.vb:1044` calls `Enter` and `src/qbasic/DocumentPanel.vb:936` 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.
Duplicated block (9 lines × 2) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:770— src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:770-778 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:1849-1857 — 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) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:2848— src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:2848-2856 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:3955-3964 — 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) src/qbasic.compatibility/Video.vb:2042— src/qbasic.compatibility/Video.vb:2042-2050 | src/qbasic/QBLib/Video.vb:2219-2227 — 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 (23 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:6494— src/qbasic/Basic/Interactive/Interactive.vb:6494-6519 | src/qbasic/Basic/Interactive/Interactive.vb:15059-15081 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/qbasic/Basic/Interactive/Interactive.vb:6519` calls `PeekToken` and `src/qbasic/Basic/Interactive/Interactive.vb:15081` 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.
Duplicated block (23 lines × 2) src/qbasic/OpenDialog.vb:87— src/qbasic/OpenDialog.vb:87-109 | src/qbasic/SaveAsDialog.vb:72-94 — before extracting anything, compare `src/qbasic/OpenDialog.vb` and `src/qbasic/SaveAsDialog.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/qbasic/SaveAsDialog.vb:71` calls `SelectAll` and `src/qbasic/OpenDialog.vb:86` does not — after which the two agree again for 4 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.
Duplicated block (23 lines × 2) src/qbasic/Program.vb:2730— src/qbasic/Program.vb:2730-2752 | src/qbasic/Program.vb:2758-2780 — 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 (23 lines × 2) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2627— src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2627-2649 | src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2674-2696 — 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 (23 lines × 2) src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:669— src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:669-691 | src/qbasic/QB/CodeAnalysis/Emit/MsilEmitter.vb:538-560 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (15 lines × 2) src/qbasic/Basic/Display/Display.vb:573— src/qbasic/Basic/Display/Display.vb:573-587 | src/qbasic/Basic/Display/Display.vb:614-628 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:3007— src/qbasic/Basic/Interactive/Interactive.vb:3007-3021 | src/qbasic/Basic/Interactive/Interactive.vb:3049-3063 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/qbasic/Basic/Interactive/Interactive.vb:3024` calls `ThrowBasicError` and `src/qbasic/Basic/Interactive/Interactive.vb:3065` 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.
Duplicated block (15 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:5798— src/qbasic/Basic/Interactive/Interactive.vb:5798-5812 | src/qbasic/Basic/Interactive/Interactive.vb:16841-16855 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:16972— src/qbasic/Basic/Interactive/Interactive.vb:16972-16986 | src/qbasic/Basic/Interactive/Interactive.vb:16994-17008 — 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 `src/qbasic/Basic/Interactive/Interactive.vb:16972` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (15 lines × 2) src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:506— src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:506-520 | src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb:414-428 — before extracting anything, compare `src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb` and `src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:501` calls `EmitExpression` and `src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb:409` 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.
Duplicated block (11 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:2340— src/qbasic/Basic/Interactive/Interactive.vb:2340-2350 | src/qbasic/Basic/Interactive/Interactive.vb:2362-2372 — 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 (11 lines × 2) src/qbasic/Basic/Parser/Parser.vb:482— src/qbasic/Basic/Parser/Parser.vb:482-492 | src/qbasic/Basic/Parser/Parser.vb:603-614 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) src/qbasic/ChangeDialog.vb:29— src/qbasic/ChangeDialog.vb:29-39 | src/qbasic/FindDialog.vb:27-37 — before extracting anything, compare `src/qbasic/ChangeDialog.vb` and `src/qbasic/FindDialog.vb` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) src/qbasic/Components/Form.vb:121— src/qbasic/Components/Form.vb:121-131 | src/qbasic/Components/Form.vb:144-154 — 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 (11 lines × 2) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:274— src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:274-285 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:4265-4275 — 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) src/qbasic/Basic/Parser/Parser.vb:542— src/qbasic/Basic/Parser/Parser.vb:542-551 | src/qbasic/Basic/Parser/Parser.vb:646-655 — 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) src/qbasic/Common.vb:520— src/qbasic/Common.vb:520-531 | src/qbasic/Common.vb:546-555 — 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 (10 lines × 2) src/qbasic/MainMenu.vb:86— src/qbasic/MainMenu.vb:86-95 | src/qbasic/MainMenu.vb:158-167 — 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) src/qbasic/OpenDialog.vb:68— src/qbasic/OpenDialog.vb:68-77 | src/qbasic/SaveAsDialog.vb:63-72 — before extracting anything, compare `src/qbasic/OpenDialog.vb` and `src/qbasic/SaveAsDialog.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:2403— src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:2403-2412 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:3903-3912 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:1365— src/qbasic/Basic/Interactive/Interactive.vb:1365-1371 | src/qbasic/Basic/Interactive/Interactive.vb:1373-1379 — 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 `src/qbasic/Basic/Interactive/Interactive.vb:1373` 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 (7 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:6295— src/qbasic/Basic/Interactive/Interactive.vb:6295-6301 | src/qbasic/Basic/Interactive/Interactive.vb:8539-8545 — 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 (7 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:8538— src/qbasic/Basic/Interactive/Interactive.vb:8538-8544 | src/qbasic/Basic/Interactive/Interactive.vb:10464-10471 — 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 (7 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:16586— src/qbasic/Basic/Interactive/Interactive.vb:16586-16594 | src/qbasic/Basic/Interactive/Interactive.vb:16706-16712 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/qbasic/Basic/Interactive/Interactive.vb:16704` calls `m_numericVariableList` and `src/qbasic/Basic/Interactive/Interactive.vb:16584` 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.
Duplicated block (7 lines × 2) src/qbasic/Components/ButtonControl.vb:42— src/qbasic/Components/ButtonControl.vb:42-48 | src/qbasic/Components/RadioButtonControl.vb:33-39 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:8701— src/qbasic/Basic/Interactive/Interactive.vb:8701-8708 | src/qbasic/Basic/Interactive/Interactive.vb:8754-8761 — 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 (8 lines × 2) src/qbasic/Components/TextBoxControl.vb:147— src/qbasic/Components/TextBoxControl.vb:147-154 | src/qbasic/DocumentPanel.vb:310-317 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `src/qbasic/DocumentPanel.vb:310` 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. 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 (8 lines × 2) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:388— src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:388-395 | src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:495-502 — 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) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2198— src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2198-2205 | src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2220-2227 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/qbasic/Components/HorizontalListBoxControl.vb:105— src/qbasic/Components/HorizontalListBoxControl.vb:105-109 | src/qbasic/Components/ListBoxControl.vb:93-98 — 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. 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) src/qbasic/QB/CodeAnalysis/Binding/BoundScope.vb:161— src/qbasic/QB/CodeAnalysis/Binding/BoundScope.vb:161-165 | src/qbasic/QB/CodeAnalysis/Binding/BoundScope.vb:176-180 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. 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) src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:531— src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:531-535 | src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb:439-443 — before extracting anything, compare `src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb` and `src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:571— src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:571-575 | src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb:488-492 — before extracting anything, compare `src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb` and `src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×3
Members sharing a duplicated core (4 members, 50+ identical tokens) src/qbasic/Basic/Display/Display.vb:1864— src/qbasic/Basic/Display/Display.vb:1864-1881 | src/qbasic/Basic/Display/Display.vb:2233-2282 | src/qbasic/Basic/Display/Display.vb:2318-2343 | src/qbasic/Basic/Display/Display.vb:2349-2373 — 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) src/qbasic/Basic/Interactive/Interactive.vb:5665— src/qbasic/Basic/Interactive/Interactive.vb:5665-5701 | src/qbasic/Basic/Interactive/Interactive.vb:10235-10280 | src/qbasic/Basic/Interactive/Interactive.vb:11186-11220 | src/qbasic/Basic/Interactive/Interactive.vb:14694-14731 — 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) src/qbasic/Basic/Interactive/Interactive.vb:6256— src/qbasic/Basic/Interactive/Interactive.vb:6256-6344 | src/qbasic/Basic/Interactive/Interactive.vb:8520-9163 | src/qbasic/Basic/Interactive/Interactive.vb:10429-10526 | src/qbasic/Basic/Interactive/Interactive.vb:11988-12094 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (25 lines × 2) src/qbasic/Basic/Display/Display.vb:2650— src/qbasic/Basic/Display/Display.vb:2650-2674 | src/qbasic/Basic/Display/Display.vb:2690-2714 — 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 (25 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:10254— src/qbasic/Basic/Interactive/Interactive.vb:10254-10278 | src/qbasic/Basic/Interactive/Interactive.vb:16910-16934 — 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 (25 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:10731— src/qbasic/Basic/Interactive/Interactive.vb:10731-10755 | src/qbasic/Basic/Interactive/Interactive.vb:14118-14142 — 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 (22 lines × 2) src/qbasic/Basic/Display/Display.vb:678— src/qbasic/Basic/Display/Display.vb:678-699 | src/qbasic/Basic/Display/Display.vb:712-733 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (22 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:12003— src/qbasic/Basic/Interactive/Interactive.vb:12003-12024 | src/qbasic/Basic/Interactive/Interactive.vb:12025-12046 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (22 lines × 2) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:946— src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:946-967 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:3261-3282 — 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 `src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:3261` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (17 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:11522— src/qbasic/Basic/Interactive/Interactive.vb:11522-11538 | src/qbasic/Basic/Interactive/Interactive.vb:11565-11581 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) src/qbasic/Basic/VisualBasic/MKI.vb:322— src/qbasic/Basic/VisualBasic/MKI.vb:322-338 | src/qbasic/QBLib/Core.vb:827-844 — 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 (17 lines × 2) src/qbasic/QB/CodeAnalysis/Evaluator.vb:2550— src/qbasic/QB/CodeAnalysis/Evaluator.vb:2550-2566 | src/qbasic/QB/CodeAnalysis/Evaluator.vb:2580-2596 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) src/qbasic/AboutDialog.vb:76— src/qbasic/AboutDialog.vb:76-88 | src/qbasic/WelcomeDialog.vb:81-93 — before extracting anything, compare `src/qbasic/AboutDialog.vb` and `src/qbasic/WelcomeDialog.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. 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 (13 lines × 2) src/qbasic/Program.vb:719— src/qbasic/Program.vb:719-731 | src/qbasic/Program.vb:1346-1358 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:485— src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:485-497 | src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:527-539 — 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.
Video.InputAsync (cyclomatic 24) src/qbasic/QBLib/Video.vb:1815— Video.InputAsync 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. This is NOT this file's highest cyclomatic complexity: Video.PALETTE (cyclomatic 69) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Video.InputAsync (cyclomatic 24) src/qbasic.compatibility/Video.vb:1616— Video.InputAsync 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. This shape REPEATS in the file: one other method here (Video.LineInputAsync) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file's highest cyclomatic complexity: Video.PALETTE (cyclomatic 69) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Evaluator.Assign (cyclomatic 20) src/qbasic/QB/CodeAnalysis/Evaluator.vb:4909— Evaluator.Assign 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.
Evaluator.Assign (cyclomatic 20) src/qbasic/QB/CodeAnalysis/Evaluator.vb:4994— Evaluator.Assign 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.
Duplicated block (33 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:12260— src/qbasic/Basic/Interactive/Interactive.vb:12260-12292 | src/qbasic/Basic/Interactive/Interactive.vb:13580-13612 — 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 (33 lines × 2) src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:349— src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:349-381 | src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb:244-276 — before extracting anything, compare `src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb` and `src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (31 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:16154— src/qbasic/Basic/Interactive/Interactive.vb:16154-16184 | src/qbasic/Basic/Interactive/Interactive.vb:16217-16247 — 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 (31 lines × 2) src/qbasic/Program.vb:479— src/qbasic/Program.vb:479-509 | src/qbasic/QB/CodeAnalysis/Syntax/SyntaxNode.vb:420-450 — 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 (28 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:12400— src/qbasic/Basic/Interactive/Interactive.vb:12400-12427 | src/qbasic/Basic/Interactive/Interactive.vb:12458-12485 — 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 (28 lines × 2) src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:697— src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:697-724 | src/qbasic/QB/CodeAnalysis/Emit/MsilEmitter.vb:566-593 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (19–26 lines × 2) src/qbasic/Basic/VisualBasic/MKI.vb:69— src/qbasic/Basic/VisualBasic/MKI.vb:69-94 | src/qbasic/QBLib/Core.vb:585-603 — 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. 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 (19–26 lines × 2) src/qbasic/Basic/VisualBasic/MKI.vb:146— src/qbasic/Basic/VisualBasic/MKI.vb:146-171 | src/qbasic/QBLib/Core.vb:773-791 — 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. 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 (20 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:15494— src/qbasic/Basic/Interactive/Interactive.vb:15494-15513 | src/qbasic/Basic/Interactive/Interactive.vb:15526-15545 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (20 lines × 2) src/qbasic/QB/CodeAnalysis/Symbols/GlobalVariableSymbol.vb:9— src/qbasic/QB/CodeAnalysis/Symbols/GlobalVariableSymbol.vb:9-28 | src/qbasic/QB/CodeAnalysis/Symbols/LocalVariableSymbol.vb:9-33 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (17 lines × 3) src/qbasic/Basic/Interactive/Interactive.vb:5665— src/qbasic/Basic/Interactive/Interactive.vb:5665-5681 | src/qbasic/Basic/Interactive/Interactive.vb:11190-11206 | src/qbasic/Basic/Interactive/Interactive.vb:14698-14714 — 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 `src/qbasic/Basic/Interactive/Interactive.vb:5665` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/qbasic/Basic/Interactive/Interactive.vb:5660` calls `ExecuteChDir` and `src/qbasic/Basic/Interactive/Interactive.vb:11188` 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.
Duplicated block (17 lines × 3) src/qbasic/DisplayDialog.vb:74— src/qbasic/DisplayDialog.vb:74-90 | src/qbasic/FindDialog.vb:47-63 | src/qbasic/HelpPathDialog.vb:34-50 — before extracting anything, compare `src/qbasic/DisplayDialog.vb` and `src/qbasic/FindDialog.vb` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 3) src/qbasic/Basic/Display/Display.vb:2165— src/qbasic/Basic/Display/Display.vb:2165-2177 | src/qbasic/Basic/Display/Display.vb:2184-2196 | src/qbasic/Basic/Display/Display.vb:2208-2220 — 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 (13 lines × 3) src/qbasic/Basic/Interactive/Interactive.vb:865— src/qbasic/Basic/Interactive/Interactive.vb:865-877 | src/qbasic/Basic/Interactive/Interactive.vb:1121-1133 | src/qbasic/Basic/Interactive/Interactive.vb:18680-18692 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 3) src/qbasic/AboutDialog.vb:66— src/qbasic/AboutDialog.vb:66-75 | src/qbasic/MessageDialog.vb:62-71 | src/qbasic/WelcomeDialog.vb:71-80 — before extracting anything, compare `src/qbasic/AboutDialog.vb` and `src/qbasic/MessageDialog.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. 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 (10 lines × 3) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:469— src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:469-478 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:493-502 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:522-531 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9–10 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:10464— src/qbasic/Basic/Interactive/Interactive.vb:10464-10472 | src/qbasic/Basic/Interactive/Interactive.vb:11994-12003 — 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–10 lines × 2) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1012— src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1012-1021 | src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1032-1040 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7–9 lines × 2) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3656— src/qbasic/QB/CodeAnalysis/Evaluator.vb:3656-3664 | src/qbasic/QB/CodeAnalysis/Evaluator.vb:3701-3707 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7–9 lines × 2) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3766— src/qbasic/QB/CodeAnalysis/Evaluator.vb:3766-3774 | src/qbasic/QB/CodeAnalysis/Evaluator.vb:3809-3815 — 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.
QBasic.OnUserUpdate (cyclomatic 379) src/qbasic/Program.vb:1176— QBasic.OnUserUpdate has cyclomatic complexity 379 (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.
Interactive.InteractiveProcessKey (cyclomatic 289) src/qbasic/Basic/Interactive/Interactive.vb:1119— Interactive.InteractiveProcessKey has cyclomatic complexity 289 (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.
Evaluator.EvaluateBinaryExpression (cyclomatic 276) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3872— Evaluator.EvaluateBinaryExpression has cyclomatic complexity 276 (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.
Evaluator.EvaluateStatement (cyclomatic 275) src/qbasic/QB/CodeAnalysis/Evaluator.vb:510— Evaluator.EvaluateStatement has cyclomatic complexity 275 (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.
Interactive.ExecutePrimary (cyclomatic 259) src/qbasic/Basic/Interactive/Interactive.vb:3199— Interactive.ExecutePrimary has cyclomatic complexity 259 (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.
ConstantFolding.Fold (cyclomatic 257) src/qbasic/QB/CodeAnalysis/Binding/ConstantFolding.vb:44— ConstantFolding.Fold has cyclomatic complexity 257 (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.
Decode.ProcessInternal (cyclomatic 247) src/qbasic/Basic/Tokenizer/Decode.vb:12— Decode.ProcessInternal has cyclomatic complexity 247 (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.
Interactive.ProcessKeyInternal (cyclomatic 221) src/qbasic/Basic/Interactive/Interactive.vb:863— Interactive.ProcessKeyInternal has cyclomatic complexity 221 (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.
Evaluator.EvaluateCallExpression (cyclomatic 204) src/qbasic/QB/CodeAnalysis/Evaluator.vb:4192— Evaluator.EvaluateCallExpression has cyclomatic complexity 204 (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.
InternalPage.SetPalette (cyclomatic 180) src/qbasic/Basic/Display/Display.vb:543— InternalPage.SetPalette has cyclomatic complexity 180 (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.
Interactive.ExecuteStringPrimary (cyclomatic 140) src/qbasic/Basic/Interactive/Interactive.vb:2308— Interactive.ExecuteStringPrimary has cyclomatic complexity 140 (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.
Parser.ParseStatement (cyclomatic 126) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:127— Parser.ParseStatement 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.
Interactive.ExecutePut (cyclomatic 117) src/qbasic/Basic/Interactive/Interactive.vb:13632— Interactive.ExecutePut has cyclomatic complexity 117 (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.
Parser.PeekToken (cyclomatic 117) src/qbasic/Basic/Parser/Parser.vb:398— Parser.PeekToken has cyclomatic complexity 117 (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.
Conversion.Classify (cyclomatic 106) src/qbasic/QB/CodeAnalysis/Binding/Conversion.vb:27— Conversion.Classify has cyclomatic complexity 106 (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.
Interactive.ExecuteGet (cyclomatic 104) src/qbasic/Basic/Interactive/Interactive.vb:8515— Interactive.ExecuteGet has cyclomatic complexity 104 (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.
Interactive.ExecuteStatement (cyclomatic 103) src/qbasic/Basic/Interactive/Interactive.vb:5173— Interactive.ExecuteStatement has cyclomatic complexity 103 (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.HandleCommandLineArguments (cyclomatic 90) src/qbasic/Program.vb:121— Program.HandleCommandLineArguments has cyclomatic complexity 90 (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.
Interactive.ExecutePrint (cyclomatic 86) src/qbasic/Basic/Interactive/Interactive.vb:12312— Interactive.ExecutePrint has cyclomatic complexity 86 (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.
QBasic.GetPressed (cyclomatic 82) src/qbasic/Program.vb:2160— QBasic.GetPressed has cyclomatic complexity 82 (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.
Evaluator.PlayCommand (cyclomatic 81) src/qbasic/QB/CodeAnalysis/Evaluator.vb:5804— Evaluator.PlayCommand has cyclomatic complexity 81 (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.
Interactive.ExecutePrintUsing (cyclomatic 80) src/qbasic/Basic/Interactive/Interactive.vb:12698— Interactive.ExecutePrintUsing has cyclomatic complexity 80 (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.
Common.GetChar (cyclomatic 78) src/qbasic/Common.vb:66— Common.GetChar has cyclomatic complexity 78 (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.
DocumentPanel.ProcessKeys (cyclomatic 78) src/qbasic/DocumentPanel.vb:258— DocumentPanel.ProcessKeys has cyclomatic complexity 78 (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.
TextboxControl.OnKeyPress (cyclomatic 75) src/qbasic/Components/TextBoxControl.vb:37— TextboxControl.OnKeyPress has cyclomatic complexity 75 (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.
Interactive.ExecuteDraw (cyclomatic 72) src/qbasic/Basic/Interactive/Interactive.vb:18064— Interactive.ExecuteDraw has cyclomatic complexity 72 (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.
Lexer.ReadIdentifierOrKeyword (cyclomatic 66) src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:551— Lexer.ReadIdentifierOrKeyword has cyclomatic complexity 66 (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.
Video.INKEY (cyclomatic 66) src/qbasic/QBLib/Video.vb:2095— Video.INKEY has cyclomatic complexity 66 (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. This is NOT this file's highest cyclomatic complexity: Video.PALETTE (cyclomatic 69) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Interactive.InternalInputCompletedProcess (cyclomatic 65) src/qbasic/Basic/Interactive/Interactive.vb:17020— Interactive.InternalInputCompletedProcess has cyclomatic complexity 65 (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.
Console.INKEY (cyclomatic 62) src/qbasic.compatibility/Console.vb:93— Console.INKEY has cyclomatic complexity 62 (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.
Interactive.ExecuteWidth (cyclomatic 61) src/qbasic/Basic/Interactive/Interactive.vb:16251— Interactive.ExecuteWidth has cyclomatic complexity 61 (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.
Interactive.InternalProcessText (cyclomatic 61) src/qbasic/Basic/Interactive/Interactive.vb:18676— Interactive.InternalProcessText has cyclomatic complexity 61 (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.
WindowsFileSystem.Input (cyclomatic 59) src/qbasic/Implementation/WindowsFileSystem.vb:195— WindowsFileSystem.Input has cyclomatic complexity 59 (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.
DocumentPanel.WordRightAction (cyclomatic 54) src/qbasic/DocumentPanel.vb:814— DocumentPanel.WordRightAction has cyclomatic complexity 54 (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.
Video.CIRCLE (cyclomatic 54) src/qbasic/QBLib/Video.vb:1341— Video.CIRCLE has cyclomatic complexity 54 (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. This is NOT this file's highest cyclomatic complexity: Video.PALETTE (cyclomatic 69) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Video.CIRCLE (cyclomatic 51) src/qbasic.compatibility/Video.vb:1080— Video.CIRCLE has cyclomatic complexity 51 (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. This is NOT this file's highest cyclomatic complexity: Video.PALETTE (cyclomatic 69) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Display.Circle (cyclomatic 50) src/qbasic/Basic/Display/Display.vb:1919— Display.Circle 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.
Display.RowCount.Set (cyclomatic 48) src/qbasic/Basic/Display/Display.vb:2487— Display.RowCount.Set 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.
Interactive.ProcessInterpreter (cyclomatic 47) src/qbasic/Basic/Interactive/Interactive.vb:1415— Interactive.ProcessInterpreter has cyclomatic complexity 47 (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.
Interactive.ExecuteOpen (cyclomatic 47) src/qbasic/Basic/Interactive/Interactive.vb:11697— Interactive.ExecuteOpen has cyclomatic complexity 47 (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.
Video.LINE (cyclomatic 47) src/qbasic/QBLib/Video.vb:1611— Video.LINE has cyclomatic complexity 47 (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. This is NOT this file's highest cyclomatic complexity: Video.PALETTE (cyclomatic 69) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Interactive.ExecuteComparison (cyclomatic 46) src/qbasic/Basic/Interactive/Interactive.vb:2981— Interactive.ExecuteComparison has cyclomatic complexity 46 (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.
Display.ColumnCount.Set (cyclomatic 45) src/qbasic/Basic/Display/Display.vb:2629— Display.ColumnCount.Set 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.
Form.OnKeyPress (cyclomatic 45) src/qbasic/Components/Form.vb:51— Form.OnKeyPress 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.
Evaluator.ParseNumericFormat (cyclomatic 45) src/qbasic/QB/CodeAnalysis/Evaluator.vb:2710— Evaluator.ParseNumericFormat 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.
Evaluator.FormatNumericWithSpec (cyclomatic 45) src/qbasic/QB/CodeAnalysis/Evaluator.vb:2833— Evaluator.FormatNumericWithSpec 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.
BoundBinaryOperator.Initialize (cyclomatic 44) src/qbasic/QB/CodeAnalysis/Binding/BoundBinaryOperator.vb:226— BoundBinaryOperator.Initialize has cyclomatic complexity 44 (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.
Interactive.ExecuteCircle (cyclomatic 43) src/qbasic/Basic/Interactive/Interactive.vb:6254— Interactive.ExecuteCircle 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.
Binder.BindCallExpression (cyclomatic 43) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:900— Binder.BindCallExpression 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. This is NOT this file's highest cyclomatic complexity: Binder.BindStatementInternal (cyclomatic 115) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
MainMenu.ProcessKeys (cyclomatic 42) src/qbasic/MainMenu.vb:195— MainMenu.ProcessKeys 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.
DocumentPanel.WordLeftAction (cyclomatic 41) src/qbasic/DocumentPanel.vb:746— DocumentPanel.WordLeftAction 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.
SyntaxNode.PrettyPrint2 (cyclomatic 40) src/qbasic/QB/CodeAnalysis/Syntax/SyntaxNode.vb:290— SyntaxNode.PrettyPrint2 has cyclomatic complexity 40 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Display.Color (cyclomatic 39) src/qbasic/Basic/Display/Display.vb:3982— Display.Color 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.
Evaluator.EvaluateOpenStatement (cyclomatic 38) src/qbasic/QB/CodeAnalysis/Evaluator.vb:5067— Evaluator.EvaluateOpenStatement 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.
Interactive.ExecuteInput (cyclomatic 37) src/qbasic/Basic/Interactive/Interactive.vb:9910— Interactive.ExecuteInput has cyclomatic complexity 37 (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.
Interactive.ExecuteScreen (cyclomatic 37) src/qbasic/Basic/Interactive/Interactive.vb:15053— Interactive.ExecuteScreen has cyclomatic complexity 37 (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.
Interactive.CalculatePosition (cyclomatic 37) src/qbasic/Basic/Interactive/Interactive.vb:18457— Interactive.CalculatePosition has cyclomatic complexity 37 (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.
Interactive.ExecuteLet (cyclomatic 36) src/qbasic/Basic/Interactive/Interactive.vb:10284— Interactive.ExecuteLet has cyclomatic complexity 36 (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.
Interactive.InternalLoadCompleted (cyclomatic 35) src/qbasic/Basic/Interactive/Interactive.vb:6024— Interactive.InternalLoadCompleted has cyclomatic complexity 35 (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.
Display.Pset (cyclomatic 34) src/qbasic/Basic/Display/Display.vb:2231— Display.Pset has cyclomatic complexity 34 (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.
Display.Paint (cyclomatic 33) src/qbasic/Basic/Display/Display.vb:1601— Display.Paint 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.
OpenDialog.ProcessKeys (cyclomatic 33) src/qbasic/OpenDialog.vb:143— OpenDialog.ProcessKeys 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.
Binder.BindGlobalScope (cyclomatic 33) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:43— Binder.BindGlobalScope 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. This is NOT this file's highest cyclomatic complexity: Binder.BindStatementInternal (cyclomatic 115) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Lexer.ReadToken (cyclomatic 33) src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:180— Lexer.ReadToken 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.
Interactive.ExecuteClear (cyclomatic 32) src/qbasic/Basic/Interactive/Interactive.vb:6373— Interactive.ExecuteClear 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.
DocumentPanel.HandleSelection (cyclomatic 32) src/qbasic/DocumentPanel.vb:444— DocumentPanel.HandleSelection 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.
Binder.BindIdentifierExpression (cyclomatic 31) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1920— Binder.BindIdentifierExpression has cyclomatic complexity 31 (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. This is NOT this file's highest cyclomatic complexity: Binder.BindStatementInternal (cyclomatic 115) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Interactive.ExecuteLineInput (cyclomatic 30) src/qbasic/Basic/Interactive/Interactive.vb:10668— Interactive.ExecuteLineInput has cyclomatic complexity 30 (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.
Interactive.ExecutePaint (cyclomatic 30) src/qbasic/Basic/Interactive/Interactive.vb:11986— Interactive.ExecutePaint has cyclomatic complexity 30 (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.
JsEmitter.EmitBinaryExpression (cyclomatic 30) src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:334— JsEmitter.EmitBinaryExpression has cyclomatic complexity 30 (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.
VbEmitter.EmitBinaryExpression (cyclomatic 30) src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb:237— VbEmitter.EmitBinaryExpression has cyclomatic complexity 30 (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.
Evaluator.EvaluateArrayAccessExpressionForAssignment (cyclomatic 30) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3732— Evaluator.EvaluateArrayAccessExpressionForAssignment has cyclomatic complexity 30 (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.
Display.Screen (cyclomatic 29) src/qbasic/Basic/Display/Display.vb:2752— Display.Screen 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.
Interactive.ExecuteLine (cyclomatic 29) src/qbasic/Basic/Interactive/Interactive.vb:10427— Interactive.ExecuteLine 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.
Interactive.ExecuteLocate (cyclomatic 29) src/qbasic/Basic/Interactive/Interactive.vb:10530— Interactive.ExecuteLocate 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.
Interactive.FormatNumber (cyclomatic 29) src/qbasic/Basic/Interactive/Interactive.vb:13076— Interactive.FormatNumber 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.
MsilEmitter.EmitBinaryExpression (cyclomatic 29) src/qbasic/QB/CodeAnalysis/Emit/MsilEmitter.vb:219— MsilEmitter.EmitBinaryExpression 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.
GraphBuilder.Build (cyclomatic 27) src/qbasic/QB/CodeAnalysis/Binding/ControlFlowGraph.vb:163— GraphBuilder.Build has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Evaluator.EvaluateArrayAccessExpression (cyclomatic 27) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3632— Evaluator.EvaluateArrayAccessExpression has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Evaluator.EvaluateConversionExpression (cyclomatic 27) src/qbasic/QB/CodeAnalysis/Evaluator.vb:4866— Evaluator.EvaluateConversionExpression has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Parser.ParseForStatement (cyclomatic 27) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:1537— Parser.ParseForStatement has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Interactive.ExecuteColor (cyclomatic 26) src/qbasic/Basic/Interactive/Interactive.vb:6480— Interactive.ExecuteColor 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.
DocumentPanel.Render (cyclomatic 26) src/qbasic/DocumentPanel.vb:145— DocumentPanel.Render 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.
Interactive.ExecuteKey (cyclomatic 25) src/qbasic/Basic/Interactive/Interactive.vb:10121— Interactive.ExecuteKey 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.
Lexer.ReadNumberToken (cyclomatic 25) src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:306— Lexer.ReadNumberToken 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.
Parser.ParseNameOrCallExpression (cyclomatic 25) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:4237— Parser.ParseNameOrCallExpression 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.
SyntaxNode.PrettyPrint (cyclomatic 25) src/qbasic/QB/CodeAnalysis/Syntax/SyntaxNode.vb:202— SyntaxNode.PrettyPrint 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.
SaveAsDialog.ProcessKeys (cyclomatic 25) src/qbasic/SaveAsDialog.vb:130— SaveAsDialog.ProcessKeys 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.
SavePrompt.ProcessKeys (cyclomatic 25) src/qbasic/SavePrompt.vb:64— SavePrompt.ProcessKeys 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.
Interactive.ExecuteView (cyclomatic 24) src/qbasic/Basic/Interactive/Interactive.vb:15857— Interactive.ExecuteView 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.
Binder.BindMemberAccessExpression (cyclomatic 24) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1068— Binder.BindMemberAccessExpression 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. This is NOT this file's highest cyclomatic complexity: Binder.BindStatementInternal (cyclomatic 115) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Video.LineInputAsync (cyclomatic 24) src/qbasic.compatibility/Video.vb:1470— Video.LineInputAsync 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. This shape REPEATS in the file: one other method here (Video.InputAsync) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file's highest cyclomatic complexity: Video.PALETTE (cyclomatic 69) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
HorizontalListboxControl.OnKeyPress (cyclomatic 23) src/qbasic/Components/HorizontalListBoxControl.vb:38— HorizontalListboxControl.OnKeyPress has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
MainMenu.Render (cyclomatic 23) src/qbasic/MainMenu.vb:54— MainMenu.Render has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Binder.BindInputStatement (cyclomatic 23) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1575— Binder.BindInputStatement has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file's highest cyclomatic complexity: Binder.BindStatementInternal (cyclomatic 115) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Interactive.ExecuteMid (cyclomatic 22) src/qbasic/Basic/Interactive/Interactive.vb:11078— Interactive.ExecuteMid 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.
Evaluator.CheckKeyPressed (cyclomatic 22) src/qbasic/QB/CodeAnalysis/Evaluator.vb:1970— Evaluator.CheckKeyPressed 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.
IndentedSyntaxWriter.RewriteGotoGosubUsingSyntaxTree (cyclomatic 22) src/qbasic/QB/CodeAnalysis/Syntax/GwBasicToQBasicRewriter.vb:229— IndentedSyntaxWriter.RewriteGotoGosubUsingSyntaxTree 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.
Display.SetPalette (cyclomatic 21) src/qbasic/Basic/Display/Display.vb:4409— Display.SetPalette 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.
Interactive.InternalOpen (cyclomatic 21) src/qbasic/Basic/Interactive/Interactive.vb:16762— Interactive.InternalOpen 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.
Display.Paint (cyclomatic 21) src/qbasic/Implementation/Display.vb:33— Display.Paint 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.
Binder.BindPrintStatement (cyclomatic 21) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2095— Binder.BindPrintStatement 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. This is NOT this file's highest cyclomatic complexity: Binder.BindStatementInternal (cyclomatic 115) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Binder.BindVariableReference (cyclomatic 21) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:3156— Binder.BindVariableReference 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. This is NOT this file's highest cyclomatic complexity: Binder.BindStatementInternal (cyclomatic 115) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Evaluator.EvaluateKeyStatement (cyclomatic 21) src/qbasic/QB/CodeAnalysis/Evaluator.vb:1739— Evaluator.EvaluateKeyStatement 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.
TypeSymbol.TypeSymbolToType (cyclomatic 21) src/qbasic/QB/CodeAnalysis/Symbols/TypeSymbol.vb:29— TypeSymbol.TypeSymbolToType 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.
InternalPage.New.ctor (cyclomatic 20) src/qbasic/Basic/Display/Display.vb:143— InternalPage.New.ctor 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.
InternalPage.SetPalette (cyclomatic 20) src/qbasic/Basic/Display/Display.vb:275— InternalPage.SetPalette 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.
Display.Line (cyclomatic 20) src/qbasic/Basic/Display/Display.vb:2123— Display.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.
Interactive.ExecuteOn (cyclomatic 20) src/qbasic/Basic/Interactive/Interactive.vb:11312— Interactive.ExecuteOn 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.
Parser.ScanParse (cyclomatic 20) src/qbasic/Basic/Parser/Parser.vb:82— Parser.ScanParse 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.
Parser.FindEndOfStatement (cyclomatic 20) src/qbasic/Basic/Parser/Parser.vb:970— Parser.FindEndOfStatement 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.
ListboxControl.OnKeyPress (cyclomatic 20) src/qbasic/Components/ListBoxControl.vb:35— ListboxControl.OnKeyPress 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.
BoundLiteralExpression.New.ctor (cyclomatic 20) src/qbasic/QB/CodeAnalysis/Binding/BoundLiteralExpression.vb:8— BoundLiteralExpression.New.ctor 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.
Interactive.ExecuteChain (cyclomatic 19) src/qbasic/Basic/Interactive/Interactive.vb:5837— Interactive.ExecuteChain 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.
Interactive.ExecuteDef (cyclomatic 19) src/qbasic/Basic/Interactive/Interactive.vb:6834— Interactive.ExecuteDef 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.
Interactive.ExecuteDefInt (cyclomatic 19) src/qbasic/Basic/Interactive/Interactive.vb:6945— Interactive.ExecuteDefInt 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. This shape REPEATS in the file: 2 other methods here (Interactive.ExecuteDefSng, Interactive.ExecuteDefDbl) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.ExecuteDefSng (cyclomatic 19) src/qbasic/Basic/Interactive/Interactive.vb:7026— Interactive.ExecuteDefSng 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. This shape REPEATS in the file: 2 other methods here (Interactive.ExecuteDefInt, Interactive.ExecuteDefDbl) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.ExecuteDefDbl (cyclomatic 19) src/qbasic/Basic/Interactive/Interactive.vb:7107— Interactive.ExecuteDefDbl 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. This shape REPEATS in the file: 2 other methods here (Interactive.ExecuteDefInt, Interactive.ExecuteDefSng) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.ExecuteFilesParseResult (cyclomatic 19) src/qbasic/Basic/Interactive/Interactive.vb:7730— Interactive.ExecuteFilesParseResult 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.
QBasic.OnUserCreate (cyclomatic 19) src/qbasic/Program.vb:933— QBasic.OnUserCreate 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. This is NOT this file's highest cyclomatic complexity: QBasic.Menu_OnClick (cyclomatic 40) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Evaluator.EvaluateVariableExpression (cyclomatic 19) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3517— Evaluator.EvaluateVariableExpression 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.
WindowsAudio.StreamingLoop (cyclomatic 19) src/qbasic/QBLib/Audio/WindowsAudio.vb:294— WindowsAudio.StreamingLoop 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.
Extensions.IsNumeric (cyclomatic 18) src/qbasic/Basic/Extensions.vb:98— Extensions.IsNumeric 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.
Interactive.ExecuteCommon (cyclomatic 18) src/qbasic/Basic/Interactive/Interactive.vb:6646— Interactive.ExecuteCommon 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.
Interactive.ExecuteDim (cyclomatic 18) src/qbasic/Basic/Interactive/Interactive.vb:7328— Interactive.ExecuteDim 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.
Interactive.ExecuteFor (cyclomatic 18) src/qbasic/Basic/Interactive/Interactive.vb:7850— Interactive.ExecuteFor 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.
Conversion.Hex (cyclomatic 18) src/qbasic/Basic/VisualBasic/Conversion.vb:136— Conversion.Hex 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. This shape REPEATS in the file: one other method here (Conversion.Oct) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Conversion.Oct (cyclomatic 18) src/qbasic/Basic/VisualBasic/Conversion.vb:203— Conversion.Oct 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. This shape REPEATS in the file: one other method here (Conversion.Hex) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
WindowsFileSystem.Files (cyclomatic 18) src/qbasic/Implementation/WindowsFileSystem.vb:108— WindowsFileSystem.Files 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.
MessageDialog.ProcessKeys (cyclomatic 18) src/qbasic/MessageDialog.vb:53— MessageDialog.ProcessKeys 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.
QBasicToVbNetRewriter.ConvertPrintStatementUsingSyntax (cyclomatic 18) src/qbasic/QB/CodeAnalysis/Syntax/QBasicToVbNetRewriter.vb:588— QBasicToVbNetRewriter.ConvertPrintStatementUsingSyntax 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.
Video.WriteCharacter (cyclomatic 18) src/qbasic/QBLib/Video.vb:2276— Video.WriteCharacter 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. This is NOT this file's highest cyclomatic complexity: Video.PALETTE (cyclomatic 69) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Interactive.RealPath (cyclomatic 17) src/qbasic/Basic/Interactive/Interactive.vb:2152— Interactive.RealPath 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.
Interactive.ExecuteMultiplyDivide (cyclomatic 17) src/qbasic/Basic/Interactive/Interactive.vb:3098— Interactive.ExecuteMultiplyDivide 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.
Interactive.ExecuteDefStr (cyclomatic 17) src/qbasic/Basic/Interactive/Interactive.vb:7188— Interactive.ExecuteDefStr 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.
Interactive.ExecuteNextDecision (cyclomatic 17) src/qbasic/Basic/Interactive/Interactive.vb:8418— Interactive.ExecuteNextDecision 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.
Interactive.ExecuteOnErrorGoto (cyclomatic 17) src/qbasic/Basic/Interactive/Interactive.vb:11431— Interactive.ExecuteOnErrorGoto 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.
MainMenu.ProcessMouse (cyclomatic 17) src/qbasic/MainMenu.vb:136— MainMenu.ProcessMouse 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.
Binder.BindSubDeclaration (cyclomatic 17) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:399— Binder.BindSubDeclaration 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. This is NOT this file's highest cyclomatic complexity: Binder.BindStatementInternal (cyclomatic 115) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Binder.BindRedimStatement (cyclomatic 17) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2826— Binder.BindRedimStatement 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. This is NOT this file's highest cyclomatic complexity: Binder.BindStatementInternal (cyclomatic 115) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Evaluator.EvaluateSelectCaseStatement (cyclomatic 17) src/qbasic/QB/CodeAnalysis/Evaluator.vb:2194— Evaluator.EvaluateSelectCaseStatement 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.
Evaluator.FormatUsingOutput (cyclomatic 17) src/qbasic/QB/CodeAnalysis/Evaluator.vb:2461— Evaluator.FormatUsingOutput 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.
Evaluator.EvaluateWriteStatement (cyclomatic 17) src/qbasic/QB/CodeAnalysis/Evaluator.vb:2543— Evaluator.EvaluateWriteStatement 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.
Parser.ParsePrintStatement (cyclomatic 17) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:3001— Parser.ParsePrintStatement 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.
SyntaxNode.WriteNodeWithTrivia (cyclomatic 17) src/qbasic/QB/CodeAnalysis/Syntax/SyntaxNode.vb:419— SyntaxNode.WriteNodeWithTrivia 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.
Video.PRINT (cyclomatic 17) src/qbasic/QBLib/Video.vb:1192— Video.PRINT 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. This is NOT this file's highest cyclomatic complexity: Video.PALETTE (cyclomatic 69) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Display.InternalPrint (cyclomatic 16) src/qbasic/Basic/Display/Display.vb:4534— Display.InternalPrint 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.
Interactive.ThrowBasicError (cyclomatic 16) src/qbasic/Basic/Interactive/Interactive.vb:2012— Interactive.ThrowBasicError 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.
Interactive.FoundMatchingNext (cyclomatic 16) src/qbasic/Basic/Interactive/Interactive.vb:7920— Interactive.FoundMatchingNext 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. This shape REPEATS in the file: one other method here (Interactive.JumpToNext) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.JumpToNext (cyclomatic 16) src/qbasic/Basic/Interactive/Interactive.vb:8019— Interactive.JumpToNext 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. This shape REPEATS in the file: one other method here (Interactive.FoundMatchingNext) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Parser.ParseStatement (cyclomatic 16) src/qbasic/Basic/Parser/Parser.vb:207— Parser.ParseStatement 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.
DocumentPanel.TabAction (cyclomatic 16) src/qbasic/DocumentPanel.vb:1089— DocumentPanel.TabAction 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.
WindowsFileSystem.EnforceActualPath (cyclomatic 16) src/qbasic/Implementation/WindowsFileSystem.vb:876— WindowsFileSystem.EnforceActualPath 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.
QBasic.NewWndProc (cyclomatic 16) src/qbasic/Program.vb:1104— QBasic.NewWndProc 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. This is NOT this file's highest cyclomatic complexity: QBasic.Menu_OnClick (cyclomatic 40) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Binder.BindConversion (cyclomatic 16) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1264— Binder.BindConversion 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. This is NOT this file's highest cyclomatic complexity: Binder.BindStatementInternal (cyclomatic 115) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
BoundTreeRewriter.RewritePrintStatement (cyclomatic 16) src/qbasic/QB/CodeAnalysis/Binding/BoundTreeRewriter.vb:177— BoundTreeRewriter.RewritePrintStatement 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.
ControlFlowGraph.CountFunctionNameAssignments (cyclomatic 16) src/qbasic/QB/CodeAnalysis/Binding/ControlFlowGraph.vb:403— ControlFlowGraph.CountFunctionNameAssignments 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.
Evaluator.EvaluateDimStatement (cyclomatic 16) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3261— Evaluator.EvaluateDimStatement 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.
Parser.ParseOnStatement (cyclomatic 16) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:2548— Parser.ParseOnStatement 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.
Parser.ParseOpenStatement (cyclomatic 16) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:2703— Parser.ParseOpenStatement 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.
AudioDevice.EmitTone (cyclomatic 16) src/qbasic/QBLib/Audio/AudioDevice.vb:460— AudioDevice.EmitTone 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.
Video.POINT (cyclomatic 16) src/qbasic/QBLib/Video.vb:2335— Video.POINT 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. This is NOT this file's highest cyclomatic complexity: Video.PALETTE (cyclomatic 69) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
Repeated repair: src/qbasic/QB/CodeAnalysis/Lowering/Lowerer.vb src/qbasic/QB/CodeAnalysis/Lowering/Lowerer.vb:77— src/qbasic/QB/CodeAnalysis/Lowering/Lowerer.vb changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is Lowerer.RewriteIfStatement at line 77), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “More file io stuff; fixed some issues found in the process.”; “Fixed FOR issue.”; “Fixed stepper in FOR not working”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-01-17..2026-04-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-01-17 12:29:34 -05:00' --until='2026-04-17 12:29:34 -05:00' --full-history --no-merges -- src/qbasic/QB/CodeAnalysis/Lowering/Lowerer.vb`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
HackComment src/qbasic/Basic/Extensions.vb:409— 'HACK: to get same behavior as GW-BASIC, need to "confuse" things. — 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.
FixmeComment src/qbasic/Basic/VisualBasic/Conversion.vb:22— 'FIXME:ArgumentException 5 Number is not a numeric type. — 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.
D18 · Solution Shape· Solution references a project that does not exist · ×1
Solution references a project that does not exist src/QBasic.sln— `src/QBasic.sln` declares 1 project file(s) that are missing from the tree (`vbPixelGameEngine.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.
QBasic.OnUserUpdate (cognitive 931) src/qbasic/Program.vb:1176— QBasic.OnUserUpdate has cognitive complexity 931 (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.
Interactive.ExecutePrimary (cognitive 662) src/qbasic/Basic/Interactive/Interactive.vb:3199— Interactive.ExecutePrimary has cognitive complexity 662 (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.
Interactive.ProcessKeyInternal (cognitive 524) src/qbasic/Basic/Interactive/Interactive.vb:863— Interactive.ProcessKeyInternal has cognitive complexity 524 (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.
Evaluator.EvaluateStatement (cognitive 464) src/qbasic/QB/CodeAnalysis/Evaluator.vb:510— Evaluator.EvaluateStatement has cognitive complexity 464 (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.
Interactive.InteractiveProcessKey (cognitive 423) src/qbasic/Basic/Interactive/Interactive.vb:1119— Interactive.InteractiveProcessKey has cognitive complexity 423 (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.
Interactive.ExecuteGet (cognitive 376) src/qbasic/Basic/Interactive/Interactive.vb:8515— Interactive.ExecuteGet has cognitive complexity 376 (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.
Parser.PeekToken (cognitive 357) src/qbasic/Basic/Parser/Parser.vb:398— Parser.PeekToken has cognitive complexity 357 (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.
Evaluator.EvaluateCallExpression (cognitive 307) src/qbasic/QB/CodeAnalysis/Evaluator.vb:4192— Evaluator.EvaluateCallExpression has cognitive complexity 307 (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.
Interactive.ExecutePrint (cognitive 282) src/qbasic/Basic/Interactive/Interactive.vb:12312— Interactive.ExecutePrint has cognitive complexity 282 (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.
Interactive.ExecuteStringPrimary (cognitive 281) src/qbasic/Basic/Interactive/Interactive.vb:2308— Interactive.ExecuteStringPrimary has cognitive complexity 281 (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.
Interactive.ExecutePrintUsing (cognitive 280) src/qbasic/Basic/Interactive/Interactive.vb:12698— Interactive.ExecutePrintUsing has cognitive complexity 280 (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.
Evaluator.EvaluateBinaryExpression (cognitive 258) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3872— Evaluator.EvaluateBinaryExpression has cognitive complexity 258 (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.
Interactive.ExecutePut (cognitive 230) src/qbasic/Basic/Interactive/Interactive.vb:13632— Interactive.ExecutePut has cognitive complexity 230 (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.
ConstantFolding.Fold (cognitive 216) src/qbasic/QB/CodeAnalysis/Binding/ConstantFolding.vb:44— ConstantFolding.Fold has cognitive complexity 216 (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.
Evaluator.PlayCommand (cognitive 182) src/qbasic/QB/CodeAnalysis/Evaluator.vb:5804— Evaluator.PlayCommand has cognitive complexity 182 (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.
Interactive.InternalInputCompletedProcess (cognitive 176) src/qbasic/Basic/Interactive/Interactive.vb:17020— Interactive.InternalInputCompletedProcess has cognitive complexity 176 (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.
TextboxControl.OnKeyPress (cognitive 169) src/qbasic/Components/TextBoxControl.vb:37— TextboxControl.OnKeyPress has cognitive complexity 169 (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.
MainMenu.ProcessKeys (cognitive 159) src/qbasic/MainMenu.vb:195— MainMenu.ProcessKeys has cognitive complexity 159 (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.
OpenDialog.ProcessKeys (cognitive 156) src/qbasic/OpenDialog.vb:143— OpenDialog.ProcessKeys has cognitive complexity 156 (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.
Form.OnKeyPress (cognitive 138) src/qbasic/Components/Form.vb:51— Form.OnKeyPress has cognitive complexity 138 (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.
WindowsFileSystem.Input (cognitive 138) src/qbasic/Implementation/WindowsFileSystem.vb:195— WindowsFileSystem.Input has cognitive complexity 138 (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.
Interactive.ExecuteOpen (cognitive 134) src/qbasic/Basic/Interactive/Interactive.vb:11697— Interactive.ExecuteOpen has cognitive complexity 134 (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.
Interactive.ExecuteInput (cognitive 133) src/qbasic/Basic/Interactive/Interactive.vb:9910— Interactive.ExecuteInput has cognitive complexity 133 (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.
BoundBinaryOperator.Initialize (cognitive 130) src/qbasic/QB/CodeAnalysis/Binding/BoundBinaryOperator.vb:226— BoundBinaryOperator.Initialize has cognitive complexity 130 (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.
Interactive.ExecuteDraw (cognitive 120) src/qbasic/Basic/Interactive/Interactive.vb:18064— Interactive.ExecuteDraw has cognitive complexity 120 (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.
Display.RowCount.Set (cognitive 117) src/qbasic/Basic/Display/Display.vb:2487— Display.RowCount.Set has cognitive complexity 117 (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.
Interactive.ExecuteWidth (cognitive 115) src/qbasic/Basic/Interactive/Interactive.vb:16251— Interactive.ExecuteWidth has cognitive complexity 115 (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.
Video.LINE (cognitive 112) src/qbasic/QBLib/Video.vb:1611— Video.LINE has cognitive complexity 112 (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.
Interactive.InternalLoadCompleted (cognitive 111) src/qbasic/Basic/Interactive/Interactive.vb:6024— Interactive.InternalLoadCompleted has cognitive complexity 111 (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.
Evaluator.FormatNumericWithSpec (cognitive 107) src/qbasic/QB/CodeAnalysis/Evaluator.vb:2833— Evaluator.FormatNumericWithSpec has cognitive complexity 107 (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.
Interactive.ExecuteComparison (cognitive 106) src/qbasic/Basic/Interactive/Interactive.vb:2981— Interactive.ExecuteComparison has cognitive complexity 106 (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.
Interactive.ProcessInterpreter (cognitive 101) src/qbasic/Basic/Interactive/Interactive.vb:1415— Interactive.ProcessInterpreter has cognitive complexity 101 (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.
Interactive.ExecuteLet (cognitive 101) src/qbasic/Basic/Interactive/Interactive.vb:10284— Interactive.ExecuteLet has cognitive complexity 101 (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.
SaveAsDialog.ProcessKeys (cognitive 100) src/qbasic/SaveAsDialog.vb:130— SaveAsDialog.ProcessKeys has cognitive complexity 100 (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.
Interactive.ExecuteLineInput (cognitive 98) src/qbasic/Basic/Interactive/Interactive.vb:10668— Interactive.ExecuteLineInput has cognitive complexity 98 (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.
Conversion.Classify (cognitive 98) src/qbasic/QB/CodeAnalysis/Binding/Conversion.vb:27— Conversion.Classify has cognitive complexity 98 (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.
Decode.ProcessInternal (cognitive 97) src/qbasic/Basic/Tokenizer/Decode.vb:12— Decode.ProcessInternal has cognitive complexity 97 (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.
Lexer.ReadIdentifierOrKeyword (cognitive 93) src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:551— Lexer.ReadIdentifierOrKeyword 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.
Display.Paint (cognitive 90) src/qbasic/Basic/Display/Display.vb:1601— Display.Paint has cognitive complexity 90 (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.
QBasic.GetPressed (cognitive 82) src/qbasic/Program.vb:2160— QBasic.GetPressed 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.
Video.INKEY (cognitive 81) src/qbasic/QBLib/Video.vb:2095— Video.INKEY has cognitive complexity 81 (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.
Video.CIRCLE (cognitive 80) src/qbasic/QBLib/Video.vb:1341— Video.CIRCLE has cognitive complexity 80 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Interactive.ExecuteView (cognitive 78) src/qbasic/Basic/Interactive/Interactive.vb:15857— Interactive.ExecuteView 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.
Display.Circle (cognitive 77) src/qbasic/Basic/Display/Display.vb:1919— Display.Circle 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.
Display.Line (cognitive 77) src/qbasic/Basic/Display/Display.vb:2123— Display.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.
Video.CIRCLE (cognitive 77) src/qbasic.compatibility/Video.vb:1080— Video.CIRCLE 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.
Program.HandleCommandLineArguments (cognitive 75) src/qbasic/Program.vb:121— Program.HandleCommandLineArguments has cognitive complexity 75 (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.
Common.GetChar (cognitive 73) src/qbasic/Common.vb:66— Common.GetChar has cognitive complexity 73 (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.
Binder.BindCallExpression (cognitive 73) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:900— Binder.BindCallExpression has cognitive complexity 73 (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.
DocumentPanel.ProcessKeys (cognitive 72) src/qbasic/DocumentPanel.vb:258— DocumentPanel.ProcessKeys has cognitive complexity 72 (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.
Parser.ParseForStatement (cognitive 72) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:1537— Parser.ParseForStatement has cognitive complexity 72 (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.
Binder.BindMemberAccessExpression (cognitive 71) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1068— Binder.BindMemberAccessExpression has cognitive complexity 71 (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.
Video.InputAsync (cognitive 71) src/qbasic/QBLib/Video.vb:1815— Video.InputAsync has cognitive complexity 71 (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.
DocumentPanel.HandleSelection (cognitive 70) src/qbasic/DocumentPanel.vb:444— DocumentPanel.HandleSelection has cognitive complexity 70 (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.
Video.LineInputAsync (cognitive 70) src/qbasic.compatibility/Video.vb:1470— Video.LineInputAsync has cognitive complexity 70 (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. This shape REPEATS in the file: one other method here (Video.InputAsync) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Video.InputAsync (cognitive 70) src/qbasic.compatibility/Video.vb:1616— Video.InputAsync has cognitive complexity 70 (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. This shape REPEATS in the file: one other method here (Video.LineInputAsync) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.ExecuteKey (cognitive 68) src/qbasic/Basic/Interactive/Interactive.vb:10121— Interactive.ExecuteKey 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.
SavePrompt.ProcessKeys (cognitive 67) src/qbasic/SavePrompt.vb:64— SavePrompt.ProcessKeys has cognitive complexity 67 (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.
DocumentPanel.WordRightAction (cognitive 65) src/qbasic/DocumentPanel.vb:814— DocumentPanel.WordRightAction has cognitive complexity 65 (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.
GraphBuilder.Build (cognitive 65) src/qbasic/QB/CodeAnalysis/Binding/ControlFlowGraph.vb:163— GraphBuilder.Build has cognitive complexity 65 (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.
Interactive.ExecuteDim (cognitive 64) src/qbasic/Basic/Interactive/Interactive.vb:7328— Interactive.ExecuteDim 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.
Interactive.ExecuteDefInt (cognitive 63) src/qbasic/Basic/Interactive/Interactive.vb:6945— Interactive.ExecuteDefInt 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. This shape REPEATS in the file: 2 other methods here (Interactive.ExecuteDefSng, Interactive.ExecuteDefDbl) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.ExecuteDefSng (cognitive 63) src/qbasic/Basic/Interactive/Interactive.vb:7026— Interactive.ExecuteDefSng 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. This shape REPEATS in the file: 2 other methods here (Interactive.ExecuteDefInt, Interactive.ExecuteDefDbl) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.ExecuteDefDbl (cognitive 63) src/qbasic/Basic/Interactive/Interactive.vb:7107— Interactive.ExecuteDefDbl 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. This shape REPEATS in the file: 2 other methods here (Interactive.ExecuteDefInt, Interactive.ExecuteDefSng) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Binder.BindGlobalScope (cognitive 63) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:43— Binder.BindGlobalScope 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.
Interactive.ExecuteCommon (cognitive 62) src/qbasic/Basic/Interactive/Interactive.vb:6646— Interactive.ExecuteCommon 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.
Interactive.ExecuteOnErrorGoto (cognitive 61) src/qbasic/Basic/Interactive/Interactive.vb:11431— Interactive.ExecuteOnErrorGoto has cognitive complexity 61 (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.
Console.INKEY (cognitive 60) src/qbasic.compatibility/Console.vb:93— Console.INKEY 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.
Display.ColumnCount.Set (cognitive 58) src/qbasic/Basic/Display/Display.vb:2629— Display.ColumnCount.Set 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.
Interactive.ExecuteDef (cognitive 58) src/qbasic/Basic/Interactive/Interactive.vb:6834— Interactive.ExecuteDef 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.
Interactive.ExecuteChain (cognitive 55) src/qbasic/Basic/Interactive/Interactive.vb:5837— Interactive.ExecuteChain 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.
DocumentPanel.Render (cognitive 55) src/qbasic/DocumentPanel.vb:145— DocumentPanel.Render 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.
Display.Paint (cognitive 55) src/qbasic/Implementation/Display.vb:33— Display.Paint 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.
Evaluator.EvaluateArrayAccessExpressionForAssignment (cognitive 54) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3732— Evaluator.EvaluateArrayAccessExpressionForAssignment has cognitive complexity 54 (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.
Interactive.ExecutePaint (cognitive 53) src/qbasic/Basic/Interactive/Interactive.vb:11986— Interactive.ExecutePaint has cognitive complexity 53 (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.
Interactive.ExecuteDefStr (cognitive 52) src/qbasic/Basic/Interactive/Interactive.vb:7188— Interactive.ExecuteDefStr 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.
Interactive.ExecuteOn (cognitive 52) src/qbasic/Basic/Interactive/Interactive.vb:11312— Interactive.ExecuteOn 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.
SyntaxNode.PrettyPrint2 (cognitive 52) src/qbasic/QB/CodeAnalysis/Syntax/SyntaxNode.vb:290— SyntaxNode.PrettyPrint2 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.
WindowsAudio.StreamingLoop (cognitive 52) src/qbasic/QBLib/Audio/WindowsAudio.vb:294— WindowsAudio.StreamingLoop 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.
Interactive.FoundMatchingNext (cognitive 51) src/qbasic/Basic/Interactive/Interactive.vb:7920— Interactive.FoundMatchingNext has cognitive complexity 51 (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. This shape REPEATS in the file: one other method here (Interactive.JumpToNext) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.JumpToNext (cognitive 51) src/qbasic/Basic/Interactive/Interactive.vb:8019— Interactive.JumpToNext has cognitive complexity 51 (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. This shape REPEATS in the file: one other method here (Interactive.FoundMatchingNext) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Binder.BindIdentifierExpression (cognitive 51) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1920— Binder.BindIdentifierExpression has cognitive complexity 51 (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.
Evaluator.EvaluateArrayAccessExpression (cognitive 50) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3632— Evaluator.EvaluateArrayAccessExpression 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.
Interactive.ExecuteFor (cognitive 48) src/qbasic/Basic/Interactive/Interactive.vb:7850— Interactive.ExecuteFor has cognitive complexity 48 (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.
Interactive.ExecuteLine (cognitive 48) src/qbasic/Basic/Interactive/Interactive.vb:10427— Interactive.ExecuteLine has cognitive complexity 48 (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.
SyntaxNode.WriteNodeWithTrivia (cognitive 48) src/qbasic/QB/CodeAnalysis/Syntax/SyntaxNode.vb:419— SyntaxNode.WriteNodeWithTrivia has cognitive complexity 48 (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.
Display.Pset (cognitive 47) src/qbasic/Basic/Display/Display.vb:2231— Display.Pset 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.
Display.Color (cognitive 47) src/qbasic/Basic/Display/Display.vb:3982— Display.Color 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.
Interactive.ExecuteMid (cognitive 47) src/qbasic/Basic/Interactive/Interactive.vb:11078— Interactive.ExecuteMid 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.
DocumentPanel.TabAction (cognitive 47) src/qbasic/DocumentPanel.vb:1089— DocumentPanel.TabAction 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.
Evaluator.Assign (cognitive 47) src/qbasic/QB/CodeAnalysis/Evaluator.vb:4909— Evaluator.Assign 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.
MainMenu.Render (cognitive 46) src/qbasic/MainMenu.vb:54— MainMenu.Render has cognitive complexity 46 (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.
Binder.BindInputStatement (cognitive 46) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1575— Binder.BindInputStatement has cognitive complexity 46 (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.
InternalPage.SetPalette (cognitive 45) src/qbasic/Basic/Display/Display.vb:543— InternalPage.SetPalette has cognitive complexity 45 (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.
Interactive.FormatNumber (cognitive 45) src/qbasic/Basic/Interactive/Interactive.vb:13076— Interactive.FormatNumber has cognitive complexity 45 (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.
Binder.BindTypeStatement (cognitive 45) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2345— Binder.BindTypeStatement has cognitive complexity 45 (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.
Video.WriteCharacter (cognitive 45) src/qbasic/QBLib/Video.vb:2276— Video.WriteCharacter has cognitive complexity 45 (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.
Interactive.ExecuteFunction (cognitive 44) src/qbasic/Basic/Interactive/Interactive.vb:4198— Interactive.ExecuteFunction 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. This shape REPEATS in the file: one other method here (Interactive.ExecuteStringFunction) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.ExecuteStringFunction (cognitive 44) src/qbasic/Basic/Interactive/Interactive.vb:4386— Interactive.ExecuteStringFunction 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. This shape REPEATS in the file: one other method here (Interactive.ExecuteFunction) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.ExecutePoke (cognitive 44) src/qbasic/Basic/Interactive/Interactive.vb:12190— Interactive.ExecutePoke 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.
Parser.ScanParse (cognitive 44) src/qbasic/Basic/Parser/Parser.vb:82— Parser.ScanParse 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.
SyntaxNode.PrettyPrint (cognitive 44) src/qbasic/QB/CodeAnalysis/Syntax/SyntaxNode.vb:202— SyntaxNode.PrettyPrint 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.
Interactive.ExecuteIf (cognitive 42) src/qbasic/Basic/Interactive/Interactive.vb:9584— Interactive.ExecuteIf 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.
Interactive.ExecuteRandomize (cognitive 42) src/qbasic/Basic/Interactive/Interactive.vb:14092— Interactive.ExecuteRandomize 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.
Interactive.ExecuteWindow (cognitive 42) src/qbasic/Basic/Interactive/Interactive.vb:16431— Interactive.ExecuteWindow 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.
Binder.BindVariableReference (cognitive 42) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:3156— Binder.BindVariableReference 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.
Evaluator.EvaluateVariableExpression (cognitive 42) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3517— Evaluator.EvaluateVariableExpression 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.
Interactive.ExecuteClear (cognitive 41) src/qbasic/Basic/Interactive/Interactive.vb:6373— Interactive.ExecuteClear has cognitive complexity 41 (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.
MainMenu.ProcessMouse (cognitive 41) src/qbasic/MainMenu.vb:136— MainMenu.ProcessMouse has cognitive complexity 41 (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.
Evaluator.EvaluateEraseStatement (cognitive 41) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3384— Evaluator.EvaluateEraseStatement has cognitive complexity 41 (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.
IndentedSyntaxWriter.RewriteGotoGosubUsingSyntaxTree (cognitive 41) src/qbasic/QB/CodeAnalysis/Syntax/GwBasicToQBasicRewriter.vb:229— IndentedSyntaxWriter.RewriteGotoGosubUsingSyntaxTree has cognitive complexity 41 (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.
WelcomeDialog.ProcessKeys (cognitive 40) src/qbasic/WelcomeDialog.vb:62— WelcomeDialog.ProcessKeys 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.
WindowsFileSystem.Files (cognitive 39) src/qbasic/Implementation/WindowsFileSystem.vb:108— WindowsFileSystem.Files has cognitive complexity 39 (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.
Evaluator.EvaluateWriteStatement (cognitive 39) src/qbasic/QB/CodeAnalysis/Evaluator.vb:2543— Evaluator.EvaluateWriteStatement has cognitive complexity 39 (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.
Evaluator.ParseNumericFormat (cognitive 39) src/qbasic/QB/CodeAnalysis/Evaluator.vb:2710— Evaluator.ParseNumericFormat has cognitive complexity 39 (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.
Lexer.ReadNumberToken (cognitive 39) src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:306— Lexer.ReadNumberToken has cognitive complexity 39 (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.
Display.InternalPrint (cognitive 38) src/qbasic/Basic/Display/Display.vb:4534— Display.InternalPrint has cognitive complexity 38 (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.
Interactive.ExecuteLocate (cognitive 38) src/qbasic/Basic/Interactive/Interactive.vb:10530— Interactive.ExecuteLocate has cognitive complexity 38 (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.
DocumentPanel.WordLeftAction (cognitive 38) src/qbasic/DocumentPanel.vb:746— DocumentPanel.WordLeftAction has cognitive complexity 38 (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.
Binder.BindSubDeclaration (cognitive 38) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:399— Binder.BindSubDeclaration has cognitive complexity 38 (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.
Binder.BindRedimStatement (cognitive 38) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2826— Binder.BindRedimStatement has cognitive complexity 38 (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.
Evaluator.EvaluateDimStatement (cognitive 38) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3261— Evaluator.EvaluateDimStatement has cognitive complexity 38 (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.
Interactive.ExecuteCircle (cognitive 37) src/qbasic/Basic/Interactive/Interactive.vb:6254— Interactive.ExecuteCircle has cognitive complexity 37 (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.
Interactive.ExecuteNext (cognitive 37) src/qbasic/Basic/Interactive/Interactive.vb:8185— Interactive.ExecuteNext has cognitive complexity 37 (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.
Evaluator.Assign (cognitive 36) src/qbasic/QB/CodeAnalysis/Evaluator.vb:4994— Evaluator.Assign 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.
Interactive.ExecuteErase (cognitive 34) src/qbasic/Basic/Interactive/Interactive.vb:7567— Interactive.ExecuteErase 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.
Interactive.ExecuteNextDecision (cognitive 34) src/qbasic/Basic/Interactive/Interactive.vb:8418— Interactive.ExecuteNextDecision 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.
Interactive.GotoLabelOrLineNumber (cognitive 34) src/qbasic/Basic/Interactive/Interactive.vb:9282— Interactive.GotoLabelOrLineNumber 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.
HorizontalListboxControl.OnKeyPress (cognitive 34) src/qbasic/Components/HorizontalListBoxControl.vb:38— HorizontalListboxControl.OnKeyPress 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.
Evaluator.EvaluateKeyStatement (cognitive 34) src/qbasic/QB/CodeAnalysis/Evaluator.vb:1739— Evaluator.EvaluateKeyStatement 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.
Evaluator.EvaluateConversionExpression (cognitive 34) src/qbasic/QB/CodeAnalysis/Evaluator.vb:4866— Evaluator.EvaluateConversionExpression 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.
Interactive.ExecuteMultiplyDivide (cognitive 33) src/qbasic/Basic/Interactive/Interactive.vb:3098— Interactive.ExecuteMultiplyDivide has cognitive complexity 33 (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.
Interactive.ExecuteRead (cognitive 33) src/qbasic/Basic/Interactive/Interactive.vb:14199— Interactive.ExecuteRead has cognitive complexity 33 (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.
Interactive.ExecuteScreen (cognitive 33) src/qbasic/Basic/Interactive/Interactive.vb:15053— Interactive.ExecuteScreen has cognitive complexity 33 (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.
Interactive.InternalReadCompletedProcess (cognitive 33) src/qbasic/Basic/Interactive/Interactive.vb:17397— Interactive.InternalReadCompletedProcess has cognitive complexity 33 (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.
Evaluator.EvaluateOpenStatement (cognitive 33) src/qbasic/QB/CodeAnalysis/Evaluator.vb:5067— Evaluator.EvaluateOpenStatement has cognitive complexity 33 (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.
Interactive.ThrowBasicError (cognitive 32) src/qbasic/Basic/Interactive/Interactive.vb:2012— Interactive.ThrowBasicError 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.
Interactive.RealPath (cognitive 32) src/qbasic/Basic/Interactive/Interactive.vb:2152— Interactive.RealPath 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.
Evaluator.FormatUsingOutput (cognitive 32) src/qbasic/QB/CodeAnalysis/Evaluator.vb:2461— Evaluator.FormatUsingOutput 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.
AboutDialog.ProcessKeys (cognitive 31) src/qbasic/AboutDialog.vb:57— AboutDialog.ProcessKeys 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.
Interactive.FoundMatchingWend (cognitive 31) src/qbasic/Basic/Interactive/Interactive.vb:16125— Interactive.FoundMatchingWend 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. This shape REPEATS in the file: one other method here (Interactive.JumpToWend) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.JumpToWend (cognitive 31) src/qbasic/Basic/Interactive/Interactive.vb:16188— Interactive.JumpToWend 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. This shape REPEATS in the file: one other method here (Interactive.FoundMatchingWend) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.InternalOpen (cognitive 31) src/qbasic/Basic/Interactive/Interactive.vb:16762— Interactive.InternalOpen 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.
CsvSplit.CsvSplit (cognitive 31) src/qbasic/Basic/Utils/CsvSplit.vb:184— CsvSplit.CsvSplit 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.
ChangeDialog.ProcessKeys (cognitive 31) src/qbasic/ChangeDialog.vb:90— ChangeDialog.ProcessKeys 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.
DisplayDialog.ProcessKeys (cognitive 31) src/qbasic/DisplayDialog.vb:143— DisplayDialog.ProcessKeys 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.
FindDialog.ProcessKeys (cognitive 31) src/qbasic/FindDialog.vb:74— FindDialog.ProcessKeys 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.
HelpPathDialog.ProcessKeys (cognitive 31) src/qbasic/HelpPathDialog.vb:61— HelpPathDialog.ProcessKeys 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.
NewFunctionDialog.ProcessKeys (cognitive 31) src/qbasic/NewFunctionDialog.vb:69— NewFunctionDialog.ProcessKeys 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.
NewSubDialog.ProcessKeys (cognitive 31) src/qbasic/NewSubDialog.vb:69— NewSubDialog.ProcessKeys 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.
PrintDialog.ProcessKeys (cognitive 31) src/qbasic/PrintDialog.vb:79— PrintDialog.ProcessKeys 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.
Parser.ParseSelectCaseStatement (cognitive 31) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:3562— Parser.ParseSelectCaseStatement 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.
Video.PRINT (cognitive 31) src/qbasic/QBLib/Video.vb:1192— Video.PRINT 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.
SubsDialog.ProcessKeys (cognitive 31) src/qbasic/SubsDialog.vb:91— SubsDialog.ProcessKeys 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.
SyntaxTreeForm.PopulateTreeview (cognitive 31) src/vbcompare/SyntaxTreeForm.vb:101— SyntaxTreeForm.PopulateTreeview 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.
Display.EditKeyPress (cognitive 30) src/qbasic/Basic/Display/Display.vb:4999— Display.EditKeyPress 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.
Interactive.ParseValue (cognitive 30) src/qbasic/Basic/Interactive/Interactive.vb:18390— Interactive.ParseValue 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.
Display.WriteCharacter (cognitive 29) src/qbasic/Basic/Display/Display.vb:3435— Display.WriteCharacter has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Interactive.InitArray (cognitive 29) src/qbasic/Basic/Interactive/Interactive.vb:7452— Interactive.InitArray has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
WindowsFileSystem.CsvSplit (cognitive 29) src/qbasic/Implementation/WindowsFileSystem.vb:416— WindowsFileSystem.CsvSplit has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Binder.BindPrintStatement (cognitive 29) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2095— Binder.BindPrintStatement has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Display.SetPalette (cognitive 28) src/qbasic/Basic/Display/Display.vb:4409— Display.SetPalette 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.
Interactive.InternalClose (cognitive 27) src/qbasic/Basic/Interactive/Interactive.vb:5770— Interactive.InternalClose 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.
Interactive.ExecuteFilesParseResult (cognitive 27) src/qbasic/Basic/Interactive/Interactive.vb:7730— Interactive.ExecuteFilesParseResult 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.
Interactive.ExecuteOnKey (cognitive 27) src/qbasic/Basic/Interactive/Interactive.vb:11520— Interactive.ExecuteOnKey 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. This shape REPEATS in the file: one other method here (Interactive.ExecuteOnTimer) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.ExecuteOnTimer (cognitive 27) src/qbasic/Basic/Interactive/Interactive.vb:11563— Interactive.ExecuteOnTimer 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. This shape REPEATS in the file: one other method here (Interactive.ExecuteOnKey) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.ExecuteOption (cognitive 27) src/qbasic/Basic/Interactive/Interactive.vb:11923— Interactive.ExecuteOption 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.
MessageDialog.ProcessKeys (cognitive 27) src/qbasic/MessageDialog.vb:53— MessageDialog.ProcessKeys 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.
Evaluator.EvaluateIfStatement (cognitive 27) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3165— Evaluator.EvaluateIfStatement 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.
Parser.ParseOnStatement (cognitive 27) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:2548— Parser.ParseOnStatement 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.
SyntaxNode.GetChildren (cognitive 27) src/qbasic/QB/CodeAnalysis/Syntax/SyntaxNode.vb:135— SyntaxNode.GetChildren 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.
Display.Screen (cognitive 26) src/qbasic/Basic/Display/Display.vb:2752— Display.Screen 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.
ListboxControl.OnKeyPress (cognitive 26) src/qbasic/Components/ListBoxControl.vb:35— ListboxControl.OnKeyPress 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.
Binder.BindDimStatement (cognitive 25) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2736— Binder.BindDimStatement 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.
Evaluator.CheckKeyPressed (cognitive 25) src/qbasic/QB/CodeAnalysis/Evaluator.vb:1970— Evaluator.CheckKeyPressed 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.
Evaluator.EvaluateSelectCaseStatement (cognitive 25) src/qbasic/QB/CodeAnalysis/Evaluator.vb:2194— Evaluator.EvaluateSelectCaseStatement 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.
QBasicToVbNetRewriter.ConvertPrintStatementUsingSyntax (cognitive 25) src/qbasic/QB/CodeAnalysis/Syntax/QBasicToVbNetRewriter.vb:588— QBasicToVbNetRewriter.ConvertPrintStatementUsingSyntax 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.
Interactive.ExecuteResume (cognitive 24) src/qbasic/Basic/Interactive/Interactive.vb:14610— Interactive.ExecuteResume 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.
BoundLiteralExpression.New.ctor (cognitive 24) src/qbasic/QB/CodeAnalysis/Binding/BoundLiteralExpression.vb:8— BoundLiteralExpression.New.ctor 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.
Interactive.InternalGetBounds (cognitive 23) src/qbasic/Basic/Interactive/Interactive.vb:4536— Interactive.InternalGetBounds 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.
Interactive.ExecuteOnPen (cognitive 23) src/qbasic/Basic/Interactive/Interactive.vb:11607— Interactive.ExecuteOnPen 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.
DocumentPanel.InsertAction (cognitive 23) src/qbasic/DocumentPanel.vb:1009— DocumentPanel.InsertAction 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.
Program.Main (cognitive 23) src/qbasic/Program.vb:67— 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.
QBasic.OnUserCreate (cognitive 23) src/qbasic/Program.vb:933— QBasic.OnUserCreate 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.
Binder.BindFieldStatement (cognitive 23) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1406— Binder.BindFieldStatement 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.
Parser.ParseLineStatement (cognitive 23) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:2246— Parser.ParseLineStatement 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.
AudioDevice.EmitTone (cognitive 23) src/qbasic/QBLib/Audio/AudioDevice.vb:460— AudioDevice.EmitTone 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.
Interactive.ExecuteClose (cognitive 22) src/qbasic/Basic/Interactive/Interactive.vb:5705— Interactive.ExecuteClose 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.
Interactive.ExecuteField (cognitive 22) src/qbasic/Basic/Interactive/Interactive.vb:7649— Interactive.ExecuteField 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.
Interactive.ExecuteShell (cognitive 22) src/qbasic/Basic/Interactive/Interactive.vb:15458— Interactive.ExecuteShell 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.
Interactive.ExecuteSwap (cognitive 22) src/qbasic/Basic/Interactive/Interactive.vb:15633— Interactive.ExecuteSwap 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.
Program.WriteNodeWithTrivia (cognitive 22) src/qbasic/Program.vb:478— Program.WriteNodeWithTrivia 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.
QBasic.NewWndProc (cognitive 22) src/qbasic/Program.vb:1104— QBasic.NewWndProc 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.
Binder.BindDefTypeStatement (cognitive 22) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2292— Binder.BindDefTypeStatement 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.
BoundConversionExpression.New.ctor (cognitive 22) src/qbasic/QB/CodeAnalysis/Binding/BoundConversionExpression.vb:10— BoundConversionExpression.New.ctor 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.
BoundTreeRewriter.RewritePrintStatement (cognitive 22) src/qbasic/QB/CodeAnalysis/Binding/BoundTreeRewriter.vb:177— BoundTreeRewriter.RewritePrintStatement 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.
Evaluator.EmitPlayNote (cognitive 22) src/qbasic/QB/CodeAnalysis/Evaluator.vb:6081— Evaluator.EmitPlayNote 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.
Parser.ParseStatement (cognitive 22) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:127— Parser.ParseStatement 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.
Interactive.ProcessCommand (cognitive 21) src/qbasic/Basic/Interactive/Interactive.vb:1673— Interactive.ProcessCommand 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.
Interactive.ExecuteColor (cognitive 21) src/qbasic/Basic/Interactive/Interactive.vb:6480— Interactive.ExecuteColor 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.
Interactive.ExecutePreset (cognitive 21) src/qbasic/Basic/Interactive/Interactive.vb:12258— Interactive.ExecutePreset 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. This shape REPEATS in the file: one other method here (Interactive.ExecutePset) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.ExecutePset (cognitive 21) src/qbasic/Basic/Interactive/Interactive.vb:13578— Interactive.ExecutePset 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. This shape REPEATS in the file: one other method here (Interactive.ExecutePreset) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.SetNumericVariable (cognitive 21) src/qbasic/Basic/Interactive/Interactive.vb:16605— Interactive.SetNumericVariable 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.
Parser.FindEndOfStatement (cognitive 21) src/qbasic/Basic/Parser/Parser.vb:970— Parser.FindEndOfStatement 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.
DocumentPanel.DeleteRestOfWordAction (cognitive 21) src/qbasic/DocumentPanel.vb:982— DocumentPanel.DeleteRestOfWordAction 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.
HelpDialog.ProcessKeys (cognitive 21) src/qbasic/HelpDialog.vb:84— HelpDialog.ProcessKeys 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.
QBasic.MakeExeFileFbcAction (cognitive 21) src/qbasic/Program.vb:2674— QBasic.MakeExeFileFbcAction 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.
Binder.BindSingleLineIfStatement (cognitive 21) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2552— Binder.BindSingleLineIfStatement 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.
Evaluator.ParsePrintUsingFormat (cognitive 21) src/qbasic/QB/CodeAnalysis/Evaluator.vb:2631— Evaluator.ParsePrintUsingFormat 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.
Parser.New.ctor (cognitive 21) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:19— Parser.New.ctor 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.
Video.POINT (cognitive 21) src/qbasic/QBLib/Video.vb:2335— Video.POINT 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.
Interactive.ExecuteKill (cognitive 20) src/qbasic/Basic/Interactive/Interactive.vb:10233— Interactive.ExecuteKill 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.
Interactive.PullNumericFormat (cognitive 20) src/qbasic/Basic/Interactive/Interactive.vb:12647— Interactive.PullNumericFormat 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.
Interactive.ExecuteSound (cognitive 20) src/qbasic/Basic/Interactive/Interactive.vb:15556— Interactive.ExecuteSound 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.
Binder.BindConstStatement (cognitive 20) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2774— Binder.BindConstStatement 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.
BoundScope.TryLookupFunctionByNameAndArityPreferSpecific (cognitive 20) src/qbasic/QB/CodeAnalysis/Binding/BoundScope.vb:159— BoundScope.TryLookupFunctionByNameAndArityPreferSpecific 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.
ConstantFolding.ComputeConstant (cognitive 20) src/qbasic/QB/CodeAnalysis/Binding/ConstantFolding.vb:7— ConstantFolding.ComputeConstant 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.
TypeSymbol.TypeSymbolToType (cognitive 20) src/qbasic/QB/CodeAnalysis/Symbols/TypeSymbol.vb:29— TypeSymbol.TypeSymbolToType 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.
Video.WriteCharacter (cognitive 20) src/qbasic.compatibility/Video.vb:2109— Video.WriteCharacter 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.
SoundGenerator.InternalNew (cognitive 19) src/qbasic/Basic/Audio/SoundGenerator.vb:33— 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.
Interactive.InsertUpdateSourceLine (cognitive 19) src/qbasic/Basic/Interactive/Interactive.vb:1836— Interactive.InsertUpdateSourceLine 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.
Interactive.ExecuteLock (cognitive 19) src/qbasic/Basic/Interactive/Interactive.vb:10613— Interactive.ExecuteLock 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. This shape REPEATS in the file: one other method here (Interactive.ExecuteUnlock) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.ExecuteUnlock (cognitive 19) src/qbasic/Basic/Interactive/Interactive.vb:15790— Interactive.ExecuteUnlock 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. This shape REPEATS in the file: one other method here (Interactive.ExecuteLock) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.ExecuteWrite (cognitive 19) src/qbasic/Basic/Interactive/Interactive.vb:16500— Interactive.ExecuteWrite 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.
MkCv.CVS (cognitive 19) src/qbasic/Basic/VisualBasic/MKI.vb:46— MkCv.CVS 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. This shape REPEATS in the file: one other method here (MkCv.CVD) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
MkCv.CVD (cognitive 19) src/qbasic/Basic/VisualBasic/MKI.vb:122— MkCv.CVD 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. This shape REPEATS in the file: one other method here (MkCv.CVS) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Binder.BindLetStatement (cognitive 19) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1674— Binder.BindLetStatement 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.
Binder.BindReturnStatement (cognitive 19) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2483— Binder.BindReturnStatement 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.
Evaluator.EvaluateRestoreStatement (cognitive 19) src/qbasic/QB/CodeAnalysis/Evaluator.vb:1446— Evaluator.EvaluateRestoreStatement 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.
Evaluator.EvaluateHandlePrintStatement (cognitive 19) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3098— Evaluator.EvaluateHandlePrintStatement 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.
Parser.ParseOpenStatement (cognitive 19) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:2703— Parser.ParseOpenStatement 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.
Core.CVDMBF (cognitive 19) src/qbasic/QBLib/Core.vb:750— Core.CVDMBF 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.
Devices.CVS (cognitive 19) src/qbasic.compatibility/Devices.vb:52— Devices.CVS 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. This shape REPEATS in the file: one other method here (Devices.CVD) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Devices.CVD (cognitive 19) src/qbasic.compatibility/Devices.vb:128— Devices.CVD 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. This shape REPEATS in the file: one other method here (Devices.CVS) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Interactive.ExecuteExponentation (cognitive 18) src/qbasic/Basic/Interactive/Interactive.vb:3166— Interactive.ExecuteExponentation 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.
Interactive.InternalPut (cognitive 18) src/qbasic/Basic/Interactive/Interactive.vb:17468— Interactive.InternalPut 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.
Form.OnDraw (cognitive 18) src/qbasic/Components/Form.vb:162— Form.OnDraw 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.
HorizontalListboxControl.OnDraw (cognitive 18) src/qbasic/Components/HorizontalListBoxControl.vb:103— HorizontalListboxControl.OnDraw 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.
WindowsFileSystem.EnforceActualPath (cognitive 18) src/qbasic/Implementation/WindowsFileSystem.vb:876— WindowsFileSystem.EnforceActualPath 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.
Binder.BindEraseStatement (cognitive 18) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:2905— Binder.BindEraseStatement 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.
JsEmitter.EmitBinaryExpression (cognitive 18) src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:334— JsEmitter.EmitBinaryExpression 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.
MsilEmitter.Emit_ResolveMethod (cognitive 18) src/qbasic/QB/CodeAnalysis/Emit/MsilEmitter.vb:651— MsilEmitter.Emit_ResolveMethod 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.
Evaluator.Evaluate (cognitive 18) src/qbasic/QB/CodeAnalysis/Evaluator.vb:471— Evaluator.Evaluate 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.
Evaluator.EvaluateRedimStatement (cognitive 18) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3347— Evaluator.EvaluateRedimStatement 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.
Evaluator.EvaluatePrintFileStatement (cognitive 18) src/qbasic/QB/CodeAnalysis/Evaluator.vb:5377— Evaluator.EvaluatePrintFileStatement 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.
Core.CVSMBF (cognitive 18) src/qbasic/QBLib/Core.vb:560— Core.CVSMBF 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.
Display.CheckPointBoundary (cognitive 17) src/qbasic/Basic/Display/Display.vb:1795— Display.CheckPointBoundary 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.
Interactive.PrepareData (cognitive 17) src/qbasic/Basic/Interactive/Interactive.vb:14912— Interactive.PrepareData 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.
Interactive.ExecuteViewPrint (cognitive 17) src/qbasic/Basic/Interactive/Interactive.vb:15967— Interactive.ExecuteViewPrint 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.
Interactive.InternalProcessText (cognitive 17) src/qbasic/Basic/Interactive/Interactive.vb:18676— Interactive.InternalProcessText 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.
Common.QInstrB (cognitive 17) src/qbasic/Common.vb:467— Common.QInstrB 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.
DocumentPanel.RemoveBlock (cognitive 17) src/qbasic/DocumentPanel.vb:418— DocumentPanel.RemoveBlock 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.
MsilEmitter.EmitBinaryExpression (cognitive 17) src/qbasic/QB/CodeAnalysis/Emit/MsilEmitter.vb:219— MsilEmitter.EmitBinaryExpression 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.
VbEmitter.EmitBinaryExpression (cognitive 17) src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb:237— VbEmitter.EmitBinaryExpression 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.
Evaluator.EvaluateGetFileStatement (cognitive 17) src/qbasic/QB/CodeAnalysis/Evaluator.vb:5474— Evaluator.EvaluateGetFileStatement 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.
Lowerer.RewriteIfStatement (cognitive 17) src/qbasic/QB/CodeAnalysis/Lowering/Lowerer.vb:77— Lowerer.RewriteIfStatement 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.
Lexer.ReadTrivia (cognitive 17) src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:83— Lexer.ReadTrivia 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.
Parser.ParseInputStatement (cognitive 17) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:2067— Parser.ParseInputStatement 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.
QBasicToVbNetRewriter.AnalyzeCompilationUnit (cognitive 17) src/qbasic/QB/CodeAnalysis/Syntax/QBasicToVbNetRewriter.vb:75— QBasicToVbNetRewriter.AnalyzeCompilationUnit 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.
QBasicToVbNetRewriter.ConvertPrintNodesToConsoleCalls (cognitive 17) src/qbasic/QB/CodeAnalysis/Syntax/QBasicToVbNetRewriter.vb:246— QBasicToVbNetRewriter.ConvertPrintNodesToConsoleCalls 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.
Interactive.CheckLoopStacksBeforeReturn (cognitive 16) src/qbasic/Basic/Interactive/Interactive.vb:9413— Interactive.CheckLoopStacksBeforeReturn 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.
Interactive.GetLabelList (cognitive 16) src/qbasic/Basic/Interactive/Interactive.vb:11665— Interactive.GetLabelList 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.
Interactive.ExecutePalette (cognitive 16) src/qbasic/Basic/Interactive/Interactive.vb:12098— Interactive.ExecutePalette 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.
WindowsFileSystem.Write (cognitive 16) src/qbasic/Implementation/WindowsFileSystem.vb:814— WindowsFileSystem.Write 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.
Program.HandleRoundtripMode (cognitive 16) src/qbasic/Program.vb:423— Program.HandleRoundtripMode 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.
Binder.BindDefDeclaration (cognitive 16) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:506— Binder.BindDefDeclaration 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.
ControlFlowGraph.CountFunctionNameAssignments (cognitive 16) src/qbasic/QB/CodeAnalysis/Binding/ControlFlowGraph.vb:403— ControlFlowGraph.CountFunctionNameAssignments 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.
Compilation.GetSymbols (cognitive 16) src/qbasic/QB/CodeAnalysis/Compilation.vb:119— Compilation.GetSymbols 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.
Evaluator.EvaluateForStatement (cognitive 16) src/qbasic/QB/CodeAnalysis/Evaluator.vb:1352— Evaluator.EvaluateForStatement 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.
Parser.ParseIfStatement (cognitive 16) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:1937— Parser.ParseIfStatement 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.
Interpreter.Run (cognitive 16) src/qbasic/QB/Interpreter.vb:119— Interpreter.Run 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.
WindowsAudio.GenerateBuffer (cognitive 16) src/qbasic/QBLib/Audio/WindowsAudio.vb:380— WindowsAudio.GenerateBuffer 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.
Near-duplicate member pair (88 shared lines) src/qbasic/Basic/Interactive/Interactive.vb:7922— src/qbasic/Basic/Interactive/Interactive.vb:7922-8015 | src/qbasic/Basic/Interactive/Interactive.vb:8021-8116 — These two members are variants of one another: 88 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Edited copy of a member (92 corresponding lines) · ×1
Edited copy of a member (92 corresponding lines) src/qbasic/QB/CodeAnalysis/Evaluator.vb:3633— src/qbasic/QB/CodeAnalysis/Evaluator.vb:3633-3729 | src/qbasic/QB/CodeAnalysis/Evaluator.vb:3733-3836 — These two members are one piece of code written twice and then edited apart: 92 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) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:468— src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:468-502 | src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:508-544 — 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 (16 corresponding lines) · ×1
Edited copy of a member (16 corresponding lines) src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:463— src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:463-481 | src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb:360-384 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Members sharing a duplicated core (14 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (14 members, 50+ identical tokens) src/qbasic/AboutDialog.vb:66— src/qbasic/AboutDialog.vb:66-96 | src/qbasic/ChangeDialog.vb:99-129 | src/qbasic/DisplayDialog.vb:152-182 | src/qbasic/FindDialog.vb:83-113 | src/qbasic/HelpPathDialog.vb:70-100 | src/qbasic/MessageDialog.vb:62-90 | src/qbasic/NewFunctionDialog.vb:78-108 | src/qbasic/NewSubDialog.vb:78-108 | src/qbasic/OpenDialog.vb:152-251 | src/qbasic/PrintDialog.vb:88-118 | src/qbasic/SaveAsDialog.vb:139-212 | src/qbasic/SavePrompt.vb:73-114 | src/qbasic/SubsDialog.vb:100-130 | src/qbasic/WelcomeDialog.vb:71-101 — These 14 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 14 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 14 times.
D4 · Code Duplication· Members sharing a duplicated core (6 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (6 members, 50+ identical tokens) src/qbasic/NewFunctionDialog.vb:24— src/qbasic/NewFunctionDialog.vb:24-58 | src/qbasic/NewSubDialog.vb:24-58 | src/qbasic/OpenDialog.vb:40-121 | src/qbasic/PrintDialog.vb:26-70 | src/qbasic/SaveAsDialog.vb:39-106 | src/qbasic/SubsDialog.vb:26-77 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (5 members, 50+ identical tokens) src/qbasic/Basic/Parser/Dialect/Parser.Dialect.AmigaBasic.vb:110— src/qbasic/Basic/Parser/Dialect/Parser.Dialect.AmigaBasic.vb:110-127 | src/qbasic/Basic/Parser/Dialect/Parser.Dialect.GwBasic.vb:211-228 | src/qbasic/Basic/Parser/Dialect/Parser.Dialect.Hybrid.vb:133-150 | src/qbasic/Basic/Parser/Dialect/Parser.Dialect.Qbasic.vb:117-134 | src/qbasic/Basic/Parser/Dialect/Parser.Dialect.TinyBasic.vb:111-128 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Duplicated block (175 lines × 2) src/qbasic.compatibility/Core.vb:241— src/qbasic.compatibility/Core.vb:241-415 | src/qbasic/QBLib/Core.vb:236-410 — 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 (103 lines × 2) src/qbasic.compatibility/Video.vb:1471— src/qbasic.compatibility/Video.vb:1471-1573 | src/qbasic.compatibility/Video.vb:1617-1719 — 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 (27–54 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:8865— src/qbasic/Basic/Interactive/Interactive.vb:8865-8918 | src/qbasic/Basic/Interactive/Interactive.vb:8939-8965 — 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 (52–53 lines × 2) src/qbasic.compatibility/Console.vb:130— src/qbasic.compatibility/Console.vb:130-182 | src/qbasic/QBLib/Video.vb:2138-2189 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9–46 lines × 3) src/qbasic/Basic/Interactive/Interactive.vb:15185— src/qbasic/Basic/Interactive/Interactive.vb:15185-15230 | src/qbasic/Basic/Interactive/Interactive.vb:15261-15269 | src/qbasic/Basic/Interactive/Interactive.vb:15410-15421 — 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.
Duplicated block (44 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:10615— src/qbasic/Basic/Interactive/Interactive.vb:10615-10658 | src/qbasic/Basic/Interactive/Interactive.vb:15792-15835 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (29–43 lines × 2) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1580— src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1580-1608 | src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1617-1659 — 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 (42 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:7974— src/qbasic/Basic/Interactive/Interactive.vb:7974-8015 | src/qbasic/Basic/Interactive/Interactive.vb:8075-8116 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/qbasic/Basic/Interactive/Interactive.vb:8074` calls `m_interpreter`, `Statements` and `src/qbasic/Basic/Interactive/Interactive.vb:7973` does not — after which the two agree again for 4 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.
Duplicated block (38–40 lines × 2) src/qbasic.compatibility/Core.vb:55— src/qbasic.compatibility/Core.vb:55-94 | src/qbasic/QBLib/Core.vb:49-86 — 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 (39 lines × 2) src/qbasic.compatibility/Console.vb:94— src/qbasic.compatibility/Console.vb:94-132 | src/qbasic/QBLib/Video.vb:2099-2137 — 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 (38 lines × 2) src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:465— src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:465-502 | src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:510-547 — 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 (37 lines × 2) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:577— src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:577-613 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:3295-3331 — 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 (35–36 lines × 2) src/qbasic/Program.vb:2310— src/qbasic/Program.vb:2310-2344 | src/qbasic/Program.vb:2372-2407 — 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 (34 lines × 2) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1724— src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1724-1757 | src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1761-1794 — 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 (33 lines × 4) src/qbasic/Basic/Display/Display.vb:2825— src/qbasic/Basic/Display/Display.vb:2825-2857 | src/qbasic/Basic/Display/Display.vb:2870-2902 | src/qbasic/Basic/Display/Display.vb:2915-2947 | src/qbasic/Basic/Display/Display.vb:2960-2992 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/qbasic/Basic/Display/Display.vb:2955` calls `lines` and `src/qbasic/Basic/Display/Display.vb:2865` 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.
Duplicated block (32 lines × 2) src/qbasic/QB/CodeAnalysis/Lowering/Lowerer.vb:231— src/qbasic/QB/CodeAnalysis/Lowering/Lowerer.vb:231-262 | src/qbasic/QB/CodeAnalysis/Lowering/Lowerer.vb:299-330 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (31 lines × 3) src/qbasic/Basic/Interactive/Interactive.vb:12808— src/qbasic/Basic/Interactive/Interactive.vb:12808-12838 | src/qbasic/Basic/Interactive/Interactive.vb:12842-12872 | src/qbasic/Basic/Interactive/Interactive.vb:12873-12903 — 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 (30 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:7922— src/qbasic/Basic/Interactive/Interactive.vb:7922-7951 | src/qbasic/Basic/Interactive/Interactive.vb:8021-8050 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (29 lines × 8) src/qbasic/ChangeDialog.vb:101— src/qbasic/ChangeDialog.vb:101-129 | src/qbasic/DisplayDialog.vb:154-182 | src/qbasic/FindDialog.vb:85-113 | src/qbasic/HelpPathDialog.vb:72-100 | src/qbasic/NewFunctionDialog.vb:80-108 | src/qbasic/NewSubDialog.vb:80-108 | src/qbasic/PrintDialog.vb:90-118 | src/qbasic/SubsDialog.vb:102-130 — before extracting anything, compare `src/qbasic/ChangeDialog.vb` and `src/qbasic/DisplayDialog.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (27–29 lines × 4) src/qbasic/Basic/Interactive/Interactive.vb:12808— src/qbasic/Basic/Interactive/Interactive.vb:12808-12836 | src/qbasic/Basic/Interactive/Interactive.vb:12842-12870 | src/qbasic/Basic/Interactive/Interactive.vb:12873-12901 | src/qbasic/Basic/Interactive/Interactive.vb:12904-12930 — 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. 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 (25–29 lines × 3) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1681— src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1681-1709 | src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1727-1751 | src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1764-1788 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (27 lines × 3) src/qbasic/Basic/Interactive/Interactive.vb:8865— src/qbasic/Basic/Interactive/Interactive.vb:8865-8891 | src/qbasic/Basic/Interactive/Interactive.vb:8939-8965 | src/qbasic/Basic/Interactive/Interactive.vb:9028-9054 — 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 (23–26 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:18136— src/qbasic/Basic/Interactive/Interactive.vb:18136-18161 | src/qbasic/Basic/Interactive/Interactive.vb:18176-18198 — 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 (26 lines × 2) src/qbasic/QB/CodeAnalysis/Evaluator.vb:2334— src/qbasic/QB/CodeAnalysis/Evaluator.vb:2334-2359 | src/qbasic/QB/CodeAnalysis/Evaluator.vb:2371-2396 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (22–25 lines × 3) src/qbasic/Basic/Display/Display.vb:303— src/qbasic/Basic/Display/Display.vb:303-327 | src/qbasic/Basic/Display/Display.vb:353-374 | src/qbasic/Basic/Display/Display.vb:394-415 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/qbasic/Basic/Display/Display.vb:391` calls `m_attributeEgaPalette` and `src/qbasic/Basic/Display/Display.vb:351` 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.
Duplicated block (25 lines × 3) src/qbasic/NewFunctionDialog.vb:34— src/qbasic/NewFunctionDialog.vb:34-58 | src/qbasic/NewSubDialog.vb:34-58 | src/qbasic/PrintDialog.vb:46-70 — before extracting anything, compare `src/qbasic/NewFunctionDialog.vb` and `src/qbasic/NewSubDialog.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16–23 lines × 3) src/qbasic/Basic/Display/Display.vb:2678— src/qbasic/Basic/Display/Display.vb:2678-2700 | src/qbasic/Basic/Display/Display.vb:2706-2721 | src/qbasic/Basic/Display/Display.vb:2726-2741 — 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.
Duplicated block (22 lines × 3) src/qbasic/Basic/Display/Display.vb:421— src/qbasic/Basic/Display/Display.vb:421-442 | src/qbasic/Basic/Display/Display.vb:446-467 | src/qbasic/Basic/Display/Display.vb:471-492 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/qbasic/Basic/Display/Display.vb:496` calls `m_attributeEgaPalette` and `src/qbasic/Basic/Display/Display.vb:443` 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.
Duplicated block (8–22 lines × 2) src/qbasic/Basic/Audio/SoundGenerator.vb:563— src/qbasic/Basic/Audio/SoundGenerator.vb:563-570 | src/qbasic/Basic/Audio/SoundGenerator.vb:579-600 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (21–22 lines × 2) src/qbasic/Basic/VisualBasic/MKI.vb:259— src/qbasic/Basic/VisualBasic/MKI.vb:259-279 | src/qbasic/QBLib/Core.vb:655-676 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (21 lines × 5) src/qbasic/NewFunctionDialog.vb:34— src/qbasic/NewFunctionDialog.vb:34-54 | src/qbasic/NewSubDialog.vb:34-54 | src/qbasic/OpenDialog.vb:97-117 | src/qbasic/PrintDialog.vb:46-66 | src/qbasic/SaveAsDialog.vb:82-102 — before extracting anything, compare `src/qbasic/NewFunctionDialog.vb` and `src/qbasic/NewSubDialog.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (21 lines × 3) src/qbasic/Basic/Interactive/Interactive.vb:6497— src/qbasic/Basic/Interactive/Interactive.vb:6497-6519 | src/qbasic/Basic/Interactive/Interactive.vb:15061-15081 | src/qbasic/Basic/Interactive/Interactive.vb:15085-15105 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/qbasic/Basic/Interactive/Interactive.vb:6519` calls `PeekToken` and `src/qbasic/Basic/Interactive/Interactive.vb:15081` 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.
Duplicated block (18–21 lines × 2) src/qbasic/Basic/Display/Display.vb:322— src/qbasic/Basic/Display/Display.vb:322-342 | src/qbasic/Basic/Display/Display.vb:494-511 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19–21 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:6385— src/qbasic/Basic/Interactive/Interactive.vb:6385-6403 | src/qbasic/Basic/Interactive/Interactive.vb:6417-6437 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (21 lines × 2) src/qbasic.compatibility/Devices.vb:349— src/qbasic.compatibility/Devices.vb:349-369 | src/qbasic/Basic/VisualBasic/MKI.vb:342-362 — before extracting anything, compare `src/qbasic.compatibility/Devices.vb` and `src/qbasic/Basic/VisualBasic/MKI.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 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. 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 (20 lines × 6) src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:594— src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:594-613 | src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:622-641 | src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:650-669 | src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:678-697 | src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:706-725 | src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:734-753 — 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, `src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:590` calls `ToString` and `src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:620` 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.
Duplicated block (16–20 lines × 4) src/qbasic/Basic/Display/Display.vb:326— src/qbasic/Basic/Display/Display.vb:326-344 | src/qbasic/Basic/Display/Display.vb:428-447 | src/qbasic/Basic/Display/Display.vb:453-472 | src/qbasic/Basic/Display/Display.vb:498-513 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/qbasic/Basic/Display/Display.vb:496` calls `m_attributeEgaPalette` and `src/qbasic/Basic/Display/Display.vb:427` 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.
Duplicated block (20 lines × 3) src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:424— src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:424-444 | src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:465-484 | src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:510-529 — 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 `src/qbasic/QB/CodeAnalysis/Syntax/Lexer.vb:424` 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 (18 lines × 6) src/qbasic/Basic/Interactive/Interactive.vb:18745— src/qbasic/Basic/Interactive/Interactive.vb:18745-18762 | src/qbasic/Basic/Interactive/Interactive.vb:18866-18883 | src/qbasic/Basic/Interactive/Interactive.vb:18888-18905 | src/qbasic/Basic/Interactive/Interactive.vb:18910-18927 | src/qbasic/Basic/Interactive/Interactive.vb:18932-18949 | src/qbasic/Basic/Interactive/Interactive.vb:18954-18971 — 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.
Duplicated block (18 lines × 5) src/qbasic/Basic/Parser/Dialect/Parser.Dialect.AmigaBasic.vb:110— src/qbasic/Basic/Parser/Dialect/Parser.Dialect.AmigaBasic.vb:110-127 | src/qbasic/Basic/Parser/Dialect/Parser.Dialect.GwBasic.vb:211-228 | src/qbasic/Basic/Parser/Dialect/Parser.Dialect.Hybrid.vb:133-150 | src/qbasic/Basic/Parser/Dialect/Parser.Dialect.Qbasic.vb:117-134 | src/qbasic/Basic/Parser/Dialect/Parser.Dialect.TinyBasic.vb:111-128 — before extracting anything, compare `src/qbasic/Basic/Parser/Dialect/Parser.Dialect.AmigaBasic.vb` and `src/qbasic/Basic/Parser/Dialect/Parser.Dialect.GwBasic.vb` as WHOLE FILES: 85% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (18 lines × 2) src/qbasic.compatibility/Devices.vb:54— src/qbasic.compatibility/Devices.vb:54-71 | src/qbasic/Basic/VisualBasic/MKI.vb:48-65 — before extracting anything, compare `src/qbasic.compatibility/Devices.vb` and `src/qbasic/Basic/VisualBasic/MKI.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 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. 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 (17 lines × 6) src/qbasic/NewFunctionDialog.vb:42— src/qbasic/NewFunctionDialog.vb:42-58 | src/qbasic/NewSubDialog.vb:42-58 | src/qbasic/OpenDialog.vb:105-121 | src/qbasic/PrintDialog.vb:54-70 | src/qbasic/SaveAsDialog.vb:90-106 | src/qbasic/SubsDialog.vb:55-71 — before extracting anything, compare `src/qbasic/NewFunctionDialog.vb` and `src/qbasic/NewSubDialog.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (17 lines × 4) src/qbasic/QBLib/Video.vb:996— src/qbasic/QBLib/Video.vb:996-1020 | src/qbasic/QBLib/Video.vb:1036-1052 | src/qbasic/QBLib/Video.vb:1060-1076 | src/qbasic/QBLib/Video.vb:1084-1100 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `src/qbasic/QBLib/Video.vb:996` 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 (13–17 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:865— src/qbasic/Basic/Interactive/Interactive.vb:865-877 | src/qbasic/Basic/Interactive/Interactive.vb:1121-1137 — 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 (15–16 lines × 3) src/qbasic.compatibility/Devices.vb:264— src/qbasic.compatibility/Devices.vb:264-278 | src/qbasic/Basic/VisualBasic/MKI.vb:257-271 | src/qbasic/QBLib/Core.vb:653-668 — before extracting anything, compare `src/qbasic.compatibility/Devices.vb` and `src/qbasic/Basic/VisualBasic/MKI.vb` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 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. 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 (15 lines × 10) src/qbasic/ChangeDialog.vb:99— src/qbasic/ChangeDialog.vb:99-113 | src/qbasic/DisplayDialog.vb:152-166 | src/qbasic/FindDialog.vb:83-97 | src/qbasic/HelpPathDialog.vb:70-84 | src/qbasic/NewFunctionDialog.vb:78-92 | src/qbasic/NewSubDialog.vb:78-92 | src/qbasic/OpenDialog.vb:152-166 | src/qbasic/PrintDialog.vb:88-102 | src/qbasic/SaveAsDialog.vb:139-153 | src/qbasic/SubsDialog.vb:100-114 — before extracting anything, compare `src/qbasic/ChangeDialog.vb` and `src/qbasic/DisplayDialog.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 7) src/qbasic/Basic/Display/Display.vb:278— src/qbasic/Basic/Display/Display.vb:278-292 | src/qbasic/Basic/Display/Display.vb:332-346 | src/qbasic/Basic/Display/Display.vb:369-383 | src/qbasic/Basic/Display/Display.vb:410-424 | src/qbasic/Basic/Display/Display.vb:435-449 | src/qbasic/Basic/Display/Display.vb:460-474 | src/qbasic/Basic/Display/Display.vb:501-515 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/qbasic/Basic/Display/Display.vb:432` calls `m_attributeEgaPalette` and `src/qbasic/Basic/Display/Display.vb:499` 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.
Duplicated block (15 lines × 6) src/qbasic/Basic/Display/Display.vb:550— src/qbasic/Basic/Display/Display.vb:550-564 | src/qbasic/Basic/Display/Display.vb:663-677 | src/qbasic/Basic/Display/Display.vb:697-711 | src/qbasic/Basic/Display/Display.vb:731-745 | src/qbasic/Basic/Display/Display.vb:754-768 | src/qbasic/Basic/Display/Display.vb:777-791 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (15 lines × 3) src/qbasic/Basic/Interactive/Interactive.vb:10235— src/qbasic/Basic/Interactive/Interactive.vb:10235-10249 | src/qbasic/Basic/Interactive/Interactive.vb:11186-11200 | src/qbasic/Basic/Interactive/Interactive.vb:14694-14708 — 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 (13–14 lines × 3) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:1762— src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:1762-1775 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:1797-1809 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:3795-3807 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:1812` calls `ParseOptionalAsClause` and `src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:3809` 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.
Duplicated block (13 lines × 9) src/qbasic/Basic/Display/Display.vb:553— src/qbasic/Basic/Display/Display.vb:553-565 | src/qbasic/Basic/Display/Display.vb:566-578 | src/qbasic/Basic/Display/Display.vb:594-606 | src/qbasic/Basic/Display/Display.vb:607-619 | src/qbasic/Basic/Display/Display.vb:666-678 | src/qbasic/Basic/Display/Display.vb:700-712 | src/qbasic/Basic/Display/Display.vb:734-746 | src/qbasic/Basic/Display/Display.vb:757-769 | src/qbasic/Basic/Display/Display.vb:780-792 — all 9 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 (13 lines × 5) src/qbasic/Basic/Input/KeyEventArgs.vb:187— src/qbasic/Basic/Input/KeyEventArgs.vb:187-200 | src/qbasic/Basic/Input/KeyEventArgs.vb:201-214 | src/qbasic/Basic/Input/KeyEventArgs.vb:215-228 | src/qbasic/Basic/Input/KeyEventArgs.vb:229-242 | src/qbasic/Basic/Input/KeyEventArgs.vb:275-287 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10–12 lines × 2) src/qbasic/DocumentPanel.vb:219— src/qbasic/DocumentPanel.vb:219-228 | src/qbasic/HelpPanel.vb:95-106 — 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. 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 (11 lines × 4) src/qbasic/Basic/Display/Display.vb:1864— src/qbasic/Basic/Display/Display.vb:1864-1874 | src/qbasic/Basic/Display/Display.vb:2233-2243 | src/qbasic/Basic/Display/Display.vb:2318-2328 | src/qbasic/Basic/Display/Display.vb:2349-2359 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9–11 lines × 2) src/qbasic/Basic/Interactive/Interactive.vb:2735— src/qbasic/Basic/Interactive/Interactive.vb:2735-2745 | src/qbasic/Basic/Interactive/Interactive.vb:3393-3401 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/qbasic/Basic/Interactive/Interactive.vb:2733` calls `PopToken` and `src/qbasic/Basic/Interactive/Interactive.vb:3392` 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.
Duplicated block (10 lines × 4) src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1091— src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1091-1101 | src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1108-1117 | src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1145-1157 | src/qbasic/QB/CodeAnalysis/Binding/Binder.vb:1160-1169 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 14) src/qbasic/AboutDialog.vb:66— src/qbasic/AboutDialog.vb:66-74 | src/qbasic/ChangeDialog.vb:99-107 | src/qbasic/DisplayDialog.vb:152-160 | src/qbasic/FindDialog.vb:83-91 | src/qbasic/HelpPathDialog.vb:70-78 | src/qbasic/MessageDialog.vb:62-70 | src/qbasic/NewFunctionDialog.vb:78-86 | src/qbasic/NewSubDialog.vb:78-86 | src/qbasic/OpenDialog.vb:152-160 | src/qbasic/PrintDialog.vb:88-96 | src/qbasic/SaveAsDialog.vb:139-147 | src/qbasic/SavePrompt.vb:73-81 | src/qbasic/SubsDialog.vb:100-108 | src/qbasic/WelcomeDialog.vb:71-79 — before extracting anything, compare `src/qbasic/AboutDialog.vb` and `src/qbasic/MessageDialog.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 3) src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:362— src/qbasic/QB/CodeAnalysis/Emit/JsEmitter.vb:362-370 | src/qbasic/QB/CodeAnalysis/Emit/MsilEmitter.vb:238-246 | src/qbasic/QB/CodeAnalysis/Emit/VbEmitter.vb:257-265 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Duplicated block (8 lines × 3) src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:771— src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:771-778 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:1850-1857 | src/qbasic/QB/CodeAnalysis/Syntax/Parser.vb:3133-3140 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 5) src/qbasic/Basic/Interactive/Interactive.vb:8701— src/qbasic/Basic/Interactive/Interactive.vb:8701-8707 | src/qbasic/Basic/Interactive/Interactive.vb:8754-8760 | src/qbasic/Basic/Interactive/Interactive.vb:8835-8850 | src/qbasic/Basic/Interactive/Interactive.vb:8909-8924 | src/qbasic/Basic/Interactive/Interactive.vb:8998-9013 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6 lines × 10) src/qbasic/QBLib/Video.vb:2018— src/qbasic/QBLib/Video.vb:2018-2023 | src/qbasic/QBLib/Video.vb:2024-2029 | src/qbasic/QBLib/Video.vb:2030-2035 | src/qbasic/QBLib/Video.vb:2036-2041 | src/qbasic/QBLib/Video.vb:2042-2047 | src/qbasic/QBLib/Video.vb:2048-2053 | src/qbasic/QBLib/Video.vb:2054-2059 | src/qbasic/QBLib/Video.vb:2060-2065 | src/qbasic/QBLib/Video.vb:2066-2071 | src/qbasic/QBLib/Video.vb:2072-2077 — all 10 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) src/qbasic/Basic/Display/Display.vb:2247— src/qbasic/Basic/Display/Display.vb:2247-2252 | src/qbasic/Basic/Display/Display.vb:2253-2258 | src/qbasic/Basic/Display/Display.vb:2259-2265 — 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.
Duplicated block (4–5 lines × 13) src/qbasic/Basic/Display/Display.vb:1093— src/qbasic/Basic/Display/Display.vb:1093-1097 | src/qbasic/Basic/Display/Display.vb:1098-1102 | src/qbasic/Basic/Display/Display.vb:1103-1107 | src/qbasic/Basic/Display/Display.vb:1108-1112 | src/qbasic/Basic/Display/Display.vb:1113-1117 | src/qbasic/Basic/Display/Display.vb:1118-1122 | src/qbasic/Basic/Display/Display.vb:1123-1127 | src/qbasic/Basic/Display/Display.vb:1128-1132 | src/qbasic/Basic/Display/Display.vb:1133-1137 | src/qbasic/Basic/Display/Display.vb:1138-1142 | src/qbasic/Basic/Display/Display.vb:1143-1147 | src/qbasic/Basic/Display/Display.vb:1148-1152 | src/qbasic/Basic/Display/Display.vb:1153-1156 — all 13 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.
Off the main sequence: QBasic — QBasic: abstractness 0.05, instability 0.00, distance 0.95 — an application entry point, so it is concrete by design — the distance is expected; what is worth checking is that other projects depend on it at all, since a host should be a leaf of the graph.
Coverage not measured — no coverage collector is wired up — Coverage NOT MEASURED: `--collect:"XPlat Code Coverage"` names a data collector that ships in the `coverlet.collector` package, and this repository wires up none — no test project references it and no runsettings declares one. The absence of coverage here is therefore not evidence about the suite or about our analyzer environment: without a collector, `--collect` produces nothing even from a suite that builds and passes. Add a `coverlet.collector` PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect.
No CI pipeline — No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, …) — changes aren't gated by an automated build/test.
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.
Fat interface: IDirect (30 members) src/qbasic/Basic/Display/IDirect.vb:16— `IDirect` declares 30 members: `Screen`, `VisualPage`, `ScreenWidth`, `ScreenHeight`, `Pcopy`, `Point`, `ActivePage`, `Circle`, `Line`, `Pset`, `Pset`, `Preset`, `Preset`, `ScreenMode`, `IsKeyOn`, `Screen`, `ViewPrint`, `ViewPrint`, `KeyOn`, `Cls`, `CsrLin`, `Pos`, `Locate`, `Color`, `Color`, `Color`, `SetPalette`, `SetPalette`, `WriteCharacter`, `View`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. Those 30 declarations carry 23 distinct name(s), so part of the width is overloading rather than separate responsibilities — but 23 operations clears the >15 bar on its own, so the row is about responsibilities, not signatures. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
Fat interface: IVirtualFileSystem (17 members) src/qbasic/Basic/IO/IVirtualFileSystem.vb:3— `IVirtualFileSystem` declares 17 members: `ChDir`, `Files`, `Kill`, `Load`, `MkDir`, `Name`, `RmDir`, `Save`, `Open`, `Read`, `Input`, `Write`, `Lock`, `Unlock`, `Close`, `InitialPath`, `IsEightDotThree`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
Documentation: no architecture or design documentation documentation/README.md— The README documents only a language reference and character set, with no architecture or design documentation despite the outline naming those sections. Add an Architecture section describing how the QBasic interpreter is structured (input parsing, tokenization, semantics engine) so readers can understand the project's shape.
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 1 of 5 project(s) overshoot their size bounds, lowering Project Cohesion to 6.0/10. The most over is `QBasic` (70677 LoC, 202 public types across 22 namespaces). Review these for cohesion — split a project that spans unrelated responsibilities.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
M2 · Architecture documentation· No architecture diagram/doc · ×1
No architecture diagram/doc — No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
README/code drift — README claims QBASIC is native to Windows/Linux and possibly other platforms but there are NO projects targeting Linux or cross-platform — reported by the model that read the README against this repository; no term search was run for this one, so nothing here has been checked against the tree. Treat it as a reading to confirm, not as a measured contradiction: verify it against the code before acting on it, and if the footprint it describes does exist, this row is wrong.
No SAST — No static application security testing detected. For this repository's stack, add a Roslyn security analyzer package referenced from the project (the analyzer packages do analyse VB.NET), plus gitleaks for committed secrets — CodeQL has no VB.NET extractor, so its csharp pack would extract nothing from this tree and then report it clean — this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
No 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.)
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.
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 scan
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
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.
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
none (no readable dependency manifest): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
0
—
Run 01a0f800-659c-7488-96c8-c3b02a014c6d · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 11 · Warnings: 893 · Recommendations: 11 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 01-10-2026 @ 15:06 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.