Public report — frankendrift, 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_0230feda8b8143e9bde974d66599e5c1
Filed 1 October 2026, 14:39 UTC
Public
Medium · 26,354 LoC · 10 projects · rebuild ~0.4 person-years · weakest lens: Readiness (41%)
Findings by grade
5 critical328 serious32 minor3 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, 14:37 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 ▸
345findings with an exact file:lineof 365 — the remainder are repo-wide signals (a dimension-level measurement, not a single line); open any file:line and verify
65/119dimensions across the health lenses26354 LoC · 10 projects — wide & deep
Band capped at Weak: the weakest category (Testing, 0%) reads Critical — the cover never out-promises the category table.
Preview (pre-1.0). This repo hasn't declared a stable release, so it's judged against a relaxed, pre-production bar.
This system is a medium-sized asset with a fragile operational foundation, scoring 53% overall. While the underlying architecture is robust and secure, the lack of production readiness creates significant risk for delivery speed and reliability. The business value tied up here is substantial, requiring roughly 0.4 person-years to rebuild, which underscores the importance of stabilizing the current codebase rather than replacing it immediately.
The primary risk lies in operational fragility. With a readiness score of 41%, the system lacks the safety nets needed for confident deployment. This means every change carries a higher probability of defects or outages, directly impacting customer trust and support costs. The absence of automated tests is the critical failure point here; without them, regression risks are unmanaged, and the team cannot verify that fixes do not break existing functionality. This uncertainty forces manual verification, slowing down release cycles and increasing the cost of every update.
A secondary concern is the velocity tax imposed by code quality. Although the architecture is sound, the code itself is complex and duplicated, averaging a mediocre quality score. This acts as a hidden tax on development, making changes 6–13% more expensive and time-consuming than in a clean codebase. As the team modifies the system, this inefficiency compounds, draining engineering resources that could otherwise be spent on new features. The cost of inaction is a continuous drag on productivity, estimated to cost more annually than the one-time effort required to fix the testing gap.
On the positive side, the system is secure and architecturally coherent, with minimal boilerplate and clear logic flow. This provides a stable base for improvement. The highest-leverage action is to resolve the lack of automated tests. This single step pays for itself by reducing regression costs and enabling faster, safer releases. Focusing here first offers the best return on investment, stabilizing the system and unlocking the potential of the strong architecture. Until this is addressed, the system remains a liability despite its technical merits.
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 53% quality) — the last 20% of quality is most of the work
Size & shape
Medium · effort split not classified for 22,240 line(s) outside the .NET model (the tier breakdown is a C#-only syntax walk)
Effort basis
The rebuild estimate prices 26,238 code lines. Comment-only lines count toward the 26,354-line size but are not build effort.
This codebase represents roughly ~0.4 person-years of build effort (about ~€55,000 to rebuild). Its weakest lens is Readiness at 41% — the part of that asset most exposed by the findings below.
How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.2) — desktop/game, high decision density × a 0.7× quality factor, at €60–95/h; indicative, ±~30%. 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 automated tests finding(s) in Code Coverage.
Value concentrated against a weak lens · High · Value at risk
This is a Medium asset (~0.4 person-years to rebuild), and its weakest lens is Readiness at 41%. 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.
Highest-leverage move · Medium · Leverage
Of everything flagged, the best return on effort is: Resolve the 1 No automated tests finding(s) in Code Coverage. The rest can wait behind it.
Evidence: priority ranking: top of 5 ranked by impact/effort
→ Resolve the 1 No automated tests finding(s) in Code Coverage.
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.
The top fix pays for itself · Medium · Economics
The top-ranked fix costs roughly 1–3 engineer-days once. Not doing it costs about 0.1–0.7 engineer-days every year, paid as drag on the ~844 lines this team changes annually — a bill that arrives whether or not anyone books it. On those figures the fix breaks even in roughly 17–301 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: 208 line(s) changed over a 90-day window ⇒ ~844/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 301 months.
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.)
15 modules, 11 dependencies. Every dependency points down the layering — no cycles.
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.
Dependency, pointing down the layeringAbove the diagonal — part of a cycleThe module itself
9→2 FrankenDrift.GlkRunner.Gargoyle depends on FrankenDrift.GlkRunner.Glk✕
Type pairs
31 distinct (type in FrankenDrift.GlkRunner.Gargoyle → type in FrankenDrift.GlkRunner.Glk) references. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
FrankenDrift.GlkRunner.Gargoyle uses FrankenDrift.GlkRunner.Glk. Changing FrankenDrift.GlkRunner.Glk can break FrankenDrift.GlkRunner.Gargoyle, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
10→2 FrankenDrift.GlkRunner.WinGlk depends on FrankenDrift.GlkRunner.Glk✕
Type pairs
31 distinct (type in FrankenDrift.GlkRunner.WinGlk → type in FrankenDrift.GlkRunner.Glk) references. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
FrankenDrift.GlkRunner.WinGlk uses FrankenDrift.GlkRunner.Glk. Changing FrankenDrift.GlkRunner.Glk can break FrankenDrift.GlkRunner.WinGlk, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
11→3 FrankenDrift.Glue depends on FrankenDrift.Glue.Infragistics.Win.UltraWinToolbars✕
Type pairs
2 distinct (type in FrankenDrift.Glue → type in FrankenDrift.Glue.Infragistics.Win.UltraWinToolbars) references.
FrankenDrift.Glue uses FrankenDrift.Glue.Infragistics.Win.UltraWinToolbars. Changing FrankenDrift.Glue.Infragistics.Win.UltraWinToolbars can break FrankenDrift.Glue, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
12→11 FrankenDrift.Adrift depends on FrankenDrift.Glue✕
Type pairs
9 distinct (type in FrankenDrift.Adrift → type in FrankenDrift.Glue) references.
FrankenDrift.GlkRunner uses FrankenDrift.Glue.Infragistics.Win.UltraWinToolbars. Changing FrankenDrift.Glue.Infragistics.Win.UltraWinToolbars can break FrankenDrift.GlkRunner, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
13→11 FrankenDrift.GlkRunner depends on FrankenDrift.Glue✕
Type pairs
6 distinct (type in FrankenDrift.GlkRunner → type in FrankenDrift.Glue) references.
FrankenDrift.Harness uses FrankenDrift.Glue.Infragistics.Win.UltraWinToolbars. Changing FrankenDrift.Glue.Infragistics.Win.UltraWinToolbars can break FrankenDrift.Harness, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
14→11 FrankenDrift.Harness depends on FrankenDrift.Glue✕
Type pairs
6 distinct (type in FrankenDrift.Harness → type in FrankenDrift.Glue) references.
FrankenDrift.Runner uses FrankenDrift.Glue.Infragistics.Win.UltraWinToolbars. Changing FrankenDrift.Glue.Infragistics.Win.UltraWinToolbars can break FrankenDrift.Runner, not the reverse.
Position
Below the diagonal — points down the layering, which is what you want.
15→11 FrankenDrift.Runner depends on FrankenDrift.Glue✕
Type pairs
9 distinct (type in FrankenDrift.Runner → type in FrankenDrift.Glue) references.
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A03:2021 — Injection
1
High / Critical
Roadmap
First, resolve the single gaps in automated code coverage and test distribution to ensure all new code is validated. Second, establish a changelog to clearly document what ships in each release. Third, integrate the test suite into the CI pipeline and gate merges on its success. Finally, implement structured tracing via ActivitySource or EventSource to enable effective debugging, noting that health checks are not applicable for this binary.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 No automated tests finding(s) in Code Coverage.
For more than a log file, an `ActivitySource`/`EventSource` the user can switch on gives you a structured trace to attach to a bug report. A health-check endpoint does not apply here: nothing orchestrates or load-balances a binary the user launches.
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).
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 — 5
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 — 328
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 — 32
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 3
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. 60 of 65 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 5 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 65 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, 345 of 365 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.
D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (5 contributor(s) across 315 commit(s) sampled, automation and bot accounts excluded). One of them holds 98% of the history; the other 4 hold 0.5% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
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 26k LoC across 10 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"]`.
D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `FrankenDrift.Runner/FrankenDrift.Runner/AdriftOutput.cs` produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
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 build of this repository exited 1 and the cause could not be attributed, so no assemblies were produced and there was no IL to read. We do not read it as a defect in the repository: an unattributed failure leans OURS. D18 owns the question of whether this repository builds; it was not answered here.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
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.
D8 Code Coverage: Coverage is measured by building and running the test suite inside Watchdog's isolated image — the target repo is never modified, and nothing on your systems runs. So coverage exists only when the suite builds and runs within the inline time budget; one that needs external services, can't build, or exceeds the budget yields no coverage (D8 then degrades to not-measured, not a low score). Line coverage also says nothing about assertion quality.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
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.
D24 Comment Value: Comment value (WHY vs WHAT) is an LLM judgement over a bounded sample — it is advisory and cannot weigh a comment against the precise code change it was written to explain.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
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 (5): D19, D21, D24, D26, 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.
77 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was FileIO.Load500 at 570. A further 11 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 SharedModule.EnumParseCharacter at 28 — they are counted neither in the figure above nor in this dimension's score. 1 file carries no cyclomatic complexity row at all for this reason — every one of its over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: FrankenDrift.Adrift/clsItem.vb (clsItem.GetNewKey at 16). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 72 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 FileIO.Load500 (cyclomatic 570) finding(s) in Cyclomatic Complexity — start with FileIO.vb. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 RunnerSession.ExecuteSingleAction (cyclomatic 434) finding(s) in Cyclomatic Complexity — start with clsUserSession.vb. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 RunnerSession.PassSingleRestriction (cyclomatic 429) finding(s) in Cyclomatic Complexity — start with clsUserSession.vb. — One of this dimension's main actionable groups (1 warning-level).
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 110 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 FileIO.Load500 (cognitive 1563) finding(s) in Cognitive Complexity — start with FileIO.vb. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 SharedModule.ReplaceFunctions (cognitive 1527) finding(s) in Cognitive Complexity — start with Global.vb. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 RunnerSession.ExecuteSingleAction (cognitive 1132) finding(s) in Cognitive Complexity — start with clsUserSession.vb. — One of this dimension's main actionable groups (1 warning-level).
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes7.0 / 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 28 MethodTooLong finding(s) in God Classes — start with clsUserSession.vb (12), FileIO.vb (7), Global.vb (2). — One of this dimension's main actionable groups (28 warning-level).
Resolve the 12 FileTooLong finding(s) in God Classes — start with clsUserSession.vb, Global.vb, FileIO.vb. — One of this dimension's main actionable groups (12 warning-level).
Resolve the 10 ClassTooLong finding(s) in God Classes — start with clsTask.vb (3), FileIO.vb, clsVariable.vb. — One of this dimension's main actionable groups (10 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
+ 12 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with clsUserSession.vb, clsVariable.vb. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with AdriftMap.cs, clsVariable.vb. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 Duplicated block (24–31 lines × 2) finding(s) in Code Duplication — start with clsUserSession.vb. — One of this dimension's main actionable groups (1 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling9.2 / 10Stronggated by 1 serious finding✓ 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).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
Resolve the 4 Low cohesion finding(s) in Cohesion (LCOM4) — start with clsUserSession.vb, MainForm.cs, clsObject.vb. — One of this dimension's main actionable groups (4 warning-level).
Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D8 · Code Coverage0.0 / 10Critical✓ Tool-verified
What it measures: How much of the code is actually exercised by tests.
Method: Coverage from coverlet runs or committed reports (Cobertura/OpenCover/lcov), computed per-file with structured exclusions for generated, trivial, and glue code. When the suite can't be built/run in-image AND no report is committed, coverage is reported NOT-MEASURED (excluded from the score) with the precondition to make it measurable — never a LoC-ratio proxy folded in as if measured. Deterministic.
No automated tests — no test code was found in this repository.
No automated tests
What to do
Resolve the 1 No automated tests finding(s) in Code Coverage. — One of this dimension's main actionable groups (1 issue-level).
Enforce Code Coverage in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d8_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test Distribution0.0 / 10Critical✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
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 95 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 6 direct `PackageReference`(s), and 89 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.
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.
Dead code: RoughLightness · ×3FrankenDrift.Runner/FrankenDrift.Runner/Extensions.cs:59
What to do
Resolve the 3 EmptyCatchBlock finding(s) in Explicit Debt — start with Program.cs (2), Global.vb. — One of this dimension's main actionable groups (3 issue-level).
Resolve the 30 TodoComment finding(s) in Explicit Debt — start with clsUserSession.vb (15), clsObject.vb (3), GlkHtmlWin.cs (3). — One of this dimension's main actionable groups (30 warning-level).
Resolve the 3 Dead code finding(s) in Explicit Debt — start with Extensions.cs, MainForm.cs, GlkApi.cs. — One of this dimension's main actionable groups (3 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D18 · Solution Shape8.5 / 10Strong✓ Tool-verified
What it measures: Whether the solution is laid out in a sensible, conventional structure.
Method: Solution structure: project count, decomposition, shell-project detection, build success (confirmed failures cap the score); traced to actual .sln files and binaries. Deterministic.
10 projects, 52 source files, 26354 hand-written lines of code (26354 production / 0 test — the split is derived per file: test is what its project, its own path, or a compile-guarded region marks as test, and a file carrying no test signal counts as production), 22 inter-project edges.
Thin analysable surface across projects
What to do
Resolve the 1 Thin analysable surface across projects finding(s) in Solution Shape. — One of this dimension's main actionable groups (1 recommendation-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 is a solid single-document overview for the cross-platform frontend FrankenDrift, covering prerequisites/installation (Windows/macOS/Linux with download/run steps), known limitations, and licensing. It states what the project is ('A cross-platform frontend for the ADRIFT Runner') and how to run it ('Simply unpack the ZIP file somewhere and run `FrankenDrift.Runner.Win.exe`'), which a README below the repository root must do. The document clips mid-outline at 'full document outline — ALL these sections exist', so any unshown section is not flagged as missing, and no architecture/design docs or XML coverage figures are present to contradict it.
Documentation: no installation or build instructions · ×2README.md
Resolve the 2 Documentation finding(s) in Documentation Quality — start with README.md (2). — One of this dimension's main actionable groups (2 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 naming inconsistencies across 200 sampled symbols.
Inconsistent naming for application path properties/methods. `Application.ExecutablePath` and `Application.StartupPath` use noun phrases for properties, while `MainSession.GetExecutableLocation` uses a verb phrase and a different term ('Location' vs 'Path'). These likely refer to similar or overlapping concepts regarding the application's file location.
✓ On the Gold path — maintain.
Detailed fixes: d21_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D24 · Comment ValueExemplary◐ Sampled · advisory
What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).
Method: Judged by language model at low temperature (0.0-0.1) on deterministically sampled inline comments with surrounding code; findings verified back to sampled comments by substring match. Advisory, sampled.
1 of 10 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.
49 % of calls cross a namespace and 1 % go through an interface, but 100 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: medium — clean/modular boundaries expected.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
1 finding(s): 0 critical, 1 high, 0 medium, 0 low. semgrep hit a parse error in 1 file(s) — `FrankenDrift.Runner/FrankenDrift.Runner/AdriftOutput.cs` (lines 413–414, line 435) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. In 1 of those file(s) — `FrankenDrift.Runner/FrankenDrift.Runner/AdriftOutput.cs` — the break is a C# primary constructor, which semgrep's grammar cannot parse and which hides the type from every rule scoped to it; those files were re-scanned from a shadow copy with the constructor's parameter list blanked (line and column preserving), which restores the type to the rules, and 0 additional row(s) came from that pass. Only the header's own parameter list is unread in them.
REDACTED
What to do
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
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 33 of the 52 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 10 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.
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.
`UIGlue` declares 18 members: `ErrMsg`, `MakeNote`, `EnableButtons`, `SetGameName`, `ScrollToEnd`, `AskYesNoQuestion`, `ShowInfo`, `QuerySavePath`, `QueryRestorePath`, `QuerySaveBeforeQuit`, `OutputHTML`, `InitInput`, `ShowCoverArt`, `DoEvents`, `GetAppDataPath`, `GetExecutableLocation`, `GetExecutablePath`, `GetClaimedAdriftVersion`. 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. — FrankenDrift.Glue/UIGlue.cs:12
`IGlk` declares 52 members: `giblorb_set_resource_map`, `glk_cancel_hyperlink_event`, `glk_cancel_line_event`, `glk_exit`, `glk_fileref_create_by_name`, `glk_fileref_create_by_prompt`, `glk_fileref_create_temp`, `glk_fileref_destroy`, `glk_image_draw`, `glk_image_get_info`, `glk_put_buffer`, `glk_put_buffer_stream`, `glk_put_buffer_uni`, `glk_request_char_event`, `glk_request_hyperlink_event`, `glk_request_line_event`, `glk_request_line_event_uni`, `glk_schannel_create`, `glk_schannel_destroy`, `glk_schannel_pause`, `glk_schannel_play`, `glk_schannel_play_ext`, `glk_schannel_set_volume`, `glk_schannel_stop`, `glk_schannel_unpause`, `glk_select`, `glk_set_hyperlink`, `glk_set_style`, `glk_set_window`, `glk_stream_open_file`, `glk_stream_open_memory`, `glk_stream_close`, `glk_stream_set_position`, `glk_stylehint_set`, `glk_style_measure`, `glk_tick`, `glk_window_clear`, `glk_window_close`, `glk_window_flow_break`, `glk_window_get_size`, and 12 more. 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. — FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkApi.cs:229
What to do
Split fat interfaces into focused role-interfaces so clients depend only on what they use.
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.
A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface. (×5) — FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:30, FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:499, FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:507, …
What to do
Finish or delete NotImplementedException stubs and replace placeholder literals before shipping.
Other · Code Health — Unfinished work detected by code SHAPE, not keywords: members that only throw a "not implemented" exception, methods that take inputs and return a constant, async methods that never await, dead `if (false)` / `#if false` branches, and skeleton types most of whose members are holes. A real, objective slice of technical debt.
Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.
`UTMMain` is a shipped property whose accessors only throw NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface. (×2) — FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkSession.cs:18, FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:30
`GetAppDataPath` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface. (×2) — FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkSession.cs:148, FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:499
The first 2 statements of the `if` and of the `else` are identical, so they run on both paths regardless of the condition. Lift them above the `if` — leaving them duplicated inside makes the branches read as though they handled this differently. — FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkSession.cs:329
`SaveSetting` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — FrankenDrift.Glue/Util.cs:19
`DeleteSetting` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — FrankenDrift.Glue/Util.cs:20
`AddPrevious` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — FrankenDrift.Glue/Util.cs:23
`ReloadMacros` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface. — FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:507
A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers). — FrankenDrift.GlkRunner/FrankenDrift.GlkRunner.Gargoyle/Main.cs:235
`AddPrevious` has an empty body — confirm it's an intentional no-op and not an unfinished method. — FrankenDrift.Glue/Util.cs:22
What to do
Finish or delete the unfinished stubs (NotImplementedException / empty / constant-returning bodies) — they are dead surface that looks live.
Clear the softer debt: remove commented-out code and dead branches, re-enable or delete skipped tests, and replace blanket warning suppressions with targeted ones.
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 '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 10 of 10 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.
Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
What to do
Group production code under src/ (or split deliberately, e.g. backend/ + frontend/) so production and tooling code aren't mixed at the root.
Start a test surface where your build system looks for one (tests/, test/, spec/, or your ecosystem's test source set) — the separation follows from putting the first tests in the right place.
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.
Do you agree with this assessment?
P1 · CI/CD gates7.0 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
A CI pipeline exists but no test-runner invocation (your stack's test command, or a test job) was found — changes may merge without the suite running.
What to do
Run the test suite in CI via an explicit runner step (`dotnet test` for the toolchain this pipeline already uses) and gate merges on it.
Do you agree with this assessment?
P2 · Observability7.0 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
For more than a log file, an `ActivitySource`/`EventSource` the user can switch on gives you a structured trace to attach to a bug report. A health-check endpoint does not apply here: nothing orchestrates or load-balances a binary the user launches.
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 as a CI step. What was searched, so you can tell an absence from a miss: the 1063 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
Add a SAST step to CI running 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 — so a security regression fails the build instead of landing.
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.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. Deterministic, provable per finding. Advisory.
`ofd` is a `OpenFileDialog`, which implements `IDisposable`, and it is created here (line 288). Every use of it in `QueryLoadPath` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var ofd = …;`), which releases it at the end of the scope on every path including a throw. — FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:288
`sfd` is a `SaveFileDialog`, which implements `IDisposable`, and it is created here (line 348). Every use of it in `TranscriptCommandOnExecuted` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var sfd = …;`), which releases it at the end of the scope on every path including a throw. — FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:348
`ofd` is a `OpenFileDialog`, which implements `IDisposable`, and it is created here (line 360). Every use of it in `ReplayCommandOnExecuted` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var ofd = …;`), which releases it at the end of the scope on every path including a throw. — FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:360
`sfd` is a `SaveFileDialog`, which implements `IDisposable`, and it is created here (line 451). Every use of it in `QuerySavePath` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var sfd = …;`), which releases it at the end of the scope on every path including a throw. — FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:451
`ofd` is a `OpenFileDialog`, which implements `IDisposable`, and it is created here (line 459). Every use of it in `QueryRestorePath` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var ofd = …;`), which releases it at the end of the scope on every path including a throw. — FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:459
`msg` is a `MessageDialog`, which implements `IDisposable`, and it is created here (line 19). Every use of it in `CurrentDomain_UnhandledException` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var msg = …;`), which releases it at the end of the scope on every path including a throw. — FrankenDrift.Runner/FrankenDrift.Runner.Gtk/Program.cs:19
`app` is a `Application`, which implements `IDisposable`, and it is created here (line 15). Every use of it in `Main` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var app = …;`), which releases it at the end of the scope on every path including a throw. — FrankenDrift.Runner/FrankenDrift.Runner.Win/Program.cs:15
What to do
Each finding names the value and the span that decides who owns it — the `new` that created it, or the constructor parameter that handed it over. Confirm ownership from that span, then make the disposal match it: release what this type created, leave what it was injected with to whoever created THAT, and drop a finalizer whose type holds nothing unmanaged to release.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether an argument guard throws the exception its own condition describes — a guard that rejects a value for being EMPTY and reports it as `ArgumentNullException` tells the caller a parameter was null when it provably was not.
Method: Roslyn syntax: `throw new ArgumentNullException(nameof(p))` statements controlled by an `if`, whose condition is read for a test that is true of a NON-null `p` — an emptiness test that dereferences it (`p.Count == 0`, `!p.Any()`) or a BCL predicate documented true of the empty value (`string.IsNullOrEmpty(p)`). Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `foreach` leaves the collection it is walking alone — a body that adds to or removes from the very collection the loop is enumerating invalidates the enumerator it is holding, so the next `MoveNext` throws `InvalidOperationException` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×2) — FrankenDrift.Runner/FrankenDrift.Runner.Mac/Program.cs:24, FrankenDrift.Runner/FrankenDrift.Runner.Mac/Program.cs:32
What to do
Swallowed exception (empty catch)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X32 · Type resolved by simple name across every loaded assembly10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a plugin lookup names the type it means — searching every assembly loaded into the process for a candidate whose SIMPLE name equals a string supplied at runtime, and taking the first one found, is decided by assembly LOAD ORDER rather than by this source, so the same name can resolve to a different type on the next run.
Method: Roslyn syntax only, no semantic model: every invocation of `First`/`FirstOrDefault`/`Single`/`SingleOrDefault` whose OWN expression subtree contains both a `GetAssemblies()` call and a `GetTypes()`/`GetExportedTypes()` call — a single-element pick out of every type loaded into the process. A nested selector in the same chain sees no `GetAssemblies()` in its own subtree and is outside the population, so one lookup counts once however many links its chain has. A finding additionally needs both remaining halves: the selector must be `First`/`FirstOrDefault` (`Single`/`SingleOrDefault` reports the ambiguity rather than resolving it, and is counted and never reported), and the chain must carry an `==` comparison of `<lambda parameter>.Name` against something that is not a literal. The receiver must be a plain identifier bound by one of the chain’s own lambdas, which places `assembly.GetName().Name == "X"` outside the rule by construction. One exemption: a `.Name` test joined by `&&` to a `FullName`/`AssemblyQualifiedName` test on the same identifier is spared; joined by `||` it is not. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. Deterministic.
Other · Code Health — Whether nullable reference types are enabled and not undermined by heavy `!` suppression.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
This method contradicts itself about `node`: line 573 tests it for null before doing anything with it — the author's own statement that null is an input this code expects — but that `if` scopes only the block beneath it, and line 601 then dereferences `node` as `node.eInEdge` AFTER the block has closed, where the guard no longer applies. A null `node` skips the guarded body and reaches that line anyway, throwing NullReferenceException on exactly the input the guard was written for. If the dereference belongs to the guarded work, move it inside the block; if `node` truly cannot be null by then, the guard above is misleading and should go. — FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:601
3/9 NRT-eligible project(s) enable <Nullable>enable</Nullable> (projects targeting a pre-C#-8 framework are excluded — NRTs aren't available there). NRTs catch a whole class of null-deref bugs at compile time.
~0.7 `!` suppressions per 1k syntax nodes — 8 suppression(s) across the 10850 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a `!` can suppress anything in (a `!` under `#nullable disable` is inert and is not counted, and its file's nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide.
What to do
Where a method null-tests a symbol and then uses it after the guarded block closes, move the trailing work inside the block — the guard skips its body on null, it does not stop the method.
Enable <Nullable>enable</Nullable> across all projects and resolve warnings rather than suppressing with `!`.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 1 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Not evidenced — 2 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 51 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
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
C1 Data Protection — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C2 Access Controls — No access-control surface detected in the analyzed source — no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here — this is a library/CLI, which is authorized by its CALLER, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
D10 Test Quality — No tests were found in the analyzed repository to assess for quality.
D11 Test Reliability — No test suite was found to re-run, so reliability couldn't be assessed. Two searches produced that zero and both came back empty: the classifier that reads the loaded workspace recognised no suite it could run, and a walk of the source on disk — which covers the JS/TS `*.test.*` and `*.spec.*` conventions and probes for a Pester suite — found no test source in any other ecosystem either. Neither search reaches a suite that is missing from the loaded workspace and carries no name either walk recognises, so this is 'no suite found by those two searches', not a verdict that the repository has none.
D16 Bus Factor — single-maintainer 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.
D25 ADR Conformance — no ADRs to check
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — 1 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D36 Supply-chain Provenance & Signing — The CI pipeline builds and tests but publishes no released artifact — no package publish, container push, GitHub release or deployment step. Supply-chain provenance, signing and SBOM attest RELEASED artifacts, so there is nothing to attest here. Add them to the release pipeline when this repo starts shipping artifacts (a published package, a container image, a deployed service or a tagged release).
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
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
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
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 — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
PF2 Allocation hygiene — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
PF3 Async & latency hygiene — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
S1 Web-Security Posture — No web surface detected in the analyzed source — no HTTP API or web-UI project (no controllers/minimal-API endpoints, no Razor/Blazor views) and no web middleware (HTTPS redirection, HSTS, security headers, cookies). Transport security, security headers, secure cookies, CSRF/input-validation and middleware-order controls are therefore N/A here — this is a library/CLI/worker, not a web app. Crypto hygiene was still checked and found nothing to flag. If this codebase becomes web-facing, the dimension reactivates automatically.
X10 Duplicated predicate — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X2 Cancellation propagation — no async methods found
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
EmptyCatchBlock FrankenDrift.Adrift/Global.vb:3958— 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 FrankenDrift.Runner/FrankenDrift.Runner.Mac/Program.cs:24— 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 FrankenDrift.Runner/FrankenDrift.Runner.Mac/Program.cs:32— 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.
No automated tests — No automated tests — no test code was found in this repository. Untested code is the largest single risk to changing it safely. Start with the code you change most often: add a suite in a framework a runner can collect (xUnit, NUnit or MSTest), and run it in CI so the gap cannot reopen.
TodoComment FrankenDrift.Adrift/FileIO.vb:64— ' TODO: Ideally this should only save values that are different from the initial TAF state — 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 FrankenDrift.Adrift/Global.vb:2292— ' TODO - Improve this to read quotes and commas properly — 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 FrankenDrift.Adrift/Global.vb:2310— ' TODO - Improve this to read quotes and commas properly — 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 FrankenDrift.Adrift/StronglyTypedCollections.vb:4— ' TODO - phase out the individual hashtables in favour of a single dictionary — 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 FrankenDrift.Adrift/clsMacro.vb:15— ' TODO: Ensure unique for this adventure — 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 FrankenDrift.Adrift/clsObject.vb:142— ' TODO - Enhance this, or make it user configuratble — 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 FrankenDrift.Adrift/clsObject.vb:308— ' 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 FrankenDrift.Adrift/clsUserSession.vb:840— ' 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 FrankenDrift.Adrift/clsObject.vb:1023— ' TODO - Need to do something clever here. E.g. if we have properties Where=InLocation then Location = theroom, we need to set Where=Hidden and remove Location property — 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 FrankenDrift.Adrift/clsState.vb:195— ' TODO: Arrays — 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 FrankenDrift.Adrift/clsTask.vb:287— ' TODO - rejig all the other priorities to insert this one — 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 FrankenDrift.Adrift/clsUserSession.vb:618— ' TODO - If this is matching on a second command in the task where the refs are the other way around, it fails to match the specifics — 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 FrankenDrift.Adrift/clsUserSession.vb:798— ' TODO - We could have responses from different tasks here. We need to only match references from the same parent task — 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 FrankenDrift.Adrift/clsUserSession.vb:1061— ' TODO - These may be in the wrong order if we're matching on a secondary command! — 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 FrankenDrift.Adrift/clsUserSession.vb:1156— ' TODO - Need to check PassRestrictions to see if we need to suppress parent Text or Actions — 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 FrankenDrift.Adrift/clsUserSession.vb:1850— ' TODO - Change this to configurable pronouns — 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 FrankenDrift.Adrift/clsUserSession.vb:2424— ' TODO - Run the implicit actions if we didn't find an explict match later. — 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 FrankenDrift.Adrift/clsUserSession.vb:2459— ' TODO: Need to make this configurable within Generator — 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 FrankenDrift.Adrift/clsUserSession.vb:3638— ' TODO - Bring this into Developer as a task — 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 FrankenDrift.Adrift/clsUserSession.vb:3831— ' TODO: This should only add if completeable in current room, i.e. pass all restrictions ignoring ones regarding references. — 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 FrankenDrift.Adrift/clsUserSession.vb:5417— ' TODO - This needs to check that it is the correct 'must exist' check, rather than just any — 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 FrankenDrift.Adrift/clsUserSession.vb:5482— ' TODO - This needs to check that it is the correct 'must exist' check, rather than just any — 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 FrankenDrift.Adrift/clsUserSession.vb:5520— ' TODO - This needs to check that it is the correct 'must exist' check, rather than just any — 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 FrankenDrift.Adrift/clsUserSession.vb:5802— ' TODO, when more than 2 refs... — 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 FrankenDrift.Adrift/clsUserSession.vb:6337— ' TODO - replace above with custom names if changed — 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: FileIO.Load500 FrankenDrift.Adrift/FileIO.vb:1200— MethodTooLong — Load500 runs 1082 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 982 over it, 10.82× 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: RunnerSession.PassSingleRestriction FrankenDrift.Adrift/clsUserSession.vb:4082— MethodTooLong — PassSingleRestriction runs 1051 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 951 over it, 10.51× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: RunnerSession.ExecuteSingleAction FrankenDrift.Adrift/clsUserSession.vb:1383— MethodTooLong — ExecuteSingleAction runs 895 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 795 over it, 8.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: SharedModule.ReplaceOOProperty FrankenDrift.Adrift/Global.vb:669— MethodTooLong — ReplaceOOProperty runs 861 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 761 over it, 8.61× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SharedModule.ReplaceFunctions FrankenDrift.Adrift/Global.vb:1744— MethodTooLong — ReplaceFunctions runs 656 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 556 over it, 6.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: clsVariable.SetToExpression FrankenDrift.Adrift/clsVariable.vb:460— MethodTooLong — SetToExpression runs 513 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 413 over it, 5.13× 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: clsVariable.GetToken FrankenDrift.Adrift/clsVariable.vb:127— MethodTooLong — GetToken runs 283 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 183 over it, 2.83× 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: RunnerSession.AttemptToExecuteSubTask FrankenDrift.Adrift/clsUserSession.vb:956— MethodTooLong — AttemptToExecuteSubTask runs 248 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 148 over it, 2.48× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: FileIO.LoadActions FrankenDrift.Adrift/FileIO.vb:218— MethodTooLong — LoadActions runs 246 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 146 over it, 2.46× 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: RunnerSession.GrabIt FrankenDrift.Adrift/clsUserSession.vb:2837— MethodTooLong — GrabIt runs 223 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 123 over it, 2.23× 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: GlkHtmlWin.AppendHTML FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkHtmlWin.cs:205— MethodTooLong — AppendHTML 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: RunnerSession.RefineMatchingPossibilitesUsingRestrictions FrankenDrift.Adrift/clsUserSession.vb:5746— MethodTooLong — RefineMatchingPossibilitesUsingRestrictions runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: RunnerSession.AttemptToExecuteTask FrankenDrift.Adrift/clsUserSession.vb:723— MethodTooLong — AttemptToExecuteTask runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 74 over it, 1.74× 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: FileIO.LoadState FrankenDrift.Adrift/FileIO.vb:876— MethodTooLong — LoadState runs 171 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 71 over it, 1.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: AdriftOutput.AppendHtml FrankenDrift.Runner/FrankenDrift.Runner/AdriftOutput.cs:101— MethodTooLong — AppendHtml runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.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: StateStack.RestoreState FrankenDrift.Adrift/clsState.vb:241— MethodTooLong — RestoreState runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64× 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: FileIO.LoadFile FrankenDrift.Adrift/FileIO.vb:676— MethodTooLong — LoadFile runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: FileIO.SaveState FrankenDrift.Adrift/FileIO.vb:51— MethodTooLong — SaveState runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46× 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: RunnerSession.EvaluateInput FrankenDrift.Adrift/clsUserSession.vb:3303— MethodTooLong — EvaluateInput runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: RunnerSession.NotUnderstood FrankenDrift.Adrift/clsUserSession.vb:3469— MethodTooLong — NotUnderstood runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: FileIO.LoadRestrictions FrankenDrift.Adrift/FileIO.vb:507— MethodTooLong — LoadRestrictions runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: RunnerSession.CreateRequiredProperties FrankenDrift.Adrift/clsUserSession.vb:348— MethodTooLong — CreateRequiredProperties runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13× 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: FileIO.CreateMandatoryProperties FrankenDrift.Adrift/FileIO.vb:2386— MethodTooLong — CreateMandatoryProperties runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: RunnerSession.InputMatchesCommand FrankenDrift.Adrift/clsUserSession.vb:5587— MethodTooLong — InputMatchesCommand runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: clsMap.UpdateMap FrankenDrift.Adrift/clsMap.vb:356— MethodTooLong — UpdateMap runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FileTooLong: FrankenDrift.Adrift/clsUserSession.vb FrankenDrift.Adrift/clsUserSession.vb— FileTooLong — 5416 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4916 over it, 10.83× 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: FrankenDrift.Adrift/Global.vb FrankenDrift.Adrift/Global.vb— FileTooLong — 3512 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3012 over it, 7.02× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: FrankenDrift.Adrift/FileIO.vb FrankenDrift.Adrift/FileIO.vb— FileTooLong — 2222 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1722 over it, 4.44× 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: FrankenDrift.Adrift/clsCharacter.vb FrankenDrift.Adrift/clsCharacter.vb— FileTooLong — 1582 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1082 over it, 3.16× 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: FrankenDrift.Adrift/clsTask.vb FrankenDrift.Adrift/clsTask.vb— FileTooLong — 1314 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 814 over it, 2.63× 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: FrankenDrift.Adrift/clsVariable.vb FrankenDrift.Adrift/clsVariable.vb— FileTooLong — 1006 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 506 over it, 2.01× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: FrankenDrift.Adrift/clsObject.vb FrankenDrift.Adrift/clsObject.vb— FileTooLong — 936 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 436 over it, 1.87× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: FrankenDrift.Adrift/StronglyTypedCollections.vb FrankenDrift.Adrift/StronglyTypedCollections.vb— FileTooLong — 923 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 423 over it, 1.85× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: FrankenDrift.Adrift/clsAdventure.vb FrankenDrift.Adrift/clsAdventure.vb— FileTooLong — 720 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 220 over it, 1.44× 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: FrankenDrift.Adrift/Blorb.vb FrankenDrift.Adrift/Blorb.vb— FileTooLong — 677 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 177 over it, 1.35× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: FrankenDrift.Adrift/clsMap.vb FrankenDrift.Adrift/clsMap.vb— FileTooLong — 576 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 76 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: FrankenDrift.Runner/AdriftMap.cs FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs— FileTooLong — 526 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 26 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.
ClassTooLong: FileIO FrankenDrift.Adrift/FileIO.vb— ClassTooLong — 2217 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 1817 over it, 5.54× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: clsVariable FrankenDrift.Adrift/clsVariable.vb— ClassTooLong — 1005 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 605 over it, 2.51× 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: clsCharacter FrankenDrift.Adrift/clsCharacter.vb— ClassTooLong — 964 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 564 over it, 2.41× 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: StronglyTypedCollections FrankenDrift.Adrift/StronglyTypedCollections.vb— ClassTooLong — 922 significant lines (blank, comment-only and punctuation-only lines excluded), 0 methods. The bar is 400 significant lines; this is 522 over it, 2.31× 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: clsObject FrankenDrift.Adrift/clsObject.vb— ClassTooLong — 894 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 494 over it, 2.24× 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: clsAdventure FrankenDrift.Adrift/clsAdventure.vb— ClassTooLong — 719 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 319 over it, 1.80× 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: clsBlorb FrankenDrift.Adrift/Blorb.vb— ClassTooLong — 675 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 275 over it, 1.69× 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: clsAction FrankenDrift.Adrift/clsTask.vb— ClassTooLong — 456 significant lines (blank, comment-only and punctuation-only lines excluded), 3 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: clsRestriction FrankenDrift.Adrift/clsTask.vb— ClassTooLong — 452 significant lines (blank, comment-only and punctuation-only lines excluded), 4 methods. The bar is 400 significant lines; this is 52 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: clsTask FrankenDrift.Adrift/clsTask.vb— ClassTooLong — 406 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 6 over it, 1.02× 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.
X18 · Disposal-pattern correctness· Disposable created and abandoned in the method that made it · ×7
Disposable created and abandoned in the method that made it FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:288— `ofd` is a `OpenFileDialog`, which implements `IDisposable`, and it is created here (line 288). Every use of it in `QueryLoadPath` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var ofd = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:348— `sfd` is a `SaveFileDialog`, which implements `IDisposable`, and it is created here (line 348). Every use of it in `TranscriptCommandOnExecuted` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var sfd = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:360— `ofd` is a `OpenFileDialog`, which implements `IDisposable`, and it is created here (line 360). Every use of it in `ReplayCommandOnExecuted` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var ofd = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:451— `sfd` is a `SaveFileDialog`, which implements `IDisposable`, and it is created here (line 451). Every use of it in `QuerySavePath` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var sfd = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:459— `ofd` is a `OpenFileDialog`, which implements `IDisposable`, and it is created here (line 459). Every use of it in `QueryRestorePath` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var ofd = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it FrankenDrift.Runner/FrankenDrift.Runner.Gtk/Program.cs:19— `msg` is a `MessageDialog`, which implements `IDisposable`, and it is created here (line 19). Every use of it in `CurrentDomain_UnhandledException` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var msg = …;`), which releases it at the end of the scope on every path including a throw.
Disposable created and abandoned in the method that made it FrankenDrift.Runner/FrankenDrift.Runner.Win/Program.cs:15— `app` is a `Application`, which implements `IDisposable`, and it is created here (line 15). Every use of it in `Main` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var app = …;`), which releases it at the end of the scope on every path including a throw.
Unfinished stub — throws NotImplementedException FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:30— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:499— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:507— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkSession.cs:18— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkSession.cs:148— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkSession.cs:18— `UTMMain` is a shipped property whose accessors only throw NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkSession.cs:148— `GetAppDataPath` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:30— `UTMMain` is a shipped property whose accessors only throw NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:499— `GetAppDataPath` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:507— `ReloadMacros` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
TooManyMethods: SharedModule FrankenDrift.Adrift/Global.vb— TooManyMethods — 3509 significant lines (blank, comment-only and punctuation-only lines excluded), 105 methods. The bar is 30 methods; this is 75 over it, 3.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: RunnerSession FrankenDrift.Adrift/clsUserSession.vb— TooManyMethods — 5413 significant lines (blank, comment-only and punctuation-only lines excluded), 81 methods. The bar is 30 methods; this is 51 over it, 2.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: MainForm FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs— TooManyMethods — 332 significant lines (blank, comment-only and punctuation-only lines excluded), 47 methods. The bar is 30 methods; this is 17 over it, 1.57× 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: MainSession FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkSession.cs— TooManyMethods — 258 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.
Low cohesion: RunnerSession (LCOM4 11) FrankenDrift.Adrift/clsUserSession.vb:8— RunnerSession's methods fall into 11 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: MainForm (LCOM4 9) FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:15— MainForm's methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: clsObject (LCOM4 4) FrankenDrift.Adrift/clsObject.vb:1— clsObject's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: Description (LCOM4 4) FrankenDrift.Adrift/Global.vb:3833— Description's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Dead code: RoughLightness FrankenDrift.Runner/FrankenDrift.Runner/Extensions.cs:59— Method RoughLightness — Roslyn's SymbolFinder walked every project the solution loads, including FrankenDrift.Runner, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: DisableMap FrankenDrift.Runner/FrankenDrift.Runner/MainForm.cs:568— Method DisableMap — Roslyn's SymbolFinder walked every project the solution loads, including FrankenDrift.Runner, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: CharOutput FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkApi.cs:28— NamedType CharOutput — Roslyn's SymbolFinder walked every project the solution loads, including FrankenDrift.GlkRunner, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
IC1 · Incompleteness & stubs· Empty method body · ×3
Empty method body — does nothing with its inputs FrankenDrift.Glue/Util.cs:19— `SaveSetting` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
Empty method body — does nothing with its inputs FrankenDrift.Glue/Util.cs:20— `DeleteSetting` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
Empty method body — does nothing with its inputs FrankenDrift.Glue/Util.cs:23— `AddPrevious` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
Duplicated block (8 lines × 2) FrankenDrift.Adrift/clsUserSession.vb:6215— FrankenDrift.Adrift/clsUserSession.vb:6215-6222 | FrankenDrift.Adrift/clsUserSession.vb:6268-6275 — both copies are in the same file, so extract the block into 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) FrankenDrift.Adrift/clsVariable.vb:659— FrankenDrift.Adrift/clsVariable.vb:659-666 | FrankenDrift.Adrift/clsVariable.vb:746-755 — both copies are in the same file, so extract the 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) FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:601— FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:601-607 | FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:610-616 — both copies are in the same file, so extract the 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 `FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:601` 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 (7 lines × 2) FrankenDrift.Adrift/clsVariable.vb:931— FrankenDrift.Adrift/clsVariable.vb:931-937 | FrankenDrift.Adrift/clsVariable.vb:944-950 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Swallowed exception (empty catch) FrankenDrift.Runner/FrankenDrift.Runner.Mac/Program.cs:24— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) FrankenDrift.Runner/FrankenDrift.Runner.Mac/Program.cs:32— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
FileIO.Load500 (cyclomatic 570) FrankenDrift.Adrift/FileIO.vb:1200— FileIO.Load500 has cyclomatic complexity 570 (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.
RunnerSession.ExecuteSingleAction (cyclomatic 434) FrankenDrift.Adrift/clsUserSession.vb:1383— RunnerSession.ExecuteSingleAction has cyclomatic complexity 434 (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.
RunnerSession.PassSingleRestriction (cyclomatic 429) FrankenDrift.Adrift/clsUserSession.vb:4082— RunnerSession.PassSingleRestriction has cyclomatic complexity 429 (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.
SharedModule.ReplaceOOProperty (cyclomatic 389) FrankenDrift.Adrift/Global.vb:669— SharedModule.ReplaceOOProperty has cyclomatic complexity 389 (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.
SharedModule.ReplaceFunctions (cyclomatic 317) FrankenDrift.Adrift/Global.vb:1744— SharedModule.ReplaceFunctions has cyclomatic complexity 317 (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.
clsVariable.SetToExpression (cyclomatic 207) FrankenDrift.Adrift/clsVariable.vb:460— clsVariable.SetToExpression has cyclomatic complexity 207 (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.
RunnerSession.GetReference (cyclomatic 197) FrankenDrift.Adrift/clsUserSession.vb:3980— RunnerSession.GetReference has cyclomatic complexity 197 (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.
RunnerSession.AttemptToExecuteSubTask (cyclomatic 156) FrankenDrift.Adrift/clsUserSession.vb:956— RunnerSession.AttemptToExecuteSubTask has cyclomatic complexity 156 (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.
clsAction.Summary.Get (cyclomatic 147) FrankenDrift.Adrift/clsTask.vb:1189— clsAction.Summary.Get has cyclomatic complexity 147 (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.
clsRestriction.Summary.Get (cyclomatic 142) FrankenDrift.Adrift/clsTask.vb:636— clsRestriction.Summary.Get has cyclomatic complexity 142 (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.
clsVariable.GetToken (cyclomatic 109) FrankenDrift.Adrift/clsVariable.vb:127— clsVariable.GetToken has cyclomatic complexity 109 (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.
FileIO.LoadActions (cyclomatic 98) FrankenDrift.Adrift/FileIO.vb:218— FileIO.LoadActions has cyclomatic complexity 98 (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.
RunnerSession.GrabIt (cyclomatic 90) FrankenDrift.Adrift/clsUserSession.vb:2837— RunnerSession.GrabIt 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.
GlkHtmlWin.AppendHTML (cyclomatic 90) FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkHtmlWin.cs:205— GlkHtmlWin.AppendHTML has cyclomatic complexity 90 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
clsObject.GuessPluralFromNoun (cyclomatic 83) FrankenDrift.Adrift/clsObject.vb:36— clsObject.GuessPluralFromNoun has cyclomatic complexity 83 (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.
RunnerSession.RefineMatchingPossibilitesUsingRestrictions (cyclomatic 78) FrankenDrift.Adrift/clsUserSession.vb:5746— RunnerSession.RefineMatchingPossibilitesUsingRestrictions 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.
RunnerSession.AttemptToExecuteTask (cyclomatic 74) FrankenDrift.Adrift/clsUserSession.vb:723— RunnerSession.AttemptToExecuteTask has cyclomatic complexity 74 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
AdriftOutput.AppendHtml (cyclomatic 73) FrankenDrift.Runner/FrankenDrift.Runner/AdriftOutput.cs:101— AdriftOutput.AppendHtml has cyclomatic complexity 73 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
RunnerSession.InputMatchesCommand (cyclomatic 68) FrankenDrift.Adrift/clsUserSession.vb:5587— RunnerSession.InputMatchesCommand has cyclomatic complexity 68 (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.
RunnerSession.FindConversationNode (cyclomatic 64) FrankenDrift.Adrift/clsUserSession.vb:2493— RunnerSession.FindConversationNode has cyclomatic complexity 64 (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.
RunnerSession.NotUnderstood (cyclomatic 58) FrankenDrift.Adrift/clsUserSession.vb:3469— RunnerSession.NotUnderstood has cyclomatic complexity 58 (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.
clsCharacter.Name.Get (cyclomatic 57) FrankenDrift.Adrift/clsCharacter.vb:324— clsCharacter.Name.Get has cyclomatic complexity 57 (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.
StateStack.RestoreState (cyclomatic 53) FrankenDrift.Adrift/clsState.vb:241— StateStack.RestoreState has cyclomatic complexity 53 (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.
FileIO.LoadFile (cyclomatic 53) FrankenDrift.Adrift/FileIO.vb:676— FileIO.LoadFile has cyclomatic complexity 53 (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.
RunnerSession.EvaluateInput (cyclomatic 51) FrankenDrift.Adrift/clsUserSession.vb:3303— RunnerSession.EvaluateInput 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.
RunnerSession.GetGeneralTask (cyclomatic 46) FrankenDrift.Adrift/clsUserSession.vb:5977— RunnerSession.GetGeneralTask 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.
FileIO.LoadRestrictions (cyclomatic 43) FrankenDrift.Adrift/FileIO.vb:507— FileIO.LoadRestrictions 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.
clsAdventure.GetNameFromKey (cyclomatic 41) FrankenDrift.Adrift/clsAdventure.vb:399— clsAdventure.GetNameFromKey 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.
clsMap.UpdateMap (cyclomatic 40) FrankenDrift.Adrift/clsMap.vb:356— clsMap.UpdateMap 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.
AdriftMap.DrawNode (cyclomatic 39) FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:419— AdriftMap.DrawNode has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
AdriftMap.RecalculateLinks (cyclomatic 37) FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:225— AdriftMap.RecalculateLinks has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FileIO.LoadState (cyclomatic 37) FrankenDrift.Adrift/FileIO.vb:876— FileIO.LoadState 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.
FormChunk.LoadChunk (cyclomatic 34) FrankenDrift.Adrift/Blorb.vb:747— FormChunk.LoadChunk 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.
clsWalk.DoAnySteps (cyclomatic 34) FrankenDrift.Adrift/clsCharacter.vb:1480— clsWalk.DoAnySteps 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.
RunnerSession.SystemTasks (cyclomatic 34) FrankenDrift.Adrift/clsUserSession.vb:3615— RunnerSession.SystemTasks 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.
RunnerSession.OpenAdventure (cyclomatic 33) FrankenDrift.Adrift/clsUserSession.vb:157— RunnerSession.OpenAdventure 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.
clsProperty.PossibleValues.Get (cyclomatic 32) FrankenDrift.Adrift/clsProperty.vb:90— clsProperty.PossibleValues.Get 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.
Description.ToString.Get (cyclomatic 31) FrankenDrift.Adrift/Global.vb:3893— Description.ToString.Get 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.
FileIO.SaveState (cyclomatic 30) FrankenDrift.Adrift/FileIO.vb:51— FileIO.SaveState 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.
AdriftMap.DrawLinks (cyclomatic 29) FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:624— AdriftMap.DrawLinks has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
clsAdventure.GetTypeFromKey (cyclomatic 29) FrankenDrift.Adrift/clsAdventure.vb:336— clsAdventure.GetTypeFromKey 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.
clsProperty.Value.Set (cyclomatic 28) FrankenDrift.Adrift/clsProperty.vb:163— clsProperty.Value.Set has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
RunnerSession.ExecuteConversation (cyclomatic 28) FrankenDrift.Adrift/clsUserSession.vb:2393— RunnerSession.ExecuteConversation has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
clsObject.Location.Get (cyclomatic 27) FrankenDrift.Adrift/clsObject.vb:522— clsObject.Location.Get 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.
clsAdventure.GetTypeFromKeyNice (cyclomatic 26) FrankenDrift.Adrift/clsAdventure.vb:364— clsAdventure.GetTypeFromKeyNice 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.
clsMap.AddNode (cyclomatic 26) FrankenDrift.Adrift/clsMap.vb:516— clsMap.AddNode 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.
RunnerSession.UncompleteTask (cyclomatic 26) FrankenDrift.Adrift/clsUserSession.vb:1322— RunnerSession.UncompleteTask 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.
RunnerSession.DisplayAmbiguityQuestion (cyclomatic 26) FrankenDrift.Adrift/clsUserSession.vb:2712— RunnerSession.DisplayAmbiguityQuestion 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.
RunnerSession.PossibleKeys (cyclomatic 26) FrankenDrift.Adrift/clsUserSession.vb:3904— RunnerSession.PossibleKeys 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.
clsWalk.DoAnySubWalks (cyclomatic 24) FrankenDrift.Adrift/clsCharacter.vb:1580— clsWalk.DoAnySubWalks 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.
StateStack.GetState (cyclomatic 24) FrankenDrift.Adrift/clsState.vb:94— StateStack.GetState 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.
RunnerSession.PrepareForNextTurn (cyclomatic 24) FrankenDrift.Adrift/clsUserSession.vb:3771— RunnerSession.PrepareForNextTurn 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.
AdriftMap.GetLinkPoint (cyclomatic 23) FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:347— AdriftMap.GetLinkPoint has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: AdriftMap.GetBezierAssister (cyclomatic 25) 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.
clsLocation.ViewLocation.Get (cyclomatic 22) FrankenDrift.Adrift/clsLocation.vb:121— clsLocation.ViewLocation.Get 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.
clsLocation.ObjectsInLocation.Get (cyclomatic 21) FrankenDrift.Adrift/clsLocation.vb:214— clsLocation.ObjectsInLocation.Get 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.
clsObject.LocationRoots.Get (cyclomatic 21) FrankenDrift.Adrift/clsObject.vb:461— clsObject.LocationRoots.Get 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.
clsObject.BoundVisible.Get (cyclomatic 21) FrankenDrift.Adrift/clsObject.vb:777— clsObject.BoundVisible.Get 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.
clsObject.Children.Get (cyclomatic 21) FrankenDrift.Adrift/clsObject.vb:897— clsObject.Children.Get 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.
RunnerSession.InputMatchesObjects (cyclomatic 21) FrankenDrift.Adrift/clsUserSession.vb:5317— RunnerSession.InputMatchesObjects 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.
clsObject.ExistsAtLocation.Get (cyclomatic 20) FrankenDrift.Adrift/clsObject.vb:271— clsObject.ExistsAtLocation.Get 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.
clsAdventure.Tasks (cyclomatic 19) FrankenDrift.Adrift/clsAdventure.vb:512— clsAdventure.Tasks 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.
clsCharacter.Move (cyclomatic 19) FrankenDrift.Adrift/clsCharacter.vb:506— clsCharacter.Move 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.
clsEvent.DoAnySubEvents (cyclomatic 19) FrankenDrift.Adrift/clsEvent.vb:351— clsEvent.DoAnySubEvents 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.
RunnerSession.PrintOutReferences (cyclomatic 19) FrankenDrift.Adrift/clsUserSession.vb:2789— RunnerSession.PrintOutReferences 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.
RunnerSession.ExpandBlock (cyclomatic 19) FrankenDrift.Adrift/clsUserSession.vb:3249— RunnerSession.ExpandBlock 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.
SharedModule.EvaluateUDF (cyclomatic 19) FrankenDrift.Adrift/Global.vb:1666— SharedModule.EvaluateUDF 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: SharedModule.EnumParseCharacter (cyclomatic 28) 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.
RunnerSession.AmbWord (cyclomatic 18) FrankenDrift.Adrift/clsUserSession.vb:2656— RunnerSession.AmbWord 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: RunnerSession.GetReferenceKey (cyclomatic 19) 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.
RunnerSession.EvaluateRestrictionBlock (cyclomatic 18) FrankenDrift.Adrift/clsUserSession.vb:5190— RunnerSession.EvaluateRestrictionBlock 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: RunnerSession.GetReferenceKey (cyclomatic 19) 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.
RunnerSession.ProcessBlock (cyclomatic 18) FrankenDrift.Adrift/clsUserSession.vb:6248— RunnerSession.ProcessBlock 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: RunnerSession.GetReferenceKey (cyclomatic 19) 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.
clsCharacter.DeleteKey (cyclomatic 17) FrankenDrift.Adrift/clsCharacter.vb:1098— clsCharacter.DeleteKey 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.
clsCharacterLocation.ExistWhere.Set (cyclomatic 17) FrankenDrift.Adrift/clsCharacter.vb:1674— clsCharacterLocation.ExistWhere.Set 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.
ObjectHashTable.List (cyclomatic 17) FrankenDrift.Adrift/StronglyTypedCollections.vb:183— ObjectHashTable.List 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.
PropertyHashTable.ResetOrRemoveProperty (cyclomatic 17) FrankenDrift.Adrift/StronglyTypedCollections.vb:883— PropertyHashTable.ResetOrRemoveProperty 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.
AdriftMap.DrawInOutIcon (cyclomatic 16) FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:510— AdriftMap.DrawInOutIcon has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: AdriftMap.GetBezierAssister (cyclomatic 25) 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.
clsCharacter.sRegularExpressionString.Get (cyclomatic 16) FrankenDrift.Adrift/clsCharacter.vb:819— clsCharacter.sRegularExpressionString.Get 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.
clsCharacter.Children.Get (cyclomatic 16) FrankenDrift.Adrift/clsCharacter.vb:929— clsCharacter.Children.Get 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.
clsEvent.RunSubEvent (cyclomatic 16) FrankenDrift.Adrift/clsEvent.vb:381— clsEvent.RunSubEvent 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.
FileIO.Load500 (cognitive 1563) FrankenDrift.Adrift/FileIO.vb:1200— FileIO.Load500 has cognitive complexity 1563 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
SharedModule.ReplaceFunctions (cognitive 1527) FrankenDrift.Adrift/Global.vb:1744— SharedModule.ReplaceFunctions has cognitive complexity 1527 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RunnerSession.ExecuteSingleAction (cognitive 1132) FrankenDrift.Adrift/clsUserSession.vb:1383— RunnerSession.ExecuteSingleAction has cognitive complexity 1132 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RunnerSession.PassSingleRestriction (cognitive 921) FrankenDrift.Adrift/clsUserSession.vb:4082— RunnerSession.PassSingleRestriction has cognitive complexity 921 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
SharedModule.ReplaceOOProperty (cognitive 911) FrankenDrift.Adrift/Global.vb:669— SharedModule.ReplaceOOProperty has cognitive complexity 911 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
clsVariable.SetToExpression (cognitive 668) FrankenDrift.Adrift/clsVariable.vb:460— clsVariable.SetToExpression has cognitive complexity 668 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RunnerSession.GrabIt (cognitive 378) FrankenDrift.Adrift/clsUserSession.vb:2837— RunnerSession.GrabIt has cognitive complexity 378 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
FileIO.LoadActions (cognitive 291) FrankenDrift.Adrift/FileIO.vb:218— FileIO.LoadActions has cognitive complexity 291 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RunnerSession.RefineMatchingPossibilitesUsingRestrictions (cognitive 280) FrankenDrift.Adrift/clsUserSession.vb:5746— RunnerSession.RefineMatchingPossibilitesUsingRestrictions 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.
RunnerSession.AttemptToExecuteSubTask (cognitive 264) FrankenDrift.Adrift/clsUserSession.vb:956— RunnerSession.AttemptToExecuteSubTask has cognitive complexity 264 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RunnerSession.GetReference (cognitive 201) FrankenDrift.Adrift/clsUserSession.vb:3980— RunnerSession.GetReference has cognitive complexity 201 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RunnerSession.GetGeneralTask (cognitive 199) FrankenDrift.Adrift/clsUserSession.vb:5977— RunnerSession.GetGeneralTask has cognitive complexity 199 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
clsMap.UpdateMap (cognitive 198) FrankenDrift.Adrift/clsMap.vb:356— clsMap.UpdateMap has cognitive complexity 198 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RunnerSession.NotUnderstood (cognitive 195) FrankenDrift.Adrift/clsUserSession.vb:3469— RunnerSession.NotUnderstood has cognitive complexity 195 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RunnerSession.AttemptToExecuteTask (cognitive 188) FrankenDrift.Adrift/clsUserSession.vb:723— RunnerSession.AttemptToExecuteTask has cognitive complexity 188 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
StateStack.RestoreState (cognitive 163) FrankenDrift.Adrift/clsState.vb:241— StateStack.RestoreState has cognitive complexity 163 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
clsWalk.DoAnySteps (cognitive 150) FrankenDrift.Adrift/clsCharacter.vb:1480— clsWalk.DoAnySteps has cognitive complexity 150 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
clsAction.Summary.Get (cognitive 147) FrankenDrift.Adrift/clsTask.vb:1189— clsAction.Summary.Get has cognitive complexity 147 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
clsRestriction.Summary.Get (cognitive 145) FrankenDrift.Adrift/clsTask.vb:636— clsRestriction.Summary.Get has cognitive complexity 145 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
GlkHtmlWin.AppendHTML (cognitive 145) FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkHtmlWin.cs:205— GlkHtmlWin.AppendHTML has cognitive complexity 145 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RunnerSession.FindConversationNode (cognitive 128) FrankenDrift.Adrift/clsUserSession.vb:2493— RunnerSession.FindConversationNode has cognitive complexity 128 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
AdriftOutput.AppendHtml (cognitive 120) FrankenDrift.Runner/FrankenDrift.Runner/AdriftOutput.cs:101— AdriftOutput.AppendHtml 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.
clsVariable.GetToken (cognitive 115) FrankenDrift.Adrift/clsVariable.vb:127— clsVariable.GetToken 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.
RunnerSession.EvaluateInput (cognitive 99) FrankenDrift.Adrift/clsUserSession.vb:3303— RunnerSession.EvaluateInput has cognitive complexity 99 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RunnerSession.DisplayAmbiguityQuestion (cognitive 91) FrankenDrift.Adrift/clsUserSession.vb:2712— RunnerSession.DisplayAmbiguityQuestion has cognitive complexity 91 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Description.ToString.Get (cognitive 91) FrankenDrift.Adrift/Global.vb:3893— Description.ToString.Get has cognitive complexity 91 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
FileIO.LoadFile (cognitive 89) FrankenDrift.Adrift/FileIO.vb:676— FileIO.LoadFile has cognitive complexity 89 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
FileIO.LoadState (cognitive 87) FrankenDrift.Adrift/FileIO.vb:876— FileIO.LoadState has cognitive complexity 87 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RunnerSession.OpenAdventure (cognitive 82) FrankenDrift.Adrift/clsUserSession.vb:157— RunnerSession.OpenAdventure 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.
clsCharacter.Name.Get (cognitive 81) FrankenDrift.Adrift/clsCharacter.vb:324— clsCharacter.Name.Get 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.
FileIO.LoadRestrictions (cognitive 76) FrankenDrift.Adrift/FileIO.vb:507— FileIO.LoadRestrictions has cognitive complexity 76 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RunnerSession.PossibleKeys (cognitive 75) FrankenDrift.Adrift/clsUserSession.vb:3904— RunnerSession.PossibleKeys 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.
RunnerSession.InputMatchesObjects (cognitive 73) FrankenDrift.Adrift/clsUserSession.vb:5317— RunnerSession.InputMatchesObjects 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.
clsMap.AddNode (cognitive 72) FrankenDrift.Adrift/clsMap.vb:516— clsMap.AddNode 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.
RunnerSession.UncompleteTask (cognitive 71) FrankenDrift.Adrift/clsUserSession.vb:1322— RunnerSession.UncompleteTask 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.
SharedModule.EvaluateUDF (cognitive 71) FrankenDrift.Adrift/Global.vb:1666— SharedModule.EvaluateUDF 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.
RunnerSession.InputMatchesCommand (cognitive 70) FrankenDrift.Adrift/clsUserSession.vb:5587— RunnerSession.InputMatchesCommand 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.
RunnerSession.SystemTasks (cognitive 65) FrankenDrift.Adrift/clsUserSession.vb:3615— RunnerSession.SystemTasks 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.
RunnerSession.AmbWord (cognitive 61) FrankenDrift.Adrift/clsUserSession.vb:2656— RunnerSession.AmbWord 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.
AdriftMap.DrawNode (cognitive 57) FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:419— AdriftMap.DrawNode has cognitive complexity 57 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FileIO.SaveState (cognitive 56) FrankenDrift.Adrift/FileIO.vb:51— FileIO.SaveState has cognitive complexity 56 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
clsCharacter.Children.Get (cognitive 52) FrankenDrift.Adrift/clsCharacter.vb:929— clsCharacter.Children.Get 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.
RunnerSession.ExecuteConversation (cognitive 51) FrankenDrift.Adrift/clsUserSession.vb:2393— RunnerSession.ExecuteConversation 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.
clsAdventure.GetTypeFromKeyNice (cognitive 50) FrankenDrift.Adrift/clsAdventure.vb:364— clsAdventure.GetTypeFromKeyNice 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.
clsWalk.DoAnySubWalks (cognitive 50) FrankenDrift.Adrift/clsCharacter.vb:1580— clsWalk.DoAnySubWalks 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.
clsProperty.PossibleValues.Get (cognitive 49) FrankenDrift.Adrift/clsProperty.vb:90— clsProperty.PossibleValues.Get has cognitive complexity 49 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RunnerSession.RefsMatchSpecifics (cognitive 49) FrankenDrift.Adrift/clsUserSession.vb:600— RunnerSession.RefsMatchSpecifics has cognitive complexity 49 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RunnerSession.ExpandBlock (cognitive 48) FrankenDrift.Adrift/clsUserSession.vb:3249— RunnerSession.ExpandBlock 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.
ObjectHashTable.List (cognitive 48) FrankenDrift.Adrift/StronglyTypedCollections.vb:183— ObjectHashTable.List 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.
AdriftMap.RecalculateLinks (cognitive 47) FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:225— AdriftMap.RecalculateLinks has cognitive complexity 47 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
clsAdventure.Tasks (cognitive 46) FrankenDrift.Adrift/clsAdventure.vb:512— clsAdventure.Tasks 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.
RunnerSession.PrintOutReferences (cognitive 46) FrankenDrift.Adrift/clsUserSession.vb:2789— RunnerSession.PrintOutReferences 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.
RunnerSession.ProcessBlock (cognitive 46) FrankenDrift.Adrift/clsUserSession.vb:6248— RunnerSession.ProcessBlock 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.
clsCharacter.Move (cognitive 45) FrankenDrift.Adrift/clsCharacter.vb:506— clsCharacter.Move 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.
StateStack.GetState (cognitive 45) FrankenDrift.Adrift/clsState.vb:94— StateStack.GetState 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.
clsAdventure.GetNameFromKey (cognitive 44) FrankenDrift.Adrift/clsAdventure.vb:399— clsAdventure.GetNameFromKey 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.
RunnerSession.ResolveAmbiguity (cognitive 43) FrankenDrift.Adrift/clsUserSession.vb:3845— RunnerSession.ResolveAmbiguity has cognitive complexity 43 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
RunnerSession.EvaluateRestrictionBlock (cognitive 42) FrankenDrift.Adrift/clsUserSession.vb:5190— RunnerSession.EvaluateRestrictionBlock 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.
clsEvent.DoAnySubEvents (cognitive 41) FrankenDrift.Adrift/clsEvent.vb:351— clsEvent.DoAnySubEvents 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.
RunnerSession.PrepareForNextTurn (cognitive 38) FrankenDrift.Adrift/clsUserSession.vb:3771— RunnerSession.PrepareForNextTurn 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.
clsLocation.ObjectsInLocation.Get (cognitive 37) FrankenDrift.Adrift/clsLocation.vb:214— clsLocation.ObjectsInLocation.Get 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.
clsObject.Children.Get (cognitive 37) FrankenDrift.Adrift/clsObject.vb:897— clsObject.Children.Get 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.
clsLocation.ViewLocation.Get (cognitive 36) FrankenDrift.Adrift/clsLocation.vb:121— clsLocation.ViewLocation.Get 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.
clsObject.Location.Get (cognitive 35) FrankenDrift.Adrift/clsObject.vb:522— clsObject.Location.Get has cognitive complexity 35 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
clsProperty.Value.Set (cognitive 34) FrankenDrift.Adrift/clsProperty.vb:163— clsProperty.Value.Set 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.
RunnerSession.InputMatchesObject (cognitive 34) FrankenDrift.Adrift/clsUserSession.vb:5390— RunnerSession.InputMatchesObject 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.
clsCharacter.DeleteKey (cognitive 33) FrankenDrift.Adrift/clsCharacter.vb:1098— clsCharacter.DeleteKey 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.
RunnerSession.RefsMatchSpecificsOld (cognitive 33) FrankenDrift.Adrift/clsUserSession.vb:654— RunnerSession.RefsMatchSpecificsOld 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.
RunnerSession.ProcessBlockOld (cognitive 32) FrankenDrift.Adrift/clsUserSession.vb:6199— RunnerSession.ProcessBlockOld 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.
clsEvent.RunSubEvent (cognitive 30) FrankenDrift.Adrift/clsEvent.vb:381— clsEvent.RunSubEvent 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.
clsObject.ExistsAtLocation.Get (cognitive 30) FrankenDrift.Adrift/clsObject.vb:271— clsObject.ExistsAtLocation.Get 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.
clsObject.DisplayCharacterChildren (cognitive 29) FrankenDrift.Adrift/clsObject.vb:364— clsObject.DisplayCharacterChildren 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.
PropertyHashTable.ResetOrRemoveProperty (cognitive 29) FrankenDrift.Adrift/StronglyTypedCollections.vb:883— PropertyHashTable.ResetOrRemoveProperty 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.
AdriftMap.DrawLinks (cognitive 28) FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:624— AdriftMap.DrawLinks has cognitive complexity 28 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
clsCharacter.sRegularExpressionString.Get (cognitive 28) FrankenDrift.Adrift/clsCharacter.vb:819— clsCharacter.sRegularExpressionString.Get 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.
clsCharacter.DoWalk (cognitive 27) FrankenDrift.Adrift/clsCharacter.vb:66— clsCharacter.DoWalk 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.
RunnerSession.InputMatchesLocation (cognitive 27) FrankenDrift.Adrift/clsUserSession.vb:5457— RunnerSession.InputMatchesLocation 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 (RunnerSession.InputMatchesCharacter) 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.
RunnerSession.InputMatchesCharacter (cognitive 27) FrankenDrift.Adrift/clsUserSession.vb:5495— RunnerSession.InputMatchesCharacter 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 (RunnerSession.InputMatchesLocation) 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.
clsObject.LocationRoots.Get (cognitive 26) FrankenDrift.Adrift/clsObject.vb:461— clsObject.LocationRoots.Get 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.
clsTask.TaskCommand (cognitive 26) FrankenDrift.Adrift/clsTask.vb:220— clsTask.TaskCommand 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.
GlkHtmlWin.DumpCurrentStyleInfo (cognitive 25) FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkHtmlWin.cs:561— GlkHtmlWin.DumpCurrentStyleInfo has cognitive complexity 25 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AdriftMap.DrawInOutIcon (cognitive 23) FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:510— AdriftMap.DrawInOutIcon has cognitive complexity 23 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
clsObject.DisplayObjectChildren (cognitive 23) FrankenDrift.Adrift/clsObject.vb:410— clsObject.DisplayObjectChildren 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.
RunnerSession.ExecuteSubTasks (cognitive 23) FrankenDrift.Adrift/clsUserSession.vb:695— RunnerSession.ExecuteSubTasks 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.
clsEvent.lStart (cognitive 22) FrankenDrift.Adrift/clsEvent.vb:202— clsEvent.lStart 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.
clsAdventure.Images.Get (cognitive 21) FrankenDrift.Adrift/clsAdventure.vb:191— clsAdventure.Images.Get 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.
clsCharacter.ChildrenObjects.Get (cognitive 21) FrankenDrift.Adrift/clsCharacter.vb:641— clsCharacter.ChildrenObjects.Get 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.
clsCharacter.ReferencesKey (cognitive 21) FrankenDrift.Adrift/clsCharacter.vb:1065— clsCharacter.ReferencesKey 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.
clsItemWithProperties.htblInheritedProperties.Get (cognitive 21) FrankenDrift.Adrift/clsItem.vb:273— clsItemWithProperties.htblInheritedProperties.Get 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.
SharedModule.ReplaceALRs (cognitive 21) FrankenDrift.Adrift/Global.vb:532— SharedModule.ReplaceALRs 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.
clsCharacter.Dijkstra (cognitive 20) FrankenDrift.Adrift/clsCharacter.vb:114— clsCharacter.Dijkstra 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.
clsCharacter.HasRouteInDirection (cognitive 20) FrankenDrift.Adrift/clsCharacter.vb:665— clsCharacter.HasRouteInDirection 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.
clsObject.GuessPluralFromNoun (cognitive 20) FrankenDrift.Adrift/clsObject.vb:36— clsObject.GuessPluralFromNoun 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.
clsCharacterLocation.ExistWhere.Set (cognitive 19) FrankenDrift.Adrift/clsCharacter.vb:1674— clsCharacterLocation.ExistWhere.Set 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.
clsItem.FindStringInDescription (cognitive 19) FrankenDrift.Adrift/clsItem.vb:212— clsItem.FindStringInDescription 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.
clsObject.Move (cognitive 19) FrankenDrift.Adrift/clsObject.vb:863— clsObject.Move 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.
AdriftMap.RecalculateNode (cognitive 18) FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:185— AdriftMap.RecalculateNode has cognitive complexity 18 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AdriftOutput.SendToAnotherWindow (cognitive 18) FrankenDrift.Runner/FrankenDrift.Runner/AdriftOutput.cs:360— AdriftOutput.SendToAnotherWindow has cognitive complexity 18 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
clsCharacterLocation.Key.Get (cognitive 18) FrankenDrift.Adrift/clsCharacter.vb:1737— clsCharacterLocation.Key.Get 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.
clsObject.sRegularExpressionString.Get (cognitive 18) FrankenDrift.Adrift/clsObject.vb:694— clsObject.sRegularExpressionString.Get 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.
RunnerSession.UpdateStatusBar (cognitive 18) FrankenDrift.Adrift/clsUserSession.vb:3692— RunnerSession.UpdateStatusBar 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.
PropertyHashTable.DeleteKey (cognitive 18) FrankenDrift.Adrift/StronglyTypedCollections.vb:937— PropertyHashTable.DeleteKey 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.
AdriftMap.GetLinkPoint (cognitive 17) FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:347— AdriftMap.GetLinkPoint has cognitive complexity 17 (threshold 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
clsCharacter.HeldObjects.Get (cognitive 17) FrankenDrift.Adrift/clsCharacter.vb:973— clsCharacter.HeldObjects.Get 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. This shape REPEATS in the file: one other method here (clsCharacter.WornObjects.Get) 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.
clsCharacter.WornObjects.Get (cognitive 17) FrankenDrift.Adrift/clsCharacter.vb:994— clsCharacter.WornObjects.Get 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. This shape REPEATS in the file: one other method here (clsCharacter.HeldObjects.Get) 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.
clsWalk.GetDefaultDescription (cognitive 17) FrankenDrift.Adrift/clsCharacter.vb:1284— clsWalk.GetDefaultDescription 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.
clsItem.GenerateKey.Get (cognitive 17) FrankenDrift.Adrift/clsItem.vb:13— clsItem.GenerateKey.Get 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.
Specific.List (cognitive 17) FrankenDrift.Adrift/clsTask.vb:97— Specific.List 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.
SharedModule.ReplaceOO (cognitive 17) FrankenDrift.Adrift/Global.vb:632— SharedModule.ReplaceOO 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.
clsBlorb.GetImage (cognitive 16) FrankenDrift.Adrift/Blorb.vb:27— clsBlorb.GetImage 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. This shape REPEATS in the file: one other method here (clsBlorb.GetSound) 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.
clsBlorb.GetSound (cognitive 16) FrankenDrift.Adrift/Blorb.vb:80— clsBlorb.GetSound 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. This shape REPEATS in the file: one other method here (clsBlorb.GetImage) 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.
FormChunk.WriteChunk (cognitive 16) FrankenDrift.Adrift/Blorb.vb:794— FormChunk.WriteChunk 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.
RunnerSession.LoadMacros (cognitive 16) FrankenDrift.Adrift/clsUserSession.vb:121— RunnerSession.LoadMacros 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.
RunnerSession.bHasOutput (cognitive 16) FrankenDrift.Adrift/clsUserSession.vb:1272— RunnerSession.bHasOutput 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.
GlkHtmlWin.GetLineInput (cognitive 16) FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkHtmlWin.cs:127— GlkHtmlWin.GetLineInput has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (24–31 lines × 2) FrankenDrift.Adrift/clsUserSession.vb:6221— FrankenDrift.Adrift/clsUserSession.vb:6221-6244 | FrankenDrift.Adrift/clsUserSession.vb:6276-6306 — both copies are in the same file, so extract the block into 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) FrankenDrift.Adrift/clsUserSession.vb:5886— FrankenDrift.Adrift/clsUserSession.vb:5886-5905 | FrankenDrift.Adrift/clsUserSession.vb:5940-5959 — both copies are in the same file, so extract the 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 (18 lines × 2) FrankenDrift.Adrift/clsUserSession.vb:870— FrankenDrift.Adrift/clsUserSession.vb:870-887 | FrankenDrift.Adrift/clsUserSession.vb:891-908 — both copies are in the same file, so extract the block into 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) FrankenDrift.Adrift/clsUserSession.vb:3646— FrankenDrift.Adrift/clsUserSession.vb:3646-3661 | FrankenDrift.Adrift/clsUserSession.vb:3668-3683 — both copies are in the same file, so extract the block into 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–16 lines × 2) FrankenDrift.Adrift/clsVariable.vb:842— FrankenDrift.Adrift/clsVariable.vb:842-855 | FrankenDrift.Adrift/clsVariable.vb:904-919 — both copies are in the same file, so extract the block into 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–15 lines × 3) FrankenDrift.Adrift/clsTask.vb:1230— FrankenDrift.Adrift/clsTask.vb:1230-1244 | FrankenDrift.Adrift/clsTask.vb:1312-1325 | FrankenDrift.Adrift/clsTask.vb:1385-1398 — 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 (15 lines × 2) FrankenDrift.Adrift/FileIO.vb:725— FrankenDrift.Adrift/FileIO.vb:725-739 | FrankenDrift.Adrift/FileIO.vb:765-779 — both copies are in the same file, so extract the block into 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) FrankenDrift.Adrift/clsUserSession.vb:1328— FrankenDrift.Adrift/clsUserSession.vb:1328-1341 | FrankenDrift.Adrift/clsUserSession.vb:1345-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 × 3) FrankenDrift.Adrift/FileIO.vb:71— FrankenDrift.Adrift/FileIO.vb:71-83 | FrankenDrift.Adrift/FileIO.vb:95-107 | FrankenDrift.Adrift/FileIO.vb:154-166 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (12 lines × 2) FrankenDrift.Adrift/clsUserSession.vb:5835— FrankenDrift.Adrift/clsUserSession.vb:5835-5846 | FrankenDrift.Adrift/clsUserSession.vb:5951-5962 — both copies are in the same file, so extract the block into 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 × 3) FrankenDrift.Adrift/clsUserSession.vb:5833— FrankenDrift.Adrift/clsUserSession.vb:5833-5843 | FrankenDrift.Adrift/clsUserSession.vb:5895-5905 | FrankenDrift.Adrift/clsUserSession.vb:5948-5959 — 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 (10 lines × 3) FrankenDrift.Adrift/FileIO.vb:267— FrankenDrift.Adrift/FileIO.vb:267-276 | FrankenDrift.Adrift/FileIO.vb:305-314 | FrankenDrift.Adrift/FileIO.vb:332-341 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 3) FrankenDrift.Adrift/clsVariable.vb:690— FrankenDrift.Adrift/clsVariable.vb:690-698 | FrankenDrift.Adrift/clsVariable.vb:845-855 | FrankenDrift.Adrift/clsVariable.vb:907-919 — 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 (9 lines × 2) FrankenDrift.Adrift/clsUserSession.vb:5861— FrankenDrift.Adrift/clsUserSession.vb:5861-5869 | FrankenDrift.Adrift/clsUserSession.vb:5927-5936 — both copies are in the same file, so extract the block into 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 × 3) FrankenDrift.Adrift/FileIO.vb:453— FrankenDrift.Adrift/FileIO.vb:453-458 | FrankenDrift.Adrift/FileIO.vb:469-474 | FrankenDrift.Adrift/FileIO.vb:479-484 — 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, `FrankenDrift.Adrift/FileIO.vb:467` calls `sElements` and `FrankenDrift.Adrift/FileIO.vb:477` 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.
Off the main sequence: FrankenDrift.Adrift — FrankenDrift.Adrift: abstractness 0.02, instability 0.11, distance 0.86 — zone of pain — concrete and depended on by 8 project(s), so it's rigid to change.
IC1 · Incompleteness & stubs· Both branches open with the same statements · ×1
Both branches open with the same statements — the condition does not decide them FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkSession.cs:329— The first 2 statements of the `if` and of the `else` are identical, so they run on both paths regardless of the condition. Lift them above the `if` — leaving them duplicated inside makes the branches read as though they handled this differently.
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.
X5 · Nullable reference types· Null guard scopes only part of the work it protects · ×1
Null guard scopes only part of the work it protects FrankenDrift.Runner/FrankenDrift.Runner/AdriftMap.cs:601— This method contradicts itself about `node`: line 573 tests it for null before doing anything with it — the author's own statement that null is an input this code expects — but that `if` scopes only the block beneath it, and line 601 then dereferences `node` as `node.eInEdge` AFTER the block has closed, where the guard no longer applies. A null `node` skips the guarded body and reaches that line anyway, throwing NullReferenceException on exactly the input the guard was written for. If the dereference belongs to the guarded work, move it inside the block; if `node` truly cannot be null by then, the guard above is misleading and should go.
Fat interface: UIGlue (18 members) FrankenDrift.Glue/UIGlue.cs:12— `UIGlue` declares 18 members: `ErrMsg`, `MakeNote`, `EnableButtons`, `SetGameName`, `ScrollToEnd`, `AskYesNoQuestion`, `ShowInfo`, `QuerySavePath`, `QueryRestorePath`, `QuerySaveBeforeQuit`, `OutputHTML`, `InitInput`, `ShowCoverArt`, `DoEvents`, `GetAppDataPath`, `GetExecutableLocation`, `GetExecutablePath`, `GetClaimedAdriftVersion`. 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.
Fat interface: IGlk (52 members) FrankenDrift.GlkRunner/FrankenDrift.GlkRunner/GlkApi.cs:229— `IGlk` declares 52 members: `giblorb_set_resource_map`, `glk_cancel_hyperlink_event`, `glk_cancel_line_event`, `glk_exit`, `glk_fileref_create_by_name`, `glk_fileref_create_by_prompt`, `glk_fileref_create_temp`, `glk_fileref_destroy`, `glk_image_draw`, `glk_image_get_info`, `glk_put_buffer`, `glk_put_buffer_stream`, `glk_put_buffer_uni`, `glk_request_char_event`, `glk_request_hyperlink_event`, `glk_request_line_event`, `glk_request_line_event_uni`, `glk_schannel_create`, `glk_schannel_destroy`, `glk_schannel_pause`, `glk_schannel_play`, `glk_schannel_play_ext`, `glk_schannel_set_volume`, `glk_schannel_stop`, `glk_schannel_unpause`, `glk_select`, `glk_set_hyperlink`, `glk_set_style`, `glk_set_window`, `glk_stream_open_file`, `glk_stream_open_memory`, `glk_stream_close`, `glk_stream_set_position`, `glk_stylehint_set`, `glk_style_measure`, `glk_tick`, `glk_window_clear`, `glk_window_close`, `glk_window_flow_break`, `glk_window_get_size`, and 12 more. 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 installation or build instructions README.md— Installation instructions are sparse and non-unique: each platform (Windows/macOS/Linux) is described with a one-line run command but no build steps, and there is no guidance for the framework-dependent Gtk runner. Expand installation to include how to get dependencies installed on each OS and why the framework-dependent version is still experimental.
Documentation: no usage examples README.md— The body contains only a 'Known limitations' section; there are no runnable examples showing how to create or run a game. Add a short usage example (e.g. a one-line command for the Gtk runner) demonstrating the workflow.
Thin analysable surface across projects — 3 project(s) carry only a thin slice of real code (e.g. `FrankenDrift.Runner.Gtk` with 21 significant line(s)). The mean analysable-surface weight is 82 %, lowering Solution Shape by about 1.48 point(s). Consolidate thin projects or grow them into substantial, well-scoped assemblies.
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/`.
D21 · Naming Consistency· Inconsistent naming for application path properties/methods. `Application.ExecutablePath` and `Application.StartupPath` use noun phrases for properties, while `MainSession.GetExecutableLocation` uses a verb phrase and a different term ('Location' vs 'Path'). These likely refer to similar or overlapping concepts regarding the application's file location. · ×1
Inconsistent naming for application path properties/methods. `Application.ExecutablePath` and `Application.StartupPath` use noun phrases for properties, while `MainSession.GetExecutableLocation` uses a verb phrase and a different term ('Location' vs 'Path'). These likely refer to similar or overlapping concepts regarding the application's file location. — Standardize on `ExecutablePath` or `ApplicationPath` across the codebase. If `StartupPath` and `ExecutablePath` are distinct, ensure `GetExecutableLocation` is renamed to `GetExecutablePath` or `GetStartupPath` to match the noun-phrase convention of the properties. (symbols: FrankenDrift.Glue.Application.ExecutablePath, FrankenDrift.Glue.Application.StartupPath, FrankenDrift.GlkRunner.MainSession.GetExecutableLocation)
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 1 of 10 project(s) overshoot their size bounds, lowering Project Cohesion to 8.0/10. The most over is `FrankenDrift.Adrift` (22240 LoC, 136 public types across 1 namespaces). Review these for cohesion — split a project that spans unrelated responsibilities.
No tests found — No test suite could be collected — no discoverable tests to count. If this repository does test, wiring the suite to a framework a runner can collect (xUnit, NUnit or MSTest) is what makes it countable here; a pipeline step that invokes a runner is not evidence on its own, because a runner over an empty suite passes. Tests written as plain executables or shell/PowerShell harnesses are not collectible this way and are not scored here.
Commented-out code FrankenDrift.GlkRunner/FrankenDrift.GlkRunner.Gargoyle/Main.cs:235— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
IC1 · Incompleteness & stubs· Empty method body · ×1
Empty method body FrankenDrift.Glue/Util.cs:22— `AddPrevious` has an empty body — confirm it's an intentional no-op and not an unfinished method.
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.
No src/ separation — Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
P1 · CI/CD gates· CI test execution not evidenced · ×1
CI test execution not evidenced — A CI pipeline exists but no test-runner invocation (your stack's test command, or a test job) was found — changes may merge without the suite running.
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 as a CI step. What was searched, so you can tell an absence from a miss: the 1063 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.)
Nullable reference types not enabled everywhere — 3/9 NRT-eligible project(s) enable <Nullable>enable</Nullable> (projects targeting a pre-C#-8 framework are excluded — NRTs aren't available there). NRTs catch a whole class of null-deref bugs at compile time.
Null-forgiving operator (`!`) suppressions reduce the NRT score — ~0.7 `!` suppressions per 1k syntax nodes — 8 suppression(s) across the 10850 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a `!` can suppress anything in (a `!` under `#nullable disable` is inert and is not counted, and its file's nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide.
Outdated: Eto.Forms — Eto.Forms 2.10.2 → 2.12.0 available (referenced by FrankenDrift.Runner).
Outdated: Eto.Platform.Gtk — Eto.Platform.Gtk 2.10.2 → 2.12.0 available (referenced by FrankenDrift.Runner.Gtk).
Outdated: Eto.Platform.Mac64 — Eto.Platform.Mac64 2.10.2 → 2.12.0 available (referenced by FrankenDrift.Runner.Mac).
Outdated: Eto.Platform.Windows — Eto.Platform.Windows 2.10.2 → 2.12.0 available (referenced by FrankenDrift.Runner.Win).
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 1 file(s) — `FrankenDrift.Runner/FrankenDrift.Runner/AdriftOutput.cs` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
provenance: not applicable — The CI pipeline builds and tests but publishes no released artifact — no package publish, container push, GitHub release or deployment step. Supply-chain provenance, signing and SBOM attest RELEASED artifacts, so there is nothing to attest here. Add them to the release pipeline when this repo starts shipping artifacts (a published package, a container image, a deployed service or a tagged release).
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 01a0f7e6-5d8b-7894-aa59-eb71b7fb304b · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 5 · Warnings: 328 · Recommendations: 19 · Info: 13 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 01-10-2026 @ 14:37 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.